Datasets:
ONLYSLIME
/
AOJ-CodeRank-Benchmark

Dataset card Data Studio Files
xet
Community
1
group_id
stringlengths
12
18
problem_description
stringlengths
85
3.02k
candidates
listlengths
3
20
aoj_0400_cpp
Maze & Items Maze & Items is a puzzle game in which the player tries to reach the goal while collecting items. The maze consists of $W \times H$ grids, and some of them are inaccessible to the player depending on the items he/she has now. The score the player earns is defined according to the order of collecting items. The objective of the game is, after starting from a defined point, to collect all the items using the least number of moves before reaching the goal. There may be multiple routes that allow the least number of moves. In that case, the player seeks to maximize his/her score. One of the following symbols is assigned to each of the grids. You can move to one of the neighboring grids (horizontally or vertically, but not diagonally) in one time, but you cannot move to the area outside the maze. Symbol Description . Always accessible # Always inaccessible Number 0 , 1 ,.., 9 Always accessible and an item (with its specific number) is located in the grid. Capital letter A , B , ..., J Accessible only when the player does NOT have the corresponding item. Each of A , B , ..., J takes a value from 0 to 9 . Small letter a , b , ..., j Accessible only when the player DOES have the corresponding item. Each of a , b , ..., j takes one value from 0 to 9 . S Starting grid. Always accessible. T Goal grid. Always accessible. The player fails to complete the game if he/she has not collected all the items before reaching the goal. When entering a grid in which an item is located, it’s the player’s option to collect it or not. The player must keep the item once he/she collects it, and it disappears from the maze. Given the state information of the maze and a table that defines the collecting order dependent scores, make a program that works out the minimum number of moves required to collect all the items before reaching the goal, and the maximum score gained through performing the moves. Input The input is given in the following format. $W$ $H$ $row_1$ $row_2$ ... $row_H$ $s_{00}$ $s_{01}$ ... $s_{09}$ $s_{10}$ $s_{11}$ ... $s_{19}$ ... $s_{90}$ $s_{91}$ ... $s_{99}$ The first line provides the number of horizontal and vertical grids in the maze $W$ ($4 \leq W \leq 1000$) and $H$ ($4 \leq H \leq 1000$). Each of the subsequent $H$ lines provides the information on the grid $row_i$ in the $i$-th row from the top of the maze, where $row_i$ is a string of length $W$ defined in the table above. A letter represents a grid. Each of the subsequent 10 lines provides the table that defines collecting order dependent scores. An element in the table $s_{ij}$ ($0 \leq s_{ij} \leq 100$) is an integer that defines the score when item $j$ is collected after the item $i$ (without any item between them). Note that $s_{ii} = 0$. The grid information satisfies the following conditions: Each of S , T , 0 , 1 , ..., 9 appears in the maze once and only once. Each of A , B , ..., J , a , b , ..., j appears in the maze no more than once. Output Output two items in a line sepa ...(truncated)
[ { "submission_id": "aoj_0400_10272755", "code_snippet": "// AOJ #400 Maze and Items\n// 2025.3.7\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Edge { int d, req; };\nstruct State { int r, c, req, d; };\n\nint W, H;\npair<int,int> keyPos[12];\nint scoreTab[10][10];\nvector<Edge> edgeCandidate[12][12];\nvector<string> maze;\n\ninline int cellId(int r, int c) { return r * W + c; }\ninline bool isLetter(char ch) { return (ch >= 'A' && ch <= 'J') || (ch >= 'a' && ch <= 'j'); }\ninline int letterId(char ch) {\n if(ch >= 'A' && ch <= 'J') return ch - 'A';\n return ch - 'a';\n}\ninline bool subset(int a, int b) { return (a & ~b) == 0; }\n\nvoid bfsForKey(int k) {\n int sr = keyPos[k].first, sc = keyPos[k].second;\n int tot = W * H;\n vector<vector<pair<int,int>>> vis(tot);\n deque<State> dq;\n dq.push_back({sr, sc, 0, 0});\n vis[cellId(sr,sc)].push_back({0, 0});\n\n int dr[4] = {1,-1,0,0}, dc[4] = {0,0,1,-1};\n const int mask = (1<<10)-1;\n\n while(!dq.empty()){\n State s = dq.front(); dq.pop_front();\n int id = cellId(s.r, s.c);\n char ch = maze[s.r][s.c];\n if((ch=='S' || ch=='T' || (ch>='0' && ch<='9')) && !(s.r==sr && s.c==sc)){\n int idx = -1;\n if(ch=='S') idx = 0;\n else if(ch=='T') idx = 11;\n else idx = (ch - '0') + 1;\n edgeCandidate[k][idx].push_back({s.d, s.req});\n }\n\n for(int i=0; i<4; i++){\n int nr = s.r + dr[i], nc = s.c + dc[i];\n if(nr < 0 || nr >= H || nc < 0 || nc >= W) continue;\n char ncCh = maze[nr][nc];\n if(ncCh=='#') continue;\n\n int nreq = s.req;\n if(isLetter(ncCh)){\n int idd = letterId(ncCh);\n int r0 = nreq & mask, r1 = nreq >> 10;\n if(ncCh >= 'A' && ncCh <= 'J'){\n if(r1 & (1<<idd)) continue;\n r0 |= (1<<idd);\n } else {\n if(r0 & (1<<idd)) continue;\n r1 |= (1<<idd);\n }\n nreq = (r1 << 10) | r0;\n }\n\n int nd = s.d + 1;\n int cid = cellId(nr, nc);\n\n bool skip = false;\n for(auto &p : vis[cid]){\n int r_old = p.first, d_old = p.second;\n int r0_old = r_old & mask, r1_old = r_old >> 10;\n int r0_new = nreq & mask, r1_new = nreq >> 10;\n if(d_old <= nd && subset(r0_old, r0_new) && subset(r1_old, r1_new)){\n skip = true;\n break;\n }\n }\n if(skip) continue;\n\n for(auto it = vis[cid].begin(); it != vis[cid].end(); ){\n int r_old = it->first, d_old = it->second;\n int r0_old = r_old & mask, r1_old = r_old >> 10;\n int r0_new = nreq & mask, r1_new = nreq >> 10;\n if(nd <= d_old && subset(r0_new, r0_old) && subset(r1_new, r1_old))\n it = vis[cid].erase(it);\n else it++;\n }\n vis[cid].push_back({nreq, nd});\n dq.push_back({nr, nc, nreq, nd});\n }\n }\n}\n\nstruct StateDP { int m, v, d, sc; };\n\nstruct cmpDP {\n bool operator()(const StateDP &a, const StateDP &b) const {\n if(a.d != b.d) return a.d > b.d;\n return a.sc < b.sc;\n }\n};\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n cin >> W >> H;\n maze.resize(H);\n for (int i=0; i<H; i++) cin >> maze[i];\n for (int i=0; i<12; i++) keyPos[i] = {-1,-1};\n for (int r=0; r<H; r++){\n for (int c=0; c<W; c++){\n char ch = maze[r][c];\n if(ch=='S') keyPos[0] = {r,c};\n else if(ch=='T') keyPos[11] = {r,c};\n else if(ch>='0' && ch<='9'){\n int id = ch - '0';\n keyPos[id+1] = {r,c};\n }\n }\n }\n for (int i=0; i<10; i++){\n for (int j=0; j<10; j++) cin >> scoreTab[i][j];\n }\n for (int i=0; i<12; i++) bfsForKey(i);\n const int FULL = (1<<10)-1;\n const int INF = 1e9;\n vector<vector<pair<int,int>>> dp(1<<10, vector<pair<int,int>>(12, {INF, -1000000000}));\n dp[0][0] = {0, 0};\n\n priority_queue<StateDP, vector<StateDP>, cmpDP> pq;\n pq.push({0, 0, 0, 0});\n while(!pq.empty()){\n auto st = pq.top(); pq.pop();\n int m = st.m, v = st.v, d = st.d, sc = st.sc;\n if(d != dp[m][v].first || sc != dp[m][v].second) continue;\n if(v==11 && m==FULL){\n cout << d << \" \" << sc << endl;\n return 0;\n }\n\n for (int nv = 1; nv <= 10; nv++){\n int bit = nv - 1;\n if(m & (1<<bit)) continue;\n for(auto &ed : edgeCandidate[v][nv]){\n int r0 = ed.req & ((1<<10)-1), r1 = ed.req >> 10;\n if((m & r1) != r1) continue;\n if(((~m) & r0) != r0) continue;\n int nd = d + ed.d;\n int nsc = sc;\n if(v >= 1) nsc += scoreTab[v-1][bit];\n int nm = m | (1<<bit);\n if(nd < dp[nm][nv].first || (nd == dp[nm][nv].first && nsc > dp[nm][nv].second)){\n dp[nm][nv] = {nd, nsc};\n pq.push({nm, nv, nd, nsc});\n }\n }\n }\n if(m == FULL){\n for(auto &ed : edgeCandidate[v][11]){\n int r0 = ed.req & ((1<<10)-1), r1 = ed.req >> 10;\n if((m & r1) != r1) continue;\n if(((~m) & r0) != r0) continue;\n int nd = d + ed.d;\n int nsc = sc;\n if(nd < dp[m][11].first || (nd == dp[m][11].first && nsc > dp[m][11].second)){\n dp[m][11] = {nd, nsc};\n pq.push({m, 11, nd, nsc});\n }\n }\n }\n }\n cout << -1 << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 640, "memory_kb": 43580, "score_of_the_acc": -1.6139, "final_rank": 12 }, { "submission_id": "aoj_0400_9785987", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define overload(a,b,c,d,...) d\n#define rep1(i,n) for(ll i=0;i<(ll)n;++i)\n#define rep2(i,l,r) for(ll i=(ll)l;i<(ll)r;++i)\n#define rep(...) overload(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)\n#define rrep1(i,n) for(ll i=(ll)(n)-1;i>=0;--i)\n#define rrep2(i,l,r) for(ll i=(ll)(r)-1;i>=(ll)l;--i)\n#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)\n#define all(x) (x).begin(),(x).end()\n#define eb emplace_back\nstatic constexpr int dx[]={1,-1,0,0},dy[]={0,0,1,-1};\nusing vl=vector<ll>;\ntemplate<typename T,typename U>\nbool chmin(T&a,const U&b){return (a>b?a=b,true:false);}\ntemplate<typename T,typename U>\nbool chmax(T&a,const U&b){return (a<b?a=b,true:false);}\nint main(){\n\tll w,h;cin>>w>>h;\n\tvector<pair<int,int>>digits(10,{-1,-1}),little(10,{-1,-1}),large(10,{-1,-1});\n\tpair<int,int>start,goal;\n\tvector<string>s(h);\n\tfor(auto&e:s)cin>>e;\n\tvector<vector<int>>points(10,vector<int>(10));\n\tfor(auto&vec:points)for(auto&e:vec)cin>>e;\n\trep(i,h)rep(j,w){\n\t\tif(s[i][j]>='0'&&s[i][j]<='9')digits[s[i][j]-'0']={i,j};\n\t\tif(s[i][j]>='a'&&s[i][j]<='j')little[s[i][j]-'a']={i,j};\n\t\tif(s[i][j]>='A'&&s[i][j]<='J')large[s[i][j]-'A']={i,j};\n\t\tif(s[i][j]=='S')start={i,j};\n\t\tif(s[i][j]=='T')goal={i,j};\n\t}\n\tmap<pair<int,int>,int>mp;\n\trep(i,10)mp[digits[i]]=i;\n\trep(i,10)mp[little[i]]=i+10;\n\trep(i,10)mp[large[i]]=i+20;\n\tmp[start]=30,mp[goal]=31;\n\tvector<vector<vector<int>>>dist(12,vector<vector<int>>(12,vector<int>(1<<10,1e9)));\n\t{\n\t\tauto bfs=[&](int x1,int y1)->vector<int> {\n\t\t\tvector<int>res(32,1e9);\n\t\t\tif(x1==-1||y1==-1)return res;\n\t\t\tres[mp[{x1,y1}]]=0;\n\t\t\tqueue<array<int,3>>que;\n\t\t\tque.emplace(array<int,3>{x1,y1,0});\n\t\t\tvector<vector<bool>>vis(h,vector<bool>(w,false));\n\t\t\tvis[x1][y1]=true;\n\t\t\twhile(!que.empty()){\n\t\t\t\tauto [x,y,nd]=que.front();que.pop();\n\t\t\t\trep(dir,4){\n\t\t\t\t\tint nx=x+dx[dir],ny=y+dy[dir];\n\t\t\t\t\tif(nx<0||nx>=h||ny<0||ny>=w)continue;\n\t\t\t\t\tif(s[nx][ny]=='.'||s[nx][ny]=='S'||s[nx][ny]=='T'||(s[nx][ny]>='0'&&s[nx][ny]<='9')){\n\t\t\t\t\t\tif(!vis[nx][ny]){\n\t\t\t\t\t\t\tif(mp.count({nx,ny}))res[mp[{nx,ny}]]=nd+1;\n\t\t\t\t\t\t\tvis[nx][ny]=true;\n\t\t\t\t\t\t\tque.emplace(array<int,3>{nx,ny,nd+1});\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse if(s[nx][ny]!='#'&&mp.count({nx,ny})){\n\t\t\t\t\t\tchmin(res[mp[{nx,ny}]],nd+1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t};\n\t\tvector<vector<int>>dis(32,vector<int>(32,1e9));\n\t\trep(i,10)dis[i]=bfs(digits[i].first,digits[i].second);\n\t\trep(i,10)dis[i+10]=bfs(little[i].first,little[i].second);\n\t\trep(i,10)dis[i+20]=bfs(large[i].first,large[i].second);\n\t\tdis[30]=bfs(start.first,start.second);\n\t\tdis[31]=bfs(goal.first,goal.second);\n\t\trep(i,10){\n\t\t\trep(bit,1<<10)if((bit>>i)&1){\n\t\t\t\tvector<int>cost(32,1e9);\n\t\t\t\tcost[i]=0;\n\t\t\t\tpriority_queue<pair<int,int>,vector<pair<int,int>>,greater<>>pq;\n\t\t\t\tpq.emplace(0,i);\n\t\t\t\twhile(!pq.empty()){\n\t\t\t\t\tauto [d,v]=pq.top();pq.pop();\n\t\t\t\t\tif(d!=cost[v])continue;\n\t\t\t\t\trep(u,32){\n\t\t\t\t\t\tif(10<=u&&u<=19){\n\t\t\t\t\t\t\tif(!((bit>>(u-10))&1))continue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(20<=u&&u<=29){\n\t\t\t\t\t\t\tif((bit>>(u-20))&1)continue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(chmin(cost[u],d+dis[v][u]))pq.emplace(cost[u],u);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\trep(j,10)dist[i][j][bit]=cost[j];\n\t\t\t\tdist[i][10][bit]=cost[30];\n\t\t\t\tdist[i][11][bit]=cost[31];\n\t\t\t}\n\t\t}\n\t\trep(i,30,32){\t\t\n\t\t\trep(bit,1<<10){\n\t\t\t\tvector<int>cost(32,1e9);\n\t\t\t\tcost[i]=0;\n\t\t\t\tpriority_queue<pair<int,int>,vector<pair<int,int>>,greater<>>pq;\n\t\t\t\tpq.emplace(0,i);\n\t\t\t\twhile(!pq.empty()){\n\t\t\t\t\tauto [d,v]=pq.top();pq.pop();\n\t\t\t\t\tif(d!=cost[v])continue;\n\t\t\t\t\trep(u,32){\n\t\t\t\t\t\tif(10<=u&&u<=19){\n\t\t\t\t\t\t\tif(!((bit>>(u-10))&1))continue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(20<=u&&u<=29){\n\t\t\t\t\t\t\tif((bit>>(u-20))&1)continue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(chmin(cost[u],d+dis[v][u]))pq.emplace(cost[u],u);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\trep(j,10)dist[i-20][j][bit]=cost[j];\n\t\t\t\tdist[i-20][10][bit]=cost[30];\n\t\t\t\tdist[i-20][11][bit]=cost[31];\n\t\t\t}\n\t\t}\n\t}\n\tll ansd=1e9,ansp=0;\n\tvector<int>ord(10);\n\tiota(all(ord),0);\n\tdo{\n\t\tll nowd=0,nowp=0;\n\t\tint bit=0;\n\t\tnowd+=dist[10][ord[0]][bit];\n\t\tfor(int i=0;i<9;++i){\n\t\t\tbit|=1<<ord[i];\n\t\t\tnowd+=dist[ord[i]][ord[i+1]][bit];\n\t\t\tnowp+=points[ord[i]][ord[i+1]];\n\t\t}\n\t\tbit|=1<<ord[9];\n\t\tnowd+=dist[ord[9]][11][bit];\n\t\tif(nowd<ansd){\n\t\t\tansd=nowd,ansp=nowp;\n\t\t}\n\t\telse if(nowd==ansd&&ansp<nowp){\n\t\t\tansp=nowp;\n\t\t}\n\t}while(next_permutation(all(ord)));\n\tif(ansd>=(int)1e9){\n\t\tcout<<-1<<endl;\n\t\treturn 0;\n\t}\n\tcout<<ansd<< \" \"<<ansp<<endl;\n}", "accuracy": 1, "time_ms": 590, "memory_kb": 6020, "score_of_the_acc": -0.6204, "final_rank": 5 }, { "submission_id": "aoj_0400_9785956", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define overload(a,b,c,d,...) d\n#define rep1(i,n) for(ll i=0;i<(ll)n;++i)\n#define rep2(i,l,r) for(ll i=(ll)l;i<(ll)r;++i)\n#define rep(...) overload(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)\n#define rrep1(i,n) for(ll i=(ll)(n)-1;i>=0;--i)\n#define rrep2(i,l,r) for(ll i=(ll)(r)-1;i>=(ll)l;--i)\n#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)\n#define all(x) (x).begin(),(x).end()\n#define eb emplace_back\nstatic constexpr int dx[]={1,-1,0,0},dy[]={0,0,1,-1};\nusing vl=vector<ll>;\ntemplate<typename T,typename U>\nbool chmin(T&a,const U&b){return (a>b?a=b,true:false);}\ntemplate<typename T,typename U>\nbool chmax(T&a,const U&b){return (a<b?a=b,true:false);}\nint main(){\n\tll w,h;cin>>w>>h;\n\tvector<pair<int,int>>digits(10,{-1,-1}),little(10,{-1,-1}),large(10,{-1,-1});\n\tpair<int,int>start,goal;\n\tvector<string>s(h);\n\tfor(auto&e:s)cin>>e;\n\tvector<vector<int>>points(10,vector<int>(10));\n\tfor(auto&vec:points)for(auto&e:vec)cin>>e;\n\trep(i,h)rep(j,w){\n\t\tif(s[i][j]>='0'&&s[i][j]<='9')digits[s[i][j]-'0']={i,j};\n\t\tif(s[i][j]>='a'&&s[i][j]<='j')little[s[i][j]-'a']={i,j};\n\t\tif(s[i][j]>='A'&&s[i][j]<='J')large[s[i][j]-'A']={i,j};\n\t\tif(s[i][j]=='S')start={i,j};\n\t\tif(s[i][j]=='T')goal={i,j};\n\t}\n\tmap<pair<int,int>,int>mp;\n\trep(i,10)mp[digits[i]]=i;\n\trep(i,10)mp[little[i]]=i+10;\n\trep(i,10)mp[large[i]]=i+20;\n\tmp[start]=30,mp[goal]=31;\n\tvector<vector<vector<int>>>dist(12,vector<vector<int>>(12,vector<int>(1<<10,1e9)));\n\t{\n\t\tauto bfs=[&](int x1,int y1)->vector<int> {\n\t\t\tvector<int>res(32,1e9);\n\t\t\tif(x1==-1||y1==-1)return res;\n\t\t\tres[mp[{x1,y1}]]=0;\n\t\t\tqueue<array<int,3>>que;\n\t\t\tque.emplace(array<int,3>{x1,y1,0});\n\t\t\tvector<vector<bool>>vis(h,vector<bool>(w,false));\n\t\t\tvis[x1][y1]=true;\n\t\t\twhile(!que.empty()){\n\t\t\t\tauto [x,y,nd]=que.front();que.pop();\n\t\t\t\trep(dir,4){\n\t\t\t\t\tint nx=x+dx[dir],ny=y+dy[dir];\n\t\t\t\t\tif(nx<0||nx>=h||ny<0||ny>=w)continue;\n\t\t\t\t\tif(s[nx][ny]=='.'||s[nx][ny]=='S'||s[nx][ny]=='T'||(s[nx][ny]>='0'&&s[nx][ny]<='9')){\n\t\t\t\t\t\tif(!vis[nx][ny]){\n\t\t\t\t\t\t\tif(mp.count({nx,ny}))res[mp[{nx,ny}]]=nd+1;\n\t\t\t\t\t\t\tvis[nx][ny]=true;\n\t\t\t\t\t\t\tque.emplace(array<int,3>{nx,ny,nd+1});\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse if(s[nx][ny]!='#'&&mp.count({nx,ny})){\n\t\t\t\t\t\tchmin(res[mp[{nx,ny}]],nd+1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t};\n\t\tvector<vector<int>>dis(32,vector<int>(32,1e9));\n\t\trep(i,10)dis[i]=bfs(digits[i].first,digits[i].second);\n\t\trep(i,10)dis[i+10]=bfs(little[i].first,little[i].second);\n\t\trep(i,10)dis[i+20]=bfs(large[i].first,large[i].second);\n\t\tdis[30]=bfs(start.first,start.second);\n\t\tdis[31]=bfs(goal.first,goal.second);\n\t\trep(i,10){\n\t\t\trep(bit,1<<10)if((bit>>i)&1){\n\t\t\t\tvector<int>cost(32,1e9);\n\t\t\t\tcost[i]=0;\n\t\t\t\tpriority_queue<pair<int,int>,vector<pair<int,int>>,greater<>>pq;\n\t\t\t\tpq.emplace(0,i);\n\t\t\t\twhile(!pq.empty()){\n\t\t\t\t\tauto [d,v]=pq.top();pq.pop();\n\t\t\t\t\tif(d!=cost[v])continue;\n\t\t\t\t\trep(u,32){\n\t\t\t\t\t\tif(10<=u&&u<=19){\n\t\t\t\t\t\t\tif(!((bit>>(u-10))&1))continue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(20<=u&&u<=29){\n\t\t\t\t\t\t\tif((bit>>(u-20))&1)continue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(chmin(cost[u],d+dis[v][u]))pq.emplace(cost[u],u);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\trep(j,10)dist[i][j][bit]=cost[j];\n\t\t\t\tdist[i][10][bit]=cost[30];\n\t\t\t\tdist[i][11][bit]=cost[31];\n\t\t\t}\n\t\t}\n\t\trep(i,30,32){\t\t\n\t\t\trep(bit,1<<10){\n\t\t\t\tvector<int>cost(32,1e9);\n\t\t\t\tcost[i]=0;\n\t\t\t\tpriority_queue<pair<int,int>,vector<pair<int,int>>,greater<>>pq;\n\t\t\t\tpq.emplace(0,i);\n\t\t\t\twhile(!pq.empty()){\n\t\t\t\t\tauto [d,v]=pq.top();pq.pop();\n\t\t\t\t\tif(d!=cost[v])continue;\n\t\t\t\t\trep(u,32){\n\t\t\t\t\t\tif(10<=u&&u<=19){\n\t\t\t\t\t\t\tif(!((bit>>(u-10))&1))continue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(20<=u&&u<=29){\n\t\t\t\t\t\t\tif((bit>>(u-20))&1)continue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(chmin(cost[u],d+dis[v][u]))pq.emplace(cost[u],u);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\trep(j,10)dist[i-20][j][bit]=cost[j];\n\t\t\t\tdist[i-20][10][bit]=cost[30];\n\t\t\t\tdist[i-20][11][bit]=cost[31];\n\t\t\t}\n\t\t}\n\t}\n\tll ansd=1e9,ansp=0;\n\tvector<int>ord(10);\n\tiota(all(ord),0);\n\tdo{\n\t\tll nowd=0,nowp=0;\n\t\tint bit=0;\n\t\tnowd+=dist[10][ord[0]][bit];\n\t\tfor(int i=0;i<9;++i){\n\t\t\tbit|=1<<ord[i];\n\t\t\tnowd+=dist[ord[i]][ord[i+1]][bit];\n\t\t\tnowp+=points[ord[i]][ord[i+1]];\n\t\t}\n\t\tbit|=1<<ord[9];\n\t\tnowd+=dist[ord[9]][11][bit];\n\t\tif(nowd<ansd){\n\t\t\tansd=nowd,ansp=nowp;\n\t\t}\n\t\telse if(ansp<nowp)ansp=nowp;\n\t}while(next_permutation(all(ord)));\n\tif(ansd>=(int)1e9){\n\t\tcout<<-1<<endl;\n\t\treturn 0;\n\t}\n\tcout<<ansd<< \" \"<<ansp<<endl;\n}", "accuracy": 0.09090909090909091, "time_ms": 60, "memory_kb": 3792, "score_of_the_acc": -0.0396, "final_rank": 17 }, { "submission_id": "aoj_0400_9785869", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define overload(a,b,c,d,...) d\n#define rep1(i,n) for(ll i=0;i<(ll)n;++i)\n#define rep2(i,l,r) for(ll i=(ll)l;i<(ll)r;++i)\n#define rep(...) overload(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)\n#define rrep1(i,n) for(ll i=(ll)(n)-1;i>=0;--i)\n#define rrep2(i,l,r) for(ll i=(ll)(r)-1;i>=(ll)l;--i)\n#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)\n#define all(x) (x).begin(),(x).end()\n#define eb emplace_back\nstatic constexpr int dx[]={1,-1,0,0},dy[]={0,0,1,-1};\nusing vl=vector<ll>;\ntemplate<typename T,typename U>\nbool chmin(T&a,const U&b){return (a>b?a=b,true:false);}\ntemplate<typename T,typename U>\nbool chmax(T&a,const U&b){return (a<b?a=b,true:false);}\nint main(){\n\tll w,h;cin>>w>>h;\n\tvector<pair<int,int>>digits(10,{-1,-1}),little(10,{-1,-1}),large(10,{-1,-1});\n\tpair<int,int>start,goal;\n\tvector<string>s(h);\n\tfor(auto&e:s)cin>>e;\n\tvector<vector<int>>points(10,vector<int>(10));\n\tfor(auto&vec:points)for(auto&e:vec)cin>>e;\n\trep(i,h)rep(j,w){\n\t\tif(s[i][j]>='0'&&s[i][j]<='9')digits[s[i][j]-'0']={i,j};\n\t\tif(s[i][j]>='a'&&s[i][j]<='j')little[s[i][j]-'a']={i,j};\n\t\tif(s[i][j]>='A'&&s[i][j]<='J')large[s[i][j]-'A']={i,j};\n\t\tif(s[i][j]=='S')start={i,j};\n\t\tif(s[i][j]=='T')goal={i,j};\n\t}\n\tmap<pair<int,int>,int>mp;\n\trep(i,10)mp[digits[i]]=i;\n\trep(i,10)mp[little[i]]=i+10;\n\trep(i,10)mp[large[i]]=i+20;\n\tmp[start]=30,mp[goal]=31;\n\tvector<vector<vector<int>>>dist(12,vector<vector<int>>(12,vector<int>(1<<10,1e9)));\n\t{\n\t\tauto bfs=[&](int x1,int y1)->vector<int> {\n\t\t\tvector<int>res(32,1e9);\n\t\t\tif(x1==-1||y1==-1)return res;\n\t\t\tres[mp[{x1,y1}]]=0;\n\t\t\tqueue<array<int,3>>que;\n\t\t\tque.emplace(array<int,3>{x1,y1,0});\n\t\t\tvector<vector<bool>>vis(h,vector<bool>(w,false));\n\t\t\tvis[x1][y1]=true;\n\t\t\twhile(!que.empty()){\n\t\t\t\tauto [x,y,nd]=que.front();que.pop();\n\t\t\t\trep(dir,4){\n\t\t\t\t\tint nx=x+dx[dir],ny=y+dy[dir];\n\t\t\t\t\tif(nx<0||nx>=h||ny<0||ny>=w)continue;\n\t\t\t\t\tif(s[nx][ny]=='.'||s[nx][ny]=='S'||s[nx][ny]=='T'){\n\t\t\t\t\t\tif(!vis[nx][ny]){\n\t\t\t\t\t\t\tif(mp.count({nx,ny}))res[mp[{nx,ny}]]=nd+1;\n\t\t\t\t\t\t\tvis[nx][ny]=true;\n\t\t\t\t\t\t\tque.emplace(array<int,3>{nx,ny,nd+1});\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse if(s[nx][ny]!='#'&&mp.count({nx,ny})){\n\t\t\t\t\t\tchmin(res[mp[{nx,ny}]],nd+1);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn res;\n\t\t};\n\t\tvector<vector<int>>dis(32,vector<int>(32,1e9));\n\t\trep(i,10)dis[i]=bfs(digits[i].first,digits[i].second);\n\t\trep(i,10)dis[i+10]=bfs(little[i].first,little[i].second);\n\t\trep(i,10)dis[i+20]=bfs(large[i].first,large[i].second);\n\t\tdis[30]=bfs(start.first,start.second);\n\t\tdis[31]=bfs(goal.first,goal.second);\n\t\trep(i,10){\n\t\t\trep(bit,1<<10)if((bit>>i)&1){\n\t\t\t\tvector<int>cost(32,1e9);\n\t\t\t\tcost[i]=0;\n\t\t\t\tpriority_queue<pair<int,int>,vector<pair<int,int>>,greater<>>pq;\n\t\t\t\tpq.emplace(0,i);\n\t\t\t\twhile(!pq.empty()){\n\t\t\t\t\tauto [d,v]=pq.top();pq.pop();\n\t\t\t\t\tif(d!=cost[v])continue;\n\t\t\t\t\trep(u,32){\n\t\t\t\t\t\tif(10<=u&&u<=19){\n\t\t\t\t\t\t\tif(!((bit>>(u-10))&1))continue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(20<=u&&u<=29){\n\t\t\t\t\t\t\tif((bit>>(u-20))&1)continue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(chmin(cost[u],d+dis[v][u])){\n\t\t\t\t\t\t\tif((10<=u&&u<=31)||(u<10&&((bit>>u)&1))){\n\t\t\t\t\t\t\t\tpq.emplace(cost[u],u);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\trep(j,10)dist[i][j][bit]=cost[j];\n\t\t\t\tdist[i][10][bit]=cost[30];\n\t\t\t\tdist[i][11][bit]=cost[31];\n\t\t\t}\n\t\t}\n\t\trep(i,30,32){\t\t\n\t\t\trep(bit,1<<10){\n\t\t\t\tvector<int>cost(32,1e9);\n\t\t\t\tcost[i]=0;\n\t\t\t\tpriority_queue<pair<int,int>,vector<pair<int,int>>,greater<>>pq;\n\t\t\t\tpq.emplace(0,i);\n\t\t\t\twhile(!pq.empty()){\n\t\t\t\t\tauto [d,v]=pq.top();pq.pop();\n\t\t\t\t\tif(d!=cost[v])continue;\n\t\t\t\t\trep(u,32){\n\t\t\t\t\t\tif(10<=u&&u<=19){\n\t\t\t\t\t\t\tif(!((bit>>(u-10))&1))continue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(20<=u&&u<=29){\n\t\t\t\t\t\t\tif((bit>>(u-20))&1)continue;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(chmin(cost[u],d+dis[v][u])){\n\t\t\t\t\t\t\tif((10<=u&&u<=31)||(u<10&&((bit>>u)&1))){\n\t\t\t\t\t\t\t\t//if(u<10)cerr<<u<<endl;\n\t\t\t\t\t\t\t\tpq.emplace(cost[u],u);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\trep(j,10)dist[i-20][j][bit]=cost[j];\n\t\t\t\tdist[i-20][10][bit]=cost[30];\n\t\t\t\tdist[i-20][11][bit]=cost[31];\n\t\t\t}\n\t\t}\n\t}\n\tll ansd=1e9,ansp=0;\n\tvector<int>ord(10);\n\tiota(all(ord),0);\n\tdo{\n\t\tll nowd=0,nowp=0;\n\t\tint bit=0;\n\t\tnowd+=dist[10][ord[0]][bit];\n\t\tfor(int i=0;i<9;++i){\n\t\t\tbit|=1<<ord[i];\n\t\t\tnowd+=dist[ord[i]][ord[i+1]][bit];\n\t\t\tnowp+=points[ord[i]][ord[i+1]];\n\t\t}\n\t\tbit|=1<<ord[9];\n\t\tnowd+=dist[ord[9]][11][bit];\n\t\tif(nowd<ansd){\n\t\t\tansd=nowd,ansp=nowp;\n\t\t}\n\t\telse if(ansp<nowp)ansp=nowp;\n\t}while(next_permutation(all(ord)));\n\tif(ansd>=(int)1e9){\n\t\tcout<<-1<<endl;\n\t\treturn 0;\n\t}\n\tcout<<ansd<< \" \"<<ansp<<endl;\n}", "accuracy": 0.09090909090909091, "time_ms": 60, "memory_kb": 3872, "score_of_the_acc": -0.0416, "final_rank": 18 }, { "submission_id": "aoj_0400_7074506", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\nconstexpr int inf = 1000000000;\n\nint main() {\n\tios_base::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\t\n\tint W, H;\n\tcin >> W >> H;\n\tvector<char> grid(H * W);\n\tfor (int i = 0; i < H * W; ++i) {\n\t\tcin >> grid[i];\n\t}\n\tvector score(10, vector(10, 0));\n\tfor (int i = 0; i < 10; ++i) {\n\t\tfor (int j = 0; j < 10; ++j) {\n\t\t\tcin >> score[i][j];\n\t\t}\n\t}\n\n\tconst int V = 32;\n\tstd::map<char, int> id;\n\tfor (int i = 0; i < 10; ++i) {\n\t\tid['0' + i] = i + 0;\n\t\tid['a' + i] = i + 10;\n\t\tid['A' + i] = i + 20;\n\t}\n\tid['S'] = 30;\n\tid['T'] = 31;\n\n\tvector graph(V, vector(V, inf));\n\tfor (int src = 0; src < H * W; ++src) {\n\t\tif (grid[src] == '.' or grid[src] == '#') {\n\t\t\tcontinue;\n\t\t}\n\n\t\tvector<int> dist(H * W, inf);\n\t\tstd::queue<int> que;\n\t\tconst auto push = [&](const int u, const int d) {\n\t\t\tif (dist[u] > d) {\n\t\t\t\tdist[u] = d;\n\t\t\t\tque.push(u);\n\t\t\t}\n\t\t};\n\n\t\tpush(src, 0);\n\t\twhile (!que.empty()) {\n\t\t\tconst int u = que.front();\n\t\t\tque.pop();\n\t\t\tif (grid[u] != '.' and grid[u] != '#') {\n\t\t\t\tgraph[id[grid[src]]][id[grid[u]]] = dist[u];\n\t\t\t}\n\t\t\tif (grid[u] != '.' and u != src) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (u / W != 0) push(u - W, dist[u] + 1);\n\t\t\tif (u / W != H - 1) push(u + W, dist[u] + 1);\n\t\t\tif (u % W != 0) push(u - 1, dist[u] + 1);\n\t\t\tif (u % W != W - 1) push(u + 1, dist[u] + 1);\n\t\t}\n\t}\n\n\tvector dp(10, vector(1 << 10, pair(inf, inf)));\n\tdp[0][0] = {0, 0};\n\tfor (int set = 0; set < (1 << 10); ++set) {\n\t\tfor (int last = 0; last < 10; ++last) {\n\t\t\tconst int src = (set == 0 ? id['S'] : id['0' + last]);\n\t\t\tvector<int> dist(V, inf);\n\t\t\tvector<char> ok(V, true), done(V);\n\t\t\tfor (int i = 0; i < 10; ++i) {\n\t\t\t\tif (set >> i & 1) {\n\t\t\t\t\tok[id['A' + i]] = false;\n\t\t\t\t} else {\n\t\t\t\t\tok[id['a' + i]] = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tdist[src] = 0;\n\t\t\twhile (true) {\n\t\t\t\tint select = -1;\n\t\t\t\tfor (int i = 0; i < V; ++i) {\n\t\t\t\t\tif (!done[i] and dist[i] != inf and (select == -1 or dist[select] > dist[i])) {\n\t\t\t\t\t\tselect = i;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif (select == -1) break;\n\t\t\t\tdone[select] = true;\n\t\t\t\tfor (int next = 0; next < V; ++next) {\n\t\t\t\t\tif (!ok[next]) continue;\n\t\t\t\t\tdist[next] = min(dist[next], dist[select] + graph[select][next]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tconst auto& [x, y] = dp[last][set];\n\t\t\tfor (int add = 0; add < 10; ++add) {\n\t\t\t\tif (!(set >> add & 1)) {\n\t\t\t\t\tdp[add][set | (1 << add)] = min(dp[add][set | (1 << add)], pair(x + dist[id['0' + add]], y - (set == 0 ? 0 : score[last][add])));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tpair ans(inf, inf);\n\t{\n\t\tconst int src = id['T'];\n\t\tvector<int> dist(V, inf);\n\t\tvector<char> ok(V, true), done(V);\n\t\tfor (int i = 0; i < 10; ++i) {\n\t\t\tok[id['A' + i]] = false;\n\t\t}\n\t\tdist[src] = 0;\n\t\twhile (true) {\n\t\t\tint select = -1;\n\t\t\tfor (int i = 0; i < V; ++i) {\n\t\t\t\tif (!done[i] and dist[i] != inf and (select == -1 or dist[select] > dist[i])) {\n\t\t\t\t\tselect = i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (select == -1) break;\n\t\t\tdone[select] = true;\n\t\t\tfor (int next = 0; next < V; ++next) {\n\t\t\t\tif (!ok[next]) continue;\n\t\t\t\tdist[next] = min(dist[next], dist[select] + graph[select][next]);\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < 10; ++i) {\n\t\t\tconst auto& [x, y] = dp[i][(1 << 10) - 1];\n\t\t\tans = min(ans, pair(x + dist[id['0' + i]], y));\n\t\t}\n\t}\n\tif (ans.first == inf) {\n\t\tcout << \"-1\\n\";\n\t} else {\n\t\tcout << ans.first << ' ' << -ans.second << '\\n';\t\n\t}\n\t// dp[1024][10]\n\t// transition : 10240 times\n\t// dijkstra : 32 * 32\n\t// should not use std::map?\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 250, "memory_kb": 8008, "score_of_the_acc": -0.3337, "final_rank": 1 }, { "submission_id": "aoj_0400_6975564", "code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 0400.cc: Maze &amp; Items\n */\n\n#include<cstdio>\n#include<vector>\n#include<queue>\n#include<algorithm>\n#include<utility>\n \nusing namespace std;\n\n/* constant */\n\nconst int N = 32;\nconst int BN = 10;\nconst int BBITS = 1 << BN;\nconst int BMSK = BBITS - 1;\nconst int MAX_W = 1000;\nconst int MAX_H = 1000;\nconst int MAX_HW = MAX_H * MAX_W;\nconst int INF = 1 << 30;\n\nconst int dys[] = { 0, -1, 0, 1 }, dxs[] = { 1, 0, -1, 0 };\nconst char vcs[] = \"0123456789ABCDEFGHIJabcdefghijST\";\n\n/* typedef */\n\ntypedef queue<int> qi;\ntypedef pair<int,int> pii;\ntypedef vector<pii> vpii;\n\nstruct Dist {\n int d, x;\n Dist() {}\n Dist(int _d, int _x): d(_d), x(_x) {}\n bool operator<(const Dist &t) const {\n return d < t.d || (d == t.d && x > t.x);\n }\n bool operator>(const Dist &t) const {\n return d > t.d || (d == t.d && x < t.x);\n }\n bool operator==(const Dist &t) const { return d == t.d && x == t.x; }\n bool operator!=(const Dist &t) const { return ! (*this == t); }\n};\n\nstruct Stat {\n int i, l, bs;\n Stat() {}\n Stat(int _i, int _l, int _bs): i(_i), l(_l), bs(_bs) {}\n bool operator<(const Stat &s) const { return i < s.i; }\n bool operator>(const Stat &s) const { return i > s.i; }\n};\n\ntypedef pair<Dist,Stat> pds;\n\n/* global variables */\n\nchar cmap[128], fs[MAX_H][MAX_W + 4];\nint vps[N], ds[MAX_HW], ss[BN][BN];\nvpii nbrs[N];\nDist dts[N][BN + 1][BBITS];\n\n/* subroutines */\n\nvoid bfs(int h, int w, int sc) {\n int st = vps[sc];\n if (st < 0) return;\n\n int hw = h * w;\n fill(ds, ds + hw, -1);\n ds[st] = 0;\n qi q;\n q.push(st);\n\n while (! q.empty()) {\n int u = q.front(); q.pop();\n int uy = u / w, ux = u % w;\n\n for (int di = 0; di < 4; di++) {\n int vy = uy + dys[di], vx = ux + dxs[di], v = vy * w + vx;\n if (vy >= 0 && vy < h && vx >= 0 && vx < w &&\n\t fs[vy][vx] != '#' && ds[v] < 0) {\n\tds[v] = ds[u] + 1;\n\tif (fs[vy][vx] == '.') q.push(v);\n }\n }\n }\n}\n\n/* main */\n\nint main() {\n //freopen(\"input.txt\", \"r\", stdin);\n //freopen(\"output.txt\", \"w\", stdout);\n\n fill(cmap, cmap + 128, -1);\n for (int i = 0; i < N; i++) cmap[vcs[i]] = i;\n\n int w, h;\n scanf(\"%d%d\", &w, &h);\n int hw = h * w;\n\n fill(vps, vps + N, -1);\n for (int y = 0, p = 0; y < h; y++) {\n scanf(\"%s\", fs[y]);\n for (int x = 0; x < w; x++, p++) {\n int ci = cmap[fs[y][x]];\n if (ci >= 0) vps[ci] = p;\n }\n }\n\n for (int i = 0; i < BN; i++)\n for (int j = 0; j < BN; j++) scanf(\"%d\", ss[i] + j);\n\n for (int sc = 0; sc < N; sc++)\n if (vps[sc] >= 0) {\n bfs(h, w, sc);\n for (int i = 0; i < N; i++) {\n\tint v = vps[i];\n\tif (v >= 0 && ds[v] > 0) {\n\t nbrs[sc].push_back(pii(i, ds[v]));\n\t //printf(\"%d->%d: %d\\n\", sc, i, ds[v]);\n\t}\n }\n }\n\n int st = N - 2, gl = N - 1;\n \n for (int i = 0; i < N; i++)\n for (int j = 0; j <= BN; j++)\n fill(dts[i][j], dts[i][j] + BBITS, Dist(INF, 0));\n dts[st][BN][0] = Dist(0, 0);\n\n priority_queue<pds,vector<pds>,greater<pds> > q;\n q.push(pds(Dist(0, 0), Stat(st, BN, 0)));\n\n Dist mind(-1, 0);\n while (! q.empty()) {\n pds ue = q.top(); q.pop();\n Dist ud = ue.first;\n Stat u = ue.second;\n if (dts[u.i][u.l][u.bs] != ud) continue;\n\n if (u.i == gl && u.bs == BMSK) {\n mind = ud;\n break;\n }\n\n for (auto vw: nbrs[u.i]) {\n int vi = vw.first, w = vw.second;\n Dist vd = Dist(ud.d + w, ud.x);\n if (dts[vi][u.l][u.bs] > vd) {\n\tif ((BN <= vi && vi < BN * 2 && (u.bs & (1 << (vi - BN)))) ||\n\t (BN * 2 <= vi && vi < BN * 3 && ! (u.bs & (1 << (vi - BN * 2)))))\n\t continue;\n\tdts[vi][u.l][u.bs] = vd;\n\tq.push(pds(vd, Stat(vi, u.l, u.bs)));\n }\n }\n\n if (u.i < BN && ! (u.bs & (1 << u.i))) {\n int vbs = u.bs | (1 << u.i);\n Dist vd = Dist(ud.d, ud.x + (u.l < BN ? ss[u.l][u.i] : 0));\n if (dts[u.i][u.i][vbs] > vd) {\n\tdts[u.i][u.i][vbs] = vd;\n\tq.push(pds(vd, Stat(u.i, u.i, vbs)));\n }\n }\n }\n\n if (mind.d < 0) puts(\"-1\");\n else printf(\"%d %d\\n\", mind.d, mind.x);\n return 0;\n}", "accuracy": 1, "time_ms": 350, "memory_kb": 10892, "score_of_the_acc": -0.5052, "final_rank": 3 }, { "submission_id": "aoj_0400_6039848", "code_snippet": "#ifdef LOGX\n#define _GLIBCXX_DEBUG\n#endif\n#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define rep2(i,s,n) for(int i=int(s);i<(int)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\n#define vv vector\nconst int big=1e9+7;\n//const int big=998244353;\nconst char newl='\\n';\nconst int inf=1e9+10;\nconst ll INF=ll(1e18)+10;\nconst int dx[]={1,0,-1,0};\nconst int dy[]={0,1,0,-1};\n\ntemplate<typename T>\nT exp(T x,ll y,const T e){\n T res=e;\n while(y){\n if(y&1)res=res*x;\n x=x*x;\n y>>=1;\n }\n return res;\n}\n\nint lcm(int a,int b){\n return a/__gcd(a,b)*b;\n}\n\nstruct mint{\n ll x;\n mint(ll xx=0):x(xx){\n x%=big;\n if(x<0)x+=big;\n }\n mint& operator+=(mint r){\n x+=r.x;\n if(x>=big)x-=big;\n return *this;\n }\n mint& operator*=(mint r){\n x*=r.x;\n x%=big;\n return *this;\n }\n friend mint operator+(mint l,mint r){\n l+=r;\n return l;\n }\n friend mint operator*(mint l,mint r){\n return l*=r;\n }\n friend ostream& operator<<(ostream &os,const mint &r){\n os << r.x;\n return os;\n }\n};\n\nvector<int> pfacs(int v){\n vector<int> res;\n for(int i=2;i*i<=v;i++){\n if(v%i==0){\n res.emplace_back(i);\n while(v%i==0)v/=i;\n }\n }\n if(v!=1)res.emplace_back(v);\n return res;\n}\n\nbool is_need(char c){\n return !(c=='.' || c=='#');\n}\ntemplate<typename T>\nbool chmin(T &a,T b){\n if(a<=b)return false;\n return a=b,true;\n}\n\n#define mybit(i,j) (((i)>>(j))&1)\n\nint main(){\n //std::ios::sync_with_stdio(false);\n //std::cin.tie(nullptr);\n std::cout.precision(10);\n/*------------------------------------*/\n auto encode=[](char c){\n if('0'<=c && c<='9'){\n return c-'0';\n }\n else if(isupper(c)){\n if(c<='J')return 10+c-'A';\n else return 30+(c=='T');\n }\n else{\n return 20+c-'a';\n }\n };\n auto decode=[](int x)->char{\n if(x<=9)return '0'+x;\n else if(x<=19)return 'A'+x-10;\n else if(x<=29)return 'a'+x-20;\n return (x==30 ? 'S':'T');\n };\n/////////////////////////////////////////////\n int h,w;\n cin >> w >> h;\n vector<string> grid(h);\n rep(i,h)cin >> grid[i];\n vector<vector<int>> score(10,vector<int>(10));\n rep(i,10)rep(j,10)cin >> score[i][j],score[i][j]*=-1;\n\n auto is_valid=[&](int i,int j){\n return 0<=i && i<h && 0<=j && j<w;\n };\n \n const int sz=32;\n vector<vector<int>> dist(sz,vector<int>(sz,inf));\n vector<pair<int,int>> needs;\n rep(i,h)rep(j,w)if(is_need(grid[i][j])){\n needs.emplace_back(i,j);\n }\n sort(all(needs),[&](pair<int,int> l,pair<int,int> r){\n return encode(grid[l.first][l.second])<encode(grid[r.first][r.second]);\n });\n for(auto p:needs){\n int s=p.first,t=p.second;\n vector<vector<int>> cost(h,vector<int>(w,inf));\n cost[s][t]=0;\n queue<pair<int,int>> q;\n q.emplace(s,t);\n while(!q.empty()){\n auto P=q.front();q.pop();\n int i=P.first,j=P.second;\n rep(k,4){\n int ni=i+dx[k],nj=j+dy[k];\n if(!is_valid(ni,nj))continue;\n if(chmin(cost[ni][nj],cost[i][j]+1) && grid[ni][nj]=='.'){\n q.emplace(ni,nj);\n }\n }\n }\n for(auto xy:needs){\n int x=xy.first,y=xy.second;\n dist[encode(grid[s][t])][encode(grid[x][y])]=cost[x][y];\n }\n }\n\n vector<vector<pair<int,int>>> dp(1<<10,vector<pair<int,int>>(10,{inf,inf}));\n {\n vector<int> cost(32,inf);\n cost[encode('S')]=0;\n using P=pair<int,int>;\n priority_queue<P,vector<P>,greater<P>> q;\n q.emplace(0,encode('S'));\n while(!q.empty()){\n int d=q.top().first;\n int x=q.top().second;\n q.pop();\n if(cost[x]!=d)continue;\n rep(y,32){\n bool can=true;\n char c=decode(y);\n if('A'<=c && c<='J'){\n can&=!mybit(0,c-'A');\n }\n if('a'<=c && c<='j'){\n can&=mybit(0,c-'a');\n }\n if(can && chmin(cost[y],cost[x]+dist[x][y])){\n q.emplace(cost[y],y);\n }\n }\n }\n for(char c='0';c<='9';c++){\n dp[1<<(c-'0')][c-'0']={cost[encode(c)],0};\n }\n }\n pair<int,int> ans={inf,inf};\n rep2(S,1,1<<10)rep(i,10){\n vector<int> cost(32,inf);\n cost[encode('0'+i)]=0;\n using P=pair<int,int>;\n priority_queue<P,vector<P>,greater<P>> q;\n q.emplace(0,encode('0'+i));\n while(!q.empty()){\n ll d=q.top().first;\n int x=q.top().second;\n q.pop();\n if(cost[x]!=d)continue;\n rep(y,32){\n bool can=true;\n char c=decode(y);\n if('A'<=c && c<='J'){\n can&=!mybit(S,c-'A');\n }\n if('a'<=c && c<='j'){\n can&=mybit(S,c-'a');\n }\n if(can && chmin(cost[y],cost[x]+dist[x][y])){\n q.emplace(cost[y],y);\n }\n }\n }\n //あとはTに戻るだけ\n if(S==(1<<10)-1){\n int di=dp[S][i].first, sc=dp[S][i].second;\n chmin(ans,{di+cost[encode('T')],sc});\n }\n else rep(j,10)if(!mybit(S,j)){\n int di=dp[S][i].first, sc=dp[S][i].second;\n chmin(dp[S | (1<<j)][j],{di+cost[j],sc+score[i][j]});\n }\n }\n if(ans.first==(int)inf)cout << -1 << newl;\n else cout << ans.first << ' ' << -ans.second << newl;\n}\n//dp[S][i]=Sに行ってiが最後\n//スコアは-1倍で保持する->最小化", "accuracy": 1, "time_ms": 330, "memory_kb": 8872, "score_of_the_acc": -0.4346, "final_rank": 2 }, { "submission_id": "aoj_0400_5036734", "code_snippet": "#include<iostream>\n#include<queue>\n#include<vector>\nusing namespace std;\nint dx[4]={1,0,-1,0};\nint dy[4]={0,1,0,-1};\nint H,W;\nstring S[1000];\nint invS[1000][1000];\nvector<pair<int,int> >A;\nint dist[200][200];\nint chr[200];\nint id[12];\nint calc[1000][1000];\npair<int,int>dp[1<<10][10];\nint s[10][10];\nint D[200];\nmain()\n{\n\tcin>>W>>H;\n\tfor(int i=0;i<H;i++)cin>>S[i];\n\tfor(int i=0;i<10;i++)for(int j=0;j<10;j++)cin>>s[i][j];\n\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)\n\t{\n\t\tif(S[i][j]=='S')\n\t\t{\n\t\t\tid[10]=A.size();\n\t\t\tA.push_back(make_pair(i,j));\n\t\t}\n\t\telse if(S[i][j]=='T')\n\t\t{\n\t\t\tid[11]=A.size();\n\t\t\tA.push_back(make_pair(i,j));\n\t\t}\n\t\telse if(S[i][j]>='0'&&S[i][j]<='9')\n\t\t{\n\t\t\tid[S[i][j]-'0']=A.size();\n\t\t\tA.push_back(make_pair(i,j));\n\t\t}\n\t\telse if(S[i][j]>='A'&&S[i][j]<='J')\n\t\t{\n\t\t\tchr[A.size()]=S[i][j]-'A'+1;\n\t\t\tA.push_back(make_pair(i,j));\n\t\t}\n\t\telse if(S[i][j]>='a'&&S[i][j]<='j')\n\t\t{\n\t\t\tchr[A.size()]=-(S[i][j]-'a'+1);\n\t\t\tA.push_back(make_pair(i,j));\n\t\t}\n\t\telse if(S[i][j]=='.')\n\t\t{\n\t\t\tbool f=false;\n\t\t\tfor(int r=0;r<4;r++)\n\t\t\t{\n\t\t\t\tint x=i+dx[r],y=j+dy[r];\n\t\t\t\tif(x<0||y<0||x>=H||y>=W)continue;\n\t\t\t\tif(S[x][y]>='A'&&S[x][y]<='J'||S[x][y]>='a'&&S[x][y]<='j')f=true;\n\t\t\t}\n\t\t\tif(f)A.push_back(make_pair(i,j));\n\t\t}\n\t}\n\tint n=A.size();\n\tfor(int i=0;i<n;i++)invS[A[i].first][A[i].second]=i+1;\n\tfor(int i=0;i<n;i++)for(int j=0;j<n;j++)dist[i][j]=i==j?0:1e9;\n\tfor(int i=0;i<n;i++)\n\t{\n\t\tint sx=A[i].first,sy=A[i].second;\n\t\tif(chr[i]!=0)\n\t\t{\n\t\t\tfor(int r=0;r<4;r++)\n\t\t\t{\n\t\t\t\tint x=sx+dx[r],y=sy+dy[r];\n\t\t\t\tif(x<0||y<0||x>=H||y>=W)continue;\n\t\t\t\tif(invS[x][y]>0)dist[i][invS[x][y]-1]=1;\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\tfor(int i=0;i<H;i++)for(int j=0;j<W;j++)calc[i][j]=1e9;\n\t\tcalc[sx][sy]=0;\n\t\tqueue<pair<int,int> >P;\n\t\tP.push(make_pair(sx,sy));\n\t\twhile(!P.empty())\n\t\t{\n\t\t\tint x=P.front().first,y=P.front().second;\n\t\t\tP.pop();\n\t\t\tif(S[x][y]>='A'&&S[x][y]<='J'||S[x][y]>='a'&&S[x][y]<='j')continue;\n\t\t\tfor(int r=0;r<4;r++)\n\t\t\t{\n\t\t\t\tint tx=x+dx[r],ty=y+dy[r];\n\t\t\t\tif(tx<0||ty<0||tx>=H||ty>=W||S[tx][ty]=='#'||calc[tx][ty]<=calc[x][y]+1)continue;\n\t\t\t\tcalc[tx][ty]=calc[x][y]+1;\n\t\t\t\tP.push(make_pair(tx,ty));\n\t\t\t}\n\t\t}\n\t\tfor(int j=0;j<n;j++)\n\t\t{\n\t\t\tdist[i][j]=calc[A[j].first][A[j].second];\n\t\t}\n\t}\n\tpair<int,int>ans=make_pair(1e9,-1);\n\tfor(int i=0;i<1<<10;i++)for(int j=0;j<10;j++)dp[i][j]=make_pair(1e9,-1);\n\tdp[0][0]=make_pair(0,0);\n\tfor(int i=0;i<1<<10;i++)for(int j=0;j<10;j++)if(dp[i][j].second>=0)\n\t{\n\t\tint st=id[j];\n\t\tif(i==0)st=id[10];\n\t\tfor(int k=0;k<n;k++)D[k]=1e9;\n\t\tpriority_queue<pair<int,int> >P;\n\t\tP.push(make_pair(0,st));\n\t\tD[st]=0;\n\t\twhile(!P.empty())\n\t\t{\n\t\t\tint cost=-P.top().first,u=P.top().second;\n\t\t\tP.pop();\n\t\t\tif(D[u]<cost)continue;\n\t\t\tif(chr[u]>0)\n\t\t\t{\n\t\t\t\tif(i>>chr[u]-1&1)continue;\n\t\t\t}\n\t\t\telse if(chr[u]<0)\n\t\t\t{\n\t\t\t\tif(!(i>>-chr[u]-1&1))continue;\n\t\t\t}\n\t\t\tfor(int v=0;v<n;v++)\n\t\t\t{\n\t\t\t\tint nxt=cost+dist[u][v];\n\t\t\t\tif(D[v]>nxt)\n\t\t\t\t{\n\t\t\t\t\tD[v]=nxt;\n\t\t\t\t\tP.push(make_pair(-nxt,v));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(i+1<1<<10)\n\t\t{\n\t\t\tfor(int k=0;k<10;k++)if(!(i>>k&1)&&D[id[k]]<(int)1e9)\n\t\t\t{\n\t\t\t\tpair<int,int>nxt=make_pair(dp[i][j].first+D[id[k]],dp[i][j].second);\n\t\t\t\tif(i!=0)nxt.second+=s[j][k];\n\t\t\t\tpair<int,int>now=dp[i|1<<k][k];\n\t\t\t\tif(now.first>nxt.first||now.first==nxt.first&&now.second<nxt.second)\n\t\t\t\t{\n\t\t\t\t\tdp[i|1<<k][k]=nxt;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tif(D[id[11]]<(int)1e9)\n\t\t\t{\n\t\t\t\tpair<int,int>nxt=make_pair(dp[i][j].first+D[id[11]],dp[i][j].second);\n\t\t\t\tif(ans.first>nxt.first||ans.first==nxt.first&&ans.second<nxt.second)ans=nxt;\n\t\t\t}\n\t\t}\n\t}\n\tif(ans.second<0)cout<<-1<<endl;\n\telse cout<<ans.first<<\" \"<<ans.second<<endl;\n}", "accuracy": 1, "time_ms": 970, "memory_kb": 8112, "score_of_the_acc": -1.0492, "final_rank": 11 }, { "submission_id": "aoj_0400_4979877", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing LL = long long;\nusing ULL = unsigned long long;\n#define rep(i,n) for(int i=0; i<(n); i++)\n\nstruct Pos { int x, y; };\nPos operator+(Pos l, Pos r) { return { l.x + r.x,l.y + r.y }; }\nbool operator==(Pos l, Pos r) { return l.x == r.x && l.y == r.y; }\n\nstruct QueueNode { int d, score, itemmask, pos, lastitem; };\nbool operator<(QueueNode l, QueueNode r) {\n\tif(l.d != r.d) return l.d > r.d;\n\treturn l.score < r.score;\n}\n\n\nstatic const string SpMass = \"0123456789abcdefghijABCDEFGHIJST\";\n\nint H, W;\nint G[1000][1000];\nPos P[32];\nint Score[11][11];\n\nstatic const Pos dx[4] = { {-1,0},{1,0},{0,-1},{0,1} };\n\nint DG[1000][1000];\nint D[32][32];\n\npair<int, int> D2[1 << 10][32][11];\n\nint& at_G(Pos p) { return G[p.x][p.y]; }\nint& at_DG(Pos p) { return DG[p.x][p.y]; }\nbool onBoard(Pos p) {\n\tif (p.x < 0 || W <= p.x) return false;\n\tif (p.y < 0 || H <= p.y) return false;\n\treturn true;\n}\n\nint main() {\n\trep(i, 32) P[i] = { -1,-1 };\n\n\tcin >> W >> H;\n\trep(y, H) rep(x, W) {\n\t\tchar c; cin >> c;\n\t\tif (c == '.') { G[x][y] = 1; }\n\t\telse if (c == '#') { G[x][y] = 0; }\n\t\telse {\n\t\t\tint massTy = SpMass.find(c);\n\t\t\tG[x][y] = -1;\n\t\t\tP[massTy] = { x,y };\n\t\t}\n\t}\n\trep(i, 11) rep(j, 11) Score[i][j] = 0;\n\trep(i, 10) rep(j, 10) cin >> Score[i][j];\n\n\trep(i, 32) rep(j, 32) D[i][j] = -1;\n\n\trep(s, 32) {\n\t\tif (!onBoard(P[s])) continue;\n\t\trep(x, W) rep(y, H) DG[x][y] = -1;\n\n\t\tqueue<Pos> Q;\n\t\tQ.push(P[s]);\n\t\tat_DG(P[s]) = 0;\n\n\t\twhile (Q.size()) {\n\t\t\tPos p = Q.front(); Q.pop();\n\t\t\tif (at_G(p) == -1 && !(p == P[s])) continue;\n\t\t\trep(dxi, 4) {\n\t\t\t\tPos nx = p + dx[dxi];\n\t\t\t\tif (at_DG(nx) != -1) continue;\n\t\t\t\tif (!onBoard(nx)) continue;\n\t\t\t\tif (at_G(nx) == 0) continue;\n\t\t\t\tat_DG(nx) = at_DG(p) + 1;\n\t\t\t\tQ.push(nx);\n\t\t\t}\n\t\t}\n\n\t\trep(t, 32) if (onBoard(P[t])) D[s][t] = at_DG(P[t]);\n\t}\n\n\trep(i, 1 << 10) rep(j, 32) rep(k, 11) D2[i][j][k] = { -1, -1 };\n\t{\n\t\tpriority_queue<QueueNode> Q;\n\t\tQ.push({ 0,0,0,30,10 });\n\t\twhile (Q.size()) {\n\t\t\tQueueNode q = Q.top(); Q.pop();\n\t\t\tif (D2[q.itemmask][q.pos][q.lastitem].first != -1) continue;\n\t\t\tD2[q.itemmask][q.pos][q.lastitem] = { q.d, q.score };\n\n\t\t\tif (0 <= q.pos && q.pos < 10) if(0 == (q.itemmask & (1 << q.pos)))\n\t\t\t\tQ.push({ q.d, q.score + Score[q.lastitem][q.pos], q.itemmask | (1 << q.pos), q.pos, q.pos });\n\n\t\t\trep(to, 32) {\n\t\t\t\tif (10 <= to && to < 20) if (0 == ((1 << (to - 10)) & q.itemmask)) continue;\n\t\t\t\tif (20 <= to && to < 30) if (0 != ((1 << (to - 20)) & q.itemmask)) continue;\n\t\t\t\tif (D[q.pos][to] == -1) continue;\n\t\t\t\tQ.push({ q.d + D[q.pos][to], q.score, q.itemmask, to, q.lastitem });\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans_d = 10000000, ans_score = -1;\n\trep(i, 10) {\n\t\tif (D2[(1 << 10) - 1][31][i].first == -1) continue;\n\t\tbool ok = false;\n\t\tif (ans_d > D2[(1 << 10) - 1][31][i].first) ok = true;\n\t\tif (ans_d == D2[(1 << 10) - 1][31][i].first) if (ans_score < D2[(1 << 10) - 1][31][i].second) ok = true;\n\t\tif (ok) {\n\t\t\tans_d = D2[(1 << 10) - 1][31][i].first;\n\t\t\tans_score = D2[(1 << 10) - 1][31][i].second;\n\t\t}\n\t}\n\n\tif (ans_score == -1) { cout << -1 << endl; }\n\telse cout << ans_d << \" \" << ans_score << endl;\n\n\treturn 0;\n}", "accuracy": 0.29545454545454547, "time_ms": 510, "memory_kb": 26568, "score_of_the_acc": -1.0576, "final_rank": 16 }, { "submission_id": "aoj_0400_4979866", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing LL = long long;\nusing ULL = unsigned long long;\n#define rep(i,n) for(int i=0; i<(n); i++)\n\nstruct Pos { int x, y; };\nPos operator+(Pos l, Pos r) { return { l.x + r.x,l.y + r.y }; }\nbool operator==(Pos l, Pos r) { return l.x == r.x && l.y == r.y; }\n\nstruct QueueNode { int d, score, itemmask, pos, lastitem; };\nbool operator<(QueueNode l, QueueNode r) {\n\tif(l.d != r.d) return l.d > r.d;\n\treturn l.score < r.score;\n}\n\n\nstatic const string SpMass = \"0123456789abcdefghijABCDEFGHIJST\";\n\nint H, W;\nint G[1000][1000];\nPos P[32];\nint Score[11][11];\n\nstatic const Pos dx[4] = { {-1,0},{1,0},{0,-1},{0,1} };\n\nint DG[1000][1000];\nint D[32][32];\n\npair<int, int> D2[1 << 10][32][11];\n\nint& at_G(Pos p) { return G[p.x][p.y]; }\nint& at_DG(Pos p) { return DG[p.x][p.y]; }\nbool onBoard(Pos p) {\n\tif (p.x < 0 || W <= p.x) return false;\n\tif (p.y < 0 || H <= p.y) return false;\n\treturn true;\n}\n\nint main() {\n\trep(i, 32) P[i] = { -1,-1 };\n\n\tcin >> W >> H;\n\trep(y, H) rep(x, W) {\n\t\tchar c; cin >> c;\n\t\tif (c == '.') { G[x][y] = 1; }\n\t\telse if (c == '#') { G[x][y] = 0; }\n\t\telse {\n\t\t\tint massTy = SpMass.find(c);\n\t\t\tG[x][y] = -1;\n\t\t\tP[massTy] = { x,y };\n\t\t}\n\t}\n\trep(i, 11) rep(j, 11) Score[i][j] = 0;\n\trep(i, 10) rep(j, 10) cin >> Score[i][j];\n\n\trep(i, 32) rep(j, 32) D[i][j] = -1;\n\n\trep(s, 32) {\n\t\tif (!onBoard(P[s])) continue;\n\t\trep(x, W) rep(y, H) DG[x][y] = -1;\n\n\t\tqueue<Pos> Q;\n\t\tQ.push(P[s]);\n\t\tat_DG(P[s]) = 0;\n\n\t\twhile (Q.size()) {\n\t\t\tPos p = Q.front(); Q.pop();\n\t\t\tif (at_G(p) == -1 && !(p == P[s])) continue;\n\t\t\trep(dxi, 4) {\n\t\t\t\tPos nx = p + dx[dxi];\n\t\t\t\tif (at_DG(nx) != -1) continue;\n\t\t\t\tif (!onBoard(nx)) continue;\n\t\t\t\tif (at_G(nx) == 0) continue;\n\t\t\t\tat_DG(nx) = at_DG(p) + 1;\n\t\t\t\tQ.push(nx);\n\t\t\t}\n\t\t}\n\n\t\trep(t, 32) if (onBoard(P[t])) D[s][t] = at_DG(P[t]);\n\t}\n\n\trep(i, 1 << 10) rep(j, 32) rep(k, 11) D2[i][j][k] = { -1, -1 };\n\t{\n\t\tpriority_queue<QueueNode> Q;\n\t\tQ.push({ 0,0,0,30,10 });\n\t\twhile (Q.size()) {\n\t\t\tQueueNode q = Q.top(); Q.pop();\n\t\t\tif (D2[q.itemmask][q.pos][q.lastitem].first != -1) continue;\n\t\t\tD2[q.itemmask][q.pos][q.lastitem] = { q.d, q.score };\n\n\t\t\tif (0 <= q.pos && q.pos < 10)\n\t\t\t\tQ.push({ q.d, q.score + Score[q.lastitem][q.pos], q.itemmask | (1 << q.pos), q.pos, q.pos });\n\n\t\t\trep(to, 32) {\n\t\t\t\tif (10 <= to && to < 20) if (0 == ((1 << (to - 10)) & q.itemmask)) continue;\n\t\t\t\tif (20 <= to && to < 30) if (0 != ((1 << (to - 20)) & q.itemmask)) continue;\n\t\t\t\tif (D[q.pos][to] == -1) continue;\n\t\t\t\tQ.push({ q.d + D[q.pos][to], q.score, q.itemmask, to, q.lastitem });\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans_d = 10000000, ans_score = -1;\n\trep(i, 10) {\n\t\tif (D2[(1 << 10) - 1][31][i].first == -1) continue;\n\t\tbool ok = false;\n\t\tif (ans_d > D2[(1 << 10) - 1][31][i].first) ok = true;\n\t\tif (ans_d == D2[(1 << 10) - 1][31][i].first) if (ans_score < D2[(1 << 10) - 1][31][i].second) ok = true;\n\t\tif (ok) {\n\t\t\tans_d = D2[(1 << 10) - 1][31][i].first;\n\t\t\tans_score = D2[(1 << 10) - 1][31][i].second;\n\t\t}\n\t}\n\n\tif (ans_score == -1) { cout << -1 << endl; }\n\telse cout << ans_d << \" \" << ans_score << endl;\n\n\treturn 0;\n}", "accuracy": 0.09090909090909091, "time_ms": 130, "memory_kb": 16180, "score_of_the_acc": -0.4203, "final_rank": 20 }, { "submission_id": "aoj_0400_4978756", "code_snippet": "#include<bits/stdc++.h>\n#define newl endl\n#define all(vec) vec.begin(),vec.end()\nusing namespace std;\ntemplate<class T>\nusing V=vector<T>;\nusing ll=long long;\nconst ll INF=1LL<<30;\nconst ll mod=1e9+7;\nusing P=pair<int,int>;\nint dy[4]={0,1,0,-1},dx[4]={1,0,-1,0};\nbool chmin(P& a,P b){if(a>b){a=b;return true;}return false;}\nvoid ok(){cout<<\"ok\"<<newl;}\nint main(){\n int w,h;cin>>w>>h;\n V<string> c(h);\n V<int> y(32,-1),x(32,-1);\n for(int i=0;i<h;i++){\n cin>>c[i];\n for(int j=0;j<w;j++){\n if(c[i][j]=='S'){\n y[30]=i,x[30]=j;\n }else if(c[i][j]=='T'){\n y[31]=i,x[31]=j;\n }else if(0<=c[i][j]-'0'&&c[i][j]-'0'<=9){\n y[c[i][j]-'0']=i,x[c[i][j]-'0']=j;\n }else if(0<=c[i][j]-'a'&&c[i][j]-'a'<=9){\n y[20+c[i][j]-'a']=i,x[20+c[i][j]-'a']=j;\n }else if(isupper(c[i][j])){\n y[10+c[i][j]-'A']=i,x[10+c[i][j]-'A']=j;\n }\n }\n }\n V<V<int>> d(32,V<int>(32,INF)),ds(h,V<int>(w));\n for(int i=0;i<32;i++){\n if(y[i]<0)continue;\n for(int j=0;j<h;j++)for(int k=0;k<w;k++)ds[j][k]=INF;\n ds[y[i]][x[i]]=0;\n queue<P> q;\n q.emplace(y[i],x[i]);\n while(!q.empty()){\n int yy=q.front().first,xx=q.front().second;\n q.pop();\n if(c[yy][xx]!='.'&&c[yy][xx]!=c[y[i]][x[i]]){\n if(c[yy][xx]=='S'){\n d[i][30]=ds[yy][xx];\n }else if(c[yy][xx]=='T'){\n d[i][31]=ds[yy][xx];\n }else if(0<=c[yy][xx]-'0'&&c[yy][xx]-'0'<=9){\n d[i][c[yy][xx]-'0']=ds[yy][xx];\n }else if(islower(c[yy][xx])){\n d[i][20+c[yy][xx]-'a']=ds[yy][xx];\n }else if(isupper(c[yy][xx])){\n d[i][10+c[yy][xx]-'A']=ds[yy][xx];\n }\n continue;\n }\n for(int j=0;j<4;j++){\n int ny=yy+dy[j],nx=xx+dx[j];\n if(ny<0||nx<0||ny>=h||nx>=w)continue;\n if(c[ny][nx]=='#'||ds[ny][nx]!=INF)continue;\n ds[ny][nx]=ds[yy][xx]+1;\n q.emplace(ny,nx);\n }\n }\n }\n V<V<int>> s(11,V<int>(11,INF));\n for(int i=0;i<10;i++){\n for(int j=0;j<10;j++){\n cin>>s[i][j];\n }\n }\n V<V<V<P>>> dp(32,V<V<P>>(1<<10,V<P>(10,P(INF,0))));\n priority_queue<pair<P,int>,V<pair<P,int>>,greater<pair<P,int>>> que;\n dp[30][0][0]=P(0,0);\n que.emplace(P(0,0),30*(1<<10)*10);\n while(!que.empty()){\n int dd=que.top().first.first,id=que.top().second,sc=que.top().first.second;\n que.pop();\n int i=id/((1<<10)*10);\n int j=(id-i*((1<<10)*10))/10;\n int k=id%10;\n if(dd>dp[i][j][k].first)continue;\n for(int l=0;l<32;l++){\n if(l==i||d[i][l]==INF)continue;\n int ts=sc;\n if(j>0&&l<=9)ts=sc-s[k][l];\n if(l<=9){\n if(!((j>>l)&1)){\n if(chmin(dp[l][j|(1<<l)][l],P(dd+d[i][l],ts)))que.emplace(make_pair(dp[l][j|(1<<l)][l],l*(1<<10)*10+(j|(1<<l))*10+l));\n }\n if(chmin(dp[l][j][k],P(dd+d[i][l],sc)))que.emplace(make_pair(dp[l][j][k],l*(1<<10)*10+j*10+k));\n }else if(l<=19){\n if((j>>(l-10))&1)continue;\n if(chmin(dp[l][j][k],P(dd+d[i][l],ts)))que.emplace(make_pair(dp[l][j][k],l*(1<<10)*10+j*10+k));\n }else if(l<=29){\n if(!((j>>(l-20))&1))continue;\n if(chmin(dp[l][j][k],P(dd+d[i][l],ts)))que.emplace(make_pair(dp[l][j][k],l*(1<<10)*10+j*10+k));\n }else{\n if(chmin(dp[l][j][k],P(dd+d[i][l],ts)))que.emplace(make_pair(dp[l][j][k],l*(1<<10)*10+j*10+k));\n }\n }\n }\n P res=P(INF,0);\n for(int i=0;i<10;i++){\n res=min(res,dp[31][(1<<10)-1][i]);\n }\n if(res.first==INF){\n cout<<-1<<newl;\n return 0;\n }\n cout<<res.first<<\" \"<<-res.second<<newl;\n}", "accuracy": 1, "time_ms": 470, "memory_kb": 11836, "score_of_the_acc": -0.6477, "final_rank": 6 }, { "submission_id": "aoj_0400_4978733", "code_snippet": "#include<bits/stdc++.h>\n#define newl endl\n#define all(vec) vec.begin(),vec.end()\nusing namespace std;\ntemplate<class T>\nusing V=vector<T>;\nusing ll=long long;\nconst ll INF=1LL<<30;\nconst ll mod=1e9+7;\nusing P=pair<int,int>;\nint dy[4]={0,1,0,-1},dx[4]={1,0,-1,0};\nbool chmin(P& a,P b){if(a>b){a=b;return true;}return false;}\nvoid ok(){cout<<\"ok\"<<newl;}\nint main(){\n int w,h;cin>>w>>h;\n V<string> c(h);\n V<int> y(32,-1),x(32,-1);\n for(int i=0;i<h;i++){\n cin>>c[i];\n for(int j=0;j<w;j++){\n if(c[i][j]=='S'){\n y[30]=i,x[30]=j;\n }else if(c[i][j]=='T'){\n y[31]=i,x[31]=j;\n }else if(0<=c[i][j]-'0'&&c[i][j]-'0'<=9){\n y[c[i][j]-'0']=i,x[c[i][j]-'0']=j;\n }else if(0<=c[i][j]-'a'&&c[i][j]-'a'<=9){\n y[20+c[i][j]-'a']=i,x[20+c[i][j]-'a']=j;\n }else if(isupper(c[i][j])){\n y[10+c[i][j]-'A']=i,x[10+c[i][j]-'A']=j;\n }\n }\n }\n V<V<int>> d(32,V<int>(32,INF)),ds(h,V<int>(w));\n for(int i=0;i<32;i++){\n if(y[i]<0)continue;\n for(int j=0;j<h;j++)for(int k=0;k<w;k++)ds[j][k]=INF;\n ds[y[i]][x[i]]=0;\n queue<P> q;\n q.emplace(y[i],x[i]);\n while(!q.empty()){\n int yy=q.front().first,xx=q.front().second;\n q.pop();\n if(c[yy][xx]!='.'&&c[yy][xx]!=c[y[i]][x[i]]){\n if(c[yy][xx]=='S'){\n d[i][30]=ds[yy][xx];\n }else if(c[yy][xx]=='T'){\n d[i][31]=ds[yy][xx];\n }else if(0<=c[yy][xx]-'0'&&c[yy][xx]-'0'<=9){\n d[i][c[yy][xx]-'0']=ds[yy][xx];\n }else if(islower(c[yy][xx])){\n d[i][20+c[yy][xx]-'a']=ds[yy][xx];\n }else if(isupper(c[yy][xx])){\n d[i][10+c[yy][xx]-'A']=ds[yy][xx];\n }\n continue;\n }\n for(int j=0;j<4;j++){\n int ny=yy+dy[j],nx=xx+dx[j];\n if(ny<0||nx<0||ny>=h||nx>=w)continue;\n if(c[ny][nx]=='#'||ds[ny][nx]!=INF)continue;\n ds[ny][nx]=ds[yy][xx]+1;\n q.emplace(ny,nx);\n }\n }\n }\n V<V<int>> s(11,V<int>(11,INF));\n for(int i=0;i<10;i++){\n for(int j=0;j<10;j++){\n cin>>s[i][j];\n }\n }\n V<V<V<P>>> dp(32,V<V<P>>(1<<10,V<P>(10,P(INF,0))));\n priority_queue<pair<P,int>,V<pair<P,int>>,greater<pair<P,int>>> que;\n dp[30][0][0]=P(0,0);\n que.emplace(P(0,0),30*(1<<10)*10);\n while(!que.empty()){\n int dd=que.top().first.first,id=que.top().second,sc=que.top().first.second;\n que.pop();\n int i=id/((1<<10)*10);\n int j=(id-i*((1<<10)*10))/10;\n int k=id%10;\n if(dd>dp[i][j][k].first)continue;\n for(int l=0;l<32;l++){\n if(l==i)continue;\n int ts=sc;\n if(j>0&&l<=9)ts=sc-s[k][l];\n if(l<=9){\n if(chmin(dp[l][j|(1<<l)][l],P(dd+d[i][l],ts)))que.emplace(make_pair(dp[l][j|(1<<l)][l],l*(1<<10)*10+(j|(1<<l))*10+l));\n }else if(l<=19){\n if((j>>(l-10))&1)continue;\n if(chmin(dp[l][j][k],P(dd+d[i][l],ts)))que.emplace(make_pair(dp[l][j][k],l*(1<<10)*10+j*10+k));\n }else if(l<=29){\n if(!((j>>(l-20))&1))continue;\n if(chmin(dp[l][j][k],P(dd+d[i][l],ts)))que.emplace(make_pair(dp[l][j][k],l*(1<<10)*10+j*10+k));\n }else{\n if(chmin(dp[l][j][k],P(dd+d[i][l],ts)))que.emplace(make_pair(dp[l][j][k],l*(1<<10)*10+j*10+k));\n }\n }\n }\n P res=P(INF,0);\n for(int i=0;i<10;i++){\n res=min(res,dp[31][(1<<10)-1][i]);\n }\n if(res.first==INF){\n cout<<-1<<newl;\n return 0;\n }\n cout<<res.first<<\" \"<<-res.second<<newl;\n}", "accuracy": 0.09090909090909091, "time_ms": 20, "memory_kb": 7356, "score_of_the_acc": -0.0896, "final_rank": 19 }, { "submission_id": "aoj_0400_4976694", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nvector<int> dy = {1, 0, -1, 0};\nvector<int> dx = {0, 1, 0, -1};\nconst int INF = 100000000;\nint main(){\n int W, H;\n cin >> W >> H;\n vector<vector<char>> c(H + 2, vector<char>(W + 2, '#'));\n for (int i = 1; i <= H; i++){\n for (int j = 1; j <= W; j++){\n cin >> c[i][j];\n }\n }\n vector<vector<int>> s(10, vector<int>(10));\n for (int i = 0; i < 10; i++){\n for (int j = 0; j < 10; j++){\n cin >> s[i][j];\n }\n }\n vector<int> y, x;\n int V = y.size();\n for (int i = 1; i <= H; i++){\n for (int j = 1; j <= W; j++){\n if (c[i][j] != '#' && c[i][j] != '.'){\n y.push_back(i);\n x.push_back(j);\n V++;\n }\n }\n }\n vector<vector<int>> d(V, vector<int>(V, INF));\n for (int i = 0; i < V; i++){\n vector<vector<int>> d2(H + 2, vector<int>(W + 2, INF));\n d2[y[i]][x[i]] = 0;\n queue<pair<int, int>> Q;\n Q.push(make_pair(y[i], x[i]));\n while (!Q.empty()){\n int cy = Q.front().first;\n int cx = Q.front().second;\n Q.pop();\n for (int j = 0; j < 4; j++){\n int y2 = cy + dy[j];\n int x2 = cx + dx[j];\n if (c[y2][x2] != '#'){\n if (d2[y2][x2] == INF){\n d2[y2][x2] = d2[cy][cx] + 1;\n if (c[y2][x2] == '.'){\n Q.push(make_pair(y2, x2));\n }\n } \n }\n }\n }\n for (int j = 0; j < V; j++){\n d[i][j] = d2[y[j]][x[j]];\n }\n }\n vector<int> id(12);\n vector<int> up(10, -1), lo(10, -1);\n for (int i = 0; i < V; i++){\n char ch = c[y[i]][x[i]];\n if (ch == 'S'){\n id[0] = i;\n }\n if (ch == 'T'){\n id[1] = i;\n }\n if ('0' <= ch && ch <= '9'){\n id[ch - '0' + 2] = i;\n }\n if ('A' <= ch && ch <= 'J'){\n up[ch - 'A'] = i;\n }\n if ('a' <= ch && ch <= 'j'){\n lo[ch - 'a'] = i;\n }\n }\n vector<vector<vector<int>>> d2(1024, vector<vector<int>>(12, vector<int>(12, INF)));\n for (int i = 0; i < 1024; i++){\n vector<bool> ok(V, true);\n for (int j = 0; j < 10; j++){\n if (i >> j & 1){\n if (up[j] != -1){\n ok[up[j]] = false;\n }\n } else {\n if (lo[j] != -1){\n ok[lo[j]] = false;\n }\n }\n }\n vector<vector<int>> E = d;\n for (int j = 0; j < V; j++){\n for (int k = 0; k < V; k++){\n if (!ok[j] || !ok[k]){\n E[j][k] = INF;\n }\n }\n }\n for (int j = 0; j < V; j++){\n for (int k = 0; k < V; k++){\n for (int l = 0; l < V; l++){\n E[k][l] = min(E[k][l], E[k][j] + E[j][l]);\n }\n }\n }\n for (int j = 0; j < 12; j++){\n for (int k = 0; k < 12; k++){\n d2[i][j][k] = E[id[j]][id[k]];\n }\n }\n }\n int ans1 = INF;\n int ans2 = 0;\n vector<int> p(10);\n for (int i = 0; i < 10; i++){\n p[i] = i;\n }\n for (int i = 0; i < 3628800; i++){\n long long dist = 0;\n int S = 0;\n dist += d2[0][0][p[0] + 2];\n int score = 0;\n for (int j = 0; j < 9; j++){\n S += 1 << p[j];\n score += s[p[j]][p[j + 1]];\n dist += d2[S][p[j] + 2][p[j + 1] + 2];\n }\n dist += d2[1023][p[9] + 2][1];\n if (dist < ans1){\n ans1 = dist;\n ans2 = score;\n } else if (dist == ans1){\n ans2 = max(ans2, score);\n }\n next_permutation(p.begin(), p.end());\n }\n if (ans1 == INF){\n cout << -1 << endl;\n } else {\n cout << ans1 << ' ' << ans2 << endl;\n }\n}", "accuracy": 1, "time_ms": 440, "memory_kb": 7864, "score_of_the_acc": -0.5182, "final_rank": 4 }, { "submission_id": "aoj_0400_4974159", "code_snippet": "#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\n \n#define REP(i, n) for (ll i = 0; i < n; i++)\n#define REPR(i, n) for (ll i = n; i >= 0; i--)\n#define FOR(i, m, n) for (ll i = m; i < n; i++)\n#define FORR(i, m, n) for (ll i = m; i >= n; i--)\n#define REPO(i, n) for (ll i = 1; i <= n; i++)\n#define ll long long\n#define INF (ll)1 << 60\n#define MINF (-1 INF)\n#define ALL(n) n.begin(), n.end()\n#define MOD 1000000007\n#define P pair<ll, ll>\n\nll v1[4] = {1, -1, 0, 0}, v2[4] = {0, 0, 1, -1};\n#define PP pair<P, ll>\nll h, w, t[11][11], d[40][40], dp[1100][12][12], dp2[1100][12];\nstring s[1100];\nunordered_map<char, int> mp;\n\nvoid bfs(int x, int y, int num){//0~9, .の道\n vector<vector<bool>> used(h, vector<bool>(w));\n queue<PP> q;\n q.push(PP(P(x, y), 0));\n used[x][y] = true;\n while(!q.empty()){\n PP now = q.front();\n ll nx = now.first.first, ny = now.first.second, di = now.second;\n q.pop();\n ll nmp = mp[s[nx][ny]];\n if (nmp <= 31) d[num][nmp] = min(d[num][nmp], di);\n if (!(nmp == num) and ((nmp >= 10 and nmp <= 29) or nmp == 33)) continue;//!!!\n REP(i, 4){\n ll rx = nx + v1[i], ry = ny + v2[i];\n if (0 > rx or rx >= h or 0 > ry or ry >= w) continue;\n if (used[rx][ry]) continue;\n if (mp[s[rx][ry]] == 33) continue;\n used[rx][ry] = true;\n q.push(PP(P(rx, ry), di + 1));\n }\n //cout << nx << \" \" << ny << endl;\n }\n // cout << \"!\" << endl;\n}\n\nll bfs2(ll b, ll x, ll y){\n if (x == 10) x = 30;\n if (y == 11) y = 31;\n vector<ll> ds(33, INF), ls;\n ds[x] = 0;\n REP(i, 10){\n if (b & (1 << i)) ls.push_back(20 + i);\n else ls.push_back(10 + i);\n }\n ls.push_back(y);\n priority_queue<P, vector<P>, greater<P>> q;\n \n q.push(P(0, x));\n while(!q.empty()){\n P now = q.top();\n q.pop();\n ll c = now.first, fr = now.second;\n if (c > ds[fr]) continue;\n REP(i, ls.size()){\n if(ds[fr] + d[fr][ls[i]] < ds[ls[i]]){\n ds[ls[i]] = ds[fr] + d[fr][ls[i]];\n q.push(P(ds[ls[i]], ls[i]));\n }\n }\n }\n return ds[y];\n \n}\n\nint main(){\n REP(i, 40){\n REP(j, 40){\n if (i != j) d[i][j] = INF;\n }\n }\n cin >> w >> h;\n REP(i, h){\n cin >> s[i];\n }\n REP(i, 10){\n REP(j, 10){\n cin >> t[i][j];\n }\n }\n REP(i, 10){\n mp['0' + i] = i;\n mp['A' + i] = 10 + i;\n mp['a' + i] = 20 + i;\n }\n mp['S'] = 30;\n mp['T'] = 31;\n mp['.'] = 32;\n mp['#'] = 33;\n //cout << \"!\" << endl;\n REP(i, h){\n REP(j, w){\n if (mp[s[i][j]] <= 31) bfs(i, j, mp[s[i][j]]);\n }\n }\n // cout << \"!\" << endl;\n REP(k, 1 << 10){\n REP(i, 10){\n REP(j, 10){\n if (i == j) continue;\n dp[k][i][j] = bfs2(k, i, j);\n }\n }\n }\n REP(i, 10){\n dp[0][10][i] = bfs2(0, 10, i);\n dp[(1 << 10) - 1][i][11] = bfs2((1 << 10) - 1, i, 11);\n }\n ll ans = INF, ans2 = 0;\n vector<int> v;\n v = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9};\n do{\n bool ok = true;\n ll n1 = 0, n2 = 0, nb = 0;\n if (dp[0][10][v[0]] == INF) ok = false;\n n1 += dp[0][10][v[0]];\n nb += (1 << v[0]);\n REP(i, 9){\n if (dp[nb][v[i]][v[i + 1]] == INF) ok = false;\n n1 += dp[nb][v[i]][v[i + 1]];\n nb += (1 << v[i + 1]);\n n2 += t[v[i]][v[i + 1]];\n }\n if (dp[(1 << 10) - 1][v[9]][11] == INF) ok = false;\n n1 += dp[(1 << 10) - 1][v[9]][11];\n if (!ok) continue;\n if(ans > n1){\n ans = n1;\n ans2 = n2;\n }\n else if(ans == n1 and ans2 < n2){\n ans2 = n2;\n }\n } while (next_permutation(ALL(v)));\n if (ans == INF) cout << -1 << endl;\n else cout << ans << \" \" << ans2 << endl;\n}", "accuracy": 1, "time_ms": 1030, "memory_kb": 5400, "score_of_the_acc": -1.0404, "final_rank": 10 }, { "submission_id": "aoj_0400_4912959", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\ntemplate <class T, class U>\nvector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }\n\ntemplate<class... Ts, class U>\nauto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }\n\ntemplate<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }\ntemplate<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }\n\ntemplate <class K, class V>\nclass RadixHeap {\n static constexpr int bit_length = sizeof(K)*8;\n K last;\n size_t sz, cnt;\n array<vector<pair<K, V>>, bit_length> v;\n static inline int bsr(int x){\n return x ? bit_length-__builtin_clz(x) : 0;\n }\n static inline int bsr(ll x){\n return x ? bit_length-__builtin_clzll(x) : 0;\n }\n\n void pull() {\n if(cnt < v[0].size()) return;;\n int i = 1;\n while(v[i].empty()) i++;\n last = min_element(v[i].begin(),v[i].end())->first;\n for (auto &&x : v[i]) v[bsr(x.first ^ last)].push_back(x);\n v[i].clear();\n }\npublic:\n RadixHeap() : last(0), sz(0), cnt(0) {}\n void emplace(K x, V val){\n sz++;\n v[bsr(x^last)].emplace_back(x, val);\n }\n\n pair<K, V> top() {\n pull();\n return v[0][cnt];\n }\n\n void pop() {\n pull();\n sz--;\n cnt++;\n }\n\n size_t size() const { return sz; }\n bool empty() const { return !sz; }\n};\n\nint main() {\n int w, h;\n cin >> w >> h;\n vector<string> v(h);\n for (auto &&i : v) cin >> i;\n string s = \"ST0123456789ABCDEFGHIJabcdefghij\";\n array<int, 256> si;\n for (int i = 0; i < s.size(); ++i) si[s[i]] = i;\n vector<int> ys(32, -1), xs(32, -1);\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n if(v[i][j] == '.' || v[i][j] == '#') continue;\n for (int k = 0; k < s.size(); ++k) {\n if(v[i][j] == s[k]) ys[k] = i, xs[k] = j;\n }\n }\n }\n vector dist(h, vector(w, 0));\n array<int, 4> dy{-1, 1, 0, 0}, dx{0, 0, -1, 1};\n auto in = [&](const int y, const int x){ return 0 <= y && y < h && 0 <= x && x < w && v[y][x] != '#'; };\n vector<vector<pair<int, ll>>> G(32);\n int po[10][10];\n for (auto &&i : po) for(auto &&j : i) cin >> j;\n for (int i = 0; i < 32; ++i) {\n if(!~ys[i]) continue;\n for (auto &&j : dist) fill(j.begin(),j.end(), -1);\n dist[ys[i]][xs[i]] = 0;\n queue<pair<int, int>> Q;\n Q.emplace(ys[i], xs[i]);\n while(!Q.empty()){\n auto [y, x] = Q.front(); Q.pop();\n for (int k = 0; k < 4; ++k) {\n int yy = y+dy[k], xx = x+dx[k];\n if(in(yy, xx)){\n if(!~dist[yy][xx]){\n dist[yy][xx] = dist[y][x]+1;\n if(v[yy][xx] == '.') Q.emplace(yy, xx);\n else G[i].emplace_back(si[v[yy][xx]], 1000LL*dist[yy][xx]);\n }\n }\n }\n }\n }\n auto dp = make_v(32, 1 << 10, 10, INF<ll>);\n dp[0][0][0] = 0;\n RadixHeap<ll, int> Q;\n Q.emplace(0, 0);\n auto up = [&](int x, int y, int z, ll val){\n if(dp[x][y][z] <= val) return;\n dp[x][y][z] = val;\n Q.emplace(val, (x << 14)|(y << 4)|z);\n };\n while(!Q.empty()){\n int a, b, c;\n auto [cost, tmp] = Q.top(); Q.pop();\n c = tmp&15, b = (tmp >> 4)&1023, a = (tmp >> 14);\n if(dp[a][b][c] != cost) continue;\n for (auto &&i : G[a]) {\n if(i.first < 2) up(i.first, b, c, cost+i.second);\n else if(i.first < 12){\n up(i.first, b, c, cost+i.second);\n if(b&(1 << (i.first-2))) continue;\n if(!b) up(i.first, 1<<(i.first-2), i.first-2,cost+i.second);\n else up(i.first, b|(1<<(i.first-2)), i.first-2, cost+i.second-po[c][i.first-2]);\n }else if(i.first < 22){\n if(!(b &(1 << (i.first-12)))) up(i.first, b, c, cost+i.second);\n }else {\n if((b & (1 << (i.first-22)))) up(i.first, b, c, cost+i.second);\n }\n }\n }\n ll ans = INF<ll>;\n for (int j = 0; j < 10; ++j) {\n chmin(ans, dp[1].back()[j]);\n }\n if(ans == INF<ll>) puts(\"-1\");\n else {\n ll a = (ans+999)/1000, b = a*1000-ans;\n cout << a << \" \" << b << \"\\n\";\n }\n return 0;\n}", "accuracy": 1, "time_ms": 360, "memory_kb": 16508, "score_of_the_acc": -0.6562, "final_rank": 7 }, { "submission_id": "aoj_0400_4912904", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\ntemplate <class T, class U>\nvector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }\n\ntemplate<class... Ts, class U>\nauto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }\n\ntemplate<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }\ntemplate<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }\n\ntemplate <class K, class V>\nclass RadixHeap {\n static constexpr int bit_length = sizeof(K)*8;\n K last;\n size_t sz, cnt;\n array<vector<pair<K, V>>, bit_length> v;\n static inline int bsr(int x){\n return x ? bit_length-__builtin_clz(x) : 0;\n }\n static inline int bsr(ll x){\n return x ? bit_length-__builtin_clzll(x) : 0;\n }\n\n void pull() {\n if(cnt < v[0].size()) return;;\n int i = 1;\n while(v[i].empty()) i++;\n last = min_element(v[i].begin(),v[i].end())->first;\n for (auto &&x : v[i]) v[bsr(x.first ^ last)].push_back(x);\n v[i].clear();\n }\npublic:\n RadixHeap() : last(0), sz(0), cnt(0) {}\n void emplace(K x, V val){\n sz++;\n v[bsr(x^last)].emplace_back(x, val);\n }\n\n pair<K, V> top() {\n pull();\n return v[0][cnt];\n }\n\n void pop() {\n pull();\n sz--;\n cnt++;\n }\n\n size_t size() const { return sz; }\n bool empty() const { return !sz; }\n};\n\nint main() {\n int w, h;\n cin >> w >> h;\n vector<string> v(h);\n for (auto &&i : v) cin >> i;\n string s = \"ST0123456789ABCDEFGHIJabcdefghij\";\n array<int, 256> si;\n for (int i = 0; i < s.size(); ++i) si[s[i]] = i;\n vector<int> ys(32, -1), xs(32, -1);\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n if(v[i][j] == '.' || v[i][j] == '#') continue;\n for (int k = 0; k < s.size(); ++k) {\n if(v[i][j] == s[k]) ys[k] = i, xs[k] = j;\n }\n }\n }\n vector dist(h, vector(w, 0));\n array<int, 4> dy{-1, 1, 0, 0}, dx{0, 0, -1, 1};\n auto in = [&](const int y, const int x){ return 0 <= y && y < h && 0 <= x && x < w && v[y][x] != '#'; };\n vector<vector<pair<int, ll>>> G(32);\n int po[10][10];\n for (auto &&i : po) for(auto &&j : i) cin >> j;\n for (int i = 0; i < 32; ++i) {\n if(!~ys[i]) continue;\n for (auto &&j : dist) fill(j.begin(),j.end(), -1);\n dist[ys[i]][xs[i]] = 0;\n queue<pair<int, int>> Q;\n Q.emplace(ys[i], xs[i]);\n while(!Q.empty()){\n auto [y, x] = Q.front(); Q.pop();\n for (int k = 0; k < 4; ++k) {\n int yy = y+dy[k], xx = x+dx[k];\n if(in(yy, xx)){\n if(!~dist[yy][xx]){\n dist[yy][xx] = dist[y][x]+1;\n if(v[yy][xx] == '.') Q.emplace(yy, xx);\n else G[i].emplace_back(si[v[yy][xx]], 1000LL*dist[yy][xx]);\n }\n }\n }\n }\n }\n auto dp = make_v(32, 1 << 10, 10, INF<ll>);\n dp[0][0][0] = 0;\n RadixHeap<ll, int> Q;\n Q.emplace(0, 0);\n auto up = [&](int x, int y, int z, int val){\n if(dp[x][y][z] <= val) return;\n dp[x][y][z] = val;\n Q.emplace(val, (x << 14)|(y << 4)|z);\n };\n while(!Q.empty()){\n int a, b, c;\n auto [cost, tmp] = Q.top(); Q.pop();\n c = tmp&15, b = (tmp >> 4)&1023, a = (tmp >> 14);\n if(dp[a][b][c] != cost) continue;\n for (auto &&i : G[a]) {\n if(i.first < 2) up(i.first, b, c, cost+i.second);\n else if(i.first < 12){\n up(i.first, b, c, cost+i.second);\n if(b&(1 << (i.first-2))) continue;\n if(!b) up(i.first, 1<<(i.first-2), i.first-2,cost+i.second);\n else up(i.first, b|(1<<(i.first-2)), i.first-2, cost+i.second-po[c][i.first-2]);\n }else if(i.first < 22){\n if(!(b &(1 << (i.first-12)))) up(i.first, b, c, cost+i.second);\n }else {\n if((b & (1 << (i.first-22)))) up(i.first, b, c, cost+i.second);\n }\n }\n }\n ll ans = INF<ll>;\n for (int j = 0; j < 10; ++j) {\n chmin(ans, dp[1].back()[j]);\n }\n if(ans == INF<ll>) puts(\"-1\");\n else {\n ll a = (ans+999)/1000, b = a*1000-ans;\n cout << a << \" \" << b << \"\\n\";\n }\n return 0;\n}", "accuracy": 0.9318181818181818, "time_ms": 360, "memory_kb": 16384, "score_of_the_acc": -0.6531, "final_rank": 14 }, { "submission_id": "aoj_0400_4912903", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\ntemplate <class T, class U>\nvector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }\n\ntemplate<class... Ts, class U>\nauto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }\n\ntemplate<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }\ntemplate<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }\n\ntemplate <class K, class V>\nclass RadixHeap {\n static constexpr int bit_length = sizeof(K)*8;\n K last;\n size_t sz, cnt;\n array<vector<pair<K, V>>, bit_length> v;\n static inline int bsr(int x){\n return x ? bit_length-__builtin_clz(x) : 0;\n }\n static inline int bsr(ll x){\n return x ? bit_length-__builtin_clzll(x) : 0;\n }\n\n void pull() {\n if(cnt < v[0].size()) return;;\n int i = 1;\n while(v[i].empty()) i++;\n last = min_element(v[i].begin(),v[i].end())->first;\n for (auto &&x : v[i]) v[bsr(x.first ^ last)].push_back(x);\n v[i].clear();\n }\npublic:\n RadixHeap() : last(0), sz(0), cnt(0) {}\n void emplace(K x, V val){\n sz++;\n v[bsr(x^last)].emplace_back(x, val);\n }\n\n pair<K, V> top() {\n pull();\n return v[0][cnt];\n }\n\n void pop() {\n pull();\n sz--;\n cnt++;\n }\n\n size_t size() const { return sz; }\n bool empty() const { return !sz; }\n};\n\nint main() {\n int w, h;\n cin >> w >> h;\n vector<string> v(h);\n for (auto &&i : v) cin >> i;\n string s = \"ST0123456789ABCDEFGHIJabcdefghij\";\n array<int, 256> si;\n for (int i = 0; i < s.size(); ++i) si[s[i]] = i;\n vector<int> ys(32, -1), xs(32, -1);\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n if(v[i][j] == '.' || v[i][j] == '#') continue;\n for (int k = 0; k < s.size(); ++k) {\n if(v[i][j] == s[k]) ys[k] = i, xs[k] = j;\n }\n }\n }\n vector dist(h, vector(w, 0));\n array<int, 4> dy{-1, 1, 0, 0}, dx{0, 0, -1, 1};\n auto in = [&](const int y, const int x){ return 0 <= y && y < h && 0 <= x && x < w && v[y][x] != '#'; };\n vector<vector<pair<int, int>>> G(32);\n int po[10][10];\n for (auto &&i : po) for(auto &&j : i) cin >> j;\n for (int i = 0; i < 32; ++i) {\n if(!~ys[i]) continue;\n for (auto &&j : dist) fill(j.begin(),j.end(), -1);\n dist[ys[i]][xs[i]] = 0;\n queue<pair<int, int>> Q;\n Q.emplace(ys[i], xs[i]);\n while(!Q.empty()){\n auto [y, x] = Q.front(); Q.pop();\n for (int k = 0; k < 4; ++k) {\n int yy = y+dy[k], xx = x+dx[k];\n if(in(yy, xx)){\n if(!~dist[yy][xx]){\n dist[yy][xx] = dist[y][x]+1;\n if(v[yy][xx] == '.') Q.emplace(yy, xx);\n else G[i].emplace_back(si[v[yy][xx]], 1000*dist[yy][xx]);\n }\n }\n }\n }\n }\n auto dp = make_v(32, 1 << 10, 10, INF<ll>);\n dp[0][0][0] = 0;\n RadixHeap<ll, int> Q;\n Q.emplace(0, 0);\n auto up = [&](int x, int y, int z, int val){\n if(dp[x][y][z] <= val) return;\n dp[x][y][z] = val;\n Q.emplace(val, (x << 14)|(y << 4)|z);\n };\n while(!Q.empty()){\n int a, b, c;\n auto [cost, tmp] = Q.top(); Q.pop();\n c = tmp&15, b = (tmp >> 4)&1023, a = (tmp >> 14);\n if(dp[a][b][c] != cost) continue;\n for (auto &&i : G[a]) {\n if(i.first < 2) up(i.first, b, c, cost+i.second);\n else if(i.first < 12){\n up(i.first, b, c, cost+i.second);\n if(b&(1 << (i.first-2))) continue;\n if(!b) up(i.first, 1<<(i.first-2), i.first-2,cost+i.second);\n else up(i.first, b|(1<<(i.first-2)), i.first-2, cost+i.second-po[c][i.first-2]);\n }else if(i.first < 22){\n if(!(b &(1 << (i.first-12)))) up(i.first, b, c, cost+i.second);\n }else {\n if((b & (1 << (i.first-22)))) up(i.first, b, c, cost+i.second);\n }\n }\n }\n ll ans = INF<ll>;\n for (int j = 0; j < 10; ++j) {\n chmin(ans, dp[1].back()[j]);\n }\n if(ans == INF<ll>) puts(\"-1\");\n else {\n ll a = (ans+999)/1000, b = a*1000-ans;\n cout << a << \" \" << b << \"\\n\";\n }\n return 0;\n}", "accuracy": 0.9318181818181818, "time_ms": 370, "memory_kb": 16532, "score_of_the_acc": -0.6667, "final_rank": 15 }, { "submission_id": "aoj_0400_4912902", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\ntemplate <class T, class U>\nvector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }\n\ntemplate<class... Ts, class U>\nauto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }\n\ntemplate<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }\ntemplate<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }\n\ntemplate <class K, class V>\nclass RadixHeap {\n static constexpr int bit_length = sizeof(K)*8;\n K last;\n size_t sz, cnt;\n array<vector<pair<K, V>>, bit_length> v;\n static inline int bsr(int x){\n return x ? bit_length-__builtin_clz(x) : 0;\n }\n static inline int bsr(ll x){\n return x ? bit_length-__builtin_clzll(x) : 0;\n }\n\n void pull() {\n if(cnt < v[0].size()) return;;\n int i = 1;\n while(v[i].empty()) i++;\n last = min_element(v[i].begin(),v[i].end())->first;\n for (auto &&x : v[i]) v[bsr(x.first ^ last)].push_back(x);\n v[i].clear();\n }\npublic:\n RadixHeap() : last(0), sz(0), cnt(0) {}\n void emplace(K x, V val){\n sz++;\n v[bsr(x^last)].emplace_back(x, val);\n }\n\n pair<K, V> top() {\n pull();\n return v[0][cnt];\n }\n\n void pop() {\n pull();\n sz--;\n cnt++;\n }\n\n size_t size() const { return sz; }\n bool empty() const { return !sz; }\n};\n\nint main() {\n int w, h;\n cin >> w >> h;\n vector<string> v(h);\n for (auto &&i : v) cin >> i;\n string s = \"ST0123456789ABCDEFGHIJabcdefghij\";\n array<int, 256> si;\n for (int i = 0; i < s.size(); ++i) si[s[i]] = i;\n vector<int> ys(32, -1), xs(32, -1);\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n if(v[i][j] == '.' || v[i][j] == '#') continue;\n for (int k = 0; k < s.size(); ++k) {\n if(v[i][j] == s[k]) ys[k] = i, xs[k] = j;\n }\n }\n }\n vector dist(h, vector(w, 0));\n array<int, 4> dy{-1, 1, 0, 0}, dx{0, 0, -1, 1};\n auto in = [&](const int y, const int x){ return 0 <= y && y < h && 0 <= x && x < w && v[y][x] != '#'; };\n vector<vector<pair<int, int>>> G(32);\n int po[10][10];\n for (auto &&i : po) for(auto &&j : i) cin >> j;\n for (int i = 0; i < 32; ++i) {\n if(!~ys[i]) continue;\n for (auto &&j : dist) fill(j.begin(),j.end(), -1);\n dist[ys[i]][xs[i]] = 0;\n queue<pair<int, int>> Q;\n Q.emplace(ys[i], xs[i]);\n while(!Q.empty()){\n auto [y, x] = Q.front(); Q.pop();\n for (int k = 0; k < 4; ++k) {\n int yy = y+dy[k], xx = x+dx[k];\n if(in(yy, xx)){\n if(!~dist[yy][xx]){\n dist[yy][xx] = dist[y][x]+1;\n if(v[yy][xx] == '.') Q.emplace(yy, xx);\n else G[i].emplace_back(si[v[yy][xx]], 1000*dist[yy][xx]);\n }\n }\n }\n }\n }\n auto dp = make_v(32, 1 << 10, 10, INF<int>);\n dp[0][0][0] = 0;\n RadixHeap<int, int> Q;\n Q.emplace(0, 0);\n auto up = [&](int x, int y, int z, int val){\n if(dp[x][y][z] <= val) return;\n dp[x][y][z] = val;\n Q.emplace(val, (x << 14)|(y << 4)|z);\n };\n while(!Q.empty()){\n int a, b, c;\n auto [cost, tmp] = Q.top(); Q.pop();\n c = tmp&15, b = (tmp >> 4)&1023, a = (tmp >> 14);\n if(dp[a][b][c] != cost) continue;\n for (auto &&i : G[a]) {\n if(i.first < 2) up(i.first, b, c, cost+i.second);\n else if(i.first < 12){\n up(i.first, b, c, cost+i.second);\n if(b&(1 << (i.first-2))) continue;\n if(!b) up(i.first, 1<<(i.first-2), i.first-2,cost+i.second);\n else up(i.first, b|(1<<(i.first-2)), i.first-2, cost+i.second-po[c][i.first-2]);\n }else if(i.first < 22){\n if(!(b &(1 << (i.first-12)))) up(i.first, b, c, cost+i.second);\n }else {\n if((b & (1 << (i.first-22)))) up(i.first, b, c, cost+i.second);\n }\n }\n }\n int ans = INF<int>;\n for (int j = 0; j < 10; ++j) {\n chmin(ans, dp[1].back()[j]);\n }\n if(ans == INF<int>) puts(\"-1\");\n else {\n int a = (ans+999)/1000, b = a*1000-ans;\n cout << a << \" \" << b << \"\\n\";\n }\n return 0;\n}", "accuracy": 0.9318181818181818, "time_ms": 360, "memory_kb": 11512, "score_of_the_acc": -0.5307, "final_rank": 13 }, { "submission_id": "aoj_0400_4641507", "code_snippet": "#include <bits/stdc++.h>\n\nusing i64 = long long;\n\nusing namespace std;\n\ntemplate <typename T>\nbool chmin(T& a, T b){\n if(a > b){\n a = b;\n return true;\n }\n return false;\n}\n\nsigned main(){\n int w, h;\n cin >> w >> h;\n vector<string> v(h);\n for(int i = 0; i < h; ++i)\n cin >> v[i];\n vector<int> vx(32, -1);\n vector<int> vy(32, -1);\n for(int i = 0; i < h; ++i){\n for(int j = 0; j < w; ++j){\n if('0' <= v[i][j] && v[i][j] <= '9'){\n vx[v[i][j] - '0'] = i;\n vy[v[i][j] - '0'] = j;\n }\n if('a' <= v[i][j] && v[i][j] <= 'j'){\n vx[10 + v[i][j] - 'a'] = i;\n vy[10 + v[i][j] - 'a'] = j;\n }\n if('A' <= v[i][j] && v[i][j] <= 'J'){\n vx[20 + v[i][j] - 'A'] = i;\n vy[20 + v[i][j] - 'A'] = j;\n }\n if(v[i][j] == 'S'){\n vx[30] = i;\n vy[30] = j;\n }\n if(v[i][j] == 'T'){\n vx[31] = i;\n vy[31] = j;\n }\n }\n }\n int m = 10;\n vector<vector<int>> score(m + 1, vector<int>(m + 1, 0));\n for(int i = 0; i < m; ++i)\n for(int j = 0; j < m; ++j)\n cin >> score[i][j];\n\n vector<int> dx{1, 0, -1, 0};\n vector<int> dy{0, 1, 0, -1};\n\n auto f = [&](int sx, int sy){\n vector<vector<int>> dist(h, vector<int>(w, 1e9));\n dist[sx][sy] = 0;\n queue<pair<int,int>> que;\n que.emplace(sx, sy);\n while(!que.empty()){\n int x, y;\n tie(x, y) = que.front();\n que.pop();\n for(int d = 0; d < 4; ++d){\n int nx = x + dx[d];\n int ny = y + dy[d];\n if(nx < 0 || ny < 0 || nx >= h || ny >= w)\n continue;\n if(v[nx][ny] == '#')\n continue;\n if(dist[nx][ny] > dist[x][y] + 1){\n dist[nx][ny] = dist[x][y] + 1;\n if(v[nx][ny] == '.')\n que.emplace(nx, ny);\n }\n }\n }\n vector<int> wv(32, 1e9);\n for(int i = 0; i < 32; ++i)\n if(vx[i] != -1){\n wv[i] = dist[vx[i]][vy[i]];\n }\n return wv;\n };\n vector<vector<int>> dist(32, vector<int>(32, 1e9));\n for(int i = 0; i < 32; ++i){\n if(vx[i] != -1){\n dist[i] = f(vx[i], vy[i]);\n }\n }\n vector<vector<vector<pair<i64,i64>>>> a(32, vector<vector<pair<i64,i64>>>(1<<m, vector<pair<i64,i64>>(11, {1e18, 0})));\n a[30][0][10] = {0, 0};\n priority_queue<tuple<i64,i64,int,int,int>, vector<tuple<i64,i64,int,int,int>>, greater<tuple<i64,i64,int,int,int>>> que;\n que.emplace(0, 0, 30, 0, 10);\n while(!que.empty()){\n i64 d, sc;\n int i, j, k;\n tie(d, sc, i, j, k) = que.top();\n que.pop();\n if(a[i][j][k] != make_pair(d, sc))\n continue;\n // 0,9 get item\n for(int to = 0; to < 10; ++to){\n if(chmin(a[to][j][k], {d + dist[i][to], sc}))\n que.emplace(d + dist[i][to], sc, to, j, k);\n if(!(j & (1 << to)))\n if(chmin(a[to][j | (1 << to)][to], {d + dist[i][to], sc - score[k][to]}))\n que.emplace(d + dist[i][to], sc - score[k][to], to, j | (1 << to), to);\n }\n // a,j\n for(int to = 10; to < 20; ++to){\n if(j & (1 << (to - 10))){\n if(chmin(a[to][j][k], {d + dist[i][to], sc}))\n que.emplace(d + dist[i][to], sc, to, j, k);\n }\n }\n // A,J\n for(int to = 20; to < 30; ++to){\n if(!(j & (1 << (to - 20)))){\n if(chmin(a[to][j][k], {d + dist[i][to], sc})){\n que.emplace(d + dist[i][to], sc, to, j, k);\n }\n }\n }\n for(int to = 30; to < 32; ++to)\n if(chmin(a[to][j][k], {d + dist[i][to], sc}))\n que.emplace(d + dist[i][to], sc, to, j, k);\n }\n pair<i64,i64> ans(1e18, -1e18);\n for(auto x : a[31][(1 << m) - 1])\n chmin(ans, x);\n if(ans.first >= 1e9)\n cout << -1 << endl;\n else\n cout << ans.first << \" \" << -ans.second << endl;\n\n /*\n for(int i = 0; i < 32; ++i){\n for(int j = 0; j < 32; ++j){\n cout << (dist[i][j] >= 100 ? -1 : dist[i][j]) << \" \\n\"[j == 31];\n }\n }\n */\n}", "accuracy": 1, "time_ms": 550, "memory_kb": 18284, "score_of_the_acc": -0.889, "final_rank": 9 }, { "submission_id": "aoj_0400_3974902", "code_snippet": "#include <iostream>\n#include <queue>\nusing namespace std;\n\nint H, W, sx[32], sy[32], s[10][10], idx[1009][1009];\nchar c[1009][1009];\nint t[32][32], u[1009][1009];\npair<int, int> dp[1 << 10][32];\n\nint dx[4] = { 1, 0, -1, 0 };\nint dy[4] = { 0, 1, 0, -1 };\n\nint main() {\n\tcin >> W >> H;\n\tfor (int i = 1; i <= H; i++) {\n\t\tfor (int j = 1; j <= W; j++) {\n\t\t\tcin >> c[i][j]; idx[i][j] = -1;\n\t\t\tif (c[i][j] == 'S') { sx[30] = i; sy[30] = j; }\n\t\t\tif (c[i][j] == 'T') { sx[31] = i; sy[31] = j; }\n\t\t\tif (c[i][j] >= '0' && c[i][j] <= '9') {\n\t\t\t\tsx[0 + (c[i][j] - '0')] = i;\n\t\t\t\tsy[0 + (c[i][j] - '0')] = j;\n\t\t\t}\n\t\t\tif (c[i][j] >= 'A' && c[i][j] <= 'J') {\n\t\t\t\tsx[10 + (c[i][j] - 'A')] = i;\n\t\t\t\tsy[10 + (c[i][j] - 'A')] = j;\n\t\t\t}\n\t\t\tif (c[i][j] >= 'a' && c[i][j] <= 'z') {\n\t\t\t\tsx[20 + (c[i][j] - 'a')] = i;\n\t\t\t\tsy[20 + (c[i][j] - 'a')] = j;\n\t\t\t}\n\t\t}\n\t}\n\tfor (int i = 0; i < 10; i++) {\n\t\tfor (int j = 0; j < 10; j++) cin >> s[i][j];\n\t}\n\tfor (int i = 0; i <= 31; i++) { idx[sx[i]][sy[i]] = i; for (int j = 0; j <= 31; j++) t[i][j] = (1 << 25); }\n\n\tfor (int i = 0; i <= 31; i++) {\n\t\tif (sx[i] == 0 && sy[i] == 0) continue;\n\t\tfor (int j = 1; j <= H; j++) { for (int k = 1; k <= W; k++) u[j][k] = (1 << 25); }\n\n\t\tqueue<pair<int, int>> Q;\n\t\tQ.push(make_pair(sx[i], sy[i]));\n\t\tu[sx[i]][sy[i]] = 0;\n\n\t\twhile (!Q.empty()) {\n\t\t\tint cx = Q.front().first, cy = Q.front().second; Q.pop();\n\n\t\t\tfor (int j = 0; j < 4; j++) {\n\t\t\t\tint ex = cx + dx[j], ey = cy + dy[j];\n\t\t\t\tif (ex <= 0 || ey <= 0 || ex > H || ey > W || c[ex][ey] == '#') continue;\n\n\t\t\t\tif (idx[ex][ey] == -1) {\n\t\t\t\t\tif (u[ex][ey] == (1 << 25)) {\n\t\t\t\t\t\tQ.push(make_pair(ex, ey));\n\t\t\t\t\t\tu[ex][ey] = u[cx][cy] + 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tt[i][idx[ex][ey]] = min(t[i][idx[ex][ey]], u[cx][cy] + 1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (int i = 0; i < (1 << 10); i++) {\n\t\tfor (int j = 0; j < 32; j++) dp[i][j] = make_pair((1 << 25), (1 << 25));\n\t}\n\tdp[0][30] = make_pair(0, 0);\n\n\tpair<int, int> maxn = make_pair((1 << 25), -1);\n\n\tfor (int i = 0; i < (1 << 10); i++) {\n\t\tfor (int j = 0; j < 32; j++) {\n\t\t\tif (dp[i][j] == make_pair((1 << 25), (1 << 25))) continue;\n\n\t\t\t// 幅優先探索\n\t\t\tint dist[32]; for (int k = 0; k < 32; k++) dist[k] = (1 << 25); dist[j] = 0;\n\t\t\tvector<int> V;\n\t\t\tfor (int k = 0; k < 10; k++) V.push_back(k);\n\t\t\tfor (int k = 0; k < 10; k++) { if ((i / (1 << k)) % 2 == 0) V.push_back(10 + k); }\n\t\t\tfor (int k = 0; k < 10; k++) { if ((i / (1 << k)) % 2 == 1) V.push_back(20 + k); }\n\t\t\tV.push_back(30); V.push_back(31);\n\n\t\t\tfor (int tt = 0; tt < 22; tt++) {\n\t\t\t\tfor (int k : V) {\n\t\t\t\t\tfor (int l : V) {\n\t\t\t\t\t\tif (t[k][l] == -(1 << 25)) continue;\n\t\t\t\t\t\tdist[l] = min(dist[l], dist[k] + t[k][l]);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (i == 1023) {\n\t\t\t\tmaxn = min(maxn, make_pair(dp[i][j].first + dist[31], dp[i][j].second));\n\t\t\t}\n\n\t\t\t// DP の更新\n\t\t\tfor (int k = 0; k < 10; k++) {\n\t\t\t\tif (dist[k] == (1 << 25) || (i / (1 << k)) % 2 == 1) continue;\n\t\t\t\tdp[i + (1 << k)][k] = min(dp[i + (1 << k)][k], make_pair(dp[i][j].first + dist[k], dp[i][j].second - s[j][k]));\n\t\t\t}\n\t\t}\n\t}\n\n\tif (maxn.first == (1 << 25)) cout << \"-1\" << endl;\n\telse cout << maxn.first << \" \" << -maxn.second << endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 500, "memory_kb": 12212, "score_of_the_acc": -0.6869, "final_rank": 8 } ]
aoj_0401_cpp
Playing with Stones Koshiro and Ukiko are playing a game with black and white stones. The rules of the game are as follows: Before starting the game, they define some small areas and place "one or more black stones and one or more white stones" in each of the areas. Koshiro and Ukiko alternately select an area and perform one of the following operations. (a) Remove a white stone from the area (b) Remove one or more black stones from the area. Note, however, that the number of the black stones must be less than or equal to white ones in the area. (c) Pick up a white stone from the stone pod and replace it with a black stone. There are plenty of white stones in the pod so that there will be no shortage during the game. If either Koshiro or Ukiko cannot perform 2 anymore, he/she loses. They played the game several times, with Koshiro’s first move and Ukiko’s second move, and felt the winner was determined at the onset of the game. So, they tried to calculate the winner assuming both players take optimum actions. Given the initial allocation of black and white stones in each area, make a program to determine which will win assuming both players take optimum actions. Input The input is given in the following format. $N$ $w_1$ $b_1$ $w_2$ $b_2$ : $w_N$ $b_N$ The first line provides the number of areas $N$ ($1 \leq N \leq 10000$). Each of the subsequent $N$ lines provides the number of white stones $w_i$ and black stones $b_i$ ($1 \leq w_i, b_i \leq 100$) in the $i$-th area. Output Output 0 if Koshiro wins and 1 if Ukiko wins. Sample Input 1 4 24 99 15 68 12 90 95 79 Sample Output 1 0 Sample Input 1 3 2 46 94 8 46 57 Sample Output 2 1
[ { "submission_id": "aoj_0401_11026208", "code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<vvi> vvvi;\ntypedef vector<ll> vll;\ntypedef vector<vll> vvll;\ntypedef vector<vvll> vvvll;\ntypedef pair<int,int> pi;\ntypedef vector<string> vs;\ntypedef vector<char> vc;\ntypedef vector<vc> vvc;\n#define rep(i,a,n) for(int i=a;i<n;i++)\n#define drep(i,a,n) for(int i=a;i>n;i--)\n#define Yes(ans) {cout<<(ans?\"Yes\":\"No\")<<endl;}\n#define printv(vec) {rep(iti_,0,vec.size()) cout<<vec[iti_]<<\" \"; cout<<endl;}\n#define printvv(vec) {rep(ni_,0,vec.size()) printv(vec[ni_]); cout<<endl;}\n#define all(x) x.begin(),x.end()\n#define so(x) sort(all(x))\n#define re(x) reverse(all(x))\ntemplate<typename T> bool chmin(T &a,T b) {if(a>b) {a=b; return true;}}\ntemplate<typename T> bool chmax(T &a,T b) {if(a<b) {a=b; return true;}}\nint main(){\n int n; cin>>n;\n int m=300;\n vvi dp(m,vi(m,-1));\n //dp[0][0]=0;\n rep(j,0,m){\n rep(i,0,m){\n //if(i==0&&j==0) continue;\n vi candi={};\n if(i>0) candi.push_back(dp[i-1][j]);\n rep(k,1,i+1){\n if(j-k<0) break;\n candi.push_back(dp[i][j-k]);\n }\n if(i+1<m&&j-1>=0) candi.push_back(dp[i+1][j-1]);\n so(candi);\n candi.erase(unique(all(candi)),candi.end());\n candi.push_back(candi.size()+1);\n rep(k,0,candi.size()){\n if(candi[k]!=k){\n dp[i][j]=k;\n break;\n }\n }\n }\n }\n int nim=0;\n rep(i,0,n){\n int x,y; cin>>x>>y;\n nim^=dp[x][y];\n }\n //vvi dp_(m,vi(m)); rep(i,0,m) rep(j,0,m) dp_[i][j]=dp[j][i];\n //printvv(dp_);\n //cout<<nim<<endl;\n if(nim==0) cout<<1<<endl;\n else cout<<0<<endl;\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 3968, "score_of_the_acc": -0.7124, "final_rank": 12 }, { "submission_id": "aoj_0401_10934267", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)\n\nint main() {\n\tcin.tie(nullptr);\n\tios_base::sync_with_stdio(false);\n\t\n\tint maxi = 210;\n\tvector dp(maxi, vector<int>(maxi, -1)); // i == white\n\tdp[0][0] = 0;\n\trep(j, 0, maxi) rep(i, 0, maxi) {\n\t\tif (dp[i][j] != -1) continue;\n\t\t\n\t\tset<int> S;\n\t\tif (i >= 1) S.insert(dp[i - 1][j]);\n\t\trep(t, 1, i + 1) if (j - t >= 0) S.insert(dp[i][j - t]);\n\t\tif (j >= 1 && i + 1 < maxi) S.insert(dp[i + 1][j - 1]);\n\t\t\n\t\tint cnt = 0;\n\t\twhile (true) {\n\t\t\tif (!S.count(cnt)) {\n\t\t\t\tdp[i][j] = cnt;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\t++cnt;\n\t\t}\n\t}\n\t\n\tint N;\n\tcin >> N;\n\t\n\tint sum = 0;\n\trep(i, 0, N) {\n\t\tint w, b;\n\t\tcin >> w >> b;\n\t\tsum ^= dp[w][b];\n\t}\n\t\n\tcout << (sum == 0 ? 1 : 0) << '\\n';\n}", "accuracy": 1, "time_ms": 180, "memory_kb": 3628, "score_of_the_acc": -0.9108, "final_rank": 14 }, { "submission_id": "aoj_0401_10899091", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n\nint main(){\n vector<vector<int>> dp(101,vector<int>(201)); //black,white\n for(int b=0;b<=100;b++){\n for(int w=0;w<=200;w++){\n set<int> S;\n if(w>0) S.insert(dp[b][w-1]);\n for(int b2=1;b2<=min(b,w);b2++) S.insert(dp[b-b2][w]);\n if(b>0&&w<200) S.insert(dp[b-1][w+1]);\n for(int a=0;true;a++){\n if(!S.count(a)){dp[b][w]=a; break;}\n }\n }\n }\n\n int N; cin>>N;\n int ans=0;\n for(int i=0;i<N;i++){\n int w,b; cin>>w>>b;\n ans^=dp[b][w];\n }\n if(ans==0) cout<<1<<endl;\n else cout<<0<<endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3504, "score_of_the_acc": -0.0952, "final_rank": 2 }, { "submission_id": "aoj_0401_10852639", "code_snippet": "#include\"bits/stdc++.h\"\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define all(a) a.begin(),a.end()\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef pair<int,int> P;\nconstexpr ll mod = 1000000007;\nint grundy[202][202];\nsigned main(){\n\tfor(int ij=1;ij<=402;ij++){\n\t\tfor(int j=0;j<=201;j++){\n\t\t\tint i=ij-j;\n\t\t\tif(0>i||201<i)continue;\n\t\t\tunordered_set<int>S;\n\t\t\tif(i)S.insert(grundy[i-1][j]);\n\t\t\tif(j)S.insert(grundy[i+1][j-1]);\n\t\t\tfor(int k=j-1;k>=max(0,j-i);k--)S.insert(grundy[i][k]);\n\t\t\tfor(int x=0;x<=205;x++){\n\t\t\t\tif(S.find(x)==S.end()){\n\t\t\t\t\tgrundy[i][j]=x;break;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tint n;cin>>n;\n\tint x=0;\n\trep(i,n){\n\t\tint a,b;cin>>a>>b;\n\t\tx^=grundy[a][b];\n\t}\n\tif(x)cout<<0<<endl;\n\telse cout<<1<<endl;\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 3608, "score_of_the_acc": -0.6564, "final_rank": 10 }, { "submission_id": "aoj_0401_10708659", "code_snippet": "// #ifndef ONLINE_JUDGE\n// #define _GLIBCXX_DEBUG//[]で配列外参照をするとエラーにしてくれる。上下のやつがないとTLEになるので注意 ABC311Eのサンプル4みたいなデバック中のTLEは防げないので注意\n// #endif\n\n#include <bits/stdc++.h>\nusing namespace std;\n// #include <atcoder/all>\n// using namespace atcoder;\n\n\ntemplate<typename T> using vc = vector<T>;//prioriy_queueに必要なのでここにこれ書いてます\ntemplate<typename T> using vv = vc<vc<T>>;\n\n//-------------1.型系---------------\nusing ll = long long;\nll INF = 2e18;\n\n// #include <boost/multiprecision/cpp_int.hpp>//インストール的なのをしてないとできないので注意\n// namespace multip = boost::multiprecision;\n// //using lll = multip::cpp_int;//無制限を使いたいときはこっちを使う\n// using lll = multip::int128_t;\n\nusing ld = long double;\nusing bl = bool;\n// using mint = modint998244353;\n//using mint = modint1000000007;\n//using mint = modint;//使うときはコメントアウトを外す\n//mint::set_mod(m);//使うときはコメントアウトを外す\n\ntemplate<class T> using pq = priority_queue<T, vc<T>>;//大きい順\ntemplate<class T> using pq_g = priority_queue<T, vc<T>, greater<T>>;//小さい順\n//-----------------------------------\n\n\n\n//-------------2.配列系--------------\nusing vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>; using vvvvl = vv<vvl>;\nusing vs = vc<string>; using vvs = vv<string>;\nusing vb = vc<bl>; using vvb = vv<bl>; using vvvb = vv<vb>;\nusing vld = vc<ld>; using vvld = vv<ld>; using vvvld = vv<vld>;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n// using vmint = vc<mint>; using vvmint = vv<mint>; using vvvmint = vv<vmint>;\n\n//配列外参照対策のやつは一番上の行にあります\n\n#define rep(i,n) for(ll i = 0; i < (n); ++i)//↓でrepを使うので書いてます\ntemplate<class T>istream& operator>>(istream& i, vc<T>& v) { rep(j, size(v))i >> v[j]; return i; }\n\nusing ar2 = array<ll, 2>;\n\n//----------------------------------\n\n\n\n//--------3.コード短縮化とか---------\n#define rep(i,n) for(ll i = 0; i < (n); ++i)\n#define rrep(i,n) for(ll i = 1; i <= (n); ++i)\n#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)\n#define nfor(i,s,n) for(ll i=s;i<n;i++)//i=s,s+1...n-1 ノーマルfor\n#define dfor(i,s,n) for(ll i = (s)-1; i>=n;i--)//s-1スタートでnまで落ちる\n\n#define nall(a) a.begin(),a.end()\n#define rall(a) a.rbegin(),a.rend()\n\n#define chmax(x,y) x = max(x,y)\n#define chmin(x,y) x = min(x,y)\n\n#define pb push_back\n#define eb emplace_back\n#define em emplace\n#define pob pop_back\n\n\n#define YES cout<<\"Yes\"<<endl\n#define NO cout<<\"No\"<<endl\n#define YN {cout<<\"Yes\"<<endl;}else{cout<<\"No\"<<endl;}// if(a==b)YN;\n#define dame cout<<-1<<endl\n\n\n#define vc_unique(v) v.erase( unique(v.begin(), v.end()), v.end() );\n#define vc_rotate(v) rotate(v.begin(),v.begin()+1,v.end());\n\n#define pop_cnt(s) ll(popcount(uint64_t(s)))\n\n#define next_p(v) next_permutation(v.begin(),v.end())\n\n//if (regex_match(s, regex(\"\")))YN;//文字列sの判定を行う。コメントアウトを外して「\"\"」の中に判定する内容を入れる\n\n//-------------------------------\n\n\n\n\n//---------4.グリッド系----------\nvl di = { 0,1,0,-1 };//vl di={0,1,1,1,0,-1,-1,-1};\nvl dj = { 1,0,-1,0 };//vl dj={1,1,0,-1,-1,-1,0,1};\n\nbool out_grid(ll i, ll j, ll h, ll w) {//trueならcontinue\n return (!(0 <= i && i < h && 0 <= j && j < w));\n}\n\n#define vvl_kaiten_r(v) {ll n = size(v);vvl nx(n,vl(n));rep(i,n)rep(j,n)nx[j][n-i-1]=v[i][j];swap(nx,v);}//時計回りに90°回転\n#define vvl_kaiten_l(v) {ll n = size(v);vvl nx(n,vl(n));rep(i,n)rep(j,n)nx[n-j-1][i]=v[i][j];swap(nx,v);}//反時計周りに90°回転\n\n#define vs_kaiten_r(v) {ll n = size(v);vs nx(n,string(n,'.'));rep(i,n)rep(j,n)nx[j][n-i-1]=v[i][j];swap(nx,v);}//文字列版 時計回りに90°回転\n#define vs_kaiten_l(v) {ll n = size(v);vs nx(n,string(n,'.'));rep(i,n)rep(j,n)nx[n-j-1][i]=v[i][j];swap(nx,v);}//文字列版　反時計周りに90°回転\n\n\n#define vvl_tenti(v) {ll n = size(v);vvl nx(n,vl(n));rep(i,n)rep(j,n)nx[j][i]=v[i][j];swap(nx,v);}\n#define vs_tenti(v) {ll n = size(v); vs nx(n, string(n,'.')); rep(i, n)rep(j, n)nx[j][i] = v[i][j]; swap(nx, v);}\n\n//--------------------------------\n\n\n\n\n//-----------5.数学系--------------\n#define yu_qurid(x,y) ((x)*(x)+(y)*(y))//ユークリッド距離 sqrtはしてないなので注意\n#define mannhattan(x1,x2,y1,y2) (abs(x1-x2)+abs(y1-y2)) // マンハッタン距離 = |x1-x2|+|y1-y2|\n\ntemplate<class T>T tousa_sum1(T l, T d, T r) {//初項,公差,末項 で総和を求める\n T wide = (r - l) / d + 1;\n return (l + r) * wide / 2;\n}\ntemplate<class T>T tousa_sum2(T a, T d, T n) {//初項,交差,項数 で総和を求める\n return (a * 2 + d * (n - 1)) * n / 2;\n}\nll kousa_kousuu(ll l, ll r, ll d) {//初項,末項,交差 で等差数列の項数を求める\n return (r - l) / d + 1;\n}\n// mint touhi_sum(mint a, mint r, ll n) {//初項,公比,項数で等比数列の総和を求める\n// if (r == 1) {\n// return a * n;\n// }\n// mint bunsi = a * (r.pow(n) - mint(1));\n// mint bunbo = r - 1;\n// return bunsi / bunbo;\n// }\n\nll nc2(ll x) { return x * (x - 1) / 2; }\nll nc3(ll x) { return x * (x - 1) * (x - 2) / 6; }\n\n//----------------------------------------------\n\n\n\n\n//-----------6.デバックや出力系------------------\nvoid print(ld x) { printf(\"%.20Lf\\n\", x); }\n\nvoid mukou_debug(vvl to, bool yukou) {//GRAPH × GRAPH用の無向グラフを出力する\n ll n = size(to); ll cnt = 0;//辺の本数\n vc<pair<ll, ll>>v; rep(i, n)for (ll t : to[i]) if (i < t || yukou)cnt++, v.eb(i + 1, t + 1);//有向グラフなら全部OK、違うなら無向なのでf<tのみ見る、using Pのやつを別のにしたいときのためにPを使わずにpair<ll,ll>にしてる\n cout << n << ' ' << cnt << endl; for (auto [f, t] : v)cout << f << ' ' << t << endl;\n}\n\n#define vc_cout(v){ll n = size(v);rep(i,n)cout<<v[i]<<endl;}//一次元配列を出力する\n#define vv_cout(v){ll n = size(v);rep(i,n){rep(j,size(v[i])){cout<<v[i][j]<<' ';}cout<<endl;}}//二次元配列を出力する\n\nint main(){\n ll n;\n cin >> n;\n\n vvl dp(110, vl(230, -1)); // dp[i][j]: 黒i個、白j個の場合のGrundy数\n dp[0][0] = 0;\n rep(i, 101) rep(j, 201){\n set<ll> st;\n\n // 白を1つ取り除く\n if(j-1 >= 0) st.insert(dp[i][j-1]);\n\n // 黒を取り除く\n rrep(k, j){\n if(i-k >= 0) st.insert(dp[i-k][j]);\n }\n\n // 黒を白に交換\n if(i-1 >= 0) st.insert(dp[i-1][j+1]);\n\n ll res = 0;\n while(st.count(res)) res++;\n dp[i][j] = res;\n }\n\n ll ans = 0;\n\n rep(i, n){\n ll w, b;\n cin >> w >> b;\n ans ^= dp[b][w];\n }\n\n if(ans) cout << 0 << endl;\n else cout << 1 << endl;\n\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3700, "score_of_the_acc": -0.2554, "final_rank": 6 }, { "submission_id": "aoj_0401_10525311", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nrandom_device seed_gen;\nmt19937_64 rnd(seed_gen());\ntemplate <typename T> bool chmax(T& A, T B) { if (A < B) { A = B; return true; } return false; }\ntemplate <typename T> bool chmin(T& A, T B) { if (A > B) { A = B; return true; } return false; }\n#define rep(i, m, n) for (int i = (m); i < (n); i++)\n#define all(a) a.begin(), a.end()\n#define rall(a) a.rbegin(), a.rend()\nusing ll = long long;\nusing pint = pair<int, int>;\ntemplate<typename T> using min_heap = priority_queue<T, vector<T>, greater<T>>;\n#define PI 3.14159265358979323846264338327950288419716939937510\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n vector<vector<int>> g(201, vector<int>(101));\n vector<vector<int>> f(201, vector<int>(101));\n g[0][0] = 0;\n f[0][0] = 1;\n auto dfs = [&](auto dfs, int w, int b) {\n if (f[w][b]) {\n return g[w][b];\n }\n f[w][b] = 1;\n set<int> st;\n if (w >= 1) {\n st.emplace(dfs(dfs, w - 1, b));\n }\n rep (i, 1, w + 1) {\n if (b - i >= 0) {\n st.emplace(dfs(dfs, w, b - i));\n }\n }\n if (b >= 1) {\n st.emplace(dfs(dfs, w + 1, b - 1));\n }\n rep (i, 0, st.size() + 1) {\n if (st.count(i) == false) {\n return g[w][b] = i;\n }\n }\n };\n rep (w, 0, 101) {\n rep (b, 0, 101) {\n dfs(dfs, w, b);\n }\n }\n int n;\n cin >> n;\n int xs = 0;\n rep (i, 0, n) {\n int w, b;\n cin >> w >> b;\n xs ^= g[w][b];\n }\n cout << (xs ? 0 : 1) << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3920, "score_of_the_acc": -0.3875, "final_rank": 8 }, { "submission_id": "aoj_0401_10328081", "code_snippet": "#include <bits/stdc++.h>\n#define LOOP(n) for (int _i = 0; _i < (n); _i++)\n#define REP(i, n) for (int i = 0; i < (n); ++i)\n#define RREP(i, n) for (int i = (n); i >= 0; --i)\n#define FOR(i, r, n) for (int i = (r); i < (n); ++i)\n#define ALL(obj) begin(obj), end(obj)\n#define yes \"Yes\"\n#define no \"No\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef pair<ll,ll> pll;\ntypedef pair<ll,int> pli;\ntypedef pair<int,ll> pil;\ntypedef vector<vector<int>> vvi;\ntypedef vector<vector<ll>> vvl;\nconst vector<char> alpha = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};\nint dx[4] = {0, 1, 0, -1};\nint dy[4] = {1, 0, -1, 0};\nconst ll INF = 1000000007;\nconst ll MOD=998244353;\ntemplate<typename T> inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); }\ntemplate<typename T> inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); }\nvvi dp(201,vector<int>(201,-1));\nint func(int w,int b){\n if (w==0&&b==0) return 0;\n if (dp[w][b]!=-1) return dp[w][b];\n \n unordered_set<int> st;\n if (w!=0) st.insert(func(w-1,b));\n FOR(k,1,min(b,w)+1) st.insert(func(w,b-k));\n if (b!=0) st.insert(func(w+1,b-1));\n\n int g=0;\n while(st.count(g)) g++;\n return dp[w][b]=g;\n}\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int N; cin >> N;\n vector<int> W(N), B(N);\n int res=0;\n for(int i=0;i<N;i++){\n cin >> W[i] >> B[i];\n res^= func(W[i],B[i]);\n }\n\n cout << (res != 0 ? 0 : 1) << \"\\n\";\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3952, "score_of_the_acc": -0.4613, "final_rank": 9 }, { "submission_id": "aoj_0401_10311303", "code_snippet": "#ifndef ONLINE_JUDGE\n#define _GLIBCXX_DEBUG //[]で配列外参照をするとエラーにしてくれる。上下のやつがないとTLEになるので注意 ABC311Eのサンプル4みたいなデバック中のTLEは防げないので注意\n#endif\n#include <bits/stdc++.h>\n\n// #include <atcoder/all>\n// using namespace atcoder;\n\nusing namespace std;\nusing ll = long long;\nll INF = 2e18;\nusing P = pair<ll, ll>;\n#define pb push_back\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n#define reprev(i, n) for (ll i = (n) - 1; i >= 0; i--)\n#define reps(i, n) for (ll i = 1; i <= (n); i++)\n#define for_(i, a, b) for (ll i = (a); i < (b); i++)\n#define all(v) v.begin(), v.end()\ntemplate <typename T>\ninline bool chmin(T &a, const T &b)\n{\n bool c = a > b;\n if (c)\n a = b;\n return c;\n}\ntemplate <typename T>\ninline bool chmax(T &a, const T &b)\n{\n bool c = a < b;\n if (c)\n a = b;\n return c;\n}\ntemplate <typename T>\ninline T ceil(T a, T b) { return (a + (b - 1)) / b; }\n// using mint = modint998244353;\n// using mint = modint1000000007;\n// using mint = static_modint<10>;//使うときはコメントアウトを外す\ntemplate <typename T>\nusing vc = vector<T>;\ntemplate <class T>\nistream &operator>>(istream &i, vc<T> &v)\n{\n rep(j, size(v)) i >> v[j];\n return i;\n}\ntemplate <class T>\nostream &operator<<(ostream &o, const vc<T> &v)\n{\n rep(j, size(v))\n {\n if (j)\n o << \" \";\n o << v[j];\n }\n o << endl;\n return o;\n}\nvc<vc<ll>> dp(201, vc<ll>(101, -1));\nll grundy(ll w, ll b)\n{\n if (dp[w][b] != -1)\n {\n return dp[w][b];\n }\n if (w == 0 && b == 0)\n {\n return 0;\n }\n set<ll> s;\n if (w > 0)\n {\n s.insert(grundy(w - 1, b));\n }\n if (b > 0)\n {\n reps(i, min(w, b))\n {\n s.insert(grundy(w, b - i));\n }\n s.insert(grundy(w + 1, b - 1));\n }\n ll res = 0;\n while (s.count(res))\n {\n res++;\n }\n return dp[w][b] = res;\n}\nint main()\n{\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n // ref:https://rsk0315.hatenablog.com/entry/2020/05/09/170315\n ll N;\n cin >> N;\n vc<ll> W(N), B(N);\n rep(i, N)\n {\n cin >> W[i] >> B[i];\n }\n ll ans = 0;\n rep(i, N)\n {\n ans ^= grundy(W[i], B[i]);\n }\n if (ans == 0)\n {\n cout << \"1\" << endl;\n }\n else\n {\n cout << \"0\" << endl;\n }\n // cout << ans << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 4116, "score_of_the_acc": -0.6905, "final_rank": 11 }, { "submission_id": "aoj_0401_10129113", "code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\n\nint main(){\n\tint n;\n\tcin >> n;\n\tint grandy[201][201];\n\tfor(int i = 0; i <=200; i++){\n\t\tfor(int j = 0; j <= 200; j++){\n\t\t\tgrandy[i][j] = 0;\n\t\t}\n\t}\n\tfor(int j = 0; j <=100; j++){\n\t\tfor(int i = 0; i <= 200; i++){\n\t\t\tvector<int> a;\n\t\t\tif(i>0){\n\t\t\t\ta.push_back(grandy[i-1][j]);\n\t\t\t}\n\t\t\tif(j>0){\n\t\t\t\ta.push_back(grandy[i+1][j-1]);\n\t\t\t}\n\t\t\tfor(int k = 1; k <= i && j>=k; k++){\n\t\t\t\ta.push_back(grandy[i][j-k]);\n\t\t\t}\n\t\t\tsort(a.begin(), a.end());\n\t\t\tint tmp = 0;\n\t\t\tfor(int i = 0; i < a.size(); i++){\n\t\t\t\tif(tmp == a[i])tmp++;\n\t\t\t}\n\t\t\tgrandy[i][j] = tmp;\n\t\t}\n\t}\n\tfor(int i = 0; i < 10; i++){\n\t\tfor(int j = 0; j < 10; j++){\n//\t\t\tcout << grandy[i][j] << \" \";\n\t\t}\n//\t\tcout << endl;\n\t}\n\tint ans = 0;\n\tint w,b;\n\tfor(int i = 0; i < n; i++){\n\t\tcin >> w >> b;\n\t\tans ^= grandy[w][b];\n\t}\n\tif(ans==0)cout << 1 << endl;\n\telse cout << 0 << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3616, "score_of_the_acc": -0.0915, "final_rank": 1 }, { "submission_id": "aoj_0401_9802819", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(n);++i)\nusing namespace std;\nusing ll = long long;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n int N;\n cin >> N;\n\n //黒石は増えない。白石は一個増える\n vector<vector<int>> mex(222,vector<int>(222,0));\n\n rep(i,220){\n rep(j,220){\n set<int> a;\n if(j>=1) a.insert(mex[i][j-1]);\n rep(k,min(j,i)) a.insert(mex[i-k-1][j]);\n if(i>=1) a.insert(mex[i-1][j+1]);\n a.insert(1e9);\n\n int k=0;\n for(int e:a){\n if(e!=k){\n mex[i][j]=k;\n break;\n }\n k++;\n }\n }\n }\n\n // rep(i,10){\n // rep(j,10) cout << mex[i][j] << \" \";\n // cout << endl;\n // }\n\n int x = 0;\n rep(i,N){\n int w,b;\n cin >> w >> b;\n x ^= mex[b][w];\n }\n cout << (x==0) << endl;\n\n}", "accuracy": 1, "time_ms": 180, "memory_kb": 3668, "score_of_the_acc": -0.9435, "final_rank": 15 }, { "submission_id": "aoj_0401_9802813", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(n);++i)\nusing namespace std;\nusing ll = long long;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n int N;\n cin >> N;\n\n //黒石は増えない。白石は一個増える\n vector<vector<int>> mex(222,vector<int>(222,0));\n\n rep(i,220){\n rep(j,220){\n vector<int> a;\n if(j>=1) a.push_back(mex[i][j-1]);\n rep(k,min(j,i)) a.push_back(mex[i-k-1][j]);\n if(i>=1) a.push_back(mex[i-1][j+1]);\n a.push_back(1e9);\n sort(a.begin(),a.end());\n\n rep(k,a.size()){\n if(a[k]!=k){\n mex[i][j]=k;\n break;\n }\n }\n }\n }\n\n // rep(i,10){\n // rep(j,10) cout << mex[i][j] << \" \";\n // cout << endl;\n // }\n\n int x = 0;\n rep(i,N){\n int w,b;\n cin >> w >> b;\n x ^= mex[b][w];\n }\n cout << (x==0) << endl;\n\n}", "accuracy": 0.047619047619047616, "time_ms": 20, "memory_kb": 3652, "score_of_the_acc": -0.1685, "final_rank": 19 }, { "submission_id": "aoj_0401_9785609", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define overload(a,b,c,d,...) d\n#define rep1(i,n) for(ll i=0;i<(ll)n;++i)\n#define rep2(i,l,r) for(ll i=(ll)l;i<(ll)r;++i)\n#define rep(...) overload(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)\n#define rrep1(i,n) for(ll i=(ll)(n)-1;i>=0;--i)\n#define rrep2(i,l,r) for(ll i=(ll)(r)-1;i>=(ll)l;--i)\n#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)\n#define all(x) (x).begin(),(x).end()\n#define eb emplace_back\n\nusing vl=vector<ll>;\n\nint main(){\n\tll n;cin>>n;\n\tvl w(n),b(n);\n\trep(i,n)cin>>w[i]>>b[i];\n\tvector<vl> grundy(201,vl(201,-1)); //(白,黒)\n\tgrundy[0][0]=0;\n\trep(s,1,201){\n\t\trrep(i,s+1){\n\t\t\tll j=s-i;\n\t\t\tvl tmp;\n\t\t\tif(i-1>=0)tmp.eb(grundy[i-1][j]);\n\t\t\trep(k,1,i+1)if(j-k>=0)tmp.eb(grundy[i][j-k]);\n\t\t\tif(j>0)tmp.eb(grundy[i+1][j-1]);\n\t\t\tsort(all(tmp));\n\t\t\tll g=0;\n\t\t\tfor(auto e:tmp)if(e==g)g++;\n\t\t\tgrundy[i][j]=g;\n\t\t\t\n\t\t}\n\t}\n\tll g=0;\n\trep(i,n){\n\t\tg^=grundy[w[i]][b[i]];\n\t}\n\tif(g==0)cout<<1<<endl;\n\telse cout<<0<<endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3912, "score_of_the_acc": -0.3333, "final_rank": 7 }, { "submission_id": "aoj_0401_9650844", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\nusing pll = pair<ll, ll>;\nusing pint = pair<int, int>;\nconstexpr double PI = 3.141592653589793;\nconstexpr ll MOD = 1e9 + 7;\nconstexpr ll mod = 998244353;\nconstexpr ll INF = 1LL << 60;\nconst vector<int> dx = {1, 0, -1, 0};\nconst vector<int> dy = {0, 1, 0, -1};\n#define vec2d(T, name, n, m, ini) vector<vector<T>> name(n, vector<T>(m, ini))\n#define vec3d(T, name, n, m, l, ini) \\\n vector<vector<vector<T>>> name(n, vector<vector<T>>(m, vector<T>(l, ini)))\n#define REP(i, e) rep(i, 0, e)\n#define rep(i, s, e) for (ll i = s; i < (e); ++i)\n#define rrep(i, s, e) for (ll i = s; i >= (e); --i)\n#define all(x) (x).begin(), (x).end()\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int n;\n cin >> n;\n\n vec2d(int, grundy, 201, 201, 0);\n REP(b, 201) REP(w, 201) {\n if (b == 0 && w == 0) continue;\n unordered_set<int> tmps;\n if (w > 0) tmps.insert(grundy[w - 1][b]);\n if (b > 0 && w < 200) tmps.insert(grundy[w + 1][b - 1]);\n rep(i, 1, min(w, b) + 1) tmps.insert(grundy[w][b - i]);\n int tmp = 0;\n while (tmps.find(tmp) != tmps.end()) ++tmp;\n grundy[w][b] = tmp;\n }\n\n vector<int> w(n), b(n);\n REP(i, n) cin >> w[i] >> b[i];\n int nim = grundy[w[0]][b[0]];\n rep(i, 1, n) nim = nim xor grundy[w[i]][b[i]];\n cout << (nim == 0) ? 1 : 0;\n cout << \"\\n\";\n\n return 0;\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 3704, "score_of_the_acc": -0.7348, "final_rank": 13 }, { "submission_id": "aoj_0401_9179776", "code_snippet": "// 石遊び\n#include <bits/stdc++.h>\n// #include <atcoder/all>\n#include <iostream>\n#include <iomanip>\n#include <math.h>\n\nusing namespace std;\n// using namespace atcoder;\n// using mint = modint998244353;\n// using mint = modint1000000007;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing ll = long long;\ntemplate <class T> using max_heap = priority_queue<T>;\ntemplate <class T> using min_heap = priority_queue<T, vector<T>, greater<>>;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define rep2(i, f, n) for (int i = (int) f; i < (int)(n); i++)\n#define repd(i, n, l) for (int i = (int) n; i >= (int) l; i--)\n\nconst ll inf = 1LL<<60 ;\n\nconst int B = 209;\n\nint grundy[B][B]; // 白石がi個、黒石がj個のときのgrundy数\n\nint mex(set<int> st){\n if (st.size() == 0) return 0;\n int ans = 0;\n for(int i = 0; i<1000; i++){\n if (st.count(i) == 0) {\n ans = i;\n break;\n }\n }\n return ans;\n}\n\nvoid calc() {\n grundy[0][0] = 0;\n set<int> st;\n for (int b = 0; b < B-1; b++){\n for (int w = 0; w < B-1; w++){\n if (w == 0 && b == 0) continue;\n if (w > 0) st.insert(grundy[w-1][b]);\n if (b > 0) st.insert(grundy[w+1][b-1]);\n if (b > 0) {\n for (int t = 1; t <= w; t++){\n if (b-t >= 0) st.insert(grundy[w][b-t]);\n }\n }\n grundy[w][b] = mex(st);\n st.clear();\n }\n }\n}\n\nint main() {\n int n; \n cin >> n;\n calc();\n int t;\n for (int i = 0; i<n; i++){\n int a, b;\n cin >> a >> b;\n if (i == 0) t = grundy[a][b];\n else t ^= grundy[a][b];\n }\n if (t == 0) cout << 1 << endl;\n else cout << 0 << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 220, "memory_kb": 3616, "score_of_the_acc": -1.0915, "final_rank": 16 }, { "submission_id": "aoj_0401_9147667", "code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <utility>\n#include <tuple>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <numeric>\n#include <cmath>\n#include <iomanip>\n#include <bitset>\n#include <map>\n#include <set>\n#include <functional>\n\n#define rep(i, m, n) for (ll i=m; i<n; i++)\n#define rept(i, m, n) for (ll i=m; i<=n; i++)\n#define repi(n) for (ll i=0; i<n; i++)\n#define repi1(n) for (ll i=1; i<=n; i++)\n#define repj(n) for (ll j=0; j<n; j++)\n#define repj1(n) for (ll j=1; j<=n; j++)\n#define repk(n) for (ll k=0; k<n; k++)\n#define repk1(n) for (ll k=1; k<=n; k++)\n\n#define ALL(x) begin(x), end(x)\n\n#define YY cout<<\"Yes\"<<endl;\n#define NN cout<<\"No\"<<endl;\n\n#define FLOOR(x, y) ((x)/(y)-((x)%(y)<0))\n#define CEIL(x, y) (FLOOR((x)+(y)-1,(y)))\n#define RES(x, y) ((x)-FLOOR((x),(y))*(y))\n#define SEPL(i, n) ((i==n-1)?'\\n':' ')\n#define CHMAX(x, y) x=max(x,y);\n#define CHMIN(x, y) x=min(x,y);\n\n#define nextcon(nx, ny, h, w) (0<=nx && nx<h && 0<=ny && ny<w)\n#define nxnycon (0<=nx && nx<h && 0<=ny && ny<w)\nconst int dx[] = {-1, 0, 1, 0};\nconst int dy[] = {0, 1, 0, -1};\nconst int dx8[] = {-1, -1, 0, 1, 1, 1, 0, -1};\nconst int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};\n\nusing namespace std;\nusing ll = long long;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing pii = pair<int, int>;\nusing vl = vector<ll>;\nusing vvl = vector<vector<ll>>;\nusing pll = pair<ll, ll>;\nusing graph = vector<vector<ll>>;\nusing wgraph = vector<vector<pair<ll, ll>>>;\n\nconst int inf = 1e9;\nconst ll INF = 1e18;\nconst ll MOD = 998244353;\n\n#include <algorithm>\n#include <deque>\n#include <iostream>\n#include <queue>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <utility>\n#include <vector>\n#include <cmath>\n#include <map>\n\nusing namespace std;\nusing ll = long long;\nusing graph = vector<vector<ll>>;\nusing wgraph = vector<vector<pair<ll, ll>>>;\n\nll next_n_adic_number(ll n, vector<ll> &d);\nvector<ll> eratosthenes(ll n);\nll digit(ll x);\nvector<ll> divs(ll n);\nmap<ll, ll> factorization(ll n);\nmap<ll, ll> factorization(ll n, vector<ll> plist);\nll mex(vector<ll> v);\n\n\n// 次のn進数\nll next_n_adic_number(ll n, vector<ll> &d) {\n ll m = d.size();\n for (ll i = 0; i < m; i++) {\n if (d[i] < n) {\n d[i]++;\n return 1;\n } else {\n d[i] = 0;\n }\n }\n return 0;\n}\n\nvector<ll> eratosthenes(ll n){ // 1 ~ n\n vector<ll> is_prime, plist;\n is_prime.resize(n+1, 1);\n is_prime[1]=0;\n for(ll i=1; i<=n; i++){\n if(is_prime[i]){\n for(ll j=2; j<=n/i; j++){\n is_prime[i*j]=0;\n }\n }\n }\n for(ll i=1; i<=n; i++){\n if(is_prime[i])plist.push_back(i);\n }\n return plist;\n}\n\nll digit(ll x){\n ll ret=0;\n while(x){\n ret++;\n x/=10;\n }\n return ret;\n}\n\nvector<ll> divs(ll n){\n vector<ll> ret;\n for(ll i=1; i<=floor(sqrt(n)); i++){\n if(!(n%i))ret.push_back(i);\n if(!(n%i))ret.push_back(n/i);\n }\n sort(ret.begin(), ret.end());\n return ret;\n}\n\nmap<ll, ll> factorization(ll n){\n map<ll, ll> ret;\n ll m=n;\n for(ll i=2; i*i<=n; i++){\n if(!(m%i)){\n ll c=0;\n for(;!(m%i);m/=i){\n c++;\n }\n ret[i]=c;\n }\n }\n if(m!=1){\n ret[m]=1;\n }\n return ret;\n}\n\nmap<ll, ll> factorization(ll n, vector<ll> plist){\n map<ll, ll> ret;\n ll m=n;\n for(auto i:plist){\n if(!(m%i)){\n ll c=0;\n for(;!(m%i);m/=i){\n c++;\n }\n ret[i]=c;\n }\n }\n if(m!=1){\n ret[m]=1;\n }\n return ret;\n}\n\nll mex(vector<ll> v){\n sort(v.begin(), v.end());\n for(ll i=0; i<=v.size(); i++){\n if(!binary_search(v.begin(), v.end(), i)){\n return i;\n }\n }\n return -1;\n}\n\nint main(){\n vvl gd(300,vl(300));\n repj(300)repi(300){\n if(i==1&&j==1){\n ll aaa=3;\n }\n vl v;\n if(i>0)v.push_back(gd[i-1][j]);\n if(i<299&&j>0)v.push_back(gd[i+1][j-1]);\n repk(min(i,j)){\n v.push_back(gd[i][j-k-1]);\n }\n\n gd[i][j]=mex(v);\n }\n ll n;\n cin>>n;\n ll ga=0;\n repi(n){\n ll w,b;\n cin>>w>>b;\n ga^=gd[w][b];\n }\n cout<<(ga==0)<<endl;\n}", "accuracy": 1, "time_ms": 200, "memory_kb": 4196, "score_of_the_acc": -1.4701, "final_rank": 18 }, { "submission_id": "aoj_0401_9056962", "code_snippet": "#ifndef ONLINE_JUDGE//なんか手元ではデバックモードになって、atcoder上ではデバックモードにならないらしい ABC325Dはこれで通った\n#define _GLIBCXX_DEBUG//[]で配列外参照をするとエラーにしてくれる。上下のやつがないとTLEになるので注意 ABC311Eのサンプル4のデバックTLEなどに注意\n#endif//これと上のONLINE JUDGEが絶対必要\n//★TLEにならないはずなのにTLEになったらオンラインジャッジを消してデバックモードのまま提出をする。\n\n#define _SILENCE_ALL_CXX17_DEPRECATION_WARNINGS//これを消すとvisual studioがバグる\n#define _SILENCE_ALL_CXX20_DEPRECATION_WARNINGS//これを消すとvisual studioがバグる\n\n#include <bits/stdc++.h>\nusing namespace std;\ntemplate<typename T> using vc = vector<T>;\ntemplate<typename T> using vv = vc<vc<T>>;\n\n//#include <atcoder/all>\n//using namespace atcoder;\n\n//using mint = modint;//modを自分で設定したい場合に使う↓のset_modをする　これを外側で書く\n//mint::set_mod(m);//これでmがmodになる ABC282-E　これをmain関数内で書く\n\n//using mint = modint998244353;//mintはchminができない\n//using mint = modint1000000007;//mintはchminができない\n//using vmint = vc<mint>; using vvmint = vv<mint>; using vvvmint = vv<vmint>;\n//mint im = mint(1)/m;//modの割り算はlogがかかるらしいから a/m をするなら a*imをすること。int/intをするとmintにしてくれないのでmint(int)/intとかにしないといけない。\n//return (mint(x).pow(y) + mint(y).pow(x)).val();//ACLでmodpowを求めてからint型で返したいときに使う ABC282-E\n#define fi first\n#define se second\n#define rep(i,n) for(ll i = 0; i < (n); ++i)\n#define nfor(i,s,n) for(ll i=s;i<n;i++)//i=s,s+1...n-1 ノーマルfor\n#define rrep(i,n) for(ll i = 1; i <= (n); ++i)\n#define rfor(i,s,n) for(ll i = s;i<=n;i++)//i=s,s-1...n\n#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)\n#define dfor(i,s,n) for(ll i = (s)-1; i>=n;i--)//s-1スタートでnまで落ちる\n#define nall(a) a.begin(),a.end()//ノーマルオール\n#define rall(a) a.rbegin(),a.rend()//R入りオール\n#define chmax(x,y) x = max(x,y)\n#define chmin(x,y) x = min(x,y)\n#define pb push_back\n#define eb emplace_back\n#define em emplace\n#define pob pop_back()\n#define dame {cout<<-1<<endl;}\n#define N {cout<<\"No\"<<endl;}\n#define YN {cout<<\"Yes\"<<endl;}else{cout<<\"No\"<<endl;}// if(ans[i])YN;\n#define cout(n) cout<<n<<endl;\n#define bit(n) (ll(1)<<(n))\n#define vcunique(v) v.erase( unique(v.begin(), v.end()), v.end() );\nusing ll = long long;\n//using lll = __int128;//paizaとatcoderのジャッジだけ使える、visual studioは上の多倍長整数のlllを使ってください。\nusing ld = long double;\nusing bl = bool;\nusing vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>; using vvvvl = vv<vvl>;\nusing vs = vc<string>; using vvs = vv<string>;\nusing vb = vc<bl>; using vvb = vv<bl>; using vvvb = vv<vb>;\nusing vld = vc<ld>; using vvld = vv<ld>; using vvvld = vv<vld>;\nusing P = pair<ll, ll>;\nusing P2 = array<P, 2>;//ABC339-D めちゃくちゃ早くなる\n//pq<ll>q;\ntemplate<class T> using pq = priority_queue<T, vc<T>>;//★大きい順に取り出す コスト,頂点 bfs系で使う　小さい順じゃないですABC305E\ntemplate<class T> using pq_g = priority_queue<T, vc<T>, greater<T>>;//小さい順に取り出す　ダイクストラ法で使う\n//-----------------\nll pow2(ll x) { return x * x; };\nll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }//snukeさんのライブラリ集から貰ってきた\nll lcm(ll a, ll b) { return a / gcd(a, b) * b; }\ntemplate<class T>T tousa_sum1(T l, T d, T r) {//初項,交差,末項 で総和を求める 負でも使える\n T wide = (r - l) / d + 1;\n return (l + r) * wide / 2;//((初項+末項)*項数)/2\n}\ntemplate<class T>T tousa_sum2(T a, T d, T n) {//初項,交差,項数 で総和を求める、負でも正でも使える,1や-1の直書きintに注意\n return (a * 2 + d * (n - 1)) * n / 2;\n}\nll c2(ll x) { return x * (x - 1) / 2; }\nll c3(ll x) { return x * (x - 1) * (x - 2) / 6; }\n//----------------\nvl dx = { 1,0,-1,0 };//vl dx={1,1,0,-1,-1,-1,0.1};\nvl dy = { 0,1,0,-1 };//vl dy={0,1,1,1,0,-1,-1,-1};\nll INF = 2e18;\nll D = 61;//ダブリングの桁 2^61ならINFが収まってくれる ARC60-E\n//if(regex_match(s, regex(\"\")))YN;//search\n//ll k = popcount(uint64_t(s));//sはlonglong型、符号なしの型にする。\n//ll(1)<<60 2^60>1e18\n\n//------------------------------------------\nmap<P, ll>mp;\nll f(ll a, ll b) {//白,黒\n if(mp.count(P(a,b)))return mp[P(a,b)]; \n //ア、イ、ウのどれか一つから選べるということで順番に一個ずつというわけではなかった(´・ω・｀)\n unordered_set<ll>st;//mexを求める用\n if (a >= 1)st.insert(f(a - 1, b));//(ア)をする\n \n ll can = a ;//取れる最大の個数\n nfor(i, 1, can+1) {//canだけだとcanそのものは取れない\n if (b - i < 0)break;//もう取れないからbreak\n //if (b - i == 0) {//0ならゲームの操作ができない\n // st.insert(0);//0じゃなくね？とか思ってたけど問題文をそもそも読み間違えてた黒が0になっても白があれば(ア)ができる\n // break;\n //}\n st.insert(f(a, b - i));\n }\n if (b >= 1)st.insert(f(a + 1, b - 1));//黒を白にしてその白を盤面のものとするらしい消えるのかと思ってた\n ll res = 0;\n while (st.count(res))res++;\n return mp[P(a, b)] = res;\n}\n\nint main() {\n ll n;\n cin >> n;\n ll ans = 0;\n rep(i, n) {\n ll a, b;\n cin >> a >> b;\n ans ^= f(a, b);\n }\n if (ans == 0)cout << 1 << endl;\n else cout << 0 << endl;\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 4728, "score_of_the_acc": -1.4286, "final_rank": 17 }, { "submission_id": "aoj_0401_9056926", "code_snippet": "#ifndef ONLINE_JUDGE//なんか手元ではデバックモードになって、atcoder上ではデバックモードにならないらしい ABC325Dはこれで通った\n#define _GLIBCXX_DEBUG//[]で配列外参照をするとエラーにしてくれる。上下のやつがないとTLEになるので注意 ABC311Eのサンプル4のデバックTLEなどに注意\n#endif//これと上のONLINE JUDGEが絶対必要\n//★TLEにならないはずなのにTLEになったらオンラインジャッジを消してデバックモードのまま提出をする。\n\n#define _SILENCE_ALL_CXX17_DEPRECATION_WARNINGS//これを消すとvisual studioがバグる\n#define _SILENCE_ALL_CXX20_DEPRECATION_WARNINGS//これを消すとvisual studioがバグる\n\n#include <bits/stdc++.h>\nusing namespace std;\ntemplate<typename T> using vc = vector<T>;\ntemplate<typename T> using vv = vc<vc<T>>;\n\n//#include <atcoder/all>\n//using namespace atcoder;\n\n//using mint = modint;//modを自分で設定したい場合に使う↓のset_modをする　これを外側で書く\n//mint::set_mod(m);//これでmがmodになる ABC282-E　これをmain関数内で書く\n\n//using mint = modint998244353;//mintはchminができない\n//using mint = modint1000000007;//mintはchminができない\n//using vmint = vc<mint>; using vvmint = vv<mint>; using vvvmint = vv<vmint>;\n//mint im = mint(1)/m;//modの割り算はlogがかかるらしいから a/m をするなら a*imをすること。int/intをするとmintにしてくれないのでmint(int)/intとかにしないといけない。\n//return (mint(x).pow(y) + mint(y).pow(x)).val();//ACLでmodpowを求めてからint型で返したいときに使う ABC282-E\n#define fi first\n#define se second\n#define rep(i,n) for(ll i = 0; i < (n); ++i)\n#define nfor(i,s,n) for(ll i=s;i<n;i++)//i=s,s+1...n-1 ノーマルfor\n#define rrep(i,n) for(ll i = 1; i <= (n); ++i)\n#define rfor(i,s,n) for(ll i = s;i<=n;i++)//i=s,s-1...n\n#define drep(i,n) for(ll i = (n)-1; i >= 0; --i)\n#define dfor(i,s,n) for(ll i = (s)-1; i>=n;i--)//s-1スタートでnまで落ちる\n#define nall(a) a.begin(),a.end()//ノーマルオール\n#define rall(a) a.rbegin(),a.rend()//R入りオール\n#define chmax(x,y) x = max(x,y)\n#define chmin(x,y) x = min(x,y)\n#define pb push_back\n#define eb emplace_back\n#define em emplace\n#define pob pop_back()\n#define dame {cout<<-1<<endl;}\n#define N {cout<<\"No\"<<endl;}\n#define YN {cout<<\"Yes\"<<endl;}else{cout<<\"No\"<<endl;}// if(ans[i])YN;\n#define cout(n) cout<<n<<endl;\n#define bit(n) (ll(1)<<(n))\n#define vcunique(v) v.erase( unique(v.begin(), v.end()), v.end() );\nusing ll = long long;\n//using lll = __int128;//paizaとatcoderのジャッジだけ使える、visual studioは上の多倍長整数のlllを使ってください。\nusing ld = long double;\nusing bl = bool;\nusing vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>; using vvvvl = vv<vvl>;\nusing vs = vc<string>; using vvs = vv<string>;\nusing vb = vc<bl>; using vvb = vv<bl>; using vvvb = vv<vb>;\nusing vld = vc<ld>; using vvld = vv<ld>; using vvvld = vv<vld>;\nusing P = pair<ll, ll>;\nusing P2 = array<P, 2>;//ABC339-D めちゃくちゃ早くなる\n//pq<ll>q;\ntemplate<class T> using pq = priority_queue<T, vc<T>>;//★大きい順に取り出す コスト,頂点 bfs系で使う　小さい順じゃないですABC305E\ntemplate<class T> using pq_g = priority_queue<T, vc<T>, greater<T>>;//小さい順に取り出す　ダイクストラ法で使う\n//-----------------\nll pow2(ll x) { return x * x; };\nll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }//snukeさんのライブラリ集から貰ってきた\nll lcm(ll a, ll b) { return a / gcd(a, b) * b; }\ntemplate<class T>T tousa_sum1(T l, T d, T r) {//初項,交差,末項 で総和を求める 負でも使える\n T wide = (r - l) / d + 1;\n return (l + r) * wide / 2;//((初項+末項)*項数)/2\n}\ntemplate<class T>T tousa_sum2(T a, T d, T n) {//初項,交差,項数 で総和を求める、負でも正でも使える,1や-1の直書きintに注意\n return (a * 2 + d * (n - 1)) * n / 2;\n}\nll c2(ll x) { return x * (x - 1) / 2; }\nll c3(ll x) { return x * (x - 1) * (x - 2) / 6; }\n//----------------\nvl dx = { 1,0,-1,0 };//vl dx={1,1,0,-1,-1,-1,0.1};\nvl dy = { 0,1,0,-1 };//vl dy={0,1,1,1,0,-1,-1,-1};\nll INF = 2e18;\nll D = 61;//ダブリングの桁 2^61ならINFが収まってくれる ARC60-E\n//if(regex_match(s, regex(\"\")))YN;//search\n//ll k = popcount(uint64_t(s));//sはlonglong型、符号なしの型にする。\n//ll(1)<<60 2^60>1e18\n\n//------------------------------------------\nmap<P, ll>mp;\nll f(ll a, ll b) {//白,黒\n if(mp.count(P(a,b)))return mp[P(a,b)];\n if (a == 0)return 0;//自分が取れないならここに来る直前のやつのmexのために0にできることを渡す\n unordered_set<ll>st;//mexを求める用\n ll can = a - 1;//取れる最大の個数\n nfor(i, 1, can) {\n if (b - i < 0)break;//もう取れないからbreak\n if (b - i == 0) {//0ならゲームの操作ができない\n st.insert(0);//0じゃなくね？\n break;\n }\n st.insert(f(a - 1, b - i));\n }\n ll res = 0;\n while (st.count(res))res++;\n return mp[P(a, b)] = res;\n}\n\nint main() {\n ll n;\n cin >> n;\n ll ans = 0;\n rep(i, n) {\n ll a, b;\n cin >> a >> b;\n ans ^= f(a, b);\n }\n if (ans == 0)cout << 1 << endl;\n else cout << 0 << endl;\n}", "accuracy": 0.023809523809523808, "time_ms": 10, "memory_kb": 3700, "score_of_the_acc": -0.1601, "final_rank": 20 }, { "submission_id": "aoj_0401_8994911", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n \n int n;\n cin >> n;\n\n vector<int> w(n), b(n);\n for (int i = 0; i < n; i++) {\n cin >> w[i] >> b[i];\n }\n\n vector<vector<int>> dp(201, vector<int>(201, -1));\n auto dfs = [&](auto dfs, int W, int B) -> int {\n if (dp[W][B] != -1) {\n return dp[W][B];\n }\n if (W == 0 && B == 0) {\n return dp[W][B] = 0;\n }\n int ret;\n vector<int> grundy;\n \n if (W - 1 >= 0) {\n ret = dfs(dfs, W - 1, B);\n grundy.push_back(ret);\n }\n for (int i = 1; i <= W; i++) {\n if (B - i >= 0) {\n ret = dfs(dfs, W, B - i);\n grundy.push_back(ret);\n }\n }\n if (B - 1 >= 0) {\n ret = dfs(dfs, W + 1, B - 1);\n grundy.push_back(ret);\n }\n sort(grundy.begin(), grundy.end());\n grundy.erase(unique(grundy.begin(), grundy.end()), grundy.end());\n for (int i = 0; i < (int)grundy.size(); i++) {\n if (i != grundy[i]) {\n dp[W][B] = i;\n return dp[W][B];\n }\n }\n dp[W][B] = (int)grundy.size();\n return dp[W][B];\n };\n\n int MAX = dfs(dfs, 100, 100);\n \n int ans = 0;\n for (int i = 0; i < n; i++) {\n ans ^= dp[w[i]][b[i]];\n }\n\n cout << (ans == 0 ? 1 : 0) << '\\n';\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3768, "score_of_the_acc": -0.2157, "final_rank": 5 }, { "submission_id": "aoj_0401_8666957", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for(int i=0;i<(n);++i)\n#define rep1(i, n) for(int i=1;i<=(n);i++)\n#define ll long long\nusing P = pair<ll,ll>;\nusing lb = long double;\nusing T = tuple<ll, ll, ll>;\n#ifdef LOCAL\n# include <debug_print.hpp>\n# define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)\n#else\n# define dbg(...) (static_cast<void>(0))\n#endif\n\nint dp[201][101];\n\nint main()\n{\n int n;\n cin >> n;\n vector<int> w(n), b(n);\n rep(i,n) cin >> w[i] >> b[i];\n for(int B=0;B<=100;B++)for(int W=0;W<=200;W++){\n set<int> st;\n if(W>=1) st.insert(dp[W-1][B]);\n if(B>=1) st.insert(dp[W+1][B-1]);\n for(int i=1;i<=W;i++){\n if(B-i>=0) st.insert(dp[W][B-i]);\n }\n for(int i=0;i<300;i++){\n if(st.count(i)) continue;\n dp[W][B] = i;\n break;\n }\n }\n int grundy = 0;\n rep(i,n){\n grundy ^= dp[w[i]][b[i]];\n }\n if(grundy==0){\n cout << 1 << endl;\n }\n else{\n cout << 0 << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3592, "score_of_the_acc": -0.1671, "final_rank": 4 }, { "submission_id": "aoj_0401_8479654", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> P;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\ntypedef vector<vvi> vvvi;\ntypedef vector<P> vp;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define REP(i,k,n) for(ll i=(ll)(k);i<(ll)(n);i++)\n#define pb emplace_back\n#define all(a) a.begin(),a.end()\n#define lb(v,k) (lower_bound(all(v),k)-v.begin())\n#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}\ntemplate<class T> void out(T a){cout<<a<<'\\n';}\nconst ll inf=1001001001001001001;\n\nint main(){\n cin.tie(0);ios::sync_with_stdio(false);\n vvi dp(210,vi(105));\n rep(j,105)rep(i,210){\n vi al;\n if(i-1>=0)al.pb(dp[i-1][j]);\n REP(t,1,i+1)if(j-t>=0)al.pb(dp[i][j-t]);\n if(j-1>=0&&i+1<210)al.pb(dp[i+1][j-1]);\n dupli(al);\n al.pb(inf);\n rep(t,al.size()){\n if(al[t]!=t){\n dp[i][j]=t;\n break;\n }\n }\n }\n ll n;cin>>n;\n ll res=0;\n rep(t,n){\n ll a,b;cin>>a>>b;\n res^=dp[a][b];\n }\n out(1-min(res,1ll));\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3628, "score_of_the_acc": -0.1013, "final_rank": 3 } ]
aoj_0402_cpp
K-th Exclusive OR Exclusive OR (XOR) is an operation on two binary numbers $x$ and $y$ (0 or 1) that produces 0 if $x = y$ and $1$ if $x \ne y$. This operation is represented by the symbol $\oplus$. From the definition: $0 \oplus 0 = 0$, $0 \oplus 1 = 1$, $1 \oplus 0 = 1$, $1 \oplus 1 = 0$. Exclusive OR on two non-negative integers comprises the following procedures: binary representation of the two integers are XORed on bit by bit bases, and the resultant bit array constitute a new integer. This operation is also represented by the same symbol $\oplus$. For example, XOR of decimal numbers $3$ and $5$ is equivalent to binary operation $011 \oplus 101$ which results in $110$, or $6$ in decimal format. Bitwise XOR operation on a sequence $Z$ consisting of $M$ non-negative integers $z_1, z_2, . . . , z_M$ is defined as follows: $v_0 = 0, v_i = v_{i - 1} \oplus z_i$ ($1 \leq i \leq M$) Bitwise XOR on series $Z$ is defined as $v_M$. You have a sequence $A$ consisting of $N$ non-negative integers, ample sheets of papers and an empty box. You performed each of the following operations once on every combinations of integers ($L, R$), where $1 \leq L \leq R \leq N$. Perform the bitwise XOR operation on the sub-sequence (from $L$-th to $R$-th elements) and name the result as $B$. Select a sheet of paper and write $B$ on it, then put it in the box. Assume that ample sheets of paper are available to complete the trials. You select a positive integer $K$ and line up the sheets of paper inside the box in decreasing order of the number written on them. What you want to know is the number written on the $K$-th sheet of paper. You are given a series and perform all the operations described above. Then, you line up the sheets of paper in decreasing order of the numbers written on them. Make a program to determine the $K$-th number in the series. Input The input is given in the following format. $N$ $K$ $a_1$ $a_2$ ... $a_N$ The first line provides the number of elements in the series $N$ ($1 \leq N \leq 10^5$) and the selected number $K$ ($1 \leq K \leq N(N+1)/2$). The second line provides an array of elements $a_i$ ($0 \leq a_i \leq 10^6$). Sample Input 1 3 3 1 2 3 Sample Output 1 2 After all operations have been completed, the numbers written on the paper inside the box are as follows (sorted in decreasing order) $3,3,2,1,1,0$ 3番目の数は2であるため、2を出力する。 Sample Input 2 7 1 1 0 1 0 1 0 1 Sample Output 2 1 Sample Input 3 5 10 1 2 4 8 16 Sample Output 3 7
[ { "submission_id": "aoj_0402_10799212", "code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n\nusing ll = long long;\n\nconst int LOG = 20;\nconst int X = 1 << LOG;\n\nstruct Trie {\n struct Node {\n vector<int> nxt = {-1, -1};\n int sz = 0;\n };\n\n vector<Node> t = {Node{}};\n\n void add(int x) {\n ++t[0].sz;\n for (int v = 0, j = LOG - 1; j >= 0; --j) {\n int xj = (x >> j) & 1;\n if (t[v].nxt[xj] == -1) {\n t[v].nxt[xj] = (int) t.size();\n t.emplace_back();\n }\n v = t[v].nxt[xj];\n ++t[v].sz;\n }\n }\n\n int get(int x, int lb) {\n if (lb == 0) return t[0].sz;\n --lb;\n // (x ^ y) > lb\n int res = 0;\n for (int v = 0, j = LOG - 1; j >= 0 && v != -1; --j) {\n int xj = (x >> j) & 1;\n int lbj = (lb >> j) & 1;\n if (lbj == 0) {\n int tmp = t[v].nxt[xj ^ 1];\n if (tmp != -1) res += t[tmp].sz;\n v = t[v].nxt[xj];\n } else {\n v = t[v].nxt[xj ^ 1];\n }\n }\n return res;\n }\n};\n\nsigned main() {\n\n#ifdef DEBUG\n freopen(\"input.txt\", \"r\", stdin);\n#endif\n \n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n\n int n;\n cin >> n;\n ll k;\n cin >> k;\n vector<int> a(n + 1);\n for (int i = 1; i <= n; ++i) cin >> a[i];\n for (int i = 1; i <= n; ++i) a[i] ^= a[i - 1];\n\n // vector<int> ar;\n // for (int i = 0; i <= n; ++i) {\n // for (int j = i + 1; j <= n; ++j) {\n // ar.push_back(a[i] ^ a[j]);\n // }\n // }\n // sort(ar.rbegin(), ar.rend());\n // for (auto x : ar) cout << x << \" \";\n // cout << \"\\n\";\n // return 0;\n\n // for (int i = 0; i <= n; ++i) trie.add(a[i]);\n\n auto calc = [&](int lb) -> ll {\n ll res = 0;\n Trie trie;\n for (int i = 0; i <= n; ++i) {\n res += trie.get(a[i], lb);\n trie.add(a[i]);\n }\n return res;\n };\n\n int bl = 0, br = X, bm;\n while (br - bl > 1) {\n bm = bl + (br - bl) / 2;\n if (calc(bm) >= k) bl = bm;\n else br = bm;\n }\n\n cout << bl << \"\\n\";\n\n return 0;\n}", "accuracy": 1, "time_ms": 1170, "memory_kb": 42292, "score_of_the_acc": -1.0339, "final_rank": 12 }, { "submission_id": "aoj_0402_10799186", "code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n\nusing ll = long long;\n\nconst int X = 1 << 21;\n\nvoid xor_fwht(vector<ll>& a, bool inverse = false) {\n for (int x, y, len = 1; len < (int)a.size(); len <<= 1) {\n for (int i = 0; i < (int)a.size(); i += len << 1) {\n for (int j = 0; j < len; j++) {\n x = a[i + j], y = a[i + j + len];\n a[i + j] = x + y;\n a[i + j + len] = x - y;\n }\n }\n }\n if (inverse) {\n for (ll& x : a) {\n assert(x % (int) a.size() == 0);\n x /= a.size();\n }\n }\n}\n\nsigned main() {\n\n#ifdef DEBUG\n freopen(\"input.txt\", \"r\", stdin);\n#endif\n \n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n\n int n;\n cin >> n;\n ll k;\n cin >> k;\n vector<int> a(n + 1);\n for (int i = 1; i <= n; ++i) cin >> a[i];\n for (int i = 1; i <= n; ++i) a[i] ^= a[i - 1];\n\n vector<ll> cnt(X);\n for (auto x : a) ++cnt[x];\n\n vector<ll> f(X);\n\n // for (int i = 0; i <= n; ++i) {\n // for (int j = i + 1; j <= n; ++j) {\n // ++f[a[i] ^ a[j]];\n // }\n // }\n\n xor_fwht(cnt);\n for (int x = 0; x < X; ++x) f[x] = cnt[x] * cnt[x];\n xor_fwht(cnt, true);\n xor_fwht(f, true);\n\n for (int i = 0; i < X; ++i) f[0] -= 1ll * cnt[i] * cnt[i];\n for (int i = 0; i < X; ++i) f[i] /= 2;\n for (int i = 0; i < X; ++i) f[0] += 1ll * cnt[i] * (cnt[i] - 1) / 2;\n\n for (int x = X - 1; x >= 0; --x) {\n if (f[x] >= k) {\n cout << x << \"\\n\";\n return 0;\n } else {\n k -= f[x];\n }\n }\n\n return 0;\n}", "accuracy": 0.78125, "time_ms": 130, "memory_kb": 36044, "score_of_the_acc": -0.2244, "final_rank": 19 }, { "submission_id": "aoj_0402_10799182", "code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n\nusing ll = long long;\n\nconst int X = 1 << 20;\n\nvoid xor_fwht(vector<ll>& a, bool inverse = false) {\n for (int x, y, len = 1; len < (int)a.size(); len <<= 1) {\n for (int i = 0; i < (int)a.size(); i += len << 1) {\n for (int j = 0; j < len; j++) {\n x = a[i + j], y = a[i + j + len];\n a[i + j] = x + y;\n a[i + j + len] = x - y;\n }\n }\n }\n if (inverse) {\n for (ll& x : a) {\n x /= a.size();\n }\n }\n}\n\nsigned main() {\n\n#ifdef DEBUG\n freopen(\"input.txt\", \"r\", stdin);\n#endif\n \n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n\n int n;\n cin >> n;\n ll k;\n cin >> k;\n vector<int> a(n + 1);\n for (int i = 1; i <= n; ++i) cin >> a[i];\n for (int i = 1; i <= n; ++i) a[i] ^= a[i - 1];\n\n vector<ll> cnt(X);\n for (auto x : a) ++cnt[x];\n\n vector<ll> f(X);\n\n // for (int i = 0; i <= n; ++i) {\n // for (int j = i + 1; j <= n; ++j) {\n // ++f[a[i] ^ a[j]];\n // }\n // }\n\n xor_fwht(cnt);\n for (int x = 0; x < X; ++x) f[x] = cnt[x] * cnt[x];\n xor_fwht(cnt, true);\n xor_fwht(f, true);\n\n for (int i = 0; i < X; ++i) f[0] -= 1ll * cnt[i] * cnt[i];\n for (int i = 0; i < X; ++i) f[i] /= 2;\n for (int i = 0; i < X; ++i) f[0] += 1ll * cnt[i] * (cnt[i] - 1) / 2;\n\n for (int x = X - 1; x >= 0; --x) {\n if (f[x] >= k) {\n cout << x << \"\\n\";\n return 0;\n } else {\n k -= f[x];\n }\n }\n\n return 0;\n}", "accuracy": 0.8125, "time_ms": 40, "memory_kb": 19728, "score_of_the_acc": -0.0849, "final_rank": 15 }, { "submission_id": "aoj_0402_10799172", "code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n\nusing ll = long long;\n\nconst int X = 1 << 20;\n\nvoid xor_fwht(vector<ll>& a, bool inverse = false) {\n for (int x, y, len = 1; len < (int)a.size(); len <<= 1) {\n for (int i = 0; i < (int)a.size(); i += len << 1) {\n for (int j = 0; j < len; j++) {\n x = a[i + j], y = a[i + j + len];\n a[i + j] = x + y;\n a[i + j + len] = x - y;\n }\n }\n }\n if (inverse) {\n for (ll& x : a) {\n x /= a.size();\n }\n }\n}\n\nsigned main() {\n\n#ifdef DEBUG\n freopen(\"input.txt\", \"r\", stdin);\n#endif\n \n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n\n int n;\n cin >> n;\n ll k;\n cin >> k;\n vector<int> a(n + 1);\n for (int i = 1; i <= n; ++i) cin >> a[i];\n for (int i = 1; i <= n; ++i) a[i] ^= a[i - 1];\n\n vector<ll> cnt(X);\n for (auto x : a) ++cnt[x];\n\n vector<ll> f(X);\n\n // for (int i = 0; i < X; ++i) {\n // for (int j = 0; j < X; ++j) {\n // f[i ^ j] += 1ll * cnt[i] * cnt[j];\n // }\n // }\n\n xor_fwht(cnt);\n for (int x = 0; x < X; ++x) f[x] = cnt[x] * cnt[x];\n xor_fwht(cnt, true);\n xor_fwht(f, true);\n\n for (int i = 0; i < X; ++i) f[0] -= 1ll * cnt[i] * cnt[i];\n for (int i = 0; i < X; ++i) f[i] /= 2;\n for (int i = 0; i < X; ++i) f[i] += 1ll * cnt[i] * (cnt[i] - 1) / 2;\n\n for (int x = X - 1; x >= 0; --x) {\n if (f[x] >= k) {\n cout << x << \"\\n\";\n return 0;\n } else {\n k -= f[x];\n }\n }\n\n return 0;\n}", "accuracy": 0.125, "time_ms": 40, "memory_kb": 19540, "score_of_the_acc": -0.0841, "final_rank": 20 }, { "submission_id": "aoj_0402_9786136", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define overload(a,b,c,d,...) d\n#define rep1(i,n) for(ll i=0;i<(ll)n;++i)\n#define rep2(i,l,r) for(ll i=(ll)l;i<(ll)r;++i)\n#define rep(...) overload(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)\n#define rrep1(i,n) for(ll i=(ll)(n)-1;i>=0;--i)\n#define rrep2(i,l,r) for(ll i=(ll)(r)-1;i>=(ll)l;--i)\n#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)\n#define all(x) (x).begin(),(x).end()\n#define eb emplace_back\nstatic constexpr int dx[]={1,-1,0,0},dy[]={0,0,1,-1};\nusing vl=vector<ll>;\ntemplate<typename T,typename U>\nbool chmin(T&a,const U&b){return (a>b?a=b,true:false);}\ntemplate<typename T,typename U>\nbool chmax(T&a,const U&b){return (a<b?a=b,true:false);}\nint main(){\n\tll n,k;\n\tcin>>n>>k;\n\tvl a(n);\n\tfor(auto&e:a)cin>>e;\n\tvl s(n+1);\n\trep(i,n)s[i+1]=s[i]^a[i];\n\tstruct Node{\n\t\tll cnt;\n\t\tll ch[2]={-1,-1};\n\t\tNode():cnt(0){}\n\t};\n\t\n\tvector<Node>trie(1,Node());\n\tfor(auto e:s){\n\t\tll now=0;\n\t\trrep(j,20){\n\t\t\ttrie[now].cnt++;\n\t\t\tint nxt=(e>>j)&1;\n\t\t\tif(trie[now].ch[nxt]==-1){\n\t\t\t\ttrie[now].ch[nxt]=trie.size();\n\t\t\t\ttrie.emplace_back(Node());\n\t\t\t}\n\t\t\tnow=trie[now].ch[nxt];\n\t\t}\n\t\ttrie[now].cnt++;\n\t}\n\tk=n*(n+1)/2-k;\n\tll l=-1,r=1<<20;\n\twhile(r-l>1){\n\t\tll mid=(l+r)>>1;\n\t\tll cnt=0;\n\t\tfor(auto e:s){\n\t\t\tll now=0;\n\t\t\trrep(j,20){\n\t\t\t\tll tmp=((mid>>j)&1)^((e>>j)&1);\n\t\t\t\tif((mid>>j)&1){\n\t\t\t\t\tif(trie[now].ch[tmp^1]!=-1)cnt+=trie[trie[now].ch[tmp^1]].cnt;\n\t\t\t\t}\n\t\t\t\tif(trie[now].ch[tmp]==-1){\n\t\t\t\t\tnow=-1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tnow=trie[now].ch[tmp];\n\t\t\t}\n\t\t\tif(now!=-1)cnt+=trie[now].cnt;\n\t\t}\n\t\tcnt-=n+1;\n\t\tassert(cnt%2==0);\n\t\tcnt/=2;\n\t\tif(cnt<=k)l=mid;\n\t\telse r=mid;\n\t}\n\tcout<<r<<endl;\n}", "accuracy": 1, "time_ms": 200, "memory_kb": 18848, "score_of_the_acc": -0.2013, "final_rank": 3 }, { "submission_id": "aoj_0402_8370203", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tint N; long long K;\n\tcin >> N >> K;\n\tvector<int> A(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> A[i];\n\t}\n\tvector<int> B(N + 1);\n\tfor (int i = 0; i < N; i++) {\n\t\tB[i + 1] = B[i] ^ A[i];\n\t}\n\tsort(B.begin(), B.end());\n\tint bits = (B[N] == 0 ? 0 : 32 - __builtin_clz(B[N]));\n\tlong long rem = K * 2, cur = 0;\n\tfor (int i = bits - 1; i >= 0; i--) {\n\t\tlong long pairs = 0;\n\t\tfor (int j = 0; j <= N; j++) {\n\t\t\tint p = (B[j] ^ cur) >> i << i;\n\t\t\tint l = lower_bound(B.begin(), B.end(), p ^ (1 << i)) - B.begin();\n\t\t\tint r = lower_bound(B.begin(), B.end(), (p ^ (1 << i)) + (1 << i)) - B.begin();\n\t\t\tpairs += r - l;\n\t\t}\n\t\tif (rem > pairs) {\n\t\t\trem -= pairs;\n\t\t}\n\t\telse {\n\t\t\tcur += 1 << i;\n\t\t}\n\t}\n\tcout << cur << endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 3884, "score_of_the_acc": -0.0528, "final_rank": 2 }, { "submission_id": "aoj_0402_8370198", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\tint N, K;\n\tcin >> N >> K;\n\tvector<int> A(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tcin >> A[i];\n\t}\n\tvector<int> B(N + 1);\n\tfor (int i = 0; i < N; i++) {\n\t\tB[i + 1] = B[i] ^ A[i];\n\t}\n\tsort(B.begin(), B.end());\n\tint bits = (B[N] == 0 ? 0 : 32 - __builtin_clz(B[N]));\n\tlong long rem = K * 2, cur = 0;\n\tfor (int i = bits - 1; i >= 0; i--) {\n\t\tlong long pairs = 0;\n\t\tfor (int j = 0; j <= N; j++) {\n\t\t\tint p = (B[j] ^ cur) >> i << i;\n\t\t\tint l = lower_bound(B.begin(), B.end(), p ^ (1 << i)) - B.begin();\n\t\t\tint r = lower_bound(B.begin(), B.end(), (p ^ (1 << i)) + (1 << i)) - B.begin();\n\t\t\tpairs += r - l;\n\t\t}\n\t\tif (rem > pairs) {\n\t\t\trem -= pairs;\n\t\t}\n\t\telse {\n\t\t\tcur += 1 << i;\n\t\t}\n\t}\n\tcout << cur << endl;\n\treturn 0;\n}", "accuracy": 0.9375, "time_ms": 80, "memory_kb": 3856, "score_of_the_acc": -0.0451, "final_rank": 14 }, { "submission_id": "aoj_0402_6044295", "code_snippet": "//#pragma GCC target (\"avx2\")\n//#pragma GCC optimize(\"O3\")\n//#pragma GCC optimize(\"unroll-loops\")\n//#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<queue>\n#include<cmath>\n#include<map>\n#include<set>\n#include<list>\n#include<iomanip>\n#include<vector>\n#include<random>\n#include<functional>\n#include<algorithm>\n#include<stack>\n#include<cstdio>\n#include<cstring>\n#include<bitset>\n#include<unordered_map>\n#include<climits>\n#include<fstream>\n#include<complex>\n#include<time.h>\n#include<cassert>\n#include<functional>\n#include<numeric>\n#include<tuple>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing H = pair<ll, ll>;\nusing P = pair<ll, H>;\nusing vi = vector<ll>;\n#define all(a) (a).begin(),(a).end()\n#define fs first\n#define sc second\n#define xx first\n#define yy second.first\n#define zz second.second\n#define Q(i,j,k) mkp((i),mkp((j),(k)))\n#define rng(i,s,n) for(ll i = (s) ; i < (n) ; i++)\n#define rep(i,n) rng(i, 0, (n))\n#define mkp make_pair\n#define vec vector\n#define pb emplace_back\n#define siz(a) int((a).size())\n#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())\n#define getidx(b,i) (lower_bound(all((b)),(i))-(b).begin())\n#define ssp(i,n) (i==(ll)(n)-1?\"\\n\":\" \")\n#define ctoi(c) (int)((c)-'0')\n#define itoc(c) (char)((c)+'0')\n#define cyes printf(\"Yes\\n\")\n#define cno printf(\"No\\n\")\n#define cdf(n) for(int quetimes_=(n);quetimes_>0;quetimes_--)\n#define gcj printf(\"Case #%lld: \",quetimes_+1)\n#define readv(a,n) (a).resize((n),0);rep(i,(n)) (a)[i]=read()\n#define found(a,x) (a.find(x)!=a.end())\nconstexpr ll mod = (ll)1e9 + 7;\nconstexpr ll Mod = 998244353;\nconstexpr ld EPS = 1e-10;\nconstexpr ll inf = (ll)3 * 1e18;\nconstexpr short Inf = 30000;\nconstexpr int dx[] = { -1,1,0,0 }, dy[] = { 0,0,-1,1 };\ntemplate<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }\nll read() { ll u, k = scanf(\"%lld\", &u); return u; }\nstring reads() { string s; cin >> s; return s; }\nH readh(short g = 0) { H u; int k = scanf(\"%lld %lld\", &u.fs, &u.sc); if (g == 1) u.fs--, u.sc--; if (g == 2) u.fs--; return u; }\nbool ina(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }\nbool ina(int t, int l, int r) { return l <= t && t < r; }\nll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }\nll ppc(ll x) {\n int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;\n return sum;\n}\ntemplate<typename T>\nvoid fin(T x) { cout << x << endl; exit(0); }\n\ntemplate<typename T>\nclass csum {\n vec<T> v;\npublic:\n csum(vec<T>& a) :v(a) { build(); }\n csum() {}\n csum(int sz) { init(sz); }\n void init(int sz) { v = vector<T>(sz + 1, 0); }\n void init(vec<T>& a) { v = a; build(); }\n void build() {\n for (int i = 1; i < v.size(); i++) v[i] += v[i - 1];\n }\n void add(int l, int r, T x) {\n v[l] += x;\n v[r] -= x;\n }//[l,r)\n void add(int t, T x) {\n v[t] += x;\n }//[l,r)\n //[l,r]\n T a(int l, int r) {\n if (r < l) return 0;\n return v[r] - (l == 0 ? 0 : v[l - 1]);\n }\n //[l,r)\n T b(int l, int r) {\n return a(l, r - 1);\n }\n T a(pair<int, int>t) {\n return a(t.first, t.second);\n }\n T b(pair<int, int>t) {\n return b(t.first, t.second);\n }\n T operator[](int x)const {\n return v[x];\n }\n};\nclass via {\n using H = pair<ll, ll>;\n bool comp;\npublic:\n vector<H>a;\n via() :comp(true) {}\n via(vector<H>dat) :a(dat), comp(false) { build(); }\n void push(int l, int r) { a.push_back(H{ l,r }); comp = false; }\n void push(H a) { push(a.first, a.second); }\n void build() {\n if (comp) return;\n comp = true;\n sort(a.begin(), a.end());\n int fst = -1; ll lst = -1;\n vector<H>b;\n for (int i = 0; i < a.size(); i++) {\n if (fst < 0) fst = i, lst = a[i].second;\n if (lst < a[i].first) {\n b.push_back(H{ a[fst].first,lst });\n fst = i, lst = a[i].second;\n }\n else if (lst < a[i].second) lst = a[i].second;\n }\n if (~fst) b.push_back(H{ a[fst].first, lst });\n a = b;\n }\n ll size() { return ll(a.size()); }\n ll sum() {\n build();\n ll sum = 0;\n for (auto g : a) sum += g.second - g.first;\n return sum;\n }\n via inter(via& v) {\n build(); v.build();\n via ret;\n for (auto g : a) ret.push(g);\n for (auto g : v.a) ret.push(g);\n ret.build(); return ret;\n }\n via comb(via& v) {\n build(); v.build();\n int s = 0, t = 0;\n via ret;\n while (s < a.size() && t < v.size()) {\n if (v[t].second <= a[s].first) t++;\n else if (a[s].second <= v[t].first) s++;\n else {\n ret.push(max(a[s].first, v[t].first), min(a[s].second, v[t].second));\n if (a[s].second <= v[t].second) s++;\n else t++;\n }\n }\n return ret;\n }\n H& operator[](int t) { return a[t]; }\n};\ntemplate<ll mod>\nclass modint {\npublic:ll v;\n modint(ll v = 0) { s(v % mod + mod); }\n constexpr static int fn_ = (ll)2e6 + 5;\n static vector<modint>fact, comp;\n modint pow(ll x) const {\n modint b(v), c(1);\n while (x) {\n if (x & 1) c *= b;\n b *= b;\n x >>= 1;\n }\n return c;\n }\n inline modint& s(int vv) {\n v = vv < mod ? vv : vv - mod;\n return *this;\n }\n inline modint inv()const { return pow(mod - 2); }\n inline modint operator-()const { return modint() - *this; }\n inline modint& operator+=(const modint b) { return s(v + b.v); }\n inline modint& operator-=(const modint b) { return s(v + mod - b.v); }\n inline modint& operator*=(const modint b) { v = v * b.v % mod; return *this; }\n inline modint& operator/=(const modint b) { v = v * b.inv().v % mod; return *this; }\n inline modint operator+(const modint& b) const { return modint(v) += b; }\n inline modint operator-(const modint& b) const { return modint(v) -= b; }\n inline modint operator*(const modint& b) const { return modint(v) *= b; }\n inline modint operator/(const modint& b) const { return modint(v) /= b; }\n friend ostream& operator<<(ostream& os, const modint& m) {\n return os << m.v;\n }\n friend istream& operator>>(istream& is, modint& m) {\n int x; is >> x; m = modint(x);\n return is;\n }\n bool operator<(const modint& r)const { return v < r.v; }\n bool operator>(const modint& r)const { return v > r.v; }\n bool operator<=(const modint& r)const { return v <= r.v; }\n bool operator>=(const modint& r)const { return v >= r.v; }\n bool operator==(const modint& r)const { return v == r.v; }\n bool operator!=(const modint& r)const { return v != r.v; }\n explicit operator bool()const { return v; }\n explicit operator int()const { return v; }\n modint comb(modint k) {\n if (k > *this) return modint();\n if (fact.empty()) combinit();\n if (v >= fn_) {\n if (k > *this - k) k = *this - k;\n modint tmp(1);\n for (int i = v; i >= v - k.v + 1; i--) tmp *= modint(i);\n return tmp * comp[k.v];\n }\n return fact[v] * comp[k.v] * comp[v - k.v];\n }//nCk\n modint perm(modint k) {\n if (k > *this) return modint();\n if (fact.empty()) combinit();\n if (v >= fn_) {\n modint tmp(1);\n for (int i = v; i >= v - k.v + 1; i--) tmp *= modint(i);\n return tmp;\n }\n return fact[v] * comp[v - k.v];\n }//nPk\n static void combinit() {\n fact.assign(fn_, modint());\n fact[0] = 1;\n for (int i = 1; i < fn_; i++) fact[i] = fact[i - 1] * modint(i);\n comp.assign(fn_, modint());\n comp[fn_ - 1] = fact[fn_ - 1].inv();\n for (int i = fn_ - 2; i >= 0; i--) comp[i] = comp[i + 1] * modint(i + 1);\n }\n};\nusing mint = modint<ll(1e9 + 7)>; template<>vec<mint> mint::fact = vec<mint>(); template<>vec<mint> mint::comp = vec<mint>();\n//--------------------------------------------------------------\n//--------------------------------------------------------------\nclass unionfind {\n int size = 0, grps = 0;\n vector<int>pa;\npublic:\n unionfind() {}\n unionfind(int n) {\n init(n);\n }\n void init(int n) {\n size = n, grps = n;\n pa.assign(n, -1);\n }\n int root(int x) {\n if (pa[x] < 0) return x;\n return pa[x] = root(pa[x]);\n }\n bool unite(int x, int y) {\n x = root(x); y = root(y);\n if (x == y) return false;\n grps--;\n if (pa[x] > pa[y]) swap(x, y);\n pa[x] += pa[y];\n pa[y] = x;\n return true;\n }\n bool same(int x, int y) {\n return root(x) == root(y);\n }\n bool isroot(int x) {\n return x == root(x);\n }\n int sz(int x) {\n return -pa[root(x)];\n }\n int groups() {\n return grps;\n }\n H operator[](int x) {\n x = root(x);\n return H{ x,-pa[x] };\n }\n};\n\nstruct Node {\n Node* zero, * one;\n int cnt;\n};\nint rr = 0;\nNode pool[5000000];\nNode* roots[200000];\nNode* nil;\nNode* news() {\n Node* tmp = &pool[rr++];\n tmp->one = nil;\n tmp->zero = nil;\n tmp->cnt = 0;\n return tmp;\n}\n\nvi a, b;\n\nNode* update(int i, int j, Node* cur) {\n if (j == 0) {\n Node* tmp = news();\n tmp->cnt = cur->cnt + 1;\n return tmp;\n }\n Node* tmp, *now = news();\n if ((b[i] >> (j - 1)) & 1) {\n if (cur->one == nil) {\n cur->one = news();\n }\n tmp = update(i, j - 1, cur->one);\n\n now->zero = cur->zero;\n now->one = tmp;\n now->cnt = cur->zero->cnt + tmp->cnt;\n }\n else {\n if (cur->zero == nil) {\n cur->zero = news();\n }\n tmp = update(i, j - 1, cur->zero);\n\n now->one = cur->one;\n now->zero = tmp;\n now->cnt = cur->one->cnt + tmp->cnt;\n }\n\n return now;\n}\n\n\nsigned main() {\n int n;ll k; cin >> n >> k;\n a; readv(a, n);\n b.pb(0);\n rep(i, n) b.pb(a[i]);\n n++;\n rng(i,1, n) {\n b[i] = b[i - 1] ^ b[i];\n }\n\n nil = &pool[rr++];\n roots[0] = news();\n for (int i = 0; i < n; i++) {\n roots[i + 1] = update(i, 21, roots[i]);\n }\n\n int ok = 0, ng = 2000000, mid;\n while (ng - ok > 1) {\n mid = (ok + ng) / 2;\n ll cnt = 0;\n for (int i = 0; i < n; i++) {\n Node* now = roots[i];\n for (int j = 21; j > 0; j--) {\n if (now == nil) break;\n if (((b[i] >> (j-1)) & 1) ){\n if ((mid >> (j-1)) & 1) now = now->zero;\n else {\n cnt += now->zero->cnt;\n now = now->one;\n }\n }\n else {\n if ((mid >> (j-1)) & 1) {\n now = now->one;\n }\n else {\n cnt += now->one->cnt;\n now = now->zero;\n }\n }\n }\n cnt += now->cnt;\n }\n if (cnt >= k) ok = mid;\n else ng = mid;\n }\n cout << ok << endl;\n}", "accuracy": 1, "time_ms": 370, "memory_kb": 69696, "score_of_the_acc": -0.553, "final_rank": 10 }, { "submission_id": "aoj_0402_6043907", "code_snippet": "#include <bits/stdc++.h>\n\nusing ll = long long;\n\ntemplate <class T> using Vec = std::vector<T>;\n\ntemplate <class F> struct RecLambda : private F {\n explicit RecLambda(F&& f) : F(std::forward<F>(f)) {}\n template <class... Args> decltype(auto) operator()(Args&&... args) const {\n return F::operator()(*this, std::forward<Args>(args)...);\n }\n};\n\nconstexpr int LOG = 20;\n\nint main() {\n int N;\n ll K;\n std::cin >> N >> K;\n K *= 2;\n Vec<int> A(N + 1);\n for (int i = 0; i < N; ++i) {\n std::cin >> A[i + 1];\n A[i + 1] ^= A[i];\n }\n const auto count = RecLambda([&](auto&& dfs, Vec<int> x, Vec<int> y, int thres, int log) -> ll {\n if (x.empty() or y.empty()) return 0;\n if (thres == 0) return (ll)x.size() * (ll)y.size();\n Vec<int> x0, x1, y0, y1;\n for (const int a : x) (a >> log & 1 ? x0 : x1).push_back(a);\n for (const int a : y) (a >> log & 1 ? y0 : y1).push_back(a);\n if (thres >> log & 1) {\n thres ^= 1 << log;\n return dfs(x0, y1, thres, log - 1) + dfs(x1, y0, thres, log - 1);\n } else {\n return (ll)x0.size() * (ll)y1.size() + (ll)x1.size() * (ll)y0.size() + dfs(x0, y0, thres, log - 1) + dfs(x1, y1, thres, log - 1);\n }\n });\n int ok = 0, ng = 1 << LOG;\n while (ng - ok > 1) {\n const int md = (ok + ng) >> 1;\n (count(A, A, md, LOG - 1) >= K ? ok : ng) = md;\n }\n std::cout << ok << '\\n';\n return 0;\n}", "accuracy": 1, "time_ms": 290, "memory_kb": 24388, "score_of_the_acc": -0.2934, "final_rank": 7 }, { "submission_id": "aoj_0402_6041563", "code_snippet": "#ifdef LOGX\n#define _GLIBCXX_DEBUG\n#endif\n#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define rep2(i,s,n) for(int i=int(s);i<(int)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\n#define vv vector\nconst int big=1e9+7;\n//const int big=998244353;\nconst char newl='\\n';\nconst int inf=1e9+10;\nconst ll INF=ll(1e18)+10;\nconst int dx[]={1,0,-1,0};\nconst int dy[]={0,1,0,-1};\n\n//複数個あれば複数個格納されるので気をつける。\n//だいたい O(word_size) とかで動く\n//2分木。一番下の\"高さ\"を-1、一番上をSZ-1にする。(高さhのすぐ下の辺がh-bit目を表す。)\ntemplate<typename T,int SZ=32>\nstruct BinaryTrie{\n BinaryTrie():root(nullptr){}\n int size(){\n return root ? root->cnt:0;\n }\n //xを追加する。同じ値を複数個追加することも可能。\n void insert(T x){\n root=insert_inner(root,x);\n }\n //xを一つ減らす。xが存在しなければ何もしない。\n void erase(T x){\n if(!root || !count(x))return;\n root=erase_inner(root,x);\n }\n //xの個数を返す。\n int count(T x){\n if(!root)return 0;\n return count_inner(root,x);\n }\n //x ^ XOR_valの最小値\n T min_val(T XOR_val=0){\n return min_val_inner(root,XOR_val)^XOR_val;\n }\n //x ^ XOR_valの最大値\n T max_val(T XOR_val=0){\n return min_val_inner(root,~XOR_val)^XOR_val;\n }\n //XOR_val を全体にxorした集合におけるx以下の個数\n int lower_count(T x,T XOR_val=0){\n return lower_count_inner(root,x,XOR_val);\n }\n int upper_count(T x,T XOR_val=0){\n return size()-lower_count(x-1,XOR_val);\n }\nprivate:\n struct Node{\n int cnt;\n Node *child[2];\n Node():cnt(0),child{nullptr,nullptr}{}\n };\n Node *root;\n Node* insert_inner(Node *now,const T x,const int now_height=SZ-1){\n if(!now)now=new Node;\n now->cnt++;\n if(now_height==-1)return now;\n int ne=x>>now_height & 1;\n now->child[ne]=insert_inner(now->child[ne],x,now_height-1);\n return now;\n }\n Node* erase_inner(Node *now,const T x,const int now_height=SZ-1){\n assert(now);\n now->cnt--;\n if(!now->cnt){\n delete now;\n return nullptr;\n }\n if(now_height==-1)return now;\n int ne=x>>now_height & 1;\n now->child[ne]=erase_inner(now->child[ne],x,now_height-1);\n return now;\n }\n int count_inner(Node *now,const T x,const int now_height=SZ-1){\n int ne=x>>now_height & 1;\n if(now_height==-1)return now->cnt;\n if(now->child[ne])return count_inner(now->child[ne],x,now_height-1);\n return 0;\n }\n T min_val_inner(Node *now,const T XOR_val,const int now_height=SZ-1){\n //要素が存在しなければfailed\n assert(now);\n if(now_height==-1)return 0;\n int ne=XOR_val>>now_height & 1;\n //少なくとも一方には子供が存在しているはず\n if(!now->child[ne])ne=!ne;\n return min_val_inner(now->child[ne],XOR_val,now_height-1) | (T)ne<<now_height;\n }\n int lower_count_inner(Node *now,const T x,const T XOR_val,const int now_height=SZ-1){\n assert(now);\n if(now_height==-1)return now->cnt;\n //XOR_valのビットが0：(xのビットが1 ? 0の個数を足して1に潜る : 0に潜る)\n //そうでない：(xのビットが1 ? 1の個数を0に足して0に潜る : 1に潜る)\n const int XOR_bit=(XOR_val>>now_height)&1;\n const int x_bit=(x>>now_height)&1;\n //-> (x_bit==1 ? XOR_bitの個数を足して!XOR_bitに潜る:XOR_bitに潜る)\n int ans=0;\n if(x_bit){\n if(now->child[XOR_bit]){\n ans+=now->child[XOR_bit]->cnt;\n }\n if(now->child[!XOR_bit]){\n ans+=lower_count_inner(now->child[!XOR_bit],x,XOR_val,now_height-1);\n }\n }\n else{\n if(now->child[XOR_bit]){\n ans=lower_count_inner(now->child[XOR_bit],x,XOR_val,now_height-1);\n }\n }\n return ans;\n }\n};\n\nint main(){\n int n;\n ll k;\n cin >> n >> k;\n vector<int> a(n+1);\n rep(i,n)cin >> a[i+1];\n rep(i,n)a[i+1]^=a[i];\n BinaryTrie<int,21> trie;\n for(int x:a)trie.insert(x);\n //x以上はk個以上ありますか？\n int ok=0,ng=(1<<20)-1;\n while(ng-ok>1){\n int mid=(ok+ng)/2;\n ll cnt=0;\n for(int x:a){\n cnt+=trie.upper_count(mid,x);\n }\n (cnt/2>=k ? ok:ng)=mid;\n }\n cout << ok << newl;\n}", "accuracy": 1, "time_ms": 250, "memory_kb": 17572, "score_of_the_acc": -0.2333, "final_rank": 5 }, { "submission_id": "aoj_0402_6041508", "code_snippet": "#ifdef LOGX\n#define _GLIBCXX_DEBUG\n#endif\n#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define rep2(i,s,n) for(int i=int(s);i<(int)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\n#define vv vector\nconst int big=1e9+7;\n//const int big=998244353;\nconst char newl='\\n';\nconst int inf=1e9+10;\nconst ll INF=ll(1e18)+10;\nconst int dx[]={1,0,-1,0};\nconst int dy[]={0,1,0,-1};\n\n#include<cassert>\n\n//複数個あれば複数個格納されるので気をつける。\n//だいたい O(word_size) とかで動く\n//2分木。一番下の\"高さ\"を-1、一番上をSZ-1にする。(高さhのすぐ下の辺がh-bit目を表す。)\ntemplate<typename T,int SZ=32>\nstruct BinaryTrie{\n BinaryTrie():root(nullptr){}\n int size(){\n return root ? root->cnt:0;\n }\n //xを追加する。同じ値を複数個追加することも可能。\n void insert(T x){\n root=insert_inner(root,x);\n }\n //xを一つ減らす。xが存在しなければ何もしない。\n void erase(T x){\n if(!root || !count(x))return;\n root=erase_inner(root,x);\n }\n //xの個数を返す。\n int count(T x){\n if(!root)return 0;\n return count_inner(root,x);\n }\n //x ^ XOR_valの最小値\n T min_val(T XOR_val=0){\n return min_val_inner(root,XOR_val)^XOR_val;\n }\n //x ^ XOR_valの最大値\n T max_val(T XOR_val=0){\n return min_val_inner(root,~XOR_val)^XOR_val;\n }\n int lower_count(T x,T XOR_val=0){\n return lower_count_inner(root,x,XOR_val);\n }\nprivate:\n struct Node{\n int cnt;\n Node *child[2];\n Node():cnt(0),child{nullptr,nullptr}{}\n };\n Node *root;\n Node* insert_inner(Node *now,const T x,const int now_height=SZ-1){\n if(!now)now=new Node;\n now->cnt++;\n if(now_height==-1)return now;\n int ne=x>>now_height & 1;\n now->child[ne]=insert_inner(now->child[ne],x,now_height-1);\n return now;\n }\n Node* erase_inner(Node *now,const T x,const int now_height=SZ-1){\n assert(now);\n now->cnt--;\n if(!now->cnt){\n delete now;\n return nullptr;\n }\n if(now_height==-1)return now;\n int ne=x>>now_height & 1;\n now->child[ne]=erase_inner(now->child[ne],x,now_height-1);\n return now;\n }\n int count_inner(Node *now,const T x,const int now_height=SZ-1){\n int ne=x>>now_height & 1;\n if(now_height==-1)return now->cnt;\n if(now->child[ne])return count_inner(now->child[ne],x,now_height-1);\n return 0;\n }\n T min_val_inner(Node *now,const T XOR_val,const int now_height=SZ-1){\n //要素が存在しなければfailed\n assert(now);\n if(now_height==-1)return 0;\n int ne=XOR_val>>now_height & 1;\n //少なくとも一方には子供が存在しているはず\n if(!now->child[ne])ne=!ne;\n return min_val_inner(now->child[ne],XOR_val,now_height-1) | (T)ne<<now_height;\n }\n int lower_count_inner(Node *now,const T x,const T XOR_val,const int now_height=SZ-1){\n assert(now);\n if(now_height==-1)return now->cnt;\n //XOR_valのビットが0：(xのビットが1 ? 0の個数を足して1に潜る : 0に潜る)\n //そうでない：(xのビットが1 ? 1の個数を0に足して0に潜る : 1に潜る)\n const int XOR_bit=(XOR_val>>now_height)&1;\n const int x_bit=(x>>now_height)&1;\n //-> (x_bit==1 ? XOR_bitの個数を足して!XOR_bitに潜る:XOR_bitに潜る)\n int ans=0;\n if(x_bit){\n if(now->child[XOR_bit]){\n ans+=now->child[XOR_bit]->cnt;\n }\n if(now->child[!XOR_bit]){\n ans+=lower_count_inner(now->child[!XOR_bit],x,XOR_val,now_height-1);\n }\n }\n else{\n if(now->child[XOR_bit]){\n ans=lower_count_inner(now->child[XOR_bit],x,XOR_val,now_height-1);\n }\n }\n return ans;\n }\n};\n\nint main(){\n int n;\n ll k;\n cin >> n >> k;\n vector<int> a(n);\n rep(i,n)cin >> a[i];\n rep(i,n-1)a[i+1]^=a[i];\n BinaryTrie<int,21> trie;\n for(int x:a)trie.insert(x);\n //x以上はk個以上ありますか？\n int ok=0,ng=(1<<20)-1;\n while(ng-ok>1){\n int mid=(ok+ng)/2;\n ll cnt=0;\n for(int x:a){\n cnt+=trie.size()-trie.lower_count(mid-1,x)+(x>=mid)*2;\n }\n (cnt/2>=k ? ok:ng)=mid;\n }\n cout << ok << newl;\n}", "accuracy": 1, "time_ms": 250, "memory_kb": 17656, "score_of_the_acc": -0.2337, "final_rank": 6 }, { "submission_id": "aoj_0402_6041497", "code_snippet": "#ifdef LOGX\n#define _GLIBCXX_DEBUG\n#endif\n#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define rep2(i,s,n) for(int i=int(s);i<(int)(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\n#define vv vector\nconst int big=1e9+7;\n//const int big=998244353;\nconst char newl='\\n';\nconst int inf=1e9+10;\nconst ll INF=ll(1e18)+10;\nconst int dx[]={1,0,-1,0};\nconst int dy[]={0,1,0,-1};\n\n#include<cassert>\n\n//複数個あれば複数個格納されるので気をつける。\n//だいたい O(word_size) とかで動く\n//2分木。一番下の\"高さ\"を-1、一番上をSZ-1にする。(高さhのすぐ下の辺がh-bit目を表す。)\ntemplate<typename T,int SZ=32>\nstruct BinaryTrie{\n BinaryTrie():root(nullptr){}\n int size(){\n return root ? root->cnt:0;\n }\n //xを追加する。同じ値を複数個追加することも可能。\n void insert(T x){\n root=insert_inner(root,x);\n }\n //xを一つ減らす。xが存在しなければ何もしない。\n void erase(T x){\n if(!root || !count(x))return;\n root=erase_inner(root,x);\n }\n //xの個数を返す。\n int count(T x){\n if(!root)return 0;\n return count_inner(root,x);\n }\n //x ^ XOR_valの最小値\n T min_val(T XOR_val=0){\n return min_val_inner(root,XOR_val)^XOR_val;\n }\n //x ^ XOR_valの最大値\n T max_val(T XOR_val=0){\n return min_val_inner(root,~XOR_val)^XOR_val;\n }\n int lower_count(T x,T XOR_val=0){\n return lower_count_inner(root,x,XOR_val);\n }\nprivate:\n struct Node{\n int cnt;\n Node *child[2];\n Node():cnt(0),child{nullptr,nullptr}{}\n };\n Node *root;\n Node* insert_inner(Node *now,const T x,const int now_height=SZ-1){\n if(!now)now=new Node;\n now->cnt++;\n if(now_height==-1)return now;\n int ne=x>>now_height & 1;\n now->child[ne]=insert_inner(now->child[ne],x,now_height-1);\n return now;\n }\n Node* erase_inner(Node *now,const T x,const int now_height=SZ-1){\n assert(now);\n now->cnt--;\n if(!now->cnt){\n delete now;\n return nullptr;\n }\n if(now_height==-1)return now;\n int ne=x>>now_height & 1;\n now->child[ne]=erase_inner(now->child[ne],x,now_height-1);\n return now;\n }\n int count_inner(Node *now,const T x,const int now_height=SZ-1){\n int ne=x>>now_height & 1;\n if(now_height==-1)return now->cnt;\n if(now->child[ne])return count_inner(now->child[ne],x,now_height-1);\n return 0;\n }\n T min_val_inner(Node *now,const T XOR_val,const int now_height=SZ-1){\n //要素が存在しなければfailed\n assert(now);\n if(now_height==-1)return 0;\n int ne=XOR_val>>now_height & 1;\n //少なくとも一方には子供が存在しているはず\n if(!now->child[ne])ne=!ne;\n return min_val_inner(now->child[ne],XOR_val,now_height-1) | (T)ne<<now_height;\n }\n int lower_count_inner(Node *now,const T x,const T XOR_val,const int now_height=SZ-1){\n assert(now);\n if(now_height==-1)return now->cnt;\n //XOR_valのビットが0：(xのビットが1 ? 0の個数を足して1に潜る : 0に潜る)\n //そうでない：(xのビットが1 ? 1の個数を0に足して0に潜る : 1に潜る)\n const int XOR_bit=(XOR_val>>now_height)&1;\n const int x_bit=(x>>now_height)&1;\n //-> (x_bit==1 ? XOR_bitの個数を足して!XOR_bitに潜る:XOR_bitに潜る)\n int ans=0;\n if(x_bit){\n if(now->child[XOR_bit]){\n ans+=now->child[XOR_bit]->cnt;\n }\n if(now->child[!XOR_bit]){\n ans+=lower_count_inner(now->child[!XOR_bit],x,XOR_val,now_height-1);\n }\n }\n else{\n if(now->child[XOR_bit]){\n ans=lower_count_inner(now->child[XOR_bit],x,XOR_val,now_height-1);\n }\n }\n return ans;\n }\n};\n\nint main(){\n int n;\n ll k;\n cin >> n >> k;\n vector<int> a(n);\n rep(i,n)cin >> a[i];\n rep(i,n-1)a[i+1]^=a[i];\n BinaryTrie<int,21> trie;\n trie.insert(0);\n //x以上はk個以上ありますか？\n int ok=0,ng=(1<<20)-1;\n while(ng-ok>1){\n int mid=(ok+ng)/2;\n ll cnt=0;\n for(int x:a){\n cnt+=trie.size()-trie.lower_count(mid-1,x);\n trie.insert(x);\n }\n for(int x:a)trie.erase(x);\n (cnt>=k ? ok:ng)=mid;\n }\n cout << ok << newl;\n}", "accuracy": 1, "time_ms": 1350, "memory_kb": 231008, "score_of_the_acc": -2, "final_rank": 13 }, { "submission_id": "aoj_0402_6040727", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nvector<long long> fwt(vector<long long> A, bool inv){\n int N = A.size();\n for (int i = 1; i < N; i <<= 1){\n for (int j = 0; j < N; j++){\n if ((j & i) == 0){\n long long x = A[j];\n long long y = A[j | i];\n A[j] = x + y;\n A[j | i] = x - y;\n if (inv){\n A[j] >>= 1;\n A[j | i] >>= 1;\n }\n }\n }\n }\n return A;\n}\nvector<long long> xor_convolution(vector<long long> A, vector<long long> B, int N){\n A = fwt(A, false);\n B = fwt(B, false);\n vector<long long> C(N);\n for (int i = 0; i < N; i++){\n C[i] = A[i] * B[i];\n }\n C = fwt(C, true);\n return C;\n}\nint main(){\n int N;\n long long K;\n cin >> N >> K;\n vector<int> A(N);\n for (int i = 0; i < N; i++){\n cin >> A[i];\n }\n vector<int> X(N + 1);\n X[0] = 0;\n for (int i = 0; i < N; i++){\n X[i + 1] = X[i] ^ A[i];\n }\n vector<long long> F(1 << 20, 0);\n for (int i = 0; i <= N; i++){\n F[X[i]]++;\n }\n vector<long long> cnt = xor_convolution(F, F, 1 << 20);\n cnt[0] -= N + 1;\n for (int i = 0; i < (1 << 20); i++){\n cnt[i] /= 2;\n if (cnt[i] > 0){\n }\n }\n for (int i = (1 << 20) - 1; i >= 0; i--){\n if (K <= cnt[i]){\n cout << i << endl;\n break;\n }\n K -= cnt[i];\n }\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 44920, "score_of_the_acc": -0.2184, "final_rank": 4 }, { "submission_id": "aoj_0402_5774499", "code_snippet": "#include <bits/stdc++.h>\n\nstruct Node {\n Node *to[2];\n int sum;\n Node() {\n sum = 0;\n to[0] = to[1] = nullptr;\n }\n ~Node() {}\n void add() { sum++; }\n};\n\nstruct Trie {\n Node *root;\n int x;\n Trie(int x) : x(x) { root = new Node(); }\n ~Trie(){}\n void add(Node *p, int x, int bit) {\n p->add();\n if (bit == -1) {\n return;\n }\n if (x >> bit & 1) {\n if (p->to[1] == nullptr) {\n p->to[1] = new Node();\n }\n add(p->to[1], x, bit - 1);\n } else {\n if (p->to[0] == nullptr) {\n p->to[0] = new Node();\n }\n add(p->to[0], x, bit - 1);\n }\n }\n void add(int x) {\n add(root, x, 20);\n }\n int search(Node *p, int t, int bit) {\n if (p == nullptr) return 0;\n if (bit == -1) {\n return p->sum;\n }\n int v = (t >> bit & 1) ^ 1;\n if (x >> bit & 1) {\n return search(p->to[v], t, bit - 1);\n } else {\n int ans = 0;\n if (p->to[v] != nullptr) ans = p->to[v]->sum;\n return ans + search(p->to[v ^ 1], t, bit - 1);\n }\n }\n int search(int t) {\n return search(root, t, 20);\n }\n void clear(Node *p) {\n if (p->to[0] != nullptr) {\n clear(p->to[0]);\n }\n if (p->to[1] != nullptr) {\n clear(p->to[1]);\n }\n delete(p);\n }\n void clear(){\n clear(root);\n }\n};\n\nusing i64 = long long;\n\nint main() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n \n int n;\n i64 k;\n std::cin >> n >> k;\n \n std::vector<int> a(n), pre(n + 1);\n for (int i = 0; i < n; i++) {\n std::cin >> a[i];\n pre[i + 1] = pre[i] ^ a[i];\n }\n \n auto check = [&](int x) {\n Trie g(x);\n i64 ans = 0;\n for (int i = 1; i <= n; i++) {\n g.add(pre[i - 1]);\n ans += g.search(pre[i]);\n }\n g.clear();\n return ans >= k;\n };\n \n int l = -1, r = 1 << 20;\n while (l + 1 < r) {\n int m = (l + r) / 2;\n if (check(m)) {\n l = m;\n } else {\n r = m;\n }\n }\n \n std::cout << l << \"\\n\";\n \n return 0;\n}", "accuracy": 1, "time_ms": 1210, "memory_kb": 18032, "score_of_the_acc": -0.9571, "final_rank": 11 }, { "submission_id": "aoj_0402_5774492", "code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\n\n#define int long long\n\nstruct trie{\n\tvector<array<int, 2>> tree;\n\tvector<int> sub;\n\tint n, last;\n\tvoid init(){\n\t\ttree.resize(1), sub.resize(1);\n\t\tlast = 0;\n\t}\n\t\n\tvoid add(int x){\n\t\tint node = 0;\n\t\tfor(int i=20;~i;i--){\n\t\t\tint bit = x >> i & 1;\n\t\t\tif(tree[node][bit]) node = tree[node][bit];\n\t\t\telse {\n\t\t\t\ttree[node][bit] = ++last;\n\t\t\t\ttree.push_back({0, 0});\n\t\t\t\tsub.push_back(0);\n\t\t\t\tnode = last;\n\t\t\t} sub[node]++;\n\t\t} \n\t}\n\t\n\tint get(int pref, int x){\n\t\tint node = 0, res = 0;\n\t\tfor(int i=20;~i;i--){\n\t\t\tint bp = pref>>i&1, bx = x>>i&1;\n\t\t\tif(bx){\n\t\t\t\tnode = tree[node][bp ^ 1];\n\t\t\t} else {\n\t\t\t\tif(tree[node][bp ^ 1]) res += sub[tree[node][bp ^ 1]];\n\t\t\t\tnode = tree[node][bp];\n\t\t\t}\n\t\t\t\n\t\t\tif(!node) break;\n\t\t}\n\t\t\n\t\treturn res + (node ? sub[node] : 0);\n\t}\n}; \n\nvoid solve(){\n\tint n, k; cin>>n>>k;\n\tvector<int> a(n);\n\tfor(int i=0;i<n;i++){\n\t\tcin>>a[i];\n\t}\n\t\n\t//~ cout<<\"here\"<<endl;\n\t\n\tauto check = [&](int m){\n\t\ttrie tt;\n\t\ttt.init();\n\t\t\n\t\tint res = 0;\n\t\tvector<int> pref(n, 0);\n\t\ttt.add(0);\n\t\t\n\t\tfor(int i=0;i<n;i++){\n\t\t\tif(i) pref[i] = pref[i-1];\n\t\t\tpref[i] ^= a[i];\n\t\t\tres += tt.get(pref[i], m);\n\t\t\ttt.add(pref[i]);\n\t\t}\n\t\t\n\t\t//~ cout<<m<<\" \"<<res<<endl;\n\t\t\n\t\treturn (res < k);\n\t}; \n\t\n\tint l = 0, r = (1 << 21) - 1;\n\twhile(l < r){\n\t\tint m = (l + r + 1)>>1;\n\t\tif(check(m)) r = m - 1;\n\t\telse l = m;\n\t}\n\t\n\tcout<<l<<\"\\n\";\n}\n\nsigned main(){\n\tios_base::sync_with_stdio(0); cin.tie(0);\n\tint t = 1;\n\t//~ cin>>t;\n\twhile(t--) solve();\n}", "accuracy": 1, "time_ms": 470, "memory_kb": 20500, "score_of_the_acc": -0.4116, "final_rank": 9 }, { "submission_id": "aoj_0402_5774475", "code_snippet": "#include <bits/stdc++.h>\n\nstruct Node {\n Node *to[2];\n int sum;\n Node() {\n sum = 0;\n to[0] = to[1] = nullptr;\n }\n void add() { sum++; }\n};\n\nstruct trie {\n Node *root;\n int x;\n trie(int x) : x(x) { root = new Node(); }\n void add(Node *p, int x, int bit) {\n p->add();\n if (bit == -1) {\n return;\n }\n if (x & (1 << bit)) {\n if (p->to[1] == nullptr) {\n p->to[1] = new Node();\n }\n add(p->to[1], x, bit - 1);\n } else {\n if (p->to[0] == nullptr) {\n p->to[0] = new Node();\n }\n add(p->to[0], x, bit - 1);\n }\n }\n void add(int x) {\n add(root, x, 20);\n }\n int search(Node *p, int t, int bit) {\n if (p == nullptr) return 0;\n if (bit == -1) {\n return p->sum;\n }\n int v = (t >> bit & 1) ^ 1;\n if (x & (1 << bit)) {\n return search(p->to[v], t, bit - 1);\n } else {\n int ans = 0;\n if (p->to[v] != nullptr) ans = p->to[v]->sum;\n return ans + search(p->to[v ^ 1], t, bit - 1);\n }\n }\n int search(int t) {\n return search(root, t, 20);\n }\n};\n\nint main() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n \n int n, k;\n std::cin >> n >> k;\n \n std::vector<int> a(n), pre(n + 1);\n for (int i = 0; i < n; i++) {\n std::cin >> a[i];\n pre[i + 1] = pre[i] ^ a[i];\n }\n \n auto check = [&](int x) {\n trie g(x);\n int ans = 0;\n for (int i = 1; i <= n; i++) {\n g.add(pre[i - 1]);\n ans += g.search(pre[i]);\n }\n return ans >= k;\n };\n \n int l = -1, r = 1 << 20;\n while (l + 1 < r) {\n int m = (l + r) / 2;\n if (check(m)) {\n l = m;\n } else {\n r = m;\n }\n }\n \n std::cout << l << \"\\n\";\n \n return 0;\n}", "accuracy": 0.8125, "time_ms": 400, "memory_kb": 119488, "score_of_the_acc": -0.7948, "final_rank": 16 }, { "submission_id": "aoj_0402_5774472", "code_snippet": "#include <bits/stdc++.h>\n\nstruct Node {\n Node *to[2];\n int sum;\n Node() {\n sum = 0;\n to[0] = to[1] = nullptr;\n }\n void add() { sum++; }\n};\n\nstruct trie {\n Node *root;\n int x;\n trie(int x) : x(x) { root = new Node(); }\n void add(Node *p, int x, int bit) {\n p->add();\n if (bit == -1) {\n return;\n }\n if (x & (1 << bit)) {\n if (p->to[1] == nullptr) {\n p->to[1] = new Node();\n }\n add(p->to[1], x, bit - 1);\n } else {\n if (p->to[0] == nullptr) {\n p->to[0] = new Node();\n }\n add(p->to[0], x, bit - 1);\n }\n }\n void add(int x) {\n add(root, x, 20);\n }\n int search(Node *p, int t, int bit) {\n if (p == nullptr) return 0;\n if (bit == -1) {\n return p->sum;\n }\n int v = (t >> bit & 1) ^ 1;\n if (x & (1 << bit)) {\n return search(p->to[v], t, bit - 1);\n } else {\n int ans = 0;\n if (p->to[v] != nullptr) ans = p->to[v]->sum;\n return ans + search(p->to[v ^ 1], t, bit - 1);\n }\n }\n int search(int t) {\n return search(root, t, 20);\n }\n};\n\nint main() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n \n int n, k;\n std::cin >> n >> k;\n \n std::vector<int> a(n), pre(n + 1);\n for (int i = 0; i < n; i++) {\n std::cin >> a[i];\n pre[i + 1] = pre[i] ^ a[i];\n }\n \n auto check = [&](int x) {\n trie g(x);\n int ans = 0;\n for (int i = 1; i <= n; i++) {\n g.add(pre[i - 1]);\n // std::cout << g.search(pre[i]) << \"\\n\";\n ans += g.search(pre[i]);\n }\n // std::cout << ans << \"\\n\";\n return ans >= k;\n };\n \n // std::cout << check(2) << \"\\n\"; exit(0);\n \n int l = -1, r = 1 << 21;\n while (l + 1 < r) {\n int m = (l + r) / 2;\n if (check(m)) {\n l = m;\n } else {\n r = m;\n }\n }\n \n std::cout << l << \"\\n\";\n \n return 0;\n}", "accuracy": 0.8125, "time_ms": 420, "memory_kb": 125568, "score_of_the_acc": -0.8366, "final_rank": 18 }, { "submission_id": "aoj_0402_5774468", "code_snippet": "#include <bits/stdc++.h>\n\nstruct Node {\n Node *to[2];\n int sum;\n Node() {\n sum = 0;\n to[0] = to[1] = nullptr;\n }\n void add() { sum++; }\n};\n\nstruct trie {\n Node *root;\n int x;\n trie(int x) : x(x) { root = new Node(); }\n void add(Node *p, int x, int bit) {\n p->add();\n if (bit == -1) {\n return;\n }\n if (x & (1 << bit)) {\n if (p->to[1] == nullptr) {\n p->to[1] = new Node();\n }\n add(p->to[1], x, bit - 1);\n } else {\n if (p->to[0] == nullptr) {\n p->to[0] = new Node();\n }\n add(p->to[0], x, bit - 1);\n }\n }\n void add(int x) {\n add(root, x, 19);\n }\n int search(Node *p, int t, int bit) {\n if (p == nullptr) return 0;\n if (bit == -1) {\n return p->sum;\n }\n int v = (t >> bit & 1) ^ 1;\n if (x & (1 << bit)) {\n return search(p->to[v], t, bit - 1);\n } else {\n int ans = 0;\n if (p->to[v] != nullptr) ans = p->to[v]->sum;\n return ans + search(p->to[v ^ 1], t, bit - 1);\n }\n }\n int search(int t) {\n return search(root, t, 19);\n }\n};\n\nint main() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n \n int n, k;\n std::cin >> n >> k;\n \n std::vector<int> a(n), pre(n + 1);\n for (int i = 0; i < n; i++) {\n std::cin >> a[i];\n pre[i + 1] = pre[i] ^ a[i];\n }\n \n auto check = [&](int x) {\n trie g(x);\n int ans = 0;\n for (int i = 1; i <= n; i++) {\n g.add(pre[i - 1]);\n // std::cout << g.search(pre[i]) << \"\\n\";\n ans += g.search(pre[i]);\n }\n // std::cout << ans << \"\\n\";\n return ans >= k;\n };\n \n // std::cout << check(2) << \"\\n\"; exit(0);\n \n int l = -1, r = 1 << 20;\n while (l + 1 < r) {\n int m = (l + r) / 2;\n if (check(m)) {\n l = m;\n } else {\n r = m;\n }\n }\n \n std::cout << l << \"\\n\";\n \n return 0;\n}", "accuracy": 0.8125, "time_ms": 400, "memory_kb": 119496, "score_of_the_acc": -0.7948, "final_rank": 17 }, { "submission_id": "aoj_0402_5036854", "code_snippet": "#line 1 \"a.cpp\"\n#include<iostream>\nusing namespace std;\n#line 1 \"/home/kotatsugame/library/datastructure/BIT.cpp\"\n//1-indexed\n#include<vector>\ntemplate<typename T>\nstruct BIT{\n\tint n;\n\tvector<T>bit;\n\tBIT(int n_=0):n(n_),bit(n_+1){}\n\tT sum(int i)\n\t{\n\t\tT ans=0;\n\t\tfor(;i>0;i-=i&-i)ans+=bit[i];\n\t\treturn ans;\n\t}\n\tvoid add(int i,T a)\n\t{\n\t\tif(i==0)return;\n\t\tfor(;i<=n;i+=i&-i)bit[i]+=a;\n\t}\n\tint lower_bound(T k)//k<=sum(ret)\n\t{\n\t\tif(k<=0)return 0;\n\t\tint ret=0,i=1;\n\t\twhile((i<<1)<=n)i<<=1;\n\t\tfor(;i;i>>=1)\n\t\t\tif(ret+i<=n&&bit[ret+i]<k)k-=bit[ret+=i];\n\t\treturn ret+1;\n\t}\n};\n#line 4 \"a.cpp\"\nint N;\nlong K;\nint A[1<<17],S[1<<17];\nmain()\n{\n\tcin>>N>>K;\n\tfor(int i=0;i<N;i++)\n\t{\n\t\tcin>>A[i];\n\t\tS[i+1]=S[i]^A[i];\n\t}\n\tK=(long)N*(N+1)/2-K;\n\tint L=-1,R=1<<20;\n\twhile(R-L>1)\n\t{\n\t\tint mid=(L+R)/2;\n\t\tlong cnt=0;\n\t\tBIT<int>P(1<<20);\n\t\tfor(int i=0;i<=N;i++)\n\t\t{\n\t\t\tint st=0;\n\t\t\tfor(int j=20;j--;)\n\t\t\t{\n\t\t\t\tif(mid>>j&1)\n\t\t\t\t{\n\t\t\t\t\tif(S[i]>>j&1)\n\t\t\t\t\t{\n\t\t\t\t\t\tcnt+=P.sum(st+(1<<j+1))-P.sum(st+(1<<j));\n\t\t\t\t\t}\n\t\t\t\t\telse\n\t\t\t\t\t{\n\t\t\t\t\t\tcnt+=P.sum(st+(1<<j))-P.sum(st);\n\t\t\t\t\t\tst+=1<<j;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t{\n\t\t\t\t\tif(S[i]>>j&1)\n\t\t\t\t\t{\n\t\t\t\t\t\tst+=1<<j;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tcnt+=P.sum(st+1)-P.sum(st);\n\t\t\tP.add(S[i]+1,1);\n\t\t}\n\t\tif(cnt<=K)L=mid;\n\t\telse R=mid;\n\t}\n\tcout<<R<<endl;\n}", "accuracy": 1, "time_ms": 470, "memory_kb": 7972, "score_of_the_acc": -0.3565, "final_rank": 8 }, { "submission_id": "aoj_0402_4976552", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long;\nconstexpr lint mod = 998244353;\n#define all(x) (x).begin(), (x).end()\n#define bitcount(n) __builtin_popcountl((lint)(n))\n#define fcout cout << fixed << setprecision(15)\n#define highest(x) (63 - __builtin_clzl(x))\n#define rep(i, n) for(int i = 0; i < int(n); i++)\n#define rep2(i, l, r) for(int i = int(l); i < int(r); i++)\n#define repr(i, n) for(int i = int(n) - 1; i >= 0; i--)\n#define repr2(i, l, r) for(int i = int(r) - 1; i >= int(l); i--)\n\nvector<int> calc_sum((1 << 20) + 1, 0);\n\nint range_sum(int l, int r){\n return calc_sum[r] - calc_sum[l];\n}\n\nint main(){\n lint N, K;\n cin >> N >> K;\n K = N * (N + 1) / 2 + 1 - K;\n vector<int> a(N);\n rep(i, N) cin >> a[i];\n \n int a_xor[N + 1];\n a_xor[0] = 0;\n rep(i, N){\n a_xor[i + 1] = a_xor[i] ^ a[i];\n }\n \n rep(i, N + 1){\n calc_sum[a_xor[i] + 1]++;\n }\n rep(i, 1 << 20){\n calc_sum[i + 1] += calc_sum[i];\n }\n \n int low = 0; // high = low + (2 << i), [low, high)\n lint lower_than_low = 0; // 以降ltlと略す\n repr(i, 20){\n lint ltl_added = 0;\n rep(j, N + 1){\n int leg_cut = a_xor[j] & ~((1 << i) - 1);\n ltl_added += range_sum((leg_cut ^ low), (leg_cut ^ low) + (1 << i)) - (low == 0);\n }\n ltl_added /= 2;\n if(lower_than_low + ltl_added < K){\n lower_than_low += ltl_added;\n low += (1 << i);\n }\n }\n \n // 最終的に出てくるlowは、[0, low)を満たすペアがK個未満になる最大の数\n cout << low << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 7600, "score_of_the_acc": -0.0165, "final_rank": 1 } ]
aoj_0409_cpp
Floor The floor of Dr. Hideyo's house is covered with square tiles. Dr. Hideyo, who has an interest in art, decides to paint the tiles with red, yellow, and blue paint. To begin, he selects one appropriate tile in the room and paint it with the following method. Change the color of the tile to be painted in the following order: red (number 1 in the figure), yellow (number 2 in the figure), blue (number 3 in the figure), and after blue, start with red again. Add a square next to the already colored area and color it. The combined area should be a rectangle. Add squares in the following order: east, north, west, south, and after south, start from the east again (in the figure, north is up and east is to the right). What color are the tiles in the east-west direction $x$ and in the north-south direction $y$ moved from the first tile painted red? Let the east direction be the positive direction of $x$ and the north direction be the positive direction of $y$. Write a program that takes $x$ and $y$ as input and outputs the color of the tile. Input The input is given in the following form. $x$ $y$ $x$ and $y$ ($-10^6 \leq x,y \leq 10^6$) are given in a line. Output Output 1 when the tile color is red, 2 when the tile color is yellow, and 3 when the tile color is blue on one line. Sample Input and Output Sample Input 1 0 0 Sample Output 1 1 Sample Input 2 -4 5 Sample Output 2 2 Sample Input 3 8 -14 Sample Output 3 3
[ { "submission_id": "aoj_0409_5708849", "code_snippet": "#include <iostream>\nusing namespace std;\n\nint fib(int n)\n{\n if(n==0 || n==1) \n return 1;\n return fib(n-1)+fib(n-2);\n}\n\nint main()\n{\n int x, y;\n cin >> x >> y;\n int x_min = 0;\n int x_max = 1;\n int y_min = 0;\n int y_max = 1;\n int c = 0;\n while(true){ \n if(x_min<=x && x<x_max && y_min<=y && y<y_max){ \n cout << c%3+1 << endl;\n return 0;\n }\n // 東 \n c++; \n x_min = x_max;\n x_max = x_min+fib(c); \n y_min = y_min; \n y_max = y_min+fib(c);\n \n if(x_min<=x && x<x_max && y_min<=y && y<y_max){ \n cout << c%3+1 << endl;\n return 0; \n }\n // 北 \n c++; \n x_max = x_max; \n x_min = x_max-fib(c); \n y_min = y_max; \n y_max = y_min+fib(c); \n \n if(x_min<=x && x<x_max && y_min<=y && y<y_max){ \n cout << c%3+1 << endl;\n return 0; \n }\n // 西 \n c++; \n x_max = x_min; \n x_min = x_max-fib(c);\n y_max = y_max; \n y_min = y_max-fib(c);\n \n if(x_min<=x && x<x_max && y_min<=y && y<y_max){ \n cout << c%3+1 << endl;\n return 0; \n }\n // 南 \n c++; \n x_min = x_min; \n x_max = x_min+fib(c); \n y_max = y_min; \n y_min = y_max-fib(c);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3104, "score_of_the_acc": -1.0003, "final_rank": 4 }, { "submission_id": "aoj_0409_5682108", "code_snippet": "// 2020/07/20 Tazoe\n#include <iostream>\nusing namespace std;\n// フィボナッチ数\nint fib(int n){\n if(n==0 || n==1) \n return 1;\n return fib(n-1)+fib(n-2);\n}\nint main(){\n int x, y;\n cin >> x >> y;\n int x_min = 0;\n int x_max = 1;\n int y_min = 0;\n int y_max = 1;\n int c = 0;\n while(true){ \n if(x_min<=x && x<x_max && y_min<=y && y<y_max){ \n cout << c%3+1 << endl;\n return 0; \n }\n // 東 \n c++; \n x_min = x_max; \n x_max = x_min+fib(c); \n y_min = y_min; \n y_max = y_min+fib(c);\n if(x_min<=x && x<x_max && y_min<=y && y<y_max){ \n cout << c%3+1 << endl;\n return 0; \n }\n // 北 \n c++; \n x_max = x_max; \n x_min = x_max-fib(c); \n y_min = y_max; \n y_max = y_min+fib(c);\n if(x_min<=x && x<x_max && y_min<=y && y<y_max){ \n cout << c%3+1 << endl;\n return 0; \n }\n // 西 \n c++; \n x_max = x_min; \n x_min = x_max-fib(c);\n y_max = y_max; \n y_min = y_max-fib(c);\n if(x_min<=x && x<x_max && y_min<=y && y<y_max){ \n cout << c%3+1 << endl;\n return 0;\n }\n // 南 \n c++; \n x_min = x_min; \n x_max = x_min+fib(c); \n y_max = y_min; \n y_min = y_max-fib(c);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3100, "score_of_the_acc": -1.0002, "final_rank": 3 }, { "submission_id": "aoj_0409_4709024", "code_snippet": "#include<iostream>\n#include<algorithm>\nusing namespace std;\ninline int fib(int n){\n if(n==0||n==1){\n return 1;\n }\n return fib(n-1)+fib(n-2);\n}\nint main(){\n int x,y;\n cin >> x >> y;\n\n int xmin=0;\n int xmax=1;\n int ymin=0;\n int ymax=1;\n int c=0;\n\n while(1){\n if(xmin<=x&&x<xmax&&ymin<=y&&y<ymax){\n cout << c%3+1 <<endl;\n return 0;\n }\n \n c++;\n xmin=xmax;\n xmax=xmin+fib(c);\n ymin=ymin;\n ymax=ymin+fib(c);\n if(xmin<=x&&x<xmax&&ymin<=y&&y<ymax){\n cout << c%3+1 <<endl;\n return 0;\n }\n\n c++;\n xmax=xmax;\n xmin=xmax-fib(c);\n ymin=ymax;\n ymax=ymin+fib(c);\n if(xmin<=x&&x<xmax&&ymin<=y&&y<ymax){\n cout << c%3+1 <<endl;\n return 0;\n }\n\n c++;\n xmax=xmin;\n xmin=xmax-fib(c);\n ymax=ymax;\n ymin=ymax-fib(c);\n if(xmin<=x&&x<xmax&&ymin<=y&&y<ymax){\n cout << c%3+1 <<endl;\n return 0;\n }\n\n c++;\n xmin=xmin;\n xmax=xmin+fib(c);\n ymax=ymin;\n ymin=ymax-fib(c);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3132, "score_of_the_acc": -0.6677, "final_rank": 1 }, { "submission_id": "aoj_0409_4709013", "code_snippet": "#include <iostream>\nusing namespace std;\n// フィボナッチ数\nint fib(int n)\n{\nif(n==0 || n==1) return 1;\nreturn fib(n-1)+fib(n-2);\n}\nint main()\n{\nint x, y;\ncin >> x >> y;\nint x_min = 0;\nint x_max = 1;\nint y_min = 0;\nint y_max = 1;\nint c = 0;\nwhile(true){ if(x_min<=x && x<x_max && y_min<=y && y<y_max){ cout << c%3+1 << endl;\nreturn 0; }\n // 東 \n c++; x_min = x_max; x_max = x_min+fib(c); y_min = y_min; y_max = y_min+fib(c);\n if(x_min<=x && x<x_max && y_min<=y && y<y_max){ cout << c%3+1 << endl;\nreturn 0; }\n // 北 \n c++; x_max = x_max; x_min = x_max-fib(c); y_min = y_max; y_max = y_min+fib(c);\n if(x_min<=x && x<x_max && y_min<=y && y<y_max){ cout << c%3+1 << endl;\nreturn 0; }\n // 西 \n c++; x_max = x_min; x_min = x_max-fib(c); y_max = y_max; y_min = y_max-fib(c);\n if(x_min<=x && x<x_max && y_min<=y && y<y_max){ cout << c%3+1 << endl;\nreturn 0; }\n // 南 \n c++; x_min = x_min; x_max = x_min+fib(c); y_max = y_min; y_min = y_max-fib(c);\n}\nreturn 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3124, "score_of_the_acc": -1.0008, "final_rank": 6 }, { "submission_id": "aoj_0409_4702949", "code_snippet": "#include <iostream>\nusing namespace std;\n// フィボナッチ数\nint fib(int n)\n{\nif(n==0 || n==1) return 1;\nreturn fib(n-1)+fib(n-2);\n}\nint main()\n{\nint x, y;\ncin >> x >> y;\nint x_min = 0;\nint x_max = 1;\nint y_min = 0;\nint y_max = 1;\nint c = 0;\nwhile(true){ if(x_min<=x && x<x_max && y_min<=y && y<y_max){ cout << c%3+1 << endl;\nreturn 0; }\n c++; x_min = x_max; x_max = x_min+fib(c); y_min = y_min; y_max = y_min+fib(c);\n if(x_min<=x && x<x_max && y_min<=y && y<y_max){ cout << c%3+1 << endl;\nreturn 0; }\n c++; x_max = x_max; x_min = x_max-fib(c); y_min = y_max; y_max = y_min+fib(c);\n if(x_min<=x && x<x_max && y_min<=y && y<y_max){ cout << c%3+1 << endl;\nreturn 0; }\n c++; x_max = x_min; x_min = x_max-fib(c); y_max = y_max; y_min = y_max-fib(c);\n if(x_min<=x && x<x_max && y_min<=y && y<y_max){ cout << c%3+1 << endl;\nreturn 0; }\n c++; x_min = x_min; x_max = x_min+fib(c); y_max = y_min; y_min = y_max-fib(c);\n}\nreturn 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3092, "score_of_the_acc": -1, "final_rank": 2 }, { "submission_id": "aoj_0409_4688490", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint fib(int n){\n if(n==0 || n==1){\n return 1; \n } \n return fib(n-1)+fib(n-2);\n}\nint main(){\n int x, y;\n cin >> x >> y;\n int x_min = 0;\n int x_max = 1;\n int y_min = 0;\n int y_max = 1;\n int c = 0;\n while(true){ \n if(x_min<=x && x<x_max && y_min<=y && y<y_max){ \n cout << c%3+1 << endl;\n return 0; \n }\n // 東 \n c++; \n x_min = x_max; \n x_max = x_min+fib(c); \n y_min = y_min; \n y_max = y_min+fib(c);\n if(x_min<=x && x<x_max && y_min<=y && y<y_max){ \n cout << c%3+1 << endl;\n return 0; \n }\n \n // 北 \n c++; \n x_max = x_max; \n x_min = x_max-fib(c); \n y_min = y_max; \n y_max = y_min+fib(c);\n if(x_min<=x && x<x_max && y_min<=y && y<y_max){ \n cout << c%3+1 << endl;\n return 0; \n }\n \n // 西 \n c++; \n x_max = x_min; \n x_min = x_max-fib(c);\n y_max = y_max; \n y_min = y_max-fib(c);\n if(x_min<=x && x<x_max && y_min<=y && y<y_max){ \n cout << c%3+1 << endl;\n return 0; \n }\n \n // 南 \n c++; \n x_min = x_min; \n x_max = x_min+fib(c); \n y_max = y_min; \n y_min = y_max-fib(c);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3124, "score_of_the_acc": -1.0008, "final_rank": 6 }, { "submission_id": "aoj_0409_4685879", "code_snippet": "// 2020/07/20 Tazoe\n\n#include <iostream>\nusing namespace std;\n\n// フィボナッチ数\nint fib(int n)\n{\n\tif(n==0 || n==1)\n\t\treturn 1;\n\n\treturn fib(n-1)+fib(n-2);\n}\n\n\nint main()\n{\n\tint x, y;\n\tcin >> x >> y;\n\n\tint x_min = 0;\n\tint x_max = 1;\n\tint y_min = 0;\n\tint y_max = 1;\n\tint c = 0;\n\n\twhile(true){\n\t\tif(x_min<=x && x<x_max && y_min<=y && y<y_max){\n\t\t\tcout << c%3+1 << endl;\n\t\t\treturn 0;\n\t\t}\n\n\t\t// 東\n\t\tc++;\n\t\tx_min = x_max;\n\t\tx_max = x_min+fib(c);\n\t\ty_min = y_min;\n\t\ty_max = y_min+fib(c);\n\n\t\tif(x_min<=x && x<x_max && y_min<=y && y<y_max){\n\t\t\tcout << c%3+1 << endl;\n\t\t\treturn 0;\n\t\t}\n\n\t\t// 北\n\t\tc++;\n\t\tx_max = x_max;\n\t\tx_min = x_max-fib(c);\n\t\ty_min = y_max;\n\t\ty_max = y_min+fib(c);\n\n\t\tif(x_min<=x && x<x_max && y_min<=y && y<y_max){\n\t\t\tcout << c%3+1 << endl;\n\t\t\treturn 0;\n\t\t}\n\n\t\t// 西\n\t\tc++;\n\t\tx_max = x_min;\n\t\tx_min = x_max-fib(c);\n\t\ty_max = y_max;\n\t\ty_min = y_max-fib(c);\n\n\t\tif(x_min<=x && x<x_max && y_min<=y && y<y_max){\n\t\t\tcout << c%3+1 << endl;\n\t\t\treturn 0;\n\t\t}\n\n\t\t// 南\n\t\tc++;\n\t\tx_min = x_min;\n\t\tx_max = x_min+fib(c);\n\t\ty_max = y_min;\n\t\ty_min = y_max-fib(c);\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3124, "score_of_the_acc": -1.0008, "final_rank": 6 }, { "submission_id": "aoj_0409_4685571", "code_snippet": "// 2020/07/20 Tazoe\n\n#include <iostream>\nusing namespace std;\n\nint fib(int n)\n{\n\tif(n==0 || n==1)\n\t\treturn 1;\n\n\treturn fib(n-1)+fib(n-2);\n}\n\n\nint main()\n{\n\tint x, y;\n\tcin >> x >> y;\n\n\tint x_min = 0;\n\tint x_max = 1;\n\tint y_min = 0;\n\tint y_max = 1;\n\tint c = 0;\n\n\twhile(true){\n\t\tif(x_min<=x && x<x_max && y_min<=y && y<y_max){\n\t\t\tcout << c%3+1 << endl;\n\t\t\treturn 0;\n\t\t}\n\n\t\t// 東\n\t\tc++;\n\t\tx_min = x_max;\n\t\tx_max = x_min+fib(c);\n\t\ty_min = y_min;\n\t\ty_max = y_min+fib(c);\n\n\t\tif(x_min<=x && x<x_max && y_min<=y && y<y_max){\n\t\t\tcout << c%3+1 << endl;\n\t\t\treturn 0;\n\t\t}\n\n\t\t// 北\n\t\tc++;\n\t\tx_max = x_max;\n\t\tx_min = x_max-fib(c);\n\t\ty_min = y_max;\n\t\ty_max = y_min+fib(c);\n\n\t\tif(x_min<=x && x<x_max && y_min<=y && y<y_max){\n\t\t\tcout << c%3+1 << endl;\n\t\t\treturn 0;\n\t\t}\n\n\t\t// 西\n\t\tc++;\n\t\tx_max = x_min;\n\t\tx_min = x_max-fib(c);\n\t\ty_max = y_max;\n\t\ty_min = y_max-fib(c);\n\n\t\tif(x_min<=x && x<x_max && y_min<=y && y<y_max){\n\t\t\tcout << c%3+1 << endl;\n\t\t\treturn 0;\n\t\t}\n\n\t\t// 南\n\t\tc++;\n\t\tx_min = x_min;\n\t\tx_max = x_min+fib(c);\n\t\ty_max = y_min;\n\t\ty_min = y_max-fib(c);\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3120, "score_of_the_acc": -1.0007, "final_rank": 5 }, { "submission_id": "aoj_0409_3937980", "code_snippet": "#include <set>\n#include <map>\n#include <list>\n#include <queue>\n#include <stack>\n#include <cmath>\n#include <ctime>\n#include <cstdio>\n#include <vector>\n#include <string>\n#include <bitset>\n#include <cctype>\n#include <cstdlib>\n#include <cstring>\n#include <utility>\n#include <numeric>\n#include <complex>\n#include <sstream>\n#include <fstream>\n#include <iomanip>\n#include <cassert>\n#include <iostream>\n#include <iterator>\n#include <algorithm>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vint;\ntypedef pair<int, int> pint;\ntypedef vector<long long> vlong;\n#define vpush(a,x) a.push_back(x);\n#define rep(i, n) REP(i, 0, n)\n#define all(v) v.begin(), v.end()\n#define REP(i, x, n) for(int i = x; i < n; i++)\n#define INF 2e9\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int flag=1,count=0,x,y,minx=0,miny=0,maxx=0,maxy=0,flag2=0,falg3=0;\n vint fi(10000000,0);\n cin>>x>>y;\n if(x==0 && y==0){\n cout<<1<<'\\n';\n return(0);\n }\n while(true){\n if(count%4==0){\n if(count==0){\n\tmaxx=1;\n\tfi[0]=1;\n }\n else{\n\tfi[count]=fi[count-1]+fi[count-2];\n\tmaxy=fi[count];\n }\n }\n if(count%4==1){\n if(count==1){\n\tmaxy=1;\n\tfi[1]=1;\n }\n else{\n\tfi[count]=fi[count-1]+fi[count-2];\n\tmaxx=fi[count];\n }\n }\n if(count%4==2){\n fi[count]=fi[count-1]+fi[count-2];\n minx=fi[count];\n }\n if(count%4==3){\n fi[count]=fi[count-1]+fi[count-2];\n miny=fi[count];\n }\n count++;\n if(x>0 && y>0){\n if(maxy>=y && maxx>=x){\n\tcout<<count%3+1<<'\\n';\n\tbreak;\n }\n }\n else if(y>0 && x<0){\n if(maxy>=y && minx+x>=0){\n\tcout<<count%3+1<<'\\n';\n\tbreak;\n }\n }\n else if(y<0 && x<0){\n if(miny+y>=0 && minx+x>=0){\n\tcout<<count%3+1<<'\\n';\n\tbreak;\n }\n }\n else if(y<0 && x>0){\n if(miny+y>=0 && maxx>=x){\n\tcout<<count%3+1<<'\\n';\n\tbreak;\n }\n } \n }\n return(0);\n}", "accuracy": 0.1, "time_ms": 10, "memory_kb": 41772, "score_of_the_acc": -1, "final_rank": 9 } ]
aoj_0403_cpp
Road Construction The Zuia Kingdom has finally emerged through annexation of $N$ cities, which are identified by index from $1$ to $N$. You are appointed the Minister of Transport of the newly born kingdom to construct the inter-city road network. To simplify the conceptual design planning, you opted to consider each city as a point on the map, so that the $i$-th city can be represented by an coordinate ($x_i, y_i$). The cost of road construction connecting $u$-th and $v$-th cities is equal to the distance $|x_u - x_v|$ or $|y_u - y_v|$, whichever the larger. The notation $|A|$ represents the absolute value of $A$. The object here is to explore the minimum cost required to construct the road network in such a way that people can move between different cities along one or more roads. Make a program to calculate the minimum of total road construction cost from the number of cities and their coordinates. Input The input is given in the following format. $N$ $x_1$ $y_1$ $x_2$ $y_2$ ... $x_N$ $y_N$ The first line provides the number of cities $N$ ($2 \leq N \leq 10^5$). Each of the subsequent $N$ lines provides the coordinate of the $i$-th city $x_i, y_i$ ($0 \leq x_i, y_i \leq 10^9$) as integers. Note that none of these coordinates coincides if: $i \ne j$, then $x_i \ne x_j$ or $y_i \ne y_j$. Output Output the minimum road construction cost. Sample Input 1 3 1 2 3 4 10 1 Sample Output 1 9 The road connecting city 1 and 2 can be constructed at the cost of 2, and that connecting city 2 and 3 at the cost of 7. Therefore, the total cost becomes 9, which is the minimum. Sample Input 2 3 1 2 3 4 3 2 Sample Output 2 4 Sample Input 3 5 7 41 10 0 99 27 71 87 14 25 Sample Output 3 163
[ { "submission_id": "aoj_0403_10435662", "code_snippet": "// AOJ #0403 Road Construction\n// 2025.4.30\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvector<int> p, rk;\nint findf(int x){ return p[x]==x ? x : p[x]=findf(p[x]); }\nbool unite(int a, int b){\n a = findf(a); b = findf(b);\n if(a==b) return false;\n if(rk[a]<rk[b]) swap(a,b);\n p[b] = a;\n if(rk[a]==rk[b]) rk[a]++;\n return true;\n}\n\nstruct P { ll x, y; };\n\nint main(){\n int N = Cin();\n vector<P> ps(N);\n for(int i = 0; i < N; i++){\n ll x = Cin(), y = Cin();\n ps[i] = { x+y, x-y };\n }\n\n vector<int> id(N);\n iota(id.begin(), id.end(), 0);\n vector<tuple<ll,int,int>> es;\n es.reserve(4LL * N);\n\n for(int rot = 0; rot < 4; rot++){\n sort(id.begin(), id.end(), [&](int i, int j){\n return ps[i].x + ps[i].y < ps[j].x + ps[j].y;\n });\n map<ll,int, greater<ll>> active;\n for(int i : id){\n ll xi = ps[i].x, yi = ps[i].y;\n for(auto it = active.lower_bound(xi); it != active.end(); ){\n int j = it->second;\n ll xj = ps[j].x, yj = ps[j].y;\n if(xi - yi > xj - yj) break;\n es.emplace_back((xi - xj) + (yi - yj), i, j);\n it = active.erase(it);\n }\n active[xi] = i;\n }\n for(auto &pp : ps){\n if (rot & 1) pp.x = -pp.x;\n else swap(pp.x, pp.y);\n }\n }\n\n p.resize(N); rk.assign(N,0);\n iota(p.begin(), p.end(), 0);\n sort(es.begin(), es.end(), [](auto &a, auto &b){\n return get<0>(a) < get<0>(b);\n });\n ll ans = 0;\n for(auto &e : es){\n ll w; int u, v;\n tie(w, u, v) = e;\n if(unite(u, v)) ans += w;\n }\n cout << (ans / 2) << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 15996, "score_of_the_acc": -0.1882, "final_rank": 1 }, { "submission_id": "aoj_0403_7074228", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\nstruct UnionFind {\n\tvector<int> par;\n\tUnionFind(const int n) : par(n, -1) {}\n\tint find(const int u) {\n\t\treturn par[u] < 0 ? u : par[u] = find(par[u]);\n\t}\n\tbool merge(int x, int y) {\n\t\tx = find(x);\n\t\ty = find(y);\n\t\tif (x == y) return false;\n\t\tif (par[x] > par[y]) swap(x, y);\n\t\tpar[x] += par[y];\n\t\tpar[y] = x;\n\t\treturn true;\n\t}\n};\n\nint main() {\n\tios_base::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\t\n\tint N;\n\tcin >> N;\n\tvector<int> X(N), Y(N);\n\tfor (int i = 0; i < N; ++i) {\n\t\tcin >> X[i] >> Y[i];\n\t}\n\n\tvector<tuple<int, int, int>> edges;\n\tconst auto process = [&] {\n\t\tvector<int> ord(N);\n\t\tiota(begin(ord), end(ord), 0);\n\t\tsort(begin(ord), end(ord), [&](const int i, const int j) {\n\t\t\treturn X[i] < X[j];\n\t\t});\n\n\t\tstd::map<int, int> map;\n\t\tfor (const int i : ord) {\n\t\t\tauto itr = map.upper_bound(Y[i]);\n\t\t\twhile (itr != begin(map)) {\n\t\t\t\t--itr;\n\t\t\t\tconst int j = itr->second;\n\t\t\t\tif (Y[j] - X[j] > Y[i] - X[i]) {\n\t\t\t\t\titr = map.erase(itr);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tedges.emplace_back(Y[i] - Y[j], i, j);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tmap[Y[i]] = i;\n\t\t}\n\t};\n\n\tfor (int a = 0; a < 2; ++a) {\n\t\tfor (int b = 0; b < 2; ++b) {\n\t\t\tfor (int c = 0; c < 2; ++c) {\n\t\t\t\tprocess();\n\t\t\t\tswap(X, Y);\n\t\t\t}\n\t\t\tfor (int i = 0; i < N; ++i) X[i] = 1000000000 -X[i];\n\t\t}\n\t\tfor (int i = 0; i < N; ++i) Y[i] = 1000000000 -Y[i];\n\t}\n\n\tsort(begin(edges), end(edges));\n\tUnionFind uf(N);\n\tll ans = 0;\n\tfor (const auto& [c, i, j] : edges) {\n\t\tif (uf.merge(i, j)) {\n\t\t\tans += c;\n\t\t}\n\t}\n\tcout << ans << '\\n';\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 240, "memory_kb": 17816, "score_of_the_acc": -0.356, "final_rank": 5 }, { "submission_id": "aoj_0403_6707424", "code_snippet": "#include <bits/stdc++.h>\n#pragma GCC optimize(\"O2\")\nusing namespace std;\n\ntypedef pair<int, int> pii;\ntypedef long long ll;\ntypedef pair<ll, ll> pll;\n#define X first\n#define Y second\n#define io ios_base::sync_with_stdio(0); cin.tie(0);\n#define setpr setprecision\n#define eb emplace_back\n#define lowb lower_bound\n#define uppb upper_bound\n#define lowbit(x) ((x) & -(x))\n#define mk make_pair\nconst ll M = 1e9 + 7;\nconst ll INF = 1e14;\n\npll pt[100005];\nvector <int> v[100005];\nll cost[1200005];\npll edge[1200005];\nint add[100005];\n\nll dis(pll a, pll b){\n\treturn max(abs(a.X - b.X), abs(a.Y - b.Y));\n}\n\nbool cmp(pll a, pll b){\n\treturn a.Y == b.Y ? a.X < b.X : a.Y < b.Y;\n}\n\nll solve(int n){\n\tint ct = 0; ll ans = 0;\n\tpriority_queue <pll, vector<pll>, greater<pll> > pq;\n\twhile(pq.size()) pq.pop();\n\tpq.emplace(0, 1);\n\n\twhile(pq.size()){\n\t\tpll p = pq.top(); pq.pop();\n\t\tif(add[p.Y]) continue;\n\t\tct++; add[p.Y] = 1; ans += p.X;\n\t\tif(ct == n) break;\n\n\t\tfor(auto i : v[p.Y]){\n\t\t\tint ver = edge[i].X + edge[i].Y - p.Y;\n\t\t\tif(add[ver]) continue;\n\t\t\tpq.emplace(cost[i], ver);\n\t\t}\n\t}\n\treturn ans;\n}\n\nint main(){\n\tio\n\tint n; cin >> n;\n\tfor(int i = 0; i < n; i++)\n\t\tcin >> pt[i].X >> pt[i].Y;\n\tsort(pt, pt + n);\n\tll maxdis = -1, ct = 0;\n\tfor(int i = 1; i < n; i++)\n\t\tmaxdis = max(maxdis, dis(pt[i - 1], pt[i]));\n\tfor(int i = 0; i < n; i++){\n\t\tfor(int j = i + 1; j < n; j++){\n\t\t\tif(pt[j].X - pt[i].X > maxdis) break;\n\t\t\tll tmp = dis(pt[j], pt[i]);\n\t\t\tif(tmp <= maxdis){\n\t\t\t\tv[i + 1].eb(ct); v[j + 1].eb(ct);\n\t\t\t\tedge[ct] = mk(i + 1, j + 1); cost[ct++] = tmp;\n\t\t\t}\n\t\t}\n\t}\n\tll ans = solve(n);\n\tcout << ans << \"\\n\";\n\treturn 0;\n}", "accuracy": 0.140625, "time_ms": 80, "memory_kb": 49176, "score_of_the_acc": -0.422, "final_rank": 19 }, { "submission_id": "aoj_0403_6697390", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\ntemplate<typename T>\nvector<pair<int, int>> manhattanMST(vector<T> xs, vector<T> ys) {\n using P = pair<int, int>;\n vector<P> es;\n vector<int> ord(xs.size());\n for (int s = 0; s < 4; s++) {\n iota(ord.begin(), ord.end(), 0);\n auto cmp = [&](int i, int j) -> bool {\n if (xs[i]+ys[i] != xs[j]+ys[j]) return xs[i]+ys[i] < xs[j]+ys[j];\n return (s>>1) ^ (i > j);\n };\n sort(ord.begin(), ord.end(), cmp);\n map<pair<T, int>, int> idx;\n for (auto &&i : ord) {\n pair<T, int> p = {-ys[i], (s == 3)?i:-i};\n for (auto it = idx.lower_bound(p); it != idx.end(); it = idx.erase(it)) {\n if (xs[i] - xs[it->second] < ys[i] - ys[it->second]) break;\n es.emplace_back(i, it->second);\n }\n idx[p] = i;\n }\n swap(xs, ys);\n if(s&1) for(auto &&i : xs) i = -i;\n }\n return es;\n}\n\nclass UnionFind {\n int n;\n vector<int> uni;\n int forest_size;\npublic:\n explicit UnionFind(int n) : n(n), uni(static_cast<u32>(n), -1), forest_size(n) {};\n\n int root(int a){\n if (uni[a] < 0) return a;\n else return (uni[a] = root(uni[a]));\n }\n\n bool unite(int a, int b) {\n a = root(a);\n b = root(b);\n if(a == b) return false;\n if(uni[a] > uni[b]) swap(a, b);\n uni[a] += uni[b];\n uni[b] = a;\n forest_size--;\n return true;\n }\n int size(){ return forest_size; }\n int size(int i){ return -uni[root(i)]; }\n bool same(int a, int b) { return root(a) == root(b); }\n};\n\nint main() {\n int n;\n cin >> n;\n vector<int> xs(n), ys(n);\n for (int i = 0; i < n; ++i) {\n int x, y;\n cin >> x >> y;\n xs[i] = x+y, ys[i] = x-y;\n }\n auto res = manhattanMST(xs, ys);\n vector<pair<int, pair<int, int>>> r(res.size());\n for (int i = 0; i < res.size(); ++i) {\n auto &&x = res[i];\n r[i] = {abs(xs[x.first]-xs[x.second])+abs(ys[x.first]-ys[x.second]), {x.first, x.second}};\n }\n sort(r.begin(),r.end());\n UnionFind uf(n);\n ll ans = 0;\n for (auto &&i : r) {\n pair<int, int> p; tie(ignore, p) = i;\n if(uf.unite(p.first, p.second)) ans += i.first;\n }\n cout << ans/2 << \"\\n\";\n return 0;\n}", "accuracy": 1, "time_ms": 160, "memory_kb": 12780, "score_of_the_acc": -0.2293, "final_rank": 3 }, { "submission_id": "aoj_0403_6696747", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nusing i32 = int32_t;\nusing u32 = uint32_t;\nusing i64 = int64_t;\nusing u64 = uint64_t;\n#define rep(i,n) for(int i=0; i<(n); i++)\n\n\n\n#include <vector>\n#include <algorithm>\n#include <map>\n\n\npair<i64, vector<pair<int, int>>> manhattan_mst(const vector<pair<i64, i64>>& pos) {\n auto dist = [&pos](int a, int b)->i64 {\n //return abs(pos[a].first - pos[b].first) + abs(pos[a].second - pos[b].second);\n return max(abs(pos[a].first - pos[b].first), abs(pos[a].second - pos[b].second));\n };\n int n = pos.size();\n using POS2 = pair<i64, i64>;\n vector<POS2> P(n);\n rep(i, n) P[i] = make_pair(pos[i].first, pos[i].second);\n vector<int> I(n);\n rep(i, n) I[i] = i;\n vector<pair<i64, pair<int, int>>> res;\n rep(s, 2) {\n rep(t, 2) {\n sort(I.begin(), I.end(), [&P](int l, int r) { return P[l].first < P[r].first; });\n map<i64, int> G;\n for (auto i : I) {\n for (auto ig = G.lower_bound(-P[i].first - P[i].second);\n ig != G.end(); ig = G.erase(ig))\n {\n int j = ig->second;\n if (P[i].second > P[j].second) break;\n res.emplace_back(dist(i, j), make_pair(i, j));\n }\n G[-P[i].first - P[i].second] = i;\n }\n rep(i, n) swap(P[i].first, P[i].second);\n }\n rep(i, n) P[i].first = -P[i].first;\n }\n struct DSU {\n vector<int> A;\n DSU(int n) { A.assign(n, -1); }\n int leader(int a) {\n if (A[a] < 0) return a;\n return A[a] = leader(A[a]);\n }\n void merge(int a, int b) {\n a = leader(a);\n b = leader(b);\n if (a == b) return;\n A[a] = b;\n }\n } dsu(n);\n sort(res.begin(), res.end());\n i64 ans_val = 0;\n vector<pair<int, int>> ans;\n for (auto e : res) {\n if (dsu.leader(e.second.first) == dsu.leader(e.second.second)) continue;\n ans_val += e.first;\n ans.push_back(e.second);\n dsu.merge(e.second.first, e.second.second);\n }\n return make_pair(ans_val, move(ans));\n}\n\n\nint main(){\n int N; cin >> N;\n vector<pair<i64,i64>> P(N);\n for(auto& a : P) cin >> a.first >> a.second;\n cout << manhattan_mst(P).first << endl;\n return 0;\n}\n\n\n\n\nstruct ios_do_not_sync {\n ios_do_not_sync() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n }\n} ios_do_not_sync_instance;", "accuracy": 1, "time_ms": 130, "memory_kb": 19156, "score_of_the_acc": -0.2455, "final_rank": 4 }, { "submission_id": "aoj_0403_6688452", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Edge\n{\n int w = INT_MAX, to = -1;\n bool operator<(Edge const &other) const\n {\n return make_pair(w, to) < make_pair(other.w, other.to);\n }\n};\n\nint n, coords[100000][2];\nvector<vector<Edge>> adj;\n\nbool sortX(int a, int b) { return coords[a][0] < coords[b][0]; }\nbool sortY(int a, int b) { return coords[a][1] < coords[b][1]; }\n\nvoid prim()\n{\n long total_weight = 0;\n vector<Edge> min_e(n);\n min_e[0].w = 0;\n set<Edge> q;\n q.insert({0, 0});\n vector<bool> selected(n, false);\n for (int i = 0; i < n; ++i)\n {\n if (q.empty())\n {\n cout << \"No MST!\" << endl;\n exit(0);\n }\n\n int v = q.begin()->to;\n selected[v] = true;\n total_weight += q.begin()->w;\n q.erase(q.begin());\n\n // if (min_e[v].to != -1)\n // cout << v << \" \" << min_e[v].to << endl;\n\n for (Edge e : adj[v])\n {\n if (!selected[e.to] && e.w < min_e[e.to].w)\n {\n q.erase({min_e[e.to].w, e.to});\n min_e[e.to] = {e.w, v};\n q.insert({e.w, e.to});\n }\n }\n }\n\n cout << total_weight << endl;\n}\n\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n cin >> n;\n vector<int> x(n), y(n);\n adj.resize(n);\n for (int i = 0; i < n; i++)\n {\n cin >> coords[i][0] >> coords[i][1];\n x[i] = i;\n y[i] = i;\n }\n\n sort(x.begin(), x.end(), sortX);\n for (int i = 0; i < n; i++)\n {\n if (i == 0)\n {\n for (int j = 1; j < 1000 && i + j < n; j++)\n adj[x[i]].push_back({max(abs(coords[x[i]][0] - coords[x[i + j]][0]), abs(coords[x[i]][1] - coords[x[i + j]][1])), x[i + j]});\n }\n else if (i == n - 1)\n {\n for (int j = 1; j < 1000 && i - j >= 0; j++)\n adj[x[i]].push_back({max(abs(coords[x[i]][0] - coords[x[i - j]][0]), abs(coords[x[i]][1] - coords[x[i - j]][1])), x[i - j]});\n }\n else\n {\n for (int j = 1; j < 500 && i + j < n; j++)\n adj[x[i]].push_back({max(abs(coords[x[i]][0] - coords[x[i + j]][0]), abs(coords[x[i]][1] - coords[x[i + j]][1])), x[i + j]});\n for (int j = 1; j < 500 && i - j >= 0; j++)\n adj[x[i]].push_back({max(abs(coords[x[i]][0] - coords[x[i - j]][0]), abs(coords[x[i]][1] - coords[x[i - j]][1])), x[i - j]});\n }\n }\n // for (int i = 0; i < n; i++)\n // {\n // cout << i << \": \";\n // for (Edge x : adj[i])\n // {\n // cout << x.to << \" \";\n // }\n // cout << endl;\n // }\n\n sort(y.begin(), y.end(), sortY);\n for (int i = 0; i < n; i++)\n {\n if (i == 0)\n {\n for (int j = 1; j < 1000 && i + j < n; j++)\n adj[y[i]].push_back({max(abs(coords[y[i]][0] - coords[y[i + j]][0]), abs(coords[y[i]][1] - coords[y[i + j]][1])), y[i + j]});\n }\n else if (i == n - 1)\n {\n for (int j = 1; j < 1000 && i - j >= 0; j++)\n adj[y[i]].push_back({max(abs(coords[y[i]][0] - coords[y[i - j]][0]), abs(coords[y[i]][1] - coords[y[i - j]][1])), y[i - j]});\n }\n else\n {\n for (int j = 1; j < 500 && i + j < n; j++)\n adj[y[i]].push_back({max(abs(coords[y[i]][0] - coords[y[i + j]][0]), abs(coords[y[i]][1] - coords[y[i + j]][1])), y[i + j]});\n for (int j = 1; j < 500 && i - j >= 0; j++)\n adj[y[i]].push_back({max(abs(coords[y[i]][0] - coords[y[i - j]][0]), abs(coords[y[i]][1] - coords[y[i - j]][1])), y[i - j]});\n }\n }\n\n prim();\n\n return 0;\n}", "accuracy": 0.140625, "time_ms": 480, "memory_kb": 134112, "score_of_the_acc": -1.5165, "final_rank": 20 }, { "submission_id": "aoj_0403_6688450", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Edge\n{\n int w = INT_MAX, to = -1;\n bool operator<(Edge const &other) const\n {\n return make_pair(w, to) < make_pair(other.w, other.to);\n }\n};\n\nint n, coords[100000][2];\nvector<vector<Edge>> adj;\n\nbool sortX(int a, int b) { return coords[a][0] < coords[b][0]; }\nbool sortY(int a, int b) { return coords[a][1] < coords[b][1]; }\n\nvoid prim()\n{\n long total_weight = 0;\n vector<Edge> min_e(n);\n min_e[0].w = 0;\n set<Edge> q;\n q.insert({0, 0});\n vector<bool> selected(n, false);\n for (int i = 0; i < n; ++i)\n {\n if (q.empty())\n {\n cout << \"No MST!\" << endl;\n exit(0);\n }\n\n int v = q.begin()->to;\n selected[v] = true;\n total_weight += q.begin()->w;\n q.erase(q.begin());\n\n // if (min_e[v].to != -1)\n // cout << v << \" \" << min_e[v].to << endl;\n\n for (Edge e : adj[v])\n {\n if (!selected[e.to] && e.w < min_e[e.to].w)\n {\n q.erase({min_e[e.to].w, e.to});\n min_e[e.to] = {e.w, v};\n q.insert({e.w, e.to});\n }\n }\n }\n\n cout << total_weight << endl;\n}\n\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n cin >> n;\n vector<int> x(n), y(n);\n adj.resize(n);\n for (int i = 0; i < n; i++)\n {\n cin >> coords[i][0] >> coords[i][1];\n x[i] = i;\n y[i] = i;\n }\n\n sort(x.begin(), x.end(), sortX);\n for (int i = 0; i < n; i++)\n {\n if (i == 0)\n {\n for (int j = 1; j < 100 && i + j < n; j++)\n adj[x[i]].push_back({max(abs(coords[x[i]][0] - coords[x[i + j]][0]), abs(coords[x[i]][1] - coords[x[i + j]][1])), x[i + j]});\n }\n else if (i == n - 1)\n {\n for (int j = 1; j < 100 && i - j >= 0; j++)\n adj[x[i]].push_back({max(abs(coords[x[i]][0] - coords[x[i - j]][0]), abs(coords[x[i]][1] - coords[x[i - j]][1])), x[i - j]});\n }\n else\n {\n for (int j = 1; j < 50 && i + j < n; j++)\n adj[x[i]].push_back({max(abs(coords[x[i]][0] - coords[x[i + j]][0]), abs(coords[x[i]][1] - coords[x[i + j]][1])), x[i + j]});\n for (int j = 1; j < 50 && i - j >= 0; j++)\n adj[x[i]].push_back({max(abs(coords[x[i]][0] - coords[x[i - j]][0]), abs(coords[x[i]][1] - coords[x[i - j]][1])), x[i - j]});\n }\n }\n // for (int i = 0; i < n; i++)\n // {\n // cout << i << \": \";\n // for (Edge x : adj[i])\n // {\n // cout << x.to << \" \";\n // }\n // cout << endl;\n // }\n\n sort(y.begin(), y.end(), sortY);\n for (int i = 0; i < n; i++)\n {\n if (i == 0)\n {\n for (int j = 1; j < 100 && i + j < n; j++)\n adj[y[i]].push_back({max(abs(coords[y[i]][0] - coords[y[i + j]][0]), abs(coords[y[i]][1] - coords[y[i + j]][1])), y[i + j]});\n }\n else if (i == n - 1)\n {\n for (int j = 1; j < 100 && i - j >= 0; j++)\n adj[y[i]].push_back({max(abs(coords[y[i]][0] - coords[y[i - j]][0]), abs(coords[y[i]][1] - coords[y[i - j]][1])), y[i - j]});\n }\n else\n {\n for (int j = 1; j < 50 && i + j < n; j++)\n adj[y[i]].push_back({max(abs(coords[y[i]][0] - coords[y[i + j]][0]), abs(coords[y[i]][1] - coords[y[i + j]][1])), y[i + j]});\n for (int j = 1; j < 50 && i - j >= 0; j++)\n adj[y[i]].push_back({max(abs(coords[y[i]][0] - coords[y[i - j]][0]), abs(coords[y[i]][1] - coords[y[i - j]][1])), y[i - j]});\n }\n }\n\n prim();\n\n return 0;\n}", "accuracy": 0.140625, "time_ms": 40, "memory_kb": 19924, "score_of_the_acc": -0.1525, "final_rank": 18 }, { "submission_id": "aoj_0403_5462897", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 100005\n\nstruct Info{\n\tbool operator<(const struct Info& arg) const{\n\n\t\treturn value < arg.value;\n\t}\n\tvoid set(ll arg_value,ll arg_index){\n\t\tvalue = arg_value;\n\t\tindex = arg_index;\n\t}\n\tll value,index;\n};\n\n\nstruct Point{\n\n\tll x,y,input_index;\n};\n\nstruct Edge{\n\tEdge(int arg_a,int arg_b,ll arg_cost){\n\t\ta = arg_a;\n\t\tb = arg_b;\n\t\tcost = arg_cost;\n\t}\n\tbool operator<(const struct Edge& arg) const{\n\n\t\treturn cost < arg.cost;\n\t}\n\tint a,b;\n\tll cost;\n};\n\nint N;\nint boss[SIZE],height[SIZE],num_member[SIZE];\nint INDEX[SIZE];\nInfo table[6*SIZE];\nPoint point[SIZE];\nvector<Edge> edge;\n\n\nvoid init(int first_N){\n\tN = 1;\n\twhile(N < first_N)N *= 2;\n}\n\nvoid update(int loc,ll value,ll index){\n\tloc += N-1;\n\n\tif(table[loc].value <= value){\n\n\t\treturn;\n\t}\n\ttable[loc].set(value,index);\n\n\tif(N == 1)return;\n\n\tint parent = (loc-1)/2;\n\n\twhile(true){\n\n\t\tint L = 2*parent+1,R = 2*parent+2;\n\t\ttable[parent] = min(table[L],table[R]);\n\n\t\tif(parent == 0)break;\n\t\telse{\n\t\t\tparent = (parent-1)/2;\n\t\t}\n\t}\n}\n\n\nInfo query(int search_left,int search_right,int node_id,int node_left,int node_right){\n\n\tInfo ret;\n\n\tif(search_right < node_left || search_left > node_right){\n\n\t\tret.set(HUGE_NUM,-1);\n\t\treturn ret;\n\t}\n\n\tif(search_left <= node_left && search_right >= node_right){\n\t\treturn table[node_id];\n\t}\n\n\tInfo left_min = query(search_left,search_right,2*node_id+1,node_left,(node_left+node_right)/2);\n\tInfo right_min = query(search_left,search_right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\treturn min(left_min,right_min);\n}\n\nint get_boss(int id){\n\tif(boss[id] == id)return id;\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]);\n\t}\n}\n\nint isSame(int x,int y){\n\treturn get_boss(x) == get_boss(y);\n}\n\nvoid unite(int x,int y){\n\tint boss_x = get_boss(x);\n\tint boss_y = get_boss(y);\n\n\tif(boss_x == boss_y)return;\n\n\tif(height[boss_x] > height[boss_y]){\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[boss_x] < height[boss_y]){\n\n\t\tnum_member[boss_y] += num_member[boss_x];\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[boss_x] == height[boss_y]\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\n\nint main(){\n\n\tint first_N;\n\n\tscanf(\"%d\",&first_N);\n\n\tinit(first_N);\n\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tscanf(\"%lld %lld\",&point[i].x,&point[i].y);\n\t\tpoint[i].input_index = i;\n\t}\n\n\tfor(int a = 0; a <= 1; a++){\n\t\tfor(int b = 0; b <= 1; b++){\n\t\t\tfor(int c = 0; c <= 1; c++){\n\t\t\t\tfor(int i = 0; i <= 2*N-2; i++){\n\n\t\t\t\t\ttable[i].value = HUGE_NUM;\n\t\t\t\t}\n\n\t\t\t\tvector<int> IND(first_N);\n\t\t\t\tiota(IND.begin(), IND.end(), 0);\n\n\t\t\t\tsort(IND.begin(), IND.end(), [&](int i, int j) {\n\t\t\t\t\tif(point[i].y-point[i].x != point[j].y-point[j].x){\n\n\t\t\t\t\t\treturn point[i].y-point[i].x < point[j].y-point[j].x;\n\t\t\t\t\t}else if(point[i].y != point[j].y){\n\n\t\t\t\t\t\treturn point[i].y > point[j].y;\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\treturn i > j;\n\t\t\t\t\t}\n\t\t\t\t});\n\n\t\t\t\tvector<ll> vec_Y;\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tvec_Y.push_back(point[i].y);\n\t\t\t\t}\n\t\t\t\tsort(vec_Y.begin(),vec_Y.end());\n\t\t\t\tvec_Y.erase(unique(vec_Y.begin(),vec_Y.end()),vec_Y.end());\n\n\t\t\t\tmap<ll,ll> MAP;\n\t\t\t\tfor(int i = 0; i < vec_Y.size(); i++){\n\n\t\t\t\t\tMAP[vec_Y[i]] = i;\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tInfo ret = query(MAP[point[IND[i]].y],first_N,0,0,N-1); //y座標が自分以上のデータの、max(x,y)の最小値を取得\n\t\t\t\t\tif(ret.value != HUGE_NUM){\n\n\t\t\t\t\t\tedge.push_back(Edge(IND[i],ret.index,max(abs(point[IND[i]].x-point[ret.index].x),abs(point[IND[i]].y-point[ret.index].y))));\n\t\t\t\t\t}\n\t\t\t\t\tupdate(MAP[point[IND[i]].y],max(point[IND[i]].x,point[IND[i]].y),IND[i]); //★★★xとyの大きい方の値を登録★★★\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\t\t\t\t\tswap(point[i].x,point[i].y);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\tpoint[i].x *= -1;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\tpoint[i].y *= -1;\n\t\t}\n\t}\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t\tnum_member[i] = 1;\n\t}\n\n\tsort(edge.begin(),edge.end());\n\n\tll ans = 0;\n\n\tvector<Edge> ANS;\n\n\tfor(int i = 0; i < edge.size(); i++){\n\t\tif(isSame(edge[i].a,edge[i].b))continue;\n\n\t\tunite(edge[i].a,edge[i].b);\n\t\tANS.push_back(edge[i]);\n\t\tans += edge[i].cost;\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 900, "memory_kb": 33000, "score_of_the_acc": -1.1984, "final_rank": 6 }, { "submission_id": "aoj_0403_5462893", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 100005\n\nstruct Info{\n\tbool operator<(const struct Info& arg) const{\n\n\t\treturn value < arg.value;\n\t}\n\tvoid set(ll arg_value,ll arg_index){\n\t\tvalue = arg_value;\n\t\tindex = arg_index;\n\t}\n\tll value,index;\n};\n\n\nstruct Point{\n\n\tll x,y,input_index;\n};\n\nstruct Edge{\n\tEdge(int arg_a,int arg_b,ll arg_cost){\n\t\ta = arg_a;\n\t\tb = arg_b;\n\t\tcost = arg_cost;\n\t}\n\tbool operator<(const struct Edge& arg) const{\n\n\t\treturn cost < arg.cost;\n\t}\n\tint a,b;\n\tll cost;\n};\n\nint N;\nint boss[SIZE],height[SIZE],num_member[SIZE];\nint INDEX[SIZE];\nInfo table[6*SIZE];\nPoint point[SIZE];\nvector<Edge> edge;\n\n\nvoid init(int first_N){\n\tN = 1;\n\twhile(N < first_N)N *= 2;\n}\n\nvoid update(int loc,ll value,ll index){\n\tloc += N-1;\n\n\tif(table[loc].value <= value){\n\n\t\treturn;\n\t}\n\ttable[loc].set(value,index);\n\n\tif(N == 1)return;\n\n\tint parent = (loc-1)/2;\n\n\twhile(true){\n\n\t\tint L = 2*parent+1,R = 2*parent+2;\n\t\ttable[parent] = min(table[L],table[R]);\n\n\t\tif(parent == 0)break;\n\t\telse{\n\t\t\tparent = (parent-1)/2;\n\t\t}\n\t}\n}\n\n\nInfo query(int search_left,int search_right,int node_id,int node_left,int node_right){\n\n\tInfo ret;\n\n\t//今回のノードが検索区間をカバーしていなければ、結果に関係ない値を返す\n\tif(search_right < node_left || search_left > node_right){\n\n\t\tret.set(HUGE_NUM,-1);\n\t\treturn ret;\n\t}\n\n\t//今回のノードの区間が、検索区間の部分区間である場合、今回のノードの値を返す\n\tif(search_left <= node_left && search_right >= node_right){\n\t\treturn table[node_id];\n\t}\n\n\t//今回のノードの区間に、一部検索区間と重なっている区間がある場合→再帰的に子どもに尋ねる\n\tInfo left_min = query(search_left,search_right,2*node_id+1,node_left,(node_left+node_right)/2);\n\tInfo right_min = query(search_left,search_right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\treturn min(left_min,right_min);\n}\n\nint get_boss(int id){\n\tif(boss[id] == id)return id;\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]);\n\t}\n}\n\nint isSame(int x,int y){\n\treturn get_boss(x) == get_boss(y);\n}\n\nvoid unite(int x,int y){\n\tint boss_x = get_boss(x);\n\tint boss_y = get_boss(y);\n\n\tif(boss_x == boss_y)return;\n\n\tif(height[boss_x] > height[boss_y]){\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[boss_x] < height[boss_y]){\n\n\t\tnum_member[boss_y] += num_member[boss_x];\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[boss_x] == height[boss_y]\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\n\nint main(){\n\n\tint first_N;\n\n\tscanf(\"%d\",&first_N);\n\n\tinit(first_N);\n\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tscanf(\"%lld %lld\",&point[i].x,&point[i].y);\n\t\tpoint[i].input_index = i;\n\t}\n\n\tfor(int a = 0; a <= 1; a++){\n\t\tfor(int b = 0; b <= 1; b++){\n\t\t\tfor(int c = 0; c <= 1; c++){\n\t\t\t\tfor(int i = 0; i <= 2*N-2; i++){\n\n\t\t\t\t\ttable[i].value = HUGE_NUM;\n\t\t\t\t}\n\n\t\t\t\tstd::vector<int> IND(first_N);\n\t\t\t\tstd::iota(IND.begin(), IND.end(), 0);\n\n\t\t\t\tstd::sort(IND.begin(), IND.end(), [&](int i, int j) {\n\t\t\t\t\tif(point[i].y-point[i].x != point[j].y-point[j].x){\n\n\t\t\t\t\t\treturn point[i].y-point[i].x < point[j].y-point[j].x;\n\t\t\t\t\t}else if(point[i].y != point[j].y){\n\n\t\t\t\t\t\treturn point[i].y > point[j].y;\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\treturn i > j;\n\t\t\t\t\t}\n\t\t\t\t});\n\n\t\t\t\tvector<ll> vec_Y;\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tvec_Y.push_back(point[i].y);\n\t\t\t\t}\n\t\t\t\tsort(vec_Y.begin(),vec_Y.end());\n\t\t\t\tvec_Y.erase(unique(vec_Y.begin(),vec_Y.end()),vec_Y.end());\n\n\t\t\t\tmap<ll,ll> MAP;\n\t\t\t\tfor(int i = 0; i < vec_Y.size(); i++){\n\n\t\t\t\t\tMAP[vec_Y[i]] = i;\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tInfo ret = query(MAP[point[IND[i]].y],first_N,0,0,N-1); //y座標が自分以上のデータの、max(x,y)の最小値を取得\n\t\t\t\t\tif(ret.value != HUGE_NUM){\n\n\t\t\t\t\t\tedge.push_back(Edge(IND[i],ret.index,max(abs(point[IND[i]].x-point[ret.index].x),abs(point[IND[i]].y-point[ret.index].y))));\n\t\t\t\t\t}\n\t\t\t\t\tupdate(MAP[point[IND[i]].y],max(point[IND[i]].x,point[IND[i]].y),IND[i]);\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\t\t\t\t\tswap(point[i].x,point[i].y);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\tpoint[i].x *= -1;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\tpoint[i].y *= -1;\n\t\t}\n\t}\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t\tnum_member[i] = 1;\n\t}\n\n\tsort(edge.begin(),edge.end());\n\n\tll ans = 0;\n\n\tvector<Edge> ANS;\n\n\tfor(int i = 0; i < edge.size(); i++){\n\t\tif(isSame(edge[i].a,edge[i].b))continue;\n\n\t\tunite(edge[i].a,edge[i].b);\n\t\tANS.push_back(edge[i]);\n\t\tans += edge[i].cost;\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 920, "memory_kb": 33088, "score_of_the_acc": -1.221, "final_rank": 7 }, { "submission_id": "aoj_0403_5462677", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 100005\n\nstruct Info{\n\tbool operator<(const struct Info& arg) const{\n\n\t\treturn value < arg.value;\n\t}\n\tvoid set(ll arg_value,ll arg_index){\n\t\tvalue = arg_value;\n\t\tindex = arg_index;\n\t}\n\tll value,index;\n};\n\n\nstruct Point{\n\n\tll x,y,input_index;\n};\n\nstruct Edge{\n\tEdge(int arg_a,int arg_b,ll arg_cost){\n\t\ta = arg_a;\n\t\tb = arg_b;\n\t\tcost = arg_cost;\n\t}\n\tbool operator<(const struct Edge& arg) const{\n\n\t\treturn cost < arg.cost;\n\t}\n\tint a,b;\n\tll cost;\n};\n\nint N;\nint boss[SIZE],height[SIZE],num_member[SIZE];\nint INDEX[SIZE];\nInfo table[6*SIZE];\nPoint point[SIZE];\nvector<Edge> edge;\n\n\nvoid init(int first_N){\n\tN = 1;\n\twhile(N < first_N)N *= 2;\n}\n\nvoid update(int loc,ll value,ll index){\n\tloc += N-1;\n\n\tif(table[loc].value <= value){\n\n\t\treturn;\n\t}\n\ttable[loc].set(value,index);\n\n\tif(N == 1)return;\n\n\tint parent = (loc-1)/2;\n\n\twhile(true){\n\n\t\tint L = 2*parent+1,R = 2*parent+2;\n\t\ttable[parent] = min(table[L],table[R]);\n\n\t\tif(parent == 0)break;\n\t\telse{\n\t\t\tparent = (parent-1)/2;\n\t\t}\n\t}\n}\n\n\nInfo query(int search_left,int search_right,int node_id,int node_left,int node_right){\n\n\tInfo ret;\n\n\t//今回のノードが検索区間をカバーしていなければ、結果に関係ない値を返す\n\tif(search_right < node_left || search_left > node_right){\n\n\t\tret.set(HUGE_NUM,-1);\n\t\treturn ret;\n\t}\n\n\t//今回のノードの区間が、検索区間の部分区間である場合、今回のノードの値を返す\n\tif(search_left <= node_left && search_right >= node_right){\n\t\treturn table[node_id];\n\t}\n\n\t//今回のノードの区間に、一部検索区間と重なっている区間がある場合→再帰的に子どもに尋ねる\n\tInfo left_min = query(search_left,search_right,2*node_id+1,node_left,(node_left+node_right)/2);\n\tInfo right_min = query(search_left,search_right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\treturn min(left_min,right_min);\n}\n\nint get_boss(int id){\n\tif(boss[id] == id)return id;\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]);\n\t}\n}\n\nint isSame(int x,int y){\n\treturn get_boss(x) == get_boss(y);\n}\n\nvoid unite(int x,int y){\n\tint boss_x = get_boss(x);\n\tint boss_y = get_boss(y);\n\n\tif(boss_x == boss_y)return;\n\n\tif(height[boss_x] > height[boss_y]){\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[boss_x] < height[boss_y]){\n\n\t\tnum_member[boss_y] += num_member[boss_x];\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[boss_x] == height[boss_y]\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\n\nint main(){\n\n\tint first_N;\n\n\tscanf(\"%d\",&first_N);\n\n\tinit(first_N);\n\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tscanf(\"%lld %lld\",&point[i].x,&point[i].y);\n\t\tpoint[i].input_index = i;\n\t}\n\n\tfor(int d = 0; d < 2; d++){\n\tfor(int a = 0; a <= 1; a++){\n\t\tfor(int b = 0; b <= 1; b++){\n\t\t\tfor(int c = 0; c <= 1; c++){\n\t\t\t\tfor(int i = 0; i <= 2*N-2; i++){\n\n\t\t\t\t\ttable[i].value = HUGE_NUM;\n\t\t\t\t}\n\n\t\t\t\tstd::vector<int> IND(first_N);\n\t\t\t\tstd::iota(IND.begin(), IND.end(), 0);\n\n\t\t\t\tstd::sort(IND.begin(), IND.end(), [&](int i, int j) {\n\t\t\t\t\tif(point[i].y-point[i].x != point[j].y-point[j].x){\n\n\t\t\t\t\t\treturn point[i].y-point[i].x < point[j].y-point[j].x;\n\t\t\t\t\t}else if(point[i].y != point[j].y){\n\n\t\t\t\t\t\treturn point[i].y > point[j].y;\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tif(d == 0){\n\t\t\t\t\t\treturn i > j;\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\treturn i < j;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t});\n\n\t\t\t\tvector<ll> vec_Y;\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tvec_Y.push_back(point[i].y);\n\t\t\t\t}\n\t\t\t\tsort(vec_Y.begin(),vec_Y.end());\n\t\t\t\tvec_Y.erase(unique(vec_Y.begin(),vec_Y.end()),vec_Y.end());\n\n\t\t\t\tmap<ll,ll> MAP;\n\t\t\t\tfor(int i = 0; i < vec_Y.size(); i++){\n\n\t\t\t\t\tMAP[vec_Y[i]] = i;\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tInfo ret = query(MAP[point[IND[i]].y],first_N,0,0,N-1); //y座標が自分以上のデータの、x+yの最小値を取得\n\t\t\t\t\tif(ret.value != HUGE_NUM){\n\n\t\t\t\t\t\tedge.push_back(Edge(IND[i],ret.index,max(abs(point[IND[i]].x-point[ret.index].x),abs(point[IND[i]].y-point[ret.index].y))));\n\t\t\t\t\t}\n\t\t\t\t\tupdate(MAP[point[IND[i]].y],point[IND[i]].x+point[IND[i]].y,IND[i]);\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\t\t\t\t\tswap(point[i].x,point[i].y);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\tpoint[i].x *= -1;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\tpoint[i].y *= -1;\n\t\t}\n\t}\n\t}\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t\tnum_member[i] = 1;\n\t}\n\n\tsort(edge.begin(),edge.end());\n\n\tll ans = 0;\n\n\tvector<Edge> ANS;\n\n\tfor(int i = 0; i < edge.size(); i++){\n\t\tif(isSame(edge[i].a,edge[i].b))continue;\n\n\t\tunite(edge[i].a,edge[i].b);\n\t\tANS.push_back(edge[i]);\n\t\tans += edge[i].cost;\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}", "accuracy": 0.359375, "time_ms": 40, "memory_kb": 5416, "score_of_the_acc": -0.0406, "final_rank": 17 }, { "submission_id": "aoj_0403_5462615", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 100005\n\nstruct Info{\n\tbool operator<(const struct Info& arg) const{\n\n\t\treturn value < arg.value;\n\t}\n\tvoid set(ll arg_value,ll arg_index){\n\t\tvalue = arg_value;\n\t\tindex = arg_index;\n\t}\n\tll value,index;\n};\n\nstruct DATA{\n\tbool operator<(const struct DATA &arg) const{\n\n\t\treturn y < arg.y;\n\t}\n\tvoid set(ll arg_x,ll arg_y,ll arg_input_index){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t\tinput_index = arg_input_index;\n\t}\n\tll x,y,input_index;\n};\n\nstruct Point{\n\n\tll x,y,input_index;\n};\n\nstruct Edge{\n\tEdge(int arg_a,int arg_b,ll arg_cost){\n\t\ta = arg_a;\n\t\tb = arg_b;\n\t\tcost = arg_cost;\n\t}\n\tbool operator<(const struct Edge& arg) const{\n\n\t\treturn cost < arg.cost;\n\t}\n\tint a,b;\n\tll cost;\n};\n\nint N;\nint boss[SIZE],height[SIZE],num_member[SIZE];\nint INDEX[SIZE];\nDATA D[SIZE];\nInfo table[6*SIZE];\nPoint point[SIZE];\nvector<Edge> edge;\n\n\nvoid init(int first_N){\n\tN = 1;\n\twhile(N < first_N)N *= 2;\n}\n\nvoid update(int loc,ll value,ll index){\n\tloc += N-1;\n\n\tif(table[loc].value <= value){\n\n\t\treturn;\n\t}\n\ttable[loc].set(value,index);\n\n\tif(N == 1)return;\n\n\tint parent = (loc-1)/2;\n\n\twhile(true){\n\n\t\tint L = 2*parent+1,R = 2*parent+2;\n\t\ttable[parent] = min(table[L],table[R]);\n\n\t\tif(parent == 0)break;\n\t\telse{\n\t\t\tparent = (parent-1)/2;\n\t\t}\n\t}\n}\n\n\nInfo query(int search_left,int search_right,int node_id,int node_left,int node_right){\n\n\tInfo ret;\n\n\t//今回のノードが検索区間をカバーしていなければ、結果に関係ない値を返す\n\tif(search_right < node_left || search_left > node_right){\n\n\t\tret.set(HUGE_NUM,-1);\n\t\treturn ret;\n\t}\n\n\t//今回のノードの区間が、検索区間の部分区間である場合、今回のノードの値を返す\n\tif(search_left <= node_left && search_right >= node_right){\n\t\treturn table[node_id];\n\t}\n\n\t//今回のノードの区間に、一部検索区間と重なっている区間がある場合→再帰的に子どもに尋ねる\n\tInfo left_min = query(search_left,search_right,2*node_id+1,node_left,(node_left+node_right)/2);\n\tInfo right_min = query(search_left,search_right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\treturn min(left_min,right_min);\n}\n\nint get_boss(int id){\n\tif(boss[id] == id)return id;\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]);\n\t}\n}\n\nint isSame(int x,int y){\n\treturn get_boss(x) == get_boss(y);\n}\n\nvoid unite(int x,int y){\n\tint boss_x = get_boss(x);\n\tint boss_y = get_boss(y);\n\n\tif(boss_x == boss_y)return;\n\n\tif(height[boss_x] > height[boss_y]){\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[boss_x] < height[boss_y]){\n\n\t\tnum_member[boss_y] += num_member[boss_x];\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[boss_x] == height[boss_y]\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\n\nint main(){\n\n\tint first_N;\n\n\tscanf(\"%d\",&first_N);\n\n\tinit(first_N);\n\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tscanf(\"%lld %lld\",&point[i].x,&point[i].y);\n\t\tpoint[i].input_index = i;\n\t}\n\n\tfor(int a = 0; a <= 1; a++){\n\t\tfor(int b = 0; b <= 1; b++){\n\t\t\tfor(int c = 0; c <= 1; c++){\n\t\t\t\tfor(int i = 0; i <= 2*N-2; i++){\n\n\t\t\t\t\ttable[i].value = HUGE_NUM;\n\t\t\t\t}\n\n\t\t\t\tstd::vector<int> IND(first_N);\n\t\t\t\tstd::iota(IND.begin(), IND.end(), 0);\n\n\t\t\t\tstd::sort(IND.begin(), IND.end(), [&](int i, int j) {\n\t\t\t\t\tif(point[i].y-point[i].x != point[j].y-point[j].x){\n\n\t\t\t\t\t\treturn point[i].y-point[i].x < point[j].y-point[j].x;\n\t\t\t\t\t}else if(point[i].y != point[j].y){\n\n\t\t\t\t\t\treturn point[i].y > point[j].y;\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\t//if(a == 0){\n\t\t\t\t\t\t\treturn i > j;\n\t\t\t\t\t\t/*}else{\n\n\t\t\t\t\t\t\treturn i < j;\n\t\t\t\t\t\t}*/\n\t\t\t\t\t}\n\t\t\t\t});\n\n\t\t\t\t//y座標sort(セグ木用)\n\t\t\t\t/*for(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tD[i].set(point[i].x,point[i].y,point[i].input_index);\n\t\t\t\t}\n\t\t\t\tsort(D,D+first_N);\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tINDEX[D[i].input_index] = i;\n\t\t\t\t}*/\n\n\t\t\t\tvector<ll> vec_Y;\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tvec_Y.push_back(point[i].y);\n\t\t\t\t}\n\t\t\t\tsort(vec_Y.begin(),vec_Y.end());\n\t\t\t\tvec_Y.erase(unique(vec_Y.begin(),vec_Y.end()),vec_Y.end());\n\n\t\t\t\tmap<ll,ll> MAP;\n\t\t\t\tfor(int i = 0; i < vec_Y.size(); i++){\n\n\t\t\t\t\tMAP[vec_Y[i]] = i;\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tInfo ret = query(MAP[point[IND[i]].y],first_N,0,0,N-1); //y座標が自分以上のデータの、x+yの最小値を取得\n\t\t\t\t\tif(ret.value != HUGE_NUM){\n\n\n\t\t\t\t\t\t//edge.push_back(Edge(IND[i],ret.index,abs(point[IND[i]].x-point[ret.index].x)+abs(point[IND[i]].y-point[ret.index].y)));\n\t\t\t\t\t\tedge.push_back(Edge(IND[i],ret.index,max(abs(point[IND[i]].x-point[ret.index].x),abs(point[IND[i]].y-point[ret.index].y))));\n\t\t\t\t\t}\n\t\t\t\t\tupdate(MAP[point[IND[i]].y],point[IND[i]].x+point[IND[i]].y,IND[i]);\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\t\t\t\t\tswap(point[i].x,point[i].y);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\tpoint[i].x *= -1;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\tpoint[i].y *= -1;\n\t\t}\n\t}\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t\tnum_member[i] = 1;\n\t}\n\n\tsort(edge.begin(),edge.end());\n\n\tll ans = 0;\n\n\tvector<Edge> ANS;\n\n\tfor(int i = 0; i < edge.size(); i++){\n\t\tif(isSame(edge[i].a,edge[i].b))continue;\n\n\t\tunite(edge[i].a,edge[i].b);\n\t\tANS.push_back(edge[i]);\n\t\tans += edge[i].cost;\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}", "accuracy": 0.359375, "time_ms": 20, "memory_kb": 4420, "score_of_the_acc": -0.011, "final_rank": 14 }, { "submission_id": "aoj_0403_5462516", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 200005\n\nstruct Info{\n\tbool operator<(const struct Info& arg) const{\n\n\t\treturn value < arg.value;\n\t}\n\tvoid set(ll arg_value,ll arg_index){\n\t\tvalue = arg_value;\n\t\tV.push_back(arg_index);\n\t}\n\tll value;\n\tvector<int> V;\n};\n\nstruct DATA{\n\tbool operator<(const struct DATA &arg) const{\n\n\t\treturn y < arg.y;\n\t}\n\tvoid set(ll arg_x,ll arg_y,ll arg_input_index){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t\tinput_index = arg_input_index;\n\t}\n\tll x,y,input_index;\n};\n\nstruct Point{\n\n\tll x,y,input_index;\n};\n\nstruct Edge{\n\tEdge(int arg_a,int arg_b,ll arg_cost){\n\t\ta = arg_a;\n\t\tb = arg_b;\n\t\tcost = arg_cost;\n\t}\n\tbool operator<(const struct Edge& arg) const{\n\n\t\treturn cost < arg.cost;\n\t}\n\tint a,b;\n\tll cost;\n};\n\nint N;\nint boss[SIZE],height[SIZE],num_member[SIZE];\nint INDEX[SIZE];\nDATA D[SIZE];\nInfo table[6*SIZE];\nPoint point[SIZE];\nvector<Edge> edge;\n\n\nvoid init(int first_N){\n\tN = 1;\n\twhile(N < first_N)N *= 2;\n}\n\nvoid update(int loc,ll value,ll index){\n\tloc += N-1;\n\n\ttable[loc].set(value,index);\n\n\tif(N == 1)return;\n\n\tint parent = (loc-1)/2;\n\n\twhile(true){\n\n\t\tint L = 2*parent+1,R = 2*parent+2;\n\t\tif(table[L].value < table[R].value){\n\n\t\t\ttable[parent] = table[L];\n\t\t}else if(table[L].value > table[R].value){\n\n\t\t\ttable[parent] = table[R];\n\t\t}else{\n\n\t\t\tfor(int i = 0; i < table[R].V.size(); i++){\n\n\t\t\t\ttable[L].V.push_back(table[R].V[i]);\n\t\t\t}\n\t\t\ttable[parent] = table[L];\n\t\t}\n\n\t\tif(parent == 0)break;\n\t\telse{\n\t\t\tparent = (parent-1)/2;\n\t\t}\n\t}\n}\n\n\nInfo query(int search_left,int search_right,int node_id,int node_left,int node_right){\n\n\tInfo ret;\n\n\t//今回のノードが検索区間をカバーしていなければ、結果に関係ない値を返す\n\tif(search_right < node_left || search_left > node_right){\n\n\t\tret.set(HUGE_NUM,-1);\n\t\treturn ret;\n\t}\n\n\t//今回のノードの区間が、検索区間の部分区間である場合、今回のノードの値を返す\n\tif(search_left <= node_left && search_right >= node_right){\n\t\treturn table[node_id];\n\t}\n\n\t//今回のノードの区間に、一部検索区間と重なっている区間がある場合→再帰的に子どもに尋ねる\n\tInfo left_min = query(search_left,search_right,2*node_id+1,node_left,(node_left+node_right)/2);\n\tInfo right_min = query(search_left,search_right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\tif(left_min.value < right_min.value){\n\n\t\treturn left_min;\n\t}else if(left_min.value > right_min.value){\n\n\t\treturn right_min;\n\t}else{\n\n\t\tif(right_min.value != HUGE_NUM){\n\n\t\t\tfor(int i = 0; i < right_min.V.size(); i++){\n\n\t\t\t\tleft_min.V.push_back(right_min.V[i]);\n\t\t\t}\n\t\t}\n\t\treturn left_min;\n\t}\n}\n\nint get_boss(int id){\n\tif(boss[id] == id)return id;\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]);\n\t}\n}\n\nint isSame(int x,int y){\n\treturn get_boss(x) == get_boss(y);\n}\n\nvoid unite(int x,int y){\n\tint boss_x = get_boss(x);\n\tint boss_y = get_boss(y);\n\n\tif(boss_x == boss_y)return;\n\n\tif(height[boss_x] > height[boss_y]){\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[boss_x] < height[boss_y]){\n\n\t\tnum_member[boss_y] += num_member[boss_x];\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[boss_x] == height[boss_y]\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\n\nint main(){\n\n\tint first_N;\n\n\tscanf(\"%d\",&first_N);\n\n\tinit(first_N);\n\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tscanf(\"%lld %lld\",&point[i].x,&point[i].y);\n\t\tpoint[i].input_index = i;\n\t}\n\n\tfor(int a = 0; a <= 1; a++){\n\t\tfor(int b = 0; b <= 1; b++){\n\t\t\tfor(int c = 0; c <= 1; c++){\n\t\t\t\tfor(int i = 0; i <= 2*N-2; i++){\n\n\t\t\t\t\ttable[i].value = HUGE_NUM;\n\t\t\t\t}\n\n\t\t\t\tstd::vector<int> IND(first_N);\n\t\t\t\tstd::iota(IND.begin(), IND.end(), 0);\n\n\t\t\t\tstd::sort(IND.begin(), IND.end(), [&](int i, int j) {\n\t\t\t\t\tif(point[i].y-point[i].x != point[j].y-point[j].x){\n\n\t\t\t\t\t\treturn point[i].y-point[i].x < point[j].y-point[j].x;\n\t\t\t\t\t}else if(point[i].y != point[j].y){\n\n\t\t\t\t\t\treturn point[i].y > point[j].y;\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\t//if(a == 0){\n\t\t\t\t\t\t\treturn i > j;\n\t\t\t\t\t\t/*}else{\n\n\t\t\t\t\t\t\treturn i < j;\n\t\t\t\t\t\t}*/\n\t\t\t\t\t}\n\t\t\t\t});\n\n\t\t\t\t//y座標sort(セグ木用)\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tD[i].set(point[i].x,point[i].y,point[i].input_index);\n\t\t\t\t}\n\t\t\t\tsort(D,D+first_N);\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tINDEX[D[i].input_index] = i;\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tInfo ret = query(INDEX[IND[i]],first_N,0,0,N-1); //y座標が自分以上のデータの、x+yの最小値を取得\n\t\t\t\t\tif(ret.value != HUGE_NUM){\n\n\n\t\t\t\t\t\t//edge.push_back(Edge(IND[i],ret.index,abs(point[IND[i]].x-point[ret.index].x)+abs(point[IND[i]].y-point[ret.index].y)));\n\t\t\t\t\t\tfor(int k = 0; k < ret.V.size(); k++){\n\n\t\t\t\t\t\t\tedge.push_back(Edge(IND[i],ret.V[k],max(abs(point[IND[i]].x-point[ret.V[k]].x),abs(point[IND[i]].y-point[ret.V[k]].y))));\n\t\t\t\t\t\t}\n\t\t\t\t\t\t//edge.push_back(Edge(IND[i],ret.index,max(abs(point[IND[i]].x-point[ret.index].x),abs(point[IND[i]].y-point[ret.index].y))));\n\t\t\t\t\t}\n\t\t\t\t\tupdate(INDEX[IND[i]],point[IND[i]].x+point[IND[i]].y,IND[i]);\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\t\t\t\t\tswap(point[i].x,point[i].y);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\tpoint[i].x *= -1;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\tpoint[i].y *= -1;\n\t\t}\n\t}\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t\tnum_member[i] = 1;\n\t}\n\n\tsort(edge.begin(),edge.end());\n\n\tll ans = 0;\n\n\tvector<Edge> ANS;\n\n\tfor(int i = 0; i < edge.size(); i++){\n\t\tif(isSame(edge[i].a,edge[i].b))continue;\n\n\t\tunite(edge[i].a,edge[i].b);\n\t\tANS.push_back(edge[i]);\n\t\tans += edge[i].cost;\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\t/*for(int i = 0; i < ANS.size(); i++){\n\n\t\tprintf(\"%d %d\\n\",ANS[i].a,ANS[i].b);\n\t}*/\n\treturn 0;\n}", "accuracy": 0.65625, "time_ms": 80, "memory_kb": 46136, "score_of_the_acc": -0.3986, "final_rank": 9 }, { "submission_id": "aoj_0403_5462514", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 200005\n\nstruct Info{\n\tbool operator<(const struct Info& arg) const{\n\n\t\treturn value < arg.value;\n\t}\n\tvoid set(ll arg_value,ll arg_index){\n\t\tvalue = arg_value;\n\t\tV.push_back(arg_index);\n\t}\n\tll value;\n\tvector<int> V;\n};\n\nstruct DATA{\n\tbool operator<(const struct DATA &arg) const{\n\n\t\treturn y < arg.y;\n\t}\n\tvoid set(ll arg_x,ll arg_y,ll arg_input_index){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t\tinput_index = arg_input_index;\n\t}\n\tll x,y,input_index;\n};\n\nstruct Point{\n\n\tll x,y,input_index;\n};\n\nstruct Edge{\n\tEdge(int arg_a,int arg_b,ll arg_cost){\n\t\ta = arg_a;\n\t\tb = arg_b;\n\t\tcost = arg_cost;\n\t}\n\tbool operator<(const struct Edge& arg) const{\n\n\t\treturn cost < arg.cost;\n\t}\n\tint a,b;\n\tll cost;\n};\n\nint N;\nint boss[SIZE],height[SIZE],num_member[SIZE];\nint INDEX[SIZE];\nDATA D[SIZE];\nInfo table[6*SIZE];\nPoint point[SIZE];\nvector<Edge> edge;\n\n\nvoid init(int first_N){\n\tN = 1;\n\twhile(N < first_N)N *= 2;\n}\n\nvoid update(int loc,ll value,ll index){\n\tloc += N-1;\n\n\ttable[loc].set(value,index);\n\n\tif(N == 1)return;\n\n\tint parent = (loc-1)/2;\n\n\twhile(true){\n\n\t\tint L = 2*parent+1,R = 2*parent+2;\n\t\tif(table[L].value < table[R].value){\n\n\t\t\ttable[parent] = table[L];\n\t\t}else if(table[L].value > table[R].value){\n\n\t\t\ttable[parent] = table[R];\n\t\t}else{\n\n\t\t\tfor(int i = 0; i < table[R].V.size(); i++){\n\n\t\t\t\ttable[L].V.push_back(table[R].V[i]);\n\t\t\t}\n\t\t\ttable[parent] = table[L];\n\t\t}\n\n\t\tif(parent == 0)break;\n\t\telse{\n\t\t\tparent = (parent-1)/2;\n\t\t}\n\t}\n}\n\n\nInfo query(int search_left,int search_right,int node_id,int node_left,int node_right){\n\n\tInfo ret;\n\n\t//今回のノードが検索区間をカバーしていなければ、結果に関係ない値を返す\n\tif(search_right < node_left || search_left > node_right){\n\n\t\tret.set(HUGE_NUM,-1);\n\t\treturn ret;\n\t}\n\n\t//今回のノードの区間が、検索区間の部分区間である場合、今回のノードの値を返す\n\tif(search_left <= node_left && search_right >= node_right){\n\t\treturn table[node_id];\n\t}\n\n\t//今回のノードの区間に、一部検索区間と重なっている区間がある場合→再帰的に子どもに尋ねる\n\tInfo left_min = query(search_left,search_right,2*node_id+1,node_left,(node_left+node_right)/2);\n\tInfo right_min = query(search_left,search_right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\tif(left_min.value < right_min.value){\n\n\t\treturn left_min;\n\t}else if(left_min.value > right_min.value){\n\n\t\treturn right_min;\n\t}else{\n\n\t\tif(right_min.value != HUGE_NUM){\n\n\t\t\tfor(int i = 0; i < right_min.V.size(); i++){\n\n\t\t\t\tleft_min.V.push_back(right_min.V[i]);\n\t\t\t}\n\t\t}\n\t\treturn left_min;\n\t}\n}\n\nint get_boss(int id){\n\tif(boss[id] == id)return id;\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]);\n\t}\n}\n\nint isSame(int x,int y){\n\treturn get_boss(x) == get_boss(y);\n}\n\nvoid unite(int x,int y){\n\tint boss_x = get_boss(x);\n\tint boss_y = get_boss(y);\n\n\tif(boss_x == boss_y)return;\n\n\tif(height[boss_x] > height[boss_y]){\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[boss_x] < height[boss_y]){\n\n\t\tnum_member[boss_y] += num_member[boss_x];\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[boss_x] == height[boss_y]\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\n\nint main(){\n\n\tint first_N;\n\n\tscanf(\"%d\",&first_N);\n\n\tinit(first_N);\n\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tscanf(\"%lld %lld\",&point[i].x,&point[i].y);\n\t\tpoint[i].input_index = i;\n\t}\n\n\tfor(int a = 0; a <= 1; a++){\n\t\tfor(int b = 0; b <= 1; b++){\n\t\t\tfor(int c = 0; c <= 1; c++){\n\t\t\t\tfor(int i = 0; i <= 2*N-2; i++){\n\n\t\t\t\t\ttable[i].value = HUGE_NUM;\n\t\t\t\t}\n\n\t\t\t\tstd::vector<int> IND(first_N);\n\t\t\t\tstd::iota(IND.begin(), IND.end(), 0);\n\n\t\t\t\tstd::sort(IND.begin(), IND.end(), [&](int i, int j) {\n\t\t\t\t\tif(point[i].y-point[i].x != point[j].y-point[j].x){\n\n\t\t\t\t\t\treturn point[i].y-point[i].x < point[j].y-point[j].x;\n\t\t\t\t\t}else if(point[i].y != point[j].y){\n\n\t\t\t\t\t\treturn point[i].y > point[j].y;\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tif(a == 0){\n\t\t\t\t\t\t\treturn i > j;\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\treturn i < j;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t});\n\n\t\t\t\t//y座標sort(セグ木用)\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tD[i].set(point[i].x,point[i].y,point[i].input_index);\n\t\t\t\t}\n\t\t\t\tsort(D,D+first_N);\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tINDEX[D[i].input_index] = i;\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tInfo ret = query(INDEX[IND[i]],first_N,0,0,N-1); //y座標が自分以上のデータの、x+yの最小値を取得\n\t\t\t\t\tif(ret.value != HUGE_NUM){\n\n\n\t\t\t\t\t\t//edge.push_back(Edge(IND[i],ret.index,abs(point[IND[i]].x-point[ret.index].x)+abs(point[IND[i]].y-point[ret.index].y)));\n\t\t\t\t\t\tfor(int k = 0; k < ret.V.size(); k++){\n\n\t\t\t\t\t\t\tedge.push_back(Edge(IND[i],ret.V[k],max(abs(point[IND[i]].x-point[ret.V[k]].x),abs(point[IND[i]].y-point[ret.V[k]].y))));\n\t\t\t\t\t\t}\n\t\t\t\t\t\t//edge.push_back(Edge(IND[i],ret.index,max(abs(point[IND[i]].x-point[ret.index].x),abs(point[IND[i]].y-point[ret.index].y))));\n\t\t\t\t\t}\n\t\t\t\t\tupdate(INDEX[IND[i]],point[IND[i]].x+point[IND[i]].y,IND[i]);\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\t\t\t\t\tswap(point[i].x,point[i].y);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\tpoint[i].x *= -1;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\tpoint[i].y *= -1;\n\t\t}\n\t}\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t\tnum_member[i] = 1;\n\t}\n\n\tsort(edge.begin(),edge.end());\n\n\tll ans = 0;\n\n\tvector<Edge> ANS;\n\n\tfor(int i = 0; i < edge.size(); i++){\n\t\tif(isSame(edge[i].a,edge[i].b))continue;\n\n\t\tunite(edge[i].a,edge[i].b);\n\t\tANS.push_back(edge[i]);\n\t\tans += edge[i].cost;\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\t/*for(int i = 0; i < ANS.size(); i++){\n\n\t\tprintf(\"%d %d\\n\",ANS[i].a,ANS[i].b);\n\t}*/\n\treturn 0;\n}", "accuracy": 0.65625, "time_ms": 80, "memory_kb": 46000, "score_of_the_acc": -0.3975, "final_rank": 8 }, { "submission_id": "aoj_0403_5462458", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 200005\n\nstruct Info{\n\tbool operator<(const struct Info& arg) const{\n\n\t\tif(value != arg.value){\n\t\t\treturn value < arg.value;\n\t\t}else{\n\n\t\t\treturn index < arg.index;\n\t\t}\n\t}\n\tvoid set(ll arg_value,ll arg_index){\n\t\tvalue = arg_value;\n\t\tindex = arg_index;\n\t}\n\tll value,index;\n};\n\nstruct DATA{\n\tbool operator<(const struct DATA &arg) const{\n\n\t\treturn y < arg.y;\n\t}\n\tvoid set(ll arg_x,ll arg_y,ll arg_input_index){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t\tinput_index = arg_input_index;\n\t}\n\tll x,y,input_index;\n};\n\nstruct Point{\n\n\tll x,y,input_index;\n};\n\nstruct Edge{\n\tEdge(int arg_a,int arg_b,ll arg_cost){\n\t\ta = arg_a;\n\t\tb = arg_b;\n\t\tcost = arg_cost;\n\t}\n\tbool operator<(const struct Edge& arg) const{\n\n\t\treturn cost < arg.cost;\n\t}\n\tint a,b;\n\tll cost;\n};\n\nint N;\nint boss[SIZE],height[SIZE],num_member[SIZE];\nint INDEX[SIZE];\nDATA D[SIZE];\nInfo table[6*SIZE];\nPoint point[SIZE];\nvector<Edge> edge;\n\n\nvoid init(int first_N){\n\tN = 1;\n\twhile(N < first_N)N *= 2;\n}\n\nvoid update(int loc,ll value,ll index){\n\tloc += N-1;\n\n\ttable[loc].set(value,index);\n\n\tif(N == 1)return;\n\n\tint parent = (loc-1)/2;\n\n\twhile(true){\n\n\t\ttable[parent] = min(table[2*parent+1],table[2*parent+2]);\n\n\t\tif(parent == 0)break;\n\t\telse{\n\t\t\tparent = (parent-1)/2;\n\t\t}\n\t}\n}\n\n\nInfo query(int search_left,int search_right,int node_id,int node_left,int node_right){\n\n\tInfo ret;\n\n\t//今回のノードが検索区間をカバーしていなければ、結果に関係ない値を返す\n\tif(search_right < node_left || search_left > node_right){\n\n\t\tret.set(HUGE_NUM,-1);\n\t\treturn ret;\n\t}\n\n\t//今回のノードの区間が、検索区間の部分区間である場合、今回のノードの値を返す\n\tif(search_left <= node_left && search_right >= node_right){\n\t\treturn table[node_id];\n\t}\n\n\t//今回のノードの区間に、一部検索区間と重なっている区間がある場合→再帰的に子どもに尋ねる\n\tInfo left_min = query(search_left,search_right,2*node_id+1,node_left,(node_left+node_right)/2);\n\tInfo right_min = query(search_left,search_right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\treturn min(left_min,right_min);\n}\n\nint get_boss(int id){\n\tif(boss[id] == id)return id;\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]);\n\t}\n}\n\nint isSame(int x,int y){\n\treturn get_boss(x) == get_boss(y);\n}\n\nvoid unite(int x,int y){\n\tint boss_x = get_boss(x);\n\tint boss_y = get_boss(y);\n\n\tif(boss_x == boss_y)return;\n\n\tif(height[boss_x] > height[boss_y]){\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[boss_x] < height[boss_y]){\n\n\t\tnum_member[boss_y] += num_member[boss_x];\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[boss_x] == height[boss_y]\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\n\nint main(){\n\n\tint first_N;\n\n\tscanf(\"%d\",&first_N);\n\n\tinit(first_N);\n\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tscanf(\"%lld %lld\",&point[i].x,&point[i].y);\n\t\tpoint[i].input_index = i;\n\t}\n\n\n\tint count = 0;\n\n\tfor(int a = 0; a <= 1; a++){\n\t\tfor(int b = 0; b <= 1; b++){\n\t\t\tfor(int c = 0; c <= 1; c++){\n\t\t\t\tfor(int i = 0; i <= 2*N-2; i++){\n\n\t\t\t\t\ttable[i].value = HUGE_NUM;\n\t\t\t\t}\n\n\t\t\t\tstd::vector<int> IND(first_N);\n\t\t\t\tstd::iota(IND.begin(), IND.end(), 0);\n\n\t\t\t\tstd::sort(IND.begin(), IND.end(), [&](int i, int j) {\n\t\t\t\t\tif(point[i].y-point[i].x != point[j].y-point[j].x){\n\n\t\t\t\t\t\treturn point[i].y-point[i].x < point[j].y-point[j].x;\n\t\t\t\t\t}else if(point[i].y != point[j].y){\n\n\t\t\t\t\t\treturn point[i].y > point[j].y;\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\treturn i > j;\n\t\t\t\t\t}\n\t\t\t\t});\n\n\t\t\t\t//y座標sort(セグ木用)\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tD[i].set(point[i].x,point[i].y,point[i].input_index);\n\t\t\t\t}\n\t\t\t\tsort(D,D+first_N);\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tINDEX[D[i].input_index] = i;\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tInfo ret = query(INDEX[IND[i]],first_N,0,0,N-1); //y座標が自分以上のデータの、x+yの最小値を取得\n\t\t\t\t\tif(ret.value != HUGE_NUM){\n\n\n\t\t\t\t\t\t//edge.push_back(Edge(IND[i],ret.index,abs(point[IND[i]].x-point[ret.index].x)+abs(point[IND[i]].y-point[ret.index].y)));\n\t\t\t\t\t\tedge.push_back(Edge(IND[i],ret.index,max(abs(point[IND[i]].x-point[ret.index].x),abs(point[IND[i]].y-point[ret.index].y))));\n\t\t\t\t\t}\n\t\t\t\t\tupdate(INDEX[IND[i]],point[IND[i]].x+point[IND[i]].y,IND[i]);\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\t\t\t\t\tswap(point[i].x,point[i].y);\n\t\t\t\t}\n\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\tpoint[i].x *= -1;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\tpoint[i].y *= -1;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t\tnum_member[i] = 1;\n\t}\n\n\tsort(edge.begin(),edge.end());\n\n\tll ans = 0;\n\n\tvector<Edge> ANS;\n\n\tfor(int i = 0; i < edge.size(); i++){\n\t\tif(isSame(edge[i].a,edge[i].b))continue;\n\n\t\tunite(edge[i].a,edge[i].b);\n\t\tANS.push_back(edge[i]);\n\t\tans += edge[i].cost;\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\t/*for(int i = 0; i < ANS.size(); i++){\n\n\t\tprintf(\"%d %d\\n\",ANS[i].a,ANS[i].b);\n\t}*/\n\treturn 0;\n}", "accuracy": 0.40625, "time_ms": 20, "memory_kb": 4768, "score_of_the_acc": -0.0137, "final_rank": 10 }, { "submission_id": "aoj_0403_5462446", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 200005\n\nstruct Info{\n\tbool operator<(const struct Info& arg) const{\n\n\t\tif(value != arg.value){\n\t\t\treturn value < arg.value;\n\t\t}else{\n\n\t\t\treturn index < arg.index;\n\t\t}\n\t}\n\tvoid set(ll arg_value,ll arg_index){\n\t\tvalue = arg_value;\n\t\tindex = arg_index;\n\t}\n\tll value,index;\n};\n\nstruct DATA{\n\tbool operator<(const struct DATA &arg) const{\n\n\t\treturn y < arg.y;\n\t}\n\tvoid set(ll arg_x,ll arg_y,ll arg_input_index){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t\tinput_index = arg_input_index;\n\t}\n\tll x,y,input_index;\n};\n\nstruct Point{\n\n\tll x,y,input_index;\n};\n\nstruct Edge{\n\tEdge(int arg_a,int arg_b,ll arg_cost){\n\t\ta = arg_a;\n\t\tb = arg_b;\n\t\tcost = arg_cost;\n\t}\n\tbool operator<(const struct Edge& arg) const{\n\n\t\treturn cost < arg.cost;\n\t}\n\tint a,b;\n\tll cost;\n};\n\nint N;\nint boss[SIZE],height[SIZE],num_member[SIZE];\nint INDEX[SIZE];\nDATA D[SIZE];\nInfo table[6*SIZE];\nPoint point[SIZE];\nvector<Edge> edge;\n\n\nvoid init(int first_N){\n\tN = 1;\n\twhile(N < first_N)N *= 2;\n}\n\nvoid update(int loc,ll value,ll index){\n\tloc += N-1;\n\n\ttable[loc].set(value,index);\n\n\tif(N == 1)return;\n\n\tint parent = (loc-1)/2;\n\n\twhile(true){\n\n\t\ttable[parent] = min(table[2*parent+1],table[2*parent+2]);\n\n\t\tif(parent == 0)break;\n\t\telse{\n\t\t\tparent = (parent-1)/2;\n\t\t}\n\t}\n}\n\n\nInfo query(int search_left,int search_right,int node_id,int node_left,int node_right){\n\n\tInfo ret;\n\n\t//今回のノードが検索区間をカバーしていなければ、結果に関係ない値を返す\n\tif(search_right < node_left || search_left > node_right){\n\n\t\tret.set(HUGE_NUM,-1);\n\t\treturn ret;\n\t}\n\n\t//今回のノードの区間が、検索区間の部分区間である場合、今回のノードの値を返す\n\tif(search_left <= node_left && search_right >= node_right){\n\t\treturn table[node_id];\n\t}\n\n\t//今回のノードの区間に、一部検索区間と重なっている区間がある場合→再帰的に子どもに尋ねる\n\tInfo left_min = query(search_left,search_right,2*node_id+1,node_left,(node_left+node_right)/2);\n\tInfo right_min = query(search_left,search_right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\treturn min(left_min,right_min);\n}\n\nint get_boss(int id){\n\tif(boss[id] == id)return id;\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]);\n\t}\n}\n\nint isSame(int x,int y){\n\treturn get_boss(x) == get_boss(y);\n}\n\nvoid unite(int x,int y){\n\tint boss_x = get_boss(x);\n\tint boss_y = get_boss(y);\n\n\tif(boss_x == boss_y)return;\n\n\tif(height[boss_x] > height[boss_y]){\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[boss_x] < height[boss_y]){\n\n\t\tnum_member[boss_y] += num_member[boss_x];\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[boss_x] == height[boss_y]\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\n\nint main(){\n\n\tint first_N;\n\n\tscanf(\"%d\",&first_N);\n\n\tinit(first_N);\n\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tscanf(\"%lld %lld\",&point[i].x,&point[i].y);\n\t\tpoint[i].input_index = i;\n\t}\n\n\n\tint count = 0;\n\n\tfor(int a = 0; a <= 1; a++){\n\t\tfor(int b = 0; b <= 1; b++){\n\t\t\tfor(int c = 0; c <= 1; c++){\n\t\t\t\tfor(int i = 0; i <= 2*N-2; i++){\n\n\t\t\t\t\ttable[i].value = HUGE_NUM;\n\t\t\t\t}\n\n\t\t\t\tstd::vector<int> IND(first_N);\n\t\t\t\tstd::iota(IND.begin(), IND.end(), 0);\n\n\t\t\t\tstd::sort(IND.begin(), IND.end(), [&](int i, int j) {\n\t\t\t\t\tif(point[i].y-point[i].x != point[j].y-point[j].x){\n\n\t\t\t\t\t\treturn point[i].y-point[i].x < point[j].y-point[j].x;\n\t\t\t\t\t}else if(point[i].y != point[j].y){\n\n\t\t\t\t\t\treturn point[i].y > point[j].y;\n\t\t\t\t\t}else{\n\n\t\t\t\t\t\tif(count%2 == 0){\n\n\t\t\t\t\t\t\treturn i < j;\n\t\t\t\t\t\t}else{\n\n\t\t\t\t\t\t\treturn i > j;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t});\n\n\t\t\t\t//y座標sort(セグ木用)\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tD[i].set(point[i].x,point[i].y,point[i].input_index);\n\t\t\t\t}\n\t\t\t\tsort(D,D+first_N);\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tINDEX[D[i].input_index] = i;\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tInfo ret = query(INDEX[IND[i]],first_N,0,0,N-1); //y座標が自分以上のデータの、x+yの最小値を取得\n\t\t\t\t\tif(ret.value != HUGE_NUM){\n\n\n\t\t\t\t\t\t//edge.push_back(Edge(IND[i],ret.index,abs(point[IND[i]].x-point[ret.index].x)+abs(point[IND[i]].y-point[ret.index].y)));\n\t\t\t\t\t\tedge.push_back(Edge(IND[i],ret.index,max(abs(point[IND[i]].x-point[ret.index].x),abs(point[IND[i]].y-point[ret.index].y))));\n\t\t\t\t\t}\n\t\t\t\t\tupdate(INDEX[IND[i]],point[IND[i]].x+point[IND[i]].y,IND[i]);\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\t\t\t\t\tswap(point[i].x,point[i].y);\n\t\t\t\t}\n\n\t\t\t\tcount++;\n\t\t\t}\n\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\tpoint[i].x *= -1;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\tpoint[i].y *= -1;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t\tnum_member[i] = 1;\n\t}\n\n\tsort(edge.begin(),edge.end());\n\n\tll ans = 0;\n\n\tvector<Edge> ANS;\n\n\tfor(int i = 0; i < edge.size(); i++){\n\t\tif(isSame(edge[i].a,edge[i].b))continue;\n\n\t\tunite(edge[i].a,edge[i].b);\n\t\tANS.push_back(edge[i]);\n\t\tans += edge[i].cost;\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\t/*for(int i = 0; i < ANS.size(); i++){\n\n\t\tprintf(\"%d %d\\n\",ANS[i].a,ANS[i].b);\n\t}*/\n\treturn 0;\n}", "accuracy": 0.40625, "time_ms": 20, "memory_kb": 4828, "score_of_the_acc": -0.0141, "final_rank": 11 }, { "submission_id": "aoj_0403_5462362", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 200005\n\nstruct Info{\n\tbool operator<(const struct Info& arg) const{\n\n\t\tif(value != arg.value){\n\t\t\treturn value < arg.value;\n\t\t}else{\n\n\t\t\treturn index < arg.index;\n\t\t}\n\t}\n\tvoid set(ll arg_value,ll arg_index){\n\t\tvalue = arg_value;\n\t\tindex = arg_index;\n\t}\n\tll value,index;\n};\n\nstruct Input{\n\tll x,y;\n};\n\nstruct DATA{\n\tbool operator<(const struct DATA &arg) const{\n\n\t\treturn y < arg.y;\n\t}\n\tvoid set(ll arg_x,ll arg_y,ll arg_input_index){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t\tinput_index = arg_input_index;\n\t}\n\tll x,y,input_index;\n};\n\nstruct Point{\n\tvoid set(ll arg_x,ll arg_y,ll arg_input_index,ll arg_now_index){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t\tinput_index = arg_input_index;\n\t}\n\tbool operator<(const struct Point &arg) const{\n\t\tif(y-x != arg.y-arg.x){\n\n\t\t\treturn (y-x) < (arg.y-arg.x);\n\t\t}else if(y != arg.y){\n\n\t\t\treturn y > arg.y;\n\t\t}else{\n\n\t\t\treturn input_index > arg.input_index;\n\t\t}\n\t}\n\tll x,y,input_index;\n};\n\nstruct Edge{\n\tEdge(int arg_a,int arg_b,ll arg_cost){\n\t\ta = arg_a;\n\t\tb = arg_b;\n\t\tcost = arg_cost;\n\t}\n\tbool operator<(const struct Edge& arg) const{\n\n\t\treturn cost < arg.cost;\n\t}\n\tint a,b;\n\tll cost;\n};\n\nint N;\nint boss[SIZE],height[SIZE],num_member[SIZE];\nint INDEX[SIZE];\nDATA D[SIZE];\nInfo table[6*SIZE];\nInput input[SIZE];\nPoint point[SIZE];\nvector<Edge> edge;\n\n\nvoid init(int first_N){\n\tN = 1;\n\twhile(N < first_N)N *= 2;\n}\n\nvoid update(int loc,ll value,ll index){\n\tloc += N-1;\n\n\ttable[loc].set(value,index);\n\n\tif(N == 1)return;\n\n\tint parent = (loc-1)/2;\n\n\twhile(true){\n\n\t\ttable[parent] = min(table[2*parent+1],table[2*parent+2]);\n\n\t\tif(parent == 0)break;\n\t\telse{\n\t\t\tparent = (parent-1)/2;\n\t\t}\n\t}\n}\n\n\nInfo query(int search_left,int search_right,int node_id,int node_left,int node_right){\n\n\tInfo ret;\n\n\t//今回のノードが検索区間をカバーしていなければ、結果に関係ない値を返す\n\tif(search_right < node_left || search_left > node_right){\n\n\t\tret.set(HUGE_NUM,-1);\n\t\treturn ret;\n\t}\n\n\t//今回のノードの区間が、検索区間の部分区間である場合、今回のノードの値を返す\n\tif(search_left <= node_left && search_right >= node_right){\n\t\treturn table[node_id];\n\t}\n\n\t//今回のノードの区間に、一部検索区間と重なっている区間がある場合→再帰的に子どもに尋ねる\n\tInfo left_min = query(search_left,search_right,2*node_id+1,node_left,(node_left+node_right)/2);\n\tInfo right_min = query(search_left,search_right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\treturn min(left_min,right_min);\n}\n\nint get_boss(int id){\n\tif(boss[id] == id)return id;\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]);\n\t}\n}\n\nint isSame(int x,int y){\n\treturn get_boss(x) == get_boss(y);\n}\n\nvoid unite(int x,int y){\n\tint boss_x = get_boss(x);\n\tint boss_y = get_boss(y);\n\n\tif(boss_x == boss_y)return;\n\n\tif(height[boss_x] > height[boss_y]){\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[boss_x] < height[boss_y]){\n\n\t\tnum_member[boss_y] += num_member[boss_x];\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[boss_x] == height[boss_y]\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\n\nint main(){\n\n\tint first_N;\n\n\tscanf(\"%d\",&first_N);\n\n\tinit(first_N);\n\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tscanf(\"%lld %lld\",&input[i].x,&input[i].y);\n\t\tpoint[i].set(input[i].x,input[i].y,i,i);\n\t}\n\n\n\tfor(int a = 0; a <= 1; a++){\n\t\tfor(int b = 0; b <= 1; b++){\n\t\t\tfor(int c = 0; c <= 1; c++){\n\t\t\t\tfor(int i = 0; i <= 2*N-2; i++){\n\n\t\t\t\t\ttable[i].value = HUGE_NUM;\n\t\t\t\t}\n\n\t\t\t\tstd::vector<int> IND(first_N);\n\t\t\t\tstd::iota(IND.begin(), IND.end(), 0);\n\n\t\t\t\tstd::sort(IND.begin(), IND.end(), [&](int i, int j) {\n\t\t\t\t return (point[i].y - point[i].x < point[j].y - point[j].x) ||\n\t\t\t\t\t\t (point[i].y - point[i].x == point[j].y - point[j].x && point[i].y > point[j].y) ||\n\t\t\t\t\t\t (point[i].y - point[i].x == point[j].y - point[j].x && point[i].y == point[j].y && i > j);\n\t\t\t\t});\n\n\t\t\t\t//y座標sort(セグ木用)\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tD[i].set(point[i].x,point[i].y,point[i].input_index);\n\t\t\t\t}\n\t\t\t\tsort(D,D+first_N);\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tINDEX[D[i].input_index] = i;\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tInfo ret = query(INDEX[IND[i]],first_N,0,0,N-1); //y座標が自分以上のデータの、x+yの最小値を取得\n\t\t\t\t\tif(ret.value != HUGE_NUM){\n\n\n\t\t\t\t\t\t//edge.push_back(Edge(IND[i],ret.index,abs(point[IND[i]].x-point[ret.index].x)+abs(point[IND[i]].y-point[ret.index].y)));\n\t\t\t\t\t\tedge.push_back(Edge(IND[i],ret.index,max(abs(point[IND[i]].x-point[ret.index].x),abs(point[IND[i]].y-point[ret.index].y))));\n\t\t\t\t\t}\n\t\t\t\t\tupdate(INDEX[IND[i]],point[IND[i]].x+point[IND[i]].y,IND[i]);\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\t\t\t\t\tswap(point[i].x,point[i].y);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\tpoint[i].x *= -1;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\tpoint[i].y *= -1;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t\tnum_member[i] = 1;\n\t}\n\n\tsort(edge.begin(),edge.end());\n\n\tll ans = 0;\n\n\tvector<Edge> ANS;\n\n\tfor(int i = 0; i < edge.size(); i++){\n\t\tif(isSame(edge[i].a,edge[i].b))continue;\n\n\t\tunite(edge[i].a,edge[i].b);\n\t\tANS.push_back(edge[i]);\n\t\tans += edge[i].cost;\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\t/*for(int i = 0; i < ANS.size(); i++){\n\n\t\tprintf(\"%d %d\\n\",ANS[i].a,ANS[i].b);\n\t}*/\n\treturn 0;\n}", "accuracy": 0.40625, "time_ms": 20, "memory_kb": 4900, "score_of_the_acc": -0.0147, "final_rank": 12 }, { "submission_id": "aoj_0403_5462335", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 200005\n\nstruct Info{\n\tbool operator<(const struct Info& arg) const{\n\n\t\tif(value != arg.value){\n\t\t\treturn value < arg.value;\n\t\t}else{\n\n\t\t\treturn index > arg.index;\n\t\t}\n\t}\n\tvoid set(ll arg_value,ll arg_index){\n\t\tvalue = arg_value;\n\t\tindex = arg_index;\n\t}\n\tll value,index;\n};\n\nstruct Input{\n\tll x,y;\n};\n\nstruct DATA{\n\tbool operator<(const struct DATA &arg) const{\n\n\t\treturn y < arg.y;\n\t}\n\tvoid set(ll arg_x,ll arg_y,ll arg_input_index){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t\tinput_index = arg_input_index;\n\t}\n\tll x,y,input_index;\n};\n\nstruct Point{\n\tvoid set(ll arg_x,ll arg_y,ll arg_input_index,ll arg_now_index){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t\tinput_index = arg_input_index;\n\t}\n\tbool operator<(const struct Point &arg) const{\n\t\tif(y-x != arg.y-arg.x){\n\n\t\t\treturn (y-x) < (arg.y-arg.x);\n\t\t}else if(y != arg.y){\n\n\t\t\treturn y > arg.y;\n\t\t}else{\n\n\t\t\treturn input_index > arg.input_index;\n\t\t}\n\t}\n\tll x,y,input_index;\n};\n\nstruct Edge{\n\tEdge(int arg_a,int arg_b,ll arg_cost){\n\t\ta = arg_a;\n\t\tb = arg_b;\n\t\tcost = arg_cost;\n\t}\n\tbool operator<(const struct Edge& arg) const{\n\n\t\treturn cost < arg.cost;\n\t}\n\tint a,b;\n\tll cost;\n};\n\nint N;\nint boss[SIZE],height[SIZE],num_member[SIZE];\nint INDEX[SIZE];\nDATA D[SIZE];\nInfo table[6*SIZE];\nInput input[SIZE];\nPoint point[SIZE];\nvector<Edge> edge;\n\n\nvoid init(int first_N){\n\tN = 1;\n\twhile(N < first_N)N *= 2;\n}\n\nvoid update(int loc,ll value,ll index){\n\tloc += N-1;\n\n\ttable[loc].set(value,index);\n\n\tif(N == 1)return;\n\n\tint parent = (loc-1)/2;\n\n\twhile(true){\n\n\t\ttable[parent] = min(table[2*parent+1],table[2*parent+2]);\n\n\t\tif(parent == 0)break;\n\t\telse{\n\t\t\tparent = (parent-1)/2;\n\t\t}\n\t}\n}\n\n\nInfo query(int search_left,int search_right,int node_id,int node_left,int node_right){\n\n\tInfo ret;\n\n\t//今回のノードが検索区間をカバーしていなければ、結果に関係ない値を返す\n\tif(search_right < node_left || search_left > node_right){\n\n\t\tret.set(HUGE_NUM,-1);\n\t\treturn ret;\n\t}\n\n\t//今回のノードの区間が、検索区間の部分区間である場合、今回のノードの値を返す\n\tif(search_left <= node_left && search_right >= node_right){\n\t\treturn table[node_id];\n\t}\n\n\t//今回のノードの区間に、一部検索区間と重なっている区間がある場合→再帰的に子どもに尋ねる\n\tInfo left_min = query(search_left,search_right,2*node_id+1,node_left,(node_left+node_right)/2);\n\tInfo right_min = query(search_left,search_right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\treturn min(left_min,right_min);\n}\n\nint get_boss(int id){\n\tif(boss[id] == id)return id;\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]);\n\t}\n}\n\nint isSame(int x,int y){\n\treturn get_boss(x) == get_boss(y);\n}\n\nvoid unite(int x,int y){\n\tint boss_x = get_boss(x);\n\tint boss_y = get_boss(y);\n\n\tif(boss_x == boss_y)return;\n\n\tif(height[boss_x] > height[boss_y]){\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[boss_x] < height[boss_y]){\n\n\t\tnum_member[boss_y] += num_member[boss_x];\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[boss_x] == height[boss_y]\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\n\nint main(){\n\n\tint first_N;\n\n\tscanf(\"%d\",&first_N);\n\n\tinit(first_N);\n\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tscanf(\"%lld %lld\",&input[i].x,&input[i].y);\n\t\tpoint[i].set(input[i].x,input[i].y,i,i);\n\t}\n\n\n\tfor(int a = 0; a <= 1; a++){\n\t\tfor(int b = 0; b <= 1; b++){\n\t\t\tfor(int c = 0; c <= 1; c++){\n\t\t\t\tfor(int i = 0; i <= 2*N-2; i++){\n\n\t\t\t\t\ttable[i].value = HUGE_NUM;\n\t\t\t\t}\n\n\t\t\t\tstd::vector<int> IND(first_N);\n\t\t\t\tstd::iota(IND.begin(), IND.end(), 0);\n\n\t\t\t\tstd::sort(IND.begin(), IND.end(), [&](int i, int j) {\n\t\t\t\t return (point[i].y - point[i].x < point[j].y - point[j].x) ||\n\t\t\t\t\t\t (point[i].y - point[i].x == point[j].y - point[j].x && point[i].y > point[j].y) ||\n\t\t\t\t\t\t (point[i].y - point[i].x == point[j].y - point[j].x && point[i].y == point[j].y && i > j);\n\t\t\t\t});\n\n\t\t\t\t//y座標sort(セグ木用)\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tD[i].set(point[i].x,point[i].y,point[i].input_index);\n\t\t\t\t}\n\t\t\t\tsort(D,D+first_N);\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tINDEX[D[i].input_index] = i;\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tInfo ret = query(INDEX[IND[i]],first_N,0,0,N-1); //y座標が自分以上のデータの、x+yの最小値を取得\n\t\t\t\t\tif(ret.value != HUGE_NUM){\n\n\n\t\t\t\t\t\t//edge.push_back(Edge(IND[i],ret.index,abs(point[IND[i]].x-point[ret.index].x)+abs(point[IND[i]].y-point[ret.index].y)));\n\t\t\t\t\t\tedge.push_back(Edge(IND[i],ret.index,max(abs(point[IND[i]].x-point[ret.index].x),abs(point[IND[i]].y-point[ret.index].y))));\n\t\t\t\t\t}\n\t\t\t\t\tupdate(INDEX[IND[i]],point[IND[i]].x+point[IND[i]].y,IND[i]);\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\t\t\t\t\tswap(point[i].x,point[i].y);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\tpoint[i].x *= -1;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\tpoint[i].y *= -1;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t\tnum_member[i] = 1;\n\t}\n\n\tsort(edge.begin(),edge.end());\n\n\tll ans = 0;\n\n\tvector<Edge> ANS;\n\n\tfor(int i = 0; i < edge.size(); i++){\n\t\tif(isSame(edge[i].a,edge[i].b))continue;\n\n\t\tunite(edge[i].a,edge[i].b);\n\t\tANS.push_back(edge[i]);\n\t\tans += edge[i].cost;\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\t/*for(int i = 0; i < ANS.size(); i++){\n\n\t\tprintf(\"%d %d\\n\",ANS[i].a,ANS[i].b);\n\t}*/\n\treturn 0;\n}", "accuracy": 0.359375, "time_ms": 20, "memory_kb": 4900, "score_of_the_acc": -0.0147, "final_rank": 15 }, { "submission_id": "aoj_0403_5462330", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 200005\n\nstruct Info{\n\tbool operator<(const struct Info& arg) const{\n\n\t\treturn value < arg.value;\n\t}\n\tvoid set(ll arg_value,ll arg_index){\n\t\tvalue = arg_value;\n\t\tindex = arg_index;\n\t}\n\tll value,index;\n};\n\nstruct Input{\n\tll x,y;\n};\n\nstruct DATA{\n\tbool operator<(const struct DATA &arg) const{\n\n\t\treturn y < arg.y;\n\t}\n\tvoid set(ll arg_x,ll arg_y,ll arg_input_index){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t\tinput_index = arg_input_index;\n\t}\n\tll x,y,input_index;\n};\n\nstruct Point{\n\tvoid set(ll arg_x,ll arg_y,ll arg_input_index,ll arg_now_index){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t\tinput_index = arg_input_index;\n\t}\n\tbool operator<(const struct Point &arg) const{\n\t\tif(y-x != arg.y-arg.x){\n\n\t\t\treturn (y-x) < (arg.y-arg.x);\n\t\t}else if(y != arg.y){\n\n\t\t\treturn y > arg.y;\n\t\t}else{\n\n\t\t\treturn input_index > arg.input_index;\n\t\t}\n\t}\n\tll x,y,input_index;\n};\n\nstruct Edge{\n\tEdge(int arg_a,int arg_b,ll arg_cost){\n\t\ta = arg_a;\n\t\tb = arg_b;\n\t\tcost = arg_cost;\n\t}\n\tbool operator<(const struct Edge& arg) const{\n\n\t\treturn cost < arg.cost;\n\t}\n\tint a,b;\n\tll cost;\n};\n\nint N;\nint boss[SIZE],height[SIZE],num_member[SIZE];\nint INDEX[SIZE];\nDATA D[SIZE];\nInfo table[6*SIZE];\nInput input[SIZE];\nPoint point[SIZE];\nvector<Edge> edge;\n\n\nvoid init(int first_N){\n\tN = 1;\n\twhile(N < first_N)N *= 2;\n}\n\nvoid update(int loc,ll value,ll index){\n\tloc += N-1;\n\n\ttable[loc].set(value,index);\n\n\tif(N == 1)return;\n\n\tint parent = (loc-1)/2;\n\n\twhile(true){\n\n\t\tint L = 2*parent+1,R = 2*parent+2;\n\t\tif(table[L].value <= table[R].value){\n\n\t\t\ttable[parent] = table[L];\n\t\t}else{\n\n\t\t\ttable[parent] = table[R];\n\t\t}\n\n\t\tif(parent == 0)break;\n\t\telse{\n\t\t\tparent = (parent-1)/2;\n\t\t}\n\t}\n}\n\n\nInfo query(int search_left,int search_right,int node_id,int node_left,int node_right){\n\n\tInfo ret;\n\n\t//今回のノードが検索区間をカバーしていなければ、結果に関係ない値を返す\n\tif(search_right < node_left || search_left > node_right){\n\n\t\tret.set(HUGE_NUM,-1);\n\t\treturn ret;\n\t}\n\n\t//今回のノードの区間が、検索区間の部分区間である場合、今回のノードの値を返す\n\tif(search_left <= node_left && search_right >= node_right){\n\t\treturn table[node_id];\n\t}\n\n\t//今回のノードの区間に、一部検索区間と重なっている区間がある場合→再帰的に子どもに尋ねる\n\tInfo left_min = query(search_left,search_right,2*node_id+1,node_left,(node_left+node_right)/2);\n\tInfo right_min = query(search_left,search_right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\tif(left_min.value <= right_min.value){\n\n\t\treturn left_min;\n\t}else{\n\n\t\treturn right_min;\n\t}\n}\n\nint get_boss(int id){\n\tif(boss[id] == id)return id;\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]);\n\t}\n}\n\nint isSame(int x,int y){\n\treturn get_boss(x) == get_boss(y);\n}\n\nvoid unite(int x,int y){\n\tint boss_x = get_boss(x);\n\tint boss_y = get_boss(y);\n\n\tif(boss_x == boss_y)return;\n\n\tif(height[boss_x] > height[boss_y]){\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[boss_x] < height[boss_y]){\n\n\t\tnum_member[boss_y] += num_member[boss_x];\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[boss_x] == height[boss_y]\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\n\nint main(){\n\n\tint first_N;\n\n\tscanf(\"%d\",&first_N);\n\n\tinit(first_N);\n\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tscanf(\"%lld %lld\",&input[i].x,&input[i].y);\n\t\tpoint[i].set(input[i].x,input[i].y,i,i);\n\t}\n\n\n\tfor(int a = 0; a <= 1; a++){\n\t\tfor(int b = 0; b <= 1; b++){\n\t\t\tfor(int c = 0; c <= 1; c++){\n\t\t\t\tfor(int i = 0; i <= 2*N-2; i++){\n\n\t\t\t\t\ttable[i].value = HUGE_NUM;\n\t\t\t\t}\n\n\t\t\t\tstd::vector<int> IND(first_N);\n\t\t\t\tstd::iota(IND.begin(), IND.end(), 0);\n\n\t\t\t\tstd::sort(IND.begin(), IND.end(), [&](int i, int j) {\n\t\t\t\t return (point[i].y - point[i].x < point[j].y - point[j].x) ||\n\t\t\t\t\t\t (point[i].y - point[i].x == point[j].y - point[j].x && point[i].y > point[j].y) ||\n\t\t\t\t\t\t (point[i].y - point[i].x == point[j].y - point[j].x && point[i].y == point[j].y && i > j);\n\t\t\t\t});\n\n\t\t\t\t//y座標sort(セグ木用)\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tD[i].set(point[i].x,point[i].y,point[i].input_index);\n\t\t\t\t}\n\t\t\t\tsort(D,D+first_N);\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tINDEX[D[i].input_index] = i;\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tInfo ret = query(INDEX[IND[i]],first_N,0,0,N-1); //y座標が自分以上のデータの、x+yの最小値を取得\n\t\t\t\t\tif(ret.value != HUGE_NUM){\n\n\n\t\t\t\t\t\t//edge.push_back(Edge(IND[i],ret.index,abs(point[IND[i]].x-point[ret.index].x)+abs(point[IND[i]].y-point[ret.index].y)));\n\t\t\t\t\t\tedge.push_back(Edge(IND[i],ret.index,max(abs(point[IND[i]].x-point[ret.index].x),abs(point[IND[i]].y-point[ret.index].y))));\n\t\t\t\t\t}\n\t\t\t\t\tupdate(INDEX[IND[i]],point[IND[i]].x+point[IND[i]].y,IND[i]);\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\t\t\t\t\tswap(point[i].x,point[i].y);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\tpoint[i].x *= -1;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\tpoint[i].y *= -1;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t\tnum_member[i] = 1;\n\t}\n\n\tsort(edge.begin(),edge.end());\n\n\tll ans = 0;\n\n\tvector<Edge> ANS;\n\n\tfor(int i = 0; i < edge.size(); i++){\n\t\tif(isSame(edge[i].a,edge[i].b))continue;\n\n\t\tunite(edge[i].a,edge[i].b);\n\t\tANS.push_back(edge[i]);\n\t\tans += edge[i].cost;\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\t/*for(int i = 0; i < ANS.size(); i++){\n\n\t\tprintf(\"%d %d\\n\",ANS[i].a,ANS[i].b);\n\t}*/\n\treturn 0;\n}", "accuracy": 0.359375, "time_ms": 10, "memory_kb": 4988, "score_of_the_acc": -0.0044, "final_rank": 13 }, { "submission_id": "aoj_0403_5462212", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 200005\n\nstruct Info{\n\tbool operator<(const struct Info& arg) const{\n\n\t\treturn value < arg.value;\n\t}\n\tvoid set(ll arg_value,ll arg_index){\n\t\tvalue = arg_value;\n\t\tindex = arg_index;\n\t}\n\tll value,index;\n};\n\nstruct Input{\n\tll x,y;\n};\n\nstruct DATA{\n\tbool operator<(const struct DATA &arg) const{\n\n\t\treturn y < arg.y;\n\t}\n\tvoid set(ll arg_x,ll arg_y,ll arg_input_index){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t\tinput_index = arg_input_index;\n\t}\n\tll x,y,input_index;\n};\n\nstruct Point{\n\tvoid set(ll arg_x,ll arg_y,ll arg_input_index,ll arg_now_index){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t\tinput_index = arg_input_index;\n\t\tnow_index = arg_now_index;\n\t}\n\tbool operator<(const struct Point &arg) const{\n\t\tif(y-x != arg.y-arg.x){\n\n\t\t\treturn (y-x) < (arg.y-arg.x);\n\t\t}else if(y != arg.y){\n\n\t\t\treturn y > arg.y;\n\t\t}else{\n\n\t\t\treturn input_index > arg.input_index;\n\t\t}\n\t}\n\tll x,y,input_index,now_index;\n};\n\nstruct Edge{\n\tEdge(int arg_a,int arg_b,ll arg_cost){\n\t\ta = arg_a;\n\t\tb = arg_b;\n\t\tcost = arg_cost;\n\t}\n\tbool operator<(const struct Edge& arg) const{\n\n\t\treturn cost < arg.cost;\n\t}\n\tint a,b;\n\tll cost;\n};\n\nint N;\nint boss[SIZE],height[SIZE],num_member[SIZE];\nint INDEX[SIZE];\nDATA D[SIZE];\nInfo table[6*SIZE];\nInput input[SIZE];\nPoint point[SIZE];\nvector<Edge> edge;\n\n\nvoid init(int first_N){\n\tN = 1;\n\twhile(N < first_N)N *= 2;\n}\n\nvoid update(int loc,ll value,ll index){\n\tloc += N-1;\n\n\ttable[loc].set(value,index);\n\n\tif(N == 1)return;\n\n\tint parent = (loc-1)/2;\n\n\twhile(true){\n\t\ttable[parent] = min(table[2*parent+1],table[2*parent+2]);\n\n\t\tif(parent == 0)break;\n\t\telse{\n\t\t\tparent = (parent-1)/2;\n\t\t}\n\t}\n}\n\n\nInfo query(int search_left,int search_right,int node_id,int node_left,int node_right){\n\n\tInfo ret;\n\n\t//今回のノードが検索区間をカバーしていなければ、結果に関係ない値を返す\n\tif(search_right < node_left || search_left > node_right){\n\n\t\tret.set(HUGE_NUM,-1);\n\t\treturn ret;\n\t}\n\n\t//今回のノードの区間が、検索区間の部分区間である場合、今回のノードの値を返す\n\tif(search_left <= node_left && search_right >= node_right){\n\t\treturn table[node_id];\n\t}\n\n\t//今回のノードの区間に、一部検索区間と重なっている区間がある場合→再帰的に子どもに尋ねる\n\tInfo left_min = query(search_left,search_right,2*node_id+1,node_left,(node_left+node_right)/2);\n\tInfo right_min = query(search_left,search_right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\treturn min(left_min,right_min);\n}\n\n\n\n\nint get_boss(int id){\n\tif(boss[id] == id)return id;\n\telse{\n\t\treturn boss[id] = get_boss(boss[id]);\n\t}\n}\n\nint isSame(int x,int y){\n\treturn get_boss(x) == get_boss(y);\n}\n\nvoid unite(int x,int y){\n\tint boss_x = get_boss(x);\n\tint boss_y = get_boss(y);\n\n\tif(boss_x == boss_y)return;\n\n\tif(height[boss_x] > height[boss_y]){\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\n\t}else if(height[boss_x] < height[boss_y]){\n\n\t\tnum_member[boss_y] += num_member[boss_x];\n\t\tboss[boss_x] = boss_y;\n\n\t}else{ //height[boss_x] == height[boss_y]\n\n\t\tnum_member[boss_x] += num_member[boss_y];\n\t\tboss[boss_y] = boss_x;\n\t\theight[x]++;\n\t}\n}\n\n\nint main(){\n\n\tint first_N;\n\n\tscanf(\"%d\",&first_N);\n\n\tinit(first_N);\n\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tscanf(\"%lld %lld\",&input[i].x,&input[i].y);\n\t\tpoint[i].set(input[i].x,input[i].y,i,i);\n\t}\n\n\n\tfor(int a = 0; a <= 1; a++){\n\t\tfor(int b = 0; b <= 1; b++){\n\t\t\tfor(int c = 0; c <= 1; c++){\n\n\t\t\t\t/*\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tpoint[i].now_index = i;\n\t\t\t\t}\n\n\t\t\t\tsort(point,point+first_N);*/\n\n\t\t\t\tfor(int i = 0; i <= 2*N-2; i++){\n\n\t\t\t\t\ttable[i].value = HUGE_NUM;\n\t\t\t\t}\n\n\t\t\t\tstd::vector<int> IND(first_N);\n\t\t\t\tstd::iota(IND.begin(), IND.end(), 0);\n\n\t\t\t\tstd::sort(IND.begin(), IND.end(), [&](int i, int j) {\n\t\t\t\t return (point[i].y - point[i].x < point[j].y - point[j].x) ||\n\t\t\t\t\t\t (point[i].y - point[i].x == point[j].y - point[j].x && point[i].y > point[j].y) ||\n\t\t\t\t\t\t (point[i].y - point[i].x == point[j].y - point[j].x && point[i].y == point[j].y && i > j);\n\t\t\t\t});\n\n\t\t\t\t//y座標sort(セグ木用)\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tD[i].set(point[i].x,point[i].y,point[i].input_index);\n\t\t\t\t}\n\t\t\t\tsort(D,D+first_N);\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tINDEX[D[i].input_index] = i;\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\t\tInfo ret = query(INDEX[IND[i]],first_N,0,0,N-1); //y座標が自分以上のデータの、x+yの最小値を取得\n\t\t\t\t\tif(ret.value != HUGE_NUM){\n\n\t\t\t\t\t\t//edge.push_back(Edge(a,b,abs(input[a].x-input[b].x)+abs(input[a].y-input[b].y)));\n\t\t\t\t\t\t//edge.push_back(Edge(IND[i],ret.index,abs(point[IND[i]].x-point[ret.index].x)+abs(point[IND[i]].y-point[ret.index].y)));\n\t\t\t\t\t\tedge.push_back(Edge(IND[i],ret.index,max(abs(point[IND[i]].x-point[ret.index].x),abs(point[IND[i]].y-point[ret.index].y))));\n\t\t\t\t\t}\n\t\t\t\t\tupdate(INDEX[IND[i]],point[IND[i]].x+point[IND[i]].y,IND[i]);\n\t\t\t\t}\n\n\t\t\t\tfor(int i = 0; i < first_N; i++){\n\t\t\t\t\tswap(point[i].x,point[i].y);\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\t\tpoint[i].x *= -1;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 0; i < first_N; i++){\n\n\t\t\tpoint[i].y *= -1;\n\t\t}\n\t}\n\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tboss[i] = i;\n\t\theight[i] = 0;\n\t\tnum_member[i] = 1;\n\t}\n\n\tsort(edge.begin(),edge.end());\n\n\tll ans = 0;\n\n\tvector<Edge> ANS;\n\n\tfor(int i = 0; i < edge.size(); i++){\n\t\tif(isSame(edge[i].a,edge[i].b))continue;\n\n\t\tunite(edge[i].a,edge[i].b);\n\t\tANS.push_back(edge[i]);\n\t\tans += edge[i].cost;\n\t}\n\n\tprintf(\"%lld\\n\",ans);\n\t/*for(int i = 0; i < ANS.size(); i++){\n\n\t\tprintf(\"%d %d\\n\",ANS[i].a,ANS[i].b);\n\t}*/\n\treturn 0;\n}", "accuracy": 0.359375, "time_ms": 20, "memory_kb": 5052, "score_of_the_acc": -0.0159, "final_rank": 16 }, { "submission_id": "aoj_0403_5439599", "code_snippet": "//Let's join Kaede Takagaki Fan Club !!\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n#include <ext/pb_ds/assoc_container.hpp>\n#include <ext/pb_ds/tree_policy.hpp>\nusing namespace std;\n//#define int long long\ntypedef long long ll;\ntypedef pair<int,int> P;\ntypedef pair<int,P> P1;\ntypedef pair<P,P> P2;\n#define pu push\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define eps 1e-7\n#define INF 1000000000\n#define a first\n#define b second\n#define fi first\n#define sc second\n#define rng(i,a,b) for(int i=int(a);i<int(b);i++)\n#define rep(i,x) for(int i=0;i<x;i++)\n#define repn(i,x) for(int i=1;i<=x;i++)\n#define SORT(x) sort(x.begin(),x.end())\n#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())\n#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())\n#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())\n#define all(x) x.begin(),x.end()\n#define si(x) int(x.size())\n\n#ifdef LOCAL\n#define dmp(x) cerr<<__LINE__<<\" \"<<#x<<\" \"<<x<<endl\n#else\n#define dmp(x) void(0)\n#endif\n\ntemplate<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}\ntemplate<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}\n\ntemplate<class t> using vc=vector<t>;\n\ntemplate<class t,class u>\nostream& operator<<(ostream& os,const pair<t,u>& p){\n\treturn os<<\"{\"<<p.fi<<\",\"<<p.sc<<\"}\";\n}\n\ntemplate<class t> ostream& operator<<(ostream& os,const vc<t>& v){\n\tos<<\"{\";\n\tfor(auto e:v)os<<e<<\",\";\n\treturn os<<\"}\";\n}\n\ntemplate<class T>\nvoid g(T &a){\n\tcin >> a;\n}\ntemplate<class T>\nvoid o(const T &a,bool space=false){\n\tcout << a << (space?' ':'\\n');\n}\n//ios::sync_with_stdio(false);\nconst ll mod = 1000000007;//998244353\nmt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());\ntemplate<class T>\nvoid add(T&a,T b){\n\ta+=b;\n\tif(a >= mod) a-=mod;\n}\nll modpow(ll x,ll n){\n\tll res=1;\n\twhile(n>0){\n\t\tif(n&1) res=res*x%mod;\n\t\tx=x*x%mod;\n\t\tn>>=1;\n\t}\n\treturn res;\n}\nstruct uf{\n\tvc<int>par, ran;\n\tuf(){}\n\tuf(int n){\n\t\tpar.resize(n+1, 0);\n\t\tiota(all(par), 0);\n\t\tran.resize(n+1, 0);\n\t}\n\tint find(int x){ if(x == par[x]) return x; else return par[x] = find(par[x]); }\n\tvoid unite(int x,int y){\n\t\tx = find(x); y = find(y); if(x==y) return;\n\t\tif(ran[x] < ran[y]) par[x] = y;\n\t\telse{\n\t\t\tpar[y] = x;\n\t\t\tif(ran[x] == ran[y]) ran[x]++;\n\t\t}\n\t}\n\tbool same(int x,int y){ return find(x)==find(y); }\n};\ntemplate<class T>\nvc<P>mn_mst(vc<T>pt){\n\tvc<pair<ll, P>>ret;\n\tint n = pt.size();\n\tvector<P> es;\n\t\n\trep(s, 2){\n\t\trep(t, 2){\n\t\t\tmap<int, int> z;\n\t\t\tvc<int> idx(n);\n\t\t\tiota(all(idx), 0);\n\t\t\tsort(all(idx), [&](int i, int j){\n\t\t\t\treturn pt[i].a + pt[i].b < pt[j].a + pt[j].b;\n\t\t\t});\n\t\t\tfor(auto i:idx){\n\t\t\t\tfor(auto itr=z.lower_bound(-pt[i].b);itr != z.end(); itr = z.erase(itr)){\n\t\t\t\t\tint j = itr -> b;\n\t\t\t\t\tif(pt[i].b-pt[j].b > pt[i].a-pt[j].a) break;\n\t\t\t\t\tret.pb(mp(pt[i].a+pt[i].b-pt[j].a-pt[j].b, mp(i, j)));\n\t\t\t\t}\n\t\t\t\tz[-pt[i].b] = i;\n\t\t\t}\n\t\t\tfor(auto &p:pt) swap(p.a, p.b);\n\t\t}\n\t\tfor(auto &p:pt) p.a *= -1;\n\t}\n\tSORT(ret);\n\tuf x(n);\n\tvc<P>ans;\n\tfor(auto e:ret){\n\t\tif(x.same(e.b.a, e.b.b) == false){\n\t\t\tans.pb(e.b);\n\t\t\tx.unite(e.b.a, e.b.b);\n\t\t}\n\t}\n\treturn ans;\n}\nvoid solve(){\n\tint n; cin >> n;\n\tvc<pair<ll, ll>>za(n);\n\trep(i, n) cin >> za[i].a >> za[i].b;\n\trep(i, n){\n\t\tll u = za[i].a * 2;\n\t\tll v = za[i].b * 2;\n\t\tza[i].a = (u + v) / 2;\n\t\tza[i].b = (u - v) / 2;\n\t}\n\tauto ret = mn_mst(za);\n\tll sum = 0;\n\tfor(auto e:ret){\n\t\tsum += abs(za[e.a].a - za[e.b].a);\n\t\tsum += abs(za[e.a].b - za[e.b].b);\n\t}\n\to(sum/2);\n\t//for(auto e:ret) cout << e.a << \" \" << e.b << '\\n';\n}\nsigned main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(0);\n\tcout<<fixed<<setprecision(20);\n\tint t; t = 1; //cin >> t;\n\twhile(t--) solve();\n}", "accuracy": 1, "time_ms": 140, "memory_kb": 15140, "score_of_the_acc": -0.2255, "final_rank": 2 } ]
aoj_0410_cpp
Akabeko 20 Akabeko 20 is a group that performs at a dedicated theater in the Izua region. Each member of Akabeko 20 is supposed to participate in a performance every certain number of days. Today's performance was attended by all the members. As a producer, you are asked by the members to tell the combination of the members for the upcoming performance. You decide to count the number of combinations of members participating in the performance. Given the number of members of Akabeko 20 and the number of cycles that each member participates in the performance, write a program to count how many combinations of members to participate. Assume that the group will continue to exist forever with the same members. Note that if no one participates, it is not included in the combinations. Input The input is given in the following form. $N$ $p_1$ $p_2$ ... $p_N$ In the first line, the number of members of Akabeko 20 $N$ ($1 \leq N\leq 20$) is given. In the following line, the period $p_i$ ($1 \leq p_i \leq 40$) that each member participates in the performance is given. Output Output the number of combinations of members participating in the performance on one line. Sample Input and Output Sample Input 1 3 3 5 2 Sample Output 1 7 Sample Input 2 3 2 3 6 Sample Output 2 3 There are three types of performances: one where only members with a cycle of 2 days participate, one where only members with a cycle of 3 days participate, and one where members with cycles of 2, 3, and 6 days participate.
[ { "submission_id": "aoj_0410_10875635", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)\n#define all(a) (a).begin(),(a).end()\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n \n int N;\n cin >> N;\n vector<int> p(N);\n rep(i, 0, N) cin >> p[i];\n \n set<ll> S;\n rep(bit, 1, 1 << N) {\n ll L = 1;\n rep(i, 0, N) if ((bit >> i) & 1) L = lcm(L, p[i]);\n S.insert(L);\n }\n cout << S.size() << '\\n';\n}", "accuracy": 1, "time_ms": 440, "memory_kb": 4340, "score_of_the_acc": -1.227, "final_rank": 17 }, { "submission_id": "aoj_0410_10875002", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ld=long double;\n#define fi first\n#define se second\n#define i128 __int128_t\n#define all(x) x.begin(),x.end()\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define si(a) (long)(a.size())\ntemplate<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}\ntemplate<typename T>bool chmax(T&a,T b){return b>a?(a=b,1):0;}\nconst int INF=1e9+100;\nconst long INFL=3e18+100;\nstruct _ {\n _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }\n} __;\n\nint main(){\n int N;\n cin>>N;\n vector<int> P(N);\n rep(i,N)cin>>P[i];\n int ans=0;\n rep(b,1<<N){\n if(b==0) continue;\n unsigned long l=1;\n rep(i,N) if((b>>i)&1) l=l/gcd(l,P[i])*P[i];\n int h=0;\n rep(i,N) if(!((b>>i)&1)) if(l%P[i]==0) h=1;\n ans+=1-h;\n }\n cout<<ans<<\"\\n\";\n}", "accuracy": 1, "time_ms": 270, "memory_kb": 3584, "score_of_the_acc": -0.2972, "final_rank": 3 }, { "submission_id": "aoj_0410_10874290", "code_snippet": "#include<bits/stdc++.h>\n//#include<atcoder/all>\n\nusing namespace std;\n//using namespace atcoder;\n#define rep(i,n) for(ll i=0; i<n; i++)\n#define rrep(i,n) for(ll i=n-1; i>=0; i--)\n#define print(a) cout<<a<<endl\ntypedef long long ll;\n#define yn(flg) if(flg){cout<<\"Yes\"<<endl;}else{cout<<\"No\"<<endl;}\n#define YN(flg) if(flg){cout<<\"YES\"<<endl;}else{cout<<\"NO\"<<endl;}\n#define so(a) sort(a.begin(),a.end())\n#define mp make_pair\n#define vi vector<int>\n#define vl vector<ll>\n#define vs vector<string>\n#define pb push_back\n#define a2i(a,s) (ll)(a-s)\n#define i2a(s,a) (char)(s+a)\n#define ssize(a) a.size()\ntypedef pair<int, int> Pii;\ntypedef pair<int, ll> Pil;\ntypedef pair<pair<ll,ll>,ll> P3;\ntypedef pair<pair<ll,ll>,pair<ll,ll>> P4;\n\ntypedef pair<ll, ll> Pll;\ntypedef pair<ll,Pll> Plll;\ntypedef pair<Pii, int> Piii;\nconst ll INF = 1000000000000000000;\n\ntemplate<class T> inline bool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<class T> inline bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\nll gcd(ll a, ll b){\n if(a%b == 0){\n return b;\n }else{\n return gcd(b, a%b);\n }\n}\n\nll lcm(ll a, ll b){\n return a*b / gcd(a, b);\n}\nset<ll> saiki(ll bit,ll n){\n\tset<ll> s;\n\tfor(ll i=0;i<n;i++){\n\t\tif(bit&(1<<i)){\n\t\t\ts.insert(i);\n\t\t}\n\t}\n\treturn s;\n}\nvector<ll> b[20];\n\nint main(){\n//入力\n\n\tcin.tie(0);\n\tios::sync_with_stdio(0);\n\n\tll n;\n\tcin>>n;\n\tvector<ll> s(n);\n\trep(i,n){\n\t\tcin>>s[i];\n\t}\n\n//前計算\n\tll ans=0;\n//\trep(i,n){\n//\t\trep(j,b[i].size()){\n//\t\t\tcout<<b[i][j]<<\" \";\n//\t\t}\n//\t\tcout<<endl;\n//\t}\n//判定\n\tfor(ll bit=0;bit<(1<<n);bit++){\n\t\tset<ll> S=saiki(bit,n);\n\t\tif(S.size()==0)continue;\n\t\tbool v2=true;\n\t\tll v=1;\n\t\tfor(ll i:S){\n\t\t\tv=lcm(v,s[i]);\n\t\t}\n\t\trep(i,n){\n\t\t\tif(S.find(i)!=S.end())continue;\n\t\t\tif(v%s[i]==0){\n\t\t\t\tv2=false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tif(v2==true)ans++;\n\t}\n\n\tcout<<ans<<endl;\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 690, "memory_kb": 3444, "score_of_the_acc": -0.7889, "final_rank": 12 }, { "submission_id": "aoj_0410_10873430", "code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, l, n) for(int i = int(l); i < int(n); i++)\n#define ll long long\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n\ntemplate<class T> bool chmin(T &a, T b) {if(a > b) {a = b; return true;} return false;}\ntemplate<class T> bool chmax(T &a, T b) {if(a < b) {a = b; return true;} return false;}\ntemplate<class T> using spq = priority_queue<T, vector<T>, greater<T>>;\n\n// bool -> Yes/No\nstring answer(bool b) {return b ? \"Yes\" : \"No\";}\n\nvoid fix(int k) {cout << fixed << setprecision(k);}\n\nconst int inf = 2e9;\nconst long long INF = 2e18;\nconst long double eps = 1e-12;\nint dx[] = {0, -1, 0, 1, -1, -1, 1, 1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};\n\nvoid main_program() {\n int n; cin >> n;\n ll x[n];\n rep(i, 0, n) cin >> x[i];\n int cnt = 0;\n rep(i, 1, 1 << n) {\n ll l = 1;\n rep(j, 0, n) {\n if(i & (1 << j)) {\n l = lcm(l, x[j]);\n }\n }\n bool ok = true;\n rep(j, 0, n) {\n if(i & (1 << j)) {\n continue;\n }\n if(l % x[j] == 0) ok = false;\n }\n if(ok) cnt++;\n }\n cout << cnt << \"\\n\";\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int T = 1;\n //cin >> T;\n while(T--) {\n main_program();\n }\n}", "accuracy": 1, "time_ms": 500, "memory_kb": 3420, "score_of_the_acc": -0.4879, "final_rank": 11 }, { "submission_id": "aoj_0410_10871651", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define rep(i,N) for(int i = 0;i<N;i++)\n#define all(x) x.begin(),x.end()\n#define fi first\n#define se second\nll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}\nint main(){\n ll N;cin>>N;\n vector<ll>P(N);\n rep(i,N)cin>>P[i];\n int ans = 0;\n for(ll x = 1;x<(1<<N);x++){\n ll now = 1;\n rep(j,N){\n if((x&(1<<j))!=0){\n now/=gcd(now,P[j]);\n now*=P[j];\n }\n }\n bool can = true;\n rep(i,N){\n if((x&(1<<i))==0&&now%P[i]==0){\n can = false;\n break;\n }\n }\n if(can)ans++;\n }\n cout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 430, "memory_kb": 3424, "score_of_the_acc": -0.3886, "final_rank": 6 }, { "submission_id": "aoj_0410_10869838", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define ll long long\nconst long long mod=998244353;\nconst long long hmod=46216567629137;\nll gcd(ll a,ll b){\n while(true){\n if(a>b){\n a%=b;\n }\n else{\n b%=a;\n }\n if(a==0) return b;\n if(b==0) return a;\n }\n}\nvector<pair<int,int>>bunkai(int x){\n vector<pair<int,int>>res;\n for(int i=1;i*i<=x;i++){\n int c=0;\n while(x%i==0){\n x/=i;\n c++;\n }\n if(c>0) res.push_back({i,c});\n }\n if(x==1) return res;\n rep(i,res.size()){\n if(res[i].first==x){\n res[i].second++;\n return res;\n }\n }\n res.push_back({x,1});\n return res;\n}\nint main(){\n cin.tie(0)->sync_with_stdio(0);\n cout.tie(0);\n int N;\n cin>>N;\n ll p[N+1];\n for(int i=1;i<=N;i++) cin>>p[i];\n int ans=0;\n for(int i=1;i<(1<<N);i++){\n ll lcm=1;\n for(int j=1;j<=N;j++){\n if((i>>(j-1))&1){\n lcm=lcm*p[j]/gcd(lcm,p[j]);\n }\n }\n bool check=1;\n for(int j=1;j<=N;j++){\n if(!((i>>(j-1))&1)){\n if(lcm%p[j]==0) check=0;\n }\n }\n if(check) ans++;\n }\n cout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 490, "memory_kb": 3368, "score_of_the_acc": -0.4265, "final_rank": 7 }, { "submission_id": "aoj_0410_10863940", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define oke cout << \"Yes\" << '\\n';\n#define dame cout << \"No\" << '\\n';\n#define all(a) a.begin(), a.end()\n#define rall(a) a.rbegin(), a.rend()\nusing HaiI = vector<vector<int>>;\nusing Hai2 = vector<vector<ll>>;\nusing HaiB = vector<vector<bool>>;\nusing Hai3 = vector<vector<vector<ll>>>;\n\nll gcd(ll m,ll n){\n\tif(m<n){\n\t\tswap(m,n);\n\t}\n\twhile(n!=0){\n\t\tm%=n;\n\t\tswap(m,n);\n\t}\n\treturn m;\n}\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tcout << fixed << setprecision(15);\n\tll N;\n\tcin>>N;\n\tvector<ll>A(N);\n\trep(i,N){\n\t\tcin>>A[i];\n\t}\n\tll ans=0;\n\tfor(int i=0;i<(1<<N);i++){\n\t\tll g=-1;\n\t\tfor(int d=0;d<N;d++){\n\t\t\tif(i & (1<<d)){\n\t\t\t\tif(g==-1){\n\t\t\t\t\tg=A[d];\n\t\t\t\t}else{\n\t\t\t\t\tg=g/gcd(A[d],g);\n\t\t\t\t\tg*=A[d];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\tint cut=0;\n\t\tbool ok=true;\n\t\tfor(int d=0;d<N;d++){\n\t\t\tif(!(i & (1<<d))){\n\t\t\t\tif(g%A[d]==0){\n\t\t\t\t\tok=false;\n\t\t\t\t}\n\t\t\t\tcut++;\n\t\t\t}\n\t\t\tif(cut==N){\n\t\t\t\tok=false;\n\t\t\t}\n\t\t}\n\t\tif(ok){\n\t\t\tans++;\n\t\t}\n\t}\n\tcout<<ans<<\"\\n\";\n}", "accuracy": 1, "time_ms": 470, "memory_kb": 3432, "score_of_the_acc": -0.4546, "final_rank": 8 }, { "submission_id": "aoj_0410_10863645", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define oke cout << \"Yes\" << '\\n';\n#define dame cout << \"No\" << '\\n';\n#define all(a) a.begin(), a.end()\n#define rall(a) a.rbegin(), a.rend()\nusing HaiI = vector<vector<int>>;\nusing Hai2 = vector<vector<ll>>;\nusing HaiB = vector<vector<bool>>;\nusing Hai3 = vector<vector<vector<ll>>>;\n\nint gcd(int m,int n){\n\tif(m<n){\n\t\tswap(m,n);\n\t}\n\twhile(n!=0){\n\t\tm%=n;\n\t\tswap(m,n);\n\t}\n\treturn m;\n}\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tcout << fixed << setprecision(15);\n\tll N;\n\tcin>>N;\n\tvector<ll>A(N);\n\trep(i,N){\n\t\tcin>>A[i];\n\t}\n\tll ans=0;\n\tfor(int i=0;i<(1<<N);i++){\n\t\tll g=-1;\n\t\tfor(int d=0;d<N;d++){\n\t\t\tif(i & (1<<d)){\n\t\t\t\tif(g==-1){\n\t\t\t\t\tg=A[d];\n\t\t\t\t}else{\n\t\t\t\t\tg=g*A[d]/gcd(A[d],g);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\tint cut=0;\n\t\tbool ok=true;\n\t\tfor(int d=0;d<N;d++){\n\t\t\tif(!(i & (1<<d))){\n\t\t\t\tif(g%A[d]==0){\n\t\t\t\t\tok=false;\n\t\t\t\t}\n\t\t\t\tcut++;\n\t\t\t}\n\t\t\tif(cut==N){\n\t\t\t\tok=false;\n\t\t\t}\n\t\t}\n\t\tif(ok){\n\t\t\tans++;\n\t\t}\n\t}\n\tcout<<ans<<\"\\n\";\n}", "accuracy": 0.6363636363636364, "time_ms": 410, "memory_kb": 3432, "score_of_the_acc": -0.3664, "final_rank": 19 }, { "submission_id": "aoj_0410_10854811", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll int\n#define INF 1<<30\nvector<pair<ll,ll>> Prime_factorize(ll n){//素因数分解\n vector<pair<ll,ll>> res;\n for(ll i=2;i<=sqrt(n);i++){\n if(n%i==0){\n ll dvisor=i,ex=0;\n while(n%i==0){\n ex++;\n n/=i;\n }\n res.push_back({dvisor,ex});\n }\n }\n if(n!=1)res.push_back({n,1});\n return res;\n}\n\nint main(){\n\n ll n,ans=0;cin>>n;\n vector<ll> a(n);\n vector<map<ll,ll>> b(n);\n for(ll i=0;i<n;i++){\n cin>>a[i];\n vector<pair<ll,ll>> f=Prime_factorize(a[i]);\n for(auto& j:f)b[i][j.first]=j.second;\n }\n for(ll i=1;i<1<<n;i++){\n map<ll,ll> ma;\n for(ll j=0;j<n;j++){\n if(i&(1<<j)){\n for(auto& k:b[j]){\n ma[k.first]=min(ma[k.first],-k.second);\n }\n }\n }\n bool ok=1;\n for(ll j=0;j<n;j++){\n if(!(i&(1<<j))){\n bool sub=0;\n for(auto& k:b[j]){\n if(-ma[k.first]<k.second)sub=1;\n }\n if(!sub)ok=false;\n }\n }\n if(ok)ans++;\n }\n cout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 730, "memory_kb": 3452, "score_of_the_acc": -0.855, "final_rank": 13 }, { "submission_id": "aoj_0410_10854469", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <numbers>\n#include <cassert>\n#include <numeric>\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pint = pair<int, int>;\ntemplate<typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\ntemplate<typename T>\nbool chmax(T & a, const T & b) { if (a < b) { a = b; return true; } return false; }\ntemplate<typename T>\nbool chmin(T & a, const T & b) { if (a > b) { a = b; return true; } return false; }\nconst int inf = 1e9;\nconst ll linf = 1e18;\nconst int dy[] = { 0,0,1,-1 }, dx[] = { 1,-1,0,0 };\nint main() {\n int n; cin >> n;\n vector<int> p(n);\n rep(i, n) cin >> p[i];\n set<ll> st;\n for (int bit = 1; bit < (1 << n); ++bit) {\n ll LCM = 1;\n rep(i, n) {\n if (bit & (1 << i))LCM = lcm(LCM, p[i]);\n }\n st.insert(LCM);\n }\n cout << st.size() << endl;\n}", "accuracy": 1, "time_ms": 230, "memory_kb": 4480, "score_of_the_acc": -1.0441, "final_rank": 14 }, { "submission_id": "aoj_0410_10854467", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <numbers>\n#include <cassert>\n#include <numeric>\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pint = pair<int, int>;\ntemplate<typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\ntemplate<typename T>\nbool chmax(T & a, const T & b) { if (a < b) { a = b; return true; } return false; }\ntemplate<typename T>\nbool chmin(T & a, const T & b) { if (a > b) { a = b; return true; } return false; }\nconst int inf = 1e9;\nconst ll linf = 1e18;\nconst int dy[] = { 0,0,1,-1 }, dx[] = { 1,-1,0,0 };\nint main() {\n int n; cin >> n;\n vector<int> p(n);\n rep(i, n) cin >> p[i];\n set<int> st;\n for (int bit = 1; bit < (1 << n); ++bit) {\n int LCM = 1;\n rep(i, n) {\n if (bit & (1 << i))LCM = lcm(LCM, p[i]);\n }\n st.insert(LCM);\n }\n cout << st.size() << endl;\n}", "accuracy": 0.6363636363636364, "time_ms": 200, "memory_kb": 4480, "score_of_the_acc": -1, "final_rank": 20 }, { "submission_id": "aoj_0410_10843086", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\n\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n\nconst int INF = 1e9 + 1;\nconst ll INFL = 1e18 + 1;\nconst double PI = 3.141592653589793238;\nconst string ABC = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string abc = \"abcdefghijklmnopqrstuvwxyz\";\n\nconst vector<int> dx = {-1, 0, 1, 0};\nconst vector<int> dy = {0, 1, 0, -1};\nconst vector<int> dx8 = {-1, 0, 1, 0, -1, -1, 1, 1};\nconst vector<int> dy8 = {0, 1, 0, -1, -1, 1, 1, -1};\nbool inRange(int i, int N) { return (0 <= i && i < N); }\nbool inField(int i, int j, int H, int W) { return (0 <= i && i < H && 0 <= j && j < W); }\nint encode(int i, int j, int W) { return (i * W + j); }\n\n#define euclid(x1, y1, x2, y2) (((x1) - (x2)) * ((x1) - (x2)) + ((y1) - (y2)) * ((y1) - (y2)))\n#define manhattan(x1, y1, x2, y2) (abs((x1) - (x2)) + abs((y1) - (y2)))\n\nint randInt(int a, int b) { return a + rand() % (b - a + 1); }\ndouble randDouble() { return 1.0 * rand() / RAND_MAX; }\n\nint op(int a, int b) { return max(a, b); }\nint e() { return -INF; }\n\n#define rep(i, n) for(int i = 0;i < (int)(n); i++)\n#define rep1(i, n) for(int i = 1; i <= (int)(n); i++)\n#define chmin(a, b) a = min(a,b)\n#define chmax(a, b) a = max(a,b)\n#define sz(a) ((int) a.size())\n#define Yes cout << \"Yes\" << endl\n#define No cout << \"No\" << endl\n#define YN(a) cout << ((a) ? \"Yes\" : \"No\") << endl\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n\n int N;\n cin >> N;\n\n vector<int> P(N);\n for (int i = 0; i < N; i++) cin >> P[i];\n\n set<ll> st;\n for (int bit = 0; bit < (1 << N); bit++) {\n bool flag = false;\n ll A = 1;\n for (int i = 0; i < N; i++) {\n if ((bit >> i) & 1) {\n flag = true;\n A = lcm(A, P[i]);\n }\n }\n\n if (flag) st.emplace(A);\n }\n\n cout << st.size() << endl;\n}", "accuracy": 1, "time_ms": 440, "memory_kb": 4440, "score_of_the_acc": -1.317, "final_rank": 18 }, { "submission_id": "aoj_0410_10826375", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug_print.hpp>\n#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define debug(...) (static_cast<void>(0))\n#endif\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N;\n cin >> N;\n vector<int> p(N);\n for (int i = 0; i < N; i++) cin >> p[i];\n\n // N 人のメンバーの組合せを bit 全探索\n int ans = 0;\n for (int bit = 1; bit < (1 << N); bit++) {\n // メンバーが bit のとき, 全員が参加する周期 L を求める\n ll L = 1;\n for (int i = 0; i < N; i++) {\n if ((bit >> i) & 1) L = lcm(L, p[i]);\n }\n // bit に含まれないメンバーが L 日の約数周期で参加するとき, bit の組合せは存在しない\n bool flag = true;\n for (int i = 0; i < N; i++) {\n if (!((bit >> i) & 1) && L % p[i] == 0) {\n flag = false;\n }\n }\n\n if (flag) ans++;\n }\n\n cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 260, "memory_kb": 3584, "score_of_the_acc": -0.2825, "final_rank": 2 }, { "submission_id": "aoj_0410_10825237", "code_snippet": "#include <bits/stdc++.h>\n#define asb(a,b) ((a)-(b)>0?(a)-(b):(b)-(a))\n#define atio(v,n) for(int g=0;g<(n);++g)cin >> v[g]\n#define atv(v) for(int g=0;g<((v).size());++g)cin >> v[g]\n#define atdp(v,en) {int bbbbbb=0;for(auto o:v){if(bbbbbb)cout << en;bbbbbb=1;cout << o;}cout << endl;}\n#define atfs(a) printf(\"%lld %lld\\n\",(a).first,(a).second)\n#define ri(n) rp(i,n)\n#define rj(n) rp(j,n)\n#define rk(n) rp(k,n)\n#define rl(n) rp(l,n)\n#define rp(e,c) for(int e=0;e<(c);++e)\n#define rix(s,h) rpx(i,s,h)\n#define rjx(s,h) rpx(j,s,h)\n#define rkx(s,h) rpx(k,s,h)\n#define rlx(s,h) rpx(l,s,h)\n#define rpx(e,s,h) for(int e=s;e<(h);++e)\n#define ci(d,r) ((d)/(r)+(((d)%(r))!=0))\n#define pn {pr(\"No\");return 0;}\n#define py {pr(\"Yes\");return 0;}\n#define pr(a) cout << (a) << endl\n#define sbg(a) sort(bgen(a))\n#define bgen(a) a.begin(),a.end()\n#define INF 114514810\n#define LNF 1ll<<60\n#define upn(a,b) a=min(a,b)\n#define upx(a,b) a=max(a,b)\n#define asr(q,n) (0<=(q) && (q)<(n))\nusing namespace std;\nusing ll=long long;\nusing vi=vector<int>;\nusing vll=vector<ll>;\nusing pii=pair<int,int>;\nusing pll=pair<ll,ll>;\nusing si=set<int>;\nusing sll=set<ll>;\nusing qi=queue<int>;\nusing qll=queue<ll>;\nusing qpii=queue<pii>;\nusing qpll=queue<pll>;\nusing vst=vector<string>;\nusing vsi=vector<si>;\nusing vvi=vector<vi>;\nusing vvl=vector<vll>;\nusing tiii=tuple<int,int,int>;\nusing tlll=tuple<ll,ll,ll>;\nusing mii=map<int,int>;\nusing mll=map<ll,ll>;\nusing stki=stack<int>;\nusing stkll=stack<ll>;\nusing tiis=tuple<int,int,string>;\nusing pdf=pair<pair<int,long double>,pii>;\nint dx[4]={1,0,-1,0};\nint dy[4]={0,-1,0,1};\n\ntemplate <typename T,class Fn>\nstruct sgt{ // 1-indexed\n vector<T> seg;\n int n;\n T d;\n Fn f;\n sgt(vector<T>& n2,T d,Fn f) : n(n2.size()),d(d), f(f){\n int b=n;\n while(!(b&1))b>>=1;\n if(b!=1){\n int c=0;\n b=n;\n while(b){b>>=1;++c;}\n n=1<<c;\n }\n seg=vector<T>(n<<1,d);\n b=n2.size();\n ri(b)seg[n+i]=n2[i];\n b=n;\n while(b>1){\n for(int i=b/2;i<b;++i)seg[i]=f(seg[2*i],seg[2*i+1]);\n b/=2;\n }\n\treturn;\n }\n void update(int pos,T val){\n int i=n+pos;\n seg[i]=val;\n while(i/=2)seg[i]=f(seg[2*i],seg[2*i+1]);\n\treturn;\n }\n T get(int l,int r){\n T tmp=d;\n int p=l;\n int c=0;\n while((p+(1<<c))<=r){\n if(p&(1<<c)){\n tmp=f(tmp,seg[(p>>c)+(n>>c)]);\n p+=1<<c;\n }\n ++c;\n }\n --c;\n while(p<r){\n if((r-p)&(1<<c)){\n tmp=f(tmp,seg[(p>>c)+(n>>c)]);\n p+=(1<<c);\n }\n --c;\n }\n return tmp;\n }\n T get(int pos){\n return seg[n+pos];\n }\n};\n\nll gcd(ll a,ll b){\n if(a==0 || b==0)return 1;\n while(a%=b)swap(a,b);\n return b;\n}\n\nint main(){\n int n;\n cin >> n;\n vi p(n);\n atv(p);\n sort(bgen(p),greater<int>());\n int ans=0;\n ri(1<<n){\n if(!i)continue;\n si s;\n bool f=true;\n ll lcm=1;\n rj(n){\n if((1<<j)&i){\n s.insert(p[j]);\n lcm/=gcd(p[j],lcm);\n lcm*=p[j];\n }else{\n for(int x:s)if(x%p[j]==0){\n f=false;\n break;\n }\n }\n }\n if(f){\n rj(n){\n if(!((1<<j)&i)){\n if(lcm%p[j]==0){\n f=false;\n break;\n }\n }\n }\n }\n if(f){\n ++ans;\n }\n }\n pr(ans);\n}", "accuracy": 1, "time_ms": 880, "memory_kb": 3488, "score_of_the_acc": -1.1079, "final_rank": 16 }, { "submission_id": "aoj_0410_10825181", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define all(T) T.begin(), T.end()\nusing ll = long long;\nusing P = pair<int, int>;\nconst int di[] = {-1, 0, 1, 0};\nconst int dj[] = {0, -1, 0, 1};\n\nint main() {\n ll n;\n cin >> n;\n vector<ll> v(n);\n rep(i, n) cin >> v[i];\n sort(all(v));\n ll ans = 0;\n for (int bit = 1; bit < (1 << n); bit++) {\n bool ok = true;\n ll L = 1;\n rep(i, n) if ((bit >> i) & 1) L = lcm(L, v[i]);\n rep(i, n) if (!((bit >> i) & 1)) if (L % v[i] == 0) ok = false;\n if (ok) {\n // rep(i, n) cout << ((bit >> i) & 1) << endl;\n ans++;\n }\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 270, "memory_kb": 3584, "score_of_the_acc": -0.2972, "final_rank": 3 }, { "submission_id": "aoj_0410_10824999", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug.hpp>\n#else\n#define debug(...)\n#endif\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N;\n cin >> N;\n vector<ll> p(N);\n for (int i = 0; i < N; i++) cin >> p[i];\n\n int ans = 0;\n for (int bit = 1; bit < (1 << N); bit++) {\n ll L = 1;\n for (int i = 0; i < N; i++) {\n if ((bit >> i) & 1) L = lcm(L, p[i]);\n }\n // bit に含まれないメンバーの周期が L の約数の場合, 不可能\n bool ok = true;\n for (int i = 0; i < N; i++) {\n if ((bit >> i) & 1) continue;\n if (L % p[i] == 0) ok = false;\n }\n if (ok) ans++;\n }\n\n cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 280, "memory_kb": 3584, "score_of_the_acc": -0.3119, "final_rank": 5 }, { "submission_id": "aoj_0410_10824945", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#include <atcoder/all>\nusing namespace atcoder;\n\ntemplate <typename T>\nusing vc = vector<T>;\ntemplate <typename T>\nusing vv = vc<vc<T>>;\n\n//-------------1.型系---------------\nusing ll = long long;\nll INF = 2e18;\n\nusing ld = long double;\nusing bl = bool;\nusing mint = modint998244353;\n// using mint = modint1000000007;\n// using mint = modint;\n// mint::set_mod(m);\n\ntemplate <class T>\nusing pq = priority_queue<T, vc<T>>;\ntemplate <class T>\nusing pq_g = priority_queue<T, vc<T>, greater<T>>;\n//-----------------------------------\n\n//-------------2.配列系--------------\n\nusing pii = pair<int, int>;\nusing pll = pair<long long, long long>;\n\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\ntemplate <class T>\nistream &operator>>(istream &i, vc<T> &v)\n{\n rep(j, size(v)) i >> v[j];\n return i;\n}\n\nusing ar2 = array<ll, 2>;\n\n//----------------------------------\n\n//--------3.コード短縮化とか---------\nconst double PI = 3.141592653589793238;\nconst int inf = 1073741823;\nconst ll infl = 1LL << 60;\nconst string ABC = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string abc = \"abcdefghijklmnopqrstuvwxyz\";\n\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\n#define drep(i, n) for (ll i = (n) - 1; i >= 0; --i)\n#define nfor(i, s, n) for (ll i = s; i < n; i++)\n#define dfor(i, s, n) for (ll i = (s) - 1; i >= n; i--)\n\n#define all(a) a.begin(), a.end()\n#define rall(a) a.rbegin(), a.rend()\n\n#define chmax(x, y) x = max(x, y)\n#define chmin(x, y) x = min(x, y)\n\n#define Yes cout << \"Yes\" << endl\n#define No cout << \"No\" << endl\n#define YN \\\n { \\\n cout << \"Yes\" << endl; \\\n } \\\n else \\\n { \\\n cout << \"No\" << endl; \\\n } // if(a==b)YN;\n\n#define vc_unique(v) v.erase(unique(v.begin(), v.end()), v.end());\n#define vc_rotate(v) rotate(v.begin(), v.begin() + 1, v.end());\n\n#define pop_cnt(s) ll(popcount(uint64_t(s)))\n\n#define next_p(v) next_permutation(v.begin(), v.end())\n\n//-------------------------------\n\n//---------4.グリッド系----------\nvector<int> dx = {1, 0, -1, 0}; // dx={1,1,0,-1,-1,-1,0,1};\nvector<int> dy = {0, 1, 0, -1}; // dy={0,1,1,1,0,-1,-1,-1};\n\nbool out_grid(ll i, ll j, ll h, ll w = -1)\n{\n if (w == -1)\n {\n w = h;\n }\n return (!(0 <= i && i < h && 0 <= j && j < w));\n}\n\n#define vvl_rotate(v) \\\n { \\\n ll n = size(v); \\\n vvl nx(n, vl(n)); \\\n rep(i, n) rep(j, n) nx[j][n - i - 1] = v[i][j]; \\\n swap(nx, v); \\\n } // 時計回りに90°回転\n// #define vvl_rotate(v) {ll n = size(v);vvl\n// nx(n,vl(n));rep(i,n)rep(j,n)nx[n-j-1][i]=v[i][j];swap(nx,v);}//反時計周りに90°回転\n\n#define vs_rotate(v) \\\n { \\\n ll n = size(v); \\\n vs nx(n, string(n, '.')); \\\n rep(i, n) rep(j, n) nx[j][n - i - 1] = v[i][j]; \\\n swap(nx, v); \\\n } // 文字列版 時計回りに90°回転\n// #define vs_rotate(v) {ll n = size(v);vs\n// nx(n,string(n,'.'));rep(i,n)rep(j,n)nx[n-j-1][i]=v[i][j];swap(nx,v);}//文字列版　反時計周りに90°回転\n\n#define vvl_transpos(v) \\\n { \\\n ll n = size(v); \\\n vvl nx(n, vl(n)); \\\n rep(i, n) rep(j, n) nx[j][i] = v[i][j]; \\\n swap(nx, v); \\\n }\n#define vs_transpos(v) \\\n { \\\n ll n = size(v); \\\n vs nx(n, string(n, '.')); \\\n rep(i, n) rep(j, n) nx[j][i] = v[i][j]; \\\n swap(nx, v); \\\n }\n\n//--------------------------------\n\n//-----------5.数学系--------------\n#define euclid(x, y) ((x) * (x) + (y) * (y)) // ユークリッド距離 2乗のまま\n#define manhattan(x1, x2, y1, y2) \\\n (abs(x1 - x2) + abs(y1 - y2)) // マンハッタン距離 = |x1-x2|+|y1-y2|\n\ntemplate <class T>\nT tousa_sum1(T l, T d, T r)\n{ // 初項,公差,末項 で総和を求める\n T wide = (r - l) / d + 1;\n return (l + r) * wide / 2;\n}\ntemplate <class T>\nT tousa_sum2(T a, T d, T n)\n{ // 初項,交差,項数 で総和を求める\n return (a * 2 + d * (n - 1)) * n / 2;\n}\nll kousa_kousuu(ll l, ll r, ll d)\n{ // 初項,末項,交差 で等差数列の項数を求める\n return (r - l) / d + 1;\n}\nmint touhi_sum(mint a, mint r,\n ll n)\n{ // 初項,公比,項数で等比数列の総和を求める\n if (r == 1)\n {\n return a * n;\n }\n mint bunsi = a * (r.pow(n) - mint(1));\n mint bunbo = r - 1;\n return bunsi / bunbo;\n}\n\nll nc2(ll x) { return x * (x - 1) / 2; }\nll nc3(ll x) { return x * (x - 1) * (x - 2) / 6; }\n\n//----------------------------------------------\n\n//-----------6.デバックや出力系------------------\nvoid print(ld x) { printf(\"%.20Lf\\n\", x); }\n\n#define print_vec(v) \\\n { \\\n ll n = size(v); \\\n rep(i, n) cout << v[i] << \" \"; \\\n cout << endl; \\\n } // 一次元配列を出力する(改行なし)\n\n#define vc_cout(v) \\\n { \\\n ll n = size(v); \\\n rep(i, n) cout << v[i] << endl; \\\n } // 一次元配列を出力する(改行あり)\n#define vv_cout(v) \\\n { \\\n ll n = size(v); \\\n rep(i, n) \\\n { \\\n rep(j, size(v[i])) { cout << v[i][j] << ' '; } \\\n cout << endl; \\\n } \\\n } // 二次元配列を出力する\n//----------------------------------------------\n\nint main()\n{\n cout << fixed << setprecision(10);\n int n;\n cin >> n;\n vector<ll> p(n);\n cin >> p;\n int ans = 0;\n rep(bit, 1 << n)\n {\n ll v = 1;\n rep(i, n) if (bit & 1 << i) v = lcm(v, p[i]);\n\n if (pop_cnt(bit) == 0)\n continue;\n bool f = true;\n rep(i, n)\n {\n if (!(bit & 1 << i))\n {\n if (v % p[i] == 0)\n f = false;\n }\n }\n if (f)\n ans++;\n }\n cout << ans << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 250, "memory_kb": 3584, "score_of_the_acc": -0.2678, "final_rank": 1 }, { "submission_id": "aoj_0410_10688091", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n int N; cin >> N;\n vector<int> p(N);\n for(int i = 0; i < N; i++) cin >> p[i];\n \n set<long long> st;\n \n for(int bit = 1; bit < (1 << N); bit++){\n long long s = 1;\n for(int i = 0; i < N; i++){\n if(bit >> i & 1) s = lcm(s, p[i]);\n }\n \n st.insert(s);\n }\n \n \n cout << st.size() << endl;\n \n}", "accuracy": 1, "time_ms": 430, "memory_kb": 4160, "score_of_the_acc": -1.0505, "final_rank": 15 }, { "submission_id": "aoj_0410_9642365", "code_snippet": "#include <iostream>\n#include <vector>\n#include <math.h>\n#include <algorithm>\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nll lcm(ll a, ll b) {\n\tll g = gcd(a, b);\n\treturn ((a * b) / g);\n}\nint main() {\n\tint N;cin >> N;\n\tvector<ll> P(N);\n\tint ans = 0;\n\tfor (int i = 0;i < N;i++) cin >> P[i];\n\tfor (int bit = 1;bit < (1 << N);bit++) {\n\t\tll L = 1;\n\t\tfor (int i = 0;i < N;i++) {\n\t\t\tif (bit & (1 << i)) L = lcm(L, P[i]);\n\t\t}\n\t\tbool ret = true;\n\t\tfor (int i = 0;i < N;i++) {\n\t\t\tif (!(bit & (1 << i))) {\n\t\t\t\tif (L % P[i] == 0) ret = false;\n\t\t\t}\n\t\t}\n\t\tif (ret) ans++;\n\t}\n\tcout << ans << endl;\n}", "accuracy": 1, "time_ms": 490, "memory_kb": 3428, "score_of_the_acc": -0.4804, "final_rank": 10 }, { "submission_id": "aoj_0410_9637406", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing vi = vector<int>;\nusing vll = vector<ll>;\nusing vvi = vector<vi>;\nusing vvll = vector<vll>;\nusing vs = vector<string>;\nusing pii = pair<int, int>;\ntemplate<class T> istream &operator>>(istream &is, vector<T> &v) {for (auto &x : v){is >> x;} return is;}\n#define pb emplace_back\n#define all(a) (a).begin(),(a).end()\n#define fi first\n#define se second\n\nconst vector<int> dx = {1, 0, -1, 0};\nconst vector<int> dy = {0, 1, 0, -1};\ntemplate<class T> bool chmin(T &a, T b) {if(a>b) {a=b; return true;} return false;}\ntemplate<class T> bool chmax(T &a, T b) {if(a<b) {a=b; return true;} return false;}\n\nint main() {\n int N; cin >> N;\n vll P(N); cin >> P;\n sort(all(P));\n int ans = 0;\n for (int bits = 1; bits < (1<<N); bits++) {\n ll x = 1;\n for (int i = 0; i < N; i++) {\n if (bits&(1<<i)) x = lcm(x, P[i]);\n }\n bool flag = true;\n for (int i = 0; i < N; i++) {\n if (!(bits&(1<<i)) && x%P[i]==0) flag = false;\n }\n if (flag) ans++;\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 490, "memory_kb": 3424, "score_of_the_acc": -0.4768, "final_rank": 9 } ]
aoj_0411_cpp
Arrows $L$ squares are lined up in a row on the left and right. The pieces are placed on top of some of the squares. Each piece is marked with an arrow pointing to the left or to the right. No more than one piece can be placed on a single square. A piece in any square can be moved to an unoccupied square, but it can only be moved to an adjacent square and only one piece can be moved at a time. A piece can be moved to the left or to the right regardless of the direction of the arrow. However, if a piece is moved once in the direction of the arrow, one point is obtained, but if it is moved once in the opposite direction, one point is deducted. In addition, it is known that there is always a maximum number of points that can be scored, no matter what the starting situation is. Given the number of squares and the situation of the pieces, write a program that calculates the maximum number of points that can be obtained. However, we assume that the squares are assigned numbers from 1 to $L$, starting from the left end of the column. Input The input is given in the following form. $N$ $L$ $p_1$ $d_1$ $p_2$ $d_2$ : $p_N$ $d_N$ The first line gives the number of pieces $N$ ($1 \leq N \leq 10^5$) and the number of squares $L$ ($N \leq L\leq 10^9$). The next $N$ lines give the number of squares where the pieces are placed $p_i$ ($1 \leq p_i\leq L$), and the direction of the arrows on the pieces $d_i$ (0 or 1). When $d_i$ is 0, the arrow is facing left, and when $d_i$ is 1, it is facing right. The same square number cannot be given (for $i \ne j$, $p_i \ne p_j$). Output Output the maximum number of points that can be obtained in a line. Sample Input and Output Sample Input 1 2 10 3 0 6 1 Sample Output 1 6 Sample Input 2 2 8 2 1 8 0 Sample Output 2 5 Sample Input 3 2 8 1 0 8 1 Sample Output 3 0
[ { "submission_id": "aoj_0411_10873461", "code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, l, n) for(int i = int(l); i < int(n); i++)\n#define ll long long\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n\ntemplate<class T> bool chmin(T &a, T b) {if(a > b) {a = b; return true;} return false;}\ntemplate<class T> bool chmax(T &a, T b) {if(a < b) {a = b; return true;} return false;}\ntemplate<class T> using spq = priority_queue<T, vector<T>, greater<T>>;\n\n// bool -> Yes/No\nstring answer(bool b) {return b ? \"Yes\" : \"No\";}\n\nvoid fix(int k) {cout << fixed << setprecision(k);}\n\nconst int inf = 2e9;\nconst long long INF = 2e18;\nconst long double eps = 1e-12;\nint dx[] = {0, -1, 0, 1, -1, -1, 1, 1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};\n\nvoid main_program() {\n int n; ll m; cin >> n >> m;\n pair<int, int> p[n];\n rep(i, 0, n) cin >> p[i].first >> p[i].second;\n sort(p, p + n);\n ll x[n]; int w[n];\n ll to[n];\n rep(i, 0, n) {\n x[i] = p[i].first;\n w[i] = p[i].second;\n to[i] = -1;\n }\n int cnt = 0, cur = 0, len = 0;\n rep(i, 0, n) {\n len++; cur++;\n if(w[i]) cnt--;\n else cnt++;\n if(cnt >= 0) {\n rep(j, 0, len) to[i - j] = cur - j;\n len = 0;\n cnt = 0;\n }\n }\n cnt = 0, cur = m + 1, len = 0;\n for(int i = n - 1; i >= 0; i--) {\n if(to[i] != -1) break;\n len++; cur--;\n if(w[i]) cnt++;\n else cnt--;\n if(cnt >= 0) {\n rep(j, 0, len) to[i + j] = cur + j;\n len = 0;\n cnt = 0;\n }\n }\n ll sum = 0;\n rep(i, 0, n) {\n if(w[i]) {\n sum += to[i] - x[i];\n }\n else {\n sum += x[i] - to[i];\n }\n }\n cout << sum << \"\\n\";\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int T = 1;\n //cin >> T;\n while(T--) {\n main_program();\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 6084, "score_of_the_acc": -0.5264, "final_rank": 7 }, { "submission_id": "aoj_0411_10871755", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define rep(i,N) for(int i = 0;i<(int)N;i++)\n#define all(x) x.begin(),x.end()\n#define fi first\n#define se second\n#define pb push_back \nll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}\n\nint main(){\n ll N,L;cin>>N>>L;\n vector<pair<ll,ll>>X(N);\n rep(i,N)cin>>X[i].fi>>X[i].se;\n sort(all(X));\n vector<ll>LS(N+1,0),RS(N+1,0);\n rep(i,N){\n ll k = 1;\n if(X[i].se==1)k=-1;\n LS[i+1]=LS[i]+k*(X[i].fi-i-1);\n }\n for(int i = N;i>0;i--){\n ll k = 1;\n if(X[i-1].se==0)k=-1;\n // cout<<k<<i-1<<X[i-1].se<<endl;\n RS[i-1]=RS[i]+k*(L-(N-i)-X[i-1].fi);\n }\n ll ans = 0;\n rep(i,N+1){\n // cout<<LS[i]<<\" \"<<RS[i]<<endl;\n ans = max(ans,LS[i]+RS[i]);\n }\n cout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 6124, "score_of_the_acc": -1.0351, "final_rank": 19 }, { "submission_id": "aoj_0411_10869879", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define ll long long\nconst long long mod=998244353;\nconst long long hmod=46216567629137;\nint main(){\n cin.tie(0)->sync_with_stdio(0);\n cout.tie(0);\n int N;\n ll L;\n cin>>N>>L;\n pair<int,bool>pd[N+1];\n for(int i=1;i<=N;i++){\n cin>>pd[i].first>>pd[i].second;\n }\n sort(pd+1,pd+N+1);\n ll ans=-2e18;\n ll cnt=0;\n for(int i=N;i>=1;i--){\n ll mokuteki=L-(N-i);\n if(pd[i].second){\n cnt+=mokuteki-pd[i].first;\n }\n else{\n cnt-=mokuteki-pd[i].first;\n }\n }\n ans=cnt;\n for(int i=1;i<=N;i++){\n ll mokuteki=i;\n ll last=L-(N-i);\n if(pd[i].second){\n cnt-=last-mokuteki;\n }\n else{\n cnt+=last-mokuteki;\n }\n ans=max(ans,cnt);\n }\n cout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4104, "score_of_the_acc": -0.0914, "final_rank": 1 }, { "submission_id": "aoj_0411_10854830", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define INF 1LL<<30\nint main(){\n\n ll n,l,ans=0,sub;cin>>n>>l;sub=l;\n vector<pair<ll,ll>> dat(n);\n vector<ll> dpl(n+1,0),dpr(n+1,0);\n for(auto& i:dat)cin>>i.first>>i.second;\n sort(dat.begin(),dat.end());\n for(ll i=n-1;i>=0;i--){\n ans+=(sub-dat[i].first)*(dat[i].second?1:-1);\n sub--;\n dpr[i]=ans;\n }sub=1;\n ans=0;\n for(ll i=0;i<n;i++){\n ans+=(dat[i].first-sub)*(dat[i].second?-1:1);\n sub++;\n dpl[i+1]=ans;\n }ans=0;\n for(ll i=0;i<=n;i++){\n ans=max(ans,dpl[i]+dpr[i]);\n }\n cout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 6080, "score_of_the_acc": -1.0255, "final_rank": 18 }, { "submission_id": "aoj_0411_10854685", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <numbers>\n#include <cassert>\n#include <numeric>\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pint = pair<int, int>;\ntemplate<typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\ntemplate<typename T>\nbool chmax(T & a, const T & b) { if (a < b) { a = b; return true; } return false; }\ntemplate<typename T>\nbool chmin(T & a, const T & b) { if (a > b) { a = b; return true; } return false; }\nconst int inf = 1e9;\nconst ll linf = 1e18;\nconst int dy[] = { 0,0,1,-1 }, dx[] = { 1,-1,0,0 };\nint main() {\n int n, l; cin >> n >> l;\n vector<pint> koma(n);\n rep(i, n)cin >> koma[i].first >> koma[i].second;\n sort(koma.begin(), koma.end());\n vector<ll> dp_l(n + 1), dp_r(n + 1);\n for (int i = 1; i <= n; ++i) {\n auto& [p, d] = koma[i - 1];\n dp_l[i] = dp_l[i - 1];\n if (d) dp_l[i] -= p - i;\n else dp_l[i] += p - i;\n }\n for (int i = 1; i <= n; ++i) {\n auto& [p, d] = koma[n - i];\n dp_r[i] = dp_r[i - 1];\n if (d) dp_r[i] += l - i + 1 - p;\n else dp_r[i] -= l - i + 1 - p;\n }\n ll ans = 0;\n rep(i, n + 1) {\n chmax(ans, dp_l[i] + dp_r[n - i]);\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 5760, "score_of_the_acc": -0.7052, "final_rank": 11 }, { "submission_id": "aoj_0411_10825034", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#include <atcoder/all>\nusing namespace atcoder;\n\ntemplate <typename T>\nusing vc = vector<T>;\ntemplate <typename T>\nusing vv = vc<vc<T>>;\n\n//-------------1.型系---------------\nusing ll = long long;\nll INF = 2e18;\n\nusing ld = long double;\nusing bl = bool;\nusing mint = modint998244353;\n// using mint = modint1000000007;\n// using mint = modint;\n// mint::set_mod(m);\n\ntemplate <class T>\nusing pq = priority_queue<T, vc<T>>;\ntemplate <class T>\nusing pq_g = priority_queue<T, vc<T>, greater<T>>;\n//-----------------------------------\n\n//-------------2.配列系--------------\n\nusing pii = pair<int, int>;\nusing pll = pair<long long, long long>;\n\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\ntemplate <class T>\nistream &operator>>(istream &i, vc<T> &v)\n{\n rep(j, size(v)) i >> v[j];\n return i;\n}\n\nusing ar2 = array<ll, 2>;\n\n//----------------------------------\n\n//--------3.コード短縮化とか---------\nconst double PI = 3.141592653589793238;\nconst int inf = 1073741823;\nconst ll infl = 1LL << 60;\nconst string ABC = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string abc = \"abcdefghijklmnopqrstuvwxyz\";\n\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\n#define drep(i, n) for (ll i = (n) - 1; i >= 0; --i)\n#define nfor(i, s, n) for (ll i = s; i < n; i++)\n#define dfor(i, s, n) for (ll i = (s) - 1; i >= n; i--)\n\n#define all(a) a.begin(), a.end()\n#define rall(a) a.rbegin(), a.rend()\n\n#define chmax(x, y) x = max(x, y)\n#define chmin(x, y) x = min(x, y)\n\n#define Yes cout << \"Yes\" << endl\n#define No cout << \"No\" << endl\n#define YN \\\n { \\\n cout << \"Yes\" << endl; \\\n } \\\n else \\\n { \\\n cout << \"No\" << endl; \\\n } // if(a==b)YN;\n\n#define vc_unique(v) v.erase(unique(v.begin(), v.end()), v.end());\n#define vc_rotate(v) rotate(v.begin(), v.begin() + 1, v.end());\n\n#define pop_cnt(s) ll(popcount(uint64_t(s)))\n\n#define next_p(v) next_permutation(v.begin(), v.end())\n\n//-------------------------------\n\n//---------4.グリッド系----------\nvector<int> dx = {1, 0, -1, 0}; // dx={1,1,0,-1,-1,-1,0,1};\nvector<int> dy = {0, 1, 0, -1}; // dy={0,1,1,1,0,-1,-1,-1};\n\nbool out_grid(ll i, ll j, ll h, ll w = -1)\n{\n if (w == -1)\n {\n w = h;\n }\n return (!(0 <= i && i < h && 0 <= j && j < w));\n}\n\n#define vvl_rotate(v) \\\n { \\\n ll n = size(v); \\\n vvl nx(n, vl(n)); \\\n rep(i, n) rep(j, n) nx[j][n - i - 1] = v[i][j]; \\\n swap(nx, v); \\\n } // 時計回りに90°回転\n// #define vvl_rotate(v) {ll n = size(v);vvl\n// nx(n,vl(n));rep(i,n)rep(j,n)nx[n-j-1][i]=v[i][j];swap(nx,v);}//反時計周りに90°回転\n\n#define vs_rotate(v) \\\n { \\\n ll n = size(v); \\\n vs nx(n, string(n, '.')); \\\n rep(i, n) rep(j, n) nx[j][n - i - 1] = v[i][j]; \\\n swap(nx, v); \\\n } // 文字列版 時計回りに90°回転\n// #define vs_rotate(v) {ll n = size(v);vs\n// nx(n,string(n,'.'));rep(i,n)rep(j,n)nx[n-j-1][i]=v[i][j];swap(nx,v);}//文字列版　反時計周りに90°回転\n\n#define vvl_transpos(v) \\\n { \\\n ll n = size(v); \\\n vvl nx(n, vl(n)); \\\n rep(i, n) rep(j, n) nx[j][i] = v[i][j]; \\\n swap(nx, v); \\\n }\n#define vs_transpos(v) \\\n { \\\n ll n = size(v); \\\n vs nx(n, string(n, '.')); \\\n rep(i, n) rep(j, n) nx[j][i] = v[i][j]; \\\n swap(nx, v); \\\n }\n\n//--------------------------------\n\n//-----------5.数学系--------------\n#define euclid(x, y) ((x) * (x) + (y) * (y)) // ユークリッド距離 2乗のまま\n#define manhattan(x1, x2, y1, y2) \\\n (abs(x1 - x2) + abs(y1 - y2)) // マンハッタン距離 = |x1-x2|+|y1-y2|\n\ntemplate <class T>\nT tousa_sum1(T l, T d, T r)\n{ // 初項,公差,末項 で総和を求める\n T wide = (r - l) / d + 1;\n return (l + r) * wide / 2;\n}\ntemplate <class T>\nT tousa_sum2(T a, T d, T n)\n{ // 初項,交差,項数 で総和を求める\n return (a * 2 + d * (n - 1)) * n / 2;\n}\nll kousa_kousuu(ll l, ll r, ll d)\n{ // 初項,末項,交差 で等差数列の項数を求める\n return (r - l) / d + 1;\n}\nmint touhi_sum(mint a, mint r,\n ll n)\n{ // 初項,公比,項数で等比数列の総和を求める\n if (r == 1)\n {\n return a * n;\n }\n mint bunsi = a * (r.pow(n) - mint(1));\n mint bunbo = r - 1;\n return bunsi / bunbo;\n}\n\nll nc2(ll x) { return x * (x - 1) / 2; }\nll nc3(ll x) { return x * (x - 1) * (x - 2) / 6; }\n\n//----------------------------------------------\n\n//-----------6.デバックや出力系------------------\nvoid print(ld x) { printf(\"%.20Lf\\n\", x); }\n\n#define print_vec(v) \\\n { \\\n ll n = size(v); \\\n rep(i, n) cout << v[i] << \" \"; \\\n cout << endl; \\\n } // 一次元配列を出力する(改行なし)\n\n#define vc_cout(v) \\\n { \\\n ll n = size(v); \\\n rep(i, n) cout << v[i] << endl; \\\n } // 一次元配列を出力する(改行あり)\n#define vv_cout(v) \\\n { \\\n ll n = size(v); \\\n rep(i, n) \\\n { \\\n rep(j, size(v[i])) { cout << v[i][j] << ' '; } \\\n cout << endl; \\\n } \\\n } // 二次元配列を出力する\n//----------------------------------------------\n\nint main()\n{\n cout << fixed << setprecision(10);\n int n, m;\n cin >> n >> m;\n vector<pll> a(n);\n rep(i, n)\n {\n cin >> a[i].first >> a[i].second, a[i].first--;\n if (a[i].second == 1)\n a[i].second = -1;\n else\n a[i].second = 1;\n }\n sort(all(a));\n vector<ll> l(n), r(n);\n rep(i, n)\n {\n l[i] = (a[i].first - i) * a[i].second;\n r[i] = (m - a[i].first - (n - i)) * -a[i].second;\n }\n ll ans = accumulate(all(l), 0LL);\n ll sum = ans;\n drep(i, n)\n {\n sum += r[i] - l[i];\n chmax(ans, sum);\n }\n cout << ans << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 6528, "score_of_the_acc": -0.8739, "final_rank": 15 }, { "submission_id": "aoj_0411_9642174", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing pint = pair<int,int>;\nusing pll = pair<long long, long long>;\n\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)\nint inf = 2147483647; // おおよそ2*10^9\nll INF = 9223372036854775807; //おおよそ9*10^18\n//ull UINF == おおよそ1.8*10^19\nint main(){\n int n,l;\n cin >> n >> l;\n vector<pint> a(n);\n vector<int> cnt(2,0);\n bool check = true;\n rep(i,n){\n cin >> a[i].first >> a[i].second;\n a[i].first--;\n }\n sort(a.begin(),a.end());\n ll ans = 0;\n ll x = 0;\n rep(i,n){\n if(a[i].second){\n ans -= a[i].first - i;\n }else{\n ans += a[i].first - i;\n }\n }\n x = ans;\n rep(i,n){\n if(a[n-i-1].second){\n x += l - n;\n }else{\n x -= l - n;\n }\n ans = max(ans,x);\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3688, "score_of_the_acc": -0.5, "final_rank": 6 }, { "submission_id": "aoj_0411_9640915", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int n;\n long long l;\n cin >> n >> l;\n vector<pair<long long,int>> p(n);\n for(int i=0;i<n;i++){\n cin >> p[i].first >> p[i].second;\n }\n sort(p.begin(),p.end());\n int left=0,right=n-1;\n long long ans=0;\n while(!p[left].second&&left<n){\n ans+=p[left].first-left-1;\n left++;\n }\n while(p[right].second&&right>=0){\n ans+=l-p[right].first-(n-right-1);\n right--;\n }\n int lcount=0,rcount=0;\n int q=left;\n while(left<right){\n while(p[left].second&&left<n){\n rcount++;\n left++;\n }\n while(!p[left].second&&left<n){\n lcount++;\n left++;\n }\n if(lcount>=rcount){\n for(int i=q;i<left;i++){\n if(p[i].second){\n ans+=-1*(p[i].first-i-1);\n }else{\n ans+=p[i].first-i-1;\n }\n }\n lcount=0;\n rcount=0;\n q=left;\n }\n }\n for(int i=right;i>=q;i--){\n if(p[i].second){\n ans+=l-p[i].first-(n-1-i);\n }else{\n ans+=-1*(l-p[i].first-(n-1-i));\n }\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 4608, "score_of_the_acc": -0.7021, "final_rank": 10 }, { "submission_id": "aoj_0411_9637556", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing vi = vector<int>;\nusing vll = vector<ll>;\nusing vvi = vector<vi>;\nusing vvll = vector<vll>;\nusing vs = vector<string>;\nusing pii = pair<int, int>;\ntemplate<class T> istream &operator>>(istream &is, vector<T> &v) {for (auto &x : v){is >> x;} return is;}\n#define pb emplace_back\n#define all(a) (a).begin(),(a).end()\n#define fi first\n#define se second\n\nconst vector<int> dx = {1, 0, -1, 0};\nconst vector<int> dy = {0, 1, 0, -1};\ntemplate<class T> bool chmin(T &a, T b) {if(a>b) {a=b; return true;} return false;}\ntemplate<class T> bool chmax(T &a, T b) {if(a<b) {a=b; return true;} return false;}\n\nint main() {\n int N, L; cin >> N >> L;\n vector<pii> p(N);\n for (auto& P: p) {\n cin >> P.fi >> P.se;\n }\n sort(all(p));\n \n vll Ld(N+1, 0), Rd(N+1, 0);\n for (int i = 0; i < N; i++) {\n Ld[i+1] = Ld[i];\n if (p[i].se==0) Ld[i+1] += p[i].fi-i-1;\n else Ld[i+1] -= p[i].fi-i-1;\n }\n for (int i = N-1; i >= 0; i--) {\n Rd[i] = Rd[i+1];\n if (p[i].se==1) Rd[i] += L+i-N+1-p[i].fi;\n else Rd[i] -= L+i-N+1-p[i].fi;\n }\n ll ans = 0;\n for (int i = 0; i < N+1; i++) chmax(ans, Ld[i]+Rd[i]);\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 5348, "score_of_the_acc": -0.8647, "final_rank": 14 }, { "submission_id": "aoj_0411_9624523", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing i64 = long long;\n#define rep(i, a, b) for (int i = a; i < b; i++)\n\nint main() {\n int n, l;\n cin >> n >> l;\n vector<pair<int, int>> pieces(n);\n rep (i, 0, n) {\n cin >> pieces[i].first >> pieces[i].second;\n pieces[i].first--;\n }\n\n sort(begin(pieces), end(pieces));\n\n i64 res = 0;\n i64 left = 0, right = 0;\n\n rep (mid, -1, n) {\n if (mid == -1) {\n rep (i, 0, n) {\n if (pieces[i].second == 0) right -= l - n + i - pieces[i].first;\n if (pieces[i].second == 1) right += l - n + i - pieces[i].first;\n }\n res = max(res, left + right);\n continue;\n }\n if (pieces[mid].second == 0) {\n right += l - n + mid - pieces[mid].second;\n left += pieces[mid].second - mid;\n }\n if (pieces[mid].second == 1) {\n right -= l - n + mid - pieces[mid].second;\n left -= pieces[mid].second - mid;\n }\n res = max(res, left + right);\n }\n cout << res << endl;\n return 0;\n}\n// converted!!", "accuracy": 1, "time_ms": 30, "memory_kb": 3852, "score_of_the_acc": -0.536, "final_rank": 8 }, { "submission_id": "aoj_0411_9596426", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define VVL vector<vector<long long>>\n#define VL vector<long long>\n#define rep(i,n) for(long long i = 0; i < n; i++)\n#define Rrep(i,n) for(long long i = n-1; i >= 0; i--)\n#define ld long double\nconst long long llmax = 9223372036854775807;\nconst int intmax = 2147483647;\nconst ll ll1 = 1;\n\nint main(){\n //cout << fixed << setprecision(0);\n //指数表記になったときに弄って使う\n long long n, m;\n long long a, b;\n long long i, j, k;\n long long count = 0, ans = 0;\n string s, t;\n cin >> n >> m;\n vector<pair<ll,ll>> l(n);\n rep(i,n){\n cin >> l.at(i).first >> l.at(i).second;\n }\n sort(l.begin(),l.end());\n VL lg(n,0), rg(n,0);\n if(l.at(0).second == 0){\n lg.at(0) = l.at(0).first - 1;\n }else{\n lg.at(0) = (l.at(0).first - 1) * -1;\n }\n if(l.at(n-1).second == 1){\n rg.at(n-1) = m - l.at(n-1).first;\n }else{\n rg.at(n-1) = (m - l.at(n-1).first) * -1;\n }\n for(i = 1; i < n; i++){\n if(l.at(i).second == 0){\n lg.at(i) = lg.at(i-1) + (l.at(i).first - 1 - i);\n }else{\n lg.at(i) = lg.at(i-1) + (l.at(i).first - 1 - i) * -1;\n }\n }\n for(i = n-2; i >= 0; i--){\n if(l.at(i).second == 1){\n rg.at(i) = rg.at(i+1) + (m - l.at(i).first - n + i + 1);\n }else{\n rg.at(i) = rg.at(i+1) + (m - l.at(i).first - n + i + 1) *-1;\n }\n }/*testcodeなので後で消す\n rep(i,n){\n cout << lg.at(i) << ' ';\n }\n cout << endl;\n rep(i,n){\n cout << rg.at(i) << ' ';\n }\n cout << endl;*/\n ans = max(rg.at(0), ans);\n ans = max(lg.at(n-1), ans);\n for(i = 1; i < n; i++){\n ans = max(rg.at(i) + lg.at(i-1), ans);\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 6036, "score_of_the_acc": -1.0158, "final_rank": 17 }, { "submission_id": "aoj_0411_9566134", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tlong long n,l;\n\tcin >> n >> l;\n\tvector<pair<long long,long long>> a(n);\n\tfor(long long i = 0ll;i < n;i++){\n\t\tcin >> a[i].first >> a[i].second;\n\t}\n\tsort(a.begin(),a.end());\n\tvector<long long> t(n,0ll);\n\t{\n\t\tlong long now = 0ll;\n\t\tfor(long long i = n - 1ll;i >= 0ll;i--){\n\t\t\tif(a[i].second == 0ll){\n\t\t\t\tnow -= l - a[i].first - (n - 1ll - i);\n\t\t\t}else{\n\t\t\t\tnow += l - a[i].first - (n - 1ll - i);\n\t\t\t}\n\t\t\tif(i != n - 1ll){\n\t\t\t\tt[i] = t[i + 1ll];\n\t\t\t}\n\t\t\tt[i] = max(t[i],now);\n\t\t}\n\t}\n\tlong long ans = t[0ll];\n\tlong long now = 0ll;\n\tfor(long long i = 0ll;i < n;i++){\n\t\tif(a[i].second == 0ll){\n\t\t\tnow += a[i].first - i - 1ll;\n\t\t}else{\n\t\t\tnow -= a[i].first - i - 1ll;\n\t\t}\n\t\tif(i == n - 1ll){\n\t\t\tans = max(ans,now);\n\t\t}else{\n\t\t\tans = max(ans,now + t[i + 1ll]);\n\t\t}\n\t}\n\tcout << ans << endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 5172, "score_of_the_acc": -0.826, "final_rank": 13 }, { "submission_id": "aoj_0411_9497819", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug_print.hpp>\n#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define debug(...) (static_cast<void>(0))\n#endif\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N, L;\n cin >> N >> L;\n vector<pair<int, int>> A(N);\n for (int i = 0; i < N; i++) cin >> A[i].first >> A[i].second, A[i].first--;\n\n // 位置でソート\n sort(A.begin(), A.end());\n\n // left[i] := [0, i) 番目までの矢印を全て左端に移動させるときのスコア\n vector<ll> left(N + 1);\n for (int i = 0; i < N; i++) {\n auto [p, d] = A[i];\n if (d == 0) {\n // 矢印が左向きのとき, スコアは p - i 増え\n left[i + 1] = left[i] + (p - i);\n }\n if (d == 1) {\n // 矢印が右向きのとき, スコアは p - i 減る\n left[i + 1] = left[i] - (p - i);\n }\n }\n // right[i] := [i, N) 番目までの矢印を全て右端に移動させるときのスコア\n vector<ll> right(N + 1);\n for (int i = N - 1; i >= 0; i--) {\n auto [p, d] = A[i];\n if (d == 0) {\n // 矢印が左向きのとき, スコアは L - 1 - (N - i - 1) - p 減る\n right[i] = right[i + 1] - (L - 1 - (N - i - 1) - p);\n }\n if (d == 1) {\n // 矢印が右向きのとき, スコアは L - 1 - (N - i - 1) - p 増える\n right[i] = right[i + 1] + (L - 1 - (N - i - 1) - p);\n }\n }\n\n ll ans = 0;\n for (int i = 0; i <= N; i++) ans = max(ans, left[i] + right[i]);\n cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5448, "score_of_the_acc": -0.3866, "final_rank": 4 }, { "submission_id": "aoj_0411_9495413", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug_print.hpp>\n#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define debug(...) (static_cast<void>(0))\n#endif\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N, L;\n cin >> N >> L;\n vector<int> p(N), d(N);\n for (int i = 0; i < N; i++) cin >> p[i] >> d[i], p[i]--;\n\n vector<int> id(N);\n iota(id.begin(), id.end(), 0);\n sort(id.begin(), id.end(), [&](int a, int b) { return p[a] < p[b]; });\n\n // left[i] := [0, i) 番目までの矢印を全て左端に移動させるときのスコア\n vector<ll> left(N + 1);\n for (int i = 0; i < N; i++) {\n if (d[id[i]] == 0) {\n // 矢印が左向きのとき, スコアは p[id[i]] - i 増える\n left[i + 1] = left[i] + (p[id[i]] - i);\n }\n if (d[id[i]] == 1) {\n // 矢印が右向きのとき, スコアは p[id[i]] - i 減る\n left[i + 1] = left[i] - (p[id[i]] - i);\n }\n }\n // right[i] := [i, N) 番目までの矢印を全て右端に移動させるときのスコア\n vector<ll> right(N + 1);\n for (int i = N - 1; i >= 0; i--) {\n if (d[id[i]] == 0) {\n // 矢印が左向きのとき, スコアは L - 1 - (N - i - 1) - p[id[i]] 減る\n right[i] = right[i + 1] - (L - 1 - (N - i - 1) - p[id[i]]);\n }\n if (d[id[i]] == 1) {\n // 矢印が右向きのとき, スコアは L - 1 - (N - i - 1) - p[id[i]] 増える\n right[i] = right[i + 1] + (L - 1 - (N - i - 1) - p[id[i]]);\n }\n }\n debug(left, right);\n\n ll ans = 0;\n for (int i = 0; i <= N; i++) ans = max(ans, left[i] + right[i]);\n cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5556, "score_of_the_acc": -0.4104, "final_rank": 5 }, { "submission_id": "aoj_0411_9483154", "code_snippet": "//line 2 \"/home/seekworser/.cpp_lib/competitive_library/competitive/std/std.hpp\"\n#include <bits/stdc++.h>\n#ifndef LOCAL_TEST\n#pragma GCC target (\"avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#endif // LOCAL_TEST\nusing namespace std;\nusing std::cout;\n// shorten typenames\nusing ll = long long;\nusing pii = pair<int, int>; using pll = pair<ll, ll>;\nusing vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;\nusing vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;\nusing vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;\nusing vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;\nusing vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;\nusing vs = vector<string>; using vvs = vector<vector<string>>; using vvvs = vector<vector<vector<string>>>;\ntemplate<typename T> vector<vector<T>> vv(int h, int w, T val = T()) { return vector(h, vector<T>(w, val)); }\ntemplate<typename T> vector<vector<vector<T>>> vvv(int h1, int h2, int h3, T val = T()) { return vector(h1, vector(h2, vector<T>(h3, val))); }\ntemplate<typename T> vector<vector<vector<vector<T>>>> vvvv(int h1, int h2, int h3, int h4, T val = T()) { return vector(h1, vector(h2, vector(h3, vector<T>(h4, val)))); }\ntemplate <class T> using priority_queue_min = priority_queue<T, vector<T>, greater<T>>;\n// define CONSTANTS\nconstexpr double PI = 3.14159265358979323;\nconstexpr int INF = 100100111; constexpr ll INFL = 3300300300300300491LL;\nfloat EPS = 1e-8; double EPSL = 1e-10;\ntemplate<typename T> bool eq(const T x, const T y) { return x == y; }\ntemplate<> bool eq<double>(const double x, const double y) { return (abs(x - y) < EPSL * x || abs(x - y) < EPSL); }\ntemplate<> bool eq<float>(const float x, const float y) { return abs(x - y) < EPS * x; }\ntemplate<typename T> bool neq(const T x, const T y) { return !(eq<T>(x, y)); }\ntemplate<typename T> bool ge(const T x, const T y) { return (eq<T>(x, y) || (x > y)); }\ntemplate<typename T> bool le(const T x, const T y) { return (eq<T>(x, y) || (x < y)); }\ntemplate<typename T> bool gt(const T x, const T y) { return !(le<T>(x, y)); }\ntemplate<typename T> bool lt(const T x, const T y) { return !(ge<T>(x, y)); }\nconstexpr int MODINT998244353 = 998244353;\nconstexpr int MODINT1000000007 = 1000000007;\n// fasten io\nstruct Nyan { Nyan() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } nyan;\n// define macros\n#define all(a) (a).begin(), (a).end()\n#define sz(x) ((ll)(x).size())\n#define rep1(n) for(ll dummy_iter = 0LL; dummy_iter < n; ++dummy_iter) // 0,1,...,n-1\n#define rep2(i, n) for(ll i = 0LL, i##_counter = 0LL; i##_counter < ll(n); ++(i##_counter), (i) = i##_counter) // i=0,1,...,n-1\n#define rep3(i, s, t) for(ll i = ll(s), i##_counter = ll(s); i##_counter < ll(t); ++(i##_counter), (i) = (i##_counter)) // i=s,s+1,...,t-1\n#define rep4(i, s, t, step) for(ll i##_counter = step > 0 ? ll(s) : -ll(s), i##_end = step > 0 ? ll(t) : -ll(t), i##_step = abs(step), i = ll(s); i##_counter < i##_end; i##_counter += i##_step, i = step > 0 ? i##_counter : -i##_counter) // i=s,s+step,...,<t\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define repe(a, v) for(auto& a : (v)) // iterate over all elements in v\n#define smod(n, m) ((((n) % (m)) + (m)) % (m))\n#define sdiv(n, m) (((n) - smod(n, m)) / (m))\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());}\nint Yes(bool b=true) { cout << (b ? \"Yes\\n\" : \"No\\n\"); return 0; };\nint YES(bool b=true) { cout << (b ? \"YES\\n\" : \"NO\\n\"); return 0; };\nint No(bool b=true) {return Yes(!b);};\nint NO(bool b=true) {return YES(!b);};\ntemplate<typename T, size_t N> T max(array<T, N>& a) { return *max_element(all(a)); };\ntemplate<typename T, size_t N> T min(array<T, N>& a) { return *min_element(all(a)); };\ntemplate<typename T> T max(vector<T>& a) { return *max_element(all(a)); };\ntemplate<typename T> T min(vector<T>& a) { return *min_element(all(a)); };\ntemplate<typename T> vector<T> vec_slice(const vector<T>& a, int l, int r) { vector<T> rev; rep(i, l, r) rev.push_back(a[i]); return rev; };\ntemplate<typename T> T sum(vector<T>& a, T zero = T(0)) { T rev = zero; rep(i, sz(a)) rev += a[i]; return rev; };\ntemplate<typename T> bool in_range(const T& val, const T& s, const T& t) { return s <= val && val < t; };\n\ntemplate <class T> inline vector<T>& operator--(vector<T>& v) { repe(x, v) --x; return v; }\ntemplate <class T> inline vector<T>& operator++(vector<T>& v) { repe(x, v) ++x; return v; }\n\nll powm(ll a, ll n, ll mod=INFL) {\n ll res = 1;\n while (n > 0) {\n if (n & 1) res = (res * a) % mod;\n if (n > 1) a = (a * a) % mod;\n n >>= 1;\n }\n return res;\n}\nll sqrtll(ll x) {\n assert(x >= 0);\n ll rev = sqrt(x);\n while(rev * rev > x) --rev;\n while((rev+1) * (rev+1)<=x) ++rev;\n return rev;\n}\ntemplate <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; }\ntemplate <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; }\nint digit(ll x, int d=10) { int rev=0; while (x > 0) { rev++; x /= d;}; return rev; }\n/**\n * @brief std.hpp\n * @docs docs/std/std.md\n */\n//line 3 \"/home/seekworser/.cpp_lib/competitive_library/competitive/math/bit.hpp\"\nnamespace bit{\n bool lb(ll x) { return (x & 1); }\n bool get(ll x, int n) { return ((x >> n) & 1); }\n ll update(ll x, int n, bool b) { return (x & ~(1LL << n)) + (b << n); }\n ll lsb(ll x) { return -x & x; }\n int digit(ll x) { int rev=0; while(x) { rev++; x >>= 1; } return rev; }\n ll msb(ll x) { if (x==0) return 0; return 1LL << (digit(x) - 1); }\n int lsbd(ll x) {return digit(lsb(x)); }\n int count(ll x) { return __builtin_popcountll(x); }\n string to_string(ll x, bool rev=true) { stringstream ss; while (x) { ss << lb(x); x >>= 1;} string s(ss.str()); if (rev) reverse(all(s)); return s; }\n}\n/**\n * @brief ビット演算\n * @docs docs/math/bit.md\n */\n//line 3 \"/home/seekworser/.cpp_lib/competitive_library/competitive/std/io.hpp\"\n// overload operators (prototypes)\ntemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p);\ntemplate <class T> inline istream& operator>>(istream& is, vector<T>& v);\ntemplate <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p);\ntemplate <class T> inline ostream& operator<<(ostream& os, const vector<T>& v);\ntemplate <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp);\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &st);\ntemplate <typename T> ostream &operator<<(ostream &os, const multiset<T> &st);\ntemplate <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st);\ntemplate <typename T> ostream &operator<<(ostream &os, queue<T> q);\ntemplate <typename T> ostream &operator<<(ostream &os, deque<T> q);\ntemplate <typename T> ostream &operator<<(ostream &os, stack<T> st);\ntemplate <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq);\n\n// overload operators\ntemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate <class T> inline istream& operator>>(istream& is, vector<T>& v) { repe(x, v) is >> x; return is; }\ntemplate <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p) { os << p.first << \" \" << p.second; return os; }\ntemplate <class T> inline ostream& operator<<(ostream& os, const vector<T>& v) { rep(i, sz(v)) { os << v.at(i); if (i != sz(v) - 1) os << \" \"; } return os; }\ntemplate <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp) { for (auto &[key, val] : mp) { os << key << \":\" << val << \" \"; } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? \" \" : \"\"); itr++; } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? \" \" : \"\"); itr++; } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st) { ll cnt = 0; for (auto &e : st) { os << e << (++cnt != (int)st.size() ? \" \" : \"\"); } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, queue<T> q) { while (q.size()) { os << q.front() << \" \"; q.pop(); } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, deque<T> q) { while (q.size()) { os << q.front(); q.pop_front(); if (q.size()) os << \" \"; } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, stack<T> st) { while (st.size()) { os << st.top() << \" \"; st.pop(); } return os; }\ntemplate <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq) { while (pq.size()) { os << pq.top() << \" \"; pq.pop(); } return os; }\n\ntemplate <typename T> int print_sep_end(string sep, string end, const T& val) { (void)sep; cout << val << end; return 0; };\ntemplate <typename T1, typename... T2> int print_sep_end(string sep, string end, const T1 &val, const T2 &...remain) {\n cout << val << sep;\n print_sep_end(sep, end, remain...);\n return 0;\n};\ntemplate <typename... T> int print(const T &...args) { print_sep_end(\" \", \"\\n\", args...); return 0; };\ntemplate <typename... T> void flush() { cout << flush; };\ntemplate <typename... T> int print_and_flush(const T &...args) { print(args...); flush(); return 0; };\n#define debug(...) debug_func(0, #__VA_ARGS__, __VA_ARGS__) // debug print\ntemplate <typename T> void input(T &a) { cin >> a; };\ntemplate <typename T1, typename... T2> void input(T1&a, T2 &...b) { cin >> a; input(b...); };\n#ifdef LOCAL_TEST\ntemplate <typename T> void debug_func(int i, const T name) { (void)i; (void)name; cerr << endl; }\ntemplate <typename T1, typename T2, typename... T3> void debug_func(int i, const T1 &name, const T2 &a, const T3 &...b) {\n int scope = 0;\n for ( ; (scope != 0 || name[i] != ',') && name[i] != '\\0'; i++ ) {\n cerr << name[i];\n if (name[i] == '(' || name[i] == '{') scope++;\n if (name[i] == ')' || name[i] == '}') scope--;\n }\n cerr << \":\" << a << \" \";\n debug_func(i + 1, name, b...);\n}\ntemplate <typename T1, typename T2, typename... T3> void debug_func(int i, const T1 &name, T2 &a, T3 &...b) {\n int scope = 0;\n for ( ; (scope != 0 || name[i] != ',') && name[i] != '\\0'; i++ ) {\n cerr << name[i];\n if (name[i] == '(' || name[i] == '{') scope++;\n if (name[i] == ')' || name[i] == '}') scope--;\n }\n cerr << \":\" << a << \" \";\n debug_func(i + 1, name, b...);\n}\n#endif\n#ifndef LOCAL_TEST\ntemplate <typename... T>\nvoid debug_func(T &...) {}\ntemplate <typename... T>\nvoid debug_func(const T &...) {}\n#endif\n/**\n * @brief io.hpp\n * @docs docs/std/io.md\n */\n//line 4 \"answer.cpp\"\nint main() {\n ll n, m; input(n, m);\n vector<pair<ll,ll>> pd(n);\n rep(i, n) input(pd[i].first, pd[i].second);\n sort(all(pd));\n ll cur = 0;\n rep(i, n) {\n auto [p, d] = pd[i];\n if (d == 0) cur += p - (i+1);\n else cur -= p - (i+1);\n }\n ll ans = cur;\n rep(i, n-1, -1, -1) {\n auto [p, d] = pd[i];\n if (d == 0) {\n cur -= p - (i+1);\n cur -= (m - (n-1-i) - p);\n } else {\n cur += p - (i+1);\n cur += (m - (n-1-i) - p);\n }\n chmax(ans, cur);\n debug(i, cur);\n }\n print(ans);\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4616, "score_of_the_acc": -0.2039, "final_rank": 3 }, { "submission_id": "aoj_0411_9018436", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int N, L;\n cin >> N >> L;\n vector<pair<long long, int>> pd(N);\n for(int i = 0; i < N; i++) {\n cin >> pd[i].first >> pd[i].second;\n }\n sort(pd.begin(), pd.end());\n long long score = 0;\n for(int i = 0; i < N; i++) {\n auto[p, d] = pd[i];\n score += (d == 0 ? 1 : -1)*(p-(i+1));\n }\n long long ans = max(0LL, score);\n for(int i = N-1; i >= 0; i--) {\n auto[p, d] = pd[i];\n score -= (d == 0 ? 1 : -1)*(p-(i+1));\n score += (d == 0 ? 1 : -1)*(p-(L-(N-i-1)));\n ans = max(ans, score);\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 4680, "score_of_the_acc": -0.7179, "final_rank": 12 }, { "submission_id": "aoj_0411_8717032", "code_snippet": "#include <bits/stdc++.h>\n\nint main() {\n int n, len;\n std::cin >> n >> len;\n std::vector<std::pair<int, int>> pieces;\n for (int i = 0; i < n; i++) {\n int p, d;\n std::cin >> p >> d;\n pieces.emplace_back(p, d);\n }\n std::sort(pieces.begin(), pieces.end());\n std::vector<int> stack;\n int diff = 0;\n long long ans = 0;\n for (auto [p, d]: pieces) {\n if (d == 0) {\n if (stack.empty()) {\n ans += p - diff - 1;\n diff++;\n } else {\n ans += p - diff - stack.back() - 1;\n stack.pop_back();\n diff += 2;\n }\n } else {\n stack.push_back(p - diff);\n }\n }\n while (!stack.empty()) {\n int p = stack.back();\n stack.pop_back();\n ans += len - diff - p;\n diff++;\n }\n std::cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 4016, "score_of_the_acc": -0.5721, "final_rank": 9 }, { "submission_id": "aoj_0411_8236561", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n long score=0;\n long a,b;\n cin>>a>>b;\n vector<vector<long> > e(a,vector<long> (3));\n for(int i=0;i<a;i+=1){\n cin>>e.at(i).at(0)>>e.at(i).at(1);\n e.at(i).at(1)=e.at(i).at(1)*2-1;\n e.at(i).at(2)=1;\n }\n sort(e.begin(),e.end());\n long min=1,max=b+1;\n for(int i=0;i<a;i+=1){\n if(e.at(i).at(0)!=-1){\n long l=min;\n long h=max;\n if(e.at(i).at(1)<0){\n score+=(l-e.at(i).at(0))*e.at(i).at(1);\n min+=e.at(i).at(2);\n e.at(i).at(0)=-1;\n }else{\n if(i!=a-1){\n h=e.at(i+1).at(0);\n }\n score+=(h-e.at(i).at(0)-e.at(i).at(2))*e.at(i).at(1);\n e.at(i).at(0)=h-e.at(i).at(2);\n if(e.at(i).at(0)+e.at(i).at(2)==max){\n max-=e.at(i).at(2);\n }else{\n e.at(i+1).at(1)+=e.at(i).at(1);\n e.at(i+1).at(2)+=e.at(i).at(2);\n e.at(i+1).at(0)=e.at(i).at(0);\n }\n e.at(i).at(0)=-1;\n }\n }\n }\n cout<<score<<endl;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 8240, "score_of_the_acc": -2, "final_rank": 20 }, { "submission_id": "aoj_0411_8154742", "code_snippet": "#include<bits/stdc++.h>\n#define rep(i,a,n) for(long long i=a;i<n;i++)\n#define repp(i,a,n) for(long long i=a;i>=n;i--)\n#define so(z) sort(z.begin(),z.end())\n#define sor(z) sort(z.begin(),z.end(),greater<long long>())\n#define re(z) reverse(z.begin(),z.end())\n#define su(a) substr(a)\n#define sub(a,b) substr(a,b)\n#define yess cout<<\"YES\"<<nn\n#define noo cout<<\"NO\"<<nn\n#define yes cout<<\"Yes\"<<\"\\n\"\n#define no cout<<\"No\"<<\"\\n\"\n#define yesr cout<<\"Yes\"<<\"\\n\";return(0)\n#define nor cout<<\"No\"<<\"\\n\";return(0)\n#define fi first\n#define se second\n#define fr() front()\n#define mp make_pair\n#define pb push_back\n#define nn \"\\n\"\n#define ll long long\n#define mod 1000000007\n#define IM INT_MAX\n#define LM LONG_LONG_MAX\n#define gcd(x,y) __gcd(x,y) //最大公約数\n#define lcm(x,y) x/(__gcd(x,y))*y //最小公倍数\n#define prev(a) prev_permutation(a.begin(),a.end()) //辞書前\n#define next(a) next_permutation(a.begin(),a.end()) //辞書後\n#define get(s) getline(cin,s) //　空白の空いたstringの入力\n#define fixed(a) fixed<<setprecision(a) //小数点何桁か指定\n#define ro(a) round(a) //四捨五入\n#define ce(a) ceil(a) //切り上げ\n#define up(a,v) upper_bound(a.begin(),a.end(),v)\n#define lo(a,v) lower_bound(a.begin(),a.end(),v)\n#define bi(a,v) binary_bound(a.begin(),a.end(),v)\nusing namespace std;\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n ll n,l,ans=LONG_LONG_MIN,b=0;\n cin>>n>>l;\n vector<pair<ll,ll>>a(n);\n rep(i,0,n){\n cin>>a[i].fi>>a[i].se;\n if(a[i].se==0) a[i].se=-1;\n }\n so(a);\n rep(i,0,n){\n b-=(a[i].fi-i-1)*a[i].se;\n /* if(a[i].se==0) b+=a[i].fi-i-1;\n else b-=a[i].fi-i-1;\n //cout<<b<<\" \";\n a[i].fi=i+1; */\n }\n //cout<<nn;\n //cout<<b<<nn;\n ans=b;\n repp(i,n-1,0){\n b+=(l-n)*a[i].se;\n /* if(a[i].se==0) b-=l-n;\n else b+=l-n;\n */\n ans=max(ans,b); \n //cout<<b<<\" \"<<ans<<nn;\n }\n cout<<ans<<nn;\n return(0);\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4524, "score_of_the_acc": -0.1837, "final_rank": 2 }, { "submission_id": "aoj_0411_8143138", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\n#define INF INT64_MAX;\nint main(void)\n{\n LL n,l,ans=0,mx=-1,left=0,right=1;\n cin>>n>>l;\n vector< pair < LL , LL > > a;\n for(int i=0;i<n;i++){\n LL p,d;\n cin>>p>>d;\n a.push_back({p,d});\n } \n sort(a.begin(),a.end());\n for(int i=0;i<n;i++){\n if(a[i].second==0){\n ans+=a[i].first-1-i;\n a[i].first=i+1;\n }\n else{\n ans-=a[i].first-1-i;\n a[i].first=i+1;\n }\n //cout<<ans<<endl;\n }\n mx=max(mx,ans);\n //cout<<\"ans=\"<<ans<<endl;\n for(int i=n-1;i>=0;i--){\n //cout<<\"a.first=\"<<a[i].first<<endl;\n //cout<<\"a.second=\"<<a[i].second<<endl;\n if(a[i].second==1){\n //cout<<l-a[i].first-(n-1-i)<<endl;\n ans+=l-a[i].first-(n-1-i);\n }\n else{\n //cout<<l-a[i].first-(n-1-i)<<endl;\n ans-=l-a[i].first-(n-1-i);\n }\n //cout<<ans<<endl;\n mx=max(ans,mx);\n }\n cout<<mx<<endl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 4820, "score_of_the_acc": -0.9987, "final_rank": 16 } ]
aoj_0418_cpp
Laver Nori (laver) is produced in the villages along the beaches of the Hibara Sea. All laver is formed into rectangles. When drying the laver in the sun, two sheets of laver are placed on the same rug so that the top of the first sheet is parallel to the top of the second sheet. Genm, a part-time worker, can place them parallel to each other, but he is not used to it yet, so there may be overlapping areas. The overlapped areas are not for sale, so we need to find the area of the laver that is not overlapped. Given the position of the lower-left point, width, and height of each of the two pieces of laver placed on the same rug, write a program that outputs the area of the non-overlapping pieces of laver. Input The input is given in the following form. $x_1$ $y_1$ $w_1$ $h_1$ $x_2$ $y_2$ $w_2$ $h_2$ The first line gives the coordinates of the lower left point $x_1,y_1$ ($0 \leq x_1,y_1 \leq 1,000$) and the width and height $w_1,h_1$ ($1 \leq w_1,h_1 \leq 1,000$) of the first piece of laver. The second line gives the coordinates of the lower left point $x_2,y_2$ ($0 \leq x_2,y_2 \leq 1,000$) and the width and height $w_2,h_2$ ($1 \leq w_2,h_2 \leq 1,000$) of the second piece of laver. All inputs are given as integers. Output Output the area of the laver in the non-overlapping area as an integer in a line. Sample Input and Output Sample Input 1 0 0 4 5 2 2 3 6 Sample Output 1 26 Sample Input 2 1 2 2 1 2 0 2 2 Sample Output 2 6 Sample Input 3 0 0 1 1 0 0 1 1 Sample Output 3 0
[ { "submission_id": "aoj_0418_9796637", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(n);++i)\nusing namespace std;\nusing ll = long long;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n vector<int> a(4),b(4);\n rep(i,4) cin >> a[i];\n rep(i,4) cin >> b[i];\n \n vector<vector<int>> sum(2010,vector<int>(2010,0));\n sum[a[0]+a[2]][a[1]+a[3]]++;\n sum[a[0]][a[1]]++;\n sum[a[0]][a[1]+a[3]]--;\n sum[a[0]+a[2]][a[1]]--;\n\n \n sum[b[0]+b[2]][b[1]+b[3]]++;\n sum[b[0]][b[1]]++;\n sum[b[0]][b[1]+b[3]]--;\n sum[b[0]+b[2]][b[1]]--;\n\n rep(i,2010){\n rep(j,2009){\n sum[i][j+1] += sum[i][j];\n }\n }\n rep(i,2010){\n rep(j,2009){\n sum[j+1][i] += sum[j][i];\n }\n }\n\n int ans = 0;\n rep(i,2010){\n rep(j,2010){\n if(sum[i][j]==1) ans++;\n }\n }\n cout << ans << endl;\n\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 18912, "score_of_the_acc": -1, "final_rank": 3 }, { "submission_id": "aoj_0418_8479679", "code_snippet": "/*\nNNMNNNMNNNNNNNMNNMNNNNNNNNNNNMNNMNNMNNMNMNNMNNMNNMNNMNMMNMMNMNMMMMNMNMMNMNMNMNMMNMNMMNMMMMMNMMNMNNMNMNMMNMMNMNNNMNNNNNNNMNMNMMNMNMNNMNMNNMNN\nNMNNMMNNMMNMMNMNNNNNNNNN#NNNNNNMNMMNNMNNMNMNMNNMNNMNNMNNMNMMNMNNNNMMNMNMNMNMNMNMMNNMNMNMNMNMNNMNMMNMNNMNMNNMNMNNNMNNNNNMNNNMNNMMNMNNMNNMMNMM\nMNNMNNMNNNNMNNNNN##MMB9YTTTTHMNNNNNNNNNMNMNNNMNMNMNMNMNMNMNMNNMMNMMMMNMNMMNNMNNNMNMNMNMNNMMNMNMNMNNMNMNMNMMNNMNMNNMNNNNNMMNMNMNNMNMMNMNMNMNN\nNNNNNMNNNMNNNNHHMB6+gHgggHm+:<7M###MMMMNNNNNNNNNNNNNMNNNMNMNMNNMNNMNNMNNMNMNNMMNMNNMNNMMNNMMNMNMMNMNNNMNMNNMNNNNNNNNNNNNNNNNMNMMNMNNMNNNMNMN\nNNMNNNNNNNNN#M#6uyWHHg@gg@gHs::?MMUuuuXMNNNN##NNNNNNNNNNNMNNMNNNMNMMNMMMNMNMNMNMNNNNNNNMNMNNMNNNNNNNNNNNNNMNNN#NN#NNNNNNNNNMNNNNMNMNNMMNMNNM\nMNMNNMNNN##H#6dyyyyVVWH@@@@@H<::?uuuuXdHH##HHHH##NNNNNNNNNNNNMMNNMNMNNMNNMNNNNNNN###NNNNNNNN###MMMMMMMM#NNNN####HH##HH####NNNNMNNMNMNNMMNMNN\nNMNNMNN##HM6jyyVVVWfWVyWgggggI:::wuXXMHHHHHMMNMMNMMNMMNMNNNNNNNMNNMNMNNMNNMMMHHkkkkkHHMMMMHkbbkbkbkbbbbbbkHHMMMHHH@H@HMMMMM##NNNMNNMMNNMNNMM\nNNNNNN##H#1XyyVyWWVVyVVVHg@@H>:::yuWHHHH@MNMMMMMMMMMMMMMMNM###NNNMNMNMNNNNNbkkkkkkkkkbbbppfWWWWWWWWWWWWWWWppbbkkHkkbkbbkbbkkMH#NNMNNNMNMMNMN\nNNNN##HH@jyyyVyWWVyVyyVWW@ggK:::(uXWHHHMMMMMMWuuuZuuuXWMMMMNMH#NNNNNMNMMNNMHbkbbkbbbpWWUT7!` `~` ` ??TUWWppbkkbkbkkbkbkH@H#NNMNNNMNNMNM\nNNN#HHM@jyyyVVWyVyVVyWWVW@gHC:::+uXH@@MMMUZuuuXkkkQQHH@H@MMMNM#H##NNNNNNNN#NHkkbbpWWY^` ` ?4WWpbbkkbkkkbkMHHH#NNMMNNMNNNN\nNNN#HH#1yyyVVWyVyVVWWVVVW@gD:::(HQH@HHZZZZuZZZWMHHHHHHHHHHMMMMHHH#####NNNN#HMHbpWU=` ` .CWWpbbkbkbkHH###H#NNNMNNMMNM\nNN#HHM3dyyVyWyVyVyWWVyWWWgK::::dNWHHZXkkW@HHHNMMg@HHHH#HHHHMMNM@@@@HHH###N#HHMH0= ` ` ` ` ` ` ` .OWpbbkkkkMMMMHH#NNMNNM#NNM\nH##HH@+yyVyWWVyVVVWVVWWVN#<:::jNMMZXHMMMNMMWWMNbkMMMH###N#HMMN@@@@@@@HMH#H#HMHV! ` ` ` ` ` ` jWppbkkHH@@@H###NNNNHHHNN\nHH##H$JyyVVWVyVVyWVVWWyW#>:::jNMMQMN@MMNMNNNNMNkHMMMMMMH##HMMMgg@@@H@@@HHHHMHC ` ` ` ` ` ` ` (XpbbHHM@@@@H#NNNMNHHHHN\nH##HHIdyyVyWVyyVypyVWyy#>:::jNMMNMMMMMMNMMNMNMNMMNMHMNMHHHMMNMgg@@@@H@@@HH@Hf ` `` ` ` ` ` ` ` ` (WpH#Mg@@@@H#NNNNN#H@HH\nH##HHbjyyVVWWVyVVWVVWX3:::+dSWMNMRqNMMNMNNMMNMNNNMMMNMNHHMMMMgg@@@H@H@@@@@HK` ` .` ` ` . ` ` jWMH@g@@@@HHNNNMNNHH@H\n####HN+WyyVyWVyyVWyyY<:::jMNQMMNMNMMMMNMMNMNMMMNHMMNMHHMMMMM@g@@@@H@@H@@H@H\\ ` ` . .: ~- _ .XWMMg@@@@HH#NNMNN#H@H\nNN#N##NwVVyyyWWyyVY<:::+MMMMMMMMMMMMNdNMMNMN#<:<:<TMMNMMMMM@@@@@@H@H@@@@H@K` ` ` .._ :~_ .::_. (<. :_._.` ` jWWMg@@@HHHNMNNMNNHH@\nNNNNN#HMkXWVVWVY>::::+dMHmg@@MHWMNMMMMMNMMNN<:::::(MNNMM#HHH@@@@H@@@@@@@HMD. `. `.:<< (< . (<:<;_(+<~.`-~<:_ .XWMg@@@@HH#NNNMNNHH@\nNMMNNNNH@gHmmQmAQggQWqmgg@MHH@mgMMMMMMMMNMNMMI::::<HMMH##HHHH@@H@@@@HHmHH93_ _ .<!.(+-.`_ _<+;<;<<~.+..`.<:_. ` (WWHgg@@@H##NNMN#H@H\nNNMNMNNH@@@@HHHHHH@gg@@@@MH#H@g@@MMMMMMMNNMM5::::::dMMHHHHH@@@H@@@HHHf^ ..(_. ` (_ .<.?ZWW;` .` (<<:<! `.WWk. (+_. ` _ XpHHHHHHMMH#NN#H@H@\nMNNMNNNHH@@HH#HHHH@@@@@@H#N#H@@@@MMMMMMMMMNMMNJ+gmjMNMMMM@@@@@@@BYYY! _::<<:- :+-.j'..XbW_```` _`~ ``..dHgHz.<<~ .: XW!`~?TWHHHMMM@@@@@\nNMNMNN#H@@@@MMHHH@HH@HHHHNN#H@@@MMHMMNNM\"MMMMMMMMMMMMMMNNH@@@@@@Hk.....(;;;1;;<-(<<1\\ JfHHz{`````````` dwHgXH`<.<`` `.(:_Xk<_-.. _TWHHHg@@@@\nNMNNNN#HH@@@@@@H@@@H@@HHNNN#H@@gHHS .UMN.(MNMMMMMMqqmgMMMMMM@@@@@gHma&&gggQH>;;;;;<.! jS-(O:`` ````````wk7Tdf`` (<>jp6>>;_`` _777<d@@\nMNMNN#H@@H@@@@@@H@H@@HHHNNN#H@mHH0!`_OH#b WH@HHHHmg@@@g@MMM@@@@H@@MH#HHHHMP.A<><;;<_` ?<~!`````` `````.>+<^ ` .(+>jWHs+1++<<-....-dHg@@\nNMNNN#H@H@gHkHH@@H@@H@HNNMN#MHHWf ` -dMNNaJWHMH#HHm@@@@@@@@@@@H@@@H#N##HH@H!(fWmJWc<_`````````` `` `````` ` .` .(<+1dkH@HHA&&&&&aQWHmgg@@@\nNNNN#H@@@HHpppbHH@@@HH#NNNN#MHW}``-MMNMMMgg@HH##HHH@@@@@@@gHH@@@@@HH##HMMB'`dWHHHMR.```````````````````````` -.(;+&gkbbW@H@gqqqqmggggg@@@@@@\n####HH@@@HpppppppHH@@H#NMNN#MNmm.d#MMMMNNMMMHHHHMHH@@@@@@gHWWHHHHHHMMHBY^ XMHHHHMm..`````` ` ```` ` ``` .~~<jgHHHHNpW%WHHqqHkmg@@@@@@@@HHH\nH#HH@H@@HppfffVffpH@@HNNNNN#HMMMMMMMMMNNNNNMg@MMWWH@@@@gHH00VY77777!` `.(WH##HHH#<?1-.``````` ````` ````.->dH##H#NpS .4UUWWpHg@@@@@@@@Hpp\nHMH@@H@HHppfffVVffWg@MNNNNN#HMMMMMMMMNNNNNNMKUUZwXHqmHHHWC!` .. ` .(;+d####HM% .+jwe..````````` ..(<+>>dHHH#HMH$_ ?zOXXWHggg@@@@gHVy\nH@@@@@H@HpfpfVVVVfpqgM#N####MNyHMMMMSWMNNNNNMh<<!`?UWWUC` -<>+++<<___(<+++=?<?MMMM9_` (MHHMMHmJ--+1z11z>>>=??JM#HH#HN3<- ??OXWHHHqmggHHyy\nHgg@@H@gmkppffyVVfpkqHMM####MWZZZZZZuzrWNNNNNgH; `?O> .;>>>+111zz<<+<<<:::::(Z<:~_. .X#0HM#HHHHHHMNHMHHR+=??>zTMHHM5?1<<-. _?7TUWWHHUXX\npHH@@@@HkkbpfVVyyfpbkqqHHMMHWZZZZyyZZuvrXMNNNNHk{ ->>>?<<<<+<<<:::::::::(J>:::~(dyf1?OOTMM#########MMI1>??>???dRz??11?<<_-... ~??1\nWpbkqmHbpppppfVyyVppbpbbpfXZXuZZZyyZuuuvtlTNNNHH[` ` .<<<>?z<<<:::::::~::~:~(JC::::(df0`.<=vwOtOZZVUVUVtOWNzz<<<>>?zNz1???=zzzz1?>><<(-..\nZyfpbbbpfVyyyVyZyyVffppfVyXzvXZZZZZZuuzvwtz?MN#MD ` -(<:(:::<<<<<+((((::(((d>::~:(kmXZ- <=vwrttwzzZOz=dM@! <??dR?1=??==z==zXVWkXAAz+<-\nXXWyffpVyXuuuuuuuZyyVVyyZuzvzuuuuuuuuuuuzrl=?H#MD ` ~<:(Co+:::::~:::::::+f<::::+XbHC:~:- _<=vZO===1<<(H0! ` _1??vNz?zz=??=z?=zXpbpfWZ=?1\nrvuuZZZZXwvvvvrvrXZZXXZXXwrrrzzuzzuzzuuuzrtl1+TM] ` +::::<7w+:~:::::::(J3:::::+Wb9>:::~~. ` _`` ` .dy}..._:~:(1?=db==zz==?=I==zWpfyXI==?\nlOrrwwwOOOrrrrOOtOOOOOOOOllttOOOzvvzzzzvvrttll1v%` ` (o:~:::::::~:~::(JY<:::::+WbY<:::::::~_. ._(wU0:::~::::::1zzNz==zz===zz==vWXXI===>\nllllz====llzzOz==l========tlllzllOOrwrrrrrrtlz1<~ ` `(zO-::(:~:::::(J3::::~::+pW3:::~:::::::(<~~~~:(dWk>:::::~::(::?zdK===zz===z===wwI=l=<.\nlll=====????????=======?=llll===lllOlltOOOOO1<>>_ ` (uZXx:(<::~:(v=::::~:::jpWC:::~:::wuz<(>:::::(dbb$::~::+(::(>::?zHy===zll=lOl=zIl===~:\n*/\n\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int LL;\n// || __\n#define rep(i, n) for (LL i = 0; i < n ; i++)\n//配列変数に代入、iは定義不要;\n#define inputs(i,n,a) rep(i,n)cin>>a[i];\n//ベクターに代入、i定義不要;\n#define vec_in(i,n,a) rep(i,n){int tmp=0;cin>>tmp;a.push_back(tmp);}\n#define YorN(ans) if(ans)cout<<\"Yes\"<<endl;else cout<<\"No\"<<endl;\n//vec_outは改行か空白かを選べる。 第二引数でspace=0,endl=1;を指定する。\n#define vec_out(vec,endl_or_space) for (auto& v : vec) {cout<<v; if(endl_or_space)cout<<endl;else cout<<\" \";}\n//modの改修を検討中\nLL MOD=1000000007;\nLL INF=1000000000000;\ntypedef pair<LL,LL> pear;\ntypedef vector<vector<LL> > Graph;\n//dx,dy君はグリッド等の探索に使うためのテンプレート配列\nconst int dx[] = { 1,0,-1,0 ,1,1,-1,-1 };\nconst int dy[] = { 0,1,0,-1 ,1,-1,-1,1 };\n//A...65 a...97 0...48\n\n\n\nint main() {\n LL nori[3010][3010];\n rep(i,3010){\n rep(j,3010){\n nori[i][j]=0;\n }\n }\n LL x,y,h,w;\n cin>>x>>y>>h>>w;\n for(int i=x;i<x+h;i++){\n for(int j=y;j<y+w;j++){\n nori[i][j]++;\n }\n }\n \n cin>>x>>y>>h>>w;\n for(int i=x;i<x+h;i++){\n for(int j=y;j<y+w;j++){\n nori[i][j]++;\n }\n }\n LL ans=0;\n rep(i,3010){\n rep(j,3010){\n if (nori[i][j]==1){\n ans++;\n }\n }\n }\n /* rep(i,10){\n rep(j,10){\n cout<<nori[i][j]<<\" \"; \n }\n cout<<endl;\n }*/\n \n cout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 73844, "score_of_the_acc": -1.5, "final_rank": 5 }, { "submission_id": "aoj_0418_8419556", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tvector<vector<int>> cou(3010,vector<int>(3010,0));\n\tint a,b,c,d;\n\tfor(int l = 0;l < 2;l++){\n\t\tcin >> a >> b >> c >> d;\n\t\tfor(int i = a;i < a + c;i++){\n\t\t\tfor(int j = b;j < b + d;j++){\n\t\t\t\tcou[i][j]++;\n\t\t\t}\n\t\t}\n\t}\n\tint ans = 0;\n\tfor(int i = 0;i < 3010;i++){\n\t\tfor(int j = 0;j < 3010;j++){\n\t\t\tif(cou[i][j] == 1){\n\t\t\t\tans++;\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 38348, "score_of_the_acc": -0.3538, "final_rank": 2 }, { "submission_id": "aoj_0418_8228234", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\n#define INF INT64_MAX;\nint main(void)\n{\n int x1,x2,y1,y2,h1,h2,w1,w2,sum=0;\n cin>>x1>>y1>>w1>>h1>>x2>>y2>>w2>>h2;\n vector< vector < int > > f(3002,vector<int>(3002,0));\n for(int i=y1;i<y1+h1;i++){\n for(int j=x1;j<x1+w1;j++){\n f[i][j]++;\n }\n }\n for(int i=y2;i<y2+h2;i++){\n for(int j=x2;j<x2+w2;j++){\n f[i][j]++;\n }\n }\n for(int i=0;i<=3000;i++) for(int j=0;j<=3000;j++) if(f[i][j]==1) sum++;\n cout<<sum<<endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 38244, "score_of_the_acc": -0.3519, "final_rank": 1 }, { "submission_id": "aoj_0418_8228218", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\n#define INF INT64_MAX;\nint main(void)\n{\n int x1,x2,y1,y2,h1,h2,w1,w2,sum=0;\n cin>>x1>>y1>>h1>>w1>>x2>>y2>>h2>>w2;\n vector< vector < int > > f(3002,vector<int>(3002,0));\n for(int i=x1;i<x1+w1;i++){\n for(int j=y1;j<y1+h1;j++){\n f[i][j]++;\n }\n }\n for(int i=x2;i<x2+w2;i++){\n for(int j=y2;j<y2+h2;j++){\n f[i][j]++;\n }\n }\n for(int i=0;i<=3000;i++) for(int j=0;j<=3000;j++) if(f[i][j]==1) sum++;\n cout<<sum<<endl;\n}", "accuracy": 0.11538461538461539, "time_ms": 10, "memory_kb": 38152, "score_of_the_acc": -0.3503, "final_rank": 7 }, { "submission_id": "aoj_0418_6639792", "code_snippet": "#include \"bits/stdc++.h\"\n\n#define REP(i,num) for(ll i=0;i<(num);++i)\n#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))\n#define LOOP(i) while(i--)\n#define ALL(c) c.begin(),c.end()\n#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;\n#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\n\nconstexpr ll atcoder_mod = 1e9+7;\n\ntemplate<typename T=ll>\nT in(){ T x; cin >> x; return (x); }\ntemplate<typename T=ll,typename C=vector<T>>\nC vecin(int N){ C x(N);REP(i,N){ x[i]=in<T>(); }return x; }\ntemplate<typename T=ll,size_t N>\narray<T,N> arrin(){array<T,N> x;REP(i,N){ x[i]=in<T>(); }return x;}\n\nvoid vout(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid vout(Head&& h,Tail&&... t){ cout << ' ' << h;vout(forward<Tail>(t)...); }\nvoid out(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid out(Head&& h,Tail&&... t){ cout << h;vout(forward<Tail>(t)...); }\n\ntemplate<typename T>\nbool chmax(T& a,T b){ if(a<b){ a=b;return true; }return false; }\ntemplate<typename T>\nbool chmin(T& a,T b){ if(a>b){ a=b;return true; }return false; }\n\nclass Data{\npublic:\n\tll x,y,w,h;\n};\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(10);\n\n\tData data[2];\n\tREP(i,2){\n\t\tdata[i].x=in(),data[i].y=in(),data[i].w=in(),data[i].h=in();\n\t}\n\n\tll K=2000;\n\tvvll M(K+1,vll(K+1,0));\n\tREP(i,2){\n\t\tM[data[i].y][data[i].x]+=1;\n\t\tM[data[i].y][data[i].x+data[i].w]-=1;\n\t\tM[data[i].y+data[i].h][data[i].x]-=1;\n\t\tM[data[i].y+data[i].h][data[i].x+data[i].w]+=1;\n\t}\n\tREP(i,K+1){\n\t\tREP(j,K){\n\t\t\tM[i][j+1] += M[i][j];\n\t\t}\n\t}\n\tREP(j,K+1){\n\t\tREP(i,K){\n\t\t\tM[i+1][j] += M[i][j];\n\t\t}\n\t}\n\tll S=0;\n\tREP(i,K+1){\n\t\tREP(j,K+1) if(M[i][j]==1) S++;\n\t}\n\tout(S);\n\treturn 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 34492, "score_of_the_acc": -1.2836, "final_rank": 4 }, { "submission_id": "aoj_0418_6639789", "code_snippet": "#include \"bits/stdc++.h\"\n\n#define REP(i,num) for(ll i=0;i<(num);++i)\n#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))\n#define LOOP(i) while(i--)\n#define ALL(c) c.begin(),c.end()\n#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;\n#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\n\nconstexpr ll atcoder_mod = 1e9+7;\n\ntemplate<typename T=ll>\nT in(){ T x; cin >> x; return (x); }\ntemplate<typename T=ll,typename C=vector<T>>\nC vecin(int N){ C x(N);REP(i,N){ x[i]=in<T>(); }return x; }\ntemplate<typename T=ll,size_t N>\narray<T,N> arrin(){array<T,N> x;REP(i,N){ x[i]=in<T>(); }return x;}\n\nvoid vout(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid vout(Head&& h,Tail&&... t){ cout << ' ' << h;vout(forward<Tail>(t)...); }\nvoid out(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid out(Head&& h,Tail&&... t){ cout << h;vout(forward<Tail>(t)...); }\n\ntemplate<typename T>\nbool chmax(T& a,T b){ if(a<b){ a=b;return true; }return false; }\ntemplate<typename T>\nbool chmin(T& a,T b){ if(a>b){ a=b;return true; }return false; }\n\nclass Data{\npublic:\n\tll x,y,w,h;\n};\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(10);\n\n\tData data[2];\n\tREP(i,2){\n\t\tdata[i].x=in(),data[i].y=in(),data[i].w=in(),data[i].h=in();\n\t}\n\n\tvvll M(2001,vll(2001,0));\n\tREP(i,2){\n\t\tM[data[i].y][data[i].x]+=1;\n\t\tM[data[i].y][data[i].x+data[i].w]-=1;\n\t\tM[data[i].y+data[i].h][data[i].x]-=1;\n\t\tM[data[i].y+data[i].h][data[i].x+data[i].w]+=1;\n\t}\n\tREP(i,1001){\n\t\tREP(j,1000){\n\t\t\tM[i][j+1] += M[i][j];\n\t\t}\n\t}\n\tREP(j,1001){\n\t\tREP(i,1000){\n\t\t\tM[i+1][j] += M[i][j];\n\t\t}\n\t}\n\tll S=0;\n\tREP(i,1001){\n\t\tREP(j,1001) if(M[i][j]==1) S++;\n\t}\n\tout(S);\n\treturn 0;\n}", "accuracy": 0.11538461538461539, "time_ms": 10, "memory_kb": 34384, "score_of_the_acc": -0.2817, "final_rank": 6 } ]
aoj_0412_cpp
Castle in the Sky Tsuruga, the Castle in the Sky, floats in the sky above the country of Aizu. There are days when sunlight is blocked by the castle. Compensation is paid to the inhabitants of the areas where sunlight is blocked for a certain number of days. As the compensation payer for the country of Aizu, you will need to verify that there was no sunlight at the location on that day from the daily location of the astle and the list of locations where compensation has been applied for. Given the location of the castle in the sky, and a location on the ground in the country of AIzu, write a program to determine if the location was in shadow on that day. You do not need to think about the movement of the castle or the sun, because you will determine at a specific time whether it was in the shadow or not. The location of the sun is a point of no size at $x=y=0,z=10^6$, the castle in the sky is a convex polygon in the plane at $z=100$, and the location on the ground is a point of no size at $z=0$. If the line connecting a point and the sun is blocked by the castle in the sky, the point will be in shadow. Input The input is given in the following form. $N$ $xt_1$ $yt_1$ $xt_2$ $yt_2$ : $xt_N$ $yt_N$ $Q$ $xa_1$ $ya_1$ $xa_2$ $ya_2$ : $xa_Q$ $ya_Q$ In the first line, the number of points $N$ ($3 \leq N \leq 3 \times 10^4$) that represent the region of the castle in the sky, is given. In the following $N$ lines, the integer coordinates $xt_i$,$yt_i$ ($-10^8 \leq xt_i,yt_i \leq 10^8$) of the vertices that make up the region are given in counterclockwise around the center of gravity of the region. However, no vertices with the same coordinates are given ($xt_i \ne xt_j$ or $yt_i \ne yt_j$ for $i \ne j$). Also, the area of the region can be considered to be greater than zero. In the subsequent line, the number $Q$ ($1 \leq Q \leq 6 \times 10^4$) of locations where compensation has been applied is given. In the following $Q$ lines, the coordinates $xa_i,ya_i$ ($-10^8 \leq xa_i,ya_i \leq 10^8$) of the locations where compensation was applied are given in integers. Note that the coordinates of the location where the application for compensation was made can be considered to be at least $10^{-3}$ away from the shadow outline of the castle. Output For each location where compensation was applied for, output "1" if it is in the shadow, and "0" if it is not, in a line. Sample Input and Output Sample Input 1 6 0 0 4 0 6 3 5 5 1 5 0 3 5 2 2 6 6 3 1 5 1 -1 -1 Sample Output 1 1 0 1 0 0 Sample Input ２ 4 100000 100000 101000 100000 101000 101000 100000 101000 2 100005 100005 101005 101005 Sample Output 2 0 1
[ { "submission_id": "aoj_0412_10948637", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\n#ifndef ONLINE_JUDGE\n#define _GLIBCXX_DEBUG\n#include <iostream>\ntemplate <typename T, typename U>\nostream& operator<<(ostream& os, const pair<T, U>& p) {return os<<'(' <<p.first<<\", \"<<p.second<<')';}\ntemplate <typename T>\nostream& operator<<(ostream& os, const vector<T>& v) {os<<'[';for(auto it=v.begin();it!=v.end();++it){os<<*it; if(next(it)!=v.end()){os<<\", \";}}return os<<']';}\ntemplate <typename T>\nostream& operator<<(ostream& os, const vector<vector<T>>& vv) {os<<\"[\\n\";for(auto it=vv.begin();it!=vv.end();++it){os<<\" \"<<*it;if(next(it)!=vv.end()){os<<\",\\n\";}else{os<<\"\\n\";}}return os<<\"]\";}\n#define dump(x) cerr << #x << \" = \" << (x) << '\\n'\n#else\n#define dump(x) (void)0\n#endif\nusing ll = long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\ntemplate<class T> using pq = priority_queue<T>;\ntemplate<class T> using pq_g = priority_queue<T, vector<T>, greater<T>>;\n#define out(x) cout<<x<<'\\n'\n#define all(v) (v).begin(),(v).end()\n#define rall(v) (v).rbegin(),(v).rend()\n#define OVERLOAD_REP(_1,_2,_3,name,...) name\n#define REP1(i,n) for (auto i = std::decay_t<decltype(n)>{}; (i) < (n); ++(i))\n#define REP2(i, l, r) for (auto i = (l); (i) < (r); ++(i))\n#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)\ntemplate<class T> inline bool chmin(T& a, T b) {if(a > b){a = b; return true;} else {return false;}};\ntemplate<class T> inline bool chmax(T& a, T b) {if(a < b){a = b; return true;} else {return false;}};\nconst ll INF=(1LL<<60);\nconst ll mod=998244353;\nusing Graph = vector<vector<ll>>;\nusing Network = vector<vector<pair<ll,ll>>>;\nusing Grid = vector<string>;\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nconst int dx2[8] = {1, 1, 1, 0, 0, -1, -1, -1};\nconst int dy2[8] = {1, 0, -1, 1, -1, 1, 0, -1};\n\n// #include \"../geo.hpp\"\n\n// #pragma once\n\nusing D = long double;\nconst D EPS = 1e-12L;\nconst D PI = acosl(-1.0L);\nusing P2 = complex<D>;\nstruct L2{P2 a, b;};\nstruct S2{P2 a, b;};\nusing G2 = vector<P2>;\n\nint sgn(D x){return (x>EPS)-(x<-EPS);}\nint cmp(D a, D b){return sgn(a-b);}\nbool eq(D a, D b){return cmp(a, b)==0;}\nbool lt(D a, D b){return cmp(a, b)<0;}\nbool le(D a, D b){return cmp(a, b)<=0;}\nbool gt(D a, D b){return cmp(a, b)>0;}\nbool ge(D a, D b){return cmp(a, b)>=0;}\nbool eqP2(P2 a, P2 b){return eq(real(a), real(b)) && eq(imag(a), imag(b));}\nbool ltP2(P2 a, P2 b) {\n return lt(real(a), real(b)) || (eq(real(a), real(b)) && lt(imag(a), imag(b)));\n}\n\nD dot(P2 a, P2 b) {return real(conj(a)*b);}\nD cross(P2 a, P2 b) {return imag(conj(a)*b);}\nint ccw(P2 a, P2 b, P2 c) {\n b-=a; c-=a;\n auto cr=cross(b, c), dt=dot(b, c);\n if (cr > EPS) return +1; // counter clockwise\n if (cr < -EPS) return -1; // clockwise\n if (dt < -EPS) return +2; // c--a--b\n if (lt(norm(b), norm(c))) return -2; // a--b--c\n return 0; // a--c--b\n}\nint turn(P2 a, P2 b, P2 c) { return sgn(cross(b - a, c - a)); }\n\nP2 rot(P2 a, D th) { return a*polar<D>(1, th); }\nP2 rot90(P2 a) { return P2(-imag(a), real(a)); }\nbool ltP2Arg(P2 a, P2 b) {\n auto up = [](P2 p) { return (imag(p) > 0 || (eq(imag(p), 0) && ge(real(p), 0))); };\n if (up(a) != up(b)) return up(a);\n if (!eq(cross(a, b), 0)) return cross(a, b) > 0;\n return lt(norm(a), norm(b));\n}\n\ninline void rd(P2& p) {D x, y; cin>>x>>y; p = P2(x, y);}\n#define setp(n) cout<<setprecision(n)<<fixed\ninline void pr(const P2& p) {setp(12); cout<<real(p)<<' '<<imag(p)<<'\\n';}\n\n// ----------------------------------------------------------------------------------\n\nP2 proj(L2 l, P2 p) { P2 a=p-l.a, b=l.b-l.a; return l.a+b*dot(a, b)/norm(b);}\nP2 refl(L2 l, P2 p) { return proj(l, p)*2.0L - p; }\nbool isParallel(L2 l, L2 m){ return eq(cross(l.a-l.b, m.a-m.b), 0); }\nbool isPerp(L2 l, L2 m){ return eq(dot(l.a-l.b, m.a-m.b), 0); }\n\nbool isLL(L2 l, L2 m){ return !eq(cross(l.a-l.b, m.a-m.b), 0); }\nbool isLS(L2 l, S2 s){ return turn(l.a, l.b, s.a)*turn(l.a, l.b, s.b)<=0; }\nbool isSS(S2 s, S2 t) {\n return\n ccw(s.a,s.b,t.a)*ccw(s.a,s.b,t.b) <= 0 &&\n ccw(t.a,t.b,s.a)*ccw(t.a,t.b,s.b) <= 0;\n}\n\nP2 cpLL(L2 l, L2 m) {\n P2 a=l.b-l.a, b=m.b-m.a;\n D d=cross(a, b);\n if (eq(d, 0)) return P2(INF, INF); // parallel\n return l.a + a*cross(m.b-l.a,b)/d;\n}\n\nD distLP(L2 l, P2 p) { return abs(cross(l.b-l.a, p-l.a))/abs(l.b-l.a); }\nD distSP(S2 s, P2 p) {\n P2 a=s.a, b=s.b;\n if (le(dot(b-a, p-a), 0)) return abs(p-a);\n if (le(dot(a-b, p-b), 0)) return abs(p-b);\n return distLP({a,b}, p);\n}\nD distSS(S2 s, S2 t) {\n if (isSS(s, t)) return 0;\n return min({distSP(s, t.a), distSP(s, t.b), distSP(t, s.a), distSP(t, s.b)});\n}\n\nD area(G2 g) {\n D s=0;\n int n=g.size();\n rep(i, n) s+=cross(g[i], g[(i+1)%n]);\n return s/2.0L;\n}\n\nbool isConvex(G2 g) {\n int n=g.size();\n if (n < 3) return false;\n int dir = 0;\n rep(i,n){\n int s = turn(g[i], g[(i+1)%n], g[(i+2)%n]);\n if (s == 0) return false; // -> continue : allows three points on a line\n if (dir == 0) dir = s;\n else if (dir*s < 0) return false;\n }\n return true;\n}\n\nint inG(G2 g, P2 p) {\n bool in=false;\n int n=g.size();\n rep(i, n) {\n P2 a=g[i], b=g[(i+1)%n];\n if (ccw(a, b, p) == 0) return 1; // on boundary\n if (a.imag() > b.imag()) swap(a, b);\n if (le(a.imag(), p.imag()) && lt(p.imag(), b.imag()) && turn(a, b, p) > 0) in=!in;\n }\n return in ? 2 : 0; // inside : outside\n}\n\nG2 hull(G2 g) {\n sort(all(g), ltP2);\n g.erase(unique(all(g), eqP2), g.end());\n if (g.size()<=1) return g;\n G2 lo, up;\n for (auto &p:g) {\n while (lo.size()>=2 && turn(lo[lo.size()-2], lo.back(), p)<=0) lo.pop_back(); //-> turn()<0 : allow three points on a line\n lo.push_back(p);\n }\n reverse(all(g));\n for (auto &p:g) {\n while (up.size()>=2 && turn(up[up.size()-2], up.back(), p)<=0) up.pop_back(); // -> turn()<0 : allow three points on a line\n up.push_back(p);\n }\n lo.pop_back(); up.pop_back();\n lo.insert(lo.end(), all(up));\n return lo;\n}\n\npair<P2, P2> diameter(G2 g) {\n auto h = hull(g);\n int n=h.size();\n if(n==0) return {P2(0,0), P2(0,0)};\n if(n==1) return {h[0], h[0]};\n auto area2=[&](int i, int j, int k) {return abs(cross(h[j]-h[i], h[k]-h[i]));};\n D maxd=0;\n pair<P2, P2> res={h[0], h[0]};\n int j=1;\n rep(i, n) {\n int ni=(i+1)%n;\n while (gt(area2(i, ni, (j+1)%n), area2(i, ni, j))) j=(j+1)%n;\n if (gt(abs(h[i]-h[j]), maxd)) maxd=abs(h[i]-h[j]), res={h[i], h[j]};\n if (gt(abs(h[ni]-h[j]), maxd)) maxd=abs(h[ni]-h[j]), res={h[ni], h[j]};\n }\n return res;\n}\n\nint inConvex(const G2& h, P2 p){\n int n = (int)h.size();\n if (n==0) return 0;\n if (n==1) return eqP2(h[0], p) ? 2 : 0;\n if (n==2) return (sgn(cross(h[1]-h[0], p-h[0]))==0 && sgn(dot(p-h[0], p-h[1]))<=0) ? 2 : 0;\n if (turn(h[0], h[1], p) < 0) return 0;\n if (turn(h[0], h[n-1], p) > 0) return 0;\n\n int L = 1, R = n-1;\n while (R - L > 1){\n int M = (L + R) / 2;\n (turn(h[0], h[M], p) >= 0) ? L = M : R = M;\n }\n int s = turn(h[L], h[(L+1)%n], p);\n return s==0 ? 2 : (s>0 ? 1 : 0);\n}\n\nG2 cutConvex(G2 h, L2 l) {\n int n=h.size();\n G2 res;\n if (n==0) return res;\n auto inside=[&](P2 p){ return turn(l.a, l.b, p) >= 0; };\n rep(i, n) {\n P2 a=h[i], b=h[(i+1)%n];\n bool ina=inside(a), inb=inside(b);\n if (ina&&inb) res.push_back(b);\n else if (ina&&!inb) {\n res.push_back(cpLL({a,b}, l));\n }\n else if (!ina&&inb) {\n res.push_back(cpLL({a,b}, l));\n res.push_back(b);\n }\n }\n return res;\n}\n\npair<P2, P2> closestPair(G2 g) {\n auto ps = g;\n int n=ps.size();\n if (n < 2) return {P2(0,0), P2(0,0)};\n sort(all(ps), ltP2);\n rep(i, n-1) if (eqP2(ps[i], ps[i+1])) return {ps[i], ps[i]};\n\n D mind = norm(ps[0]-ps[1]);\n pair<P2, P2> res = {ps[0], ps[1]};\n set<pair<D,int>> box;\n int j=0;\n rep(i, n) {\n D xi=real(ps[i]), yi=imag(ps[i]);\n D rad = sqrtl(mind);\n while (j<i && gt(xi - real(ps[j]), rad)) {\n box.erase({imag(ps[j]), j});\n j++;\n }\n auto it = box.lower_bound({yi - rad, -1});\n for (; it != box.end() && le(it->first, yi + rad); ++it) {\n int k = it->second;\n D d = norm(ps[i]-ps[k]);\n if (lt(d, mind)) { mind=d, res={ps[i], ps[k]}, rad = sqrtl(mind); }\n }\n box.insert({yi, i});\n }\n return res;\n}\n\n\nstruct C2 { P2 o; D r; };\n\nC2 makeC2(P2 a, P2 b) {\n return C2{(a+b)/D(2), abs(a-b)/D(2)};\n}\nC2 makeC2(P2 a, P2 b, P2 c) {\n P2 B=b-a, C=c-a;\n D d=2*cross(B, C);\n if (eq(d, 0)) {\n D ab=norm(B), bc=norm(b-c), ca=norm(c-a);\n if (le(ab, bc) && le(ab, ca)) return makeC2(a, b);\n if (le(bc, ca)) return makeC2(b, c);\n return makeC2(c, a);\n }\n P2 o=a+(rot90(B)*norm(C)-rot90(C)*norm(B))/d;\n return C2{o, abs(o-a)};\n}\n\nC2 incircle(P2 a, P2 b, P2 c) {\n D ab=abs(b-a), bc=abs(c-b), ca=abs(a-c);\n P2 o=(a*bc+b*ca+c*ab)/(ab+bc+ca);\n D r=abs(cross(b-a, o-a))/abs(b-a);\n return C2{o, r};\n}\n\nvector<P2> cpCL(L2 l, C2 c) {\n // todo\n // vector<P2> res;\n // P2 a=l.a-c.o, d=l.b-l.a;\n // D A=norm(d), B=2*dot(a, d), C=norm(a)-c.r*c.r;\n // if (le(A, 0)) {\n // if (eq(abs(a), c.r)) res.push_back(l.a);\n // return res;\n // }\n // D Dlt=B*B-4*A*C;\n // if (lt(Dlt, 0)) return res;\n // D s = le(Dlt, 0) ? 0 : sqrtl(max<D>(0, Dlt));\n // D t1 = (-B - s)/(2*A), t2 = (-B + s)/(2*A);\n // res.push_back(c.o + a + d*t1);\n // if (gt(Dlt, 0)) res.push_back(c.o + a + d*t2);\n // return res;\n}\n\nvector<P2> cpCC(C2 c1, C2 c2) {\n vector<P2> res;\n P2 d=c2.o-c1.o;\n D L=abs(d);\n if (eq(L, 0)) return res;\n D a=(c1.r*c1.r-c2.r*c2.r+L*L)/(2*L), h2=c1.r*c1.r-a*a;\n if (lt(h2, 0)) return res;\n P2 m=c1.o+d*(a/L), n=rot90(d)*( (lt(h2, 0) ? 0 : sqrtl(max<D>(0, h2))/L) );\n res.push_back(m-n);\n if (gt(h2, 0)) res.push_back(m+n);\n return res;\n}\n\nD isaCC(C2 c1, C2 c2) {\n D d=abs(c1.o-c2.o), r1=c1.r, r2=c2.r;\n if (ge(d, r1+r2)) return 0;\n if (le(d, abs(r1-r2))) {\n D r=min(r1, r2);\n return PI*r*r;\n }\n auto f = [&] (D z) { return max<D>(-1, min<D>(1, z)); };\n D a = 2*acosl(f((d*d+r1*r1-r2*r2)/(2*d*r1)));\n D b = 2*acosl(f((d*d+r2*r2-r1*r1)/(2*d*r2)));\n return 0.5L*(r1*r1*(a-sinl(a)) + r2*r2*(b-sinl(b)));\n}\n\nvector<L2> tangCP(C2 c, P2 p) {\n vector<L2> res;\n P2 v = p - c.o;\n D d2 = norm(v), r2 = c.r*c.r;\n if (lt(d2, r2)) return res;\n if (eq(d2, r2)) {\n res.push_back({c.o+v*(r2/d2), p});\n return res;\n }\n D h = c.r*sqrtl(max<D>(0, d2 - r2));\n P2 n1 = (v*r2 - rot90(v)*h)/d2;\n P2 n2 = (v*r2 + rot90(v)*h)/d2;\n res.push_back({c.o+n1, p});\n res.push_back({c.o+n2, p});\n return res;\n}\n\nvector<L2> tangCC(C2 c1, C2 c2) {\n vector<L2> res;\n P2 d = c2.o-c1.o;\n D L=abs(d);\n if (eq(L, 0)) return res;\n P2 e = d/L;\n auto add = [&] (int s) {\n D c=(s*c2.r - c1.r)/L;\n if (gt(c*c, 1)) return;\n D s2 = max<D>(0, 1 - c*c);\n if (eq(s2, 0)) {\n P2 n = e*c;\n res.push_back({c1.o-n*c1.r, c2.o-n*c2.r});\n } else {\n D s = sqrtl(s2);\n P2 n1 = e*c + rot90(e)*s;\n P2 n2 = e*c - rot90(e)*s;\n res.push_back({c1.o-n1*c1.r, c2.o-n1*c2.r});\n res.push_back({c1.o-n2*c1.r, c2.o-n2*c2.r});\n }\n };\n add(+1); // external\n add(-1); // internal\n return res;\n}\n\nC2 mec(G2 ps) {\n auto inC2=[&](C2 c, P2 p){ return le(abs(c.o - p), c.r); };\n mt19937_64 rng((uint64_t)chrono::steady_clock::now().time_since_epoch().count());\n shuffle(all(ps), rng);\n int n=ps.size();\n if(n==0) return C2{P2(0,0), 0};\n C2 c{ps[0], 0};\n rep(i, n) {\n if (inC2(c, ps[i])) continue;\n c={ps[i], 0};\n rep(j, i) {\n if (inC2(c, ps[j])) continue;\n c=makeC2(ps[i], ps[j]);\n rep(k, j) {\n if (inC2(c, ps[k])) continue;\n c=makeC2(ps[i], ps[j], ps[k]);\n }\n }\n }\n return c;\n}\n\nvector<P2> cpSegs(vector<S2> ss) {\n struct E { D x; int t; D y, y1, y2; }; // t: 0=add(H), 1=query(V), 2=remove(H)\n vector<E> es; es.reserve(ss.size()*2);\n\n for(auto s: ss) {\n if (eq(s.a.imag(), s.b.imag())) {\n if (gt(s.a.real(), s.b.real())) swap(s.a, s.b);\n es.push_back({s.a.real(), 0, s.a.imag(), 0, 0});\n es.push_back({s.b.real(), 2, s.a.imag(), 0, 0});\n } else {\n if (gt(s.a.imag(), s.b.imag())) swap(s.a, s.b);\n es.push_back({s.a.real(), 1, 0, s.a.imag(), s.b.imag()});\n }\n }\n\n sort(all(es), [](E a, E b) {\n if (!eq(a.x, b.x)) return lt(a.x, b.x);\n return a.t < b.t;\n });\n\n multiset<D> active;\n vector<P2> res; res.reserve(ss.size());\n for (auto e : es) {\n if (e.t == 0) { // add\n active.insert(e.y);\n } else if (e.t == 2) { // remove\n auto it = active.find(e.y);\n if (it != active.end()) active.erase(it);\n } else { // query\n for (auto it = active.lower_bound(e.y1); it != active.end() && le(*it, e.y2); ++it) {\n res.push_back(P2(e.x, *it));\n }\n }\n }\n\n sort(all(res), ltP2);\n res.erase(unique(all(res), eqP2), res.end());\n return res;\n}\n\n// === begin: Half-Plane Intersection (angle-free) ===\n\nstruct HP{\n L2 l;\n HP(){} HP(L2 _l):l(_l){}\n bool inside(P2 p) const { return turn(l.a,l.b,p) >= 0; }\n};\nP2 dir(const HP& h){ return h.l.b - h.l.a; }\nbool ltHPArg(const HP& a, const HP& b){\n return ltP2Arg(dir(a),dir(b));\n}\n// 同角は最左の半平面 1 本に正規化\nvector<HP> normalizeHP(vector<HP> v){\n sort(all(v), ltHPArg);\n vector<HP> u; u.reserve(v.size());\n for (auto &h: v){\n if (!u.empty() && eq(cross(dir(u.back()), dir(h)), 0)){\n if (h.inside(u.back().l.a)) continue; \n u.back() = h;\n }else u.push_back(h);\n }\n return u;\n}\n\n// 本体：半平面の共通部分（左側）を凸多角形で返す（空集合は空配列）\nG2 hpi(vector<HP> H){\n H = normalizeHP(move(H));\n deque<HP> dq;\n deque<P2> I;\n\n auto push_hp = [&](HP h){\n while(!I.empty() && !h.inside(I.back())){ dq.pop_back(); I.pop_back(); }\n while(!I.empty() && !h.inside(I.front())){ dq.pop_front(); I.pop_front(); }\n if(!dq.empty() && eq(cross(dir(dq.back()), dir(h)), 0)){\n if(h.inside(dq.back().l.a)) dq.back() = h;\n return;\n }\n if(!dq.empty()) I.push_back(cpLL(dq.back().l, h.l));\n dq.push_back(h);\n };\n\n for(auto &h: H) push_hp(h);\n\n while(!I.empty() && !dq.front().inside(I.back())){ dq.pop_back(); I.pop_back(); } // Be cafeful for front, back.\n while(!I.empty() && !dq.back().inside(I.front())){ dq.pop_front(); I.pop_front(); }\n\n if(dq.size()<3) return {};\n\n G2 poly; poly.reserve(dq.size());\n int n = dq.size();\n rep(i,n) poly.push_back(cpLL(dq[i].l, dq[(i+1)%n].l));\n return poly;\n}\n\n// === end: Half-Plane Intersection ===\n\n\n\n\nvoid solve() {\n ll n;cin>>n;\n G2 g(n);\n rep(i, n) {\n ld x, y;cin>>x>>y;\n x *= 10000.0L/9999.0L;\n y *= 10000.0L/9999.0L;\n P2 p(x, y);\n g[i] = p;\n }\n ll q;cin>>q;\n while(q--) {\n P2 p;rd(p);\n cout << ((inConvex(g, p) >= 1)? 1 : 0 )<< \"\\n\";\n }\n}\n\nint main() {\n cin.tie(0);\n ios_base::sync_with_stdio(false);\n int t = 1;\n while (t--) {\n solve();\n }\n return 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 4160, "score_of_the_acc": -0.525, "final_rank": 6 }, { "submission_id": "aoj_0412_10875272", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ld=long double;\n#define fi first\n#define se second\n#define i128 __int128_t\n#define all(x) x.begin(),x.end()\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define si(a) (long)(a.size())\ntemplate<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}\ntemplate<typename T>bool chmax(T&a,T b){return b>a?(a=b,1):0;}\nconst int INF=1e9+100;\nconst long INFL=3e18+100;\nstruct _ {\n _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }\n} __;\n\nusing Real=ld;\nusing Point=complex<Real>;\nReal EPS=1e-12;\nReal cross(const Point &a, const Point &b){\n return (a.real()*b.imag()-a.imag()*b.real());\n}\nReal dot(const Point &a, const Point &b){\n return (a.real()*b.real()+a.imag()*b.imag());\n}\nint isContained(const vector<Point>&g, const Point &p){\n bool in=false;\n int n=si(g);\n rep(i,n){\n Point a=g[i]-p;\n Point b=g[(i+1)%n]-p;\n if(imag(a)>imag(b)) swap(a,b);\n if(imag(a)<=EPS&&EPS<imag(b)&&cross(a,b)<-EPS) in=!in;\n if(cross(a,b)==0&&dot(a,b)<=0) return 1;\n }\n return (in?2:0);\n}\nint ccw(const Point &a, const Point &b, const Point &c) {\n Point d = b - a;\n Point e = c - a;\n if (cross(d, e) > EPS) return 1;\n if (cross(d, e) < -EPS) return -1;\n if (dot(d, e) < 0) return 2;\n if (norm(d) < norm(e)) return -2;\n return 0;\n}\n\nint main(){\n ld H=1e6;\n \n int N;\n cin>>N;\n \n vector<Point> P(N);\n rep(i,N){\n ld x,y;\n cin>>x>>y;\n \n x=x/(H-100)*H;\n y=y/(H-100)*H;\n P[i]={x,y};\n }\n int Q;\n cin>>Q;\n rep(_,Q){\n ld x,y;\n cin>>x>>y;\n\n int ok=1;\n int ng=N-1;\n while(ng-ok>1){\n int m=(ok+ng)/2;\n if(ccw(P[0], {x,y}, P[m])==-1) ok=m;\n else ng=m;\n }\n vector<Point> g={P[0],P[ok],P[ok+1]};\n if(isContained(g, Point(x,y))){\n cout<<1<<\"\\n\";\n }\n else{\n cout<<0<<\"\\n\";\n }\n }\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 4352, "score_of_the_acc": -0.3238, "final_rank": 1 }, { "submission_id": "aoj_0412_10873526", "code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, l, n) for(int i = int(l); i < int(n); i++)\n#define ll long long\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n\ntemplate<class T> bool chmin(T &a, T b) {if(a > b) {a = b; return true;} return false;}\ntemplate<class T> bool chmax(T &a, T b) {if(a < b) {a = b; return true;} return false;}\ntemplate<class T> using spq = priority_queue<T, vector<T>, greater<T>>;\n\n// bool -> Yes/No\nstring answer(bool b) {return b ? \"Yes\" : \"No\";}\n\nvoid fix(int k) {cout << fixed << setprecision(k);}\n\nconst int inf = 2e9;\nconst long long INF = 2e18;\nconst long double eps = 1e-12;\nint dx[] = {0, -1, 0, 1, -1, -1, 1, 1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};\n\nusing ld = long double;\n\nbool inside(vector<ld> &vec, ld y) {\n if(vec.empty()) return false;\n assert(int(vec.size()) == 2);\n ld a = vec[0], b = vec[1];\n return (min(a, b) <= y && y <= max(a, b));\n}\n\nvoid main_program() {\n int n; cin >> n;\n ld x[n], y[n];\n rep(i, 0, n) cin >> x[i] >> y[i];\n int q; cin >> q;\n int qx[q], qy[q];\n rep(i, 0, q) cin >> qx[i] >> qy[i];\n ld k = 10000.00 / 9999.00;\n rep(i, 0, n) {\n x[i] *= k;\n y[i] *= k;\n }\n map<int, int> mp;\n rep(i, 0, q) mp[qx[i]] = -1;\n int m = mp.size();\n ld p[m]; vector<ld> lst[m];\n int idx = 0;\n for(auto[key, val] : mp) {\n p[idx] = key;\n mp[key] = idx++;\n }/*\n fix(10);\n rep(i, 0, n) {\n cout << x[i] << \" \" << y[i] << \"\\n\";\n }*/\n rep(i, 0, n) {\n ld ax = x[i], ay = y[i];\n ld bx = x[(i + 1) % n], by = y[(i + 1) % n];\n if(ax > bx) swap(ax, bx), swap(ay, by);\n int d = lower_bound(p, p + m, ax) - p;\n //cout << i << \" : \";\n //cout << ax << \",\" << ay << \" , \" << bx << \",\" << by << \"\\n\";\n while(d < m && p[d] < bx) {\n ld xx = ax - p[d], yy = p[d] - bx;\n ld res = xx * by + yy * ay;\n lst[d++].emplace_back(res / (xx + yy));\n }\n }/*\n fix(10);\n rep(i, 0, m) {\n for(ld s : lst[i]) {\n cout << s << \" \";\n }\n cout << \"\\n\";\n }*/\n rep(i, 0, q) {\n idx = mp[qx[i]];\n cout << inside(lst[idx], qy[i]) << \"\\n\";\n }\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int T = 1;\n //cin >> T;\n while(T--) {\n main_program();\n }\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 12564, "score_of_the_acc": -1.2222, "final_rank": 11 }, { "submission_id": "aoj_0412_10864156", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define oke cout << \"Yes\" << '\\n';\n#define dame cout << \"No\" << '\\n';\n#define all(a) a.begin(), a.end()\n#define rall(a) a.rbegin(), a.rend()\nusing HaiI = vector<vector<int>>;\nusing Hai2 = vector<vector<ll>>;\nusing HaiB = vector<vector<bool>>;\nusing Hai3 = vector<vector<vector<ll>>>;\n\nusing Point=complex<double>;\ndouble PI=3.141526;\ndouble EPS=1e-10;\n\ninline bool equal(const double &a, const double &b) {\n return fabs(a - b) < 1e-10;\n}\n\n// 単位ベクトル(unit vector)を求める\nPoint unitVector(const Point &a) { return a / abs(a); }\n\n// 法線ベクトル(normal vector)を求める\n// 90度回転した単位ベクトルをかける\n// -90度がよければPoint(0, -1)をかける\nPoint normalVector(const Point &a) { return a * Point(0, 1); }\n\n// 内積(dot product) : a・b = |a||b|cosΘ\ndouble dot(const Point &a, const Point &b) {\n return (a.real() * b.real() + a.imag() * b.imag());\n}\n\n// 外積(cross product) : a×b = |a||b|sinΘ\ndouble cross(const Point &a, const Point &b) {\n return (a.real() * b.imag() - a.imag() * b.real());\n}\n\n// 点pを反時計回りにtheta度回転\nPoint rotate(const Point &p, const double &theta) {\n return Point(cos(theta) * p.real() - sin(theta) * p.imag(),\n sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\n// ラジアン->度\ndouble radianToDegree(const double &radian) { return radian * 180.0 / PI; }\n\n// 度->ラジアン\ndouble degreeToRadian(const double &degree) { return degree * PI / 180.0; }\n\n// g は凸多角形 (CCW), p は判定点\n// 含まれる:2, 辺上にある:1, 含まれない:0\nint isContained(const vector<Point>& g, const Point& p) {\n int n = (int)g.size();\n const Point &g0 = g[0];\n\n // g0 より左にあるかチェック\n if (cross(g[1] - g0, p - g0) < -EPS) return 0;\n if (cross(g[n-1] - g0, p - g0) > EPS) return 0;\n\n // 辺上チェック (g0-g1, g0-gn-1 上)\n if (fabs(cross(g[1] - g0, p - g0)) <= EPS &&\n\t\tdot(g[1] - g0, p - g0) >= -EPS &&\n\t\tdot(g[0] - g[1], p - g[1]) >= -EPS) return 1;\n if (fabs(cross(g[n-1] - g0, p - g0)) <= EPS &&\n dot(g[n-1] - g0, p - g0) >= -EPS &&\n dot(g[0] - g[n-1], p - g[n-1]) >= -EPS) return 1;\n\n // 扇の中 → 二分探索\n int l = 1, r = n - 1;\n while (r - l > 1) {\n int m = (l + r) / 2;\n if (cross(g[m] - g0, p - g0) >= 0) l = m;\n else r = m;\n }\n\n // 三角形 (g0, g[l], g[l+1]) 内か判定\n double c = cross(g[l+1] - g[l], p - g[l]);\n if (fabs(c) <= EPS) return 1; // 辺上\n return (c > 0 ? 2 : 0);\n}\n\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tcout << fixed << setprecision(15);\n\tint N;\n\tcin>>N;\n\tvector<Point> G(N);\n\tdouble Z=1e6;\n\trep(i,N){\n\t\tdouble a,b;\n\t\tcin>>a>>b;\n\t\ta=a*Z/(Z-100);\n\t\tb=b*Z/(Z-100);\n\t\tG[i]=Point(a,b);\n\t}\n\tint Q;\n\tcin>>Q;\n\trep(i,Q){\n\t\tdouble x,y;\n\t\tcin>>x>>y;\n\t\tPoint R(x,y);\n\t\tint t = isContained(G,R);\n\t\tif(t==2){\n\t\t\tt=1;\n\t\t}else if(t==1){\n\t\t\tt=0;\n\t\t}\n\n\t\tcout<<t<<\"\\n\";\n\t}\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3588, "score_of_the_acc": -0.3513, "final_rank": 3 }, { "submission_id": "aoj_0412_10854804", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <numbers>\n#include <cassert>\n#include <numeric>\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pint = pair<int, int>;\ntemplate<typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\ntemplate<typename T>\nbool chmax(T & a, const T & b) { if (a < b) { a = b; return true; } return false; }\ntemplate<typename T>\nbool chmin(T & a, const T & b) { if (a > b) { a = b; return true; } return false; }\nconst int inf = 1e9;\nconst ll linf = 1e18;\nconst int dy[] = { 0,0,1,-1 }, dx[] = { 1,-1,0,0 };\nstruct vecd {\n double x, y;\n double len() { return sqrt(x * x + y * y); }\n vecd operator+(const vecd& other) const {\n return { x + other.x,y + other.y };\n }\n vecd operator-(const vecd& other) const {\n return { x - other.x,y - other.y };\n }\n vecd operator*(const double& n) const {\n return { x * n,y * n };\n }\n vecd& operator+=(const vecd& other) {\n x += other.x, y += other.y;\n return *this;\n }\n vecd& operator-=(const vecd& other) {\n x -= other.x, y -= other.y;\n return *this;\n }\n bool operator<(const vecd& other) const {\n if (x == other.x)return y < other.y;\n else return x < other.x;\n }\n};\ndouble cross(vecd a, vecd b, vecd c) {\n vecd d1 = a - b;\n vecd d2 = c - b;\n return d1.x * d2.y - d2.x * d1.y;\n}\nint main() {\n int n; cin >> n;\n vector<vecd> ps(n);\n rep(i, n)cin >> ps[i].x >> ps[i].y;\n int q; cin >> q;\n rep(i, q) {\n vecd p;\n cin >> p.x >> p.y;\n p.x *= 1.0 - 100.0 / 1000000;\n p.y *= 1.0 - 100.0 / 1000000;\n int left = 2, right = n;\n while (left + 1 < right) {\n int mid = (left + right) / 2;\n if (cross(ps[0], ps[mid - 1], p) > 0) right = mid;\n else left = mid;\n }\n double c1 = cross(p, ps[left - 1], ps[0]);\n double c2 = cross(p, ps[0], ps[left]);\n double c3 = cross(p, ps[left], ps[left - 1]);\n if (c1 < 0 || c2 < 0 || c3 < 0)cout << 0 << endl;\n else cout << 1 << endl;\n }\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 3968, "score_of_the_acc": -0.7262, "final_rank": 7 }, { "submission_id": "aoj_0412_10825146", "code_snippet": "// Nyaan 大先生いつもお世話になっております。\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug.hpp>\n#else\n#define debug(...)\n#endif\n\nusing ld = long double;\nconstexpr ld EPS = 1e-10;\nconst ld PI = acos(-1);\n\nbool equals(ld a, ld b) { return abs(b - a) < EPS; }\nint sign(ld a) { return equals(a, 0) ? 0 : (a > 0 ? 1 : -1); }\n\ntemplate <class R>\nstruct Point {\n R x, y;\n Point() : x(0), y(0) {}\n template <class T, class U>\n Point(T x0, U y0) : x(x0), y(y0) {}\n template <class T, class U>\n Point(const pair<T, U>& p) : x(p.first), y(p.second) {}\n\n Point operator-() const { return Point(-x, -y); }\n Point operator+(const Point& p) const { return Point(*this) += p; }\n Point operator-(const Point& p) const { return Point(*this) -= p; }\n Point operator*(const R& k) const { return Point(*this) *= k; }\n Point operator/(const R& k) const { return Point(*this) /= k; }\n Point& operator+=(const Point& p) {\n x += p.x, y += p.y;\n return *this;\n }\n Point& operator-=(const Point& p) {\n x -= p.x, y -= p.y;\n return *this;\n }\n Point& operator*=(const R& k) {\n x *= k, y *= k;\n return *this;\n }\n Point& operator/=(const R& k) {\n x /= k, y /= k;\n return *this;\n }\n bool operator<(const Point& p) const { return x != p.x ? x < p.x : y < p.y; }\n bool operator==(const Point& p) const { return x == p.x && y == p.y; }\n bool operator!=(const Point& p) const { return x != p.x || y != p.y; }\n Point rotate(ld theta) const { return Point(x * cos(theta) - y * sin(theta), x * sin(theta) + y * cos(theta)); }\n friend R dot(const Point& p, const Point& q) { return p.x * q.x + p.y * q.y; }\n friend R cross(const Point& p, const Point& q) { return p.x * q.y - p.y * q.x; }\n friend R norm(const Point& p) { return dot(p, p); }\n friend ld abs(const Point& p) { return sqrt(norm(p)); }\n friend ld arg(const Point& p) { return atan2(p.y, p.x); }\n friend Point round(const Point& p) { return Point(round(p.x), round(p.y)); }\n friend istream& operator>>(istream& is, Point& p) { return is >> p.x >> p.y; }\n friend ostream& operator<<(ostream& os, const Point& p) { return os << p.x << \" \" << p.y; }\n};\n\n// 多角形\ntemplate <class R>\nusing Polygon = vector<Point<R>>;\n\n// 凸多角形 C の内部に点 x があるか\n// out: 0, on: 1, in: 2\ntemplate <class R>\nint contains_convex(const Polygon<R>& C, const Point<R>& p) {\n int N = C.size();\n auto b1 = cross(C[1] - C[0], p - C[0]), b2 = cross(C[N - 1] - C[0], p - C[0]);\n if (b1 < -EPS || b2 > EPS) return 0;\n\n int left = 1, right = N - 1;\n while (right - left > 1) {\n int mid = (right + left) / 2;\n (cross(p - C[0], C[mid] - C[0]) >= 0 ? right : left) = mid;\n }\n auto v = cross(C[left] - p, C[right] - p);\n if (equals(v, 0)) {\n return 1;\n } else if (v > 0) {\n return (equals(b1, 0) || equals(b2, 0)) ? 1 : 2;\n }\n return 0;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N;\n cin >> N;\n Polygon<ld> C(N);\n // 影の i 点目は 10^6 / (10^6 - 100) 倍の位置\n for (int i = 0; i < N; i++) {\n ld x, y;\n cin >> x >> y, x *= 10000, y *= 10000;\n C[i] = {x, y};\n }\n int Q;\n cin >> Q;\n while (Q--) {\n Point<ld> P;\n cin >> P, P.x *= 9999, P.y *= 9999;\n // C の内部に P があるかどうか判定\n cout << (contains_convex(C, P) == 2 ? 1 : 0) << '\\n';\n }\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 4352, "score_of_the_acc": -0.3238, "final_rank": 1 }, { "submission_id": "aoj_0412_10825142", "code_snippet": "// Nyaan 大先生いつもお世話になっております。\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug.hpp>\n#else\n#define debug(...)\n#endif\n\nusing ld = long double;\nconstexpr ld EPS = 1e-10;\nconst ld PI = acos(-1);\n\nbool equals(ld a, ld b) { return abs(b - a) < EPS; }\nint sign(ld a) { return equals(a, 0) ? 0 : (a > 0 ? 1 : -1); }\n\ntemplate <class R>\nstruct Point {\n R x, y;\n Point() : x(0), y(0) {}\n template <class T, class U>\n Point(T x0, U y0) : x(x0), y(y0) {}\n template <class T, class U>\n Point(const pair<T, U>& p) : x(p.first), y(p.second) {}\n\n Point operator-() const { return Point(-x, -y); }\n Point operator+(const Point& p) const { return Point(*this) += p; }\n Point operator-(const Point& p) const { return Point(*this) -= p; }\n Point operator*(const R& k) const { return Point(*this) *= k; }\n Point operator/(const R& k) const { return Point(*this) /= k; }\n Point& operator+=(const Point& p) {\n x += p.x, y += p.y;\n return *this;\n }\n Point& operator-=(const Point& p) {\n x -= p.x, y -= p.y;\n return *this;\n }\n Point& operator*=(const R& k) {\n x *= k, y *= k;\n return *this;\n }\n Point& operator/=(const R& k) {\n x /= k, y /= k;\n return *this;\n }\n bool operator<(const Point& p) const { return x != p.x ? x < p.x : y < p.y; }\n bool operator==(const Point& p) const { return x == p.x && y == p.y; }\n bool operator!=(const Point& p) const { return x != p.x || y != p.y; }\n Point rotate(ld theta) const { return Point(x * cos(theta) - y * sin(theta), x * sin(theta) + y * cos(theta)); }\n friend R dot(const Point& p, const Point& q) { return p.x * q.x + p.y * q.y; }\n friend R cross(const Point& p, const Point& q) { return p.x * q.y - p.y * q.x; }\n friend R norm(const Point& p) { return dot(p, p); }\n friend ld abs(const Point& p) { return sqrt(norm(p)); }\n friend ld arg(const Point& p) { return atan2(p.y, p.x); }\n friend Point round(const Point& p) { return Point(round(p.x), round(p.y)); }\n friend istream& operator>>(istream& is, Point& p) { return is >> p.x >> p.y; }\n friend ostream& operator<<(ostream& os, const Point& p) { return os << p.x << \" \" << p.y; }\n};\n\n// 多角形\ntemplate <class R>\nusing Polygon = vector<Point<R>>;\n\n// 凸多角形 C の内部に点 x があるか\n// out: 0, on: 1, in: 2\ntemplate <class R>\nint contains_convex(const Polygon<R>& C, const Point<R>& p) {\n int N = C.size();\n auto b1 = cross(C[1] - C[0], p - C[0]), b2 = cross(C[N - 1] - C[0], p - C[0]);\n if (b1 < -EPS || b2 > EPS) return 0;\n\n int left = 1, right = N - 1;\n while (right - left > 1) {\n int mid = (right + left) / 2;\n (cross(p - C[0], C[mid] - C[0]) >= 0 ? right : left) = mid;\n }\n auto v = cross(C[left] - p, C[right] - p);\n if (equals(v, 0)) {\n return 1;\n } else if (v > 0) {\n return (equals(b1, 0) || equals(b2, 0)) ? 1 : 2;\n }\n return 0;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N;\n cin >> N;\n Polygon<ld> C(N);\n // 影の i 点目は 10^6 / (10^6 - 100) 倍の位置\n for (int i = 0; i < N; i++) {\n int x, y;\n cin >> x >> y, x *= 10000, y *= 10000;\n C[i] = {x, y};\n }\n int Q;\n cin >> Q;\n while (Q--) {\n Point<ld> P;\n cin >> P, P.x *= 9999, P.y *= 9999;\n // C の内部に P があるかどうか判定\n cout << (contains_convex(C, P) == 2 ? 1 : 0) << '\\n';\n }\n}", "accuracy": 0.18421052631578946, "time_ms": 10, "memory_kb": 3712, "score_of_the_acc": -0.0315, "final_rank": 19 }, { "submission_id": "aoj_0412_9642248", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug_print.hpp>\n#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define debug(...) (static_cast<void>(0))\n#endif\n\nusing ld = long double;\nconstexpr ld EPS = 1e-10;\nconst ld PI = acos(-1);\n\nbool equals(ld a, ld b) { return abs(b - a) < EPS; }\nint sign(ld a) { return equals(a, 0) ? 0 : (a > 0 ? 1 : -1); }\n\ntemplate <class R>\nstruct Point {\n R x, y;\n Point() : x(0), y(0) {}\n Point(R x0, R y0) : x(x0), y(y0) {}\n template <class T, class U>\n Point(const pair<T, U>& p) : x(p.first), y(p.second) {}\n\n // 四則演算\n Point operator-() const { return Point(-x, -y); }\n Point operator+(const Point& p) const { return Point(*this) += p; }\n Point operator-(const Point& p) const { return Point(*this) -= p; }\n Point operator*(const R& k) const { return Point(*this) *= k; }\n Point operator/(const R& k) const { return Point(*this) /= k; }\n Point& operator+=(const Point& p) {\n x += p.x, y += p.y;\n return *this;\n }\n Point& operator-=(const Point& p) {\n x -= p.x, y -= p.y;\n return *this;\n }\n Point& operator*=(const R& k) {\n x *= k, y *= k;\n return *this;\n }\n Point& operator/=(const R& k) {\n x /= k, y /= k;\n return *this;\n }\n\n // 比較演算\n bool operator<(const Point& p) const { return x != p.x ? x < p.x : y < p.y; }\n bool operator==(const Point& p) const { return x == p.x && y == p.y; }\n bool operator!=(const Point& p) const { return !(*this == p); }\n\n Point rotate(ld theta) const { return Point(x * cos(theta) - y * sin(theta), x * sin(theta) + y * cos(theta)); }\n friend R dot(const Point& p, const Point& q) { return p.x * q.x + p.y * q.y; }\n friend R cross(const Point& p, const Point& q) { return p.x * q.y - p.y * q.x; }\n friend R norm(const Point& p) { return dot(p, p); }\n friend ld abs(const Point& p) { return sqrt(norm(p)); }\n friend ld arg(const Point& p) { return atan2(p.y, p.x); }\n friend istream& operator>>(istream& is, Point& p) { return is >> p.x >> p.y; }\n friend ostream& operator<<(ostream& os, const Point& p) { return os << p.x << \" \" << p.y; }\n};\n// a - b - c の位置関係\ntemplate <class R>\nint ccw(const Point<R>& a, const Point<R>& b, const Point<R>& c) {\n Point x = b - a, y = c - a;\n if (cross(x, y) > EPS) return +1; // a - b - c が反時計回り(a - b から見て c が左側)\n if (cross(x, y) < -EPS) return -1; // a - b - c が時計回り(a - b から見て c が右側)\n if (min(norm(x), norm(y)) < EPS * EPS) return 0; // c = a または c = b\n if (dot(x, y) < EPS) return +2; // c - a - b の順で一直線\n if (norm(x) < norm(y)) return -2; // a - b - c の順で一直線\n return 0; // a - c - b の順で一直線\n}\n// 偏角ソート\ntemplate <class R>\nvoid argument_sort(vector<Point<R>>& P) {\n // 領域が負にある場合 1, 領域が正にある場合 0\n auto sign = [&](const Point<R>& p) -> int { return p.y != 0 ? p.y < 0 : p.x > 0; };\n auto arg_cmp = [&](const Point<R>& a, const Point<R>& b) -> bool {\n return (sign(a) != sign(b) ? sign(a) > sign(b) : cross(a, b) != 0 ? cross(a, b) > 0 : norm(a) < norm(b));\n };\n sort(P.begin(), P.end(), arg_cmp);\n}\n\n// 多角形\ntemplate <class R>\nusing Polygon = vector<Point<R>>;\n\n// 多角形 P の内部に点 x があるか: O(N) 時間\n// out: 0, on: 1, in: 2\ntemplate <class R>\nint contains_polygon(const Polygon<R>& P, const Point<R>& x) {\n bool in = false;\n for (int i = 0; i < (int)P.size(); i++) {\n Point a = P[i] - x, b = P[(i + 1) % P.size()] - x;\n if (a.y > b.y) swap(a, b); // a.y < b.y\n if (sign(a.y) <= 0 && sign(b.y) > 0 && sign(cross(a, b)) < 0) in ^= 1;\n if (equals(cross(a, b), 0) && sign(dot(a, b)) <= 0) return 1;\n }\n return in ? 2 : 0;\n}\n\n// 凸多角形 C の内部に点 x があるか: O(log N) 時間\n// out: 0, on: 1, in: 2\ntemplate <class R>\nint contains_convex(const Polygon<R>& C, const Point<R>& p) {\n int N = C.size();\n auto b1 = cross(C[1] - C[0], p - C[0]), b2 = cross(C[N - 1] - C[0], p - C[0]);\n if (b1 < -EPS || b2 > EPS) return 0;\n\n int left = 1, right = N - 1;\n while (right - left > 1) {\n int mid = (right + left) / 2;\n (cross(p - C[0], C[mid] - C[0]) >= 0 ? right : left) = mid;\n }\n auto v = cross(C[left] - p, C[right] - p);\n if (equals(v, 0)) {\n return 1;\n } else if (v > 0) {\n return (equals(b1, 0) || equals(b2, 0)) ? 1 : 2;\n }\n return 0;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N;\n cin >> N;\n Polygon<ld> P(N);\n for (int i = 0; i < N; i++) cin >> P[i];\n\n // 各点 (z = 100) と太陽 (x = y = 0, z = 10^6) を結ぶ直線と平面 (z = 0) の交点を求める\n // P0 := 影の凸多角形\n Polygon<ld> P0(N);\n for (int i = 0; i < N; i++) {\n Point<ld> p = P[i] * 1e6 / (1e6 - 100);\n P0[i] = p;\n }\n\n int Q;\n cin >> Q;\n while (Q--) {\n Point<ld> p;\n cin >> p;\n // 点 p が凸多角形 P0 の内部にあれば 1, 外部にあれば 0\n cout << (contains_convex(P0, p) == 2 ? 1 : 0) << '\\n';\n }\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 4992, "score_of_the_acc": -0.5049, "final_rank": 5 }, { "submission_id": "aoj_0412_9641695", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug_print.hpp>\n#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define debug(...) (static_cast<void>(0))\n#endif\n\nusing ld = long double;\nconstexpr ld EPS = 1e-10;\nconst ld PI = acos(-1);\n\nbool equals(ld a, ld b) { return abs(b - a) < EPS; }\nint sign(ld a) { return equals(a, 0) ? 0 : (a > 0 ? 1 : -1); }\n\ntemplate <class R>\nstruct Point {\n R x, y;\n Point() : x(0), y(0) {}\n Point(R x0, R y0) : x(x0), y(y0) {}\n template <class T, class U>\n Point(const pair<T, U>& p) : x(p.first), y(p.second) {}\n\n // 四則演算\n Point operator-() const { return Point(-x, -y); }\n Point operator+(const Point& p) const { return Point(*this) += p; }\n Point operator-(const Point& p) const { return Point(*this) -= p; }\n Point operator*(const R& k) const { return Point(*this) *= k; }\n Point operator/(const R& k) const { return Point(*this) /= k; }\n Point& operator+=(const Point& p) {\n x += p.x, y += p.y;\n return *this;\n }\n Point& operator-=(const Point& p) {\n x -= p.x, y -= p.y;\n return *this;\n }\n Point& operator*=(const R& k) {\n x *= k, y *= k;\n return *this;\n }\n Point& operator/=(const R& k) {\n x /= k, y /= k;\n return *this;\n }\n\n // 比較演算\n bool operator<(const Point& p) const { return x != p.x ? x < p.x : y < p.y; }\n bool operator==(const Point& p) const { return x == p.x && y == p.y; }\n bool operator!=(const Point& p) const { return !(*this == p); }\n\n Point rotate(ld theta) const { return Point(x * cos(theta) - y * sin(theta), x * sin(theta) + y * cos(theta)); }\n friend R dot(const Point& p, const Point& q) { return p.x * q.x + p.y * q.y; }\n friend R cross(const Point& p, const Point& q) { return p.x * q.y - p.y * q.x; }\n friend R norm(const Point& p) { return dot(p, p); }\n friend ld abs(const Point& p) { return sqrt(norm(p)); }\n friend ld arg(const Point& p) { return atan2(p.y, p.x); }\n friend istream& operator>>(istream& is, Point& p) { return is >> p.x >> p.y; }\n friend ostream& operator<<(ostream& os, const Point& p) { return os << p.x << \" \" << p.y; }\n};\n\ntemplate <class R>\nint ccw(const Point<R>& a, const Point<R>& b, const Point<R>& c) {\n Point x = b - a, y = c - a;\n if (cross(x, y) > EPS) return +1; // a - b - c が反時計回り(a - b から見て c が左側)\n if (cross(x, y) < -EPS) return -1; // a - b - c が時計回り(a - b から見て c が右側)\n if (min(norm(x), norm(y)) < EPS * EPS) return 0; // c = a または c = b\n if (dot(x, y) < EPS) return +2; // c - a - b の順で一直線\n if (norm(x) < norm(y)) return -2; // a - b - c の順で一直線\n return 0; // a - c - b の順で一直線\n}\n\ntemplate <class R>\nstruct Line {\n Point<R> a, b;\n Line() = default;\n Line(const Point<R>& a0, const Point<R>& b0) : a(a0), b(b0) {}\n // Ax + By = C となる直線\n Line(const ld& A, const ld& B, const ld& C) {\n if (equals(A, 0)) {\n assert(!equals(B, 0));\n a = Point(0, C / B);\n b = Point(1, C / B);\n } else if (equals(B, 0)) {\n a = Point(C / A, 0);\n b = Point(C / A, 1);\n } else if (equals(C, 0)) {\n a = Point(0, C / B);\n b = Point(1, (C - A) / B);\n } else {\n a = Point(0, C / B);\n b = Point(C / A, 0);\n }\n }\n friend ostream& operator<<(ostream& os, const Line& l) { return os << l.a << \" to \" << l.b; }\n friend istream& operator>>(istream& is, Line& l) { return is >> l.a >> l.b; }\n};\n\n// 2 直線が平行かどうか\ntemplate <class R>\nbool is_parallel(const Line<R>& a, const Line<R>& b) {\n return equals(cross(a.b - a.a, b.b - b.a), 0);\n}\n// 2 直線が直行かどうか\ntemplate <class R>\nbool is_orthogonal(const Line<R>& a, const Line<R>& b) {\n return equals(dot(a.b - a.a, b.b - b.a), 0);\n}\n// 直線 l に頂点 p から垂線を下ろした交点(射影)\ntemplate <class R>\nPoint<R> projection(const Line<R>& l, const Point<R>& p) {\n ld t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\n// 直線 l を軸に点 p と線対称な点(反射)\ntemplate <class R>\nPoint<R> reflection(const Line<R>& l, const Point<R>& p) {\n return (projection(l, p)) * 2 - p;\n}\n\n// 線分 (直線の継承)\ntemplate <class R>\nstruct Segment : Line<R> {\n Segment() = default;\n};\n\n// 線分 s に点 p が乗っているか\ntemplate <class R>\nbool is_intersect_sp(const Segment<R>& s, const Point<R>& p) {\n return ccw(s.a, s.b, p) == 0;\n}\n// 線分 s と線分 t が交差しているか\ntemplate <class R>\nbool is_intersect_ss(const Segment<R>& s, const Segment<R>& t) {\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 && ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n// 線分 s と点 p の距離\ntemplate <class R>\nld distance_sp(const Segment<R>& s, const Point<R>& p) {\n Point r = projection(s, p);\n if (is_intersect_sp(s, r)) return abs(r - p);\n return min(abs(s.a - p), abs(s.b - p));\n}\n// 線分 s と線分 t の距離\ntemplate <class R>\nld distance_ss(const Segment<R>& s, const Segment<R>& t) {\n if (is_intersect_ss(s, t)) return 0;\n return min({distance_sp(s, t.a), distance_sp(s, t.b), distance_sp(t, s.a), distance_sp(t, s.b)});\n}\n// 直線 / 線分 a, b の交点\ntemplate <class R>\nPoint<R> cross_point(const Line<R>& a, const Line<R>& b) {\n ld A = cross(a.b - a.a, b.b - b.a);\n ld B = cross(a.b - a.a, a.b - b.a);\n if (equals(A, 0) && equals(B, 0)) return b.a;\n return b.a + (b.b - b.a) * B / A;\n}\n// 偏角ソート\ntemplate <class R>\nvoid argument_sort(vector<Point<R>>& P) {\n // 領域が負にある場合 1, 領域が正にある場合 0\n auto sign = [&](const Point<R>& p) -> int { return p.y != 0 ? p.y < 0 : p.x > 0; };\n auto arg_cmp = [&](const Point<R>& a, const Point<R>& b) -> bool {\n return (sign(a) != sign(b) ? sign(a) > sign(b) : cross(a, b) != 0 ? cross(a, b) > 0 : norm(a) < norm(b));\n };\n sort(P.begin(), P.end(), arg_cmp);\n}\n\n// 多角形\ntemplate <class R>\nusing Polygon = vector<Point<R>>;\n\n// 多角形の面積\ntemplate <class R>\nld area(const Polygon<R>& P) {\n ld res = 0;\n for (int i = 0; i < (int)P.size(); i++) {\n res += cross(P[i], P[(i + 1) % P.size()]);\n }\n return abs(res) / 2;\n}\n\n// 多角形 P の内部に点 x があるか\n// out: 0, on: 1, in: 2\ntemplate <class R>\nint contains_polygon(const Polygon<R>& P, const Point<R>& x) {\n bool in = false;\n for (int i = 0; i < (int)P.size(); i++) {\n Point a = P[i] - x, b = P[(i + 1) % P.size()] - x;\n if (a.y > b.y) swap(a, b); // a.y < b.y\n if (sign(a.y) <= 0 && sign(b.y) > 0 && sign(cross(a, b)) < 0) in ^= 1;\n if (equals(cross(a, b), 0) && sign(dot(a, b)) <= 0) return 1;\n }\n return in ? 2 : 0;\n}\n\n// 頂点集合から凸包を構築\n// boundary = true なら凸包の境界上の点も含む\ntemplate <class R, bool boundary = false>\nPolygon<R> convex_hull(vector<Point<R>> ps) {\n sort(ps.begin(), ps.end());\n ps.erase(unique(ps.begin(), ps.end()), ps.end());\n int N = ps.size(), k = 0;\n if (N <= 2) return ps;\n Polygon<R> ch(2 * N);\n // 反時計回り\n ld th = boundary ? -EPS : EPS;\n for (int i = 0; i < N; ch[k++] = ps[i++]) {\n while (k >= 2 && cross(ch[k - 1] - ch[k - 2], ps[i] - ch[k - 1]) < th) --k;\n }\n for (int i = N - 2, t = k + 1; i >= 0; ch[k++] = ps[i--]) {\n while (k >= t && cross(ch[k - 1] - ch[k - 2], ps[i] - ch[k - 1]) < th) --k;\n }\n ch.resize(k - 1);\n return ch;\n}\n\n// 凸多角形の最遠点対\ntemplate <class R>\npair<int, int> convex_polygon_diameter(const Polygon<R>& P) {\n int N = P.size();\n int is = 0, js = 0;\n for (int i = 0; i < N; i++) {\n if (P[i].y > P[is].y) is = i;\n if (P[i].y < P[js].y) js = i;\n }\n R max_dist = norm(P[is] - P[js]);\n int i = is, max_i = is, j = js, max_j = js;\n do {\n if (cross(P[(i + 1) % N] - P[i], P[(j + 1) % N] - P[j]) >= 0) {\n j = (j + 1) % N;\n } else {\n i = (i + 1) % N;\n }\n if (norm(P[i] - P[j]) > max_dist) {\n max_dist = norm(P[i] - P[j]), max_i = i, max_j = j;\n }\n } while (i != is || j != js);\n return minmax(max_i, max_j);\n}\n\n// 凸包を直線で切ったときの片方 (直線 a -> b の進行方向左側) を返す\ntemplate <class R>\nPolygon<R> convex_polygon_cut(const Polygon<R>& P, const Line<R>& l) {\n int N = P.size();\n Polygon<R> res;\n for (int i = 0; i < N; i++) {\n const Point<R>&x = P[i], y = P[(i + 1) % N];\n auto cf = cross(l.a - x, l.b - x), cs = cross(l.a - y, l.b - y);\n if (sign(cf) >= 0) res.emplace_back(x);\n if (sign(cf) * sign(cs) < 0) res.emplace_back(cross_point(Line(x, y), l));\n }\n return res;\n}\n\n// 凸多角形 C の内部に点 x があるか\n// out: 0, on: 1, in: 2\ntemplate <class R>\nint contains_convex(const Polygon<R>& C, const Point<R>& p) {\n int N = C.size();\n auto b1 = cross(C[1] - C[0], p - C[0]), b2 = cross(C[N - 1] - C[0], p - C[0]);\n if (b1 < -EPS || b2 > EPS) return 0;\n\n int left = 1, right = N - 1;\n while (right - left > 1) {\n int mid = (right + left) / 2;\n (cross(p - C[0], C[mid] - C[0]) >= 0 ? right : left) = mid;\n }\n auto v = cross(C[left] - p, C[right] - p);\n if (equals(v, 0)) {\n return 1;\n } else if (v > 0) {\n return (equals(b1, 0) || equals(b2, 0)) ? 1 : 2;\n }\n return 0;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N;\n cin >> N;\n Polygon<ld> P(N);\n for (int i = 0; i < N; i++) cin >> P[i];\n\n // 各点 (z = 100) と太陽 (x = y = 0, z = 10^6) を結ぶ直線と平面 (z = 0) の交点を求める\n Polygon<ld> P0(N);\n for (int i = 0; i < N; i++) {\n Point<ld> p = P[i] * 1e6 / (1e6 - 100);\n P0[i] = p;\n }\n\n int Q;\n cin >> Q;\n while (Q--) {\n Point<ld> p;\n cin >> p;\n // 点 p が凸多角形 P0 の内部にあれば 1, 外部にあれば 0\n cout << (contains_convex(P0, p) == 2 ? 1 : 0) << '\\n';\n }\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 4856, "score_of_the_acc": -0.49, "final_rank": 4 }, { "submission_id": "aoj_0412_9625064", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing i64 = long long;\n#define rep(i, a, b) for (int i = a; i < b; i++)\n\n\nstruct Point {\n double x, y;\n Point() = default;\n Point(double x_, double y_) : x(x_), y(y_) {}\n friend Point operator+(const Point &l, const Point &r) {\n return Point(l.x + r.x, l.y + r.y);\n }\n friend Point operator-(const Point &l, const Point &r) {\n return Point(l.x - r.x, l.y - r.y);\n }\n};\n\nint main() {\n int n;\n cin >> n;\n vector<Point> t(n);\n rep (i, 0, n) {\n cin >> t[i].x >> t[i].y;\n t[i].x *= double(1e6) / (1e6 - 100);\n t[i].y *= double(1e6) / (1e6 - 100);\n }\n\n auto cross = [&](Point a, Point b) -> double {\n return a.x * b.y - a.y * b.x;\n };\n\n sort(begin(t), end(t), [&](Point x, Point y) -> bool {\n if (x.x != y.x) return x.x < y.x;\n return x.y < y.y;\n });\n\n vector<Point> up, down;\n up.push_back(t[0]);\n up.push_back(t[1]);\n down.push_back(t[0]);\n down.push_back(t[1]);\n\n rep (i, 2, n) {\n while ((int)up.size() >= 2 and\n cross(up[up.size() - 1] - up[up.size() - 2],\n t[i] - up[up.size() - 1])\n >= 0) {\n up.pop_back();\n }\n while ((int)down.size() >= 2 and\n cross(down[down.size() - 1] - down[down.size() - 2],\n t[i] - down[down.size() - 1])\n <= 0) {\n down.pop_back();\n }\n up.push_back(t[i]);\n down.push_back(t[i]);\n }\n\n // cout << \"up\" << endl;\n // for (auto p : up) {\n // cout << p.x << \" \" << p.y << endl;\n // }\n // cout << \"down\" << endl;\n // for (auto p : down) {\n // cout << p.x << \" \" << p.y << endl;\n // }\n\n int q;\n cin >> q;\n vector<pair<Point, int>> ps(q);\n rep (i, 0, q) {\n cin >> ps[i].first.x >> ps[i].first.y;\n ps[i].second = i;\n }\n sort(begin(ps), end(ps), [&](auto x, auto y) -> bool {\n if (x.first.x != y.first.x) return x.first.x < y.first.x;\n return x.first.y < y.first.y;\n });\n\n vector<int> res(q);\n int nowup = -1, nowdown = -1;\n rep (i, 0, q) {\n while (nowup < (int)up.size() - 1 and ps[i].first.x > up[nowup + 1].x) ++nowup;\n while (nowdown < (int)down.size() - 1 and ps[i].first.x > down[nowdown + 1].x) ++nowdown;\n // cout << ps[i].second << endl;\n // cout << nowup << \" \" << nowdown << endl;\n if (nowup == -1 or nowup == up.size() - 1 or\n nowdown == -1 or nowdown == down.size() - 1) {\n res[ps[i].second] = 0;\n continue;\n }\n\n if (cross(up[nowup + 1] - up[nowup], ps[i].first - up[nowup]) < 0 and\n cross(down[nowdown + 1] - down[nowdown], ps[i].first - down[nowdown]) > 0) {\n res[ps[i].second] = 1;\n }\n else res[ps[i].second] = 0;\n }\n\n rep (i, 0, q) cout << res[i] << endl;\n\n return 0;\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 5788, "score_of_the_acc": -1.2586, "final_rank": 12 }, { "submission_id": "aoj_0412_9580811", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n;\n\tcin >> n;\n\tvector<pair<long double,long double>> a(n,pair<long double,long double>());\n\tfor(int i = 0;i < n;i++){\n\t\tcin >> a[i].first >> a[i].second;\n\t}\n\ta.push_back(a[0]);\n\tvector<vector<pair<pair<int,int>,int>>> t(2);\n\tfor(int i = 0;i < n;i++){\n\t\tif(a[i].second < a[i + 1].second){\n\t\t\tt[0].push_back({{a[i].second,a[i + 1].second},i});\n\t\t}else{\n\t\t\tt[1].push_back({{a[i + 1].second,a[i].second},i});\n\t\t}\n\t}\n\tsort(t[0].begin(),t[0].end());\n\tsort(t[1].begin(),t[1].end());\n\tint Q;\n\tcin >> Q;\n\tfor(int i = 0;i < Q;i++){\n\t\tpair<long double,long double> p;\n\t\tcin >> p.first >> p.second;\n\t\tp.first *= (long double)(999900) / (long double)(1000000);\n\t\tp.second *= (long double)(999900) / (long double)(1000000);\n\t\tif(p.second < t[0][0].first.first || t[0].back().first.second < p.second){\n\t\t\tcout << 0 << endl;\n\t\t\tcontinue;\n\t\t}\n\t\tpair<int,int> it;\n\t\t{\n\t\t\tint low = 0,high = (int)t[0].size() - 1;\n\t\t\twhile(low < high){\n\t\t\t\tint mid = (low + high + 1) / 2;\n\t\t\t\tif(t[0][mid].first.first <= p.second){\n\t\t\t\t\tlow = mid;\n\t\t\t\t}else{\n\t\t\t\t\thigh = mid - 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tit.first = t[0][low].second;\n\t\t}\n\t\t{\n\t\t\tint low = 0,high = (int)t[1].size() - 1;\n\t\t\twhile(low < high){\n\t\t\t\tint mid = (low + high + 1) / 2;\n\t\t\t\tif(t[1][mid].first.first <= p.second){\n\t\t\t\t\tlow = mid;\n\t\t\t\t}else{\n\t\t\t\t\thigh = mid - 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tit.second = t[1][low].second;\n\t\t}\n\t\tpair<long double,long double> r;\n\t\tif(a[it.first].second == a[it.first + 1].second){\n\t\t\tr.first = a[it.first].first;\n\t\t}else{\n\t\t\tr.first = a[it.first].first + (a[it.first + 1].first - a[it.first].first) * (p.second - a[it.first].second) / (a[it.first + 1].second - a[it.first].second);\n\t\t}\n\t\tif(a[it.second].second == a[it.second + 1].second){\n\t\t\tr.second = a[it.second].first;\n\t\t}else{\n\t\t\tr.second = a[it.second].first + (a[it.second + 1].first - a[it.second].first) * (p.second - a[it.second].second) / (a[it.second + 1].second - a[it.second].second);\n\t\t}\n\t\tif(min(r.first,r.second) <= p.first && p.first <= max(r.first,r.second)){\n\t\t\tcout << 1 << endl;\n\t\t}else{\n\t\t\tcout << 0 << endl;\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 5024, "score_of_the_acc": -1.1751, "final_rank": 9 }, { "submission_id": "aoj_0412_9526450", "code_snippet": "// #define PROBLEM \"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0412\"\n// \n// #include <iostream>\n// \n// #include \"geometry/contain.hpp\"\n// \n// int main() {\n// int N;\n// std::cin >> N;\n// Polygon<double> q(N);\n// std::cin >> q;\n// for (int i = 0; i < N; i++) q[i] *= 1e6 / (1e6 - 1e2);\n// int Q;\n// std::cin >> Q;\n// for (int i = 0; i < Q; i++) {\n// Point<double> p;\n// std::cin >> p;\n// auto res = convex_contain(q, p);\n// if (res == Contain::IN) {\n// std::cout << \"1\\n\";\n// } else if (res == Contain::OUT) {\n// std::cout << \"0\\n\";\n// } else {\n// assert(0);\n// }\n// }\n// return 0;\n// }\n#define PROBLEM \"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0412\"\n\n#include <iostream>\n\n#include <type_traits>\n\n// Constants (EPS, PI)\n// EPS の変更は Constants<T>::set_eps(new_eps) で\ntemplate <class T> struct Constants {\n static T EPS;\n static void set_eps(const T e) { EPS = e; }\n static constexpr T PI = 3.14159'26535'89793L;\n};\n\ntemplate <> double Constants<double>::EPS = 1e-9;\ntemplate <> long double Constants<long double>::EPS = 1e-12;\ntemplate <> long long Constants<long long>::EPS = 0;\n\n// 汎用関数\ntemplate <class T> inline int sign(const T x) { return x < -Constants<T>::EPS ? -1 : (x > Constants<T>::EPS ? 1 : 0); }\ntemplate <class T> inline bool equal(const T a, const T b) { return sign(a - b) == 0; }\ntemplate <class T> inline T radian_to_degree(const T r) { return r * 180.0 / Constants<T>::PI; }\ntemplate <class T> inline T degree_to_radian(const T d) { return d * Constants<T>::PI / 180.0; }\n\n// type traits\ntemplate <class T> using is_geometry_floating_point = typename std::conditional<std::is_same<T, double>::value || std::is_same<T, long double>::value, std::true_type, std::false_type>::type;\ntemplate <class T> using is_geometry_integer = typename std::conditional<std::is_same<T, long long>::value, std::true_type, std::false_type>::type;\ntemplate <class T> using is_geometry = typename std::conditional<is_geometry_floating_point<T>::value || is_geometry_integer<T>::value, std::true_type, std::false_type>::type;\n\n#include <cmath>\n#include <cassert>\n\n// 点\ntemplate <class T> struct Point {\n T x, y;\n\n Point() = default;\n Point(const T x, const T y) : x(x), y(y) {}\n\n Point& operator+=(const Point& p) {\n x += p.x, y += p.y;\n return *this;\n }\n Point& operator-=(const Point& p) {\n x -= p.x, y -= p.y;\n return *this;\n }\n Point& operator*=(const Point& p) {\n static_assert(is_geometry_floating_point<T>::value == true);\n return *this = Point(x * p.x - y * p.y, x * p.y + y * p.x);\n }\n Point& operator/=(const Point& p) {\n static_assert(is_geometry_floating_point<T>::value == true);\n return *this = Point(x * p.x + y * p.y, -x * p.y + y * p.x) / (p.x * p.x + p.y * p.y);\n }\n Point& operator*=(const T k) {\n x *= k, y *= k;\n return *this;\n }\n Point& operator/=(const T k) {\n static_assert(is_geometry_floating_point<T>::value == true);\n x /= k, y /= k;\n return *this;\n }\n\n Point operator+() const { return *this; }\n Point operator-() const { return Point(-x, -y); }\n\n friend Point operator+(const Point& a, const Point& b) { return Point(a) += b; }\n friend Point operator-(const Point& a, const Point& b) { return Point(a) -= b; }\n friend Point operator*(const Point& a, const Point& b) { return Point(a) *= b; }\n friend Point operator/(const Point& a, const Point& b) { return Point(a) /= b; }\n friend Point operator*(const Point& p, const T k) { return Point(p) *= k; }\n friend Point operator/(const Point& p, const T k) { return Point(p) /= k; }\n\n // 辞書式順序\n friend bool operator<(const Point& a, const Point& b) { return a.x == b.x ? a.y < b.y : a.x < b.x; }\n friend bool operator>(const Point& a, const Point& b) { return a.x == b.x ? a.y > b.y : a.x > b.x; }\n friend bool operator==(const Point& a, const Point& b) { return a.x == b.x and a.y == b.y; }\n\n // I/O\n friend std::istream& operator>>(std::istream& is, Point& p) { return is >> p.x >> p.y; }\n friend std::ostream& operator<<(std::ostream& os, const Point& p) { return os << '(' << p.x << ' ' << p.y << ')'; }\n};\n\n// 汎用関数\n// 点の一致判定\ntemplate <class T> inline bool equal(const Point<T>& a, const Point<T>& b) { return equal(a.x, b.x) and equal(a.y, b.y); }\n// 内積\ntemplate <class T> inline T dot(const Point<T>& a, const Point<T>& b) { return a.x * b.x + a.y * b.y; }\n// 外積\ntemplate <class T> inline T cross(const Point<T>& a, const Point<T>& b) { return a.x * b.y - a.y * b.x; }\n// rad ラジアンだけ反時計回りに回転\ntemplate <class T> inline Point<T> rotate(const Point<T>& p, const T theta) {\n static_assert(is_geometry_floating_point<T>::value == true);\n return p * Point<T>(std::cos(theta), std::sin(theta));\n}\n// (x, y) の辞書式順序 (誤差許容)\ntemplate <class T> inline bool compare_x(const Point<T>& a, const Point<T>& b) { return equal(a.x, b.x) ? sign(a.y - b.y) < 0 : sign(a.x - b.x) < 0; }\n// (y, x) の辞書式順序 (誤差許容)\ntemplate <class T> inline bool compare_y(const Point<T>& a, const Point<T>& b) { return equal(a.y, b.y) ? sign(a.x - b.x) < 0 : sign(a.y - b.y) < 0; }\n// 整数のまま行う偏角ソート\n// 無限の精度をもつ arg(p) = atan2(y, x) で比較し, 同じ場合は norm(p) で比較 (atan2(0, 0) = 0 とする)\n// 基本的に (-PI, PI] でソートされ, 点 (0, 0) は (-PI, 0) と [0, PI] の間に入る\n// https://ngtkana.hatenablog.com/entry/2021/11/13/202103\n// https://judge.yosupo.jp/problem/sort_points_by_argument\ntemplate <class T> inline bool compare_atan2(const Point<T>& a, const Point<T>& b) {\n static_assert(is_geometry_integer<T>::value == true);\n if ((Point<T>(a.y, -a.x) > Point<T>(0, 0)) == (Point<T>(b.y, -b.x) > Point<T>(0, 0))) { // a, b in (-PI, 0] or a, b in (0, PI]\n if (a.x * b.y != a.y * b.x) return a.x * b.y > a.y * b.x; // cross(a, b) != 0\n return a == Point<T>(0, 0) ? b.x > 0 and b.y == 0 : (b == Point<T>(0, 0) ? a.y < 0 : norm(a) < norm(b));\n }\n return Point<T>(a.y, -a.x) < Point<T>(b.y, -b.x);\n}\n// 絶対値の 2 乗\ntemplate <class T> inline T norm(const Point<T>& p) { return p.x * p.x + p.y * p.y; }\n// 絶対値\ntemplate <class T> inline T abs(const Point<T>& p) {\n static_assert(is_geometry_floating_point<T>::value == true);\n return std::sqrt(norm(p));\n}\n// 偏角\ntemplate <class T> inline T arg(const Point<T>& p) {\n static_assert(is_geometry_floating_point<T>::value == true);\n return std::atan2(p.y, p.x); // (-PI, PI]\n}\n// 共役複素数 (x 軸について対象な点)\ntemplate <class T> inline Point<T> conj(const Point<T>& p) { return Point(p.x, -p.y); }\n// 極座標系 -> 直交座標系 (絶対値が rho で偏角が theta ラジアン)\ntemplate <class T> inline Point<T> polar(const T rho, const T theta = T(0)) {\n static_assert(is_geometry_floating_point<T>::value == true);\n assert(sign(rho) >= 0);\n return Point<T>(std::cos(theta), std::sin(theta)) * rho;\n}\n// ccw の戻り値\nenum class Ccw {\n COUNTER_CLOCKWISE = 1, // a->b->c 反時計回り\n CLOCKWISE = -1, // a->b->c 時計回り\n ONLINE_BACK = 2, // c->a->b 直線\n ONLINE_FRONT = -2, // a->b->c 直線\n ON_SEGMENT = 0 // a->c->b 直線\n};\n// 点 a, b, c の位置関係\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\ntemplate <class T> Ccw ccw(const Point<T>& a, const Point<T>& b, const Point<T>& c) {\n Point<T> ab = b - a;\n Point<T> ac = c - a;\n if (sign(cross(ab, ac)) == 1) return Ccw::COUNTER_CLOCKWISE;\n if (sign(cross(ab, ac)) == -1) return Ccw::CLOCKWISE;\n if (sign(dot(ab, ac)) == -1) return Ccw::ONLINE_BACK;\n if (sign(norm(ab) - norm(ac)) == -1) return Ccw::ONLINE_FRONT;\n return Ccw::ON_SEGMENT;\n}\n// 線分 a -> b から 線分 a -> c までの角度 (ラジアンで -PI より大きく PI 以下)\ntemplate <class T> T get_angle(const Point<T>& a, const Point<T>& b, const Point<T>& c) {\n Point<T> ab = b - a;\n Point<T> ac = c - a;\n // a-bが x 軸になるように回転\n ac *= conj(ab) / norm(ab);\n return arg(ac); // (-PI, PI]\n}\n\n#include <vector>\n\n// 多角形\ntemplate <class T> using Polygon = std::vector<Point<T>>;\ntemplate <class T> std::istream& operator>>(std::istream& is, Polygon<T>& p) {\n for (auto&& pi : p) is >> pi;\n return is;\n}\ntemplate <class T> std::ostream& operator<<(std::ostream& os, const Polygon<T>& p) {\n for (auto&& pi : p) os << pi << \" -> \";\n return os;\n}\n\n// 多角形の面積 (符号付き)\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A\n// return area * 2\ntemplate <class T> T area2(const Polygon<T>& p) {\n const int n = (int)(p.size());\n assert(n >= 2);\n T res = T(0);\n for (int i = 0; i < n; i++) res += cross(p[i], p[i + 1 == n ? 0 : i + 1]);\n // counter clockwise: res > 0\n // clockwise: res < 0\n return res;\n}\ntemplate <class T> T area(const Polygon<T>& p) {\n static_assert(is_geometry_floating_point<T>::value == true);\n return area2(p) / T(2);\n}\n\n// 多角形の凸判定 (角度が 0 でも PI でも許容)\n// 許容したくないときには ON_SEGMENT, ONLINE_FRONT, ONLINE_BACK が出てきたら false を返せば OK\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\ntemplate <class T> bool is_convex(const Polygon<T>& p) {\n const int n = (int)(p.size());\n assert(n >= 3);\n bool okccw = true, okcw = true;\n for (int i = 0; i < n; i++) {\n auto res = ccw(p[i], p[i + 1 >= n ? i + 1 - n : i + 1], p[i + 2 >= n ? i + 2 - n : i + 2]);\n if (res == Ccw::CLOCKWISE) okccw = false;\n if (res == Ccw::COUNTER_CLOCKWISE) okcw = false;\n if (!okccw and !okcw) return false;\n }\n return true;\n}\n\n// 直線\ntemplate <class T> struct Line {\n Point<T> a, b;\n\n Line() = default;\n Line(const Point<T>& a, const Point<T>& b) : a(a), b(b) {}\n\n // Ax + By = C\n Line(const T A, const T B, const T C) {\n static_assert(is_geometry_floating_point<T>::value == true);\n assert(!(equal(A, T(0)) and equal(B, T(0))));\n if (equal(A, T(0))) {\n a = Point<T>(T(0), C / B), b = Point<T>(T(1), C / B);\n } else if (equal(B, T(0))) {\n a = Point<T>(C / A, T(0)), b = Point<T>(C / A, T(1));\n } else if (equal(C, T(0))) {\n a = Point<T>(T(0), T(0)), b = Point<T>(T(1), -A / B);\n } else {\n a = Point<T>(T(0), C / B), b = Point<T>(C / A, T(0));\n }\n }\n\n friend std::istream& operator>>(std::istream& is, Line& p) { return is >> p.a >> p.b; }\n friend std::ostream& operator<<(std::ostream& os, const Line& p) { return os << p.a << \"->\" << p.b; }\n};\n\n// 線分\ntemplate <class T> struct Segment : Line<T> {\n Segment() = default;\n\n Segment(const Point<T>& a, const Point<T>& b) : Line<T>(a, b) {}\n};\n\n// 点 p から直線 l に下ろした垂線と直線 l の交点\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\ntemplate <class T> Point<T> projection(const Line<T>& l, const Point<T>& p) {\n static_assert(is_geometry_floating_point<T>::value == true);\n T t = dot(p - l.a, l.b - l.a) / norm(l.b - l.a);\n return l.a + (l.b - l.a) * t;\n}\n\n// 直線 l に関して点 p と対象な位置にある点\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\ntemplate <class T> Point<T> reflection(const Line<T>& l, const Point<T>& p) {\n static_assert(is_geometry_floating_point<T>::value == true);\n return p + (projection(l, p) - p) * T(2);\n}\n\n// 直線 l1, l2 の垂直判定\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\ntemplate <class T> inline bool is_orthogonal(const Line<T>& l1, const Line<T>& l2) { return sign(dot(l1.b - l1.a, l2.b - l2.a)) == 0; }\n\n// 直線 l1, l2 の平行判定\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\ntemplate <class T> inline bool is_parallel(const Line<T>& l1, const Line<T>& l2) { return sign(cross(l1.b - l1.a, l2.b - l2.a)) == 0; }\n\n// 円\ntemplate <class T> struct Circle {\n Point<T> o;\n T r;\n\n Circle() = default;\n Circle(const Point<T>& o, const T r) : o(o), r(r) {}\n\n friend std::istream& operator>>(std::istream& is, Circle& c) { return is >> c.o >> c.r; }\n friend std::ostream& operator<<(std::ostream& os, const Circle& c) { return os << c.o << \", \" << c.r; }\n};\n\n// 共通接線の本数\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A\ntemplate <class T> int tangent_number(Circle<T> c1, Circle<T> c2) {\n if (c1.r < c2.r) std::swap(c1, c2);\n const T d2 = norm(c1.o - c2.o);\n if (sign(d2 - (c1.r + c2.r) * (c1.r + c2.r)) == 1) return 4; // d > c1.r + c2.r and c1.r + c2.r >= 0 <=> d ^ 2 > (c1.r + c2.r) ^ 2\n if (sign(d2 - (c1.r + c2.r) * (c1.r + c2.r)) == 0) return 3; // d = c1.r + c2.r and c1.r + c2.r >= 0 <=> d ^ 2 = (c1.r + c2.r) ^ 2\n if (sign(d2 - (c1.r - c2.r) * (c1.r - c2.r)) == 1) return 2; // d > c1.r - c2.r and c1.r - c2.r >= 0 <=> d ^ 2 > (c1.r - c2.r) ^ 2\n if (sign(d2 - (c1.r - c2.r) * (c1.r - c2.r)) == 0) return 1; // d = c1.r - c2.r and c1.r - c2.r >= 0 <=> d ^ 2 = (c1.r - c2.r) ^ 2\n return 0;\n}\n\n// 交差判定 (直線, 線分, 円, 点)\n// 直線 l1, l2 の交差判定\ntemplate <class T> bool is_intersect(const Line<T>& l1, const Line<T>& l2) {\n Point<T> base = l1.b - l1.a;\n T d12 = cross(base, l2.b - l2.a);\n T d1 = cross(base, l1.b - l2.a);\n // sign(d12) != 0 -> 平行でないので交差する\n // sign(d12) == 0 and sign(d1) == 0 -> 一致するので交差する\n return sign(d12) != 0 or sign(d1) == 0;\n}\n// 直線 l, 点 p の交差判定\ntemplate <class T> inline bool is_intersect(const Line<T>& l, const Point<T>& p) {\n auto res = ccw(l.a, l.b, p);\n return res == Ccw::ONLINE_BACK or res == Ccw::ONLINE_FRONT or res == Ccw::ON_SEGMENT;\n}\ntemplate <class T> bool is_intersect(const Point<T>& p, const Line<T>& l) { return is_intersect(l, p); }\n\n// 線分 s, 点 p の交差判定\ntemplate <class T> inline bool is_intersect(const Segment<T>& s, const Point<T>& p) { return ccw(s.a, s.b, p) == Ccw::ON_SEGMENT; }\ntemplate <class T> inline bool is_intersect(const Point<T>& p, const Segment<T>& s) { return ccw(s.a, s.b, p) == Ccw::ON_SEGMENT; }\n\n// 直線 l, 線分 s の交差判定\ntemplate <class T> bool is_intersect(const Line<T>& l, const Segment<T>& s) {\n // s.a と s.b が直線 l に関して同じ側 (直線上を除き) にある場合に限り交差しない\n auto c1 = ccw(l.a, l.b, s.a);\n auto c2 = ccw(l.a, l.b, s.b);\n return !((c1 == c2) and (c1 == Ccw::CLOCKWISE or c1 == Ccw::COUNTER_CLOCKWISE));\n}\ntemplate <class T> bool is_intersect(const Segment<T>& s, const Line<T>& l) { return is_intersect(l, s); }\n\n// 線分 s1, s2 の交差判定\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\ntemplate <class T> inline bool is_intersect(const Segment<T>& s1, const Segment<T>& s2) {\n auto c1 = ccw(s1.a, s1.b, s2.a);\n auto c2 = ccw(s1.a, s1.b, s2.b);\n auto c3 = ccw(s2.a, s2.b, s1.a);\n auto c4 = ccw(s2.a, s2.b, s1.b);\n // 平行な場合: 重なるなら 1 次元で考えると必ず端点のどれかがもう一方の線分上にある\n if (c1 == Ccw::ON_SEGMENT or c2 == Ccw::ON_SEGMENT or c3 == Ccw::ON_SEGMENT or c4 == Ccw::ON_SEGMENT) return true;\n // 平行でない場合: 一方の線分の両側にもう一方の線分の端点がある, を線分を入れ替えても成立\n // 平行だが重ならない場合は以下の条件は成立しない\n bool ok1 = ((c1 == Ccw::CLOCKWISE and c2 == Ccw::COUNTER_CLOCKWISE) or (c1 == Ccw::COUNTER_CLOCKWISE and c2 == Ccw::CLOCKWISE));\n bool ok2 = ((c3 == Ccw::CLOCKWISE and c4 == Ccw::COUNTER_CLOCKWISE) or (c3 == Ccw::COUNTER_CLOCKWISE and c4 == Ccw::CLOCKWISE));\n return ok1 and ok2;\n}\n\n// 点 p1, p2 の交差判定\ntemplate <class T> inline bool is_intersect(const Point<T>& p1, const Point<T>& p2) { return equal(p1, p2); }\n\n// 円 c1, c2 の交差判定\ntemplate <class T> inline bool is_intersect(const Circle<T>& c1, const Circle<T>& c2) {\n const int num = tangent_number(c1, c2);\n return 1 <= num and num <= 3;\n}\n\n// 円 c, 点 p の交差判定\ntemplate <class T> inline bool is_intersect(const Circle<T>& c, const Point<T>& p) { return equal(norm(p - c.o), c.r * c.r); }\ntemplate <class T> inline bool is_intersect(const Point<T>& p, const Circle<T>& c) { return equal(norm(p - c.o), c.r * c.r); }\n\n// 円 c, 直線 l の交差判定\ntemplate <class T> inline bool is_intersect(const Circle<T>& c, const Line<T>& l) {\n static_assert(is_geometry_floating_point<T>::value == true);\n // norm(c.o - projection(l, c.o)) が直線 l と 円 c の中心 c.o の距離の 2 乗\n return sign(c.r * c.r - norm(c.o - projection(l, c.o))) >= 0;\n}\ntemplate <class T> inline bool is_intersect(const Line<T>& l, const Circle<T>& c) { return is_intersect(c, l); }\n\n// 円 c, 線分 s の交差判定\ntemplate <class T> inline bool is_intersect(const Circle<T>& c, const Segment<T>& s) {\n static_assert(is_geometry_floating_point<T>::value == true);\n if (!is_intersect(c, Line(s.a, s.b))) return false; // 直線としても交差しない\n T d1 = abs(c.o - s.a), d2 = abs(c.o - s.b);\n if (sign(d1 - c.r) == -1 and sign(d2 - c.r) == -1) return false; // 端点がどちらも円の内側\n if (sign(d1 - c.r) * sign(d2 - c.r) <= 0) return true; // 円周をまたいでいる\n const Point<T> h = projection(s, c.o);\n return ccw(s.a, s.b, h) == Ccw::ON_SEGMENT; // s.a -> h -> s.b の順で並んでいる\n}\ntemplate <class T> inline bool is_intersect(const Segment<T>& s, const Circle<T>& c) { return is_intersect(c, s); }\n\nenum class Contain { IN, ON, OUT };\n\n// 円 c と点 p の位置関係\ntemplate <class T> Contain contain(const Circle<T>& c, const Point<T>& p) {\n int sgn = sign(norm(p - c.o) - c.r * c.r);\n return sgn == 1 ? Contain::OUT : (sgn == 0 ? Contain::ON : Contain::IN);\n}\n\n// 多角形 (凸とは限らない) q と点 p の位置関係\n// 頂点は反時計回りに並んでいる\n// O(n)\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\ntemplate <class T> Contain contain(const Polygon<T>& q, const Point<T>& p) {\n const int n = (int)(q.size());\n assert(n >= 3);\n bool x = false;\n for (int i = 0; i < n; i++) {\n if (is_intersect(Segment(q[i], q[(i + 1) % n]), p)) return Contain::ON;\n Point a = q[i] - p, b = q[(i + 1) % n] - p;\n if (a.y > b.y) std::swap(a, b);\n // a.y < b.y\n // check each point's y is 0 at most 1 times\n if (sign(a.y) <= 0 and sign(b.y) > 0 and sign(cross(a, b)) > 0) x = !x;\n }\n return (x ? Contain::IN : Contain::OUT);\n}\n\n// 凸多角形 (すべての内角が 180° 未満) q と点 p の位置関係\n// 頂点は反時計回りに並んでいる\n// O(log n)\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0412\n// https://atcoder.jp/contests/abc296/tasks/abc296_g\ntemplate <class T> Contain convex_contain(const Polygon<T>& q, const Point<T>& p) {\n const int n = (int)(q.size());\n assert(n >= 3);\n auto c1 = ccw(q[0], q[1], p);\n auto c2 = ccw(q[0], q[n - 1], p);\n if (c1 == Ccw::CLOCKWISE or c2 == Ccw::COUNTER_CLOCKWISE) return Contain::OUT;\n if (c1 == Ccw::ON_SEGMENT or c2 == Ccw::ON_SEGMENT) return Contain::ON;\n if (c1 == Ccw::ONLINE_FRONT or c2 == Ccw::ONLINE_FRONT) return Contain::OUT;\n // 二分探索 (q[0] -> q[i] -> p が反時計回りになるような最大の i)\n int ok = 1, ng = n - 1;\n while (ng - ok > 1) {\n int md = (ok + ng) / 2;\n if (ccw(q[0], q[md], p) == Ccw::COUNTER_CLOCKWISE) {\n ok = md;\n } else {\n ng = md;\n }\n }\n // 直線 q[ok] -> q[ok + 1] を基準に考える\n auto c3 = ccw(q[ok], q[ok + 1], p);\n assert(c3 != Ccw::ONLINE_FRONT);\n assert(c3 != Ccw::ONLINE_BACK);\n return c3 == Ccw::ON_SEGMENT ? Contain::ON : (c3 == Ccw::COUNTER_CLOCKWISE ? Contain::IN : Contain::OUT);\n}\n\nint main() {\n int N;\n std::cin >> N;\n Polygon<double> q(N);\n std::cin >> q;\n for (int i = 0; i < N; i++) q[i] *= 1e6 / (1e6 - 1e2);\n int Q;\n std::cin >> Q;\n for (int i = 0; i < Q; i++) {\n Point<double> p;\n std::cin >> p;\n auto res = convex_contain(q, p);\n if (res == Contain::IN) {\n std::cout << \"1\\n\";\n } else if (res == Contain::OUT) {\n std::cout << \"0\\n\";\n } else {\n assert(0);\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 3640, "score_of_the_acc": -1.0236, "final_rank": 8 }, { "submission_id": "aoj_0412_9526449", "code_snippet": "// #define PROBLEM \"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0412\"\n// \n// #include <iostream>\n// \n// #include \"geometry/convex_hull_monotone_chain.hpp\"\n// #include \"geometry/contain.hpp\"\n// \n// int main() {\n// int N;\n// std::cin >> N;\n// Polygon<long double> q(N);\n// std::cin >> q;\n// q = convex_hull_monotone_chain(q, true);\n// for (int i = 0; i < N; i++) q[i] *= 1e6 / (1e6 - 1e2);\n// int Q;\n// std::cin >> Q;\n// for (int i = 0; i < Q; i++) {\n// Point<long double> p;\n// std::cin >> p;\n// auto res = convex_contain(q, p);\n// if (res == Contain::IN) {\n// std::cout << \"1\\n\";\n// } else if (res == Contain::OUT) {\n// std::cout << \"0\\n\";\n// } else {\n// assert(0);\n// }\n// }\n// return 0;\n// }\n#define PROBLEM \"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0412\"\n\n#include <iostream>\n\n#include <type_traits>\n\n// Constants (EPS, PI)\n// EPS の変更は Constants<T>::set_eps(new_eps) で\ntemplate <class T> struct Constants {\n static T EPS;\n static void set_eps(const T e) { EPS = e; }\n static constexpr T PI = 3.14159'26535'89793L;\n};\n\ntemplate <> double Constants<double>::EPS = 1e-9;\ntemplate <> long double Constants<long double>::EPS = 1e-12;\ntemplate <> long long Constants<long long>::EPS = 0;\n\n// 汎用関数\ntemplate <class T> inline int sign(const T x) { return x < -Constants<T>::EPS ? -1 : (x > Constants<T>::EPS ? 1 : 0); }\ntemplate <class T> inline bool equal(const T a, const T b) { return sign(a - b) == 0; }\ntemplate <class T> inline T radian_to_degree(const T r) { return r * 180.0 / Constants<T>::PI; }\ntemplate <class T> inline T degree_to_radian(const T d) { return d * Constants<T>::PI / 180.0; }\n\n// type traits\ntemplate <class T> using is_geometry_floating_point = typename std::conditional<std::is_same<T, double>::value || std::is_same<T, long double>::value, std::true_type, std::false_type>::type;\ntemplate <class T> using is_geometry_integer = typename std::conditional<std::is_same<T, long long>::value, std::true_type, std::false_type>::type;\ntemplate <class T> using is_geometry = typename std::conditional<is_geometry_floating_point<T>::value || is_geometry_integer<T>::value, std::true_type, std::false_type>::type;\n\n#include <cmath>\n#include <cassert>\n\n// 点\ntemplate <class T> struct Point {\n T x, y;\n\n Point() = default;\n Point(const T x, const T y) : x(x), y(y) {}\n\n Point& operator+=(const Point& p) {\n x += p.x, y += p.y;\n return *this;\n }\n Point& operator-=(const Point& p) {\n x -= p.x, y -= p.y;\n return *this;\n }\n Point& operator*=(const Point& p) {\n static_assert(is_geometry_floating_point<T>::value == true);\n return *this = Point(x * p.x - y * p.y, x * p.y + y * p.x);\n }\n Point& operator/=(const Point& p) {\n static_assert(is_geometry_floating_point<T>::value == true);\n return *this = Point(x * p.x + y * p.y, -x * p.y + y * p.x) / (p.x * p.x + p.y * p.y);\n }\n Point& operator*=(const T k) {\n x *= k, y *= k;\n return *this;\n }\n Point& operator/=(const T k) {\n static_assert(is_geometry_floating_point<T>::value == true);\n x /= k, y /= k;\n return *this;\n }\n\n Point operator+() const { return *this; }\n Point operator-() const { return Point(-x, -y); }\n\n friend Point operator+(const Point& a, const Point& b) { return Point(a) += b; }\n friend Point operator-(const Point& a, const Point& b) { return Point(a) -= b; }\n friend Point operator*(const Point& a, const Point& b) { return Point(a) *= b; }\n friend Point operator/(const Point& a, const Point& b) { return Point(a) /= b; }\n friend Point operator*(const Point& p, const T k) { return Point(p) *= k; }\n friend Point operator/(const Point& p, const T k) { return Point(p) /= k; }\n\n // 辞書式順序\n friend bool operator<(const Point& a, const Point& b) { return a.x == b.x ? a.y < b.y : a.x < b.x; }\n friend bool operator>(const Point& a, const Point& b) { return a.x == b.x ? a.y > b.y : a.x > b.x; }\n friend bool operator==(const Point& a, const Point& b) { return a.x == b.x and a.y == b.y; }\n\n // I/O\n friend std::istream& operator>>(std::istream& is, Point& p) { return is >> p.x >> p.y; }\n friend std::ostream& operator<<(std::ostream& os, const Point& p) { return os << '(' << p.x << ' ' << p.y << ')'; }\n};\n\n// 汎用関数\n// 点の一致判定\ntemplate <class T> inline bool equal(const Point<T>& a, const Point<T>& b) { return equal(a.x, b.x) and equal(a.y, b.y); }\n// 内積\ntemplate <class T> inline T dot(const Point<T>& a, const Point<T>& b) { return a.x * b.x + a.y * b.y; }\n// 外積\ntemplate <class T> inline T cross(const Point<T>& a, const Point<T>& b) { return a.x * b.y - a.y * b.x; }\n// rad ラジアンだけ反時計回りに回転\ntemplate <class T> inline Point<T> rotate(const Point<T>& p, const T theta) {\n static_assert(is_geometry_floating_point<T>::value == true);\n return p * Point<T>(std::cos(theta), std::sin(theta));\n}\n// (x, y) の辞書式順序 (誤差許容)\ntemplate <class T> inline bool compare_x(const Point<T>& a, const Point<T>& b) { return equal(a.x, b.x) ? sign(a.y - b.y) < 0 : sign(a.x - b.x) < 0; }\n// (y, x) の辞書式順序 (誤差許容)\ntemplate <class T> inline bool compare_y(const Point<T>& a, const Point<T>& b) { return equal(a.y, b.y) ? sign(a.x - b.x) < 0 : sign(a.y - b.y) < 0; }\n// 整数のまま行う偏角ソート\n// 無限の精度をもつ arg(p) = atan2(y, x) で比較し, 同じ場合は norm(p) で比較 (atan2(0, 0) = 0 とする)\n// 基本的に (-PI, PI] でソートされ, 点 (0, 0) は (-PI, 0) と [0, PI] の間に入る\n// https://ngtkana.hatenablog.com/entry/2021/11/13/202103\n// https://judge.yosupo.jp/problem/sort_points_by_argument\ntemplate <class T> inline bool compare_atan2(const Point<T>& a, const Point<T>& b) {\n static_assert(is_geometry_integer<T>::value == true);\n if ((Point<T>(a.y, -a.x) > Point<T>(0, 0)) == (Point<T>(b.y, -b.x) > Point<T>(0, 0))) { // a, b in (-PI, 0] or a, b in (0, PI]\n if (a.x * b.y != a.y * b.x) return a.x * b.y > a.y * b.x; // cross(a, b) != 0\n return a == Point<T>(0, 0) ? b.x > 0 and b.y == 0 : (b == Point<T>(0, 0) ? a.y < 0 : norm(a) < norm(b));\n }\n return Point<T>(a.y, -a.x) < Point<T>(b.y, -b.x);\n}\n// 絶対値の 2 乗\ntemplate <class T> inline T norm(const Point<T>& p) { return p.x * p.x + p.y * p.y; }\n// 絶対値\ntemplate <class T> inline T abs(const Point<T>& p) {\n static_assert(is_geometry_floating_point<T>::value == true);\n return std::sqrt(norm(p));\n}\n// 偏角\ntemplate <class T> inline T arg(const Point<T>& p) {\n static_assert(is_geometry_floating_point<T>::value == true);\n return std::atan2(p.y, p.x); // (-PI, PI]\n}\n// 共役複素数 (x 軸について対象な点)\ntemplate <class T> inline Point<T> conj(const Point<T>& p) { return Point(p.x, -p.y); }\n// 極座標系 -> 直交座標系 (絶対値が rho で偏角が theta ラジアン)\ntemplate <class T> inline Point<T> polar(const T rho, const T theta = T(0)) {\n static_assert(is_geometry_floating_point<T>::value == true);\n assert(sign(rho) >= 0);\n return Point<T>(std::cos(theta), std::sin(theta)) * rho;\n}\n// ccw の戻り値\nenum class Ccw {\n COUNTER_CLOCKWISE = 1, // a->b->c 反時計回り\n CLOCKWISE = -1, // a->b->c 時計回り\n ONLINE_BACK = 2, // c->a->b 直線\n ONLINE_FRONT = -2, // a->b->c 直線\n ON_SEGMENT = 0 // a->c->b 直線\n};\n// 点 a, b, c の位置関係\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_C\ntemplate <class T> Ccw ccw(const Point<T>& a, const Point<T>& b, const Point<T>& c) {\n Point<T> ab = b - a;\n Point<T> ac = c - a;\n if (sign(cross(ab, ac)) == 1) return Ccw::COUNTER_CLOCKWISE;\n if (sign(cross(ab, ac)) == -1) return Ccw::CLOCKWISE;\n if (sign(dot(ab, ac)) == -1) return Ccw::ONLINE_BACK;\n if (sign(norm(ab) - norm(ac)) == -1) return Ccw::ONLINE_FRONT;\n return Ccw::ON_SEGMENT;\n}\n// 線分 a -> b から 線分 a -> c までの角度 (ラジアンで -PI より大きく PI 以下)\ntemplate <class T> T get_angle(const Point<T>& a, const Point<T>& b, const Point<T>& c) {\n Point<T> ab = b - a;\n Point<T> ac = c - a;\n // a-bが x 軸になるように回転\n ac *= conj(ab) / norm(ab);\n return arg(ac); // (-PI, PI]\n}\n\n#include <vector>\n\n// 多角形\ntemplate <class T> using Polygon = std::vector<Point<T>>;\ntemplate <class T> std::istream& operator>>(std::istream& is, Polygon<T>& p) {\n for (auto&& pi : p) is >> pi;\n return is;\n}\ntemplate <class T> std::ostream& operator<<(std::ostream& os, const Polygon<T>& p) {\n for (auto&& pi : p) os << pi << \" -> \";\n return os;\n}\n\n// 多角形の面積 (符号付き)\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_A\n// return area * 2\ntemplate <class T> T area2(const Polygon<T>& p) {\n const int n = (int)(p.size());\n assert(n >= 2);\n T res = T(0);\n for (int i = 0; i < n; i++) res += cross(p[i], p[i + 1 == n ? 0 : i + 1]);\n // counter clockwise: res > 0\n // clockwise: res < 0\n return res;\n}\ntemplate <class T> T area(const Polygon<T>& p) {\n static_assert(is_geometry_floating_point<T>::value == true);\n return area2(p) / T(2);\n}\n\n// 多角形の凸判定 (角度が 0 でも PI でも許容)\n// 許容したくないときには ON_SEGMENT, ONLINE_FRONT, ONLINE_BACK が出てきたら false を返せば OK\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_B\ntemplate <class T> bool is_convex(const Polygon<T>& p) {\n const int n = (int)(p.size());\n assert(n >= 3);\n bool okccw = true, okcw = true;\n for (int i = 0; i < n; i++) {\n auto res = ccw(p[i], p[i + 1 >= n ? i + 1 - n : i + 1], p[i + 2 >= n ? i + 2 - n : i + 2]);\n if (res == Ccw::CLOCKWISE) okccw = false;\n if (res == Ccw::COUNTER_CLOCKWISE) okcw = false;\n if (!okccw and !okcw) return false;\n }\n return true;\n}\n\n#include <algorithm>\n\n// 凸包 (Andrew's Monotone Chain algorithm)\n// O(n log n)\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_4_A\n// (x, y) を辞書式順序でソートし, スタックを使って上側凸包と下側凸包を求める\n// 反時計回り\n// strict を true にすると凸包の辺上に並ぶ頂点は含めない (頂点数が最小になる)\ntemplate <class T> Polygon<T> convex_hull_monotone_chain(std::vector<Point<T>>& p, bool strict = true) {\n if (is_geometry_integer<T>::value) {\n std::sort(p.begin(), p.end());\n } else {\n assert(is_geometry_floating_point<T>::value);\n std::sort(p.begin(), p.end(), compare_x<T>);\n }\n p.erase(std::unique(p.begin(), p.end()), p.end());\n const int n = (int)(p.size());\n if (n <= 2) return p;\n Polygon<T> r;\n r.reserve(n * 2);\n auto f = [&strict](Ccw ccwres) -> bool { return strict ? ccwres != Ccw::CLOCKWISE : ccwres == Ccw::COUNTER_CLOCKWISE; };\n for (int i = 0; i < n; i++) {\n while (r.size() >= 2 and f(ccw(r[r.size() - 2], r[r.size() - 1], p[i]))) {\n r.pop_back();\n }\n r.push_back(p[i]);\n }\n int t = r.size() + 1;\n for (int i = n - 2; i >= 0; i--) {\n while (r.size() >= t and f(ccw(r[r.size() - 2], r[r.size() - 1], p[i]))) {\n r.pop_back();\n }\n r.push_back(p[i]);\n }\n r.pop_back();\n std::reverse(r.begin(), r.end());\n return r;\n}\n\n// 直線\ntemplate <class T> struct Line {\n Point<T> a, b;\n\n Line() = default;\n Line(const Point<T>& a, const Point<T>& b) : a(a), b(b) {}\n\n // Ax + By = C\n Line(const T A, const T B, const T C) {\n static_assert(is_geometry_floating_point<T>::value == true);\n assert(!(equal(A, T(0)) and equal(B, T(0))));\n if (equal(A, T(0))) {\n a = Point<T>(T(0), C / B), b = Point<T>(T(1), C / B);\n } else if (equal(B, T(0))) {\n a = Point<T>(C / A, T(0)), b = Point<T>(C / A, T(1));\n } else if (equal(C, T(0))) {\n a = Point<T>(T(0), T(0)), b = Point<T>(T(1), -A / B);\n } else {\n a = Point<T>(T(0), C / B), b = Point<T>(C / A, T(0));\n }\n }\n\n friend std::istream& operator>>(std::istream& is, Line& p) { return is >> p.a >> p.b; }\n friend std::ostream& operator<<(std::ostream& os, const Line& p) { return os << p.a << \"->\" << p.b; }\n};\n\n// 線分\ntemplate <class T> struct Segment : Line<T> {\n Segment() = default;\n\n Segment(const Point<T>& a, const Point<T>& b) : Line<T>(a, b) {}\n};\n\n// 点 p から直線 l に下ろした垂線と直線 l の交点\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_A\ntemplate <class T> Point<T> projection(const Line<T>& l, const Point<T>& p) {\n static_assert(is_geometry_floating_point<T>::value == true);\n T t = dot(p - l.a, l.b - l.a) / norm(l.b - l.a);\n return l.a + (l.b - l.a) * t;\n}\n\n// 直線 l に関して点 p と対象な位置にある点\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_1_B\ntemplate <class T> Point<T> reflection(const Line<T>& l, const Point<T>& p) {\n static_assert(is_geometry_floating_point<T>::value == true);\n return p + (projection(l, p) - p) * T(2);\n}\n\n// 直線 l1, l2 の垂直判定\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\ntemplate <class T> inline bool is_orthogonal(const Line<T>& l1, const Line<T>& l2) { return sign(dot(l1.b - l1.a, l2.b - l2.a)) == 0; }\n\n// 直線 l1, l2 の平行判定\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_A\ntemplate <class T> inline bool is_parallel(const Line<T>& l1, const Line<T>& l2) { return sign(cross(l1.b - l1.a, l2.b - l2.a)) == 0; }\n\n// 円\ntemplate <class T> struct Circle {\n Point<T> o;\n T r;\n\n Circle() = default;\n Circle(const Point<T>& o, const T r) : o(o), r(r) {}\n\n friend std::istream& operator>>(std::istream& is, Circle& c) { return is >> c.o >> c.r; }\n friend std::ostream& operator<<(std::ostream& os, const Circle& c) { return os << c.o << \", \" << c.r; }\n};\n\n// 共通接線の本数\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_7_A\ntemplate <class T> int tangent_number(Circle<T> c1, Circle<T> c2) {\n if (c1.r < c2.r) std::swap(c1, c2);\n const T d2 = norm(c1.o - c2.o);\n if (sign(d2 - (c1.r + c2.r) * (c1.r + c2.r)) == 1) return 4; // d > c1.r + c2.r and c1.r + c2.r >= 0 <=> d ^ 2 > (c1.r + c2.r) ^ 2\n if (sign(d2 - (c1.r + c2.r) * (c1.r + c2.r)) == 0) return 3; // d = c1.r + c2.r and c1.r + c2.r >= 0 <=> d ^ 2 = (c1.r + c2.r) ^ 2\n if (sign(d2 - (c1.r - c2.r) * (c1.r - c2.r)) == 1) return 2; // d > c1.r - c2.r and c1.r - c2.r >= 0 <=> d ^ 2 > (c1.r - c2.r) ^ 2\n if (sign(d2 - (c1.r - c2.r) * (c1.r - c2.r)) == 0) return 1; // d = c1.r - c2.r and c1.r - c2.r >= 0 <=> d ^ 2 = (c1.r - c2.r) ^ 2\n return 0;\n}\n\n// 交差判定 (直線, 線分, 円, 点)\n// 直線 l1, l2 の交差判定\ntemplate <class T> bool is_intersect(const Line<T>& l1, const Line<T>& l2) {\n Point<T> base = l1.b - l1.a;\n T d12 = cross(base, l2.b - l2.a);\n T d1 = cross(base, l1.b - l2.a);\n // sign(d12) != 0 -> 平行でないので交差する\n // sign(d12) == 0 and sign(d1) == 0 -> 一致するので交差する\n return sign(d12) != 0 or sign(d1) == 0;\n}\n// 直線 l, 点 p の交差判定\ntemplate <class T> inline bool is_intersect(const Line<T>& l, const Point<T>& p) {\n auto res = ccw(l.a, l.b, p);\n return res == Ccw::ONLINE_BACK or res == Ccw::ONLINE_FRONT or res == Ccw::ON_SEGMENT;\n}\ntemplate <class T> bool is_intersect(const Point<T>& p, const Line<T>& l) { return is_intersect(l, p); }\n\n// 線分 s, 点 p の交差判定\ntemplate <class T> inline bool is_intersect(const Segment<T>& s, const Point<T>& p) { return ccw(s.a, s.b, p) == Ccw::ON_SEGMENT; }\ntemplate <class T> inline bool is_intersect(const Point<T>& p, const Segment<T>& s) { return ccw(s.a, s.b, p) == Ccw::ON_SEGMENT; }\n\n// 直線 l, 線分 s の交差判定\ntemplate <class T> bool is_intersect(const Line<T>& l, const Segment<T>& s) {\n // s.a と s.b が直線 l に関して同じ側 (直線上を除き) にある場合に限り交差しない\n auto c1 = ccw(l.a, l.b, s.a);\n auto c2 = ccw(l.a, l.b, s.b);\n return !((c1 == c2) and (c1 == Ccw::CLOCKWISE or c1 == Ccw::COUNTER_CLOCKWISE));\n}\ntemplate <class T> bool is_intersect(const Segment<T>& s, const Line<T>& l) { return is_intersect(l, s); }\n\n// 線分 s1, s2 の交差判定\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_2_B\ntemplate <class T> inline bool is_intersect(const Segment<T>& s1, const Segment<T>& s2) {\n auto c1 = ccw(s1.a, s1.b, s2.a);\n auto c2 = ccw(s1.a, s1.b, s2.b);\n auto c3 = ccw(s2.a, s2.b, s1.a);\n auto c4 = ccw(s2.a, s2.b, s1.b);\n // 平行な場合: 重なるなら 1 次元で考えると必ず端点のどれかがもう一方の線分上にある\n if (c1 == Ccw::ON_SEGMENT or c2 == Ccw::ON_SEGMENT or c3 == Ccw::ON_SEGMENT or c4 == Ccw::ON_SEGMENT) return true;\n // 平行でない場合: 一方の線分の両側にもう一方の線分の端点がある, を線分を入れ替えても成立\n // 平行だが重ならない場合は以下の条件は成立しない\n bool ok1 = ((c1 == Ccw::CLOCKWISE and c2 == Ccw::COUNTER_CLOCKWISE) or (c1 == Ccw::COUNTER_CLOCKWISE and c2 == Ccw::CLOCKWISE));\n bool ok2 = ((c3 == Ccw::CLOCKWISE and c4 == Ccw::COUNTER_CLOCKWISE) or (c3 == Ccw::COUNTER_CLOCKWISE and c4 == Ccw::CLOCKWISE));\n return ok1 and ok2;\n}\n\n// 点 p1, p2 の交差判定\ntemplate <class T> inline bool is_intersect(const Point<T>& p1, const Point<T>& p2) { return equal(p1, p2); }\n\n// 円 c1, c2 の交差判定\ntemplate <class T> inline bool is_intersect(const Circle<T>& c1, const Circle<T>& c2) {\n const int num = tangent_number(c1, c2);\n return 1 <= num and num <= 3;\n}\n\n// 円 c, 点 p の交差判定\ntemplate <class T> inline bool is_intersect(const Circle<T>& c, const Point<T>& p) { return equal(norm(p - c.o), c.r * c.r); }\ntemplate <class T> inline bool is_intersect(const Point<T>& p, const Circle<T>& c) { return equal(norm(p - c.o), c.r * c.r); }\n\n// 円 c, 直線 l の交差判定\ntemplate <class T> inline bool is_intersect(const Circle<T>& c, const Line<T>& l) {\n static_assert(is_geometry_floating_point<T>::value == true);\n // norm(c.o - projection(l, c.o)) が直線 l と 円 c の中心 c.o の距離の 2 乗\n return sign(c.r * c.r - norm(c.o - projection(l, c.o))) >= 0;\n}\ntemplate <class T> inline bool is_intersect(const Line<T>& l, const Circle<T>& c) { return is_intersect(c, l); }\n\n// 円 c, 線分 s の交差判定\ntemplate <class T> inline bool is_intersect(const Circle<T>& c, const Segment<T>& s) {\n static_assert(is_geometry_floating_point<T>::value == true);\n if (!is_intersect(c, Line(s.a, s.b))) return false; // 直線としても交差しない\n T d1 = abs(c.o - s.a), d2 = abs(c.o - s.b);\n if (sign(d1 - c.r) == -1 and sign(d2 - c.r) == -1) return false; // 端点がどちらも円の内側\n if (sign(d1 - c.r) * sign(d2 - c.r) <= 0) return true; // 円周をまたいでいる\n const Point<T> h = projection(s, c.o);\n return ccw(s.a, s.b, h) == Ccw::ON_SEGMENT; // s.a -> h -> s.b の順で並んでいる\n}\ntemplate <class T> inline bool is_intersect(const Segment<T>& s, const Circle<T>& c) { return is_intersect(c, s); }\n\nenum class Contain { IN, ON, OUT };\n\n// 円 c と点 p の位置関係\ntemplate <class T> Contain contain(const Circle<T>& c, const Point<T>& p) {\n int sgn = sign(norm(p - c.o) - c.r * c.r);\n return sgn == 1 ? Contain::OUT : (sgn == 0 ? Contain::ON : Contain::IN);\n}\n\n// 多角形 (凸とは限らない) q と点 p の位置関係\n// 頂点は反時計回りに並んでいる\n// O(n)\n// http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=CGL_3_C\ntemplate <class T> Contain contain(const Polygon<T>& q, const Point<T>& p) {\n const int n = (int)(q.size());\n assert(n >= 3);\n bool x = false;\n for (int i = 0; i < n; i++) {\n if (is_intersect(Segment(q[i], q[(i + 1) % n]), p)) return Contain::ON;\n Point a = q[i] - p, b = q[(i + 1) % n] - p;\n if (a.y > b.y) std::swap(a, b);\n // a.y < b.y\n // check each point's y is 0 at most 1 times\n if (sign(a.y) <= 0 and sign(b.y) > 0 and sign(cross(a, b)) > 0) x = !x;\n }\n return (x ? Contain::IN : Contain::OUT);\n}\n\n// 凸多角形 (すべての内角が 180° 未満) q と点 p の位置関係\n// 頂点は反時計回りに並んでいる\n// O(log n)\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0412\n// https://atcoder.jp/contests/abc296/tasks/abc296_g\ntemplate <class T> Contain convex_contain(const Polygon<T>& q, const Point<T>& p) {\n const int n = (int)(q.size());\n assert(n >= 3);\n auto c1 = ccw(q[0], q[1], p);\n auto c2 = ccw(q[0], q[n - 1], p);\n if (c1 == Ccw::CLOCKWISE or c2 == Ccw::COUNTER_CLOCKWISE) return Contain::OUT;\n if (c1 == Ccw::ON_SEGMENT or c2 == Ccw::ON_SEGMENT) return Contain::ON;\n if (c1 == Ccw::ONLINE_FRONT or c2 == Ccw::ONLINE_FRONT) return Contain::OUT;\n // 二分探索 (q[0] -> q[i] -> p が反時計回りになるような最大の i)\n int ok = 1, ng = n - 1;\n while (ng - ok > 1) {\n int md = (ok + ng) / 2;\n if (ccw(q[0], q[md], p) == Ccw::COUNTER_CLOCKWISE) {\n ok = md;\n } else {\n ng = md;\n }\n }\n // 直線 q[ok] -> q[ok + 1] を基準に考える\n auto c3 = ccw(q[ok], q[ok + 1], p);\n assert(c3 != Ccw::ONLINE_FRONT);\n assert(c3 != Ccw::ONLINE_BACK);\n return c3 == Ccw::ON_SEGMENT ? Contain::ON : (c3 == Ccw::COUNTER_CLOCKWISE ? Contain::IN : Contain::OUT);\n}\n\nint main() {\n int N;\n std::cin >> N;\n Polygon<long double> q(N);\n std::cin >> q;\n q = convex_hull_monotone_chain(q, true);\n for (int i = 0; i < N; i++) q[i] *= 1e6 / (1e6 - 1e2);\n int Q;\n std::cin >> Q;\n for (int i = 0; i < Q; i++) {\n Point<long double> p;\n std::cin >> p;\n auto res = convex_contain(q, p);\n if (res == Contain::IN) {\n std::cout << \"1\\n\";\n } else if (res == Contain::OUT) {\n std::cout << \"0\\n\";\n } else {\n assert(0);\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 5024, "score_of_the_acc": -1.1751, "final_rank": 9 }, { "submission_id": "aoj_0412_8757310", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint n;\nvector<long double>x,y;\nbool Judge(long double e1,long double e2,long double e3,long double e4,long double r1,long double r2,long double r3,long double r4){\n long double s,t;\n s=(e1-e2)*(r3-r1)-(r1-r2)*(e3-e1);\n t=(e1-e2)*(r4-r1)-(r1-r2)*(e4-e1);\n if(s*t>0){\n return false;\n }\n s=(e3-e4)*(r1-r3)-(r3-r4)*(e1-e3);\n t=(e3-e4)*(r2-r3)-(r3-r4)*(e2-e3);\n if(s*t>0){\n return false;\n }\n return true;\n}\nbool ftan(int a,int b){\n long double g1,g2,h1,h2,p1,p2,p3,p4,p5,p6;\n g1=x[n-1]-x[0];\n g2=y[n-1]-y[0];\n h1=x[1]-x[0];\n h2=y[1]-y[0];\n p1=a-x[0];\n p2=b-y[0];\n p3=p1-h1;\n p4=p2-h2;\n p5=p1-g1;\n p6=p2-g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(h1,0,p1,p5,h2,0,p2,p6)){\n //二部探索------------------------------------\n int wl=1,wr=n-1,wm=(wl+wr)/2;\n while(wr-wl>1){\n wm=(wl+wr)/2;\n g1=x[wm]-x[0];\n g2=y[wm]-y[0];\n h1=x[wl]-x[0];\n h2=y[wl]-y[0];\n p3=p1-h1;\n p4=p2-h2;\n p5=p1-g1;\n p6=p2-g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(h1,0,p1,p5,h2,0,p2,p6)){\n wr=wm;\n }else{\n wl=wm;\n }\n }\n g1=x[wr]-x[0];\n g2=y[wr]-y[0];\n h1=x[wl]-x[0];\n h2=y[wl]-y[0];\n p3=p1-h1;\n p4=p2-h2;\n p5=p1-g1;\n p6=p2-g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(h1,0,p1,p5,h2,0,p2,p6)){\n p3=p1+g1-h1;\n p4=p2+g2-h2;\n p5=p1+g1;\n p6=p2+g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(g1,h1,p1,p5,g2,h2,p2,p6)){\n return true;\n }else{\n return false;\n }\n }else{\n return false;\n }\n\n }else{\n return false;\n }\n\n}\nint main(){\n cin>>n;\n x.resize(n);\n y.resize(n);\n for(int i=0;i<n;i++){\n cin>>x[i]>>y[i];\n x[i]+=(x[i])/9999;\n y[i]+=(y[i])/9999;\n //x[i]=-1000000*(x[i]/-999900);\n //y[i]=-1000000*(y[i]/-999900);\n }\n int q;cin>>q;\n for(int qwe=0;qwe<q;qwe++){\n int s1,t1;cin>>s1>>t1;\n bool u=ftan(s1,t1);\n if(u){\n cout<<\"1\\n\";\n }else{\n cout<<\"0\\n\";\n }\n }\n}", "accuracy": 0.21052631578947367, "time_ms": 50, "memory_kb": 3432, "score_of_the_acc": -0.4453, "final_rank": 16 }, { "submission_id": "aoj_0412_8757290", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint n;\nvector<long double>x,y;\nbool Judge(long double e1,long double e2,long double e3,long double e4,long double r1,long double r2,long double r3,long double r4){\n long double s,t;\n s=(e1-e2)*(r3-r1)-(r1-r2)*(e3-e1);\n t=(e1-e2)*(r4-r1)-(r1-r2)*(e4-e1);\n if(s*t>0){\n return false;\n }\n s=(e3-e4)*(r1-r3)-(r3-r4)*(e1-e3);\n t=(e3-e4)*(r2-r3)-(r3-r4)*(e2-e3);\n if(s*t>0){\n return false;\n }\n return true;\n}\nbool ftan(int a,int b){\n long double g1,g2,h1,h2,p1,p2,p3,p4,p5,p6;\n g1=x[n-1]-x[0];\n g2=y[n-1]-y[0];\n h1=x[1]-x[0];\n h2=y[1]-y[0];\n p1=a-x[0];\n p2=b-y[0];\n p3=p1-h1;\n p4=p2-h2;\n p5=p1-g1;\n p6=p2-g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(h1,0,p1,p5,h2,0,p2,p6)){\n //二部探索------------------------------------\n int wl=1,wr=n-1,wm=(wl+wr)/2;\n while(wr-wl>1){\n wm=(wl+wr)/2;\n g1=x[wm]-x[0];\n g2=y[wm]-y[0];\n h1=x[wl]-x[0];\n h2=y[wl]-y[0];\n p3=p1-h1;\n p4=p2-h2;\n p5=p1-g1;\n p6=p2-g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(h1,0,p1,p5,h2,0,p2,p6)){\n wr=wm;\n }else{\n wl=wm;\n }\n }\n g1=x[wr]-x[0];\n g2=y[wr]-y[0];\n h1=x[wl]-x[0];\n h2=y[wl]-y[0];\n p3=p1-h1;\n p4=p2-h2;\n p5=p1-g1;\n p6=p2-g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(h1,0,p1,p5,h2,0,p2,p6)){\n p3=p1+g1-h1;\n p4=p2+g2-h2;\n p5=p1+g1;\n p6=p2+g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(g1,h1,p1,p5,g2,h2,p2,p6)){\n return true;\n }else{\n return false;\n }\n }else{\n return false;\n }\n\n }else{\n return false;\n }\n\n}\nint main(){\n cin>>n;\n x.resize(n);\n y.resize(n);\n for(int i=0;i<n;i++){\n cin>>x[i]>>y[i];\n x[i]+=(x[i])/1999;\n y[i]+=(y[i])/1999;\n //x[i]=-1000000*(x[i]/-999900);\n //y[i]=-1000000*(y[i]/-999900);\n }\n int q;cin>>q;\n for(int qwe=0;qwe<q;qwe++){\n int s1,t1;cin>>s1>>t1;\n bool u=ftan(s1,t1);\n if(u){\n cout<<\"1\\n\";\n }else{\n cout<<\"0\\n\";\n }\n }\n}", "accuracy": 0.15789473684210525, "time_ms": 50, "memory_kb": 3424, "score_of_the_acc": -0.4444, "final_rank": 20 }, { "submission_id": "aoj_0412_8757263", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint n;\nvector<long double>x,y;\nbool Judge(long double e1,long double e2,long double e3,long double e4,long double r1,long double r2,long double r3,long double r4){\n long double s,t;\n s=(e1-e2)*(r3-r1)-(r1-r2)*(e3-e1);\n t=(e1-e2)*(r4-r1)-(r1-r2)*(e4-e1);\n if(s*t>0){\n return false;\n }\n s=(e3-e4)*(r1-r3)-(r3-r4)*(e1-e3);\n t=(e3-e4)*(r2-r3)-(r3-r4)*(e2-e3);\n if(s*t>0){\n return false;\n }\n return true;\n}\nbool ftan(int a,int b){\n long double g1,g2,h1,h2,p1,p2,p3,p4,p5,p6;\n g1=x[n-1]-x[0];\n g2=y[n-1]-y[0];\n h1=x[1]-x[0];\n h2=y[1]-y[0];\n p1=a-x[0];\n p2=b-y[0];\n p3=p1-h1;\n p4=p2-h2;\n p5=p1-g1;\n p6=p2-g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(h1,0,p1,p5,h2,0,p2,p6)){\n //二部探索------------------------------------\n int wl=1,wr=n-1,wm=(wl+wr)/2;\n while(wr-wl>1){\n wm=(wl+wr)/2;\n g1=x[wm]-x[0];\n g2=y[wm]-y[0];\n h1=x[wl]-x[0];\n h2=y[wl]-y[0];\n p3=p1-h1;\n p4=p2-h2;\n p5=p1-g1;\n p6=p2-g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(h1,0,p1,p5,h2,0,p2,p6)){\n wr=wm;\n }else{\n wl=wm;\n }\n }\n g1=x[wr]-x[0];\n g2=y[wr]-y[0];\n h1=x[wl]-x[0];\n h2=y[wl]-y[0];\n p3=p1-h1;\n p4=p2-h2;\n p5=p1-g1;\n p6=p2-g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(h1,0,p1,p5,h2,0,p2,p6)){\n p3=p1+g1-h1;\n p4=p2+g2-h2;\n p5=p1+g1;\n p6=p2+g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(g1,h1,p1,p5,g2,h2,p2,p6)){\n return true;\n }else{\n return false;\n }\n }else{\n return false;\n }\n\n }else{\n return false;\n }\n\n}\nint main(){\n cin>>n;\n x.resize(n);\n y.resize(n);\n for(int i=0;i<n;i++){\n cin>>x[i]>>y[i];\n //x[i]+=(x[i])/9999;\n //y[i]+=(y[i])/9999;\n x[i]=-1000000*(x[i]/-999900);\n y[i]=-1000000*(y[i]/-999900);\n }\n int q;cin>>q;\n for(int qwe=0;qwe<q;qwe++){\n int s1,t1;cin>>s1>>t1;\n bool u=ftan(s1,t1);\n if(u){\n cout<<\"1\\n\";\n }else{\n cout<<\"0\\n\";\n }\n }\n}", "accuracy": 0.21052631578947367, "time_ms": 40, "memory_kb": 3512, "score_of_the_acc": -0.343, "final_rank": 15 }, { "submission_id": "aoj_0412_8757241", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint n;\nvector<long double>x,y;\nbool Judge(long double e1,long double e2,long double e3,long double e4,long double r1,long double r2,long double r3,long double r4){\n long double s,t;\n s=(e1-e2)*(r3-r1)-(r1-r2)*(e3-e1);\n t=(e1-e2)*(r4-r1)-(r1-r2)*(e4-e1);\n if(s*t>0||s==0&&t==0){\n return false;\n }\n s=(e3-e4)*(r1-r3)-(r3-r4)*(e1-e3);\n t=(e3-e4)*(r2-r3)-(r3-r4)*(e2-e3);\n if(s*t>0||s==0&&t==0){\n return false;\n }\n return true;\n}\nbool ftan(int a,int b){\n long double g1,g2,h1,h2,p1,p2,p3,p4,p5,p6;\n g1=x[n-1]-x[0];\n g2=y[n-1]-y[0];\n h1=x[1]-x[0];\n h2=y[1]-y[0];\n p1=a-x[0];\n p2=b-y[0];\n p3=p1-h1;\n p4=p2-h2;\n p5=p1-g1;\n p6=p2-g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(h1,0,p1,p5,h2,0,p2,p6)){\n //二部探索------------------------------------\n int wl=1,wr=n-1,wm=(wl+wr)/2;\n while(wr-wl>1){\n wm=(wl+wr)/2;\n g1=x[wm]-x[0];\n g2=y[wm]-y[0];\n h1=x[wl]-x[0];\n h2=y[wl]-y[0];\n p3=p1-h1;\n p4=p2-h2;\n p5=p1-g1;\n p6=p2-g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(h1,0,p1,p5,h2,0,p2,p6)){\n wr=wm;\n }else{\n wl=wm;\n }\n }\n g1=x[wr]-x[0];\n g2=y[wr]-y[0];\n h1=x[wl]-x[0];\n h2=y[wl]-y[0];\n p3=p1-h1;\n p4=p2-h2;\n p5=p1-g1;\n p6=p2-g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(h1,0,p1,p5,h2,0,p2,p6)){\n p3=p1+g1-h1;\n p4=p2+g2-h2;\n p5=p1+g1;\n p6=p2+g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(g1,h1,p1,p5,g2,h2,p2,p6)){\n return true;\n }else{\n return false;\n }\n }else{\n return false;\n }\n\n }else{\n return false;\n }\n\n}\nint main(){\n cin>>n;\n x.resize(n);\n y.resize(n);\n for(int i=0;i<n;i++){\n cin>>x[i]>>y[i];\n x[i]+=(x[i])/9999;\n y[i]+=(y[i])/9999;\n //x[i]=-1000000*(x[i]/-999900);\n //y[i]=-1000000*(y[i]/-999900);\n }\n int q;cin>>q;\n for(int qwe=0;qwe<q;qwe++){\n int s1,t1;cin>>s1>>t1;\n bool u=ftan(s1,t1);\n if(u){\n cout<<\"1\\n\";\n }else{\n cout<<\"0\\n\";\n }\n }\n}", "accuracy": 0.21052631578947367, "time_ms": 50, "memory_kb": 3516, "score_of_the_acc": -0.4545, "final_rank": 18 }, { "submission_id": "aoj_0412_8757233", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint n;\nvector<double>x,y;\nbool Judge(double e1,double e2,double e3,double e4,double r1,double r2,double r3,double r4){\n double s,t;\n s=(e1-e2)*(r3-r1)-(r1-r2)*(e3-e1);\n t=(e1-e2)*(r4-r1)-(r1-r2)*(e4-e1);\n if(s*t>0||s==0&&t==0){\n return false;\n }\n s=(e3-e4)*(r1-r3)-(r3-r4)*(e1-e3);\n t=(e3-e4)*(r2-r3)-(r3-r4)*(e2-e3);\n if(s*t>0||s==0&&t==0){\n return false;\n }\n return true;\n}\nbool ftan(int a,int b){\n double g1,g2,h1,h2,p1,p2,p3,p4,p5,p6;\n g1=x[n-1]-x[0];\n g2=y[n-1]-y[0];\n h1=x[1]-x[0];\n h2=y[1]-y[0];\n p1=a-x[0];\n p2=b-y[0];\n p3=p1-h1;\n p4=p2-h2;\n p5=p1-g1;\n p6=p2-g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(h1,0,p1,p5,h2,0,p2,p6)){\n //二部探索------------------------------------\n int wl=1,wr=n-1,wm=(wl+wr)/2;\n while(wr-wl>1){\n wm=(wl+wr)/2;\n g1=x[wm]-x[0];\n g2=y[wm]-y[0];\n h1=x[wl]-x[0];\n h2=y[wl]-y[0];\n p3=p1-h1;\n p4=p2-h2;\n p5=p1-g1;\n p6=p2-g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(h1,0,p1,p5,h2,0,p2,p6)){\n wr=wm;\n }else{\n wl=wm;\n }\n }\n g1=x[wr]-x[0];\n g2=y[wr]-y[0];\n h1=x[wl]-x[0];\n h2=y[wl]-y[0];\n p3=p1-h1;\n p4=p2-h2;\n p5=p1-g1;\n p6=p2-g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(h1,0,p1,p5,h2,0,p2,p6)){\n p3=p1+g1-h1;\n p4=p2+g2-h2;\n p5=p1+g1;\n p6=p2+g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(g1,h1,p1,p5,g2,h2,p2,p6)){\n return true;\n }else{\n return false;\n }\n }else{\n return false;\n }\n\n }else{\n return false;\n }\n\n}\nint main(){\n cin>>n;\n x.resize(n);\n y.resize(n);\n for(int i=0;i<n;i++){\n cin>>x[i]>>y[i];\n x[i]+=(x[i])/9999;\n y[i]+=(y[i])/9999;\n //x[i]=-1000000*(x[i]/-999900);\n //y[i]=-1000000*(y[i]/-999900);\n }\n int q;cin>>q;\n for(int qwe=0;qwe<q;qwe++){\n int s1,t1;cin>>s1>>t1;\n bool u=ftan(s1,t1);\n if(u){\n cout<<\"1\\n\";\n }else{\n cout<<\"0\\n\";\n }\n }\n}", "accuracy": 0.21052631578947367, "time_ms": 40, "memory_kb": 3500, "score_of_the_acc": -0.3416, "final_rank": 13 }, { "submission_id": "aoj_0412_8757193", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint n;\nvector<double>x,y;\nint Judge(double e1,double e2,double e3,double e4,double r1,double r2,double r3,double r4){\n double s,t;\n s=(e1-e2)*(r3-r1)-(r1-r2)*(e3-e1);\n t=(e1-e2)*(r4-r1)-(r1-r2)*(e4-e1);\n if(s*t>0){\n return false;\n }\n s=(e3-e4)*(r1-r3)-(r3-r4)*(e1-e3);\n t=(e3-e4)*(r2-r3)-(r3-r4)*(e2-e3);\n if(s*t>0){\n return false;\n }\n return true;\n}\nbool ftan(int a,int b){\n double g1,g2,h1,h2,p1,p2,p3,p4,p5,p6;\n g1=x[n-1]-x[0];\n g2=y[n-1]-y[0];\n h1=x[1]-x[0];\n h2=y[1]-y[0];\n p1=a-x[0];\n p2=b-y[0];\n p3=p1-h1;\n p4=p2-h2;\n p5=p1-g1;\n p6=p2-g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(h1,0,p1,p5,h2,0,p2,p6)){\n //二部探索------------------------------------\n int wl=1,wr=n-1,wm=(wl+wr)/2;\n while(wr-wl>1){\n wm=(wl+wr)/2;\n g1=x[wm]-x[0];\n g2=y[wm]-y[0];\n h1=x[wl]-x[0];\n h2=y[wl]-y[0];\n p3=p1-h1;\n p4=p2-h2;\n p5=p1-g1;\n p6=p2-g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(h1,0,p1,p5,h2,0,p2,p6)){\n wr=wm;\n }else{\n wl=wm;\n }\n }\n g1=x[wr]-x[0];\n g2=y[wr]-y[0];\n h1=x[wl]-x[0];\n h2=y[wl]-y[0];\n p3=p1-h1;\n p4=p2-h2;\n p5=p1-g1;\n p6=p2-g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(h1,0,p1,p5,h2,0,p2,p6)){\n p3=p1+g1-h1;\n p4=p2+g2-h2;\n p5=p1+g1;\n p6=p2+g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(g1,h1,p1,p5,g2,h2,p2,p6)){\n return true;\n }else{\n return false;\n }\n }else{\n return false;\n }\n\n }else{\n return false;\n }\n\n}\nint main(){\n cin>>n;\n x.resize(n);\n y.resize(n);\n for(int i=0;i<n;i++){\n cin>>x[i]>>y[i];\n x[i]+=(x[i])/9999;\n y[i]+=(y[i])/9999;\n //x[i]=-1000000*(x[i]/-999900);\n //y[i]=-1000000*(y[i]/-999900);\n }\n int q;cin>>q;\n for(int qwe=0;qwe<q;qwe++){\n int s1,t1;cin>>s1>>t1;\n bool u=ftan(s1,t1);\n if(u){\n cout<<\"1\\n\";\n }else{\n cout<<\"0\\n\";\n }\n }\n}", "accuracy": 0.21052631578947367, "time_ms": 40, "memory_kb": 3500, "score_of_the_acc": -0.3416, "final_rank": 13 }, { "submission_id": "aoj_0412_8757187", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint n;\nvector<double>x,y;\nint Judge(double e1,double e2,double e3,double e4,double r1,double r2,double r3,double r4){\n double s,t;\n s=(e1-e2)*(r3-r1)-(r1-r2)*(e3-e1);\n t=(e1-e2)*(r4-r1)-(r1-r2)*(e4-e1);\n if(s*t>0){\n return false;\n }\n s=(e3-e4)*(r1-r3)-(r3-r4)*(e1-e3);\n t=(e3-e4)*(r2-r3)-(r3-r4)*(e2-e3);\n if(s*t>0){\n return false;\n }\n return true;\n}\nbool ftan(int a,int b){\n double g1,g2,h1,h2,p1,p2,p3,p4,p5,p6;\n g1=x[n-1]-x[0];\n g2=y[n-1]-y[0];\n h1=x[1]-x[0];\n h2=y[1]-y[0];\n p1=a-x[0];\n p2=b-y[0];\n p3=p1-h1;\n p4=p2-h2;\n p5=p1-g1;\n p6=p2-g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(h1,0,p1,p5,h2,0,p2,p6)){\n //二部探索------------------------------------\n int wl=1,wr=n-1,wm=(wl+wr)/2;\n while(wr-wl>1){\n wm=(wl+wr)/2;\n g1=x[wm]-x[0];\n g2=y[wm]-y[0];\n h1=x[wl]-x[0];\n h2=y[wl]-y[0];\n p3=p1-h1;\n p4=p2-h2;\n p5=p1-g1;\n p6=p2-g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(h1,0,p1,p5,h2,0,p2,p6)){\n wr=wm;\n }else{\n wl=wm;\n }\n }\n g1=x[wr]-x[0];\n g2=y[wr]-y[0];\n h1=x[wl]-x[0];\n h2=y[wl]-y[0];\n p3=p1-h1;\n p4=p2-h2;\n p5=p1-g1;\n p6=p2-g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(h1,0,p1,p5,h2,0,p2,p6)){\n p3=p1+g1-h1;\n p4=p2+g2-h2;\n p5=p1+g1;\n p6=p2+g2;\n if(Judge(g1,0,p1,p3,g2,0,p2,p4)&&Judge(g1,h1,p1,p5,g2,h2,p2,p6)){\n return true;\n }else{\n return false;\n }\n }else{\n return false;\n }\n\n }else{\n return false;\n }\n\n}\nint main(){\n cin>>n;\n x.resize(n);\n y.resize(n);\n for(int i=0;i<n;i++){\n cin>>x[i]>>y[i];\n //x[i]+=(x[i])/9999;\n //y[i]+=(y[i])/9999;\n x[i]=-1000000*(x[i]/-999900);\n y[i]=-1000000*(y[i]/-999900);\n }\n int q;cin>>q;\n for(int qwe=0;qwe<q;qwe++){\n int s1,t1;cin>>s1>>t1;\n bool u=ftan(s1,t1);\n if(u){\n cout<<\"1\\n\";\n }else{\n cout<<\"0\\n\";\n }\n }\n}", "accuracy": 0.21052631578947367, "time_ms": 50, "memory_kb": 3500, "score_of_the_acc": -0.4528, "final_rank": 17 } ]
aoj_0414_cpp
Prayers of Iwashiro In the ancient nation of Iwashiro, priests offer prayers to appease disasters when they occur. The priest selects a string $S$ from an ancient text and proceeds with the ritual by repeating the following Pick one place in the string $S$ and update $S$ by replacing a letter written there with another letter. Find out what kind of string repetition $S$ can be represented by, and chant the string you find. However, if $S$ cannot be represented by a repetition of the string, chant $S$. The efficacy of the prayer is maximized when you chant the shortest string repetition that represents the original string. For example, for the string abababab , the efficacy of the prayer is maximized when you chant ab instead of the string itself or ababab . As a new priest, you need to learn how to quickly find the string that maximizes the efficacy of the prayer from the given string $S$. You will be given the string $S$ and some information about replacing the letters. Write a program that finds the length of the string that maximizes the efficacy of the prayer for the obtained string each time a letter is replaced. Input The input is given in the following form. $N$ $Q$ $S$ $p_1$ $c_1$ $p_2$ $c_2$ : $p_Q$ $c_Q$ In the first line, the length of the string $N$ ($2 \leq N \leq 10^5$) and the number of times the characters are replaced $Q$ ($1 \leq Q \leq 10^5$) are given. In the second line, a string $S$ of length $N$ consisting of lowercase letters is given. The following $Q$ line gives the position of the $i$-th character to be replaced, $p_i$ ($1 \leq p_i \leq N$), and the character to be replaced, $c_i$. Note that $p_i$ is expressed as the number of characters counting from the left end of the string. $c_i$ is in lowercase. Output Each time a letter is replaced, output the length of the string that maximizes the effectiveness of the prayer for the resulting string in a line. Sample Input and Output Sample Input 6 5 ababac 6 b 3 c 4 a 5 b 6 c Sample Output 2 6 6 6 3
[ { "submission_id": "aoj_0414_10873537", "code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, l, n) for(int i = int(l); i < int(n); i++)\n#define ll long long\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n\ntemplate<class T> bool chmin(T &a, T b) {if(a > b) {a = b; return true;} return false;}\ntemplate<class T> bool chmax(T &a, T b) {if(a < b) {a = b; return true;} return false;}\ntemplate<class T> using spq = priority_queue<T, vector<T>, greater<T>>;\n\n// bool -> Yes/No\nstring answer(bool b) {return b ? \"Yes\" : \"No\";}\n\nvoid fix(int k) {cout << fixed << setprecision(k);}\n\nconst int inf = 2e9;\nconst long long INF = 2e18;\nconst long double eps = 1e-12;\nint dx[] = {0, -1, 0, 1, -1, -1, 1, 1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};\n\nvoid main_program() {\n int n, q; cin >> n >> q;\n string s; cin >> s;\n vector<int> div;\n for(int i = 1; i * i <= n; i++) {\n if(n % i) continue;\n div.emplace_back(i);\n if(i * i != n) div.emplace_back(n / i);\n }\n sort(all(div));\n int m = div.size();\n int diff_sum[m];\n rep(i, 0, m) {\n diff_sum[i] = 0;\n rep(j, 0, n) {\n if(s[j] != s[(j + div[i]) % n]) {\n diff_sum[i]++;\n }\n }\n }\n while(q--) {\n int x; cin >> x;\n x--;\n char c; cin >> c;\n int ans = -1;\n rep(i, 0, m) {\n int bef1 = 0, bef2 = 0;\n if(s[x] != s[(x + div[i]) % n]) bef1++;\n if(s[x] != s[(x + n - div[i]) % n]) bef2++;\n swap(s[x], c);\n int aft1 = 0, aft2 = 0;\n if(s[x] != s[(x + div[i]) % n]) aft1++;\n if(s[x] != s[(x + n - div[i]) % n]) aft2++;\n swap(s[x], c);\n diff_sum[i] += aft1 + aft2 - bef1 - bef2;\n if(diff_sum[i] == 0 && ans == -1) ans = div[i];\n }\n s[x] = c;\n assert(ans != -1);\n cout << ans << \"\\n\";\n }\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int T = 1;\n //cin >> T;\n while(T--) {\n main_program();\n }\n}", "accuracy": 1, "time_ms": 140, "memory_kb": 3576, "score_of_the_acc": -0.0436, "final_rank": 3 }, { "submission_id": "aoj_0414_10825369", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug.hpp>\n#else\n#define debug(...)\n#endif\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N, Q;\n cin >> N >> Q;\n string S;\n cin >> S;\n\n // 約数を列挙\n vector<int> D;\n for (int i = 1; i * i <= N; i++) {\n if (N % i == 0) {\n D.emplace_back(i);\n if (N / i != i && N / i < N) D.emplace_back(N / i);\n }\n }\n sort(D.begin(), D.end());\n int M = ssize(D);\n // 文字列 S が長さ d で繰り返す\n // 各 i(0 <= i < d) (mod d) 文字目に存在する c の個数が N / d 個存在\n // cnt[i][j][c] := j mod D[i] 文字目に存在する c の個数\n // same[i] := cnt[i][j][c] = N / D[i] となる個数\n vector<vector<vector<int>>> cnt(M);\n vector<int> same(M);\n for (int i = 0; i < M; i++) {\n cnt[i].resize(D[i]);\n for (int j = 0; j < D[i]; j++) {\n cnt[i][j].resize(26);\n for (int cur = j; cur < N; cur += D[i]) cnt[i][j][S[cur] - 'a']++;\n if (cnt[i][j][S[j] - 'a'] == N / D[i]) same[i]++;\n }\n }\n\n while (Q--) {\n int p;\n char c;\n cin >> p >> c, p--;\n for (int i = 0; i < M; i++) {\n if (cnt[i][p % D[i]][S[p] - 'a']-- == N / D[i]) same[i]--;\n if (++cnt[i][p % D[i]][c - 'a'] == N / D[i]) same[i]++;\n }\n S[p] = c;\n int ans = N;\n for (int i = 0; i < M; i++) {\n if (same[i] == D[i]) {\n ans = D[i];\n break;\n }\n }\n cout << ans << '\\n';\n }\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 38400, "score_of_the_acc": -0.4461, "final_rank": 6 }, { "submission_id": "aoj_0414_10682689", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(void){\n int N, Q; cin >> N >> Q;\n string S; cin >> S;\n\n vector<int> p_mn, p_mx;\n for(int i = 1; i * i <= N; i++){\n if(N % i == 0){\n p_mn.push_back(i);\n if(i * i != N){\n p_mx.push_back(N / i);\n }\n }\n }\n \n int m_mn = p_mn.size();\n int m_mx = p_mx.size();\n \n vector<unordered_map<string, int>> mps(m_mn);\n \n vector<vector<int>> same_cnt(m_mx);\n vector<int> same_cnt_sum(m_mx);\n \n for(int idx = 0; idx < m_mn; idx++){\n int p = p_mn[idx];\n for(int i = 0; i < N; i += p){\n string s;\n \n for(int j = i; j < i + p; j++) s += S[j];\n \n mps[idx][s]++;\n }\n }\n \n for(int idx = 0; idx < m_mx; idx++){\n int p = p_mx[idx];\n \n same_cnt[idx].assign(p, false);\n \n for(int i = 0; i < p; i++){\n char c = S[i];\n int cnt = 0;\n for(int j = i; j < N; j += p){\n if(c != S[j]) cnt++;\n }\n \n same_cnt[idx][i] = cnt;\n same_cnt_sum[idx] += cnt;\n }\n }\n \n for(;Q--;){\n int p; char c; cin >> p >> c;p--;\n \n int ans = 1e9;\n \n //mnの更新\n for(int idx = 0; idx < m_mn; idx++){\n int pp = p_mn[idx];\n \n string s;\n for(int i = (p / pp) * pp; i < (p / pp) * pp + pp; i++){\n s += S[i];\n }\n \n \n mps[idx][s]--;\n if(mps[idx][s] == 0){\n mps[idx].erase(s);\n }\n \n \n \n s[p % pp] = c;\n \n mps[idx][s]++;\n \n if(mps[idx].size() == 1){\n ans = min(ans, pp);\n }\n }\n \n S[p] = c;\n \n //mxの更新\n for(int idx = 0; idx < m_mx; idx++){\n int pp = p_mx[idx];\n \n int i = p % pp;\n int cnt = 0;\n char c = S[i];\n for(int j = i; j < N; j += pp){\n if(c != S[j]) cnt++; \n }\n \n same_cnt_sum[idx] -= same_cnt[idx][i];\n same_cnt[idx][i] = cnt;\n same_cnt_sum[idx] += cnt;\n \n if(same_cnt_sum[idx] == 0){\n ans = min(ans, pp);\n }\n \n }\n \n \n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 2100, "memory_kb": 13056, "score_of_the_acc": -0.8673, "final_rank": 14 }, { "submission_id": "aoj_0414_10174089", "code_snippet": "// AOJ #414\n// Prayer for Iwashiro 2025.2.2\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tif (c == '-') {\tc = gc();\n\t\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\t\treturn -n;\n\t}\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nchar temp[100005];\nstring Cins() { // 文字列の入力　スペース以下の文字で入力終了\n char *s = temp;\n\tdo *s = gc();\n\twhile (*s++ > ' ');\n\t*(s-1) = 0;\n string input(temp); // 文字配列からstringを作成\n return input;\n}\n\nvoid Cout(int n) { // 整数の表示（出力）\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tif (n < 0) pc('-'), n = -n;\n\t\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n\t\twhile (i--) pc(b[i]);\n\t}\n\tpc('\\n');\n}\n\nint main() {\n int N = Cin(), Q = Cin();\n string str = Cins();\n \n string s = str + str;\n int same_l = 0;\n vector<int> p;\n for (int i = 1; i <= N / 2; i++){\n if (N % i == 0) p.push_back(i);\n }\n \n // Q 個のクエリを処理\n for (int i = 0; i < Q; i++){\n int pi = Cin();\n char c = gc(); gc();\n\n int pos = pi - 1;\n if(i >= 1 && s[pos] == c) {\n Cout(same_l);\n continue;\n } else {\n s[pos] = c;\n s[N + pos] = c;\n }\n \n int iwa = 0;\n bool found = false;\n for (size_t l = 0; l < p.size(); l++){\n iwa = 0;\n for (int m = 0; m < N / 2; m++){\n if ( s[m] != s[m + p[l]] || s[N - m - 1] != s[N - m + p[l] - 1] ) {\n iwa = 1;\n break;\n }\n }\n if(iwa == 0){\n Cout(p[l]);\n same_l = p[l];\n found = true;\n break;\n }\n }\n if(!found){\n same_l = N;\n Cout(N);\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3724, "score_of_the_acc": -0.0019, "final_rank": 1 }, { "submission_id": "aoj_0414_10174027", "code_snippet": "// AOJ #414\n// Prayer for Iwashiro 2025.2.2\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n \nconst ll MOD1 = 1000000007LL;\nconst ll MOD2 = 1000000009LL;\nconst ll BASE = 137;\n \n// --- Fenwick Tree (Binary Indexed Tree) ---\nstruct Fenw {\n int n;\n vector<ll> fenw;\n ll mod;\n Fenw(int n, ll mod) : n(n), mod(mod) {\n fenw.assign(n+1, 0);\n }\n void update(int i, ll delta) {\n i++;\n while(i <= n) {\n fenw[i] = (fenw[i] + delta) % mod;\n if(fenw[i] < 0) fenw[i] += mod;\n i += i & -i;\n }\n }\n ll query(int i) {\n ll res = 0;\n i++;\n while(i > 0) {\n res = (res + fenw[i]) % mod;\n i -= i & -i;\n }\n return (res % mod + mod) % mod;\n }\n ll rangeQuery(int l, int r) {\n if(l > r) return 0;\n ll res = query(r) - (l==0 ? 0 : query(l-1));\n res %= mod;\n if(res < 0) res += mod;\n return res;\n }\n};\n \n// --- Candidate structure ---\nstruct Candidate {\n int d;\n ll series1;\n ll series2;\n};\n \nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n \n int N, Q;\n cin >> N >> Q;\n string S;\n cin >> S;\n \n // --- Precompute power arrays for BASE^i mod MOD1 and MOD2 ---\n vector<ll> pow1(N+1), pow2(N+1);\n pow1[0] = 1; pow2[0] = 1;\n for (int i = 1; i <= N; i++){\n pow1[i] = (pow1[i-1] * BASE) % MOD1;\n pow2[i] = (pow2[i-1] * BASE) % MOD2;\n }\n \n Fenw fenw1(N, MOD1), fenw2(N, MOD2);\n vector<int> arr(N);\n for (int i = 0; i < N; i++){\n int val = S[i] - 'a' + 1;\n arr[i] = val;\n ll addVal1 = ( (ll) val * pow1[i] ) % MOD1;\n ll addVal2 = ( (ll) val * pow2[i] ) % MOD2;\n fenw1.update(i, addVal1);\n fenw2.update(i, addVal2);\n }\n \n vector<Candidate> candidates;\n for (int i = 1; i*i <= N; i++){\n if(N % i == 0){\n if(i < N){\n Candidate cand;\n cand.d = i;\n int rep = N / i;\n ll sum1 = 0, sum2 = 0;\n for (int j = 0; j < rep; j++){\n int pos = j * i;\n sum1 = (sum1 + pow1[pos]) % MOD1;\n sum2 = (sum2 + pow2[pos]) % MOD2;\n }\n cand.series1 = sum1;\n cand.series2 = sum2;\n candidates.push_back(cand);\n }\n int d2 = N / i;\n if(d2 != i && d2 < N){\n Candidate cand;\n cand.d = d2;\n int rep = N / d2;\n ll sum1 = 0, sum2 = 0;\n for (int j = 0; j < rep; j++){\n int pos = j * d2;\n sum1 = (sum1 + pow1[pos]) % MOD1;\n sum2 = (sum2 + pow2[pos]) % MOD2;\n }\n cand.series1 = sum1;\n cand.series2 = sum2;\n candidates.push_back(cand);\n }\n }\n }\n sort(candidates.begin(), candidates.end(), [](const Candidate &a, const Candidate &b){\n return a.d < b.d;\n });\n \n while(Q--){\n int pos;\n char c;\n cin >> pos >> c;\n pos--;\n int newVal = c - 'a' + 1;\n int oldVal = arr[pos];\n if(newVal != oldVal) {\n ll diff1 = ((ll)newVal - oldVal) * pow1[pos] % MOD1;\n ll diff2 = ((ll)newVal - oldVal) * pow2[pos] % MOD2;\n if(diff1 < 0) diff1 += MOD1;\n if(diff2 < 0) diff2 += MOD2;\n fenw1.update(pos, diff1);\n fenw2.update(pos, diff2);\n arr[pos] = newVal;\n }\n \n ll fullHash1 = fenw1.rangeQuery(0, N-1);\n ll fullHash2 = fenw2.rangeQuery(0, N-1);\n \n int ans = N;\n for(auto &cand : candidates){\n int d = cand.d;\n ll prefHash1 = fenw1.rangeQuery(0, d-1);\n ll prefHash2 = fenw2.rangeQuery(0, d-1);\n \n ll expected1 = (prefHash1 * cand.series1) % MOD1;\n ll expected2 = (prefHash2 * cand.series2) % MOD2;\n \n if(expected1 == fullHash1 && expected2 == fullHash2) {\n ans = d;\n break;\n }\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 1200, "memory_kb": 6788, "score_of_the_acc": -0.4661, "final_rank": 8 }, { "submission_id": "aoj_0414_9625942", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing i64 = long long;\n#define rep(i, a, b) for (int i = a; i < b; i++)\n#define repi(i, a, b) for (int i = a - 1; i >= b; i--)\n\nstruct Roliha {\n constexpr static int b = 5;\n constexpr static int modp[5] = {998244353, 1000000007, 1000000009, 1000000021, 1000000033};\n using T = array<i64, b>;\n T table;\n\n static int base[b];\n static array<vector<i64>, b> pw;\n\n static void setbase() {\n mt19937_64 rng(time(0));\n rep (i, 0, b) {\n base[i] = rng() % modp[i]; \n pw[i] = {1, base[i]};\n }\n }\n\n static void extend_pw(int upper) {\n while (pw[0].size() < upper) {\n rep (i, 0, b) pw[i].push_back(pw[i].back() * base[i] % modp[i]);\n }\n }\n\n Roliha() = default;\n Roliha(const string& s) {\n int n = s.size();\n extend_pw(n);\n rep (i, 0, b) {\n table[i] = 0;\n rep (j, 0, n) {\n table[i] += s[j] * pw[i][j] % modp[i];\n table[i] %= modp[i];\n }\n }\n }\n};\nint Roliha::base[5] = {3, 3, 3, 3, 3};\narray<vector<i64>, 5> Roliha::pw;\n\nint main() {\n Roliha::setbase();\n int n, q;\n cin >> n >> q;\n string s;\n cin >> s;\n\n vector<int> divisors;\n rep (i, 1, n + 1) if (n % i == 0) divisors.emplace_back(i);\n int dcnt = divisors.size();\n vector<vector<Roliha>> dist(dcnt - 1);\n vector<map<array<i64, 5>, int>> mp(dcnt - 1);\n rep (i, 0, dcnt - 1) {\n dist[i].resize(n / divisors[i]);\n rep (j, 0, n / divisors[i]) {\n dist[i][j] = Roliha(s.substr(divisors[i] * j, divisors[i]));\n mp[i][dist[i][j].table]++;\n }\n }\n\n rep (_, 0, q) {\n int p;\n char c;\n cin >> p >> c;\n --p;\n int res = n;\n repi (i, dcnt - 1, 0) {\n array<i64, 5> &now = dist[i][p / divisors[i]].table;\n mp[i][now]--;\n if (mp[i][now] == 0) mp[i].erase(now);\n rep (k, 0, 5) {\n now[k] += (int(c) - int(s[p]) + Roliha::modp[k]) * Roliha::pw[k][p % divisors[i]];\n now[k] %= Roliha::modp[k];\n }\n mp[i][now]++;\n if (mp[i].size() == 1) res = divisors[i];\n }\n s[p] = c;\n cout << res << '\\n';\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 2780, "memory_kb": 24144, "score_of_the_acc": -1.2464, "final_rank": 16 }, { "submission_id": "aoj_0414_9625920", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing i64 = long long;\n#define rep(i, a, b) for (int i = a; i < b; i++)\n#define repi(i, a, b) for (int i = a - 1; i >= b; i--)\n\nstruct Roliha {\n constexpr static int b = 5;\n constexpr static int modp[5] = {998244353, 1000000007, 1000000009, 1000000021, 1000000033};\n using T = array<i64, b>;\n T table;\n\n i64& operator[](int i) {\n return table[i];\n }\n\n static int base[b];\n static array<vector<i64>, b> pw;\n\n static void setbase() {\n mt19937_64 rng(time(0));\n rep (i, 0, b) {\n base[i] = rng() % modp[i]; \n pw[i] = {1, base[i]};\n }\n }\n\n static void extend_pw(int upper) {\n while (pw[0].size() < upper) {\n rep (i, 0, b) pw[i].push_back(pw[i].back() * base[i] % modp[i]);\n }\n }\n\n Roliha() = default;\n Roliha(const string& s) {\n int n = s.size();\n extend_pw(n);\n rep (i, 0, b) {\n table[i] = 0;\n rep (j, 0, n) table[i] += s[j] * pw[i][j] % modp[i];\n }\n }\n};\nint Roliha::base[5] = {3, 3, 3, 3, 3};\narray<vector<i64>, 5> Roliha::pw;\n\nint main() {\n Roliha::setbase();\n int n, q;\n cin >> n >> q;\n string s;\n cin >> s;\n\n vector<int> divisors;\n rep (i, 1, n + 1) if (n % i == 0) divisors.emplace_back(i);\n int dcnt = divisors.size();\n vector<vector<Roliha>> dist(dcnt - 1);\n vector<map<array<i64, 5>, int>> mp(dcnt - 1);\n rep (i, 0, dcnt - 1) {\n dist[i].resize(n / divisors[i]);\n rep (j, 0, n / divisors[i]) {\n dist[i][j] = Roliha(s.substr(divisors[i] * j, divisors[i]));\n mp[i][dist[i][j].table]++;\n }\n }\n\n rep (_, 0, q) {\n int p;\n char c;\n cin >> p >> c;\n --p;\n int res = n;\n rep (i, 0, dcnt - 1) {\n array<i64, 5> &now = dist[i][p / divisors[i]].table;\n mp[i][now]--;\n if (mp[i][now] == 0) mp[i].erase(now);\n rep (k, 0, 5) {\n now[k] += (int(c) - int(s[p]) + Roliha::modp[k]) * Roliha::pw[k][p % divisors[i]];\n now[k] %= Roliha::modp[k];\n }\n mp[i][now]++;\n if (mp[i].size() == 1) res = min(res, divisors[i]);\n }\n s[p] = c;\n cout << res << \"\\n\";\n }\n\n return 0;\n}", "accuracy": 0.7272727272727273, "time_ms": 1620, "memory_kb": 24180, "score_of_the_acc": -0.8266, "final_rank": 20 }, { "submission_id": "aoj_0414_9596050", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(n);++i)\nusing namespace std;\nusing ll = long long;\n\nvector<int> yakusu(int n){\n vector<int> res;\n for(int i = 1;i<=n;i++){\n if(n%i==0) res.push_back(i);\n }\n return res;\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n int n,q;\n cin >> n >> q;\n string s;\n cin >> s;\n\n vector<int> y = yakusu(n);\n int m = y.size();\n\n\n vector<vector<map<char,int>>> a(m);\n rep(i,m) a[i].resize(y[i]);\n\n vector<int> b(m,0);\n\n rep(j,n){\n rep(i,m){\n if(a[i][(j+1)%y[i]].size()==1){\n b[i]--;\n }\n\n a[i][(j+1)%y[i]][s[j]]++;\n\n if(a[i][(j+1)%y[i]].size()==1){\n b[i]++;\n }\n }\n }\n rep(qi,q){\n int p;\n char c;\n cin >> p >> c;\n \n rep(i,m){\n if(a[i][p%y[i]].size()==1){\n b[i]--;\n }\n\n a[i][p%y[i]][s[p-1]]--; \n if(a[i][p%y[i]][s[p-1]]==0) a[i][p%y[i]].erase(s[p-1]);\n\n if(a[i][p%y[i]].size()==1){\n b[i]++;\n }\n }\n s[p-1] = c;\n rep(i,m){\n if(a[i][p%y[i]].size()==1){\n b[i]--;\n }\n a[i][p%y[i]][s[p-1]]++;\n \n if(a[i][p%y[i]].size()==1){\n b[i]++;\n }\n }\n rep(i,m){\n if(b[i]==y[i]){\n cout << y[i] << endl;\n break;\n }\n }\n }\n\n}", "accuracy": 1, "time_ms": 1840, "memory_kb": 64984, "score_of_the_acc": -1.3949, "final_rank": 19 }, { "submission_id": "aoj_0414_9586811", "code_snippet": "#include <bits/stdc++.h>\n\nstd::vector<std::array<int, 26>> cnt[150];\nstd::vector<int> pos[150];\nint eval[150];\n\nint main() {\n int N, Q;\n std::cin >> N >> Q;\n std::vector<int> D;\n for (int i{1} ; i < N ; i++) if (N % i == 0) {\n D.push_back(i);\n }\n for (int i{} ; i < (int)D.size() ; i++) {\n cnt[i] = std::vector<std::array<int, 26>>(D[i]);\n pos[i] = std::vector<int>(D[i]);\n for (int j{} ; j < D[i] ; j++) cnt[i][j].fill(0);\n }\n auto add{[&](int i, char c) -> void {\n for (int j{} ; j < (int)D.size() ; j++) {\n int idx{i % D[j]};\n if (cnt[j][idx][c - 'a'] == 0) {\n if (pos[j][idx] == 1) eval[j]--;\n pos[j][idx]++;\n if (pos[j][idx] == 1) eval[j]++;\n }\n cnt[j][idx][c - 'a']++;\n }\n }};\n auto remove{[&](int i, char c) -> void {\n for (int j{} ; j < (int)D.size() ; j++) {\n int idx{i % D[j]};\n cnt[j][idx][c - 'a']--;\n if (cnt[j][idx][c - 'a'] == 0) {\n if (pos[j][idx] == 1) eval[j]--;\n pos[j][idx]--;\n if (pos[j][idx] == 1) eval[j]++;\n }\n }\n }};\n std::string S;\n std::cin >> S;\n for (int i{} ; i < N ; i++) add(i, S[i]);\n while (Q--) {\n int p;\n char c;\n std::cin >> p >> c;\n p--;\n remove(p, S[p]);\n S[p] = c;\n add(p, S[p]);\n int ans{N};\n for (int i{} ; i < (int)D.size() ; i++) if (eval[i] == D[i]) {\n ans = D[i];\n break;\n }\n std::cout << ans << '\\n';\n }\n}", "accuracy": 1, "time_ms": 240, "memory_kb": 31040, "score_of_the_acc": -0.4087, "final_rank": 5 }, { "submission_id": "aoj_0414_9574212", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n,q;\n\tcin >> n >> q;\n\tstring s;\n\tcin >> s;\n\tvector<pair<int,vector<vector<int>>>> t;\n\tvector<int> p;\n\tauto f = [&](int x){\n\t\tvector<vector<int>> cou(x,vector<int>(26,0));\n\t\tp.push_back(0);\n\t\tfor(int j = 0;j < n;j++){\n\t\t\tcou[j % x][s[j] - 'a']++;\n\t\t}\n\t\tfor(int j = 0;j < x;j++){\n\t\t\tfor(int k = 0;k < 26;k++){\n\t\t\t\tif(cou[j][k] == n / x){\n\t\t\t\t\tp.back()++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tt.push_back({x,cou});\n\t};\n\tf(1);\n\tfor(int i = 2;i * i <= n;i++){\n\t\tif(n % i != 0) continue;\n\t\tf(i);\n\t\tf(n / i);\n\t}\n\tfor(int i = 0;i < q;i++){\n\t\tint x;\n\t\tcin >> x;\n\t\tx--;\n\t\tchar c;\n\t\tcin >> c;\n\t\tint ans = n;\n\t\tfor(int j = 0;j < (int)t.size();j++){\n\t\t\tint l = t[j].first;\n\t\t\tint pos = x % l;\n\t\t\tif(t[j].second[pos][s[x] - 'a'] == n / l){\n\t\t\t\tp[j]--;\n\t\t\t}\n\t\t\tt[j].second[pos][s[x] - 'a']--;\n\t\t\tt[j].second[pos][c - 'a']++;\n\t\t\tif(t[j].second[pos][c - 'a'] == n / l){\n\t\t\t\tp[j]++;\n\t\t\t}\n\t\t\tif(p[j] == l){\n\t\t\t\tans = min(ans,l);\n\t\t\t}\n\t\t}\n\t\ts[x] = c;\n\t\tcout << ans << endl;\n\t}\n}", "accuracy": 1, "time_ms": 230, "memory_kb": 38136, "score_of_the_acc": -0.4901, "final_rank": 9 }, { "submission_id": "aoj_0414_9567732", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\ntemplate <class T> using V = std::vector<T>;\n\n#define REP(i, n) for (ll i = 0; i < (n); i++)\n#define REP2(i, a, b) for (ll i = (a); i < (b); i++)\n\nbool chmin(ll& x, const ll& y) { if (x > y) { return x = y, 1; } return 0; }\nbool chmax(ll& x, const ll& y) { if (x < y) { return x = y, 1; } return 0; }\n\nvector<ll> divisor_list(const ll& n) {\n\tV<ll> result{};\n\tfor (ll i = 1; i * i <= n; i++) {\n\t\tif (n % i == 0) {\n\t\t\tresult.emplace_back(i);\n\t\t\tif (i * i != n) result.emplace_back(n / i);\n\t\t}\n\t}\n\tsort(begin(result), end(result));\n\treturn result;\n}\n\nint main()\n{\n\tint n, q; cin >> n >> q;\n\tstring s; cin >> s;\n\tV<ll> len_list = divisor_list(n);\n\tll siz = len_list.size();\n\tV<V<V<ll>>> count(siz);\n\tREP(i, siz) {\n\t\tcount[i] = V<V<ll>>(len_list[i], V<ll>(26, 0));\n\t}\n\n\tV<ll> save(siz, 0);\n\tREP(i, n) {\n\t\tREP(j, siz) {\n\t\t\tcount[j][i % len_list[j]][s[i] - 'a']++;\n\t\t\tif (count[j][i % len_list[j]][s[i] - 'a'] == n / len_list[j]) {\n\t\t\t\tsave[j]++;\n\t\t\t}\n\t\t}\n\t}\n\n\tREP(_, q) {\n\t\tint p; char c; cin >> p >> c; p--;\n\t\tREP(i, siz) {\n\t\t\tif (count[i][p % len_list[i]][s[p] - 'a'] == n / len_list[i]) {\n\t\t\t\tsave[i]--;\n\t\t\t}\n\t\t\tcount[i][p % len_list[i]][s[p] - 'a']--;\n\t\t\tcount[i][p % len_list[i]][c - 'a']++;\n\t\t\tif (count[i][p % len_list[i]][c - 'a'] == n / len_list[i]) {\n\t\t\t\tsave[i]++;\n\t\t\t}\n\t\t}\n\t\ts[p] = c;\n\t\tll min_len{n};\n\t\tREP(i, siz) {\n\t\t\tif (save[i] == len_list[i]) {\n\t\t\t\tchmin(min_len, len_list[i]);\n\t\t\t}\n\t\t}\n\t\tcout << min_len << '\\n';\n\t}\n}", "accuracy": 1, "time_ms": 860, "memory_kb": 87068, "score_of_the_acc": -1.3043, "final_rank": 18 }, { "submission_id": "aoj_0414_9507305", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug_print.hpp>\n#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define debug(...) (static_cast<void>(0))\n#endif\n\n// xの約数を列挙した配列を返す\nvector<ll> make_is_divisors(ll N, bool sorted = true) {\n vector<ll> divisors;\n for (ll i = 1; i * i <= N; i++) {\n if (N % i == 0) {\n divisors.emplace_back(i);\n if (N / i != i) divisors.emplace_back(N / i);\n }\n }\n if (sorted) sort(divisors.begin(), divisors.end());\n return divisors;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N, Q;\n cin >> N >> Q;\n string S;\n cin >> S;\n\n // N の約数を列挙\n auto divs = make_is_divisors(N);\n int M = divs.size();\n // cnt[i][j][c] := N の約数 divs[i] の j mod divs[i] にある c の個数\n vector<vector<vector<int>>> cnt(M);\n for (int i = 0; i < M; i++) {\n cnt[i].resize(divs[i], vector<int>(26));\n for (int j = 0; j < N; j++) {\n cnt[i][j % divs[i]][S[j] - 'a']++;\n }\n }\n\n // cnt2[i] := N の約数 divs[i] について, N / divs[i] 個ある個数\n vector<int> cnt2(M);\n for (int i = 0; i < M; i++) {\n for (int j = 0; j < divs[i]; j++) {\n bool ok = false;\n for (int c = 0; c < 26; c++) {\n if (cnt[i][j][c] == N / divs[i]) {\n ok = true;\n break;\n }\n }\n if (ok) cnt2[i]++;\n }\n }\n\n while (Q--) {\n int p;\n char c;\n cin >> p >> c, p--;\n for (int i = 0; i < M; i++) {\n // S[p] の個数が N / divs[i] であれば cnt2[i] も更新\n if (cnt[i][p % divs[i]][S[p] - 'a']-- == N / divs[i]) cnt2[i]--;\n // c の個数が N / divs[i] であれば cnt2[i] も更新\n if (++cnt[i][p % divs[i]][c - 'a'] == N / divs[i]) cnt2[i]++;\n }\n S[p] = c;\n // N の i 番目の約数 divs[i] について, cnt2[i] の個数が divs[i] であれば周期 divs[i] となる\n for (int i = 0; i < M; i++) {\n if (cnt2[i] == divs[i]) {\n cout << divs[i] << '\\n';\n break;\n }\n }\n }\n}", "accuracy": 1, "time_ms": 410, "memory_kb": 49172, "score_of_the_acc": -0.6875, "final_rank": 10 }, { "submission_id": "aoj_0414_9506753", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug_print.hpp>\n#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define debug(...) (static_cast<void>(0))\n#endif\n\n// xの約数を列挙した配列を返す\nvector<ll> make_is_divisors(ll N, bool sorted = true) {\n vector<ll> divisors;\n for (ll i = 1; i * i <= N; i++) {\n if (N % i == 0) {\n divisors.emplace_back(i);\n if (N / i != i) divisors.emplace_back(N / i);\n }\n }\n if (sorted) sort(divisors.begin(), divisors.end());\n return divisors;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N, Q;\n cin >> N >> Q;\n string S;\n cin >> S;\n\n // N の約数を列挙\n auto divs = make_is_divisors(N);\n int M = divs.size();\n // cnt[i][j][c] := N の約数 divs[i] の j mod divs[i] にある c の個数\n vector<vector<vector<int>>> cnt(M);\n for (int i = 0; i < M; i++) {\n cnt[i].resize(divs[i], vector<int>(26));\n for (int j = 0; j < N; j++) {\n cnt[i][j % divs[i]][S[j] - 'a']++;\n }\n }\n\n // flag[i] := N の約数 divs[i] について, N / divs[i] 個ある個数\n vector<int> flag(M);\n for (int i = 0; i < M; i++) {\n for (int j = 0; j < divs[i]; j++) {\n bool ok = false;\n for (int c = 0; c < 26; c++) {\n if (cnt[i][j][c] == N / divs[i]) {\n ok = true;\n break;\n }\n }\n if (ok) flag[i]++;\n }\n }\n\n while (Q--) {\n int p;\n char c;\n cin >> p >> c, p--;\n for (int i = 0; i < M; i++) {\n // S[p] の個数が N / divs[i] であれば flag[i] も更新\n if (cnt[i][p % divs[i]][S[p] - 'a'] == N / divs[i]) flag[i]--;\n cnt[i][p % divs[i]][S[p] - 'a']--;\n cnt[i][p % divs[i]][c - 'a']++;\n // c の個数が N / divs[i] であれば flag[i] も更新\n if (cnt[i][p % divs[i]][c - 'a'] == N / divs[i]) flag[i]++;\n }\n S[p] = c;\n // 各約数について, その約数の mod が同じものを全て見る\n for (int i = 0; i < M; i++) {\n if (flag[i] == divs[i]) {\n cout << divs[i] << '\\n';\n break;\n }\n }\n }\n}", "accuracy": 1, "time_ms": 490, "memory_kb": 49052, "score_of_the_acc": -0.715, "final_rank": 11 }, { "submission_id": "aoj_0414_9483635", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define REP(i,n)for(int i=0;i<(n);++i)\n#define REP1(i,n)for(int i=1;i<=(n);++i)\n#define FORE(...)for(auto&&__VA_ARGS__)\n#define ALL(x)begin(x),end(x)\n#define mset(x,y)memset(x,y,sizeof x)\n#define pb push_back\n#define eb emplace_back\n#define V vector\n#define lb(x,y)(lower_bound(begin(x),end(x),y)-begin(x))\n#define ub(x,y)(upper_bound(begin(x),end(x),y)-begin(x))\n#define NP(x)next_permutation(begin(x),end(x))\n#define SORT(x)sort(ALL(x))\n#define UNIQ(v)v.erase(unique(begin(v),end(v)),end(v))\n#define SORTUNIQ(v)SORT(v),UNIQUE(v)\n#define readInt readInt_()\n#define readString readString_()\nusing Int=long long;\nusing Real=long double;\nusing PII=pair<int,int>;\nusing PLL=pair<Int,Int>;\ntemplate<class T>using PQMIN=priority_queue<T,V<T>,greater<T>>;\ntemplate<class T>using PQMAX=priority_queue<T>;\nconstexpr int INFI=1001001001;\nconstexpr Int INFL=2002002002002002002LL;\ntemplate<class T,class S>inline bool chmin(T&A,S B){return A>B?A=B,1:0;}\ntemplate<class T,class S>inline bool chmax(T&A,S B){return A<B?A=B,1:0;}\nInt readInt_(){Int x;cin>>x;return x;}\nstring readString_(){string s;cin>>s;return s;}\ntemplate<class T>V<T>readVector(int N){\n\tV<T>ret(N);\n\tREP(i,N)cin>>ret[i];\n\treturn ret;\n}\nV<V<int>>readGraph(int N,int M,bool directed){\n\tV<V<int>>G(N);\n\tREP(i,M){\n\t\tint u,v;cin>>u>>v;\n\t\tG[--u].pb(--v);\n\t\tif(!directed)G[v].pb(u);\n\t}\n\treturn G;\n}\nV<V<pair<int,Int>>>readWeightedGraph(int N,int M,bool directed){\n\tV<V<pair<int,Int>>>G(N);\n\tREP(i,M){\n\t\tint u,v;Int w;cin>>u>>v>>w;\n\t\tG[--u].eb(--v,w);\n\t\tif(!directed)G[v].eb(u,w);\n\t}\n\treturn G;\n}\ntemplate<class T>V<Int>dijkstra(V<V<T>>&G,int S,Int distS=0){\n\tV<Int>dist(size(G),INFL);\n\tdist[S]=distS;\n\tPQMIN<pair<Int,int>>Q;\n\tQ.push({distS,S});\n\twhile(!empty(Q)){\n\t\tauto[c,u]=Q.top();Q.pop();\n\t\tif(dist[u]<c)continue;\n\t\tFORE([v,w]:G[u])if(chmin(dist[v],c+w)){\n\t\t\tQ.push({dist[v],v});\n\t\t}\n\t}\n\treturn dist;\n}\nV<PII>dxdy(int x,int y){\n\treturn{{x+1,y},{x-1,y},{x,y+1},{x,y-1}};\n}\nV<PII>dxdy(int x,int y,int H,int W){\n\tV<PII>ret;\n\tif(x+1<H)ret.eb(x+1,y);\n\tif(x)ret.eb(x-1,y);\n\tif(y+1<W)ret.eb(x,y+1);\n\tif(y)ret.eb(x,y-1);\n\treturn ret;\n}\nV<PII>dxdy8(int x,int y){\n\treturn{{x+1,y},{x-1,y},{x,y+1},{x,y-1},{x-1,y-1},{x-1,y+1},{x+1,y-1},{x+1,y+1}};\n}\nV<PII>dxdy8(int x,int y,int H,int W){\n\tV<PII>ret;\n\tif(x+1<H)ret.eb(x+1,y);\n\tif(x)ret.eb(x-1,y);\n\tif(y+1<W)ret.eb(x,y+1);\n\tif(y)ret.eb(x,y-1);\n\tif(x+1<H&&y+1<W)ret.eb(x+1,y+1);\n\tif(x+1<H&&y)ret.eb(x+1,y-1);\n\tif(x&&y+1<W)ret.eb(x-1,y+1);\n\tif(x&&y)ret.eb(x-1,y-1);\n\treturn ret;\n}\nvoid fastIO(){ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);}\n\nV<int>divisor(int N){\n\tV<int>ret;\n\tfor(int i=1;i*i<=N;++i)if(N%i==0){\n\t\tret.pb(i);\n\t\tif(i*i<N)ret.pb(N/i);\n\t}\n\treturn ret;\n}\nsigned main(){\n\tfastIO();\n\tint N,Q;cin>>N>>Q;\n\tstring S;cin>>S;\n\tauto d=divisor(N);\n\tSORT(d);\n\tint M=d.size();\n\tV<V<map<char,int>>>mp(M);\n\tV<int>cnt(M);\n\tREP(i,M)mp[i].resize(d[i]);\n\tREP(i,N)REP(j,M)++mp[j][i%d[j]][S[i]];\n\tREP(i,M)REP(j,d[i])cnt[i]+=mp[i][j].size()>1;\n\twhile(Q--){\n\t\tint p;\n\t\tchar c;\n\t\tcin>>p>>c;\n\t\t--p;\n\t\tint ans;\n\t\tfor(int i=M;i--;){\n\t\t\tif(!--mp[i][p%d[i]][S[p]]){\n\t\t\t\tmp[i][p%d[i]].erase(S[p]);\n\t\t\t\tif(mp[i][p%d[i]].size()==1)--cnt[i];\n\t\t\t}\n\t\t\tif(++mp[i][p%d[i]][c]==1){\n\t\t\t\tif(mp[i][p%d[i]].size()==2)++cnt[i];\n\t\t\t}\n\t\t\tif(cnt[i]==0){\n\t\t\t\tans=d[i];\n\t\t\t}\n\t\t}\n\t\tS[p]=c;\n\t\tcout<<ans<<\"\\n\";\n\t}\n}", "accuracy": 1, "time_ms": 1490, "memory_kb": 64992, "score_of_the_acc": -1.2682, "final_rank": 17 }, { "submission_id": "aoj_0414_9483473", "code_snippet": "//line 2 \"/home/seekworser/.cpp_lib/competitive_library/competitive/std/std.hpp\"\n#include <bits/stdc++.h>\n#ifndef LOCAL_TEST\n#pragma GCC target (\"avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#endif // LOCAL_TEST\nusing namespace std;\nusing std::cout;\n// shorten typenames\nusing ll = long long;\nusing pii = pair<int, int>; using pll = pair<ll, ll>;\nusing vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;\nusing vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;\nusing vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;\nusing vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;\nusing vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;\nusing vs = vector<string>; using vvs = vector<vector<string>>; using vvvs = vector<vector<vector<string>>>;\ntemplate<typename T> vector<vector<T>> vv(int h, int w, T val = T()) { return vector(h, vector<T>(w, val)); }\ntemplate<typename T> vector<vector<vector<T>>> vvv(int h1, int h2, int h3, T val = T()) { return vector(h1, vector(h2, vector<T>(h3, val))); }\ntemplate<typename T> vector<vector<vector<vector<T>>>> vvvv(int h1, int h2, int h3, int h4, T val = T()) { return vector(h1, vector(h2, vector(h3, vector<T>(h4, val)))); }\ntemplate <class T> using priority_queue_min = priority_queue<T, vector<T>, greater<T>>;\n// define CONSTANTS\nconstexpr double PI = 3.14159265358979323;\nconstexpr int INF = 100100111; constexpr ll INFL = 3300300300300300491LL;\nfloat EPS = 1e-8; double EPSL = 1e-10;\ntemplate<typename T> bool eq(const T x, const T y) { return x == y; }\ntemplate<> bool eq<double>(const double x, const double y) { return (abs(x - y) < EPSL * x || abs(x - y) < EPSL); }\ntemplate<> bool eq<float>(const float x, const float y) { return abs(x - y) < EPS * x; }\ntemplate<typename T> bool neq(const T x, const T y) { return !(eq<T>(x, y)); }\ntemplate<typename T> bool ge(const T x, const T y) { return (eq<T>(x, y) || (x > y)); }\ntemplate<typename T> bool le(const T x, const T y) { return (eq<T>(x, y) || (x < y)); }\ntemplate<typename T> bool gt(const T x, const T y) { return !(le<T>(x, y)); }\ntemplate<typename T> bool lt(const T x, const T y) { return !(ge<T>(x, y)); }\nconstexpr int MODINT998244353 = 998244353;\nconstexpr int MODINT1000000007 = 1000000007;\n// fasten io\nstruct Nyan { Nyan() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } nyan;\n// define macros\n#define all(a) (a).begin(), (a).end()\n#define sz(x) ((ll)(x).size())\n#define rep1(n) for(ll dummy_iter = 0LL; dummy_iter < n; ++dummy_iter) // 0,1,...,n-1\n#define rep2(i, n) for(ll i = 0LL, i##_counter = 0LL; i##_counter < ll(n); ++(i##_counter), (i) = i##_counter) // i=0,1,...,n-1\n#define rep3(i, s, t) for(ll i = ll(s), i##_counter = ll(s); i##_counter < ll(t); ++(i##_counter), (i) = (i##_counter)) // i=s,s+1,...,t-1\n#define rep4(i, s, t, step) for(ll i##_counter = step > 0 ? ll(s) : -ll(s), i##_end = step > 0 ? ll(t) : -ll(t), i##_step = abs(step), i = ll(s); i##_counter < i##_end; i##_counter += i##_step, i = step > 0 ? i##_counter : -i##_counter) // i=s,s+step,...,<t\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define repe(a, v) for(auto& a : (v)) // iterate over all elements in v\n#define smod(n, m) ((((n) % (m)) + (m)) % (m))\n#define sdiv(n, m) (((n) - smod(n, m)) / (m))\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());}\nint Yes(bool b=true) { cout << (b ? \"Yes\\n\" : \"No\\n\"); return 0; };\nint YES(bool b=true) { cout << (b ? \"YES\\n\" : \"NO\\n\"); return 0; };\nint No(bool b=true) {return Yes(!b);};\nint NO(bool b=true) {return YES(!b);};\ntemplate<typename T, size_t N> T max(array<T, N>& a) { return *max_element(all(a)); };\ntemplate<typename T, size_t N> T min(array<T, N>& a) { return *min_element(all(a)); };\ntemplate<typename T> T max(vector<T>& a) { return *max_element(all(a)); };\ntemplate<typename T> T min(vector<T>& a) { return *min_element(all(a)); };\ntemplate<typename T> vector<T> vec_slice(const vector<T>& a, int l, int r) { vector<T> rev; rep(i, l, r) rev.push_back(a[i]); return rev; };\ntemplate<typename T> T sum(vector<T>& a, T zero = T(0)) { T rev = zero; rep(i, sz(a)) rev += a[i]; return rev; };\ntemplate<typename T> bool in_range(const T& val, const T& s, const T& t) { return s <= val && val < t; };\n\ntemplate <class T> inline vector<T>& operator--(vector<T>& v) { repe(x, v) --x; return v; }\ntemplate <class T> inline vector<T>& operator++(vector<T>& v) { repe(x, v) ++x; return v; }\n\nll powm(ll a, ll n, ll mod=INFL) {\n ll res = 1;\n while (n > 0) {\n if (n & 1) res = (res * a) % mod;\n if (n > 1) a = (a * a) % mod;\n n >>= 1;\n }\n return res;\n}\nll sqrtll(ll x) {\n assert(x >= 0);\n ll rev = sqrt(x);\n while(rev * rev > x) --rev;\n while((rev+1) * (rev+1)<=x) ++rev;\n return rev;\n}\ntemplate <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; }\ntemplate <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; }\nint digit(ll x, int d=10) { int rev=0; while (x > 0) { rev++; x /= d;}; return rev; }\n/**\n * @brief std.hpp\n * @docs docs/std/std.md\n */\n//line 3 \"/home/seekworser/.cpp_lib/competitive_library/competitive/string/rolling_hash.hpp\"\nusing hash_t = unsigned long long;\nusing hash_vector_t = vector<hash_t>;\nconstexpr hash_t RHMOD = (1UL << 61) - 1;\nconstexpr hash_t RHR = 37;\n\nnamespace internal {\n const hash_t MASK30 = (1UL << 30) - 1;\n const hash_t MASK31 = (1UL << 31) - 1;\n const hash_t MASK61 = RHMOD;\n\n //mod 2^61-1を計算する関数\n hash_t CalcMod(hash_t x) {\n hash_t xu = x >> 61;\n hash_t xd = x & MASK61;\n hash_t res = xu + xd;\n if (res >= RHMOD) res -= RHMOD;\n return res;\n }\n\n //a*b mod 2^61-1を返す関数(最後にModを取る)\n hash_t Mul(hash_t a, hash_t b) {\n hash_t au = a >> 31;\n hash_t ad = a & MASK31;\n hash_t bu = b >> 31;\n hash_t bd = b & MASK31;\n hash_t mid = ad * bu + au * bd;\n hash_t midu = mid >> 30;\n hash_t midd = mid & MASK30;\n return CalcMod(au * bu * 2 + midu + (midd << 31) + ad * bd);\n }\n\n hash_t Pow(hash_t a, hash_t n) {\n hash_t res = 1;\n while (n > 0) {\n if (n & 1) res = Mul(res, a);\n a = Mul(a, a);\n n >>= 1;\n }\n return res;\n }\n}\n\nstruct RollingHash {\n private:\n static bool initialized;\n static int hash_size;\n\n public:\n static vector<hash_t> base;\n static vector<hash_t> base_inv;\n vector<hash_vector_t> cum;\n template<typename T> RollingHash(vector<T> &a, int hash_size=3, ll maxa=1e9) {\n if(!initialized) (*this).init_base(hash_size, maxa);\n (*this).calc(a);\n };\n RollingHash(string &a, int hash_size=3, ll maxa=1e9) {\n if(!initialized) (*this).init_base(hash_size, maxa);\n (*this).calc(a);\n }\n\n void init_base(int hash_size, ll maxa) {\n (*this).hash_size = hash_size;\n random_device seed_gen;\n mt19937 engine(seed_gen());\n while (sz(base) < hash_size) {\n hash_t k = 0;\n hash_t b = internal::Pow(RHR, k);\n while (b <= maxa || gcd(RHMOD-1, b) != 1) {\n k = engine();\n b = internal::Pow(RHR, k);\n }\n base.push_back(b);\n base_inv.push_back(internal::Pow(b, RHMOD-2));\n }\n initialized = true;\n }\n\n template<typename T> void calc(vector<T> const &a) {\n cum = vector<hash_vector_t>(sz(a)+1, vector<hash_t>(hash_size, 0));\n rep(i, hash_size) {\n hash_t base_pow = 1;\n rep(j, sz(a)) {\n cum[j+1][i] = internal::CalcMod(cum[j][i] + internal::Mul(a[j], base_pow));\n base_pow = internal::Mul(base_pow, (*this).base[i]);\n }\n }\n }\n\n void calc(string const &a) {\n vector<char> _a(a.begin(), a.end());\n calc(_a);\n };\n\n vector<hash_t> query(int l, int r) {\n assert(l <= r);\n assert(0 <= l && r < sz(cum));\n vector<hash_t> rev(hash_size);\n rep(i, hash_size) {\n rev[i] = internal::Mul(cum[r][i] + RHMOD - cum[l][i], internal::Pow((*this).base_inv[i], l));\n }\n return rev;\n }\n\n template <class T> vector<hash_vector_t> calc_hash(vector<T> const &a, int k){\n assert(sz(a) >= k);\n vector<hash_vector_t> res(sz(a) - k + 1, vector<hash_t>(hash_size));\n vector<hash_t> base_pow(hash_size);\n rep(i, hash_size) base_pow[i] = internal::Pow(this->base[i], k);\n\n rep(i, hash_size) {\n // 先頭のハッシュ計算\n hash_t b = this->base[i];\n hash_t sh = 0;\n rep(j, k){ sh = internal::CalcMod(internal::Mul(sh, b) + a[j]); }\n res[0][i] = sh;\n\n // sをずらしてハッシュ値を更新\n rep(j, sz(a) - k){\n sh = internal::CalcMod(internal::Mul(sh, b) + a[j+k] + RHMOD - internal::Mul(a[j], base_pow[i]));\n res[j+1][i] = sh;\n }\n }\n return res;\n }\n\n vector<hash_vector_t> calc_hash(string const &a, int k) {\n vector<char> _a(a.begin(), a.end());\n return calc_hash(_a, k);\n };\n};\nbool RollingHash::initialized = false;\nint RollingHash::hash_size = 3;\nvector<hash_t> RollingHash::base(0);\nvector<hash_t> RollingHash::base_inv(0);\n/**\n * @brief rolling_hash.hpp\n * @docs docs/string/rolling_hash.md\n */\n//line 3 \"/home/seekworser/.cpp_lib/competitive_library/competitive/math/prime.hpp\"\nbool is_prime(ll n) {\n using u128 = __uint128_t;\n vector<u128> a_list = {2, 7, 61, 325, 9375, 28178, 450775, 9780504, 1795265022};\n if (n == 1) return false;\n if (n == 2) return true;\n if (n % 2 == 0) return false;\n ll r = 0;\n ll d = n - 1;\n while (!(d & 1)) {\n d >>= 1;\n r++;\n }\n ll cnt = 0;\n repe(a, a_list) {\n if (a >= n) continue;\n u128 res = 1;\n ll di = d;\n while (di > 0) {\n if (di & 1) res = (res * a) % n;\n if (di > 1) a = (a * a) % n;\n di >>= 1;\n }\n if (res == 1) continue;\n bool valid = false;\n rep(i, r) {\n if (res == n - 1) valid = true;\n res = (res * res) % n;\n }\n if (!valid) return false;\n }\n return true;\n}\n\ntemplate <class T> vector<T> divisor(T n, bool sorted=true) {\n vector<T> ans(0);\n for (T i = 1; i <= (T)std::sqrt(n); i++) {\n if (n % i == 0) {\n ans.push_back(i);\n if (i * i != n) ans.push_back(n / i);\n }\n }\n if (sorted) sort(ans.begin(), ans.end());\n return ans;\n};\ntemplate <class T> vector<T> prime_factor(T n) {\n vector<T> ans(0);\n for (T i = 2; i <= (T)std::sqrt(n); i++) {\n while (n % i == 0) {\n ans.push_back(i);\n n /= i;\n }\n }\n if (n != 1) ans.push_back(n);\n return ans;\n};\ntemplate <class T> map<T, T> prime_factor_c(T n) {\n map<T, T> ans;\n for (T i = 2; i <= (T)std::sqrt(n); i++) {\n while (n % i == 0) {\n ans[i] += 1;\n n /= i;\n }\n }\n if (n != 1) ans[n] += 1;\n return ans;\n};\ntemplate <class T> vector<T> primes(T n) {\n vector<T> ans(0);\n if (n < 2) return ans;\n vector<bool> is_primev(n+1, true);\n is_primev.at(0) = is_primev.at(1) = false;\n for (T i = 2; i <= (T)std::sqrt(n); i++) {\n if (!is_primev.at(i)) continue;\n for (T j = i*2; j <= n; j+=i) is_primev.at(j) = false;\n }\n for (T i = 2; i <= n; i++) {\n if (is_primev.at(i)) ans.push_back(i);\n }\n return ans;\n};\ntemplate <class T> vector<T> segment_seive(T s, T t) {\n vector<T> ans(0);\n if (t < 2 || s < 0 || s >= t) return ans;\n vector<bool> is_prime_small((T)std::sqrt(t)+1, true);\n vector<bool> is_prime_large(t-s, true);\n for (T i = 2; i <= (T)std::sqrt(t); i++) {\n if (!is_prime_small.at(i)) continue;\n for (T j = i*2; j*j < t; j+=i) is_prime_small.at(j) = false;\n for (T j = max(2*i, ((s+i-1)/i)*i); j < t; j+=i) is_prime_large.at(j-s) = false;\n }\n for (T i=0; i < t-s; i++) {\n if (is_prime_large.at(i) && s+i != 1) ans.push_back(s+i);\n }\n return ans;\n};\n/**\n * @brief prime.hpp\n * @docs docs/math/prime.md\n */\n//line 3 \"/home/seekworser/.cpp_lib/competitive_library/competitive/std/io.hpp\"\n// overload operators (prototypes)\ntemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p);\ntemplate <class T> inline istream& operator>>(istream& is, vector<T>& v);\ntemplate <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p);\ntemplate <class T> inline ostream& operator<<(ostream& os, const vector<T>& v);\ntemplate <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp);\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &st);\ntemplate <typename T> ostream &operator<<(ostream &os, const multiset<T> &st);\ntemplate <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st);\ntemplate <typename T> ostream &operator<<(ostream &os, queue<T> q);\ntemplate <typename T> ostream &operator<<(ostream &os, deque<T> q);\ntemplate <typename T> ostream &operator<<(ostream &os, stack<T> st);\ntemplate <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq);\n\n// overload operators\ntemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate <class T> inline istream& operator>>(istream& is, vector<T>& v) { repe(x, v) is >> x; return is; }\ntemplate <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p) { os << p.first << \" \" << p.second; return os; }\ntemplate <class T> inline ostream& operator<<(ostream& os, const vector<T>& v) { rep(i, sz(v)) { os << v.at(i); if (i != sz(v) - 1) os << \" \"; } return os; }\ntemplate <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp) { for (auto &[key, val] : mp) { os << key << \":\" << val << \" \"; } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? \" \" : \"\"); itr++; } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? \" \" : \"\"); itr++; } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st) { ll cnt = 0; for (auto &e : st) { os << e << (++cnt != (int)st.size() ? \" \" : \"\"); } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, queue<T> q) { while (q.size()) { os << q.front() << \" \"; q.pop(); } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, deque<T> q) { while (q.size()) { os << q.front(); q.pop_front(); if (q.size()) os << \" \"; } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, stack<T> st) { while (st.size()) { os << st.top() << \" \"; st.pop(); } return os; }\ntemplate <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq) { while (pq.size()) { os << pq.top() << \" \"; pq.pop(); } return os; }\n\ntemplate <typename T> int print_sep_end(string sep, string end, const T& val) { (void)sep; cout << val << end; return 0; };\ntemplate <typename T1, typename... T2> int print_sep_end(string sep, string end, const T1 &val, const T2 &...remain) {\n cout << val << sep;\n print_sep_end(sep, end, remain...);\n return 0;\n};\ntemplate <typename... T> int print(const T &...args) { print_sep_end(\" \", \"\\n\", args...); return 0; };\ntemplate <typename... T> void flush() { cout << flush; };\ntemplate <typename... T> int print_and_flush(const T &...args) { print(args...); flush(); return 0; };\n#define debug(...) debug_func(0, #__VA_ARGS__, __VA_ARGS__) // debug print\ntemplate <typename T> void input(T &a) { cin >> a; };\ntemplate <typename T1, typename... T2> void input(T1&a, T2 &...b) { cin >> a; input(b...); };\n#ifdef LOCAL_TEST\ntemplate <typename T> void debug_func(int i, const T name) { (void)i; (void)name; cerr << endl; }\ntemplate <typename T1, typename T2, typename... T3> void debug_func(int i, const T1 &name, const T2 &a, const T3 &...b) {\n int scope = 0;\n for ( ; (scope != 0 || name[i] != ',') && name[i] != '\\0'; i++ ) {\n cerr << name[i];\n if (name[i] == '(' || name[i] == '{') scope++;\n if (name[i] == ')' || name[i] == '}') scope--;\n }\n cerr << \":\" << a << \" \";\n debug_func(i + 1, name, b...);\n}\ntemplate <typename T1, typename T2, typename... T3> void debug_func(int i, const T1 &name, T2 &a, T3 &...b) {\n int scope = 0;\n for ( ; (scope != 0 || name[i] != ',') && name[i] != '\\0'; i++ ) {\n cerr << name[i];\n if (name[i] == '(' || name[i] == '{') scope++;\n if (name[i] == ')' || name[i] == '}') scope--;\n }\n cerr << \":\" << a << \" \";\n debug_func(i + 1, name, b...);\n}\n#endif\n#ifndef LOCAL_TEST\ntemplate <typename... T>\nvoid debug_func(T &...) {}\ntemplate <typename... T>\nvoid debug_func(const T &...) {}\n#endif\n/**\n * @brief io.hpp\n * @docs docs/std/io.md\n */\n//line 5 \"answer.cpp\"\nint main() {\n ll n,q; input(n, q);\n vector<ll> s(n);\n rep(i, n) {\n char c; input(c);\n s[i] = c;\n }\n RollingHash rh(s);\n vl d = divisor(n);\n vector<vector<ll>> hashes;\n repe(di, d) {\n debug(di);\n hashes.push_back(vector<ll>(n / di));\n rep(i, n / di) {\n ll s = i * di;\n hashes.back()[i] = rh.query(s, s+di)[0];\n }\n }\n ll bs = rh.base[0];\n vector<map<ll, ll>> cnt(sz(d));\n set<ll> ok;\n rep(i, sz(d)) {\n repe(sh, hashes[i]) cnt[i][sh]++;\n if (sz(cnt[i]) == 1) ok.insert(i);\n }\n rep(i, q) {\n ll p; char c; input(p, c);\n --p;\n rep(i, sz(d)) {\n ll px = p / d[i];\n ll py = p % d[i];\n ll sh = hashes[i][px];\n ll shn = internal::CalcMod(RHMOD + sh - internal::Mul(s[p], internal::Pow(bs, py)) + internal::Mul(c, internal::Pow(bs, py)));\n cnt[i][sh]--;\n if (cnt[i][sh] == 0) cnt[i].erase(sh);\n cnt[i][shn]++;\n if ((sz(cnt[i])) == 1) ok.insert(i);\n if (ok.count(i) && (sz(cnt[i])) != 1) ok.erase(i);\n hashes[i][px] = shn;\n }\n debug(ok);\n s[p] = c;\n ll ans = *(ok.begin());\n print(d[ans]);\n }\n debug(ok);\n}", "accuracy": 1, "time_ms": 1640, "memory_kb": 17308, "score_of_the_acc": -0.7515, "final_rank": 12 }, { "submission_id": "aoj_0414_9021713", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n constexpr int MAXN = 100005;\n constexpr long long MOD = 1000000007;\n constexpr long long BASE = 661525488;\n vector<long long> base_pow(MAXN, 1);\n for(int i = 1; i < MAXN; i++) {\n base_pow[i] = base_pow[i-1]*BASE%MOD;\n }\n int N, Q;\n string S;\n cin >> N >> Q >> S;\n vector<int> div;\n for(int i = 1; i*i <= N; i++) {\n if(N%i == 0) {\n div.push_back(i);\n div.push_back(N/i);\n }\n }\n sort(div.begin(), div.end());\n int ds = div.size();\n vector<vector<long long>> hash(ds);\n vector<multiset<long long>> M(ds);\n for(int i = 0; i < ds; i++) {\n hash[i].resize(N/div[i]);\n for(int j = 0; j < N; j++) {\n hash[i][j/div[i]] += base_pow[j%div[i]]*S[j]%MOD;\n hash[i][j/div[i]] %= MOD;\n }\n M[i] = multiset(hash[i].begin(), hash[i].end());\n }\n for(int q = 0; q < Q; q++) {\n int p;\n char c;\n cin >> p >> c;\n p--;\n for(int i = 0; i < ds; i++) {\n M[i].erase(M[i].find(hash[i][p/div[i]]));\n hash[i][p/div[i]] -= base_pow[p%div[i]]*S[p]%MOD;\n hash[i][p/div[i]] += base_pow[p%div[i]]*c%MOD;\n hash[i][p/div[i]] += MOD;\n hash[i][p/div[i]] %= MOD;\n M[i].insert(hash[i][p/div[i]]);\n }\n for(int i = 0; i < ds; i++) {\n if(*M[i].begin() == *M[i].rbegin()) {\n cout << div[i] << endl;\n break;\n }\n }\n S[p] = c;\n }\n}", "accuracy": 1, "time_ms": 2700, "memory_kb": 22876, "score_of_the_acc": -1.2022, "final_rank": 15 }, { "submission_id": "aoj_0414_8717344", "code_snippet": "#include <bits/stdc++.h>\n\nusing u64 = unsigned long long;\n\nconstexpr int N = 100005;\n// constexpr int M = 2;\n// constexpr std::array<u64, M> MOD = {998244353, 1000000007};\n// constexpr std::array<u64, M> BASE = {15029125, 7841253};\nconstexpr int M = 1;\nconstexpr std::array<u64, M> MOD = {998244353};\nconstexpr std::array<u64, M> BASE = {15029125};\nstd::array<std::array<u64, N>, M> base_table;\nstd::array<std::array<u64, N>, M> base_inv_table;\n\nvoid init() {\n for (int i = 0; i < M; i++) {\n base_table[i].fill(1);\n for (int j = 0; j + 1 < N; j++) {\n base_table[i][j + 1] = BASE[i] * base_table[i][j];\n base_table[i][j + 1] %= MOD[i];\n }\n }\n for (int j = 1; j < N; j++) {\n for (int i = 0; i < M; i++) {\n u64 base = base_table[i][j] - 1;\n u64 exp = MOD[i] - 2;\n u64 res = 1;\n while (exp > 0) {\n if (exp & 1) {\n res *= base;\n res %= MOD[i];\n }\n base *= base;\n base %= MOD[i];\n exp >>= 1;\n }\n base_inv_table[i][j] = res;\n }\n }\n}\n\nstruct Hash {\n Hash(): hash({0}), size(0) {}\n Hash(u64 c): hash({c}), size(1) {}\n std::array<u64, M> hash;\n int size;\n Hash repeat(int n) const {\n Hash res;\n res.size = n;\n for (int i = 0; i < M; i++) {\n res.hash[i] = hash[i] * (base_table[i][n] - 1) % MOD[i] * base_inv_table[i][size] % MOD[i];\n }\n return res;\n }\n};\n\nstd::ostream& operator<<(std::ostream& os, const Hash& hash) {\n os << '(' << hash.hash[0] << ',' << hash.hash[1] << ',' << hash.size << ')';\n return os;\n}\n\nbool operator==(const Hash& lhs, const Hash& rhs) {\n return lhs.hash == rhs.hash && lhs.size == rhs.size;\n}\n\nHash op(Hash lhs, const Hash& rhs) {\n for (int i = 0; i < M; i++) {\n lhs.hash[i] *= base_table[i][rhs.size];\n lhs.hash[i] += rhs.hash[i];\n lhs.hash[i] %= MOD[i];\n }\n lhs.size += rhs.size;\n return lhs;\n}\n\nstruct SegTree {\n std::vector<Hash> data;\n int size;\n SegTree(const std::string& s) {\n size = s.size();\n data.resize(2 * size);\n for (int i = 0; i < size; i++) {\n data[i + size] = Hash(s[i]);\n }\n for (int i = size - 1; i > 0; i--) {\n data[i] = op(data[2 * i], data[2 * i + 1]);\n }\n }\n void set(int pos, char c) {\n pos += size;\n data[pos] = Hash(c);\n for (pos >>= 1; pos > 0; pos >>= 1) {\n data[pos] = op(data[2 * pos], data[2 * pos + 1]);\n }\n }\n Hash prod(int left, int right) {\n Hash lhs;\n Hash rhs;\n for (left += size, right += size; left < right; left >>= 1, right >>= 1) {\n if (left & 1) lhs = op(lhs, data[left++]);\n if (right & 1) rhs = op(data[--right], rhs);\n }\n return op(lhs, rhs);\n }\n};\n\nstd::vector<int> divisor(int n) {\n std::vector<int> div;\n for (int i = 1; i * i <= n; i++) {\n if (n % i == 0) {\n div.push_back(i);\n if (i * i != n) {\n div.push_back(n / i);\n }\n }\n }\n std::sort(div.begin(), div.end());\n return div;\n}\n\nint main() {\n std::cin.tie(0)->sync_with_stdio(0);\n init();\n int n, q;\n std::cin >> n >> q;\n std::string s;\n std::cin >> s;\n auto divs = divisor(n);\n SegTree segtree(s);\n\n while (q--) {\n int pos;\n char c;\n std::cin >> pos >> c;\n pos--;\n segtree.set(pos, c);\n int ans = -1;\n for (auto div: divs) {\n auto lhs = segtree.prod(0, div).repeat(n);\n auto rhs = segtree.prod(0, n);\n if (lhs == rhs) {\n ans = div;\n break;\n }\n }\n assert(ans != -1);\n std::cout << ans << '\\n';\n }\n}", "accuracy": 1, "time_ms": 530, "memory_kb": 8060, "score_of_the_acc": -0.2386, "final_rank": 4 }, { "submission_id": "aoj_0414_8717189", "code_snippet": "#include <bits/stdc++.h>\n\nusing u64 = unsigned long long;\n\nconstexpr int N = 100005;\nconstexpr int M = 2;\nconstexpr std::array<u64, M> MOD = {998244353, 1000000007};\nconstexpr std::array<u64, M> BASE = {15029125, 7841253};\nstd::array<std::array<u64, N>, M> base_table;\n\nvoid init_table() {\n for (int i = 0; i < M; i++) {\n base_table[i].fill(1);\n for (int j = 0; j + 1 < N; j++) {\n base_table[i][j + 1] = BASE[i] * base_table[i][j];\n base_table[i][j + 1] %= MOD[i];\n }\n }\n}\n\nstruct Hash {\n Hash(): hash({0, 0}), size(0) {}\n Hash(u64 c): hash({c, c}), size(1) {}\n std::array<u64, M> hash;\n int size;\n\n u64 encode() {\n return hash[0] * MOD[1] + hash[1];\n }\n};\n\nstd::ostream& operator<<(std::ostream& os, const Hash& hash) {\n os << '(' << hash.hash[0] << ',' << hash.hash[1] << ',' << hash.size << ')';\n return os;\n}\n\nbool operator<(const Hash& lhs, const Hash& rhs) {\n if (lhs.hash == rhs.hash) return lhs.size < rhs.size;\n return lhs.hash < rhs.hash;\n}\n\nHash op(Hash lhs, const Hash& rhs) {\n for (int i = 0; i < M; i++) {\n lhs.hash[i] *= base_table[i][rhs.size];\n lhs.hash[i] += rhs.hash[i];\n lhs.hash[i] %= MOD[i];\n }\n lhs.size += rhs.size;\n return lhs;\n}\n\nstruct SegTree {\n std::vector<Hash> data;\n int size;\n SegTree(const std::string& s) {\n size = s.size();\n data.resize(2 * size);\n for (int i = 0; i < size; i++) {\n data[i + size] = Hash(s[i]);\n }\n for (int i = size - 1; i > 0; i--) {\n data[i] = op(data[2 * i], data[2 * i + 1]);\n }\n }\n void set(int pos, char c) {\n pos += size;\n data[pos] = Hash(c);\n for (pos >>= 1; pos > 0; pos >>= 1) {\n data[pos] = op(data[2 * pos], data[2 * pos + 1]);\n }\n }\n Hash prod(int left, int right) {\n Hash lhs;\n Hash rhs;\n for (left += size, right += size; left < right; left >>= 1, right >>= 1) {\n if (left & 1) lhs = op(lhs, data[left++]);\n if (right & 1) rhs = op(data[--right], rhs);\n }\n return op(lhs, rhs);\n }\n};\n\nstd::vector<int> divisor(int n) {\n std::vector<int> div;\n for (int i = 1; i * i <= n; i++) {\n if (n % i == 0) {\n div.push_back(i);\n if (i * i != n) {\n div.push_back(n / i);\n }\n }\n }\n std::sort(div.begin(), div.end());\n return div;\n}\n\nint main() {\n std::cin.tie(0)->sync_with_stdio(0);\n init_table();\n int n, q;\n std::cin >> n >> q;\n std::string s;\n std::cin >> s;\n auto divs = divisor(n);\n int m = divs.size();\n std::vector<std::unordered_map<u64, int>> hashs(m);\n SegTree segtree(s);\n\n for (int i = 0; i < m; i++) {\n int div = divs[i];\n assert(n % div == 0);\n for (int l = 0; l < n; l += div) {\n int r = l + div;\n hashs[i][segtree.prod(l, r).encode()]++;\n }\n }\n\n while (q--) {\n int pos;\n char c;\n std::cin >> pos >> c;\n pos--;\n for (int i = 0; i < m; i++) {\n int l = (pos / divs[i]) * divs[i];\n int r = l + divs[i];\n auto hash = segtree.prod(l, r).encode();\n assert(hashs[i][hash] > 0);\n hashs[i][hash]--;\n if (hashs[i][hash] == 0) {\n hashs[i].erase(hash);\n }\n }\n segtree.set(pos, c);\n for (int i = 0; i < m; i++) {\n int l = (pos / divs[i]) * divs[i];\n int r = l + divs[i];\n hashs[i][segtree.prod(l, r).encode()]++;\n }\n int ans = -1;\n for (int i = 0; i < m; i++) {\n if (hashs[i].size() == 1) {\n ans = divs[i];\n break;\n }\n }\n assert(ans != -1);\n std::cout << ans << '\\n';\n }\n}", "accuracy": 1, "time_ms": 1980, "memory_kb": 13352, "score_of_the_acc": -0.8273, "final_rank": 13 }, { "submission_id": "aoj_0414_7195199", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,a,b) for(int i=a;i<b;i++)\nusing ll = long long;\ntemplate<class T> bool chmin(T &a,const T b){if(a>b){a=b;return 1;}return 0;}\ntemplate<class T> bool chmax(T &a,const T b){if(a<b){a=b;return 1;}return 0;}\nconst int INF = (1<<30)-1;\n#define all(p) p.begin(),p.end()\n\nint main(){\n\tint N,Q;\n cin>>N>>Q;\n vector<int> div;\n rep(i,1,N+1) if(N%i==0) div.push_back(i);\n string S;\n cin>>S;\n int L=div.size();\n vector<int> p(L);\n auto f=[&](int ind,int val)->void{\n rep(i,0,L){\n if(div[i]<=ind&&S[ind]!=S[ind-div[i]]) p[i]+=val;\n if(div[i]+ind<N&&S[ind]!=S[ind+div[i]]) p[i]+=val;\n }\n };\n rep(i,0,L){\n rep(j,0,N-div[i]){\n if(S[j]!=S[j+div[i]]) p[i]++;\n }\n }\n rep(i,0,Q){\n int ind;\n char c;\n cin>>ind>>c;\n ind--;\n f(ind,-1);\n S[ind]=c;\n f(ind,1);\n rep(j,0,L){\n if(p[j]==0){\n cout<<div[j]<<\"\\n\";\n break;\n }\n }\n }\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 3568, "score_of_the_acc": -0.0399, "final_rank": 2 }, { "submission_id": "aoj_0414_6976897", "code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 0414.cc: Prayers of Iwashiro\n */\n\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\n\n/* typedef */\n\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<vvi> vvvi;\n\n/* global variables */\n\nchar s[MAX_N + 4];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, qn;\n scanf(\"%d%d%s\", &n, &qn, s);\n\n vi ds(1, 1);\n for (int p = 2; p * p <= n; p++)\n if (n % p == 0) {\n ds.push_back(p);\n int q = n / p;\n if (q != p) ds.push_back(q);\n }\n sort(ds.begin(), ds.end());\n int m = ds.size();\n //printf(\"m=%d\\n\", m);\n\n vvvi scs(m);\n vi fs(m);\n for (int i = 0; i < m; i++) {\n int d = ds[i], l = n / d;\n scs[i].assign(d, vi(26, 0));\n for (int j = 0; j < n; j++)\n if (++scs[i][j % d][s[j] - 'a'] == l) fs[i]++;\n }\n\n while (qn--) {\n int p;\n char t[4];\n scanf(\"%d%s\", &p, t), p--;\n\n for (int i = 0; i < m; i++) {\n int d = ds[i], l = n / d;\n if (scs[i][p % d][s[p] - 'a']-- == l) fs[i]--;\n }\n\n s[p] = t[0];\n\n for (int i = 0; i < m; i++) {\n int d = ds[i], l = n / d;\n if (++scs[i][p % d][s[p] - 'a'] == l) fs[i]++;\n }\n\n int mind = n;\n for (int i = 0; i < m; i++)\n if (fs[i] == ds[i]) { mind = ds[i]; break; }\n\n printf(\"%d\\n\", mind);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 37552, "score_of_the_acc": -0.4613, "final_rank": 7 } ]
aoj_0413_cpp
Tournament Record We had a tournament in which $N$ people participated. In the tournament, the participants play against each other one-on-one to decide who wins and who loses. The winner moves on to the next match, and the one who remains in the end is the winner. Since there is only one venue for the tournament, only one match can be played at a time. As the recorder, you recorded the winners and losers of each match until the tournament was over and the winner was determined. You recorded correctly, using a sheet of paper for each match, but some of the papers you recorded may be rearranged by ascident. Write a program to find out how many possible orders of the games are possible from the records of the games where the order may have been switched. Assume that the participants in the tournament are assigned numbers from 1 to $N$. Input The input is given in the following order. $N$ $a_1$ $b_1$ $a_2$ $b_2$ : $a_{N-1}$ $b_{N-1}$ The first line gives the number of contestants $N$ ($2 \leq N \leq 1000$). In the following $N-1$ lines, the records of the winners and losers of the match $a_i$, $b_i$ ($1 \leq a_i,b_i \leq N$) are given. $a_i$ represents the winner and $b_i$ represents the loser. Output Output the remainder of the number of possible orders of the matches divided by $10^6$ in a line. Sample Input and Output Sample Input 1 3 1 2 1 3 Sample Output 1 2 Sample Input 2 3 2 1 1 3 Sample Output 2 1
[ { "submission_id": "aoj_0413_10875577", "code_snippet": "#include <bits/stdc++.h>\nusing ll = long long;\nusing namespace std;\ntypedef long double ld;\nusing pii = pair<int,int>;\nusing dat = pair<ld,pair<int,int>>;\nusing pq = priority_queue<dat, vector<dat>, greater<dat>>;\nvector<pii> dir = {{0,1},{1,0},{-1,0},{0,-1}};\n\ntemplate<typename T> bool chmin(T &a, T b) { if (a > b){ a = b; return true; } else return false; }\n\nld dist(int a,int b,int c,int d){\n return sqrt(ld(c - a) * ld(c - a) + ld(d - b) * ld(d - b));\n}\n\nint main(){\n int n;\n cin >> n;\n vector<vector<int>> g(n);\n int winner = -1;\n vector<bool> cnt(n,true);\n for (int i = 0;i < n - 1;i++){\n int a,b;\n cin >> a >> b;\n a--,b--;\n g[a].push_back(b);\n g[b].push_back(a);\n cnt[b] = false;\n }\n for (int i = 0;i < n;i++){\n if (cnt[i])winner = i;\n }\n ll mod = 1000000;\n vector<vector<ll>> binomial(2001,vector<ll> (2001));\n for (int i = 0;i <= 2000;i++){\n binomial[i][0] = binomial[i][i] = 1;\n for (int j = 1;j < i;j++){\n binomial[i][j] = (binomial[i - 1][j - 1] + binomial[i - 1][j]) % mod;\n }\n }\n // for (int i = 1;i <= 10;i++){\n // for (int j = 1;j <= 10;j++){\n // cout << binomial[i][j] << ' ';\n // }cout << endl;\n // }\n\n auto dfs = [&](auto self,int now,int pre)->pair<ll,ll>{//部分木のサイズ、組合せの総数\n ll subtree_size = 0;\n ll kumi = 1;\n for (int i : g[now]){\n if (i == pre) continue;\n auto [x,y] = self(self,i,now);\n kumi *= binomial[x + subtree_size][x] * y % mod;\n kumi %= mod;\n subtree_size += x;\n }\n subtree_size += 1;\n return {subtree_size,kumi};\n };\n cout << dfs(dfs,winner,-1).second << endl;\n \n}", "accuracy": 1, "time_ms": 10, "memory_kb": 34504, "score_of_the_acc": -0.5693, "final_rank": 5 }, { "submission_id": "aoj_0413_10875576", "code_snippet": "#include <bits/stdc++.h>\nusing ll = long long;\nusing namespace std;\ntypedef long double ld;\nusing pii = pair<int,int>;\nusing dat = pair<ld,pair<int,int>>;\nusing pq = priority_queue<dat, vector<dat>, greater<dat>>;\nvector<pii> dir = {{0,1},{1,0},{-1,0},{0,-1}};\n\ntemplate<typename T> bool chmin(T &a, T b) { if (a > b){ a = b; return true; } else return false; }\n\nld dist(int a,int b,int c,int d){\n return sqrt(ld(c - a) * ld(c - a) + ld(d - b) * ld(d - b));\n}\n\nint main(){\n int n;\n cin >> n;\n vector<vector<int>> g(n);\n int winner = -1;\n vector<bool> cnt(n,true);\n for (int i = 0;i < n - 1;i++){\n int a,b;\n cin >> a >> b;\n a--,b--;\n g[a].push_back(b);\n cnt[b] = false;\n }\n for (int i = 0;i < n;i++){\n if (cnt[i])winner = i;\n }\n ll mod = 1000000;\n vector<vector<ll>> binomial(2001,vector<ll> (2001));\n for (int i = 0;i <= 2000;i++){\n binomial[i][0] = binomial[i][i] = 1;\n for (int j = 1;j < i;j++){\n binomial[i][j] = (binomial[i - 1][j - 1] + binomial[i - 1][j]) % mod;\n }\n }\n // for (int i = 1;i <= 10;i++){\n // for (int j = 1;j <= 10;j++){\n // cout << binomial[i][j] << ' ';\n // }cout << endl;\n // }\n\n auto dfs = [&](auto self,int now,int pre)->pair<ll,ll>{//部分木のサイズ、組合せの総数\n ll subtree_size = 0;\n ll kumi = 1;\n for (int i : g[now]){\n auto [x,y] = self(self,i,now);\n kumi *= binomial[x + subtree_size][x] * y % mod;\n kumi %= mod;\n subtree_size += x;\n }\n subtree_size += 1;\n return {subtree_size,kumi};\n };\n cout << dfs(dfs,winner,-1).second << endl;\n \n}", "accuracy": 1, "time_ms": 10, "memory_kb": 34484, "score_of_the_acc": -0.569, "final_rank": 4 }, { "submission_id": "aoj_0413_10875574", "code_snippet": "#include <bits/stdc++.h>\nusing ll = long long;\nusing namespace std;\ntypedef long double ld;\nusing pii = pair<int,int>;\nusing dat = pair<ld,pair<int,int>>;\nusing pq = priority_queue<dat, vector<dat>, greater<dat>>;\nvector<pii> dir = {{0,1},{1,0},{-1,0},{0,-1}};\n\ntemplate<typename T> bool chmin(T &a, T b) { if (a > b){ a = b; return true; } else return false; }\n\nld dist(int a,int b,int c,int d){\n return sqrt(ld(c - a) * ld(c - a) + ld(d - b) * ld(d - b));\n}\n\nint main(){\n int n;\n cin >> n;\n vector<vector<int>> g(n);\n int winner = -1;\n vector<bool> cnt(n,true);\n for (int i = 0;i < n - 1;i++){\n int a,b;\n cin >> a >> b;\n a--,b--;\n g[a].push_back(b);\n cnt[b] = false;\n }\n for (int i = 0;i < n;i++){\n if (cnt[i])winner = i;\n }\n ll mod = 1000000;\n vector<vector<ll>> binomial(2001,vector<ll> (2001));\n for (int i = 0;i <= 2000;i++){\n binomial[i][0] = binomial[i][i] = 1;\n for (int j = 1;j < i;j++){\n binomial[i][j] = (binomial[i - 1][j - 1] + binomial[i - 1][j]) % mod;\n }\n }\n // for (int i = 1;i <= 10;i++){\n // for (int j = 1;j <= 10;j++){\n // cout << binomial[i][j] << ' ';\n // }cout << endl;\n // }\n\n auto dfs = [&](auto self,int now,int pre)->pair<ll,ll>{//部分木のサイズ、組合せの総数\n if (g[now].size() == 1){\n return {1,1};\n }\n ll subtree_size = 0;\n ll kumi = 1;\n for (int i : g[now]){\n auto [x,y] = self(self,i,now);\n kumi *= binomial[x + subtree_size][x] * y % mod;\n kumi %= mod;\n subtree_size += x;\n }\n subtree_size += 1;\n return {subtree_size,kumi};\n };\n cout << dfs(dfs,winner,-1).second << endl;\n \n}", "accuracy": 0.12, "time_ms": 10, "memory_kb": 34512, "score_of_the_acc": -0.5695, "final_rank": 18 }, { "submission_id": "aoj_0413_10875569", "code_snippet": "#include <bits/stdc++.h>\nusing ll = long long;\nusing namespace std;\ntypedef long double ld;\nusing pii = pair<int,int>;\nusing dat = pair<ld,pair<int,int>>;\nusing pq = priority_queue<dat, vector<dat>, greater<dat>>;\nvector<pii> dir = {{0,1},{1,0},{-1,0},{0,-1}};\n\ntemplate<typename T> bool chmin(T &a, T b) { if (a > b){ a = b; return true; } else return false; }\n\nld dist(int a,int b,int c,int d){\n return sqrt(ld(c - a) * ld(c - a) + ld(d - b) * ld(d - b));\n}\n\nint main(){\n int n;\n cin >> n;\n vector<vector<int>> g(n);\n int winner = -1;\n vector<bool> cnt(n,true);\n for (int i = 0;i < n - 1;i++){\n int a,b;\n cin >> a >> b;\n a--,b--;\n g[a].push_back(b);\n g[b].push_back(a);\n cnt[b] = false;\n }\n for (int i = 0;i < n;i++){\n if (cnt[i])winner = i;\n }\n ll mod = 1000000;\n vector<vector<ll>> binomial(2001,vector<ll> (2001));\n for (int i = 0;i <= 2000;i++){\n binomial[i][0] = binomial[i][i] = 1;\n for (int j = 1;j < i;j++){\n binomial[i][j] = (binomial[i - 1][j - 1] + binomial[i - 1][j]) % mod;\n }\n }\n // for (int i = 1;i <= 10;i++){\n // for (int j = 1;j <= 10;j++){\n // cout << binomial[i][j] << ' ';\n // }cout << endl;\n // }\n vector<int> dp(n,1),sub(n,1);\n auto dfs = [&](auto self,int now,int pre)->pair<ll,ll>{//部分木のサイズ、組合せの総数\n if (g[now].size() == 1){\n return {1,1};\n }\n int sum = 0;\n for (int i : g[now]){\n if (i == pre) continue;\n auto [x,y] = self(self,i,now);\n sum += x;\n dp[now] *= binomial[sum][x] * y % mod;\n dp[now] %= mod;\n }\n return {sum + 1,dp[now]};\n };\n cout << dfs(dfs,winner,-1).second << endl;\n \n}", "accuracy": 0.44, "time_ms": 10, "memory_kb": 34484, "score_of_the_acc": -0.569, "final_rank": 11 }, { "submission_id": "aoj_0413_10875554", "code_snippet": "#include <bits/stdc++.h>\nusing ll = long long;\nusing namespace std;\ntypedef long double ld;\nusing pii = pair<int,int>;\nusing dat = pair<ld,pair<int,int>>;\nusing pq = priority_queue<dat, vector<dat>, greater<dat>>;\nvector<pii> dir = {{0,1},{1,0},{-1,0},{0,-1}};\n\ntemplate<typename T> bool chmin(T &a, T b) { if (a > b){ a = b; return true; } else return false; }\n\nld dist(int a,int b,int c,int d){\n return sqrt(ld(c - a) * ld(c - a) + ld(d - b) * ld(d - b));\n}\n\nint main(){\n int n;\n cin >> n;\n vector<vector<int>> g(n);\n int winner = -1;\n vector<bool> cnt(n,true);\n for (int i = 0;i < n - 1;i++){\n int a,b;\n cin >> a >> b;\n a--,b--;\n g[a].push_back(b);\n g[b].push_back(a);\n cnt[b] = false;\n }\n for (int i = 0;i < n;i++){\n if (cnt[i])winner = i;\n }\n ll mod = 1000000;\n vector<vector<ll>> binomial(2001,vector<ll> (2001));\n for (int i = 0;i <= 2000;i++){\n binomial[i][0] = binomial[i][i] = 1;\n for (int j = 1;j < i;j++){\n binomial[i][j] = (binomial[i - 1][j - 1] + binomial[i - 1][j]) % mod;\n }\n }\n // for (int i = 1;i <= 10;i++){\n // for (int j = 1;j <= 10;j++){\n // cout << binomial[i][j] << ' ';\n // }cout << endl;\n // }\n\n auto dfs = [&](auto self,int now,int pre)->pair<ll,ll>{//部分木のサイズ、組合せの総数\n if (g[now].size() == 1){\n return {1,1};\n }\n ll subtree_size = 0;\n ll kumi = 1;\n for (int i : g[now]){\n if (i == pre) continue;\n auto [x,y] = self(self,i,now);\n kumi *= binomial[x + subtree_size][x] * y % mod;\n kumi %= mod;\n subtree_size += x;\n }\n subtree_size += 1;\n return {subtree_size,kumi};\n };\n cout << dfs(dfs,winner,-1).second << endl;\n \n}", "accuracy": 0.44, "time_ms": 10, "memory_kb": 34508, "score_of_the_acc": -0.5694, "final_rank": 12 }, { "submission_id": "aoj_0413_10875546", "code_snippet": "#include <bits/stdc++.h>\nusing ll = long long;\nusing namespace std;\ntypedef long double ld;\nusing pii = pair<int,int>;\nusing dat = pair<ld,pair<int,int>>;\nusing pq = priority_queue<dat, vector<dat>, greater<dat>>;\nvector<pii> dir = {{0,1},{1,0},{-1,0},{0,-1}};\n\ntemplate<typename T> bool chmin(T &a, T b) { if (a > b){ a = b; return true; } else return false; }\n\nld dist(int a,int b,int c,int d){\n return sqrt(ld(c - a) * ld(c - a) + ld(d - b) * ld(d - b));\n}\n\nint main(){\n int n;\n cin >> n;\n vector<vector<int>> g(n);\n int winner = -1;\n vector<bool> cnt(n,true);\n for (int i = 0;i < n - 1;i++){\n int a,b;\n cin >> a >> b;\n a--,b--;\n g[a].push_back(b);\n cnt[b] = false;\n }\n for (int i = 0;i < n;i++){\n if (cnt[i])winner = i;\n }\n ll mod = 1000000;\n vector<vector<ll>> binomial(2001,vector<ll> (2001));\n for (int i = 1;i <= 2000;i++){\n binomial[i][0] = binomial[i][i] = 1;\n for (int j = 1;j < i;j++){\n binomial[i][j] = (binomial[i - 1][j - 1] + binomial[i - 1][j]) % mod;\n }\n }\n // for (int i = 1;i <= 10;i++){\n // for (int j = 1;j <= 10;j++){\n // cout << binomial[i][j] << ' ';\n // }cout << endl;\n // }\n\n auto dfs = [&](auto self,int now,int pre)->pair<ll,ll>{//部分木のサイズ、組合せの総数\n if (g[now].size() == 1){\n return {1,1};\n }\n ll subtree_size = 0;\n ll kumi = 1;\n for (int i : g[now]){\n auto [x,y] = self(self,i,now);\n kumi *= binomial[x + subtree_size][x] * y % mod;\n kumi %= mod;\n subtree_size += x;\n }\n subtree_size += 1;\n return {subtree_size,kumi};\n };\n cout << dfs(dfs,winner,-1).second << endl;\n \n}", "accuracy": 0.12, "time_ms": 20, "memory_kb": 34484, "score_of_the_acc": -0.6801, "final_rank": 19 }, { "submission_id": "aoj_0413_10875541", "code_snippet": "#include <bits/stdc++.h>\nusing ll = long long;\nusing namespace std;\ntypedef long double ld;\nusing pii = pair<int,int>;\nusing dat = pair<ld,pair<int,int>>;\nusing pq = priority_queue<dat, vector<dat>, greater<dat>>;\nvector<pii> dir = {{0,1},{1,0},{-1,0},{0,-1}};\n\ntemplate<typename T> bool chmin(T &a, T b) { if (a > b){ a = b; return true; } else return false; }\n\nld dist(int a,int b,int c,int d){\n return sqrt(ld(c - a) * ld(c - a) + ld(d - b) * ld(d - b));\n}\n\nint main(){\n int n;\n cin >> n;\n vector<vector<int>> g(n);\n int winner = -1;\n vector<bool> cnt(n,true);\n for (int i = 0;i < n - 1;i++){\n int a,b;\n cin >> a >> b;\n a--,b--;\n g[a].push_back(b);\n g[b].push_back(a);\n cnt[b] = false;\n }\n for (int i = 0;i < n;i++){\n if (cnt[i])winner = i;\n }\n ll mod = 1000000;\n vector<vector<ll>> binomial(2001,vector<ll> (2001));\n for (int i = 1;i <= 2000;i++){\n binomial[i][0] = binomial[i][i] = 1;\n for (int j = 1;j < i;j++){\n binomial[i][j] = (binomial[i - 1][j - 1] + binomial[i - 1][j]) % mod;\n }\n }\n // for (int i = 1;i <= 10;i++){\n // for (int j = 1;j <= 10;j++){\n // cout << binomial[i][j] << ' ';\n // }cout << endl;\n // }\n\n auto dfs = [&](auto self,int now,int pre)->pair<ll,ll>{//部分木のサイズ、組合せの総数\n if (g[now].size() == 1){\n return {1,1};\n }\n ll subtree_size = 0;\n ll kumi = 1;\n for (int i : g[now]){\n if (i == pre) continue;\n auto [x,y] = self(self,i,now);\n kumi *= binomial[x + subtree_size][x] * y % mod;\n kumi %= mod;\n subtree_size += x;\n }\n subtree_size += 1;\n return {subtree_size,kumi};\n };\n cout << dfs(dfs,winner,-1).second << endl;\n \n}", "accuracy": 0.44, "time_ms": 20, "memory_kb": 34480, "score_of_the_acc": -0.68, "final_rank": 14 }, { "submission_id": "aoj_0413_10875517", "code_snippet": "#include <bits/stdc++.h>\nusing ll = long long;\nusing namespace std;\ntypedef long double ld;\nusing pii = pair<int,int>;\nusing dat = pair<ld,pair<int,int>>;\nusing pq = priority_queue<dat, vector<dat>, greater<dat>>;\nvector<pii> dir = {{0,1},{1,0},{-1,0},{0,-1}};\n\ntemplate<typename T> bool chmin(T &a, T b) { if (a > b){ a = b; return true; } else return false; }\n\nld dist(int a,int b,int c,int d){\n return sqrt(ld(c - a) * ld(c - a) + ld(d - b) * ld(d - b));\n}\n\nint main(){\n int n;\n cin >> n;\n vector<vector<int>> g(n);\n int winner = -1;\n vector<bool> cnt(n,true);\n for (int i = 0;i < n - 1;i++){\n int a,b;\n cin >> a >> b;\n a--,b--;\n g[a].push_back(b);\n g[b].push_back(a);\n cnt[b] = false;\n }\n for (int i = 0;i < n;i++){\n if (cnt[i])winner = i;\n }\n ll mod = 1000000;\n vector<vector<ll>> binomial(2001,vector<ll> (2001));\n for (int i = 1;i <= 2000;i++){\n binomial[i][0] = binomial[i][i] = 1;\n for (int j = 1;j < i;j++){\n binomial[i][j] = (binomial[i - 1][j - 1] + binomial[i - 1][j]) % mod;\n }\n }\n // for (int i = 1;i <= 10;i++){\n // for (int j = 1;j <= 10;j++){\n // cout << binomial[i][j] << ' ';\n // }cout << endl;\n // }\n\n auto dfs = [&](auto self,int now,int pre)->pair<ll,ll>{//部分木のサイズ、組合せの総数\n if (g[now].size() == 1){\n return {1,1};\n }\n ll subtree_size = 0;\n ll kumi = 1;\n for (int i : g[now]){\n if (i == pre) continue;\n auto [x,y] = self(self,i,now);\n kumi = kumi * binomial[x + subtree_size][x] % mod * y % mod;\n subtree_size += x;\n }\n subtree_size += 1;\n return {subtree_size,kumi};\n };\n cout << dfs(dfs,winner,-1).second << endl;\n \n}", "accuracy": 0.44, "time_ms": 10, "memory_kb": 34512, "score_of_the_acc": -0.5695, "final_rank": 13 }, { "submission_id": "aoj_0413_9021640", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconst long long MOD = 1000000;\nmap<pair<int, int>, long long> memo;\nlong long binom(int n, int r) {\n if(r < 0 || r > n) return 0;\n if(r == 0 || r == n) return 1;\n if(!memo.count(make_pair(n, r))) {\n memo[make_pair(n, r)] = (binom(n-1, r-1)+binom(n-1, r))%MOD;\n }\n return memo[make_pair(n, r)];\n}\n\nint main() {\n int N;\n cin >> N;\n vector<int> parent(N, -1);\n vector<vector<int>> child(N);\n for(int i = 0; i < N-1; i++) {\n int a, b;\n cin >> a >> b;\n a--, b--;\n parent[b] = a;\n child[a].push_back(b);\n }\n vector<long long> sz(N, 1), dp(N, 1);\n auto dfs = [&](auto dfs, int cur) -> void {\n for(const int &nxt : child[cur]) {\n dfs(dfs, nxt);\n dp[cur] *= dp[nxt]*binom(sz[cur]+sz[nxt]-1, sz[nxt])%MOD;\n dp[cur] %= MOD;\n sz[cur] += sz[nxt];\n }\n };\n for(int i = 0; i < N; i++) {\n if(parent[i] == -1) {\n dfs(dfs, i);\n cout << dp[i] << endl;\n break;\n }\n }\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 17788, "score_of_the_acc": -1.2627, "final_rank": 7 }, { "submission_id": "aoj_0413_6952378", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\n#define endl \"\\n\"\ntypedef pair<int, int> Pii;\n#define REP(i, n) for (int i = 0; i < (n); ++i)\n#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))\n#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)\n#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define ALL(x) begin(x), end(x)\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\n#define fore(i,a) for(auto &i:a)\n#define all(s) (s).begin(),(s).end()\n#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)\n#define drep(i, n) drep2(i, n, 0)\n#define rever(vec) reverse(vec.begin(), vec.end())\n#define sor(vec) sort(vec.begin(), vec.end())\n#define fi first\n#define se second\n#define pb push_back\n#define P pair<ll,ll>\n#define PQminll priority_queue<ll, vector<ll>, greater<ll>>\n#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>\n#define PQminP priority_queue<P, vector<P>, greater<P>>\n#define PQmaxP priority_queue<P,vector<P>,less<P>>\n#define NP next_permutation\n//const ll mod = 1000000009;\nconst ll mod = 998244353;\n//const ll mod = 1000000007;\nconst ll inf = 4100000000000000000ll;\nconst ld eps = ld(0.00000000001);\nstatic const long double pi = 3.141592653589793;\ntemplate<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}\ntemplate<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}\ntemplate<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<\" \";}cout<<endl;}\ntemplate<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}\ntemplate<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<\" \";}cout<<endl;}cout<<endl;}\nvoid yes(bool a){cout<<(a?\"yes\":\"no\")<<endl;}\nvoid YES(bool a){cout<<(a?\"YES\":\"NO\")<<endl;}\nvoid Yes(bool a){cout<<(a?\"Yes\":\"No\")<<endl;}\nvoid possible(bool a){ cout<<(a?\"possible\":\"impossible\")<<endl; }\nvoid Possible(bool a){ cout<<(a?\"Possible\":\"Impossible\")<<endl; }\nvoid POSSIBLE(bool a){ cout<<(a?\"POSSIBLE\":\"IMPOSSIBLE\")<<endl; }\ntemplate<class T>auto min(const T& a){ return *min_element(all(a)); }\ntemplate<class T>auto max(const T& a){ return *max_element(all(a)); }\ntemplate<class T,class F>void print(pair<T,F> a){cout<<a.fi<<\" \"<<a.se<<endl;}\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;}\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;}\ntemplate<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}\ntemplate<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}\nll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}\nll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }\nvector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }\nll pop(ll x){return __builtin_popcountll(x);}\nll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}\nP hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;}\nP Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});}\nP Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});}\nP Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});}\nP Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});}\nP Pgyaku(P a){ return hyou({a.se,a.fi});}\ntemplate<class T>\nstruct Sum{\n vector<T> data;\n Sum(const vector<T>& v):data(v.size()+1){\n for(ll i=0;i<v.size();i++) data[i+1]=data[i]+v[i];\n }\n T get(ll l,ll r) const {\n return data[r]-data[l];\n }\n};\ntemplate<class T>\nstruct Sum2{\n vector<vector<T>> data;\n Sum2(const vector<vector<T>> &v):data(v.size()+1,vector<T>(v[0].size()+1)){\n for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]=data[i][j+1]+v[i][j];\n for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]+=data[i+1][j];\n }\n T get(ll x1,ll y1,ll x2,ll y2) const {\n return data[x2][y2]+data[x1][y1]-data[x1][y2]-data[x2][y1];\n }\n};\n\nvoid cincout(){\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n cout<< fixed << setprecision(15);\n}\nvector<pair<int,int>> g[1000];\nint ng[1000];\nvector<int> now,edge;\nvoid dfs(ll v){\n for(auto e:g[v]){\n if(ng[e.fi]) continue;\n edge.pb(e.se);\n now.pb(e.fi);\n dfs(e.fi);\n }\n}\nvector<P> prime[1001];\nll solve(ll n,vector<int> a,vector<int> b){\n if(n<=2) return 1;\n vector<int> f;\n for(auto e:a) f.pb(e);\n for(auto e:b) f.pb(e);\n map<int,int> m;\n for(auto e:f) m[e]++;\n int N=0;\n for(auto &e:m){\n e.se=N;\n N++;\n }\n for(int i=0;i<n-1;i++) a[i]=m[a[i]];\n for(int i=0;i<n-1;i++) b[i]=m[b[i]];\n for(int i=0;i<n;i++) g[i].clear();\n for(int i=0;i<n;i++) ng[i]=0;\n for(int i=0;i<n-1;i++) g[a[i]].pb({b[i],i});\n vector<ll> d(n);\n for(auto e:b) d[e]++;\n ll win=0;\n for(int i=0;i<n;i++) if(d[i]==0) win=i;\n ll ans=1;\n ll cnt=0;\n for(int i=0;i<n-1;i++) if(a[i]==win) cnt++;\n vector<int> A(n+1);\n for(int i=1;i<=n-1;i++){\n for(auto e:prime[i]){\n A[e.fi]+=e.se;\n }\n }\n vector<int> p;\n for(int i=0;i<n-1;i++) if(a[i]==win) p.pb(b[i]);\n for(auto e:p) ng[e]=1;\n vector<pair<vector<int>,vector<int>>> CD;\n for(int i=0;i<p.size();i++){\n now={};\n edge={};\n now.pb(p[i]);\n dfs(p[i]);\n vector<int> c,d;\n for(auto e:edge){\n c.pb(a[e]);\n d.pb(b[e]);\n }\n CD.pb({c,d});\n for(int j=1;j<=c.size()+1;j++){\n for(auto e:prime[j]){\n A[e.fi]-=e.se;\n }\n }\n }\n for(auto e:CD) (ans*=solve(e.fi.size()+1,e.fi,e.se))%=1000000;\n for(int i=1;i<=n;i++) (ans*=modPow(i,A[i],1000000))%=1000000;\n return ans;\n}\nint main() {\n cincout();\n ll n;\n cin>>n;\n vector<int> a(n-1),b(n-1);\n for(int i=0;i<n-1;i++){\n cin>>a[i]>>b[i];\n a[i]--;\n b[i]--;\n }\n vector<int> p(1001,1000000);\n for(int i=2;i<=1000;i++){\n for(int j=i;j<=1000;j+=i) p[j]=min(p[j],i);\n }\n for(int i=1;i<=1000;i++){\n int x=i;\n map<int,int> m;\n while(x>1){\n m[p[x]]++;\n x/=p[x];\n }\n for(auto e:m) prime[i].pb(e);\n }\n cout<<solve(n,a,b)<<endl;\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 50296, "score_of_the_acc": -1.7479, "final_rank": 9 }, { "submission_id": "aoj_0413_6911258", "code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <tuple>\n#include <cstdint>\n#include <cstdio>\n#include <map>\n#include <cstdint>\n#include <queue>\n#include <set>\n#include <stack>\n#include <deque>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <cctype>\n#include <functional>\n#include <ctime>\n#include <fstream>\n#include <cmath>\n#include <limits>\n#include <chrono>\n#include <numeric>\n#include <type_traits>\n#include <iomanip>\n#include <float.h>\n#include <math.h>\n#include <cassert>\n#include <random>\nusing namespace std;\nusing ll = long long;\n\nll ll_gcd(ll a, ll b) {\n\tif (a < b) return ll_gcd(b, a);\n\tll r;\n\twhile ((r = a % b)) {\n\t\ta = b;\n\t\tb = r;\n\t}\n\treturn b;\n}\n\nint dfs(vector<vector<int>>& z, vector<ll>& ans, int n,int now) {\n\tint a = 1;\n\tfor (int i = 0; i < z[now].size(); i++) {\n\t\ta += dfs(z, ans, n, z[now][i]);\n\t}\n\tint b = a;\n\tfor (int i = 0; i < n; i++) {\n\t\tint h = ll_gcd(ans[i], b);\n\t\tans[i] /= h;\n\t\tb /= h;\n\t}\n\treturn a;\n}\n\nint main(){\n\tll n;\n\tcin >> n;\n\tvector<vector<int>> z(n);\n\tset<int> s;\n\tfor (int i = 0; i < n; i++) {\n\t\ts.insert(i);\n\t}\n\tfor (int i = 0; i < n-1; i++) {\n\t\tint a, b;\n\t\tcin >> a >> b;\n\t\ta--;\n\t\tb--;\n\t\tz[a].push_back(b);\n\t\ts.erase(b);\n\t}\n\tint a = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tif (s.count(i))a = i;\n\t}\n\tvector<ll> ans(n);\n\tfor (int i = 0; i < n; i++) {\n\t\tans[i] = i + 1;\n\t}\n\tdfs(z, ans, n, a);\n\tll ansa = 1;\n\tfor (int i = 0; i < n; i++) {\n\t\tansa *= ans[i];\n\t\tansa %= 1000000;\n\t}\n\tcout << ansa << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3464, "score_of_the_acc": 0, "final_rank": 1 }, { "submission_id": "aoj_0413_5853731", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for(long long i=0;i<(long long)(n);i++)\n#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)\n#define pb emplace_back\n#define lb(v,k) (lower_bound(all(v),(k))-v.begin())\n#define ub(v,k) (upper_bound(all(v),(k))-v.begin())\n#define fi first\n#define se second\n#define pi M_PI\n#define PQ(T) priority_queue<T>\n#define SPQ(T) priority_queue<T,vector<T>,greater<T>>\n#define dame(a) {out(a);return 0;}\n#define decimal cout<<fixed<<setprecision(15);\n#define all(a) a.begin(),a.end()\n#define rsort(a) {sort(all(a));reverse(all(a));}\n#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}\n#define popcnt __builtin_popcountll\ntypedef long long ll;\ntypedef pair<ll,ll> P;\ntypedef tuple<ll,ll,ll> PP;\ntypedef tuple<ll,ll,ll,ll> PPP;\nusing vi=vector<ll>;\nusing vvi=vector<vi>;\nusing vvvi=vector<vvi>;\nusing vvvvi=vector<vvvi>;\nusing vp=vector<P>;\nusing vvp=vector<vp>;\nusing vb=vector<bool>;\nusing vvb=vector<vb>;\nconst ll inf=1001001001001001001;\nconst ll INF=1001001001;\nconst ll mod=998244353;\nconst double eps=1e-10;\ntemplate<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}\ntemplate<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}\ntemplate<class T> void out(T a){cout<<a<<'\\n';}\ntemplate<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\\n';}\ntemplate<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\\n';}\ntemplate<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}\ntemplate<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\\n';}\ntemplate<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}\ntemplate<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}\ntemplate<class T> void yesno(T b){if(b)out(\"yes\");else out(\"no\");}\ntemplate<class T> void YesNo(T b){if(b)out(\"Yes\");else out(\"No\");}\ntemplate<class T> void YESNO(T b){if(b)out(\"YES\");else out(\"NO\");}\ntemplate<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\\n';}\nvoid outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}\nll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}\nll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}\n\nint main(){\n ll m=1000000;\n ll n;cin>>n;\n vvi g(n);\n vb ok(n,true);\n rep(i,n-1){\n ll a,b;cin>>a>>b;a--;b--;\n g[a].pb(b);ok[b]=false;\n }\n ll ne=0;while(!ok[ne])ne++;\n vi dp(n,1),sub(n,1);\n vvi table(n+1,vi(n+1));table[0][0]=1;\n rep(i,n+1)rep(j,n+1){\n table[i][j]%=m;\n if(i!=n&&j!=n)table[i+1][j+1]+=table[i][j];\n if(i!=n)table[i+1][j]+=table[i][j];\n }\n function<void(ll,ll)> dfs=[&](ll i,ll p){\n vi al;\n for(ll x:g[i])if(x!=p){\n dfs(x,i);\n sub[i]+=sub[x];\n dp[i]=dp[i]*dp[x]%m;\n al.pb(sub[x]);\n }\n ll cur=sub[i]-1;\n for(ll x:al){\n dp[i]=dp[i]*table[cur][x]%m;\n cur-=x;\n }\n };dfs(ne,-1);\n out(dp[ne]);\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 11112, "score_of_the_acc": -0.1403, "final_rank": 2 }, { "submission_id": "aoj_0413_4829139", "code_snippet": "#include <iostream>\n#include <vector>\n\nusing namespace std;\ntypedef long long ll;\n\nconst ll MOD = 1e6;\nvector<vector<int>> graph;\n\nvector<vector<ll>> nCr(2010, vector<ll>(2010));\nvoid init() {\n for (int i = 0; i < 2010; i++) {\n for (int j = 0; j < 2010; j++) {\n if (i < j)nCr[i][j] = 0;\n else if (j == 0) nCr[i][j] = 1;\n else nCr[i][j] = (nCr[i - 1][j - 1] + nCr[i - 1][j]) % MOD;\n }\n }\n}\n\npair<ll, int> dfs(int prev, int here) {\n ll ret = 1, size = 0;\n for (auto &next:graph[here]) {\n if (next == prev)continue;\n auto result = dfs(here, next);\n ret *= result.first, ret %= MOD;\n ret *= nCr[size + result.second][size], ret %= MOD;\n size += result.second;\n }\n return {ret % MOD, size + 1};\n}\n\nint main() {\n init();\n\n int n;\n cin >> n;\n\n graph.resize(n);\n vector<bool> winner(n, true);\n for (int i = 0; i < n - 1; i++) {\n int a, b;\n cin >> a >> b, a--, b--;\n graph[a].push_back(b);\n winner[b] = false;\n }\n\n int top = -1;\n for (int i = 0; i < n; i++) {\n if (winner[i])top = i;\n }\n\n auto ret = dfs(-1, top);\n cout << ret.first << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 34416, "score_of_the_acc": -0.5677, "final_rank": 3 }, { "submission_id": "aoj_0413_4828817", "code_snippet": "#include <iostream>\n#include <vector>\n\nusing namespace std;\ntypedef long long ll;\n\nconst ll MOD = 1e6;\nvector<vector<int>> graph;\n\nvector<vector<ll>> nCr(2010, vector<ll>(2010));\nvoid init() {\n for (int i = 0; i < 2010; i++) {\n for (int j = 0; j < 2010; j++) {\n if (i < j)nCr[i][j] = 0;\n else if (j == 0) nCr[i][j] = 1;\n else nCr[i][j] = (nCr[i - 1][j - 1] + nCr[i - 1][j]) % MOD;\n }\n }\n}\n\npair<ll, int> dfs(int prev, int here) {\n int ret = 1, size = 0;\n for (auto &next:graph[here]) {\n if (next == prev)continue;\n auto result = dfs(here, next);\n ret *= result.first, ret %= MOD;\n ret *= nCr[size + result.second][size], ret %= MOD;\n size += result.second;\n }\n return {ret % MOD, size + 1};\n}\n\nint main() {\n init();\n\n int n;\n cin >> n;\n\n graph.resize(n);\n vector<bool> winner(n, true);\n for (int i = 0; i < n - 1; i++) {\n int a, b;\n cin >> a >> b, a--, b--;\n graph[a].push_back(b);\n winner[b] = false;\n }\n\n int top = -1;\n for (int i = 0; i < n; i++) {\n if (winner[i])top = i;\n }\n\n auto ret = dfs(-1, top);\n cout << ret.first << endl;\n return 0;\n}", "accuracy": 0.76, "time_ms": 10, "memory_kb": 34396, "score_of_the_acc": -0.5674, "final_rank": 10 }, { "submission_id": "aoj_0413_4599543", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n \n#define REP(i, n) for (ll i = 0; i < n; i++)\n#define REPR(i, n) for (ll i = n; i >= 0; i--)\n#define FOR(i, m, n) for (ll i = m; i < n; i++)\n#define FORR(i, m, n) for (ll i = m; i >= n; i--)\n#define REPO(i, n) for (ll i = 1; i <= n; i++)\n#define ll long long\n#define INF (ll)1 << 60\n#define MINF (-1 * INF)\n#define ALL(n) n.begin(), n.end()\n#define MOD 1000000007\n#define P pair<ll, ll>\n\n\n\nll n, dp[110000], sz[110000], mod = 1e6;\nvector<ll> in(110000);\nvector<ll> g[110000];\nll com[2100][2100];\n\nvoid cominit(){\n \n REP(i, 2010){\n com[i][0] = 1;\n REPO(j, i){\n com[i][j] = com[i - 1][j - 1] + com[i - 1][j];\n com[i][j] %= mod;\n }\n }\n}\nvoid dfs(ll v, ll p){\n ll now = 1;\n vector<ll> l;\n REP(i, g[v].size()){\n ll w = g[v][i];\n if(w == p)continue;\n dfs(w, v);\n now *= dp[w];\n now %= mod;\n sz[v] += sz[w];\n l.push_back(sz[w]);\n }\n ll t = sz[v];\n REP(i, l.size()){\n now *= com[t][l[i]];\n now %= mod;\n t -= l[i];\n }\n sz[v] += 1;\n dp[v] = now;\n}\n\nint main() {\n cominit();\n cin >> n;\n REP(i, n - 1){\n ll a, b;\n cin >>a >> b;\n a--;\n b--;\n g[a].push_back(b);\n in[b]++;\n }\n REP(i, n){\n if(in[i] == 0){\n dfs(i, -1);\n cout << dp[i] << endl;\n return 0;\n }\n }\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 29340, "score_of_the_acc": -0.5857, "final_rank": 6 }, { "submission_id": "aoj_0413_4461798", "code_snippet": "#include \"bits/stdc++.h\"\n#define int long long\n#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define ALL(obj) begin(obj), end(obj)\n#define MAX(x) *max_element(ALL(x))\n#define MIN(x) *min_element(ALL(x))\n#define LOWER_BOUND(A, key) distance(A.begin(), lower_bound(ALL(A), key))\n#define UPPER_BOUND(A, key) distance(A.begin(), upper_bound(ALL(A), key))\n\nusing namespace std;\nusing ll = long long;\nconst int MOD = (int)(1e9 + 7);\nconst int INF = (int)(1e13 + 7);\n\nint ceil_(int a, int b) { return (a >= 0 ? (a + (b - 1)) / b : (a - (b - 1)) / b); }\nint mod(int a, int b) { return a >= 0 ? a % b : a - (b * ceil_(a, b)); }\nint bpm(int x, unsigned int y) {\n if (x == 0) return 0;\n if (y == 0) return 1;\n int ans = 1;\n int digit = (int)((log((double)y) / log((double)2) / 1 + 1));\n x %= MOD;\n for (unsigned int i = 0; i < digit; i++) {\n if (((y >> i) & 1u) == 1) ans = ans * x % MOD;\n x = x * x % MOD;\n }\n return ans;\n}\ntemplate <class T>\nvoid cumulative_sum(T &container) {\n for (int i = 0; i < container.size() - 1; i++) container[i + 1] += container[i];\n}\nint ans = 1;\n#define MAX_ 500000\nint inv_list[MAX_]; //inv_list[i-1] = inverse of i\nint fac[MAX_];\nint finv[MAX_];\nvoid nCk_init() {\n inv_list[0] = fac[0] = finv[0] = 1;\n for (int i = 0; i < MAX_ - 1; i++) {\n inv_list[i + 1] = MOD - ((inv_list[(MOD % (i + 2)) - 1] * (MOD / (i + 2))) % MOD);\n fac[i + 1] = (fac[i] * (i + 2)) % MOD;\n finv[i + 1] = (finv[i] * inv_list[i + 1]) % MOD;\n }\n}\nint nCk(int n, int k) {\n return (fac[n - 1] * ((finv[k - 1] * finv[n - k - 1]) % MOD)) % MOD;\n}\nint edge_num(vector<vector<int>> &edge, int now) {\n int ret = 0;\n if (edge[now].empty()) {\n return 1;\n } else {\n rep(i, edge[now].size()) {\n ret += edge_num(edge, edge[now][i]);\n }\n return ret + 1;\n }\n}\n\nvoid calc(vector<vector<int>> &edge, int now) {\n if (edge[now].size() == 2) {\n ans *= nCk(edge_num(edge, edge[now][0]) + edge_num(edge, edge[now][1]), edge_num(edge, edge[now][0]));\n }\n rep(i, edge[now].size()) {\n calc(edge, edge[now][i]);\n }\n}\n\nsigned main() {\n int N;\n cin >> N;\n nCk_init();\n vector<vector<int>> edge(N);\n vector<bool> check(N, false);\n rep(i, N - 1) {\n int a, b;\n cin >> a >> b;\n edge[a - 1].emplace_back(b - 1);\n check[b - 1] = true;\n }\n rep(i, N) {\n if (check[i] == false) {\n calc(edge, i);\n break;\n }\n }\n cout << ans << endl;\n}", "accuracy": 0.12, "time_ms": 10, "memory_kb": 14852, "score_of_the_acc": -0.2089, "final_rank": 17 }, { "submission_id": "aoj_0413_4312015", "code_snippet": "#include <iostream>\n//#include <iomanip>\n//#include <string>\n#include <vector>\n#include <algorithm>\n//#include <utility>\n//#include <set>\n//#include <map>\n//#include <stack>\n//#include <deque>\n//#include <bitset>\n//#include <math.h>\nusing namespace std ;\nusing ll = long long ;\n//using ld = long double ;\nusing vll = vector<ll> ;\nusing vvll = vector<vll> ;\n//using vc = vector<char> ;\n//using vvc = vector<vc> ;\nusing vb = vector<bool> ;\n//using vvb = vector<vb> ;\n//using pll = pair<ll,ll> ;\n\nll mod = 1000000 ;\n//long double pie = acos(-1) ;\n\n//void yorn(bool a){if(a) cout << \"Yes\" << endl ; else cout << \"No\" << endl ;}\n//void YorN(bool a){if(a) cout << \"YES\" << endl ; else cout << \"NO\" << endl ;}\n//ll gcd(long long a,long long b){if(b==0) return a ; return gcd(b,a%b) ;}\n//ll lcm(long long a,long long b){return a/gcd(a,b)*b ;}\n//ll sa(long long a,long long b){if(a>b) return a-b ; return b-a ;}\n//void mysort(vector<pll> &a){sort(a.begin(),a.end()) ;}\n//void myrev(vector<long long> &a){reverse(a.begin(),a.end()) ;}\n\nvvll nCr(2010,vll(2011,1)) ;\n\nvoid tree_size(vvll &g,vll &cnt,int n){\n\tif(g.at(n).size()==0){\n\t\tcnt.at(n) = 1 ;\n\t}else{\n\t\tcnt.at(n) = 1 ;\n\t\tfor(int i=0;i<g.at(n).size();i++){\n\t\t\ttree_size(g,cnt,g.at(n).at(i)) ;\n\t\t\tcnt.at(n) += cnt.at(g.at(n).at(i)) ;\n\t\t}\n\t}\n}\n\nll solve(vvll &g,vll &cnt,int n){\n\tif(g.at(n).size()==1) return 1 ;\n\tll sum = 0 ;\n\tll res = 1 ;\n\tsum = cnt.at(n)-1 ;\n\tll sub = 0 ;\n\tfor(int i=0;i<g.at(n).size();i++){\n\t\tres = res*nCr.at(sum-sub+cnt.at(g.at(n).at(i))-1).at(cnt.at(g.at(n).at(i)))%mod*solve(g,cnt,g.at(n).at(i))%mod ;\n\t\tsub += cnt.at(g.at(n).at(i)) ;\n\t}\n\treturn res ;\n}\n\nint main(){\n\tfor(int i=1;i<2010;i++){\n\t\tfor(int j=1;j<i;j++){\n\t\t\tnCr.at(i).at(j) = nCr.at(i-1).at(j-1)+nCr.at(i-1).at(j) ;\n\t\t\tnCr.at(i).at(j) %= mod ;\n\t\t}\n\t}\n\tll n ; cin >> n ;\n\tvvll g(n,vll(0)) ;\n\tvb root(n,true) ;\n\tfor(int i=0;i<n-1;i++){\n\t\tll a,b ;\n\t\tcin >> a >> b ;\n\t\ta-- ; b-- ;\n\t\tg.at(a).push_back(b) ;\n\t\troot.at(b) = false ;\n\t}\n\tll s = -1 ;\n\tfor(int i=0;i<n;i++){\n\t\tif(root.at(i)){\n\t\t\ts = i ;\n\t\t\tbreak ;\n\t\t}\n\t}\n\tvll cnt(n,0) ;\n\ttree_size(g,cnt,s) ;\n\tcout << solve(g,cnt,s) << endl ;\n}", "accuracy": 0.08, "time_ms": 10, "memory_kb": 34324, "score_of_the_acc": -0.566, "final_rank": 20 }, { "submission_id": "aoj_0413_4143204", "code_snippet": "#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <functional>\n#include <bitset>\n\nusing namespace std;\nusing lint = long long int;\nlong long int INF = 1001001001001001LL;\nint inf = 1000000007;\nlong long int MOD = 1000000LL;\ndouble PI = 3.1415926535897932;\n\ntemplate<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}\ntemplate<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}\n\n#define ALL(a) a.begin(),a.end()\n#define RALL(a) a.rbegin(),a.rend()\n\n/* do your best */\n\nconst long long MAXN = 1001024;\n\n// a, b の最大公約数を返す O( log max(a, b) )\nlong long gcd(long long a, long long b) {\n if(b == 0) return a;\n return gcd(b, a % b);\n}\n\n// ax + by = 1 となるような (x, y) と gcd(a, b) を返す. gcd(a, b) = 1 の時、解が存在する.\nlong long extgcd(long long a, long long b, long long &x, long long &y){\n long long d = a;\n if(b != 0){\n d = extgcd(b, a, y, x);\n y -= (a / b) * x;\n }else{\n x = 1;\n y = 0;\n }\n return d;\n}\n\n\n// 区間 [a, b) に存在する素数の個数を返す関数\n\nlong long prime[MAXN]; // [a,b) の素数のうち i 番目の素数\nbool is_prime[MAXN]; // 整数 i が素数であるかどうか\nbool is_prime_ab[MAXN]; // 整数 i+a が素数であるかどうか\n\nlong long sieve(long long n) {\n long long res = 0; fill(is_prime, is_prime + MAXN, true);\n is_prime[0] = is_prime[1] = false; // 0 と 1 は素数ではない。\n for(long long i = 2; i <= n; ++i) {\n if(!is_prime[i]) continue;\n prime[res++] = i;\n for(long long j = 2 * i; j <= n; j += i) is_prime[j] = false; // 素数 i の倍数は素数ではない (ふるい(篩)にかける)\n }\n return res;\n}\n\n/*\nlong long segment_sieve(long long a, long long b){\n fill(is_prime, is_prime + MAXN, true);\n fill(is_prime_ab, is_prime_ab + MAXN, true);\n for(long long i = 2; i * i <= b - 1; i++) {\n if(!is_prime[i]) continue;\n for(long long j = 2 * i; j * j <= b - 1; j += i) is_prime[j] = false; // 素数 i で篩にかける\n for(long long j = a - a % i; j < b; j += i) {\n if(j < a) continue;\n if(is_prime_ab[j-a]) is_prime_ab[j-a] = false; // 素数 i で篩にかける\n }\n }\n\n long long res = 0;\n for(long long i = a; i < b; i++) if(is_prime_ab[i - a]) prime[res++] = i;\n return res;\n}\n*/\n\n// ある整数の約数列挙\nvector<long long> divisors(long long n) {\n vector<long long> res;\n for(long long i = 1; i*i <= n; ++i) {\n if(n % i != 0) continue;\n res.push_back(i);\n if(n/i == i) continue; // 上の行で追加済み。\n res.push_back(n/i);\n }\n sort(res.begin(), res.end());\n return res;\n}\n\n\n// 素因数分解\nmap<long long, long long> prime_factors(long long n) {\n map<long long, long long> res;\n if(n == 1) { // n=1 の素因数分解は n^1\n res[n] = 1;\n return res;\n }\n for(long long i = 2, _n = n; i*i <= _n; ++i) {\n while(n % i == 0) {\n ++res[i]; // 素数i^{res[i]}\n n /= i;\n }\n }\n if(n != 1) res[n] = 1;\n return res;\n}\n\n\n// 繰り返し 2 乗法\nlong long modpow(long long a, long long n) {\n long long res = 1;\n while (n > 0) {\n if (n & 1) res = res * a % MOD;\n a = a * a % MOD;\n n >>= 1;\n }\n return res;\n}\n\n\n// 逆元を求める. a と m は互いに素であることが要請される.\nlong long modinv(long long a, long long m) {\n long long b = m, u = 1, v = 0;\n while(b){\n long long t = a / b;\n a -= t * b; swap(a, b);\n u -= t * v; swap(u, v);\n }\n u %= m; \n if (u < 0) u += m;\n return u;\n}\n\nlong long fac[MAXN], finv[MAXN], inv[MAXN];\n\nlint comb[2000][2000];\n\n// 前処理 O(n)\nvoid math_init(){\n for(int n = 0; n < 2000; n++) comb[n][0] = 1;\n \n for(int n = 1; n < 2000; n++) {\n for(int r = 1; r < 2000; r++) {\n comb[n][r] = comb[n - 1][r - 1] + comb[n - 1][r];\n comb[n][r] %= MOD;\n }\n }\n\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for(long long i = 2; i < MAXN; i++){\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n}\n\n// 二項係数計算 O(1)\nlong long COM(long long n, long long k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\n\n\n// before your coding, you have to write a line \"math_init()\"\nvoid dfs(int cur, vector<vector<int>> &g, vector<lint> &dp, vector<lint> &sz) {\n if(g[cur].size() == 0) {\n dp[cur] = 1;\n sz[cur] = 1;\n // cerr << \"dp[\" << cur << \"] = \" << dp[cur] << endl;\n return;\n }\n \n for(auto nxt : g[cur]) {\n dfs(nxt, g, dp, sz);\n }\n // sz を計算\n for(auto nxt : g[cur]) {\n sz[cur] += sz[nxt];\n sz[cur] %= MOD;\n }\n sz[cur] %= MOD;\n // dp を計算\n dp[cur] = 1LL;\n for(auto nxt : g[cur]) {\n dp[cur] *= dp[nxt];\n dp[cur] %= MOD;\n // dp[cur] /= fac[sz[nxt]];\n }\n\n lint mul = 1LL;\n lint n = sz[cur];\n for(auto nxt : g[cur]) {\n mul *= comb[n][sz[nxt]];\n mul %= MOD;\n n -= sz[nxt];\n }\n dp[cur] *= mul;\n dp[cur] %= MOD;\n // cerr << \"dp[\" << cur << \"] = \" << dp[cur] << endl;\n sz[cur]++;\n return;\n}\n\nint main() {\n \n math_init();\n int n; cin >> n;\n vector<vector<int>> g(n);\n set<lint> loser;\n for(int i = 0; i < n - 1; i++) {\n int a, b; cin >> a >> b;\n a--;\n b--;\n loser.insert(b);\n g[a].push_back(b);\n }\n\n lint winner = -1;\n for(int i = 0; i < n; i++) {\n if(loser.count(i) == 0) {\n winner = i;\n }\n }\n\n assert(winner != -1);\n vector<lint> dp(n, 0);\n vector<lint> sz(n, 0);\n dfs(winner, g, dp, sz);\n cout << dp[winner] << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 57984, "score_of_the_acc": -1.6667, "final_rank": 8 }, { "submission_id": "aoj_0413_4143193", "code_snippet": "#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <functional>\n#include <bitset>\n\nusing namespace std;\nusing lint = long long int;\nlong long int INF = 1001001001001001LL;\nint inf = 1000000007;\nlong long int MOD = 1000000LL;\ndouble PI = 3.1415926535897932;\n\ntemplate<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}\ntemplate<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}\n\n#define ALL(a) a.begin(),a.end()\n#define RALL(a) a.rbegin(),a.rend()\n\n/* do your best */\n\nconst long long MAXN = 1001024;\n\n// a, b の最大公約数を返す O( log max(a, b) )\nlong long gcd(long long a, long long b) {\n if(b == 0) return a;\n return gcd(b, a % b);\n}\n\n// ax + by = 1 となるような (x, y) と gcd(a, b) を返す. gcd(a, b) = 1 の時、解が存在する.\nlong long extgcd(long long a, long long b, long long &x, long long &y){\n long long d = a;\n if(b != 0){\n d = extgcd(b, a, y, x);\n y -= (a / b) * x;\n }else{\n x = 1;\n y = 0;\n }\n return d;\n}\n\n\n// 区間 [a, b) に存在する素数の個数を返す関数\n\nlong long prime[MAXN]; // [a,b) の素数のうち i 番目の素数\nbool is_prime[MAXN]; // 整数 i が素数であるかどうか\nbool is_prime_ab[MAXN]; // 整数 i+a が素数であるかどうか\n\nlong long sieve(long long n) {\n long long res = 0; fill(is_prime, is_prime + MAXN, true);\n is_prime[0] = is_prime[1] = false; // 0 と 1 は素数ではない。\n for(long long i = 2; i <= n; ++i) {\n if(!is_prime[i]) continue;\n prime[res++] = i;\n for(long long j = 2 * i; j <= n; j += i) is_prime[j] = false; // 素数 i の倍数は素数ではない (ふるい(篩)にかける)\n }\n return res;\n}\n\n/*\nlong long segment_sieve(long long a, long long b){\n fill(is_prime, is_prime + MAXN, true);\n fill(is_prime_ab, is_prime_ab + MAXN, true);\n for(long long i = 2; i * i <= b - 1; i++) {\n if(!is_prime[i]) continue;\n for(long long j = 2 * i; j * j <= b - 1; j += i) is_prime[j] = false; // 素数 i で篩にかける\n for(long long j = a - a % i; j < b; j += i) {\n if(j < a) continue;\n if(is_prime_ab[j-a]) is_prime_ab[j-a] = false; // 素数 i で篩にかける\n }\n }\n\n long long res = 0;\n for(long long i = a; i < b; i++) if(is_prime_ab[i - a]) prime[res++] = i;\n return res;\n}\n*/\n\n// ある整数の約数列挙\nvector<long long> divisors(long long n) {\n vector<long long> res;\n for(long long i = 1; i*i <= n; ++i) {\n if(n % i != 0) continue;\n res.push_back(i);\n if(n/i == i) continue; // 上の行で追加済み。\n res.push_back(n/i);\n }\n sort(res.begin(), res.end());\n return res;\n}\n\n\n// 素因数分解\nmap<long long, long long> prime_factors(long long n) {\n map<long long, long long> res;\n if(n == 1) { // n=1 の素因数分解は n^1\n res[n] = 1;\n return res;\n }\n for(long long i = 2, _n = n; i*i <= _n; ++i) {\n while(n % i == 0) {\n ++res[i]; // 素数i^{res[i]}\n n /= i;\n }\n }\n if(n != 1) res[n] = 1;\n return res;\n}\n\n\n// 繰り返し 2 乗法\nlong long modpow(long long a, long long n) {\n long long res = 1;\n while (n > 0) {\n if (n & 1) res = res * a % MOD;\n a = a * a % MOD;\n n >>= 1;\n }\n return res;\n}\n\n\n// 逆元を求める. a と m は互いに素であることが要請される.\nlong long modinv(long long a, long long m) {\n long long b = m, u = 1, v = 0;\n while(b){\n long long t = a / b;\n a -= t * b; swap(a, b);\n u -= t * v; swap(u, v);\n }\n u %= m; \n if (u < 0) u += m;\n return u;\n}\n\nlong long fac[MAXN], finv[MAXN], inv[MAXN];\n\n// 前処理 O(n)\nvoid math_init(){\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for(long long i = 2; i < MAXN; i++){\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n}\n\n// 二項係数計算 O(1)\nlong long COM(long long n, long long k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\n\n\n// before your coding, you have to write a line \"math_init()\"\nvoid dfs(int cur, vector<vector<int>> &g, vector<lint> &dp, vector<lint> &sz) {\n if(g[cur].size() == 0) {\n dp[cur] = 1;\n sz[cur] = 1;\n // cerr << \"dp[\" << cur << \"] = \" << dp[cur] << endl;\n return;\n }\n \n for(auto nxt : g[cur]) {\n dfs(nxt, g, dp, sz);\n }\n // sz を計算\n for(auto nxt : g[cur]) {\n sz[cur] += sz[nxt];\n sz[cur] %= MOD;\n }\n sz[cur] %= MOD;\n // dp を計算\n dp[cur] = fac[sz[cur]];\n for(auto nxt : g[cur]) {\n dp[cur] *= dp[nxt];\n dp[cur] /= fac[sz[nxt]];\n // dp[cur] /= fac[sz[nxt]];\n }\n dp[cur] %= MOD;\n // cerr << \"dp[\" << cur << \"] = \" << dp[cur] << endl;\n sz[cur]++;\n return;\n}\n\nint main() {\n \n math_init();\n int n; cin >> n;\n vector<vector<int>> g(n);\n set<lint> loser;\n for(int i = 0; i < n - 1; i++) {\n int a, b; cin >> a >> b;\n a--;\n b--;\n loser.insert(b);\n g[a].push_back(b);\n }\n\n lint winner = -1;\n for(int i = 0; i < n; i++) {\n if(loser.count(i) == 0) {\n winner = i;\n }\n }\n\n assert(winner != -1);\n vector<lint> dp(n, 0);\n vector<lint> sz(n, 0);\n dfs(winner, g, dp, sz);\n cout << dp[winner] << endl;\n return 0;\n}", "accuracy": 0.16, "time_ms": 30, "memory_kb": 26612, "score_of_the_acc": -0.6468, "final_rank": 15 }, { "submission_id": "aoj_0413_4143192", "code_snippet": "#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <functional>\n#include <bitset>\n\nusing namespace std;\nusing lint = long long int;\nlong long int INF = 1001001001001001LL;\nint inf = 1000000007;\nlong long int MOD = 1000000LL;\ndouble PI = 3.1415926535897932;\n\ntemplate<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}\ntemplate<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}\n\n#define ALL(a) a.begin(),a.end()\n#define RALL(a) a.rbegin(),a.rend()\n\n/* do your best */\n\nconst long long MAXN = 1001024;\n\n// a, b の最大公約数を返す O( log max(a, b) )\nlong long gcd(long long a, long long b) {\n if(b == 0) return a;\n return gcd(b, a % b);\n}\n\n// ax + by = 1 となるような (x, y) と gcd(a, b) を返す. gcd(a, b) = 1 の時、解が存在する.\nlong long extgcd(long long a, long long b, long long &x, long long &y){\n long long d = a;\n if(b != 0){\n d = extgcd(b, a, y, x);\n y -= (a / b) * x;\n }else{\n x = 1;\n y = 0;\n }\n return d;\n}\n\n\n// 区間 [a, b) に存在する素数の個数を返す関数\n\nlong long prime[MAXN]; // [a,b) の素数のうち i 番目の素数\nbool is_prime[MAXN]; // 整数 i が素数であるかどうか\nbool is_prime_ab[MAXN]; // 整数 i+a が素数であるかどうか\n\nlong long sieve(long long n) {\n long long res = 0; fill(is_prime, is_prime + MAXN, true);\n is_prime[0] = is_prime[1] = false; // 0 と 1 は素数ではない。\n for(long long i = 2; i <= n; ++i) {\n if(!is_prime[i]) continue;\n prime[res++] = i;\n for(long long j = 2 * i; j <= n; j += i) is_prime[j] = false; // 素数 i の倍数は素数ではない (ふるい(篩)にかける)\n }\n return res;\n}\n\n/*\nlong long segment_sieve(long long a, long long b){\n fill(is_prime, is_prime + MAXN, true);\n fill(is_prime_ab, is_prime_ab + MAXN, true);\n for(long long i = 2; i * i <= b - 1; i++) {\n if(!is_prime[i]) continue;\n for(long long j = 2 * i; j * j <= b - 1; j += i) is_prime[j] = false; // 素数 i で篩にかける\n for(long long j = a - a % i; j < b; j += i) {\n if(j < a) continue;\n if(is_prime_ab[j-a]) is_prime_ab[j-a] = false; // 素数 i で篩にかける\n }\n }\n\n long long res = 0;\n for(long long i = a; i < b; i++) if(is_prime_ab[i - a]) prime[res++] = i;\n return res;\n}\n*/\n\n// ある整数の約数列挙\nvector<long long> divisors(long long n) {\n vector<long long> res;\n for(long long i = 1; i*i <= n; ++i) {\n if(n % i != 0) continue;\n res.push_back(i);\n if(n/i == i) continue; // 上の行で追加済み。\n res.push_back(n/i);\n }\n sort(res.begin(), res.end());\n return res;\n}\n\n\n// 素因数分解\nmap<long long, long long> prime_factors(long long n) {\n map<long long, long long> res;\n if(n == 1) { // n=1 の素因数分解は n^1\n res[n] = 1;\n return res;\n }\n for(long long i = 2, _n = n; i*i <= _n; ++i) {\n while(n % i == 0) {\n ++res[i]; // 素数i^{res[i]}\n n /= i;\n }\n }\n if(n != 1) res[n] = 1;\n return res;\n}\n\n\n// 繰り返し 2 乗法\nlong long modpow(long long a, long long n) {\n long long res = 1;\n while (n > 0) {\n if (n & 1) res = res * a % MOD;\n a = a * a % MOD;\n n >>= 1;\n }\n return res;\n}\n\n\n// 逆元を求める. a と m は互いに素であることが要請される.\nlong long modinv(long long a, long long m) {\n long long b = m, u = 1, v = 0;\n while(b){\n long long t = a / b;\n a -= t * b; swap(a, b);\n u -= t * v; swap(u, v);\n }\n u %= m; \n if (u < 0) u += m;\n return u;\n}\n\nlong long fac[MAXN], finv[MAXN], inv[MAXN];\n\n// 前処理 O(n)\nvoid math_init(){\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for(long long i = 2; i < MAXN; i++){\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n}\n\n// 二項係数計算 O(1)\nlong long COM(long long n, long long k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\n\n\n// before your coding, you have to write a line \"math_init()\"\nvoid dfs(int cur, vector<vector<int>> &g, vector<lint> &dp, vector<lint> &sz) {\n if(g[cur].size() == 0) {\n dp[cur] = 1;\n sz[cur] = 1;\n // cerr << \"dp[\" << cur << \"] = \" << dp[cur] << endl;\n return;\n }\n \n for(auto nxt : g[cur]) {\n dfs(nxt, g, dp, sz);\n }\n // sz を計算\n for(auto nxt : g[cur]) {\n sz[cur] += sz[nxt];\n sz[cur] %= MOD;\n }\n sz[cur] %= MOD;\n // dp を計算\n dp[cur] = fac[sz[cur]];\n for(auto nxt : g[cur]) {\n dp[cur] *= dp[nxt];\n dp[cur] %= MOD;\n dp[cur] /= fac[sz[nxt]];\n // dp[cur] /= fac[sz[nxt]];\n }\n dp[cur] %= MOD;\n // cerr << \"dp[\" << cur << \"] = \" << dp[cur] << endl;\n sz[cur]++;\n return;\n}\n\nint main() {\n \n math_init();\n int n; cin >> n;\n vector<vector<int>> g(n);\n set<lint> loser;\n for(int i = 0; i < n - 1; i++) {\n int a, b; cin >> a >> b;\n a--;\n b--;\n loser.insert(b);\n g[a].push_back(b);\n }\n\n lint winner = -1;\n for(int i = 0; i < n; i++) {\n if(loser.count(i) == 0) {\n winner = i;\n }\n }\n\n assert(winner != -1);\n vector<lint> dp(n, 0);\n vector<lint> sz(n, 0);\n dfs(winner, g, dp, sz);\n cout << dp[winner] << endl;\n return 0;\n}", "accuracy": 0.16, "time_ms": 30, "memory_kb": 26620, "score_of_the_acc": -0.6469, "final_rank": 16 } ]
aoj_0415_cpp
Dungeion 3 You are a famous adventurer and have already conquered two dungeons. You have obtained a map of a new dungeon with several passages and treasure chests on it. The map shows the value of the treasures in each treasury. You can enter the dungeon from any of the treasuries and escape the dungeon from any of the treasuries. During the time between entering and exiting, you can move several times through the passages between the treasuries to get the treasures of the treasuries you visited. According to the map, each passage can go in both directions, and you can reach any treasure house from any treasure house via one or more passages. However, once a passage is traversed, the second and subsequent passages can only be traversed in the same direction as the first. Treasures in the treasury can only be obtained the first time you visit it. At this time, we want to maximize the total value of the treasures we obtain. Given the information on the map, write a program to find the maximum value of the sum of the values of the treasures that can be obtained from the time of entry to the time of escape. Assume that the treasuries are assigned numbers from 1 to $N$. Input The input is given in the following form. $N$ $M$ $v_1$ $v_2$ : $v_N$ $s_1$ $t_1$ $s_2$ $t_2$ : $s_M$ $t_M$ In the first line, the number of treasuries $N$ ($2 \leq N \leq 10^5$) and the number of passages $M$ ($1 \leq M \leq 2 \times 10^5$) are given. In the following $N$ lines, the value $v_i$ ($1 \leq v_i \leq 1000$) of the treasure placed in the $i$-th treasury is given. In the following $M$ lines, the numbers $s_i$,$t_i$ ($1 \leq s_i,t_i \leq N,s_i \ne t_i$) of the treasure vaults connected to the two ends of each passage are given. No passage connecting the same treasury can be given more than once. Output Output the maximum value of the sum of the values of the treasures that can be obtained in a line. Sample Input and Output Sample Input 5 4 2 1 3 6 4 1 2 2 3 2 4 4 5 Sample Output 14
[ { "submission_id": "aoj_0415_10825469", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug.hpp>\n#else\n#define debug(...)\n#endif\n\nstruct LowLink {\n int N;\n // articulation: 関節点, bridge: 橋\n vector<int> order, low, articulation;\n vector<pair<int, int>> bridge;\n LowLink(const vector<vector<int>>& G) : N(G.size()), order(N, -1), low(N, -1) {\n for (int i = 0; i < N; i++) {\n if (order[i] == -1) dfs(G, i, -1, 0);\n }\n };\n\n void dfs(const vector<vector<int>>& G, int pos, int parent, int time) {\n order[pos] = low[pos] = time++;\n int child_cnt = 0;\n bool is_articulation = false, second = false;\n for (auto to : G[pos]) {\n if (order[to] == -1) {\n // to が未訪問の場合\n child_cnt++;\n dfs(G, to, pos, time);\n low[pos] = min(low[pos], low[to]);\n // order[pos] < low[to] ならば橋\n if (order[pos] < low[to]) bridge.emplace_back(minmax(pos, to));\n // 根以外で, order[pos] <= low[to] ならば関節点\n is_articulation |= parent != -1 && order[pos] <= low[to];\n } else if (to != parent || second) {\n // (pos, to) が後退辺 or 多重辺(後退辺)の場合\n low[pos] = min(low[pos], order[to]);\n } else {\n // to が 親の場合, もう一度 to を訪問したら (pos, to) は多重辺\n second = true;\n }\n }\n // 根かつ, 子が 2 つ以上ならば関節点\n is_articulation |= parent == -1 && child_cnt > 1;\n if (is_articulation) articulation.emplace_back(pos);\n };\n};\n\nstruct TwoEdgeConnectedComponents {\n LowLink lowlink;\n vector<int> comp; // 頂点[i] が属する 2 重辺連結成分の番号\n vector<vector<int>> groups, tree;\n int id;\n TwoEdgeConnectedComponents(const vector<vector<int>>& G) : lowlink(G), comp(G.size(), -1), id(0) {\n for (int i = 0; i < (int)G.size(); i++) {\n if (comp[i] == -1) dfs(G, i, -1);\n }\n groups.resize(id), tree.resize(id);\n for (int i = 0; i < (int)G.size(); i++) {\n groups[comp[i]].emplace_back(i);\n }\n for (auto [u, v] : lowlink.bridge) {\n tree[comp[u]].emplace_back(comp[v]);\n tree[comp[v]].emplace_back(comp[u]);\n }\n };\n\n void dfs(const vector<vector<int>>& G, int pos, int parent) {\n if (parent != -1 && lowlink.order[parent] >= lowlink.low[pos]) {\n // 根でないかつ, (pos, parent) が橋でない場合\n comp[pos] = comp[parent];\n } else {\n // 根または, (pos, parent) が橋の場合, 新しい２重辺連結成分を作る\n comp[pos] = id++;\n }\n for (auto to : G[pos]) {\n if (comp[to] != -1) continue;\n dfs(G, to, pos);\n }\n }\n};\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N, M;\n cin >> N >> M;\n vector<int> V(N);\n for (int i = 0; i < N; i++) cin >> V[i];\n vector<vector<int>> G(N);\n for (int i = 0; i < M; i++) {\n int s, t;\n cin >> s >> t, s--, t--;\n G[s].emplace_back(t);\n G[t].emplace_back(s);\n }\n\n // 二重辺連結成分内に入ると, その中にある財宝全てを取ることができて, 好きな頂点から抜けれる\n TwoEdgeConnectedComponents tecc(G);\n // 二重辺連結成分を縮約した木の頂点の重みを計算\n int N2 = ssize(tecc.tree);\n vector<int> V2(N2);\n for (int i = 0; i < N2; i++) {\n for (int u : tecc.groups[i]) V2[i] += V[u];\n }\n\n debug(tecc.groups, tecc.tree, V2);\n // 頂点重み付き木の最大 walk を計算\n vector<int> dist1(V2), dist2(V2);\n auto dfs = [&](auto&& self, int v, int p, int type) -> void {\n for (int u : tecc.tree[v]) {\n if (u == p) continue;\n if (type == 1) dist1[u] = max(dist1[u], dist1[v] + V2[u]);\n if (type == 2) dist2[u] = max(dist2[u], dist2[v] + V2[u]);\n self(self, u, v, type);\n }\n };\n dfs(dfs, 0, -1, 1);\n int r = max_element(dist1.begin(), dist1.end()) - dist1.begin();\n dfs(dfs, r, -1, 2);\n debug(dist1, dist2);\n cout << *max_element(dist2.begin(), dist2.end()) << '\\n';\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 34576, "score_of_the_acc": -0.6086, "final_rank": 6 }, { "submission_id": "aoj_0415_10205458", "code_snippet": "// AOJ #415\n// Dungeon 3 2025.2.9\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tif (c == '-') {\tc = gc();\n\t\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\t\treturn -n;\n\t}\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nchar temp[100005];\nstring Cins() { // 文字列の入力　スペース以下の文字で入力終了\n char *s = temp;\n\tdo *s = gc();\n\twhile (*s++ > ' ');\n\t*(s-1) = 0;\n string input(temp); // 文字配列からstringを作成\n return input;\n}\n\nvoid Cout(ll n) { // 整数の表示（出力）\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tif (n < 0) pc('-'), n = -n;\n\t\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n\t\twhile (i--) pc(b[i]);\n\t}\n\tpc('\\n');\n}\n\n\nstruct Edge { int to, id; };\n \nint n, m;\nvector<vector<Edge>> adj;\nvector<int> disc, low;\nvector<bool> isBridge;\nint timer = 0;\n \nvoid dfs_bridges(int v, int parentEdge) {\n disc[v] = low[v] = timer++;\n for(auto &edge : adj[v]){\n int w = edge.to, id = edge.id;\n if(id == parentEdge) continue;\n if(disc[w] == -1) {\n dfs_bridges(w, id);\n low[v] = min(low[v], low[w]);\n if(low[w] > disc[v]) isBridge[id] = true;\n } else low[v] = min(low[v], disc[w]);\n }\n}\n \nint main() {\n n = Cin(), m = Cin();\n vector<int> treasure(n);\n for (int i = 0; i < n; i++) treasure[i] = Cin();\n \n vector<pair<int,int>> edgeList;\n edgeList.reserve(m);\n adj.assign(n, vector<Edge>());\n for (int i = 0; i < m; i++){\n int u = Cin()-1, v = Cin()-1;\n edgeList.push_back({u,v});\n adj[u].push_back({v, i});\n adj[v].push_back({u, i});\n }\n \n disc.assign(n, -1);\n low.assign(n, -1);\n isBridge.assign(m, false);\n timer = 0;\n for (int i = 0; i < n; i++){\n if(disc[i] == -1) dfs_bridges(i, -1);\n }\n \n vector<int> comp(n, -1);\n int compCount = 0;\n function<void(int,int)> dfs_comp = [&](int v, int c) {\n comp[v] = c;\n for(auto &edge : adj[v]) {\n int w = edge.to;\n if(comp[w] == -1 && !isBridge[edge.id])\n dfs_comp(w, c);\n }\n };\n for (int i = 0; i < n; i++){\n if(comp[i] == -1) dfs_comp(i, compCount++);\n }\n \n vector<ll> compWeight(compCount, 0);\n for (int i = 0; i < n; i++){\n compWeight[ comp[i] ] += treasure[i];\n }\n \n vector<vector<int>> tree(compCount);\n for (int i = 0; i < m; i++){\n if(isBridge[i]){\n int u = edgeList[i].first, v = edgeList[i].second;\n int cu = comp[u], cv = comp[v];\n tree[cu].push_back(cv);\n tree[cv].push_back(cu);\n }\n }\n \n if(compCount == 1){\n Cout(compWeight[0]);\n return 0;\n }\n \n ll bestDist = 0;\n int farthestNode = 0;\n vector<ll> dist(compCount, 0);\n function<void(int,int,ll)> dfs_tree = [&](int v, int parent, ll d) {\n dist[v] = d;\n if(d > bestDist) {\n bestDist = d;\n farthestNode = v;\n }\n for (int w : tree[v]) {\n if(w == parent) continue;\n dfs_tree(w, v, d + compWeight[w]);\n }\n };\n \n bestDist = 0;\n dfs_tree(0, -1, compWeight[0]);\n int start = farthestNode;\n bestDist = 0;\n fill(dist.begin(), dist.end(), 0);\n dfs_tree(start, -1, compWeight[start]);\n Cout(bestDist);\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 25612, "score_of_the_acc": -0.1044, "final_rank": 1 }, { "submission_id": "aoj_0415_9629664", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug_print.hpp>\n#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define debug(...) (static_cast<void>(0))\n#endif\n\nstruct LowLink {\n int N;\n // articulation: 関節点, bridge: 橋\n vector<int> order, low, articulation;\n vector<pair<int, int>> bridge;\n LowLink(const vector<vector<int>>& G) : N(G.size()), order(N, -1), low(N, -1) {\n for (int i = 0; i < N; i++) {\n if (order[i] == -1) dfs(G, i, -1, 0);\n }\n };\n\n void dfs(const vector<vector<int>>& G, int pos, int parent, int time) {\n order[pos] = low[pos] = time++;\n int child_cnt = 0;\n bool is_articulation = false, second = false;\n for (auto to : G[pos]) {\n if (order[to] == -1) {\n // to が未訪問の場合\n child_cnt++;\n dfs(G, to, pos, time);\n low[pos] = min(low[pos], low[to]);\n // order[pos] < low[to] ならば橋\n if (order[pos] < low[to]) bridge.emplace_back(minmax(pos, to));\n // 根以外で, order[pos] <= low[to] ならば関節点\n is_articulation |= parent != -1 && order[pos] <= low[to];\n } else if (to != parent || second) {\n // (pos, to) が後退辺 or 多重辺(後退辺)の場合\n low[pos] = min(low[pos], order[to]);\n } else {\n // to が 親の場合, もう一度 to を訪問したら (pos, to) は多重辺\n second = true;\n }\n }\n // 根かつ, 子が 2 つ以上ならば関節点\n is_articulation |= parent == -1 && child_cnt > 1;\n if (is_articulation) articulation.emplace_back(pos);\n };\n};\n\nstruct TwoEdgeConnectedComponents {\n LowLink lowlink;\n vector<int> comp; // 頂点[i] が属する 2 重辺連結成分の番号\n vector<vector<int>> groups, tree;\n int id;\n TwoEdgeConnectedComponents(const vector<vector<int>>& G) : lowlink(G), comp(G.size(), -1), id(0) {\n for (int i = 0; i < (int)G.size(); i++) {\n if (comp[i] == -1) dfs(G, i, -1);\n }\n groups.resize(id), tree.resize(id);\n for (int i = 0; i < (int)G.size(); i++) {\n groups[comp[i]].emplace_back(i);\n }\n for (auto [u, v] : lowlink.bridge) {\n tree[comp[u]].emplace_back(comp[v]);\n tree[comp[v]].emplace_back(comp[u]);\n }\n };\n\n void dfs(const vector<vector<int>>& G, int pos, int parent) {\n if (parent != -1 && lowlink.order[parent] >= lowlink.low[pos]) {\n // 根でないかつ, (pos, parent) が橋でない場合\n comp[pos] = comp[parent];\n } else {\n // 根または, (pos, parent) が橋の場合, 新しい２重辺連結成分を作る\n comp[pos] = id++;\n }\n for (auto to : G[pos]) {\n if (comp[to] != -1) continue;\n dfs(G, to, pos);\n }\n }\n};\n\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N, M;\n cin >> N >> M;\n vector<int> V(N);\n for (int i = 0; i < N; i++) cin >> V[i];\n vector<vector<int>> G(N);\n for (int i = 0; i < M; i++) {\n int s, t; cin >> s >> t, s--, t--;\n G[s].emplace_back(t);\n G[t].emplace_back(s);\n }\n\n TwoEdgeConnectedComponents tecc(G);\n // 各 2 重辺連結成分の V の総和 W を求める\n vector<int> W(tecc.groups.size());\n for (int i = 0; i < N; i++) {\n W[tecc.comp[i]] += V[i];\n }\n\n // 二重頂点連結成分を縮約した木を作る\n auto G2 = tecc.tree;\n // 頂点 i の重みが W[i] の木の直径を求める\n auto tree_diameter = [&]() -> ll {\n int N = G2.size();\n auto dfs = [&](auto&& self, int pos, int parent) -> pair<ll, int> {\n pair<ll, int> res = {W[pos], pos};\n for (auto to : G2[pos]) {\n if (to == parent) continue;\n auto [d, v] = self(self, to, pos);\n if (res.first < d + W[pos]) res = {d + W[pos], v};\n }\n return res;\n };\n // 2 回 dfs\n auto [d, v] = dfs(dfs, 0, -1);\n auto [d2, v2] = dfs(dfs, v, -1);\n return d2;\n };\n cout << tree_diameter() << '\\n';\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 40392, "score_of_the_acc": -0.965, "final_rank": 14 }, { "submission_id": "aoj_0415_9628388", "code_snippet": "#ifndef TEMPLATE\n#define TEMPLATE 1\n\n#pragma GCC optimize(\"O3,unroll-loops\")\n\n// #include <bits/stdc++.h>\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <chrono>\n#include <cmath>\n#include <cstring>\n#include <deque>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <iterator>\n#include <limits>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <random>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\n\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\n\nusing pi = std::pair<int, int>;\nusing pl = std::pair<i64, i64>;\nusing pil = std::pair<int, i64>;\nusing pli = std::pair<i64, int>;\n\ntemplate <class T> constexpr T infty = 0;\ntemplate <> constexpr int infty<int> = (1 << 30) - 123;\ntemplate <> constexpr i64 infty<i64> = (1ll << 62) - (1ll << 31);\ntemplate <> constexpr i128 infty<i128> = i128(infty<i64>) * infty<i64>;\ntemplate <> constexpr u32 infty<u32> = infty<int>;\ntemplate <> constexpr u64 infty<u64> = infty<i64>;\ntemplate <> constexpr double infty<double> = infty<i64>;\ntemplate <> constexpr long double infty<long double> = infty<i64>;\n\nconstexpr int mod = 998244353;\nconstexpr int modu = 1e9 + 7;\nconstexpr long double PI = 3.14159265358979323846;\n\ntemplate <class T> using vc = std::vector<T>;\ntemplate <class T> using vvc = std::vector<vc<T>>;\ntemplate <class T> using vvvc = std::vector<vvc<T>>;\ntemplate <class T> using vvvvc = std::vector<vvvc<T>>;\n\ntemplate <class T> using pq = std::priority_queue<T>;\ntemplate <class T>\nusing pqi = std::priority_queue<T, std::vector<T>, std::greater<T>>;\n\nnamespace kk2 {\n\ntemplate <class T, class... Sizes>\nauto make_vector(const T &init, int first, Sizes... sizes) {\n if constexpr (sizeof...(sizes) == 0) {\n return std::vector<T>(first, init);\n } else {\n return std::vector<decltype(make_vector(init, sizes...))>(\n first, make_vector(init, sizes...));\n }\n}\n\ntemplate <class T, class U> void fill_all(std::vector<T> &v, const U &x) {\n std::fill(std::begin(v), std::end(v), T(x));\n}\n\ntemplate <class T, class U>\nvoid fill_all(std::vector<std::vector<T>> &v, const U &x) {\n for (auto &u : v) fill_all(u, x);\n}\n\n} // namespace kk2\n\ntemplate <class T, class S> inline bool chmax(T &a, const S &b) {\n return (a < b ? a = b, 1 : 0);\n}\n\ntemplate <class T, class S> inline bool chmin(T &a, const S &b) {\n return (a > b ? a = b, 1 : 0);\n}\n\n#define rep1(a) for (i64 _ = 0; _ < (i64)(a); ++_)\n#define rep2(i, a) for (i64 i = 0; i < (i64)(a); ++i)\n#define rep3(i, a, b) for (i64 i = (a); i < (i64)(b); ++i)\n#define repi2(i, a) for (i64 i = (a) - 1; i >= 0; --i)\n#define repi3(i, a, b) for (i64 i = (a) - 1; i >= (i64)(b); --i)\n#define overload3(a, b, c, d, ...) d\n#define rep(...) overload3(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)\n#define repi(...) overload3(__VA_ARGS__, repi3, repi2, rep1)(__VA_ARGS__)\n\n#define fi first\n#define se second\n#define all(p) std::begin(p), std::end(p)\n\nvoid YES(bool b = 1) {\n std::cout << (b ? \"YES\" : \"NO\") << '\\n';\n}\n\nvoid NO(bool b = 1) {\n std::cout << (b ? \"NO\" : \"YES\") << '\\n';\n}\n\nvoid YESflush(bool b = 1) {\n std::cout << (b ? \"YES\" : \"NO\") << std::endl;\n}\n\nvoid NOflush(bool b = 1) {\n std::cout << (b ? \"NO\" : \"YES\") << std::endl;\n}\n\nvoid Yes(bool b = 1) {\n std::cout << (b ? \"Yes\" : \"No\") << '\\n';\n}\n\nvoid No(bool b = 1) {\n std::cout << (b ? \"No\" : \"Yes\") << '\\n';\n}\n\nvoid Yesflush(bool b = 1) {\n std::cout << (b ? \"Yes\" : \"No\") << std::endl;\n}\n\nvoid Noflush(bool b = 1) {\n std::cout << (b ? \"No\" : \"Yes\") << std::endl;\n}\n\nvoid yes(bool b = 1) {\n std::cout << (b ? \"yes\" : \"no\") << '\\n';\n}\n\nvoid no(bool b = 1) {\n std::cout << (b ? \"no\" : \"yes\") << '\\n';\n}\n\nvoid yesflush(bool b = 1) {\n std::cout << (b ? \"yes\" : \"no\") << std::endl;\n}\n\nvoid noflush(bool b = 1) {\n std::cout << (b ? \"no\" : \"yes\") << std::endl;\n}\n\n#endif // TEMPLATE\n\n#ifndef GRAPH_GRAPH_TEMPLATE_HPP\n#define GRAPH_GRAPH_TEMPLATE_HPP 1\n\n#include <cassert>\n#include <iostream>\n#include <type_traits>\n#include <utility>\n#include <vector>\n\nnamespace kk2 {\n\ntemplate <class T> struct WeightedEdge {\n int from, to, id;\n T cost;\n\n WeightedEdge(int to_, T cost_, int from_ = -1, int id_ = -1)\n : from(from_),\n to(to_),\n id(id_),\n cost(cost_) {}\n\n WeightedEdge() : from(-1), to(-1), id(-1), cost(0) {}\n\n operator int() const { return to; }\n\n WeightedEdge rev() const { return WeightedEdge(from, cost, to, id); }\n\n friend std::ostream &operator<<(std::ostream &os, const WeightedEdge &e) {\n if (std::is_same_v<T, bool>) return os << e.from << \"->\" << e.to;\n return os << e.from << \"->\" << e.to << \":\" << e.cost;\n }\n};\ntemplate <class T> using WeightedEdges = std::vector<WeightedEdge<T>>;\n\ntemplate <class T, bool is_directed = false>\nstruct WeightedGraph : std::vector<WeightedEdges<T>> {\n WeightedGraph(int n_ = 0, bool is_one_indexed = true)\n : std::vector<WeightedEdges<T>>(n_),\n n(n_),\n m(0),\n oneindexed(is_one_indexed) {}\n\n WeightedGraph(int n_, int m_, bool is_one_indexed = true)\n : std::vector<WeightedEdges<T>>(n_),\n n(n_),\n m(m_),\n oneindexed(is_one_indexed) {\n input();\n }\n\n WeightedGraph(int n_, const WeightedEdges<T> &edges_, bool is_one_indexed = true)\n : std::vector<WeightedEdges<T>>(n_),\n n(n_),\n m(0),\n oneindexed(is_one_indexed) {\n for (auto &e : edges_) { _add_edge(e.from, e.to, e.cost, m++); }\n }\n\n using value_type = T;\n using edge_type = WeightedEdge<T>;\n\n constexpr static bool directed() { return is_directed; }\n\n int n, m;\n bool oneindexed;\n WeightedEdges<T> edges;\n\n int num_vertices() const { return n; }\n\n int num_edges() const { return m; }\n\n void clear() {\n for (int i = 0; i < n; i++) (*this)[i].clear();\n edges.clear();\n m = 0;\n }\n\n WeightedGraph &inplace_rev() {\n static_assert(is_directed);\n WeightedEdges<T> rev(m);\n for (int i = 0; i < m; i++) { rev[i] = edges[i].rev(); }\n clear();\n for (auto &e : rev) _add_edge(e.from, e.to, e.cost, m++);\n return *this;\n }\n\n WeightedGraph rev() const {\n static_assert(is_directed);\n WeightedGraph res(n);\n res.m = m;\n for (int i = 0; i < m; i++) {\n res._add_edge(edges[i].to, edges[i].from, edges[i].cost, i);\n }\n return res;\n }\n\n private:\n void input() {\n for (int i = 0; i < m; i++) {\n int u, v;\n T w;\n std::cin >> u >> v >> w;\n if (oneindexed) {\n u--;\n v--;\n }\n _add_edge(u, v, w, i);\n }\n }\n\n public:\n void add_edge(int from, int to, T cost) {\n if (oneindexed) {\n from--;\n to--;\n }\n _add_edge(from, to, cost, m++);\n }\n\n void add_edge_naive(int from, int to, T cost) {\n _add_edge(from, to, cost, m++);\n }\n\n private:\n void _add_edge(int from, int to, T cost, int id) {\n (*this)[from].emplace_back(to, cost, from, id);\n if constexpr (!is_directed)\n (*this)[to].emplace_back(from, cost, to, id);\n edges.emplace_back(to, cost, from, id);\n }\n};\n\nstruct UnWeightedEdge {\n int from, to, id;\n\n UnWeightedEdge(int to_, int from_ = -1, int id_ = -1)\n : from(from_),\n to(to_),\n id(id_) {}\n\n UnWeightedEdge() : from(-1), to(-1), id(-1) {}\n\n operator int() const { return to; }\n\n UnWeightedEdge rev() const { return UnWeightedEdge(from, to, id); }\n\n friend std::ostream &operator<<(std::ostream &os, const UnWeightedEdge &e) {\n return os << e.from << \"->\" << e.to;\n }\n};\n\nusing UnWeightedEdges = std::vector<UnWeightedEdge>;\n\ntemplate <bool is_directed = false, bool is_functional = false>\nstruct UnWeightedGraph : std::vector<UnWeightedEdges> {\n UnWeightedGraph(int n_ = 0, bool is_one_indexed = true)\n : std::vector<UnWeightedEdges>(n_),\n n(n_),\n m(0),\n oneindexed(is_one_indexed) {}\n\n UnWeightedGraph(int n_, int m_, bool is_one_indexed = true)\n : std::vector<UnWeightedEdges>(n_),\n n(n_),\n m(m_),\n oneindexed(is_one_indexed) {\n input();\n }\n\n UnWeightedGraph(int n_, const UnWeightedEdges &edges_, bool is_one_indexed = true)\n : std::vector<UnWeightedEdges>(n_),\n n(n_),\n m(0),\n oneindexed(is_one_indexed) {\n for (auto &e : edges_) { _add_edge(e.from, e.to, m++); }\n }\n\n constexpr static bool directed() { return is_directed; }\n\n constexpr static bool functional() { return is_functional; }\n\n using edge_type = UnWeightedEdge;\n\n int n, m;\n bool oneindexed;\n UnWeightedEdges edges;\n\n int num_vertices() const { return n; }\n\n int num_edges() const { return m; }\n\n void clear() {\n for (int i = 0; i < n; i++) (*this)[i].clear();\n edges.clear();\n m = 0;\n }\n\n UnWeightedGraph &inplace_rev() {\n static_assert(is_directed);\n std::vector<std::pair<int, int>> rev(m);\n for (int i = 0; i < m; i++) { rev[i] = {edges[i].to, edges[i].from}; }\n clear();\n for (auto &&[u, v] : rev) _add_edge(u, v, m++);\n return *this;\n }\n\n UnWeightedGraph rev() const {\n static_assert(is_directed);\n UnWeightedGraph res(n);\n res.m = m;\n for (int i = 0; i < m; i++) {\n res._add_edge(edges[i].to, edges[i].from, i);\n }\n return res;\n }\n\n private:\n void input() {\n if constexpr (is_functional) {\n functional_graph();\n return;\n }\n for (int i = 0; i < m; i++) {\n int u, v;\n std::cin >> u >> v;\n if (oneindexed) {\n u--;\n v--;\n }\n _add_edge(u, v, i);\n }\n }\n\n void functional_graph() {\n static_assert(is_directed);\n assert(n == m);\n for (int i = 0; i < n; i++) {\n int u;\n std::cin >> u;\n if (oneindexed) u--;\n _add_edge(i, u, i);\n }\n }\n\n public:\n void add_edge(int from, int to) {\n if (oneindexed) {\n from--;\n to--;\n }\n _add_edge(from, to, m++);\n }\n\n void add_edge_naive(int from, int to) { _add_edge(from, to, m++); }\n\n private:\n void _add_edge(int from, int to, int id) {\n (*this)[from].emplace_back(to, from, id);\n if constexpr (!is_directed) (*this)[to].emplace_back(from, to, id);\n edges.emplace_back(to, from, id);\n }\n};\n\n\ntemplate <class T, bool is_directed = false>\nusing WGraph = WeightedGraph<T, is_directed>;\ntemplate <bool is_directed = false, bool is_functional = false>\nusing Graph = UnWeightedGraph<is_directed, is_functional>;\n\n} // namespace kk2\n\n#endif // GRAPH_GRAPH_TEMPLATE_HPP\n\n#ifndef GRAPH_LOWLINK_HPP\n#define GRAPH_LOWLINK_HPP 1\n\n#include <algorithm>\n#include <functional>\n#include <vector>\n\nnamespace kk2 {\n\ntemplate <class G> struct LowLink {\n int n, m;\n const G &g;\n std::vector<int> ord, low;\n std::vector<bool> root, used;\n\n LowLink(const G &g_)\n : n(g_.n),\n m(g_.m),\n g(g_),\n ord(n, -1),\n low(n, -1),\n root(n, false),\n used(m, false) {\n init();\n }\n\n private:\n void init() {\n int k = 0;\n auto dfs = [&](auto self, int u, int ei = -1) -> int {\n low[u] = ord[u] = k++;\n for (auto &e : g[u]) {\n if (e.id == ei) continue;\n if (ord[e.to] == -1) {\n used[e.id] = true;\n low[u] = std::min(low[u], self(self, e.to, e.id));\n }\n // back edge\n else if (ord[e.to] < ord[u]) {\n low[u] = std::min(low[u], ord[e.to]);\n }\n }\n return low[u];\n };\n for (int u = 0; u < n; u++)\n if (ord[u] == -1) {\n dfs(dfs, u);\n root[u] = true;\n }\n }\n};\n\n} // namespace kk2\n\n#endif // GRAPH_LOWLINK_HPP\n\n#ifndef GRAPH_TWO_EDGE_CONNECTED_COMPONENTS_HPP\n#define GRAPH_TWO_EDGE_CONNECTED_COMPONENTS_HPP 1\n\n#include <vector>\n\n\nnamespace kk2 {\n\ntemplate <class G> struct TwoEdgeConnectedComponents : LowLink<G> {\n TwoEdgeConnectedComponents(const G &g_) : LowLink<G>(g_) { init_tecc(); }\n\n std::vector<int> comp;\n std::vector<std::vector<int>> group;\n G forest;\n\n private:\n // v is a child of u in DFS tree\n // edge(u, v) is a bridge <=> ord[u] < low[v]\n void init_tecc() {\n comp.resize(this->n, -1);\n int k = 0;\n std::vector<typename G::edge_type> bridges;\n auto dfs = [&](auto self, int now, int par, int ei) -> void {\n if (par != -1 && this->ord[par] >= this->low[now]) comp[now] = comp[par];\n else {\n comp[now] = k++;\n if (par != -1) bridges.emplace_back((this->g).edges[ei]);\n }\n for (auto &&e : this->g[now]) {\n if (comp[e.to] == -1) self(self, e.to, now, e.id);\n }\n };\n for (int i = 0; i < this->n; i++) {\n if (this->root[i]) dfs(dfs, i, -1, -1);\n }\n group.resize(k);\n for (int i = 0; i < this->n; i++) { group[comp[i]].emplace_back(i); }\n for (auto &&e : bridges) {\n e.from = comp[e.from];\n e.to = comp[e.to];\n }\n forest = G(k, bridges, this->g.oneindexed);\n }\n};\n\n} // namespace kk2\n\n#endif // GRAPH_TWO_EDGE_CONNECTED_COMPONENTS_HPP\n\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int n, m;\n cin >> n >> m;\n vc<int> v(n);\n rep (i, n) cin >> v[i];\n\n kk2::Graph<false, false> g(n, m, true);\n kk2::TwoEdgeConnectedComponents<kk2::Graph<false, false>> tecc(g);\n\n int k = tecc.forest.size();\n kk2::Graph<false, false> aux = tecc.forest;\n vc<int> newv(k);\n rep (i, n) newv[tecc.comp[i]] += v[i];\n\n vc<int> dist(k);\n auto dfs = [&](auto self, int now, int par) -> void {\n // cout << now << \" \" << par << endl;\n for (auto &&e : aux[now]) {\n if (e.to == par) continue;\n dist[e.to] = dist[now] + newv[e.to];\n self(self, e.to, now);\n }\n };\n dist[0] = newv[0];\n dfs(dfs, 0, -1);\n int nextroot = max_element(all(dist)) - dist.begin();\n dist[nextroot] = newv[nextroot];\n dfs(dfs, nextroot, -1);\n cout << *max_element(all(dist)) << endl;\n\n return 0;\n}\n\n// converted!!", "accuracy": 1, "time_ms": 30, "memory_kb": 41592, "score_of_the_acc": -1.0213, "final_rank": 16 }, { "submission_id": "aoj_0415_9628266", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug_print.hpp>\n#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define debug(...) (static_cast<void>(0))\n#endif\n\nstruct LowLink {\n int N;\n // articulation: 関節点, bridge: 橋\n vector<int> order, low, articulation;\n vector<pair<int, int>> bridge;\n LowLink(const vector<vector<int>>& G) : N(G.size()), order(N, -1), low(N, -1) {\n for (int i = 0; i < N; i++) {\n if (order[i] == -1) dfs(G, i, -1, 0);\n }\n };\n\n void dfs(const vector<vector<int>>& G, int pos, int parlent, int time) {\n order[pos] = low[pos] = time++;\n int child_cnt = 0;\n bool is_articulation = false, second = false;\n for (auto to : G[pos]) {\n if (order[to] == -1) {\n // to が未訪問の場合\n child_cnt++;\n dfs(G, to, pos, time);\n low[pos] = min(low[pos], low[to]);\n // order[pos] < low[to] ならば橋\n if (order[pos] < low[to]) bridge.emplace_back(minmax(pos, to));\n // 根以外で, order[pos] <= low[to] ならば関節点\n is_articulation |= parlent != -1 && order[pos] <= low[to];\n } else if (to != parlent || second) {\n // (pos, to) が後退辺 or 多重辺(後退辺)の場合\n low[pos] = min(low[pos], order[to]);\n } else {\n // to が 親の場合, もう一度 to を訪問したら (pos, to) は多重辺\n second = true;\n }\n }\n // 根かつ, 子が 2 つ以上ならば関節点\n is_articulation |= parlent == -1 && child_cnt > 1;\n if (is_articulation) articulation.emplace_back(pos);\n };\n};\n\nstruct TwoEdgeConnectedComponents {\n LowLink lowlink;\n vector<int> comp; // 頂点[i] が属する 2 重辺連結成分の番号\n vector<vector<int>> groups, tree;\n int id;\n TwoEdgeConnectedComponents(const vector<vector<int>>& G) : lowlink(G), comp(G.size(), -1), id(0) {\n for (int i = 0; i < (int)G.size(); i++) {\n if (comp[i] == -1) dfs(G, i, -1);\n }\n groups.resize(id), tree.resize(id);\n for (int i = 0; i < (int)G.size(); i++) {\n groups[comp[i]].emplace_back(i);\n }\n for (auto [u, v] : lowlink.bridge) {\n tree[comp[u]].emplace_back(comp[v]);\n tree[comp[v]].emplace_back(comp[u]);\n }\n };\n\n void dfs(const vector<vector<int>>& G, int pos, int parlent) {\n if (parlent != -1 && lowlink.order[parlent] >= lowlink.low[pos]) {\n // 根でないかつ, (pos, parlent) が橋でない場合\n comp[pos] = comp[parlent];\n } else {\n // 根または, (pos, parlent) が橋の場合, 新しい２重辺連結成分を作る\n comp[pos] = id++;\n }\n for (auto to : G[pos]) {\n if (comp[to] != -1) continue;\n dfs(G, to, pos);\n }\n }\n};\n\nconst int INF = (1 << 30) - 1;\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N, M;\n cin >> N >> M;\n vector<int> V(N);\n for (int i = 0; i < N; i++) cin >> V[i];\n vector<vector<int>> G(N);\n for (int i = 0; i < M; i++) {\n int s, t; cin >> s >> t, s--, t--;\n G[s].emplace_back(t);\n G[t].emplace_back(s);\n }\n\n TwoEdgeConnectedComponents tecc(G);\n // 各 2 重辺連結成分の V の総和\n vector<int> sum(tecc.groups.size());\n for (int i = 0; i < N; i++) {\n sum[tecc.comp[i]] += V[i];\n }\n\n // 二重頂点連結成分を縮約した木を作り, 直径の長さを求める\n auto G2 = tecc.tree;\n vector<int> dist(G2.size(), -1);\n queue<int> que;\n dist[0] = sum[0];\n que.emplace(0);\n while (!que.empty()) {\n int pos = que.front(); que.pop();\n for (auto to: G2[pos]) {\n if (dist[to] != -1) continue;\n dist[to] = dist[pos] + sum[to];\n que.emplace(to);\n }\n }\n int max_pos = max_element(dist.begin(), dist.end()) - dist.begin();\n dist.assign(G2.size(), -1);\n dist[max_pos] = sum[max_pos];\n que.emplace(max_pos);\n while (!que.empty()) {\n int pos = que.front(); que.pop();\n for (auto to: G2[pos]) {\n if (dist[to] != -1) continue;\n dist[to] = dist[pos] + sum[to];\n que.emplace(to);\n }\n }\n cout << *max_element(dist.begin(), dist.end()) << '\\n';\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 40936, "score_of_the_acc": -0.9905, "final_rank": 15 }, { "submission_id": "aoj_0415_9584881", "code_snippet": "#include <bits/stdc++.h>\n\n\n\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n\n\nnamespace zawa {\n\nvoid SetFastIO() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n}\n\nvoid SetPrecision(u32 dig) {\n std::cout << std::fixed << std::setprecision(dig);\n}\n\n} // namespace zawa\n\n\n\nnamespace zawa {\n\nclass LowlinkResponse {\npublic:\n LowlinkResponse() = default;\n\n LowlinkResponse(const std::vector<u32>& articulation, const std::vector<bool>& bridge)\n : articulation_{articulation}, bridge_{bridge} {}\n\n inline bool isArticulation(u32 v) const {\n assert(v < articulation_.size());\n return articulation_[v] > 1u;\n }\n\n inline u32 cut(u32 v) const {\n assert(v < articulation_.size());\n return articulation_[v];\n }\n\n inline bool isBridge(u32 i) const {\n assert(i < bridge_.size());\n return bridge_[i];\n }\n\nprivate:\n std::vector<u32> articulation_;\n std::vector<bool> bridge_;\n};\n\nclass Lowlink {\nprivate:\n static constexpr u32 INVALID{static_cast<u32>(-1)};\n usize n_{}, m_{};\n std::vector<std::vector<std::pair<u32, u32>>> g_;\n std::vector<std::pair<u32, u32>> e_;\n\n void dfs(u32 v, u32 p, u32& t, std::vector<u32>& articulation, \n std::vector<bool>& bridge, std::vector<u32>& in, std::vector<u32>& low) const {\n low[v] = in[v] = t++;\n u32 deg{}; \n for (const auto& [x, i] : g_[v]) {\n if (in[x] == INVALID) {\n deg++;\n dfs(x, v, t, articulation, bridge, in, low);\n low[v] = std::min(low[v], low[x]);\n if (p != INVALID and low[x] >= in[v]) {\n articulation[v]++;\n }\n if (low[x] > in[v]) {\n bridge[i] = true;\n }\n }\n else if (x != p) {\n low[v] = std::min(low[v], in[x]);\n }\n }\n if (p == INVALID) {\n articulation[v] = deg;\n }\n }\n\npublic:\n constexpr usize size() const noexcept {\n return n_;\n }\n\n constexpr usize edgeSize() const noexcept {\n return m_;\n }\n\n Lowlink() = default;\n\n Lowlink(usize n) \n : n_{n}, m_{}, g_(n) {\n g_.shrink_to_fit();\n }\n \n usize addEdge(u32 u, u32 v) {\n usize res{m_++};\n e_.emplace_back(u, v);\n g_[u].emplace_back(v, res);\n g_[v].emplace_back(u, res);\n return res;\n }\n\n const std::vector<std::pair<u32, u32>>& operator[](u32 v) const noexcept {\n assert(v < size());\n return g_[v];\n }\n const std::pair<u32, u32>& edge(u32 i) const noexcept {\n assert(i < edgeSize());\n return e_[i];\n }\n\n LowlinkResponse build() const {\n u32 t{};\n std::vector<u32> articulation(size(), 1u), in(size(), INVALID), low(size());\n std::vector<bool> bridge(edgeSize());\n for (u32 v{} ; v < size() ; v++) if (in[v] == INVALID) {\n dfs(v, INVALID, t, articulation, bridge, in, low);\n }\n return LowlinkResponse{ articulation, bridge };\n }\n\n};\n\n} // namespace zawa\nusing namespace zawa;\n\nint main() {\n SetFastIO();\n\n int N, M;\n std::cin >> N >> M;\n Lowlink low(N);\n std::vector<std::vector<std::pair<int, int>>> g(N);\n std::vector<int> V(N);\n std::vector<std::pair<int, int>> E(M);\n for (auto& v : V) std::cin >> v;\n for (int i{} ; i < M ; i++) {\n int s, t;\n std::cin >> s >> t;\n s--; t--;\n low.addEdge(s, t);\n g[s].push_back(std::pair(t, i));\n g[t].push_back(std::pair(s, i));\n E[i] = std::pair{ s, t };\n }\n auto brg{low.build()};\n std::vector<int> val;\n std::vector<std::vector<int>> g2;\n std::vector<int> col(N, -1);\n auto dfs{[&](auto dfs, int v, int& sum, int c) -> void {\n col[v] = c;\n sum += V[v];\n for (auto [x, i] : g[v]) if (!brg.isBridge(i) and col[x] == -1) {\n dfs(dfs, x, sum, c);\n }\n }};\n for (int i{} ; i < N ; i++) if (col[i] == -1) {\n int sum{};\n dfs(dfs, i, sum, (int)g2.size());\n g2.push_back(std::vector<int>{});\n val.push_back(sum);\n }\n for (auto [s, t] : E) {\n if (col[s] != col[t]) {\n g2[col[s]].push_back(col[t]);\n g2[col[t]].push_back(col[s]);\n }\n }\n for (int i{} ; i < (int)g2.size() ; i++) {\n std::sort(g2[i].begin(), g2[i].end());\n g2[i].erase(std::unique(g2[i].begin(), g2[i].end()), g2[i].end());\n }\n std::vector<int> d1(g2.size(), -1);\n d1[0] = val[0];\n std::queue<int> que;\n que.push(0);\n while (que.size()) {\n int v{que.front()};\n que.pop();\n for (auto x : g2[v]) if (d1[x] == -1) {\n d1[x] = d1[v] + val[x];\n que.push(x);\n }\n }\n int p{(int)std::distance(d1.begin(), std::max_element(d1.begin(), d1.end()))};\n std::vector<int> d2(g2.size(), -1);\n d2[p] = val[p];\n que.push(p);\n while (que.size()) {\n int v{que.front()};\n que.pop();\n for (auto x : g2[v]) if (d2[x] == -1) {\n d2[x] = d2[v] + val[x];\n que.push(x);\n }\n }\n std::cout << *std::max_element(d2.begin(), d2.end()) << '\\n';\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 35708, "score_of_the_acc": -0.7451, "final_rank": 8 }, { "submission_id": "aoj_0415_9571967", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct unionfind {\n\tlong long n;\n\tvector<long long> p,s;\n\tunionfind(long long n) : n(n) {\n\t\tp.resize(n,-1ll);\n\t\ts.resize(n,1ll);\n\t}\n\tlong long root(long long x){\n\t\twhile(p[x] != -1ll){\n\t\t\tx = p[x];\n\t\t}\n\t\treturn x;\n\t}\n\tvoid merge(long long u,long long v){\n\t\tlong long ru = root(u),rv = root(v);\n\t\tif(ru == rv) return;\n\t\tif(s[ru] < s[rv]){\n\t\t\tp[ru] = rv;\n\t\t\ts[rv] += s[ru];\n\t\t}else{\n\t\t\tp[rv] = ru;\n\t\t\ts[ru] += s[rv];\n\t\t}\n\t}\n\tbool same(long long u,long long v){\n\t\treturn root(u) == root(v);\n\t}\n};\nint main()\n{\n\tlong long n,m;\n\tcin >> n >> m;\n\tvector<vector<long long>> g(n,vector<long long>());\n\tvector<long long> a(n);\n\tfor(long long i = 0ll;i < n;i++){\n\t\tcin >> a[i];\n\t}\n\tfor(long long i = 0ll;i < m;i++){\n\t\tlong long u,v;\n\t\tcin >> u >> v;\n\t\tu--;v--;\n\t\tg[u].push_back(v);\n\t\tg[v].push_back(u);\n\t}\n\tvector<vector<long long>> tr;\n\tvector<long long> cou;\n\t{\n\t\tvector<pair<long long,long long>> t(n,{-1ll,LLONG_MAX});\n\t\tlong long now = 0ll;\n\t\tauto dfs = [&](auto dfs,long long x,long long l) -> void {\n\t\t\tt[x].first = now;\n\t\t\tnow++;\n\t\t\tif(!g[x].empty()){\n\t\t\t\tfor(long long i : g[x]){\n\t\t\t\t\tif(i == l) continue;\n\t\t\t\t\tif(t[i].first != -1ll){\n\t\t\t\t\t\tt[x].second = min(t[x].second,t[i].first);\n\t\t\t\t\t}else{\n\t\t\t\t\t\tdfs(dfs,i,x);\n\t\t\t\t\t\tt[x].second = min(t[x].second,t[i].second);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t};\n\t\tdfs(dfs,0ll,-1ll);\n\t\tvector<vector<long long>> nex(n,vector<long long>());\n\t\tunionfind uf(n);\n\t\tfor(long long i = 0ll;i < n;i++){\n\t\t\tif(g[i].empty()) continue;\n\t\t\tfor(long long j : g[i]){\n\t\t\t\tif(t[i].first > t[j].first) continue;\n\t\t\t\tif(t[i].first >= t[j].second){\n\t\t\t\t\tnex[i].push_back(j);\n\t\t\t\t\tnex[j].push_back(i);\n\t\t\t\t\tuf.merge(i,j);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tset<long long> s;\n\t\tfor(long long i = 0ll;i < n;i++){\n\t\t\ts.insert(uf.root(i));\n\t\t}\n\t\tmap<long long,long long> x;\n\t\tnow = 0ll;\n\t\tfor(auto itr = s.begin();itr != s.end();itr++){\n\t\t\tx[*itr] = now;\n\t\t\tnow++;\n\t\t}\n\t\ttr.resize(s.size(),{});\n\t\tcou.resize(s.size(),0ll);\n\t\tfor(long long i = 0ll;i < n;i++){\n\t\t\tif(g[i].empty()) continue;\n\t\t\tfor(long long j : g[i]){\n\t\t\t\tif(t[i].first > t[j].first) continue;\n\t\t\t\tif(t[i].first < t[j].second){\n\t\t\t\t\ttr[x[uf.root(i)]].push_back(x[uf.root(j)]);\n\t\t\t\t\ttr[x[uf.root(j)]].push_back(x[uf.root(i)]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tcou[x[uf.root(i)]] += a[i];\n\t\t}\n\t}\n\tlong long ans = 0ll;\n\tpair<long long,long long> ma(-1ll,-1ll);\n\t{\n\t\tvector<long long> dist(n,-1ll);\n\t\tqueue<long long> q;\n\t\tdist[0ll] = cou[0ll];\n\t\tq.push(0ll);\n\t\twhile(!q.empty()){\n\t\t\tlong long it = q.front();\n\t\t\tq.pop();\n\t\t\tif(dist[it] > ma.first){\n\t\t\t\tma.first = dist[it];\n\t\t\t\tma.second = it;\n\t\t\t}\n\t\t\tfor(long long i : tr[it]){\n\t\t\t\tif(dist[i] != -1ll) continue;\n\t\t\t\tdist[i] = dist[it] + cou[i];\n\t\t\t\tq.push(i);\n\t\t\t}\n\t\t}\n\t}\n\t{\n\t\tvector<long long> dist(n,-1ll);\n\t\tqueue<long long> q;\n\t\tdist[ma.second] = cou[ma.second];\n\t\tq.push(ma.second);\n\t\tma = {-1ll,-1ll};\n\t\twhile(!q.empty()){\n\t\t\tlong long it = q.front();\n\t\t\tq.pop();\n\t\t\tif(dist[it] > ma.first){\n\t\t\t\tma.first = dist[it];\n\t\t\t\tma.second = it;\n\t\t\t}\n\t\t\tfor(long long i : tr[it]){\n\t\t\t\tif(dist[i] != -1ll) continue;\n\t\t\t\tdist[i] = dist[it] + cou[i];\n\t\t\t\tq.push(i);\n\t\t\t}\n\t\t}\n\t}\n\tcout << ma.first << endl;\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 42868, "score_of_the_acc": -1.9146, "final_rank": 19 }, { "submission_id": "aoj_0415_9022658", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n\n#include <algorithm>\n#include <cassert>\n#include <vector>\n\nnamespace atcoder {\n\nstruct dsu {\n public:\n dsu() : _n(0) {}\n explicit dsu(int n) : _n(n), parent_or_size(n, -1) {}\n\n int merge(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n int x = leader(a), y = leader(b);\n if (x == y) return x;\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\n parent_or_size[x] += parent_or_size[y];\n parent_or_size[y] = x;\n return x;\n }\n\n bool same(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n return leader(a) == leader(b);\n }\n\n int leader(int a) {\n assert(0 <= a && a < _n);\n if (parent_or_size[a] < 0) return a;\n return parent_or_size[a] = leader(parent_or_size[a]);\n }\n\n int size(int a) {\n assert(0 <= a && a < _n);\n return -parent_or_size[leader(a)];\n }\n\n std::vector<std::vector<int>> groups() {\n std::vector<int> leader_buf(_n), group_size(_n);\n for (int i = 0; i < _n; i++) {\n leader_buf[i] = leader(i);\n group_size[leader_buf[i]]++;\n }\n std::vector<std::vector<int>> result(_n);\n for (int i = 0; i < _n; i++) {\n result[i].reserve(group_size[i]);\n }\n for (int i = 0; i < _n; i++) {\n result[leader_buf[i]].push_back(i);\n }\n result.erase(\n std::remove_if(result.begin(), result.end(),\n [&](const std::vector<int>& v) { return v.empty(); }),\n result.end());\n return result;\n }\n\n private:\n int _n;\n std::vector<int> parent_or_size;\n};\n\n} // namespace atcoder\n\nusing namespace atcoder;\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector<int> v(N);\n vector<vector<int>> G(N);\n for(int i = 0; i < N; i++) {\n cin >> v[i];\n }\n for(int i = 0; i < M; i++) {\n int s, t;\n cin >> s >> t;\n s--, t--;\n G[s].push_back(t);\n G[t].push_back(s);\n }\n dsu uf(N);\n { // lowlink begin\n int tim = 0;\n vector<int> ord(N), low(N);\n vector<bool> vis(N);\n auto dfs = [&](auto dfs, int cur, int par) -> void {\n vis[cur] = true;\n ord[cur] = tim++;\n low[cur] = ord[cur];\n for(const int &nxt : G[cur]) {\n if(!vis[nxt]) {\n dfs(dfs, nxt, cur);\n low[cur] = min(low[cur], low[nxt]);\n if(ord[cur] >= low[nxt]) uf.merge(cur, nxt);\n }else if(nxt != par) {\n low[cur] = min(low[cur], ord[nxt]);\n }\n }\n };\n dfs(dfs, 0, -1);\n } // lowlink end\n { // contraction begin\n for(vector<int> group : uf.groups()) {\n int ld = uf.leader(group.front());\n for(int mem : group) {\n if(mem == ld) continue;\n v[ld] += v[mem];\n G[ld].insert(G[ld].end(), G[mem].begin(), G[mem].end());\n v[mem] = 0;\n G[mem].clear();\n }\n for(int &nxt : G[ld]) {\n nxt = uf.leader(nxt);\n }\n sort(G[ld].begin(), G[ld].end());\n G[ld].erase(unique(G[ld].begin(), G[ld].end()), G[ld].end());\n }\n } // contraction end\n dsu uf_gc(N);\n for(int i = 0; i < N; i++) {\n for(const int &nxt : G[i]) {\n uf_gc.merge(i, nxt);\n }\n }\n int ans = 0;\n { // calc diameter begin\n vector<int> dp(N);\n vector<bool> vis(N);\n auto dfs = [&](auto dfs, int cur) -> void {\n vis[cur] = true;\n for(const int &nxt : G[cur]) {\n if(!vis[nxt]) {\n dp[nxt] = dp[cur]+v[nxt];\n dfs(dfs, nxt);\n }\n }\n };\n for(vector<int> group : uf_gc.groups()) {\n int ld = uf_gc.leader(group.front());\n dp[ld] = v[ld];\n dfs(dfs, ld);\n for(int mem : group) {\n if(dp[mem] > dp[ld]) ld = mem;\n }\n for(int mem : group) {\n dp[mem] = 0;\n vis[mem] = false;\n }\n dp[ld] = v[ld];\n dfs(dfs, ld);\n for(int mem : group) {\n ans = max(ans, dp[mem]);\n }\n }\n } // calc diameter end\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 37220, "score_of_the_acc": -1.0661, "final_rank": 17 }, { "submission_id": "aoj_0415_8717679", "code_snippet": "#include <bits/stdc++.h>\n\nstruct UnionFind {\n std::vector<int> data;\n UnionFind(int n): data(n, -1) {}\n int leader(int x) {\n if (data[x] < 0) return x;\n return data[x] = leader(data[x]);\n }\n bool merge(int lhs, int rhs) {\n lhs = leader(lhs);\n rhs = leader(rhs);\n if (lhs == rhs) return false;\n if (data[lhs] < data[rhs]) std::swap(lhs, rhs);\n data[rhs] += data[lhs];\n data[lhs] = rhs;\n return true;\n }\n bool same(int lhs, int rhs) {\n return leader(lhs) == leader(rhs);\n }\n std::vector<std::vector<int>> groups() {\n std::vector<std::vector<int>> res(data.size());\n for (int i = 0; i < (int)data.size(); i++) {\n res[leader(i)].push_back(i);\n }\n auto it = std::remove_if(res.begin(), res.end(), [](const std::vector<int>& vec) { return vec.empty(); });\n res.erase(it, res.end());\n return res;\n }\n};\n\nint main() {\n int n, m;\n std::cin >> n >> m;\n std::vector<int> vs(n);\n for (int i = 0; i < n; i++) std::cin >> vs[i];\n std::vector<std::vector<int>> graph(n);\n for (int i = 0; i < m; i++) {\n int u, v;\n std::cin >> u >> v;\n u--; v--;\n graph[u].push_back(v);\n graph[v].push_back(u);\n }\n UnionFind uf(n);\n {\n std::vector<int> in(n, -1);\n std::vector<int> low(n, -1);\n int now = 0;\n auto dfs = [&](auto self, int u, int p) -> void {\n low[u] = in[u] = now++;\n for (auto v: graph[u]) {\n if (v == p) continue;\n if (low[v] == -1) {\n self(self, v, u);\n low[u] = std::min(low[u], low[v]);\n } else {\n low[u] = std::min(low[u], in[v]);\n }\n }\n if (p != -1 && low[u] <= in[p]) {\n uf.merge(u, p);\n }\n };\n dfs(dfs, 0, -1);\n }\n std::vector<int> nodes(n);\n std::vector<std::vector<int>> tree(n);\n for (int i = 0; i < n; i++) {\n nodes[uf.leader(i)] += vs[i];\n }\n for (int u = 0; u < n; u++) {\n for (auto v: graph[u]) {\n if (uf.same(u, v)) continue;\n tree[uf.leader(u)].push_back(uf.leader(v));\n }\n }\n const int root = uf.leader(0);\n int ans = 0;\n auto calc = [&](auto self, int u, int p) -> int {\n std::vector<int> res;\n for (auto v: tree[u]) {\n if (v == p) continue;\n res.push_back(self(self, v, u));\n }\n std::sort(res.begin(), res.end(), std::greater<int>());\n if (res.size() >= 2) {\n ans = std::max(ans, nodes[u] + res[0] + res[1]);\n return nodes[u] + res[0];\n } else if (res.size() >= 1) {\n ans = std::max(ans, nodes[u] + res[0]);\n return nodes[u] + res[0];\n } else {\n ans = std::max(ans, nodes[u]);\n return nodes[u];\n }\n };\n calc(calc, root, -1);\n std::cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 30748, "score_of_the_acc": -0.7622, "final_rank": 9 }, { "submission_id": "aoj_0415_8717601", "code_snippet": "#include <bits/stdc++.h>\n\nstruct UnionFind {\n std::vector<int> data;\n UnionFind(int n): data(n, -1) {}\n int leader(int x) {\n if (data[x] < 0) return x;\n return data[x] = leader(data[x]);\n }\n bool merge(int lhs, int rhs) {\n lhs = leader(lhs);\n rhs = leader(rhs);\n if (lhs == rhs) return false;\n if (data[lhs] < data[rhs]) std::swap(lhs, rhs);\n data[rhs] += data[lhs];\n data[lhs] = rhs;\n return true;\n }\n bool same(int lhs, int rhs) {\n return leader(lhs) == leader(rhs);\n }\n std::vector<std::vector<int>> groups() {\n std::vector<std::vector<int>> res(data.size());\n for (int i = 0; i < (int)data.size(); i++) {\n res[leader(i)].push_back(i);\n }\n auto it = std::remove_if(res.begin(), res.end(), [](const std::vector<int>& vec) { return vec.empty(); });\n res.erase(it, res.end());\n return res;\n }\n};\n\nint main() {\n int n, m;\n std::cin >> n >> m;\n std::vector<int> vs(n);\n for (int i = 0; i < n; i++) std::cin >> vs[i];\n std::vector<std::vector<int>> graph(n);\n for (int i = 0; i < m; i++) {\n int u, v;\n std::cin >> u >> v;\n u--; v--;\n graph[u].push_back(v);\n graph[v].push_back(u);\n }\n UnionFind uf(n);\n {\n std::vector<int> in(n, -1);\n std::vector<int> low(n, -1);\n int now = 0;\n auto dfs = [&](auto self, int u, int p) -> void {\n low[u] = in[u] = now++;\n for (auto v: graph[u]) {\n if (v == p) continue;\n if (low[v] == -1) {\n self(self, v, u);\n low[u] = std::min(low[u], low[v]);\n } else {\n low[u] = std::min(low[u], in[v]);\n }\n }\n if (p != -1 && low[u] <= in[p]) {\n uf.merge(u, p);\n }\n };\n dfs(dfs, 0, -1);\n }\n std::vector<int> nodes(n);\n std::vector<std::vector<int>> tree(n);\n for (int i = 0; i < n; i++) {\n nodes[uf.leader(i)] += vs[i];\n }\n for (int u = 0; u < n; u++) {\n for (auto v: graph[u]) {\n if (uf.same(u, v)) continue;\n tree[uf.leader(u)].push_back(uf.leader(v));\n }\n }\n for (int i = 0; i < n; i++) {\n std::sort(tree[i].begin(), tree[i].end());\n tree[i].erase(std::unique(tree[i].begin(), tree[i].end()), tree[i].end());\n }\n const int root = uf.leader(0);\n int ans = 0;\n auto calc = [&](auto self, int u, int p) -> int {\n std::vector<int> res;\n for (auto v: tree[u]) {\n if (v == p) continue;\n res.push_back(self(self, v, u));\n }\n std::sort(res.begin(), res.end(), std::greater<int>());\n if (res.size() >= 2) {\n ans = std::max(ans, nodes[u] + res[0] + res[1]);\n return nodes[u] + res[0];\n } else if (res.size() >= 1) {\n ans = std::max(ans, nodes[u] + res[0]);\n return nodes[u] + res[0];\n } else {\n ans = std::max(ans, nodes[u]);\n return nodes[u];\n }\n };\n calc(calc, root, -1);\n std::cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 30848, "score_of_the_acc": -0.7669, "final_rank": 10 }, { "submission_id": "aoj_0415_8717497", "code_snippet": "#include <bits/stdc++.h>\n\nstruct Edge {\n Edge(int f, int t, int i): from(f), to(t), id(i) {}\n int from;\n int to;\n int id;\n};\n\nstd::vector<int> bridge(const std::vector<std::vector<Edge>>& graph) {\n int n = graph.size();\n std::vector<int> in(n, -1);\n std::vector<int> low(n, -1);\n int now = 0;\n std::vector<int> res;\n auto dfs = [&](auto self, int u, int p) -> void {\n in[u] = now++;\n low[u] = in[u];\n for (auto e: graph[u]) {\n if (e.to == p) continue;\n if (low[e.to] == -1) {\n self(self, e.to, u);\n low[u] = std::min(low[u], low[e.to]);\n if (in[u] < low[e.to]) {\n res.push_back(e.id);\n }\n } else {\n low[u] = std::min(low[u], in[e.to]);\n }\n }\n };\n dfs(dfs, 0, -1);\n return res;\n}\n\nbool is_tree(const std::vector<std::vector<Edge>>& graph) {\n int n = graph.size();\n std::vector<bool> already(n);\n auto dfs = [&](auto self, int u, int p) -> bool {\n already[u] = true;\n for (auto e: graph[u]) {\n if (e.to == p) continue;\n if (already[e.to]) {\n return false;\n } else {\n if (!self(self, e.to, u)) return false;\n }\n }\n return true;\n };\n return dfs(dfs, 0, -1);\n}\n\nint main() {\n int n, m;\n std::cin >> n >> m;\n std::vector<int> value(n);\n for (int i = 0; i < n; i++) std::cin >> value[i];\n std::vector<std::vector<Edge>> graph(n);\n std::vector<Edge> edges;\n for (int i = 0; i < m; i++) {\n int u, v;\n std::cin >> u >> v;\n u--; v--;\n graph[u].emplace_back(u, v, i);\n graph[v].emplace_back(v, u, i);\n edges.emplace_back(u, v, i);\n }\n std::vector<bool> is_bridge(m, false);\n for (int id: bridge(graph)) {\n is_bridge[id] = true;\n }\n\n int group_num = 0;\n std::vector<int> group_id(n, -1);\n auto dfs = [&](auto self, int u, int color) -> void {\n assert(group_id[u] == -1);\n group_id[u] = color;\n for (auto e: graph[u]) {\n if (is_bridge[e.id]) continue;\n if (group_id[e.to] == -1) {\n self(self, e.to, color);\n } else {\n assert(group_id[e.to] == color);\n }\n }\n };\n for (int i = 0; i < n; i++) {\n if (group_id[i] == -1) {\n dfs(dfs, i, group_num++);\n }\n }\n std::vector<int> group_value(group_num);\n for (int i = 0; i < n; i++) {\n group_value[group_id[i]] += value[i];\n }\n std::vector<std::vector<Edge>> tree(group_num);\n for (auto [u, v, i]: edges) {\n if (is_bridge[i]) {\n assert(group_id[u] != group_id[v]);\n tree[group_id[u]].emplace_back(group_id[u], group_id[v], -1);\n tree[group_id[v]].emplace_back(group_id[v], group_id[u], -1);\n }\n }\n assert(is_tree(tree));\n int ans = 0;\n auto calc = [&](auto self, int u, int p) -> int {\n std::vector<int> res;\n for (auto e: tree[u]) {\n if (e.to == p) continue;\n res.push_back(self(self, e.to, u));\n }\n int cur = group_value[u];\n std::sort(res.begin(), res.end(), std::greater<int>());\n for (int i = 0; i < std::min((int)res.size(), 2); i++) {\n cur += res[i];\n }\n ans = std::max(ans, cur);\n if (res.size() == 0) return group_value[u];\n return group_value[u] + res.front();\n };\n calc(calc, 0, -1);\n std::cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 31968, "score_of_the_acc": -0.8195, "final_rank": 12 }, { "submission_id": "aoj_0415_7195749", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,a,b) for(int i=a;i<b;i++)\nusing ll = long long;\ntemplate<class T> bool chmin(T &a,const T b){if(a>b){a=b;return 1;}return 0;}\ntemplate<class T> bool chmax(T &a,const T b){if(a<b){a=b;return 1;}return 0;}\nconst int INF = (1<<30)-1;\n#define all(p) p.begin(),p.end()\n\nint main(){\n\tint N,M;\n cin>>N>>M;\n vector<int> V(N);\n rep(i,0,N) cin>>V[i];\n vector<vector<int>> G(N);\n rep(i,0,M){\n int a,b;\n cin>>a>>b;\n a--,b--;\n G[a].push_back(b);\n G[b].push_back(a);\n }\n vector<int> pare(N,-1);\n pare[0]=-2;\n vector<int> dp(N),deep(N);\n auto dfs=[&](auto self,int ind)->void{\n for(auto x:G[ind]){\n if(pare[x]==-1){\n pare[x]=ind;\n deep[x]=deep[ind]+1;\n self(self,x);\n }\n else if(pare[ind]!=x&&deep[x]<deep[ind]){\n dp[ind]++;\n dp[x]--;\n }\n }\n if(pare[ind]!=-2) dp[pare[ind]]+=dp[ind];\n };\n dfs(dfs,0);\n //rep(i,0,N) cout<<i<<\" \"<<dp[i]<<endl;\n vector<vector<int>> H;\n vector<int> n_V;\n vector<int> seen(N,-1);\n int L=0;\n rep(i,0,N){\n if(seen[i]!=-1) continue;\n seen[i]=L;\n n_V.push_back(0);\n vector<int> order={i};\n rep(j,0,(int)(order.size())){\n int a=order[j];\n n_V[L]+=V[a];\n for(auto x:G[a]){\n if(seen[x]!=-1) continue;\n if(pare[a]==x&&dp[a]==0) continue;\n if(pare[x]==a&&dp[x]==0) continue;\n seen[x]=seen[a];\n order.push_back(x);\n }\n }\n L++;\n }\n H.resize(L,{});\n rep(i,0,N){\n for(auto x:G[i]){\n if(seen[x]!=seen[i]) H[seen[x]].push_back(seen[i]);\n }\n }\n pare[0]=-2;\n vector<int> order={0};\n rep(i,1,L) pare[i]=-1;\n rep(i,0,L){\n int a=order[i];\n for(auto x:H[a]){\n if(pare[x]==-1){\n pare[x]=a;\n order.push_back(x);\n }\n }\n }\n vector<int> A(L),B(L);\n int ans=0;\n reverse(all(order));\n rep(i,0,L){\n int a=order[i];\n for(auto x:H[a]){\n if(pare[a]==x) continue;\n if(chmax(B[a],A[x])){\n if(A[a]<B[a]) swap(A[a],B[a]);\n }\n }\n //cout<<a<<\" \"<<A[a]<<\" \"<<B[a]<<\" \"<<n_V[a]<<endl;\n A[a]+=n_V[a];\n chmax(ans,A[a]+B[a]);\n }\n cout<<ans<<\"\\n\";\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 26888, "score_of_the_acc": -0.4977, "final_rank": 4 }, { "submission_id": "aoj_0415_6976959", "code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 0415.cc: Dungeion 3\n */\n\n#include<cstdio>\n#include<vector>\n#include<stack>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\n\n/* typedef */\n\ntypedef vector<int> vi;\ntypedef vector<bool> vb;\ntypedef vector<vi> vvi;\ntypedef pair<int,int> pii;\ntypedef vector<pii> vpii;\ntypedef stack<int> si;\n\n/* global variables */\n\nint vs[MAX_N], gvs[MAX_N], gids[MAX_N];\nvi nbrs[MAX_N], gnbrs[MAX_N];\nint ps[MAX_N], cis[MAX_N], xs0[MAX_N], xs1[MAX_N];\n\n/* subroutines */\n\nvoid bcc_visit(const vi *nbrs, int v, int u, vpii& brdg, vvi& tecomp,\n\t si& roots, si& S, vb& inS, vi& num, int& time) {\n num[v] = ++time;\n S.push(v); inS[v] = true;\n roots.push(v);\n\n const vi& nbrv = nbrs[v];\n for (vi::const_iterator vit = nbrv.begin(); vit != nbrv.end(); vit++) {\n const int& w = *vit;\n if (num[w] == 0)\n bcc_visit(nbrs, w, v, brdg, tecomp, roots, S, inS, num, time);\n else if (u != w && inS[w])\n while (num[roots.top()] > num[w]) roots.pop();\n }\n\n if (v == roots.top()) {\n brdg.push_back(pii(u, v));\n tecomp.push_back(vi());\n for (;;) {\n int w = S.top(); S.pop(); inS[w] = false;\n tecomp.back().push_back(w);\n if (v == w) break;\n }\n roots.pop();\n }\n}\n\nvoid calc_bcc(const int n, const vi *nbrs, vpii& brdg, vvi& tecomp) {\n vi num(n);\n vb inS(n);\n si roots, S;\n int time = 0;\n\n for (int u = 0; u < n; u++)\n if (num[u] == 0) {\n bcc_visit(nbrs, u, n, brdg, tecomp, roots, S, inS, num, time);\n brdg.pop_back();\n }\n}\n\n/* main */\n\nint main() {\n int n, m;\n scanf(\"%d%d\", &n, &m);\n for (int i = 0; i < n; i++) scanf(\"%d\", vs + i);\n\n for (int i = 0; i < m; i++) {\n int u, v;\n scanf(\"%d%d\", &u, &v);\n u--, v--;\n nbrs[u].push_back(v);\n nbrs[v].push_back(u);\n }\n\n vpii brdg;\n vvi tcmp;\n calc_bcc(n, nbrs, brdg, tcmp);\n int gn = tcmp.size();\n\n for (int i = 0; i < gn; i++) {\n //printf(\"%d:\", i);\n for (auto u: tcmp[i]) {\n gvs[i] += vs[u], gids[u] = i;\n //printf(\" %d\", u);\n }\n //printf(\" : gv=%d\\n\", gvs[i]);\n }\n\n for (auto e: brdg) {\n int u = gids[e.first], v = gids[e.second];\n if (u != v) {\n //printf(\"%d,%d\\n\", u, v);\n gnbrs[u].push_back(v);\n gnbrs[v].push_back(u);\n }\n }\n\n int maxd = 0;\n ps[0] = -1;\n for (int u = 0; u >= 0;) {\n vi &gnbru = gnbrs[u];\n int up = ps[u];\n\n if (cis[u] < gnbru.size()) {\n int v = gnbru[cis[u]++];\n if (v != up) {\n\tps[v] = u;\n\tu = v;\n }\n }\n else {\n xs0[u] += gvs[u];\n maxd = max(maxd, xs0[u] + xs1[u]);\n\n if (up >= 0) {\n\tif (xs0[up] < xs0[u]) xs1[up] = xs0[up], xs0[up] = xs0[u];\n\telse if (xs1[up] < xs0[u]) xs1[up] = xs0[u];\n }\n\n u = up;\n }\n }\n\n printf(\"%d\\n\", maxd);\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 38264, "score_of_the_acc": -0.8651, "final_rank": 13 }, { "submission_id": "aoj_0415_5853802", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for(long long i=0;i<(long long)(n);i++)\n#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)\n#define pb emplace_back\n#define lb(v,k) (lower_bound(all(v),(k))-v.begin())\n#define ub(v,k) (upper_bound(all(v),(k))-v.begin())\n#define fi first\n#define se second\n#define pi M_PI\n#define PQ(T) priority_queue<T>\n#define SPQ(T) priority_queue<T,vector<T>,greater<T>>\n#define dame(a) {out(a);return 0;}\n#define decimal cout<<fixed<<setprecision(15);\n#define all(a) a.begin(),a.end()\n#define rsort(a) {sort(all(a));reverse(all(a));}\n#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}\n#define popcnt __builtin_popcountll\ntypedef long long ll;\ntypedef pair<ll,ll> P;\ntypedef tuple<ll,ll,ll> PP;\ntypedef tuple<ll,ll,ll,ll> PPP;\nusing vi=vector<ll>;\nusing vvi=vector<vi>;\nusing vvvi=vector<vvi>;\nusing vvvvi=vector<vvvi>;\nusing vp=vector<P>;\nusing vvp=vector<vp>;\nusing vb=vector<bool>;\nusing vvb=vector<vb>;\nconst ll inf=1001001001001001001;\nconst ll INF=1001001001;\nconst ll mod=998244353;\nconst double eps=1e-10;\ntemplate<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}\ntemplate<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}\ntemplate<class T> void out(T a){cout<<a<<'\\n';}\ntemplate<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\\n';}\ntemplate<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\\n';}\ntemplate<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}\ntemplate<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\\n';}\ntemplate<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}\ntemplate<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}\ntemplate<class T> void yesno(T b){if(b)out(\"yes\");else out(\"no\");}\ntemplate<class T> void YesNo(T b){if(b)out(\"Yes\");else out(\"No\");}\ntemplate<class T> void YESNO(T b){if(b)out(\"YES\");else out(\"NO\");}\ntemplate<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\\n';}\nvoid outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}\nll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}\nll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}\n\nint main(){\n ll n,m;cin>>n>>m;\n vi v(n);rep(i,n)cin>>v[i];\n vvp g(n);\n rep(i,m){\n ll a,b;cin>>a>>b;a--;b--;\n g[a].pb(b,i);g[b].pb(a,i);\n }\n vi lk(n),dep(n,-1);\n vb is_bridge(m,false);\n function<void(ll,ll,ll)> dfs=[&](ll i,ll p,ll e){\n lk[i]=dep[i];\n for(P x:g[i])if(x.fi!=p){\n if(dep[x.fi]==-1){\n dep[x.fi]=dep[i]+1;\n dfs(x.fi,i,x.se);\n chmin(lk[i],lk[x.fi]);\n }\n else chmin(lk[i],dep[x.fi]);\n }\n if(lk[i]==dep[i]&&i)is_bridge[e]=true;\n };\n dep[0]=0;dfs(0,-1,-1);\n vi gr(n,-1);\n ll num_gr=0;\n rep(i,n)if(gr[i]==-1){\n gr[i]=num_gr;\n queue<ll> que;que.push(i);\n while(!que.empty()){\n ll t=que.front();que.pop();\n for(auto x:g[t])if(!is_bridge[x.se]){\n if(gr[x.fi]==-1){\n gr[x.fi]=num_gr;que.push(x.fi);\n }\n }\n }\n num_gr++;\n }\n vvi G(num_gr);\n rep(i,n)for(auto x:g[i])if(is_bridge[x.se])G[gr[i]].pb(gr[x.fi]);\n vi val(num_gr);\n rep(i,n)val[gr[i]]+=v[i];\n vi dp(num_gr);\n ll ans=0;\n function<void(ll,ll)> dfs2=[&](ll i,ll p){\n vi al;\n for(ll x:G[i])if(x!=p){\n dfs2(x,i);\n al.pb(dp[x]);\n }\n rsort(al);\n chmax(ans,val[i]);\n if(al.size())chmax(ans,al[0]+val[i]);\n if(al.size()>1)chmax(ans,al[0]+al[1]+val[i]);\n dp[i]=val[i];if(al.size())dp[i]+=al[0];\n };dfs2(0,-1);\n out(ans);\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 31244, "score_of_the_acc": -0.7855, "final_rank": 11 }, { "submission_id": "aoj_0415_5853790", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for(long long i=0;i<(long long)(n);i++)\n#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)\n#define pb emplace_back\n#define lb(v,k) (lower_bound(all(v),(k))-v.begin())\n#define ub(v,k) (upper_bound(all(v),(k))-v.begin())\n#define fi first\n#define se second\n#define pi M_PI\n#define PQ(T) priority_queue<T>\n#define SPQ(T) priority_queue<T,vector<T>,greater<T>>\n#define dame(a) {out(a);return 0;}\n#define decimal cout<<fixed<<setprecision(15);\n#define all(a) a.begin(),a.end()\n#define rsort(a) {sort(all(a));reverse(all(a));}\n#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}\n#define popcnt __builtin_popcountll\ntypedef long long ll;\ntypedef pair<ll,ll> P;\ntypedef tuple<ll,ll,ll> PP;\ntypedef tuple<ll,ll,ll,ll> PPP;\nusing vi=vector<ll>;\nusing vvi=vector<vi>;\nusing vvvi=vector<vvi>;\nusing vvvvi=vector<vvvi>;\nusing vp=vector<P>;\nusing vvp=vector<vp>;\nusing vb=vector<bool>;\nusing vvb=vector<vb>;\nconst ll inf=1001001001001001001;\nconst ll INF=1001001001;\nconst ll mod=998244353;\nconst double eps=1e-10;\ntemplate<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}\ntemplate<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}\ntemplate<class T> void out(T a){cout<<a<<'\\n';}\ntemplate<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\\n';}\ntemplate<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\\n';}\ntemplate<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}\ntemplate<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\\n';}\ntemplate<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}\ntemplate<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}\ntemplate<class T> void yesno(T b){if(b)out(\"yes\");else out(\"no\");}\ntemplate<class T> void YesNo(T b){if(b)out(\"Yes\");else out(\"No\");}\ntemplate<class T> void YESNO(T b){if(b)out(\"YES\");else out(\"NO\");}\ntemplate<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\\n';}\nvoid outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}\nll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}\nll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}\n\nint main(){\n ll n,m;cin>>n>>m;\n vi v(n);rep(i,n)cin>>v[i];\n vvp g(n);\n rep(i,m){\n ll a,b;cin>>a>>b;a--;b--;\n g[a].pb(b,i);g[b].pb(a,i);\n }\n vi lk(n),dep(n,-1);\n vb is_bridge(m,false);\n function<void(ll,ll,ll)> dfs=[&](ll i,ll p,ll e){\n lk[i]=dep[i];\n for(P x:g[i])if(x.fi!=p){\n if(dep[x.fi]==-1){\n dep[x.fi]=dep[i]+1;\n dfs(x.fi,i,x.se);\n chmin(lk[i],lk[x.fi]);\n }\n else chmin(lk[i],dep[x.fi]);\n }\n if(lk[i]==dep[i]&&i)is_bridge[e]=true;\n };\n dep[0]=0;dfs(0,-1,-1);\n vi gr(n,-1);\n ll num_gr=0;\n rep(i,n)if(gr[i]==-1){\n gr[i]=num_gr;\n queue<ll> que;que.push(i);\n while(!que.empty()){\n ll t=que.front();que.pop();\n for(auto x:g[t])if(!is_bridge[x.se]){\n if(gr[x.fi]==-1){\n gr[x.fi]=num_gr;que.push(x.fi);\n }\n }\n }\n num_gr++;\n }\n vvi G(num_gr);\n rep(i,n)for(auto x:g[i])if(is_bridge[x.se])G[gr[i]].pb(gr[x.fi]);\n vi val(num_gr);\n rep(i,n)val[gr[i]]+=v[i];\n vi dp(num_gr);\n ll ans=0;\n function<void(ll,ll)> dfs2=[&](ll i,ll p){\n vi al;\n for(ll x:G[i])if(x!=p){\n dfs2(x,i);\n al.pb(dp[x]);\n }\n rsort(al);\n if(al.size())chmax(ans,al[0]+val[i]);\n if(al.size()>1)chmax(ans,al[0]+al[1]+val[i]);\n dp[i]=val[i];if(al.size())dp[i]+=al[0];\n };dfs2(0,-1);\n out(ans);\n}", "accuracy": 0.9642857142857143, "time_ms": 60, "memory_kb": 31120, "score_of_the_acc": -0.7797, "final_rank": 20 }, { "submission_id": "aoj_0415_5844793", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntemplate <class Func>\nclass FixPoint : Func {\npublic:\n explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}\n\n template <class... Args>\n constexpr decltype(auto) operator()(Args&&... args) const {\n return Func::operator()(*this, std::forward<Args>(args)...);\n }\n};\n\ntemplate <class Func>\nstatic inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {\n return FixPoint<Func>{forward<Func>(f)};\n}\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n int n, m;\n cin >> n >> m;\n\n vector<int> v(n);\n vector<vector<int> > g(n);\n\n for (int i = 0; i < n; ++i) {\n cin >> v[i];\n }\n\n for (int i = 0; i < m; ++i) {\n int u, v;\n cin >> u >> v;\n --u, --v;\n g[u].emplace_back(v);\n g[v].emplace_back(u);\n }\n\n vector<int> depth(n, -1), imos(n);\n\n makeFixPoint([&](auto rec, int cur, int pre, int dep) -> void {\n if (depth[cur] == -1) {\n depth[cur] = dep;\n } else {\n if (depth[pre] > depth[cur]) {\n imos[pre]++;\n imos[cur]--;\n } else {\n imos[cur]++;\n imos[pre]--;\n }\n return;\n }\n for (auto &to : g[cur]) {\n if (to != pre) rec(to, cur, dep + 1);\n }\n }) (0, -1, 0);\n\n vector<bool> visited(n);\n\n makeFixPoint([&](auto rec, int cur) -> int {\n visited[cur] = true;\n for (auto &to : g[cur]) {\n if (!visited[to]) imos[cur] += rec(to);\n }\n return (imos[cur]);\n }) (0);\n\n vector<int> comp(n, -1);\n int ptr = 0;\n\n for (int i = 0; i < n; ++i) {\n if (comp[i] == -1) {\n makeFixPoint([&](auto dfs, int cur, int cnt) -> void {\n if (comp[cur] != -1) return;\n comp[cur] = cnt;\n for (auto &to : g[cur]) {\n int u = cur, v = to;\n if (depth[u] > depth[v]) swap(u, v);\n if (imos[v] > 0) dfs(to, cnt);\n }\n }) (i, ptr);\n ++ptr;\n }\n }\n\n vector<vector<int> > tree(ptr);\n vector<int> sum(ptr);\n\n for (int i = 0; i < n; ++i) {\n sum[comp[i]] += v[i];\n for (auto &to : g[i]) {\n int u = i, v = to;\n if (depth[u] > depth[v]) swap(u, v);\n if (imos[v] == 0) {\n tree[comp[i]].emplace_back(comp[to]);\n }\n }\n }\n\n vector<int> dist(ptr);\n auto tree_d = makeFixPoint([&](auto rec, int cur, int par) -> void {\n static int d_sum = 0;\n d_sum += sum[cur];\n dist[cur] = d_sum;\n for (auto &to : tree[cur]) {\n if (to != par) rec(to, cur);\n }\n d_sum -= sum[cur];\n });\n\n tree_d(0, -1);\n int s = max_element(begin(dist), end(dist)) - dist.begin();\n tree_d(s, -1);\n\n cout << *max_element(begin(dist), end(dist)) << '\\n';\n\n return (0);\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 25508, "score_of_the_acc": -0.1829, "final_rank": 2 }, { "submission_id": "aoj_0415_5198789", "code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\n#include <ext/pb_ds/assoc_container.hpp>\n#include <ext/pb_ds/tree_policy.hpp>\n#include <ext/pb_ds/tag_and_trait.hpp>\n#include <ext/pb_ds/trie_policy.hpp>\n#include <ext/pb_ds/priority_queue.hpp>\n#include <ext/rope>\n \nusing namespace std;\n \n#define rep(i,n) for(int i=0;i<(n);++i)\n#define reps(i,n) for(int i=1;i<=(n);++i)\n#define all(x) begin(x),end(x)\n#define Fixed fixed << setprecision(12)\n#define int int_fast64_t\nusing pii = pair<int,int>;\nconstexpr int32_t INF = 0x3f3f3f3f;\nconstexpr int_fast64_t LINF = 0x3f3f3f3f3f3f3f3fLL;\nconstexpr int mod1 = 1e9+7;\nconstexpr int mod2 = 998244353;\n \ntemplate <class Func>\nclass FixPoint : Func {\npublic:\n explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}\n \n template <class... Args>\n constexpr decltype(auto) operator()(Args&&... args) const {\n return Func::operator()(*this, std::forward<Args>(args)...);\n }\n};\n \ntemplate <class Func>\nstatic inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {\n return FixPoint<Func>{forward<Func>(f)};\n}\n\ntemplate<class T, class U> istream& operator>>(istream& is, pair<T, U>& p){ is >> p.first >> p.second; return (is); }\ntemplate<class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p){ os << p.first << ' ' << p.second; return (os); }\n \ntemplate <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }\ntemplate <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }\n \ntemplate <class T> using max_heap = priority_queue<T>;\ntemplate <class T> using min_heap = priority_queue<T,vector<T>,greater<T> >;\ntemplate <class A, class B> using umap = unordered_map<A,B>;\n \ntemplate <class T> using Max_Heap = __gnu_pbds::priority_queue<T, less<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Min_Heap = __gnu_pbds::priority_queue<T, greater<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;\ntemplate <class K, class V> using Umap = __gnu_pbds::gp_hash_table<K, V>;\ntemplate <class T> using Rope = __gnu_cxx::rope<T>;\nusing Trie = __gnu_pbds::trie<string, __gnu_pbds::null_type, __gnu_pbds::trie_string_access_traits<>, __gnu_pbds::pat_trie_tag, __gnu_pbds::trie_prefix_search_node_update>;\n \ninline int square(int a){ return a * a;}\ninline int updiv(int a,int b){ return (a + b - 1) / b; }\n\nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1};\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1};\n\nstruct UnionFind{\n int n;\n vector<int> data;\n\n UnionFind(int sz) : n(sz), data(sz, -1){}\n\n bool unite(int x, int y){\n x = find(x), y = find(y);\n if(x == y) return (false);\n if(data[x] > data[y]) swap(x, y);\n data[x] += data[y];\n data[y] = x;\n return (true);\n }\n\n int find(int k){\n if(data[k] < 0) return (k);\n return (data[k] = find(data[k]));\n }\n\n int size(int k){\n return (-data[find(k)]);\n }\n\n bool same(int x, int y){\n return (find(x) == find(y));\n }\n\n vector<vector<int> > groups(){\n vector<int> leader_buf(n), group_size(n);\n for(int i = 0; i < n; ++i){\n leader_buf[i] = find(i);\n group_size[leader_buf[i]]++;\n }\n vector<vector<int> > res(n);\n for(int i = 0; i < n; ++i){\n res[i].reserve(group_size[i]);\n }\n for(int i = 0; i < n; ++i){\n res[leader_buf[i]].emplace_back(i);\n }\n res.erase(\n remove_if(res.begin(), res.end(),\n [&](const vector<int>& v){ return (v.empty()); }),\n res.end());\n return (res);\n }\n};\n\nsigned main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout.setf(ios_base::fixed);\n cout.precision(10);\n\n int n, m;\n cin >> n >> m;\n\n vector<int> v(n);\n\n for(int i = 0; i < n; ++i){\n cin >> v[i];\n }\n\n vector<vector<int> > g(n);\n\n vector<int> s(m), t(m);\n for(int i = 0; i < m; ++i){\n cin >> s[i] >> t[i];\n --s[i], --t[i];\n g[s[i]].emplace_back(t[i]);\n g[t[i]].emplace_back(s[i]);\n }\n\n vector<pair<int, int> > low_link;\n vector<int> depth(n, -1);\n makeFixPoint([&](auto rec, int now, int pre, int dep) -> void{\n if(depth[now] == -1){\n depth[now] = dep;\n }else{\n if(depth[pre] > depth[now]){\n low_link.emplace_back(pre, now);\n }else{\n low_link.emplace_back(now, pre);\n }\n return;\n }\n for(auto e: g[now]){\n if(e != pre){\n rec(e, now, dep + 1);\n } \n }\n return;\n })(0, -1, 0);\n\n sort(all(low_link));\n low_link.erase(unique(all(low_link)), low_link.end());\n\n vector<int> imos(n);\n for(auto [r, l] : low_link){\n imos[r]++;\n imos[l]--;\n } \n\n vector<bool> visited(n);\n makeFixPoint([&](auto rec, int now) -> int{\n visited[now] = true;\n for(auto e: g[now]){\n if(!visited[e]){\n imos[now] += rec(e);\n }\n }\n return (imos[now]);\n })(0);\n\n UnionFind uf(n);\n\n vector<pair<int, int> > bli;\n for(int i = 0; i < m; ++i){\n if(depth[s[i]] > depth[t[i]]){\n swap(s[i], t[i]);\n }\n if(imos[t[i]]){\n uf.unite(s[i], t[i]);\n }else{\n bli.emplace_back(s[i], t[i]);\n }\n }\n\n vector<int> node;\n for(int i = 0; i < n; ++i){\n node.emplace_back(uf.find(i));\n }\n\n sort(all(node));\n node.erase(unique(all(node)), node.end());\n\n int siz = node.size();\n vector<int> pos(n);\n\n for(int i = 0; i < siz; ++i){\n pos[node[i]] = i;\n }\n\n vector<int> sum(siz);\n for(int i = 0; i < n; ++i){\n sum[pos[uf.find(i)]] += v[i]; \n }\n\n vector<vector<int> > tree(siz);\n\n for(auto [a, b] : bli){\n a = pos[uf.find(a)];\n b = pos[uf.find(b)];\n tree[a].emplace_back(b);\n tree[b].emplace_back(a);\n }\n\n auto getcost = makeFixPoint([&](auto getcost, vector<int> &cost, int now, int pre) -> void{\n static int ssuumm = 0;\n ssuumm += sum[now];\n cost[now] = ssuumm;\n for(auto e: tree[now]){\n if(e != pre){\n getcost(cost, e, now);\n }\n }\n ssuumm -= sum[now];\n return;\n });\n\n vector<int> cost(siz);\n getcost(cost, 0, -1);\n int x = max_element(all(cost)) - cost.begin();\n getcost(cost, x, -1);\n\n cout << *max_element(all(cost)) << '\\n';\n\n return (0);\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 34416, "score_of_the_acc": -0.6844, "final_rank": 7 }, { "submission_id": "aoj_0415_5007956", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing int64 = long long;\n// const int mod = 1e9 + 7;\nconst int mod = 998244353;\n\nconst int64 infll = (1LL << 62) - 1;\nconst int inf = (1 << 30) - 1;\n\nstruct IoSetup {\n IoSetup() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n\n\ntemplate< typename T1, typename T2 >\nostream &operator<<(ostream &os, const pair< T1, T2 > &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\n\ntemplate< typename T1, typename T2 >\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate< typename T >\nostream &operator<<(ostream &os, const vector< T > &v) {\n for(int i = 0; i < (int) v.size(); i++) {\n os << v[i] << (i + 1 != v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate< typename T >\nistream &operator>>(istream &is, vector< T > &v) {\n for(T &in : v) is >> in;\n return is;\n}\n\ntemplate< typename T1, typename T2 >\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\ntemplate< typename T1, typename T2 >\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n\ntemplate< typename T = int64 >\nvector< T > make_v(size_t a) {\n return vector< T >(a);\n}\n\ntemplate< typename T, typename... Ts >\nauto make_v(size_t a, Ts... ts) {\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\n t = v;\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\n for(auto &e : t) fill_v(e, v);\n}\n\ntemplate< typename F >\nstruct FixPoint : F {\n FixPoint(F &&f) : F(forward< F >(f)) {}\n\n template< typename... Args >\n decltype(auto) operator()(Args &&... args) const {\n return F::operator()(*this, forward< Args >(args)...);\n }\n};\n\ntemplate< typename F >\ninline decltype(auto) MFP(F &&f) {\n return FixPoint< F >{forward< F >(f)};\n}\n\ntemplate< typename T = int >\nstruct Edge {\n int from, to;\n T cost;\n int idx;\n\n Edge() = default;\n\n Edge(int from, int to, T cost = 1, int idx = -1) : from(from), to(to), cost(cost), idx(idx) {}\n\n operator int() const { return to; }\n};\n\ntemplate< typename T = int >\nstruct Graph {\n vector< vector< Edge< T > > > g;\n int es;\n\n Graph() = default;\n\n explicit Graph(int n) : g(n), es(0) {}\n\n size_t size() const {\n return g.size();\n }\n\n void add_directed_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es++);\n }\n\n void add_edge(int from, int to, T cost = 1) {\n g[from].emplace_back(from, to, cost, es);\n g[to].emplace_back(to, from, cost, es++);\n }\n\n void read(int M, int padding = -1, bool weighted = false, bool directed = false) {\n for(int i = 0; i < M; i++) {\n int a, b;\n cin >> a >> b;\n a += padding;\n b += padding;\n T c = T(1);\n if(weighted) cin >> c;\n if(directed) add_directed_edge(a, b, c);\n else add_edge(a, b, c);\n }\n }\n};\n\ntemplate< typename T = int >\nusing Edges = vector< Edge< T > >;\n\n/**\n * @brief Low-Link(橋/関節点)\n * @see http://kagamiz.hatenablog.com/entry/2013/10/05/005213\n * @docs docs/low-link.md\n */\ntemplate< typename T = int >\nstruct LowLink : Graph< T > {\npublic:\n using Graph< T >::Graph;\n vector< int > ord, low, articulation;\n vector< Edge< T > > bridge;\n using Graph< T >::g;\n\n virtual void build() {\n used.assign(g.size(), 0);\n ord.assign(g.size(), 0);\n low.assign(g.size(), 0);\n int k = 0;\n for(int i = 0; i < (int) g.size(); i++) {\n if(!used[i]) k = dfs(i, k, -1);\n }\n }\n\n explicit LowLink(const Graph< T > &g) : Graph< T >(g) {}\n\nprivate:\n vector< int > used;\n\n int dfs(int idx, int k, int par) {\n used[idx] = true;\n ord[idx] = k++;\n low[idx] = ord[idx];\n bool is_articulation = false, beet = false;\n int cnt = 0;\n for(auto &to : g[idx]) {\n if(to == par && !exchange(beet, true)) {\n continue;\n }\n if(!used[to]) {\n ++cnt;\n k = dfs(to, k, idx);\n low[idx] = min(low[idx], low[to]);\n is_articulation |= par >= 0 && low[to] >= ord[idx];\n if(ord[idx] < low[to]) bridge.emplace_back(to);\n } else {\n low[idx] = min(low[idx], ord[to]);\n }\n }\n is_articulation |= par == -1 && cnt > 1;\n if(is_articulation) articulation.push_back(idx);\n return k;\n }\n};\n\n/**\n * @brief Two-Edge-Connected-Components(二重辺連結成分分解)\n * @docs docs/two-edge-connected-components.md\n */\ntemplate< typename T = int >\nstruct TwoEdgeConnectedComponents : LowLink< T > {\npublic:\n using LowLink< T >::LowLink;\n using LowLink< T >::g;\n using LowLink< T >::ord;\n using LowLink< T >::low;\n using LowLink< T >::bridge;\n\n vector< int > comp;\n Graph< T > tree;\n vector< vector< int > > group;\n\n int operator[](const int &k) const {\n return comp[k];\n }\n\n void build() override {\n LowLink< T >::build();\n comp.assign(g.size(), -1);\n int k = 0;\n for(int i = 0; i < (int) comp.size(); i++) {\n if(comp[i] == -1) dfs(i, -1, k);\n }\n group.resize(k);\n for(int i = 0; i < (int) g.size(); i++) {\n group[comp[i]].emplace_back(i);\n }\n tree = Graph< T >(k);\n for(auto &e : bridge) {\n tree.add_edge(comp[e.from], comp[e.to], e.cost);\n }\n }\n\n explicit TwoEdgeConnectedComponents(const Graph< T > &g) : Graph< T >(g) {}\n\nprivate:\n void dfs(int idx, int par, int &k) {\n if(par >= 0 && ord[par] >= low[idx]) comp[idx] = comp[par];\n else comp[idx] = k++;\n for(auto &to : g[idx]) {\n if(comp[to] == -1) dfs(to, idx, k);\n }\n }\n};\n\ntemplate< typename sum_t, typename key_t >\nstruct ReRooting {\n struct Edge {\n int to;\n key_t data;\n sum_t dp, ndp;\n };\n\n using F = function< sum_t(sum_t, sum_t) >;\n using G = function< sum_t(sum_t, key_t) >;\n\n vector< vector< Edge > > g;\n vector< sum_t > subdp, dp;\n const sum_t ident;\n const F f;\n const G gg;\n\n ReRooting(int V, const F f, const G g, const sum_t &ident)\n : g(V), f(f), gg(g), ident(ident), subdp(V, ident), dp(V, ident) {}\n\n void add_edge(int u, int v, const key_t &d) {\n g[u].emplace_back((Edge) {v, d, ident, ident});\n g[v].emplace_back((Edge) {u, d, ident, ident});\n }\n\n void add_edge_bi(int u, int v, const key_t &d, const key_t &e) {\n g[u].emplace_back((Edge) {v, d, ident, ident});\n g[v].emplace_back((Edge) {u, e, ident, ident});\n }\n\n void dfs_sub(int idx, int par) {\n for(auto &e : g[idx]) {\n if(e.to == par) continue;\n dfs_sub(e.to, idx);\n subdp[idx] = f(subdp[idx], gg(subdp[e.to], e.data));\n }\n }\n\n void dfs_all(int idx, int par, const sum_t &top) {\n sum_t buff{ident};\n for(int i = 0; i < (int) g[idx].size(); i++) {\n auto &e = g[idx][i];\n e.ndp = buff;\n e.dp = gg(par == e.to ? top : subdp[e.to], e.data);\n buff = f(buff, e.dp);\n }\n dp[idx] = buff;\n buff = ident;\n for(int i = (int) g[idx].size() - 1; i >= 0; i--) {\n auto &e = g[idx][i];\n if(e.to != par) dfs_all(e.to, idx, f(e.ndp, buff));\n e.ndp = f(e.ndp, buff);\n buff = f(buff, e.dp);\n }\n }\n\n vector< sum_t > build() {\n dfs_sub(0, -1);\n dfs_all(0, -1, ident);\n return dp;\n }\n};\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector< int > V(N);\n cin >> V;\n TwoEdgeConnectedComponents<> g(N);\n g.read(M);\n g.build();\n auto &t = g.tree;\n vector< int > sum(t.size());\n for(int i = 0; i < t.size(); i++) {\n for(auto &j : g.group[i]) sum[i] += V[j];\n }\n auto f1 = [](int a, int b) {\n return max(a, b);\n };\n auto f2 = [](int a, int b) {\n return a + b;\n };\n ReRooting< int, int > dp(t.size(), f1, f2, 0);\n for(int i = 0; i < t.size(); i++) {\n for(auto &j : t.g[i]) {\n if(i < j) {\n dp.add_edge_bi(i, j, sum[j], sum[i]);\n }\n }\n }\n auto ret = dp.build();\n for(int i = 0; i < ret.size(); i++) ret[i] += sum[i];\n cout << *max_element(begin(ret), end(ret)) << \"\\n\";\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 44688, "score_of_the_acc": -1.3333, "final_rank": 18 }, { "submission_id": "aoj_0415_5002573", "code_snippet": "#line 1 \"a.cpp\"\n#include<iostream>\n#include<algorithm>\nusing namespace std;\n#line 1 \"/home/kotatsugame/library/graph/TECC.cpp\"\n//Two Edge Connected Components require bridge\n#line 1 \"/home/kotatsugame/library/graph/bridge.cpp\"\n#include<vector>\n#line 3 \"/home/kotatsugame/library/graph/bridge.cpp\"\nstruct bridge{\n\tint n;\n\tvector<int>ord,low;\n\tvector<bool>art;\n\tvector<vector<int> >G;\n\tbridge(int n_=0):n(n_),ord(n_,-1),low(n_),art(n_,false),G(n_){}\n\tvoid add_edge(int u,int v)\n\t{\n\t\tG[u].push_back(v);\n\t\tG[v].push_back(u);\n\t}\n\tbool operator[](int i)const{return art[i];}\n\tbool is_bridge(int a,int b)const\n\t{\n\t\tif(ord[a]>ord[b])swap(a,b);\n\t\treturn ord[a]<low[b];\n\t}\n\tvoid dfs(int u,int p,int&k)\n\t{\n\t\tlow[u]=ord[u]=k++;\n\t\tbool now=false;\n\t\tint pc=0;\n\t\tfor(int v:G[u])\n\t\t{\n\t\t\tif(ord[v]==-1)\n\t\t\t{\n\t\t\t\tdfs(v,u,k);\n\t\t\t\tlow[u]=min(low[u],low[v]);\n\t\t\t\tnow=now||ord[u]<=low[v];\n\t\t\t}\n\t\t\telse if(v!=p||pc++)\n\t\t\t{\n\t\t\t\tlow[u]=min(low[u],ord[v]);\n\t\t\t}\n\t\t}\n\t\tart[u]=now;\n\t}\n\tvoid build()\n\t{\n\t\tint k=0;\n\t\tfor(int u=0;u<n;u++)if(ord[u]==-1)\n\t\t{\n\t\t\tint cnt=0;\n\t\t\tlow[u]=ord[u]=k++;\n\t\t\tfor(int v:G[u])if(ord[v]==-1)\n\t\t\t{\n\t\t\t\tdfs(v,u,k);\n\t\t\t\tcnt++;\n\t\t\t}\n\t\t\tif(cnt>=2)art[u]=true;\n\t\t}\n\t}\n};\n#line 3 \"/home/kotatsugame/library/graph/TECC.cpp\"\nstruct TECC:bridge{\n\tvector<int>comp;\n\tTECC(int n_=0):bridge(n_),comp(n_,-1){}\n\tint operator[](int i)const{return comp[i];}\n\tvoid dfs(int u,int p,int&k)\n\t{\n\t\tcomp[u]=p==-1||is_bridge(p,u)?k++:comp[p];\n\t\tfor(int v:G[u])if(comp[v]==-1)dfs(v,u,k);\n\t}\n\tint build()\n\t{\n\t\tbridge::build();\n\t\tint k=0;\n\t\tfor(int u=0;u<n;u++)if(comp[u]==-1)dfs(u,-1,k);\n\t\treturn k;\n\t}\n\tint build(vector<vector<int> >&H)\n\t{\n\t\tint k=build();\n\t\tH.assign(k,vector<int>());\n\t\tfor(int u=0;u<n;u++)\n\t\t{\n\t\t\tfor(int v:G[u])if(comp[u]!=comp[v])\n\t\t\t{\n\t\t\t\tH[comp[u]].push_back(comp[v]);\n\t\t\t}\n\t\t}\n\t\treturn k;\n\t}\n};\n#line 5 \"a.cpp\"\nint N,M,K;\nint v[1<<17];\nint V[1<<17];\nvector<vector<int> >H;\nint ans;\nint dfs(int u,int p)\n{\n\tint mx1=0,mx2=0;\n\tfor(int v:H[u])if(v!=p)\n\t{\n\t\tint d=dfs(v,u);\n\t\tif(mx1<d)\n\t\t{\n\t\t\tmx2=mx1;\n\t\t\tmx1=d;\n\t\t}\n\t\telse if(mx2<d)mx2=d;\n\t}\n\tans=max(ans,mx1+mx2+V[u]);\n\treturn mx1+V[u];\n}\nmain()\n{\n\tcin>>N>>M;\n\tfor(int i=0;i<N;i++)cin>>v[i];\n\tTECC P(N);\n\tfor(int i=0;i<M;i++)\n\t{\n\t\tint a,b;cin>>a>>b;\n\t\tP.add_edge(a-1,b-1);\n\t}\n\tK=P.build(H);\n\tfor(int i=0;i<N;i++)V[P[i]]+=v[i];\n\tdfs(0,-1);\n\tcout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 23388, "score_of_the_acc": -0.5, "final_rank": 5 }, { "submission_id": "aoj_0415_4877728", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\nclass TwoEdgeConnectedComponents {\n void dfs(int i, int &pos){\n ord[i] = low[i] = pos++;\n int mul = 0;\n for (auto &&j : G[i]) {\n if(j == par[i] && !mul){\n mul = 1;\n continue;\n }\n if(~ord[j]){\n low[i] = min(low[i], ord[j]);\n continue;\n }\n par[j] = i;\n dfs(j, pos);\n size[i] += size[j];\n low[i] = min(low[i], low[j]);\n }\n }\n\n void dfs2(int i){\n out[bridge[i]].emplace_back(i);\n for (auto &&j : G[i]) {\n if(~bridge[j] || is_bridge(i, j)) continue;\n bridge[j] = bridge[i];\n dfs2(j);\n }\n }\npublic:\n vector<int> ord, low, par, bridge, size;\n vector<vector<int>> G, out;\n explicit TwoEdgeConnectedComponents(int n): ord(n, -1), low(n), par(n, -1), bridge(n, -1), size(n, 1), G(n){}\n\n inline bool is_bridge(int i, int j){\n if(ord[i] > ord[j]) swap(i, j);\n return ord[i] < low[j];\n }\n\n void add_edge(int u, int v){\n if(u != v){\n G[u].emplace_back(v);\n G[v].emplace_back(u);\n }\n }\n\n int build(){\n int n = G.size(), pos = 0;\n for (int i = 0; i < n; ++i) {\n if(ord[i] < 0) dfs(i, pos);\n }\n int k = 0;\n for (int i = 0; i < n; ++i) {\n if(!~bridge[i]){\n bridge[i] = k++;\n out.emplace_back();\n dfs2(i);\n }\n }\n return k;\n }\n};\n\n\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector<int> V(n);\n for (auto &&i : V) scanf(\"%d\", &i);\n TwoEdgeConnectedComponents G_(n);\n for (int i = 0; i < m; ++i) {\n int u, v;\n scanf(\"%d %d\", &u, &v);\n u--; v--;\n G_.add_edge(u, v);\n }\n int k = G_.build();\n vector<vector<int>> G(k);\n vector<ll> v(k);\n for (int i = 0; i < k; ++i) {\n for (auto &&j : G_.out[i]) {\n v[i] += V[j];\n }\n }\n for (int i = 0; i < n; ++i) {\n for (auto &&j : G_.G[i]) {\n if(G_.is_bridge(i, j)){\n G[G_.bridge[i]].emplace_back(G_.bridge[j]);\n }\n }\n }\n ll ans = 0;\n auto dfs = [&](int x, int par, auto &&f) -> void {\n ll val1 = 0, val2 = 0;\n for (auto &&i : G[x]) {\n if(i == par) continue;\n f(i, x, f);\n if(val1 <= v[i]){\n val2 = val1; val1 = v[i];\n }else if(val2 <= v[i]){\n val2 = v[i];\n }\n }\n ans = max(ans, val1+val2+v[x]);\n v[x] += val1;\n };\n dfs(0, -1, dfs);\n cout << ans << \"\\n\";\n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 27300, "score_of_the_acc": -0.4337, "final_rank": 3 } ]
aoj_0421_cpp
Tow Polygons Yae decided to make a polygon by connecting three or more straight sticks and give it to her boyfriend, Jo. The sticks can only be connected at their end points. All end points must be on the same plane. Only two sticks can be connected at a single junction point, and the angle between them can be determined freely. Yae is trying to make two polygons of equal size using all the sticks she has. Using all the given sticks, make two polygons such that the absolute value of the difference between the lengths of their perimeters is minimized. Given the length of each stick, write a program to find the absolute value of the difference in the lengths of the perimeters of the two polygons. If you cannot create two polygons, report it. For $m$ ($ \leq 3$) sticks of length $a_1 \leq a_2 \leq ... \leq a_m$, if $a_m ＜a_1+a_2+ ... +a_{m-1}$, we can create a polygon with these $m$ sticks. Input The input is given in the following form. $N$ $a_1$ $a_2$ ... $a_N$ The first line gives the number of sticks $N$ ($6 \leq N \leq 40$). The second line gives the length of each stick $a_i$ ($1 \leq a_i \leq 100$). Output If two polygons can be constructed using all the given sticks, output the minimum absolute value of the difference in length in a line. If two polygons cannot be constructed, output "-1" in a line. Sample Input and Output Sample Input 1 6 2 2 3 2 2 2 Sample Output 1 1 Sample Input 2 7 2 2 3 2 2 2 1 Sample Output 2 0 Sample Input 3 6 1 1 1 1 2 4 Sample Output 3 -1
[ { "submission_id": "aoj_0421_10851078", "code_snippet": "//#pragma GCC target (\"avx2\")\n//#pragma GCC optimize(\"O3\")\n//#pragma GCC optimize(\"unroll-loops\")\n//#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<queue>\n#include<cmath>\n#include<map>\n#include<set>\n#include<list>\n#include<iomanip>\n#include<vector>\n#include<random>\n#include<functional>\n#include<algorithm>\n#include<stack>\n#include<cstdio>\n#include<cstring>\n#include<bitset>\n#include<unordered_map>\n#include<climits>\n#include<fstream>\n#include<complex>\n#include<time.h>\n#include<cassert>\n#include<functional>\n#include<numeric>\n#include<tuple>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing H = pair<ll, ll>;\nusing P = pair<ll, H>;\nusing vi = vector<ll>;\n#define all(a) (a).begin(),(a).end()\n#define fs first\n#define sc second\n#define xx first\n#define yy second.first\n#define zz second.second\n#define Q(i,j,k) mkp((i),mkp((j),(k)))\n#define rng(i,s,n) for(ll i = (s) ; i < (n) ; i++)\n#define rep(i,n) rng(i, 0, (n))\n#define mkp make_pair\n#define vec vector\n#define pb emplace_back\n#define siz(a) int((a).size())\n#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())\n#define getidx(b,i) (lower_bound(all((b)),(i))-(b).begin())\n#define ssp(i,n) (i==(ll)(n)-1?\"\\n\":\" \")\n#define ctoi(c) (int)((c)-'0')\n#define itoc(c) (char)((c)+'0')\n#define cyes printf(\"Yes\\n\")\n#define cno printf(\"No\\n\")\n#define cdf(n) for(int quetimes_=(n);quetimes_>0;quetimes_--)\n#define gcj printf(\"Case #%lld: \",quetimes_+1)\n#define readv(a,n) (a).resize((n),0);rep(i,(n)) (a)[i]=read()\n#define found(a,x) (a.find(x)!=a.end())\nconstexpr ll mod = (ll)1e9 + 7;\nconstexpr ll Mod = 998244353;\nconstexpr ld EPS = 1e-10;\nconstexpr ll inf = (ll)3 * 1e18;\nconstexpr int Inf = (ll)15 * 1e8;\nconstexpr int dx[] = { -1,1,0,0 }, dy[] = { 0,0,-1,1 };\ntemplate<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }\nll read() { ll u, k = scanf(\"%lld\", &u); return u; }\nstring reads() { string s; cin >> s; return s; }\nH readh(short g = 0) { H u; int k = scanf(\"%lld %lld\", &u.fs, &u.sc); if (g == 1) u.fs--, u.sc--; if (g == 2) u.fs--; return u; }\nbool ina(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }\nbool ina(int t, int l, int r) { return l <= t && t < r; }\nll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }\nll ppc(ll x) {\n int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;\n return sum;\n}\ntemplate<typename T>\nvoid fin(T x) { cout << x << endl; exit(0); }\n\ntemplate<typename T>\nclass csum {\n vec<T> v;\npublic:\n csum(vec<T>& a) :v(a) { build(); }\n csum() {}\n csum(int sz) { init(sz); }\n void init(int sz) { v = vector<T>(sz + 1, 0); }\n void init(vec<T>& a) { v = a; build(); }\n void build() {\n for (int i = 1; i < v.size(); i++) v[i] += v[i - 1];\n }\n void add(int l, int r, T x) {\n v[l] += x;\n v[r] -= x;\n }//[l,r)\n void add(int t, T x) {\n v[t] += x;\n }//[l,r)\n //[l,r]\n T a(int l, int r) {\n if (r < l) return 0;\n return v[r] - (l == 0 ? 0 : v[l - 1]);\n }\n //[l,r)\n T b(int l, int r) {\n return a(l, r - 1);\n }\n T a(pair<int, int>t) {\n return a(t.first, t.second);\n }\n T b(pair<int, int>t) {\n return b(t.first, t.second);\n }\n T operator[](int x)const {\n return v[x];\n }\n};\nclass via {\n using H = pair<ll, ll>;\n bool comp;\npublic:\n vector<H>a;\n via() :comp(true) {}\n via(vector<H>dat) :a(dat), comp(false) { build(); }\n void push(int l, int r) { a.push_back(H{ l,r }); comp = false; }\n void push(H a) { push(a.first, a.second); }\n void build() {\n if (comp) return;\n comp = true;\n sort(a.begin(), a.end());\n int fst = -1; ll lst = -1;\n vector<H>b;\n for (int i = 0; i < a.size(); i++) {\n if (fst < 0) fst = i, lst = a[i].second;\n if (lst < a[i].first) {\n b.push_back(H{ a[fst].first,lst });\n fst = i, lst = a[i].second;\n }\n else if (lst < a[i].second) lst = a[i].second;\n }\n if (~fst) b.push_back(H{ a[fst].first, lst });\n a = b;\n }\n ll size() { return ll(a.size()); }\n ll sum() {\n build();\n ll sum = 0;\n for (auto g : a) sum += g.second - g.first;\n return sum;\n }\n via inter(via& v) {\n build(); v.build();\n via ret;\n for (auto g : a) ret.push(g);\n for (auto g : v.a) ret.push(g);\n ret.build(); return ret;\n }\n via comb(via& v) {\n build(); v.build();\n int s = 0, t = 0;\n via ret;\n while (s < a.size() && t < v.size()) {\n if (v[t].second <= a[s].first) t++;\n else if (a[s].second <= v[t].first) s++;\n else {\n ret.push(max(a[s].first, v[t].first), min(a[s].second, v[t].second));\n if (a[s].second <= v[t].second) s++;\n else t++;\n }\n }\n return ret;\n }\n H& operator[](int t) { return a[t]; }\n};\ntemplate<ll mod>\nclass modint {\npublic:ll v;\n modint(ll v = 0) { s(v % mod + mod); }\n constexpr static int fn_ = (ll)2e6 + 5;\n static vector<modint>fact, comp;\n modint pow(ll x) const {\n modint b(v), c(1);\n while (x) {\n if (x & 1) c *= b;\n b *= b;\n x >>= 1;\n }\n return c;\n }\n inline modint& s(int vv) {\n v = vv < mod ? vv : vv - mod;\n return *this;\n }\n inline modint inv()const { return pow(mod - 2); }\n inline modint operator-()const { return modint() - *this; }\n inline modint& operator+=(const modint b) { return s(v + b.v); }\n inline modint& operator-=(const modint b) { return s(v + mod - b.v); }\n inline modint& operator*=(const modint b) { v = v * b.v % mod; return *this; }\n inline modint& operator/=(const modint b) { v = v * b.inv().v % mod; return *this; }\n inline modint operator+(const modint& b) const { return modint(v) += b; }\n inline modint operator-(const modint& b) const { return modint(v) -= b; }\n inline modint operator*(const modint& b) const { return modint(v) *= b; }\n inline modint operator/(const modint& b) const { return modint(v) /= b; }\n friend ostream& operator<<(ostream& os, const modint& m) {\n return os << m.v;\n }\n friend istream& operator>>(istream& is, modint& m) {\n int x; is >> x; m = modint(x);\n return is;\n }\n bool operator<(const modint& r)const { return v < r.v; }\n bool operator>(const modint& r)const { return v > r.v; }\n bool operator<=(const modint& r)const { return v <= r.v; }\n bool operator>=(const modint& r)const { return v >= r.v; }\n bool operator==(const modint& r)const { return v == r.v; }\n bool operator!=(const modint& r)const { return v != r.v; }\n explicit operator bool()const { return v; }\n explicit operator int()const { return v; }\n modint comb(modint k) {\n if (k > *this) return modint();\n if (fact.empty()) combinit();\n if (v >= fn_) {\n if (k > *this - k) k = *this - k;\n modint tmp(1);\n for (int i = v; i >= v - k.v + 1; i--) tmp *= modint(i);\n return tmp * comp[k.v];\n }\n return fact[v] * comp[k.v] * comp[v - k.v];\n }//nCk\n modint perm(modint k) {\n if (k > *this) return modint();\n if (fact.empty()) combinit();\n if (v >= fn_) {\n modint tmp(1);\n for (int i = v; i >= v - k.v + 1; i--) tmp *= modint(i);\n return tmp;\n }\n return fact[v] * comp[v - k.v];\n }//nPk\n static void combinit() {\n fact.assign(fn_, modint());\n fact[0] = 1;\n for (int i = 1; i < fn_; i++) fact[i] = fact[i - 1] * modint(i);\n comp.assign(fn_, modint());\n comp[fn_ - 1] = fact[fn_ - 1].inv();\n for (int i = fn_ - 2; i >= 0; i--) comp[i] = comp[i + 1] * modint(i + 1);\n }\n};\nusing mint = modint<ll(1e9 + 7)>; template<>vec<mint> mint::fact = vec<mint>(); template<>vec<mint> mint::comp = vec<mint>();\n//--------------------------------------------------------------\n//--------------------------------------------------------------\nint n;\nshort dp[2][42][42][4001][2];\nsigned main() {\n cin >> n;\n vi a; readv(a, n);\n vi b = a;\n rng(i, 1, n) b[i] += b[i - 1];\n rep(i, 1)rep(x, n + 1)rep(y, n + 1)rep(k, b[n - 1] + 1) {\n dp[0][x][y][k][0] = 41;\n dp[0][x][y][k][1] = -1;\n }\n\n\n dp[0][n][n][0][0] = 0;\n dp[0][n][n][0][1] = 0;\n rep(i, n){\n int nxt = (i + 1) & 1;\n rep(x, n + 1)rep(y, n + 1)rep(k, b[n - 1] + 1) {\n dp[nxt][x][y][k][0] = 41;\n dp[nxt][x][y][k][1] = -1;\n }\n rep(x, n + 1)rep(y, n + 1)rep(k, b[i] + 1) {\n\n if (dp[i & 1][x][y][k][1] < 0) continue;\n\n if (x == n) {\n chmin(dp[nxt][i][y][a[i]][0], short(dp[i & 1][x][y][k][0] + 1));\n chmax(dp[nxt][i][y][a[i]][1], short(dp[i & 1][x][y][k][1] + 1));\n }\n if (x < n) {\n if (a[i] > a[x]) {\n chmin(dp[nxt][i][y][k + a[i]][0], short(dp[i & 1][x][y][k][0] + 1));\n chmax(dp[nxt][i][y][k + a[i]][1], short(dp[i & 1][x][y][k][1] + 1));\n }\n else {\n chmin(dp[nxt][x][y][k + a[i]][0], short(dp[i & 1][x][y][k][0] + 1));\n chmax(dp[nxt][x][y][k + a[i]][1], short(dp[i & 1][x][y][k][1] + 1));\n }\n }\n\n if (y == n) {\n chmin(dp[nxt][x][i][k][0], short(dp[i & 1][x][y][k][0]));\n chmax(dp[nxt][x][i][k][1], short(dp[i & 1][x][y][k][1]));\n }\n if (y < n) {\n if (a[i] > a[y]) {\n chmin(dp[nxt][x][i][k][0], short(dp[i & 1][x][y][k][0]));\n chmax(dp[nxt][x][i][k][1], short(dp[i & 1][x][y][k][1]));\n }\n else {\n chmin(dp[nxt][x][y][k][0], short(dp[i & 1][x][y][k][0]));\n chmax(dp[nxt][x][y][k][1], short(dp[i & 1][x][y][k][1]));\n }\n }\n }\n }\n\n ll ans = inf;\n rep(i, n)rep(j, n)rep(k, b[n - 1] + 1) {\n if (dp[n & 1][i][j][k][1] > 0 &&\n k - a[i] > a[i] &&\n (b[n - 1] - k) - a[j] > a[j]) {\n\n if (dp[n & 1][i][j][k][1] < 3 || n - dp[n & 1][i][j][k][0] < 3) continue;\n chmin(ans, abs((b[n - 1] - k) - k));\n\n }\n }\n if (ans == inf) ans = -1;\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 210, "memory_kb": 57904, "score_of_the_acc": -0.8706, "final_rank": 9 }, { "submission_id": "aoj_0421_7867138", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n;\n std::cin >> n;\n\n std::vector< int > as(n);\n for (auto &a: as) std::cin >> a;\n\n std::sort(as.begin(), as.end());\n int sum_a = std::accumulate(as.begin(), as.end(), 0);\n\n int ans = sum_a;\n for (int m = 0; m < n - 1; m++) {\n auto dp = vector(n + 1, vector(sum_a + 1, 0));\n dp[0][0] = 1;\n\n for (int i = 0; i < m; i++) {\n auto ndp = dp;\n for (int j = 0; j < n; j++) {\n for (int sum = 0; sum <= sum_a; sum++) {\n if (not dp[j][sum]) continue;\n if (sum + as[i] > sum_a) continue;\n ndp[j + 1][sum + as[i]] = 1;\n }\n }\n dp = ndp;\n }\n\n for (int j = 2; j <= n; j++) {\n for (int sum = 0; sum <= sum_a; sum++) {\n if (not dp[j][sum]) continue;\n\n int s1 = sum + as[m];\n int s2 = sum_a - s1;\n int cnt1 = j + 1;\n int cnt2 = n - cnt1;\n if (2 * as[m] >= s1) continue;\n if (2 * as.back() >= s2) continue;\n if (cnt1 < 3) continue;\n if (cnt2 < 3) continue;\n ans = std::min(ans, std::abs(s1 - s2));\n }\n }\n }\n\n if (ans == sum_a) {\n std::cout << -1 << std::endl;\n } else {\n std::cout << ans << std::endl;\n }\n}", "accuracy": 1, "time_ms": 180, "memory_kb": 4280, "score_of_the_acc": -0.3086, "final_rank": 7 }, { "submission_id": "aoj_0421_6046436", "code_snippet": "#ifdef LOGX\n#define _GLIBCXX_DEBUG\n#endif\n#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\n#define rep(i,n) for(int i=0;i<int(n);i++)\n#define rep2(i,s,n) for(int i=int(s);i<int(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\nconst int big=1e9+7;\n//const int big=998244353;\nconst char newl='\\n';\nconst int inf=1e9+10;\nconst ll INF=ll(1e18)+10;\nconst int dx[]={1,0,-1,0};\nconst int dy[]={0,1,0,-1};\n\nusing P=pair<ll,int>;\npriority_queue<P,vector<P>,greater<P>> q;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n \n int n;\n cin >> n;\n vector<int> a(n);\n rep(i,n)cin >> a[i];\n sort(all(a));\n int ans=inf;\n rep(M,n-1){\n int MM=n-1;\n vector<vector<pair<bool,int>>> dp(n+1,vector<pair<bool,int>>(40*100+1));\n dp[0][0]={true,0};\n rep(i,n)rep(j,40*100+1)if(dp[i][j].first){\n if(i<=M)dp[i+1][j+a[i]]={true,dp[i][j].second};\n if(i<=MM && i!=M)dp[i+1][j]={true,dp[i][j].second+a[i]};\n }\n\n rep(j,40*100+1)if(dp.back()[j].first){\n if(j-a[M]>a[M] && dp.back()[j].second-a[MM]>a[MM])\n ans=min(ans,abs(j-dp.back()[j].second));\n }\n }\n if(ans==(int)inf)ans=-1;\n cout << ans << newl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4420, "score_of_the_acc": -0.0117, "final_rank": 3 }, { "submission_id": "aoj_0421_6035627", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long mod1 = 1000000007;\nconst long long mod2 = 998244353;\ndouble pi = 3.141592653589;\nusing ll = long long;\nvector<ll> dx = {-1,0,1,0,1,1,-1,-1};\nvector<ll> dy = {0,1,0,-1,1,-1,1,-1};\nvector<char> abc = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};\nvector<char> ABC = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};\n \nstruct UnionFind{\n vector<ll> par, siz;\n \n UnionFind(ll n):par(n,-1),siz(n,1){}\n \n ll root(ll x){//親を返す\n if(par[x] == -1) return x;\n else return par[x] = root(par[x]);\n }\n \n bool issame(ll x,ll y){//同じグループかどうか\n return root(x) == root(y);\n }\n \n bool unite(ll x, ll y){//合体\n x = root(x); y = root(y);\n if(x == y) return false;\n if(siz[x] < siz[y]) swap(x,y);\n par[y] = x;\n siz[x] += siz[y];\n return true;\n }\n \n ll size(ll x){//xがいるグループのサイズ\n return siz[root(x)];\n }\n \n \n \n};\n \nlong long pow2(long long x,long long n){\n long long ans = 1;\n while(n != 0){\n long long a = x;\n long long z = 1;\n while(z*2 <= n){\n a *=a;\n a=a%mod2;\n z*=2;\n }\n ans*=a;\n ans=ans%mod2;\n n-=z;\n }\n return ans; \n}//累乗 x^n\n \ntemplate<typename T>\nvoid input_vec(vector<T> &A){\n ll N = A.size();\n for(int i = 0; i < N; i++){\n cin >> A.at(i);\n }\n return;\n}//入力を配列で受け取る\n \ntemplate<typename T>\nvoid output_vec(vector<T> &A){\n ll N = A.size();\n for(int i = 0; i < N; i++){\n if(i != 0){\n cout << \" \";\n }\n cout << A.at(i);\n }\n cout << endl;\n return;\n}//配列を出力\n \ntemplate<typename T>\nlong long count_x(vector<T> &A,T x){\n long long counter = 0;\n for(int i = 0; i < (int)A.size(); i++){\n if(A.at(i) == x){\n counter++;\n }\n }\n return counter;\n}//配列内のxの個数をreturn\n \ntemplate<typename T>\nlong long duplicate(vector<T> &A){\n ll ans = 0;\n ll N = A.size();\n T a = A.at(0);\n for(int i = 1; i < N; i++){\n if(a == A.at(i)) ans++;\n else a = A.at(i);\n }\n return ans;\n}\n \ntemplate<typename T>\nvoid chmin(T &a,T b){\n if(a>b){\n a = b;\n }\n return;\n}\n \ntemplate<typename T>\nvoid chmax(T&a,T b){\n if(a < b){\n a = b;\n }\n return;\n}\n \n/*\n絶対値 abs()\n配列の要素の追加 push_back() \nchar→intに変換 -'0'\nstring→intに変換 atoi(文字列名.c_str())\n配列の中身をN個の０で初期化 配列名.resize(N)\n配列の中身をN個のaで初期化 配列名.assign(N,a)\n配列の中からK以上の数字の最小値を出力　lower_bound(配列.begin(),配列.end(),K)\n*/\nint main(){\n ll N; cin >> N;\n vector<ll> v(N);\n input_vec(v);\n sort(v.begin(),v.end());\n ll su = 0;\n for(int i = 0; i < N; i++){\n su+=v[i];\n }\n vector<vector<pair<ll,ll>>> can(N+1);\n can[0].push_back(make_pair(0,0));\n for(int i = 0; i < N; i++){\n set<ll> check;\n //cout << \"o\" << endl;\n for(auto a: can[i]){\n //cout << check.size() << endl;\n ll b,c; tie(b,c) = a;\n //cout << b << \" \";\n if(!check.count(b))can[i+1].push_back(make_pair(b,c));\n if(!check.count(b+v[i]))can[i+1].push_back(make_pair(b+v[i],c+1));\n check.insert(b);\n check.insert(b+v[i]);\n }\n //cout << endl;\n sort(can[i].begin(),can[i].end());\n \n }\n \n \n ll ans = mod1;\n for(int i = 0; i < N-1; i++){\n ll mx = v[N-1],my = v[i];\n for(auto z: can[i]){\n ll a,x; tie(a,x) = z;\n a+=my;\n ll b = su-a;\n x++;\n ll y = N-x;\n //printf(\"%lld %lld %lld %lld %lld %lld\\n\",b,mx,a,my,x,y);\n if(my>=a-my||mx>=b-mx)continue;\n if(x<3||y<3) continue;\n ans = min(ans,abs(a-b));\n }\n }\n if(ans == mod1) cout << -1 << endl;\n else cout << ans << endl;\n \n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3988, "score_of_the_acc": -0.0076, "final_rank": 1 }, { "submission_id": "aoj_0421_6035609", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long mod1 = 1000000007;\nconst long long mod2 = 998244353;\ndouble pi = 3.141592653589;\nusing ll = long long;\nvector<ll> dx = {-1,0,1,0,1,1,-1,-1};\nvector<ll> dy = {0,1,0,-1,1,-1,1,-1};\nvector<char> abc = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};\nvector<char> ABC = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};\n \nstruct UnionFind{\n vector<ll> par, siz;\n \n UnionFind(ll n):par(n,-1),siz(n,1){}\n \n ll root(ll x){//親を返す\n if(par[x] == -1) return x;\n else return par[x] = root(par[x]);\n }\n \n bool issame(ll x,ll y){//同じグループかどうか\n return root(x) == root(y);\n }\n \n bool unite(ll x, ll y){//合体\n x = root(x); y = root(y);\n if(x == y) return false;\n if(siz[x] < siz[y]) swap(x,y);\n par[y] = x;\n siz[x] += siz[y];\n return true;\n }\n \n ll size(ll x){//xがいるグループのサイズ\n return siz[root(x)];\n }\n \n \n \n};\n \nlong long pow2(long long x,long long n){\n long long ans = 1;\n while(n != 0){\n long long a = x;\n long long z = 1;\n while(z*2 <= n){\n a *=a;\n a=a%mod2;\n z*=2;\n }\n ans*=a;\n ans=ans%mod2;\n n-=z;\n }\n return ans; \n}//累乗 x^n\n \ntemplate<typename T>\nvoid input_vec(vector<T> &A){\n ll N = A.size();\n for(int i = 0; i < N; i++){\n cin >> A.at(i);\n }\n return;\n}//入力を配列で受け取る\n \ntemplate<typename T>\nvoid output_vec(vector<T> &A){\n ll N = A.size();\n for(int i = 0; i < N; i++){\n if(i != 0){\n cout << \" \";\n }\n cout << A.at(i);\n }\n cout << endl;\n return;\n}//配列を出力\n \ntemplate<typename T>\nlong long count_x(vector<T> &A,T x){\n long long counter = 0;\n for(int i = 0; i < (int)A.size(); i++){\n if(A.at(i) == x){\n counter++;\n }\n }\n return counter;\n}//配列内のxの個数をreturn\n \ntemplate<typename T>\nlong long duplicate(vector<T> &A){\n ll ans = 0;\n ll N = A.size();\n T a = A.at(0);\n for(int i = 1; i < N; i++){\n if(a == A.at(i)) ans++;\n else a = A.at(i);\n }\n return ans;\n}\n \ntemplate<typename T>\nvoid chmin(T &a,T b){\n if(a>b){\n a = b;\n }\n return;\n}\n \ntemplate<typename T>\nvoid chmax(T&a,T b){\n if(a < b){\n a = b;\n }\n return;\n}\n \n/*\n絶対値 abs()\n配列の要素の追加 push_back() \nchar→intに変換 -'0'\nstring→intに変換 atoi(文字列名.c_str())\n配列の中身をN個の０で初期化 配列名.resize(N)\n配列の中身をN個のaで初期化 配列名.assign(N,a)\n配列の中からK以上の数字の最小値を出力　lower_bound(配列.begin(),配列.end(),K)\n*/\nint main(){\n ll N; cin >> N;\n vector<ll> v(N);\n input_vec(v);\n sort(v.begin(),v.end());\n ll su = 0;\n for(int i = 0; i < N; i++){\n su+=v[i];\n }\n vector<vector<pair<ll,ll>>> can(N+1);\n can[0].push_back(make_pair(0,0));\n for(int i = 0; i < N; i++){\n set<ll> check;\n //cout << \"o\" << endl;\n for(auto a: can[i]){\n //cout << check.size() << endl;\n ll b,c; tie(b,c) = a;\n //cout << b << \" \";\n if(!check.count(b))can[i+1].push_back(make_pair(b,c));\n if(!check.count(b+v[i]))can[i+1].push_back(make_pair(b+v[i],c+1));\n check.insert(b);\n check.insert(b+v[i]);\n }\n //cout << endl;\n sort(can[i].begin(),can[i].end());\n \n }\n \n \n ll ans = mod1;\n for(int i = 0; i < N-1; i++){\n ll mx = v[N-1],my = v[i];\n for(auto z: can[i+1]){\n ll a,x; tie(a,x) = z;\n a+=my;\n ll b = su-a;\n x++;\n ll y = N-x;\n //printf(\"%lld %lld %lld %lld %lld %lld\\n\",b,mx,a,my,x,y);\n if(my>=a-my||mx>=b-mx)continue;\n if(x<3||y<3) continue;\n ans = min(ans,abs(a-b));\n }\n }\n if(ans == mod1) cout << -1 << endl;\n else cout << ans << endl;\n \n}", "accuracy": 0.7, "time_ms": 10, "memory_kb": 3864, "score_of_the_acc": -0.0064, "final_rank": 13 }, { "submission_id": "aoj_0421_6016924", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\ntemplate<class T> using vc = vector<T>;\ntemplate<class T> using vvc = vc<vc<T>>;\ntemplate<class T> using vvvc = vc<vvc<T>>;\ntemplate<class T> using vvvvc = vvc<vvc<T>>;\ntemplate<class T> using PQ = priority_queue<T>;\ntemplate<class T> using invPQ = priority_queue<T, vector<T>, greater<T>>;\nusing IP = pair<int, int>;\nusing LP = pair<ll, ll>;\n#define all(x) begin(x), end(x)\n#define allr(x) rbegin(x), rend(x)\n#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)\n#define rep3(i, m, n) for (int i = (m); (i) < (int)(n); i++)\n#define repr(i, n) for (int i = (n) - 1; (i) >= 0; i--)\n#define rep3r(i, m, n) for (int i = (n) - 1; (i) >= (int)(m); i--)\ntemplate<class T> inline bool chmax(T & a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T & a, T b) { if (a > b) { a = b; return 1; } return 0; }\nconstexpr long long MOD = 998244353;\n\nvoid change(IP &p1, IP p2) {\n if (p1 == make_pair(-1, -1)) p1 = p2;\n else {\n if (p1.second > p2.second) p1.second = p2.second;\n }\n}\n\nsigned main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int N;\n cin >> N;\n vc<int> a(N);\n rep (i, N) cin >> a[i];\n\n vvvvc<IP> dp(N+1, vvvc<IP>(4001, vvc<IP>(4, vc<IP>(4, {-1, -1}))));\n dp[0][0][0][0] = {0, 0};\n int sum = 0;\n rep (i, N) {\n rep (j, 4001) {\n rep (k, 4) {\n rep (l, 4) {\n if (dp[i][j][k][l] == make_pair(-1, -1)) continue;\n change(dp[i+1][j+a[i]][min(3, k+1)][l], make_pair(max(dp[i][j][k][l].first, a[i]), dp[i][j][k][l].second));\n if (dp[i][j][k][l].first >= a[i]) change(dp[i+1][j][k][min(3, l+1)], make_pair(dp[i][j][k][l].first, max(dp[i][j][k][l].second, a[i])));\n else change(dp[i+1][sum - j + a[i]][min(3, l+1)][k], make_pair(a[i], dp[i][j][k][l].first));\n }\n }\n }\n sum += a[i];\n }\n\n int ans = 5000;\n rep (i, 4001) {\n if (dp[N][i][3][3] != make_pair(-1, -1) && dp[N][i][3][3].first < i - dp[N][i][3][3].first && dp[N][i][3][3].second < sum - i - dp[N][i][3][3].second) {\n chmin(ans, abs(i*2-sum));\n }\n }\n if (ans == 5000) cout << -1 << endl;\n else cout << ans << endl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 56820, "score_of_the_acc": -0.5621, "final_rank": 8 }, { "submission_id": "aoj_0421_6016871", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\ntemplate<class T> using vc = vector<T>;\ntemplate<class T> using vvc = vc<vc<T>>;\ntemplate<class T> using vvvc = vc<vvc<T>>;\ntemplate<class T> using vvvvc = vvc<vvc<T>>;\ntemplate<class T> using PQ = priority_queue<T>;\ntemplate<class T> using invPQ = priority_queue<T, vector<T>, greater<T>>;\nusing IP = pair<int, int>;\nusing LP = pair<ll, ll>;\n#define all(x) begin(x), end(x)\n#define allr(x) rbegin(x), rend(x)\n#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)\n#define rep3(i, m, n) for (int i = (m); (i) < (int)(n); i++)\n#define repr(i, n) for (int i = (n) - 1; (i) >= 0; i--)\n#define rep3r(i, m, n) for (int i = (n) - 1; (i) >= (int)(m); i--)\ntemplate<class T> inline bool chmax(T & a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T & a, T b) { if (a > b) { a = b; return 1; } return 0; }\nconstexpr long long MOD = 998244353;\n\nvoid change(IP &p1, IP p2) {\n if (p1 == make_pair(-1, -1)) p1 = p2;\n else {\n p1.second = p2.second;\n }\n}\n\nsigned main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int N;\n cin >> N;\n vc<int> a(N);\n rep (i, N) cin >> a[i];\n\n vvvvc<IP> dp(N+1, vvvc<IP>(4001, vvc<IP>(4, vc<IP>(4, {-1, -1}))));\n dp[0][0][0][0] = {0, 0};\n int sum = 0;\n rep (i, N) {\n rep (j, 4001) {\n rep (k, 4) {\n rep (l, 4) {\n if (dp[i][j][k][l] == make_pair(-1, -1)) continue;\n change(dp[i+1][j+a[i]][min(3, k+1)][l], make_pair(max(dp[i][j][k][l].first, a[i]), dp[i][j][k][l].second));\n if (dp[i][j][k][l].first >= a[i]) change(dp[i+1][j][k][min(3, l+1)], make_pair(dp[i][j][k][l].first, max(dp[i][j][k][l].second, a[i])));\n else change(dp[i+1][sum - j + a[i]][min(3, l+1)][k], make_pair(a[i], dp[i][j][k][l].first));\n }\n }\n }\n sum += a[i];\n }\n\n int ans = 5000;\n rep (i, 4001) {\n if (dp[N][i][3][3] != make_pair(-1, -1) && dp[N][i][3][3].first < i - dp[N][i][3][3].first && dp[N][i][3][3].second < sum - i - dp[N][i][3][3].second) {\n chmin(ans, abs(i*2-sum));\n }\n }\n if (ans == 5000) cout << -1 << endl;\n else cout << ans << endl;\n}", "accuracy": 0.5, "time_ms": 40, "memory_kb": 56800, "score_of_the_acc": -0.5619, "final_rank": 14 }, { "submission_id": "aoj_0421_5038371", "code_snippet": "#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n//#include <atcoder/all>\nusing namespace std;\n//using namespace atcoder;\n#define DEBUG\n#ifdef DEBUG\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n os << '{';\n for(int i = 0; i < (int)v.size(); i++) {\n if(i) { os << ','; }\n os << v[i];\n }\n os << '}';\n return os;\n}\nvoid debugg() { cerr << endl; }\ntemplate <class T, class... Args>\nvoid debugg(const T &x, const Args &... args) {\n cerr << \" \" << x;\n debugg(args...);\n}\n#define debug(...) \\\n cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"]: \", debugg(__VA_ARGS__)\n#define dump(x) cerr << __LINE__ << \" \" << #x << \" = \" << (x) << endl\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<char> vc;\ntypedef vector<string> vs;\ntypedef vector<bool> vb;\ntypedef vector<double> vd;\ntypedef pair<ll,ll> P;\ntypedef pair<int,int> pii;\ntypedef vector<P> vpl;\ntypedef tuple<ll,ll,ll> tapu;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define REP(i,a,b) for(int i=(a); i<(b); i++)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\nconst int inf = 1<<29;\nconst ll linf = 1LL<<60;\nconst int MAX = 4020000;\nint dy[8] = {0,1,0,-1,1,-1,-1,1};\nint dx[8] = {-1,0,1,0,1,-1,1,-1};\nconst double pi = acos(-1);\nconst double eps = 1e-7;\ntemplate<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){\n\tif(a>b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){\n\tif(a<b){\n\t\ta = b; return true;\n\t}\n\telse return false;\n}\ntemplate<typename T> inline void print(T &a){\n int sz = a.size();\n for(auto itr = a.begin(); itr != a.end(); itr++){\n\t\tcout << *itr;\n sz--;\n if(sz) cout << \" \";\n\t}\n cout << \"\\n\";\n}\ntemplate<typename T1,typename T2> inline void print2(T1 a, T2 b){\n\tcout << a << \" \" << b << \"\\n\";\n}\ntemplate<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){\n\tcout << a << \" \" << b << \" \" << c << \"\\n\";\n}\nvoid mark() {cout << \"#\" << \"\\n\";}\nll pcount(ll x) {return __builtin_popcountll(x);}\nconst int mod = 1e9 + 7;\n//const int mod = 998244353;\n\nint dp[2][4040][101];\n\nint main(){\n\tint n; cin >> n;\n\tint s = 0;\n\tvector<int> a(n); rep(i,n) cin >> a[i], s += a[i];\n\trep(i,2) rep(j,4010) rep(k,101) dp[i][j][k] = inf;\n\tdp[0][0][0] = 0;\n\trep(i,n){\n\t\trep(j,4010) rep(k,101) dp[1][j][k] = inf;\n\t\trep(j,4010){\n\t\t\trep(k,101){\n\t\t\t\tif(j+a[i] <= 4010) chmin(dp[1][j+a[i]][max(k,a[i])], dp[0][j][k]);\n\t\t\t\tif(dp[0][j][k] <= 100) chmin(dp[1][j][k], max(a[i], dp[0][j][k]));\n\t\t\t}\n\t\t}\n\t\tswap(dp[0], dp[1]);\n\t}\n\tint ans = inf;\n\trep(j,4010) rep(k,101){\n\t\tif(j <= 2*k || s-j <= 2*dp[0][j][k]) continue;\n\t\tchmin(ans, abs(s-j-j));\n\t}\n\tif(ans == inf) ans = -1;\n\tcout << ans << \"\\n\";\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 6308, "score_of_the_acc": -0.0647, "final_rank": 4 }, { "submission_id": "aoj_0421_4990786", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#ifdef _DEBUG\n#define line cout << \"-----------------------------\\n\"\n#define stop system(\"pause\")\n#endif\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\ntemplate<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }\ntemplate<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\ntemplate<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }\ntemplate<class T>inline void END(T s) { print(s); exit(0); }\nvoid END() { exit(0); }\n\nint main() {\n init();\n\n int n; cin >> n;\n VI a(n); cin >> a;\n SORT(a);\n int s = accumulate(all(a), 0);\n\n auto dp = vec<bool>(n + 1, n + 1, 4001);\n dp[0][0][0] = true;\n FOR(i, 0, n)FOR(j, 0, n)eFOR(k, 0, 4000) {\n if (!dp[i][j][k])continue;\n if (k + a[i] <= 4000)\n dp[i + 1][j + 1][k + a[i]] = true;\n dp[i + 1][j][k] = true;\n }\n\n int ans = INF;\n FOR(i, 0, n)eFOR(j, 2, n - 4)eFOR(k, 0, 4000) {\n if (!dp[i][j][k])continue;\n if (a[i] < k && a[n - 1] < (s - a[i] - k) - a[n - 1])\n chmin(ans, abs(a[i] + k - (s - a[i] - k)));\n }\n print(ans == INF ? -1 : ans);\n\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4028, "score_of_the_acc": -0.008, "final_rank": 2 }, { "submission_id": "aoj_0421_4990306", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define repr(i, n) for (int i = (n); i--;)\n#define all(x) x.begin(), x.end()\nusing ll = long long;\n\ntemplate <class T, class U>\nbool chmin(T& x, U y) {\n if (x > y) {\n x = y;\n return true;\n } else {\n return false;\n }\n}\n\ntemplate <class T, class U>\nbool chmax(T& x, U y) {\n if (x < y) {\n x = y;\n return true;\n } else {\n return false;\n }\n}\n\nbool bit_at(const int& mask, int pos) {\n return (mask >> pos) & 1;\n}\n\nstruct Rec {\n int sum;\n int max;\n int xam;\n bool operator<(const Rec& rhs) const {\n return sum < rhs.sum;\n }\n};\n\nint main() {\n std::ios_base::sync_with_stdio(false);\n std::cin.tie(nullptr);\n\n int n; std::cin >> n;\n int middle = n / 2;\n std::vector<int> a(n); rep(i, n) std::cin >> a[i];\n int total = std::accumulate(a.begin(), a.end(), 0);\n int target = total / 2;\n\n auto f = [&](int l, int w) {\n std::vector<Rec> pt;\n rep(mask, 1 << w) {\n int sum = 0, max = 0, xam = 0;\n rep(i, w) if (bit_at(mask, i)) {\n sum += a[l + i];\n chmax(max, a[l + i]);\n } else {\n chmax(xam, a[l + i]);\n }\n pt.emplace_back(Rec { sum, max, xam });\n }\n return pt;\n };\n\n auto lf = f(0, middle);\n auto pt = f(middle, n - middle);\n sort(pt.begin(), pt.end());\n\n int res = INT_MAX;\n for (Rec rec : lf) {\n int choice = target - rec.sum;\n int hit = std::lower_bound(all(pt), Rec { choice, 0, 0 }) - pt.begin();\n for (int i = std::max(0, hit - 100); i < std::min<int>(pt.size(), hit + 100); i++) {\n Rec cer = pt[i];\n int sum = rec.sum + cer.sum;\n int max = std::max(rec.max, cer.max);\n int xam = std::max(rec.xam, cer.xam);\n if (sum > 2 * max && sum < total - 2 * xam) {\n chmin(res, abs(total - 2 * sum));\n }\n }\n }\n\n if (res == INT_MAX) res = -1;\n std::cout << res << \"\\n\";\n}", "accuracy": 1, "time_ms": 580, "memory_kb": 33604, "score_of_the_acc": -1.2889, "final_rank": 11 }, { "submission_id": "aoj_0421_4817489", "code_snippet": "#include <iostream>\n#include <set>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\nstruct E{\n\tint c,m1,m2,l;\n\tbool operator<(const E& e1)const{\n\t\tif(c!=e1.c)return c<e1.c;\n\t\tif(m1!=e1.m1)return m1<e1.m1;\n\t\tif(m2!=e1.m2)return m2<e1.m2;\n\t\treturn l<e1.l;\n\t}\n};\nset<E> ss[42];\nvector<int> vs;\nint main() {\n\t// your code goes here\n\tint n;\n\tcin>>n;\n\tint sum=0;\n\tfor(int i=0;i<n;i++){\n\t\tint t;\n\t\tcin>>t;\n\t\tvs.push_back(t);\n\t\tsum+=t;\n\t}\n\tsort(vs.begin(),vs.end());\n\tE e;\n\te.c=0;\n\te.m1=0;\n\te.m2=0;\n\te.l=0;\n\tss[0].insert(e);\n\tfor(int i=0;i<n;i++){\n\t\tint t=vs[i];\n\t\tfor(auto it=ss[i].begin();it!=ss[i].end();it++){\n\t\t\tE e1=(*it);\n\t\t\tE e2=(*it);\n\t\t\te1.m1=t;\n\t\t\te1.l+=t;\n\t\t\te1.c=e1.c+1;\n\t\t\tss[i+1].insert(e1);\n\t\t\te2.m2=t;\n\t\t\tss[i+1].insert(e2);\n\t\t}\n\t}\n\tint ans=-1;\n\tfor(auto it=ss[n].begin();it!=ss[n].end();it++){\n\t\tE e=(*it);\n\t\tbool b1=(e.c>2);\n\t\tbool b2=((n-e.c)>2);\n\t\tbool b3=(e.l-e.m1>e.m1);\n\t\tbool b4=((sum-e.l-e.m2)>e.m2);\n\t\tint t2=abs(e.l-(sum-e.l));\n\t\tif(b1&&b2&&b3&&b4){\n\t\t\tif(ans==-1){\n\t\t\t\tans=t2;\n\t\t\t}else{\n\t\t\t\t\n\t\t\t\tif(ans>t2)ans=t2;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans<<\"\\n\";\n\treturn 0;\n}", "accuracy": 1, "time_ms": 300, "memory_kb": 98184, "score_of_the_acc": -1.4111, "final_rank": 12 }, { "submission_id": "aoj_0421_4239213", "code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n\nusing namespace std;\n\n#define int long long\n\nconst int INF = (1<<30);\n\nint solve2(vector<int>& L){\n\tint res = INF;\n\tint N = L.size();\n\tint NUM = 101;\n\t\n\tsort(L.begin(), L.end(), greater<int>());\n\t\n\tint con = 0;\n\t\n\t\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int j = i+1; j < N; j++){\n\t\t\tfor(int l = j+1; l <= N; l++){\n\t\t\t\tint sum1 = 0, sum2 = 0;\n\t\t\t\tint MAX = NUM*(N-l+3);\n\t\t\t\tint sum = 0, con1 = 0, con2 = 0, con3 = 0;\n\t\t\t\tvector<int> dp(MAX);\n\t\t\t\tdp[0] = true;\n\t\t\t\t\n\t\t\t\t\n\t\t\t\tfor(int k = 0; k < N; k++){\n\t\t\t\t\tif(k <= i) sum1 += L[k], con1++;\n\t\t\t\t\telse if(k <= j) sum2 += L[k], con2++;\n\t\t\t\t\telse if(k <= l) sum1 += L[k], con1++;\n\t\t\t\t\telse if(k == l+1) sum2 += L[k], con2++;\n\t\t\t\t\telse {\n\t\t\t\t\t\tfor(int m = MAX-1; m >= 0; m--){\n\t\t\t\t\t\t\tif(dp[m]) dp[m + L[k]] = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tsum += L[k];\n\t\t\t\t\t\tcon3++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tfor(int m = MAX-1, flag = false; m >= 0; m--){\n\t\t\t\t\tif(dp[m]){\n\t\t\t\t\t\tif(!m){\n\t\t\t\t\t\t\tif(con1 >= 3 && con2+con3 >= 3 &&L[0] < (sum1+m) - L[0] && L[i+1] < (sum2+sum-m) - L[i+1]){\n\t\t\t\t\t\t\t\tres = min(res, abs((sum1+m)-(sum2+sum-m)));\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else if(flag){\n\t\t\t\t\t\t\tif(L[0] < (sum1+m) - L[0] && L[i+1] < (sum2+sum-m) - L[i+1]){\n\t\t\t\t\t\t\t\tres = min(res, abs((sum1+m)-(sum2+sum-m)));\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tsum = m;\n\t\t\t\t\t\t\tflag = true;\n\t\t\t\t\t\t\tif(con1+con3 >= 3 && con2 >= 3 &&L[0] < (sum1+m) - L[0] && L[i+1] < (sum2+sum-m) - L[i+1]){\n\t\t\t\t\t\t\t\tres = min(res, abs((sum1+m)-(sum2+sum-m)));\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\treturn res==INF?-1:res;\n}\n\nsigned main(){\n\tint N;\n\tvector<int> l;\n\t\n\tcin>>N;\n\t\n\tl.resize(N);\n\t\n\tfor(int i = 0; i < N; i++){\n\t\tcin>>l[i];\n\t}\n\n\tcout<<solve2(l)<<endl;\n\t\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 3188, "score_of_the_acc": -0.2105, "final_rank": 6 }, { "submission_id": "aoj_0421_4090566", "code_snippet": "#include <bits/stdc++.h>\n#define all(vec) vec.begin(), vec.end()\nusing namespace std;\nusing ll = long long;\nusing P = pair<ll, ll>;\nconstexpr ll INF = (1LL << 30) - 1LL;\nconstexpr ll LINF = (1LL << 60) - 1LL;\nconstexpr ll MOD = 1e9 + 7;\ntemplate <typename T> void chmin(T &a, T b) { a = min(a, b); }\ntemplate <typename T> void chmax(T &a, T b) { a = max(a, b); }\nint dp[41][4010][41][4];\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n;\n cin >> n;\n vector<int> a(n);\n int sum = 0;\n for (int i = 0; i < n; i++) {\n cin >> a[i];\n sum += a[i];\n }\n sort(all(a));\n for (int i = 0; i <= 40; i++) {\n for (int j = 0; j <= 4000; j++) {\n for (int k = 0; k <= 40; k++) {\n for (int l = 0; l < 4; l++) {\n dp[i][j][k][l] = -INF;\n }\n }\n }\n }\n dp[n - 1][a[n - 1]][n][1] = 0;\n for (int i = n - 2; i >= 0; i--) {\n for (int j = 0; j <= 4000; j++) {\n for (int k = n; k > i; k--) {\n for (int l = 0; l <= 3; l++) {\n if (j >= a[i] && l > 0) {\n chmax(dp[i][j][k][l], dp[i + 1][j - a[i]][k][l - 1]);\n if (l == 3) {\n chmax(dp[i][j][k][l], dp[i + 1][j - a[i]][k][l]);\n }\n }\n if (k != n) {\n chmax(dp[i][j][k][l], dp[i + 1][j][k][l] + 1);\n }\n }\n }\n for (int l = 0; l <= 3; l++) {\n chmax(dp[i][j][i][l], dp[i + 1][j][n][l] + 1);\n }\n }\n }\n int res = INF;\n for (int i = 0; i <= 4000; i++) {\n if (i - a[n - 1] <= a[n - 1]) {\n continue;\n }\n for (int j = 0; j < n; j++) {\n if (dp[0][i][j][3] >= 3 && sum - i - a[j] > a[j]) {\n chmin(res, abs(i - (sum - i)));\n }\n }\n }\n if (res == INF) {\n cout << -1 << endl;\n return 0;\n }\n cout << res << endl;\n}\n\n/*\ndp[i][j][k][l]:i番目までにおいて、Am=Anなる多角形の長さの和がjでl個選んで、もう一つがAm=Akのときのそれの最大数\n状態:40*4000*40*9,遷移O(1)\n*/", "accuracy": 1, "time_ms": 60, "memory_kb": 108468, "score_of_the_acc": -1.0877, "final_rank": 10 }, { "submission_id": "aoj_0421_4090556", "code_snippet": "#include <bits/stdc++.h>\n#define all(vec) vec.begin(), vec.end()\nusing namespace std;\nusing ll = long long;\nusing P = pair<ll, ll>;\nconstexpr ll INF = (1LL << 30) - 1LL;\nconstexpr ll LINF = (1LL << 60) - 1LL;\nconstexpr ll MOD = 1e9 + 7;\ntemplate <typename T> void chmin(T &a, T b) { a = min(a, b); }\ntemplate <typename T> void chmax(T &a, T b) { a = max(a, b); }\nint dp[41][4010][41][4];\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n;\n cin >> n;\n vector<int> a(n);\n int sum = 0;\n for (int i = 0; i < n; i++) {\n cin >> a[i];\n sum += a[i];\n }\n sort(all(a));\n for (int i = 0; i <= 40; i++) {\n for (int j = 0; j <= 4000; j++) {\n for (int k = 0; k <= 40; k++) {\n for (int l = 0; l < 4; l++) {\n dp[i][j][k][l] = -INF;\n }\n }\n }\n }\n dp[n - 1][a[n - 1]][n][1] = 0;\n for (int i = n - 2; i >= 0; i--) {\n for (int j = 0; j <= 4000; j++) {\n for (int k = n; k > i; k--) {\n for (int l = 0; l <= 3; l++) {\n if (j >= a[i] && l > 0) {\n chmax(dp[i][j][k][l], dp[i + 1][j - a[i]][k][l - 1]);\n if (l == 3) {\n chmax(dp[i][j][k][l], dp[i + 1][j - a[i]][k][l]);\n }\n }\n chmax(dp[i][j][k][l], dp[i + 1][j][k][l] + 1);\n }\n }\n for (int l = 0; l <= 3; l++) {\n chmax(dp[i][j][i][l], dp[i + 1][j][n][l] + 1);\n }\n }\n }\n int res = INF;\n for (int i = 0; i <= 4000; i++) {\n if (i - a[n - 1] <= a[n - 1]) {\n continue;\n }\n for (int j = 0; j < n; j++) {\n if (dp[0][i][j][3] >= 3 && sum - i - a[j] > a[j]) {\n chmin(res, abs(i - (sum - i)));\n }\n }\n }\n if (res == INF) {\n cout << -1 << endl;\n return 0;\n }\n cout << res << endl;\n}\n\n/*\ndp[i][j][k][l]:i番目までにおいて、Am=Anなる多角形の長さの和がjでl個選んで、もう一つがAm=Akのときのそれの最大数\n状態:40*4000*40*9,遷移O(1)\n*/", "accuracy": 0.2, "time_ms": 30, "memory_kb": 108396, "score_of_the_acc": -1.0344, "final_rank": 15 }, { "submission_id": "aoj_0421_4013158", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\nint N;\nint LEN[45];\nbool dp[45][4005];\n\nint main(){\n\n\tscanf(\"%d\",&N);\n\n\tint maximum = 0,max_index;\n\tint total = 0;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%d\",&LEN[i]);\n\n\t\ttotal += LEN[i];\n\n\t\tif(maximum < LEN[i]){\n\t\t\tmaximum = LEN[i];\n\t\t\tmax_index = i;\n\t\t}\n\t}\n\n\tint ans = BIG_NUM;\n\n\tfor(int another_max = 0; another_max < N; another_max++){ //39\n\t\tif(another_max == maximum)continue;\n\n\t\t//maximumを含まない方の作成可能な周長\n\t\tfor(int num = 1; num <= N-1; num++){\n\t\t\tfor(int sum = LEN[another_max]; sum <= total-maximum; sum++){\n\t\t\t\tdp[num][sum] = false;\n\t\t\t}\n\t\t}\n\n\t\tdp[1][LEN[another_max]] = true; //another_maxを必ず含むので、0はtrueにしない\n\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tif(i == max_index || i == another_max || LEN[i] > LEN[another_max])continue;\n\n\t\t\tfor(int num = i+1; num >= 1; num--){\n\t\t\t\tfor(int sum = LEN[another_max]; sum <= total-maximum; sum++){\n\t\t\t\t\tif(!dp[num][sum])continue;\n\n\t\t\t\t\tdp[num+1][sum+LEN[i]] = true;\n\t\t\t\t\tif(num+1 >= 3 && (N-(num+1)) >= 3){\n\t\t\t\t\t\tif(LEN[another_max] < sum+LEN[i]-LEN[another_max]){\n\t\t\t\t\t\t\tint rest = total-(sum+LEN[i]);\n\t\t\t\t\t\t\tif(maximum < rest-maximum){\n\n\t\t\t\t\t\t\t\tans = min(ans,abs(rest-(sum+LEN[i])));\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif(ans == BIG_NUM){\n\n\t\tprintf(\"-1\\n\");\n\t}else{\n\n\t\tprintf(\"%d\\n\",ans);\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 3380, "score_of_the_acc": -0.1071, "final_rank": 5 } ]
aoj_0424_cpp
Into the Wild In recent years, the country of Izua has been plagued by animals that come down from the mountains to the city. You have done a lot of research to try to bring the animals back to the mountains, and you have discovered the following. Each animal has a unique name. If you insert a letter anywhere in the name of one of the two animals, and it matches the name of the other animal, you can pair them up and send them back to the mountain. Once an animal has returned to the mountain, it will not come down to the city again. You have decided to calculate how many animals that have come down to the city can be sent back to the mountain in this way. Given the names of the animals that have come down to the city, write a program to find the maximum number of pairs that can be sent back up the mountain in this way. Input The input is given in the following form. $N$ $str_1$ $str_2$ : $str_N$ The first line gives the number of animals $N$ ($2 \leq N \leq 100,000$). In the following $N$ lines, the string $str_i$ representing the name of the $i$-th animal is given. $str_i$ is a string of no more than 10 characters consisting of lowercase and uppercase letters. Also, the names of all animals are different ($str_i \ne str_j$ if $i \ne j$). Output Output the maximum number of pairs of animals that can be sent back to the mountain. Sample Input and Output Sample Input 1 4 aedb aeb ebCd cdE Sample Output 1 1 Sample Input 2 4 bcD bD AbD bc Sample Output 2 2
[ { "submission_id": "aoj_0424_9797246", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(n);++i)\nusing namespace std;\nusing ll = long long;\n\nstruct Bipartite_Matching\n{\n vector< vector< int > > graph;\n vector< int > dist, match;\n vector< bool > used, vv;\n\n Bipartite_Matching(int n, int m)\n {\n graph.resize(n);\n match.assign(m, -1);\n used.assign(n, false);\n }\n\n void add_edge(int u, int v)\n {\n graph[u].push_back(v);\n }\n\n void bfs()\n {\n dist.assign(graph.size(), -1);\n queue< int > que;\n for(int i = 0; i < graph.size(); i++) {\n if(!used[i]) {\n que.emplace(i);\n dist[i] = 0;\n }\n }\n\n while(!que.empty()) {\n int a = que.front();\n que.pop();\n for(auto &b : graph[a]) {\n int c = match[b];\n if(c >= 0 && dist[c] == -1) {\n dist[c] = dist[a] + 1;\n que.emplace(c);\n }\n }\n }\n }\n\n bool dfs(int a)\n {\n vv[a] = true;\n for(auto &b : graph[a]) {\n int c = match[b];\n if(c < 0 || (!vv[c] && dist[c] == dist[a] + 1 && dfs(c))) {\n match[b] = a;\n used[a] = true;\n return (true);\n }\n }\n return (false);\n }\n\n int bipartite_matching()\n {\n int ret = 0;\n while(true) {\n bfs();\n vv.assign(graph.size(), false);\n int flow = 0;\n for(int i = 0; i < graph.size(); i++) {\n if(!used[i] && dfs(i)) ++flow;\n }\n if(flow == 0) return (ret);\n ret += flow;\n }\n }\n};\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n \n int n;\n cin >> n;\n vector<string> s(n);\n rep(i,n) cin >> s[i];\n\n\n int m = 0;\n rep(i,n){\n if(s[i].size()%2) m++;\n }\n\n Bipartite_Matching g(n-m,m);\n\n map<string,int> ma;\n {\n int l=0,r=0;\n rep(i,n) {\n if(s[i].size()%2==0) ma[s[i]]=l++;\n else ma[s[i]]=r++;\n }\n }\n\n rep(i,n){\n rep(j,s[i].size()){\n string t;\n rep(k,s[i].size()){\n if(j==k) continue;\n t += s[i][k];\n }\n if(ma.count(t)){\n int a=ma[s[i]],b=ma[t];\n if(s[i].size()%2) swap(a,b);\n g.add_edge(a,b);\n }\n }\n }\n\n int ans = g.bipartite_matching();\n cout << ans << endl;\n\n}", "accuracy": 1, "time_ms": 400, "memory_kb": 21808, "score_of_the_acc": -0.2484, "final_rank": 2 }, { "submission_id": "aoj_0424_9278242", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\nstruct Dinic {\nprivate:\n const long long inf = 1e18;\n vector<int> dist; //sからの距離\n vector<int> iter; //どこまで調べたか\npublic:\n struct edge {\n int to, rev; long long cap;\n edge(int t = 0, int r = 0, long long c = 0LL) : to(t), rev(r), cap(c) {}\n };\n\n int n;\n vector<vector<edge>> to;\n\n Dinic(int n_ = 1) : n(n_), to(n_), dist(n_), iter(n_) {}\n\n void addedge(int u, int v, long long cap) {//u->vにcapの容量\n int su = (int)to[u].size(), sv = (int)to[v].size();\n to[u].push_back({ v, sv, cap });\n to[v].push_back({ u, su, 0 });\n }\n\n long long dfs(int v, int t, long long f) { //t: 終点, f: flow\n if (v == t) return f;\n int sv = (int)to[v].size();\n for (int& i = iter[v]; i < sv; i++) {\n edge& nv = to[v][i];\n if (dist[nv.to] <= dist[v] || nv.cap == 0) continue; //here\n long long nf = dfs(nv.to, t, min(f, nv.cap));\n if (nf > 0) {\n nv.cap -= nf;\n to[nv.to][nv.rev].cap += nf;\n return nf;\n }\n }\n return 0;\n }\n\n void bfs(int s) {\n dist.assign(n, -1);\n queue<int> q;\n q.push(s);\n dist[s] = 0;\n while (!q.empty()) {\n int v = q.front();\n q.pop();\n for (auto nv : to[v]) {\n if (nv.cap > 0 && dist[nv.to] < 0) {\n dist[nv.to] = dist[v] + 1;\n q.push(nv.to);\n }\n }\n }\n }\n\n long long maxflow(int s, int t) {//s:始点, t:終点\n long long res = 0, flow = 0;\n while (true) {\n bfs(s);\n if (dist[t] < 0) break;\n\n iter.assign(n, 0);\n while (flow = dfs(s, t, inf)) res += flow;\n };\n return res;\n }\n};\n\n\nint main()\n{\n int n;\n cin >> n;\n map<string, int> mp;\n rep(i, n) {\n string s;\n cin >> s;\n mp[s];\n }\n\n int idx = 0;\n for (auto& elem : mp) elem.second = idx++;\n\n Dinic dn(n + 2);\n int S = n, T = n + 1;\n\n for (auto &elem : mp) {\n int sz = (int)elem.first.size();\n if (sz & 1) dn.addedge(S, elem.second, 1);\n else dn.addedge(elem.second, T, 1);\n\n rep(i, sz) {\n string s = elem.first.substr(0, i) + elem.first.substr(i + 1);\n if (mp.count(s)) {\n if (sz & 1) dn.addedge(elem.second, mp[s], 1);\n else dn.addedge(mp[s], elem.second, 1);\n }\n }\n }\n\n ll flow = dn.maxflow(S, T);\n cout << flow << endl;\n\n return 0;\n}", "accuracy": 1, "time_ms": 330, "memory_kb": 61100, "score_of_the_acc": -0.6005, "final_rank": 11 }, { "submission_id": "aoj_0424_9009858", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n\n#include <algorithm>\n#include <cassert>\n#include <limits>\n#include <queue>\n#include <vector>\n\n\n#include <vector>\n\nnamespace atcoder {\n\nnamespace internal {\n\ntemplate <class T> struct simple_queue {\n std::vector<T> payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n};\n\n} // namespace internal\n\n} // namespace atcoder\n\n\nnamespace atcoder {\n\ntemplate <class Cap> struct mf_graph {\n public:\n mf_graph() : _n(0) {}\n explicit mf_graph(int n) : _n(n), g(n) {}\n\n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n int m = int(pos.size());\n pos.push_back({from, int(g[from].size())});\n int from_id = int(g[from].size());\n int to_id = int(g[to].size());\n if (from == to) to_id++;\n g[from].push_back(_edge{to, to_id, cap});\n g[to].push_back(_edge{from, from_id, 0});\n return m;\n }\n\n struct edge {\n int from, to;\n Cap cap, flow;\n };\n\n edge get_edge(int i) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n auto _e = g[pos[i].first][pos[i].second];\n auto _re = g[_e.to][_e.rev];\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\n }\n std::vector<edge> edges() {\n int m = int(pos.size());\n std::vector<edge> result;\n for (int i = 0; i < m; i++) {\n result.push_back(get_edge(i));\n }\n return result;\n }\n void change_edge(int i, Cap new_cap, Cap new_flow) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n assert(0 <= new_flow && new_flow <= new_cap);\n auto& _e = g[pos[i].first][pos[i].second];\n auto& _re = g[_e.to][_e.rev];\n _e.cap = new_cap - new_flow;\n _re.cap = new_flow;\n }\n\n Cap flow(int s, int t) {\n return flow(s, t, std::numeric_limits<Cap>::max());\n }\n Cap flow(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n assert(s != t);\n\n std::vector<int> level(_n), iter(_n);\n internal::simple_queue<int> que;\n\n auto bfs = [&]() {\n std::fill(level.begin(), level.end(), -1);\n level[s] = 0;\n que.clear();\n que.push(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (auto e : g[v]) {\n if (e.cap == 0 || level[e.to] >= 0) continue;\n level[e.to] = level[v] + 1;\n if (e.to == t) return;\n que.push(e.to);\n }\n }\n };\n auto dfs = [&](auto self, int v, Cap up) {\n if (v == s) return up;\n Cap res = 0;\n int level_v = level[v];\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\n _edge& e = g[v][i];\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\n Cap d =\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\n if (d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if (res == up) return res;\n }\n level[v] = _n;\n return res;\n };\n\n Cap flow = 0;\n while (flow < flow_limit) {\n bfs();\n if (level[t] == -1) break;\n std::fill(iter.begin(), iter.end(), 0);\n Cap f = dfs(dfs, t, flow_limit - flow);\n if (!f) break;\n flow += f;\n }\n return flow;\n }\n\n std::vector<bool> min_cut(int s) {\n std::vector<bool> visited(_n);\n internal::simple_queue<int> que;\n que.push(s);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n visited[p] = true;\n for (auto e : g[p]) {\n if (e.cap && !visited[e.to]) {\n visited[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return visited;\n }\n\n private:\n int _n;\n struct _edge {\n int to, rev;\n Cap cap;\n };\n std::vector<std::pair<int, int>> pos;\n std::vector<std::vector<_edge>> g;\n};\n\n} // namespace atcoder\n\nusing namespace atcoder;\n\nint main() {\n int N;\n cin >> N;\n unordered_map<string, int> mp;\n for( int i = 0; i < N; i++ ) {\n string str;\n cin >> str;\n mp[str] = i;\n }\n mf_graph<int> G(N+2);\n for( const auto &[s, i] : mp ) {\n if( s.size()%2 == 0 ) {\n G.add_edge(N, i, 1);\n }else {\n G.add_edge(i, N+1, 1);\n }\n for( int j = 0; j < int(s.size()); j++ ) {\n string t(s.begin(), s.end());\n t.erase(t.begin()+j);\n if( mp.count(t) ) {\n if( s.size()%2 == 0 ) {\n G.add_edge(i, mp[t], 1);\n }else {\n G.add_edge(mp[t], i, 1);\n }\n }\n }\n }\n cout << G.flow(N, N+1) << endl;\n}", "accuracy": 1, "time_ms": 210, "memory_kb": 59756, "score_of_the_acc": -0.5468, "final_rank": 8 }, { "submission_id": "aoj_0424_9009848", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n\n#include <algorithm>\n#include <cassert>\n#include <limits>\n#include <queue>\n#include <vector>\n\n\n#include <vector>\n\nnamespace atcoder {\n\nnamespace internal {\n\ntemplate <class T> struct simple_queue {\n std::vector<T> payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n};\n\n} // namespace internal\n\n} // namespace atcoder\n\n\nnamespace atcoder {\n\ntemplate <class Cap> struct mf_graph {\n public:\n mf_graph() : _n(0) {}\n explicit mf_graph(int n) : _n(n), g(n) {}\n\n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n int m = int(pos.size());\n pos.push_back({from, int(g[from].size())});\n int from_id = int(g[from].size());\n int to_id = int(g[to].size());\n if (from == to) to_id++;\n g[from].push_back(_edge{to, to_id, cap});\n g[to].push_back(_edge{from, from_id, 0});\n return m;\n }\n\n struct edge {\n int from, to;\n Cap cap, flow;\n };\n\n edge get_edge(int i) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n auto _e = g[pos[i].first][pos[i].second];\n auto _re = g[_e.to][_e.rev];\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\n }\n std::vector<edge> edges() {\n int m = int(pos.size());\n std::vector<edge> result;\n for (int i = 0; i < m; i++) {\n result.push_back(get_edge(i));\n }\n return result;\n }\n void change_edge(int i, Cap new_cap, Cap new_flow) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n assert(0 <= new_flow && new_flow <= new_cap);\n auto& _e = g[pos[i].first][pos[i].second];\n auto& _re = g[_e.to][_e.rev];\n _e.cap = new_cap - new_flow;\n _re.cap = new_flow;\n }\n\n Cap flow(int s, int t) {\n return flow(s, t, std::numeric_limits<Cap>::max());\n }\n Cap flow(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n assert(s != t);\n\n std::vector<int> level(_n), iter(_n);\n internal::simple_queue<int> que;\n\n auto bfs = [&]() {\n std::fill(level.begin(), level.end(), -1);\n level[s] = 0;\n que.clear();\n que.push(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (auto e : g[v]) {\n if (e.cap == 0 || level[e.to] >= 0) continue;\n level[e.to] = level[v] + 1;\n if (e.to == t) return;\n que.push(e.to);\n }\n }\n };\n auto dfs = [&](auto self, int v, Cap up) {\n if (v == s) return up;\n Cap res = 0;\n int level_v = level[v];\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\n _edge& e = g[v][i];\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\n Cap d =\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\n if (d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if (res == up) return res;\n }\n level[v] = _n;\n return res;\n };\n\n Cap flow = 0;\n while (flow < flow_limit) {\n bfs();\n if (level[t] == -1) break;\n std::fill(iter.begin(), iter.end(), 0);\n Cap f = dfs(dfs, t, flow_limit - flow);\n if (!f) break;\n flow += f;\n }\n return flow;\n }\n\n std::vector<bool> min_cut(int s) {\n std::vector<bool> visited(_n);\n internal::simple_queue<int> que;\n que.push(s);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n visited[p] = true;\n for (auto e : g[p]) {\n if (e.cap && !visited[e.to]) {\n visited[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return visited;\n }\n\n private:\n int _n;\n struct _edge {\n int to, rev;\n Cap cap;\n };\n std::vector<std::pair<int, int>> pos;\n std::vector<std::vector<_edge>> g;\n};\n\n} // namespace atcoder\n\nusing namespace atcoder;\n\nint main() {\n int N;\n cin >> N;\n unordered_map<string, int> mp;\n for( int i = 0; i < N; i++ ) {\n string str;\n cin >> str;\n mp[str] = i;\n }\n mf_graph<int> G(N+2);\n for( const auto &[str, i] : mp ) {\n if( str.size()%2 == 0 ) {\n G.add_edge(i, N+1, 1);\n }else {\n G.add_edge(N, i, 1);\n for( int j = 0; j < int(str.size()); j++ ) {\n string str_op(str.begin(), str.end());\n str_op.erase(str_op.begin()+j);\n if( mp.count(str_op) ) G.add_edge(i, mp[str_op], 1);\n }\n for( int j = 0; j <= int(str.size()); j++ ) {\n string str_op(str.begin(), str.end());\n str_op.insert(str_op.begin()+j, '*');\n for( char c = 'a'; c <= 'z'; c++ ) {\n str_op[j] = c;\n if( mp.count(str_op) ) G.add_edge(i, mp[str_op], 1);\n }\n for( char c = 'A'; c <= 'Z'; c++ ) {\n str_op[j] = c;\n if( mp.count(str_op) ) G.add_edge(i, mp[str_op], 1);\n }\n }\n }\n }\n cout << G.flow(N, N+1) << endl;\n}", "accuracy": 1, "time_ms": 2970, "memory_kb": 57092, "score_of_the_acc": -1.4601, "final_rank": 16 }, { "submission_id": "aoj_0424_8866199", "code_snippet": "#include <bits/stdc++.h>\n\nstruct Edge {\n Edge(int f, int t, int c, int fl, int r): from(f), to(t), cap(c), flow(fl), rev(r) {}\n int from;\n int to;\n int cap;\n int flow;\n int rev;\n};\n\nint flow(std::vector<std::vector<Edge>> graph, const int source, const int sink) {\n int n = graph.size();\n std::vector<bool> used(n);\n auto dfs = [&](auto self, int u) -> bool {\n if (u == sink) return true;\n used[u] = true;\n for (auto& e: graph[u]) {\n if (used[e.to]) continue;\n if (e.flow == 1) continue;\n if (self(self, e.to)) {\n e.flow = 1;\n graph[e.to][e.rev].flow = 0;\n return true;\n }\n }\n return false;\n };\n int ans = 0;\n while (true) {\n if (dfs(dfs, source)) {\n ans++;\n while (dfs(dfs, source)) ans++;\n } else {\n break;\n }\n used.assign(n, false);\n }\n return ans;\n}\n\nint main() {\n int n;\n std::cin >> n;\n std::vector<std::string> s(n);\n for (int i = 0; i < n; i++) std::cin >> s[i];\n constexpr int LEN = 11;\n std::array<std::vector<int>, LEN> str;\n std::map<std::string, int> mapping;\n for (int i = 0; i < n; i++) {\n str[s[i].size()].push_back(i);\n mapping[s[i]] = i;\n }\n const int source = n;\n const int sink = n + 1;\n std::vector graph(n + 2, std::vector<Edge>());\n auto add_edge = [&](int from, int to) {\n int i = graph[from].size();\n int j = graph[to].size();\n graph[from].emplace_back(from, to, 1, 0, j);\n graph[to].emplace_back(to, from, 1, 1, i);\n };\n for (int i = 1; i < LEN; i++) {\n for (int j: str[i]) {\n if (i % 2 == 1) {\n add_edge(source, j);\n } else {\n add_edge(j, sink);\n }\n }\n }\n for (int i = 1; i < LEN; i++) {\n for (int j: str[i]) {\n std::string t = s[j];\n for (int k = 0; k < (int)t.size(); k++) {\n std::string u = t;\n u.erase(u.begin() + k);\n if (mapping.find(u) != mapping.end()) {\n int l = mapping[u];\n if (i % 2 == 1) {\n add_edge(j, l);\n } else {\n add_edge(l, j);\n }\n }\n }\n }\n }\n std::cout << flow(graph, source, sink) << '\\n';\n}", "accuracy": 1, "time_ms": 1730, "memory_kb": 113536, "score_of_the_acc": -1.5782, "final_rank": 17 }, { "submission_id": "aoj_0424_8479909", "code_snippet": "#include<bits/stdc++.h>\n#define overload(a,b,c,d,...) d\n#define rep1(a) for(ll _=0;_<(ll)a;++_)\n#define rep2(i,n) for(ll i=0;i<(ll)n;++i)\n#define rep3(i,l,r) for(ll i=(ll)l;i<(ll)r;++i)\n#define rep(...) overload(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(i,a) for(ll i=(ll)a-1;i>=0;--i)\n#define rrep2(i,a,b) for(ll i=(ll)b-1;i>=(ll)a;--i)\n#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)\n#define all(x) (x).begin(),(x).end()\n#define rall(x) (x).rbegin(),(x).rend()\n#define pb push_back\n#define eb emplace_back\nusing namespace std;\nusing ll=long long;\nusing ull=unsigned long long;\nusing ld=long double;\ntemplate<typename T,typename U>inline bool chmin(T&a,const U&b){return (a>b?a=b,true:false);}\ntemplate<typename T,typename U>inline bool chmax(T&a,const U&b){return (a<b?a=b,true:false);}\nstatic constexpr ll mod1=998244353;\nstatic constexpr ll mod=1000000007;\nstruct Dinic{\n\tstruct Edge{\n\t\tint to;\n\t\tint cap;\n\t\tint rev;\n\t\tint isrev;\n\t\tint idx;\n\t};\n\tvector<vector<Edge>>g;\n\tvector<int>min_cost,iter;\n\tconst int INF=numeric_limits<int>::max()/2;\n\tDinic(int v):g(v){}\n\tvoid add_edge(int from,int to,int cap,int idx=-1){\n\t\tg[from].eb(Edge{to,cap,(int)g[to].size(),false,idx});\n\t\tg[to].eb(Edge{from,0,(int)g[from].size()-1,true,idx});\n\t}\n\tbool build_path(int s,int t){\n\t\tmin_cost.assign(g.size(),-1);\n\t\tqueue<int>q;\n\t\tmin_cost[s]=0;\n\t\tq.push(s);\n\t\twhile(!q.empty()&&min_cost[t]==-1){\n\t\t\tint v=q.front();q.pop();\n\t\t\tfor(auto&e:g[v]){\n\t\t\t\tif(e.cap>0&&min_cost[e.to]==-1){\n\t\t\t\t\tmin_cost[e.to]=min_cost[v]+1;\n\t\t\t\t\tq.push(e.to);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn min_cost[t]!=-1;\n\t}\n\tint find_path(int idx,const int t,int flow){\n\t\tif(idx==t)return flow;\n\t\tfor(int &i=iter[idx];i<(int)g[idx].size();++i){\n\t\t\tEdge&e=g[idx][i];\n\t\t\tif(e.cap>0&&min_cost[e.to]>min_cost[idx]){\n\t\t\t\tint d=find_path(e.to,t,min(flow,e.cap));\n\t\t\t\tif(d>0){\n\t\t\t\t\te.cap-=d;\n\t\t\t\t\tg[e.to][e.rev].cap+=d;\n\t\t\t\t\treturn d;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n\tint max_flow(int s,int t){\n\t\tint flow=0;\n\t\twhile(build_path(s,t)){\n\t\t\titer.assign(g.size(),0);\n\t\t\tint f;\n\t\t\twhile((f=find_path(s,t,INF))>0)flow+=f;\n\t\t}\n\t\treturn flow;\n\t}\n};\nint main(){\n\tint n;cin>>n;\n\tvector<string>s(n);\n\tfor(auto&e:s)cin>>e;\n\tmap<string,int>st;\n\trep(i,s.size())st[s[i]]=i;\n\tDinic d(n+2);\n\trep(i,n){\n\t\tset<int>to;\n\t\trep(j,s[i].size()){\n\t\t\tstring t=s[i].substr(0,j)+s[i].substr(j+1);\n\t\t\tif(st.count(t))to.insert(st[t]);\n\t\t}\n\t\tfor(auto k:to){\n\t\t\tif(s[i].size()%2==0)d.add_edge(i,k,1);\n\t\t\telse d.add_edge(k,i,1);\n\t\t}\n\t\tif(s[i].size()%2==0)d.add_edge(n,i,1);\n\t\telse d.add_edge(i,n+1,1);\n\t}\n\tcout<<d.max_flow(n,n+1)<<endl;\n}", "accuracy": 1, "time_ms": 420, "memory_kb": 51504, "score_of_the_acc": -0.5393, "final_rank": 6 }, { "submission_id": "aoj_0424_6978037", "code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 0424.cc: Into the Wild\n */\n\n#include<cstdio>\n#include<string>\n#include<vector>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\nconst int MAX_L = 10;\n\n/* typedef */\n\ntypedef vector<int> vi;\ntypedef vector<string> vst;\ntypedef vector<bool> vb;\n\n/* global variables */\n\nvst svs[MAX_L + 1];\nvi nbrs[MAX_N];\n\n/* subroutines */\n\nbool max_match_rec(const vi *nbrs, int u, vi &matches, vb &visited) {\n if (u < 0) return true;\n for (const int v: nbrs[u]) {\n if (! visited[v]) {\n visited[v] = true;\n if (max_match_rec(nbrs, matches[v], matches, visited)) {\n\tmatches[u] = v;\n\tmatches[v] = u;\n\treturn true;\n }\n }\n }\n return false;\n}\n\nint max_match(const int n, int l, const vi *nbrs, vi &matches) {\n matches.assign(n, -1);\n int count = 0;\n \n for (int u = 0; u < l; u++) {\n vb visited(n, false);\n if (max_match_rec(nbrs, u, matches, visited)) count++;\n }\n\n return count;\n}\n\n/* main */\n\nint main() {\n int n;\n scanf(\"%d\", &n);\n\n for (int i = 0; i < n; i++) {\n char s[MAX_L + 4];\n scanf(\"%s\", s);\n string t(s);\n svs[t.size()].push_back(t);\n }\n\n int sum = 0;\n\n for (int l = MAX_L - 1; l >= 1; l--) {\n vst &sv0 = svs[l], &sv1 = svs[l + 1];\n if (sv0.empty() || sv1.empty()) continue;\n\n sort(sv0.begin(), sv0.end());\n int m0 = sv0.size(), m1 = sv1.size(), m = m0 + m1;\n for (int i = 0; i < m; i++) nbrs[i].clear();\n\n for (int i = 0; i < m1; i++) {\n string &s1 = sv1[i];\n int l1 = s1.size();\n for (int j = 0; j < l1; j++) {\n\tstring t = s1.substr(0, j) + s1.substr(j + 1);\n\tvst::iterator vit = lower_bound(sv0.begin(), sv0.end(), t);\n\tif (vit != sv0.end() && *vit == t) {\n\t int i0 = vit - sv0.begin();\n\t nbrs[m0 + i].push_back(i0);\n\t nbrs[i0].push_back(m0 + i);\n\t //printf(\"%s->%s\\n\", s1.c_str(), vit->c_str());\n\t}\n }\n }\n\n vi matches;\n sum += max_match(m, m0, nbrs, matches);\n\n vst tmp;\n for (int i = 0; i < m0; i++)\n if (matches[i] < 0) tmp.push_back(sv0[i]);\n swap(tmp, sv0);\n } \n\n printf(\"%d\\n\", sum);\n return 0;\n}", "accuracy": 0.5, "time_ms": 30, "memory_kb": 17004, "score_of_the_acc": -0.0766, "final_rank": 18 }, { "submission_id": "aoj_0424_6046445", "code_snippet": "#ifdef LOGX\n#define _GLIBCXX_DEBUG\n#endif\n#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\n#define rep(i,n) for(int i=0;i<int(n);i++)\n#define rep2(i,s,n) for(int i=int(s);i<int(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\nconst int big=1e9+7;\n//const int big=998244353;\nconst char newl='\\n';\nconst int inf=1e9+10;\nconst ll INF=ll(1e18)+10;\nconst int dx[]={1,0,-1,0};\nconst int dy[]={0,1,0,-1};\n\nstruct mf_graph{\n int n;\n struct edge2{\n int to,rev;\n int cap;\n };\n struct edge{\n int from;\n int to;\n int cap,flow;\n };\n vector<pair<int,int>> pos;\n vector<vector<edge2>> g;\n\n mf_graph(int n):n(n),g(n){}\n\n void add_edge(int from,int to,int cap){\n pos.push_back({from,{int(g[from].size())}});\n int f_id=int(g[from].size());\n int to_id=int(g[to].size());\n if(from==to)to_id++;\n g[from].push_back(edge2{to,to_id,cap});\n g[to].push_back(edge2{from,f_id,0});\n return;\n }\n\n int flow(int s,int t,int flow_lim=inf){\n vector<int> lev(n),iter(n);\n queue<int> q;\n auto bfs=[&](){\n fill(all(lev),-1);\n lev[s]=0;\n q=queue<int>();\n q.push(s);\n while(!q.empty()){\n int v=q.front();\n q.pop();\n for(auto e:g[v]){\n if(e.cap==0 || lev[e.to]>=0)continue;\n lev[e.to]=lev[v]+1;\n if(e.to==t)return;\n q.push(e.to);\n }\n }\n };\n auto dfs=[&](auto self,int v,int up){\n if(v==s)return up;\n int res=0;\n int lev_v=lev[v];\n for(int &i=iter[v];i<int(g[v].size());i++){\n edge2& e=g[v][i];\n if(lev_v<=lev[e.to] || g[e.to][e.rev].cap==0)continue;\n int d=self(self,e.to,min(up-res,g[e.to][e.rev].cap));\n if(d<=0)continue;\n g[v][i].cap+=d;\n g[e.to][e.rev].cap-=d;\n res+=d;\n if(res==up)return res;\n }\n lev[v]=n;\n return res;\n };\n\n int flow=0;\n while(flow<flow_lim){\n bfs();\n if(lev[t]==-1)break;\n fill(all(iter),0);\n int f=dfs(dfs,t,flow_lim-flow);\n if(!f)break;\n flow+=f;\n }\n return flow;\n }\n};\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n\n int n;\n cin >> n;\n unordered_map<string,int> ma;\n rep(i,n){\n string s;\n cin >> s;\n ma[s]=i;\n }\n mf_graph g(n+2);\n for(auto it:ma){\n const string s=it.first;\n if(s.size()==1)continue;\n const int i=it.second;\n rep(sz,s.size()){\n string t=s.substr(0,sz)+s.substr(sz+1);\n if(ma.count(t)){\n int from=i,to=ma[t];\n if(s.size()%2)swap(from,to);\n g.add_edge(from,to,1);\n }\n }\n }\n for(auto it:ma){\n if(it.first.size()%2==0){\n g.add_edge(n,it.second,1);\n }\n else{\n g.add_edge(it.second,n+1,1);\n }\n }\n cout << g.flow(n,n+1) << newl;\n}", "accuracy": 1, "time_ms": 200, "memory_kb": 59492, "score_of_the_acc": -0.5409, "final_rank": 7 }, { "submission_id": "aoj_0424_6046129", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for(long long i=0;i<(long long)(n);i++)\n#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)\n#define pb emplace_back\n#define lb(v,k) (lower_bound(all(v),(k))-v.begin())\n#define ub(v,k) (upper_bound(all(v),(k))-v.begin())\n#define fi first\n#define se second\n#define pi M_PI\n#define PQ(T) priority_queue<T>\n#define SPQ(T) priority_queue<T,vector<T>,greater<T>>\n#define dame(a) {out(a);return 0;}\n#define decimal cout<<fixed<<setprecision(15);\n#define all(a) a.begin(),a.end()\n#define rsort(a) {sort(all(a));reverse(all(a));}\n#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}\n#define popcnt __builtin_popcountll\ntypedef long long ll;\ntypedef pair<ll,ll> P;\ntypedef tuple<ll,ll,ll> PP;\ntypedef tuple<ll,ll,ll,ll> PPP;\nusing vi=vector<ll>;\nusing vvi=vector<vi>;\nusing vvvi=vector<vvi>;\nusing vvvvi=vector<vvvi>;\nusing vp=vector<P>;\nusing vvp=vector<vp>;\nusing vb=vector<bool>;\nusing vvb=vector<vb>;\nconst ll inf=1001001001001001001;\nconst ll INF=1001001001;\nconst ll mod=1000000007;\nconst double eps=1e-10;\ntemplate<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}\ntemplate<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}\ntemplate<class T> void out(T a){cout<<a<<'\\n';}\ntemplate<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\\n';}\ntemplate<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\\n';}\ntemplate<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}\ntemplate<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\\n';}\ntemplate<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}\ntemplate<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}\ntemplate<class T> void yesno(T b){if(b)out(\"yes\");else out(\"no\");}\ntemplate<class T> void YesNo(T b){if(b)out(\"Yes\");else out(\"No\");}\ntemplate<class T> void YESNO(T b){if(b)out(\"YES\");else out(\"NO\");}\ntemplate<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\\n';}\nvoid outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}\nll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}\nll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}\n\nclass BipartiteMatching {\n\tint N, M;\n\tvector<vector<int>> G;\n\tvector<bool> used;\n\tvector<int> p, q;\n\tbool dfs(int v) {\n\t\tif (used[v]) return false;\n\t\tused[v] = true;\n\t\tfor (auto u : G[v]) {\n\t\t\tif (q[u] == -1 || dfs(q[u])) {\n\t\t\t\tq[u] = v;\n\t\t\t\tp[v] = u;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\npublic:\n\tBipartiteMatching(int n, int m, const vector<vector<int>>& g) : N(n), M(m), G(g), used(N), p(N, -1), q(M, -1) {}\n\tBipartiteMatching(int n, int m) : N(n), M(m), G(n), used(N), p(N, -1), q(M, -1) {}\n\tvoid add_edge(int s, int t) {\n\t\tG[s].push_back(t);\n\t}\n\tint solve() {\n\t\tint res = 0;\n\t\tbool flag = true;\n\t\tfill(p.begin(), p.end(), -1);\n\t\tfill(q.begin(), q.end(), -1);\n\t\tfill(used.begin(), used.end(), false);\n\t\twhile (flag) {\n\t\t\tflag = false;\n\t\t\tfor (int i = 0; i < N; ++i) {\n\t\t\t\tif (p[i] == -1 && dfs(i)) {\n\t\t\t\t\tflag = true;\n\t\t\t\t\t++res;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (flag) {\n\t\t\t\tfill(used.begin(), used.end(), false);\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n\tvector<pair<int, int>> edges() const {\n\t\tvector<pair<int, int>> res;\n\t\tfor (size_t i = 0; i < N; ++i) {\n\t\t\tif (p[i] != -1) {\n\t\t\t\tres.emplace_back(i, p[i]);\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n};\nint main(){\n ll n;cin>>n;\n vector<vector<string>> v(2);\n rep(i,n){\n string s;cin>>s;\n v[s.size()%2].pb(s);\n }\n rep(i,2)sort(all(v[i]));\n BipartiteMatching G(v[0].size(),v[1].size());\n rep(i,2){\n rep(t,v[i].size()){\n string x=v[i][t];\n rep(j,x.size()){\n string tmp;rep(k,x.size())if(j!=k)tmp+=x[k];\n ll l=lb(v[1-i],tmp);\n if(l!=v[1-i].size()&&v[1-i][l]==tmp){\n if(i)G.add_edge(l,t);\n else G.add_edge(t,l);\n }\n }\n }\n }\n out(G.solve());\n}", "accuracy": 1, "time_ms": 140, "memory_kb": 16184, "score_of_the_acc": -0.1062, "final_rank": 1 }, { "submission_id": "aoj_0424_6041052", "code_snippet": "#include <bits/stdc++.h>\n\nusing ll = long long;\n\ntemplate <class T> using Vec = std::vector<T>;\n\nstruct Edge {\n int to, cap, rev;\n};\n\ntemplate <class F> struct RecLambda : private F {\n explicit RecLambda(F&& f) : F(std::forward<F>(f)) {}\n template <class... Args> decltype(auto) operator()(Args&&... args) const {\n return F::operator()(*this, std::forward<Args>(args)...);\n }\n};\n\n\ntemplate <class Cap> class Dinic {\n struct Edge {\n int dst, rev;\n Cap cap;\n };\n\n std::vector<std::vector<Edge>> graph;\n\n public:\n Dinic() : graph() {}\n explicit Dinic(const int n) : graph(n) {}\n\n int size() const { return graph.size(); }\n\n void add_edge(const int src, const int dst, const Cap capacity) {\n assert(0 <= src and src < size());\n assert(0 <= src and dst < size());\n assert(capacity >= 0);\n int src_id = graph[src].size();\n int dst_id = graph[dst].size();\n if (dst == src) dst_id += 1;\n graph[src].push_back(Edge{dst, dst_id, capacity});\n graph[dst].push_back(Edge{src, src_id, 0});\n }\n\n Cap flow(const int src, const int dst) { return flow(src, dst, std::numeric_limits<Cap>::max()); }\n Cap flow(const int src, const int dst, const Cap flow_limit) {\n assert(0 <= src and src < size());\n assert(0 <= src and dst < size());\n assert(src != dst);\n std::vector<int> level(size()), iter(size());\n std::queue<int> que;\n const auto bfs = [&] {\n std::fill(level.begin(), level.end(), -1);\n level[src] = 0;\n while (!que.empty()) que.pop();\n que.push(src);\n while (!que.empty()) {\n const int u = que.front();\n que.pop();\n for (const Edge& e : graph[u]) {\n if (e.cap == 0 or level[e.dst] != -1) continue;\n level[e.dst] = level[u] + 1;\n if (e.dst == dst) return;\n que.push(e.dst);\n }\n }\n };\n const auto dfs = [&](auto&& dfs, const int u, const Cap ub) -> Cap {\n if (u == src) return ub;\n Cap ret = 0;\n for (int& i = iter[u]; i < (int)graph[u].size(); i += 1) {\n Edge& e = graph[u][i];\n Edge& re = graph[e.dst][e.rev];\n if (level[u] <= level[e.dst] or re.cap == 0) continue;\n const Cap d = dfs(dfs, e.dst, std::min(ub - ret, re.cap));\n if (d == 0) continue;\n e.cap += d;\n re.cap -= d;\n ret += d;\n if (ret == ub) return ret;\n }\n level[u] = -1;\n return ret;\n };\n Cap ret = 0;\n while (ret < flow_limit) {\n bfs();\n if (level[dst] == -1) break;\n std::fill(iter.begin(), iter.end(), 0);\n const Cap f = dfs(dfs, dst, flow_limit - ret);\n if (f == 0) break;\n ret += f;\n }\n return ret;\n }\n};\n\nint main() {\n int n;\n std::cin >> n;\n Vec<std::string> s(n);\n for (auto& x : s) std::cin >> x;\n std::sort(s.begin(), s.end());\n Dinic<int> graph(n + 2);\n const int src = n;\n const int dst = n + 1;\n for (int i = 0; i < n; ++i) {\n std::set<int> to;\n for (int j = 0; j < (int)s[i].size(); ++j) {\n const std::string x = s[i].substr(0, j) + s[i].substr(j + 1);\n const int k = std::lower_bound(s.begin(), s.end(), x) - s.begin();\n if (k < n and s[k] == x) to.insert(k);\n }\n for (const int k : to) {\n if (s[i].size() % 2 == 0) graph.add_edge(i, k, 1);\n else graph.add_edge(k, i, 1);\n }\n if (s[i].size() % 2 == 0) graph.add_edge(src, i, 1);\n else graph.add_edge(i, dst, 1);\n }\n std::cout << graph.flow(src, dst) << '\\n';\n return 0;\n}", "accuracy": 1, "time_ms": 200, "memory_kb": 30648, "score_of_the_acc": -0.2649, "final_rank": 3 }, { "submission_id": "aoj_0424_6041026", "code_snippet": "#include <bits/stdc++.h>\n\nusing ll = long long;\n\ntemplate <class T> using Vec = std::vector<T>;\n\nint main() {\n int n;\n std::cin >> n;\n Vec<std::string> s(n);\n for (auto& x : s) std::cin >> x;\n std::sort(s.begin(), s.end());\n Vec<Vec<int>> to(n);\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < (int)s[i].size(); ++j) {\n const std::string x = s[i].substr(0, j) + s[i].substr(j + 1);\n const int k = std::lower_bound(s.begin(), s.end(), x) - s.begin();\n if (k < n and s[k] == x) {\n to[i].push_back(k);\n }\n }\n }\n Vec<int> idx(n);\n std::iota(idx.begin(), idx.end(), 0);\n std::sort(idx.begin(), idx.end(), [&](const int i, const int j) { return s[i].size() > s[j].size(); });\n Vec<char> used(n);\n int ans = 0;\n for (const int i : idx) {\n for (const int j : to[i]) {\n if (!used[i] and !used[j]) {\n used[i] = used[j] = true;\n ans += 1;\n break;\n }\n }\n }\n std::cout << ans << '\\n';\n return 0;\n}", "accuracy": 0.39285714285714285, "time_ms": 130, "memory_kb": 8996, "score_of_the_acc": -0.034, "final_rank": 19 }, { "submission_id": "aoj_0424_6024124", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1;\ntemplate <typename Cap>\nstruct dinic{\n struct edge{\n int to, rev;\n Cap cap;\n edge(int to, int rev, Cap cap): to(to), rev(rev), cap(cap){\n }\n };\n int N;\n vector<vector<edge>> G;\n dinic(int N): N(N), G(N){\n }\n void add_edge(int from, int to, Cap cap){\n G[from].push_back(edge(to, G[to].size(), cap));\n G[to].push_back(edge(from, G[from].size() - 1, 0));\n }\n Cap dfs(vector<int> &d, vector<int> &iter, int v, int t, Cap f){\n if (v == t){\n return f;\n }\n while (iter[v] < G[v].size()){\n int w = G[v][iter[v]].to;\n if (G[v][iter[v]].cap > 0 && d[v] < d[w]){\n Cap f2 = dfs(d, iter, w, t, min(f, G[v][iter[v]].cap));\n if (f2 > 0){\n G[v][iter[v]].cap -= f2;\n G[w][G[v][iter[v]].rev].cap += f2;\n return f2;\n }\n }\n iter[v]++;\n }\n return 0;\n }\n Cap max_flow(int s, int t){\n Cap flow = 0;\n while (true){\n vector<int> d(N, -1);\n d[s] = 0;\n queue<int> Q;\n Q.push(s);\n while (!Q.empty()){\n if (d[t] != -1){\n break;\n }\n int v = Q.front();\n Q.pop();\n for (auto &e : G[v]){\n int w = e.to;\n if (e.cap > 0 && d[w] == -1){\n d[w] = d[v] + 1;\n Q.push(w);\n }\n }\n }\n if (d[t] == -1){\n break;\n }\n vector<int> iter(N, 0);\n while (true){\n Cap f = dfs(d, iter, s, t, INF);\n if (f == 0){\n break;\n }\n flow += f;\n }\n }\n return flow;\n }\n};\nint main(){\n int N;\n cin >> N;\n vector<string> str(N);\n for (int i = 0; i < N; i++){\n cin >> str[i];\n }\n map<string, int> mp;\n for (int i = 0; i < N; i++){\n mp[str[i]] = i;\n }\n dinic<int> G(N + 2);\n for (int i = 0; i < N; i++){\n int L = str[i].size();\n if (L % 2 == 0){\n G.add_edge(N, i, 1);\n } else {\n G.add_edge(i, N + 1, 1);\n }\n for (int j = 0; j < L; j++){\n string s = str[i];\n s.erase(s.begin() + j);\n if (mp.count(s) == 1){\n int x = mp[s];\n if (L % 2 == 0){\n G.add_edge(i, x, 1);\n } else {\n G.add_edge(x, i, 1);\n }\n }\n }\n }\n cout << G.max_flow(N, N + 1) << endl;\n}", "accuracy": 1, "time_ms": 410, "memory_kb": 54068, "score_of_the_acc": -0.5604, "final_rank": 9 }, { "submission_id": "aoj_0424_6021769", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\ntemplate<class T> using vc = vector<T>;\ntemplate<class T> using vvc = vc<vc<T>>;\ntemplate<class T> using vvvc = vc<vvc<T>>;\ntemplate<class T> using vvvvc = vvc<vvc<T>>;\ntemplate<class T> using PQ = priority_queue<T>;\ntemplate<class T> using invPQ = priority_queue<T, vector<T>, greater<T>>;\nusing IP = pair<int, int>;\nusing LP = pair<ll, ll>;\n#define all(x) begin(x), end(x)\n#define allr(x) rbegin(x), rend(x)\n#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)\n#define rep3(i, m, n) for (int i = (m); (i) < (int)(n); i++)\n#define repr(i, n) for (int i = (n) - 1; (i) >= 0; i--)\n#define rep3r(i, m, n) for (int i = (n) - 1; (i) >= (int)(m); i--)\ntemplate<class T> inline bool chmax(T & a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T & a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\nstruct Graph {\n struct Edge {\n int rev, from, to, cap;\n Edge(int r, int f, int t, int c) : rev(r), from(f), to(t), cap(c) {}\n };\n vvc<Edge> list;\n Graph(int N) : list(N) {}\n size_t size() {\n return list.size();\n }\n vc<Edge>& operator [] (int i) {\n return list[i];\n }\n Edge& redge(const Edge& e) {\n return list[e.to][e.rev];\n }\n void run_flow(Edge& e, int f) {\n e.cap -= f;\n redge(e).cap += f;\n }\n void addedge(int from, int to, int cap) {\n int fromrev = (int)list[from].size();\n int torev = (int)list[to].size();\n list[from].push_back(Edge(torev, from, to, cap));\n list[to].push_back(Edge(fromrev, to, from, 0));\n }\n};\nstruct dinic {\n static const int INF = 1 << 30;\n vc<int> seen, level;\n dinic() {}\n void dibfs(Graph& G, int s) {\n level.assign((int)G.size(), -1);\n queue<int> que;\n level[s] = 0;\n que.push(s);\n while (!que.empty()) {\n int v = que.front(); que.pop();\n for (auto& e : G[v]) {\n if (e.cap > 0 && level[e.to] < 0) {\n level[e.to] = level[v] + 1;\n que.push(e.to);\n }\n }\n }\n }\n int didfs(Graph& G, int v, int t, int f) {\n if (v == t) return f;\n seen[v] = true;\n for (auto& e : G[v]) {\n if (seen[e.to]) continue;\n if (e.cap > 0 && level[v] < level[e.to]) {\n int flow = didfs(G, e.to, t, min(f, e.cap));\n if (flow == 0) continue;\n G.run_flow(e, flow);\n return flow;\n }\n }\n return 0;\n }\n int solve(Graph& G, int s, int t) {\n int res = 0;\n while (true) {\n dibfs(G, s);\n if (level[t] < 0) return res;\n seen.assign((int)G.size(), false);\n int flow;\n while ((flow = didfs(G, s, t, INF)) > 0) {\n res += flow;\n }\n }\n return 0;\n }\n};\n\nsigned main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int N;\n cin >> N;\n vc<string> str(N);\n rep (i, N) cin >> str[i];\n\n sort(all(str), [](string &s1, string &s2) {\n return s1.size() < s2.size();\n });\n\n Graph G(N+2);\n unordered_map<string, int> mp;\n rep (i, N) {\n rep (j, str[i].size()) {\n if (mp.count(str[i].substr(0, j) + str[i].substr(j+1))) {\n int t = mp[str[i].substr(0, j) + str[i].substr(j+1)];\n if (str[i].size() % 2 == 0) G.addedge(i, t, 1);\n else G.addedge(t, i, 1);\n }\n }\n mp[str[i]] = i;\n }\n\n rep (i, N) {\n if (str[i].size() % 2 == 0) G.addedge(N, i, 1);\n else G.addedge(i, N+1, 1);\n }\n\n cout << dinic().solve(G, N, N+1) << endl;\n}", "accuracy": 1, "time_ms": 1120, "memory_kb": 62824, "score_of_the_acc": -0.8857, "final_rank": 14 }, { "submission_id": "aoj_0424_6021676", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\ntemplate<class T> using vc = vector<T>;\ntemplate<class T> using vvc = vc<vc<T>>;\ntemplate<class T> using vvvc = vc<vvc<T>>;\ntemplate<class T> using vvvvc = vvc<vvc<T>>;\ntemplate<class T> using PQ = priority_queue<T>;\ntemplate<class T> using invPQ = priority_queue<T, vector<T>, greater<T>>;\nusing IP = pair<int, int>;\nusing LP = pair<ll, ll>;\n#define all(x) begin(x), end(x)\n#define allr(x) rbegin(x), rend(x)\n#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)\n#define rep3(i, m, n) for (int i = (m); (i) < (int)(n); i++)\n#define repr(i, n) for (int i = (n) - 1; (i) >= 0; i--)\n#define rep3r(i, m, n) for (int i = (n) - 1; (i) >= (int)(m); i--)\ntemplate<class T> inline bool chmax(T & a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T & a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\nstruct Graph {\n struct Edge {\n int rev, from, to, cap;\n Edge(int r, int f, int t, int c) : rev(r), from(f), to(t), cap(c) {}\n };\n vvc<Edge> list;\n Graph(int N) : list(N) {}\n size_t size() {\n return list.size();\n }\n vc<Edge>& operator [] (int i) {\n return list[i];\n }\n Edge& redge(const Edge& e) {\n return list[e.to][e.rev];\n }\n void run_flow(Edge& e, int f) {\n e.cap -= f;\n redge(e).cap += f;\n }\n void addedge(int from, int to, int cap) {\n int fromrev = (int)list[from].size();\n int torev = (int)list[to].size();\n list[from].push_back(Edge(torev, from, to, cap));\n list[to].push_back(Edge(fromrev, to, from, 0));\n }\n};\nstruct FordFulkerson {\n static const int INF = 1 << 30;\n vc<int> seen;\n FordFulkerson() {}\n int fodfs(Graph& G, int v, int t, int f) {\n if (v == t) return f;\n seen[v] = true;\n for (auto& e : G[v]) {\n if (seen[e.to]) continue;\n if (e.cap == 0) continue;\n int flow = fodfs(G, e.to, t, min(f, e.cap));\n if (flow == 0) continue;\n G.run_flow(e, flow);\n return flow;\n }\n return 0;\n }\n int solve(Graph& G, int s, int t) {\n int res = 0;\n while (true) {\n seen.assign((int)G.size(), 0);\n int flow = fodfs(G, s, t, INF);\n if (flow == 0) return res;\n res += flow;\n }\n return 0;\n }\n};\n\nsigned main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int N;\n cin >> N;\n vc<string> str(N);\n rep (i, N) cin >> str[i];\n\n sort(all(str), [](string &s1, string &s2) {\n return s1.size() < s2.size();\n });\n\n Graph G(N+2);\n unordered_map<string, int> mp;\n rep (i, N) {\n rep (j, str[i].size()) {\n if (mp.count(str[i].substr(0, j) + str[i].substr(j+1))) {\n int t = mp[str[i].substr(0, j) + str[i].substr(j+1)];\n G.addedge(i, t, 1);\n G.addedge(t, i, 1);\n }\n }\n mp[str[i]] = i;\n }\n\n rep (i, N) {\n if (str[i].size() % 2 == 0) G.addedge(N, i, 1);\n else G.addedge(i, N+1, 1);\n }\n\n cout << FordFulkerson().solve(G, N, N+1) << endl;\n}", "accuracy": 0.39285714285714285, "time_ms": 70, "memory_kb": 20600, "score_of_the_acc": -0.1246, "final_rank": 20 }, { "submission_id": "aoj_0424_5038378", "code_snippet": "#line 1 \"a.cpp\"\n#include<iostream>\n#include<map>\nusing namespace std;\n#line 1 \"/home/kotatsugame/library/graph/bimatch.cpp\"\n#include<algorithm>\n#include<vector>\nstruct bimatch{\n\tint n;\n\tvector<vector<int> >G;\n\tvector<int>match;\n\tvector<bool>used;\n\tbimatch(int _n=0):n(_n),G(n),match(n),used(n){}\n\tvoid add_edge(int u,int v)\n\t{\n\t\tG[u].push_back(v);\n\t\tG[v].push_back(u);\n\t}\n\tbool dfs(int v)\n\t{\n\t\tused[v]=true;\n\t\tfor(int u:G[v])\n\t\t\n\t\t{\n\t\t\tint w=match[u];\n\t\t\tif(w<0||!used[w]&&dfs(w))\n\t\t\t{\n\t\t\t\tmatch[v]=u;\n\t\t\t\tmatch[u]=v;\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}\n\tint count()\n\t{\n\t\tint ans=0;\n\t\tbool flag=true;\n\t\tfill(match.begin(),match.end(),-1);\n\t\twhile(flag)\n\t\t{\n\t\t\tflag=false;\n\t\t\tfill(used.begin(),used.end(),false);\n\t\t\tfor(int v=0;v<n;v++)if(match[v]<0&&dfs(v))ans++,flag=true;\n\t\t}\n\t\treturn ans;\n\t}\n};\n#line 5 \"a.cpp\"\nint N;\nmap<string,int>mp[11];\nmain()\n{\n\tcin>>N;\n\tfor(int i=0;i<N;i++)\n\t{\n\t\tstring s;cin>>s;\n\t\tmp[s.size()][s]=i;\n\t}\n\tbimatch P(N);\n\tfor(int i=2;i<=10;i++)for(pair<string,int>p:mp[i])\n\t{\n\t\tstring s=p.first;\n\t\tfor(int j=0;j<s.size();j++)\n\t\t{\n\t\t\tstring t=s.substr(0,j)+s.substr(j+1);\n\t\t\tif(mp[i-1].find(t)!=mp[i-1].end())\n\t\t\t{\n\t\t\t\tP.add_edge(p.second,mp[i-1][t]);\n\t\t\t}\n\t\t}\n\t}\n\tcout<<P.count()<<endl;\n}", "accuracy": 1, "time_ms": 380, "memory_kb": 29292, "score_of_the_acc": -0.3132, "final_rank": 4 }, { "submission_id": "aoj_0424_4927162", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n#include <unordered_map>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;\n\nusing u64 = unsigned long long;\n#include <chrono>\nconstexpr u64 M = (1UL << 61) - 1;\nconstexpr u64 POSITIVISER = M * 3;\nconstexpr u64 MASK30 = (1UL << 30) - 1;\nconstexpr u64 MASK31 = (1UL << 31) - 1;\n\nclass rolling_hash_u64 {\n static u64 get_base(){\n u64 z = (static_cast<uint64_t>((chrono::system_clock::now().time_since_epoch().count())&((1LL << 32)-1)))+0x9e3779b97f4a7c15;\n z = (z ^ (z >> 30)) * 0xbf58476d1ce4e5b9;\n z = (z ^ (z >> 27)) * 0x94d049bb133111eb;\n return z;\n }\n\n static u64 &B() {\n static u64 B_ = (get_base())%(M-2)+2;\n return B_;\n }\n\n static inline u64 calc_mod(u64 val){\n val = (val & M) + (val >> 61);\n if(val > M) val -= M;\n return val;\n }\npublic:\n vector<u64> hash;\n static vector<u64> &p() {\n static vector<u64> p_{1, B()};\n return p_;\n }\n\n static inline u64 mul(u64 x, u64 y){\n u64 a = x >> 31, b = x & MASK31, c = y >> 31, d = y & MASK31, e = b*c+a*d;\n return (a*c << 1) + b*d + ((e & MASK30) << 31) + (e >> 30);\n }\n\n explicit rolling_hash_u64(const string &s) {\n if(p().size() <= s.size()){\n int l = p().size();\n p().resize(s.size()+1);\n for (int i = l; i < p().size(); ++i) {\n p()[i] = calc_mod(mul(p()[i-1], p()[1]));\n }\n }\n hash.resize(s.size()+1, 0);\n for (int i = 0; i < s.size(); ++i) {\n hash[i+1] = calc_mod(mul(hash[i],B()) + s[i]);\n }\n };\n\n u64 get(int l, int r){\n return calc_mod(hash[r] + POSITIVISER - mul(hash[l], p()[r-l]));\n }\n\n static u64 val(string &s){\n if(p().size() <= s.size()){\n int l = p().size();\n p().resize(s.size()+1);\n for (int i = l; i < p().size(); ++i) {\n p()[i] = calc_mod(mul(p()[i-1], p()[1]));\n }\n }\n u64 ret = 0;\n for (int i = 0; i < s.size(); ++i) {\n ret = calc_mod(mul(ret, B()) + s[i]);\n }\n return ret;\n }\n};\n\ntemplate<class T, bool directed>\nclass Dinic {\n void bfs(int s){\n fill(level.begin(),level.end(), -1);\n queue<int> Q;\n level[s] = 0;\n Q.emplace(s);\n while(!Q.empty()){\n int v = Q.front(); Q.pop();\n for (auto &&e : G[v]){\n if(e.cap > 0 && level[e.to] < 0){\n level[e.to] = level[v] + 1;\n Q.emplace(e.to);\n }\n }\n }\n }\n\n T dfs(int v, int t, T f){\n if(v == t) return f;\n for(int &i = iter[v]; i < G[v].size(); i++){\n edge &e = G[v][i];\n if(e.cap > 0 && level[v] < level[e.to]){\n T d = dfs(e.to, t, min(f, e.cap));\n if(d == 0) continue;\n e.cap -= d;\n G[e.to][e.rev].cap += d;\n return d;\n }\n }\n return 0;\n }\npublic:\n struct edge {\n int to{}; T cap; int rev{};\n edge() = default;\n edge(int to, T cap, int rev) : to(to), cap(cap), rev(rev) {}\n };\n\n vector<vector<edge>> G;\n vector<int> level, iter;\n Dinic() = default;\n explicit Dinic(int n) : G(n), level(n), iter(n) {}\n\n void add_edge(int from, int to, int cap){\n G[from].emplace_back(to, cap, G[to].size());\n G[to].emplace_back(from, directed ? 0 : cap, G[from].size()-1);\n }\n\n\n T flow(int s, int t, T lim = INF<T>){\n T ret = 0;\n while(true) {\n bfs(s);\n if(level[t] < 0 || lim == 0) break;\n fill(iter.begin(),iter.end(), 0);\n while(true){\n T f = dfs(s, t, lim);\n if(f == 0) break;\n ret += f;\n lim -= f;\n }\n }\n return ret;\n }\n};\n\nint main() {\n int n;\n cin >> n;\n vector<string> v(n);\n unordered_map<u64, int> m;\n Dinic<int, true> G(n+2);\n for (int i = 0; i < n; ++i) {\n cin >> v[i];\n m[rolling_hash_u64::val(v[i])] = i;\n }\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < v[i].size(); ++j) {\n string s = v[i].substr(0, j) + v[i].substr(j+1, 10);\n auto p = m.find(rolling_hash_u64::val(s));\n if(p != m.end()){\n if(v[i].size()&1) G.add_edge(i+1, p->second+1, 1);\n else G.add_edge(p->second+1, i+1, 1);\n }\n }\n if(v[i].size()&1) G.add_edge(0, i+1, 1);\n else G.add_edge(i+1, n+1, 1);\n }\n cout << G.flow(0, n+1) << \"\\n\";\n return 0;\n}", "accuracy": 1, "time_ms": 230, "memory_kb": 51360, "score_of_the_acc": -0.4733, "final_rank": 5 }, { "submission_id": "aoj_0424_4778778", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing UL=unsigned int;\nusing LL=long long;\nusing ULL=unsigned long long;\n#define rep(i,n) for(int i=0; i<(n); i++)\n\nint N;\nvector<string> S1;\nvector<string> S0;\nmap<string,int> Search1;\nmap<string,int> Search0;\n\nvector<pair<int,int>> J;\n\nint fFlow = 0;\n\nstruct Edge{ int u,v,r,c; };\nvector<Edge> fJ;\nvector<int> fE[100002];\nint fD[100002];\nbool fF[100002];\n\nvoid addEdge(int u, int v){\n fE[u].push_back(fJ.size());\n fJ.push_back({u,v,(int)fJ.size()+1,1});\n fE[v].push_back(fJ.size());\n fJ.push_back({v,u,(int)fJ.size()-1,0});\n}\n\nint fDFS(int p=100000, int c=1000000){\n if(p == 100001) return c;\n int f = 0;\n for(int e : fE[p]){\n if(fJ[e].c==0) continue;\n if(fD[fJ[e].v] != fD[p]+1) continue;\n if(fF[fJ[e].v]) continue;\n int res = fDFS(fJ[e].v,min(c-f,fJ[e].c));\n fJ[e].c -= res;\n fJ[fJ[e].r].c += res;\n f += res;\n if(f==c){ fF[p]=true; return f; }\n }\n fF[p]=true;\n return f;\n}\n\nbool flow(){\n static const int st = 100000;\n static const int sz = 100002;\n rep(i,sz){ fD[i] = -1; fF[i] = false; }\n queue<int> Q; Q.push(st); fD[st] = 0;\n while(Q.size()){\n int p = Q.front(); Q.pop();\n for(int e : fE[p]){\n if(fJ[e].c==0) continue;\n if(fD[fJ[e].v] != -1) continue;\n fD[fJ[e].v] = fD[p]+1;\n Q.push(fJ[e].v);\n }\n }\n int res = fDFS();\n fFlow += res;\n return res != 0;\n}\n\nint main(){\n\n cin >> N;\n rep(i,N){\n string S; cin>>S;\n if(S.size()%2){ Search1[S]=S1.size(); S1.push_back(S); }\n else{ Search0[S]=S0.size(); S0.push_back(S); }\n }\n\n rep(i,S1.size()){\n string tmp = S1[i].substr(1,string::npos);\n rep(c,tmp.size()+1){\n if(c) tmp[c-1] = S1[i][c-1];\n auto f = Search0.find(tmp);\n if(f != Search0.end()) J.push_back({ i,f->second+S1.size() });\n }\n }\n rep(i,S0.size()){\n string tmp = S0[i].substr(1,string::npos);\n rep(c,tmp.size()+1){\n if(c) tmp[c-1] = S0[i][c-1];\n auto f = Search1.find(tmp);\n if(f != Search1.end()) J.push_back({ f->second,i+S1.size() });\n }\n }\n\n for(auto& j:J) addEdge(j.first,j.second);\n rep(i,S1.size()) addEdge(100000,i);\n rep(i,S0.size()) addEdge(i+S1.size(),100001);\n\n while(flow());\n cout << fFlow << endl;\n\n return 0;\n}", "accuracy": 1, "time_ms": 610, "memory_kb": 71116, "score_of_the_acc": -0.7915, "final_rank": 13 }, { "submission_id": "aoj_0424_4088617", "code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\nusing i64 = long long;\nconst i64 MOD = 1e9+7;\nconst i64 INF = 1e18+7;\n\n\ntemplate <typename T>\nbool chmin(T& x, T y){\n if(x > y){\n x = y;\n return true;\n }\n return false;\n}\n\ntemplate <typename T>\nbool chmax(T& x, T y){\n if(x < y){\n x = y;\n return true;\n }\n return false;\n}\n\n\ntemplate <typename T>\nstruct Dinic{\n struct Edge{\n int to, rev;\n T cap;\n Edge(int to, T cap, int rev) : to(to), rev(rev), cap(cap){}\n };\n\n vector<vector<Edge>> edges;\n T _inf;\n vector<T> min_cost;\n vector<int> cnt;\n\n Dinic(int n) : edges(n), _inf(numeric_limits<T>::max()){}\n\n void add(int from, int to, T cap){\n edges[from].emplace_back(to, cap, static_cast<int>(edges[to].size()));\n edges[to].emplace_back(from, 0, static_cast<int>(edges[from].size()) - 1);\n }\n\n bool bfs(int s, int t){\n min_cost.assign(edges.size(), -1);\n queue<int> que;\n min_cost[s] = 0;\n que.emplace(s);\n while(!que.empty() && min_cost[t] == -1){\n int x = que.front();\n que.pop();\n for(auto& ed : edges[x])\n if(ed.cap > 0 && min_cost[ed.to] == -1){\n min_cost[ed.to] = min_cost[x] + 1;\n que.emplace(ed.to);\n }\n }\n return min_cost[t] != -1;\n }\n\n T dfs(int idx, int t, T flow){\n if(idx == t)\n return flow;\n T ret = 0;\n while(cnt[idx] < edges[idx].size()){\n auto& ed = edges[idx][cnt[idx]];\n if(ed.cap > 0 && min_cost[idx] < min_cost[ed.to]){\n T d = dfs(ed.to, t, min(flow, ed.cap));\n ed.cap -= d;\n edges[ed.to][ed.rev].cap += d;\n ret += d;\n flow -= d;\n if(flow == 0)\n break;\n }\n ++cnt[idx];\n }\n return ret;\n }\n\n T solve(int s, int t){\n T flow = 0;\n while(bfs(s, t)){\n cnt.assign(edges.size(), 0);\n T f = 0;\n while((f = dfs(s, t, _inf)) > 0)\n flow += f;\n }\n return flow;\n }\n\n};\n\n\nsigned main(){\n int n;\n cin >> n;\n vector<string> s(n);\n for(auto& x : s)\n cin >> x;\n unordered_map<string, int> m;\n for(int i = 0; i < n; ++i)\n m[s[i]] = i;\n\n Dinic<int> d(n + 2);\n for(int i = 0; i < n; ++i){\n if(s[i].size() % 2 == 0)\n d.add(n, i, 1);\n else\n d.add(i, n + 1, 1);\n }\n\n for(int i = 0; i < n; ++i){\n for(int j = 0; j < s[i].size(); ++j){\n string t = s[i].substr(0, j) + s[i].substr(j + 1);\n if(m.find(t) != m.end()){\n int i1 = i, i2 = m[t];\n if(s[i].size() % 2)\n swap(i1, i2);\n d.add(i1, i2, 1);\n }\n }\n }\n cout << d.solve(n, n + 1) << endl;\n}", "accuracy": 1, "time_ms": 430, "memory_kb": 55712, "score_of_the_acc": -0.5829, "final_rank": 10 }, { "submission_id": "aoj_0424_4048647", "code_snippet": "#include <bits/stdc++.h>\n\nint ri() {\n\tint n;\n\tscanf(\"%d\", &n);\n\treturn n;\n}\n\n/* copied from https://gist.github.com/MiSawa/9759784 */\n/* edited by QCFium */\nstruct Dinic {\nprivate:\n\ttypedef int64_t Cap;\n\tstatic const Cap INF = 1000000000000000000;\n\t\n\tstruct LCNode {\n\t\ttypedef LCNode *Ptr;\n\t\tPtr ch[2], par, min_node;\n\t\tCap val, min_val, lazy;\n\t\tint name;\n\t\tLCNode() : par(0), min_node(this), val(INF), min_val(INF), lazy(0) {\n\t\t\tch[0] = ch[1] = 0;\n\t\t}\n\t\tinline void push() {\n\t\t\tif (lazy == 0) return;\n\t\t\tval += lazy; min_val += lazy;\n\t\t\tfor (int i = 0; i < 2; i++) if (ch[i]) ch[i]->lazy += lazy;\n\t\t\tlazy = 0;\n\t\t}\n\t\tinline void update() {\n\t\t\tpush();\n\t\t\tif (ch[0]) {\n\t\t\t\tmin_val = ch[0]->min_val + ch[0]->lazy;\n\t\t\t\tmin_node = ch[0]->min_node;\n\t\t\t}\n\t\t\tif (!ch[0] || min_val > val) {\n\t\t\t\tmin_val = val; min_node = this;\n\t\t\t}\n\t\t\tif (ch[1] && min_val > ch[1]->min_val + ch[1]->lazy) {\n\t\t\t\tmin_val = ch[1]->min_val + ch[1]->lazy;\n\t\t\t\tmin_node = ch[1]->min_node;\n\t\t\t}\n\t\t}\n\t\tinline void set_value(Cap v) { expose(); val = v; update(); }\n\t\tinline Cap get_value() { expose(); return val; }\n\t\tinline Ptr get_min_node_on_path() { expose(); return min_node; }\n\t\tinline void add_to_path(Cap c) { expose(); lazy += c; push(); }\n\t\tinline int state() {\n\t\t\tif(par && par->ch[0] == this) return -1;\n\t\t\tif(par && par->ch[1] == this) return +1;\n\t\t\treturn 0;\n\t\t}\n\t\tinline void rotate() {\n\t\t\tPtr p = par; p->push(); push();\n\t\t\tbool lr = state()+1;\n\t\t\tif (p->state()) p->par->ch[p->state()>0] = this;\n\t\t\tpar = p->par;\n\t\t\tp->ch[lr] = ch[!lr];\n\t\t\tif (ch[!lr]) ch[!lr]->par = p;\n\t\t\t(p->par = this)->ch[!lr] = p;\n\t\t\tp->update(); update();\n\t\t}\n\t\tinline void splay() {\n\t\t\twhile (state()) {\n\t\t\t\tint s = state() * par->state();\n\t\t\t\tif (s) (s == 1 ? par : this)->rotate();\n\t\t\t\trotate();\n\t\t\t}\n\t\t\tpush();\n\t\t}\n\t\tinline void expose() {\n\t\t\tif (!par) return;\n\t\t\tfor (Ptr p = this; p; p = p->par) p->splay();\n\t\t\tfor (Ptr p = this; p->par; p = p->par) p->par->ch[1] = p;\n\t\t\tsplay();\n\t\t}\n\t\tinline void cut() {\n\t\t\texpose();\n\t\t\tif (!ch[0]) return;\n\t\t\tch[0]->par = 0;\n\t\t\tch[0]->push();\n\t\t\tch[0] = 0;\n\t\t\tupdate();\n\t\t}\n\t\tinline void link_to(Ptr p) {\n\t\t\texpose();\n\t\t\tpar = p;\n\t\t}\n\t\tinline Ptr find_root() {\n\t\t\texpose();\n\t\t\tPtr p = this;\n\t\t\twhile (p->ch[0]) p = p->ch[0];\n\t\t\tp->expose();\n\t\t\treturn p;\n\t\t}\n\t};\n\tstruct E{\n\t\tint dst;\n\t\tCap cap;\n\t\tint rev;\n\t\tE(int dst, Cap cap, int rev) : dst(dst), cap(cap), rev(rev) {}\n\t};\n\tint n;\n\tstd::vector<std::vector<E> > g;\n\tstd::vector<int> level, active;\n\tstd::vector<LCNode> lc;\n\tinline void unuse_edge(E &e) {\n\t\tE &ee = g[e.dst][e.rev]; int u = ee.dst;\n\t\tCap use = ee.cap - lc[u].get_value();\n\t\te.cap += use; ee.cap -= use;\n\t\tactive[u] = false;\n\t\tlc[u].cut(); lc[u].set_value(INF);\n\t}\n\tinline void init(){\n\t\tlc.resize(n);\n\t\tactive.assign(n, false);\n\t\tfor (int i = 0; i < n; i++) lc[i].name = i;\n\t}\n\tCap dfs(const int &s, const int &t) {\n\t\tstd::vector<int> iter(n);\n\t\tfor (int i = 0; i < n; i++) iter[i] = (int) (g[i].size()) - 1;\n\t\tCap res = 0;\n\n\t\twhile(1) {\n\t\t\tconst int &u = lc[t].find_root()->name;\n\t\t\tif (u == s) {\n\t\t\t\tCap f = lc[t].get_min_node_on_path()->get_value();\n\t\t\t\tres += f;\n\t\t\t\tlc[t].add_to_path(-f);\n\t\t\t\twhile (1) {\n\t\t\t\t\tint v = lc[t].get_min_node_on_path()->name;\n\t\t\t\t\tCap f = lc[v].get_value();\n\t\t\t\t\tif (f > 0) break;\n\t\t\t\t\tunuse_edge(g[v][iter[v]]);\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tfor (int &i = iter[u]; i >= 0; i--) {\n\t\t\t\t\tE &e = g[u][i], &ee = g[e.dst][e.rev]; int v = e.dst;\n\t\t\t\t\tif (level[u] - 1 != level[v] || ee.cap <= 0) continue;\n\t\t\t\t\tactive[u] = true;\n\t\t\t\t\tlc[u].set_value(ee.cap);\n\t\t\t\t\tlc[u].link_to(&lc[v]);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (active[u]) continue;\n\t\t\t\tif (u == t) break;\n\t\t\t\tlevel[u] = -1;\n\t\t\t\tfor (auto& e : g[u]) if (active[e.dst] && iter[e.dst] == e.rev)\n\t\t\t\t\tunuse_edge(g[e.dst][e.rev]);\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < n; i++) if (active[i]) unuse_edge(g[i][iter[i]]);\n\t\treturn res;\n\t}\n\npublic:\n\tDinic(int n) : n(n), g(n) {}\n\tinline void add_hen(int src, int dst, Cap cap, bool direct) {\n\t\tif (src == dst) return;\n\t\tg[src].push_back(E(dst, cap, g[dst].size()));\n\t\tg[dst].push_back(E(src, direct ? 0 : cap , g[src].size() - 1));\n\t}\n\tCap run(int s, int t) { // O(NMlogN)\n\t\tinit();\n\t\tstd::vector<int> q(n);\n\t\tfor (Cap flow = 0; ; ) {\n\t\t\tlevel.assign(n, -1);\n\t\t\tint ql = 0, qr = 0;\n\t\t\tlevel[q[qr++] = s] = 0;\n\t\t\twhile (ql != qr && level[t] == -1) {\n\t\t\t\tint u = q[ql++];\n\t\t\t\tfor (auto& e : g[u]) if (e.cap > 0 && level[e.dst] == -1)\n\t\t\t\t\tlevel[q[qr++] = e.dst] = level[u] + 1;\n\t\t\t}\n\t\t\tif (level[t] == -1) return flow;\n\t\t\tflow += dfs(s, t);\n\t\t}\n\t}\n};\n\n\nint main() {\n\tint n = ri();\n\tstd::string s[n];\n\tfor (auto &i : s) std::cin >> i;\n\tstd::sort(s, s + n);\n\t\n\tstd::map<std::string, int> odd, even;\n\tint odds = 0, evens = 0;\n\tfor (int i = 0; i < n; i++) {\n\t\tif (s[i].size() & 1) odd[s[i]] = odds++;\n\t\telse even[s[i]] = evens++;\n\t}\n\t\n\tDinic dinic(n + 2);\n\tint cnt = 0;\n\tfor (auto &i : odd) {\n\t\tfor (int j = 0; j < (int) i.first.size(); j++) {\n\t\t\tstd::string cur = i.first;\n\t\t\tcur.erase(cur.begin() + j);\n\t\t\tif (even.count(cur)) dinic.add_hen(cnt + 1, even[cur] + odds + 1, 1, true);\n\t\t}\n\t\tcnt++;\n\t}\n\tcnt = 0;\n\tfor (auto &i : even) {\n\t\tfor (int j = 0; j < (int) i.first.size(); j++) {\n\t\t\tstd::string cur = i.first;\n\t\t\tcur.erase(cur.begin() + j);\n\t\t\tif (odd.count(cur)) dinic.add_hen(odd[cur] + 1, cnt + odds + 1, 1, true);\n\t\t}\n\t\tcnt++;\n\t}\n\tfor (int i = 1; i <= odds; i++) dinic.add_hen(0, i, 1, true);\n\tfor (int i = odds + 1; i <= n; i++) dinic.add_hen(i, n + 1, 1, true);\n\tstd::cout << dinic.run(0, n + 1) << std::endl;\n\t\n\treturn 0;\n}", "accuracy": 1, "time_ms": 470, "memory_kb": 93304, "score_of_the_acc": -0.9561, "final_rank": 15 }, { "submission_id": "aoj_0424_4015982", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 100005\n\nint V; //頂点数\nstring name[SIZE];\nmap<string,int> MAP;\n\nstruct Edge{\n\tEdge(int arg_to,int arg_capacity,int arg_rev_index){\n\t\tto = arg_to;\n\t\tcapacity = arg_capacity;\n\t\trev_index = arg_rev_index;\n\t}\n\tint to,capacity,rev_index;\n};\n\nvector<Edge> G[SIZE]; //グラフの隣接リスト表現\nint dist[SIZE]; //sourceからの距離\nint cheked_index[SIZE]; //どこまで調べ終わったか\n\n//fromからtoへ向かう容量capacityの辺をグラフに追加する\nvoid add_edge(int from,int to,int capacity){\n\tG[from].push_back(Edge(to,capacity,G[to].size()));\n\tG[to].push_back(Edge(from,0,G[from].size()-1)); //逆辺の、初期容量は0\n}\n\n//sourceからの最短距離をBFSで計算する\nvoid bfs(int source){\n\tfor(int i = 0; i < V; i++)dist[i] = -1;\n\tqueue<int> Q;\n\tdist[source] = 0;\n\tQ.push(source);\n\n\twhile(!Q.empty()){\n\t\tint node_id = Q.front();\n\t\tQ.pop();\n\t\tfor(int i = 0; i < G[node_id].size(); i++){\n\t\t\tEdge &e = G[node_id][i];\n\t\t\tif(e.capacity > 0 && dist[e.to] < 0){ //辺の容量が正で、かつエッジの行先に未訪問の場合\n\t\t\t\tdist[e.to] = dist[node_id]+1;\n\t\t\t\tQ.push(e.to);\n\t\t\t}\n\t\t}\n\t}\n}\n\n//増加パスをDFSで探す\nint dfs(int node_id,int sink,int flow){\n\tif(node_id == sink)return flow; //終点についたらflowをreturn\n\n\tfor(int &i = cheked_index[node_id]; i < G[node_id].size(); i++){ //node_idから出ているエッジを調査\n\t\tEdge &e = G[node_id][i];\n\t\tif(e.capacity > 0 && dist[node_id] < dist[e.to]){ //流せる余裕があり、かつsourceからの距離が増加する方法である場合\n\t\t\tint tmp_flow = dfs(e.to,sink,min(flow,e.capacity)); //流せるだけ流す\n\t\t\tif(tmp_flow > 0){ //流せた場合\n\t\t\t\te.capacity -= tmp_flow; //流した分、エッジの容量を削減する\n\t\t\t\tG[e.to][e.rev_index].capacity += tmp_flow; //逆辺の容量を、流した分だけ増加させる\n\t\t\t\treturn tmp_flow;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\n\n//sourceからsinkへの最大流を求める\nint max_flow(int source,int sink){ //source:始点 sink:終点\n\tint flow = 0,add;\n\twhile(true){ //増加パスが存在する限り、流量を追加し続ける\n\t\tbfs(source);\n\t\tif(dist[sink] < 0)break; //sourceからsinkへと辿り着く残余グラフがない、つまり増加パスが無くなった場合、break\n\t\tfor(int i = 0; i < V; i++)cheked_index[i] = 0;\n\t\twhile((add = dfs(source,sink,BIG_NUM)) > 0){ //増加パスが見つかる間、加算\n\t\t\tflow += add;\n\t\t}\n\t}\n\treturn flow;\n}\n\n\n\n\nint main(){\n\n\tscanf(\"%d\",&V);\n\n\tint source = V,sink = V+1;\n\n\tfor(int i = 0; i < V; i++){\n\n\t\tcin >> name[i];\n\t\tif(name[i].length()%2 == 0){\n\n\t\t\tadd_edge(source,i,1);\n\n\t\t}else{\n\n\t\t\tadd_edge(i,sink,1);\n\t\t}\n\n\t\tMAP[name[i]] = i;\n\t}\n\n\tfor(int i = 0; i < V; i++){\n\t\tfor(int loc = 0; loc < name[i].length(); loc++){\n\n\t\t\tstring tmp = name[i];\n\t\t\ttmp.erase(tmp.begin()+loc);\n\n\t\t\tauto at = MAP.find(tmp);\n\t\t\tif(at != MAP.end()){\n\n\t\t\t\tif(name[i].length()%2 == 0){\n\n\t\t\t\t\tadd_edge(i,MAP[tmp],1);\n\t\t\t\t}else{\n\n\t\t\t\t\tadd_edge(MAP[tmp],i,1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tV += 2;\n\n\tprintf(\"%d\\n\",max_flow(source,sink));\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 770, "memory_kb": 59324, "score_of_the_acc": -0.7331, "final_rank": 12 } ]
aoj_0420_cpp
Digit K At the Aizu Akabeko store, we sell a unique "lottery" called Digit K. Each lottery ticket has $N$ numbers in a row, going from left to right. The numbers written on them are from 1 to 9. The purchaser of a lottery ticket can eliminate $K$ numbers from these numbers and earn points for the number of $N-K$ numbers remaining, arranged in order from left to right. For example, if $K=3$ and the lottery says 1414213, the player can choose 1, 1, and 2 from the left and eliminate them to earn 4413 points. Given a sequence of numbers and an integer $K$, write a program that outputs the maximum number of points that can be earned. Input The input is given in the following form. $N$ $K$ $a_1$ $a_2$ ... $a_N$ The first line gives the number of numbers $N$ ($1 \leq N \leq 200,000$) and the integer $K$ ($0 \leq K < N$). The second line gives $N$ numbers $a_i$ ($1 \leq a_i \leq 9$) written in the lottery. Output Output the maximum value of points in a line. Sample Input and Output Sample Input 1 7 3 1 4 1 4 2 1 3 Sample Output 1 4423 Sample Input 2 4 1 1 1 9 9 Sample Output 2 199
[ { "submission_id": "aoj_0420_11012035", "code_snippet": "#include <iostream>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <algorithm>\n#include <set>\n#include <map>\nusing ll = long long;\nusing namespace std;\n\nint main(){\n\tint N, K;\n\tcin >> N >> K;\n\tvector<int> A(N);\n\tfor (int i = 0; i < N; i++) cin >> A[i];\n\tvector<int> B;\n\tfor (int i = 0; i < N; i++) {\n\t\twhile (!B.empty() && K > 0 && B.back() < A[i]) {\n\t\t\tB.pop_back();\n\t\t\tK--;\n\t\t}\n\tB.push_back(A[i]);\n\t}\n\twhile (K > 0) {\n\t\tB.pop_back();\n\t\tK--;\n\t}\n\tfor (int d : B) cout << d;\n\tcout <<endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5344, "score_of_the_acc": -0.0584, "final_rank": 3 }, { "submission_id": "aoj_0420_10997431", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)\n\nint main() {\n\tcin.tie(nullptr);\n\tios_base::sync_with_stdio(false);\n\t\n\tint N, K;\n\tcin >> N >> K;\n\tK = N - K;\n\tvector<pair<int, int>> A(N);\n\trep(i, 0, N) {\n\t\tcin >> A[i].first;\n\t\tA[i].second = -i - 1;\n\t}\n\t\n\tpriority_queue<pair<int, int>> que;\n\trep(i, 0, N - K + 1) que.push(A[i]);\n\tint now = -1;\n\trep(i, 0, K) {\n\t\twhile (true) {\n\t\t\tint idx = -que.top().second - 1;\n\t\t\tif (idx <= now) que.pop();\n\t\t\telse {\n\t\t\t\tnow = idx;\n\t\t\t\tcout << que.top().first;\n\t\t\t\tque.pop();\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\t\n\t\tif (i != K - 1) que.push(A[N - K + i + 1]);\n\t}\n\tcout << '\\n';\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 6712, "score_of_the_acc": -0.2609, "final_rank": 7 }, { "submission_id": "aoj_0420_10853134", "code_snippet": "#include <bits/stdc++.h>\n//#include\"atcoder/all\"\n#define rep(i,n) for(int i=0;i<n;i++)\nusing namespace std;\n//using namespace atcoder;\n#define all(a) a.begin(),a.end()\n//#define int long long\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef pair<int,int> P;\ntypedef pair<P,P> PP;\n//const int inf=1ll<<55;\nconst ll mod=1000000007;\nint a[200006];\n\nstruct RMQ{\n\tvector<P>node;\n\tint n;\n\tvoid init(int N){\n\t\tn=1;\n\t\twhile(n<N)n*=2;\n\t\tnode.resize(2*n);\n\t}\n\tvoid upd(int i,int x){\n\t\ti+=n-1;\n\t\tnode[i]=P(x,i-n+1);\n\t\twhile(i){\n\t\t\ti=(i-1)/2;\n\t\t\tif(node[i*2+1].first>=node[i*2+2].first)\n\t\t\tnode[i]=node[i*2+1];\n\t\t\telse node[i]=node[i*2+2];\n\t\t}\n\t}\n\tP calc(int a,int b,int k,int l,int r){\n\t\tif(r<=a||b<=l)return P(0,0);\n\t\tif(a<=l&&r<=b)return node[k];\n\t\tP vl=calc(a,b,k*2+1,l,(l+r)/2);\n\t\tP vr=calc(a,b,k*2+2,(l+r)/2,r);\n\t\tif(vl.first>=vr.first)return vl;\n\t\treturn vr;\n\t}\n\tP get(int a,int b){\n\t\treturn calc(a,b,0,0,n);\n\t}\n};\nRMQ r;\nsigned main(){\n\tint n,k;cin>>n>>k;\n\tr.init(n);\n\trep(i,n){\n\t\tcin>>a[i];r.upd(i,a[i]);\n\t}\n\t\n\tvector<int>ans;\n\tint L=0;\n\trep(i,n-k){\n\t\tint R=k+i;\n\t\tP res=r.get(L,R+1);\n\t\tans.push_back(res.first);\n\t\tL=res.second+1;\n\t}\n\trep(i,ans.size())cout<<ans[i];cout<<endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 8532, "score_of_the_acc": -0.483, "final_rank": 13 }, { "submission_id": "aoj_0420_9806193", "code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nint main()\n{\n int n,k;\n cin >> n >> k;\n vector<int>a(n);\n for(int i=0;i<n;i++)cin >> a[i];\n vector<vector<int>>num(9);\n for(int i=0;i<n;i++)num[a[i]-1].emplace_back(i);\n int now=-1;\n k=n-k;\n for(;k--;){\n for(int t=8;t>=0;t--){\n int left=-1,right=num[t].size();\n while(left+1!=right){\n int mokuteki=(left+right)/2;\n if(num[t][mokuteki]<=now)left=mokuteki;\n else right=mokuteki;\n }\n if(right!=num[t].size() && num[t][right]+k<n){\n cout << t+1;\n now=num[t][right];\n break;\n }\n }\n }\n cout << endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 5060, "score_of_the_acc": -0.3317, "final_rank": 9 }, { "submission_id": "aoj_0420_9796696", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(n);++i)\nusing namespace std;\nusing ll = long long;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n int n,k;\n cin >> n >> k;\n vector<int> a(n);\n rep(i,n) cin >> a[i];\n\n vector<vector<int>> b(10);\n rep(i,n){\n b[a[i]].push_back(i);\n }\n\n int now = 0;\n int x = k;\n rep(i,n-k){\n for(int j=9;j>=0;j--){\n auto it = lower_bound(b[j].begin(),b[j].end(),now);\n if(it == b[j].end()) continue;\n int id = *it;\n if(id-now<=x){\n x -= id-now;\n now = id+1;\n cout << j;\n break;\n }\n }\n }\n cout << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5160, "score_of_the_acc": -0.0504, "final_rank": 2 }, { "submission_id": "aoj_0420_9785717", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nstruct segtree{\n\tvector<pair<int,int>>seg;\n\tint sz;\n\tsegtree(int n){\n\t\tsz = 1;\n\t\twhile(sz <= n)sz *= 2;\n\t\tseg.resize(sz*2-1,{0,sz+1});\n\t}\n\tpair<int,int>f(pair<int,int>a,pair<int,int>b){\n\t\tif(a.first > b.first)return a;\n\t\tif(a.first < b.first)return b;\n\t\tif(a.second < b.second)return a;\n\t\treturn b;\n\t}\n\tpair<int,int> query(int a,int b,int k,int l,int r){\n\t\tif(r <= a||b <= l)return {0,sz+1};\n\t\tif(a <= l&&r <= b)return seg[k];\n\t\treturn f(query(a,b,2*k+1,l,(l+r)/2),query(a,b,2*k+2,(l+r)/2,r));\n\t}\n\tpair<int,int> query(int a,int b){\n\t\treturn query(a,b,0,0,sz);\n\t}\n\tvoid update(int k,pair<int,int> x){\n\t\tk += sz-1;\n\t\tseg[k] = x;\n\t\twhile(k > 0){\n\t\t\tk = (k-1)>>1;\n\t\t\tseg[k] = f(seg[2*k+1],seg[2*k+2]);\n\t\t}\n\t}\n};\nint main(){\n\tint n,k;\n\tcin >>n>>k;\n\tsegtree st(n);\n\tfor(int i = 0;i < n;i++){\n\t\tint x;\n\t\tcin >>x;\n\t\tst.update(i,{x,i});\n\t}\n\tint a = 0;\n\tint c = k+1;\n\tfor(int i = 0;i < n-k;i++){\n\t\tpair<int,int>d = st.query(a,c);\n\t\tc++;\n\t\ta = d.second+1;\n\t\tcout <<d.first;\n\t}\n\tcout <<\"\\n\";\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 7228, "score_of_the_acc": -0.5691, "final_rank": 14 }, { "submission_id": "aoj_0420_9654912", "code_snippet": "#include<bits/stdc++.h>\n\n\nsigned main() {\n\n\tint n, k;\n\n\tstd::cin >> n >> k;\n\n\tstd::vector<int>index[10];\n\t\n\tfor (int i = 1; i <= n; i++) {\n\t\tint digit;\n\t\tstd::cin >> digit;\n\n\t\tindex[digit].push_back(i);\n\t}\n\n\tk = n - k;\n\tstd::vector<int>ans;\n\tfor (int i = 1; k>0&&i <= n; i) {\n\t\tint j = i;\n\t\tfor (int d = 9; d > 0; d--) {\n\t\t\tauto idx = std::lower_bound(index[d].begin(), index[d].end(), i);\n\n\t\t\tif (idx != index[d].end() && n - *idx >= k -1) {\n\t\t\t\tans.push_back(d);\n\t\t\t\ti = *idx + 1;\n\t\t\t\tk--; break;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (auto& i : ans)std::cout << i; std::cout << \"\\n\";\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4768, "score_of_the_acc": -0.1761, "final_rank": 5 }, { "submission_id": "aoj_0420_8871058", "code_snippet": "#include <bits/stdc++.h>\n\nint main() {\n int n, k;\n std::cin >> n >> k;\n std::vector<int> a(n);\n std::vector pos(9, std::vector<int>());\n for (int i = 0; i < n; i++) {\n std::cin >> a[i];\n a[i]--;\n pos[a[i]].push_back(i);\n }\n std::string ans;\n int cur = -1;\n int rem = k;\n while (rem > 0 && (int)ans.size() < n - k) {\n for (int d = 8; d >= 0; d--) {\n auto it = std::upper_bound(pos[d].begin(), pos[d].end(), cur);\n if (it == pos[d].end()) continue;\n int next = *it;\n if (next - cur - 1 <= rem) {\n rem -= next - cur - 1;\n cur = next;\n ans.push_back('1' + d);\n break;\n }\n }\n }\n for (int i = cur + 1; i < n && (int)ans.size() < n - k; i++) ans.push_back('1' + a[i]);\n std::cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 5184, "score_of_the_acc": -0.1943, "final_rank": 6 }, { "submission_id": "aoj_0420_8472244", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n// res[i][c] := i 文字目以降で最初に数字 c が登場する index (存在しないときは n)\nvector<vector<int> > calc_next(const vector<int> &S) {\n int n = (int)S.size();\n vector<vector<int> > res(n + 1, vector<int>(10, n));\n for (int i = n - 1; i >= 0; --i) {\n for (int j = 0; j < 10; ++j) res[i][j] = res[i + 1][j];\n res[i][S[i]] = i;\n }\n return res;\n}\n\nint main(void){\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\tcout << fixed << setprecision(20);\n\tint N, K;\n\tcin >> N >> K;\n\tvector<int> a(N);\n\tfor(int i = 0; i < N; i++) cin >> a[i];\n\tauto nx = calc_next(a);\n\t// 上の桁から貪欲に決定させる\n\tstring ans = \"\";\n\tint pos = 0;\n\tfor(int i = 0; i < N - K; i++){\n\t\tfor(int j = 9; j >= 1; j--){\n\t\t\tint np = nx[pos][j];\n\t\t\tif(N - np < N - K - i) continue;\n\t\t\tans += char(j + '0');\n\t\t\tpos = np + 1;\n\t\t\tbreak;\n\t\t}\n\t}\n\tcout << ans << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 18116, "score_of_the_acc": -0.615, "final_rank": 15 }, { "submission_id": "aoj_0420_7849538", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\nint a,b;\ncin>>a>>b;\nint c[a];\nfor(int i=0;i<a;i+=1){\n cin>>c[i];\n}\nint d[9]={-1,-1,-1,-1,-1,-1,-1,-1,-1};\nint r=0;\nint t=0;\nint t2=0;\nwhile(t2<a&&b!=0){\n while(t<a&&r!=511){\n if(d[c[t]-1]==-1){\n d[c[t]-1]=t;\n }\n int s=round(pow(2,c[t]-1));\n if((r/s)%2==0){\n r+=round(pow(2,c[t]-1));\n }\n t+=1;\n }\n r=511;\n int y=8;\n while(b<d[y]-t2||d[y]==-1){\n y-=1;\n }\n r-=round(pow(2,y));\n for(int i=t2;i<d[y]+1;i+=1){\n int w=c[i]-1;\n if(i!=d[y]){\n c[i]=-1;\n b-=1;\n }else{\n t=d[y]+1;\n t2=d[y]+1; \n }\n d[w]=-1;\n int s=round(pow(2,w));\n if((r/s)%2==1){\n r-=round(pow(2,w));\n }\n }\n d[c[d[y]]]=-1;\n}\nfor(int i=0,t=a-1;i<b;i+=1){\n while(c[t]==-1){\n t-=1;\n }\n c[t]=-1;\n}\nfor(int i=0;i<a;i+=1){\n if(c[i]!=-1){\n cout<<c[i];\n }\n}\ncout<<endl;\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 4068, "score_of_the_acc": -1.0028, "final_rank": 17 }, { "submission_id": "aoj_0420_7849518", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\nint a,b;\ncin>>a>>b;\nint c[a];\nfor(int i=0;i<a;i+=1){\n cin>>c[i];\n}\nint d[9]={-1,-1,-1,-1,-1,-1,-1,-1,-1};\nint r=0;\nint t=0;\nint t2=0;\nwhile(t2<a&&b!=0){\n while(t<a&&r!=511){\n if(d[c[t]-1]==-1){\n d[c[t]-1]=t;\n }\n int s=round(pow(2,c[t]-1));\n if((r/s)%2==0){\n r+=round(pow(2,c[t]-1));\n }\n t+=1;\n }\n r=511;\n int y=8;\n while(b<d[y]-t2||d[y]==-1){\n y-=1;\n }\n r-=round(pow(2,y));\n for(int i=t2;i<d[y]+1;i+=1){\n int w=c[i]-1;\n if(i!=d[y]){\n c[i]=-1;\n b-=1;\n }else{\n t=d[y]+1;\n t2=d[y]+1; \n }\n d[w]=-1;\n int s=round(pow(2,w));\n if((r/s)%2==1){\n r-=round(pow(2,w));\n }\n }\n d[c[d[y]]]=-1;\n}\nfor(int i=0;i<a-b;i+=1){\n if(c[i]!=-1){\n cout<<c[i];\n }\n}\ncout<<endl;\n}", "accuracy": 0.625, "time_ms": 80, "memory_kb": 4004, "score_of_the_acc": -1, "final_rank": 19 }, { "submission_id": "aoj_0420_7110127", "code_snippet": "#include<bits/stdc++.h>\nusing namespace::std;\n\nconst int N = 200000 + 5;\n\nint n;\nint k;\nint a[N];\n\nvoid solve(){\n\tint l = 1;\n\tset<pair<int, int>> S;\n\tfor(int i = 1; i <= k; i++) S.emplace(make_pair(-a[i], i));\n\tfor(int i = k + 1; i <= n; i++){\n\t\tS.emplace(make_pair(-a[i], i));\n\t\tint to = (*S.begin()).second;\n\t\tprintf(\"%d\", a[to]);\n\t\twhile(l <= to){\n\t\t\tS.erase(make_pair(-a[l], l));\n\t\t\tl++;\n\t\t}\n\t}\n\tputs(\"\");\n}\n\nint main(){\n\tscanf(\"%d %d\", &n, &k);\n\tfor(int i = 1; i <= n; i++) scanf(\"%d\", a + i);\n\tsolve();\n\treturn 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 13072, "score_of_the_acc": -0.9666, "final_rank": 16 }, { "submission_id": "aoj_0420_7056990", "code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define lol long long\n#define INF INT_MAX\n#define P pair<int,int>\n#define Pci pair<char,int>\n#define Pll pair<lol,lol>\n#define fi first\n#define se second\n#define mp(f,s) make_pair(f,s)\n\n// const int mod = (1e9) + 7;\nconst int mod = 998244353;\n\nint dx[] = {1,0,-1,0};\nint dy[] = {0,1,0,-1};\n\n// セグ木\nstruct segment{\n P err = mp(-1,-1);\n\n vector<P> value;\n int N;\n\n // コンストラクタ\n segment(int n){\n N = 1;\n while(N < n){\n N *= 2;\n }\n\n value.resize(N * 2);\n for(int i=0;i<N*2;i++){\n value[i] = err;\n }\n }\n\n // 値の更新\n // i番目の要素をxに\n void updata(int i,P x){\n i += N - 1;\n value[i] = x;\n\n while(i > 0){\n i = (i - 1)/2;\n // 大きいほうを取る\n // 等しい場合は左優先\n if(value[i * 2 + 1].fi >= value[i * 2 + 2].fi){\n value[i] = value[i * 2 + 1];\n }else{\n value[i] = value[i * 2 + 2];\n }\n }\n }\n\n // 特定範囲の最大を探す\n // a,b : 探す範囲\n // l,r : 見てる範囲\n // k : 実際に見てるとこ\n P quety(int a,int b,int k,int l,int r){\n if(r <= a || b <= l) return(err);\n if(a <= l && r <= b) return(value[k]);\n\n P c1 = quety(a,b,2 * k + 1,l,(l + r)/2);\n P c2 = quety(a,b,2 * k + 2,(l + r)/2,r);\n\n if(c1.fi >= c2.fi){\n return(c1);\n }else{\n return(c2);\n }\n }\n\n // 特定範囲から探す\n P get(int a,int b){\n return(quety(a,b+1,0,0,N));\n }\n};\n\nint main(){\n // 2019-5\n // 先頭になりうる数字は先頭からK+1個まで\n // 先頭からK+1番目までの数字の中から最大のやつが先頭にくるように消す\n // k-消した個数,先頭を除外してもう１度\n\n // 最大を探す部分にセグ木をつかう\n // セグ木にpairを持たせてfirstが最大値,secondがその場所\n\n int n,k;\n cin>>n>>k;\n\n segment seg(n);\n vector<int> a(n);\n for(int i=0;i<n;i++){\n cin>>a[i];\n seg.updata(i,mp(a[i],i));\n }\n\n int left = 0;\n\n deque<int> ans;\n\n while(k != 0 && left + k < n){\n P p = seg.get(left,left + k);\n ans.push_back(p.fi);\n\n k -= p.se - left;\n\n left = p.se + 1;\n }\n\n while(!ans.empty()){\n cout<<ans.front();\n ans.pop_front();\n }\n for(int i=left + k;i<n;i++){\n cout<<a[i];\n }\n cout<<\"\\n\";\n return(0);\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 8296, "score_of_the_acc": -0.4727, "final_rank": 11 }, { "submission_id": "aoj_0420_6977155", "code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 0420.cc: Digit K\n */\n\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n#include<utility>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 200000;\n\n/* typedef */\n\ntypedef pair<int,int> pii;\n\ntemplate <typename T>\nstruct SegTreeMin {\n int e2;\n vector<T> nodes;\n T defv;\n SegTreeMin() {}\n\n void init(int n, T _defv) {\n defv = _defv;\n for (e2 = 1; e2 < n; e2 <<= 1);\n nodes.assign(e2 * 2, defv);\n }\n\n T &geti(int i) { return nodes[e2 - 1 + i]; }\n void seti(int i, T v) { geti(i) = v; }\n\n void setall() {\n for (int j = e2 - 2; j >= 0; j--)\n nodes[j] = min(nodes[j * 2 + 1], nodes[j * 2 + 2]);\n }\n\n void set(int i, T v) {\n int j = e2 - 1 + i;\n nodes[j] = v;\n while (j > 0) {\n j = (j - 1) / 2;\n nodes[j] = min(nodes[j * 2 + 1], nodes[j * 2 + 2]);\n }\n }\n\n T min_range(int r0, int r1, int k, int i0, int i1) {\n if (r1 <= i0 || i1 <= r0) return defv;\n if (r0 <= i0 && i1 <= r1) return nodes[k];\n\n int im = (i0 + i1) / 2;\n T v0 = min_range(r0, r1, k * 2 + 1, i0, im);\n T v1 = min_range(r0, r1, k * 2 + 2, im, i1);\n return min(v0, v1);\n }\n T min_range(int r0, int r1) { return min_range(r0, r1, 0, 0, e2); }\n};\n\n\n/* global variables */\n\nint as[MAX_N], bs[MAX_N];\nSegTreeMin<pii> st;\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, k;\n scanf(\"%d%d\", &n, &k);\n for (int i = 0; i < n; i++) scanf(\"%d\", as + i);\n\n st.init(n, pii(0, -1));\n for (int i = 0; i < n; i++) st.seti(i, pii(-as[i], i));\n st.setall();\n\n int m = 0;\n for (int i = 0; i + k < n;) {\n pii e = st.min_range(i, i + k + 1);\n bs[m++] = -e.first;\n k -= e.second - i;\n i = e.second + 1;\n }\n\n for (int i = 0; i < m; i++) printf(\"%d\", bs[i]);\n putchar('\\n');\n\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 7760, "score_of_the_acc": -0.3065, "final_rank": 8 }, { "submission_id": "aoj_0420_6639726", "code_snippet": "#include \"bits/stdc++.h\"\n\n#define REP(i,num) for(ll i=0;i<(num);++i)\n#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))\n#define LOOP(i) while(i--)\n#define ALL(c) c.begin(),c.end()\n#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;\n#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\n\nconstexpr ll atcoder_mod = 1e9+7;\n\ntemplate<typename T=ll>\nT in(){ T x; cin >> x; return (x); }\ntemplate<typename T=ll,typename C=vector<T>>\nC vecin(int N){ C x(N);REP(i,N){ x[i]=in<T>(); }return x; }\ntemplate<typename T=ll,size_t N>\narray<T,N> arrin(){array<T,N> x;REP(i,N){ x[i]=in<T>(); }return x;}\n\nvoid vout(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid vout(Head&& h,Tail&&... t){ cout << ' ' << h;vout(forward<Tail>(t)...); }\nvoid out(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid out(Head&& h,Tail&&... t){ cout << h;vout(forward<Tail>(t)...); }\n\ntemplate<typename T>\nbool chmax(T& a,T b){ if(a<b){ a=b;return true; }return false; }\ntemplate<typename T>\nbool chmin(T& a,T b){ if(a>b){ a=b;return true; }return false; }\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(10);\n\n\tll N=in(),K=in();\n\tauto A=vecin(N);\n\tvll F;F.reserve(N);\n\tvvll M(9);\n\n\tREP(i,N){\n\t\tM[A[i]-1].push_back(i);\n\t}\n\n\tll start=0,check=0;\n\twhile(check<K){\n\t\tll maxV=-1,maxI=-1;\n\t\tREP(i,9){\n\t\t\tif(M[i].empty()) continue;\n\t\t\tauto res = lower_bound(ALL(M[i]),start);\n\t\t\tif(res!=M[i].end() && *res<=start+K-check){\n\t\t\t\tmaxV=i;\n\t\t\t\tmaxI=*res;\n\t\t\t}\n\t\t}\n\t\tif(maxV<0){\n\t\t\tstart=N;\n\t\t\tbreak;\n\t\t}\n\n\t\tF.push_back(maxV+1);\n\t\tif(F.size()>=N-K){\n\t\t\tstart=N;\n\t\t\tbreak;\n\t\t}\n\t\tcheck+=maxI-start;\n\t\tstart = maxI+1;\n\t}\n\tfor(auto& x:F) cout<<x;\n\tFOR(i,start,N) cout<<A[i];\n\tcout<<endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 7140, "score_of_the_acc": -0.1367, "final_rank": 4 }, { "submission_id": "aoj_0420_6048794", "code_snippet": "//#include <atcoder/all>\n#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long;\nconstexpr lint mod = 1e9 + 7;\n#define all(x) begin(x), end(x)\n#define bitcount(n) __builtin_popcountll((lint)(n))\n#define fcout cout << fixed << setprecision(15)\n#define highest(x) (63 - __builtin_clzll(x))\n#define rep(i, n) for(int i = 0; i < int(n); i++)\n#define rep2(i, l, r) for(int i = int(l); i < int(r); i++)\n#define repr(i, n) for(int i = int(n) - 1; i >= 0; i--)\n#define repr2(i, l, r) for(int i = int(r) - 1; i >= int(l); i--)\nconstexpr int inf9 = 1e9; constexpr lint inf18 = 1e18;\ninline void Yes(bool condition){ if(condition) cout << \"Yes\" << endl; else cout << \"No\" << endl; }\ntemplate<class itr> void array_output(itr start, itr goal){ for(auto i = start; i != goal; i++) cout << (i == start ? \"\" : \" \") << (*i); cout << endl; }\ntemplate<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }\ntemplate<class T> T gcd(T a, T b){ if(b) return gcd(b, a % b); else return a; }\ntemplate<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }\ntemplate<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b){ if(b < a){ a = b; return 1; } return 0; }\ninline int has(lint i, int j){ return (i >> j) & 1; }\nint dy[4] = {1, 0, -1, 0}; int dx[4] = {0, 1, 0, -1};\nbool is_inside(lint y, lint x, lint H, lint W){ return (0 <= y && y < H && 0 <= x && x < W); }\n\nstruct io_init {\n io_init() {\n cin.tie(nullptr); cout.tie(nullptr);\n std::ios::sync_with_stdio(false);\n }\n} io_init;\n\nint main(){\n int n, k;\n cin >> n >> k;\n k = n - k;\n int a[n];\n rep(i, n) cin >> a[i];\n \n int nxt[n + 1][10];\n rep(i, 10){\n nxt[n][i] = n;\n }\n repr(i, n){\n rep(j, 10){\n nxt[i][j] = nxt[i + 1][j];\n }\n nxt[i][a[i]] = i;\n }\n \n int at = -1;\n rep(c, k){\n repr(i, 10){\n int to = nxt[at + 1][i];\n if(n - to >= k - c){\n cout << i;\n at = to;\n break;\n }\n }\n }\n \n cout << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 11980, "score_of_the_acc": -0.3476, "final_rank": 10 }, { "submission_id": "aoj_0420_6046435", "code_snippet": "#ifdef LOGX\n#define _GLIBCXX_DEBUG\n#endif\n#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\n#define rep(i,n) for(int i=0;i<int(n);i++)\n#define rep2(i,s,n) for(int i=int(s);i<int(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\nconst int big=1e9+7;\n//const int big=998244353;\nconst char newl='\\n';\nconst int inf=1e9+10;\nconst ll INF=ll(1e18)+10;\nconst int dx[]={1,0,-1,0};\nconst int dy[]={0,1,0,-1};\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n \n int n,k;\n cin >> n >> k;\n priority_queue<pair<int,int>> q;\n priority_queue<pair<int,int>> to_erase;\n vector<int> a(n);\n rep(i,n)cin >> a[i];\n rep(i,k)q.emplace(a[i],-i);\n int al_erased=0;\n rep2(i,k,n){\n while(q.size() && to_erase.size() && q.top()==to_erase.top()){\n q.pop();\n to_erase.pop();\n }\n q.emplace(a[i],-i);\n auto p=q.top();q.pop();\n cout << p.first;\n rep2(j,al_erased,-p.second){\n to_erase.emplace(a[j],-j);\n }\n al_erased=-p.second+1;\n }\n cout << newl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 8348, "score_of_the_acc": -0.475, "final_rank": 12 }, { "submission_id": "aoj_0420_6040748", "code_snippet": "#include<bits/stdc++.h>\n#define rep(a,b,i) for(i=a;i<b;i++)\n#define ll long long\n#define l1 first\n#define l2 second\nusing namespace std;\ntypedef pair<int,int>P;\npriority_queue<int> qq;\nP p[200000];\nint main(void)\n{\n\tint i,j,n,k,a[200000],nw,cn,nn,flg[200000]={0},lk,cnt=0;\n\tcin >> n >> k;\n\trep(0,n,i){\n\t\tcin >> a[i];\n\t\tp[i].l1=-a[i];\n\t\tp[i].l2=i;\n\t}\n\tnn=k; cn=0;\n\tsort(p,p+n);\n\twhile(1){\n\t\tcnt++;\n\t\trep(0,n,i){\n\t\t\tif(flg[p[i].l2]==0&&p[i].l2>=cn){\n\t\t\t\tnw=p[i].l2;\n\t\t\t\tif(nw-cn<=nn){\n\t\t\t\t\t//printf(\"%d <= %d %d\\n\",nw,nn,cn);\n\t\t\t\t\tflg[nw]=1;\n\t\t\t\t\tqq.push(-nw);\n\t\t\t\t\tnn-=nw-cn;\n\t\t\t\t\tcn=nw+1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif(qq.size()==n-k||cnt==10) break;\n\t}\n\twhile(1){\n\t\tlk=-qq.top();\n\t\tqq.pop();\n\t\tprintf(\"%d\",a[lk]);\n\t\tif(qq.size()==0) break;\n\t}\n\tprintf(\"\\n\");\n\treturn 0;\n}", "accuracy": 0.6, "time_ms": 20, "memory_kb": 6388, "score_of_the_acc": -0.2467, "final_rank": 20 }, { "submission_id": "aoj_0420_6035525", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\ntypedef long long ll;\ntypedef pair<long long, long long> P;\nconst long long INF = 1e18;\ntemplate <typename T>\nvoid input_arr(vector<T>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i];\n\t}\n}\ntemplate <typename T, typename Q>\nvoid input_arr(vector<pair<T, Q>>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i].first >> A[i].second;\n\t}\n}\ntemplate <typename T>\nvoid input_arr(vector<vector<T>>& A, ll H, ll W) {\n\tfor (ll i = 0; i < H; i++) {\n\t\tfor (ll j = 0; j < W; j++) {\n\t\t\tcin >> A[i][j];\n\t\t}\n\t}\n}\nint main() {\n\tll N, K; cin >> N >> K;\n\tvector<ll>A(N); input_arr(A, N);\n\tvector<vector<ll>>Pos(N, vector<ll>(9, -1));\n\tfor (ll i = 0; i < N; i++) {\n\t\tPos[i][A[i] - 1] = i;\n\t}\n\tfor (ll i = 1; i < N; i++) {\n\t\tfor (ll j = 0; j < 9; j++) {\n\t\t\tPos[i][j] = max(Pos[i][j], Pos[i - 1][j]);\n\t\t}\n\t}\n\tvector<vector<ll>>B(9);\n\tfor (ll i = 0; i < N; i++) {\n\t\tB[A[i] - 1].push_back(i);\n\t}\n\tll pos = -1;\n\tfor (ll i = K; i < N; i++) {\n\t\tfor (ll j = 8; j >= 0; j--) {\n\t\t\tif (Pos[i][j] > pos) {\n\t\t\t\tcout << j + 1;\n\t\t\t\tpos = *upper_bound(B[j].begin(), B[j].end(), pos);\n \tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tcout << endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 26952, "score_of_the_acc": -1.2857, "final_rank": 18 }, { "submission_id": "aoj_0420_6016748", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\ntemplate<class T> using vc = vector<T>;\ntemplate<class T> using vvc = vc<vc<T>>;\ntemplate<class T> using vvvc = vc<vvc<T>>;\ntemplate<class T> using vvvvc = vvc<vvc<T>>;\ntemplate<class T> using PQ = priority_queue<T>;\ntemplate<class T> using invPQ = priority_queue<T, vector<T>, greater<T>>;\nusing IP = pair<int, int>;\nusing LP = pair<ll, ll>;\n#define all(x) begin(x), end(x)\n#define allr(x) rbegin(x), rend(x)\n#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)\n#define rep3(i, m, n) for (int i = (m); (i) < (int)(n); i++)\n#define repr(i, n) for (int i = (n) - 1; (i) >= 0; i--)\n#define rep3r(i, m, n) for (int i = (n) - 1; (i) >= (int)(m); i--)\ntemplate<class T> inline bool chmax(T & a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T & a, T b) { if (a > b) { a = b; return 1; } return 0; }\nconstexpr long long MOD = 998244353;\n\nsigned main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int N, K;\n cin >> N >> K;\n vc<int> a(N);\n rep (i, N) cin >> a[i];\n\n int l = 0;\n vc<int> cnt(10);\n set<int> st;\n string ans;\n\n rep (i, K) {\n st.insert(a[i]);\n cnt[a[i]]++;\n }\n rep3 (i, K, N) {\n st.insert(a[i]);\n cnt[a[i]]++;\n auto itr = st.end();\n itr--;\n int maxi = *itr;\n ans += (maxi) + '0';\n while (1) {\n if (--cnt[a[l]] == 0) st.erase(a[l]);\n if (a[l++] == maxi) break;\n }\n }\n\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4180, "score_of_the_acc": -0.0077, "final_rank": 1 } ]
aoj_0423_cpp
Gym with Many Rules The gym in Izua Village has $N$ units of training equipment, numbered from 1 to $N$. To use a piece of training equipment once, you need one ticket with the number of the equipment written on it. The number of calories burned when using each piece of training equipment is determined for each piece of equipment. After receiving some tickets for this gym, Atsushi went to the gym to get some exercise. At this gym, there are rules on the number of times the equipment can be used so that users don't overdo their exercise and hurt their bodies. For example, the rules say, "You can't use equipment number 2 more than or equalt to 5 times than equipment number 3". People who use the equipments have to follow the rules. Atsushi wants to use the ticket he received to burn as many calories as possible within the limits allowed by the rules. Given the ticket he received and the information about each equipment, write a program to find the maximum number of calories he can consume by following the rules. Input The input is given in the following form. $N$ $R$ $t_1$ $e_1$ $t_2$ $e_2$ : $t_N$ $e_N$ $a_1$ $b_1$ $c_1$ $a_2$ $b_2$ $c_2$ : $a_R$ $b_R$ $c_R$ In the first line, the number of training equipments $N$ ($1 \leq N \leq 100,000$) and the number of rules $R$ ($0 \leq R \leq 100,000$) are given. In the following $N$ lines, the number of tickets Atsushi received for equipment $i$, $t_i$ ($1 \leq t_i \leq 200,000$), and the calories consumed when using the equipment $e_i$ ($0 \leq e_i \leq 100,000$) are given. In the following $R$ lines, we are given the numbers $a_i$ ($1 \leq a_i \leq N$), $b_i$ ($1 \leq b_i \leq N$), and $c_i$ ($1 \leq c_i \leq 100,000$) which represent the rule that the equipment numbered $a_i$ must not be used more than or equal to $c_i$ times than the equipment numbered $b_i$. The input satisfies the following constraints. Rules for the same pair of equipments can be given only once ($a_i \ne a_j$ or $b_i \ne b_j$ for $i \ne j$)。 No rule can be given for the same equipment itself($a_i \ne b_i$)。 Output Output the maximum number of calories consumed in a line. Sample Input and Output Sample Input 1 3 2 5 1 10 4 6 2 2 1 3 3 2 1 Sample Output 1 45 The maximum number of times each equipment can be used with the ticket you received and following the rules is $5$ times for the number $1$, $7$ times for the number $2$, and $6$ times for the number $3$, so the maximum number of calories consumed is $5 \times 1 + 7 \times 4 + 6 \times 2 = 45$. Sample Input 2 4 5 5 1 6 2 2 3 7 1 1 2 4 2 1 3 1 3 2 3 2 3 3 4 2 Sample Output 2 26 Sample Input 3 1 0 200000 100000 Sample Output 3 20000000000
[ { "submission_id": "aoj_0423_11012290", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n int N, R;\n if (!(cin >> N >> R)) return 0;\n vector<long long> t(N+1), e(N+1);\n for (int i = 1; i <= N; ++i) {\n long long ti, ei;\n cin >> ti >> ei;\n t[i] = ti;\n e[i] = ei;\n }\n // Graph: edge bi -> ai with weight (ci - 1)\n vector<vector<pair<int,int>>> g(N+1);\n for (int i = 0; i < R; ++i) {\n int a, b, c;\n cin >> a >> b >> c;\n int w = c - 1; // 「ci回以上多く使ってはいけない」 => 差は最大 ci-1\n g[b].emplace_back(a, w);\n }\n \n // Multi-source Dijkstra with initial distances = t[i]\n const long long INF = (1LL<<62);\n vector<long long> dist(N+1, INF);\n priority_queue<pair<long long,int>, vector<pair<long long,int>>, greater<pair<long long,int>>> pq;\n for (int i = 1; i <= N; ++i) {\n dist[i] = t[i];\n pq.emplace(dist[i], i);\n }\n while (!pq.empty()) {\n auto [d,u] = pq.top(); pq.pop();\n if (d != dist[u]) continue;\n for (auto [v,w] : g[u]) {\n long long nd = d + w;\n if (nd < dist[v]) {\n dist[v] = nd;\n pq.emplace(nd, v);\n }\n }\n }\n \n // Sum ei * dist[i]\n __int128 total = 0;\n for (int i = 1; i <= N; ++i) {\n // dist[i] is the maximal feasible usage count for machine i\n total += (__int128)e[i] * dist[i];\n }\n // Print 64-bit\n long long ans = (long long)total;\n cout << ans << '\\n';\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 13432, "score_of_the_acc": -0.3845, "final_rank": 5 }, { "submission_id": "aoj_0423_10987704", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)\n\ntemplate<typename T> bool chmin(T& a, const T& b) {\n\tif (a > b) {\n\t\ta = b;\n\t\treturn true;\n\t}\n\telse return false;\n}\n\n\nint main() {\n\tcin.tie(nullptr);\n\tios_base::sync_with_stdio(false);\n\t\n\tint N, R;\n\tcin >> N >> R;\n\t\n\tvector<ll> E(N);\n\tvector<vector<pair<int, int>>> G(N + 1);\n\trep(i, 0, N) {\n\t\tint t;\n\t\tcin >> t >> E[i];\n\t\tG[N].push_back({i, t});\n\t}\n\t\n\trep(i, 0, R) {\n\t\tint a, b, c;\n\t\tcin >> a >> b >> c;\n\t\t--a, --b;\n\t\tG[b].push_back({a, c - 1});\n\t}\n\t\n\tpriority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> que;\n\tvector<ll> dist(N + 1, 1ll << 60);\n\tque.push({N, 0});\n\tdist[N] = 0;\n\t\n\twhile (!que.empty()) {\n\t\tint v = que.top().first;\n\t\tll d = que.top().second;\n\t\tque.pop();\n\t\t\n\t\tif (d > dist[v]) continue;\n\t\t\n\t\tfor (pair<int, int> e : G[v]) {\n\t\t\tif (chmin(dist[e.first], dist[v] + e.second)) {\n\t\t\t\tque.push({e.first, dist[e.first]});\n\t\t\t}\n\t\t}\n\t}\n\t\n\tll ans = 0;\n\trep(i, 0, N) ans += dist[i] * E[i];\n\tcout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 13008, "score_of_the_acc": -0.8865, "final_rank": 15 }, { "submission_id": "aoj_0423_10849678", "code_snippet": "#include <bits/stdc++.h>\n//#include\"atcoder/all\"\n#define rep(i,n) for(int i=0;i<n;i++)\nusing namespace std;\n//using namespace atcoder;\n#define all(a) a.begin(),a.end()\n#define int long long\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef pair<int,int> P;\ntypedef pair<P,P> PP;\nconst int inf=1ll<<55;\nconst ll mod=1000000007;\nstruct edge{\n\tint to,cost;\n};\nvector<edge>G[100005];\nint t[100005],e[100005];\nint d[100005];\nsigned main(){\n\tint n,r;cin>>n>>r;\n\trep(i,n){\n\t\tcin>>t[i]>>e[i];\n\t\tG[0].push_back({i+1,t[i]});\n\t}\n\trep(i,r){\n\t\tint a,b,c;cin>>a>>b>>c;\n\t\tc--;\n\t\tG[b].push_back({a,c});\n\t}\n\tpriority_queue<P,vector<P>,greater<P>>Q;\n\tQ.push(P(0,0));\n\trep(i,n)d[i+1]=inf;\n\twhile(Q.size()){\n\t\tP p=Q.top();Q.pop();\n\t\tint v=p.second;\n\t\tif(d[v]<p.first)continue;\n\t\tfor(auto e:G[v]){\n\t\t\tif(d[e.to]>d[v]+e.cost){\n\t\t\t\td[e.to]=d[v]+e.cost;\n\t\t\t\tQ.push(P(d[e.to],e.to));\n\t\t\t}\n\t\t}\n\t}\n\tint ans=0;\n\trep(i,n)ans+=d[i+1]*e[i];\n\tcout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 15320, "score_of_the_acc": -1.0082, "final_rank": 17 }, { "submission_id": "aoj_0423_10435585", "code_snippet": "// AOJ #0423 Gym with Many Rules\n// 2025.4.30\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int INF = numeric_limits<int>::max();\n\n#define gc() getchar_unlocked()\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nint main(){\n int n = Cin(), r = Cin();\n vector<int> t(n+1), e(n+1);\n for(int i = 1; i <= n; i++) t[i] = Cin(), e[i] = Cin();\n\n vector<vector<pair<int,int>>> g(n+1);\n for(int i = 1; i <= n; i++) g[0].emplace_back(i, t[i]);\n\n for(int i = 0; i < r; i++){\n int a = Cin(), b = Cin(), c = Cin()-1;\n g[b].emplace_back(a, c);\n }\n\n vector<int> dist(n+1, INF);\n dist[0] = 0;\n priority_queue<pair<int,int>, vector<pair<int,int>>, greater<>> pq;\n pq.emplace(0, 0);\n\n while(!pq.empty()){\n auto [d, u] = pq.top(); pq.pop();\n if(d > dist[u]) continue;\n for(auto &ed : g[u]){\n int v = ed.first, w = ed.second;\n if(dist[v] > d + w){\n dist[v] = d + w;\n pq.emplace(dist[v], v);\n }\n }\n }\n ll ans = 0;\n for(int i = 1; i <= n; i++) ans += (ll)dist[i] * e[i];\n cout << ans << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 11968, "score_of_the_acc": -0.1818, "final_rank": 2 }, { "submission_id": "aoj_0423_10435500", "code_snippet": "// AOJ #0423 Gym with Many Rules\n// 2025.4.30\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 1LL << 60;\n\n#define gc() getchar_unlocked()\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nint main(){\n int n = Cin(), r = Cin();\n vector<ll> t(n+1), e(n+1);\n for(int i = 1; i <= n; i++) t[i] = Cin(), e[i] = Cin();\n\n vector<vector<pair<int,ll>>> g(n+1);\n for(int i = 1; i <= n; i++) g[0].emplace_back(i, t[i]);\n for(int i = 0; i < r; i++){\n int a = Cin(), b = Cin();\n ll c = Cin()-1;\n g[b].emplace_back(a, c);\n }\n\n vector<ll> dist(n+1, INF);\n dist[0] = 0;\n priority_queue<pair<ll,int>, vector<pair<ll,int>>, greater<>> pq;\n pq.emplace(0, 0);\n\n while(!pq.empty()){\n auto [d, u] = pq.top(); pq.pop();\n if(d > dist[u]) continue;\n for(auto &ed : g[u]){\n int v = ed.first;\n ll w = ed.second;\n if(dist[v] > d + w){\n dist[v] = d + w;\n pq.emplace(dist[v], v);\n }\n }\n }\n __int128 ans = 0;\n for(int i = 1; i <= n; i++) ans += (__int128)dist[i] * e[i];\n\n if(ans == 0) cout << 0 << endl;\n else {\n string s;\n bool neg = false;\n if(ans < 0) neg = true, ans = -ans;\n while(ans > 0){\n int digit = ans % 10;\n s.push_back('0' + digit);\n ans /= 10;\n }\n if(neg) s.push_back('-');\n reverse(s.begin(), s.end());\n cout << s << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 15652, "score_of_the_acc": -0.4983, "final_rank": 8 }, { "submission_id": "aoj_0423_9810507", "code_snippet": "#include<iostream>\n#include<vector>\n#include<queue>\nusing namespace std;\nint main()\n{\n int n,m;\n cin >> n >> m;\n vector<pair<long long,long long>>num(n);\n for(int i=0;i<n;i++)cin >> num[i].first >> num[i].second;\n vector<vector<pair<int,int>>>graph(n);\n for(int i=0;i<m;i++){\n int a,b,c;\n cin >> a >> b >> c;\n graph[b-1].push_back(make_pair(a,c));\n }\n vector<int>ans(n);\n for(int i=0;i<n;i++)ans[i]=num[i].first;\n priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>prq;\n for(int i=0;i<n;i++)prq.push(make_pair(ans[i],i+1));\n while(prq.size()){\n pair<int,int>hako=prq.top();\n prq.pop();\n int a=hako.second;\n if(ans[a-1]!=hako.first)continue;\n for(int i=0;i<graph[a-1].size();i++)if(ans[a-1]+graph[a-1][i].second-1<ans[graph[a-1][i].first-1]){\n ans[graph[a-1][i].first-1]=ans[a-1]+graph[a-1][i].second-1;\n prq.push(make_pair(ans[graph[a-1][i].first-1],graph[a-1][i].first));\n }\n }\n long long Ans=0;\n for(int i=0;i<n;i++)Ans+=ans[i]*num[i].second;\n cout << Ans << endl;\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 11580, "score_of_the_acc": -0.6869, "final_rank": 10 }, { "submission_id": "aoj_0423_8871241", "code_snippet": "#include <bits/stdc++.h>\n\nint main() {\n int n, r;\n std::cin >> n >> r;\n std::vector<int> t(n), e(n);\n for (int i = 0; i < n; i++) std::cin >> t[i] >> e[i];\n std::vector graph(n, std::vector<std::pair<int, int>>());\n for (int i = 0; i < r; i++) {\n int a, b, c;\n std::cin >> a >> b >> c;\n a--; b--; c--;\n graph[b].emplace_back(a, c);\n }\n using P = std::pair<int, int>;\n std::priority_queue<P, std::vector<P>, std::greater<P>> que;\n for (int i = 0; i < n; i++) que.emplace(t[i], i);\n long long ans = 0;\n while (!que.empty()) {\n auto [p, u] = que.top();\n que.pop();\n if (t[u] < p) continue;\n ans += (long long)p * e[u];\n for (auto [v, w]: graph[u]) {\n if (t[v] > t[u] + w) {\n t[v] = t[u] + w;\n que.emplace(t[v], v);\n }\n }\n }\n std::cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 10376, "score_of_the_acc": -0.5835, "final_rank": 9 }, { "submission_id": "aoj_0423_8479798", "code_snippet": "#include<bits/stdc++.h>\n#define overload(a,b,c,d,...) d\n#define rep1(a) for(ll _=0;_<(ll)a;++_)\n#define rep2(i,n) for(ll i=0;i<(ll)n;++i)\n#define rep3(i,l,r) for(ll i=(ll)l;i<(ll)r;++i)\n#define rep(...) overload(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(i,a) for(ll i=(ll)a-1;i>=0;--i)\n#define rrep2(i,a,b) for(ll i=(ll)b-1;i>=(ll)a;--i)\n#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)\n#define all(x) (x).begin(),(x).end()\n#define rall(x) (x).rbegin(),(x).rend()\n#define pb push_back\n#define eb emplace_back\nusing namespace std;\nusing ll=long long;\nusing ull=unsigned long long;\nusing ld=long double;\ntemplate<typename T,typename U>inline bool chmin(T&a,const U&b){return (a>b?a=b,true:false);}\ntemplate<typename T,typename U>inline bool chmax(T&a,const U&b){return (a<b?a=b,true:false);}\nstatic constexpr ll mod1=998244353;\nstatic constexpr ll mod2=1000000007;\nconst ll base1=random_device()()%mod1;\nconst ll base2=random_device()()%mod2;\nint main(){\n\tll n,r;cin>>n>>r;\n\tvector<ll>t(n),e(n);\n\trep(i,n)cin>>t[i]>>e[i];\n\tvector<vector<pair<ll,ll>>>g(n);\n\tvector<ll>cnt(n);\n\trep(i,r){\n\t\tll a,b,c;cin>>a>>b>>c;\n\t\ta--,b--;\n\t\tg[b].eb(a,c);\n\t\tcnt[a]++;\n\t}\n\tset<pair<ll,ll>>st;\n\trep(i,n)st.emplace(t[i],i);\n\tauto ans=t;\n\tqueue<ll>que;\n\trep(i,n)if(cnt[i]==0)que.emplace(i);\n\twhile(!que.empty()||!st.empty()){\n\t\t//cerr<<st.size()<<endl;\n\t\tif(que.empty()){\n\t\t\tauto [ma,id]=*st.begin();\n\t\t\tcnt[id]=0;\n\t\t\tque.emplace(id);\n\t\t\tst.erase(st.begin());\n\t\t}\n\t\telse{\n\t\t\tauto id=que.front();que.pop();\n\t\t\tst.erase({ans[id],id});\n\t\t\tfor(auto [to,c]:g[id])if(cnt[to]!=0){\n\t\t\t\tcnt[to]--;\n\t\t\t\tst.erase({ans[to],to});\n\t\t\t\tchmin(ans[to],ans[id]+c-1);\n\t\t\t\tst.emplace(ans[to],to);\n\t\t\t\tif(cnt[to]==0)que.emplace(to);\n\t\t\t}\n\t\t}\n\t}\t\n\tll sum=0;\n\trep(i,n){\n\t\t//cerr<<ans[i]<<endl;\n\t\tsum+=ans[i]*e[i];\n\t}\n\tcout<<sum<<endl;\n}", "accuracy": 1, "time_ms": 150, "memory_kb": 17860, "score_of_the_acc": -1.688, "final_rank": 20 }, { "submission_id": "aoj_0423_7059318", "code_snippet": "#include <iostream>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <tuple>\n#include <cstdint>\n#include <cstdio>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <deque>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <cctype>\n#include <climits>\n#include <functional>\n#include <cassert>\n#include <numeric>\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define per(i, n) for(int i = (n) - 1; i >= 0; i--)\nusing ll = long long;\n#define vi vector<int>\n#define vvi vector<vi>\n#define vl vector<ll>\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define all(a) (a).begin(), (a).end()\n#define rall(a) (a).rbegin(), (a).rend()\nconstexpr int mod = 1000000007;\nusing namespace std;\ntemplate<class T, class U>\nbool chmax(T &a, const U &b){ return a < b ? (a = b, 1) : 0; }\ntemplate<class T, class U>\nbool chmin(T &a, const U &b){ return a > b ? (a = b, 1) : 0; }\ntemplate <class T>\nstruct Edge {\n int to;\n T cost;\n Edge(){};\n Edge(int t, T c=1) : to(t), cost(c){}\n operator int() const{ return to; }\n bool operator<(const Edge &e){ return cost < e.cost; }\n};\ntemplate <class T>\nstruct Graph : vector<vector<Edge<T>>> {\n Graph(){}\n Graph(const int &n) : vector<vector<Edge<T>>>(n){}\n void add_edge(int a, int b, T c=1){\n (*this)[a].push_back({ b, c });\n }\n};\nusing graph = Graph<int>;\nint main(){\n int n,m;\n cin >> n >> m;\n graph root(n + 1);\n vl c(n);\n rep(i, n){\n int t;\n cin >> t >> c[i];\n root[0].push_back({ i+1, t });\n }\n rep(i, m){\n int a,b,c;\n cin >> a >> b >> c;\n root[b].push_back({ a, c-1 });\n }\n priority_queue<pii, vector<pii>, greater<pii>> que;\n que.push({ 0, 0 });\n vi dist(n+1, mod);\n dist[0] = 0;\n while(!que.empty()){\n int val,pos;\n tie(val,pos) = que.top();\n que.pop();\n if(dist[pos] < val) continue;\n for(auto &x : root[pos]){\n if(chmin(dist[x], val + x.cost)){\n que.push({ dist[x], x });\n }\n }\n }\n ll ans = 0;\n rep(i, n) ans += c[i] * dist[i+1];\n cout << ans << \"\\n\";\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 11896, "score_of_the_acc": -0.7141, "final_rank": 12 }, { "submission_id": "aoj_0423_6977699", "code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 0423.cc: Gym with Many Rules\n */\n\n#include<cstdio>\n#include<vector>\n#include<queue>\n#include<algorithm>\n#include<utility>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\nconst int MAX_M = 100000;\n\n/* typedef */\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\ntypedef vector<pii> vpii;\n\n/* global variables */\n\nint ts[MAX_N], es[MAX_N];\nvpii nbrs[MAX_N];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, m;\n scanf(\"%d%d\", &n, &m);\n\n for (int i = 0; i < n; i++) scanf(\"%d%d\", ts + i, es + i);\n\n for (int i = 0; i < m; i++) {\n int u, v, w;\n scanf(\"%d%d%d\", &u, &v, &w);\n u--, v--;\n nbrs[v].push_back(pii(u, w - 1));\n }\n\n priority_queue<pii> q;\n for (int i = 0; i < n; i++) q.push(pii(-ts[i], i));\n\n while (! q.empty()) {\n pii ue = q.top(); q.pop();\n int ut = -ue.first, u = ue.second;\n if (ts[u] != ut) continue;\n\n for (auto vw: nbrs[u]) {\n int v = vw.first, vt = ut + vw.second;\n if (ts[v] > vt) {\n\tts[v] = vt;\n\tq.push(pii(-vt, v));\n }\n }\n }\n\n ll sum = 0;\n for (int i = 0; i < n; i++) sum += (ll)ts[i] * es[i];\n\n printf(\"%lld\\n\", sum);\n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 9852, "score_of_the_acc": -0.1538, "final_rank": 1 }, { "submission_id": "aoj_0423_6046444", "code_snippet": "#ifdef LOGX\n#define _GLIBCXX_DEBUG\n#endif\n#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\n#define rep(i,n) for(int i=0;i<int(n);i++)\n#define rep2(i,s,n) for(int i=int(s);i<int(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\nconst int big=1e9+7;\n//const int big=998244353;\nconst char newl='\\n';\nconst int inf=1e9+10;\nconst ll INF=ll(1e18)+10;\nconst int dx[]={1,0,-1,0};\nconst int dy[]={0,1,0,-1};\n\nusing P=pair<ll,int>;\npriority_queue<P,vector<P>,greater<P>> q;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n\n int n,r;\n cin >> n >> r;\n vector<ll> e(n);\n rep(i,n){\n int t;\n cin >> t >> e[i];\n q.emplace(t,i);\n }\n vector<vector<pair<int,ll>>> g(n);\n rep(i,r){\n int a,b,c;\n cin >> a >> b >> c;\n a--,b--;\n g[b].emplace_back(a,c-1);\n //[a]<[b]+c\n }\n\n ll ans=0;\n while(!q.empty()){\n auto now=q.top();ll T=now.first;int i=now.second;\n q.pop();\n if(e[i]==-1)continue;\n ans+=e[i]*T;\n e[i]=-1;\n for(auto ne:g[i]){\n q.emplace(T+ne.second,ne.first);\n }\n }\n cout << ans << newl;\n}\n//x[i]<x[j]+c\n//x[i]-x[j]<c\n//tが最小のところは上限に設定すべき。\n//そこからは、tと新たにできた上限の小さい方を取りながらpriority_queueかな\n//既に作られた条件を満たしつつ最大？", "accuracy": 1, "time_ms": 50, "memory_kb": 10956, "score_of_the_acc": -0.3256, "final_rank": 4 }, { "submission_id": "aoj_0423_6035829", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long mod1 = 1000000007;\nconst long long mod2 = 998244353;\ndouble pi = 3.141592653589;\nusing ll = long long;\nvector<ll> dx = {-1,0,1,0,1,1,-1,-1};\nvector<ll> dy = {0,1,0,-1,1,-1,1,-1};\nvector<char> abc = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};\nvector<char> ABC = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};\n \nstruct UnionFind{\n vector<ll> par, siz;\n \n UnionFind(ll n):par(n,-1),siz(n,1){}\n \n ll root(ll x){//親を返す\n if(par[x] == -1) return x;\n else return par[x] = root(par[x]);\n }\n \n bool issame(ll x,ll y){//同じグループかどうか\n return root(x) == root(y);\n }\n \n bool unite(ll x, ll y){//合体\n x = root(x); y = root(y);\n if(x == y) return false;\n if(siz[x] < siz[y]) swap(x,y);\n par[y] = x;\n siz[x] += siz[y];\n return true;\n }\n \n ll size(ll x){//xがいるグループのサイズ\n return siz[root(x)];\n }\n \n \n \n};\n \nlong long pow2(long long x,long long n){\n long long ans = 1;\n while(n != 0){\n long long a = x;\n long long z = 1;\n while(z*2 <= n){\n a *=a;\n a=a%mod2;\n z*=2;\n }\n ans*=a;\n ans=ans%mod2;\n n-=z;\n }\n return ans; \n}//累乗 x^n\n \ntemplate<typename T>\nvoid input_vec(vector<T> &A){\n ll N = A.size();\n for(int i = 0; i < N; i++){\n cin >> A.at(i);\n }\n return;\n}//入力を配列で受け取る\n \ntemplate<typename T>\nvoid output_vec(vector<T> &A){\n ll N = A.size();\n for(int i = 0; i < N; i++){\n if(i != 0){\n cout << \" \";\n }\n cout << A.at(i);\n }\n cout << endl;\n return;\n}//配列を出力\n \ntemplate<typename T>\nlong long count_x(vector<T> &A,T x){\n long long counter = 0;\n for(int i = 0; i < (int)A.size(); i++){\n if(A.at(i) == x){\n counter++;\n }\n }\n return counter;\n}//配列内のxの個数をreturn\n \ntemplate<typename T>\nlong long duplicate(vector<T> &A){\n ll ans = 0;\n ll N = A.size();\n T a = A.at(0);\n for(int i = 1; i < N; i++){\n if(a == A.at(i)) ans++;\n else a = A.at(i);\n }\n return ans;\n}\n \ntemplate<typename T>\nvoid chmin(T &a,T b){\n if(a>b){\n a = b;\n }\n return;\n}\n \ntemplate<typename T>\nvoid chmax(T&a,T b){\n if(a < b){\n a = b;\n }\n return;\n}\n \n/*\n絶対値 abs()\n配列の要素の追加 push_back() \nchar→intに変換 -'0'\nstring→intに変換 atoi(文字列名.c_str())\n配列の中身をN個の０で初期化 配列名.resize(N)\n配列の中身をN個のaで初期化 配列名.assign(N,a)\n配列の中からK以上の数字の最小値を出力　lower_bound(配列.begin(),配列.end(),K)\n*/\nint main(){\n ll N,R; cin >> N >> R;\n vector<ll> t(N),e(N);\n for(int i = 0; i < N; i++) cin >> t[i] >> e[i];\n vector<vector<pair<ll,ll>>> m(N);\n priority_queue<pair<ll,ll>,vector<pair<ll,ll>>, greater<pair<ll,ll>>> pq;\n for(int i = 0; i < R; i++){\n ll a,b,c; cin >> a >> b >> c;\n a--;b--;c--;\n m[b].push_back(make_pair(a,c));\n pq.push(make_pair(t[b]+c,a));\n //cout << t[b]+c << \" \" << a << endl;\n }\n //cout << endl;\n while(!pq.empty()){\n //cout << pq.size() << endl;\n ll a,b; tie(b,a) = pq.top();\n //cout << a << \" \" << b << endl;\n pq.pop();\n if(t[a]<b)continue;\n t[a] = b;\n \n for(auto z:m[a]){\n ll x,y; tie(x,y) = z;\n //cout <<\" \"<< x << \" \" << y << endl;\n if(t[x]<=y+t[a])continue;\n pq.push(make_pair(y+t[a],x));\n t[x] = t[a]+y;\n }\n }\n ll ans = 0;\n //output_vec(t);\n for(int i = 0; i < N; i++){\n ans+=t[i]*e[i];\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 11820, "score_of_the_acc": -0.7075, "final_rank": 11 }, { "submission_id": "aoj_0423_6019130", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\ntemplate<class T> using vc = vector<T>;\ntemplate<class T> using vvc = vc<vc<T>>;\ntemplate<class T> using vvvc = vc<vvc<T>>;\ntemplate<class T> using vvvvc = vvc<vvc<T>>;\ntemplate<class T> using PQ = priority_queue<T>;\ntemplate<class T> using invPQ = priority_queue<T, vector<T>, greater<T>>;\nusing IP = pair<int, int>;\nusing LP = pair<ll, ll>;\n#define all(x) begin(x), end(x)\n#define allr(x) rbegin(x), rend(x)\n#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)\n#define rep3(i, m, n) for (int i = (m); (i) < (int)(n); i++)\n#define repr(i, n) for (int i = (n) - 1; (i) >= 0; i--)\n#define rep3r(i, m, n) for (int i = (n) - 1; (i) >= (int)(m); i--)\ntemplate<class T> inline bool chmax(T & a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T & a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\n// ll dfs2(int v, int p, int s, vvc<IP> &graph, int lli, vc<int> &cnt, vc<int> &llmemo, vc<int> &e) {\n// if (v == s) {\n// return 0;\n// }\n// cnt[v]--;\n// ll res = 0;\n// rep (i, graph[v].size()) {\n// int u = graph[v][i].first;\n// if (u == p || cnt[u] == 0) continue;\n// res += dfs2(u, v, s, graph, min(lli, llmemo[v]) + graph[v][i].second - 1, cnt, llmemo, e);\n// }\n// return res + (ll)min(lli, llmemo[v]) * e[v];\n// }\n\n// int dfs1(int v, int p, int s, int mini, vvc<IP> &graph, vc<int> &cnt, vc<int> &llmemo, vc<int> &e, ll &ans) {\n// if (v == s) {\n// return mini;\n// }\n// rep (i, graph[v].size()) {\n// int u = graph[v][i].first;\n// if (u == p || cnt[u] == 0) continue;\n// int m = dfs1(u, v, s, min(mini, llmemo[v]), graph, cnt, llmemo, e, ans);\n// if (llmemo[u] == m) {\n// ans += dfs2(v, p, v, graph, llmemo[v], cnt, llmemo, e);\n// return -1;\n// }\n// return m;\n// }\n// return -1;\n// }\n\nsigned main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int N, R;\n cin >> N >> R;\n vc<int> t(N), e(N), a(R), b(R), c(R);\n rep (i, N) cin >> t[i] >> e[i];\n rep (i, R) {\n cin >> a[i] >> b[i] >> c[i];\n a[i]--; b[i]--; c[i];\n }\n\n vvc<IP> graph(N), rgraph(N);\n rep (i, R) {\n graph[a[i]].push_back({b[i], c[i]});\n rgraph[b[i]].push_back({a[i], c[i]});\n }\n\n vc<int> cnt(N);\n rep (i, N) cnt[i] = graph[i].size();\n vc<int> llmemo(N);\n rep (i, N) llmemo[i] = t[i];\n ll ans = 0;\n set<IP> st;\n rep (i, N) st.insert({t[i], i});\n while (!st.empty()) {\n int p = (*st.begin()).second;\n st.erase({llmemo[p], p});\n ans += (ll)llmemo[p] * e[p];\n rep (i, rgraph[p].size()) {\n int np = rgraph[p][i].first;\n cnt[np]--;\n if (llmemo[np] > llmemo[p] + rgraph[p][i].second - 1) {\n st.erase({llmemo[np], np});\n llmemo[np] = llmemo[p] + rgraph[p][i].second - 1;\n st.insert({llmemo[np], np});\n }\n }\n }\n\n // rep (i, N) {\n // if (cnt[i] != 0) {\n // dfs1(i, -1, i, 200000, rgraph, cnt, t, e, ans);\n // }\n // }\n\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 21492, "score_of_the_acc": -1.3846, "final_rank": 19 }, { "submission_id": "aoj_0423_5984205", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int N, R;\n cin >> N >> R;\n vector<int> t(N), e(N);\n for (int i = 0; i < N; i++){\n cin >> t[i] >> e[i];\n }\n vector<int> a(R), b(R), c(R);\n for (int i = 0; i < R; i++){\n cin >> a[i] >> b[i] >> c[i];\n a[i]--;\n b[i]--;\n }\n vector<vector<pair<int, int>>> E(N);\n for (int i = 0; i < R; i++){\n E[b[i]].push_back(make_pair(c[i] - 1, a[i]));\n }\n vector<int> d(N, -1);\n priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;\n for (int i = 0; i < N; i++){\n pq.push(make_pair(t[i], i));\n }\n while (!pq.empty()){\n int dd = pq.top().first;\n int v = pq.top().second;\n pq.pop();\n if (d[v] == -1){\n d[v] = dd;\n for (auto P : E[v]){\n int w = P.second;\n if (d[w] == -1){\n pq.push(make_pair(dd + P.first, w));\n }\n }\n }\n }\n long long ans = 0;\n for (int i = 0; i < N; i++){\n ans += (long long) d[i] * e[i];\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 11980, "score_of_the_acc": -0.7213, "final_rank": 13 }, { "submission_id": "aoj_0423_5038369", "code_snippet": "#include<iostream>\n#include<queue>\n#include<vector>\nusing namespace std;\nint N,M;\nlong T[1<<17],E[1<<17];\nbool out[1<<17];\nvector<pair<int,int> >G[1<<17];\nmain()\n{\n\tcin>>N>>M;\n\tpriority_queue<pair<int,int> >P;\n\tfor(int i=0;i<N;i++)\n\t{\n\t\tcin>>T[i]>>E[i];\n\t\tP.push(make_pair(-T[i],i));\n\t}\n\tfor(int i=0;i<M;i++)\n\t{\n\t\tint a,b,c;cin>>a>>b>>c;\n\t\tG[b-1].push_back(make_pair(a-1,c-1));\n\t}\n\tlong ans=0;\n\twhile(!P.empty())\n\t{\n\t\tint u=P.top().second;P.pop();\n\t\tif(out[u])continue;\n\t\tout[u]=true;\n\t\tans+=T[u]*E[u];\n\t\tfor(pair<int,int>e:G[u])\n\t\t{\n\t\t\tint v=e.first,t=T[u]+e.second;\n\t\t\tif(T[v]>t)\n\t\t\t{\n\t\t\t\tT[v]=t;\n\t\t\t\tP.push(make_pair(-t,v));\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 120, "memory_kb": 11512, "score_of_the_acc": -0.9118, "final_rank": 16 }, { "submission_id": "aoj_0423_4990803", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing VI = vector<int>;\nusing VL = vector<ll>;\nusing VS = vector<string>;\ntemplate<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;\n#define FOR(i,a,n) for(int i=(a);i<(n);++i)\n#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)\n#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)\n#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)\n#define SORT(a) sort(a.begin(),a.end())\n#define rSORT(a) sort(a.rbegin(),a.rend())\n#define fSORT(a,f) sort(a.begin(),a.end(),f)\n#define all(a) a.begin(),a.end()\n#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))\n#define tp(a,i) get<i>(a)\n#ifdef _DEBUG\n#define line cout << \"-----------------------------\\n\"\n#define stop system(\"pause\")\n#endif\nconstexpr ll INF = 1000000000;\nconstexpr ll LLINF = 1LL << 60;\nconstexpr ll mod = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr ld eps = 1e-10;\nconstexpr ld pi = 3.1415926535897932;\ntemplate<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }\ntemplate<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }\ninline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }\ntemplate<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }\ntemplate<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }\ntemplate<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }\ntemplate<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }\ntemplate<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }\ntemplate<class T>inline void print(const T& a) { cout << a << \"\\n\"; }\ntemplate<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << \" \"; print(ts...); }\ntemplate<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? \"\\n\" : \" \"); }\ntemplate<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }\ninline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }\ntemplate<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }\ntemplate<class T>inline void END(T s) { print(s); exit(0); }\nvoid END() { exit(0); }\n\nint main() {\n init();\n\n int n, m; cin >> n >> m;\n VI t(n), e(n);\n FOR(i, 0, n)cin >> t[i] >> e[i];\n\n vector<vector<pair<int, int>>> g(n + 1);\n FOR(i, 0, n)g[n].emplace_back(i, t[i]);\n FOR(i, 0, m) {\n int a, b, c; cin >> a >> b >> c;\n g[b - 1].emplace_back(a - 1, c - 1);\n }\n\n VL dp(n + 1, LLINF);\n dp[n] = 0;\n PQ<pair<ll, int>> dik;\n dik.emplace(0, n);\n while (!dik.empty()) {\n ll d; int cur;\n tie(d, cur) = dik.top();\n dik.pop();\n if (dp[cur] < d)continue;\n for(auto [to,cost] : g[cur]) {\n if (!chmin(dp[to], d + cost))continue;\n dik.emplace(d + cost, to);\n }\n }\n\n ll ans = 0;\n FOR(i, 0, n)ans += ll(dp[i]) * ll(e[i]);\n print(ans);\n\n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 12908, "score_of_the_acc": -0.4164, "final_rank": 7 }, { "submission_id": "aoj_0423_4990547", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define repr(i, n) for (int i = (n); i--;)\n#define all(x) x.begin(), x.end()\nusing ll = long long;\n\ntemplate <class T, class U>\nbool chmin(T& x, U y) {\n if (x > y) {\n x = y;\n return true;\n } else {\n return false;\n }\n}\n\ntemplate <class T, class U>\nbool chmax(T& x, U y) {\n if (x < y) {\n x = y;\n return true;\n } else {\n return false;\n }\n}\n\nint main() {\n std::ios_base::sync_with_stdio(false);\n std::cin.tie(nullptr);\n\n using T = std::pair<int, int>;\n\n int n, r; std::cin >> n >> r;\n\n std::vector<int> t(n), e(n);\n rep(i, n) std::cin >> t[i] >> e[i];\n\n std::vector<std::vector<T>> graph(n);\n rep(i, r) {\n int a, b, c; std::cin >> a >> b >> c;\n a--; b--;\n graph[b].emplace_back(a, c - 1);\n }\n\n std::priority_queue<T, std::vector<T>, std::greater<>> pque;\n rep(i, n) pque.emplace(t[i], i);\n while (!pque.empty()) {\n int d, v; std::tie(d, v) = pque.top(); pque.pop();\n if (t[v] < d) continue;\n for (auto [v2, dv] : graph[v])\n if (chmin(t[v2], d + dv))\n pque.emplace(d + dv, v2);\n }\n\n ll res = 0;\n rep(i, n) res += (ll)t[i] * e[i];\n std::cout << res << \"\\n\";\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 10400, "score_of_the_acc": -0.2009, "final_rank": 3 }, { "submission_id": "aoj_0423_4977441", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing LL = long long;\nusing ULL = unsigned long long;\n#define rep(i,n) for(int i=0; i<(n); i++)\n\nstruct Edge { int to; LL d; };\nstruct QueueNode {\n\tint p; LL d;\n\tbool operator<(QueueNode r) const { return d > r.d; }\n};\n\nint N, M;\nvector<vector<Edge>> E;\nvector<LL> D;\n\nLL W[100000];\n\nint main() {\n\tcin >> N >> M;\n\tE.resize(N + 1);\n\trep(i, N) {\n\t\tint t, e; cin >> t >> e;\n\t\tE[N].push_back({ i,t });\n\t\tW[i] = e;\n\t}\n\trep(i, M) {\n\t\tint u, v, c; cin >> u >> v >> c; u--; v--;\n\t\tE[v].push_back({ u,c-1 });\n\t}\n\n\tD.assign(N + 1, -1);\n\n\tpriority_queue<QueueNode> G;\n\tG.push({ N,0 });\n\twhile (G.size()) {\n\t\tint p = G.top().p;\n\t\tLL d = G.top().d;\n\t\tG.pop();\n\t\tif (D[p] != -1) continue;\n\t\tD[p] = d;\n\t\tfor (Edge& e : E[p]) {\n\t\t\tG.push({ e.to, d + e.d });\n\t\t}\n\t}\n\n\tLL ans = 0;\n\trep(i, N) ans += D[i] * W[i];\n\tcout << ans << endl;\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 14596, "score_of_the_acc": -1.2537, "final_rank": 18 }, { "submission_id": "aoj_0423_4920757", "code_snippet": "#include <bits/stdc++.h>\n#include <iostream>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <string>\n#include <set>\n#include <map>\n#include <random>\n#define rep(i,n) for (int i = 0; i < (n); ++i)\n#define repp(i,n,m) for (int i = m; i < (n); ++i)\n#define repl(i,n) for (long long i = 0; i < (n); ++i)\n#define reppl(i,n,m) for (long long i = m; i < (n); ++i)\n//#define int long long\nusing namespace std;\n//#include <atcoder/all>\n//using namespace atcoder;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<int, int>;\nusing PI = pair<pair<int,int>,int>;\nusing PL = pair<long long, long long>;\nusing Pxy = pair<double, double>;\nusing Tiib = tuple<int, int, bool>;\nconst int INF = 1001001007;\nconst long long mod = 1000000007LL;\nconst int MOD = 998244353;\nconst ll inf = 1e18;\ntemplate <typename AT>\nvoid printvec(vector<AT> &ar){\n rep(i,ar.size()-1) cout << ar[i] << \" \";\n cout << ar[ar.size()-1] << endl;\n}\ntemplate <typename Q>\nvoid printvvec(vector<vector<Q>> &ar){\n rep(i,ar.size()){\n rep(j,ar[0].size()-1) cout << ar[i][j] << \" \";\n cout << ar[i][ar[0].size()-1] << endl;\n }\n}\ntemplate <typename S>\nbool range(S a, S b, S x){\n return (a <= x && x < b);\n}\n\nvoid yes(){\n cout << \"Yes\" << endl;\n}\n\nvoid no (){\n cout << \"No\" << endl;\n}\n\nll cel (ll a, ll b){\n if (a % b == 0) return a / b;\n else return a / b + 1;\n}\n\nll gcds(ll a, ll b){\n ll c = a % b;\n while (c != 0){\n a = b;\n b = c;\n c = a % b;\n }\n return b;\n}\n\nstruct vs{\n ll cal;\n ll ma;\n vector<PL> to;\n};\n\nint main(){\n int n, r; cin >> n >> r;\n vector<vs> ar(n);\n rep(i,n){\n ll a, b; cin >> a >> b;\n ar[i].cal = b;\n ar[i].ma = a;\n }\n rep(i,r){\n int a, b; cin >> a >> b; ll c; cin >> c;\n ar[b-1].to.emplace_back(P(a-1,c-1LL));\n }\n priority_queue<PL,vector<PL>,greater<PL>> que;\n rep(i,n){\n que.push(PL(ar[i].ma,i));\n }\n while (!que.empty()){\n PL p = que.top(); que.pop();\n ll v = p.second;\n if (ar[v].ma < p.first) continue;\n rep(i,ar[v].to.size()){\n int tt = ar[v].to[i].first;\n if (ar[tt].ma > ar[v].ma + ar[v].to[i].second){\n ar[tt].ma = ar[v].ma + ar[v].to[i].second;\n que.push(P(ar[tt].ma,tt));\n }\n }\n }\n ll ans = 0LL;\n rep(i,n) ans += ar[i].cal * ar[i].ma;\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 110, "memory_kb": 11892, "score_of_the_acc": -0.8676, "final_rank": 14 }, { "submission_id": "aoj_0423_4918882", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\ntemplate <typename T>\nstruct edge {\n int from, to; T cost;\n edge(int to, T cost) : from(-1), to(to), cost(cost) {}\n edge(int from, int to, T cost) : from(from), to(to), cost(cost) {}\n};\n\ntemplate <typename T>\nvector<T> dijkstra(int s,vector<vector<edge<T>>> &G){\n auto n = G.size();\n vector<T> d(n, INF<T>);\n priority_queue<pair<T, int>,vector<pair<T, int>>,greater<>> Q;\n d[s] = 0;\n Q.emplace(0, s);\n while(!Q.empty()){\n T cost; int i;\n tie(cost, i) = Q.top(); Q.pop();\n if(d[i] < cost) continue;\n for (auto &&e : G[i]) {\n auto cost2 = cost + e.cost;\n if(d[e.to] <= cost2) continue;\n d[e.to] = cost2;\n Q.emplace(d[e.to], e.to);\n }\n }\n return d;\n}\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector<vector<edge<int>>> G(n+1);\n vector<ll> e(n);\n for (int i = 0; i < n; ++i) {\n int t;\n scanf(\"%d %lld\", &t, &e[i]);\n G[0].emplace_back(i+1, t);\n }\n for (int i = 0; i < m; ++i) {\n int a, b, c;\n scanf(\"%d %d %d\", &a, &b, &c);\n G[b].emplace_back(a, c-1);\n }\n auto d = dijkstra(0, G);\n ll ans = 0;\n for (int i = 0; i < n; ++i) {\n ans += e[i]*d[i+1];\n }\n cout << ans << \"\\n\";\n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 12876, "score_of_the_acc": -0.4136, "final_rank": 6 } ]
aoj_0422_cpp
Bug You are designing the world's most powerful computer system, "Nayuta". However, during the implementation of the prototype of this system, you find a bug that causes the system to stop when the instruction sequence meets certain conditions. The system works by giving an instruction string of length $N$ as a program. When the $m$-th instruction in the instruction sequence is represented by the number $X_m$, it is found that the condition for the bug to occur is that there exists a pattern of instructions in the instruction sequence such that $X_i + X_{j-1} = X_j + X_{i-1}$ for some integer $i,j$ ($2 \leq i＜j \leq N$). To find out how much of an effect this bug has, you decided to find out how many instruction sequences of a certain length can cause the bug. Write a program to find out how many instruction sequences of length $N$ will cause a failure. It is assumed that instructions can be represented by integers between 1 and $K$. The answer should be the remainder divided by the given prime number $M$. Input The input is given in the following form. $N$ $K$ $M$ In a line, the length of the instruction sequence $N$ ($3 \leq N \leq 100,000$), the number of instruction types $K$ ($1 \leq K \leq 10$), and the prime number $M$ ($100,000,007 \leq M \leq 1,000,000,007$) are given. Output Outputs the remainder obtained by dividing the number of faulty instruction sequences by $M$. Sample Input and Output Sample Input 1 3 2 100000007 Sample Output 1 2 If we represent the instruction sequence as $(X_1,X_2,X_3)$, there are eight possible instruction sequences: $(1,1,1)$, $(1,1,2)$, $(1,2,1)$, $(1,2,2)$, $(2,1,1)$, $(2,1,2)$, $(2,1,2)$, $(2,2,1)$, and $(2,2,2)$. Of these, the instruction sequence in which the failure occurs is $(1,1,1)$ and $(2,2,2)$. Sample Input 2 9 10 100000037 Sample Output 2 66631256 There are 866631552 instruction sequences that cause the bug, and the output is the remainder of the number divided by the prime number 100000037.
[ { "submission_id": "aoj_0422_11011801", "code_snippet": "#include <iostream>\n#include <vector>\n#include <set>\n#include <map>\n#include <queue>\n#include <deque>\n\n#include <iomanip>\nusing namespace std;\n\nusing ll = long long;\n\nvoid showbit(int bit, int T) {\n\tfor (int i = 0;i < T;i++) if (bit & (1 << i)) cout << \"IS \" << i << endl;\n}\n\nint main() {\n\tint N, K;ll M;cin >> N >> K >> M;\n\tif (2*K < N) {\n\t\tll res = 1;\n\t\tfor (int i = 0;i < N;i++) res = (res * (ll)K) % M;\n\t\tcout << res << endl;\n\t\treturn 0;\n\t}\n\tint T = (2*K) - 1;\n\tvector<vector<int>> REM(1<<T);\n\tfor (int t = 0;t < (1<<T);t++) for (int i = 0;i < T;i++) if (!(t & (1 << i))) REM[t].push_back(i);\n\tvector<vector<ll>> dp(1<<T, vector<ll>(K, 0));\n\tfor (int i = 0;i < K;i++) dp[0][i] = 1;\n\tfor (int bit = 0;bit < (1<<T);bit++) for (int n = 0;n < K;n++) {\n\t\tfor (int d : REM[bit]) {\n\t\t\tint dd = d - (K-1);\n\t\t\tint nx = n + dd;\n\t\t\tif (nx < 0 or nx >= K) continue;\n\t\t\tint nbit = bit | (1 << d);\n\t\t\tdp[nbit][nx] = (dp[bit][n] + dp[nbit][nx]) % M;\n\t\t}\n\t}\n\tll res = 0;\n\tfor (int bit = 0;bit < (1<<T);bit++) {\n\t\tif ((__builtin_popcount(bit)) != N-1) continue;\n\t\tfor (int i = 0;i < K;i++) {\n\t\t\tif (dp[bit][i] == 0) continue;\n\t\t\n\t\t\t//cout << dp[bit][i] << endl;\n\t\t\tres = (res + dp[bit][i]) % M;\n\t\t}\n\t}\n\tll als = 1;\n\tfor (int i = 0;i < N;i++) als = (als * K) % M;\n\tcout << (als - res + M) % M << endl;\n}", "accuracy": 1, "time_ms": 160, "memory_kb": 112636, "score_of_the_acc": -0.5087, "final_rank": 11 }, { "submission_id": "aoj_0422_10849122", "code_snippet": "#include <bits/stdc++.h>\n//#include\"atcoder/all\"\n#define rep(i,n) for(int i=0;i<n;i++)\nusing namespace std;\n//using namespace atcoder;\n#define all(a) a.begin(),a.end()\n#define int long long\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef pair<int,int> P;\ntypedef pair<P,P> PP;\nconst int inf=1ll<<55;\nconst ll mod=1000000007;\n\nint dp[10][530000];\nint popcnt[530000];\nsigned main(){\n\tint n,k,m;cin>>n>>k>>m;\n\trep(i,k)dp[i][0]=1;\n\trep(i,1<<18){\n\t\tpopcnt[i*2]=popcnt[i];\n\t\tpopcnt[i*2+1]=popcnt[i]+1;\n\t}\n\trep(j,1<<(2*k-1)){\n\t\trep(i,k){\n\t\t\tif(!dp[i][j])continue;\n\t\t\trep(l,2*k-1){\n\t\t\t\tif(j&(1<<l))continue;\n\t\t\t\tint d=i+l-k+1;\n\t\t\t\tif(0<=d&&d<k){\n\t\t\t\t\tdp[d][j^(1<<l)]+=dp[i][j];\n\t\t\t\t\tdp[d][j^(1<<l)]%=m;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tint ans=1;\n\trep(i,n){\n\t\tans*=k;ans%=m;\n\t}\n\tans=m-ans;ans%=m;\n\trep(j,1<<19){\n\t\tif(popcnt[j]==n-1){\n\t\t\trep(i,k)ans+=dp[i][j];\n\t\t}\n\t\tans%=m;\n\t}\n\tans=m-ans;ans%=m;\n\tcout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 48940, "score_of_the_acc": -0.1706, "final_rank": 4 }, { "submission_id": "aoj_0422_9796930", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(n);++i)\nusing namespace std;\nusing ll = long long;\n\n\nll pow_mod(ll base, ll exp, ll mod) {\n ll res = 1;\n while (exp > 0) {\n if (exp & 1) res = res * base % mod;\n base = base * base % mod;\n exp >>= 1;\n }\n return res;\n}\n\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n ll n,k,m;\n cin >> n >> k >> m;\n\n // if(n>2*k){\n // cout << pow_mod(k,n,m) << endl;\n // return 0;\n // }\n\n vector dp(k,vector<ll>(1<<(2*k),0));\n rep(i,k) dp[i][0]=1;\n\n rep(bit, 1<<(2*k)){\n rep(j,k){\n rep(l,k){\n int b = bit;\n if(b & (1<<(l-j+k))) continue;\n b |= (1<<(l-j+k));\n dp[j][b] += dp[l][bit];\n dp[j][b] %= m;\n }\n }\n }\n\n ll ans = 0;\n rep(i,k){\n rep(j,1<<(2*k)){\n int c = 0;\n rep(l,2*k) if(j & (1<<l)) c++;\n if(c!=n-1) continue;\n\n ans += dp[i][j];\n ans%=m;\n }\n }\n\n \n\n cout << (pow_mod(k,n,m)-ans+m)%m << endl;\n}", "accuracy": 1, "time_ms": 720, "memory_kb": 93228, "score_of_the_acc": -0.7385, "final_rank": 12 }, { "submission_id": "aoj_0422_9645081", "code_snippet": "#include<bits/stdc++.h>\n\n#define ll long long\n\nusing namespace std;\n\nconst int N = 20, offset = 9;\nint n, k, m;\n\nint dp[(1 << N)][10];\n\nll fast_power(ll a,ll b){\n if (b==0)\n return 1;\n ll ret = fast_power(a,b>>1);\n (ret*=ret)%=m;\n if (b&1)\n ret*= a;\n ret%=m;\n return ret;\n}\n\nint slv(int i, int mask, int prv, bool fail) {\n if (fail)\n return fast_power(k, n-i );\n if (i == n)\n return 0;\n int &ret = dp[mask][prv];\n if (~ret)\n return ret;\n ret = 0;\n for (int j = 1; j <= k; ++j) {\n int d = j - (prv+1) + offset;\n (ret += slv(i+1, mask|(1<<d), j-1, fail|mask &(1<<d)) )%=m ;\n }\n return ret;\n}\n\nvoid solve() {\n cin >> n >> k >> m;\n if (n > 20) {\n ll ans = 1;\n for (int i = 0; i < n; ++i) {\n (ans *= k) %= m;\n }\n cout << ans << endl;\n return;\n }\n memset(dp, -1,sizeof dp);\n ll ans = 0;\n for (int i = 1; i <= k ; ++i) {\n (ans += slv(1,0,i-1,0))%=m;\n }\n cout<<ans<<endl;\n}\n\nint main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n int t = 1;\n// cin>>t ;\n for (int i = 1; i <= t; ++i) {\n solve();\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 520, "memory_kb": 44412, "score_of_the_acc": -0.3759, "final_rank": 8 }, { "submission_id": "aoj_0422_9645079", "code_snippet": "#include<bits/stdc++.h>\n\n#define ll long long\n\nusing namespace std;\n\nconst int N = 20, offset = 9;\nint n, k, m;\n\nint dp[(1 << N)][10][2];\n\nint slv(int i, int mask, int prv, bool fail) {\n if (i == n)\n return fail;\n int &ret = dp[mask][prv][fail];\n if (~ret)\n return ret;\n ret = 0;\n for (int j = 1; j <= k; ++j) {\n int d = j - (prv+1) + offset;\n (ret += slv(i+1, mask|(1<<d), j-1, fail|mask &(1<<d)) )%=m ;\n }\n return ret;\n}\n\nvoid solve() {\n cin >> n >> k >> m;\n if (n > 20) {\n ll ans = 1;\n for (int i = 0; i < n; ++i) {\n (ans *= k) %= m;\n }\n cout << ans << endl;\n return;\n }\n memset(dp, -1,sizeof dp);\n ll ans = 0;\n for (int i = 1; i <= k ; ++i) {\n (ans += slv(1,0,i-1,0))%=m;\n }\n cout<<ans<<endl;\n}\n\nint main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n int t = 1;\n// cin>>t ;\n for (int i = 1; i <= t; ++i) {\n solve();\n }\n\n return 0;\n}", "accuracy": 0.05, "time_ms": 40, "memory_kb": 85364, "score_of_the_acc": -0.3013, "final_rank": 20 }, { "submission_id": "aoj_0422_9645077", "code_snippet": "#include<bits/stdc++.h>\n\n#define ll long long\n\nusing namespace std;\n\nconst int N = 20, offset = 9, M = 1e5+5;\nll n, k, m;\n\n//int dp[N][(1 << N)][10];\nunordered_map<int,int>mp[10][N];\n\nll dp[N][M];\nint fast_power(ll a,ll b){\n\n if (b==0)\n return 1;\n ll ret = dp[a][b] ;\n if (~ret)\n return ret;\n ret = fast_power(a,b>>1);\n (ret*=ret)%=m;\n if (b&1)\n ret*= a;\n ret%=m;\n return ret;\n}\n\nint slv(int i, int mask, int prv, bool fail) {\n if (fail)\n return fast_power(k, n-i);\n if (i == n)\n return 0;\n if (mp[prv][i].count(mask))\n return mp[prv][i][mask];\n\n int ret = 0;\n for (int j = 1; j <= k; ++j) {\n int d = j - (prv+1) + offset;\n (ret += slv(i+1, mask|(1<<d), j-1, fail|mask &(1<<d)) )%=m ;\n }\n return mp[prv][i][mask] = ret;\n}\n\nvoid solve() {\n cin >> n >> k >> m;\n memset(dp, -1,sizeof dp);\n\n if (n > 20) {\n ll ans = fast_power(k, n);\n cout << ans << endl;\n return;\n }\n ll ans = 0;\n for (int i = 1; i <= k ; ++i) {\n (ans += slv(1,0,i-1,0))%=m;\n }\n cout<<ans<<endl;\n}\n\nint main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n int t = 1;\n// cin>>t ;\n for (int i = 1; i <= t; ++i) {\n solve();\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 1580, "memory_kb": 88756, "score_of_the_acc": -1.2189, "final_rank": 15 }, { "submission_id": "aoj_0422_9645072", "code_snippet": "#include<bits/stdc++.h>\n\n#define ll long long\n\nusing namespace std;\n\nconst int N = 19, offset = 9;\nint n, k, m;\n\n//int dp[N][(1 << N)][10];\nunordered_map<int,int>mp[10][N];\n\nll dp[N][N];\nint fast_power(ll a,ll b){\n\n if (b==0)\n return 1;\n ll ret = dp[a][b] ;\n if (~ret)\n return ret;\n ret = fast_power(a,b>>1);\n (ret*=ret)%=m;\n if (b&1)\n ret*= a;\n ret%=m;\n return ret;\n}\n\nint slv(int i, int mask, int prv, bool fail) {\n if (fail)\n return fast_power(k, n-i);\n if (i == n)\n return 0;\n if (mp[prv][i].count(mask))\n return mp[prv][i][mask];\n\n int ret = 0;\n for (int j = 1; j <= k; ++j) {\n int d = j - (prv+1) + offset;\n (ret += slv(i+1, mask|(1<<d), j-1, fail|mask &(1<<d)) )%=m ;\n }\n return mp[prv][i][mask] = ret;\n}\n\nvoid solve() {\n cin >> n >> k >> m;\n if (n >= 20) {\n ll ans = 1;\n for (int i = 0; i < n; ++i) {\n (ans *= k) %= m;\n }\n cout << ans << endl;\n return;\n }\n memset(dp, -1,sizeof dp);\n ll ans = 0;\n for (int i = 1; i <= k ; ++i) {\n (ans += slv(1,0,i-1,0))%=m;\n }\n cout<<ans<<endl;\n}\n\nint main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n int t = 1;\n// cin>>t ;\n for (int i = 1; i <= t; ++i) {\n solve();\n }\n\n return 0;\n}", "accuracy": 0.95, "time_ms": 1420, "memory_kb": 73236, "score_of_the_acc": -1.0473, "final_rank": 16 }, { "submission_id": "aoj_0422_8871192", "code_snippet": "#include <bits/stdc++.h>\n\nlong long pow(long long base, long long exp, long long mod) {\n long long res = 1;\n while (exp > 0) {\n if (exp & 1) {\n res *= base;\n res %= mod;\n }\n base *= base;\n base %= mod;\n exp >>= 1;\n }\n return res;\n}\n\nint main() {\n int n, k;\n long long m;\n std::cin >> n >> k >> m;\n long long ans = pow(k, n, m);\n if (2 * k < n) {\n std::cout << ans << '\\n';\n return 0;\n }\n const int offset = k - 1;\n const int elem_n = 2 * k - 1;\n std::vector dp(k, std::vector<long long>(1 << elem_n));\n std::vector ndp(k, std::vector<long long>(1 << elem_n));\n for (int i = 0; i < k; i++) {\n dp[i][0] = 1;\n }\n for (int i = 0; i + 1 < n; i++) {\n for (int a = 0; a < k; a++) for (int b = 0; b < (1 << elem_n); b++) ndp[a][b] = 0;\n for (int prefix_sum = 0; prefix_sum < k; prefix_sum++) {\n for (int state = 0; state < (1 << elem_n); state++) {\n if (dp[prefix_sum][state] == 0) continue;\n for (int elem = 0; elem < elem_n; elem++) {\n if (state & (1 << elem)) continue;\n int sum = prefix_sum + (elem - offset);\n if (sum < 0 || sum >= k) continue;\n ndp[sum][state | (1 << elem)] += dp[prefix_sum][state];\n if (ndp[sum][state | (1 << elem)] >= m) {\n ndp[sum][state | (1 << elem)] -= m;\n }\n }\n }\n }\n dp.swap(ndp);\n }\n for (int i = 0; i < k; i++) {\n for (int j = 0; j < (1 << elem_n); j++) {\n ans -= dp[i][j];\n if (ans < 0) ans += m;\n }\n }\n std::cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 200, "memory_kb": 89160, "score_of_the_acc": -0.4139, "final_rank": 9 }, { "submission_id": "aoj_0422_8479858", "code_snippet": "#include<bits/stdc++.h>\n#define overload(a,b,c,d,...) d\n#define rep1(a) for(ll _=0;_<(ll)a;++_)\n#define rep2(i,n) for(ll i=0;i<(ll)n;++i)\n#define rep3(i,l,r) for(ll i=(ll)l;i<(ll)r;++i)\n#define rep(...) overload(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(i,a) for(ll i=(ll)a-1;i>=0;--i)\n#define rrep2(i,a,b) for(ll i=(ll)b-1;i>=(ll)a;--i)\n#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)\n#define all(x) (x).begin(),(x).end()\n#define rall(x) (x).rbegin(),(x).rend()\n#define pb push_back\n#define eb emplace_back\nusing namespace std;\nusing ll=long long;\nusing ull=unsigned long long;\nusing ld=long double;\ntemplate<typename T,typename U>inline bool chmin(T&a,const U&b){return (a>b?a=b,true:false);}\ntemplate<typename T,typename U>inline bool chmax(T&a,const U&b){return (a<b?a=b,true:false);}\nstatic constexpr ll mod1=998244353;\nstatic constexpr ll mod=1000000007;\nll modpow(ll a,ll b,ll m){\n\tll ret=1;\n\twhile(b){\n\t\tif(b&1)ret=ret*a%m;\n\t\tb>>=1;\n\t\ta=a*a%m;\n\t}\n\treturn ret;\n}\nll n,k,m;\nvoid add(ll&a,ll b){\n\ta+=b;\n\tif(a>=m)a-=m;\n}\n#define getbit(a,b) (((a)>>(b))&1)\nint main(){\n\tcin>>n>>k>>m;\n\tif(n>2*k){\n\t\tcout<<modpow(k,n,m)<<endl;\n\t\treturn 0;\n\t}\n\tvector dp(k,vector(1<<(2*k-1),0LL));\n\trep(i,k)dp[i][0]=1;\n\trep(sz,n-1){\n\t\t//cerr<<sz<<endl;\n\t\tvector ndp(k,vector(1<<(2*k-1),0LL));\n\t\trep(j,k){\n\t\t\trep(bit,1<<(2*k-1))if(dp[j][bit]!=0){\n\t\t\t\trep(l,k){\n\t\t\t\t\tif(getbit(bit,l-j+k-1))continue;\n\t\t\t\t\tadd(ndp[l][bit|1<<(l-j+k-1)],dp[j][bit]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tdp=move(ndp);\n\t}\n\tll ans=modpow(k,n,m);\n\t//cerr<<ans<<endl;\n\trep(j,k)rep(l,1<<(2*k-1))ans-=dp[j][l];\n\tans%=m;\n\tif(ans<0)ans+=m;\n\tcout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 250, "memory_kb": 89160, "score_of_the_acc": -0.4432, "final_rank": 10 }, { "submission_id": "aoj_0422_7071821", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n int n,k,m; cin>>n>>k>>m;\n\n\tlong long all=1;\n\tfor(int i=1;i<=n;i++){\n\t\t(all*=k)%=m;\n\t}\n\n\tint p=(k-1)*2+1;//p 差の\n\n\tif(n-1>p){\n\t\tcout<<all<<\"\\n\";\n\t\treturn 0;\n\t}\n\n\n\tvector<vector<int>> dp(1<<p,vector<int>(k+1,0));\n\tfor(int i=1;i<=k;i++){\n\t\tdp[0][i]=1;\n\t}\n\tfor(int i=0;i<n-1;i++){//ｎ番目からせんい\n\t\tfor(int bit=0;bit<(1<<p);bit++){\n\t\t\tif(__builtin_popcount(bit)==i){\n\t\t\t\tfor(int j=-k+1;j<=k-1;j++){//差\n\t\t\t\t\tfor(int l=max(1,1-j);l<=min(k,k-j);l++){\n\t\t\t\t\t\tif(!(bit&(1<<(j+k-1)))){\n\t\t\t\t\t\t\t(dp[bit|(1<<(j+k-1))][l+j]+=dp[bit][l])%=m;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tint ans=0;\n\tfor(int bit=0;bit<(1<<p);bit++){\n\t\tif(__builtin_popcount(bit)==n-1){\n\t\t\tfor(int i=1;i<=k;i++){\n\t\t\t\t(ans+=dp[bit][i])%=m;\n\t\t\t}\n\t\t}\n\t}\n\n\tcout<<(all-ans+m)%m<<\"\\n\";\n\n return 0;\n}", "accuracy": 1, "time_ms": 190, "memory_kb": 48020, "score_of_the_acc": -0.2011, "final_rank": 5 }, { "submission_id": "aoj_0422_6977646", "code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 0422.cc: Bug\n */\n\n#include<cstdio>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\nconst int MAX_K = 10;\nconst int MAX_L = MAX_K * 2 - 1;\nconst int LBITS = 1 << MAX_L;\n\n/* typedef */\n\nstruct MI {\n static int MOD;\n int v;\n MI(): v() {}\n MI(int _v): v(_v % MOD) {}\n MI(long long _v): v(_v % MOD) {}\n\n MI operator+(const MI m) const { return MI(v + m.v); }\n MI operator-(const MI m) const { return MI(v + MOD - m.v); }\n MI operator*(const MI m) const { return MI((long long)v * m.v); }\n\n MI &operator+=(const MI m) { return (*this = *this + m); }\n MI &operator-=(const MI m) { return (*this = *this - m); }\n MI &operator*=(const MI m) { return (*this = *this * m); }\n\n MI pow(int n) const { // a^n % MOD\n MI pm = 1, a = *this;\n while (n > 0) {\n if (n & 1) pm *= a;\n a *= a;\n n >>= 1;\n }\n return pm;\n }\n\n MI inv() const { return pow(MOD - 2); }\n MI operator/(const MI m) const { return *this * m.inv(); }\n MI &operator/=(const MI m) { return (*this = *this / m); }\n};\n\nint MI::MOD;\n\ntypedef MI mi;\n\n/* global variables */\n\nint bnums[LBITS];\nmi dp[LBITS][MAX_K];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, k, m;\n scanf(\"%d%d%d\", &n, &k, &m);\n MI::MOD = m;\n\n int dl = k - 1, l = dl * 2 + 1;\n mi a = mi(k).pow(n);\n if (l < n - 1) { printf(\"%d\\n\", a.v); return 0; }\n\n int lbits = 1 << l;\n bnums[0] = 0;\n for (int bits = 1, msb = 1; bits < lbits; bits++) {\n if ((msb << 1) <= bits) msb <<= 1;\n bnums[bits] = bnums[bits ^ msb] + 1;\n }\n //printf(\"a=%d, l=%d, lbits=%d\\n\", a.v, l, lbits);\n\n for (int i = 0; i < k; i++) dp[0][i] = 1;\n mi sum = 0;\n\n for (int bits = 0; bits < lbits; bits++) {\n if (bnums[bits] >= n) continue;\n\n for (int i = 0; i < k; i++)\n if (dp[bits][i].v) {\n\tif (bnums[bits] == n - 1) sum += dp[bits][i];\n\n\tfor (int j = 0; j < k; j++) {\n\t int d = i - j + dl, bd = 1 << d;\n\t if (! (bits & bd))\n\t dp[bits | bd][j] += dp[bits][i];\n\t}\n\t\n }\n }\n\n printf(\"%d\\n\", (a - sum).v);\n return 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 25484, "score_of_the_acc": -0.0058, "final_rank": 1 }, { "submission_id": "aoj_0422_6391020", "code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\n#include <algorithm>\n#include <set>\n#include <stack>\n#include <queue>\n#include <cmath>\n#include <iomanip>\n#include <numeric>\nusing namespace std;\nusing ll = long long;\ntemplate<class T> inline bool chmax(T& a, T b){ if (a < b){ a = b; return true; } return false; }\ntemplate<class T> inline bool chmin(T& a, T b){ if (a > b){ a = b; return true; } return false; }\n\n\nint main() {\n ll N, K, mod;\n cin >> N >> K >> mod;\n \n ll powK[1010101] = {};\n powK[0] = 1;\n for(int i=1; i <= N; ++i) powK[i] = powK[i-1] * K % mod;\n\n int s = 1 - K, t = K - 1;\n map<pair<int, int>, ll> dp;\n for(int i=1; i<=K; ++i) dp[make_pair(i, 0)] = 1;\n\n ll ans = 0;\n for(int i=2; i<= N; ++i) {\n bool updated = false;\n map<pair<int, int>, ll> ndp;\n for(auto &mp: dp) {\n for(int x=1; x <= K; ++x) {\n int d = (x - mp.first.first) + t;\n if ((mp.first.second >> d) & 1) {\n ans += mp.second * powK[N-i] % mod;\n ans %= mod;\n continue;\n }\n ndp[make_pair(x, mp.first.second|(1<<d))] += mp.second;\n ndp[make_pair(x, mp.first.second|(1<<d))] %= mod;\n updated = true;\n }\n }\n if (!updated) break;\n dp = ndp;\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 1750, "memory_kb": 46276, "score_of_the_acc": -1.1046, "final_rank": 13 }, { "submission_id": "aoj_0422_6046443", "code_snippet": "#ifdef LOGX\n#define _GLIBCXX_DEBUG\n#endif\n#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\n#define rep(i,n) for(int i=0;i<int(n);i++)\n#define rep2(i,s,n) for(int i=int(s);i<int(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\nconst int big=1e9+7;\n//const int big=998244353;\nconst char newl='\\n';\nconst int inf=1e9+10;\nconst ll INF=ll(1e18)+10;\nconst int dx[]={1,0,-1,0};\nconst int dy[]={0,1,0,-1};\n\nusing P=pair<ll,int>;\npriority_queue<P,vector<P>,greater<P>> q;\n\nll exp(ll x,ll y,ll mod){\n ll res=1;\n while(y){\n if(y&1)(res*=x)%=mod;\n (x*=x)%=mod;\n y>>=1;\n }\n return res;\n}\n\n#define mybit(i,j) (((i)>>(j))&1)\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n \n int n,m,k;\n cin >> n >> k >> m;\n if(n>=21){\n cout << exp(k,n,m) << newl;\n return 0;\n }\n else{\n vector<vector<vector<int>>> dp(2,vector<vector<int>>(k,vector<int>(1<<(2*k-1))));\n const int B=k-1;\n rep(i,k)dp[0][i][0]=1;\n rep(i,n-1){\n dp[(i+1)%2]=vector<vector<int>>(k,vector<int>(1<<(2*k-1)));\n rep(j,k)rep(S,1<<(2*k-1))if(dp[i%2][j][S])rep(nxt,k)if(!mybit(S,nxt-j+B)){\n dp[(i+1)%2][nxt][S|1<<(nxt-j+B)]+=dp[i%2][j][S];\n if(dp[(i+1)%2][nxt][S|1<<(nxt-j+B)]>=m)dp[(i+1)%2][nxt][S|1<<(nxt-j+B)]-=m;\n }\n }\n int ans=0;\n rep(i,k)rep(j,1<<(2*k-1))ans=(ans+dp[(n-1)%2][i][j])%m;\n ans=exp(k,n,m)-ans;\n ans%=m;\n ans+=m;\n ans%=m;\n cout << ans << newl;\n }\n}\n//命令の差：高々19通り\n//鳩の巣原理をすれば、命令の差が20個ある i.e. 長さ>=21 の命令列は全てバグる", "accuracy": 1, "time_ms": 230, "memory_kb": 66780, "score_of_the_acc": -0.3189, "final_rank": 6 }, { "submission_id": "aoj_0422_6017065", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\ntemplate<class T> using vc = vector<T>;\ntemplate<class T> using vvc = vc<vc<T>>;\ntemplate<class T> using vvvc = vc<vvc<T>>;\ntemplate<class T> using vvvvc = vvc<vvc<T>>;\ntemplate<class T> using PQ = priority_queue<T>;\ntemplate<class T> using invPQ = priority_queue<T, vector<T>, greater<T>>;\nusing IP = pair<int, int>;\nusing LP = pair<ll, ll>;\n#define all(x) begin(x), end(x)\n#define allr(x) rbegin(x), rend(x)\n#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)\n#define rep3(i, m, n) for (int i = (m); (i) < (int)(n); i++)\n#define repr(i, n) for (int i = (n) - 1; (i) >= 0; i--)\n#define rep3r(i, m, n) for (int i = (n) - 1; (i) >= (int)(m); i--)\ntemplate<class T> inline bool chmax(T & a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T & a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\nsigned main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int N, K, M;\n cin >> N >> K >> M;\n\n if (K * 2 - 1 < N - 1) {\n ll ans = 1;\n rep (i, N) ans = (ans * K) % M;\n cout << ans << endl;\n return 0;\n }\n\n vvc<ll> dp(1 << (K*2-1), vc<ll>(K+1));\n rep (i, K) dp[0][i+1] = 1;\n for (int i = 0; i < 1 << (K*2-1); i++) {\n rep3 (j, 1, K+1) {\n rep3 (k, 1, K+1) {\n if ((1 << ((j - k) + K - 1)) & i) continue;\n dp[i|1 << ((j - k) + K - 1)][k] += dp[i][j];\n dp[i|1 << ((j - k) + K - 1)][k] %= M;\n }\n }\n }\n\n ll ans = 1;\n rep (i, N) ans = (ans * K) % M;\n for (int i = 0; i < 1 << (K*2-1); i++) {\n if (bitset<19>(i).count() != N-1) continue;\n rep3 (j, 1, K+1) {\n ans = (ans - dp[i][j] + M) % M;\n }\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 280, "memory_kb": 64520, "score_of_the_acc": -0.3368, "final_rank": 7 }, { "submission_id": "aoj_0422_5985517", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int N, K, M;\n cin >> N >> K >> M;\n vector<vector<int>> dp(1 << (K * 2 - 1), vector<int>(K, 0));\n for (int i = 0; i < K; i++){\n dp[0][i] = 1;\n }\n for (int i = 0; i < (1 << (K * 2 - 1)); i++){\n for (int j = 0; j < K; j++){\n for (int k = 0; k < K; k++){\n int p = j - k + K - 1;\n if ((i >> p & 1) == 0){\n int i2 = i | (1 << p);\n dp[i2][k] += dp[i][j];\n if (dp[i2][k] >= M){\n dp[i2][k] -= M;\n }\n }\n }\n }\n }\n long long ans = 1;\n for (int i = 0; i < N; i++){\n ans *= K;\n ans %= M;\n }\n for (int i = 0; i < (1 << (K * 2 - 1)); i++){\n if (__builtin_popcount(i) == N - 1){\n for (int j = 0; j < K; j++){\n ans -= dp[i][j];\n if (ans < 0){\n ans += M;\n }\n }\n }\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 110, "memory_kb": 39960, "score_of_the_acc": -0.1138, "final_rank": 3 }, { "submission_id": "aoj_0422_5757023", "code_snippet": "#include<iostream>\n#include<stdio.h>\n#include<vector>\n#include<algorithm>\n#include<set>\n#include<string>\n#include<map>\n#include<string.h>\n#include<complex>\n#include<math.h>\n#include<queue>\n#include <functional>\n#include<time.h>\n#include<iomanip>\n#include<cassert>\n#include<bitset>\n#include<sstream>\n#include <unordered_set>\nusing namespace std;\ntypedef long long int llint;\ntypedef pair<int, int> pint;\ntypedef pair<llint, llint> pllint;\ntypedef vector<int> vint;\ntypedef vector<llint> vllint;\ntypedef vector<pint> vpint;\ntypedef vector<string> vstring;\ntypedef vector<pair<llint, llint>> vpllint;\ntypedef vector<vector<int>> vvint;\ntypedef vector<vector<llint>> vvllint;\ntypedef vector<vector<pint>> vvpint;\ntypedef vector<bool> vbool;\ntypedef vector<vbool> vvbool;\ntypedef vector<vpllint> vvpllint;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define drep(i,n) for(int i=n-1;0<=i;i--)\n#define yes(ans) if(ans)cout<<\"yes\"<<endl;else cout<<\"no\"<<endl;\n#define Yes(ans) if(ans)cout<<\"Yes\"<<endl;else cout<<\"No\"<<endl;\n#define YES(ans) if(ans)cout<<\"YES\"<<endl;else cout<<\"NO\"<<endl;\n#define POSSIBLE(ans) if(ans)cout<<\"POSSIBLE\"<<endl;else cout<<\"IMPOSSIBLE\"<<endl;\n#define Pi 3.1415926535897932384626\n#define mod llint(1e9+7)\n#define mod9 998244353\n#define Inf 2147483647\n#define llInf 9223372036854775807\n#define all(x) x.begin(),x.end()\n#define isin(i,n) (0<=i&&i<n)\n\nclass UnionFind {\npublic:\n\t//親の番号を格納する。親だった場合は-(その集合のサイズ)\n\tvector<int> Parent;\n\n\t//作るときはParentの値を全て-1にする\n\t//こうすると全てバラバラになる\n\tUnionFind(int N) {\n\t\tParent = vector<int>(N, -1);\n\t}\n\n\t//Aがどのグループに属しているか調べる\n\tint root(int A) {\n\t\tif (Parent[A] < 0) return A;\n\t\treturn Parent[A] = root(Parent[A]);\n\t}\n\n\t//自分のいるグループの頂点数を調べる\n\tint size(int A) {\n\t\treturn -Parent[root(A)];//親をとってきたい\n\t}\n\n\t//AとBをくっ付ける\n\tbool connect(int A, int B) {\n\t\t//AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける\n\t\tA = root(A);\n\t\tB = root(B);\n\t\tif (A == B) {\n\t\t\t//すでにくっついてるからくっ付けない\n\t\t\treturn false;\n\t\t}\n\n\t\t//大きい方(A)に小さいほう(B)をくっ付けたい\n\t\t//大小が逆だったらひっくり返しちゃう。\n\t\tif (size(A) < size(B)) swap(A, B);\n\n\t\t//Aのサイズを更新する\n\t\tParent[A] += Parent[B];\n\t\t//Bの親をAに変更する\n\t\tParent[B] = A;\n\n\t\treturn true;\n\t}\n};\n\n//セグ木・0-indexed・非再帰・(大きさ・単位元・関数)で初期化\ntemplate<typename T>\nstruct SegTree {\n\t//比較関数の型\n\tusing F = function<T(T, T)>;\n\t//二分木を配列で表したもの\n\tvector<T>seg;\n\t//木の半分の大きさ\n\tint siz;\n\t//単位元\n\tconst T unit;\n\t//比較する関数\n\tconst F f;\n\n\t//大きさn、unit(単位元)、f(モノイド)でsegtreeを初期化する\n\tSegTree(int n, const T unit, const F f) : unit(unit), f(f) {\n\t\tsiz = 1;\n\t\twhile (siz < n)siz <<= 1;\n\t\tseg.assign(siz * 2 - 1, unit);\n\t\tsiz--;\n\t}\n\n\t//k番目にtを入力\n\tvoid set(int k, const T& t) {\n\t\tseg[k + siz] = t;\n\t}\n\n\t//fによって木を構築する\n\tvoid build() {\n\t\tfor (int i = siz - 1; 0 <= i; i--) {\n\t\t\tseg[i] = f(seg[i * 2 + 1], seg[i * 2 + 2]);\n\t\t}\n\t}\n\n\tT operator[](const int i) {\n\t\treturn seg[i + siz];\n\t}\n\n\t//k番目をxに更新する\n\tvoid update(int k, T x) {\n\t\tk += siz;\n\t\tseg[k] = x;\n\t\twhile (0 < k) {\n\t\t\tk = (k - 1) >> 1;\n\t\t\tseg[k] = f(seg[k * 2 + 1], seg[k * 2 + 2]);\n\t\t}\n\t}\n\n\t//[a,b)について、fした結果を返す\n\t//半開区域のためa以上b未満の位置を指す\n\tT query(int a, int b) {\n\t\tT l = unit, r = unit;\n\t\tfor (a += siz, b += siz; a < b; a >>= 1, b >>= 1) {\n\t\t\tif (!(a & 1))l = f(l, seg[a++]);\n\t\t\tif (!(b & 1))r = f(seg[--b], r);\n\t\t}\n\t\treturn f(l, r);\n\t}\n};\n\n//aとbの最大公約数を求めるよ\nlong long GCD(long long a, long long b) {\n\tif (b == 0) return a;\n\telse return GCD(b, a % b);\n}\n\n// 返り値: a と b の最大公約数\n// ax + by = gcd(a, b) を満たす (x, y) が格納される\nlong long extGCD(long long a, long long b, long long& x, long long& y) {\n\tif (b == 0) {\n\t\tx = 1;\n\t\ty = 0;\n\t\treturn a;\n\t}\n\tlong long d = extGCD(b, a % b, y, x);\n\ty -= a / b * x;\n\treturn d;\n}\n\n// mod. m での a の逆元 a^{-1} を計算する\nlong long modinv(long long a, long long m) {\n\tlong long b = m, u = 1, v = 0;\n\twhile (b) {\n\t\tlong long t = a / b;\n\t\ta -= t * b; swap(a, b);\n\t\tu -= t * v; swap(u, v);\n\t}\n\tu %= m;\n\tif (u < 0) u += m;\n\treturn u;\n}\n\n//nCrをmで割った余りを求める\nllint nCr(llint n, llint r, llint m) {\n\tllint ans = 1;\n\tfor (llint i = 0; i < r; i++) {\n\t\tans *= n - i;\n\t\tans %= m;\n\t}\n\tfor (llint i = 1; i <= r; i++) {\n\t\tans *= modinv(i, m);\n\t\tans %= m;\n\t}\n\treturn ans;\n}\n\n//aのb乗をmで割った余りを求める\nllint power(llint a, llint b, llint m) {\n\tif (b == 1)return a;\n\tif (b == 0)return 1;\n\tllint tmp = power(a, (llint)b / 2, m);\n\ttmp *= tmp;\n\ttmp %= m;\n\tif (b % 2 == 1) {\n\t\ttmp *= a;\n\t\ttmp %= m;\n\t}\n\treturn tmp;\n}\n\n//bitを表すsub,要素数を表すlength\nbool next_combination(llint& sub, int length) {\n\tif (sub == 0)return false;\n\tllint x = sub & -sub, y = sub + x;\n\tsub = (((sub & ~y) / x) >> 1) | y;\n\treturn sub < (llint)(1 << (llint)length);\n}\n\nvoid Zalgorithm(string& s, vint& a) {\n\ta[0] = s.size();\n\tint i = 1, j = 0;\n\twhile (i < s.size()) {\n\t\twhile (i + j < s.size() && s[j] == s[i + j])j++;\n\t\ta[i] = j;\n\t\tif (j == 0) { i++; continue; }\n\t\tint k = 1;\n\t\twhile (i + k < s.size() && a[k] + k < j) {\n\t\t\ta[i + k] += a[k]; k++;\n\t\t}\n\t\ti += k; j -= k;\n\t}\n\treturn;\n}\n\nint main() {\n\tint n, k, m;\n\tcin >> n >> k >> m;\n\tllint sum = 1;\n\trep(i, n) {\n\t\t(sum *= (llint)k) %= m;\n\t}\n\tif (n > 2 * k) {\n\t\tcout << sum << endl;\n\t}\n\telse {\n\t\t//-k+1~k-1までの差で1~kまでの数字しか使えない長さNの配列の通り数\n\t\t//bitDPで解く\n\n\t\t//bitdp[i][j][k]…i番目がjで、kを使ったものの通り数\n\t\tvector bitdp(k, vint(1 << (2 * k - 1), 0));\n\t\trep(i, n - 1) {\n\t\t\tif (i == 0) {\n\t\t\t\trep(j, k) {\n\t\t\t\t\tbitdp[j][0] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\trep(j, k) {\n\t\t\t\tllint l = (1 << i) - 1;\n\t\t\t\tdo {\n\t\t\t\t\trep(nj, k) {\n\t\t\t\t\t\tif (l & (1 << (nj - j + k - 1)))continue;\n\t\t\t\t\t\t(bitdp[nj][l | (1 << (nj - j + k - 1))] += bitdp[j][l]) %= m;\n\t\t\t\t\t}\n\t\t\t\t} while (next_combination(l, 2 * k - 1));\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\t\trep(i, k) {\n\t\t\tllint l = (1 << (n - 1)) - 1;\n\t\t\tdo {\n\t\t\t\t(ans += bitdp[i][l]) %= m;\n\t\t\t} while (next_combination(l, 2 * k - 1));\n\t\t}\n\t\t(ans = sum - ans) %= m;\n\t\tif (ans < 0)ans += m;\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 200, "memory_kb": 25816, "score_of_the_acc": -0.0952, "final_rank": 2 }, { "submission_id": "aoj_0422_5757011", "code_snippet": "#include<iostream>\n#include<stdio.h>\n#include<vector>\n#include<algorithm>\n#include<set>\n#include<string>\n#include<map>\n#include<string.h>\n#include<complex>\n#include<math.h>\n#include<queue>\n#include <functional>\n#include<time.h>\n#include<iomanip>\n#include<cassert>\n#include<bitset>\n#include<sstream>\n#include <unordered_set>\nusing namespace std;\ntypedef long long int llint;\ntypedef pair<int, int> pint;\ntypedef pair<llint, llint> pllint;\ntypedef vector<int> vint;\ntypedef vector<llint> vllint;\ntypedef vector<pint> vpint;\ntypedef vector<string> vstring;\ntypedef vector<pair<llint, llint>> vpllint;\ntypedef vector<vector<int>> vvint;\ntypedef vector<vector<llint>> vvllint;\ntypedef vector<vector<pint>> vvpint;\ntypedef vector<bool> vbool;\ntypedef vector<vbool> vvbool;\ntypedef vector<vpllint> vvpllint;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define drep(i,n) for(int i=n-1;0<=i;i--)\n#define yes(ans) if(ans)cout<<\"yes\"<<endl;else cout<<\"no\"<<endl;\n#define Yes(ans) if(ans)cout<<\"Yes\"<<endl;else cout<<\"No\"<<endl;\n#define YES(ans) if(ans)cout<<\"YES\"<<endl;else cout<<\"NO\"<<endl;\n#define POSSIBLE(ans) if(ans)cout<<\"POSSIBLE\"<<endl;else cout<<\"IMPOSSIBLE\"<<endl;\n#define Pi 3.1415926535897932384626\n#define mod llint(1e9+7)\n#define mod9 998244353\n#define Inf 2147483647\n#define llInf 9223372036854775807\n#define all(x) x.begin(),x.end()\n#define isin(i,n) (0<=i&&i<n)\n\nclass UnionFind {\npublic:\n\t//親の番号を格納する。親だった場合は-(その集合のサイズ)\n\tvector<int> Parent;\n\n\t//作るときはParentの値を全て-1にする\n\t//こうすると全てバラバラになる\n\tUnionFind(int N) {\n\t\tParent = vector<int>(N, -1);\n\t}\n\n\t//Aがどのグループに属しているか調べる\n\tint root(int A) {\n\t\tif (Parent[A] < 0) return A;\n\t\treturn Parent[A] = root(Parent[A]);\n\t}\n\n\t//自分のいるグループの頂点数を調べる\n\tint size(int A) {\n\t\treturn -Parent[root(A)];//親をとってきたい\n\t}\n\n\t//AとBをくっ付ける\n\tbool connect(int A, int B) {\n\t\t//AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける\n\t\tA = root(A);\n\t\tB = root(B);\n\t\tif (A == B) {\n\t\t\t//すでにくっついてるからくっ付けない\n\t\t\treturn false;\n\t\t}\n\n\t\t//大きい方(A)に小さいほう(B)をくっ付けたい\n\t\t//大小が逆だったらひっくり返しちゃう。\n\t\tif (size(A) < size(B)) swap(A, B);\n\n\t\t//Aのサイズを更新する\n\t\tParent[A] += Parent[B];\n\t\t//Bの親をAに変更する\n\t\tParent[B] = A;\n\n\t\treturn true;\n\t}\n};\n\n//セグ木・0-indexed・非再帰・(大きさ・単位元・関数)で初期化\ntemplate<typename T>\nstruct SegTree {\n\t//比較関数の型\n\tusing F = function<T(T, T)>;\n\t//二分木を配列で表したもの\n\tvector<T>seg;\n\t//木の半分の大きさ\n\tint siz;\n\t//単位元\n\tconst T unit;\n\t//比較する関数\n\tconst F f;\n\n\t//大きさn、unit(単位元)、f(モノイド)でsegtreeを初期化する\n\tSegTree(int n, const T unit, const F f) : unit(unit), f(f) {\n\t\tsiz = 1;\n\t\twhile (siz < n)siz <<= 1;\n\t\tseg.assign(siz * 2 - 1, unit);\n\t\tsiz--;\n\t}\n\n\t//k番目にtを入力\n\tvoid set(int k, const T& t) {\n\t\tseg[k + siz] = t;\n\t}\n\n\t//fによって木を構築する\n\tvoid build() {\n\t\tfor (int i = siz - 1; 0 <= i; i--) {\n\t\t\tseg[i] = f(seg[i * 2 + 1], seg[i * 2 + 2]);\n\t\t}\n\t}\n\n\tT operator[](const int i) {\n\t\treturn seg[i + siz];\n\t}\n\n\t//k番目をxに更新する\n\tvoid update(int k, T x) {\n\t\tk += siz;\n\t\tseg[k] = x;\n\t\twhile (0 < k) {\n\t\t\tk = (k - 1) >> 1;\n\t\t\tseg[k] = f(seg[k * 2 + 1], seg[k * 2 + 2]);\n\t\t}\n\t}\n\n\t//[a,b)について、fした結果を返す\n\t//半開区域のためa以上b未満の位置を指す\n\tT query(int a, int b) {\n\t\tT l = unit, r = unit;\n\t\tfor (a += siz, b += siz; a < b; a >>= 1, b >>= 1) {\n\t\t\tif (!(a & 1))l = f(l, seg[a++]);\n\t\t\tif (!(b & 1))r = f(seg[--b], r);\n\t\t}\n\t\treturn f(l, r);\n\t}\n};\n\n//aとbの最大公約数を求めるよ\nlong long GCD(long long a, long long b) {\n\tif (b == 0) return a;\n\telse return GCD(b, a % b);\n}\n\n// 返り値: a と b の最大公約数\n// ax + by = gcd(a, b) を満たす (x, y) が格納される\nlong long extGCD(long long a, long long b, long long& x, long long& y) {\n\tif (b == 0) {\n\t\tx = 1;\n\t\ty = 0;\n\t\treturn a;\n\t}\n\tlong long d = extGCD(b, a % b, y, x);\n\ty -= a / b * x;\n\treturn d;\n}\n\n// mod. m での a の逆元 a^{-1} を計算する\nlong long modinv(long long a, long long m) {\n\tlong long b = m, u = 1, v = 0;\n\twhile (b) {\n\t\tlong long t = a / b;\n\t\ta -= t * b; swap(a, b);\n\t\tu -= t * v; swap(u, v);\n\t}\n\tu %= m;\n\tif (u < 0) u += m;\n\treturn u;\n}\n\n//nCrをmで割った余りを求める\nllint nCr(llint n, llint r, llint m) {\n\tllint ans = 1;\n\tfor (llint i = 0; i < r; i++) {\n\t\tans *= n - i;\n\t\tans %= m;\n\t}\n\tfor (llint i = 1; i <= r; i++) {\n\t\tans *= modinv(i, m);\n\t\tans %= m;\n\t}\n\treturn ans;\n}\n\n//aのb乗をmで割った余りを求める\nllint power(llint a, llint b, llint m) {\n\tif (b == 1)return a;\n\tif (b == 0)return 1;\n\tllint tmp = power(a, (llint)b / 2, m);\n\ttmp *= tmp;\n\ttmp %= m;\n\tif (b % 2 == 1) {\n\t\ttmp *= a;\n\t\ttmp %= m;\n\t}\n\treturn tmp;\n}\n\n//bitを表すsub,要素数を表すlength\nbool next_combination(llint& sub, int length) {\n\tif (sub == 0)return false;\n\tllint x = sub & -sub, y = sub + x;\n\tsub = (((sub & ~y) / x) >> 1) | y;\n\treturn sub < (llint)(1 << (llint)length);\n}\n\nvoid Zalgorithm(string& s, vint& a) {\n\ta[0] = s.size();\n\tint i = 1, j = 0;\n\twhile (i < s.size()) {\n\t\twhile (i + j < s.size() && s[j] == s[i + j])j++;\n\t\ta[i] = j;\n\t\tif (j == 0) { i++; continue; }\n\t\tint k = 1;\n\t\twhile (i + k < s.size() && a[k] + k < j) {\n\t\t\ta[i + k] += a[k]; k++;\n\t\t}\n\t\ti += k; j -= k;\n\t}\n\treturn;\n}\n\nint main() {\n\tint n, k, m;\n\tcin >> n >> k >> m;\n\tllint sum = 1;\n\trep(i, n) {\n\t\t(sum *= (llint)k) %= m;\n\t}\n\tif (n >= 2 * k) {\n\t\tcout << sum << endl;\n\t}\n\telse {\n\t\t//-k+1~k-1までの差で1~kまでの数字しか使えない長さNの配列の通り数\n\t\t//bitDPで解く\n\n\t\t//bitdp[i][j][k]…i番目がjで、kを使ったものの通り数\n\t\tvector bitdp(k, vint(1 << (2 * k - 1), 0));\n\t\trep(i, n - 1) {\n\t\t\tif (i == 0) {\n\t\t\t\trep(j, k) {\n\t\t\t\t\tbitdp[j][0] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\trep(j, k) {\n\t\t\t\tllint l = (1 << i) - 1;\n\t\t\t\tdo {\n\t\t\t\t\trep(nj, k) {\n\t\t\t\t\t\tif (l & (1 << (nj - j + k - 1)))continue;\n\t\t\t\t\t\t(bitdp[nj][l | (1 << (nj - j + k - 1))] += bitdp[j][l]) %= m;\n\t\t\t\t\t}\n\t\t\t\t} while (next_combination(l, 2 * k - 1));\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\t\trep(i, k) {\n\t\t\tllint l = (1 << (n - 1)) - 1;\n\t\t\tdo {\n\t\t\t\t(ans += bitdp[i][l]) %= m;\n\t\t\t} while (next_combination(l, 2 * k - 1));\n\t\t}\n\t\t(ans = sum - ans) %= m;\n\t\tif (ans < 0)ans += m;\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}", "accuracy": 0.9, "time_ms": 200, "memory_kb": 25632, "score_of_the_acc": -0.0943, "final_rank": 18 }, { "submission_id": "aoj_0422_5757004", "code_snippet": "#include<iostream>\n#include<stdio.h>\n#include<vector>\n#include<algorithm>\n#include<set>\n#include<string>\n#include<map>\n#include<string.h>\n#include<complex>\n#include<math.h>\n#include<queue>\n#include <functional>\n#include<time.h>\n#include<iomanip>\n#include<cassert>\n#include<bitset>\n#include<sstream>\n#include <unordered_set>\nusing namespace std;\ntypedef long long int llint;\ntypedef pair<int, int> pint;\ntypedef pair<llint, llint> pllint;\ntypedef vector<int> vint;\ntypedef vector<llint> vllint;\ntypedef vector<pint> vpint;\ntypedef vector<string> vstring;\ntypedef vector<pair<llint, llint>> vpllint;\ntypedef vector<vector<int>> vvint;\ntypedef vector<vector<llint>> vvllint;\ntypedef vector<vector<pint>> vvpint;\ntypedef vector<bool> vbool;\ntypedef vector<vbool> vvbool;\ntypedef vector<vpllint> vvpllint;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define drep(i,n) for(int i=n-1;0<=i;i--)\n#define yes(ans) if(ans)cout<<\"yes\"<<endl;else cout<<\"no\"<<endl;\n#define Yes(ans) if(ans)cout<<\"Yes\"<<endl;else cout<<\"No\"<<endl;\n#define YES(ans) if(ans)cout<<\"YES\"<<endl;else cout<<\"NO\"<<endl;\n#define POSSIBLE(ans) if(ans)cout<<\"POSSIBLE\"<<endl;else cout<<\"IMPOSSIBLE\"<<endl;\n#define Pi 3.1415926535897932384626\n#define mod llint(1e9+7)\n#define mod9 998244353\n#define Inf 2147483647\n#define llInf 9223372036854775807\n#define all(x) x.begin(),x.end()\n#define isin(i,n) (0<=i&&i<n)\n\nclass UnionFind {\npublic:\n\t//親の番号を格納する。親だった場合は-(その集合のサイズ)\n\tvector<int> Parent;\n\n\t//作るときはParentの値を全て-1にする\n\t//こうすると全てバラバラになる\n\tUnionFind(int N) {\n\t\tParent = vector<int>(N, -1);\n\t}\n\n\t//Aがどのグループに属しているか調べる\n\tint root(int A) {\n\t\tif (Parent[A] < 0) return A;\n\t\treturn Parent[A] = root(Parent[A]);\n\t}\n\n\t//自分のいるグループの頂点数を調べる\n\tint size(int A) {\n\t\treturn -Parent[root(A)];//親をとってきたい\n\t}\n\n\t//AとBをくっ付ける\n\tbool connect(int A, int B) {\n\t\t//AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける\n\t\tA = root(A);\n\t\tB = root(B);\n\t\tif (A == B) {\n\t\t\t//すでにくっついてるからくっ付けない\n\t\t\treturn false;\n\t\t}\n\n\t\t//大きい方(A)に小さいほう(B)をくっ付けたい\n\t\t//大小が逆だったらひっくり返しちゃう。\n\t\tif (size(A) < size(B)) swap(A, B);\n\n\t\t//Aのサイズを更新する\n\t\tParent[A] += Parent[B];\n\t\t//Bの親をAに変更する\n\t\tParent[B] = A;\n\n\t\treturn true;\n\t}\n};\n\n//セグ木・0-indexed・非再帰・(大きさ・単位元・関数)で初期化\ntemplate<typename T>\nstruct SegTree {\n\t//比較関数の型\n\tusing F = function<T(T, T)>;\n\t//二分木を配列で表したもの\n\tvector<T>seg;\n\t//木の半分の大きさ\n\tint siz;\n\t//単位元\n\tconst T unit;\n\t//比較する関数\n\tconst F f;\n\n\t//大きさn、unit(単位元)、f(モノイド)でsegtreeを初期化する\n\tSegTree(int n, const T unit, const F f) : unit(unit), f(f) {\n\t\tsiz = 1;\n\t\twhile (siz < n)siz <<= 1;\n\t\tseg.assign(siz * 2 - 1, unit);\n\t\tsiz--;\n\t}\n\n\t//k番目にtを入力\n\tvoid set(int k, const T& t) {\n\t\tseg[k + siz] = t;\n\t}\n\n\t//fによって木を構築する\n\tvoid build() {\n\t\tfor (int i = siz - 1; 0 <= i; i--) {\n\t\t\tseg[i] = f(seg[i * 2 + 1], seg[i * 2 + 2]);\n\t\t}\n\t}\n\n\tT operator[](const int i) {\n\t\treturn seg[i + siz];\n\t}\n\n\t//k番目をxに更新する\n\tvoid update(int k, T x) {\n\t\tk += siz;\n\t\tseg[k] = x;\n\t\twhile (0 < k) {\n\t\t\tk = (k - 1) >> 1;\n\t\t\tseg[k] = f(seg[k * 2 + 1], seg[k * 2 + 2]);\n\t\t}\n\t}\n\n\t//[a,b)について、fした結果を返す\n\t//半開区域のためa以上b未満の位置を指す\n\tT query(int a, int b) {\n\t\tT l = unit, r = unit;\n\t\tfor (a += siz, b += siz; a < b; a >>= 1, b >>= 1) {\n\t\t\tif (!(a & 1))l = f(l, seg[a++]);\n\t\t\tif (!(b & 1))r = f(seg[--b], r);\n\t\t}\n\t\treturn f(l, r);\n\t}\n};\n\n//aとbの最大公約数を求めるよ\nlong long GCD(long long a, long long b) {\n\tif (b == 0) return a;\n\telse return GCD(b, a % b);\n}\n\n// 返り値: a と b の最大公約数\n// ax + by = gcd(a, b) を満たす (x, y) が格納される\nlong long extGCD(long long a, long long b, long long& x, long long& y) {\n\tif (b == 0) {\n\t\tx = 1;\n\t\ty = 0;\n\t\treturn a;\n\t}\n\tlong long d = extGCD(b, a % b, y, x);\n\ty -= a / b * x;\n\treturn d;\n}\n\n// mod. m での a の逆元 a^{-1} を計算する\nlong long modinv(long long a, long long m) {\n\tlong long b = m, u = 1, v = 0;\n\twhile (b) {\n\t\tlong long t = a / b;\n\t\ta -= t * b; swap(a, b);\n\t\tu -= t * v; swap(u, v);\n\t}\n\tu %= m;\n\tif (u < 0) u += m;\n\treturn u;\n}\n\n//nCrをmで割った余りを求める\nllint nCr(llint n, llint r, llint m) {\n\tllint ans = 1;\n\tfor (llint i = 0; i < r; i++) {\n\t\tans *= n - i;\n\t\tans %= m;\n\t}\n\tfor (llint i = 1; i <= r; i++) {\n\t\tans *= modinv(i, m);\n\t\tans %= m;\n\t}\n\treturn ans;\n}\n\n//aのb乗をmで割った余りを求める\nllint power(llint a, llint b, llint m) {\n\tif (b == 1)return a;\n\tif (b == 0)return 1;\n\tllint tmp = power(a, (llint)b / 2, m);\n\ttmp *= tmp;\n\ttmp %= m;\n\tif (b % 2 == 1) {\n\t\ttmp *= a;\n\t\ttmp %= m;\n\t}\n\treturn tmp;\n}\n\n//bitを表すsub,要素数を表すlength\nbool next_combination(llint& sub, int length) {\n\tif (sub == 0)return false;\n\tllint x = sub & -sub, y = sub + x;\n\tsub = (((sub & ~y) / x) >> 1) | y;\n\treturn sub < (llint)(1 << (llint)length);\n}\n\nvoid Zalgorithm(string& s, vint& a) {\n\ta[0] = s.size();\n\tint i = 1, j = 0;\n\twhile (i < s.size()) {\n\t\twhile (i + j < s.size() && s[j] == s[i + j])j++;\n\t\ta[i] = j;\n\t\tif (j == 0) { i++; continue; }\n\t\tint k = 1;\n\t\twhile (i + k < s.size() && a[k] + k < j) {\n\t\t\ta[i + k] += a[k]; k++;\n\t\t}\n\t\ti += k; j -= k;\n\t}\n\treturn;\n}\n\nint main() {\n\tint n, k, m;\n\tcin >> n >> k >> m;\n\tllint sum = 1;\n\trep(i, n) {\n\t\t(sum *= k) %= m;\n\t}\n\tif (n >= 2 * k) {\n\t\tcout << sum << endl;\n\t}\n\telse {\n\t\t//-k+1~k-1までの差で1~kまでの数字しか使えない長さNの配列の通り数\n\t\t//bitDPで解く\n\n\t\t//bitdp[i][j][k]…i番目がjで、kを使ったものの通り数\n\t\tvector bitdp(k, vint(1 << (2 * k - 1), 0));\n\t\trep(i, n - 1) {\n\t\t\tif (i == 0) {\n\t\t\t\trep(j, k) {\n\t\t\t\t\tbitdp[j][0] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\trep(j, k) {\n\t\t\t\tllint l = (1 << i) - 1;\n\t\t\t\tdo {\n\t\t\t\t\trep(nj, k) {\n\t\t\t\t\t\tif (l & (1 << (nj - j + k - 1)))continue;\n\t\t\t\t\t\t(bitdp[nj][l | (1 << (nj - j + k - 1))] += bitdp[j][l]) %= m;\n\t\t\t\t\t}\n\t\t\t\t} while (next_combination(l, 2 * k - 1));\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\t\trep(i, k) {\n\t\t\tllint l = (1 << (n - 1)) - 1;\n\t\t\tdo {\n\t\t\t\t(ans += bitdp[i][l]) %= m;\n\t\t\t} while (next_combination(l, 2 * k - 1));\n\t\t}\n\t\t(ans = sum - ans) %= m;\n\t\tif (ans < 0)ans += m;\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}", "accuracy": 0.9, "time_ms": 190, "memory_kb": 25748, "score_of_the_acc": -0.089, "final_rank": 17 }, { "submission_id": "aoj_0422_5038362", "code_snippet": "#include<iostream>\nusing namespace std;\nint N,K,M;\nint dp[21][10][1<<19];\nmain()\n{\n\tcin>>N>>K>>M;\n\tint ans=0;\n\tif(K*2>=N)\n\t{\n\t\tfor(int i=0;i<K;i++)dp[0][i][0]=1;\n\t\tfor(int i=0;i<N-1;i++)\n\t\t{\n\t\t\tint comb=(1<<i)-1;\n\t\t\twhile(comb<1<<K*2-1)\n\t\t\t{\n\t\t\t\tfor(int j=0;j<K;j++)for(int l=0;l<K;l++)\n\t\t\t\t{\n\t\t\t\t\tint d=l-j+K-1;\n\t\t\t\t\tif(comb>>d&1)continue;\n\t\t\t\t\t(dp[i+1][l][comb|1<<d]+=dp[i][j][comb])%=M;\n\t\t\t\t}\n\t\t\t\tif(comb==0)break;\n\t\t\t\tint x=comb&-comb,y=comb+x;\n\t\t\t\tcomb=((comb&~y)/x>>1)|y;\n\t\t\t}\n\t\t}\n\t\tfor(int j=0;j<K;j++)for(int l=0;l<1<<K*2-1;l++)\n\t\t{\n\t\t\t(ans+=dp[N-1][j][l])%=M;\n\t\t}\n\t}\n long all=1;\n\tfor(int i=0;i<N;i++)(all*=K)%=M;\n\tcout<<(all-ans+M)%M<<endl;\n}", "accuracy": 1, "time_ms": 310, "memory_kb": 224236, "score_of_the_acc": -1.1579, "final_rank": 14 }, { "submission_id": "aoj_0422_5038361", "code_snippet": "#include<iostream>\nusing namespace std;\nint N,K,M;\nint dp[21][10][1<<19];\nmain()\n{\n\tcin>>N>>K>>M;\n\tint ans=0;\n\tif(K*2>=N)\n\t{\n\t\tfor(int i=0;i<K;i++)dp[0][i][0]=1;\n\t\tfor(int i=0;i<N-1;i++)\n\t\t{\n\t\t\tint comb=(1<<i)-1;\n\t\t\twhile(comb<1<<K*2-1)\n\t\t\t{\n\t\t\t\tfor(int j=0;j<K;j++)for(int l=0;l<K;l++)\n\t\t\t\t{\n\t\t\t\t\tint d=l-j+K-1;\n\t\t\t\t\tif(comb>>d&1)continue;\n\t\t\t\t\t(dp[i+1][l][comb|1<<d]+=dp[i][j][comb])%=M;\n\t\t\t\t}\n\t\t\t\tif(comb==0)break;\n\t\t\t\tint x=comb&-comb,y=comb+x;\n\t\t\t\tcomb=((comb&~y)/x>>1)|y;\n\t\t\t}\n\t\t}\n\t\tfor(int j=0;j<K;j++)for(int l=0;l<1<<K*2-1;l++)\n\t\t{\n\t\t\t(ans+=dp[N-1][j][l])%=M;\n\t\t}\n\t}\n\tint all=1;\n\tfor(int i=0;i<N;i++)(all*=K)%=M;\n\tcout<<(all-ans+M)%M<<endl;\n}", "accuracy": 0.45, "time_ms": 130, "memory_kb": 111664, "score_of_the_acc": -0.4862, "final_rank": 19 } ]
aoj_0426_cpp
Sum of the Number of Triangles We are given a rectangular region in the coordinate plane with the origin $O$ at the lower left and the point at coordinates $(W,H)$ at the upper right. Consider a collection of points in this region that contains at least three points whose $x$-coordinates and $y$-coordinates are both integers. Let $N$ be the number of combinations of all such point clusters. When each collection of points is represented by $D_1, D_2,...,D_N$, consider a triangle whose vertices are the points contained in $D_1, D2,...,D_N$. For example, as shown in the figure, when $W=H=1$, there are five groups of points {O,A,B}, {O,A,C}, {O,B,C}, {A,B,C}, and {O,A,B,C} that contain three or more of the points O(0,0), A(1,0), B(1,1), and C(0,1). In this example, the triangles contained in each of the point clusters are as follows. The only triangle contained in $\{O,A,B\}$ is $OAB$. The only triangle contained in $\{O,A,C\}$ is $OAC$. The only triangle contained in $\{O,B,C\}$ is $OBC$. The only triangle contained in $\{A,B,C\}$ is $ABC$. There are four triangles in $\{O,A,B,C\}$: $OAB$, $OAC$, $OBC$, $ABC$. As you can see from this example, the same triangle may be contained in more than one set of points. For example, triangle $OAB$ is contained in both the point set $\{O,A,B\}$ and $\{O,A,B,C\}$. $W$ and $H$ are given. Let $t_1, t_2, ..., t_N$ be the number of triangles whose vertices are points in each of the point groups $D_1, D_2, ..., D_N$. Write a program to calculate the sum of the number of triangles $t_1+t_2+...+t_N$. Input The input is given in the following form. $W$ $H$ $W$ and $H$ ($1 \leq W,H \leq 1,000$) are given in a line. Output Output the sum of the number of triangles in each set of points. Output the remainder divided by 1,000,000,007. Sample Input and Output Sample Input 1 1 1 Sample Output 1 8 Sample Input 2 1 2 Sample Output 2 144 Sample Input 3 100 100 Sample Output 3 879128399
[ { "submission_id": "aoj_0426_10998228", "code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\ntypedef vector<vvi> vvvi;\ntypedef vector<ll> vll;\ntypedef vector<vll> vvll;\ntypedef vector<vvll> vvvll;\ntypedef pair<int,int> pi;\ntypedef vector<string> vs;\ntypedef vector<char> vc;\ntypedef vector<vc> vvc;\n#define rep(i,a,n) for(int i=a;i<n;i++)\n#define drep(i,a,n) for(int i=a;i>n;i--)\n#define Yes(ans) {cout<<(ans?\"Yes\":\"No\")<<endl;}\n#define printv(vec) {rep(iti_,0,vec.size()) cout<<vec[iti_]<<\" \"; cout<<endl;}\n#define printvv(vec) {rep(ni_,0,vec.size()) printv(vec[ni_]); cout<<endl;}\n#define all(x) x.begin(),x.end()\n#define so(x) sort(all(x))\n#define re(x) reverse(all(x))\ntemplate<typename T> bool chmin(T &a,T &b){if(a>b){a=b; return true;}return false;}\ntemplate<typename T> bool chmax(T &a,T &b){if(a<b){a=b; return true;}return false;}\n\nint main(){\n ll m=1000000007;\n ll w,h; cin>>w>>h; w++; h++;\n ll n=w*h;\n ll ex=1; rep(i,0,n-3){ex*=2; ex%=m;}\n \n ll tri=n*(n-1)*(n-2)/6;\n ll per=w*h*(h-1)*(h-2)/6+h*w*(w-1)*(w-2)/6;\n ll na=0;\n rep(i,1,w+1){\n rep(j,1,h+1){\n if(gcd(i,j)!=1) continue;\n rep(k,2,100000){\n if(w-1-k*i<0||h-1-k*j<0) break;\n na+=(w-k*i)*(h-k*j)*(k-1);\n }\n }\n }\n //cout<<per<<\" \"<<na<<endl;\n tri-=per+2*na;\n //cout<<tri<<endl;\n tri%=m;\n //cout<<tri<<endl;\n ex*=tri;\n ex%=m;\n cout<<ex<<endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3584, "score_of_the_acc": -0.0399, "final_rank": 6 }, { "submission_id": "aoj_0426_10850576", "code_snippet": "#include <bits/stdc++.h>\n//#include\"atcoder/all\"\n#define rep(i,n) for(int i=0;i<n;i++)\nusing namespace std;\n//using namespace atcoder;\n#define all(a) a.begin(),a.end()\n#define int long long\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef pair<int,int> P;\ntypedef pair<P,P> PP;\nconst int inf=1ll<<55;\nconst ll mod=1000000007;\n\nint modpow(int a,int x){\n\tif(!x)return 1;\n\tint res=modpow(a*a%mod,x/2);\n\tif(x&1)res=res*a%mod;\n\treturn res;\n}\nint gcd(int a,int b){\n\tif(!b)return a;\n\treturn gcd(b,a%b);\n}\n\nsigned main(){\n\tint h,w;cin>>h>>w;\n\tint ans=0;\n\tfor(int i=1;i<=w;i++){\n\t\tfor(int j=1;j<=h;j++){\n\t\t\tint x=4*(i-1)*(j-1)+2*(i+j-2)+4+2*((i+1)*(j+1)-4);\n\t\t\tint d=gcd(i,j);\n\t\t\tx-=2*(d-1);\n\t\t\tx*=(w-i+1)*(h-j+1);\n\t\t\tans=(ans+x)%mod;\n\n\t\t}\n\t}\n\t\n\tans=ans*modpow(2,(h+1)*(w+1)-3)%mod;\n\tcout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 3440, "score_of_the_acc": -0.0495, "final_rank": 9 }, { "submission_id": "aoj_0426_9644938", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long ll;\nusing namespace std;\nconst int Mod = 1e9 + 7;\nll bin_bow(ll a , ll b) {\n\tll res = 1;\n\twhile (b > 0) {\n\t\tif (b & 1)\n\t\t\tres = res * a % Mod;\n\t\ta = a * a % Mod;\n\t\tb >>= 1;\n\t}\n\treturn res;\n}\nll mod_inverse(ll a) {\n\treturn bin_bow(a , Mod - 2);\n}\nint main(){\n\tll w , h; cin>>w>>h;\n\tll points = (w + 1) * (h + 1);\n\n\tll all = points * (points - 1) % Mod * (points - 2) % Mod;\n\tall = all * mod_inverse(6) % Mod;\n\tll Linear = 0;\n\tfor(int i = 0;i <= h;i++) {\n\t\tfor(int j = 0;j <= w;j++) {\n\t\t\tif(!i && !j)continue;\n\t\t\tll temp = (h + 1 - i) * (w + 1 - j);\n\t\t\ttemp %= Mod;\n\t\t\tif(i > 0 && j > 0)temp *= 2;\n\t\t\ttemp *= __gcd(i , j)- 1;\n\t\t\ttemp %= Mod;\n\t\t\tLinear += temp;\n\t\t\tLinear %= Mod;\n\t\t}\n\t}\n\n\tall -= Linear;\n\tall = (all + Mod) % Mod;\n\tcout<<(all * bin_bow(2LL , points - 3) % Mod)<<endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3424, "score_of_the_acc": -0.0384, "final_rank": 4 }, { "submission_id": "aoj_0426_9516272", "code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) { return (ull)rng() % B; }\n\ntemplate <int mod> struct static_modint {\n using mint = static_modint;\n int x;\n\n static_modint() : x(0) {}\n static_modint(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n mint &operator+=(const mint &rhs) {\n if ((x += rhs.x) >= mod) x -= mod;\n return *this;\n }\n mint &operator-=(const mint &rhs) {\n if ((x += mod - rhs.x) >= mod) x -= mod;\n return *this;\n }\n mint &operator*=(const mint &rhs) {\n x = (int)(1LL * x * rhs.x % mod);\n return *this;\n }\n mint &operator/=(const mint &rhs) { return *this = *this * rhs.inv(); }\n\n mint pow(long long n) const {\n mint _x = *this, r = 1;\n while (n) {\n if (n & 1) r *= _x;\n _x *= _x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const { return pow(mod - 2); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n friend mint operator+(const mint &lhs, const mint &rhs) { return mint(lhs) += rhs; }\n friend mint operator-(const mint &lhs, const mint &rhs) { return mint(lhs) -= rhs; }\n friend mint operator*(const mint &lhs, const mint &rhs) { return mint(lhs) *= rhs; }\n friend mint operator/(const mint &lhs, const mint &rhs) { return mint(lhs) /= rhs; }\n friend bool operator==(const mint &lhs, const mint &rhs) { return lhs.x == rhs.x; }\n friend bool operator!=(const mint &lhs, const mint &rhs) { return lhs.x != rhs.x; }\n\n friend ostream &operator<<(ostream &os, const mint &p) { return os << p.x; }\n friend istream &operator>>(istream &is, mint &a) {\n int64_t t;\n is >> t;\n a = static_modint<mod>(t);\n return (is);\n }\n};\n\nconst unsigned int mod = 1e9 + 7;\nusing modint = static_modint<mod>;\nmodint mod_pow(ll n, ll x) { return modint(n).pow(x); }\nmodint mod_pow(modint n, ll x) { return n.pow(x); }\n\ntemplate <typename T> struct Comination {\n vector<T> p, invp;\n\n Comination(int sz) : p(sz + 1), invp(sz + 1) {\n p[0] = 1;\n for (int i = 1; i <= sz; ++i) {\n p[i] = p[i - 1] * i;\n }\n invp[sz] = p[sz].inv();\n for (int i = sz - 1; i >= 0; --i) {\n invp[i] = invp[i + 1] * (i + 1);\n }\n }\n\n T comb(int n, int r) {\n if (r < 0 or n < r) return 0;\n return p[n] * invp[n - r] * invp[r];\n }\n T big_comb(T n, int r) {\n T res = invp[r];\n for (int i = 0; i < r; ++i) {\n res *= (n - i);\n }\n return res;\n }\n};\nusing Comb = Comination<modint>;\nComb p(1002 * 1002);\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int h, w;\n cin >> h >> w;\n int al = (h + 1) * (w + 1);\n modint t = p.comb(al, 3);\n for (int i = 0; i <= h; ++i) {\n for (int j = 0; j <= w; ++j) {\n if (i + j == 0) continue;\n int g = gcd(i, j);\n modint line = max(0, g - 1);\n t -= line * (h + 1 - i) * (w + 1 - j) * ((i > 0 && j > 0) ? 2 : 1);\n }\n }\n cout << t * mod_pow(2, al - 3) << endl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 10836, "score_of_the_acc": -0.3575, "final_rank": 11 }, { "submission_id": "aoj_0426_6046448", "code_snippet": "#ifdef LOGX\n#define _GLIBCXX_DEBUG\n#endif\n#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\n#define rep(i,n) for(int i=0;i<int(n);i++)\n#define rep2(i,s,n) for(int i=int(s);i<int(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\nconst int big=1e9+7;\n//const int big=998244353;\nconst char newl='\\n';\nconst int inf=1e9+10;\nconst ll INF=ll(1e18)+10;\nconst int dx[]={1,0,-1,0};\nconst int dy[]={0,1,0,-1};\n\nusing P=pair<ll,int>;\npriority_queue<P,vector<P>,greater<P>> q;\n\nstruct mint{\n ll x;\n mint(ll xx=0):x(xx%big){\n if(x<0)x+=big;\n }\n mint& operator+=(mint r){\n x+=r.x;\n if(x>=big)x-=big;\n return *this;\n }\n friend mint operator+(mint l,mint r){\n return l+=r;\n }\n mint& operator-=(mint r){\n x-=r.x;\n if(x<0)x+=big;\n return *this;\n }\n friend mint operator-(mint l,mint r){\n return l-=r;\n }\n mint& operator*=(mint r){\n x*=r.x;\n x%=big;\n return *this;\n }\n friend mint operator*(mint l,mint r){\n return l*=r;\n }\n};\n\ntemplate<typename T>\nT exp(T x,ll y,T e){\n T res=e;\n while(y){\n if(y&1)res*=x;\n x*=x;\n y>>=1;\n }\n return res;\n}\n\nmint inv(mint x){\n assert(x.x!=0);\n return exp(x,big-2,mint(1));\n}\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n\n int H,W;\n cin >> H >> W;\n\n //dp[h][w]=([0,h],[0,w])から2点取ってきてad=bcの個数\n //重複とかは一旦気にしない！\n vector<vector<mint>> dp(H+1,vector<mint>(W+1));\n dp[0][0]=1;\n rep(h,H+1){\n //h/c(c<=h)の既約分数表示で、分子に現れる回数\n unordered_map<int,int> cnt;\n rep2(c,1,h+1)cnt[h/__gcd(c,h)]++;\n rep(w,W+1){\n if(h==0){\n dp[h][w]=mint(w+1)*(w+1);\n continue;\n }\n dp[h][w]=dp[h-1][w];\n //(a=h)+(c=h)-(a=c=h)\n //hd=bcを数える\n mint now=0;\n //d=0 -> (b=0)+(c=0)-(b=c=0)\n now+=(h+1)+(w+1)-1;\n \n //d!=0\n for(auto it:cnt){\n int val=it.first,num=it.second;\n now+=num*(w/val);\n }\n dp[h][w]+=2*now-(w+1);\n }\n }\n mint line=0;\n rep(i,H+1)rep(j,W+1){\n //原点以外から2点同じ点を選んだ場合\n dp[i][j]-=mint(i+1)*(j+1)-1;\n //原点から1点、原点以外からもう1点\n dp[i][j]-=2*(mint(i+1)*(j+1)-1);\n //原点から2点\n dp[i][j]-=1;\n dp[i][j]*=inv(mint(2));\n }\n rep(i,H+1)rep(j,W+1){\n line+=dp[i][j]+dp[H-i][j]-j*(j-1)/2-(H-i)*(H-i-1)/2;\n }\n\n ll hw_cnt=(H+1)*(W+1);\n mint ans=mint(hw_cnt)*(hw_cnt-1)*(hw_cnt-2)*inv(mint(3))*inv(mint(2))-line;\n cout << (ans*exp(mint(2),hw_cnt-3,mint(1))).x << newl;\n}", "accuracy": 1, "time_ms": 140, "memory_kb": 10892, "score_of_the_acc": -0.412, "final_rank": 14 }, { "submission_id": "aoj_0426_6041136", "code_snippet": "#include <bits/stdc++.h>\n\nusing ll = long long;\n\ntemplate <class T> using Vec = std::vector<T>;\n\nconstexpr int MOD = 1000000007;\n\nstruct Fp {\n int x;\n Fp(int x = 0) : x(x) {}\n Fp operator+(const Fp& t) const { return Fp(*this) += t; }\n Fp& operator+=(const Fp& t) {\n if ((x += t.x) >= MOD) x -= MOD;\n return *this;\n }\n Fp operator-(const Fp& t) const { return Fp(*this) -= t; }\n Fp& operator-=(const Fp& t) {\n if ((x += MOD - t.x) >= MOD) x -= MOD;\n return *this;\n }\n Fp operator*(const Fp& t) const { return Fp((ll)x * t.x % MOD); }\n Fp& operator*=(const Fp& t) { return *this = *this * t; }\n Fp operator/(const Fp& t) const { return Fp(*this) /= t; }\n Fp& operator/=(const Fp& t) { return *this *= t.inv(); }\n Fp pow(ll e) const {\n Fp ret(1), mult(x);\n while (e > 0) {\n if (e & 1) ret *= mult;\n mult *= mult;\n e >>= 1;\n }\n return ret;\n }\n Fp inv() const { return pow(MOD - 2); }\n};\n\nFp nCr(const int n, const int r) {\n Fp ret(1);\n for (int i = 0; i < r; ++i) {\n ret *= n - i;\n ret /= i + 1;\n }\n return ret;\n}\n\nint main() {\n int H, W;\n std::cin >> H >> W;\n H += 1, W += 1;\n Fp ans;\n ans += nCr(H * W, 3);\n ans -= nCr(H, 3) * W;\n ans -= nCr(W, 3) * H;\n for (int i = 1; i < H; ++i) {\n for (int j = 1; j < W; ++j) {\n ans -= (H - i) * (W - j) * 2 * (std::gcd(i, j) - 1);\n }\n }\n std::cout << (ans * Fp(2).pow(H * W - 3)).x << '\\n';\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3440, "score_of_the_acc": -0.0391, "final_rank": 5 }, { "submission_id": "aoj_0426_6025270", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\ntemplate<class T> using vc = vector<T>;\ntemplate<class T> using vvc = vc<vc<T>>;\ntemplate<class T> using vvvc = vc<vvc<T>>;\ntemplate<class T> using vvvvc = vvc<vvc<T>>;\ntemplate<class T> using PQ = priority_queue<T>;\ntemplate<class T> using invPQ = priority_queue<T, vector<T>, greater<T>>;\nusing IP = pair<int, int>;\nusing LP = pair<ll, ll>;\n#define all(x) begin(x), end(x)\n#define allr(x) rbegin(x), rend(x)\n#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)\n#define rep3(i, m, n) for (int i = (m); (i) < (int)(n); i++)\n#define repr(i, n) for (int i = (n) - 1; (i) >= 0; i--)\n#define rep3r(i, m, n) for (int i = (n) - 1; (i) >= (int)(m); i--)\ntemplate<class T> inline bool chmax(T & a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T & a, T b) { if (a > b) { a = b; return 1; } return 0; }\nconstexpr long long MOD = 1000000007;\n\nlong long gcd(long long a, long long b) {\n if (b == 0) return abs(a);\n return gcd(b, a % b);\n}\n\nll comb3(ll n) {\n if (n < 3) return 0;\n return n * (n-1) * (n-2) / 6;\n}\n\nsigned main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int W, H;\n cin >> W >> H;\n W++; H++;\n\n ll ans = 0;\n\n vvc<ll> s(W, vc<ll>(H));\n rep3 (a, 1, W) rep3 (b, 1, H) {\n s[a][b] = gcd(a, b) - 1;\n }\n rep3 (i, 1, W) rep3 (j, 1, H) {\n s[i][j] += s[i-1][j] + s[i][j-1] - s[i-1][j-1];\n s[i][j] %= MOD;\n }\n\n rep (i, W-1) rep (j, H-1) {\n ans += s[W - i - 1][H - j - 1];\n ans %= MOD;\n }\n\n ans = MOD*2 - ans*2;\n ans %= MOD;\n \n ans = (ans + comb3(H*W)) % MOD;\n ans = (ans - comb3(H) * W % MOD - comb3(W) * H % MOD + MOD*2) % MOD;\n\n rep (i, H*W-3) ans = (ans * 2) % MOD;\n\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 10964, "score_of_the_acc": -0.363, "final_rank": 12 }, { "submission_id": "aoj_0426_6025144", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\ntemplate<class T> using vc = vector<T>;\ntemplate<class T> using vvc = vc<vc<T>>;\ntemplate<class T> using vvvc = vc<vvc<T>>;\ntemplate<class T> using vvvvc = vvc<vvc<T>>;\ntemplate<class T> using PQ = priority_queue<T>;\ntemplate<class T> using invPQ = priority_queue<T, vector<T>, greater<T>>;\nusing IP = pair<int, int>;\nusing LP = pair<ll, ll>;\n#define all(x) begin(x), end(x)\n#define allr(x) rbegin(x), rend(x)\n#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)\n#define rep3(i, m, n) for (int i = (m); (i) < (int)(n); i++)\n#define repr(i, n) for (int i = (n) - 1; (i) >= 0; i--)\n#define rep3r(i, m, n) for (int i = (n) - 1; (i) >= (int)(m); i--)\ntemplate<class T> inline bool chmax(T & a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T & a, T b) { if (a > b) { a = b; return 1; } return 0; }\nconstexpr long long MOD = 1000000007;\n\nlong long gcd(long long a, long long b) {\n if (b == 0) return abs(a);\n return gcd(b, a % b);\n}\n\nvector<long long> fac, finv, inv;\nvoid COMinit(int N) {\n fac.resize(N+1, 1);\n finv.resize(N+1, 1);\n inv.resize(N+1, 1);\n for (int i = 2; i <= N; i++){\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n}\nlong long COM(int n, int k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\n\nsigned main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int W, H;\n cin >> W >> H;\n W++; H++;\n\n COMinit(W*H);\n \n ll ans = COM(W*H, 3);\n ans = (ans - COM(W, 3) * H % MOD - COM(H, 3) * W % MOD + MOD * 2) % MOD;\n\n ll remcnt = 0;\n rep3 (a, 1, (H+1)/2) rep3 (b, 1, (W+1)/2) {\n if (gcd(a, b) != 1) continue;\n for (int i = 2; i*a < H && i*b < W; i++) {\n if ((i+1)*a >= H || (i+1)*b >= W) remcnt += COM(i+1, 3) * ((H - i*a) * (W - i*b));\n else if ((i+2)*a >= H || (i+2)*b >= W) remcnt += COM(i+1, 3) * ((H - i*a) * (W - i*b) - (H - (i+1)*a) * (W - (i+1)*b) * 2);\n else remcnt += COM(i+1, 3) * (a * b * 2);\n remcnt %= MOD;\n }\n }\n ans = (ans - remcnt*2 + MOD*2) % MOD;\n \n rep (i, H*W-3) ans = ans * 2 % MOD;\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 26372, "score_of_the_acc": -1.0052, "final_rank": 16 }, { "submission_id": "aoj_0426_5943975", "code_snippet": "#include<cstdio>\n\nlong long q = 1000000007;\n\nusing namespace std;\n\nint gcdf(int x, int y) {\n if(x % y == 0) {\n return y;\n } else {\n return gcdf(y, x % y); \n //x%y==0でないときはユーグリットの互除法を使って再帰的に関数を呼び出す。\n }\n}\n\nlong long modpow(long long a, long long n) {\n long long res = 1;\n while (n > 0) {\n if (n & 1) res = res * a % q;\n a = a * a % q;\n n >>= 1;\n }\n return res;\n}\n\n\nint main(){\n\tlong long h,w,hw;\n\tlong long a,b,per;\n\t\n\t\n\tscanf(\"%lld %lld\",&h,&w);\n\th++;\n\tw++;\n\thw = h*w;\n\tlong long liner1 = (h*w*( (w-1)*(w-2)+(h-1)*(h-2) )/6 )%q,liner2=0;\n\tlong long h3=0,w3=0;\n\tfor(int i=2;i<w;i++){\n\t\tfor(int j=2;j<h;j++) {\n\t\t\tliner2 = ( liner2 + (gcdf(i,j)-1)*(w-i)*(h-j) )%q;\n\t\t}\n\t}\n\tliner2 = 2*liner2%q;\n//\tprintf(\"%d %d\\n\",h,w);\n//\tprintf(\"%lld %lld\\n\",liner1,liner2);\n\t\n\tlong long liner = (liner1+liner2)%q;\n\tlong long p3 = (hw*(hw-1))%q;\n\tp3 = (p3*(hw-2))%q;\n\tp3 = p3*modpow(6,q-2)%q;\n//\tprintf(\"%lld\\n\",modpow(6,q-2));\n\tlong long all = modpow(2,hw-3),ans = (all*((p3-liner+q)%q))%q;\n//\tprintf(\"%lld * ( %lld - %lld ) = %lld\\n\",all,p3,liner,ans);\n\tprintf(\"%lld\\n\",ans);\n\treturn 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 2764, "score_of_the_acc": -0.0156, "final_rank": 1 }, { "submission_id": "aoj_0426_5943969", "code_snippet": "#include<cstdio>\n\nlong long q = 1000000007;\n\nusing namespace std;\n\nint gcdf(int x, int y) {\n if(x % y == 0) {\n return y;\n } else {\n return gcdf(y, x % y); \n //x%y==0でないときはユーグリットの互除法を使って再帰的に関数を呼び出す。\n }\n}\n\nlong long modpow(long long a, long long n) {\n long long res = 1;\n while (n > 0) {\n if (n & 1) res = res * a % q;\n a = a * a % q;\n n >>= 1;\n }\n return res;\n}\n\n\nint main(){\n\tint h,w,hw;\n\tlong long a,b,per;\n\t\n\t\n\tscanf(\"%d %d\",&h,&w);\n\th++;\n\tw++;\n\thw = h*w;\n\tlong long liner1 = (h*w*( (w-1)*(w-2)+(h-1)*(h-2) )/6 )%q,liner2=0;\n\tlong long h3=0,w3=0;\n\tfor(int i=2;i<w;i++){\n\t\tfor(int j=2;j<h;j++) {\n\t\t\tliner2 = ( liner2 + (gcdf(i,j)-1)*(w-i)*(h-j) )%q;\n\t\t}\n\t}\n\tliner2 = 2*liner2%q;\n//\tprintf(\"%d %d\\n\",h,w);\n//\tprintf(\"%I64d %I64d\\n\",liner1,liner2);\n\t\n\tlong long liner = (liner1+liner2)%q;\n\tlong long p3 = (hw*(hw-1))%q;\n\tp3 = (p3*(hw-2))%q;\n\tp3 = p3*modpow(6,q-2)%q;\n//\tprintf(\"%I64d\\n\",modpow(6,q-2));\n\tlong long all = modpow(2,hw-3),ans = (all*((p3-liner+q)%q))%q;\n//\tprintf(\"%I64d * ( %I64d - %I64d ) = %I64d\\n\",all,p3,liner,ans);\n\tprintf(\"%lld\\n\",ans);\n\treturn 0;\n}", "accuracy": 0.6153846153846154, "time_ms": 30, "memory_kb": 2764, "score_of_the_acc": -0.0104, "final_rank": 18 }, { "submission_id": "aoj_0426_5040325", "code_snippet": "#line 1 \"a.cpp\"\n#include<iostream>\n#include<algorithm>\nusing namespace std;\n#line 3 \"/home/kotatsugame/library/math/modint.cpp\"\n#include<utility>\ntemplate<int m>\nstruct modint{\n\tunsigned int x;\n\tconstexpr modint()noexcept:x(){}\n\ttemplate<typename T>\n\tconstexpr modint(T x_)noexcept:x((x_%=m)<0?x_+m:x_){}\n\tconstexpr unsigned int val()const noexcept{return x;}\n\tconstexpr modint&operator++()noexcept{if(++x==m)x=0;return*this;}\n\tconstexpr modint&operator--()noexcept{if(x==0)x=m;--x;return*this;}\n\tconstexpr modint operator++(int)noexcept{modint res=*this;++*this;return res;}\n\tconstexpr modint operator--(int)noexcept{modint res=*this;--*this;return res;}\n\tconstexpr modint&operator+=(const modint&a)noexcept{x+=a.x;if(x>=m)x-=m;return*this;}\n\tconstexpr modint&operator-=(const modint&a)noexcept{if(x<a.x)x+=m;x-=a.x;return*this;}\n\tconstexpr modint&operator*=(const modint&a)noexcept{x=(unsigned long long)x*a.x%m;return*this;}\n\tconstexpr modint&operator/=(const modint&a)noexcept{return*this*=a.inv();}\n\tconstexpr modint operator+()const noexcept{return*this;}\n\tconstexpr modint operator-()const noexcept{return modint()-*this;}\n\tconstexpr modint pow(long long n)const noexcept\n\t{\n\t\tif(n<0)return pow(-n).inv();\n\t\tmodint x=*this,r=1;\n\t\tfor(;n;x*=x,n>>=1)if(n&1)r*=x;\n\t\treturn r;\n\t}\n\tconstexpr modint inv()const noexcept\n\t{\n\t\tint s=x,t=m,x=1,u=0;\n\t\twhile(t)\n\t\t{\n\t\t\tint k=s/t;\n\t\t\ts-=k*t;\n\t\t\tswap(s,t);\n\t\t\tx-=k*u;\n\t\t\tswap(x,u);\n\t\t}\n\t\treturn modint(x);\n\t}\n\tfriend constexpr modint operator+(const modint&a,const modint&b){return modint(a)+=b;}\n\tfriend constexpr modint operator-(const modint&a,const modint&b){return modint(a)-=b;}\n\tfriend constexpr modint operator*(const modint&a,const modint&b){return modint(a)*=b;}\n\tfriend constexpr modint operator/(const modint&a,const modint&b){return modint(a)/=b;}\n\tfriend constexpr bool operator==(const modint&a,const modint&b){return a.x==b.x;}\n\tfriend constexpr bool operator!=(const modint&a,const modint&b){return a.x!=b.x;}\n\tfriend ostream&operator<<(ostream&os,const modint&a){return os<<a.x;}\n\tfriend istream&operator>>(istream&is,modint&a){long long v;is>>v;a=modint(v);return is;}\n};\n#line 5 \"a.cpp\"\nusing mint=modint<(int)1e9+7>;\nint gcd(int a,int b){return b?gcd(b,a%b):a;}\nint H,W;\nmint F(int X){return mint(X+1)*X*(X-1);}\nmain()\n{\n\tcin>>H>>W;\n\tint N=(H+1)*(W+1);\n\tmint ans=mint(N)*(N-1)*(N-2);\n\tans-=mint(H+1)*F(W);\n\tans-=mint(W+1)*F(H);\n\tmint diff=0;\n\tfor(int i=1;i*2<=H;i++)for(int j=1;j*2<=W;j++)\n\t{\n\t\tif(gcd(i,j)!=1)continue;\n\t\tmint now=0;\n\t\tint ni=H%i+1,nj=W%j+1;\n\t\tint a=H/i,b=W/j;\n\t\tnow+=mint(ni)*mint(nj)*F(min(a,b));\n\t\tnow+=mint(i-ni)*mint(nj)*F(min(a-1,b));\n\t\tnow+=mint(ni)*mint(j-nj)*F(min(a,b-1));\n\t\tnow+=mint(i-ni)*mint(j-nj)*F(min(a-1,b-1));\n\t\tfor(int x=i;x+i*2<=H;x++)\n\t\t{\n\t\t\tint na=(H-x)/i;\n\t\t\tnow+=mint(nj)*F(min(na,b));\n\t\t\tnow+=mint(j-nj)*F(min(na,b-1));\n\t\t}\n\t\tfor(int y=j;y+j*2<=W;y++)\n\t\t{\n\t\t\tint nb=(W-y)/j;\n\t\t\tnow+=mint(ni)*F(min(a,nb));\n\t\t\tnow+=mint(i-ni)*F(min(a-1,nb));\n\t\t}\n\t\tdiff+=now;\n\t}\n\tans-=diff*2;\n\tans/=6;\n\tcout<<ans*mint(2).pow(N-3)<<endl;\n}", "accuracy": 1, "time_ms": 1930, "memory_kb": 3120, "score_of_the_acc": -1.0151, "final_rank": 17 }, { "submission_id": "aoj_0426_4858088", "code_snippet": "#include<bits/stdc++.h>\n#include<array>\nusing namespace std;\nusing LL = long long;\nusing ULL = unsigned long long;\n#define rep(i,n) for(int i=0; i<(n); i++)\n\nconst ULL M = 1000000007;\nconst ULL inv6 = 166666668;\nULL SC[1002] = {};\nULL X[1002][1002] = {};\n\nULL GCD(ULL a, ULL b) { return b ? GCD(b, a % b) : a; }\nULL C3(ULL n) { return n * (n - 1) % M * (n - 2) % M * inv6 % M; }\n\nint main() {\n int W, H; cin >> W >> H;\n for (ULL i = 3; i <= 1001; i++) SC[i] = (SC[i - 1] + C3(i)) % M;\n rep(x, W + 1) rep(y, H + 1) {\n X[x][y] = 2 * SC[min(x, y) + 1] + (abs(x - y) - 1) * C3(min(x, y) + 1);\n X[x][y] %= M;\n X[x][y] = X[x][y] * 2 % M;\n }\n\n ULL Tri = 0;\n Tri += (W + 1) * C3(H + 1) % M;\n Tri += (H + 1) * C3(W + 1) % M;\n for (ULL x = 1; x <= W; x++) for (ULL y = 1; y <= H; y++) {\n if (GCD(x, y) != 1) continue;\n ULL nx = W / x, ny = H / y;\n ULL mx = W % x + 1, my = H % y + 1;\n ULL tmp = 0;\n tmp += mx * my * X[nx][ny] % M;\n tmp += mx * (y - my) * X[nx][ny - 1] % M;\n tmp += (x - mx) * my * X[nx - 1][ny] % M;\n tmp += (x - mx) * (y - my) * X[nx - 1][ny - 1] % M;\n tmp %= M;\n Tri += tmp;\n }\n Tri %= M;\n \n ULL N = (H + 1) * (W + 1);\n ULL ans = C3(N) + M - Tri;\n rep(i, N - 3) ans = ans * 2 % M;\n cout << ans << endl;\n\n return 0;\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 10944, "score_of_the_acc": -0.3777, "final_rank": 13 }, { "submission_id": "aoj_0426_4424823", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\nll W,H;\nll inv_6;\n\nll extgcd(ll a,ll b,ll &x,ll &y){\n\tll d = a;\n\tif(b != 0){\n\t\td = extgcd(b,a%b,y,x);\n\t\ty -= (a/b)*x;\n\t}else{\n\t\tx = 1;\n\t\ty = 0;\n\t}\n\treturn d;\n}\n\nll mod_inverse(ll a,ll m){\n ll x,y;\n extgcd(a,m,x,y);\n return (m+x%m)%m;\n}\n\nll gcd(ll x,ll y){\n\n\tx = abs(x);\n\ty = abs(y);\n\n\tif(x < y){\n\t\tswap(x,y);\n\t}\n\tif(y == 0){\n\t\treturn x;\n\t}else{\n\t\treturn gcd(y,x%y);\n\t}\n}\n\nll mod_pow(ll x,ll count, ll mod){\n\n\tif(count == 0)return 1;\n\tll ret = mod_pow((x*x)%mod,count/2,mod);\n\tif(count%2 == 1){\n\n\t\tret = (ret*x)%mod;\n\t}\n\treturn ret;\n}\n\n\nll numC3(ll num){\n\n\tif(num <= 2)return 0;\n\n\tll ret = num;\n\n\tret *= num-1;\n\tret %= MOD;\n\tret *= num-2;\n\tret %= MOD;\n\tret *= inv_6;\n\tret %= MOD;\n\n\treturn ret;\n}\n\n//https://betrue12.hateblo.jp/entry/2020/05/02/163444\n\nint main(){\n\n\tinv_6 = mod_inverse(6,MOD);\n\n\tscanf(\"%lld %lld\",&W,&H);\n\n\tll N = (W+1)*(H+1);\n\tll mult = mod_pow(2,N-3,MOD);\n\n\tll base = numC3(N);\n\n\tll minus = 0;\n\n\tfor(ll i = 0; i <= H; i++){\n\t\tfor(ll k = 0; k <= W; k++){\n\t\t\tif(i ==0 && k == 0)continue;\n\n\t\t\tll tmp = (H+1-i)*(W+1-k);\n\t\t\ttmp %= MOD;\n\n\t\t\tif(i > 0 && k > 0){\n\t\t\t\ttmp *= 2;\n\t\t\t\ttmp %= MOD;\n\t\t\t}\n\n\t\t\ttmp *= gcd(i,k)-1;\n\t\t\ttmp %= MOD;\n\n\t\t\tminus += tmp;\n\t\t\tminus %= MOD;\n\t\t}\n\t}\n\n\tbase -= minus;\n\tif(base < 0){\n\n\t\tbase += MOD;\n\t}\n\n\tll ans = base*mult;\n\tans %= MOD;\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 3228, "score_of_the_acc": -0.0457, "final_rank": 7 }, { "submission_id": "aoj_0426_4424808", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\nll W,H;\nll inv_6;\n\nll extgcd(ll a,ll b,ll &x,ll &y){\n\tll d = a;\n\tif(b != 0){\n\t\td = extgcd(b,a%b,y,x);\n\t\ty -= (a/b)*x;\n\t}else{\n\t\tx = 1;\n\t\ty = 0;\n\t}\n\treturn d;\n}\n\nll mod_inverse(ll a,ll m){\n ll x,y;\n extgcd(a,m,x,y);\n return (m+x%m)%m;\n}\n\nll gcd(ll x,ll y){\n\n\tx = abs(x);\n\ty = abs(y);\n\n\tif(x < y){\n\t\tswap(x,y);\n\t}\n\tif(y == 0){\n\t\treturn x;\n\t}else{\n\t\treturn gcd(y,x%y);\n\t}\n}\n\nll mod_pow(ll x,ll count, ll mod){\n\n\tif(count == 0)return 1;\n\tll ret = mod_pow((x*x)%mod,count/2,mod);\n\tif(count%2 == 1){\n\n\t\tret = (ret*x)%mod;\n\t}\n\treturn ret;\n}\n\n\nll numC3(ll num){\n\n\tif(num <= 2)return 0;\n\n\tll ret = num;\n\n\tret *= num-1;\n\tret %= MOD;\n\tret *= num-2;\n\tret %= MOD;\n\tret *= inv_6;\n\tret %= MOD;\n\n\treturn ret;\n}\n\nint main(){\n\n\tinv_6 = mod_inverse(6,MOD);\n\n\tscanf(\"%lld %lld\",&W,&H);\n\n\tll N = (W+1)*(H+1);\n\tll mult = mod_pow(2,N-3,MOD);\n\n\tll base = numC3(N);\n\n\tll minus = 0;\n\n\tfor(ll i = 0; i <= H; i++){\n\t\tfor(ll k = 0; k <= W; k++){\n\t\t\tif(i ==0 && k == 0)continue;\n\n\t\t\tll tmp = (H+1-i)*(W+1-k);\n\t\t\ttmp %= MOD;\n\n\t\t\tif(i > 0 && k > 0){\n\t\t\t\ttmp *= 2;\n\t\t\t\ttmp %= MOD;\n\t\t\t}\n\n\t\t\ttmp *= gcd(i,k)-1;\n\t\t\ttmp %= MOD;\n\n\t\t\tminus += tmp;\n\t\t\tminus %= MOD;\n\t\t}\n\t}\n\n\tbase -= minus;\n\tif(base < 0){\n\n\t\tbase += MOD;\n\t}\n\n\tll ans = base*mult;\n\tans %= MOD;\n\n\tprintf(\"%lld\\n\",ans);\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 3228, "score_of_the_acc": -0.0457, "final_rank": 7 }, { "submission_id": "aoj_0426_4421199", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int64_t MOD = 1e9+7;\nvoid add(int64_t& a, int64_t b){\n a = (a+b) % MOD;\n}\nvoid mul(int64_t& a, int64_t b){\n a = a*b % MOD;\n}\n\nint64_t power_mod(int64_t num, int64_t power){\n int64_t prod = 1;\n num %= MOD;\n while(power > 0){\n if(power&1) prod = prod * num % MOD;\n num = num * num % MOD;\n power >>= 1;\n }\n return prod;\n}\n\nint64_t extgcd(int64_t a, int64_t b, int64_t& x, int64_t& y){\n int64_t d = a;\n if(b != 0){\n d = extgcd(b, a%b, y, x);\n y -= (a/b) * x;\n }else{\n x = 1; y = 0;\n }\n return d;\n}\n\nint64_t inv_mod(int64_t a){\n int64_t x, y;\n extgcd(a, MOD, x, y);\n return (MOD + x%MOD) % MOD;\n}\n\nvector<int64_t> fact, fact_inv;\n\nvoid create_mod_tables(int num){\n fact.assign(num+1, 1);\n fact_inv.assign(num+1, 1);\n for(int i=1; i<=num; i++) fact[i] = fact[i-1] * i % MOD;\n fact_inv[num] = inv_mod(fact[num]);\n for(int i=num; i>0; i--) fact_inv[i-1] = fact_inv[i] * i % MOD;\n}\n\nint64_t comb_mod(int n, int k){\n return fact[n] * fact_inv[n-k] % MOD * fact_inv[k] % MOD;\n}\n\nint64_t perm_mod(int n, int k){\n return fact[n] * fact_inv[n-k] % MOD;\n}\n\nint64_t gcd(int64_t a, int64_t b){\n return b==0 ? a : gcd(b, a%b);\n}\n\nint main(){\n int H, W;\n cin >> H >> W;\n int N = (H+1)*(W+1);\n create_mod_tables(N);\n\n // 1直線に並ぶ3点を数える\n int64_t L = 0;\n \n // 両端のxとyの距離を全探索\n for(int i=0; i<=H; i++) for(int j=0; j<=W; j++){\n if(i == 0 && j == 0) continue;\n \n // 両端の取り方、i > 0 かつ j > 0 のときは反転も考慮\n int64_t res = (H+1-i) * (W+1-j);\n if(i > 0 && j > 0) mul(res, 2);\n // 間に取れる格子点の個数\n mul(res, gcd(i, j)-1);\n\n add(L, res);\n }\n\n // 1直線に並ばない3点\n int64_t ans = comb_mod(N, 3) - L + MOD;\n // 集合の選び方\n mul(ans, power_mod(2, N-3));\n\n cout << ans << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 18320, "score_of_the_acc": -0.6902, "final_rank": 15 }, { "submission_id": "aoj_0426_4048710", "code_snippet": "#include <bits/stdc++.h>\n\nint ri() {\n\tint n;\n\tscanf(\"%d\", &n);\n\treturn n;\n}\n\nint gcd(int i, int j) {\n\twhile (i && j) {\n\t\tif (i > j) i %= j;\n\t\telse j %= i;\n\t}\n\treturn i + j;\n}\n\n#define MOD 1000000007\nint main() {\n\tint h = ri() + 1, w = ri() + 1;\n\tint all = h * w;\n\tint res = (int64_t) all * (all - 1) * (all - 2) / 6 % MOD;\n\t\n\tfor (int i = 0; i < h; i++) {\n\t\tfor (int j = 0; j < w; j++) {\n\t\t\tif (!i && !j) continue;\n\t\t\tres -= (int64_t) (h - i) * (w - j) % MOD * (gcd(i, j) - 1) * (i && j ? 2 : 1) % MOD;\n\t\t\tif (res < 0) res += MOD;\n\t\t}\n\t}\n\tfor (int i = 0; i < all - 3; i++) res = res * 2 % MOD;\n\tstd::cout << res << std::endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3244, "score_of_the_acc": -0.0307, "final_rank": 3 }, { "submission_id": "aoj_0426_4006532", "code_snippet": "#include <iostream>\n#include <vector>\n#include <array>\n#include <list>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <unordered_set>\n#include <tuple>\n#include <bitset>\n#include <memory>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <climits>\n#include <cfloat>\n#include <cassert>\n#include <random>\n\nconstexpr long long int MOD = 1000000007;\nlong long int power(long long int base, long long int exp) {\n\tswitch (exp) {\n\tcase 0: return 1L;\n\tcase 1: return base % MOD;\n\tdefault: return power(base, exp % 2) * power(base * base % MOD, exp / 2) % MOD;\n\t}\n}\nint gcd(int a, int b) {\n\treturn b == 0 ? a : gcd(b, a % b);\n}\nint main() {\n\tlong long int w, h; std::cin >> w >> h;\n\tconst long long int point = (w + 1) * (h + 1);\n\tconst long long int sum = point * (point - 1) % MOD * (point - 2) % MOD * power(6, MOD - 2) % MOD;\n\tlong long int minus = 0;\n\tfor (auto i = 0; i <= w; ++i) for (auto j = 0; j <= h; ++j) if (i != 0 || j != 0) {\n\t\tconst auto count = (w - i + 1) * (h - j + 1);\n\t\tminus += (gcd(i, j) - 1) * count % MOD * ((i == 0 || j == 0) ? 1 : 2);\n\t\tminus %= MOD;\n\t}\n\tstd::cout << ((sum - minus) % MOD + MOD) * power(2, point - 3) % MOD << '\\n';\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3124, "score_of_the_acc": -0.0257, "final_rank": 2 }, { "submission_id": "aoj_0426_4001208", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\n\ntemplate<typename T,T MOD = 1000000007>\nstruct Mint{\n static constexpr T mod = MOD;\n T v;\n Mint():v(0){}\n Mint(signed v):v(v){}\n Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}\n\n Mint pow(long long k){\n Mint res(1),tmp(v);\n while(k){\n if(k&1) res*=tmp;\n tmp*=tmp;\n k>>=1;\n }\n return res;\n }\n\n static Mint add_identity(){return Mint(0);}\n static Mint mul_identity(){return Mint(1);}\n\n Mint inv(){return pow(MOD-2);}\n\n Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}\n Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}\n Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}\n Mint& operator/=(Mint a){return (*this)*=a.inv();}\n\n Mint operator+(Mint a) const{return Mint(v)+=a;}\n Mint operator-(Mint a) const{return Mint(v)-=a;}\n Mint operator*(Mint a) const{return Mint(v)*=a;}\n Mint operator/(Mint a) const{return Mint(v)/=a;}\n\n Mint operator-() const{return v?Mint(MOD-v):Mint(v);}\n\n bool operator==(const Mint a)const{return v==a.v;}\n bool operator!=(const Mint a)const{return v!=a.v;}\n bool operator <(const Mint a)const{return v <a.v;}\n\n static Mint comb(long long n,int k){\n Mint num(1),dom(1);\n for(int i=0;i<k;i++){\n num*=Mint(n-i);\n dom*=Mint(i+1);\n }\n return num/dom;\n }\n};\ntemplate<typename T,T MOD> constexpr T Mint<T, MOD>::mod;\ntemplate<typename T,T MOD>\nostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}\n\n//INSERT ABOVE HERE\nusing M = Mint<int>;\nconst int MAX = 1010;\nint dp[MAX][MAX];\nM sm[MAX][MAX]={};\n\nsigned main(){\n int h,w;\n cin>>h>>w;\n h++;w++;\n\n for(int i=0;i<MAX;i++)\n dp[0][i]=dp[i][0]=i;\n\n for(int i=1;i<MAX;i++)\n for(int j=1;j<MAX;j++)\n dp[i][j]=dp[min(i,j)][min(i%j,j%i)];\n\n for(int i=1;i<MAX;i++)\n for(int j=1;j<MAX;j++)\n sm[i][j]=sm[i][j-1]+M(dp[i][j]-1);\n\n for(int i=1;i<MAX;i++)\n for(int j=1;j<MAX;j++)\n sm[i][j]+=sm[i-1][j];\n\n int num=h*w;\n M ans=M(num)*M(num-1)*M(num-2)/M(6);\n //cout<<ans<<endl;\n\n for(int i=1;i<h;i++)\n for(int j=1;j<w;j++)\n ans-=M(2)*sm[i][j];\n //cout<<ans<<endl;\n\n ans-=M(h)*M(h-1)*M(h-2)/M(6)*M(w);\n ans-=M(w)*M(w-1)*M(w-2)/M(6)*M(h);\n //cout<<ans<<endl;\n\n ans*=M(2).pow(num-3);\n cout<<ans<<endl;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 11092, "score_of_the_acc": -0.3528, "final_rank": 10 } ]
aoj_0435_cpp
Highway Network The highway network in Zuia consists of cities (points) and the roads that connect them. The Ivashilo Motorway, which runs through the Ivashilo region, is an important national artery. The upstream sections of the Ivashilo Motorway are constructed as follows. There are $N$ cities (points) assigned the numbers $1$ to $N$. Point $1$ is the starting point and point $N$ is the ending point. Roads are one-way, and there is only one road at most that directly connects one point to another. Any point can always be reached from any starting point, and any point can be reached from any ending point. No matter how you follow the road, you will never return to the same point. The Zuia nation decided to survey the upstream line of the Iwashiro Expressway. In this survey, for each point on the upstream line, we need to find the sum of the lengths of all the paths that go from the starting point to the end point through that point. The number of points and the information about the road are given. Write a program that outputs the sum of the lengths of all routes from the starting point through point $i$ to the end point for each point $i$. Let the length of the path be the number of roads traversed. Input Input is given in the following form. $N$ $M$ $u_1$ $v_1$ $u_2$ $v_2$ : $u_M$ $v_M$ In the first line, the number of points $N$ ($2 \leq N \leq 50$) and the number of roads $M$ ($N-1 \leq M \leq N \times (N-1)/2$) are given. In the following $M$ lines, the starting point $u_i$ and the arrival point $v_i$ ($1 \leq u_i < v_i \leq N$) of the $i$-th road are given. Output The output consists of $N$ lines, where the $i$-th line is the total length of the path through point $i$. Sample Input and Output Sample Input 1 3 3 1 2 2 3 1 3 Sample Output 1 3 2 3 There are 2 routes from the starting point to the ending point through 1: 1 $\rightarrow$ 2 $\rightarrow$ 3, 1 $\rightarrow$ 3, and the total length is 3. There are 1 routes from the starting point to the ending point through 2: 1 $\rightarrow$ 2 $\rightarrow$ 3, and the total is 2. There are 2 routes from the starting point to the ending point through 3: 1 $\rightarrow$ 2 $\rightarrow$ 3, 1 $\rightarrow$ 3, and the total is 3. Sample Input 2 6 8 1 2 1 3 2 3 2 4 3 5 4 5 4 6 5 6 Sample Output 2 14 11 7 7 11 14
[ { "submission_id": "aoj_0435_9455961", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint n,m;\nvector<vector<int>>s(51,vector<int>(0));\nvector<int>t(51,0);\n\nvoid dfs(int now,int bit,int cost){\n if(now==n){\n for(int j=1;j<=n;j++){\n if(bit&1<<j){\n t[j]+=cost;\n }\n }\n }else{\n for(int i=0;i<s[now].size();i++){\n dfs(s[now][i],(bit|(1<<s[now][i])),cost+1);\n }\n }\n}\n\nint main(){\n cin>>n>>m;\n for(int i=0;i<m;i++){\n int u,v;cin>>u>>v;\n s[u].push_back(v);\n }\n dfs(1,2,0);\n for(int i=1;i<=n;i++){\n cout<<t[i]<<\"\\n\";\n }\n}", "accuracy": 0.6, "time_ms": 80, "memory_kb": 3488, "score_of_the_acc": -1.4453, "final_rank": 8 }, { "submission_id": "aoj_0435_4983267", "code_snippet": "#include<cstdio>\n#include<cstring>\n#include<algorithm>\n#define y 50*(50-1)/2\nusing namespace std;\nint main(void)\n{\n\tlong long n,m,u[y],v[y],sa[51]={0},sum,i,j,k,l;\n\tlong long dp[51][y]={0},dp2[51][y]={0};\n\tscanf(\"%lld %lld\",&n,&m);\n\tfor(i=0;i<m;i++)\tscanf(\"%lld %lld\",&u[i],&v[i]);\n\tdp[1][0]=1;\n\tfor(i=1;i<=n;i++){\n\t\tfor(j=0;j<n;j++){\n\t\t\tif(dp[i][j]!=0){\n\t\t\t\tfor(k=0;k<m;k++){\n\t\t\t\t\tif(i==u[k]){\n\t\t\t\t\t\tdp[v[k]][j+1]+=dp[i][j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor(i=1;i<=n;i++){\n\t\tdp2[1][0]=1;\n\t\tfor(j=1;j<=n;j++){\n\t\t\tfor(k=0;k<n;k++){\n\t\t\t\tif(dp2[j][k]!=0){\n\t\t\t\t\tfor(l=0;l<m;l++){\n\t\t\t\t\t\tif(j==u[l]){\n\t\t\t\t\t\t\tif(i!=u[l] && i!=v[l]){\n\t\t\t\t\t\t\t\tdp2[v[l]][k+1]+=dp2[j][k];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(j=1;j<=n;j++){\n\t\t\tsa[i]+=dp[n][j]*j;\n\t\t}\n\t\tfor(j=1;j<=n;j++){\n\t\t\tsa[i]-=dp2[n][j]*j;\n\t\t}\n\t\tfor(j=0;j<51;j++){\n\t\t\tfor(k=0;k<y;k++)\tdp2[j][k]=0;\n\t\t}\n\t}\n\tfor(i=1;i<=n;i++)\tprintf(\"%lld\\n\",sa[i]);\n\treturn 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3748, "score_of_the_acc": -1.2388, "final_rank": 4 }, { "submission_id": "aoj_0435_4983265", "code_snippet": "#include<cstdio>\n#include<cstring>\n#include<algorithm>\n#define y 50*(50-1)/2\nusing namespace std;\nint main(void)\n{\n\tint n,m,u[y],v[y],sa[51]={0},sum,i,j,k,l;\n\tint dp[51][y]={0},dp2[51][y]={0};\n\tscanf(\"%d %d\",&n,&m);\n\tfor(i=0;i<m;i++)\tscanf(\"%d %d\",&u[i],&v[i]);\n\tdp[1][0]=1;\n\tfor(i=1;i<=n;i++){\n\t\tfor(j=0;j<n;j++){\n\t\t\tif(dp[i][j]!=0){\n\t\t\t\tfor(k=0;k<m;k++){\n\t\t\t\t\tif(i==u[k]){\n\t\t\t\t\t\tdp[v[k]][j+1]+=dp[i][j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor(i=1;i<=n;i++){\n\t\tdp2[1][0]=1;\n\t\tfor(j=1;j<=n;j++){\n\t\t\tfor(k=0;k<n;k++){\n\t\t\t\tif(dp2[j][k]!=0){\n\t\t\t\t\tfor(l=0;l<m;l++){\n\t\t\t\t\t\tif(j==u[l]){\n\t\t\t\t\t\t\tif(i!=u[l] && i!=v[l]){\n\t\t\t\t\t\t\t\tdp2[v[l]][k+1]+=dp2[j][k];\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(j=1;j<=n;j++){\n\t\t\tsa[i]+=dp[n][j]*j;\n\t\t}\n\t\tfor(j=1;j<=n;j++){\n\t\t\tsa[i]-=dp2[n][j]*j;\n\t\t}\n\t\tfor(j=0;j<51;j++){\n\t\t\tfor(k=0;k<y;k++)\tdp2[j][k]=0;\n\t\t}\n\t}\n\tfor(i=1;i<=n;i++)\tprintf(\"%d\\n\",sa[i]);\n\treturn 0;\n}", "accuracy": 0.84, "time_ms": 20, "memory_kb": 3260, "score_of_the_acc": -0.1429, "final_rank": 5 }, { "submission_id": "aoj_0435_4971016", "code_snippet": "#include<cstdio>\n#include<algorithm>\nusing namespace std;\nlong long dp[51][51][51],tol=0;\nint main(void)\n{\n\tlong long n,m,i,j,k,u[1250],v[1250],cnt=1,l,tol2=0;\n\tscanf(\"%lld %lld\",&n,&m);\n\tfor(i=0;i<m;i++) scanf(\"%lld %lld\",&u[i],&v[i]);\n\tfor(i=1;i<=n;i++) dp[i][1][0]=1;\n\tfor(l=1;l<n;l++){\n\t\tfor(i=1;i<=n;i++){\n\t\t\tfor(j=0;j<n;j++){\n\t\t\t\tif(dp[l][i][j]!=0){\n\t\t\t\t\tfor(k=0;k<m;k++){\n\t\t\t\t\t\tif(u[k]==i&&v[k]!=l) dp[l][v[k]][j+1]+=dp[l][i][j];\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor(i=1;i<n;i++){\n\t\tfor(j=0;j<n;j++){\n\t\t\ttol+=dp[i][n][j]*j;\n\t\t}\n\t\tif(i==1){\n\t\t\ttol2=tol;\n\t\t\tprintf(\"%lld\\n\",tol2);\n\t\t}\n\t\telse printf(\"%lld\\n\",tol2-tol);\n\t\ttol=0;\n\t}\n\tprintf(\"%lld\\n\",tol2);\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3752, "score_of_the_acc": -0.9609, "final_rank": 2 }, { "submission_id": "aoj_0435_4971008", "code_snippet": "#include<stdio.h>\n#include<algorithm>\nusing namespace std;\nint main()\n{\n\tlong long n,m,i,j,k,l,an,an1=0,a[1300],b[1300],dp[51][50][50],cn[51];\n\tscanf(\"%lld %lld\",&n,&m);\n\tfor(i=0;i<=n;i++){\n\t\tfor(j=0;j<n;j++){\n\t\t\tfor(k=1;k<n;k++){\n\t\t\t\tdp[i][j][k]=0;\n\t\t\t}\n\t\t}\n\t}\n\tfor(i=0;i<n;i++) cn[i]=0; \n\tfor(i=1;i<n;i++) dp[i][1][0]=1;\n\tfor(i=1;i<=m;i++){\n\t\tscanf(\"%lld %lld\",&a[i],&b[i]);\n\t\tcn[b[i]]++;\n\t}\n\tfor(l=1;l<n;l++){\n\t\tfor(i=1;i<n;i++){\n\t\t\tfor(j=0;j<n;j++){\n\t\t\t\tif(dp[l][i][j]!=0){\n\t\t\t\t\tfor(k=1;k<=m;k++){\n\t\t\t\t\t\tif(a[k]==i&&b[k]!=l){\n\t\t\t\t\t\t\tdp[l][b[k]][j+1]+=dp[l][i][j];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tan=0;\n\tfor(i=0;i<n;i++){\n\t\tan+=i*dp[1][n][i];\n\t}\n\tan1=an; an=0;\n\tprintf(\"%lld\\n\",an1);\n\tfor(l=2;l<n;l++){\n\t\tfor(i=0;i<n;i++){\n\t\t\tan+=i*dp[l][n][i];\n\t\t}\n\t\tprintf(\"%lld\\n\",an1-an);\n\t\tan=0;\n\t}\n\tprintf(\"%lld\\n\",an1);\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3720, "score_of_the_acc": -0.8984, "final_rank": 1 }, { "submission_id": "aoj_0435_4970838", "code_snippet": "#include<cstdio>\n#include<algorithm>\nusing namespace std;\nlong long dp[51][51][51],tol=0;\nint main(void)\n{\n\tlong long n,m,i,j,k,u[1250],v[1250],cnt=1,l,tol2=0;\n\tscanf(\"%lld %lld\",&n,&m);\n\tfor(i=0;i<m;i++) scanf(\"%lld %lld\",&u[i],&v[i]);\n\tfor(i=1;i<=n;i++) dp[i][1][0]=1;\n\tfor(l=1;l<n;l++){\n\t\tfor(i=1;i<=n;i++){\n\t\t\tfor(j=0;j<n;j++){\n\t\t\t\tif(dp[l][i][j]!=0){\n\t\t\t\t\tfor(k=0;k<m;k++){\n\t\t\t\t\t\tif(u[k]==i){\n\t\t\t\t\t\t\tif(v[k]!=l) dp[l][v[k]][j+1]+=dp[l][i][j];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor(i=1;i<n;i++){\n\t\tfor(j=0;j<n;j++){\n\t\t\ttol+=dp[i][n][j]*j;\n\t\t}\n\t\tif(i==1){\n\t\t\ttol2=tol;\n\t\t\tprintf(\"%lld\\n\",tol2);\n\t\t}\n\t\telse printf(\"%lld\\n\",tol2-tol);\n\t\ttol=0;\n\t}\n\tprintf(\"%lld\\n\",tol2);\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3772, "score_of_the_acc": -1, "final_rank": 3 }, { "submission_id": "aoj_0435_4970733", "code_snippet": "#include<cstdio>\n#include<algorithm>\nusing namespace std;\nlong long dp[51][51][51],tol=0;\nint main(void)\n{\n\tlong long n,m,i,j,k,u[1250],v[1250],cnt=1,l,tol2=0;\n\tscanf(\"%lld %lld\",&n,&m);\n\tfor(i=0;i<m;i++) scanf(\"%lld %lld\",&u[i],&v[i]);\n\tfor(i=1;i<=n;i++) dp[i][1][0]=1;\n\tfor(l=1;l<n;l++){\n\t\tfor(i=1;i<=n;i++){\n\t\t\tfor(j=0;j<n;j++){\n\t\t\t\tif(dp[l][i][j]!=0){\n\t\t\t\t\tfor(k=0;k<m;k++){\n\t\t\t\t\t\tif(u[k]==i){\n\t\t\t\t\t\t\tif(v[k]!=l)dp[l][v[k]][j+1]+=dp[l][i][j];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor(i=1;i<n;i++){\n\t\tfor(j=0;j<n;j++){\n\t\t\ttol+=dp[i][n][j]*j;\n\t\t}\n\t\tif(i==1){\n\t\t\ttol2=tol;\n\t\t\tprintf(\"%d\\n\",tol2);\n\t\t}\n\t\telse printf(\"%d\\n\",tol2-tol);\n\t\ttol=0;\n\t}\n\tprintf(\"%d\\n\",tol2);\n\treturn 0;\n}", "accuracy": 0.84, "time_ms": 10, "memory_kb": 3712, "score_of_the_acc": -0.8828, "final_rank": 7 }, { "submission_id": "aoj_0435_4970723", "code_snippet": "#include<cstdio>\n#include<algorithm>\nusing namespace std;\nlong long dp[50][50][50],tol=0;\nint main(void)\n{\n\tlong long n,m,i,j,k,u[1250],v[1250],cnt=1,l,tol2=0;\n\tscanf(\"%lld %lld\",&n,&m);\n\tfor(i=0;i<m;i++) scanf(\"%lld %lld\",&u[i],&v[i]);\n\tfor(i=1;i<=n;i++) dp[i][1][0]=1;\n\tfor(l=1;l<n;l++){\n\t\tfor(i=1;i<=n;i++){\n\t\t\tfor(j=0;j<n;j++){\n\t\t\t\tif(dp[l][i][j]!=0){\n\t\t\t\t\tfor(k=0;k<m;k++){\n\t\t\t\t\t\tif(u[k]==i){\n\t\t\t\t\t\t\tif(v[k]!=l)dp[l][v[k]][j+1]+=dp[l][i][j];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor(i=1;i<n;i++){\n\t\tfor(j=0;j<n;j++){\n\t\t\ttol+=dp[i][n][j]*j;\n\t\t}\n\t\tif(i==1){\n\t\t\ttol2=tol;\n\t\t\tprintf(\"%d\\n\",tol2);\n\t\t}\n\t\telse printf(\"%d\\n\",tol2-tol);\n\t\ttol=0;\n\t}\n\tprintf(\"%d\\n\",tol2);\n\treturn 0;\n}", "accuracy": 0.84, "time_ms": 10, "memory_kb": 3668, "score_of_the_acc": -0.7969, "final_rank": 6 } ]
aoj_0427_cpp
Resource of the Planet Yanaizu Humanity has finally discovered the planet Yanaizu, which is home to intelligent life. As science progressed on Yanaiizu, collaboration with us gradually became more and more active. On the planet Yanaizu, an insect called Beko is considered to be an important resource. It grows from a larva to an adult. In their habitat, there are several colonies of Beko larvae living in swarms, and these colonies are arranged in a row. Using the biotechnology of the planet Yanaizu, the following operations can be performed on the swarms. Add the same number of larvae to all swarms in a given range. Hatch the specified number of larvae into adults in all the swarms in the specified range, and find the total number of hatched larvae. At this point, we can specify only one number of larvae to be hatched. In the second operation, if the number of larvae in a group is less than the specified number, all the larvae in that group are hatched. For example, if there are three larvae in group 1 and two larvae in group 2, and the number of larvae to be hatched in groups 1 to 2 is 3, then three larvae from group 1 and two larvae from group 2 will be hatched into adults. In this case, the total number of larvae hatched is five. In this collaborative research, we humans were in charge of simulating these operations on Beko larvae. This is the time to show the power of our science. Given the information about the larvae in each swarms, write a program to simulate the operations on them. Input The input is given in the following form. $N$ $c_1$ $c_2$ : $c_N$ $M$ $manip_1$ $manip_2$ : $manip_M$ In the first line, the number of swarms $N$ ($1 \leq N \leq 100,000$) is given. In the following $N$ lines, the number of larvae in each swarm $c_i$ ($0 \leq c_i \leq 100,000$) is given. In the next line, the number of operations $M$ ($1 \leq M \leq 100,000$) is given. In the following $M$ lines, the contents of the operations are given. The content of each operation is one of the following: 1 $a$ $b$ $d$ or 2 $a$ $b$ $d$ If the first number is 1, add $d$ larvae ($1 \leq d \leq 1,000$) to the swarm in the specified range $a$ to $b$ ($1 \leq a \leq b \leq N$). When the first number is 2, it represents the operation to hatch $d$ larvae ($1 \leq d \leq 1,000$) into adults in all the swarms in the range $a$ to $b$ ($1 \leq a \leq b \leq N$). In this case, the total number of larvae actually hatched should be output. It is assumed that at least one operation with a leading number of 2 is always given. Output Output the total number of larvae actually hatched in a line for each operation that hatches larvae. Sample Input and Output Sample Input 3 1 2 3 3 2 1 3 2 1 1 2 5 2 2 3 3 Sample Output 5 4
[ { "submission_id": "aoj_0427_11012306", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma GCC optimize(\"Ofast,unroll-loops\")\n#pragma GCC target(\"avx2,popcnt\")\n\n// --------- Fast IO ----------\nnamespace fastio {\n static const int SZ = 1 << 20;\n char ibuf[SZ]; int ipos = 0, ilen = 0;\n inline char getch() {\n if (ipos >= ilen) {\n ilen = (int)fread(ibuf, 1, SZ, stdin);\n ipos = 0;\n if (ilen == 0) return 0;\n }\n return ibuf[ipos++];\n }\n inline bool readInt(int &out) {\n char c; int sgn = 1; int x = 0;\n do { c = getch(); if (!c) return false; } while (c <= ' ');\n if (c == '-') { sgn = -1; c = getch(); }\n for (; '0' <= c && c <= '9'; c = getch()) x = x*10 + (c - '0');\n out = x * sgn; return true;\n }\n static const int OSZ = 1 << 20;\n char obuf[OSZ]; int opos = 0;\n inline void putch(char c) {\n if (opos >= OSZ) { fwrite(obuf, 1, OSZ, stdout); opos = 0; }\n obuf[opos++] = c;\n }\n inline void writeLL(long long x) {\n if (x == 0) { putch('0'); return; }\n if (x < 0) { putch('-'); x = -x; }\n char s[24]; int n = 0;\n while (x) { s[n++] = char('0' + (x % 10)); x /= 10; }\n while (n--) putch(s[n]);\n }\n inline void writeNL() { putch('\\n'); }\n inline void flush() { fwrite(obuf, 1, opos, stdout); opos = 0; }\n}\nusing fastio::readInt;\n\n// --------- Segment Tree Beats (min side + add) ----------\nstruct SegTree {\n int n;\n static constexpr int INF = 0x3f3f3f3f;\n\n vector<long long> sum;\n vector<int> min1, min2, cntMin, add;\n\n SegTree(int n): n(n),\n sum(4*n, 0), min1(4*n, 0), min2(4*n, INF),\n cntMin(4*n, 0), add(4*n, 0) {}\n\n inline void apply_add(int p, int len, int v) {\n sum[p] += 1LL * v * len;\n min1[p] += v;\n if (min2[p] < INF) min2[p] += v;\n add[p] += v;\n }\n\n inline void pushMin(int p, int v) { // raise min1 to v (v > min1 && v <= min2)\n if (v <= min1[p]) return;\n sum[p] += 1LL * (v - min1[p]) * cntMin[p];\n min1[p] = v;\n // min2 unchanged; invariant maintained\n }\n\n inline void pull(int p) {\n int lc = p<<1, rc = lc|1;\n sum[p] = sum[lc] + sum[rc];\n\n if (min1[lc] < min1[rc]) {\n min1[p] = min1[lc];\n cntMin[p] = cntMin[lc];\n min2[p] = std::min(min2[lc], min1[rc]);\n } else if (min1[rc] < min1[lc]) {\n min1[p] = min1[rc];\n cntMin[p] = cntMin[rc];\n min2[p] = std::min(min1[lc], min2[rc]);\n } else {\n min1[p] = min1[lc];\n cntMin[p] = cntMin[lc] + cntMin[rc];\n min2[p] = std::min(min2[lc], min2[rc]);\n }\n }\n\n inline void push(int p, int l, int r) {\n if (l == r) { add[p] = 0; return; }\n int lc = p<<1, rc = lc|1;\n int m = (l + r) >> 1;\n if (add[p]) {\n int v = add[p];\n apply_add(lc, m - l + 1, v);\n apply_add(rc, r - m, v);\n add[p] = 0;\n }\n // ensure children min >= parent min\n if (min1[lc] < min1[p]) pushMin(lc, min1[p]);\n if (min1[rc] < min1[p]) pushMin(rc, min1[p]);\n }\n\n void build(int p, int l, int r, const vector<int>& a) {\n if (l == r) {\n int v = a[l];\n sum[p] = v;\n min1[p] = v;\n min2[p] = INF;\n cntMin[p] = 1;\n add[p] = 0;\n return;\n }\n int m = (l + r) >> 1;\n build(p<<1, l, m, a);\n build(p<<1|1, m+1, r, a);\n pull(p);\n }\n\n void range_add(int p, int l, int r, int ql, int qr, int v) {\n if (qr < l || r < ql) return;\n if (ql <= l && r <= qr) {\n apply_add(p, r - l + 1, v);\n return;\n }\n push(p, l, r);\n int m = (l + r) >> 1;\n range_add(p<<1, l, m, ql, qr, v);\n range_add(p<<1|1, m+1, r, ql, qr, v);\n pull(p);\n }\n\n // range chmax with x = 0\n void range_chmax0(int p, int l, int r, int ql, int qr) {\n if (qr < l || r < ql || min1[p] >= 0) return;\n if (ql <= l && r <= qr && min2[p] > 0) {\n pushMin(p, 0);\n return;\n }\n push(p, l, r);\n int m = (l + r) >> 1;\n range_chmax0(p<<1, l, m, ql, qr);\n range_chmax0(p<<1|1, m+1, r, ql, qr);\n pull(p);\n }\n\n long long range_sum(int p, int l, int r, int ql, int qr) {\n if (qr < l || r < ql) return 0;\n if (ql <= l && r <= qr) return sum[p];\n push(p, l, r);\n int m = (l + r) >> 1;\n return range_sum(p<<1, l, m, ql, qr)\n + range_sum(p<<1|1, m+1, r, ql, qr);\n }\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int N;\n if (!readInt(N)) return 0;\n vector<int> a(N+1);\n for (int i = 1; i <= N; ++i) readInt(a[i]);\n\n SegTree seg(N);\n seg.build(1, 1, N, a);\n\n int M; readInt(M);\n for (int i = 0; i < M; ++i) {\n int t, l, r, d;\n readInt(t); readInt(l); readInt(r); readInt(d);\n if (t == 1) {\n seg.range_add(1, 1, N, l, r, d);\n } else { // t == 2\n long long S0 = seg.range_sum(1, 1, N, l, r);\n seg.range_add(1, 1, N, l, r, -d);\n seg.range_chmax0(1, 1, N, l, r);\n long long S1 = seg.range_sum(1, 1, N, l, r);\n fastio::writeLL(S0 - S1);\n fastio::writeNL();\n }\n }\n fastio::flush();\n return 0;\n}", "accuracy": 1, "time_ms": 120, "memory_kb": 14628, "score_of_the_acc": -0.4059, "final_rank": 1 }, { "submission_id": "aoj_0427_10397827", "code_snippet": "// AOJ #0427 Resource of the Planet Yanaizu\n// 2025.4.19\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int INF = 0x3f3f3f3f;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Cout(ll n) {\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tif (n < 0) pc('-'), n = -n;\n\t\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n\t\twhile (i--) pc(b[i]);\n\t}\n\tpc('\\n');\n}\n\nstruct Node {\n ll sum;\n int mn, smn;\n int cm;\n ll add;\n};\n\nvector<Node> st;\nvector<int> c;\nint n, m;\n\nvoid pull(int o) {\n const auto &L = st[o<<1], &R = st[o<<1|1];\n st[o].sum = L.sum + R.sum;\n if (L.mn < R.mn) {\n st[o].mn = L.mn;\n st[o].cm = L.cm;\n st[o].smn = min(L.smn, R.mn);\n } else if (L.mn > R.mn) {\n st[o].mn = R.mn;\n st[o].cm = R.cm;\n st[o].smn = min(L.mn, R.smn);\n } else {\n st[o].mn = L.mn;\n st[o].cm = L.cm + R.cm;\n st[o].smn = min(L.smn, R.smn);\n }\n}\n\nvoid apply_add(int o, ll v, int len) {\n st[o].sum += v * len;\n st[o].mn = int(st[o].mn + v);\n st[o].smn = (st[o].smn < INF ? int(st[o].smn + v) : INF);\n st[o].add += v;\n}\n\nvoid apply_chmax(int o, int x) {\n if (st[o].mn >= x) return;\n st[o].sum += ll(x - st[o].mn) * st[o].cm;\n st[o].mn = x;\n if (st[o].smn < x) st[o].smn = x;\n}\n\nvoid push(int o, int l, int r) {\n int m = (l + r) >> 1;\n int lc = o<<1, rc = o<<1|1;\n if (st[o].add) {\n apply_add(lc, st[o].add, m - l + 1);\n apply_add(rc, st[o].add, r - m);\n st[o].add = 0;\n }\n apply_chmax(lc, st[o].mn);\n apply_chmax(rc, st[o].mn);\n}\n\nvoid build(int o, int l, int r) {\n st[o].add = 0;\n if (l == r) {\n st[o].sum = st[o].mn = c[l];\n st[o].smn = INF;\n st[o].cm = 1;\n return;\n }\n int m = (l + r) >> 1;\n build(o<<1, l, m);\n build(o<<1|1, m+1, r);\n pull(o);\n}\n\nvoid range_add(int o, int l, int r, int ql, int qr, ll v) {\n if (ql <= l && r <= qr) {\n apply_add(o, v, r - l + 1);\n return;\n }\n push(o, l, r);\n int m = (l + r) >> 1;\n if (ql <= m) range_add(o<<1, l, m, ql, qr, v);\n if (qr > m) range_add(o<<1|1, m+1, r, ql, qr, v);\n pull(o);\n}\n\nvoid range_chmax(int o, int l, int r, int ql, int qr, int x) {\n if (st[o].mn >= x || qr < l || r < ql) return;\n if (ql <= l && r <= qr && st[o].smn > x) {\n apply_chmax(o, x);\n return;\n }\n push(o, l, r);\n int m = (l + r) >> 1;\n if (ql <= m) range_chmax(o<<1, l, m, ql, qr, x);\n if (qr > m) range_chmax(o<<1|1, m+1, r, ql, qr, x);\n pull(o);\n}\n\nll range_sum(int o, int l, int r, int ql, int qr) {\n if (ql <= l && r <= qr) return st[o].sum;\n push(o, l, r);\n int m = (l + r) >> 1;\n ll ans = 0;\n if (ql <= m) ans += range_sum(o<<1, l, m, ql, qr);\n if (qr > m) ans += range_sum(o<<1|1, m+1, r, ql, qr);\n return ans;\n}\n\nint main(){\n n = Cin();\n c.resize(n+1);\n for (int i = 1; i <= n; i++) c[i] = Cin();\n\n st.resize(4*(n+1));\n build(1, 1, n);\n\n m = Cin();\n while (m--) {\n int t = Cin(), a = Cin(), b = Cin(), d = Cin();\n if (t == 1) {\n range_add(1, 1, n, a, b, d);\n } else {\n ll before = range_sum(1, 1, n, a, b);\n range_add (1, 1, n, a, b, -d);\n range_chmax(1, 1, n, a, b, 0);\n ll after = range_sum(1, 1, n, a, b);\n Cout(before - after);\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 15884, "score_of_the_acc": -0.4137, "final_rank": 2 }, { "submission_id": "aoj_0427_10036584", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pll = pair<ll, ll>;\nconst int INF = 1e9+100;\nconst ll INFL = 3e18+100;\n#define fi first\n#define se second\n#define all(x) x.begin(), x.end()\n#define chmin(a, b) a=min(a, b)\n#define chmax(a, b) a=max(a, b)\n#define rep(i,n) for(int i=0;i<(n);++i)\nll POW(ll x, ll n, ll m=INFL){ll res=1;x%=m;while(n){if(n&1)res=res*x%m;x=x*x%m;n>>=1ll;}return res;}\n\nstruct Segtree_beats {\n ll op(int type, ll x, ll y) { return type ? min(x, y) : max(x, y); }\n bool cmp(int type, ll x, ll y) { return type ? x < y : x > y; }\n struct alignas(32) Node {\n ll sum = 0;\n ll a1[2] = {}, a2[2] = {-INFL, INFL}, ac[2] = {1, 1}, add = 0;\n };\n vector<Node> v;\n ll n, log, e[3] = {-INFL, INFL, 0};\n Segtree_beats() {}\n Segtree_beats(int n) : Segtree_beats(vector<ll>(n)) {}\n Segtree_beats(const vector<ll>& a) {\n n = 1, log = 0;\n while (n < (int)a.size()) n <<= 1, log++;\n v.resize(2 * n);\n rep(i, (int)a.size()) {\n v[i + n].sum = v[i + n].a1[0] = v[i + n].a1[1] = a[i];\n }\n for (int i = n - 1; i >= 1; --i) update(i);\n }\n \n // 0 : add, 1 : chmin, 2 : chmax, 3 : update\n template <int cmd> void apply(int l, int r, ll x) {\n if (l == r) return;\n l += n, r += n;\n for (int i = log; i >= 1; --i) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n {\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) _apply<cmd>(l++, x);\n if (r & 1) _apply<cmd>(--r, x);\n l >>= 1;\n r >>= 1;\n }\n l = l2, r = r2;\n }\n for (int i = 1; i <= log; ++i) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n \n // 0 : max, 1 : min, 2 : sum\n template <int cmd> ll fold(int l, int r) {\n if (l == r) return 0;\n l += n, r += n;\n for (int i = log; i >= 1; --i) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n ll lx = e[cmd], rx = e[cmd];\n while (l < r) {\n if (l & 1) op<cmd>(lx, v[l++]);\n if (r & 1) op<cmd>(rx, v[--r]);\n l >>= 1;\n r >>= 1;\n }\n if constexpr (cmd <= 1) lx = op(cmd, lx, rx);\n if constexpr (cmd == 2) lx += rx;\n return lx;\n }\nprivate:\n void update(int k) {\n Node& p = v[k];\n Node& l = v[k * 2 + 0];\n Node& r = v[k * 2 + 1];\n p.sum = l.sum + r.sum;\n rep(t, 2) {\n if (l.a1[t] == r.a1[t]) {\n p.a1[t] = l.a1[t];\n p.a2[t] = op(t, l.a2[t], r.a2[t]);\n p.ac[t] = l.ac[t] + r.ac[t];\n } else {\n bool f = cmp(t, l.a1[t], r.a1[t]);\n p.a1[t] = f ? l.a1[t] : r.a1[t];\n p.ac[t] = f ? l.ac[t] : r.ac[t];\n p.a2[t] = op(t, f ? r.a1[t] : l.a1[t],\n f ? l.a2[t] : r.a2[t]);\n }\n }\n }\n void push_add(int k, ll x) {\n Node& p = v[k];\n p.sum += x << (log + __builtin_clz(k) - 31);\n rep(t, 2) {\n p.a1[t] += x;\n if (p.a2[t] != e[t]) p.a2[t] += x;\n }\n p.add += x;\n }\n void push(int cmd, int k, ll x) {\n Node& p = v[k];\n p.sum += (x - p.a1[cmd]) * p.ac[cmd];\n if (p.a1[cmd ^ 1] == p.a1[cmd]) p.a1[cmd ^ 1] = x;\n if (p.a2[cmd ^ 1] == p.a1[cmd]) p.a2[cmd ^ 1] = x;\n p.a1[cmd] = x;\n }\n void push(int k) {\n Node& p = v[k];\n if (p.add) {\n rep(t, 2) push_add(k * 2 + t, p.add);\n p.add = 0;\n }\n rep(t, 2) rep(s, 2) if (cmp(t, v[k * 2 + s].a1[t], p.a1[t]))\n push(t, k * 2 + s, p.a1[t]);\n }\n void subtree_ch(int cmd, int k, ll x) {\n if (!cmp(cmd, v[k].a1[cmd], x)) return;\n if (cmp(cmd, x, v[k].a2[cmd])) {\n return push(cmd, k, x);\n }\n push(k);\n rep(t, 2) subtree_ch(cmd, k * 2 + t, x);\n update(k);\n }\n template <int cmd> inline void _apply(int k, ll x) {\n rep(i, 2) if (cmd >> i & 1) subtree_ch(i, k, x);\n if constexpr (cmd == 0) push_add(k, x);\n }\n template <int cmd> inline void op(ll& a, const Node& b) {\n if constexpr (cmd <= 1) a = op(cmd, a, b.a1[cmd]);\n if constexpr (cmd == 2) a += b.sum;\n }\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n int n;\n cin >> n;\n vector<ll> c(n);\n rep(i,n) cin >> c[i];\n\n Segtree_beats seg(c);\n\n\n int m;\n cin >> m;\n rep(i,m){\n int t,a,b,d;\n cin >> t >> a >> b >> d;\n a--;\n if(t==1){\n seg.apply<0>(a,b,d);\n }\n else{\n ll mae = seg.fold<2>(a,b);\n seg.apply<0>(a,b,-d);\n seg.apply<2>(a,b,0);\n ll ato = seg.fold<2>(a,b);\n \n cout << mae-ato << endl;\n }\n }\n}", "accuracy": 1, "time_ms": 260, "memory_kb": 20308, "score_of_the_acc": -0.9313, "final_rank": 12 }, { "submission_id": "aoj_0427_9797660", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(n);++i)\nusing namespace std;\nusing ll = long long;\n\n#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<class T>\nstruct SegmentTree {\n const T INF = numeric_limits<T>::max() / 2;\n int n;\n vector<T> max_v, smax_v, max_c;\n vector<T> min_v, smin_v, min_c;\n vector<T> sum;\n vector<T> len;\n vector<T> lazy;\n vector<bool> fail;\n\n SegmentTree(int n_) {\n n = 1;\n while(n < n_) n *= 2;\n max_v.resize(2*n, -INF);\n smax_v.resize(2*n, -INF);\n max_c.resize(2*n);\n min_v.resize(2*n, INF);\n smin_v.resize(2*n, INF);\n min_c.resize(2*n);\n sum.resize(2*n);\n len.resize(2*n);\n lazy.resize(2*n);\n fail.resize(2*n);\n for(int i=0; i<n; i++) len[i+n] = 1;\n for(int i=n-1; i>0; i--) len[i] = len[2*i] + len[2*i+1];\n }\n\n void update_node_max(int k, T x) {\n sum[k] += (x - max_v[k]) * max_c[k];\n if(max_v[k] == min_v[k]) {\n max_v[k] = min_v[k] = x;\n } else if(max_v[k] == smin_v[k]) {\n max_v[k] = smin_v[k] = x;\n } else {\n max_v[k] = x;\n }\n }\n\n void update_node_min(int k, T x) {\n sum[k] += (x - min_v[k]) * min_c[k];\n if(max_v[k] == min_v[k]) {\n max_v[k] = min_v[k] = x;\n } else if(smax_v[k] == min_v[k]) {\n min_v[k] = smax_v[k] = x;\n } else {\n min_v[k] = x;\n }\n }\n\n void push_add(int k, T x) {\n max_v[k] += x;\n if(smax_v[k] != -INF) smax_v[k] += x;\n min_v[k] += x;\n if(smin_v[k] != INF) smin_v[k] += x;\n sum[k] += x * len[k];\n lazy[k] += x;\n }\n\n void push(int k) {\n if(lazy[k] != 0) {\n push_add(2*k, lazy[k]);\n push_add(2*k+1, lazy[k]);\n lazy[k] = 0;\n }\n if(max_v[k] < max_v[2*k]) {\n update_node_max(2*k, max_v[k]);\n }\n if(min_v[k] > min_v[2*k]) {\n update_node_min(2*k, min_v[k]);\n }\n if(max_v[k] < max_v[2*k+1]) {\n update_node_max(2*k+1, max_v[k]);\n }\n if(min_v[k] > min_v[2*k+1]) {\n update_node_min(2*k+1, min_v[k]);\n }\n }\n\n void update(int k) {\n sum[k] = sum[2*k] + sum[2*k+1];\n\n if(max_v[2*k] > max_v[2*k+1]) {\n max_v[k] = max_v[2*k];\n max_c[k] = max_c[2*k];\n smax_v[k] = max(smax_v[2*k], max_v[2*k+1]);\n } else if(max_v[2*k] < max_v[2*k+1]) {\n max_v[k] = max_v[2*k+1];\n max_c[k] = max_c[2*k+1];\n smax_v[k] = max(max_v[2*k], smax_v[2*k+1]);\n } else {\n max_v[k] = max_v[2*k];\n max_c[k] = max_c[2*k] + max_c[2*k+1];\n smax_v[k] = max(smax_v[2*k], smax_v[2*k+1]);\n }\n\n if(min_v[2*k] < min_v[2*k+1]) {\n min_v[k] = min_v[2*k];\n min_c[k] = min_c[2*k];\n smin_v[k] = min(smin_v[2*k], min_v[2*k+1]);\n } else if(min_v[2*k] > min_v[2*k+1]) {\n min_v[k] = min_v[2*k+1];\n min_c[k] = min_c[2*k+1];\n smin_v[k] = min(min_v[2*k], smin_v[2*k+1]);\n } else {\n min_v[k] = min_v[2*k];\n min_c[k] = min_c[2*k] + min_c[2*k+1];\n smin_v[k] = min(smin_v[2*k], smin_v[2*k+1]);\n }\n }\n\n void _update_add(int a, int b, T x, int k, int l, int r) {\n if(b <= l || r <= a) return;\n if(a <= l && r <= b) {\n push_add(k, x);\n return;\n }\n push(k);\n int m = (l + r) >> 1;\n _update_add(a, b, x, 2*k, l, m);\n _update_add(a, b, x, 2*k+1, m, r);\n update(k);\n }\n\n void _update_chmax(int a, int b, T x, int k, int l, int r) {\n if(b <= l || r <= a || max_v[k] <= x) return;\n if(a <= l && r <= b && smax_v[k] < x) {\n update_node_max(k, x);\n return;\n }\n push(k);\n int m = (l + r) >> 1;\n _update_chmax(a, b, x, 2*k, l, m);\n _update_chmax(a, b, x, 2*k+1, m, r);\n update(k);\n }\n\n void _update_chmin(int a, int b, T x, int k, int l, int r) {\n if(b <= l || r <= a || min_v[k] >= x) return;\n if(a <= l && r <= b && smin_v[k] > x) {\n update_node_min(k, x);\n return;\n }\n push(k);\n int m = (l + r) >> 1;\n _update_chmin(a, b, x, 2*k, l, m);\n _update_chmin(a, b, x, 2*k+1, m, r);\n update(k);\n }\n\n T _query_sum(int a, int b, int k, int l, int r) {\n if(b <= l || r <= a) return 0;\n if(a <= l && r <= b) return sum[k];\n push(k);\n int m = (l + r) >> 1;\n return _query_sum(a, b, 2*k, l, m) + _query_sum(a, b, 2*k+1, m, r);\n }\n\n // 初期化\n void build(const vector<T>& v) {\n int n_ = v.size();\n for(int i=0; i<n_; i++) {\n max_v[n+i] = min_v[n+i] = sum[n+i] = v[i];\n smax_v[n+i] = -INF;\n smin_v[n+i] = INF;\n max_c[n+i] = min_c[n+i] = 1;\n }\n for(int i=n_; i<n; i++) {\n max_v[n+i] = -INF;\n smax_v[n+i] = -INF;\n min_v[n+i] = INF;\n smin_v[n+i] = INF;\n max_c[n+i] = min_c[n+i] = 0;\n }\n for(int i=n-1; i>0; i--) update(i);\n }\n\n // 区間[a,b)に値xを加算\n void update_add(int a, int b, T x) {\n _update_add(a, b, x, 1, 0, n);\n }\n\n // 区間[a,b)をx以上にする\n void update_chmax(int a, int b, T x) {\n _update_chmax(a, b, x, 1, 0, n);\n }\n\n // 区間[a,b)をx以下にする\n void update_chmin(int a, int b, T x) {\n _update_chmin(a, b, x, 1, 0, n);\n }\n\n // 区間[a,b)の総和を求める\n T query_sum(int a, int b) {\n return _query_sum(a, b, 1, 0, n);\n }\n};\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n int n;\n cin >> n;\n vector<ll> c(n);\n rep(i,n) cin >> c[i];\n\n SegmentTree<ll> seg(n);\n seg.build(c);\n\n\n int m;\n cin >> m;\n rep(i,m){\n int t,a,b,d;\n cin >> t >> a >> b >> d;\n a--;\n if(t==1){\n seg.update_add(a,b,d);\n }\n else{\n ll mae = seg.query_sum(a,b);\n seg.update_add(a,b,-d);\n seg.update_chmin(a,b,0);\n ll ato = seg.query_sum(a,b);\n \n cout << mae-ato << endl;\n }\n }\n \n}", "accuracy": 1, "time_ms": 300, "memory_kb": 22364, "score_of_the_acc": -1.0988, "final_rank": 13 }, { "submission_id": "aoj_0427_8539574", "code_snippet": "#include<iostream>\n#include<cstdio>\n#include<string>\n#include<cmath>\n#include<algorithm>\n#include<map>\n#include<vector>\n#include<stack>\n#include<iomanip>\n#include<queue>\n#include<set>\n#include<functional>\n#include<tuple>\n#include<bitset>\n#include<cassert>\n#include<cstdint>\n#include<complex>\n#include<random>\n#include<fstream>\n#include <unordered_map> \nusing namespace std;\nbool printb(bool f) {\n\tif (f)printf(\"Yes\\n\");\n\telse printf(\"No\\n\");\n\treturn f;\n}\ntemplate<class T>\nvoid prt(T t = \"\", string sep = \"\\n\") { cout << t << sep; return; }\ntemplate<class T>\nvoid printl(vector<T> a, string sep = \" \") {\n\tfor (int i = 0; i < a.size(); i++) {\n\t\tcout << a[i];\n\t\tif (i != a.size() - 1)cout << sep;\n\t}\n\tcout << \"\\n\";\n\treturn;\n}\nbool prt_isfixed = false;\ntemplate<class T>\nvoid prt_fix(T t, string sep = \"\\n\") {\n\tif (!prt_isfixed) {\n\t\tcout << fixed << setprecision(15);\n\t\tprt_isfixed = true;\n\t}\n\tprt(t, sep);\n}\n#define all(a) a.begin(),a.end()\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\nusing uint = unsigned int;\nusing llong = long long;\nusing ullong = unsigned long long;\nusing pii = pair<int, int>;\nusing pll = pair<llong, llong>;\nusing pli = pair<llong, int>;\nusing pil = pair<int, llong>;\ntemplate<typename T> using vec2 = vector<vector<T>>;\ntemplate<typename T> inline bool chmin(T& a, T b) { return (a > b) ? (a = b, true) : false; }\ntemplate<typename T> inline bool chmax(T& a, T b) { return (a < b) ? (a = b, true) : false; }\nbool bitIn(llong a, int b) { return ((a >> b) & 1); }\nint bitCnt(llong a) {\n\tint re = 0;\n\twhile (a > 0) {\n\t\tif (a & 1)re++;\n\t\ta >>= 1;\n\t}\n\treturn re;\n}\nllong powL(llong n, llong i) {\n\tllong re = 1;\n\twhile (i >= 1) {\n\t\tif (i & 1) re *= n;\n\t\tn *= n;\n\t\ti >>= 1;\n\t}\n\treturn re;\n}\nllong powL_M(llong n, llong i, llong mod) {\n\tllong re = 1;\n\twhile (i >= 1) {\n\t\tif (i & 1) {\n\t\t\tre *= n;\n\t\t\tre %= mod;\n\t\t}\n\t\tn *= n;\n\t\tn %= mod;\n\t\ti >>= 1;\n\t}\n\treturn re;\n}\nint dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };\nint dx8[8] = { 0,1,1,1,0,-1,-1,-1 }, dy8[8] = { -1,-1,0,1,1,1,0,-1 };\n\nstruct segtree_beats {\n\tint n;\n\tvector<llong> max_v, smax_v, sum, max_c, lazy, sz;\n\n\tvoid update_node_max(int i, llong x) {\n\t\t//v[i]の範囲の最大値をxに更新し、合計も更新\n\t\t//smax_v[i]<x<max[i]\n\t\tsum[i] -= (max_v[i] - x) * max_c[i];\n\t\tmax_v[i] = x;\n\t}\n\tvoid addall(int i, llong x) {\n\t\t//v[i]の表す範囲全体にxを足す\n\t\tmax_v[i] += x;\n\t\tif (smax_v[i] != -1e10)smax_v[i] += x;\n\t\tsum[i] += x * sz[i];\n\t\tlazy[i] += x;\n\t}\n\n\tvoid pushdown(int k) {\n\t\tif (lazy[k] != 0) {\n\t\t\taddall(2 * k, lazy[k]);\n\t\t\taddall(2 * k + 1, lazy[k]);\n\t\t\tlazy[k] = 0;\n\t\t}\n\t\tif (max_v[k] < max_v[2 * k]) {\n\t\t\tupdate_node_max(2 * k, max_v[k]);\n\t\t}\n\t\tif (max_v[k] < max_v[2 * k + 1]) {\n\t\t\tupdate_node_max(2 * k + 1, max_v[k]);\n\t\t}\n\t}\n\tvoid pushup(int k) {\n\t\tsum[k] = sum[2 * k + 1] + sum[2 * k];\n\n\t\tif (max_v[2 * k] > max_v[2 * k + 1]) {\n\t\t\tmax_v[k] = max_v[2 * k];\n\t\t\tmax_c[k] = max_c[2 * k];\n\t\t\tsmax_v[k] = max(max_v[2 * k + 1], smax_v[2 * k]);\n\t\t}\n\t\telse if (max_v[2 * k] < max_v[2 * k + 1]) {\n\t\t\tmax_v[k] = max_v[2 * k + 1];\n\t\t\tmax_c[k] = max_c[2 * k + 1];\n\t\t\tsmax_v[k] = max(max_v[2 * k], smax_v[2 * k + 1]);\n\t\t}\n\t\telse {\n\t\t\tmax_v[k] = max_v[2 * k];\n\t\t\tmax_c[k] = max_c[2 * k] + max_c[2 * k + 1];\n\t\t\tsmax_v[k] = max(smax_v[2 * k], smax_v[2 * k + 1]);\n\t\t}\n\t}\n\tvoid update_chmin(int a, int b, llong x, int k = 1, int l = 0, int r = -1) {\n\t\tif (r == -1)r = n;\n\t\tif (b <= l || r <= a || max_v[k] <= x)return;\n\t\tif (a <= l && r <= b && smax_v[k] < x) {\n\t\t\tupdate_node_max(k, x);\n\t\t\treturn;\n\t\t}\n\n\t\tpushdown(k);\n\t\tupdate_chmin(a, b, x, 2 * k, l, (l + r) / 2);\n\t\tupdate_chmin(a, b, x, 2 * k + 1, (l + r) / 2, r);\n\t\tpushup(k);\n\t\treturn;\n\t}\n\tvoid update_add(int a, int b, llong x, int k = 1, int l = 0, int r = -1) {\n\t\tif (r == -1)r = n;\n\n\t\tif (b <= l || r <= a)return;\n\t\tif (a <= l && r <= b) {\n\t\t\taddall(k, x);\n\t\t\treturn;\n\t\t}\n\t\tpushdown(k);\n\t\tupdate_add(a, b, x, 2 * k, l, (l + r) / 2);\n\t\tupdate_add(a, b, x, 2 * k + 1, (l + r) / 2, r);\t\n\t\tpushup(k);\n\t\treturn;\n\t}\n\tllong query(int a, int b, int k = 1, int l = 0, int r = -1) {\n\t\tif (r == -1)r = n;\n\n\t\tif (b <= l || r <= a)return 0;\n\t\tif (a <= l && r <= b) {\n\t\t\treturn sum[k];\n\t\t}\n\t\tpushdown(k);\n\t\treturn query(a, b, 2 * k, l, (l + r) / 2) + query(a, b, 2 * k + 1, (l + r) / 2, r);\n\t}\n\n\n\tsegtree_beats(vector<llong>& a) {\n\t\tn = 1;\n\t\twhile (n < a.size())n <<= 1;\n\t\tmax_v.resize(2 * n, 0);\n\t\tsmax_v.resize(2 * n, -1e18);\n\t\tsum.resize(2 * n, 0);\n\t\tmax_c.resize(2 * n, 1);\n\t\tlazy.resize(2 * n, 0);\n\t\tsz.resize(2 * n, 1);\n\n\t\trep(i, a.size()) {\n\t\t\tmax_v[i + n] = sum[i + n] = a[i];\n\t\t}\n\t\tfor (int i = n - 1; i > 0; i--) {\n\t\t\tpushup(i);\n\t\t\tsz[i] = sz[i * 2] + sz[i * 2 + 1];\n\t\t}\n\t}\n};\n\nint main() {\n\tint n;\n\tcin >> n;\n\tvector<llong> c(n);\n\trep(i, n)scanf(\"%d\", &c[i]);\n\trep(i, n)c[i] = -c[i];\n\tsegtree_beats seg(c);\n\n\n\t//全てマイナスで管理する\n\tint m;\n\tcin >> m;\n\twhile (m--) {\n\t\tint f;\n\t\tint a, b, d;\n\t\tscanf(\"%d %d %d %d\", &f, &a, &b, &d);\n\t\ta--;\n\t\tif (f == 1) {\n\t\t\tseg.update_add(a, b, -d);\n\t\t}\n\t\tif (f == 2) {\n\t\t\tint fi = seg.query(a, b);\n\t\t\tseg.update_add(a, b, d);\n\t\t\tseg.update_chmin(a, b, 0);\n\t\t\tint se = seg.query(a, b);\n\t\t\tprt(se - fi);\n\t\t}\n\t}\n\n\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 16412, "score_of_the_acc": -0.5838, "final_rank": 3 }, { "submission_id": "aoj_0427_8480080", "code_snippet": "#include<bits/stdc++.h>\n#define overload(a,b,c,d,...) d\n#define rep1(a) for(ll _=0;_<(ll)a;++_)\n#define rep2(i,n) for(ll i=0;i<(ll)n;++i)\n#define rep3(i,l,r) for(ll i=(ll)l;i<(ll)r;++i)\n#define rep(...) overload(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(i,a) for(ll i=(ll)a-1;i>=0;--i)\n#define rrep2(i,a,b) for(ll i=(ll)b-1;i>=(ll)a;--i)\n#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)\n#define all(x) (x).begin(),(x).end()\n#define rall(x) (x).rbegin(),(x).rend()\n#define pb push_back\n#define eb emplace_back\nusing namespace std;\nusing ll=long long;\nusing ull=unsigned long long;\nusing ld=long double;\ntemplate<typename T,typename U>inline bool chmin(T&a,const U&b){return (a>b?a=b,true:false);}\ntemplate<typename T,typename U>inline bool chmax(T&a,const U&b){return (a<b?a=b,true:false);}\nstatic constexpr ll mod1=998244353;\nstatic constexpr ll mod=1000000007;\nstatic constexpr ll inf=numeric_limits<ll>::max()/2;\ntemplate<class T>\nstruct SegmentTreeBeats{\n private:\n static constexpr T INF=numeric_limits<T>::max();\n struct S{\n T sum=0,b1=0,s1=0,b2=-INF,s2=INF,b_cnt=1,s_cnt=1,add=0;\n S(){}\n S(const T&a):sum(a),b1(a),s1(a){}\n };\n vector<S>seq;\n int size=1,idx=0;\n void update(int k){\n S&s=seq[k];\n S&l=seq[2*k];\n S&r=seq[2*k+1];\n s.sum=l.sum+r.sum;\n if(l.b1==r.b1){\n s.b1=l.b1;\n s.b2=max(l.b2,r.b2);\n s.b_cnt=l.b_cnt+r.b_cnt;\n }\n else{\n s.b1=max(l.b1,r.b1);\n s.b2=max(l.b1>r.b1?l.b2:l.b1,l.b1>r.b1?r.b1:r.b2);\n s.b_cnt=l.b1>r.b1?l.b_cnt:r.b_cnt;\n }\n if(l.s1==r.s1){\n s.s1=l.s1;\n s.s2=min(l.s2,r.s2);\n s.s_cnt=l.s_cnt+r.s_cnt;\n }\n else{\n s.s1=min(l.s1,r.s1);\n s.s2=min(l.s1>r.s1?l.s1:l.s2,l.s1>r.s1?r.s2:r.s1);\n s.s_cnt=l.s1>r.s1?r.s_cnt:l.s_cnt;\n }\n }\n void eval_add(int k,T x){\n S&s=seq[k];\n s.sum+=x<<(idx+__builtin_clz(k)-31);\n s.b1+=x,s.s1+=x;\n if(s.b2!=-INF)s.b2+=x;\n if(s.s2!=INF)s.s2+=x;\n s.add+=x;\n }\n void eval_min(int k,T x){\n S&s=seq[k];\n s.sum+=(x-s.b1)*s.b_cnt;\n if(s.s1==s.b1)s.s1=x;\n if(s.s2==s.b1)s.s2=x;\n s.b1=x;\n }\n void eval_max(int k,T x){\n S&s=seq[k];\n s.sum+=(x-s.s1)*s.s_cnt;\n if(s.b1==s.s1)s.b1=x;\n if(s.b2==s.s1)s.b2=x;\n s.s1=x;\n }\n void eval(int k){\n S&s=seq[k];\n if(s.add!=0){\n eval_add(k*2,s.add);\n eval_add(k*2+1,s.add);\n s.add=0;\n }\n if(s.b1<seq[2*k].b1)eval_min(2*k,s.b1);\n if(s.s1>seq[2*k].s1)eval_max(2*k,s.s1);\n if(s.b1<seq[2*k+1].b1)eval_min(2*k+1,s.b1);\n if(s.s1>seq[2*k+1].s1)eval_max(2*k+1,s.s1);\n }\n void apply_min(int k,T x){\n if(seq[k].b1<=x)return;\n if(seq[k].b2<x){\n eval_min(k,x);\n return;\n }\n eval(k);\n apply_min(2*k,x);\n apply_min(2*k+1,x);\n update(k);\n }\n void apply_max(int k,T x){\n if(seq[k].s1>=x)return;\n if(seq[k].s2>x){\n eval_max(k,x);\n return;\n }\n eval(k);\n apply_max(2*k,x);\n apply_max(2*k+1,x);\n update(k);\n }\n void inner_chmin(int l,int r,T x){\n if(l==r)return;\n l+=size,r+=size;\n for(int i=idx;i>=1;i--){\n if(((l>>i)<<i)!=l)eval(l>>i);\n if(((r>>i)<<i)!=r)eval(r>>i);\n }\n int l2=l,r2=r;\n while(l<r){\n if(l&1)apply_min(l++,x);\n if(r&1)apply_min(--r,x);\n l>>=1;\n r>>=1;\n }\n l=l2,r=r2;\n for(int i=1;i<=idx;i++){\n if(((l>>i)<<i)!=l)update(l>>i);\n if(((r>>i)<<i)!=r)update(r>>i);\n }\n }\n void inner_chmax(int l,int r,T x){\n if(l==r)return;\n l+=size,r+=size;\n for(int i=idx;i>=1;i--){\n if(((l>>i)<<i)!=l)eval(l>>i);\n if(((r>>i)<<i)!=r)eval(r>>i);\n }\n int l2=l,r2=r;\n while(l<r){\n if(l&1)apply_max(l++,x);\n if(r&1)apply_max(--r,x);\n l>>=1;\n r>>=1;\n }\n l=l2,r=r2;\n for(int i=1;i<=idx;i++){\n if(((l>>i)<<i)!=l)update(l>>i);\n if(((r>>i)<<i)!=r)update(r>>i);\n }\n }\n void inner_add(int l,int r,T x){\n if(l==r)return;\n l+=size,r+=size;\n for(int i=idx;i>=1;i--){\n if(((l>>i)<<i)!=l)eval(l>>i);\n if(((r>>i)<<i)!=r)eval(r>>i);\n }\n int l2=l,r2=r;\n while(l<r){\n if(l&1)eval_add(l++,x);\n if(r&1)eval_add(--r,x);\n l>>=1;\n r>>=1;\n }\n l=l2,r=r2;\n for(int i=1;i<=idx;i++){\n if(((l>>i)<<i)!=l)update(l>>i);\n if(((r>>i)<<i)!=r)update(r>>i);\n }\n }\n void inner_update(int l,int r,T x){\n if(l==r)return;\n l+=size,r+=size;\n for(int i=idx;i>=1;i--){\n if(((l>>i)<<i)!=l)eval(l>>i);\n if(((r>>i)<<i)!=r)eval(r>>i);\n }\n int l2=l,r2=r;\n while(l<r){\n if(l&1)apply_min(l++,x),apply_max(l,x);\n if(r&1)apply_min(--r,x),apply_max(r,x);\n l>>=1;\n r>>=1;\n }\n l=l2,r=r2;\n for(int i=1;i<=idx;i++){\n if(((l>>i)<<i)!=l)update(l>>i);\n if(((r>>i)<<i)!=r)update(r>>i);\n }\n }\n T inner_min(int l,int r){\n if(l==r)return INF;\n T sml=INF,smr=INF;\n l+=size,r+=size;\n for(int i=idx;i>=1;i--){\n if(((l>>i)<<i)!=l)eval(l>>i);\n if(((r>>i)<<i)!=r)eval(r>>i);\n }\n while(l<r){\n if(l&1)sml=min(sml,seq[l++].s1);\n if(r&1)smr=min(seq[--r].s1,smr);\n l>>=1,r>>=1;\n }\n return min(sml,smr);\n }\n T inner_max(int l,int r){\n if(l==r)return -INF;\n T sml=-INF,smr=-INF;\n l+=size,r+=size;\n for(int i=idx;i>=1;i--){\n if(((l>>i)<<i)!=l)eval(l>>i);\n if(((r>>i)<<i)!=r)eval(r>>i);\n }\n while(l<r){\n if(l&1)sml=max(sml,seq[l++].b1);\n if(r&1)smr=max(seq[--r].b1,smr);\n l>>=1,r>>=1;\n }\n return max(sml,smr);\n }\n T inner_sum(int l,int r){\n if(l==r)return 0;\n T sml=0,smr=0;\n l+=size,r+=size;\n for(int i=idx;i>=1;i--){\n if(((l>>i)<<i)!=l)eval(l>>i);\n if(((r>>i)<<i)!=r)eval(r>>i);\n }\n while(l<r){\n if(l&1)sml+=seq[l++].sum;\n if(r&1)smr+=seq[--r].sum;\n l>>=1,r>>=1;\n }\n return sml+smr;\n }\n public:\n SegmentTreeBeats(){}\n SegmentTreeBeats(int n):SegmentTreeBeats(vector<T>(n)){}\n SegmentTreeBeats(const vector<T>&v){\n const int n=v.size();\n while(size<n)size<<=1,idx++;\n seq.resize(2*size);\n for(int i=0;i<n;i++)seq[i+size]=v[i];\n for(int i=size-1;i;i--)update(i);\n }\n void range_chmin(int l,int r,T x){inner_chmin(l,r,x);}\n void range_chmax(int l,int r,T x){inner_chmax(l,r,x);}\n void range_add(int l,int r,T x){inner_add(l,r,x);}\n void range_update(int l,int r,T x){inner_update(l,r,x);}\n T range_min(int l,int r){return inner_min(l,r);}\n T range_max(int l,int r){return inner_max(l,r);}\n T range_sum(int l,int r){return inner_sum(l,r);}\n};\nint main(){\n\tint n;cin>>n;\n\tvector<ll>c(n);\n\tfor(auto&e:c)cin>>e;\n\tll m;cin>>m;\n\tSegmentTreeBeats<ll>seg(c);\n\t//rep(i,n)cerr<<seg.range_sum(i,i+1)<<\" \";\n\t//cerr<<endl;\n\twhile(m--){\n\t\tll t,a,b,d;cin>>t>>a>>b>>d;\n\t\ta--;\n\t\tif(t==1){\n\t\t\tseg.range_add(a,b,d);\n\t\t}\n\t\telse if(t==2){\n\t\t\tll sum=seg.range_sum(a,b);\n\t\t\tseg.range_add(a,b,-d);\n\t\t\tseg.range_chmax(a,b,0);\n\t\t\tsum-=seg.range_sum(a,b);\n\t\t\tcout<<sum<<endl;\n\t\t}\n\t}\n\t\n}", "accuracy": 1, "time_ms": 240, "memory_kb": 20328, "score_of_the_acc": -0.8896, "final_rank": 11 }, { "submission_id": "aoj_0427_6256125", "code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\n#include<queue>\n#include<stack>\n#include<map>\n#include<set>\n#include<algorithm>\n#include<functional>\n#include<cstdio>\n#include<cstdlib>\n#include<cmath>\n#include<cassert>\n#include<ctime>\nusing namespace std;\n\n#define mind(a,b) (a>b?b:a)\n#define maxd(a,b) (a>b?a:b)\n#define absd(x) (x<0?-(x):x)\n#define pow2(x) ((x)*(x))\n#define rep(i,n) for(int i=0; i<n; ++i)\n#define repr(i,n) for(int i=n-1; i>=0; --i)\n#define repl(i,s,n) for(int i=s; i<=n; ++i)\n#define replr(i,s,n) for(int i=n; i>=s; --i)\n#define repf(i,s,n,j) for(int i=s; i<=n; i+=j)\n#define repe(e,obj) for(auto e : obj)\n\n#define SP << \" \" <<\n#define COL << \" : \" <<\n#define COM << \", \" <<\n#define ARR << \" -> \" <<\n#define PNT(STR) cout << STR << endl\n#define POS(X,Y) \"(\" << X << \", \" << Y << \")\"\n#define DEB(A) \" (\" << #A << \") \" << A\n#define DEBREP(i,n,val) for(int i=0; i<n; ++i) cout << val << \" \"; cout << endl\n#define ALL(V) (V).begin(), (V).end()\n#define INF 1000000007\n#define INFLL 1000000000000000007LL\n#define EPS 1e-9\n\ntypedef unsigned int uint;\ntypedef unsigned long ulong;\ntypedef unsigned long long ull;\ntypedef long long ll;\ntypedef long double ld;\n#define P_TYPE int\ntypedef pair<P_TYPE, P_TYPE> P;\ntypedef pair<P, P_TYPE> PI;\ntypedef pair<P_TYPE, P> IP;\ntypedef pair<P, P> PP;\ntypedef priority_queue<P, vector<P>, greater<P> > pvqueue;\n\n#define N 100000\n\nclass SegmentTree {\n const ll inf = 1e18;\n\n int n0;\n ll min_v[N*4], smin_v[N*4], min_c[N*4], lazy[N*4];\n ll sum[N*4];\n ll sz[N*4];\n\n void update_min(int k, ll x) {\n sum[k] += (x - min_v[k]) * min_c[k];\n min_v[k] = x;\n }\n\n void lazy_add(int k, ll x) {\n min_v[k] += x;\n smin_v[k] += x;\n lazy[k] += x;\n sum[k] += x * sz[k];\n }\n\n void push(int k) {\n if(n0 <= k) return;\n\n if(lazy[k]) {\n lazy_add(2*k, lazy[k]);\n lazy_add(2*k+1, lazy[k]);\n lazy[k] = 0;\n }\n\n if(min_v[2*k] < min_v[k]) {\n update_min(2*k, min_v[k]);\n }\n if(min_v[2*k+1] < min_v[k]) {\n update_min(2*k+1, min_v[k]);\n }\n }\n\n void update(int k) {\n if(n0 <= k) return;\n\n sum[k] = sum[2*k] + sum[2*k+1];\n if(min_v[2*k] < min_v[2*k+1]) {\n min_v[k] = min_v[2*k];\n smin_v[k] = min(smin_v[2*k], min_v[2*k+1]);\n min_c[k] = min_c[2*k];\n } else if(min_v[2*k] > min_v[2*k+1]) {\n min_v[k] = min_v[2*k+1];\n smin_v[k] = min(min_v[2*k], smin_v[2*k+1]);\n min_c[k] = min_c[2*k+1];\n } else {\n min_v[k] = min_v[2*k];\n smin_v[k] = min(smin_v[2*k], smin_v[2*k+1]);\n min_c[k] = min_c[2*k] + min_c[2*k+1];\n }\n }\n\n ll _query(ll x, int k) {\n push(k);\n if(x <= min_v[k]) {\n lazy_add(k, -x);\n return x * sz[k];\n }\n if(x < smin_v[k]) {\n lazy_add(k, -x);\n ll res = x * sz[k] + min_v[k] * min_c[k];\n update_min(k, 0);\n return res;\n }\n\n ll lv = _query(x, 2*k);\n ll rv = _query(x, 2*k+1);\n update(k);\n return lv + rv;\n }\n\n ll _range_query(ll x, int a, int b, int k, int l, int r) {\n if(a <= l && r <= b) {\n return _query(x, k);\n } else if(r <= a || b <= l) {\n return 0;\n }\n\n push(k);\n ll lv = _range_query(x, a, b, 2*k, l, (l+r)/2);\n ll rv = _range_query(x, a, b, 2*k+1, (l+r)/2, r);\n update(k);\n return lv + rv;\n }\n\n void _range_add(ll x, int a, int b, int k, int l, int r) {\n push(k);\n if(a <= l && r <= b) {\n lazy_add(k, x);\n return;\n } else if(r <= a || b <= l) {\n return;\n }\n _range_add(x, a, b, 2*k, l, (l+r)/2);\n _range_add(x, a, b, 2*k+1, (l+r)/2, r);\n update(k);\n }\n\npublic:\n SegmentTree(int n, ll *a) {\n n0 = 1;\n while(n0 < n) n0 <<= 1;\n rep(i, 2*n0) lazy[i] = sum[i] = sz[i] = 0, min_v[i] = smin_v[i] = inf;\n rep(i, n) min_v[n0+i] = sum[n0+i] = a[i], min_c[n0+i] = sz[n0+i] = 1;\n repr(i, n0) update(i), sz[i] = sz[2*i] + sz[2*i+1];\n }\n\n ll range_query(int l, int r, ll x) {\n return _range_query(x, l, r, 1, 0, n0);\n }\n\n void range_add(int l, int r, ll x) {\n _range_add(x, l, r, 1, 0, n0);\n }\n};\n\nint main() {\n int n, m;\n ll a[N];\n cin >> n;\n rep(i, n) cin >> a[i];\n SegmentTree st(n, a);\n cin >> m;\n rep(_, m) {\n int t, a, b, d;\n cin >> t >> a >> b >> d;\n switch(t) {\n case 1:\n st.range_add(a-1, b, d);\n break;\n case 2:\n cout << st.range_query(a-1, b, d) << endl;\n break;\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 180, "memory_kb": 22812, "score_of_the_acc": -0.8614, "final_rank": 10 }, { "submission_id": "aoj_0427_6047533", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n// Segment Tree Beats\n// - l<=i<r について、 A_i の値を min(A_i, x) に更新\n// - l<=i<r について、 A_i の値を max(A_i, x) に更新\n// - l<=i<r の中の A_i の最大値を求める\n// - l<=i<r の中の A_i の最小値を求める\n// - l<=i<r の A_i の和を求める\n// - l<=i<r について、 A_i の値に x を加える\n// - l<=i<r について、 A_i の値を x に更新\n\n#define N 100000\n\nclass SegmentTree {\n const ll inf = 1e18;\n int n, n0;\n ll max_v[4*N], smax_v[4*N], max_c[4*N];\n ll min_v[4*N], smin_v[4*N], min_c[4*N];\n ll sum[4*N];\n ll len[4*N], ladd[4*N], lval[4*N];\n\n void update_node_max(int k, ll x) {\n sum[k] += (x - max_v[k]) * max_c[k];\n\n if(max_v[k] == min_v[k]) {\n max_v[k] = min_v[k] = x;\n } else if(max_v[k] == smin_v[k]) {\n max_v[k] = smin_v[k] = x;\n } else {\n max_v[k] = x;\n }\n\n if(lval[k] != inf && x < lval[k]) {\n lval[k] = x;\n }\n }\n void update_node_min(int k, ll x) {\n sum[k] += (x - min_v[k]) * min_c[k];\n\n if(max_v[k] == min_v[k]) {\n max_v[k] = min_v[k] = x;\n } else if(smax_v[k] == min_v[k]) {\n min_v[k] = smax_v[k] = x;\n } else {\n min_v[k] = x;\n }\n\n if(lval[k] != inf && lval[k] < x) {\n lval[k] = x;\n }\n }\n\n void push(int k) {\n\n if(n0-1 <= k) return;\n\n if(lval[k] != inf) {\n updateall(2*k+1, lval[k]);\n updateall(2*k+2, lval[k]);\n lval[k] = inf;\n return;\n }\n\n if(ladd[k] != 0) {\n addall(2*k+1, ladd[k]);\n addall(2*k+2, ladd[k]);\n ladd[k] = 0;\n }\n\n if(max_v[k] < max_v[2*k+1]) {\n update_node_max(2*k+1, max_v[k]);\n }\n if(min_v[2*k+1] < min_v[k]) {\n update_node_min(2*k+1, min_v[k]);\n }\n\n if(max_v[k] < max_v[2*k+2]) {\n update_node_max(2*k+2, max_v[k]);\n }\n if(min_v[2*k+2] < min_v[k]) {\n update_node_min(2*k+2, min_v[k]);\n }\n }\n\n void update(int k) {\n sum[k] = sum[2*k+1] + sum[2*k+2];\n\n if(max_v[2*k+1] < max_v[2*k+2]) {\n max_v[k] = max_v[2*k+2];\n max_c[k] = max_c[2*k+2];\n smax_v[k] = max(max_v[2*k+1], smax_v[2*k+2]);\n } else if(max_v[2*k+1] > max_v[2*k+2]) {\n max_v[k] = max_v[2*k+1];\n max_c[k] = max_c[2*k+1];\n smax_v[k] = max(smax_v[2*k+1], max_v[2*k+2]);\n } else {\n max_v[k] = max_v[2*k+1];\n max_c[k] = max_c[2*k+1] + max_c[2*k+2];\n smax_v[k] = max(smax_v[2*k+1], smax_v[2*k+2]);\n }\n\n if(min_v[2*k+1] < min_v[2*k+2]) {\n min_v[k] = min_v[2*k+1];\n min_c[k] = min_c[2*k+1];\n smin_v[k] = min(smin_v[2*k+1], min_v[2*k+2]);\n } else if(min_v[2*k+1] > min_v[2*k+2]) {\n min_v[k] = min_v[2*k+2];\n min_c[k] = min_c[2*k+2];\n smin_v[k] = min(min_v[2*k+1], smin_v[2*k+2]);\n } else {\n min_v[k] = min_v[2*k+1];\n min_c[k] = min_c[2*k+1] + min_c[2*k+2];\n smin_v[k] = min(smin_v[2*k+1], smin_v[2*k+2]);\n }\n }\n\n void _update_min(ll x, int a, int b, int k, int l, int r) {\n if(b <= l || r <= a || max_v[k] <= x) {\n return;\n }\n if(a <= l && r <= b && smax_v[k] < x) {\n update_node_max(k, x);\n return;\n }\n\n push(k);\n _update_min(x, a, b, 2*k+1, l, (l+r)/2);\n _update_min(x, a, b, 2*k+2, (l+r)/2, r);\n update(k);\n }\n\n void _update_max(ll x, int a, int b, int k, int l, int r) {\n if(b <= l || r <= a || x <= min_v[k]) {\n return;\n }\n if(a <= l && r <= b && x < smin_v[k]) {\n update_node_min(k, x);\n return;\n }\n\n push(k);\n _update_max(x, a, b, 2*k+1, l, (l+r)/2);\n _update_max(x, a, b, 2*k+2, (l+r)/2, r);\n update(k);\n }\n\n void addall(int k, ll x) {\n max_v[k] += x;\n if(smax_v[k] != -inf) smax_v[k] += x;\n min_v[k] += x;\n if(smin_v[k] != inf) smin_v[k] += x;\n\n sum[k] += len[k] * x;\n if(lval[k] != inf) {\n lval[k] += x;\n } else {\n ladd[k] += x;\n }\n }\n\n void updateall(int k, ll x) {\n max_v[k] = x; smax_v[k] = -inf;\n min_v[k] = x; smin_v[k] = inf;\n max_c[k] = min_c[k] = len[k];\n\n sum[k] = x * len[k];\n lval[k] = x; ladd[k] = 0;\n }\n\n void _add_val(ll x, int a, int b, int k, int l, int r) {\n if(b <= l || r <= a) {\n return;\n }\n if(a <= l && r <= b) {\n addall(k, x);\n return;\n }\n\n push(k);\n _add_val(x, a, b, 2*k+1, l, (l+r)/2);\n _add_val(x, a, b, 2*k+2, (l+r)/2, r);\n update(k);\n }\n\n void _update_val(ll x, int a, int b, int k, int l, int r) {\n if(b <= l || r <= a) {\n return;\n }\n if(a <= l && r <= b) {\n updateall(k, x);\n return;\n }\n\n push(k);\n _update_val(x, a, b, 2*k+1, l, (l+r)/2);\n _update_val(x, a, b, 2*k+2, (l+r)/2, r);\n update(k);\n }\n\n ll _query_max(int a, int b, int k, int l, int r) {\n if(b <= l || r <= a) {\n return -inf;\n }\n if(a <= l && r <= b) {\n return max_v[k];\n }\n push(k);\n ll lv = _query_max(a, b, 2*k+1, l, (l+r)/2);\n ll rv = _query_max(a, b, 2*k+2, (l+r)/2, r);\n return max(lv, rv);\n }\n\n ll _query_min(int a, int b, int k, int l, int r) {\n if(b <= l || r <= a) {\n return inf;\n }\n if(a <= l && r <= b) {\n return min_v[k];\n }\n push(k);\n ll lv = _query_min(a, b, 2*k+1, l, (l+r)/2);\n ll rv = _query_min(a, b, 2*k+2, (l+r)/2, r);\n return min(lv, rv);\n }\n\n ll _query_sum(int a, int b, int k, int l, int r) {\n if(b <= l || r <= a) {\n return 0;\n }\n if(a <= l && r <= b) {\n return sum[k];\n }\n push(k);\n ll lv = _query_sum(a, b, 2*k+1, l, (l+r)/2);\n ll rv = _query_sum(a, b, 2*k+2, (l+r)/2, r);\n return lv + rv;\n }\n\npublic:\n SegmentTree(int n) {\n SegmentTree(n, nullptr);\n }\n\n SegmentTree(int n, ll *a) : n(n) {\n n0 = 1;\n while(n0 < n) n0 <<= 1;\n\n for(int i=0; i<2*n0; ++i) ladd[i] = 0, lval[i] = inf;\n len[0] = n0;\n for(int i=0; i<n0-1; ++i) len[2*i+1] = len[2*i+2] = (len[i] >> 1);\n\n for(int i=0; i<n; ++i) {\n max_v[n0-1+i] = min_v[n0-1+i] = sum[n0-1+i] = (a != nullptr ? a[i] : 0);\n smax_v[n0-1+i] = -inf;\n smin_v[n0-1+i] = inf;\n max_c[n0-1+i] = min_c[n0-1+i] = 1;\n }\n\n for(int i=n; i<n0; ++i) {\n max_v[n0-1+i] = smax_v[n0-1+i] = -inf;\n min_v[n0-1+i] = smin_v[n0-1+i] = inf;\n max_c[n0-1+i] = min_c[n0-1+i] = 0;\n }\n for(int i=n0-2; i>=0; i--) {\n update(i);\n }\n }\n\n // range minimize query\n void update_min(int a, int b, ll x) {\n _update_min(x, a, b, 0, 0, n0);\n }\n\n // range maximize query\n void update_max(int a, int b, ll x) {\n _update_max(x, a, b, 0, 0, n0);\n }\n\n // range add query\n void add_val(int a, int b, ll x) {\n _add_val(x, a, b, 0, 0, n0);\n }\n\n // range update query\n void update_val(int a, int b, ll x) {\n _update_val(x, a, b, 0, 0, n0);\n }\n\n // range minimum query\n ll query_max(int a, int b) {\n return _query_max(a, b, 0, 0, n0);\n }\n\n // range maximum query\n ll query_min(int a, int b) {\n return _query_min(a, b, 0, 0, n0);\n }\n\n // range sum query\n ll query_sum(int a, int b) {\n return _query_sum(a, b, 0, 0, n0);\n }\n};\n\n#define rep(i,n) for(int i=0;i<n;i++)\n\nint main(){\n int n;\n cin >> n;\n ll c[n];\n rep(i,n)cin >> c[i];\n SegmentTree seg(n,c);\n int m;\n cin >> m;\n while(m--){\n int com,a,b,d;\n cin >> com >> a >> b >> d;\n a--;\n if(com==1){\n seg.add_val(a,b,d);\n }\n else{\n ll x=seg.query_sum(a,b);\n seg.add_val(a,b,-d);\n seg.update_max(a,b,0);\n cout << x-seg.query_sum(a,b) << '\\n';\n }\n }\n}", "accuracy": 1, "time_ms": 270, "memory_kb": 35304, "score_of_the_acc": -1.5532, "final_rank": 16 }, { "submission_id": "aoj_0427_6041421", "code_snippet": "#include <bits/stdc++.h>\n\nusing ll = long long;\n\ntemplate <class T> using Vec = std::vector<T>;\n\nconstexpr int INF = 1000000000;\n\nstruct Monoid {\n ll sum;\n int min, all, cnt, sec;\n Monoid() : sum(0), min(INF), all(0), cnt(0), sec(INF) {}\n Monoid(const int x) : sum(x), min(x), all(1), cnt(1), sec(INF) {}\n Monoid operator+(const Monoid& other) const {\n Monoid ret;\n ret.sum = sum + other.sum;\n ret.all = all + other.all;\n if (min < other.min) {\n ret.min = min;\n ret.cnt = cnt;\n ret.sec = std::min(sec, other.min);\n } else if (min > other.min) {\n ret.min = other.min;\n ret.cnt = other.cnt;\n ret.sec = std::min(other.sec, min);\n } else {\n ret.min = min;\n ret.cnt = cnt + other.cnt;\n ret.sec = std::min(sec, other.sec);\n }\n return ret;\n }\n};\n\nstruct Effector {\n int add, lowb;\n Effector(const int add = 0, const int lowb = -INF) : add(add), lowb(lowb) {}\n Effector operator+(const Effector& other) const {\n return Effector(add + other.add, std::max((lowb == -INF ? -INF : lowb + other.add), other.lowb));\n }\n};\n\nstd::optional<Monoid> mapping(Monoid m, const Effector& e) {\n if (m.all == 0) return m;\n m.sum += (ll)m.all * e.add;\n m.min += e.add;\n if (m.sec != INF) m.sec += e.add;\n if (m.min >= e.lowb) return m; \n if (m.sec <= e.lowb) return std::nullopt;\n m.sum += (ll)m.cnt * (e.lowb - m.min);\n m.min = e.lowb;\n return m;\n}\n\nstruct Segtree {\n int size, logn;\n Vec<Monoid> data; \n Vec<Effector> lazy;\n\n void fetch(const int k) {\n data[k] = data[2 * k] + data[2 * k + 1];\n }\n\n void apply(const int k, const Effector& e) {\n if (k >= size) {\n data[k] = std::move(mapping(data[k], e).value());\n } else {\n lazy[k] = lazy[k] + e;\n const auto tmp = mapping(data[k], e);\n if (tmp) {\n data[k] = *tmp;\n } else {\n flush(k);\n fetch(k);\n }\n }\n }\n\n void flush(const int k) {\n apply(2 * k, lazy[k]);\n apply(2 * k + 1, lazy[k]);\n lazy[k] = Effector();\n }\n\n void push(const int k) {\n const int lsb = __builtin_ctz(k);\n for (int d = logn; d > lsb; --d) {\n flush(k >> d);\n }\n }\n\n void pull(int k) {\n k >>= __builtin_ctz(k);\n while (k > 1) {\n k >>= 1;\n fetch(k);\n }\n }\n\n Segtree(const Vec<Monoid>& vec) {\n const int n = (int)vec.size();\n logn = 0, size = 1;\n while (size < n) {\n logn += 1;\n size <<= 1;\n }\n data.resize(2 * size);\n lazy.resize(size);\n for (int i = 0; i < n; ++i) {\n data[i + size] = vec[i];\n }\n for (int i = size - 1; i > 0; --i) {\n fetch(i);\n }\n }\n\n void operate(int l, int r, const Effector& e) {\n l += size;\n r += size;\n push(l);\n push(r);\n const int lc = l, rc = r;\n while (l < r) {\n if (l & 1) apply(l++, e);\n if (r & 1) apply(--r, e);\n l >>= 1;\n r >>= 1;\n }\n pull(lc);\n pull(rc);\n }\n\n Monoid fold(int l, int r) {\n l += size;\n r += size;\n push(l);\n push(r);\n Monoid ret;\n while (l < r) {\n if (l & 1) ret = ret + data[l++];\n if (r & 1) ret = ret + data[--r];\n l >>= 1;\n r >>= 1;\n }\n return ret;\n }\n};\n\nint main() {\n int N;\n std::cin >> N;\n Vec<Monoid> vec(N);\n for (int i = 0; i < N; ++i) {\n int x;\n std::cin >> x;\n vec[i] = x;\n }\n Segtree seg(vec);\n int M;\n std::cin >> M;\n while (M--) {\n int t, a, b, x;\n std::cin >> t >> a >> b >> x;\n a -= 1;\n if (t == 1) {\n seg.operate(a, b, Effector(x));\n } else {\n ll ans = seg.fold(a, b).sum;\n seg.operate(a, b, Effector(-x, 0));\n ans -= seg.fold(a, b).sum;\n std::cout << ans << '\\n';\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 350, "memory_kb": 12756, "score_of_the_acc": -0.8203, "final_rank": 8 }, { "submission_id": "aoj_0427_5192172", "code_snippet": "#ifndef ATCODER_INTERNAL_BITOP_HPP\n#define ATCODER_INTERNAL_BITOP_HPP 1\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param n `0 <= n`\n// @return minimum non-negative `x` s.t. `n <= 2**x`\nint ceil_pow2(int n) {\n int x = 0;\n while ((1U << x) < (unsigned int)(n)) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nint bsf(unsigned int n) {\n#ifdef _MSC_VER\n unsigned long index;\n _BitScanForward(&index, n);\n return index;\n#else\n return __builtin_ctz(n);\n#endif\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n#endif // ATCODER_INTERNAL_BITOP_HPP\n#ifndef ATCODER_LAZYSEGTREE_HPP\n#define ATCODER_LAZYSEGTREE_HPP 1\n\n#include <algorithm>\n#include <cassert>\n#include <iostream>\n#include <vector>\n\n// #include \"atcoder/internal_bit\"\n\nnamespace atcoder {\n\ntemplate <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S), F (*composition)(F, F), F (*id)()>\nstruct lazy_segtree {\npublic:\n lazy_segtree() : lazy_segtree(0) {}\n lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}\n lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {\n log = internal::ceil_pow2(_n);\n size = 1 << log;\n d = std::vector<S>(2 * size, e());\n lz = std::vector<F>(size, id());\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) { update(i); }\n }\n\n void set(int p, S x) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n\n S get(int p) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n return d[p];\n }\n\n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return e();\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push(r >> i);\n }\n\n S sml = e(), smr = e();\n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n\n return op(sml, smr);\n }\n\n S all_prod() { return d[1]; }\n\n void apply(int p, F f) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = mapping(f, d[p]);\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n void apply(int l, int r, F f) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return;\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n {\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) all_apply(l++, f);\n if (r & 1) all_apply(--r, f);\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n }\n\n for (int i = 1; i <= log; i++) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n\n template <bool (*g)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return g(x); });\n }\n template <class G> int max_right(int l, G g) {\n assert(0 <= l && l <= _n);\n assert(g(e()));\n if (l == _n) return _n;\n l += size;\n for (int i = log; i >= 1; i--) push(l >> i);\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!g(op(sm, d[l]))) {\n while (l < size) {\n push(l);\n l = (2 * l);\n if (g(op(sm, d[l]))) {\n sm = op(sm, d[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = op(sm, d[l]);\n l++;\n } while ((l & -l) != l);\n return _n;\n }\n\n template <bool (*g)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return g(x); });\n }\n template <class G> int min_left(int r, G g) {\n assert(0 <= r && r <= _n);\n assert(g(e()));\n if (r == 0) return 0;\n r += size;\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!g(op(d[r], sm))) {\n while (r < size) {\n push(r);\n r = (2 * r + 1);\n if (g(op(d[r], sm))) {\n sm = op(d[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = op(d[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n\nprotected: // Modified\n int _n, size, log;\n std::vector<S> d;\n std::vector<F> lz;\n\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n virtual void all_apply(int k, F f) { // Modified\n d[k] = mapping(f, d[k]);\n if (k < size) lz[k] = composition(f, lz[k]);\n }\n void push(int k) {\n all_apply(2 * k, lz[k]);\n all_apply(2 * k + 1, lz[k]);\n lz[k] = id();\n }\n};\n} // namespace atcoder\n#endif // ATCODER_LAZYSEGTREE_HPP\n\n// Reference: https://atcoder.github.io/ac-library/document_ja/lazysegtree.html\n// https://betrue12.hateblo.jp/entry/2020/09/22/194541\n// https://betrue12.hateblo.jp/entry/2020/09/23/005940\n/*\nstruct S {};\nS op(S l, S r) {\n return {};\n}\nS e() { return {}; };\nusing F = bool;\nS mp(F f, S x) {\n return x;\n}\nF composition(F fnew, F gold) { return fnew ^ gold; }\nF id() { return false; }\n\nvector<S> A;\natcoder::lazy_segtree<S, op, e, F, mp, composition, id> seg(A);\n*/\ntemplate <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S), F (*composition)(F, F), F (*id)()>\nclass segtree_beats : public atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> {\n using Base = atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>;\n using Base::lazy_segtree;\n void all_apply(int k, F f) override {\n Base::d[k] = mapping(f, Base::d[k]);\n if (k < Base::size) {\n Base::lz[k] = composition(f, Base::lz[k]);\n if (Base::d[k].fail) Base::push(k), Base::update(k);\n }\n }\n};\n// Verified: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0427\nnamespace RangeAddChmaxRangeSum {\n#include <algorithm>\n\ntemplate <typename Num> inline Num second_lowest(Num a, Num a2, Num c, Num c2) noexcept { // a < a2, c < c2\n return a == c ? std::min(a2, c2) : a2 <= c ? a2 : c2 <= a ? c2 : std::max(a, c);\n}\nusing Num = int;\nconstexpr Num INF = 1 << 30;\n\nstruct S {\n Num lo, lo2, sum;\n unsigned sz, nlo;\n bool fail;\n S() : lo(INF), lo2(INF), sum(0), sz(0), nlo(0), fail(false) {}\n S(Num x, unsigned sz_ = 1) : lo(x), lo2(INF), sum(Num(x) * sz_), sz(sz_), nlo(sz_), fail(false) {}\n};\n\nS e() { return S(); }\n\nS op(S l, S r) {\n S ret;\n ret.lo = std::min(l.lo, r.lo);\n ret.lo2 = second_lowest(l.lo, l.lo2, r.lo, r.lo2);\n ret.sum = l.sum + r.sum, ret.sz = l.sz + r.sz;\n ret.nlo = l.nlo * (l.lo <= r.lo) + r.nlo * (r.lo <= l.lo);\n return ret;\n}\n\nstruct F {\n Num lb, bias;\n F() : lb(-INF), bias(0) {}\n F(Num chmax_, Num add) : lb(chmax_), bias(add) {}\n static F chmax(Num x) noexcept { return F(x, Num(0)); }\n static F add(Num x) noexcept { return F(-INF, x); };\n};\n\nF composition(F fnew, F fold) {\n F ret;\n ret.lb = std::max(fold.lb + fold.bias, fnew.lb) - fold.bias;\n ret.bias = fold.bias + fnew.bias;\n return ret;\n}\n\nF id() { return F(); }\nS mapping(F f, S x) {\n if (x.sz == 0) return e();\n if (f.lb < x.lo2) {\n Num nxt_lo = std::max(x.lo, f.lb);\n x.sum += (nxt_lo - x.lo) * x.nlo + f.bias * x.sz;\n x.lo = nxt_lo + f.bias, x.lo2 += f.bias;\n return x;\n }\n x.fail = 1;\n return x;\n}\nusing segtree = segtree_beats<S, op, e, F, mapping, composition, id>;\n} // namespace RangeAddChmaxRangeSum\n#define PROBLEM \"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0427\"\n#include <iostream>\nusing namespace std;\n\nint main() {\n cin.tie(nullptr), ios::sync_with_stdio(false);\n\n int N, tmp;\n cin >> N;\n vector<RangeAddChmaxRangeSum::S> A(N);\n for (auto &a : A) cin >> tmp, a = tmp;\n\n RangeAddChmaxRangeSum::segtree segtree(A);\n\n int Q, q, l, r, d;\n cin >> Q;\n\n while (Q--) {\n cin >> q >> l >> r >> d;\n l--;\n if (q == 1) {\n segtree.apply(l, r, RangeAddChmaxRangeSum::F::add(d));\n } else {\n auto before = segtree.prod(l, r).sum;\n auto f1 = RangeAddChmaxRangeSum::F::add(-d);\n auto f2 = RangeAddChmaxRangeSum::F::chmax(0);\n segtree.apply(l, r, RangeAddChmaxRangeSum::composition(f2, f1));\n auto after = segtree.prod(l, r).sum;\n cout << before - after << '\\n';\n }\n }\n}", "accuracy": 1, "time_ms": 330, "memory_kb": 12364, "score_of_the_acc": -0.7621, "final_rank": 7 }, { "submission_id": "aoj_0427_5191953", "code_snippet": "//*\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n//*/\n \n#include <bits/stdc++.h>\n \n// #include <atcoder/all>\n \nusing namespace std;\n// using namespace atcoder;\n \n#define DEBUG(x) cerr<<#x<<\": \"<<x<<endl;\n#define DEBUG_VEC(v) cerr<<#v<<\":\";for(int i=0;i<v.size();i++) cerr<<\" \"<<v[i]; cerr<<endl;\n#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<\" \";}cerr<<endl;}\ntypedef long long ll;\n// #define int ll\n \n#define vi vector<int>\n#define vl vector<ll>\n#define vii vector< vector<int> >\n#define vll vector< vector<ll> >\n#define vs vector<string>\n#define pii pair<int,int>\n#define pis pair<int,string>\n#define psi pair<string,int>\n#define pll pair<ll,ll>\ntemplate<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }\ntemplate<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }\ntemplate<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << \"(\" << p.first << \", \" << p.second << \")\"; return os; }\n#define X first\n#define Y second\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define rep1(i,n) for(int i=1;i<=(int)(n);i++)\n#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)\n#define rrep1(i,n) for(int i=(int)(n);i>0;i--)\n#define REP(i,a,b) for(int i=a;i<b;i++)\n#define in(x, a, b) (a <= x && x < b)\n#define all(c) c.begin(),c.end()\nvoid YES(bool t=true) {cout<<(t?\"YES\":\"NO\")<<endl;}\nvoid Yes(bool t=true) {cout<<(t?\"Yes\":\"No\")<<endl;}\nvoid yes(bool t=true) {cout<<(t?\"yes\":\"no\")<<endl;}\nvoid NO(bool t=true) {cout<<(t?\"NO\":\"YES\")<<endl;}\nvoid No(bool t=true) {cout<<(t?\"No\":\"Yes\")<<endl;}\nvoid no(bool t=true) {cout<<(t?\"no\":\"yes\")<<endl;}\ntemplate<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }\n#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());\nconst ll inf = 1000000001;\nconst ll INF = (ll)1e18 + 1;\nconst long double pi = 3.1415926535897932384626433832795028841971L;\nint popcount(ll t) { return __builtin_popcountll(t); }\n// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\n// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };\nvi dx = {0, 1, 0, -1}, dy = {-1, 0, 1, 0};\n// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };\nstruct Setup_io {\n Setup_io() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(25);\n }\n} setup_io;\nconst ll MOD = 1000000007;\n// const ll MOD = 998244353;\n// #define mp make_pair\n//#define endl '\\n'\n\n\nstruct Node {\n ll mi1, mi2, mi_n;\n ll sum, len;\n Node(int x=0):mi1(x), mi2(inf), mi_n(1), sum(x), len(1) {}\n};\n\nstruct Lazy {\n ll add, lb;\n Lazy():add(0), lb(-inf) {};\n};\n\ntemplate <typename T1, typename T2>\nclass LazySegmentTree {\npublic:\n using F = function<T1(T1&, T1&)>; // query_func\n using G = function<T2(T2&, T2&)>; // update_func\n using H = function<T1(T1&, T2&, int, int)>; // lazy to node (node, lazy, left, right)\n int n;\n vector<T1> node;\n vector<T2> lazy;\n T1 e1;\n T2 e2;\n F query_func;\n G update_func;\n H eval_func;\n\n LazySegmentTree(vector<T1> a, F query_func, G update_func, H eval_func, T1 e1, T2 e2)\n :query_func(query_func), update_func(update_func), eval_func(eval_func), e1(e1), e2(e2)\n {\n int _n = a.size();\n n = 1; while (n < _n) n *= 2;\n node.resize(2 * n - 1, e1);\n lazy.resize(2 * n - 1, e2);\n for (int i = 0; i < _n; i++) node[i + n - 1] = a[i];\n for (int i = n - 2; i >= 0; i--) {\n node[i] = query_func(node[i * 2 + 1], node[i * 2 + 2]);\n }\n }\n\n // k�Ԗڂ̃m�[�h�ɂ‚��Ēx���]�����s��\n inline void eval(int k, int l, int r) {\n if (lazy[k].lb != -inf or lazy[k].add != 0) { // Change\n node[k] = eval_func(node[k], lazy[k], l, r);\n if (r - l > 1) {\n lazy[2 * k + 1] = update_func(lazy[2*k + 1], lazy[k]);\n lazy[2 * k + 2] = update_func(lazy[2*k + 2], lazy[k]);\n }\n lazy[k] = e2; // Change\n }\n }\n\n // [a, b)��x�ɂ���\n void update(int a, int b, T2 x, int k, int l, int r) {\n // k �Ԗڂ̃m�[�h�ɑ΂��Ēx���]�����s��\n eval(k, l, r);\n if (b <= l || r <= a) return;\n if (a <= l && r <= b) {\n lazy[k] = update_func(lazy[k], x);\n eval(k, l, r);\n }\n else {\n update(a, b, x, 2 * k + 1, l, (l + r) / 2);\n update(a, b, x, 2 * k + 2, (l + r) / 2, r);\n node[k] = query_func(node[2 * k + 1], node[2 * k + 2]);\n }\n }\n\n// [a, b)��x�ɂ���\n void update_chmax(int a, int b, T2 x, int k, int l, int r) {\n // k �Ԗڂ̃m�[�h�ɑ΂��Ēx���]�����s��\n eval(k, l, r);\n if (b <= l || r <= a || x.lb <= node[k].mi1) return;\n if (a <= l && r <= b && x.lb < node[k].mi2) {\n lazy[k] = update_func(lazy[k], x);\n eval(k, l, r);\n }\n else {\n update_chmax(a, b, x, 2 * k + 1, l, (l + r) / 2);\n update_chmax(a, b, x, 2 * k + 2, (l + r) / 2, r);\n node[k] = query_func(node[2 * k + 1], node[2 * k + 2]);\n }\n }\n\n\n T1 query(int a, int b, int k, int l, int r) {\n eval(k, l, r);\n if (b <= l || r <= a) return e1;\n if (a <= l && r <= b) return node[k];\n T1 resl = query(a, b, 2 * k + 1, l, (l + r) / 2);\n T1 resr = query(a, b, 2 * k + 2, (l + r) / 2, r);\n return query_func(resl, resr);\n }\n};\n\nNode f(Node a, Node b) {\n Node res;\n res.sum = a.sum + b.sum;\n res.len = a.len + b.len;\n if (a.mi1 == b.mi1) {\n res.mi1 = a.mi1;\n res.mi2 = min(a.mi2, b.mi2);\n res.mi_n = a.mi_n + b.mi_n;\n }\n else {\n if (a.mi1 > b.mi1) swap(a, b);\n res.mi1 = a.mi1;\n res.mi2 = min(a.mi2, b.mi1);\n res.mi_n = a.mi_n;\n }\n return res;\n}\n\nLazy g(Lazy a, Lazy b) {\n Lazy res;\n res.lb = max(a.lb + a.add, b.lb) - a.add;\n res.add = a.add + b.add;\n return res;\n}\n\nNode h(Node a, Lazy b, int l, int r) {\n if (b.add != 0) {\n a.sum += a.len * b.add;\n a.mi1 += b.add;\n if (a.mi2 != inf) {\n a.mi2 += b.add;\n }\n if (b.lb != -inf) {\n b.lb += b.add;\n }\n\n b.add = 0;\n }\n\n if (b.lb != -inf) {\n // DEBUG(b.lb);\n // DEBUG(pll(a.mi1, a.mi2));\n assert(a.mi2 > b.lb);\n if (a.mi1 < b.lb) {\n // assert(a.mi1 <= b.lb);\n a.sum += (b.lb - a.mi1) * a.mi_n;\n a.mi1 = b.lb;\n }\n }\n return a;\n}\n\nsigned main() {\n int n, q;\n cin >> n;\n vector<Node> node(n);\n rep (i, n) {\n int x;\n cin >> x;\n node[i] = Node(x);\n }\n Node e;\n e.mi1 = -inf;\n e.mi2 = -inf + 1;\n e.sum = 0;\n e.len = 0;\n e.mi_n = 0;\n LazySegmentTree<Node, Lazy> seg(node, f, g, h, e, Lazy());\n\n cin >> q;\n while (q--) {\n int type;\n int l, r, x;\n cin >> type;\n cin >> l >> r >> x;\n l--;\n if (type == 1) {\n Lazy temp;\n temp.add = x;\n seg.update(l, r, temp, 0, 0, seg.n);\n }\n else {\n ll ori = seg.query(l, r, 0, 0, seg.n).sum;\n\n Lazy temp;\n temp.add = -x;\n seg.update(l, r, temp, 0, 0, seg.n);\n temp.add = 0;\n temp.lb = 0;\n seg.update_chmax(l, r, temp, 0, 0, seg.n);\n ll now = seg.query(l, r, 0, 0, seg.n).sum;\n \n cout << ori - now << endl;\n }\n }\n}", "accuracy": 1, "time_ms": 440, "memory_kb": 25104, "score_of_the_acc": -1.5064, "final_rank": 15 }, { "submission_id": "aoj_0427_4978758", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing LL = long long;\nusing ULL = unsigned long long;\n#define rep(i,n) for(int i=0; i<(n); i++)\n\n\nstruct segtree {\n\tstatic const LL negInf = -1000000000000000000;\n\tstatic const LL posInf = 1000000000000000000;\n\n\tstruct Node {\n\t\tLL minval, mincnt, min2, sum, add, z;\n\t\tstatic Node e() { return { posInf,0,posInf,0,0,0 }; }\n\t\tNode operator+(const Node& r) const {\n\t\t\tconst Node& l = *this;\n\t\t\tNode res = Node::e();\n\t\t\tres.minval = min(l.minval, r.minval);\n\t\t\tres.min2 = min(l.min2, r.min2);\n\t\t\tres.sum = l.sum + r.sum;\n\t\t\tres.z = l.z + r.z;\n\t\t\tif (res.minval == l.minval) res.mincnt += l.mincnt; else res.min2 = min(res.min2, l.minval);\n\t\t\tif (res.minval == r.minval) res.mincnt += r.mincnt; else res.min2 = min(res.min2, r.minval);\n\t\t\treturn res;\n\t\t}\n\t};\n\n\tint N, logN;\n\tvector<Node> V;\n\n\tvoid spread(int p) {\n\t\tif (p < N) {\n\t\t\tV[p * 2].sum -= V[p * 2].minval * V[p * 2].mincnt;\n\t\t\tV[p * 2].minval = max(V[p * 2].minval, V[p].minval - V[p * 2].add);\n\t\t\tV[p * 2].sum += V[p * 2].minval * V[p * 2].mincnt;\n\t\t\tV[p * 2].add += V[p].add;\n\t\t\tV[p * 2 + 1].sum -= V[p * 2 + 1].minval * V[p * 2 + 1].mincnt;\n\t\t\tV[p * 2 + 1].minval = max(V[p * 2 + 1].minval, V[p].minval - V[p * 2 + 1].add);\n\t\t\tV[p * 2 + 1].sum += V[p * 2 + 1].minval * V[p * 2 + 1].mincnt;\n\t\t\tV[p * 2 + 1].add += V[p].add;\n\t\t}\n\t\tif (V[p].minval != posInf) V[p].minval += V[p].add;\n\t\tif (V[p].min2 != posInf) V[p].min2 += V[p].add;\n\t\tV[p].sum += V[p].z * V[p].add;\n\t\tV[p].add = 0;\n\t}\n\n\tsegtree(vector<LL> v) {\n\t\tN = 1; logN = 0; while (N < v.size()) { N *= 2; logN++; }\n\t\tV.assign(N * 2, Node::e());\n\t\trep(i, v.size()) V[N + i] = { v[i],1,posInf,v[i],0,1 };\n\t\tfor (int i = N - 1; i >= 1; i--) V[i] = V[i * 2] + V[i * 2 + 1];\n\t}\n\n\tvoid add(int l, int r, LL v, int a = 0, int b = 0, int i = -1) {\n\t\tif (i == -1) { a = 0; b = N; i = 1; }\n\t\tspread(i);\n\t\tif (r <= a || b <= l) return;\n\t\tif (l <= a && b <= r) { V[i].add += v; spread(i); return; }\n\t\tadd(l, r, v, a, (a + b) / 2, i * 2);\n\t\tadd(l, r, v, (a + b) / 2, b, i * 2 + 1);\n\t\tV[i] = V[i * 2] + V[i * 2 + 1];\n\t}\n\n\tLL sum(int l, int r, int a = 0, int b = 0, int i = -1) {\n\t\tif (i == -1) { a = 0; b = N; i = 1; }\n\t\tif (r <= a || b <= l) return 0;\n\t\tspread(i);\n\t\tif (l <= a && b <= r) return V[i].sum;\n\t\tLL q1 = sum(l, r, a, (a + b) / 2, i * 2);\n\t\tLL q2 = sum(l, r, (a + b) / 2, b, i * 2 + 1);\n\t\treturn q1 + q2;\n\t}\n\n\tvoid chmax(int l, int r, LL v, int a = 0, int b = 0, int i = -1) {\n\t\tif (i == -1) { a = 0; b = N; i = 1; }\n\t\tspread(i);\n\t\tif (r <= a || b <= l) return;\n\t\tif (V[i].minval >= v) return;\n\t\tif (l <= a && b <= r) if (V[i].min2 > v) {\n\t\t\tV[i].sum += V[i].mincnt * (v - V[i].minval);\n\t\t\tV[i].minval = v;\n\t\t\treturn;\n\t\t}\n\t\tchmax(l, r, v, a, (a + b) / 2, i * 2);\n\t\tchmax(l, r, v, (a + b) / 2, b, i * 2 + 1);\n\t\tV[i] = V[i * 2] + V[i * 2 + 1];\n\t}\n};\n\n\nint main() {\n\n\tint N; scanf(\"%d\", &N);\n\tvector<LL> A(N); rep(i, N) scanf(\"%lld\", &A[i]);\n\tsegtree G(A);\n\n\tint Q; scanf(\"%d\", &Q);\n\twhile (Q--) {\n\t int c; scanf(\"%d\", &c);\n\t\tif (c == 1) {\n\t\t int a, b, d; scanf(\"%d%d%d\", &a, &b, &d); a--;\n\t\t\tG.add(a, b, d);\n\t\t}\n\t\tif (c == 2) {\n\t\t int a, b, d; scanf(\"%d%d%d\", &a, &b, &d); a--;\n\t\t\tLL ans = G.sum(0, N);\n\t\t\tG.add(a, b, -d);\n\t\t\tG.chmax(a, b, 0);\n\t\t\tans -= G.sum(0, N);\n\t\t\tprintf(\"%lld\\n\", ans);\n\t\t}\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 220, "memory_kb": 16884, "score_of_the_acc": -0.7091, "final_rank": 6 }, { "submission_id": "aoj_0427_4924968", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;\n\ntemplate<class T>\nclass SegmentTreeBeats {\n void add_(int x, T val){\n if(!val) return;\n auto& now = seg[x];\n now.sum += val*now.len;\n now.mn += val; now.mx += val; now.add += val;\n if(now.mn2 != INF<T>) now.mn2 += val;\n if(now.mx2 != -INF<T>) now.mx2 += val;\n }\n void chmin_(int x, T val){\n if(val >= seg[x].mx) return;\n auto& now = seg[x];\n now.sum += now.mxc*(val-now.mx);\n if(now.mn == now.mx) now.mn = val;\n else if(now.mn2 == now.mx) now.mn2 = val;\n now.mx = val;\n }\n void chmax_(int x, T val){\n if(val <= seg[x].mn) return;\n auto& now = seg[x];\n now.sum += now.mnc*(val-now.mn);\n if(now.mx == now.mn) now.mx = val;\n else if(now.mx2 == now.mn) now.mx2 = val;\n now.mn = val;\n }\n void get(int x){\n M& now = seg[x], &l = seg[(x<<1)|0], &r = seg[(x<<1)|1];\n now.sum = l.sum + r.sum;\n now.mn = min(l.mn, r.mn);\n now.mx = max(l.mx, r.mx);\n now.len = l.len + r.len;\n if(l.mn < r.mn) now.mnc = l.mnc, now.mn2 = min(l.mn2, r.mn);\n else if(r.mn < l.mn) now.mnc = r.mnc, now.mn2 = min(r.mn2, l.mn);\n else now.mnc = l.mnc + r.mnc, now.mn2 = min(l.mn2, r.mn2);\n if(l.mx > r.mx) now.mxc = l.mxc, now.mx2 = max(l.mx2, r.mx);\n else if(r.mx > l.mx) now.mxc = r.mxc, now.mx2 = max(r.mx2, l.mx);\n else now.mxc = l.mxc + r.mxc, now.mx2 = max(l.mx2, r.mx2);\n }\n void eval(int x){\n auto &now = seg[x];\n for (int i = 0; x < n && i < 2; ++i) {\n add_((x<<1)|i, now.add);\n chmin_((x<<1)|i, now.mx);\n chmax_((x<<1)|i, now.mn);\n }\n now.add = 0;\n }\n void thrust(int k){ for (int i = height-1; i >= 1; --i) eval(k>>i); }\n void recalc(int k) { k = k >> __builtin_ctz(k); while(k >>= 1) get(k);}\n\n void in_chmin(int x, T val) {\n if(seg[x].mx2 < val) chmin_(x, val);\n else {\n eval(x);\n in_chmin((x<<1)|0, val);\n in_chmin((x<<1)|1, val);\n get(x);\n }\n }\n void in_chmax(int x, T val) {\n if(seg[x].mn2 > val) chmax_(x, val);\n else {\n eval(x);\n in_chmax((x<<1)|0, val);\n in_chmax((x<<1)|1, val);\n get(x);\n }\n }\npublic:\n#define RANGEX(NAME, INFUNC) \\\nvoid NAME(int a, int b, T val) { \\\n thrust(a += n); \\\n thrust(b += n); \\\n for(int l = a, r = b; l < r; l >>=1, r>>=1) { \\\n if (l & 1) INFUNC(l++, val); \\\n if (r & 1) INFUNC(--r, val); \\\n } \\\n recalc(a); \\\n recalc(b); \\\n}\n RANGEX(chmin, in_chmin)\n RANGEX(chmax, in_chmax)\n RANGEX(add, add_)\n#undef RANGEX\n T sum(int a, int b) {\n thrust(a += n);\n thrust(b += n);\n T res = 0;\n for(int l = a, r = b; l < r; l >>=1, r>>=1) {\n if (l & 1) res += seg[l++].sum;\n if (r & 1) res += seg[--r].sum;\n }\n return res;\n }\n struct M {\n T sum, mx, mx2, mxc, mn, mn2, mnc, len, add;\n M() : mx2(-INF<T>), mxc(1), mn2(INF<T>), mnc(1), add(0) {};\n };\n vector<M> seg;\n int n, height;\n SegmentTreeBeats() = default;\n SegmentTreeBeats(const vector<T>& v){\n n = 1, height = 1;\n while(n < v.size()) n <<= 1, height++;\n seg.resize(2*n);\n for (int i = 0; i < v.size(); ++i) {\n seg[i+n].sum = seg[i+n].mx = seg[i+n].mn = v[i];\n seg[i+n].len = 1;\n }\n for (int i = n-1; i >= 1; --i) get(i);\n }\n};\n\nint main() {\n int n;\n cin >> n;\n vector<ll> v(n);\n for (auto &&i : v) scanf(\"%lld\", &i);\n SegmentTreeBeats seg(v);\n int q;\n cin >> q;\n while(q--){\n int t, a, b, d; scanf(\"%d %d %d %d\", &t, &a, &b, &d);\n a--;\n if(t == 1){\n seg.add(a, b, d);\n }else {\n ll val = seg.sum(a, b);\n seg.add(a, b, -d);\n seg.chmax(a, b, 0);\n printf(\"%lld\\n\", val-seg.sum(a, b));\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 22488, "score_of_the_acc": -0.8271, "final_rank": 9 }, { "submission_id": "aoj_0427_4333587", "code_snippet": "#include <iostream>\n#include <cmath>\n#include <numeric>\n#include <algorithm>\n#include <deque>\n#include <vector>\n#include <unordered_map>\n#include <unordered_set>\n#include <set>\n#include <iomanip>\n#include <map>\n#include <stack>\n#include <queue>\n#include <functional>\n#include <climits>\n#include <numeric>\n#include <bitset>\n#include <random>\n#include <tuple>\n#include <initializer_list>\n#include <fstream>\n#include <cctype>\n#include <string>\n#include <cfloat>\n#include <array>\n\n\n\nclass Group {\n\tstruct Range {\n\t\tint from, until;\n\t\tbool covered_by(const Range that) const {\n\t\t\treturn that.from <= this->from && this->until <= that.until;\n\t\t}\n\t\tbool has_intersection(const Range that) const {\n\t\t\treturn that.from < this->until && this->from < that.until;\n\t\t}\n\t\tint length() const {\n\t\t\treturn until - from;\n\t\t}\n\t};\n\tstd::vector<int> _sum_value, _min_value, _min_count, _min_second, _add_for_all;\n\tstd::vector<Range> area;\n\tstd::vector<bool> is_valid;\n\tbool is_leaf(const int node) const {\n\t\treturn (node << 1) >= _sum_value.size() || length(node) == 1;\n\t}\n\tint right(const int node) const {\n\t\treturn (node << 1) + 1;\n\t}\n\tint left(const int node) const {\n\t\treturn node << 1;\n\t}\n\tbool covered_by(const int node, const Range range) const {\n\t\treturn area[node].covered_by(range);\n\t}\n\tbool has_intersection(const int node, const Range range) const {\n\t\treturn area[node].has_intersection(range);\n\t}\n\tvoid add_leaf(const int node, const Range range, const int value) {\n\t\tif (covered_by(node, range)) {\n\t\t\t_sum_value[node] += value;\n\t\t\t_min_value[node] += value;\n\t\t}\n\t}\n\tvoid add(const int node, const Range range, const int value) {\n\t\tif (value == 0) return;\n\t\tif (is_leaf(node)) return add_leaf(node, range, value);\n\t\tif (covered_by(node, range)) {\n\t\t\t_add_for_all[node] += value;\n\t\t}\n\t\telse if (has_intersection(node, range)) {\n\t\t\tapply_min(node);\n\t\t\tadd(left(node), range, value);\n\t\t\tadd(right(node), range, value);\n\t\t\trenew_parameter(node);\n\t\t}\n\t}\n\tvoid change_min_leaf(const int node, const Range range, const int lower_limit) {\n\t\tif (covered_by(node, range) && _sum_value[node] < lower_limit) _sum_value[node] = _min_value[node] = lower_limit;\n\t\telse return;\n\t}\n\tvoid change_min(const int node, const Range range, const int lower_limit) {\n\t\tif (is_leaf(node)) return change_min_leaf(node, range, lower_limit);\n\t\tif (lower_limit <= min(node)) return;\n\t\tif (covered_by(node, range) && lower_limit < min_second(node)) {\n\t\t\t_sum_value[node] += (lower_limit - min(node)) * min_count(node);\n\t\t\t_min_value[node] = lower_limit - _add_for_all[node];\n\t\t}\n\t\telse if (has_intersection(node, range)) {\n\t\t\tchange_min(left(node), range, lower_limit - _add_for_all[node]);\n\t\t\tchange_min(right(node), range, lower_limit - _add_for_all[node]);\n\t\t\trenew_parameter(node);\n\t\t}\n\t}\n\tint min(const int node) const {\n\t\treturn _min_value[node] + _add_for_all[node];\n\t}\n\tint min_count(const int node) const {\n\t\treturn _min_count[node];\n\t}\n\tint min_second(const int node) const {\n\t\treturn _min_second[node] + _add_for_all[node];\n\t}\n\tint length(const int node) const {\n\t\treturn area[node].length();\n\t}\n\tint sum_all(const int node) const {\n\t\treturn _sum_value[node] + _add_for_all[node] * length(node);\n\t}\n\tint sum_leaf(const int node, const Range range) {\n\t\tif (covered_by(node, range)) return _sum_value[node];\n\t\telse return 0;\n\t}\n\tint sum(const int node, const Range range) {\n\t\tif (is_leaf(node)) return sum_leaf(node, range);\n\t\tif (covered_by(node, range)) {\n\t\t\treturn sum_all(node);\n\t\t}\n\t\telse if (has_intersection(node, range)) {\n\t\t\tapply_change(node);\n\t\t\trenew_parameter(node);\n\t\t\treturn sum(left(node), range) + sum(right(node), range);\n\t\t}\n\t\telse return 0;\n\t}\n\tvoid apply_change(const int node) {\n\t\tapply_min(node);\n\t\tif (_add_for_all[node] != 0) {\n\t\t\tadd(left(node), area[node], _add_for_all[node]);\n\t\t\tadd(right(node), area[node], _add_for_all[node]);\n\t\t\t_add_for_all[node] = 0;\n\t\t}\n\t}\n\tvoid apply_min(const int node) {\n\t\tchange_min(left(node), area[node], _min_value[node]);\n\t\tchange_min(right(node), area[node], _min_value[node]);\n\t}\n\tvoid renew_parameter(const int node) {\n\t\t_min_value[node] = std::min(min(left(node)), min(right(node)));\n\t\t_min_count[node] = 0;\n\t\t_min_second[node] = INT_MAX >> 1;\n\t\tif (_min_value[node] == min(left(node))) {\n\t\t\t_min_count[node] += min_count(left(node));\n\t\t\t_min_second[node] = std::min(_min_second[node], min_second(left(node)));\n\t\t}\n\t\telse _min_second[node] = std::min(_min_second[node], min(left(node)));\n\t\tif (_min_value[node] == min(right(node))) {\n\t\t\t_min_count[node] += min_count(right(node));\n\t\t\t_min_second[node] = std::min(_min_second[node], min_second(right(node)));\n\t\t}\n\t\telse _min_second[node] = std::min(_min_second[node], min(right(node)));\n\t\t_sum_value[node] = sum_all(left(node)) + sum_all(right(node));\n\t}\n\tvoid initialize(const int node) {\n\t\tif ((node << 1) >= _sum_value.size()) return;\n\t\tinitialize(node << 1); initialize((node << 1) + 1);\n\t\tif (is_valid[node << 1] || is_valid[(node << 1) + 1]) {\n\t\t\tis_valid[node] = true;\n\t\t\tarea[node] = area[node << 1];\n\t\t\tif (is_valid[(node << 1) + 1]) area[node].until = area[(node << 1) + 1].until;\n\t\t\tif (area[node].length() == 1) {\n\t\t\t\t_sum_value[node] = _min_value[node] = _sum_value[node << 1];\n\t\t\t\t_min_count[node] = 1;\n\t\t\t\t_min_second[node] = INT_MAX >> 1;\n\t\t\t}\n\t\t\telse {\n\t\t\t\trenew_parameter(node);\n\t\t\t}\n\t\t}\n\t}\npublic:\n\tGroup(const std::vector<int>& initial) {\n\t\tint len = 1;\n\t\twhile (len < initial.size()) len <<= 1;\n\t\tlen;\n\t\t_sum_value = _min_value = _min_count = _min_second = _add_for_all = std::vector<int>(len << 1, 0);\n\t\tarea = std::vector<Range>(len << 1);\n\t\tis_valid = std::vector<bool>(len << 1, false);\n\t\tfor (auto i = 0; i < initial.size(); ++i) {\n\t\t\t_sum_value[i + len] = _min_value[i + len] = initial[i];\n\t\t\t_min_count[i + len] = 1;\n\t\t\t_min_second[i + len] = INT_MAX >> 1;\n\t\t\tarea[i + len] = Range{ i, i + 1 };\n\t\t\tis_valid[i + len] = true;\n\t\t}\n\t\tinitialize(1);\n\t}\n\tvoid add(int from, int until, int value) {\n\t\tadd(1, Range{ from, until }, value);\n\t}\n\tint emerge(int from, int until, int max) {\n\t\tconst auto current = sum_all(1);\n\t\tadd(1, Range{ from, until }, -max);\n\t\tchange_min(1, Range{ from, until }, 0);\n\t\treturn current - sum_all(1);\n\t}\n};\nint main() {\n\tint n; std::cin >> n;\n\tstd::vector<int> initial(n); for (auto& c : initial) std::cin >> c;\n\tGroup g(initial);\n\tint m; std::cin >> m;\n\tfor (auto i = 0; i < m; ++i) {\n\t\tint t, a, b, d; std::cin >> t >> a >> b >> d;\n\t\tswitch (t) {\n\t\tcase 1: g.add(a - 1, b, d); break;\n\t\tcase 2: std::cout << g.emerge(a - 1, b, d) << std::endl; break;\n\t\tdefault: throw 0;\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 320, "memory_kb": 10588, "score_of_the_acc": -0.6697, "final_rank": 5 }, { "submission_id": "aoj_0427_4208759", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 99999999999999999\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define NUM 100005\n\nstruct Info{\n\n\tll range_sum,\n\t uniformity,\n\t minimum,\n\t second_minimum,\n\t num_minimum,\n\t base_value;\n};\n\nll N = 1;\nInfo info[8*NUM];\n\nvoid init(ll first_N){\n\twhile(N < first_N)N *= 2;\n}\n\nvoid updateInfo(int node_id){\n\n\tint left_child = 2*node_id+1;\n\tint right_child = 2*node_id+2;\n\n\tinfo[node_id].range_sum = info[left_child].range_sum+info[right_child].range_sum;\n\n\tif(info[left_child].minimum < info[right_child].minimum){\n\n\t\tinfo[node_id].minimum = info[left_child].minimum;\n\t\tinfo[node_id].num_minimum = info[left_child].num_minimum;\n\t\tinfo[node_id].second_minimum = min(info[left_child].second_minimum,info[right_child].minimum);\n\n\t}else if(info[left_child].minimum > info[right_child].minimum){\n\n\t\tinfo[node_id].minimum = info[right_child].minimum;\n\t\tinfo[node_id].num_minimum = info[right_child].num_minimum;\n\t\tinfo[node_id].second_minimum = min(info[right_child].second_minimum,info[left_child].minimum);\n\n\t}else{ //info[left_child].minimum == info[right_child].minimum\n\n\t\tinfo[node_id].minimum = info[left_child].minimum;\n\t\tinfo[node_id].num_minimum = info[left_child].num_minimum+info[right_child].num_minimum;\n\t\tinfo[node_id].second_minimum = min(info[left_child].second_minimum,info[right_child].second_minimum);\n\t}\n}\n\nvoid first_add(int loc,ll value){\n\tloc += N-1;\n\n\tinfo[loc].range_sum = value;\n\tinfo[loc].minimum = value;\n\n\tif(N == 1)return;\n\n\tint parent = (loc-1)/2;\n\n\twhile(true){\n\t\tupdateInfo(parent);\n\n\t\tif(parent == 0)break;\n\t\telse{\n\t\t\tparent = (parent-1)/2;\n\t\t}\n\t}\n}\n\n\nvoid evaluate(ll node_id,ll node_left,ll node_right){\n\n\tll left_child = 2*node_id+1;\n\tll right_child = 2*node_id+2;\n\n\tif(info[node_id].uniformity != 0){\n\n\t\tinfo[node_id].minimum += info[node_id].uniformity;\n\t\tif(info[node_id].second_minimum != HUGE_NUM){\n\n\t\t\tinfo[node_id].second_minimum += info[node_id].uniformity;\n\t\t}\n\n\t\tinfo[node_id].range_sum += (node_right-node_left)*info[node_id].uniformity;\n\n\t\tif(node_id <= N-2){\n\n\t\t\tinfo[left_child].uniformity += info[node_id].uniformity;\n\t\t\tinfo[right_child].uniformity += info[node_id].uniformity;\n\n\t\t\tif(info[left_child].base_value != -1){\n\n\t\t\t\tinfo[left_child].base_value += info[node_id].uniformity;\n\t\t\t}\n\t\t\tif(info[right_child].base_value != -1){\n\n\t\t\t\tinfo[right_child].base_value += info[node_id].uniformity;\n\t\t\t}\n\t\t}\n\n\t\tinfo[node_id].uniformity = 0;\n\t}\n\n\tif(info[node_id].base_value != -1){\n\n\t\tif(info[node_id].base_value >= info[node_id].second_minimum){\n\n\t\t\tinfo[left_child].base_value = max(info[left_child].base_value,info[node_id].base_value);\n\t\t\tinfo[right_child].base_value = max(info[right_child].base_value,info[node_id].base_value);\n\n\t\t\tif(node_id < N-1){\n\t\t\t\tevaluate(left_child,node_left,(node_left+node_right)/2);\n\t\t\t\tevaluate(right_child,(node_left+node_right)/2,node_right);\n\n\t\t\t\tupdateInfo(node_id);\n\t\t\t}\n\n\t\t}else if(info[node_id].base_value > info[node_id].minimum){\n\n\t\t\tinfo[node_id].range_sum += (info[node_id].base_value-info[node_id].minimum)*info[node_id].num_minimum;\n\t\t\tinfo[node_id].minimum = info[node_id].base_value;\n\n\t\t\tif(node_id < N-1){\n\n\t\t\t\tinfo[left_child].base_value = max(info[left_child].base_value,info[node_id].base_value);\n\t\t\t\tinfo[right_child].base_value = max(info[right_child].base_value,info[node_id].base_value);\n\t\t\t}\n\t\t}\n\t\tinfo[node_id].base_value = -1;\n\t}\n}\n\n\nvoid changeMax(ll left,ll right,ll value,ll node_id,ll node_left,ll node_right){\n\n\tevaluate(node_id,node_left,node_right);\n\n\tif(right <= node_left || left >= node_right){\n\t\treturn;\n\t}\n\telse if(left <= node_left && right >= node_right){\n\n\t\tinfo[node_id].base_value = value;\n\t\tevaluate(node_id,node_left,node_right);\n\n\t}else{\n\n\t\tchangeMax(left,right,value,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tchangeMax(left,right,value, 2*node_id+2,(node_left+node_right)/2,node_right);\n\t\tupdateInfo(node_id);\n\t}\n}\n\nvoid add(ll left,ll right,ll value,ll node_id,ll node_left,ll node_right){\n\n\tevaluate(node_id,node_left,node_right);\n\n\tif(right <= node_left || left >= node_right){\n\t\treturn;\n\t}\n\telse if(left <= node_left && right >= node_right){\n\n\t\tinfo[node_id].uniformity += value;\n\t\tevaluate(node_id,node_left,node_right);\n\n\t}else{\n\n\t\tadd(left,right,value,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tadd(left,right,value, 2*node_id+2,(node_left+node_right)/2,node_right);\n\t\tupdateInfo(node_id);\n\t}\n\n}\n\nll getSum(ll left,ll right,ll node_id,ll node_left,ll node_right){\n\n\tevaluate(node_id,node_left,node_right);\n\n\tif(right <= node_left || left >= node_right){\n\t\treturn 0;\n\n\t}else if(left <= node_left && right >= node_right){\n\n\t\treturn info[node_id].range_sum;\n\n\t}else{\n\n\t\tll ret = 0;\n\n\t\tret += getSum(left,right,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tret += getSum(left,right,2*node_id+2,(node_left+node_right)/2,node_right);\n\n\t\treturn ret;\n\t}\n}\n\n\n\nint main(){\n\n\tll first_N;\n\tscanf(\"%lld\",&first_N);\n\n\tinit(first_N);\n\n\tfor(ll i = 0; i <= 2*N-2; i++){\n\t\tinfo[i].range_sum = 0;\n\t\tinfo[i].uniformity = 0;\n\t\tinfo[i].minimum = HUGE_NUM;\n\t\tinfo[i].num_minimum = 1;\n\t\tinfo[i].second_minimum = HUGE_NUM;\n\t\tinfo[i].base_value = -1;\n\t}\n\n\tll tmp;\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tscanf(\"%lld\",&tmp);\n\t\tfirst_add(i,tmp);\n\t}\n\n\tint num_query;\n\tscanf(\"%d\",&num_query);\n\n\tint command,left,right;\n\tll value,pre,current;\n\n\tfor(int loop = 0; loop < num_query; loop++){\n\n\t\tscanf(\"%d %d %d %lld\",&command,&left,&right,&value);\n\t\tleft--;\n\t\tright--;\n\n\t\tif(command == 1){ //加算命令\n\n\t\t\tadd(left,right+1,value,0,0,N);\n\n\t\t}else{\n\n\t\t\tpre = getSum(0,N,0,0,N);\n\t\t\tadd(left,right+1,-value,0,0,N);\n\t\t\tchangeMax(left,right+1,0,0,0,N);\n\t\t\tcurrent = getSum(0,N,0,0,N);\n\n\t\t\tprintf(\"%lld\\n\",pre-current);\n\t\t}\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 190, "memory_kb": 15492, "score_of_the_acc": -0.5895, "final_rank": 4 }, { "submission_id": "aoj_0427_4176744", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define all(x) (x).begin(),(x).end()\nconst int mod=1000000007,MAX=1<<18;\nconst ll INF=1LL<<60;\n\nint n;\nll max_fi[2*MAX-1],max_se[2*MAX-1],max_cnt[2*MAX-1];\nll min_fi[2*MAX-1],min_se[2*MAX-1],min_cnt[2*MAX-1];\nll sum[2*MAX-1];\nll lazyadd[2*MAX-1],lazyupdate[2*MAX-1];\nbool done[2*MAX-1];\n\nvoid init(int n_){\n n=1;\n while(n<n_) n*=2;\n \n for(int i=0;i<2*n-1;i++){\n max_fi[i]=-INF;\n max_se[i]=-INF;\n max_cnt[i]=n;\n \n min_fi[i]=INF;\n min_se[i]=INF;\n min_cnt[i]=n;\n \n sum[i]=0;\n }\n}\n\nvoid update_node_max(ll x,int k){\n sum[k]+=(x-max_fi[k])*max_cnt[k];\n \n if(max_fi[k]==min_fi[k]){\n max_fi[k]=min_fi[k]=x;\n }else if(max_fi[k]==min_se[k]){\n max_fi[k]=min_se[k]=x;\n }else{\n max_fi[k]=x;\n }\n \n if(done[k]){\n lazyupdate[k]=min(lazyupdate[k],x);\n }\n}\n\nvoid update_node_min(ll x,int k){\n sum[k]+=(x-min_fi[k])*min_cnt[k];\n \n if(min_fi[k]==max_fi[k]){\n min_fi[k]=max_fi[k]=x;\n }else if(min_fi[k]==max_se[k]){\n min_fi[k]=max_se[k]=x;\n }else{\n min_fi[k]=x;\n }\n \n if(done[k]){\n lazyupdate[k]=max(lazyupdate[k],x);\n }\n}\n\nvoid update_node_(ll x,int k,int l,int r){\n max_fi[k]=x;\n max_se[k]=-INF;\n max_cnt[k]=r-l;\n \n min_fi[k]=x;\n min_se[k]=INF;\n min_cnt[k]=r-l;\n \n sum[k]=x*(r-l);\n \n lazyupdate[k]=x;\n done[k]=1;\n lazyadd[k]=0;\n}\n\nvoid update_node_add(ll x,int k,int l,int r){\n max_fi[k]+=x;\n if(max_se[k]!=-INF) max_se[k]+=x;\n \n min_fi[k]+=x;\n if(min_se[k]!=INF) min_se[k]+=x;\n \n sum[k]+=x*(r-l);\n \n if(done[k]){\n lazyupdate[k]+=x;\n }else{\n lazyadd[k]+=x;\n }\n}\n\nvoid eval(int k,int l,int r){\n \n if(l+1>=r) return;\n \n if(done[k]){\n update_node_(lazyupdate[k],2*k+1,l,(l+r)/2);\n update_node_(lazyupdate[k],2*k+2,(l+r)/2,r);\n done[k]=0;\n return;\n }\n \n if(lazyadd[k]){\n update_node_add(lazyadd[k],2*k+1,l,(l+r)/2);\n update_node_add(lazyadd[k],2*k+2,(l+r)/2,r);\n lazyadd[k]=0;\n }\n \n if(max_fi[k]<max_fi[2*k+1]){\n update_node_max(max_fi[k],2*k+1);\n }\n if(min_fi[k]>min_fi[2*k+1]){\n update_node_min(min_fi[k],2*k+1);\n }\n if(max_fi[k]<max_fi[2*k+2]){\n update_node_max(max_fi[k],2*k+2);\n }\n if(min_fi[k]>min_fi[2*k+2]){\n update_node_min(min_fi[k],2*k+2);\n }\n}\n\nvoid merge(int k){\n sum[k]=sum[2*k+1]+sum[2*k+2];\n \n if(max_fi[2*k+1]>max_fi[2*k+2]){\n max_fi[k]=max_fi[2*k+1];\n max_cnt[k]=max_cnt[2*k+1];\n max_se[k]=max(max_se[2*k+1],max_fi[2*k+2]);\n }else if(max_fi[2*k+1]<max_fi[2*k+2]){\n max_fi[k]=max_fi[2*k+2];\n max_cnt[k]=max_cnt[2*k+2];\n max_se[k]=max(max_fi[2*k+1],max_se[2*k+2]);\n }else{\n max_fi[k]=max_fi[2*k+1];\n max_cnt[k]=max_cnt[2*k+1]+max_cnt[2*k+2];\n max_se[k]=max(max_se[2*k+1],max_se[2*k+2]);\n }\n \n if(min_fi[2*k+1]<min_fi[2*k+2]){\n min_fi[k]=min_fi[2*k+1];\n min_cnt[k]=min_cnt[2*k+1];\n min_se[k]=min(min_se[2*k+1],min_fi[2*k+2]);\n }else if(min_fi[2*k+1]>min_fi[2*k+2]){\n min_fi[k]=min_fi[2*k+2];\n min_cnt[k]=min_cnt[2*k+2];\n min_se[k]=min(min_fi[2*k+1],min_se[2*k+2]);\n }else{\n min_fi[k]=min_fi[2*k+1];\n min_cnt[k]=min_cnt[2*k+1]+min_cnt[2*k+2];\n min_se[k]=min(min_se[2*k+1],min_se[2*k+2]);\n }\n}\n\nvoid update_chmax(int a,int b,ll x,int k,int l,int r){\n \n eval(k,l,r);\n \n if(r<=a||b<=l||min_fi[k]>=x) return;\n \n if(a<=l&&r<=b&&min_se[k]>x){\n update_node_min(x,k);\n eval(k,l,r);\n }else{\n update_chmax(a,b,x,2*k+1,l,(l+r)/2);\n update_chmax(a,b,x,2*k+2,(l+r)/2,r);\n \n merge(k);\n }\n}\n\nvoid update_chmin(int a,int b,ll x,int k,int l,int r){\n \n eval(k,l,r);\n \n if(r<=a||b<=l||max_fi[k]<=x) return;\n \n if(a<=l&&r<=b&&max_se[k]<x){\n update_node_max(x,k);\n eval(k,l,r);\n }else{\n update_chmin(a,b,x,2*k+1,l,(l+r)/2);\n update_chmin(a,b,x,2*k+2,(l+r)/2,r);\n \n merge(k);\n }\n}\n\nvoid update(int a,int b,ll x,int k,int l,int r){\n eval(k,l,r);\n \n if(r<=a||b<=l) return;\n \n if(a<=l&&r<=b){\n update_node_(x,k,l,r);\n eval(k,l,r);\n }else{\n update(a,b,x,2*k+1,l,(l+r)/2);\n update(a,b,x,2*k+2,(l+r)/2,r);\n \n merge(k);\n }\n}\n\nvoid add(int a,int b,ll x,int k,int l,int r){\n eval(k,l,r);\n \n if(r<=a||b<=l) return;\n \n if(a<=l&&r<=b){\n update_node_add(x,k,l,r);\n eval(k,l,r);\n }else{\n add(a,b,x,2*k+1,l,(l+r)/2);\n add(a,b,x,2*k+2,(l+r)/2,r);\n \n merge(k);\n }\n}\n\nll query_sum(int a,int b,int k,int l,int r){\n \n if(r<=a||b<=l) return 0;\n \n eval(k,l,r);\n \n if(a<=l&&r<=b) return sum[k];\n \n ll vl=query_sum(a,b,2*k+1,l,(l+r)/2);\n ll vr=query_sum(a,b,2*k+2,(l+r)/2,r);\n return vl+vr;\n}\n\nll query_max(int a,int b,int k,int l,int r){\n \n if(r<=a||b<=l) return -INF;\n \n eval(k,l,r);\n \n if(a<=l&&r<=b) return max_fi[k];\n \n ll vl=query_max(a,b,2*k+1,l,(l+r)/2);\n ll vr=query_max(a,b,2*k+2,(l+r)/2,r);\n return max(vl,vr);\n}\n\nll query_min(int a,int b,int k,int l,int r){\n \n if(r<=a||b<=l) return INF;\n \n eval(k,l,r);\n \n if(a<=l&&r<=b) return min_fi[k];\n \n ll vl=query_min(a,b,2*k+1,l,(l+r)/2);\n ll vr=query_min(a,b,2*k+2,(l+r)/2,r);\n return min(vl,vr);\n}\n\nint main(){\n \n std::ifstream in(\"text.txt\");\n std::cin.rdbuf(in.rdbuf());\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n /*int N,Q;cin>>N>>Q;\n init(N);\n \n for(int i=0;i<N;i++){\n ll x;cin>>x;\n update(i,i+1,x,0,0,n);\n }\n \n while(Q--){\n int t;cin>>t;\n if(t==0){\n int a,b;ll x;cin>>a>>b>>x;\n update_chmin(a,b,x,0,0,n);\n }else if(t==1){\n int a,b;ll x;cin>>a>>b>>x;\n update_chmax(a,b,x,0,0,n);\n }else if(t==2){\n int a,b;ll x;cin>>a>>b>>x;\n add(a,b,x,0,0,n);\n }else{\n int a,b;cin>>a>>b;\n cout<<query_sum(a,b,0,0,n)<<endl;\n }\n }*/\n \n int N;cin>>N;\n init(N);\n \n for(int i=0;i<N;i++){\n ll x;cin>>x;\n update(i,i+1,x,0,0,n);\n }\n \n int Q;cin>>Q;\n while(Q--){\n int t,a,b;ll x;\n cin>>t>>a>>b>>x;\n a--;\n \n if(t==1){\n add(a,b,x,0,0,n);\n }else{\n ll fi=query_sum(0,n,0,0,n);\n add(a,b,-x,0,0,n);\n update_chmax(a,b,0,0,0,n);\n ll se=query_sum(0,n,0,0,n);\n \n cout<<fi-se<<endl;\n }\n }\n \n}", "accuracy": 1, "time_ms": 480, "memory_kb": 20032, "score_of_the_acc": -1.3883, "final_rank": 14 }, { "submission_id": "aoj_0427_4089315", "code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\nusing i64 = long long;\nconst i64 MOD = 1e9+7;\nconst i64 INF = 1e18+7;\n\n\ntemplate <typename T>\nbool chmin(T& x, T y){\n if(x > y){\n x = y;\n return true;\n }\n return false;\n}\n\ntemplate <typename T>\nbool chmax(T& x, T y){\n if(x < y){\n x = y;\n return true;\n }\n return false;\n}\n\ntemplate <typename T, typename U = int>\nstruct Node{\n\n using np = Node<T, U>*;\n\n static np nil;\n\n T val;\n U lazy;\n uint32_t pri;\n\n int size;\n T sum;\n\n np l = nil;\n np r = nil;\n\n Node(T v, U OU = U()) : val(v), lazy(OU), pri(rndpri()), size(1), sum(v), l(nil), r(nil){}\n Node(T v, U OU, uint32_t p) : val(v), lazy(OU), pri(p), size(1), sum(v), l(nil), r(nil){}\n\n static uint32_t rndpri() {\n static uint32_t x = 123456789, y = 362436069, z = 521288629, w = time(0);\n uint32_t t = x ^ (x << 11);\n x = y;\n y = z;\n z = w;\n w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\n return max<uint32_t>(1, w & 0x3FFFFFFF);\n }\n};\n\n\ntemplate <typename T, typename U = int>\nclass Treap{\n\n using nt = Node<T, U>;\n using np = nt*;\n using F = function<T(T, T)>;\n using G = function<T(T, U, int)>;\n using H = function<U(U, U)>;\n\npublic:\n\n np root;\n bool is_list;\n F f;\n G g;\n H h;\n T OT;\n U OU;\n\n Treap(bool is_list, F f, G g, H h, T OT, U OU) : root(nt::nil), is_list(is_list), f(f), g(g), h(h), OT(OT), OU(OU){}\n\n Treap(T val, bool is_list, F f, G g, H h, T OT, U OU) : root(new nt(val)), is_list(is_list), f(f), g(g), h(h), OT(OT), OU(OU){}\n\n // 配列で初期化する\n Treap(vector<T> v, bool is_list, F f, G g, H h, T OT, U OU) : root(nt::nil), is_list(is_list), f(f), g(g), h(h), OT(OT), OU(OU){\n sort(v.begin(), v.end());\n for(auto& x : v)\n push_back(x);\n }\n\n static Treap make(bool is_list, F f = [](T x, T){return x;}, T OT = T(), G g = [](auto x, auto, auto){return x;}, H h = [](auto x, auto){return x;}, U OU = U()){\n assert(nt::nil != nullptr);\n return Treap(is_list, f, g, h, OT, OU);\n }\n\n static Treap make(T val, bool is_list, F f = [](auto x, auto){return x;}, T OT = T(), G g = [](auto x, auto, auto){return x;}, H h = [](auto x, auto){return x;}, U OU = U()){\n assert(nt::nil != nullptr);\n return Treap(val, is_list, f, g, h, OT, OU);\n }\n\n static Treap make(vector<T>& val, bool is_list, F f = [](auto x, auto){return x;}, T OT = T(), G g = [](auto x, auto, auto){return x;}, H h = [](auto x, auto){return x;}, U OU = U()){\n assert(nt::nil != nullptr);\n return Treap(val, is_list, f, g, h, OT, OU);\n }\n\n ~Treap(){\n /*\n clear();\n if(root != nt::nil)\n delete root;\n */\n }\n\n int _size(np x){return x == nt::nil ? 0 : x->size;}\n T _sum(np x){return x == nt::nil ? OT : x->sum;}\n\n np _update(np x){\n\n if(x == nt::nil)\n return x;\n\n if(is_list){\n _push(x);\n _push(x->l);\n _push(x->r);\n }\n\n x->sum = f(f(_sum(x->l), x->val), _sum(x->r));\n x->size = _size(x->l) + _size(x->r) + 1;\n return x;\n }\n\n void _push(np x){\n if(x->lazy == OU)\n return ;\n\n x->sum = g(x->sum, x->lazy, x->size);\n x->val = g(x->val, x->lazy, 1);\n\n if(x->l != nt::nil)\n x->l->lazy = h(x->l->lazy, x->lazy);\n if(x->r != nt::nil)\n x->r->lazy = h(x->r->lazy, x->lazy);\n\n x->lazy = OU;\n\n }\n\n np _merge(np l, np r){\n if(l == nt::nil || r ==nt::nil)\n return l == nt::nil ? r : l;\n\n if(l->pri > r->pri){\n l->r = _merge(l->r, r);\n return _update(l);\n }else{\n r->l = _merge(l, r->l);\n return _update(r);\n }\n }\n\n pair<np,np> _split(np x, int k){\n if(x == nt::nil)\n return make_pair(nt::nil, nt::nil);\n\n assert(0 <= k && k <= _size(x));\n\n if(k <= _size(x->l)){\n pair<np, np> s = _split(x->l, k);\n x->l = s.second;\n return make_pair(s.first, _update(x));\n\n }else{\n pair<np, np> s = _split(x->r, k - _size(x->l) - 1);\n x->r = s.first;\n return make_pair(_update(x), s.second);\n }\n }\n\n np _insert(np x, int k, T val){\n np l, r;\n tie(l, r) = _split(x, k);\n return _merge(_merge(l, new nt(val, OU)), r);\n }\n\n np _erase(np x, int k){\n np l, r, m;\n tie(l, r) = _split(x, k);\n tie(m, r) = _split(r, 1);\n if(m != nt::nil)\n delete m;\n return _merge(l, r);\n }\n\n void _set(np x, int k, T val){\n _update(x);\n\n if(k < _size(x->l))\n _set(x->l, k, val);\n else if(_size(x->l) == k)\n x->val = val;\n else\n _set(x->r, k - _size(x->l) - 1, val);\n\n _update(x);\n }\n\n void _add(np x, int l, int r, U val){\n _update(x);\n\n if(x == nt::nil)\n return ;\n l = max(l, 0);\n r = min(r, _size(x));\n\n int sl = _size(x->l);\n\n if(l >= r)\n return ;\n\n if (l == 0 && r == _size(x)){\n x->lazy = h(x->lazy, val);\n }\n else{\n if(l <= sl && sl < r)\n x->val = g(x->val, val, 1);\n\n _add(x->l, l, r, val);\n _add(x->r, l - sl - 1, r - sl - 1, val);\n }\n\n _update(x);\n }\n\n np _getnode(np x, int k){\n\n _update(x);\n\n assert(0 <= k && k < _size(x));\n\n if(k < _size(x->l))\n return _getnode(x->l, k);\n else if(_size(x->l) == k)\n return x;\n else\n return _getnode(x->r, k - _size(x->l) - 1);\n }\n\n T _get(np x, int k){\n return _getnode(x, k)->val;\n }\n\n T _rangesum(np x, int l, int r){\n _update(x);\n\n l = max(l, 0);\n r = min(r, _size(x));\n if(l >= r)\n return OT;\n if(l == 0 && r == _size(x))\n return _sum(x);\n\n int sl = _size(x->l);\n T ret = (l <= sl && sl < r ? x->val : OT);\n ret = f(_rangesum(x->l, l, r), ret);\n ret = f(ret, _rangesum(x->r, l - sl - 1, r - sl - 1));\n return ret;\n }\n\n int _lowerbound(np x, T val){\n _update(x);\n\n if(x == nt::nil)\n return 0;\n if(val <= x->val)\n return _lowerbound(x->l, val);\n else\n return _lowerbound(x->r,val) + _size(x->l) + 1;\n }\n\n int _upperbound(np x, T val){\n _update(x);\n\n if(x == nt::nil)\n return 0;\n if(val < x->val)\n return _upperbound(x->l, val);\n else\n return _upperbound(x->r,val) + _size(x->l) + 1;\n }\n\n np _insert(np x, T val){\n return _insert(x, _lowerbound(x, val), val);\n }\n\n void _clear(np x){\n if(x == nullptr || x == nt::nil)\n return;\n if(x->l != nt::nil){\n _clear(x->l);\n delete(x->l);\n x->l = nt::nil;\n }\n if(x->r != nt::nil){\n _clear(x->r);\n delete(x->r);\n x->r = nt::nil;\n }\n }\n\n void push_front(T val){\n root = _merge(new nt(val, OU), root);\n }\n\n void push_back(T val){\n root = _merge(root, new nt(val,OU));\n }\n\n void pop_front(){\n root = _split(root, 1).second;\n }\n\n void pop_back(){\n root = _split(root, _size(root) - 1).first;\n }\n\n // [0, k)と[k, size)に分割して, [k, size)側を返す\n Treap split_left(int k){\n np p;\n tie(root, p) = _split(root, k);\n return decltype(this)(f, g, h, p);\n }\n\n // [0, k)と[k, size)に分割して, [0, k)側を返す\n Treap split_right(int k){\n np p;\n tie(p, root) = _split(root, k);\n return decltype(this)(f, g, h, p);\n }\n\n // rootを含めたサイズの出力\n int size(){\n return (root == nt::nil ? 0 : root->size);\n }\n\n // k番目への代入\n void set(int k, T val){\n return _set(root, k, val);\n }\n\n // k番目への加算\n void add(int k, U val){\n assert(is_list);\n return _add(root, k, k + 1, val);\n }\n\n // [l, r)への一様加算\n void add(int l, int r, U val){\n return _add(root, l, r, val);\n }\n\n // k番目の取得\n T get(int k){\n return _get(root, k);\n }\n\n // [l, r)の総和 (同様の実装でRMQ等も可能)\n T get(int l, int r){\n return _rangesum(root, l, r);\n }\n\n // k番目への挿入\n void insert(int k, T val){\n assert(is_list);\n root = _insert(root, k, val);\n }\n\n // 適切な位置への挿入\n void insert(T val){\n root = _insert(root, val);\n }\n\n // val <= get(k) となるような最小のk\n int lowerbound(T val){\n return _lowerbound(root, val);\n }\n\n // val < get(k) となるような最小のk\n int upperbound(T val){\n return _upperbound(root, val);\n }\n\n // k番目の要素削除\n void erase(int k){\n root = _erase(root, k);\n }\n\n // 要素の全削除\n void clear(){\n if(root != nullptr && root != nt::nil){\n _clear(root);\n delete(root);\n root = nt::nil;\n }\n }\n};\n\nusing node_type = Node<i64, pair<i64, bool>>;\ntemplate<> node_type* node_type::nil = new node_type(0, make_pair(0, false), 0);\n\n\nsigned main(){\n int n;\n cin >> n;\n vector<int> a(n);\n for(auto& x : a)\n cin >> x;\n int m;\n cin >> m;\n\n constexpr int packet = 20;\n constexpr int size = (100100) / packet;\n\n auto f = [&](auto x, auto y){\n if(x.second != y.second)\n return y;\n if(y.second)\n return y;\n return make_pair(x.first + y.first, false);\n };\n\n vector<Treap<i64, pair<i64, bool>>> tr;\n vector<vector<i64>> elm_idxes(size, vector<i64>(packet));\n for(int i = 0; i < size; ++i){\n int st = packet * i;\n int en = packet * (i + 1);\n vector<i64> e;\n vector<pair<int,int>> v;\n for(int j = st; j < en; ++j){\n e.emplace_back(j < n ? a[j] : 1e9);\n v.emplace_back(e.back(), j - st);\n }\n sort(v.begin(), v.end());\n for(int j = 0; j < packet; ++j)\n elm_idxes[i][j] = v[j].second;\n auto t = Treap<i64, pair<i64, bool>>::make(e, false, [](auto x, auto y){return x + y;}, 0, [](auto x, auto y, int){return y.second ? 0 : x + y.first;}, f, make_pair(0, false));\n tr.emplace_back(move(t));\n }\n\n auto get_raw = [&](int idx){\n vector<i64> ret(packet, 0);\n for(int i = 0; i < packet; ++i){\n ret[elm_idxes[idx][i]] = max(0LL, tr[idx].get(i));\n }\n return ret;\n };\n\n auto rebuild = [&](int idx, std::vector<i64>& elm){\n while(tr[idx].size())\n tr[idx].erase(0);\n vector<pair<int,int>> v;\n for(int j = 0; j < packet; ++j){\n v.emplace_back(elm[j], j);\n }\n sort(v.begin(), v.end());\n for(int j = 0; j < packet; ++j)\n elm_idxes[idx][j] = v[j].second;\n for(auto& x : elm)\n tr[idx].insert(x);\n };\n\n\n for(int _ = 0; _ < m; ++_){\n i64 type, l, r, d;\n cin >> type >> l >> r >> d;\n --l;\n int l_idx = l / packet;\n int r_idx = r / packet;\n int l_mod = l % packet;\n int r_mod = r % packet;\n if(type == 1){\n if(l_idx == r_idx){\n auto elm = get_raw(l_idx);\n for(int i = l_mod; i < r_mod; ++i)\n elm[i] += d;\n rebuild(l_idx, elm);\n continue;\n }\n\n auto l_elm = get_raw(l_idx);\n for(int i = l_mod; i < packet; ++i)\n l_elm[i] += d;\n rebuild(l_idx, l_elm);\n\n auto r_elm = get_raw(r_idx);\n for(int i = 0; i < r_mod; ++i)\n r_elm[i] += d;\n rebuild(r_idx, r_elm);\n\n for(int i = l_idx + 1; i < r_idx; ++i)\n tr[i].add(0, packet, make_pair(d, false));\n }\n else{\n i64 ans = 0;\n\n if(l_idx == r_idx){\n auto elm = get_raw(l_idx);\n for(int i = l_mod; i < r_mod; ++i){\n ans += min(elm[i], d);\n elm[i] = max(0LL, elm[i] - d);\n }\n rebuild(l_idx, elm);\n cout << ans << endl;\n continue;\n }\n\n auto l_elm = get_raw(l_idx);\n for(int i = l_mod; i < packet; ++i){\n ans += min(l_elm[i], d);\n l_elm[i] = max(0LL, l_elm[i] - d);\n }\n rebuild(l_idx, l_elm);\n\n auto r_elm = get_raw(r_idx);\n for(int i = 0; i < r_mod; ++i){\n ans += min(r_elm[i], d);\n r_elm[i] = max(0LL, r_elm[i] - d);\n }\n rebuild(r_idx, r_elm);\n\n for(int i = l_idx + 1; i < r_idx; ++i){\n int l_bound = tr[i].lowerbound(0);\n int r_bound = tr[i].lowerbound(d);\n ans += tr[i].get(l_bound, r_bound);\n ans += (packet - r_bound) * d;\n tr[i].add(0, r_bound, make_pair(0, true));\n tr[i].add(r_bound, packet, make_pair(-d, false));\n\n }\n cout << ans << endl;\n }\n }\n}", "accuracy": 0.175, "time_ms": 10, "memory_kb": 10756, "score_of_the_acc": -0.0168, "final_rank": 19 }, { "submission_id": "aoj_0427_4089312", "code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\nusing i64 = long long;\nconst i64 MOD = 1e9+7;\nconst i64 INF = 1e18+7;\n\n\ntemplate <typename T>\nbool chmin(T& x, T y){\n if(x > y){\n x = y;\n return true;\n }\n return false;\n}\n\ntemplate <typename T>\nbool chmax(T& x, T y){\n if(x < y){\n x = y;\n return true;\n }\n return false;\n}\n\ntemplate <typename T, typename U = int>\nstruct Node{\n\n using np = Node<T, U>*;\n\n static np nil;\n\n T val;\n U lazy;\n uint32_t pri;\n\n int size;\n T sum;\n\n np l = nil;\n np r = nil;\n\n Node(T v, U OU = U()) : val(v), lazy(OU), pri(rndpri()), size(1), sum(v), l(nil), r(nil){}\n Node(T v, U OU, uint32_t p) : val(v), lazy(OU), pri(p), size(1), sum(v), l(nil), r(nil){}\n\n static uint32_t rndpri() {\n static uint32_t x = 123456789, y = 362436069, z = 521288629, w = time(0);\n uint32_t t = x ^ (x << 11);\n x = y;\n y = z;\n z = w;\n w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\n return max<uint32_t>(1, w & 0x3FFFFFFF);\n }\n};\n\n\ntemplate <typename T, typename U = int>\nclass Treap{\n\n using nt = Node<T, U>;\n using np = nt*;\n using F = function<T(T, T)>;\n using G = function<T(T, U, int)>;\n using H = function<U(U, U)>;\n\npublic:\n\n np root;\n bool is_list;\n F f;\n G g;\n H h;\n T OT;\n U OU;\n\n Treap(bool is_list, F f, G g, H h, T OT, U OU) : root(nt::nil), is_list(is_list), f(f), g(g), h(h), OT(OT), OU(OU){}\n\n Treap(T val, bool is_list, F f, G g, H h, T OT, U OU) : root(new nt(val)), is_list(is_list), f(f), g(g), h(h), OT(OT), OU(OU){}\n\n // 配列で初期化する\n Treap(vector<T> v, bool is_list, F f, G g, H h, T OT, U OU) : root(nt::nil), is_list(is_list), f(f), g(g), h(h), OT(OT), OU(OU){\n sort(v.begin(), v.end());\n for(auto& x : v)\n push_back(x);\n }\n\n static Treap make(bool is_list, F f = [](T x, T){return x;}, T OT = T(), G g = [](auto x, auto, auto){return x;}, H h = [](auto x, auto){return x;}, U OU = U()){\n assert(nt::nil != nullptr);\n return Treap(is_list, f, g, h, OT, OU);\n }\n\n static Treap make(T val, bool is_list, F f = [](auto x, auto){return x;}, T OT = T(), G g = [](auto x, auto, auto){return x;}, H h = [](auto x, auto){return x;}, U OU = U()){\n assert(nt::nil != nullptr);\n return Treap(val, is_list, f, g, h, OT, OU);\n }\n\n static Treap make(vector<T>& val, bool is_list, F f = [](auto x, auto){return x;}, T OT = T(), G g = [](auto x, auto, auto){return x;}, H h = [](auto x, auto){return x;}, U OU = U()){\n assert(nt::nil != nullptr);\n return Treap(val, is_list, f, g, h, OT, OU);\n }\n\n ~Treap(){\n /*\n clear();\n if(root != nt::nil)\n delete root;\n */\n }\n\n int _size(np x){return x == nt::nil ? 0 : x->size;}\n T _sum(np x){return x == nt::nil ? OT : x->sum;}\n\n np _update(np x){\n\n if(x == nt::nil)\n return x;\n\n if(is_list){\n _push(x);\n _push(x->l);\n _push(x->r);\n }\n\n x->sum = f(f(_sum(x->l), x->val), _sum(x->r));\n x->size = _size(x->l) + _size(x->r) + 1;\n return x;\n }\n\n void _push(np x){\n if(x->lazy == OU)\n return ;\n\n x->sum = g(x->sum, x->lazy, x->size);\n x->val = g(x->val, x->lazy, 1);\n\n if(x->l != nt::nil)\n x->l->lazy = h(x->l->lazy, x->lazy);\n if(x->r != nt::nil)\n x->r->lazy = h(x->r->lazy, x->lazy);\n\n x->lazy = OU;\n\n }\n\n np _merge(np l, np r){\n if(l == nt::nil || r ==nt::nil)\n return l == nt::nil ? r : l;\n\n if(l->pri > r->pri){\n l->r = _merge(l->r, r);\n return _update(l);\n }else{\n r->l = _merge(l, r->l);\n return _update(r);\n }\n }\n\n pair<np,np> _split(np x, int k){\n if(x == nt::nil)\n return make_pair(nt::nil, nt::nil);\n\n assert(0 <= k && k <= _size(x));\n\n if(k <= _size(x->l)){\n pair<np, np> s = _split(x->l, k);\n x->l = s.second;\n return make_pair(s.first, _update(x));\n\n }else{\n pair<np, np> s = _split(x->r, k - _size(x->l) - 1);\n x->r = s.first;\n return make_pair(_update(x), s.second);\n }\n }\n\n np _insert(np x, int k, T val){\n np l, r;\n tie(l, r) = _split(x, k);\n return _merge(_merge(l, new nt(val, OU)), r);\n }\n\n np _erase(np x, int k){\n np l, r, m;\n tie(l, r) = _split(x, k);\n tie(m, r) = _split(r, 1);\n if(m != nt::nil)\n delete m;\n return _merge(l, r);\n }\n\n void _set(np x, int k, T val){\n _update(x);\n\n if(k < _size(x->l))\n _set(x->l, k, val);\n else if(_size(x->l) == k)\n x->val = val;\n else\n _set(x->r, k - _size(x->l) - 1, val);\n\n _update(x);\n }\n\n void _add(np x, int l, int r, U val){\n _update(x);\n\n if(x == nt::nil)\n return ;\n l = max(l, 0);\n r = min(r, _size(x));\n\n int sl = _size(x->l);\n\n if(l >= r)\n return ;\n\n if (l == 0 && r == _size(x)){\n x->lazy = h(x->lazy, val);\n }\n else{\n if(l <= sl && sl < r)\n x->val = g(x->val, val, 1);\n\n _add(x->l, l, r, val);\n _add(x->r, l - sl - 1, r - sl - 1, val);\n }\n\n _update(x);\n }\n\n np _getnode(np x, int k){\n\n _update(x);\n\n assert(0 <= k && k < _size(x));\n\n if(k < _size(x->l))\n return _getnode(x->l, k);\n else if(_size(x->l) == k)\n return x;\n else\n return _getnode(x->r, k - _size(x->l) - 1);\n }\n\n T _get(np x, int k){\n return _getnode(x, k)->val;\n }\n\n T _rangesum(np x, int l, int r){\n _update(x);\n\n l = max(l, 0);\n r = min(r, _size(x));\n if(l >= r)\n return OT;\n if(l == 0 && r == _size(x))\n return _sum(x);\n\n int sl = _size(x->l);\n T ret = (l <= sl && sl < r ? x->val : OT);\n ret = f(_rangesum(x->l, l, r), ret);\n ret = f(ret, _rangesum(x->r, l - sl - 1, r - sl - 1));\n return ret;\n }\n\n int _lowerbound(np x, T val){\n _update(x);\n\n if(x == nt::nil)\n return 0;\n if(val <= x->val)\n return _lowerbound(x->l, val);\n else\n return _lowerbound(x->r,val) + _size(x->l) + 1;\n }\n\n int _upperbound(np x, T val){\n _update(x);\n\n if(x == nt::nil)\n return 0;\n if(val < x->val)\n return _upperbound(x->l, val);\n else\n return _upperbound(x->r,val) + _size(x->l) + 1;\n }\n\n np _insert(np x, T val){\n return _insert(x, _lowerbound(x, val), val);\n }\n\n void _clear(np x){\n if(x == nullptr || x == nt::nil)\n return;\n if(x->l != nt::nil){\n _clear(x->l);\n delete(x->l);\n x->l = nt::nil;\n }\n if(x->r != nt::nil){\n _clear(x->r);\n delete(x->r);\n x->r = nt::nil;\n }\n }\n\n void push_front(T val){\n root = _merge(new nt(val, OU), root);\n }\n\n void push_back(T val){\n root = _merge(root, new nt(val,OU));\n }\n\n void pop_front(){\n root = _split(root, 1).second;\n }\n\n void pop_back(){\n root = _split(root, _size(root) - 1).first;\n }\n\n // [0, k)と[k, size)に分割して, [k, size)側を返す\n Treap split_left(int k){\n np p;\n tie(root, p) = _split(root, k);\n return decltype(this)(f, g, h, p);\n }\n\n // [0, k)と[k, size)に分割して, [0, k)側を返す\n Treap split_right(int k){\n np p;\n tie(p, root) = _split(root, k);\n return decltype(this)(f, g, h, p);\n }\n\n // rootを含めたサイズの出力\n int size(){\n return (root == nt::nil ? 0 : root->size);\n }\n\n // k番目への代入\n void set(int k, T val){\n return _set(root, k, val);\n }\n\n // k番目への加算\n void add(int k, U val){\n assert(is_list);\n return _add(root, k, k + 1, val);\n }\n\n // [l, r)への一様加算\n void add(int l, int r, U val){\n return _add(root, l, r, val);\n }\n\n // k番目の取得\n T get(int k){\n return _get(root, k);\n }\n\n // [l, r)の総和 (同様の実装でRMQ等も可能)\n T get(int l, int r){\n return _rangesum(root, l, r);\n }\n\n // k番目への挿入\n void insert(int k, T val){\n assert(is_list);\n root = _insert(root, k, val);\n }\n\n // 適切な位置への挿入\n void insert(T val){\n root = _insert(root, val);\n }\n\n // val <= get(k) となるような最小のk\n int lowerbound(T val){\n return _lowerbound(root, val);\n }\n\n // val < get(k) となるような最小のk\n int upperbound(T val){\n return _upperbound(root, val);\n }\n\n // k番目の要素削除\n void erase(int k){\n root = _erase(root, k);\n }\n\n // 要素の全削除\n void clear(){\n if(root != nullptr && root != nt::nil){\n _clear(root);\n delete(root);\n root = nt::nil;\n }\n }\n};\n\nusing node_type = Node<i64, pair<i64, bool>>;\ntemplate<> node_type* node_type::nil = new node_type(0, make_pair(0, false), 0);\n\n\nsigned main(){\n int n;\n cin >> n;\n vector<int> a(n);\n for(auto& x : a)\n cin >> x;\n int m;\n cin >> m;\n\n constexpr int packet = 256;\n constexpr int size = (100100) / packet;\n\n auto f = [&](auto x, auto y){\n if(x.second != y.second)\n return y;\n if(y.second)\n return y;\n return make_pair(x.first + y.first, false);\n };\n\n vector<Treap<i64, pair<i64, bool>>> tr;\n vector<vector<i64>> elm_idxes(size, vector<i64>(packet));\n for(int i = 0; i < size; ++i){\n int st = packet * i;\n int en = packet * (i + 1);\n vector<i64> e;\n vector<pair<int,int>> v;\n for(int j = st; j < en; ++j){\n e.emplace_back(j < n ? a[j] : 1e9);\n v.emplace_back(e.back(), j - st);\n }\n sort(v.begin(), v.end());\n for(int j = 0; j < packet; ++j)\n elm_idxes[i][j] = v[j].second;\n auto t = Treap<i64, pair<i64, bool>>::make(e, false, [](auto x, auto y){return x + y;}, 0, [](auto x, auto y, int){return y.second ? 0 : x + y.first;}, f, make_pair(0, false));\n tr.emplace_back(move(t));\n }\n\n auto get_raw = [&](int idx){\n vector<i64> ret(packet, 0);\n for(int i = 0; i < packet; ++i){\n ret[elm_idxes[idx][i]] = tr[idx].get(i);\n }\n return ret;\n };\n\n auto rebuild = [&](int idx, std::vector<i64>& elm){\n while(tr[idx].size())\n tr[idx].erase(0);\n vector<pair<int,int>> v;\n for(int j = 0; j < packet; ++j){\n v.emplace_back(elm[j], j);\n }\n sort(v.begin(), v.end());\n for(int j = 0; j < packet; ++j)\n elm_idxes[idx][j] = v[j].second;\n for(auto& x : elm)\n tr[idx].insert(x);\n };\n\n\n for(int _ = 0; _ < m; ++_){\n i64 type, l, r, d;\n cin >> type >> l >> r >> d;\n --l;\n int l_idx = l / packet;\n int r_idx = r / packet;\n int l_mod = l % packet;\n int r_mod = r % packet;\n if(type == 1){\n if(l_idx == r_idx){\n auto elm = get_raw(l_idx);\n for(int i = l_mod; i < r_mod; ++i)\n elm[i] += d;\n rebuild(l_idx, elm);\n continue;\n }\n\n auto l_elm = get_raw(l_idx);\n for(int i = l_mod; i < packet; ++i)\n l_elm[i] += d;\n // TODO: rebuild\n rebuild(l_idx, l_elm);\n for(int i = l_idx + 1; i < r_idx; ++i){\n tr[i].add(0, packet, make_pair(d, false));\n }\n auto r_elm = get_raw(r_idx);\n for(int i = 0; i < r_mod; ++i)\n r_elm[i] += d;\n // TODO: rebuild\n rebuild(r_idx, r_elm);\n }\n else{\n i64 ans = 0;\n\n if(l_idx == r_idx){\n auto elm = get_raw(l_idx);\n for(int i = l_mod; i < r_mod; ++i){\n ans += min(elm[i], d);\n elm[i] = max(0LL, elm[i] - d);\n }\n rebuild(l_idx, elm);\n cout << ans << endl;\n continue;\n }\n\n auto l_elm = get_raw(l_idx);\n for(int i = l_mod; i < packet; ++i){\n ans += min(l_elm[i], d);\n l_elm[i] = max(0LL, l_elm[i] - d);\n }\n rebuild(l_idx, l_elm);\n\n auto r_elm = get_raw(r_idx);\n for(int i = 0; i < r_mod; ++i){\n ans += min(r_elm[i], d);\n r_elm[i] = max(0LL, r_elm[i] - d);\n }\n rebuild(r_idx, r_elm);\n\n for(int i = l_idx + 1; i < r_idx; ++i){\n int l_bound = tr[i].lowerbound(0);\n int r_bound = tr[i].lowerbound(d);\n ans += tr[i].get(l_bound, r_bound);\n ans += (packet - r_bound) * d;\n tr[i].add(0, r_bound, make_pair(0, true));\n tr[i].add(r_bound, packet, make_pair(-d, false));\n\n }\n cout << ans << endl;\n }\n }\n}", "accuracy": 0.2, "time_ms": 240, "memory_kb": 10348, "score_of_the_acc": -0.4898, "final_rank": 18 }, { "submission_id": "aoj_0427_4089308", "code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\nusing i64 = long long;\nconst i64 MOD = 1e9+7;\nconst i64 INF = 1e18+7;\n\n\ntemplate <typename T>\nbool chmin(T& x, T y){\n if(x > y){\n x = y;\n return true;\n }\n return false;\n}\n\ntemplate <typename T>\nbool chmax(T& x, T y){\n if(x < y){\n x = y;\n return true;\n }\n return false;\n}\n\ntemplate <typename T, typename U = int>\nstruct Node{\n\n using np = Node<T, U>*;\n\n static np nil;\n\n T val;\n U lazy;\n uint32_t pri;\n\n int size;\n T sum;\n\n np l = nil;\n np r = nil;\n\n Node(T v, U OU = U()) : val(v), lazy(OU), pri(rndpri()), size(1), sum(v), l(nil), r(nil){}\n Node(T v, U OU, uint32_t p) : val(v), lazy(OU), pri(p), size(1), sum(v), l(nil), r(nil){}\n\n static uint32_t rndpri() {\n static uint32_t x = 123456789, y = 362436069, z = 521288629, w = time(0);\n uint32_t t = x ^ (x << 11);\n x = y;\n y = z;\n z = w;\n w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\n return max<uint32_t>(1, w & 0x3FFFFFFF);\n }\n};\n\n\ntemplate <typename T, typename U = int>\nclass Treap{\n\n using nt = Node<T, U>;\n using np = nt*;\n using F = function<T(T, T)>;\n using G = function<T(T, U, int)>;\n using H = function<U(U, U)>;\n\npublic:\n\n np root;\n bool is_list;\n F f;\n G g;\n H h;\n T OT;\n U OU;\n\n Treap(bool is_list, F f, G g, H h, T OT, U OU) : root(nt::nil), is_list(is_list), f(f), g(g), h(h), OT(OT), OU(OU){}\n\n Treap(T val, bool is_list, F f, G g, H h, T OT, U OU) : root(new nt(val)), is_list(is_list), f(f), g(g), h(h), OT(OT), OU(OU){}\n\n // 配列で初期化する\n Treap(vector<T> v, bool is_list, F f, G g, H h, T OT, U OU) : root(nt::nil), is_list(is_list), f(f), g(g), h(h), OT(OT), OU(OU){\n sort(v.begin(), v.end());\n for(auto& x : v)\n push_back(x);\n }\n\n static Treap make(bool is_list, F f = [](T x, T){return x;}, T OT = T(), G g = [](auto x, auto, auto){return x;}, H h = [](auto x, auto){return x;}, U OU = U()){\n assert(nt::nil != nullptr);\n return Treap(is_list, f, g, h, OT, OU);\n }\n\n static Treap make(T val, bool is_list, F f = [](auto x, auto){return x;}, T OT = T(), G g = [](auto x, auto, auto){return x;}, H h = [](auto x, auto){return x;}, U OU = U()){\n assert(nt::nil != nullptr);\n return Treap(val, is_list, f, g, h, OT, OU);\n }\n\n static Treap make(vector<T>& val, bool is_list, F f = [](auto x, auto){return x;}, T OT = T(), G g = [](auto x, auto, auto){return x;}, H h = [](auto x, auto){return x;}, U OU = U()){\n assert(nt::nil != nullptr);\n return Treap(val, is_list, f, g, h, OT, OU);\n }\n\n ~Treap(){\n /*\n clear();\n if(root != nt::nil)\n delete root;\n */\n }\n\n int _size(np x){return x == nt::nil ? 0 : x->size;}\n T _sum(np x){return x == nt::nil ? OT : x->sum;}\n\n np _update(np x){\n\n if(x == nt::nil)\n return x;\n\n if(is_list){\n _push(x);\n _push(x->l);\n _push(x->r);\n }\n\n x->sum = f(f(_sum(x->l), x->val), _sum(x->r));\n x->size = _size(x->l) + _size(x->r) + 1;\n return x;\n }\n\n void _push(np x){\n if(x->lazy == OU)\n return ;\n\n x->sum = g(x->sum, x->lazy, x->size);\n x->val = g(x->val, x->lazy, 1);\n\n if(x->l != nt::nil)\n x->l->lazy = h(x->l->lazy, x->lazy);\n if(x->r != nt::nil)\n x->r->lazy = h(x->r->lazy, x->lazy);\n\n x->lazy = OU;\n\n }\n\n np _merge(np l, np r){\n if(l == nt::nil || r ==nt::nil)\n return l == nt::nil ? r : l;\n\n if(l->pri > r->pri){\n l->r = _merge(l->r, r);\n return _update(l);\n }else{\n r->l = _merge(l, r->l);\n return _update(r);\n }\n }\n\n pair<np,np> _split(np x, int k){\n if(x == nt::nil)\n return make_pair(nt::nil, nt::nil);\n\n assert(0 <= k && k <= _size(x));\n\n if(k <= _size(x->l)){\n pair<np, np> s = _split(x->l, k);\n x->l = s.second;\n return make_pair(s.first, _update(x));\n\n }else{\n pair<np, np> s = _split(x->r, k - _size(x->l) - 1);\n x->r = s.first;\n return make_pair(_update(x), s.second);\n }\n }\n\n np _insert(np x, int k, T val){\n np l, r;\n tie(l, r) = _split(x, k);\n return _merge(_merge(l, new nt(val, OU)), r);\n }\n\n np _erase(np x, int k){\n np l, r, m;\n tie(l, r) = _split(x, k);\n tie(m, r) = _split(r, 1);\n if(m != nt::nil)\n delete m;\n return _merge(l, r);\n }\n\n void _set(np x, int k, T val){\n _update(x);\n\n if(k < _size(x->l))\n _set(x->l, k, val);\n else if(_size(x->l) == k)\n x->val = val;\n else\n _set(x->r, k - _size(x->l) - 1, val);\n\n _update(x);\n }\n\n void _add(np x, int l, int r, U val){\n _update(x);\n\n if(x == nt::nil)\n return ;\n l = max(l, 0);\n r = min(r, _size(x));\n\n int sl = _size(x->l);\n\n if(l >= r)\n return ;\n\n if (l == 0 && r == _size(x)){\n x->lazy = h(x->lazy, val);\n }\n else{\n if(l <= sl && sl < r)\n x->val = g(x->val, val, 1);\n\n _add(x->l, l, r, val);\n _add(x->r, l - sl - 1, r - sl - 1, val);\n }\n\n _update(x);\n }\n\n np _getnode(np x, int k){\n\n _update(x);\n\n assert(0 <= k && k < _size(x));\n\n if(k < _size(x->l))\n return _getnode(x->l, k);\n else if(_size(x->l) == k)\n return x;\n else\n return _getnode(x->r, k - _size(x->l) - 1);\n }\n\n T _get(np x, int k){\n return _getnode(x, k)->val;\n }\n\n T _rangesum(np x, int l, int r){\n _update(x);\n\n l = max(l, 0);\n r = min(r, _size(x));\n if(l >= r)\n return OT;\n if(l == 0 && r == _size(x))\n return _sum(x);\n\n int sl = _size(x->l);\n T ret = (l <= sl && sl < r ? x->val : OT);\n ret = f(_rangesum(x->l, l, r), ret);\n ret = f(ret, _rangesum(x->r, l - sl - 1, r - sl - 1));\n return ret;\n }\n\n int _lowerbound(np x, T val){\n _update(x);\n\n if(x == nt::nil)\n return 0;\n if(val <= x->val)\n return _lowerbound(x->l, val);\n else\n return _lowerbound(x->r,val) + _size(x->l) + 1;\n }\n\n int _upperbound(np x, T val){\n _update(x);\n\n if(x == nt::nil)\n return 0;\n if(val < x->val)\n return _upperbound(x->l, val);\n else\n return _upperbound(x->r,val) + _size(x->l) + 1;\n }\n\n np _insert(np x, T val){\n return _insert(x, _lowerbound(x, val), val);\n }\n\n void _clear(np x){\n if(x == nullptr || x == nt::nil)\n return;\n if(x->l != nt::nil){\n _clear(x->l);\n delete(x->l);\n x->l = nt::nil;\n }\n if(x->r != nt::nil){\n _clear(x->r);\n delete(x->r);\n x->r = nt::nil;\n }\n }\n\n void push_front(T val){\n root = _merge(new nt(val, OU), root);\n }\n\n void push_back(T val){\n root = _merge(root, new nt(val,OU));\n }\n\n void pop_front(){\n root = _split(root, 1).second;\n }\n\n void pop_back(){\n root = _split(root, _size(root) - 1).first;\n }\n\n // [0, k)と[k, size)に分割して, [k, size)側を返す\n Treap split_left(int k){\n np p;\n tie(root, p) = _split(root, k);\n return decltype(this)(f, g, h, p);\n }\n\n // [0, k)と[k, size)に分割して, [0, k)側を返す\n Treap split_right(int k){\n np p;\n tie(p, root) = _split(root, k);\n return decltype(this)(f, g, h, p);\n }\n\n // rootを含めたサイズの出力\n int size(){\n return (root == nt::nil ? 0 : root->size);\n }\n\n // k番目への代入\n void set(int k, T val){\n return _set(root, k, val);\n }\n\n // k番目への加算\n void add(int k, U val){\n assert(is_list);\n return _add(root, k, k + 1, val);\n }\n\n // [l, r)への一様加算\n void add(int l, int r, U val){\n return _add(root, l, r, val);\n }\n\n // k番目の取得\n T get(int k){\n return _get(root, k);\n }\n\n // [l, r)の総和 (同様の実装でRMQ等も可能)\n T get(int l, int r){\n return _rangesum(root, l, r);\n }\n\n // k番目への挿入\n void insert(int k, T val){\n assert(is_list);\n root = _insert(root, k, val);\n }\n\n // 適切な位置への挿入\n void insert(T val){\n root = _insert(root, val);\n }\n\n // val <= get(k) となるような最小のk\n int lowerbound(T val){\n return _lowerbound(root, val);\n }\n\n // val < get(k) となるような最小のk\n int upperbound(T val){\n return _upperbound(root, val);\n }\n\n // k番目の要素削除\n void erase(int k){\n root = _erase(root, k);\n }\n\n // 要素の全削除\n void clear(){\n if(root != nullptr && root != nt::nil){\n _clear(root);\n delete(root);\n root = nt::nil;\n }\n }\n};\n\nusing node_type = Node<i64, pair<i64, bool>>;\ntemplate<> node_type* node_type::nil = new node_type(0, make_pair(0, false), 0);\n\n\nsigned main(){\n int n;\n cin >> n;\n vector<int> a(n);\n for(auto& x : a)\n cin >> x;\n int m;\n cin >> m;\n\n constexpr int packet = 2;\n constexpr int size = (100100) / packet;\n\n auto f = [&](auto x, auto y){\n if(x.second != y.second)\n return y;\n if(y.second)\n return y;\n return make_pair(x.first + y.first, false);\n };\n\n vector<Treap<i64, pair<i64, bool>>> tr;\n vector<vector<i64>> elm_idxes(size, vector<i64>(packet));\n for(int i = 0; i < size; ++i){\n int st = packet * i;\n int en = packet * (i + 1);\n vector<i64> e;\n vector<pair<int,int>> v;\n for(int j = st; j < en; ++j){\n e.emplace_back(j < n ? a[j] : 1e9);\n v.emplace_back(e.back(), j - st);\n }\n sort(v.begin(), v.end());\n for(int j = 0; j < packet; ++j)\n elm_idxes[i][j] = v[j].second;\n auto t = Treap<i64, pair<i64, bool>>::make(e, false, [](auto x, auto y){return x + y;}, 0, [](auto x, auto y, int){return y.second ? 0 : x + y.first;}, f, make_pair(0, false));\n tr.emplace_back(move(t));\n }\n\n auto get_raw = [&](int idx){\n vector<i64> ret(packet, 0);\n for(int i = 0; i < packet; ++i){\n ret[elm_idxes[idx][i]] = tr[idx].get(i);\n }\n return ret;\n };\n\n auto rebuild = [&](int idx, std::vector<i64>& elm){\n while(tr[idx].size())\n tr[idx].erase(0);\n vector<pair<int,int>> v;\n for(int j = 0; j < packet; ++j){\n v.emplace_back(elm[j], j);\n }\n sort(v.begin(), v.end());\n for(int j = 0; j < packet; ++j)\n elm_idxes[idx][j] = v[j].second;\n for(auto& x : elm)\n tr[idx].insert(x);\n };\n\n\n for(int _ = 0; _ < m; ++_){\n i64 type, l, r, d;\n cin >> type >> l >> r >> d;\n --l;\n int l_idx = l / packet;\n int r_idx = r / packet;\n int l_mod = l % packet;\n int r_mod = r % packet;\n if(type == 1){\n if(l_idx == r_idx){\n auto elm = get_raw(l_idx);\n for(int i = l_mod; i < r_mod; ++i)\n elm[i] += d;\n rebuild(l_idx, elm);\n continue;\n }\n\n auto l_elm = get_raw(l_idx);\n for(int i = l_mod; i < packet; ++i)\n l_elm[i] += d;\n // TODO: rebuild\n rebuild(l_idx, l_elm);\n for(int i = l_idx + 1; i < r_idx; ++i){\n tr[i].add(0, packet, make_pair(d, false));\n }\n auto r_elm = get_raw(r_idx);\n for(int i = 0; i < r_mod; ++i)\n r_elm[i] += d;\n // TODO: rebuild\n rebuild(r_idx, r_elm);\n }\n else{\n i64 ans = 0;\n\n if(l_idx == r_idx){\n auto elm = get_raw(l_idx);\n for(int i = l_mod; i < r_mod; ++i){\n ans += min(elm[i], d);\n elm[i] = max(0LL, elm[i] - d);\n }\n rebuild(l_idx, elm);\n cout << ans << endl;\n continue;\n }\n\n auto l_elm = get_raw(l_idx);\n for(int i = l_mod; i < packet; ++i){\n ans += min(l_elm[i], d);\n l_elm[i] = max(0LL, l_elm[i] - d);\n }\n rebuild(l_idx, l_elm);\n\n auto r_elm = get_raw(r_idx);\n for(int i = 0; i < r_mod; ++i){\n ans += min(r_elm[i], d);\n r_elm[i] = max(0LL, r_elm[i] - d);\n }\n rebuild(r_idx, r_elm);\n\n for(int i = l_idx + 1; i < r_idx; ++i){\n int l_bound = tr[i].lowerbound(0);\n int r_bound = tr[i].lowerbound(d);\n ans += tr[i].get(l_bound, r_bound);\n ans += (packet - r_bound) * d;\n tr[i].add(0, r_bound, make_pair(0, true));\n tr[i].add(r_bound, packet, make_pair(-d, false));\n\n }\n cout << ans << endl;\n }\n }\n}", "accuracy": 0.05, "time_ms": 10, "memory_kb": 18428, "score_of_the_acc": -0.3241, "final_rank": 20 }, { "submission_id": "aoj_0427_4089144", "code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\nusing i64 = long long;\nconst i64 MOD = 1e9+7;\nconst i64 INF = 1e18+7;\n\n\ntemplate <typename T>\nbool chmin(T& x, T y){\n if(x > y){\n x = y;\n return true;\n }\n return false;\n}\n\ntemplate <typename T>\nbool chmax(T& x, T y){\n if(x < y){\n x = y;\n return true;\n }\n return false;\n}\n\ntemplate <typename T, typename U = int>\nstruct Node{\n\n using np = Node<T, U>*;\n\n static np nil;\n\n T val;\n U lazy;\n uint32_t pri;\n\n int size;\n T sum;\n\n np l = nil;\n np r = nil;\n\n Node(T v, U OU = U()) : val(v), lazy(OU), pri(rndpri()), size(1), sum(v), l(nil), r(nil){}\n Node(T v, U OU, uint32_t p) : val(v), lazy(OU), pri(p), size(1), sum(v), l(nil), r(nil){}\n\n static uint32_t rndpri() {\n static uint32_t x = 123456789, y = 362436069, z = 521288629, w = time(0);\n uint32_t t = x ^ (x << 11);\n x = y;\n y = z;\n z = w;\n w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\n return max<uint32_t>(1, w & 0x3FFFFFFF);\n }\n};\n\n\ntemplate <typename T, typename U = int>\nclass Treap{\n\n using nt = Node<T, U>;\n using np = nt*;\n using F = function<T(T, T)>;\n using G = function<T(T, U, int)>;\n using H = function<U(U, U)>;\n\npublic:\n\n np root;\n bool is_list;\n F f;\n G g;\n H h;\n T OT;\n U OU;\n\n Treap(bool is_list, F f, G g, H h, T OT, U OU) : root(nt::nil), is_list(is_list), f(f), g(g), h(h), OT(OT), OU(OU){}\n\n Treap(T val, bool is_list, F f, G g, H h, T OT, U OU) : root(new nt(val)), is_list(is_list), f(f), g(g), h(h), OT(OT), OU(OU){}\n\n // 配列で初期化する\n Treap(vector<T> v, bool is_list, F f, G g, H h, T OT, U OU) : root(nt::nil), is_list(is_list), f(f), g(g), h(h), OT(OT), OU(OU){\n sort(v.begin(), v.end());\n for(auto& x : v)\n push_back(x);\n }\n\n static Treap make(bool is_list, F f = [](T x, T){return x;}, T OT = T(), G g = [](auto x, auto, auto){return x;}, H h = [](auto x, auto){return x;}, U OU = U()){\n assert(nt::nil != nullptr);\n return Treap(is_list, f, g, h, OT, OU);\n }\n\n static Treap make(T val, bool is_list, F f = [](auto x, auto){return x;}, T OT = T(), G g = [](auto x, auto, auto){return x;}, H h = [](auto x, auto){return x;}, U OU = U()){\n assert(nt::nil != nullptr);\n return Treap(val, is_list, f, g, h, OT, OU);\n }\n\n static Treap make(vector<T>& val, bool is_list, F f = [](auto x, auto){return x;}, T OT = T(), G g = [](auto x, auto, auto){return x;}, H h = [](auto x, auto){return x;}, U OU = U()){\n assert(nt::nil != nullptr);\n return Treap(val, is_list, f, g, h, OT, OU);\n }\n\n ~Treap(){\n /*\n clear();\n if(root != nt::nil)\n delete root;\n */\n }\n\n int _size(np x){return x == nt::nil ? 0 : x->size;}\n T _sum(np x){return x == nt::nil ? OT : x->sum;}\n\n np _update(np x){\n\n if(x == nt::nil)\n return x;\n\n if(is_list){\n _push(x);\n _push(x->l);\n _push(x->r);\n }\n\n x->sum = f(f(_sum(x->l), x->val), _sum(x->r));\n x->size = _size(x->l) + _size(x->r) + 1;\n return x;\n }\n\n void _push(np x){\n if(x->lazy == OU)\n return ;\n\n x->sum = g(x->sum, x->lazy, x->size);\n x->val = g(x->val, x->lazy, 1);\n\n if(x->l != nt::nil)\n x->l->lazy = h(x->l->lazy, x->lazy);\n if(x->r != nt::nil)\n x->r->lazy = h(x->r->lazy, x->lazy);\n\n x->lazy = OU;\n\n }\n\n np _merge(np l, np r){\n if(l == nt::nil || r ==nt::nil)\n return l == nt::nil ? r : l;\n\n if(l->pri > r->pri){\n l->r = _merge(l->r, r);\n return _update(l);\n }else{\n r->l = _merge(l, r->l);\n return _update(r);\n }\n }\n\n pair<np,np> _split(np x, int k){\n if(x == nt::nil)\n return make_pair(nt::nil, nt::nil);\n\n assert(0 <= k && k <= _size(x));\n\n if(k <= _size(x->l)){\n pair<np, np> s = _split(x->l, k);\n x->l = s.second;\n return make_pair(s.first, _update(x));\n\n }else{\n pair<np, np> s = _split(x->r, k - _size(x->l) - 1);\n x->r = s.first;\n return make_pair(_update(x), s.second);\n }\n }\n\n np _insert(np x, int k, T val){\n np l, r;\n tie(l, r) = _split(x, k);\n return _merge(_merge(l, new nt(val, OU)), r);\n }\n\n np _erase(np x, int k){\n np l, r, m;\n tie(l, r) = _split(x, k);\n tie(m, r) = _split(r, 1);\n if(m != nt::nil)\n delete m;\n return _merge(l, r);\n }\n\n void _set(np x, int k, T val){\n _update(x);\n\n if(k < _size(x->l))\n _set(x->l, k, val);\n else if(_size(x->l) == k)\n x->val = val;\n else\n _set(x->r, k - _size(x->l) - 1, val);\n\n _update(x);\n }\n\n void _add(np x, int l, int r, U val){\n _update(x);\n\n if(x == nt::nil)\n return ;\n l = max(l, 0);\n r = min(r, _size(x));\n\n int sl = _size(x->l);\n\n if(l >= r)\n return ;\n\n if (l == 0 && r == _size(x)){\n x->lazy = h(x->lazy, val);\n }\n else{\n if(l <= sl && sl < r)\n x->val = g(x->val, val, 1);\n\n _add(x->l, l, r, val);\n _add(x->r, l - sl - 1, r - sl - 1, val);\n }\n\n _update(x);\n }\n\n np _getnode(np x, int k){\n\n _update(x);\n\n assert(0 <= k && k < _size(x));\n\n if(k < _size(x->l))\n return _getnode(x->l, k);\n else if(_size(x->l) == k)\n return x;\n else\n return _getnode(x->r, k - _size(x->l) - 1);\n }\n\n T _get(np x, int k){\n return _getnode(x, k)->val;\n }\n\n T _rangesum(np x, int l, int r){\n _update(x);\n\n l = max(l, 0);\n r = min(r, _size(x));\n if(l >= r)\n return OT;\n if(l == 0 && r == _size(x))\n return _sum(x);\n\n int sl = _size(x->l);\n T ret = (l <= sl && sl < r ? x->val : OT);\n ret = f(_rangesum(x->l, l, r), ret);\n ret = f(ret, _rangesum(x->r, l - sl - 1, r - sl - 1));\n return ret;\n }\n\n int _lowerbound(np x, T val){\n _update(x);\n\n if(x == nt::nil)\n return 0;\n if(val <= x->val)\n return _lowerbound(x->l, val);\n else\n return _lowerbound(x->r,val) + _size(x->l) + 1;\n }\n\n int _upperbound(np x, T val){\n _update(x);\n\n if(x == nt::nil)\n return 0;\n if(val < x->val)\n return _upperbound(x->l, val);\n else\n return _upperbound(x->r,val) + _size(x->l) + 1;\n }\n\n np _insert(np x, T val){\n return _insert(x, _lowerbound(x, val), val);\n }\n\n void _clear(np x){\n if(x == nullptr || x == nt::nil)\n return;\n if(x->l != nt::nil){\n _clear(x->l);\n delete(x->l);\n x->l = nt::nil;\n }\n if(x->r != nt::nil){\n _clear(x->r);\n delete(x->r);\n x->r = nt::nil;\n }\n }\n\n void push_front(T val){\n root = _merge(new nt(val, OU), root);\n }\n\n void push_back(T val){\n root = _merge(root, new nt(val,OU));\n }\n\n void pop_front(){\n root = _split(root, 1).second;\n }\n\n void pop_back(){\n root = _split(root, _size(root) - 1).first;\n }\n\n // [0, k)と[k, size)に分割して, [k, size)側を返す\n Treap split_left(int k){\n np p;\n tie(root, p) = _split(root, k);\n return decltype(this)(f, g, h, p);\n }\n\n // [0, k)と[k, size)に分割して, [0, k)側を返す\n Treap split_right(int k){\n np p;\n tie(p, root) = _split(root, k);\n return decltype(this)(f, g, h, p);\n }\n\n // rootを含めたサイズの出力\n int size(){\n return (root == nt::nil ? 0 : root->size);\n }\n\n // k番目への代入\n void set(int k, T val){\n return _set(root, k, val);\n }\n\n // k番目への加算\n void add(int k, U val){\n assert(is_list);\n return _add(root, k, k + 1, val);\n }\n\n // [l, r)への一様加算\n void add(int l, int r, U val){\n return _add(root, l, r, val);\n }\n\n // k番目の取得\n T get(int k){\n return _get(root, k);\n }\n\n // [l, r)の総和 (同様の実装でRMQ等も可能)\n T get(int l, int r){\n return _rangesum(root, l, r);\n }\n\n // k番目への挿入\n void insert(int k, T val){\n assert(is_list);\n root = _insert(root, k, val);\n }\n\n // 適切な位置への挿入\n void insert(T val){\n root = _insert(root, val);\n }\n\n // val <= get(k) となるような最小のk\n int lowerbound(T val){\n return _lowerbound(root, val);\n }\n\n // val < get(k) となるような最小のk\n int upperbound(T val){\n return _upperbound(root, val);\n }\n\n // k番目の要素削除\n void erase(int k){\n root = _erase(root, k);\n }\n\n // 要素の全削除\n void clear(){\n if(root != nullptr && root != nt::nil){\n _clear(root);\n delete(root);\n root = nt::nil;\n }\n }\n};\n\nusing node_type = Node<i64, pair<i64, bool>>;\ntemplate<> node_type* node_type::nil = new node_type(0, make_pair(0, false), 0);\n\n\nsigned main(){\n int n;\n cin >> n;\n vector<int> a(n);\n for(auto& x : a)\n cin >> x;\n int m;\n cin >> m;\n\n constexpr int packet = 512;\n constexpr int size = (100000 + packet - 1) / 512;\n\n vector<Treap<i64, pair<i64, bool>>> tr;\n vector<vector<i64>> elm_idxes(size, vector<i64>(packet));\n for(int i = 0; i < size; ++i){\n int st = packet * i;\n int en = packet * (i + 1);\n vector<i64> e;\n vector<pair<int,int>> v;\n for(int j = st; j < en; ++j){\n e.emplace_back(j < n ? a[j] : 0);\n v.emplace_back(e.back(), j);\n }\n sort(v.begin(), v.end());\n for(int j = 0; j < packet; ++j)\n elm_idxes[i][j] = v[j].second;\n auto t = Treap<i64, pair<i64, bool>>::make(e, false, [](auto x, auto y){return x + y;}, 0, [](auto x, auto y, int){return y.second ? 0 : x + y.first;}, [](auto x, auto y){return make_pair(x.first + y.first, x.second | y.second);}, make_pair(0, false));\n tr.emplace_back(move(t));\n }\n\n auto get_raw = [&](int idx){\n vector<i64> ret(packet, 0);\n for(int i = 0; i < packet; ++i){\n ret[elm_idxes[idx][i]] = tr[idx].get(i);\n }\n return ret;\n };\n\n auto rebuild = [&](int idx, std::vector<i64>& elm){\n while(tr[idx].size())\n tr[idx].erase(0);\n vector<pair<int,int>> v;\n for(int j = 0; j < packet; ++j){\n v.emplace_back(elm[j], j);\n }\n sort(v.begin(), v.end());\n for(int j = 0; j < packet; ++j)\n elm_idxes[idx][j] = v[j].second;\n for(auto& x : elm)\n tr[idx].insert(x);\n };\n\n for(int _ = 0; _ < m; ++_){\n i64 type, l, r, d;\n cin >> type >> l >> r >> d;\n --l;\n int l_idx = l / packet;\n int r_idx = r / packet;\n int l_mod = l % packet;\n int r_mod = r % packet;\n if(type == 1){\n if(l_idx == r_idx){\n auto elm = get_raw(l_idx);\n for(int i = l_mod; i < r_mod; ++i)\n elm[i] += d;\n rebuild(l_idx, elm);\n continue;\n }\n\n auto l_elm = get_raw(l_idx);\n for(int i = l_mod; i < packet; ++i)\n l_elm[i] += d;\n // TODO: rebuild\n rebuild(l_idx, l_elm);\n for(int i = l_idx; i < r_idx; ++i){\n tr[i].add(0, packet, make_pair(d, false));\n }\n auto r_elm = get_raw(r_idx);\n for(int i = 0; i < r_mod; ++i)\n r_elm[i] += d;\n // TODO: rebuild\n rebuild(r_idx, r_elm);\n }\n else{\n i64 ans = 0;\n\n if(l_idx == r_idx){\n auto elm = get_raw(l_idx);\n for(int i = l_mod; i < r_mod; ++i){\n ans += min(elm[i], d);\n elm[i] = max(0LL, elm[i] - d);\n }\n rebuild(l_idx, elm);\n cout << ans << endl;\n continue;\n }\n\n auto l_elm = get_raw(l_idx);\n for(int i = l_mod; i < packet; ++i){\n ans += min(l_elm[i], d);\n l_elm[i] = max(0LL, l_elm[i] - d);\n }\n rebuild(l_idx, l_elm);\n\n auto r_elm = get_raw(r_idx);\n for(int i = 0; i < r_mod; ++i){\n ans += min(r_elm[i], d);\n r_elm[i] = max(0LL, r_elm[i] - d);\n }\n rebuild(r_idx, r_elm);\n\n for(int i = l_idx; i < r_idx; ++i){\n int l_bound = tr[i].lowerbound(0);\n int r_bound = tr[i].lowerbound(d);\n ans += tr[i].get(l_bound, r_bound);\n ans += (packet - r_bound) * d;\n tr[i].add(0, packet, make_pair(0, true));\n }\n cout << ans << endl;\n }\n }\n}", "accuracy": 0.2, "time_ms": 20, "memory_kb": 10336, "score_of_the_acc": -0.0213, "final_rank": 17 } ]
aoj_0425_cpp
Chemical Substance Alpha At Aizu Pharmaceutical, we are constantly researching chemical substances. The chemical we are currently researching is code-named "alpha," which has a structure consisting of molecules numbered $1$ through $N$ arranged in a straight line from leftmost to rightmost. Using the technology developed by Aizu Pharmaceuticals, the positions of the molecules that make up Alpha can be swapped. The swapping can only be done in a fixed procedure, but it can also be started and finished in the middle of that procedure. Let's write (a,b) for the operation of swapping the a-th and b-th molecules from the left end. For example, if $N=5$ and the fixed sequence is (1,3),(2,5),(4,3),(1,5), you can start with the first operation (1,3) and end with the third operation (4,3), or you can start with the second operation (2,5) and end with the fourth operation (1,5). You have chosen the start and end positions in the alpha molecule replacement procedure to run the simulation and investigate the state of the molecule after the replacement. You are given an alpha molecular replacement procedure. Write a program that answers questions about the position of the molecule in each simulation when you run the simulation several times. The questions can be of the form 1. or 2. below. What was the initial position of the molecule that is the i-th position from the left end after the end of the simulation? What position does the molecule that was initially positioned i-th come to after termination? Note that each simulation starts from the initial state of alpha (molecules numbered $1$ to $N$ are lined up in a straight line from the leftmost to the rightmost position). Input The input is given in the following form. $N$ $K$ $Q$ $a_1$ $b_1$ $a_2$ $b_2$ : $a_K$ $b_K$ $query_1$ $query_2$ : $query_Q$ The first line gives the number of molecules in alpha $N$ ($2 \leq N \leq 100,000$), the length of the swapping procedure $K$ ($1 \leq K \leq 100,000$), and the number of times to check the state of the molecules after swapping $Q$ ($1 \leq Q \leq 100,000$). In the following $K$ lines, each operation $a_i,b_i$ ($1 \leq a_i,b_i\leq N, a_i \ne b_i$) in the transposition procedure is given. $i$-th operation represents the operation to transpose the $a_i$-th and $b_i$-th molecules from the left end. In the following $Q$ lines, questions are given asking the state of the molecules after the swap. Each $query_i$ is given in one of the following forms. 1 $s$ $t$ $x$ or 2 $s$ $t$ $x$ If the first number is 1, it represents a question that asks what the number of the $x$-th molecule from the left side ($1 \leq x \leq N$) is after performing the transposition from $s$-th to $t$-th ($1 \leq s \leq t \leq K$) in the transposition procedure. If the first number is 2, it represents a question that asks where is the $x$-th ($1 \leq x \leq N$) molecule from the left side after performing the transposition in the transposition procedure from $s$-th to $t$-th ($1 \leq s \leq t \le ...(truncated)
[ { "submission_id": "aoj_0425_11004563", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)\n\nint main() {\n\tcin.tie(nullptr);\n\tios_base::sync_with_stdio(false);\n\t\n\tint N, K, Q;\n\tcin >> N >> K >> Q;\n\t\n\tint Bsiz = sqrt(K) + 1;\n\tvector<vector<pair<int, int>>> B(Bsiz);\n\trep(i, 0, K) {\n\t\tint a, b;\n\t\tcin >> a >> b;\n\t\t--a, --b;\n\t\tB[i / Bsiz].push_back({a, b});\n\t}\n\t\n\tvector<unordered_map<int, int>> nex(Bsiz), pre(Bsiz);\n\trep(i, 0, Bsiz) {\n\t\tint siz = B[i].size();\n\t\trep(j, 0, siz) {\n\t\t\tif (!nex[i].count(B[i][j].first)) nex[i][B[i][j].first] = B[i][j].first;\n\t\t\tif (!nex[i].count(B[i][j].second)) nex[i][B[i][j].second] = B[i][j].second;\n\t\t\tswap(nex[i][B[i][j].first], nex[i][B[i][j].second]);\n\t\t}\n\t\tfor (int j = siz - 1; j >= 0; --j) {\n\t\t\tif (!pre[i].count(B[i][j].first)) pre[i][B[i][j].first] = B[i][j].first;\n\t\t\tif (!pre[i].count(B[i][j].second)) pre[i][B[i][j].second] = B[i][j].second;\n\t\t\tswap(pre[i][B[i][j].first], pre[i][B[i][j].second]);\n\t\t}\n\t}\n\t\n\trep(query, 0, Q) {\n\t\tint ord, s, t, x;\n\t\tcin >> ord >> s >> t >> x;\n\t\t--s, --t, --x;\n\t\t\n\t\tint res = x;\n\t\tif (ord == 1) {\n\t\t\tif (s / Bsiz == t / Bsiz) {\n\t\t\t\tfor (int i = t; i >= s; --i) {\n\t\t\t\t\tif ((res == B[s/Bsiz][i%Bsiz].first)) res = B[s/Bsiz][i%Bsiz].second;\n\t\t\t\t\telse if ((res == B[s/Bsiz][i%Bsiz].second)) res = B[s/Bsiz][i%Bsiz].first;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\twhile (true) {\n\t\t\t\t\tif ((res == B[t/Bsiz][t%Bsiz].first)) res = B[t/Bsiz][t%Bsiz].second;\n\t\t\t\t\telse if ((res == B[t/Bsiz][t%Bsiz].second)) res = B[t/Bsiz][t%Bsiz].first;\n\t\t\t\t\t--t;\n\t\t\t\t\tif (t % Bsiz == Bsiz - 1) break;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\twhile (true) {\n\t\t\t\t\tif (s / Bsiz == t / Bsiz) break;\n\t\t\t\t\tif (nex[t/Bsiz].count(res)) res = nex[t/Bsiz][res];\n\t\t\t\t\tt -= Bsiz;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tfor (int i = t; i >= s; --i) {\n\t\t\t\t\tif ((res == B[t/Bsiz][i%Bsiz].first)) res = B[t/Bsiz][i%Bsiz].second;\n\t\t\t\t\telse if ((res == B[t/Bsiz][i%Bsiz].second)) res = B[t/Bsiz][i%Bsiz].first;\n\t\t\t\t}\n\t\t\t}\n\t\t} else {\n\t\t\tif (s / Bsiz == t / Bsiz) {\n\t\t\t\tfor (int i = s; i <= t; ++i) {\n\t\t\t\t\tif ((res == B[s/Bsiz][i%Bsiz].first)) res = B[s/Bsiz][i%Bsiz].second;\n\t\t\t\t\telse if ((res == B[s/Bsiz][i%Bsiz].second)) res = B[s/Bsiz][i%Bsiz].first;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\twhile (true) {\n\t\t\t\t\tif ((res == B[s/Bsiz][s%Bsiz].first)) res = B[s/Bsiz][s%Bsiz].second;\n\t\t\t\t\telse if ((res == B[s/Bsiz][s%Bsiz].second)) res = B[s/Bsiz][s%Bsiz].first;\n\t\t\t\t\t++s;\n\t\t\t\t\tif (s % Bsiz == 0) break;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\twhile (true) {\n\t\t\t\t\tif (s / Bsiz == t / Bsiz) break;\n\t\t\t\t\tif (pre[s/Bsiz].count(res)) res = pre[s/Bsiz][res];\n\t\t\t\t\ts += Bsiz;\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tfor (int i = s; i <= t; ++i) {\n\t\t\t\t\tif ((res == B[s/Bsiz][i%Bsiz].first)) res = B[s/Bsiz][i%Bsiz].second;\n\t\t\t\t\telse if ((res == B[s/Bsiz][i%Bsiz].second)) res = B[s/Bsiz][i%Bsiz].first;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tcout << res + 1 << '\\n';\n\t}\n}", "accuracy": 1, "time_ms": 1820, "memory_kb": 20360, "score_of_the_acc": -1.086, "final_rank": 16 }, { "submission_id": "aoj_0425_10946331", "code_snippet": "//#pragma GCC target (\"avx2\")\n//#pragma GCC optimize(\"O3\")\n//#pragma GCC optimize(\"unroll-loops\")\n//#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<queue>\n#include<cmath>\n#include<map>\n#include<set>\n#include<list>\n#include<iomanip>\n#include<vector>\n#include<random>\n#include<functional>\n#include<algorithm>\n#include<stack>\n#include<cstdio>\n#include<cstring>\n#include<bitset>\n#include<unordered_map>\n#include<climits>\n#include<fstream>\n#include<complex>\n#include<time.h>\n#include<cassert>\n#include<functional>\n#include<numeric>\n#include<tuple>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing H = pair<ll, ll>;\nusing P = pair<ll, H>;\nusing vi = vector<ll>;\n#define all(a) (a).begin(),(a).end()\n#define fs first\n#define sc second\n#define xx first\n#define yy second.first\n#define zz second.second\n#define Q(i,j,k) mkp((i),mkp((j),(k)))\n#define rng(i,s,n) for(ll i = (s) ; i < (n) ; i++)\n#define rep(i,n) rng(i, 0, (n))\n#define mkp make_pair\n#define vec vector\n#define pb emplace_back\n#define siz(a) int((a).size())\n#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())\n#define getidx(b,i) (lower_bound(all((b)),(i))-(b).begin())\n#define ssp(i,n) (i==(ll)(n)-1?\"\\n\":\" \")\n#define ctoi(c) (int)((c)-'0')\n#define itoc(c) (char)((c)+'0')\n#define cyes printf(\"Yes\\n\")\n#define cno printf(\"No\\n\")\n#define cdf(n) for(int quetimes_=(n);quetimes_>0;quetimes_--)\n#define gcj printf(\"Case #%lld: \",quetimes_+1)\n#define readv(a,n) (a).resize((n),0);rep(i,(n)) (a)[i]=read()\n#define found(a,x) (a.find(x)!=a.end())\nconstexpr ll mod = (ll)1e9 + 7;\nconstexpr ll Mod = 998244353;\nconstexpr ld EPS = 1e-10;\nconstexpr ll inf = (ll)3 * 1e18;\nconstexpr int Inf = (ll)15 * 1e8;\nconstexpr int dx[] = { -1,1,0,0 }, dy[] = { 0,0,-1,1 };\ntemplate<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }\nll read() { ll u, k = scanf(\"%lld\", &u); return u; }\nstring reads() { string s; cin >> s; return s; }\nH readh(short g = 0) { H u; int k = scanf(\"%lld %lld\", &u.fs, &u.sc); if (g == 1) u.fs--, u.sc--; if (g == 2) u.fs--; return u; }\nbool ina(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }\nbool ina(int t, int l, int r) { return l <= t && t < r; }\nll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }\nll ppc(ll x) {\n int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;\n return sum;\n}\ntemplate<typename T>\nvoid fin(T x) { cout << x << endl; exit(0); }\n\ntemplate<typename T>\nclass csum {\n vec<T> v;\npublic:\n csum(vec<T>& a) :v(a) { build(); }\n csum() {}\n csum(int sz) { init(sz); }\n void init(int sz) { v = vector<T>(sz + 1, 0); }\n void init(vec<T>& a) { v = a; build(); }\n void build() {\n for (int i = 1; i < v.size(); i++) v[i] += v[i - 1];\n }\n void add(int l, int r, T x) {\n v[l] += x;\n v[r] -= x;\n }//[l,r)\n void add(int t, T x) {\n v[t] += x;\n }//[l,r)\n //[l,r]\n T a(int l, int r) {\n if (r < l) return 0;\n return v[r] - (l == 0 ? 0 : v[l - 1]);\n }\n //[l,r)\n T b(int l, int r) {\n return a(l, r - 1);\n }\n T a(pair<int, int>t) {\n return a(t.first, t.second);\n }\n T b(pair<int, int>t) {\n return b(t.first, t.second);\n }\n T operator[](int x)const {\n return v[x];\n }\n};\nclass via {\n using H = pair<ll, ll>;\n bool comp;\npublic:\n vector<H>a;\n via() :comp(true) {}\n via(vector<H>dat) :a(dat), comp(false) { build(); }\n void push(int l, int r) { a.push_back(H{ l,r }); comp = false; }\n void push(H a) { push(a.first, a.second); }\n void build() {\n if (comp) return;\n comp = true;\n sort(a.begin(), a.end());\n int fst = -1; ll lst = -1;\n vector<H>b;\n for (int i = 0; i < a.size(); i++) {\n if (fst < 0) fst = i, lst = a[i].second;\n if (lst < a[i].first) {\n b.push_back(H{ a[fst].first,lst });\n fst = i, lst = a[i].second;\n }\n else if (lst < a[i].second) lst = a[i].second;\n }\n if (~fst) b.push_back(H{ a[fst].first, lst });\n a = b;\n }\n ll size() { return ll(a.size()); }\n ll sum() {\n build();\n ll sum = 0;\n for (auto g : a) sum += g.second - g.first;\n return sum;\n }\n via inter(via& v) {\n build(); v.build();\n via ret;\n for (auto g : a) ret.push(g);\n for (auto g : v.a) ret.push(g);\n ret.build(); return ret;\n }\n via comb(via& v) {\n build(); v.build();\n int s = 0, t = 0;\n via ret;\n while (s < a.size() && t < v.size()) {\n if (v[t].second <= a[s].first) t++;\n else if (a[s].second <= v[t].first) s++;\n else {\n ret.push(max(a[s].first, v[t].first), min(a[s].second, v[t].second));\n if (a[s].second <= v[t].second) s++;\n else t++;\n }\n }\n return ret;\n }\n H& operator[](int t) { return a[t]; }\n};\ntemplate<ll mod>\nclass modint {\npublic:ll v;\n modint(ll v = 0) { s(v % mod + mod); }\n constexpr static int fn_ = (ll)2e6 + 5;\n static vector<modint>fact, comp;\n modint pow(ll x) const {\n modint b(v), c(1);\n while (x) {\n if (x & 1) c *= b;\n b *= b;\n x >>= 1;\n }\n return c;\n }\n inline modint& s(int vv) {\n v = vv < mod ? vv : vv - mod;\n return *this;\n }\n inline modint inv()const { return pow(mod - 2); }\n inline modint operator-()const { return modint() - *this; }\n inline modint& operator+=(const modint b) { return s(v + b.v); }\n inline modint& operator-=(const modint b) { return s(v + mod - b.v); }\n inline modint& operator*=(const modint b) { v = v * b.v % mod; return *this; }\n inline modint& operator/=(const modint b) { v = v * b.inv().v % mod; return *this; }\n inline modint operator+(const modint& b) const { return modint(v) += b; }\n inline modint operator-(const modint& b) const { return modint(v) -= b; }\n inline modint operator*(const modint& b) const { return modint(v) *= b; }\n inline modint operator/(const modint& b) const { return modint(v) /= b; }\n friend ostream& operator<<(ostream& os, const modint& m) {\n return os << m.v;\n }\n friend istream& operator>>(istream& is, modint& m) {\n int x; is >> x; m = modint(x);\n return is;\n }\n bool operator<(const modint& r)const { return v < r.v; }\n bool operator>(const modint& r)const { return v > r.v; }\n bool operator<=(const modint& r)const { return v <= r.v; }\n bool operator>=(const modint& r)const { return v >= r.v; }\n bool operator==(const modint& r)const { return v == r.v; }\n bool operator!=(const modint& r)const { return v != r.v; }\n explicit operator bool()const { return v; }\n explicit operator int()const { return v; }\n modint comb(modint k) {\n if (k > *this) return modint();\n if (fact.empty()) combinit();\n if (v >= fn_) {\n if (k > *this - k) k = *this - k;\n modint tmp(1);\n for (int i = v; i >= v - k.v + 1; i--) tmp *= modint(i);\n return tmp * comp[k.v];\n }\n return fact[v] * comp[k.v] * comp[v - k.v];\n }//nCk\n modint perm(modint k) {\n if (k > *this) return modint();\n if (fact.empty()) combinit();\n if (v >= fn_) {\n modint tmp(1);\n for (int i = v; i >= v - k.v + 1; i--) tmp *= modint(i);\n return tmp;\n }\n return fact[v] * comp[v - k.v];\n }//nPk\n static void combinit() {\n fact.assign(fn_, modint());\n fact[0] = 1;\n for (int i = 1; i < fn_; i++) fact[i] = fact[i - 1] * modint(i);\n comp.assign(fn_, modint());\n comp[fn_ - 1] = fact[fn_ - 1].inv();\n for (int i = fn_ - 2; i >= 0; i--) comp[i] = comp[i + 1] * modint(i + 1);\n }\n};\nusing mint = modint<ll(1e9 + 7)>; template<>vec<mint> mint::fact = vec<mint>(); template<>vec<mint> mint::comp = vec<mint>();\n//--------------------------------------------------------------\n//--------------------------------------------------------------\n\nint n, k, q;\nint rr;\n//from, to\nvec<vi>a, b;\n\nvoid query(int i, int s, int t, int l, int r, int& x) {\n if (t <= l || r <= s) return;\n if (s <= l && r <= t) {\n int k = lower_bound(all(a[i]), x) - a[i].begin();\n if (k < siz(a[i]) && a[i][k] == x) x = b[i][k];\n return;\n }\n query(i * 2, s, t, l, (l + r) >> 1, x);\n query(i * 2 + 1, s, t, (l + r) >> 1, r, x);\n}\n\nsigned main() {\n cin >> n >> k >> q;\n rr = 1; while(rr < k) rr <<= 1;\n a.resize(2 * rr); b.resize(2 * rr);\n rep(i, k) {\n int s, t; cin >> s >> t;\n if (s > t) swap(s, t);\n a[rr + i].pb(s); a[rr + i].pb(t);\n b[rr + i].pb(t); b[rr + i].pb(s);\n }\n\n for (int i = rr - 1; i >= 0; i--) {\n merge(all(a[i * 2]), all(a[i * 2 + 1]), back_inserter(a[i]));\n a[i].erase(unique(all(a[i])), a[i].end()); \n b[i].erase(unique(all(b[i])), b[i].end());\n b[i] = a[i];\n rep(j, siz(a[i * 2])) {\n b[i][getidx(a[i], a[i * 2][j])] = b[i * 2][j];\n }\n rep(j, siz(a[i])) {\n int k = lower_bound(all(a[i * 2 + 1]), b[i][j]) - a[i * 2 + 1].begin();\n if (k < siz(a[i * 2 + 1]) && a[i * 2 + 1][k] == b[i][j]) {\n b[i][j] = b[i * 2 + 1][k];\n }\n }\n }\n\n struct st {\n int k, s, t, x;\n };\n vec<st>qry;\n vi ans(q);\n rep(i, q) {\n int c, s, t, x; cin >> c >> s >> t >> x;\n qry.pb(st{ c,s,t,x });\n s--;\n if (c == 2) {\n query(1, s, t, 0, rr, x);\n ans[i] = x;\n }\n }\n\n for (int i = 0; i < rr; i++) a[i].clear(), b[i].clear();\n rng(i, rr, rr + k / 2) {\n swap(a[i], a[(rr + k) - (i - rr) - 1]);\n swap(b[i], b[(rr + k) - (i - rr) - 1]);\n }\n for (int i = rr - 1; i >= 0; i--) {\n merge(all(a[i * 2]), all(a[i * 2 + 1]), back_inserter(a[i]));\n a[i].erase(unique(all(a[i])), a[i].end());\n b[i].erase(unique(all(b[i])), b[i].end());\n b[i] = a[i];\n rep(j, siz(a[i * 2])) {\n b[i][getidx(a[i], a[i * 2][j])] = b[i * 2][j];\n }\n rep(j, siz(a[i])) {\n int k = lower_bound(all(a[i * 2 + 1]), b[i][j]) - a[i * 2 + 1].begin();\n if (k < siz(a[i * 2 + 1]) && a[i * 2 + 1][k] == b[i][j]) {\n b[i][j] = b[i * 2 + 1][k];\n }\n }\n }\n\n rep(i, q) {\n int c, s, t, x; \n c = qry[i].k;\n s = qry[i].s;\n t = qry[i].t;\n x = qry[i].x;\n if (c == 1) {\n query(1, k - t, k - s + 1, 0, rr, x);\n ans[i] = x;\n }\n }\n\n rep(i, q) cout << ans[i] << endl;\n}", "accuracy": 1, "time_ms": 670, "memory_kb": 81468, "score_of_the_acc": -0.8332, "final_rank": 14 }, { "submission_id": "aoj_0425_9803525", "code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<(n);++i)\nusing namespace std;using ll=long long;\n#define P push_back\n#define C back\n#define e second\nint main(){ios::sync_with_stdio(false);cin.tie(nullptr);int N,K,Q;cin>>N>>K>>Q;vector<vector<pair<int,int>>>A(N),B(N);rep(i,N)A[i].P({0,i}),B[i].P({0,i});rep(i,K){int a,b;cin>>a>>b;a--;b--;B[A[a].C().e].P({i+1,b});B[A[b].C().e].P({i+1,a});int c=A[a].C().e,d=A[b].C().e;A[a].P({i+1,d});A[b].P({i+1,c});}while(Q--){int o,s,t,x;cin>>o>>s>>t>>x;x--;t++;auto i=prev(upper_bound(A[x].begin(),A[x].end(),make_pair(o==1?t:s,-1)));auto j=prev(upper_bound(B[i->e].begin(),B[i->e].end(),make_pair(o==1?s:t,-1)));cout<<j->e+1<<\"\\n\";}}", "accuracy": 1, "time_ms": 70, "memory_kb": 18316, "score_of_the_acc": -0.0897, "final_rank": 5 }, { "submission_id": "aoj_0425_9797425", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(n);++i)\nusing namespace std;\nusing ll = long long;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n int N,K,Q;\n cin >> N >> K >> Q;\n\n vector<vector<pair<int,int>>> A(N);\n rep(i,N) A[i].push_back(make_pair(0,i));\n vector<vector<pair<int,int>>> B(N);\n rep(i,N) B[i].push_back(make_pair(0,i));\n\n rep(i,K){\n int a,b;\n cin >> a >> b;\n a--;b--;\n\n\n\n B[A[a].back().second].push_back(make_pair(i+1,b));\n B[A[b].back().second].push_back(make_pair(i+1,a));\n \n int c = A[a].back().second;\n int d = A[b].back().second;\n A[a].push_back(make_pair(i+1,d));\n A[b].push_back(make_pair(i+1,c));\n }\n\n rep(qi,Q){\n int o,s,t,x;\n cin >> o >> s >> t >> x;\n x--;t++;\n if(o==1){\n int r = prev(upper_bound(A[x].begin(),A[x].end(),make_pair(t,-1)))->second;\n int li = prev(upper_bound(B[r].begin(),B[r].end(),make_pair(s,-1)))->second;\n\n cout << li+1 << \"\\n\";\n }\n else{\n int l = prev(upper_bound(A[x].begin(),A[x].end(),make_pair(s,-1)))->second;\n int ri = prev(upper_bound(B[l].begin(),B[l].end(),make_pair(t,-1)))->second;\n\n cout << ri+1 << \"\\n\"; \n }\n }\n\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 18392, "score_of_the_acc": -0.0958, "final_rank": 8 }, { "submission_id": "aoj_0425_9717190", "code_snippet": "#include <bits/stdc++.h>\n#define REP(i, n) for(int i = 0; i < (int)(n); ++i)\n#define FOR(i, l, r) for(int i = (int)(l); i < (int)(r); ++i)\n#define ALL(v) (v).begin(), (v).end()\nusing llong = long long;\nusing vi = std::vector<int>;\nusing vvi = std::vector<vi>;\nusing pii = std::pair<int, int>;\nusing namespace std;\nconstexpr int INF = 1e9;\nconstexpr long long LINF = 1e18;\nconstexpr double EPS = 1e-10;\nconstexpr int MOD = 998'244'353;\nconstexpr int MOD2 = 1e9 + 7;\n\ntemplate <typename Type>\ninline std::istream &operator>>(std::istream &is, std::vector<Type> &v) {\n for(Type &in : v) is >> in;\n return is;\n}\n\ntemplate <typename Type>\ninline std::ostream &operator<<(std::ostream &os, const std::vector<Type> &v) {\n for(auto itr = v.cbegin(); itr != v.cend(); ++itr) os << (itr == v.cbegin() ? \"\" : \" \") << *itr;\n return os;\n}\n\n#ifdef DEBUG\n\n#include \"lib/Utils/debug.hpp\"\nusing namespace algorithm;\n\n#else\n\n#define debug(...) static_cast<void>(0)\n\n#endif\n\n// Mo's Algorithm（クエリ平方分割）.\nclass Mo {\n int m_len; // m_len:=(区間の長さ).\n int m_q; // m_q:=(クエリ数).\n std::vector<std::tuple<int, int, int> > m_queries; // m_queries[i]:=(i番目の区間クエリ). tuple of (left, right, index).\n\n void sort_queries() {\n if(m_q == 0) return;\n const int width = std::max(m_len / (int)std::sqrt(m_q), 1); // width:=N/√Q.\n std::sort(m_queries.begin(), m_queries.end(), [&width](const std::tuple<int, int, int> &a, const std::tuple<int, int, int> &b) -> bool {\n const auto &[al, ar, _] = a;\n const auto &[bl, br, __] = b;\n int a_block = al / width, b_block = bl / width;\n if(a_block == b_block) return (a_block & 1 ? ar > br : ar < br);\n return a_block < b_block;\n });\n }\n\npublic:\n Mo() : Mo(0) {}\n explicit Mo(size_t n) : m_len(n), m_q(0) {}\n explicit Mo(size_t n, size_t q) : Mo(n) {\n m_queries.reserve(q);\n }\n\n // 区間[l,r)についてのクエリを追加する．\n void insert(int l, int r) {\n assert(0 <= l and l < r and r <= m_len);\n m_queries.emplace_back(l, r, m_q++);\n }\n // 各クエリを実行する．O(Q*logQ+α*N*√Q).\n template <class F1, class F2, class F3>\n void execute(const F1 &add, const F2 &del, const F3 &solve) { execute(add, add, del, del, solve); }\n template <class F1, class F2, class F3, class F4, class F5>\n void execute(const F1 &add_l, const F2 &add_r, const F3 &del_l, const F4 &del_r, const F5 &solve) {\n sort_queries();\n int l = 0, r = 0;\n for(const auto &[nl, nr, idx] : m_queries) {\n while(nl < l) add_l(--l);\n while(r < nr) add_r(r++);\n while(l < nl) del_l(l++);\n while(nr < r) del_r(--r);\n solve(idx);\n }\n }\n void reset() {\n m_queries.clear();\n m_q = 0;\n }\n};\n\nint main() {\n int n;\n int k;\n int q;\n std::cin >> n >> k >> q;\n\n std::vector<std::pair<int, int> > vp(k);\n for(auto &[a, b] : vp) {\n std::cin >> a >> b;\n a--, b--;\n }\n\n std::vector<std::pair<int, int> > queries(q);\n Mo mo(k, q);\n for(int i = 0; i < q; ++i) {\n int type;\n int s, t;\n int x;\n std::cin >> type >> s >> t >> x;\n s--, x--;\n\n queries[i] = std::pair<int, int>(type, x);\n mo.insert(s, t);\n }\n\n std::vector<int> ans(q);\n std::vector<int> alpha(n), inv(n);\n std::iota(alpha.begin(), alpha.end(), 0);\n std::iota(inv.begin(), inv.end(), 0);\n auto swap_l = [&](int itr) -> void {\n const auto &[a, b] = vp[itr];\n std::swap(alpha[inv[a]], alpha[inv[b]]);\n std::swap(inv[a], inv[b]);\n };\n auto swap_r = [&](int itr) -> void {\n const auto &[a, b] = vp[itr];\n std::swap(inv[alpha[a]], inv[alpha[b]]);\n std::swap(alpha[a], alpha[b]);\n };\n auto solve = [&](int idx) -> void {\n const auto &[type, x] = queries[idx];\n ans[idx] = (type == 1 ? alpha[x] + 1 : inv[x] + 1);\n };\n mo.execute(swap_l, swap_r, swap_l, swap_r, solve);\n\n for(auto elem : ans) std::cout << elem << \"\\n\";\n}", "accuracy": 1, "time_ms": 220, "memory_kb": 7068, "score_of_the_acc": -0.1016, "final_rank": 9 }, { "submission_id": "aoj_0425_9231875", "code_snippet": "#include <bits/stdc++.h>\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\n#define FOR(i,l,r) for(int i=(int)(l);i<(int)(r);++i)\n#define ALL(v) (v).begin(),(v).end()\nusing llong = long long;\nusing vi = std::vector<int>;\nusing vvi = std::vector<vi>;\nusing pii = std::pair<int,int>;\nusing namespace std;\nconstexpr int INF = 1e9;\nconstexpr long long LINF = 1e18;\nconstexpr double EPS = 1e-10;\nconstexpr int MOD = 998'244'353;\nconstexpr int MOD2 = 1e9+7;\n\ntemplate <typename Type>\ninline std::istream &operator>>(std::istream &is, std::vector<Type> &v) {\n for(Type &in : v) is >> in;\n return is;\n}\n\ntemplate <typename Type>\ninline std::ostream &operator<<(std::ostream &os, const std::vector<Type> &v) {\n for(auto itr = v.cbegin(); itr != v.cend(); ++itr) os << (itr == v.cbegin() ? \"\" : \" \") << *itr;\n return os;\n}\n\n#ifdef DEBUG\n\n#include \"src/Utils/debug.hpp\"\nusing namespace algorithm;\n\n#else\n\n#define debug(...) static_cast<void>(0)\n\n#endif\n\n// Mo's Algorithm（クエリ平方分割）.\nclass Mo {\n int m_len; // m_len:=(区間の長さ).\n int m_q; // m_q:=(クエリ数).\n std::vector<std::tuple<int, int, int> > m_queries; // m_queries[i]:=(i番目の区間クエリ). tuple of (left, right, index).\n\n void sort_query() {\n const int width = std::sqrt(m_len);\n auto comp = [&width](const std::tuple<int, int, int> &a, const std::tuple<int, int, int> &b) -> bool {\n const auto &[al, ar, _] = a;\n const auto &[bl, br, __] = b;\n int a_block = al / width, b_block = bl / width;\n if(a_block == b_block) return (a_block & 1 ? ar > br : ar < br);\n return a_block < b_block;\n };\n std::sort(m_queries.begin(), m_queries.end(), comp);\n }\n\npublic:\n Mo() : Mo(0) {}\n explicit Mo(size_t n) : m_len(n), m_q(0) {}\n explicit Mo(size_t n, size_t q) : Mo(n) {\n m_queries.reserve(q);\n }\n\n // 区間[l,r)についてのクエリを追加する．\n void insert(int l, int r) {\n assert(0 <= l and l < r and r <= m_len);\n m_queries.emplace_back(l, r, m_q++);\n }\n // 各クエリを実行する．O(α(N+Q)√N).\n template <class F1, class F2, class F3>\n void execute(const F1 &add, const F2 &del, const F3 &solve) { execute(add, del, add, del, solve); }\n template <class F1, class F2, class F3, class F4, class F5>\n void execute(const F1 &add_l, const F2 &del_l, const F3 &add_r, const F4 &del_r, const F5 &solve) {\n sort_query();\n int l = 0, r = 0;\n for(const auto &[nl, nr, idx] : m_queries) {\n while(nl < l) add_l(--l);\n while(r < nr) add_r(r++);\n while(l < nl) del_l(l++);\n while(nr < r) del_r(--r);\n solve(idx);\n }\n }\n void reset() {\n m_queries.clear();\n m_q = 0;\n }\n};\n\nint main(){\n int n;\n int k;\n int q;\n cin>>n>>k>>q;\n\n vector<pii> vp(k);\n for(auto &[a,b]:vp){\n cin>>a>>b;\n a--, b--;\n }\n\n vector<pii> queries(q);\n Mo mo(k,q);\n REP(i,q){\n int type;\n int s,t;\n int x;\n cin>>type>>s>>t>>x;\n s--, x--;\n\n queries[i]=pii(type,x);\n mo.insert(s,t);\n }\n\n vi ans(q);\n vi alpha(n), inv(n);\n iota(ALL(alpha),0);\n iota(ALL(inv),0);\n auto swap_l=[&](int itr)->void{\n const auto &[a,b]=vp[itr];\n swap(alpha[inv[a]],alpha[inv[b]]);\n swap(inv[a],inv[b]);\n };\n auto swap_r=[&](int itr)->void{\n const auto &[a,b]=vp[itr];\n swap(inv[alpha[a]],inv[alpha[b]]);\n swap(alpha[a],alpha[b]);\n };\n auto solve=[&](int idx)->void{\n const auto &[type,x]=queries[idx];\n ans[idx]=(type==1?alpha[x]+1:inv[x]+1);\n };\n mo.execute(swap_l,swap_l,swap_r,swap_r,solve);\n\n for(auto out:ans) cout<<out<<\"\\n\";\n}", "accuracy": 1, "time_ms": 220, "memory_kb": 7076, "score_of_the_acc": -0.1017, "final_rank": 10 }, { "submission_id": "aoj_0425_9231862", "code_snippet": "#include <bits/stdc++.h>\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\n#define FOR(i,l,r) for(int i=(int)(l);i<(int)(r);++i)\n#define ALL(v) (v).begin(),(v).end()\nusing llong = long long;\nusing vi = std::vector<int>;\nusing vvi = std::vector<vi>;\nusing pii = std::pair<int,int>;\nusing namespace std;\nconstexpr int INF = 1e9;\nconstexpr long long LINF = 1e18;\nconstexpr double EPS = 1e-10;\nconstexpr int MOD = 998'244'353;\nconstexpr int MOD2 = 1e9+7;\n\ntemplate <typename Type>\ninline std::istream &operator>>(std::istream &is, std::vector<Type> &v) {\n for(Type &in : v) is >> in;\n return is;\n}\n\ntemplate <typename Type>\ninline std::ostream &operator<<(std::ostream &os, const std::vector<Type> &v) {\n for(auto itr = v.cbegin(); itr != v.cend(); ++itr) os << (itr == v.cbegin() ? \"\" : \" \") << *itr;\n return os;\n}\n\n#ifdef DEBUG\n\n#include \"src/Utils/debug.hpp\"\nusing namespace algorithm;\n\n#else\n\n#define debug(...) static_cast<void>(0)\n\n#endif\n\n// Mo's Algorithm（クエリ平方分割）.\nclass Mo {\n int m_len; // m_len:=(区間の長さ).\n int m_q; // m_q:=(クエリ数).\n std::vector<std::tuple<int, int, int> > m_queries; // m_queries[i]:=(i番目の区間クエリ). tuple of (left, right, index).\n\n void sort_query() {\n const int width = std::sqrt(m_len);\n auto comp = [&width](const std::tuple<int, int, int> &a, const std::tuple<int, int, int> &b) -> bool {\n const auto &[al, ar, _] = a;\n const auto &[bl, br, __] = b;\n int a_block = al / width, b_block = bl / width;\n if(a_block == b_block) return (a_block & 1 ? ar > br : ar < br);\n return a_block < b_block;\n };\n std::sort(m_queries.begin(), m_queries.end(), comp);\n }\n\npublic:\n Mo() : Mo(0) {}\n explicit Mo(size_t n) : m_len(n), m_q(0) {}\n explicit Mo(size_t n, size_t q) : Mo(n) {\n m_queries.reserve(q);\n }\n\n // 区間[l,r)についてのクエリを追加する．\n void insert(int l, int r) {\n assert(0 <= l and l < r and r <= m_len);\n m_queries.emplace_back(l, r, m_q++);\n }\n // 各クエリを実行する．O(α(N+Q)√N).\n template <class F1, class F2, class F3>\n void execute(const F1 &add, const F2 &del, const F3 &solve) { execute(add, del, add, del, solve); }\n template <class F1, class F2, class F3, class F4, class F5>\n void execute(const F1 &add_l, const F2 &del_l, const F3 &add_r, const F4 &del_r, const F5 &solve) {\n sort_query();\n int l = 0, r = 0;\n for(const auto &[nl, nr, idx] : m_queries) {\n while(nl < l) add_l(--l);\n while(r < nr) add_r(r++);\n while(l < nl) del_l(l++);\n while(nr < r) del_r(--r);\n solve(idx);\n }\n }\n void reset() {\n m_queries.clear();\n m_q = 0;\n }\n};\n\nint main(){\n int n;\n int k;\n int q;\n cin>>n>>k>>q;\n\n vector<pii> vp(k);\n for(auto &[a,b]:vp){\n cin>>a>>b;\n a--, b--;\n }\n\n vector<pii> queries(q);\n Mo mo(n,q);\n REP(i,q){\n int type;\n int s,t;\n int x;\n cin>>type>>s>>t>>x;\n s--, x--;\n\n queries[i]=pii(type,x);\n mo.insert(s,t);\n }\n\n vi ans(q);\n vi alpha(n), inv(n);\n iota(ALL(alpha),0);\n iota(ALL(inv),0);\n auto swap_l=[&](int itr)->void{\n const auto &[a,b]=vp[itr];\n swap(alpha[inv[a]],alpha[inv[b]]);\n swap(inv[a],inv[b]);\n };\n auto swap_r=[&](int itr)->void{\n const auto &[a,b]=vp[itr];\n swap(inv[alpha[a]],inv[alpha[b]]);\n swap(alpha[a],alpha[b]);\n };\n auto solve=[&](int idx)->void{\n const auto &[type,x]=queries[idx];\n ans[idx]=(type==1?alpha[x]+1:inv[x]+1);\n };\n mo.execute(swap_l,swap_l,swap_r,swap_r,solve);\n\n for(auto out:ans) cout<<out<<\"\\n\";\n}", "accuracy": 0.2857142857142857, "time_ms": 210, "memory_kb": 6992, "score_of_the_acc": -0.0955, "final_rank": 20 }, { "submission_id": "aoj_0425_9009796", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n // 入力を受け取る\n int N, K, Q;\n cin >> N >> K >> Q;\n vector<int> a(K), b(K);\n for( int i = 0; i < K; i++ ) {\n cin >> a[i] >> b[i];\n a[i]--, b[i]--;\n }\n vector<int> c(Q), s(Q), t(Q), x(Q);\n for( int i = 0; i < Q; i++ ) {\n cin >> c[i] >> s[i] >> t[i] >> x[i];\n c[i]--, s[i]--, t[i]--, x[i]--;\n }\n // ブロックごとに swap を圧縮\n constexpr int B = 500;\n const int L = (K+B-1)/B;\n vector p(L, vector<int>(N));\n vector q(L, vector<int>(N));\n for( int i = 0; i < L; i++ ) {\n iota(p[i].begin(), p[i].end(), 0);\n }\n for( int i = 0; i < K; i++ ) {\n swap(p[i/B][a[i]], p[i/B][b[i]]);\n }\n for( int i = 0; i < L; i++ ) {\n for( int j = 0; j < N; j++ ) {\n q[i][p[i][j]] = j;\n }\n }\n // クエリを処理する\n for( int i = 0; i < Q; i++ ) {\n if( c[i] == 0 ) {\n // 方針: 末尾から走査して、x の位置を管理する\n int op_id = t[i], pos_x = x[i];\n while( op_id >= s[i] ) {\n if( op_id%B == B-1 && op_id-B > s[i] ) {\n pos_x = p[op_id/B][pos_x];\n op_id -= B;\n }else {\n if( pos_x == a[op_id] || pos_x == b[op_id] ) {\n pos_x = pos_x^a[op_id]^b[op_id];\n }\n op_id -= 1;\n }\n }\n cout << pos_x + 1 << \"\\n\";\n }else {\n // 方針: 先頭から走査して、x の位置を管理する\n int op_id = s[i], pos_x = x[i];\n while( op_id <= t[i] ) {\n if( op_id%B == 0 && op_id+B < t[i] ) {\n pos_x = q[op_id/B][pos_x];\n op_id += B;\n }else {\n if( pos_x == a[op_id] || pos_x == b[op_id] ) {\n pos_x = pos_x^a[op_id]^b[op_id];\n }\n op_id += 1;\n }\n }\n cout << pos_x + 1 << \"\\n\";\n }\n }\n}", "accuracy": 1, "time_ms": 1410, "memory_kb": 162380, "score_of_the_acc": -1.7697, "final_rank": 18 }, { "submission_id": "aoj_0425_9009788", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n // 入力を受け取る\n int N, K, Q;\n cin >> N >> K >> Q;\n vector<int> a(K), b(K);\n for( int i = 0; i < K; i++ ) {\n cin >> a[i] >> b[i];\n a[i]--, b[i]--;\n }\n vector<int> c(Q), s(Q), t(Q), x(Q);\n for( int i = 0; i < Q; i++ ) {\n cin >> c[i] >> s[i] >> t[i] >> x[i];\n c[i]--, s[i]--, t[i]--, x[i]--;\n }\n // ブロックごとに swap を圧縮\n const int B = 500;\n const int L = (K+B-1)/B;\n vector p(L, vector<int>(N));\n vector q(L, vector<int>(N));\n for( int i = 0; i < L; i++ ) {\n iota(p[i].begin(), p[i].end(), 0);\n }\n for( int i = 0; i < K; i++ ) {\n swap(p[i/B][a[i]], p[i/B][b[i]]);\n }\n for( int i = 0; i < L; i++ ) {\n for( int j = 0; j < N; j++ ) {\n q[i][p[i][j]] = j;\n }\n }\n // クエリを処理する\n for( int i = 0; i < Q; i++ ) {\n if( c[i] == 0 ) {\n // 方針: 末尾から走査して、x の位置を管理する\n int op_id = t[i], pos_x = x[i];\n while( op_id >= s[i] ) {\n if( op_id%B == B-1 && op_id-B >= s[i] ) {\n pos_x = p[op_id/B][pos_x];\n op_id -= B;\n }else {\n if( pos_x == a[op_id] || pos_x == b[op_id] ) {\n pos_x = pos_x^a[op_id]^b[op_id];\n }\n op_id -= 1;\n }\n }\n cout << pos_x + 1 << \"\\n\";\n }else {\n // 方針: 先頭から走査して、x の位置を管理する\n int op_id = s[i], pos_x = x[i];\n while( op_id <= t[i] ) {\n if( op_id%B == 0 && op_id+B <= t[i] ) {\n pos_x = q[op_id/B][pos_x];\n op_id += B;\n }else {\n if( pos_x == a[op_id] || pos_x == b[op_id] ) {\n pos_x = pos_x^a[op_id]^b[op_id];\n }\n op_id += 1;\n }\n }\n cout << pos_x + 1 << \"\\n\";\n }\n }\n}", "accuracy": 1, "time_ms": 1400, "memory_kb": 162380, "score_of_the_acc": -1.764, "final_rank": 17 }, { "submission_id": "aoj_0425_8871424", "code_snippet": "#include <bits/stdc++.h>\n\nint main() {\n int n, k, q;\n std::cin >> n >> k >> q;\n std::vector split(n, std::vector<int>(1, -1));\n std::vector<std::pair<int, int>> ope;\n for (int i = 0; i < k; i++) {\n int a, b;\n std::cin >> a >> b;\n a--; b--;\n split[a].push_back(i);\n split[b].push_back(i);\n ope.emplace_back(a, b);\n }\n for (int i = 0; i < n; i++) split[i].push_back(k);\n\n auto f = [&](auto self, int cur_time, const int fin_time, int pos) -> int {\n assert(cur_time <= fin_time);\n if (cur_time == fin_time) return pos;\n auto it = std::lower_bound(split[pos].begin(), split[pos].end(), cur_time);\n assert(it != split[pos].end());\n int next_ope_time = *it;\n if (next_ope_time < fin_time) {\n auto [a, b] = ope[next_ope_time];\n return self(self, next_ope_time + 1, fin_time, a ^ b ^ pos);\n } else {\n return pos;\n }\n };\n\n auto g = [&](auto self, int cur_time, const int fin_time, int pos) -> int {\n assert(cur_time >= fin_time);\n if (cur_time == fin_time) return pos;\n auto it = std::lower_bound(split[pos].begin(), split[pos].end(), cur_time);\n assert(it != split[pos].begin());\n it--;\n int next_ope_time = *it;\n if (next_ope_time >= fin_time) {\n auto [a, b] = ope[next_ope_time];\n return self(self, next_ope_time, fin_time, a ^ b ^ pos);\n } else {\n return pos;\n }\n };\n\n while (q--) {\n int t;\n std::cin >> t;\n if (t == 1) {\n int l, r, x;\n std::cin >> l >> r >> x;\n l--; x--;\n std::cout << g(g, r, l, x) + 1 << '\\n';\n } else {\n int l, r, x;\n std::cin >> l >> r >> x;\n l--; x--;\n std::cout << f(f, l, r, x) + 1 << '\\n';\n }\n }\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 10468, "score_of_the_acc": -0.0954, "final_rank": 7 }, { "submission_id": "aoj_0425_8871423", "code_snippet": "#include <bits/stdc++.h>\n\nint main() {\n int n, k, q;\n std::cin >> n >> k >> q;\n std::vector split(n, std::vector<int>(1, -1));\n std::vector<std::pair<int, int>> ope;\n for (int i = 0; i < k; i++) {\n int a, b;\n std::cin >> a >> b;\n a--; b--;\n split[a].push_back(i);\n split[b].push_back(i);\n ope.emplace_back(a, b);\n }\n for (int i = 0; i < n; i++) split[i].push_back(n);\n\n auto f = [&](auto self, int cur_time, const int fin_time, int pos) -> int {\n assert(cur_time <= fin_time);\n if (cur_time == fin_time) return pos;\n auto it = std::lower_bound(split[pos].begin(), split[pos].end(), cur_time);\n assert(it != split[pos].end());\n int next_ope_time = *it;\n if (next_ope_time < fin_time) {\n auto [a, b] = ope[next_ope_time];\n return self(self, next_ope_time + 1, fin_time, a ^ b ^ pos);\n } else {\n return pos;\n }\n };\n\n auto g = [&](auto self, int cur_time, const int fin_time, int pos) -> int {\n assert(cur_time >= fin_time);\n if (cur_time == fin_time) return pos;\n auto it = std::lower_bound(split[pos].begin(), split[pos].end(), cur_time);\n assert(it != split[pos].begin());\n it--;\n int next_ope_time = *it;\n if (next_ope_time >= fin_time) {\n auto [a, b] = ope[next_ope_time];\n return self(self, next_ope_time, fin_time, a ^ b ^ pos);\n } else {\n return pos;\n }\n };\n\n while (q--) {\n int t;\n std::cin >> t;\n if (t == 1) {\n int l, r, x;\n std::cin >> l >> r >> x;\n l--; x--;\n std::cout << g(g, r, l, x) + 1 << '\\n';\n } else {\n int l, r, x;\n std::cin >> l >> r >> x;\n l--; x--;\n std::cout << f(f, l, r, x) + 1 << '\\n';\n }\n }\n}", "accuracy": 0.2857142857142857, "time_ms": 170, "memory_kb": 10368, "score_of_the_acc": -0.0948, "final_rank": 19 }, { "submission_id": "aoj_0425_8479736", "code_snippet": "#include<bits/stdc++.h>\n#define overload(a,b,c,d,...) d\n#define rep1(a) for(ll _=0;_<(ll)a;++_)\n#define rep2(i,n) for(ll i=0;i<(ll)n;++i)\n#define rep3(i,l,r) for(ll i=(ll)l;i<(ll)r;++i)\n#define rep(...) overload(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(i,a) for(ll i=(ll)a-1;i>=0;--i)\n#define rrep2(i,a,b) for(ll i=(ll)b-1;i>=(ll)a;--i)\n#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)\n#define all(x) (x).begin(),(x).end()\n#define rall(x) (x).rbegin(),(x).rend()\n#define pb push_back\n#define eb emplace_back\nusing namespace std;\nusing ll=int;\nusing ull=unsigned long long;\nusing ld=long double;\ntemplate<typename T,typename U>inline bool chmin(T&a,const U&b){return (a>b?a=b,true:false);}\ntemplate<typename T,typename U>inline bool chmax(T&a,const U&b){return (a<b?a=b,true:false);}\nstatic constexpr ll mod1=998244353;\nstatic constexpr ll mod2=1000000007;\nconst ll base1=random_device()()%mod1;\nconst ll base2=random_device()()%mod2;\nstruct Mo{\n\tint n;\n\tvector<int>left,right;\n\tMo(int n):n(n){}\n\tvoid add(int l,int r){\n\t\tleft.pb(l);right.pb(r);\n\t}\n\ttemplate<typename AL,typename AR,typename DL,typename DR,typename REM>\n\tvoid run(const AL&add_left,const AR&add_right,const DL&delete_left,const DR&delete_right,const REM&rem){\n\t\tconst int q=left.size(),width=max<int>(1,int(sqrt(3)*n/sqrt(max(1,2*q))));\n\t\tvector<int>order(q);iota(all(order),0);\n\t\tsort(all(order),[&](int a,int b){\n\t\t\tconst int ablock=left[a]/width,bblock=left[b]/width;\n\t\t\tif(ablock!=bblock)return ablock<bblock;\n\t\t\treturn (ablock&1)?(right[a]>right[b]):(right[a]<right[b]);\n\t\t});\n\t\tint l=0,r=0;\n\t\tfor(auto idx:order){\n\t\t\twhile(l>left[idx])add_left(--l);\n\t\t\twhile(r<right[idx])add_right(r++);\n\t\t\twhile(l<left[idx])delete_left(l++);\n\t\t\twhile(r>right[idx])delete_right(--r);\n\t\t\trem(idx);\n\t\t}\n\t}\n};\nint main(){\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tll n,k,q;cin>>n>>k>>q;\n\tvector<pair<int,int>>s(k);\n\tfor(auto&[l,r]:s){\n\t\tcin>>l>>r;\n\t\tl--,r--;\n\t}\n\tvector<int>idx(n),rev(n);\n\tiota(all(idx),0),iota(all(rev),0);\n\tvector<pair<int,int>>query(q);\n\tvector<int>ans(q);\n\tMo mo(k);\n\trep(i,q){\n\t\tll tmp;cin>>tmp;\n\t\tll s,t,x;cin>>s>>t>>x;\n\t\ts--,x--;\n\t\tquery[i]={tmp,x};\n\t\tmo.add(s,t);\n\t}\n\tauto left=[&](int id)->void {\n\t\tconst int x=rev[s[id].first],y=rev[s[id].second];\n\t\tswap(idx[x],idx[y]);\n\t\tswap(rev[s[id].first],rev[s[id].second]);\n\t};\n\tauto right=[&](int id)->void {\n\t\tint x=idx[s[id].first],y=idx[s[id].second];\n\t\tswap(idx[s[id].first],idx[s[id].second]);\n\t\tswap(rev[x],rev[y]);\n\t};\n\tauto rem=[&](int id)->void {\n\t\t//cerr<<id<<endl;\n\t\t//for(auto e:idx)cerr<<e<<\" \";\n\t\t//cerr<<endl;\n\t\t//for(auto e:rev)cerr<<e<<\" \";\n\t\t//cerr<<endl;\n\t\tans[id]=(query[id].first==1?idx:rev)[query[id].second]+1;\n\t};\n\tmo.run(left,right,left,right,rem);\n\tfor(auto&e:ans)cout<<e<<endl;\n}", "accuracy": 1, "time_ms": 200, "memory_kb": 7248, "score_of_the_acc": -0.0915, "final_rank": 6 }, { "submission_id": "aoj_0425_6979214", "code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 0425.cc: Chemical Substance Alpha\n */\n\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\nconst int MAX_K = 100000;\nconst int MAX_QN = 100000;\n\n/* typedef */\n\ntypedef vector<int> vi;\n\nstruct Query {\n int op, s, t, x;\n Query() {}\n Query(int _op, int _s, int _t, int _x): op(_op), s(_s), t(_t), x(_x) {}\n\n void read() { scanf(\"%d%d%d%d\", &op, &s, &t, &x), s--, t--, x--; }\n};\n\n/* global variables */\n\nint as[MAX_K], bs[MAX_K];\nQuery qs[MAX_QN];\nvi sv1[MAX_K], tv1[MAX_K], sv2[MAX_K], tv2[MAX_K];\nint ps[MAX_N], invps[MAX_N], ans[MAX_QN];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, k, qn;\n scanf(\"%d%d%d\", &n, &k, &qn);\n\n for (int i = 0; i < k; i++)\n scanf(\"%d%d\", as + i, bs + i), as[i]--, bs[i]--;\n\n for (int i = 0; i < qn; i++) {\n qs[i].read();\n int si = qs[i].s, ti = qs[i].t;\n if (qs[i].op == 1)\n sv1[si].push_back(i), tv1[ti].push_back(i);\n else\n sv2[si].push_back(i), tv2[ti].push_back(i);\n }\n\n fill(ans, ans + qn, -1);\n for (int i = 0; i < n; i++) ps[i] = invps[i] = i;\n \n for (int i = 0; i < k; i++) {\n for (auto u: sv2[i]) ans[u] = ps[qs[u].x];\n\n int ai = as[i], bi = bs[i];\n swap(ps[ai], ps[bi]);\n swap(invps[ps[ai]], invps[ps[bi]]);\n\n for (auto u: tv1[i]) ans[u] = ps[qs[u].x];\n for (auto u: tv2[i]) ans[u] = invps[ans[u]];\n }\n\n for (int i = 0; i < n; i++) ps[i] = invps[i] = i;\n \n for (int i = 0; i < k; i++) {\n for (auto u: sv1[i]) ans[u] = invps[ans[u]];\n\n int ai = as[i], bi = bs[i];\n swap(ps[ai], ps[bi]);\n swap(invps[ps[ai]], invps[ps[bi]]);\n }\n\n for (int i = 0; i < qn; i++) printf(\"%d\\n\", ans[i] + 1);\n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 20692, "score_of_the_acc": -0.0882, "final_rank": 4 }, { "submission_id": "aoj_0425_6046446", "code_snippet": "#ifdef LOGX\n#define _GLIBCXX_DEBUG\n#endif\n#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\n#define rep(i,n) for(int i=0;i<int(n);i++)\n#define rep2(i,s,n) for(int i=int(s);i<int(n);i++)\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\nconst int big=1e9+7;\n//const int big=998244353;\nconst char newl='\\n';\nconst int inf=1e9+10;\nconst ll INF=ll(1e18)+10;\nconst int dx[]={1,0,-1,0};\nconst int dy[]={0,1,0,-1};\n\nstruct info{\n int com;\n int s;\n int t;\n int x;\n};\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n \n int n,k,q;\n cin >> n >> k >> q;\n vector<int> id(n),invid(n);\n iota(all(id),0);\n iota(all(invid),0);\n\n vector<int> a(k),b(k);\n rep(i,k)cin >> a[i] >> b[i],a[i]--,b[i]--;\n vector<info> query(q);\n rep(i,q){\n int com,s,t,x;\n cin >> com >> s >> t >> x;\n s--,t--,x--;\n query[i]={com,s,t,x};\n }\n vector<int> ans(q);\n\n //2番のクエリ処理\n {\n vector<int> v(q);\n vector<vector<int>> beg_query(k),en_query(k);\n rep(i,q){\n if(query[i].com==2){\n beg_query[query[i].s].emplace_back(i);\n en_query[query[i].t].emplace_back(i);\n }\n }\n rep(st,k){\n for(int i:beg_query[st]){\n v[i]=id[query[i].x];\n }\n swap(id[a[st]],id[b[st]]);\n swap(invid[id[a[st]]],invid[id[b[st]]]);\n for(int i:en_query[st]){\n ans[i]=invid[v[i]];\n }\n }\n }\n //1番のクエリ処理\n {\n vector<int> v(q);\n vector<vector<int>> beg_query(k),en_query(k);\n rep(i,q){\n if(query[i].com==1){\n beg_query[query[i].t].emplace_back(i);\n en_query[query[i].s].emplace_back(i);\n }\n }\n for(int st=k-1;st>=0;st--){\n for(int i:beg_query[st]){\n v[i]=id[query[i].x];\n }\n swap(id[a[st]],id[b[st]]);\n swap(invid[id[a[st]]],invid[id[b[st]]]);\n for(int i:en_query[st]){\n ans[i]=invid[v[i]];\n }\n }\n }\n rep(i,q)cout << ans[i]+1 << newl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 14164, "score_of_the_acc": -0.0462, "final_rank": 1 }, { "submission_id": "aoj_0425_6041099", "code_snippet": "#include <bits/stdc++.h>\n\nusing ll = long long;\n\ntemplate <class T> using Vec = std::vector<T>;\n\nconstexpr int BUCKET = 330;\n\nint main() {\n int N, K, Q;\n std::cin >> N >> K >> Q;\n Vec<int> A(K), B(K);\n for (int i = 0; i < K; ++i) {\n std::cin >> A[i] >> B[i];\n A[i] -= 1;\n B[i] -= 1;\n }\n Vec<int> T(Q), L(Q), R(Q), X(Q);\n Vec<Vec<int>> query((K + BUCKET - 1) / BUCKET);\n for (int i = 0; i < Q; ++i) {\n std::cin >> T[i] >> L[i] >> R[i] >> X[i];\n L[i] -= 1;\n X[i] -= 1;\n query[L[i] / BUCKET].push_back(i);\n }\n Vec<int> ans(Q);\n for (int q = 0; q < (int)query.size(); ++q) {\n auto& vec = query[q];\n std::sort(vec.begin(), vec.end(), [&](const int i, const int j) { return R[i] < R[j]; });\n Vec<int> perm(N), inv(N);\n std::iota(perm.begin(), perm.end(), 0);\n std::iota(inv.begin(), inv.end(), 0);\n int l = q * BUCKET, r = q * BUCKET;\n for (const int i : vec) {\n while (r < R[i]) {\n const int x = perm[A[r]], y = perm[B[r]];\n std::swap(perm[A[r]], perm[B[r]]);\n std::swap(inv[x], inv[y]);\n r += 1;\n }\n while (l < L[i]) {\n const int x = inv[A[l]], y = inv[B[l]];\n std::swap(perm[x], perm[y]);\n std::swap(inv[A[l]], inv[B[l]]);\n l += 1;\n }\n while (l > L[i]) {\n l -= 1;\n const int x = inv[A[l]], y = inv[B[l]];\n std::swap(perm[x], perm[y]);\n std::swap(inv[A[l]], inv[B[l]]);\n }\n ans[i] = (T[i] == 1 ? perm : inv)[X[i]] + 1;\n }\n }\n for (const int x : ans) {\n std::cout << x << '\\n';\n }\n return 0;\n}", "accuracy": 1, "time_ms": 270, "memory_kb": 7344, "score_of_the_acc": -0.1315, "final_rank": 11 }, { "submission_id": "aoj_0425_6021836", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\ntemplate<class T> using vc = vector<T>;\ntemplate<class T> using vvc = vc<vc<T>>;\ntemplate<class T> using vvvc = vc<vvc<T>>;\ntemplate<class T> using vvvvc = vvc<vvc<T>>;\ntemplate<class T> using PQ = priority_queue<T>;\ntemplate<class T> using invPQ = priority_queue<T, vector<T>, greater<T>>;\nusing IP = pair<int, int>;\nusing LP = pair<ll, ll>;\n#define all(x) begin(x), end(x)\n#define allr(x) rbegin(x), rend(x)\n#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)\n#define rep3(i, m, n) for (int i = (m); (i) < (int)(n); i++)\n#define repr(i, n) for (int i = (n) - 1; (i) >= 0; i--)\n#define rep3r(i, m, n) for (int i = (n) - 1; (i) >= (int)(m); i--)\ntemplate<class T> inline bool chmax(T & a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T & a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\nsigned main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int N, K, Q;\n cin >> N >> K >> Q;\n vc<int> a(K), b(K), q(Q), s(Q), t(Q), x(Q);\n rep (i, K) {\n cin >> a[i] >> b[i];\n a[i]--; b[i]--;\n }\n rep (i, Q) {\n cin >> q[i] >> s[i] >> t[i] >> x[i];\n s[i]--; t[i]--; x[i]--;\n }\n \n int bsize = sqrt(K), bcnt = (K-1) / bsize + 1;\n vc<unordered_map<int, int>> backet(bcnt);\n rep (i, K) {\n int id = i / bsize;\n if (!backet[id].count(a[i])) backet[id][a[i]] = a[i];\n if (!backet[id].count(b[i])) backet[id][b[i]] = b[i];\n swap(backet[id][a[i]], backet[id][b[i]]);\n }\n vc<unordered_map<int, int>> rbacket(bcnt);\n rep (i, bcnt) {\n for (auto& p : backet[i]) {\n rbacket[i][p.second] = p.first;\n }\n }\n\n rep (i, Q) {\n if (q[i] == 1) {\n int p = x[i];\n int j = t[i];\n while ((j+1) % bsize != 0 && j >= s[i]) {\n if (a[j] == p) p = b[j];\n else if (b[j] == p) p = a[j];\n j--;\n }\n while (j - bsize + 1 >= s[i]) {\n if (backet[j / bsize].count(p)) p = backet[j / bsize][p];\n j -= bsize;\n }\n while (j >= s[i]) {\n if (a[j] == p) p = b[j];\n else if (b[j] == p) p = a[j];\n j--;\n }\n cout << p+1 << endl;\n }\n else {\n int p = x[i];\n int j = s[i];\n while (j % bsize != 0 && j <= t[i]) {\n if (a[j] == p) p = b[j];\n else if (b[j] == p) p = a[j];\n j++;\n }\n while (j + bsize - 1 <= t[i]) {\n if (rbacket[j / bsize].count(p)) p = rbacket[j / bsize][p];\n j += bsize;\n }\n while (j <= t[i]) {\n if (a[j] == p) p = b[j];\n else if (b[j] == p) p = a[j];\n j++;\n }\n cout << p+1 << endl;\n }\n }\n}", "accuracy": 1, "time_ms": 1750, "memory_kb": 21560, "score_of_the_acc": -1.0544, "final_rank": 15 }, { "submission_id": "aoj_0425_5038437", "code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nint N,K,Q;\nint ans[1<<17],a[1<<17],b[1<<17];\nint num[1<<17],pos[1<<17];\nvector<pair<int,int> >G[1<<17],H[1<<17];\nint ord[1<<17],inv[1<<17];\nmain()\n{\n\tcin>>N>>K>>Q;\n\tfor(int i=0;i<K;i++)\n\t{\n\t\tcin>>a[i]>>b[i];\n\t\ta[i]--,b[i]--;\n\t}\n\tfor(int i=0;i<Q;i++)\n\t{\n\t\tint q,s,t,x;cin>>q>>s>>t>>x;\n\t\ts--,t--,x--;\n\t\tif(q==1)\n\t\t{\n\t\t\tpos[i]=s;\n\t\t\tG[t+1].push_back(make_pair(i,x));\n\t\t}\n\t\telse\n\t\t{\n\t\t\tpos[i]=t+1;\n\t\t\tG[s].push_back(make_pair(i,x));\n\t\t}\n\t}\n\tfor(int i=0;i<N;i++)ord[i]=i;\n\tfor(int i=0;i<=K;i++)\n\t{\n\t\tfor(pair<int,int>p:G[i])\n\t\t{\n\t\t\tnum[p.first]=ord[p.second];\n\t\t}\n\t\tif(i<K)swap(ord[a[i]],ord[b[i]]);\n\t}\n\tfor(int i=0;i<Q;i++)\n\t{\n\t\tH[pos[i]].push_back(make_pair(i,num[i]));\n\t}\n\tfor(int i=0;i<N;i++)ord[i]=inv[i]=i;\n\tfor(int i=0;i<=K;i++)\n\t{\n\t\tfor(pair<int,int>p:H[i])\n\t\t{\n\t\t\tans[p.first]=inv[p.second];\n\t\t}\n\t\tif(i<K)\n\t\t{\n\t\t\tinv[ord[a[i]]]=b[i];\n\t\t\tinv[ord[b[i]]]=a[i];\n\t\t\tswap(ord[a[i]],ord[b[i]]);\n\t\t}\n\t}\n\tfor(int i=0;i<Q;i++)cout<<ans[i]+1<<endl;\n}", "accuracy": 1, "time_ms": 210, "memory_kb": 16240, "score_of_the_acc": -0.155, "final_rank": 12 }, { "submission_id": "aoj_0425_4927456", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;\n\nconst int B = 400;\n\nstruct Query {\n int l, r, no;\n Query(int l, int r, int no) : l(l), r(r), no(no) {}\n Query() : l(0), r(0), no(0) {}\n bool operator<(const Query &a) const {\n int ablock = this->l / B, bblock = a.l / B;\n if(ablock != bblock) return ablock < bblock;\n if(ablock & 1) return this->r < a.r;\n else return this->r > a.r;\n }\n};\n\n\ntemplate <class T>\nostream& operator<<(ostream& os, vector<T> v) {\n os << \"{\";\n for (int i = 0; i < v.size(); ++i) {\n if(i) os << \", \";\n os << v[i];\n }\n return os << \"}\";\n}\n\ntemplate <class L, class R>\nostream& operator<<(ostream& os, pair<L, R> p) {\n return os << \"{\" << p.first << \", \" << p.second << \"}\";\n}\n\n\nint main() {\n int n, k, q;\n cin >> n >> k >> q;\n vector<int> a(k), b(k), x(n), y(n);\n for (int i = 0; i < k; ++i) {\n scanf(\"%d %d\", &a[i], &b[i]);\n a[i]--; b[i]--;\n }\n vector<int> ans(q), t(q), val(q);\n iota(x.begin(),x.end(), 0);\n iota(y.begin(),y.end(), 0);\n vector<Query> query(q);\n for (int i = 0; i < q; ++i) {\n cin >> t[i] >> query[i].l >> query[i].r >> val[i];\n query[i].l--; val[i]--;\n query[i].no = i;\n }\n sort(query.begin(),query.end());\n int l = 0, r = 0;\n auto f = [&](int i){\n swap(x[a[i]], x[b[i]]);\n swap(y[x[a[i]]], y[x[b[i]]]);\n };\n auto g = [&](int i){\n int tl = y[a[i]], tr = y[b[i]];\n swap(x[tl], x[tr]);\n swap(y[x[tl]], y[x[tr]]);\n };\n for (auto &&X : query) {\n while(X.l < l) g(--l);\n while(r < X.r) f(r++);\n while(l < X.l) g(l++);\n while(X.r < r) f(--r);\n if(t[X.no] == 1) ans[X.no] = x[val[X.no]];\n else ans[X.no] = y[val[X.no]];\n }\n for (auto &&i : ans) printf(\"%d\\n\", i+1);\n return 0;\n}", "accuracy": 1, "time_ms": 190, "memory_kb": 7164, "score_of_the_acc": -0.0854, "final_rank": 3 }, { "submission_id": "aoj_0425_4852751", "code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<complex>\nusing namespace std;\ntypedef long long ll;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define chmax(a,b) a=max(a,b)\n#define chmin(a,b) a=min(a,b)\n#define all(x) x.begin(),x.end()\n#define N 100010\nll n,k,q;\nll a[N],b[N];\nll f[N],s[N],t[N],x[N];\nll p[N],r[N];//p[i]..i番目にあるもの,r[i]...iがある場所\nll mem[N];\nvector<ll> v[N];\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(0);\n\tcin>>n>>k>>q;\n\trep(i,k)cin>>a[i]>>b[i];\n\trep(i,q){\n\t\tcin>>f[i]>>s[i]>>t[i]>>x[i];\n\t}\n\t\n\trep(i,q){\n\t\tif(f[i]==2)continue;\n\t\tv[t[i]].push_back(i);\n\t}\n\trep(i,n+1)p[i]=r[i]=i;\n\trep(i,k+1){\n\t\tfor(auto id:v[i]){\n\t\t\tmem[id]=p[x[id]];\n\t\t}\n\t\tif(i<k){\n\t\t\tswap(r[p[a[i]]],r[p[b[i]]]);\n\t\t\tswap(p[a[i]],p[b[i]]);\n\t\t}\n\t}\n\trep(i,k+1)v[i].clear();\n\t\n\trep(i,q){\n\t\tif(f[i]==2)continue;\n\t\tv[s[i]-1].push_back(i);\n\t}\n\trep(i,n+1)p[i]=r[i]=i;\n\trep(i,k+1){\n\t\tfor(auto id:v[i]){\n\t\t\tmem[id]=r[mem[id]];\n\t\t}\n\t\tif(i<k){\n\t\t\tswap(r[p[a[i]]],r[p[b[i]]]);\n\t\t\tswap(p[a[i]],p[b[i]]);\n\t\t}\n\t}\n\trep(i,k+1)v[i].clear();\n\t\n\trep(i,q){\n\t\tif(f[i]==1)continue;\n\t\tv[s[i]-1].push_back(i);\n\t}\n\trep(i,n+1)p[i]=r[i]=i;\n\trep(i,k+1){\n\t\tfor(auto id:v[i]){\n\t\t\tmem[id]=p[x[id]];\n\t\t}\n\t\tif(i<k){\n\t\t\tswap(r[p[a[i]]],r[p[b[i]]]);\n\t\t\tswap(p[a[i]],p[b[i]]);\n\t\t}\n\t}\n\trep(i,k+1)v[i].clear();\n\t\n\trep(i,q){\n\t\tif(f[i]==1)continue;\n\t\tv[t[i]].push_back(i);\n\t}\n\trep(i,n+1)p[i]=r[i]=i;\n\trep(i,k+1){\n\t\tfor(auto id:v[i]){\n\t\t\tmem[id]=r[mem[id]];\n\t\t}\n\t\tif(i<k){\n\t\t\tswap(r[p[a[i]]],r[p[b[i]]]);\n\t\t\tswap(p[a[i]],p[b[i]]);\n\t\t}\n\t}\n\trep(i,k+1)v[i].clear();\n\t\n\trep(i,q){\n\t\tcout<<mem[i]<<\"\\n\";\t\n\t}\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 15408, "score_of_the_acc": -0.0598, "final_rank": 2 }, { "submission_id": "aoj_0425_4683042", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing UL=unsigned int;\nusing LL=long long;\nusing ULL=unsigned long long;\n#define rep(i,n) for(UL i=0; i<(n); i++)\n\nstruct Query{ UL l,r,x,i; };\nbool cmp_r(const Query& l,const Query& r){ return l.r>r.r; }\n\nUL N,K,Q;\nUL S[100000];\nUL T[100000];\nUL rT[100000];\nUL A[100000][2];\nvector<Query> Que[2][300];\nUL L,R;\nUL ans[100000];\n\nvoid exe(UL l, UL r){\n for(int p=R; p<r; p++) swap(S[A[p][0]],S[A[p][1]]);\n for(int p=R; p>r; p--) swap(S[A[p-1][0]],S[A[p-1][1]]);\n for(int p=L; p<l; p++){\n swap(rT[T[A[p][0]]],rT[T[A[p][1]]]);\n swap(T[A[p][0]],T[A[p][1]]);\n }\n for(int p=L; p>l; p--){\n swap(rT[T[A[p-1][0]]],rT[T[A[p-1][1]]]);\n swap(T[A[p-1][0]],T[A[p-1][1]]);\n }\n L=l; R=r;\n}\n\nint main(){\n scanf(\"%u%u%u\",&N,&K,&Q);\n L=R=0;\n rep(i,K) rep(j,2){ scanf(\"%u\",&A[i][j]); A[i][j]--; }\n rep(q,Q){\n UL c,l,r,x; scanf(\"%u%u%u%u\",&c,&l,&r,&x); c--; l--; x--;\n Que[c][l*300/K].push_back(Query{l,r,x,q});\n }\n rep(c,2) rep(i,300) sort(Que[c][i].begin(),Que[c][i].end(),cmp_r);\n rep(c,2){\n rep(i,N)S[i]=i;\n rep(i,N)T[i]=i;\n rep(i,N)rT[i]=i;\n L=R=0;\n rep(i,300){\n for(Query& q:Que[c][i]){\n if(c==0){\n exe(q.l,q.r);\n ans[q.i]=rT[S[q.x]]+1;\n }\n else {\n exe(q.r,q.l);\n ans[q.i]=rT[S[q.x]]+1;\n }\n }\n }\n }\n rep(i,Q) printf(\"%u\\n\",ans[i]);\n return 0;\n}", "accuracy": 1, "time_ms": 390, "memory_kb": 7996, "score_of_the_acc": -0.2031, "final_rank": 13 } ]
aoj_0432_cpp
Rotating Photo PCK is developing an application for processing photos by rotating them. In this application, a square photo is input, and then the photo is rotated by several rotation commands, each of which rotates the photo 90 degrees clockwise or counterclockwise around a point in the middle of the photo (the intersection of the diagonals of the square). Given a photo and a rotation instruction, write a program that draws the photo after processing all the instructions. The photo consists of $N \times N$ pixels, and the information of one pixel is represented by a single letter. Input The input is given in the following format. $N$ $row_1$ $row_2$ : $row_N$ $Q$ $r_1$ $r_2$ : $r_Q$ The first line gives the number of pixels in the photo $N$ ($1 \leq N \leq 1,000$), in both height and width. In the following $N$ lines, the pixel information $row_i$ of the $i$-th row from the top is given, where $row_i$ is a string of length $N$ consisting of letters. The next line gives the number of rotation instructions $Q$ ($1 \leq Q \leq 200,000$). In the following line $Q$, an integer $r_i$ (-1 or 1) is given to indicate the direction of rotation; a value of $r_i$ of 1 means clockwise rotation, and a value of -1 means counterclockwise rotation by 90 degrees. Output Output the pixel information of the photo after processing all the rotation commands in $N$ lines. The pixel information of the $i$-th row from the top is output to the $i$-th row. Sample Input and Output Sample Input 1 2 AI ZU 2 1 1 Sample Output 1 UZ IA Sample Input 2 3 xOO OOy OOO 1 -1 Sample Output 2 OyO OOO xOO
[ { "submission_id": "aoj_0432_10872765", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define all(a) a.begin(), a.end()\n\nvector<string> rotate(vector<string> s)\n{\n int n = s.size();\n vector<vector<char>> res(s.size(), vector<char>(s.size()));\n rep(i, n)\n {\n rep(j, n)\n {\n res[j][n - i - 1] = s[i][j];\n }\n }\n vector<string> p;\n for (auto x : res)\n {\n string q;\n for (auto y : x)\n {\n q += y;\n }\n p.push_back(q);\n }\n return p;\n}\n\nint main()\n{\n ll n;\n cin >> n;\n vector<string> s(n);\n rep(i, n) cin >> s[i];\n ll q;\n cin >> q;\n ll md = 0;\n rep(i, q)\n {\n int x;\n cin >> x;\n md += x;\n }\n md %= 4;\n md += 100;\n md %= 4;\n rep(i, md)\n {\n s = rotate(s);\n }\n for (auto x : s)\n {\n cout << x << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 8320, "score_of_the_acc": -0.9596, "final_rank": 13 }, { "submission_id": "aoj_0432_10872759", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef double dou;\ntypedef vector<ll> vll;\ntypedef vector<vll> vvll;\ntypedef vector<vvll> vvvll;\ntypedef pair<ll,ll> pll;\ntypedef vector<pll> vpll;\nstruct four_ll_pair{ll ff,fs,sf,ss;};\ntypedef pair<char,ll> pcl;\nstruct three_pcl_pair{pcl l,c,r;};\ntypedef string str;\ntypedef vector<str> vstr;\ntypedef map<ll,ll> mll;\ntypedef priority_queue<ll> maxpq;\ntypedef priority_queue<ll,vll,greater<ll>> minpq;\n#define FOR(i,a,b) for(ll i=a;i<b;i++)\n#define f0r(i,b) for(ll i=0;i<b;i++)\n#define SORT(a) sort(a.begin(),a.end());\n#define llin(a,n) f0r(i,n) {cin>>a[i];}\n#define REVERSE(a) reverse(a.begin(),a.end());\nconst ll llmax=9223372036854775783LL;\nconst ll mod=998244353LL;\nconst ll MOD=1000000007LL;\nstr ALP=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nstr alp=\"abcdefghijklmnopqrstuvwxyz\";\nvoid Yn(bool b) {cout<<(b?\"Yes\":\"No\")<<endl;}\nvoid YN(bool b) {cout<<(b?\"YES\":\"NO\")<<endl;}\nvll Remove_duplicates(vll a){\n a.erase(unique(a.begin(),a.end()),a.end());\n return a;\n}\nvll coordinate_compression(vll v){\n ll n=v.size();\n vll b=v;SORT(b);\n b=Remove_duplicates(b);\n vll ans(n);\n f0r(i,n){\n ll pos=lower_bound(b.begin(),b.end(),v[i])-b.begin();\n ans[i]=pos+1;\n }\n return ans;\n}\nnamespace mod_calc{\n ll mod_pow(ll base,ll a,ll m){\n ll result=1;\n while(a>0){\n if (a%2==1) result=(result*base)%m;\n base=(base*base)%m;\n a>>=1;\n }\n return result;\n }\n ll mod_divide(ll a,ll b,ll m){\n return a*mod_pow(b,m-2,m)%m;\n }\n ll mod_fraction(ll n,ll a,ll b,ll m){\n return mod_divide((n*a%m),b,m);\n }\n ll mod_com(ll a,ll b,ll m){\n ll ans=1;\n if (a<b) return 0;\n if (a==b) return 1;\n for(ll i=0;i<b;i++) ans=mod_fraction(ans,a-i,1+i,m);\n return ans;\n }\n}\nstruct Cumulative_Sum_2D{\n vvll data;\n Cumulative_Sum_2D(ll W,ll H):data(W+1,vll(H+1,0)){}\n void input(ll x,ll y,ll z){\n x++;y++;\n data[x][y]=z;\n }\n void build(){\n FOR(i,1,data.size()) FOR(j,1,data[i].size()) data[i][j]=data[i][j-1]+data[i-1][j]-data[i-1][j-1];\n }\n ll query(ll sx,ll sy,ll gx,ll gy){\n return(data[gx][gy]-data[sx][gy]-data[gx][sy]+data[sx][sy]);\n }\n};\nstruct unionfind{\n vll parent,ver_size;\n unionfind(ll n):parent(n),ver_size(n,1){\n iota(parent.begin(),parent.end(),0); \n }\n ll find(ll node,vll&parent){\n vll path;\n while(parent[node]!=node){\n path.push_back(node);\n node=parent[node];\n }\n for(ll u:path) parent[u]=node;\n return node;\n }\n void unionSets(ll u,ll w,vll&ver_size,vll&parent){\n ll rootU=find(u,parent),rootW=find(w,parent);\n if(rootU!=rootW){\n if(ver_size[rootU]<ver_size[rootW]){\n parent[rootU]=rootW;\n ver_size[rootW]+=ver_size[rootU];\n }else{\n parent[rootW]=rootU;\n ver_size[rootU]+=ver_size[rootW];\n }\n }\n }\n};\nnamespace divisor_calc{\n ll gcd(ll a,ll b){\n while(b!=0){\n ll tmp=a%b;\n a=b;\n b=tmp;\n }\n return a;\n }\n ll lcm(ll a,ll b){\n return a*b/gcd(a,b);\n }\n vll factorizations_vll(ll n){\n ll mema=n;\n vll ftz_ans;\n for(ll i=2;i*i<=mema;i++){\n while(mema%i==0){\n mema/=i;\n ftz_ans.push_back(i);\n }\n }\n if(mema!=1) ftz_ans.push_back(mema);\n return ftz_ans;\n }\n mll factorizations_mll(ll n){\n ll mema=n;\n mll ftz_ans;\n for(ll i=2;i*i<=mema;i++){\n while(mema%i==0){\n mema/=i;\n ftz_ans[i]++;\n }\n }\n if(mema!=1) ftz_ans[mema]++;\n return ftz_ans;\n }\n}\nnamespace all_distances{\n dou euclidean_distance(dou ax,dou ay,dou bx,dou by){\n return sqrt(pow(ax-bx,2)+pow(ay-by,2));\n }\n dou manhattan_distance(dou ax,dou ay,dou bx,dou by){\n return abs(ax-bx)+abs(ay-by);\n }\n dou chebyshev_distance(dou ax,dou ay,dou bx,dou by){\n return max(abs(ax-bx),abs(ay-by));\n }\n}\nstatic ll bit_ceil(ll n){\n if(n<=1)return 1;\n ll x=1;\n while(x<n)x<<=1;\n return x;\n}\ntemplate<class S,S(*op)(S,S),S(*e)()>struct segtree{\n public:\n segtree():segtree(0){}\n explicit segtree(ll n):segtree(vector<S>(n,e())){}\n explicit segtree(const vector<S>& v):_n((ll)v.size()){\n size=(ll)bit_ceil(_n);\n d=vector<S>(2*size,e());\n for(ll i=0;i<_n;i++)d[size+i]=v[i];\n for(ll i=size-1;i>=1;i--)update(i);\n }\n\n void set(ll p,S x){\n assert(0<=p&&p<_n);\n p+=size;\n d[p]=x;\n for(p>>=1;p>=1;p>>=1)update(p);\n }\n S get(ll p)const{\n assert(0<=p&&p<_n);\n return d[p+size];\n }\n S prod(ll l,ll r)const{\n assert(0<=l&&l<=r&&r<=_n);\n S sml=e(),smr=e();\n l+=size;\n r+=size;\n while(l<r){\n if(l&1)sml=op(sml,d[l++]);\n if(r&1)smr=op(d[--r],smr);\n l>>=1;\n r>>=1;\n }\n return op(sml,smr);\n }\n S all_prod()const{return d[1];}\n private:\n ll _n,size;\n vector<S> d;\n void update(ll k){d[k]=op(d[2*k],d[2*k+1]);}\n};\nll sum_op(ll a,ll b){return a+b;} ll sum_e(){return 0LL;}\nll max_op(ll a,ll b){return max(a,b);} ll max_e(){return -1LL;}\nll min_op(ll a,ll b){return min(a,b);} ll min_e(){return llmax;}\nll xor_op(ll a,ll b){return a^b;} ll xor_e(){return 0LL;}\nfour_ll_pair second_largest_op(four_ll_pair a,four_ll_pair b){\n ll FF,FS,SF,SS;\n if(a.ff==b.ff){\n FF=a.ff;FS=a.fs+b.fs;\n if(a.sf==b.sf){\n SF=a.sf;SS=a.ss+b.ss;\n }else{\n SF=max(a.sf,b.sf);\n SS=(SF==a.sf?a.ss:b.ss);\n }\n }else{\n FF=max(a.ff,b.ff);FS=(FF==a.ff?a.fs:b.fs);\n if(a.sf==b.sf){\n SF=a.sf;SS=a.ss+b.ss;\n }else{\n SF=max(a.sf,b.sf);SS=(SF==a.sf?a.ss:b.ss);\n }\n if(SF==min(a.ff,b.ff)){\n SS+=(SF==a.ff?a.fs:b.fs);\n }else{\n SF=max(SF,min(a.ff,b.ff));SS=(SF==min(a.ff,b.ff)?(SF==a.ff?a.fs:b.fs):SS);\n }\n }\n return {FF,FS,SF,SS};\n} \nfour_ll_pair second_largest_e(){return {0,0,0,0};}\nthree_pcl_pair max_combo_op(three_pcl_pair a,three_pcl_pair b){\n ll Max=max(a.c.second,b.c.second);\n if(a.r.first==b.l.first) Max=max(Max,a.r.second+b.l.second);\n char check=((a.c.first=='T'&&b.c.first=='T')?'T':'F');\n if(a.l.first!=b.l.first) check='F';\n pcl re_l=a.l,re_r=b.r;\n if(re_l.first=='0')re_l=b.l;\n else if(a.c.first=='T'&&a.r.first==b.l.first) re_l.second+=b.l.second;\n if(re_r.first=='0')re_r=a.r;\n else if(b.c.first=='T'&&a.r.first==b.l.first) re_r.second+=a.r.second;\n return {re_l,{check,Max},re_r};\n}\nthree_pcl_pair max_combo_e(){return {{'0',0},{'T',0},{'0',0}};}\nll sum_mod_op(ll a,ll b){return (a+b)%mod;} ll sum_mod_e(){return 0LL;}\nvll bfsdis(ll s,vvll graph){\n vll dist(graph.size(),1145141919810);\n queue<ll> q;\n dist[s]=0;\n q.push(s);\n while(!q.empty()){\n ll u=q.front();q.pop();\n for(ll v:graph[u]){\n if (dist[v]==1145141919810) {\n dist[v]=dist[u]+1;\n q.push(v);\n }\n }\n }\n return dist;\n}\nll Ackermann_function(ll m,ll n){\n if(m<=1) return n+1+m;\n else if(m==2) return 2*n+3;\n else{\n ll ans=1LL;\n f0r(i,n+3) ans*=2LL;\n return ans-3LL;\n }\n}\nll ans=0,k;\nvector<vector<char>> s;\nvector<vector<bool>> a;\nvoid dfs(ll i,ll j,ll dist){\n a[i][j]=false;\n if(dist==k) {ans++; a[i][j]=true; return;}\n if(s[i][j+1]=='.'&&a[i][j+1]) dfs(i,j+1,dist+1);\n if(s[i][j-1]=='.'&&a[i][j-1]) dfs(i,j-1,dist+1);\n if(s[i+1][j]=='.'&&a[i+1][j]) dfs(i+1,j,dist+1);\n if(s[i-1][j]=='.'&&a[i-1][j]) dfs(i-1,j,dist+1);\n a[i][j]=true;\n}\nint main(){\n ll n;cin>>n;\n vstr s(n);llin(s,n);\n ll r=0,q;\n cin>>q;\n f0r(i,q){\n ll a;cin>>a;\n r+=a;\n }\n r=(r+1234560)%4;\n if(r==0){\n f0r(i,n) {\n f0r(j,n) cout<<s[i][j];\n cout<<endl;\n }\n }else if(r==3){\n f0r(i,n) {\n f0r(j,n) cout<<s[j][n-i-1];\n cout<<endl;\n }\n }else if(r==2){\n f0r(i,n) {\n f0r(j,n) cout<<s[n-i-1][n-j-1];\n cout<<endl;\n }\n }else if(r==1){\n f0r(i,n) {\n f0r(j,n) cout<<s[n-j-1][i];\n cout<<endl;\n }\n }\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 5360, "score_of_the_acc": -0.8964, "final_rank": 10 }, { "submission_id": "aoj_0432_10872556", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define rep(i,N) for(int i=0;i<(int)N;i++)\n#define all(x) x.begin(),x.end()\n#define fi first\n#define se second\n#define pb push_back\n\nint main(){\n int N;cin>>N;\n vector<string>S(N);\n rep(i,N)cin>>S[i];\n int Q;cin>>Q;\n int t = 0;\n rep(i,Q){\n int r;cin>>r;\n t+=r;\n t+=4;\n t%=4;\n }\n rep(ttt,t){\n vector<string>T(N,string(N,'0'));\n rep(i,N)rep(j,N){\n T[j][N-i-1]=S[i][j];\n }\n swap(S,T);\n }\n rep(i,N)cout<<S[i]<<endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 5932, "score_of_the_acc": -0.7041, "final_rank": 7 }, { "submission_id": "aoj_0432_10867977", "code_snippet": "//#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define all(a) (a).begin(), (a).end()\nusing ll = long long;\nconst ll INF32 = 2e9;\nconst ll INF64 = 4e18;\n#define int long long\n\nvoid printYN(bool ok){\n if(ok)cout << \"Yes\" << endl;\n else cout << \"No\" << endl;\n return;\n}\n\nvoid rorate(int type, vector<string> &P){\n int N = P.size();\n vector<string> res(N);\n if(type==1){\n rep(i, N)rep(j, N){\n res[i].push_back(P[N-j-1][i]);\n }\n }\n else if(type==2){\n rep(i, N)rep(j, N){\n res[i].push_back(P[N-i-1][N-1-j]);\n }\n }\n else if(type==3){\n rep(i, N)rep(j, N){\n res[i].push_back(P[j][N-1-i]);\n }\n } else {\n res = P;\n }\n P = res;\n return;\n}\n\nsigned main(){\n int N;\n cin >> N;\n vector<string> P(N);\n rep(i, N)cin >> P[i];\n int Q;\n cin >> Q;\n int sum= 0;\n rep(i, Q){\n int type;\n cin >> type;\n sum += type;\n }\n sum += 4*INF32;\n rorate(sum%4, P);\n rep(i, N)cout << P[i] << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 6992, "score_of_the_acc": -0.9655, "final_rank": 14 }, { "submission_id": "aoj_0432_10867828", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ld=long double;\n#define fi first\n#define se second\n#define i128 __int128_t\n#define all(x) x.begin(),x.end()\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define si(a) (long)(a.size())\ntemplate<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}\ntemplate<typename T>bool chmax(T&a,T b){return b>a?(a=b,1):0;}\nconst int INF=1e9+100;\nconst long INFL=3e18+100;\nstruct _ {\n _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }\n} __;\n\nint main(){\n int N;\n cin>>N;\n vector<vector<char>> S(N,vector<char>(N));\n rep(i,N)rep(j,N)cin>>S[i][j];\n int Q;\n cin>>Q;\n int k=0;\n while(Q--){\n int a;\n cin>>a;\n k+=(a+4);\n k%=4;\n }\n rep(_,k){\n vector T=S;\n rep(i,N)rep(j,N) S[i][j]=T[N-j-1][i];\n }\n rep(i,N){\n rep(j,N)cout<<S[i][j];\n cout<<\"\\n\";\n }\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 5376, "score_of_the_acc": -0.2337, "final_rank": 4 }, { "submission_id": "aoj_0432_10862950", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main()\n{\n int n;\n cin>>n;\n vector<vector<char>> p(n,vector<char>(n));\n for(int i=0;i<n;i++) for(int j=0;j<n;j++) cin>>p[i][j];\n int q;\n cin>>q;\n int rot = 0;\n while(q--)\n {\n int a;\n cin>>a;\n rot += a;\n }\n \n rot %= 4;\n rot += 4;\n rot %= 4;\n \n \n for(int l=0;l<rot;l++)\n {\n auto rotp = p;\n for(int i=0;i<n;i++) for(int j=0;j<n;j++)\n {\n rotp[i][j] = p[n-1-j][i];\n }\n p = rotp;\n }\n \n for(int i=0;i<n;i++)\n {\n for(int j=0;j<n;j++)\n {\n cout<<p[i][j];\n }\n cout<<endl;\n }\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 5060, "score_of_the_acc": -1.1558, "final_rank": 17 }, { "submission_id": "aoj_0432_10862187", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define ll long long\nconst long long mod=998244353;\nconst long long hmod=46216567629137;\n\nint main(){\n cin.tie(0)->sync_with_stdio(0);\n cout.tie(0);\n int N;\n cin>>N;\n char S[N+1][N+1];\n for(int i=1;i<=N;i++){\n for(int j=1;j<=N;j++) cin>>S[i][j];\n }\n int Q;\n cin>>Q;\n int kaiten=0;\n for(int i=1;i<=Q;i++){\n int r;\n cin>>r;\n kaiten+=r;\n }\n kaiten%=4;\n if(kaiten<0) kaiten+=4;\n for(int z=1;z<=kaiten;z++){\n int nex[N+1][N+1];\n for(int i=1;i<=N;i++){\n for(int j=1;j<=N;j++){\n nex[i][j]=S[N-j+1][i];\n }\n }\n for(int i=1;i<=N;i++){\n for(int j=1;j<=N;j++){\n S[i][j]=nex[i][j];\n }\n }\n }\n for(int i=1;i<=N;i++){\n for(int j=1;j<=N;j++) cout<<S[i][j];\n cout<<endl;\n }\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 8224, "score_of_the_acc": -0.9359, "final_rank": 12 }, { "submission_id": "aoj_0432_10859826", "code_snippet": "#include<bits/stdc++.h>\n//#include<atcoder/all>\n\nusing namespace std;\n//using namespace atcoder;\n#define rep(i,n) for(ll i=0; i<n; i++)\n#define rrep(i,n) for(ll i=n-1; i>=0; i--)\n#define print(a) cout<<a<<endl\ntypedef long long ll;\n#define yn(flg) if(flg){cout<<\"Yes\"<<endl;}else{cout<<\"No\"<<endl;}\n#define YN(flg) if(flg){cout<<\"YES\"<<endl;}else{cout<<\"NO\"<<endl;}\n#define so(a) sort(a.begin(),a.end())\n#define mp make_pair\n#define vi vector<int>\n#define vl vector<ll>\n#define vs vector<string>\n#define pb push_back\n#define a2i(a,s) (ll)(a-s)\n#define i2a(s,a) (char)(s+a)\n#define ssize(a) a.size()\ntypedef pair<int, int> Pii;\ntypedef pair<int, ll> Pil;\ntypedef pair<pair<ll,ll>,ll> P3;\ntypedef pair<pair<ll,ll>,pair<ll,ll>> P4;\n\ntypedef pair<ll, ll> Pll;\ntypedef pair<ll,Pll> Plll;\ntypedef pair<Pii, int> Piii;\nconst ll INF = 1000000000000000000;\n\ntemplate<class T> inline bool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<class T> inline bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\n//vector<ll> saiki(ll bit,ll n){\n//\tvector<ll> s(n);\n//\tfor(ll i=0;i<n;i++){\n//\t\tif(bit&(1<<i)){\n//\t\t\ts[i]=1;\n//\t\t}else s[i]=0;\n//\t}\n//\treturn s;\n//}\n\n\nint main(){\n//入力\n\n\tcin.tie(0);\n\tios::sync_with_stdio(0);\n\n\tll n;\n\tcin>>n;\n\tvector<string> s(n);\n\trep(i,n)cin>>s[i];\n\n//判定\n\tll v=0;\n\tll q;\n\tcin>>q;\n\trep(i,q){\n\t\tll r;\n\t\tcin>>r;\n\t\tv+=r;\n\t}\n\tv=v%4;\n\n//判定２\n\tif(v==1||v==-3){\n\t\tfor(ll j=0;j<n;j++){\n\t\t\tfor(ll i=n-1;i>=0;i--){\n\t\t\t\tcout<<s[i][j];\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\tif(v==2||v==-2){\n\t\tfor(ll i=n-1;i>=0;i--){\n\t\t\tfor(ll j=n-1;j>=0;j--){\n\t\t\t\tcout<<s[i][j];\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\tif(v==3||v==-1){\n\t\tfor(ll j=n-1;j>=0;j--){\n\t\t\tfor(ll i=0;i<n;i++){\n\t\t\t\tcout<<s[i][j];\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\tif(v==0){\n\t\trep(i,n){\n\t\t\trep(j,n){\n\t\t\t\tcout<<s[i][j];\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\n\n\treturn 0;\n\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4428, "score_of_the_acc": 0, "final_rank": 1 }, { "submission_id": "aoj_0432_10859313", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int n;\n cin >>n;\n string s[n];\n for(int i = 0;i < n;i++)cin >>s[i];\n int q;\n cin >>q;\n int x = 0;\n for(int i = 0,j;i < q;i++){\n cin >>j;\n x += j;\n }\n x%=4;\n if(x < 0){\n x += 4;\n }\n for(int i = 0;i < x;i++){\n string t[n];\n for(int j = 0;j < n;j++)t[j] = s[j];\n for(int j = 0;j < n;j++){\n for(int k = 0;k < n;k++){\n s[k][n-1-j] = t[j][k];\n }\n }\n }\n for(int i = 0;i < n;i++){\n for(int j = 0;j < n;j++){\n cout <<s[i][j];\n }\n cout <<\"\\n\";\n }\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 6292, "score_of_the_acc": -1.1262, "final_rank": 16 }, { "submission_id": "aoj_0432_10858889", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define oke cout << \"Yes\" << '\\n';\n#define dame cout << \"No\" << '\\n';\n#define all(a) a.begin(), a.end()\n#define rall(a) a.rbegin(), a.rend()\nusing HaiI = vector<vector<int>>;\nusing Hai2 = vector<vector<ll>>;\nusing HaiB = vector<vector<bool>>;\nusing Hai3 = vector<vector<vector<ll>>>;\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tcout << fixed << setprecision(15);\n\tll N;\n\tcin>>N;\n\tvector<string>S(N);\n\trep(i,N){\n\t\tcin>>S[i];\n\t}\n\tll Q,cut=0;\n\tcin>>Q;\n\trep(i,Q){\n\t\tll a;\n\t\tcin>>a;\n\t\tcut+=a;\n\t}\n\tcut%=4;\n\tif(cut<0){\n\t\tcut+=4;\n\t}\n\trep(to,cut){\n\t\tvector<string>B=S;\n\t\trep(i,N){\n\t\t\trep(j,N){\n\t\t\t\tS[j][N-i-1]=B[i][j];\n\t\t\t}\n\t\t}\n\t}\n\trep(i,N){\n\t\trep(j,N){\n\t\t\tcout<<S[i][j];\n\t\t}\n\t\tcout<<\"\\n\";\n\t}\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 5256, "score_of_the_acc": -0.2041, "final_rank": 3 }, { "submission_id": "aoj_0432_10845907", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define INF 1LL<<60\nint main(){\n \n ll n,r=0,q;cin>>n;\n vector<vector<char>> ma(n,vector<char>(n));\n for(auto& i:ma)for(auto& j:i)cin>>j;\n cin>>q;\n while(q--){\n ll f;cin>>f;\n r+=f;\n }\n r=(r%4+4)%4;\n for(ll k=0;k<r;k++){\n vector<vector<char>> mf(n,vector<char>(n));\n for(ll i=0;i<n;i++){\n for(ll j=0;j<n;j++){\n mf[j][n-1-i]=ma[i][j];\n }\n }\n ma=mf;\n }\n for(auto i:ma){\n for(auto j:i)cout<<j;\n cout<<endl;\n }\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 5156, "score_of_the_acc": -1.1795, "final_rank": 18 }, { "submission_id": "aoj_0432_10843437", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)\n#define all(a) (a).begin(),(a).end()\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n \n int N;\n cin >> N;\n vector S(N, vector<char>(N));\n rep(i, 0, N) rep(j, 0, N) cin >> S[i][j];\n \n int Q;\n cin >> Q;\n int op = 0;\n rep(i, 0, Q) {\n int r;\n cin >> r;\n op += r;\n }\n \n op = (op % 4 + 4) % 4;\n \n rep(itr, 0, op) {\n vector T(N, vector<char>(N));\n \n rep(i, 0, N) rep(j, 0, N) {\n T[j][N - i - 1] = S[i][j];\n }\n S = T;\n }\n rep(i, 0, N) {\n rep(j, 0, N) cout << S[i][j];\n cout << '\\n';\n }\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 5164, "score_of_the_acc": -0.5148, "final_rank": 5 }, { "submission_id": "aoj_0432_10835517", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nvoid rotate(vector<vector<char>> &R){\n int n = R.size();\n\tvector<vector<char>> R2 = R;\n\tfor(int i = 0; i < n; i++){\n\t\tfor(int j = 0; j < n; j++){\n\t\t\tR[j][n-i-1] = R2[i][j];\n\t\t}\n\t}\n}\n\nint main(){\n int n;\n\tcin >> n;\n\tvector<vector<char>> r(n, vector<char>(n));\n\tfor(int i = 0; i < n; i++){\n\t\tfor(int j = 0; j < n; j++){\n\t\t\tcin >> r[i][j];\n\t\t}\n\t}\n\tint q;\n\tcin >> q;\n\tint cnt = 0;\n\twhile(q--){\n\t\tint r2;\n\t\tcin >> r2;\n\t\tif(r2 == 1){\n\t\t\tcnt++;\n\t\t}\n\t\telse{\n\t\t\tcnt += 3;\n\t\t}\n\t\tcnt %= 4;\n\t}\n for(int i = 0; i < cnt; i++) rotate(r);\n\tfor(int i = 0; i < n; i++){\n\t\tfor(int j = 0; j < n; j++){\n\t\t\tcout << r[i][j];\n\t\t}\n\t\tcout << '\\n';\n\t}\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 5156, "score_of_the_acc": -1.1795, "final_rank": 18 }, { "submission_id": "aoj_0432_10835392", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint N;\n\nvoid solve(vector<vector<char>> &R){\n\tvector<vector<char>> RR=R;\n\tfor(int i=0;i<N;i++){\n\t\tfor(int j=0;j<N;j++){\n\t\t\tR[j][N-i-1]=RR[i][j];\n\t\t}\n\t}\n}\n\nint main(){\n\tcin >> N;\n\tvector<vector<char>> R(N,vector<char>(N));\n\tfor(int i=0;i<N;i++){\n\t\tfor(int j=0;j<N;j++){\n\t\t\tcin >> R[i][j];\n\t\t}\n\t}\n\tvector<vector<vector<char>>> data(4);\n\tdata[0]=R;\n\tfor(int i=1;i<4;i++){\n\t\tsolve(R);\n\t\tdata[i]=R;\n\t}\n\tint Q;\n\tcin >> Q;\n\tint cnt=0;\n\tfor(;Q--;){\n\t\tint r;\n\t\tcin >> r;\n\t\tif(r==1){\n\t\t\tcnt++;\n\t\t}\n\t\telse{\n\t\t\tcnt+=3;\n\t\t}\n\t\tcnt%=4;\n\t}\n\tfor(int i=0;i<N;i++){\n\t\tfor(int j=0;j<N;j++){\n\t\t\tcout << data[cnt][i][j];\n\t\t}\n\t\tcout << '\\n';\n\t}\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 8484, "score_of_the_acc": -2, "final_rank": 20 }, { "submission_id": "aoj_0432_10832334", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i = 0; i < n; ++i)\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int n;\n cin >> n;\n vector<string> row(n);\n rep(i,n) cin >> row[i];\n\n int q;\n cin >> q;\n int sum = 0;\n while(q--) {\n int r;\n cin >> r;\n sum += r;\n }\n\n vector<vector<char>> ans(n, vector<char>(n));\n int ans_rotate = sum % 4;\n if(ans_rotate == 1 || ans_rotate == -3) {\n rep(i,n) {\n rep(j,n) {\n ans[j][n-1-i] = row[i][j];\n }\n }\n }else if(ans_rotate == 2 || ans_rotate == -2) {\n rep(i,n) {\n rep(j,n) {\n ans[n-i-1][n-j-1] = row[i][j];\n }\n }\n }else if(ans_rotate == 3 || ans_rotate == -1) {\n rep(i,n) {\n rep(j,n) {\n ans[n-j-1][i] = row[i][j];\n }\n }\n }else {\n rep(i,n) {\n rep(j,n) {\n ans[i][j] = row[i][j];\n }\n }\n }\n rep(i,n) {\n rep(j,n) {\n cout << ans[i][j];\n }\n cout << endl;\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 5192, "score_of_the_acc": -0.1884, "final_rank": 2 }, { "submission_id": "aoj_0432_10818404", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int n,q,g;\n cin>>n;\n string a[n],b[n];\n for(int i=0;i<n;i++){\n cin>>a[i];\n b[i]=a[i];\n }\n cin>>q;\n int r;\n for(int i=0;i<q;i++){\n cin>>r;\n g+=r;\n }\n if(g<0){\n for(int i=0;i<g%4*-1;i++){\n for(int j=0;j<n;j++){\n for(int k=0;k<n;k++){\n b[j][k]=a[k][n-1-j];\n }\n }\n for(int j=0;j<n;j++)a[j]=b[j];\n }\n for(int j=0;j<n;j++)cout<<a[j]<<endl;\n }\n else if(g>0){\n for(int i=0;i<g%4;i++){\n for(int j=0;j<n;j++){\n for(int k=0;k<n;k++){\n b[j][k]=a[n-1-k][j];\n }\n }\n for(int j=0;j<n;j++)a[j]=b[j];\n }\n for(int j=0;j<n;j++)cout<<a[j]<<endl;\n }\n else for(int j=0;j<n;j++)cout<<a[j]<<endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 6400, "score_of_the_acc": -0.8195, "final_rank": 9 }, { "submission_id": "aoj_0432_10818401", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n\tint n,i,j,q,flg=0,k,cnt=0,cnt2=0,ans;\n\tcin>>n;\n\tstring s[n],t[n];\n\tfor(i=0;i<n;i++){\n\t\tcin>>s[i];\n\t\tt[i]=s[i];\n\t}\n\tcin>>q;\n\tint r[q];\n\tfor(i=0;i<q;i++){\n\t\tcin>>r[i];\n\t}\n\tfor(i=0;i<q;i++){\n\t\tif(r[i]==1)\tcnt++;\n\t\tif(r[i]==-1)\tcnt2++;\n\t}\n\tcnt=cnt%4;\n\tcnt2=cnt2%4;\n\tif(cnt>cnt2){\n\t\tans=cnt-cnt2;\n\t\tflg=1;\n\t}\n\telse{\n\t\t//cout<<'A'<<endl;\n\t\tans=cnt2-cnt;\n\t}\n\t//cout<<ans<<endl;\n\tif(flg==0){\n\t\t//cout<<'A'<<endl;\n\t\tfor(k=0;k<ans;k++){\n\t\t\tfor(i=0;i<n;i++){\n\t\t\t\tfor(j=0;j<n;j++){\n\t\t\t\t\tt[i][j]=s[j][n-1-i];\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(i=0;i<n;i++)\ts[i]=t[i];\n\t\t}\n\t}\n\telse{\n\t\tfor(k=0;k<ans;k++){\n\t\t\tfor(i=0;i<n;i++){\n\t\t\t\tfor(j=0;j<n;j++){\n\t\t\t\t\tt[i][j]=s[n-1-j][i];\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor(i=0;i<n;i++)\ts[i]=t[i];\n\t\t}\n\t}\n\tfor(i=0;i<n;i++){\n\t\tcout<<s[i]<<endl;\n\t}\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 7176, "score_of_the_acc": -1.0108, "final_rank": 15 }, { "submission_id": "aoj_0432_10818336", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nchar r1[1000][1001],r2[1000][1001];\nint main(void)\n{\n\tint n,i,j,k,q,r,s;\n\tcin>>n;\n\tfor(i=0;i<n;i++){\n\t\tcin>>r1[i];\n\t}\n\tcin>>q;\n\ts=0;\n\tfor(i=0;i<q;i++){\n\t\tcin>>r;\n\t\ts+=r;\n\t}\n\ts=s%4;\n\tif(s<0){\n\t\ts+=4;\n\t}\n\tfor(i=0;i<s;i++){\n\t\tfor(j=0;j<n;j++){\n\t\t\tfor(k=0;k<n;k++){\n\t\t\t\tr2[j][k]=r1[n-k-1][j];\n\t\t\t}\n\t\t}\n\t\tfor(j=0;j<n;j++){\n\t\t\tfor(k=0;k<n;k++){\n\t\t\t\tr1[j][k]=r2[j][k];\n\t\t\t}\n\t\t}\n\t}\n\tfor(i=0;i<n;i++){\n\t\tcout<<r1[i]<<endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 5320, "score_of_the_acc": -0.5533, "final_rank": 6 }, { "submission_id": "aoj_0432_10818324", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int n,r,cnt=0,cnt1=0,ans=0,flg=0;\n string s[1001],t[1001];\n cin>>n;\n for(int i=0;i<n;i++){\n cin>>s[i];\n t[i]=s[i];\n }\n int q;\n cin>>q;\n for(int k=0;k<q;k++){\n cin>>r;\n if(r==-1)cnt++;\n if(r==1)cnt1++;\n }\n cnt=cnt%4;\n cnt1=cnt1%4;\n if(cnt>cnt1){\n ans=cnt-cnt1;\n flg=1;\n }\n else {\n ans=cnt1-cnt;\n }\n //cout<<ans<<endl;\n //cout<<flg<<endl;\n if(!flg){\n //cout<<'A' <<endl;\n for(int k=0;k<ans;k++){\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n t[i][j]=s[n-1-j][i];\n }\n }\n for(int i=0;i<n;i++)s[i]=t[i];\n }\n }\n else{\n for(int k=0;k<ans;k++){\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n t[i][j]=s[j][n-1-i];\n }\n }\n for(int i=0;i<n;i++) s[i]=t[i];\n }\n }\n for(int i=0;i<n;i++){\n cout<<t[i]<<endl;\n }\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 6328, "score_of_the_acc": -0.8018, "final_rank": 8 }, { "submission_id": "aoj_0432_10818174", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n\tint n,q,r,ans=0,i,j;\n\tstring raw[1001];\n\tcin>>n;\n\tfor(i=0;i<n;i++) cin>>raw[i];\n\tcin>>q;\n\tfor(i=0;i<q;i++){\n\t\tcin>>r;\n\t\tans+=r;\n\t}\n\tif(ans%4==0){\n\t\tfor(i=0;i<n;i++){\n\t\t\tfor(j=0;j<n;j++) cout<<raw[i][j];\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\telse if(ans%4==1 || ans%4==-3){\n\t\tfor(i=0;i<n;i++){\n\t\t\tfor(j=n-1;0<=j;j--) cout<<raw[j][i];\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\telse if(ans%4==2 || ans%4==-2){\n\t\tfor(i=n-1;0<=i;i--){\n\t\t\tfor(j=n-1;0<=j;j--) cout<<raw[i][j];\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\telse{\n\t\tfor(i=n-1;0<=i;i--){\n\t\t\tfor(j=0;j<n;j++) cout<<raw[j][i];\n\t\t\tcout<<endl;\n\t\t}\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 5368, "score_of_the_acc": -0.8984, "final_rank": 11 } ]
aoj_0436_cpp
Warehouse Robot Aizu Transport is developing a warehouse guard robot. In our warehouse, points in the warehouse are managed by coordinates (x,y) as shown in the floor plan below. In the warehouse, shelves with square bottoms are arranged in a regular pattern to facilitate the management of cargo. If we represent the positions of the southwest and northeast corners of the shelves by pairs of coordinates of points in the warehouse, the shelves are (0,0) and (1,1), (2,0) and (3,1), ..., (0,2) and (1,3), (2,2) and (3,3), ..., and so on, from one end of the warehouse to the other, they are placed in such a way that they occupy a square area represented by (2i,2j) and (2i+1,2j+1) using zero or more integers i and j. The warehouseman robot can move freely when there are no shelves. It cannot pass through the area where shelves are placed, but it can pass over the boundary of the shelf area because of its small size. For example, to go from point (0,0) to point (4,3) in the shortest distance, you can move as follows. You, the warehouseman robot development department, are planning to add a function to the robot to calculate the shortest distance to the target point. Given the point where the warehouse guard robot is currently located and the target point, write a program that outputs the shortest distance that the robot will travel to reach the target point. Input The input is given in the following form. $x_0$ $y_0$ $x_1$ $y_1$ In one line, the coordinates $x_0$,$y_0$ ($0 \leq x_0,y_0 \leq 300$) of the point where the warehouse guard robot is currently located and the coordinates $x_1$,$y_1$ ($0 \leq x_1,y_1 \leq 300$) of the target point are all given as integers. The warehouse can be thought of as a rectangle of such a size that all points with the given coordinates exist. The coordinates of the point where the robot is currently located and the target point are different ($x_0 \ne x_1$ or $y_0 \ne y_1$). Output Output the shortest distance for the robot to reach the target point as a real number on one line. The error must not exceed plus or minus 0.00001. Sample Input and Output Sample Input 1 0 0 4 3 Sample Output 1 5.24264069 Sample Input 2 7 1 1 6 Sample Output 2 7.89292223 Sample Input 3 0 2 5 2 Sample Output 3 5
[ { "submission_id": "aoj_0436_10875344", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ld=long double;\n#define fi first\n#define se second\n#define i128 __int128_t\n#define all(x) x.begin(),x.end()\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define si(a) (long)(a.size())\ntemplate<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}\ntemplate<typename T>bool chmax(T&a,T b){return b>a?(a=b,1):0;}\nconst int INF=1e9+100;\nconst long INFL=3e18+100;\nstruct _ {\n _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }\n} __;\n\nint main(){\n int sx,sy,gx,gy;\n cin>>sx>>sy>>gx>>gy;\n vector<pair<int,int>> V;\n int L=301;\n rep(i,L)rep(j,L) V.push_back({i,j});\n sort(all(V), [&](auto a, auto b){return abs(a.fi-sy)+abs(a.se-sx)<abs(b.fi-sy)+abs(b.se-sx);});\n \n vector dp(L,vector<ld>(L,1e9));\n dp[sy][sx]=0;\n vector<ld> X(L,0);\n rep(i,L)X[i]=hypotf64(1, i);\n for(auto [y,x]: V){\n\n vector<int> dd={0,1,0,-1,0};\n rep(i,4){\n int ny=y+dd[i];\n int nx=x+dd[i+1];\n if(ny<0||L<=ny||nx<0||L<=nx) continue;\n chmin(dp[ny][nx], dp[y][x]+1);\n }\n rep(_,1){\n int ny=y+(y%2)*2-1;\n if(ny<0||L<=ny) continue;\n rep(nx,L){\n chmin(dp[ny][nx], dp[y][x]+X[abs(x-nx)]);\n }\n }\n rep(_,1){\n int nx=x+(x%2)*2-1;\n if(nx<0||L<=nx) continue;\n rep(ny,L){\n chmin(dp[ny][nx], dp[y][x]+X[abs(y-ny)]);\n }\n }\n }\n cout<<fixed<<setprecision(15);\n cout<<dp[gy][gx]<<\"\\n\";\n\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 5860, "score_of_the_acc": -0.2738, "final_rank": 5 }, { "submission_id": "aoj_0436_10875137", "code_snippet": "#include <bits/stdc++.h>\n#include <random>\nusing namespace std;\n#define all(a) a.begin(),a.end()\n#define vc_rotate(a) rotate(a.begin(),a.begin() + 1,a.end());\ntypedef long long ll;typedef long double ld;\n#define INF (ll)2e18\nconst int inf = (1 << 30);\nusing pii = pair<int,int>;\nusing dat = pair<ld,pair<int,int>>;\nusing pq = priority_queue<dat,vector<dat>,greater<dat>>;//{cost,node}\nvector<pii> dir = {{0,1},{1,0},{-1,0},{0,-1}};\n\ntemplate<typename T> bool chmin(T &a, T b) { if (a > b){a = b;return true;}else return false; }\ntemplate<typename T> bool chmax(T &a, T b) { if (a < b){a = b;return true;}else return false; }\ntemplate<typename T> void vec_out(vector<T> a){for (int i = 0;i < a.size();i++)cout << a[i] << ' ';cout << endl;}\ntemplate<typename T> void vvout(vector<vector<T>> a){for (int i =0;i <a.size();i++){vec_out(a[i]);}}\ntemplate<typename T> void set_out(T a){for (auto it = a.begin();it != a.end();it++)cout << *it << ' ';cout << endl;}\ntemplate<typename T> void map_out(T a){for (auto it = a.begin();it != a.end();it++)cout << \"key = \" << it->first << \" val = \" << it->second << endl;}\ntemplate<typename T,typename U> T div_ceil(T a,U b){assert(b != 0);return (a + b - 1) / b;}\nvoid debug(){cout << \"No Runtime Error\" << endl;}\nint popcount(ll t){return __builtin_popcountll(t);}\n\nld dist(int a,int b,int c,int d){\n return sqrt(ld(c - a) * ld(c - a) + ld(d - b) * ld(d - b));\n};\n\nint main(){\n int a,b,c,d;\n cin >> a >> b >> c >>d;\n vector<vector<ld>> dp(301,vector<ld> (301,ld(1000)));\n dp[a][b] = 0;\n pq q;\n q.push(make_pair(0,make_pair(a,b)));\n int cnt= 0;\n while(!q.empty()){\n auto [val,w] = q.top();\n auto[x,y] = w;\n q.pop();\n cnt++;\n if (cnt >= 100000) break;\n if (x % 2 == 1){\n if (x + 1 <= 300){\n for (int i = 0;i < 301;i++){\n if (chmin(dp[x + 1][i],val + dist(x,y,x + 1,i))){\n q.push(make_pair(dp[x + 1][i],make_pair(x + 1,i)));\n }\n }\n }\n if (y - 1 >= 0 && dp[x][y - 1] > dp[x][y] + 1){\n dp[x][y - 1] = dp[x][y] + 1;\n q.push(make_pair(dp[x][y - 1],make_pair(x,y - 1)));\n }\n }\n else{\n if (x - 1 >= 0){\n for (int i = 0;i < 301;i++){\n if (chmin(dp[x - 1][i],val + dist(x,y,x - 1,i))){\n q.push(make_pair(dp[x - 1][i],make_pair(x - 1,i)));\n }\n }\n }\n if (y + 1 <= 300 && dp[x][y + 1] > dp[x][y] + 1){\n dp[x][y + 1] = dp[x][y] + 1;\n q.push(make_pair(dp[x][y + 1],make_pair(x,y + 1)));\n }\n }\n if (y % 2 == 1){\n if (y + 1 <= 300){\n for (int i = 0;i < 301;i++){\n if (chmin(dp[i][y + 1],val + dist(x,y,i,y + 1))){\n q.push(make_pair(dp[i][y + 1],make_pair(i,y + 1)));\n }\n }\n }\n if (x - 1 >= 0 && dp[x - 1][y] > dp[x][y] + 1){\n dp[x - 1][y] = dp[x][y] + 1;\n q.push(make_pair(dp[x - 1][y],make_pair(x - 1,y)));\n }\n }\n else{\n if (y - 1 >= 0){\n for (int i = 0;i < 301;i++){\n if (chmin(dp[i][y - 1],val + dist(x,y,i,y - 1))){\n q.push(make_pair(dp[i][y - 1],make_pair(i,y - 1)));\n }\n }\n }\n if (x + 1 <= 300 && dp[x +1][y] > dp[x][y] + 1){\n dp[x + 1][y] = dp[x][y] + 1;\n q.push(make_pair(dp[x +1][y],make_pair(x + 1,y)));\n }\n }\n }\n cout << fixed << setprecision(8);\n cout << dp[c][d] << endl;\n}", "accuracy": 0.10416666666666667, "time_ms": 200, "memory_kb": 71504, "score_of_the_acc": -1.3878, "final_rank": 20 }, { "submission_id": "aoj_0436_10874536", "code_snippet": "#include<bits/stdc++.h>\n#include <iomanip>\n#pragma GCC optimize(\"O2\")\nusing namespace std;\n#define ll long long \n#define ld long double\n#define rep(i,N) for(int i=0;i<(int)N;i++)\n#define all(x) x.begin(),x.end()\n#define fi first\n#define se second\n#define pb push_back\nvector<int>dx={0,0,1,-1},dy={1,-1,0,0};\nbool out(int x,int y){\n return (x<0||301<x||y<0||301<y);\n}\nint main(){\n int sx,sy,tx,ty;cin>>sx>>sy>>tx>>ty;\n vector<vector<ld>>dist(302,vector<ld>(302,1000.0));\n dist[sx][sy]=0;\n int dlim = max(302-sx,sx)+max(302-sy,sy);\n vector<vector<bool>>seen(302,vector<bool>(302,false));\n rep(k,dlim+1)for(int i = -k;i<=k;i++)for(int kk=1;kk>=-1;kk-=2){\n int x = sx+i,y = sy+((k-abs(i))*kk);\n if(x<0||301<x||y<0||301<y)continue;\n if(seen[x][y]){\n continue;\n }\n seen[x][y]=true;\n rep(t,4){\n int nx = x+dx[t],ny=y+dy[t];\n if(out(nx,ny))continue;\n dist[nx][ny]=min(dist[nx][ny],dist[x][y]+1);\n }\n if(x%2!=0||y%2!=0){\n int nx = x+1,ny=y+1;\n if(out(nx,ny))continue;\n dist[nx][ny]=min(dist[nx][ny],dist[x][y]+sqrtl(2));\n }\n if(x%2!=1||y%2!=0){\n int nx = x-1,ny=y+1;\n if(out(nx,ny))continue;\n dist[nx][ny]=min(dist[nx][ny],dist[x][y]+sqrtl(2));\n }\n if(x%2!=0||y%2!=1){\n int nx = x+1,ny=y-1;\n if(out(nx,ny))continue;\n dist[nx][ny]=min(dist[nx][ny],dist[x][y]+sqrtl(2));\n }\n if(x%2!=1||y%2!=1){\n int nx = x-1,ny=y-1;\n if(out(nx,ny))continue;\n dist[nx][ny]=min(dist[nx][ny],dist[x][y]+sqrtl(2));\n }\n int ddx = 1;\n if(x%2==0)ddx=-1;\n rep(ny,302){\n int nx = x+ddx;\n if(out(nx,ny))continue;\n dist[nx][ny]=min(dist[nx][ny],dist[x][y]+sqrtl(1+(y-ny)*(y-ny)));\n }\n int ddy = 1;\n if(y%2==0)ddy=-1;\n rep(nx,302){\n int ny = y+ddy;\n if(out(nx,ny))continue;\n dist[nx][ny]=min(dist[nx][ny],dist[x][y]+sqrtl(1+(x-nx)*(x-nx)));\n }\n }\n cout<<fixed<<setprecision(10)<<dist[tx][ty]<<endl;\n}", "accuracy": 1, "time_ms": 200, "memory_kb": 5012, "score_of_the_acc": -0.4041, "final_rank": 6 }, { "submission_id": "aoj_0436_10874533", "code_snippet": "#include<bits/stdc++.h>\n#pragma GCC optimize(\"O2\")\nusing namespace std;\n#define ll long long \n#define ld long double\n#define rep(i,N) for(int i=0;i<(int)N;i++)\n#define all(x) x.begin(),x.end()\n#define fi first\n#define se second\n#define pb push_back\nvector<int>dx={0,0,1,-1},dy={1,-1,0,0};\nbool out(int x,int y){\n return (x<0||301<x||y<0||301<y);\n}\nint main(){\n int sx,sy,tx,ty;cin>>sx>>sy>>tx>>ty;\n vector<vector<ld>>dist(302,vector<ld>(302,1000.0));\n dist[sx][sy]=0;\n int dlim = max(302-sx,sx)+max(302-sy,sy);\n vector<vector<bool>>seen(302,vector<bool>(302,false));\n rep(k,dlim+1)for(int i = -k;i<=k;i++)for(int kk=1;kk>=-1;kk-=2){\n int x = sx+i,y = sy+((k-abs(i))*kk);\n if(x<0||301<x||y<0||301<y)continue;\n if(seen[x][y]){\n continue;\n }\n seen[x][y]=true;\n rep(t,4){\n int nx = x+dx[t],ny=y+dy[t];\n if(out(nx,ny))continue;\n dist[nx][ny]=min(dist[nx][ny],dist[x][y]+1);\n }\n if(x%2!=0||y%2!=0){\n int nx = x+1,ny=y+1;\n if(out(nx,ny))continue;\n dist[nx][ny]=min(dist[nx][ny],dist[x][y]+sqrtl(2));\n }\n if(x%2!=1||y%2!=0){\n int nx = x-1,ny=y+1;\n if(out(nx,ny))continue;\n dist[nx][ny]=min(dist[nx][ny],dist[x][y]+sqrtl(2));\n }\n if(x%2!=0||y%2!=1){\n int nx = x+1,ny=y-1;\n if(out(nx,ny))continue;\n dist[nx][ny]=min(dist[nx][ny],dist[x][y]+sqrtl(2));\n }\n if(x%2!=1||y%2!=1){\n int nx = x-1,ny=y-1;\n if(out(nx,ny))continue;\n dist[nx][ny]=min(dist[nx][ny],dist[x][y]+sqrtl(2));\n }\n int ddx = 1;\n if(x%2==0)ddx=-1;\n rep(ny,302){\n int nx = x+ddx;\n if(out(nx,ny))continue;\n dist[nx][ny]=min(dist[nx][ny],dist[x][y]+sqrtl(1+(y-ny)*(y-ny)));\n }\n int ddy = 1;\n if(y%2==0)ddy=-1;\n rep(nx,302){\n int ny = y+ddy;\n if(out(nx,ny))continue;\n dist[nx][ny]=min(dist[nx][ny],dist[x][y]+sqrtl(1+(x-nx)*(x-nx)));\n }\n }\n cout<<dist[tx][ty]<<endl;\n}", "accuracy": 0.22916666666666666, "time_ms": 220, "memory_kb": 5012, "score_of_the_acc": -0.445, "final_rank": 19 }, { "submission_id": "aoj_0436_10852070", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <numbers>\n#include <cassert>\n#include <numeric>\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pint = pair<int, int>;\ntemplate<typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\ntemplate<typename T>\nbool chmax(T & a, const T & b) { if (a < b) { a = b; return true; } return false; }\ntemplate<typename T>\nbool chmin(T & a, const T & b) { if (a > b) { a = b; return true; } return false; }\nconst int inf = 1e9;\nconst ll linf = 1e18;\nconst int dy[] = { 0,0,1,-1 }, dx[] = { 1,-1,0,0 };\nint main() {\n int x0, y0, x1, y1; cin >> x0 >> y0 >> x1 >> y1;\n if (x0 > x1) { x0 = 301 - x0; x1 = 301 - x1; }\n if (y0 > y1) { y0 = 301 - y0; y1 = 301 - y1; }\n int n = 302;\n vector dp(n, vector<double>(n, inf));\n dp[y0][x0] = 0;\n rep(y, n)rep(x, n) {\n if (x + 1 >= n || y + 1 >= n)continue;\n chmin(dp[y][x + 1], dp[y][x] + 1);\n chmin(dp[y + 1][x], dp[y][x] + 1);\n if (x % 2)rep(yy, n) chmin(dp[yy][x + 1], dp[y][x] + sqrt((yy - y) * (yy - y) + 1));\n if (y % 2)rep(xx, n) chmin(dp[y + 1][xx], dp[y][x] + sqrt((xx - x) * (xx - x) + 1));\n }\n printf(\"%.10f\\n\", dp[y1][x1]);\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 4480, "score_of_the_acc": -0.0697, "final_rank": 2 }, { "submission_id": "aoj_0436_10852069", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <numbers>\n#include <cassert>\n#include <numeric>\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pint = pair<int, int>;\ntemplate<typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\ntemplate<typename T>\nbool chmax(T & a, const T & b) { if (a < b) { a = b; return true; } return false; }\ntemplate<typename T>\nbool chmin(T & a, const T & b) { if (a > b) { a = b; return true; } return false; }\nconst int inf = 1e9;\nconst ll linf = 1e18;\nconst int dy[] = { 0,0,1,-1 }, dx[] = { 1,-1,0,0 };\nint main() {\n int x0, y0, x1, y1; cin >> x0 >> y0 >> x1 >> y1;\n if (x0 > x1) swap(x0, x1);\n if (y0 > y1) swap(y0, y1);\n int n = 302;\n vector dp(n, vector<double>(n, inf));\n dp[y0][x0] = 0;\n rep(y, n)rep(x, n) {\n if (x + 1 >= n || y + 1 >= n)continue;\n chmin(dp[y][x + 1], dp[y][x] + 1);\n chmin(dp[y + 1][x], dp[y][x] + 1);\n if (x % 2)rep(yy, n) chmin(dp[yy][x + 1], dp[y][x] + sqrt((yy - y) * (yy - y) + 1));\n if (y % 2)rep(xx, n) chmin(dp[y + 1][xx], dp[y][x] + sqrt((xx - x) * (xx - x) + 1));\n }\n printf(\"%.10f\\n\", dp[y1][x1]);\n}", "accuracy": 0.5625, "time_ms": 40, "memory_kb": 4480, "score_of_the_acc": -0.0697, "final_rank": 15 }, { "submission_id": "aoj_0436_10852051", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <numbers>\n#include <cassert>\n#include <numeric>\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pint = pair<int, int>;\ntemplate<typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\ntemplate<typename T>\nbool chmax(T & a, const T & b) { if (a < b) { a = b; return true; } return false; }\ntemplate<typename T>\nbool chmin(T & a, const T & b) { if (a > b) { a = b; return true; } return false; }\nconst int inf = 1e9;\nconst ll linf = 1e18;\nconst int dy[] = { 0,0,1,-1 }, dx[] = { 1,-1,0,0 };\nint main() {\n int x0, y0, x1, y1; cin >> x0 >> y0 >> x1 >> y1;\n if (x0 > x1) { x0 = 301 - x0; x1 = 301 - x1; }\n if (y0 > y1) { y0 = 301 - y0; y1 = 301 - y1; }\n int n = 301;\n vector dp(n, vector<double>(n, inf));\n dp[y0][x0] = 0;\n rep(y, n)rep(x, n) {\n if (x + 1 < n)chmin(dp[y][x + 1], dp[y][x] + 1);\n if (y + 1 < n)chmin(dp[y + 1][x], dp[y][x] + 1);\n if (x % 2)rep(yy, n) chmin(dp[yy][x + 1], dp[y][x] + sqrt((yy - y) * (yy - y) + 1));\n if (y % 2)rep(xx, n) chmin(dp[y + 1][xx], dp[y][x] + sqrt((xx - x) * (xx - x) + 1));\n }\n printf(\"%.10f\\n\", dp[y1][x1]);\n}", "accuracy": 0.5625, "time_ms": 40, "memory_kb": 4480, "score_of_the_acc": -0.0697, "final_rank": 15 }, { "submission_id": "aoj_0436_10852050", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst double INF_D = 1e100;\n\nint main() {\n int x0, y0, x1, y1;\n if (!(cin >> x0 >> y0 >> x1 >> y1)) return 0;\n\n // mirror as in reference\n if (x0 > x1) swap(x0, x1);\n if (y0 > y1) swap(y0, y1);\n\n const int LIM = 302; // indices 0..301 inclusive\n vector<vector<double>> dp(LIM, vector<double>(LIM, INF_D));\n dp[y0][x0] = 0.0;\n\n for (int x = 0; x < LIM; ++x) { // 列を外側に\n for (int y = 0; y < LIM; ++y) { // 行を内側に\n double cur = dp[y][x];\n if (cur >= INF_D/2) continue;\n\n // right (x+1, y)\n if (x + 1 < LIM) dp[y][x+1] = min(dp[y][x+1], cur + 1.0);\n // down (x, y+1)\n if (y + 1 < LIM) dp[y+1][x] = min(dp[y+1][x], cur + 1.0);\n\n // x-warp: if x is odd -> (x+1, yy) for yy > y\n if ((x % 2) == 1 && x + 1 < LIM) {\n for (int yy = y + 1; yy < LIM; ++yy) {\n double cost = sqrt((double)(yy - y) * (yy - y) + 1.0);\n dp[yy][x+1] = min(dp[yy][x+1], cur + cost);\n }\n }\n // y-warp: if y is odd -> (xx, y+1) for xx > x\n if ((y % 2) == 1 && y + 1 < LIM) {\n for (int xx = x + 1; xx < LIM; ++xx) {\n double cost = sqrt((double)(xx - x) * (xx - x) + 1.0);\n dp[y+1][xx] = min(dp[y+1][xx], cur + cost);\n }\n }\n }\n }\n\n cout.setf(std::ios::fixed);\n cout << setprecision(10) << dp[y1][x1] << \"\\n\";\n return 0;\n}", "accuracy": 0.5625, "time_ms": 10, "memory_kb": 4608, "score_of_the_acc": -0.0104, "final_rank": 9 }, { "submission_id": "aoj_0436_10852049", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst double INF_D = 1e100;\n\nint main() {\n int x0, y0, x1, y1;\n if (!(cin >> x0 >> y0 >> x1 >> y1)) return 0;\n\n // mirror as in reference\n if (x0 > x1) { x0 = 301 - x0; x1 = 301 - x1; }\n if (y0 > y1) { y0 = 301 - y0; y1 = 301 - y1; }\n\n const int LIM = 302; // indices 0..301 inclusive\n vector<vector<double>> dp(LIM, vector<double>(LIM, INF_D));\n dp[y0][x0] = 0.0;\n\n for (int x = 0; x < LIM; ++x) { // 列を外側に\n for (int y = 0; y < LIM; ++y) { // 行を内側に\n double cur = dp[y][x];\n if (cur >= INF_D/2) continue;\n\n // right (x+1, y)\n if (x + 1 < LIM) dp[y][x+1] = min(dp[y][x+1], cur + 1.0);\n // down (x, y+1)\n if (y + 1 < LIM) dp[y+1][x] = min(dp[y+1][x], cur + 1.0);\n\n // x-warp: if x is odd -> (x+1, yy) for yy > y\n if ((x % 2) == 1 && x + 1 < LIM) {\n for (int yy = y + 1; yy < LIM; ++yy) {\n double cost = sqrt((double)(yy - y) * (yy - y) + 1.0);\n dp[yy][x+1] = min(dp[yy][x+1], cur + cost);\n }\n }\n // y-warp: if y is odd -> (xx, y+1) for xx > x\n if ((y % 2) == 1 && y + 1 < LIM) {\n for (int xx = x + 1; xx < LIM; ++xx) {\n double cost = sqrt((double)(xx - x) * (xx - x) + 1.0);\n dp[y+1][xx] = min(dp[y+1][xx], cur + cost);\n }\n }\n }\n }\n\n cout.setf(std::ios::fixed);\n cout << setprecision(10) << dp[y1][x1] << \"\\n\";\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4608, "score_of_the_acc": -0.0104, "final_rank": 1 }, { "submission_id": "aoj_0436_10852045", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <numbers>\n#include <cassert>\n#include <numeric>\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pint = pair<int, int>;\ntemplate<typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\ntemplate<typename T>\nbool chmax(T & a, const T & b) { if (a < b) { a = b; return true; } return false; }\ntemplate<typename T>\nbool chmin(T & a, const T & b) { if (a > b) { a = b; return true; } return false; }\nconst int inf = 1e9;\nconst ll linf = 1e18;\nconst int dy[] = { 0,0,1,-1 }, dx[] = { 1,-1,0,0 };\nint main() {\n int x0, y0, x1, y1; cin >> x0 >> y0 >> x1 >> y1;\n if (x0 > x1) { x0 = 301 - x0; x1 = 301 - x1; }\n if (y0 > y1) { y0 = 301 - y0; y1 = 301 - y1; }\n int n = 301;\n vector dp(n + 1, vector<double>(n + 1, inf));\n dp[y0][x0] = 0;\n rep(y, n)rep(x, n) {\n if (x + 1 < n)chmin(dp[y][x + 1], dp[y][x] + 1);\n if (y + 1 < n)chmin(dp[y + 1][x], dp[y][x] + 1);\n if (x % 2)rep(yy, n) chmin(dp[yy][x + 1], dp[y][x] + sqrt((yy - y) * (yy - y) + 1));\n if (y % 2)rep(xx, n) chmin(dp[y + 1][xx], dp[y][x] + sqrt((xx - x) * (xx - x) + 1));\n }\n printf(\"%.10f\\n\", dp[y1][x1]);\n}", "accuracy": 0.5625, "time_ms": 30, "memory_kb": 4480, "score_of_the_acc": -0.0493, "final_rank": 10 }, { "submission_id": "aoj_0436_10852025", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <numbers>\nusing namespace std;\nusing ll = long long;\nconst int NMAX = 301;\nconst int dy[] = { 0,0,1,-1 }, dx[] = { 1,-1,0,0 };\n\nint main() {\n int x0, y0, x1, y1;\n if (!(cin >> x0 >> y0 >> x1 >> y1)) return 0;\n if (x0 > x1) swap(x0, x1);\n if (y0 > y1) swap(y0, y1);\n\n int n = 301;\n const double INF = 1e100;\n vector<vector<double>> dp(n, vector<double>(n, INF));\n dp[y0][x0] = 0.0;\n\n // 修正：列 (x) を外側ループにする\n for (int x = x0; x < n; ++x) {\n for (int y = 0; y < n; ++y) {\n double cur = dp[y][x];\n if (cur >= INF/2) continue;\n // 右に1\n if (x + 1 < n) dp[y][x + 1] = min(dp[y][x + 1], cur + 1.0);\n // 下に1\n if (y + 1 < n) dp[y + 1][x] = min(dp[y + 1][x], cur + 1.0);\n // xが奇数のとき、任意の行 yy にワープして x+1 列へ\n if (x % 2 == 1 && x + 1 < n) {\n for (int yy = 0; yy < n; ++yy) {\n double cost = sqrt((double)(yy - y) * (yy - y) + 1.0);\n dp[yy][x + 1] = min(dp[yy][x + 1], cur + cost);\n }\n }\n // yが奇数のとき、任意の列 xx にワープして y+1 行へ\n if (y % 2 == 1 && y + 1 < n) {\n for (int xx = 0; xx < n; ++xx) {\n double cost = sqrt((double)(xx - x) * (xx - x) + 1.0);\n dp[y + 1][xx] = min(dp[y + 1][xx], cur + cost);\n }\n }\n }\n }\n\n printf(\"%.10f\\n\", dp[y1][x1]);\n return 0;\n}", "accuracy": 0.5625, "time_ms": 30, "memory_kb": 4480, "score_of_the_acc": -0.0493, "final_rank": 10 }, { "submission_id": "aoj_0436_10852020", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <numbers>\n#include <cassert>\n#include <numeric>\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pint = pair<int, int>;\ntemplate<typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\ntemplate<typename T>\nbool chmax(T & a, const T & b) { if (a < b) { a = b; return true; } return false; }\ntemplate<typename T>\nbool chmin(T & a, const T & b) { if (a > b) { a = b; return true; } return false; }\nconst int inf = 1e9;\nconst ll linf = 1e18;\nconst int dy[] = { 0,0,1,-1 }, dx[] = { 1,-1,0,0 };\nint main() {\n int x0, y0, x1, y1; cin >> x0 >> y0 >> x1 >> y1;\n if (x0 > x1)swap(x0, x1);\n if (y0 > y1)swap(y0, y1);\n int n = 301;\n vector dp(n, vector<double>(n, inf));\n dp[y0][x0] = 0;\n rep(y, y1 + 1)rep(x, x1 + 1) {\n if (x + 1 < n)chmin(dp[y][x + 1], dp[y][x] + 1);\n if (y + 1 < n)chmin(dp[y + 1][x], dp[y][x] + 1);\n if (x % 2)rep(yy, y1 + 1) chmin(dp[yy][x + 1], dp[y][x] + sqrt((yy - y) * (yy - y) + 1));\n if (y % 2)rep(xx, x1 + 1) chmin(dp[y + 1][xx], dp[y][x] + sqrt((xx - x) * (xx - x) + 1));\n }\n printf(\"%.10f\\n\", dp[y1][x1]);\n}", "accuracy": 0.5625, "time_ms": 30, "memory_kb": 4480, "score_of_the_acc": -0.0493, "final_rank": 10 }, { "submission_id": "aoj_0436_10852019", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <numbers>\n#include <cassert>\n#include <numeric>\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pint = pair<int, int>;\ntemplate<typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\ntemplate<typename T>\nbool chmax(T & a, const T & b) { if (a < b) { a = b; return true; } return false; }\ntemplate<typename T>\nbool chmin(T & a, const T & b) { if (a > b) { a = b; return true; } return false; }\nconst int inf = 1e9;\nconst ll linf = 1e18;\nconst int dy[] = { 0,0,1,-1 }, dx[] = { 1,-1,0,0 };\nint main() {\n int x0, y0, x1, y1; cin >> x0 >> y0 >> x1 >> y1;\n if (x0 > x1)swap(x0, x1);\n if (y0 > y1)swap(y0, y1);\n int n = 301;\n vector dp(n, vector<double>(n, inf));\n dp[y0][x0] = 0;\n rep(y, y1 + 1)rep(x, x1 + 1) {\n if (x + 1 < n)chmin(dp[y][x + 1], dp[y][x] + 1);\n if (y + 1 < n)chmin(dp[y + 1][x], dp[y][x] + 1);\n if (x % 2)rep(yy, n) chmin(dp[yy][x + 1], dp[y][x] + sqrt((yy - y) * (yy - y) + 1));\n if (y % 2)rep(xx, n) chmin(dp[y + 1][xx], dp[y][x] + sqrt((xx - x) * (xx - x) + 1));\n }\n printf(\"%.10f\\n\", dp[y1][x1]);\n}", "accuracy": 0.5625, "time_ms": 30, "memory_kb": 4480, "score_of_the_acc": -0.0493, "final_rank": 10 }, { "submission_id": "aoj_0436_10852018", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <numbers>\n#include <cassert>\n#include <numeric>\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pint = pair<int, int>;\ntemplate<typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\ntemplate<typename T>\nbool chmax(T & a, const T & b) { if (a < b) { a = b; return true; } return false; }\ntemplate<typename T>\nbool chmin(T & a, const T & b) { if (a > b) { a = b; return true; } return false; }\nconst int inf = 1e9;\nconst ll linf = 1e18;\nconst int dy[] = { 0,0,1,-1 }, dx[] = { 1,-1,0,0 };\nint main() {\n int x0, y0, x1, y1; cin >> x0 >> y0 >> x1 >> y1;\n /*if (x0 > x1)swap(x0, x1);\n if (y0 > y1)swap(y0, y1);*/\n if (x0 > x1) x0 = -x0 + 301, x1 = -x1 + 301;\n if (y0 > y1) y0 = -y0 + 301, y1 = -y1 + 301;\n int n = 301;\n vector dp(n, vector<double>(n, inf));\n dp[y0][x0] = 0;\n rep(y, n)rep(x, n) {\n if (x + 1 < n)chmin(dp[y][x + 1], dp[y][x] + 1);\n if (y + 1 < n)chmin(dp[y + 1][x], dp[y][x] + 1);\n if (x % 2)rep(yy, n) chmin(dp[yy][x + 1], dp[y][x] + sqrt((yy - y) * (yy - y) + 1));\n if (y % 2)rep(xx, n) chmin(dp[y + 1][xx], dp[y][x] + sqrt((xx - x) * (xx - x) + 1));\n }\n printf(\"%.10f\\n\", dp[y1][x1]);\n}", "accuracy": 0.5625, "time_ms": 40, "memory_kb": 4480, "score_of_the_acc": -0.0697, "final_rank": 15 }, { "submission_id": "aoj_0436_10852014", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <numbers>\n#include <cassert>\n#include <numeric>\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pint = pair<int, int>;\ntemplate<typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\ntemplate<typename T>\nbool chmax(T & a, const T & b) { if (a < b) { a = b; return true; } return false; }\ntemplate<typename T>\nbool chmin(T & a, const T & b) { if (a > b) { a = b; return true; } return false; }\nconst int inf = 1e9;\nconst ll linf = 1e18;\nconst int dy[] = { 0,0,1,-1 }, dx[] = { 1,-1,0,0 };\nint main() {\n int x0, y0, x1, y1; cin >> x0 >> y0 >> x1 >> y1;\n if (x0 > x1)swap(x0, x1);\n if (y0 > y1)swap(y0, y1);\n int n = 301;\n vector dp(n, vector<double>(n, inf));\n dp[y0][x0] = 0;\n rep(y, n)rep(x, n) {\n if (x + 1 < n)chmin(dp[y][x + 1], dp[y][x] + 1);\n if (y + 1 < n)chmin(dp[y + 1][x], dp[y][x] + 1);\n if (x % 2)rep(yy, n) chmin(dp[yy][x + 1], dp[y][x] + sqrt((yy - y) * (yy - y) + 1));\n if (y % 2)rep(xx, n) chmin(dp[y + 1][xx], dp[y][x] + sqrt((xx - x) * (xx - x) + 1));\n }\n printf(\"%.10f\\n\", dp[y1][x1]);\n}", "accuracy": 0.5625, "time_ms": 30, "memory_kb": 4480, "score_of_the_acc": -0.0493, "final_rank": 10 }, { "submission_id": "aoj_0436_10835523", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"unroll-loops\")\n\nint main(){\n\tint x0,y0,x1,y1;\n\tcin >> x0 >> y0 >> x1 >> y1;\n\tint dx=x1-x0;\n\tint dy=y1-y0;\n\tif(dx<0 && dy<0){\n\t\tswap(x0,x1);\n\t\tswap(y0,y1);\n\t}\n\telse if(dx<0){\n\t\tx0++;\n\t\tx1=x0-dx;\n\t}\n\telse if(dy<0){\n\t\ty0++;\n\t\ty1=y0-dy;\n\t}\n\tx1-=x0/2*2;\n\ty1-=y0/2*2;\n\tx0%=2;\n\ty0%=2;\n\tvector<double> dist(110000,8000000000.0);\n\tdist[x0*320+y0]=0.0;\n\tfor(int t=0;t<320*320;t++){\n\t\tpair<int,int> pos=make_pair(t/320,t%320);\n\t\tint hash=pos.first%2+pos.second%2*2;\n\t\tfor(int i=0;i<=300;i++){\n\t\t\tif(hash==0 && i!=0 && i!=-1) continue;\n\t\t\tif(hash==2 && i!=0 && i!=1) continue;\n\t\t\tpair<int,int> nv=make_pair(pos.first+1,pos.second+i);\n\t\t\tif(nv.first<0 || nv.first>=320 || nv.second<0 || nv.second>=320) continue;\n\t\t\tif(dist[nv.first*320+nv.second]>dist[pos.first*320+pos.second]+hypot(1.0,(double)i)){\n\t\t\t\tdist[nv.first*320+nv.second]=dist[pos.first*320+pos.second]+hypot(1.0,(double)i);\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<=300;i++){\n\t\t\tif(hash==1 && i!=0 && i!=-1) continue;\n\t\t\tif(hash==3 && i!=0 && i!=1) continue;\n\t\t\tpair<int,int> nv=make_pair(pos.first-1,pos.second+i);\n\t\t\tif(nv.first<0 || nv.first>=320 || nv.second<0 || nv.second>=320) continue;\n\t\t\tif(dist[nv.first*320+nv.second]>dist[pos.first*320+pos.second]+hypot(1.0,(double)i)){\n\t\t\t\tdist[nv.first*320+nv.second]=dist[pos.first*320+pos.second]+hypot(1.0,(double)i);\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<=300;i++){\n\t\t\tif(hash==0 && i!=0 && i!=-1) continue;\n\t\t\tif(hash==1 && i!=0 && i!=1) continue;\n\t\t\tpair<int,int> nv=make_pair(pos.first+i,pos.second+1);\n\t\t\tif(nv.first<0 || nv.first>=320 || nv.second<0 || nv.second>=320) continue;\n\t\t\tif(dist[nv.first*320+nv.second]>dist[pos.first*320+pos.second]+hypot(1.0,(double)i)){\n\t\t\t\tdist[nv.first*320+nv.second]=dist[pos.first*320+pos.second]+hypot(1.0,(double)i);\n\t\t\t}\n\t\t}\n\t\tfor(int i=0;i<=300;i++){\n\t\t\tif(hash==2 && i!=0 && i!=-1) continue;\n\t\t\tif(hash==3 && i!=0 && i!=1) continue;\n\t\t\tpair<int,int> nv=make_pair(pos.first+i,pos.second-1);\n\t\t\tif(nv.first<0 || nv.first>=320 || nv.second<0 || nv.second>=320) continue;\n\t\t\tif(dist[nv.first*320+nv.second]>dist[pos.first*320+pos.second]+hypot(1.0,(double)i)){\n\t\t\t\tdist[nv.first*320+nv.second]=dist[pos.first*320+pos.second]+hypot(1.0,(double)i);\n\t\t\t}\n\t\t}\n\t\t/*\n\t\tfor(int i=-300;i<=300;i++){\n\t\t\tif(hash==0 && i!=0 && i!=-1) continue;\n\t\t\tif(hash==2 && i!=0 && i!=1) continue;\n\t\t\tpair<int,int> nv=make_pair(pos.first+1,pos.second+i);\n\t\t\tif(nv.first<0 || nv.first>=320 || nv.second<0 || nv.second>=320) continue;\n\t\t\tif(conf[nv.first*320+nv.second]) continue;\n\t\t\tif(cur[nv.first*320+nv.second]>cur[pos.first*320+pos.second]+hypot(1.0,(double)i)){\n\t\t\t\tcur[nv.first*320+nv.second]=cur[pos.first*320+pos.second]+hypot(1.0,(double)i);\n\t\t\t\tque.push(make_pair(cur[nv.first*320+nv.second],nv));\n\t\t\t}\n\t\t}\n\t\tfor(int i=-300;i<=300;i++){\n\t\t\tif(hash==1 && i!=0 && i!=-1) continue;\n\t\t\tif(hash==3 && i!=0 && i!=1) continue;\n\t\t\tpair<int,int> nv=make_pair(pos.first-1,pos.second+i);\n\t\t\tif(nv.first<0 || nv.first>=320 || nv.second<0 || nv.second>=320) continue;\n\t\t\tif(conf[nv.first*320+nv.second]) continue;\n\t\t\tif(cur[nv.first*320+nv.second]>cur[pos.first*320+pos.second]+hypot(1.0,(double)i)){\n\t\t\t\tcur[nv.first*320+nv.second]=cur[pos.first*320+pos.second]+hypot(1.0,(double)i);\n\t\t\t\tque.push(make_pair(cur[nv.first*320+nv.second],nv));\n\t\t\t}\n\t\t}\n\t\tfor(int i=-300;i<=300;i++){\n\t\t\tif(hash==0 && i!=0 && i!=-1) continue;\n\t\t\tif(hash==1 && i!=0 && i!=1) continue;\n\t\t\tpair<int,int> nv=make_pair(pos.first+i,pos.second+1);\n\t\t\tif(nv.first<0 || nv.first>=320 || nv.second<0 || nv.second>=320) continue;\n\t\t\tif(conf[nv.first*320+nv.second]) continue;\n\t\t\tif(cur[nv.first*320+nv.second]>cur[pos.first*320+pos.second]+hypot(1.0,(double)i)){\n\t\t\t\tcur[nv.first*320+nv.second]=cur[pos.first*320+pos.second]+hypot(1.0,(double)i);\n\t\t\t\tque.push(make_pair(cur[nv.first*320+nv.second],nv));\n\t\t\t}\n\t\t}\n\t\tfor(int i=-300;i<=300;i++){\n\t\t\tif(hash==2 && i!=0 && i!=-1) continue;\n\t\t\tif(hash==3 && i!=0 && i!=1) continue;\n\t\t\tpair<int,int> nv=make_pair(pos.first+i,pos.second-1);\n\t\t\tif(nv.first<0 || nv.first>=320 || nv.second<0 || nv.second>=320) continue;\n\t\t\tif(conf[nv.first*320+nv.second]) continue;\n\t\t\tif(cur[nv.first*320+nv.second]>cur[pos.first*320+pos.second]+hypot(1.0,(double)i)){\n\t\t\t\tcur[nv.first*320+nv.second]=cur[pos.first*320+pos.second]+hypot(1.0,(double)i);\n\t\t\t\tque.push(make_pair(cur[nv.first*320+nv.second],nv));\n\t\t\t}\n\t\t}\n\t\t*/\n\t}\n\tcout << fixed << setprecision(20);\n\tcout << dist[x1*320+y1] << '\\n';\n}", "accuracy": 1, "time_ms": 500, "memory_kb": 3904, "score_of_the_acc": -1, "final_rank": 7 }, { "submission_id": "aoj_0436_10804595", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug.hpp>\n#else\n#define debug(...)\n#endif\n\nconst int M = 305;\ntemplate <class T, class U>\nT ceil(T x, U y) {\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\n\ntemplate <class T, class U>\nT floor(T x, U y) {\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int x0, y0, x1, y1;\n cin >> x0 >> y0 >> x1 >> y1;\n // x0 <= x1 かつ y0 <= y1 になるように変数変換\n if (x0 > x1) {\n // x = -0.5 の軸中心に対称移動\n x0 = -(x0 + 1), x1 = -(x1 + 1);\n // 両方正になるように平行移動\n while (x0 < 0) x0 += 2, x1 += 2;\n }\n if (y0 > y1) {\n // y = -0.5 の軸中心に対称移動\n y0 = -(y0 + 1), y1 = -(y1 + 1);\n // 両方正になるように平行移動\n while (y0 < 0) y0 += 2, y1 += 2;\n }\n // 偶数長の平行移動を行う\n debug(x0, y0, x1, y1);\n array<array<double, M>, M> dist;\n for (int i = 0; i < M; i++) {\n for (int j = 0; j < M; j++) dist[i][j] = M * M;\n }\n dist[x0][y0] = 0;\n for (int i = 0; i < M; i++) {\n for (int j = 0; j < M; j++) {\n if (i + 1 < M) {\n dist[i + 1][j] = min(dist[i + 1][j], dist[i][j] + 1);\n }\n if (j + 1 < M) {\n dist[i][j + 1] = min(dist[i][j + 1], dist[i][j] + 1);\n }\n // 斜め\n if (i & 1) {\n // (i, j) -> (i + 1, k)\n for (int k = j + 1; k < M; k++) {\n dist[i + 1][k] = min(dist[i + 1][k], dist[i][j] + hypot(1, k - j));\n }\n }\n if (j & 1) {\n // (i, j) -> (k, j + 1)\n for (int k = i + 1; k < M; k++) {\n dist[k][j + 1] = min(dist[k][j + 1], dist[i][j] + hypot(k - i, 1));\n }\n }\n }\n }\n\n cout << dist[x1][y1] << '\\n';\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 4608, "score_of_the_acc": -0.1329, "final_rank": 4 }, { "submission_id": "aoj_0436_10804582", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug.hpp>\n#else\n#define debug(...)\n#endif\n\nconst int M = 305;\ntemplate <class T, class U>\nT ceil(T x, U y) {\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\n\ntemplate <class T, class U>\nT floor(T x, U y) {\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int x0, y0, x1, y1;\n cin >> x0 >> y0 >> x1 >> y1;\n // x0 <= x1 かつ y0 <= y1 になるように変数変換\n if (x0 > x1) {\n // 反転させる\n x0 *= -1, x1 *= -1;\n // 両方正になるように平行移動\n while (x0 < 0) x0 += 2, x1 += 2;\n }\n if (y0 > y1) {\n // 反転させる\n y0 *= -1, y1 *= -1;\n // 両方正になるように平行移動\n while (y0 < 0) y0 += 2, y1 += 2;\n }\n // 偶数長の平行移動を行う\n debug(x0, y0, x1, y1);\n array<array<double, M>, M> dist;\n for (int i = 0; i < M; i++) {\n for (int j = 0; j < M; j++) dist[i][j] = M * M;\n }\n dist[x0][y0] = 0;\n for (int i = 0; i < M; i++) {\n for (int j = 0; j < M; j++) {\n if (i + 1 < M) {\n dist[i + 1][j] = min(dist[i + 1][j], dist[i][j] + 1);\n }\n if (j + 1 < M) {\n dist[i][j + 1] = min(dist[i][j + 1], dist[i][j] + 1);\n }\n // 斜め\n if (i & 1) {\n // (i, j) -> (i + 1, k)\n for (int k = j + 1; k < M; k++) {\n dist[i + 1][k] = min(dist[i + 1][k], dist[i][j] + hypot(1, k - j));\n }\n }\n if (j & 1) {\n // (i, j) -> (k, j + 1)\n for (int k = i + 1; k < M; k++) {\n dist[k][j + 1] = min(dist[k][j + 1], dist[i][j] + hypot(k - i, 1));\n }\n }\n }\n }\n\n cout << dist[x1][y1] << '\\n';\n}", "accuracy": 0.5625, "time_ms": 60, "memory_kb": 4608, "score_of_the_acc": -0.1125, "final_rank": 18 }, { "submission_id": "aoj_0436_10804527", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug.hpp>\n#else\n#define debug(...)\n#endif\n\nconst int M = 305;\ntemplate <class T, class U>\nT ceil(T x, U y) {\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\n\ntemplate <class T, class U>\nT floor(T x, U y) {\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int x0, y0, x1, y1;\n cin >> x0 >> y0 >> x1 >> y1;\n // x0 <= x1 かつ y0 <= y1 になるように変数変換\n // (-0.5, -0.5) が対称軸\n // 2 倍に拡大 -> -1 移動 -> 2 倍縮小 (負の方向に丸める)\n if (x0 > x1) {\n x0 = -(x0 * 2 + 2), x1 = -(x1 * 2 + 2);\n x0 = floor(x0, 2), x1 = floor(x1, 2);\n x1 -= x0 - (x0 & 1), x0 = x0 & 1;\n }\n if (y0 > y1) {\n y0 = -(y0 * 2 + 2), y1 = -(y1 * 2 + 2);\n y0 = floor(y0, 2), y1 = floor(y1, 2);\n y1 -= y0 - (y0 & 1), y0 = y0 & 1;\n }\n // 偶数長の平行移動を行う\n debug(x0, y0, x1, y1);\n array<array<double, M>, M> dist;\n for (int i = 0; i < M; i++) {\n for (int j = 0; j < M; j++) dist[i][j] = M * M;\n }\n dist[x0][y0] = 0;\n for (int i = 0; i < M; i++) {\n for (int j = 0; j < M; j++) {\n if (i + 1 < M) {\n dist[i + 1][j] = min(dist[i + 1][j], dist[i][j] + 1);\n }\n if (j + 1 < M) {\n dist[i][j + 1] = min(dist[i][j + 1], dist[i][j] + 1);\n }\n // 斜め\n if (i & 1) {\n // (i, j) -> (i + 1, k)\n for (int k = j + 1; k < M; k++) {\n dist[i + 1][k] = min(dist[i + 1][k], dist[i][j] + hypot(1, k - j));\n }\n }\n if (j & 1) {\n // (i, j) -> (k, j + 1)\n for (int k = i + 1; k < M; k++) {\n dist[k][j + 1] = min(dist[k][j + 1], dist[i][j] + hypot(k - i, 1));\n }\n }\n }\n }\n\n cout << dist[x1][y1] << '\\n';\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 4608, "score_of_the_acc": -0.1125, "final_rank": 3 }, { "submission_id": "aoj_0436_10804524", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug.hpp>\n#else\n#define debug(...)\n#endif\n\nconst int M = 305;\ntemplate <class T, class U>\nT ceil(T x, U y) {\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\n\ntemplate <class T, class U>\nT floor(T x, U y) {\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int x0, y0, x1, y1;\n cin >> x0 >> y0 >> x1 >> y1;\n // x0 <= x1 かつ y0 <= y1 になるように変数変換\n // (-0.5, -0.5) が対称軸\n // 2 倍に拡大 -> -1 移動 -> 2 倍縮小 (負の方向に丸める)\n if (x0 > x1) {\n x0 = -(x0 * 2 + 2), x1 = -(x1 * 2 + 2);\n x0 = floor(x0, 2), x1 = floor(x1, 2);\n }\n if (y0 > y1) {\n swap(x0, x1);\n swap(y0, y1);\n }\n // 偶数長の平行移動を行う\n x1 -= x0 - (x0 & 1), x0 = x0 & 1, y1 -= y0 - (y0 & 1), y0 = y0 & 1;\n debug(x0, y0, x1, y1);\n array<array<double, M>, M> dist;\n for (int i = 0; i < M; i++) {\n for (int j = 0; j < M; j++) dist[i][j] = M * M;\n }\n dist[x0][y0] = 0;\n for (int i = 0; i < M; i++) {\n for (int j = 0; j < M; j++) {\n if (i + 1 < M) {\n dist[i + 1][j] = min(dist[i + 1][j], dist[i][j] + 1);\n }\n if (j + 1 < M) {\n dist[i][j + 1] = min(dist[i][j + 1], dist[i][j] + 1);\n }\n // 斜め\n if (i & 1) {\n // (i, j) -> (i + 1, k)\n for (int k = j + 1; k < M; k++) {\n dist[i + 1][k] = min(dist[i + 1][k], dist[i][j] + hypot(1, k - j));\n }\n }\n if (j & 1) {\n // (i, j) -> (k, j + 1)\n for (int k = i + 1; k < M; k++) {\n dist[k][j + 1] = min(dist[k][j + 1], dist[i][j] + hypot(k - i, 1));\n }\n }\n }\n }\n\n cout << dist[x1][y1] << '\\n';\n}", "accuracy": 0.9375, "time_ms": 60, "memory_kb": 4608, "score_of_the_acc": -0.1125, "final_rank": 8 } ]
aoj_0434_cpp
Processing Machine Aizu Kogyo undertakes manufacturing work using a processing machine. The processing machine owned by Aizu Kogyo is shown on the left in Figure 1. This machine can process any rectangular object, and its width, depth, and height can be freely set. There is a blade 1 cm wide and 1 cm deep on the top of this rectangular object. This blade can be moved directly above the position where you want to cut. The position where you want to cut is specified by the coordinates of the compartment as shown in the right side of Figure 1. Figure 1: 3D view of the machine and the coordinates of the compartment The machine will cut a rectangular object by repeating the following steps. Move the blade to directly above the specified section. Lower the blade until it touches the object to be machined, and then cut a new section of the specified length. Raise the blade and bring it back to the initial height. An example of shaving one of the end sections is shown in Figure 2. Figure 2: Example of cutting using a processing machine At Aizu Industries, we determine the processing fee based on the amount of surface area after processing. Until now, this has been measured manually by craftsmen, but we would like to be able to calculate this using a program. Given the size of the rectangular object to be machined and information on how the rectangular object is to be machined, write a program that calculates how much the surface area will be after machining. Input The input is given in the following form. $W$ $D$ $H$ $C$ $x_1$ $y_1$ $z_1$ $x_2$ $y_2$ $z_2$ : $x_C$ $y_C$ $z_C$ In the first line, the width $W$ ($1 \leq W \leq 100,000$), depth $D$ ($1 \leq D \leq 100,000$), height $H$ ($1 \leq H \leq 100,000$), and the number of cuts $C$ ($0 \leq C \leq 100,000$) of the rectangle to be machined are given. In the following $C$ lines, the information on how to cut the rectangle is given. $x_i$ ($0 \leq x_i < W$) and $y_i$ ($0 \leq y_i < D$) are the coordinates of the plot to be cut. Also, $z_i$ ($1 \leq z_i < H$) is an integer that represents how much the plot should be cut from its current height. However, for each parcel, no input is given such that the height after shaving will be less than 1. Output Output the surface area after processing a line. Sample Input and Output Sample Input 1 3 4 5 2 0 0 4 1 1 4 Sample Output 1 110 Sample Input 2 1 2 3 0 Sample Output 2 22 Since Sample Input 2 is a case where the surface area is never scraped, the surface area is the same as the surface area of ​​the given rectangular.
[ { "submission_id": "aoj_0434_10873736", "code_snippet": "#include<bits/stdc++.h>\n//#include<atcoder/all>\n\nusing namespace std;\n//using namespace atcoder;\n#define rep(i,n) for(ll i=0; i<n; i++)\n#define rrep(i,n) for(ll i=n-1; i>=0; i--)\n#define print(a) cout<<a<<endl\ntypedef long long ll;\n#define yn(flg) if(flg){cout<<\"Yes\"<<endl;}else{cout<<\"No\"<<endl;}\n#define YN(flg) if(flg){cout<<\"YES\"<<endl;}else{cout<<\"NO\"<<endl;}\n#define so(a) sort(a.begin(),a.end())\n#define mp make_pair\n#define vi vector<int>\n#define vl vector<ll>\n#define vs vector<string>\n#define pb push_back\n#define a2i(a,s) (ll)(a-s)\n#define i2a(s,a) (char)(s+a)\n#define ssize(a) a.size()\ntypedef pair<int, int> Pii;\ntypedef pair<int, ll> Pil;\ntypedef pair<pair<ll,ll>,ll> P3;\ntypedef pair<pair<ll,ll>,pair<ll,ll>> P4;\n\ntypedef pair<ll, ll> Pll;\ntypedef pair<ll,Pll> Plll;\ntypedef pair<Pii, int> Piii;\nconst ll INF = 1000000000000000000;\n\ntemplate<class T> inline bool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<class T> inline bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\nint main(){\n//入力\n\n\tcin.tie(0);\n\tios::sync_with_stdio(0);\n\n\n\tll w,d,h,c;\n\tcin>>w>>d>>h>>c;\n\tvector<ll> x(c);\n\tvector<ll> y(c);\n\tvector<ll> z(c);\n\tmap<Pll,ll> mp;\n\tmap<ll,vector<Pll> > mpi;\n\tmap<ll,vector<Pll> > mpj;\n\tset<ll> si;\n\tset<ll> sj;\n\tset<Pll> st;\n\trep(i,c){\n\t\tcin>>x[i]>>y[i]>>z[i];\n\t\tmp[{x[i],y[i]}]+=z[i];\n\t\tst.insert({x[i],y[i]});\n\t}\n\tfor(Pll i:st){\n\t\tll a=i.first,b=i.second;\n\t\tmpi[a].push_back({b,mp[{a,b}]});\n\t\tmpj[b].push_back({a,mp[{a,b}]});\n\t\tsi.insert(a);\n\t\tsj.insert(b);\n\t}\n\n\n//ソート\n\tfor(ll i:si){\n\t\tsort(mpi[i].begin(),mpi[i].end());\n\t}\n\tfor(ll i:sj){\n\t\tsort(mpj[i].begin(),mpj[i].end());\n\t}\n//判定\n\tll ans=0;\n\tans=2*d*w;\n\tans+=2*h*w;\n\tans+=2*d*h;\n\t//hw側\n\tfor(ll i:si){\n\t\tll ny=0,nc=0;\n\t\tfor(Pll j:mpi[i]){\n\t\t\tll Y=j.first,C=j.second;\n\t\t\tif(Y==0)ans-=C;\n\t\t\telse{\n\t\t\t\tif(ny==Y-1){\n\t\t\t\t\tans+=abs(C-nc);\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tans+=nc;\n\t\t\t\t\tans+=C;\n\t\t\t\t}\n\t\t\t}\n\t\t\tny=Y;\n\t\t\tnc=C;\n\t\t}\n\t\tif(ny==d-1){\n\t\t\tans-=nc;\n\t\t}else{\n\t\t\tans+=nc;\n\t\t}\n\t}\n//dh側\n\tfor(ll i:sj){\n\t\tll nx=0,nc=0;\n\t\tfor(Pll j:mpj[i]){\n\t\t\tll X=j.first,C=j.second;\n\t\t\tif(X==0)ans-=C;\n\t\t\telse{\n\t\t\t\tif(nx==X-1){\n\t\t\t\t\tans+=abs(C-nc);\n\t\t\t\t}else{\n\t\t\t\t\tans+=nc;\n\t\t\t\t\tans+=C;\n\t\t\t\t}\n\t\t\t}\n\t\t\tnx=X;\n\t\t\tnc=C;\n\t\t}\n\t\tif(nx==w-1){\n\t\t\tans-=nc;\n\t\t}else{\n\t\t\tans+=nc;\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 190, "memory_kb": 38980, "score_of_the_acc": -1.0205, "final_rank": 7 }, { "submission_id": "aoj_0434_10873725", "code_snippet": "#include<bits/stdc++.h>\n//#include<atcoder/all>\n\nusing namespace std;\n//using namespace atcoder;\n#define rep(i,n) for(ll i=0; i<n; i++)\n#define rrep(i,n) for(ll i=n-1; i>=0; i--)\n#define print(a) cout<<a<<endl\ntypedef long long ll;\n#define yn(flg) if(flg){cout<<\"Yes\"<<endl;}else{cout<<\"No\"<<endl;}\n#define YN(flg) if(flg){cout<<\"YES\"<<endl;}else{cout<<\"NO\"<<endl;}\n#define so(a) sort(a.begin(),a.end())\n#define mp make_pair\n#define vi vector<int>\n#define vl vector<ll>\n#define vs vector<string>\n#define pb push_back\n#define a2i(a,s) (ll)(a-s)\n#define i2a(s,a) (char)(s+a)\n#define ssize(a) a.size()\ntypedef pair<int, int> Pii;\ntypedef pair<int, ll> Pil;\ntypedef pair<pair<ll,ll>,ll> P3;\ntypedef pair<pair<ll,ll>,pair<ll,ll>> P4;\n\ntypedef pair<ll, ll> Pll;\ntypedef pair<ll,Pll> Plll;\ntypedef pair<Pii, int> Piii;\nconst ll INF = 1000000000000000000;\n\ntemplate<class T> inline bool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<class T> inline bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\nint main(){\n//入力\n\n\tcin.tie(0);\n\tios::sync_with_stdio(0);\n\n\n\tll w,d,h,c;\n\tcin>>w>>d>>h>>c;\n\tvector<ll> x(c);\n\tvector<ll> y(c);\n\tvector<ll> z(c);\n\tmap<ll,vector<Pll> > mpi;\n\tmap<ll,vector<Pll> > mpj;\n\tset<ll> si;\n\tset<ll> sj;\n\n\trep(i,c){\n\t\tcin>>x[i]>>y[i]>>z[i];\n\t\tmpi[x[i]].push_back({y[i],z[i]});\n\t\tmpj[y[i]].push_back({x[i],z[i]});\n\t\tsi.insert(x[i]);\n\t\tsj.insert(y[i]);\n\t}\n\n//ソート\n\tfor(ll i:si){\n\t\tsort(mpi[i].begin(),mpi[i].end());\n\t}\n\tfor(ll i:sj){\n\t\tsort(mpj[i].begin(),mpj[i].end());\n\t}\n//判定\n\tll ans=0;\n\tans=2*d*w;\n\tans+=2*h*w;\n\tans+=2*d*h;\n\t//hw側\n\tfor(ll i:si){\n\t\tll ny=0,nc=0;\n\t\tfor(Pll j:mpi[i]){\n\t\t\tll Y=j.first,C=j.second;\n\t\t\tif(Y==0)ans-=C;\n\t\t\telse{\n\t\t\t\tif(ny==Y-1){\n\t\t\t\t\tans+=abs(C-nc);\n\t\t\t\t}else{\n\t\t\t\t\tans+=nc;\n\t\t\t\t\tans+=C;\n\t\t\t\t}\n\t\t\t}\n\t\t\tny=Y;\n\t\t\tnc=C;\n\t\t}\n\t\tif(ny==d-1){\n\t\t\tans-=nc;\n\t\t}else{\n\t\t\tans+=nc;\n\t\t}\n\t}\n//dh側\n\tfor(ll i:sj){\n\t\tll nx=0,nc=0;\n\t\tfor(Pll j:mpj[i]){\n\t\t\tll X=j.first,C=j.second;\n\t\t\tif(X==0)ans-=C;\n\t\t\telse{\n\t\t\t\tif(nx==X-1){\n\t\t\t\t\tans+=abs(C-nc);\n\t\t\t\t}else{\n\t\t\t\t\tans+=nc;\n\t\t\t\t\tans+=C;\n\t\t\t\t}\n\t\t\t}\n\t\t\tnx=X;\n\t\t\tnc=C;\n\t\t}\n\t\tif(nx==w-1){\n\t\t\tans-=nc;\n\t\t}else{\n\t\t\tans+=nc;\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\n\n\treturn 0;\n}", "accuracy": 0.5384615384615384, "time_ms": 170, "memory_kb": 26572, "score_of_the_acc": -0.7335, "final_rank": 13 }, { "submission_id": "aoj_0434_10872977", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef double dou;\ntypedef vector<ll> vll;\ntypedef vector<vll> vvll;\ntypedef vector<vvll> vvvll;\ntypedef pair<ll,ll> pll;\ntypedef vector<pll> vpll;\nstruct four_ll_pair{ll ff,fs,sf,ss;};\ntypedef pair<char,ll> pcl;\nstruct three_pcl_pair{pcl l,c,r;};\ntypedef string str;\ntypedef vector<str> vstr;\ntypedef map<ll,ll> mll;\ntypedef priority_queue<ll> maxpq;\ntypedef priority_queue<ll,vll,greater<ll>> minpq;\n#define FOR(i,a,b) for(ll i=a;i<b;i++)\n#define f0r(i,b) for(ll i=0;i<b;i++)\n#define SORT(a) sort(a.begin(),a.end());\n#define llin(a,n) f0r(i,n) {cin>>a[i];}\n#define REVERSE(a) reverse(a.begin(),a.end());\nconst ll llmax=9223372036854775783LL;\nconst ll mod=998244353LL;\nconst ll MOD=1000000007LL;\nstr ALP=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nstr alp=\"abcdefghijklmnopqrstuvwxyz\";\nvoid Yn(bool b) {cout<<(b?\"Yes\":\"No\")<<endl;}\nvoid YN(bool b) {cout<<(b?\"YES\":\"NO\")<<endl;}\nvll Remove_duplicates(vll a){\n a.erase(unique(a.begin(),a.end()),a.end());\n return a;\n}\nvll coordinate_compression(vll v){\n ll n=v.size();\n vll b=v;SORT(b);\n b=Remove_duplicates(b);\n vll ans(n);\n f0r(i,n){\n ll pos=lower_bound(b.begin(),b.end(),v[i])-b.begin();\n ans[i]=pos+1;\n }\n return ans;\n}\nnamespace mod_calc{\n ll mod_pow(ll base,ll a,ll m){\n ll result=1;\n while(a>0){\n if (a%2==1) result=(result*base)%m;\n base=(base*base)%m;\n a>>=1;\n }\n return result;\n }\n ll mod_divide(ll a,ll b,ll m){\n return a*mod_pow(b,m-2,m)%m;\n }\n ll mod_fraction(ll n,ll a,ll b,ll m){\n return mod_divide((n*a%m),b,m);\n }\n ll mod_com(ll a,ll b,ll m){\n ll ans=1;\n if (a<b) return 0;\n if (a==b) return 1;\n for(ll i=0;i<b;i++) ans=mod_fraction(ans,a-i,1+i,m);\n return ans;\n }\n}\nstruct Cumulative_Sum_2D{\n vvll data;\n Cumulative_Sum_2D(ll W,ll H):data(W+1,vll(H+1,0)){}\n void input(ll x,ll y,ll z){\n x++;y++;\n data[x][y]=z;\n }\n void build(){\n FOR(i,1,data.size()) FOR(j,1,data[i].size()) data[i][j]=data[i][j-1]+data[i-1][j]-data[i-1][j-1];\n }\n ll query(ll sx,ll sy,ll gx,ll gy){\n return(data[gx][gy]-data[sx][gy]-data[gx][sy]+data[sx][sy]);\n }\n};\nstruct unionfind{\n vll parent,ver_size;\n unionfind(ll n):parent(n),ver_size(n,1){\n iota(parent.begin(),parent.end(),0); \n }\n ll find(ll node,vll&parent){\n vll path;\n while(parent[node]!=node){\n path.push_back(node);\n node=parent[node];\n }\n for(ll u:path) parent[u]=node;\n return node;\n }\n void unionSets(ll u,ll w,vll&ver_size,vll&parent){\n ll rootU=find(u,parent),rootW=find(w,parent);\n if(rootU!=rootW){\n if(ver_size[rootU]<ver_size[rootW]){\n parent[rootU]=rootW;\n ver_size[rootW]+=ver_size[rootU];\n }else{\n parent[rootW]=rootU;\n ver_size[rootU]+=ver_size[rootW];\n }\n }\n }\n};\nnamespace divisor_calc{\n ll gcd(ll a,ll b){\n while(b!=0){\n ll tmp=a%b;\n a=b;\n b=tmp;\n }\n return a;\n }\n ll lcm(ll a,ll b){\n return a*b/gcd(a,b);\n }\n vll factorizations_vll(ll n){\n ll mema=n;\n vll ftz_ans;\n for(ll i=2;i*i<=mema;i++){\n while(mema%i==0){\n mema/=i;\n ftz_ans.push_back(i);\n }\n }\n if(mema!=1) ftz_ans.push_back(mema);\n return ftz_ans;\n }\n mll factorizations_mll(ll n){\n ll mema=n;\n mll ftz_ans;\n for(ll i=2;i*i<=mema;i++){\n while(mema%i==0){\n mema/=i;\n ftz_ans[i]++;\n }\n }\n if(mema!=1) ftz_ans[mema]++;\n return ftz_ans;\n }\n}\nnamespace all_distances{\n dou euclidean_distance(dou ax,dou ay,dou bx,dou by){\n return sqrt(pow(ax-bx,2)+pow(ay-by,2));\n }\n dou manhattan_distance(dou ax,dou ay,dou bx,dou by){\n return abs(ax-bx)+abs(ay-by);\n }\n dou chebyshev_distance(dou ax,dou ay,dou bx,dou by){\n return max(abs(ax-bx),abs(ay-by));\n }\n}\nstatic ll bit_ceil(ll n){\n if(n<=1)return 1;\n ll x=1;\n while(x<n)x<<=1;\n return x;\n}\ntemplate<class S,S(*op)(S,S),S(*e)()>struct segtree{\n public:\n segtree():segtree(0){}\n explicit segtree(ll n):segtree(vector<S>(n,e())){}\n explicit segtree(const vector<S>& v):_n((ll)v.size()){\n size=(ll)bit_ceil(_n);\n d=vector<S>(2*size,e());\n for(ll i=0;i<_n;i++)d[size+i]=v[i];\n for(ll i=size-1;i>=1;i--)update(i);\n }\n\n void set(ll p,S x){\n assert(0<=p&&p<_n);\n p+=size;\n d[p]=x;\n for(p>>=1;p>=1;p>>=1)update(p);\n }\n S get(ll p)const{\n assert(0<=p&&p<_n);\n return d[p+size];\n }\n S prod(ll l,ll r)const{\n assert(0<=l&&l<=r&&r<=_n);\n S sml=e(),smr=e();\n l+=size;\n r+=size;\n while(l<r){\n if(l&1)sml=op(sml,d[l++]);\n if(r&1)smr=op(d[--r],smr);\n l>>=1;\n r>>=1;\n }\n return op(sml,smr);\n }\n S all_prod()const{return d[1];}\n private:\n ll _n,size;\n vector<S> d;\n void update(ll k){d[k]=op(d[2*k],d[2*k+1]);}\n};\nll sum_op(ll a,ll b){return a+b;} ll sum_e(){return 0LL;}\nll max_op(ll a,ll b){return max(a,b);} ll max_e(){return -1LL;}\nll min_op(ll a,ll b){return min(a,b);} ll min_e(){return llmax;}\nll xor_op(ll a,ll b){return a^b;} ll xor_e(){return 0LL;}\nfour_ll_pair second_largest_op(four_ll_pair a,four_ll_pair b){\n ll FF,FS,SF,SS;\n if(a.ff==b.ff){\n FF=a.ff;FS=a.fs+b.fs;\n if(a.sf==b.sf){\n SF=a.sf;SS=a.ss+b.ss;\n }else{\n SF=max(a.sf,b.sf);\n SS=(SF==a.sf?a.ss:b.ss);\n }\n }else{\n FF=max(a.ff,b.ff);FS=(FF==a.ff?a.fs:b.fs);\n if(a.sf==b.sf){\n SF=a.sf;SS=a.ss+b.ss;\n }else{\n SF=max(a.sf,b.sf);SS=(SF==a.sf?a.ss:b.ss);\n }\n if(SF==min(a.ff,b.ff)){\n SS+=(SF==a.ff?a.fs:b.fs);\n }else{\n SF=max(SF,min(a.ff,b.ff));SS=(SF==min(a.ff,b.ff)?(SF==a.ff?a.fs:b.fs):SS);\n }\n }\n return {FF,FS,SF,SS};\n} \nfour_ll_pair second_largest_e(){return {0,0,0,0};}\nthree_pcl_pair max_combo_op(three_pcl_pair a,three_pcl_pair b){\n ll Max=max(a.c.second,b.c.second);\n if(a.r.first==b.l.first) Max=max(Max,a.r.second+b.l.second);\n char check=((a.c.first=='T'&&b.c.first=='T')?'T':'F');\n if(a.l.first!=b.l.first) check='F';\n pcl re_l=a.l,re_r=b.r;\n if(re_l.first=='0')re_l=b.l;\n else if(a.c.first=='T'&&a.r.first==b.l.first) re_l.second+=b.l.second;\n if(re_r.first=='0')re_r=a.r;\n else if(b.c.first=='T'&&a.r.first==b.l.first) re_r.second+=a.r.second;\n return {re_l,{check,Max},re_r};\n}\nthree_pcl_pair max_combo_e(){return {{'0',0},{'T',0},{'0',0}};}\nll sum_mod_op(ll a,ll b){return (a+b)%mod;} ll sum_mod_e(){return 0LL;}\nvll bfsdis(ll s,vvll graph){\n vll dist(graph.size(),1145141919810);\n queue<ll> q;\n dist[s]=0;\n q.push(s);\n while(!q.empty()){\n ll u=q.front();q.pop();\n for(ll v:graph[u]){\n if (dist[v]==1145141919810) {\n dist[v]=dist[u]+1;\n q.push(v);\n }\n }\n }\n return dist;\n}\nll Ackermann_function(ll m,ll n){\n if(m<=1) return n+1+m;\n else if(m==2) return 2*n+3;\n else{\n ll ans=1LL;\n f0r(i,n+3) ans*=2LL;\n return ans-3LL;\n }\n}\nll ans=0,k;\nvector<vector<char>> s;\nvector<vector<bool>> a;\nvoid dfs(ll i,ll j,ll dist){\n a[i][j]=false;\n if(dist==k) {ans++; a[i][j]=true; return;}\n if(s[i][j+1]=='.'&&a[i][j+1]) dfs(i,j+1,dist+1);\n if(s[i][j-1]=='.'&&a[i][j-1]) dfs(i,j-1,dist+1);\n if(s[i+1][j]=='.'&&a[i+1][j]) dfs(i+1,j,dist+1);\n if(s[i-1][j]=='.'&&a[i-1][j]) dfs(i-1,j,dist+1);\n a[i][j]=true;\n}\nint main(){\n ll w,d,h,c;cin>>w>>d>>h>>c;\n map<pll,ll> m;\n ll Ans=(w*d+d*h+h*w)*2;\n f0r(i,c){\n ll x,y,z;cin>>x>>y>>z;\n ll t=((m.find({x,y})==m.end())?h:m[{x,y}])-z;\n ll r,l,ans=0;\n if(x==w-1) r=0;\n else if(m.find({x+1,y})==m.end()) r=h;\n else r=m[{x+1,y}];\n if(x==0) l=0;\n else if(m.find({x-1,y})==m.end()) l=h;\n else l=m[{x-1,y}];\n if(l>r) swap(l,r);\n if(t<=l){\n ans+=2*min(l-t,z);\n }\n if(r<=t+z){\n ans-=2*min(t+z-r,z);\n }\n Ans+=ans;\n ans=0;\n if(y==d-1) r=0;\n else if(m.find({x,y+1})==m.end()) r=h;\n else r=m[{x,y+1}];\n if(y==0) l=0;\n else if(m.find({x,y-1})==m.end()) l=h;\n else l=m[{x,y-1}];\n if(l>r) swap(l,r);\n if(t<=l){\n ans+=2*min(l-t,z);\n }\n if(r<=t+z){\n ans-=2*min(t+z-r,z);\n }\n Ans+=ans;\n \n m[{x,y}]=t;\n }\n cout<<Ans<<endl;\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 9688, "score_of_the_acc": -0.167, "final_rank": 5 }, { "submission_id": "aoj_0434_10872889", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define all(a) a.begin(), a.end()\n\nvector<string> rotate(vector<string> s)\n{\n int n = s.size();\n vector<vector<char>> res(s.size(), vector<char>(s.size()));\n rep(i, n)\n {\n rep(j, n)\n {\n res[j][n - i - 1] = s[i][j];\n }\n }\n vector<string> p;\n for (auto x : res)\n {\n string q;\n for (auto y : x)\n {\n q += y;\n }\n p.push_back(q);\n }\n return p;\n}\n\nint main()\n{\n ll w, d, h, c;\n cin >> w >> d >> h >> c;\n map<pair<ll, ll>, ll> mp;\n ll ans = 2 * (w * h + h * d + d * w);\n rep(i, c)\n {\n ll x, y, z;\n cin >> x >> y >> z;\n if (mp.count({x, y}) == 0)\n {\n mp[{x, y}] = h;\n }\n if (x != 0 && mp[{x - 1, y}] == 0)\n {\n mp[{x - 1, y}] = h;\n }\n if (x != w - 1 && mp[{x + 1, y}] == 0)\n {\n mp[{x + 1, y}] = h;\n }\n if (y != 0 && mp[{x, y - 1}] == 0)\n {\n mp[{x, y - 1}] = h;\n }\n if (y != d - 1 && mp[{x, y + 1}] == 0)\n {\n mp[{x, y + 1}] = h;\n }\n // c-h_2+h_1\n // ans += c + mp[{x - 1, y}] - mp[{x, y}];\n // ans += c + mp[{x + 1, y}] - mp[{x, y}];\n // ans += c + mp[{x, y - 1}] - mp[{x, y}];\n // ans += c + mp[{x, y + 1}] - mp[{x, y}];\n ans += abs(mp[{x, y}] - z - mp[{x - 1, y}]) - abs(mp[{x, y}] - mp[{x - 1, y}]);\n ans += abs(mp[{x, y}] - z - mp[{x + 1, y}]) - abs(mp[{x, y}] - mp[{x + 1, y}]);\n ans += abs(mp[{x, y}] - z - mp[{x, y - 1}]) - abs(mp[{x, y}] - mp[{x, y - 1}]);\n ans += abs(mp[{x, y}] - z - mp[{x, y + 1}]) - abs(mp[{x, y}] - mp[{x, y + 1}]);\n mp[{x, y}] -= z;\n // cout << ans << endl;\n }\n // for (auto x : mp)\n // cout << x.first.first << \" \" << x.first.second << \"_\" << x.second << endl;\n cout << ans << endl;\n\n return 0;\n}", "accuracy": 1, "time_ms": 340, "memory_kb": 34816, "score_of_the_acc": -1.4466, "final_rank": 11 }, { "submission_id": "aoj_0434_10868678", "code_snippet": "//#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define all(a) (a).begin(), (a).end()\nusing ll = long long;\nconst ll INF32 = 2e9;\nconst ll INF64 = 4e18;\n#define int long long\n\nvoid printYN(bool ok){\n if(ok)cout << \"Yes\" << endl;\n else cout << \"No\" << endl;\n return;\n}\n\nvoid rorate(int type, vector<string> &P){\n int N = P.size();\n vector<string> res(N);\n if(type==1){\n rep(i, N)rep(j, N){\n res[i].push_back(P[N-j-1][i]);\n }\n }\n else if(type==2){\n rep(i, N)rep(j, N){\n res[i].push_back(P[N-i-1][N-1-j]);\n }\n }\n else if(type==3){\n rep(i, N)rep(j, N){\n res[i].push_back(P[j][N-1-i]);\n }\n } else {\n res = P;\n }\n P = res;\n return;\n}\n\nsigned main(){\n int W, D, H, C;\n cin >> W >> D >> H >> C;\n map<pair<int, int>, int> height;\n int now = H*W*2+W*D*2+D*H*2;\n const vector<int> dx = {0, 1, 0, -1}, dy = {1, 0, -1, 0};\n rep(i, C){\n int x, y, z;\n cin >> x >> y >> z;\n int nowh = H;\n if(height.count({x,y}))nowh = height[{x,y}];\n int nxth = nowh-z;\n rep(j, dx.size()){\n int nx = x + dx[j], ny = y + dy[j];\n if(nx==-1||ny==-1||nx==W||ny==D){\n now-=nowh;\n now+=nxth;\n }\n else {\n if(!height.count({nx, ny}))height[{nx,ny}] = H;\n now-=abs(nowh-height[{nx,ny}]);\n now+=abs(nxth-height[{nx, ny}]);\n }\n }\n height[{x,y}] = nxth;\n }\n cout << now << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 250, "memory_kb": 34584, "score_of_the_acc": -1.1424, "final_rank": 8 }, { "submission_id": "aoj_0434_10867956", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ld=long double;\n#define fi first\n#define se second\n#define i128 __int128_t\n#define all(x) x.begin(),x.end()\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define si(a) (long)(a.size())\ntemplate<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}\ntemplate<typename T>bool chmax(T&a,T b){return b>a?(a=b,1):0;}\nconst int INF=1e9+100;\nconst long INFL=3e18+100;\nstruct _ {\n _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }\n} __;\n\nint main(){\n long W,H,D,C;\n cin>>W>>H>>D>>C;\n\n long now=(H+W)*D*2+H*W*2;\n map<pair<int,int>,int> ma;\n rep(_,C){\n int x,y,z;\n cin>>x>>y>>z;\n if(!ma.count({y,x})) ma[{y,x}]=D;\n\n vector<int> dd={0,1,0,-1,0};\n\n rep(i,4){\n int ny=y+dd[i];\n int nx=x+dd[i+1];\n if(ny<0||H<=ny||nx<0||W<=nx){\n now-=z;\n }\n else{\n if(!ma.count({ny,nx})) ma[{ny,nx}]=D;\n int h=ma[{y,x}];\n now-=abs(ma[{ny,nx}]-h);\n h-=z;\n now+=abs(ma[{ny,nx}]-h);\n }\n }\n ma[{y,x}]-=z;\n }\n cout<<now<<\"\\n\";\n}", "accuracy": 1, "time_ms": 250, "memory_kb": 34816, "score_of_the_acc": -1.1466, "final_rank": 9 }, { "submission_id": "aoj_0434_10862280", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define ll long long\nconst long long mod=998244353;\nconst long long hmod=46216567629137;\nint main(){\n cin.tie(0)->sync_with_stdio(0);\n cout.tie(0);\n ll W,D,H,C;\n cin>>W>>D>>H>>C;\n ll x[C+1],y[C+1],z[C+1];\n map<ll,ll>M1[W+1],M2[D+1];\n for(int i=1;i<=C;i++){\n cin>>x[i]>>y[i]>>z[i];\n if(M1[x[i]].count(y[i])>=1) M1[x[i]][y[i]]+=z[i];\n else M1[x[i]][y[i]]=z[i];\n if(M2[y[i]].count(x[i])>=1) M2[y[i]][x[i]]+=z[i];\n else M2[y[i]][x[i]]=z[i];\n }\n ll ans=0;\n for(int i=0;i<W;i++){\n ll last=H;\n int last_pos=-2;\n for(auto p:M1[i]){\n ans+=p.second*2;\n if(last_pos+1==p.first){\n ans-=min(last,p.second)*2;\n }\n if(p.first==0 || p.first==D-1){\n ans-=p.second;\n }\n last_pos=p.first;\n last=p.second;\n }\n }\n for(int i=0;i<D;i++){\n ll last=H;\n int last_pos=-2;\n for(auto p:M2[i]){\n ans+=p.second*2;\n if(last_pos+1==p.first){\n ans-=min(last,p.second)*2;\n }\n if(p.first==0 || p.first==W-1){\n ans-=p.second;\n }\n last_pos=p.first;\n last=p.second;\n }\n }\n ans+=D*W*2;\n ll high1[W],high2[W],high3[D],high4[D];\n rep(i,W){\n high1[i]=H;\n high2[i]=H;//最後\n }\n rep(i,D){\n high3[i]=H;\n high4[i]=H;//最後\n }\n for(int i=1;i<=C;i++){\n if(y[i]==0){\n high1[x[i]]-=z[i];\n }\n if(y[i]==D-1){\n high2[x[i]]-=z[i];\n }\n if(x[i]==0){\n high3[y[i]]-=z[i];\n }\n if(x[i]==W-1){\n high4[y[i]]-=z[i];\n }\n }\n rep(i,W){\n ans+=high1[i]+high2[i];\n }\n rep(i,D){\n ans+=high3[i]+high4[i];\n }\n cout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 30780, "score_of_the_acc": -0.3749, "final_rank": 6 }, { "submission_id": "aoj_0434_10859083", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define oke cout << \"Yes\" << '\\n';\n#define dame cout << \"No\" << '\\n';\n#define all(a) a.begin(), a.end()\n#define rall(a) a.rbegin(), a.rend()\nusing HaiI = vector<vector<int>>;\nusing Hai2 = vector<vector<ll>>;\nusing HaiB = vector<vector<bool>>;\nusing Hai3 = vector<vector<vector<ll>>>;\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tcout << fixed << setprecision(15);\n\tvector<int>gox={1,0,-1,0};\n\tvector<int>goy={0,1,0,-1};\n\tll W,D,H,C;\n\tcin>>W>>D>>H>>C;\n\tmap<pair<int,int>,int>L;\n\tll wa=(W*D*2)+(W*H*2)+(D*H*2);\n\trep(i,C){\n\t\tint x,y,z;\n\t\tcin>>x>>y>>z;\n\t\tif(!L.count({x,y})){\n\t\t\tL[{x,y}]=0;\n\t\t}\n\t\tif((x==0||x==W-1) && (y==0||y==D-1)){\n\t\t\twa-=z*2;\n\t\t}else if((x==0||x==W-1) || (y==0||y==D-1)){\n\t\t\twa-=z;\n\t\t}\n\t\trep(j,4){\n\t\t\tint xx=x+gox[j],yy=y+goy[j];\n\t\t\tif(xx<0 || xx>=W || yy<0 || yy>=D){//蛇足かも\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif(!L.count({xx,yy})){\n\t\t\t\twa+=z;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(L[{xx,yy}]>L[{x,y}]){\n\t\t\t\twa-=z;\n\t\t\t\tif(L[{xx,yy}]<L[{x,y}]+z){\n\t\t\t\t\tll Z=(z+L[{x,y}])-L[{xx,yy}];\n\t\t\t\t\twa+=2*Z;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\twa+=z;\n\t\t\t}\n\t\t}\n\t\tL[{x,y}]+=z;\n\t\tif(L[{x,y}]==H){\n\t\t\twa-=2;\n\t\t}\n\t}\n\tcout<<wa<<\"\\n\";\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 9668, "score_of_the_acc": -0.1333, "final_rank": 2 }, { "submission_id": "aoj_0434_10859045", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define oke cout << \"Yes\" << '\\n';\n#define dame cout << \"No\" << '\\n';\n#define all(a) a.begin(), a.end()\n#define rall(a) a.rbegin(), a.rend()\nusing HaiI = vector<vector<int>>;\nusing Hai2 = vector<vector<ll>>;\nusing HaiB = vector<vector<bool>>;\nusing Hai3 = vector<vector<vector<ll>>>;\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tcout << fixed << setprecision(15);\n\tvector<int>gox={1,0,-1,0};\n\tvector<int>goy={0,1,0,-1};\n\tll W,D,H,C;\n\tcin>>W>>D>>H>>C;\n\tmap<pair<int,int>,int>L;\n\tll wa=(W*D*2)+(W*H*2)+(D*H*2);\n\trep(i,C){\n\t\tint x,y,z;\n\t\tcin>>x>>y>>z;\n\t\tif(!L.count({x,y})){\n\t\t\tL[{x,y}]=0;\n\t\t}\n\t\tif((x==0||x==W-1) && (y==0||y==D-1)){\n\t\t\tL[{x,y}]+=z;\n\t\t\tcontinue;\n\t\t}else if((x==0||x==W-1) || (y==0||y==D-1)){\n\t\t\twa-=z;\n\t\t}\n\t\trep(j,4){\n\t\t\tint xx=x+gox[j],yy=y+goy[j];\n\t\t\tif(xx<0 || xx>=W || yy<0 || yy>=D){//蛇足かも\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif(!L.count({xx,yy})){\n\t\t\t\twa+=z;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(L[{xx,yy}]>L[{x,y}]){\n\t\t\t\twa-=z;\n\t\t\t\tif(L[{xx,yy}]<L[{x,y}]+z){\n\t\t\t\t\tll Z=(z+L[{x,y}])-L[{xx,yy}];\n\t\t\t\t\twa+=2*Z;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\twa+=z;\n\t\t\t}\n\t\t}\n\t\tL[{x,y}]+=z;\n\t\tif(L[{x,y}]==H){\n\t\t\twa-=2;\n\t\t}\n\t}\n\tcout<<wa<<\"\\n\";\n}", "accuracy": 0.5, "time_ms": 80, "memory_kb": 9712, "score_of_the_acc": -0.1341, "final_rank": 14 }, { "submission_id": "aoj_0434_10851900", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <numbers>\n#include <cassert>\n#include <numeric>\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pint = pair<int, int>;\ntemplate<typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\ntemplate<typename T>\nbool chmax(T & a, const T & b) { if (a < b) { a = b; return true; } return false; }\ntemplate<typename T>\nbool chmin(T & a, const T & b) { if (a > b) { a = b; return true; } return false; }\nconst int inf = 1e9;\nconst ll linf = 1e18;\nconst int dy[] = { 0,0,1,-1 }, dx[] = { 1,-1,0,0 };\nint main() {\n ll w, d, h; int c; cin >> w >> d >> h >> c;\n ll ans = (w * d + w * h + d * h) * 2;\n map<pint, int> mp;\n rep(i, c) {\n int x, y, z; cin >> x >> y >> z;\n if (!mp.count({ x,y }))mp[{x, y}] = h;\n rep(j, 4) {\n int nx = x + dx[j], ny = y + dy[j];\n if (!mp.count({ nx,ny })) {\n if (nx < 0 || ny < 0 || nx >= w || ny >= d)mp[{nx, ny}] = 0;\n else mp[{nx, ny}] = h;\n }\n int now = mp[{x, y}];\n if (mp[{nx, ny}] < now) ans -= min(z, now - mp[{nx, ny}]);\n now -= z;\n if(mp[{nx, ny}] >= now)ans += min(z, mp[{nx, ny}] - now);\n }\n mp[{x, y}] -= z;\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 300, "memory_kb": 34816, "score_of_the_acc": -1.3132, "final_rank": 10 }, { "submission_id": "aoj_0434_10851875", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <numbers>\n#include <cassert>\n#include <numeric>\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pint = pair<int, int>;\ntemplate<typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\ntemplate<typename T>\nbool chmax(T & a, const T & b) { if (a < b) { a = b; return true; } return false; }\ntemplate<typename T>\nbool chmin(T & a, const T & b) { if (a > b) { a = b; return true; } return false; }\nconst int inf = 1e9;\nconst ll linf = 1e18;\nconst int dy[] = { 0,0,1,-1 }, dx[] = { 1,-1,0,0 };\nint main() {\n ll w, d, h; int c; cin >> w >> d >> h >> c;\n ll ans = (w * d + w * h + d * h) * 2;\n map<pint, int> mp;\n rep(i, c) {\n int x, y, z; cin >> x >> y >> z;\n if (!mp.count({ x,y }))mp[{x, y}] = h;\n rep(j, 4) {\n int nx = x + dx[j], ny = y + dy[j];\n if (!mp.count({ nx,ny })) {\n if (nx < 0 || ny < 0 || nx >= w || ny >= h)mp[{nx, ny}] = 0;\n else mp[{nx, ny}] = h;\n }\n int now = mp[{x, y}];\n if (mp[{nx, ny}] < now) ans -= min(z, now - mp[{nx, ny}]);\n now -= z;\n if(mp[{nx, ny}] >= now)ans += min(z, mp[{nx, ny}] - now);\n }\n mp[{x, y}] -= z;\n }\n cout << ans << endl;\n}", "accuracy": 0.5769230769230769, "time_ms": 290, "memory_kb": 34816, "score_of_the_acc": -1.2799, "final_rank": 12 }, { "submission_id": "aoj_0434_10851864", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <numbers>\n#include <cassert>\n#include <numeric>\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pint = pair<int, int>;\ntemplate<typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\ntemplate<typename T>\nbool chmax(T & a, const T & b) { if (a < b) { a = b; return true; } return false; }\ntemplate<typename T>\nbool chmin(T & a, const T & b) { if (a > b) { a = b; return true; } return false; }\nconst int inf = 1e9;\nconst ll linf = 1e18;\nconst int dy[] = { 0,0,1,-1 }, dx[] = { 1,-1,0,0 };\nint main() {\n ll w, d, h; int c; cin >> w >> d >> h >> c;\n ll ans = (w * d + w * h + d * h) * 2;\n map<pint, int> mp;\n rep(i, c) {\n int x, y, z; cin >> x >> y >> z;\n if (!mp.count({ x,y }))mp[{x, y}] = h;\n rep(j, 4) {\n int nx = x + dx[j], ny = y + dy[j];\n if (!mp.count({ nx,ny })) {\n if (nx < 0 || ny < 0 || nx >= w || ny >= h)mp[{nx, ny}] = 0;\n else mp[{nx, ny}] = h;\n }\n int now = mp[{x, y}];\n if (mp[{nx, ny}] < now) ans -= min(z, now - mp[{nx, ny}]);\n now -= z;\n if(mp[{nx, ny}] >= now)ans += mp[{nx, ny}] - now;\n }\n mp[{x, y}] -= z;\n }\n cout << ans << endl;\n}", "accuracy": 0.23076923076923078, "time_ms": 280, "memory_kb": 34816, "score_of_the_acc": -1.2466, "final_rank": 17 }, { "submission_id": "aoj_0434_10851843", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <numbers>\n#include <cassert>\n#include <numeric>\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pint = pair<int, int>;\ntemplate<typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\ntemplate<typename T>\nbool chmax(T & a, const T & b) { if (a < b) { a = b; return true; } return false; }\ntemplate<typename T>\nbool chmin(T & a, const T & b) { if (a > b) { a = b; return true; } return false; }\nconst int inf = 1e9;\nconst ll linf = 1e18;\nconst int dy[] = { 0,0,1,-1 }, dx[] = { 1,-1,0,0 };\nint main() {\n ll w, d, h; int c; cin >> w >> d >> h >> c;\n ll ans = (w * d + w * h + d * h) * 2;\n map<pint, int> mp;\n rep(i, c) {\n int x, y, z; cin >> x >> y >> z;\n if (!mp.count({ x,y }))mp[{x, y}] = h;\n rep(j, 4) {\n int nx = x + dx[j], ny = y + dy[j], nz = z;\n if (!mp.count({ nx,ny })) {\n if (nx < 0 || ny < 0 || nx >= w || ny >= h)mp[{nx, ny}] = 0;\n else mp[{nx, ny}] = h;\n }\n int now = mp[{x, y}];\n if (mp[{nx, ny}] < now) {\n int sub = min(nz, now - mp[{nx, ny}]);\n now -= sub;\n ans -= sub;\n nz -= sub;\n if (nz == 0) continue;\n }\n now -= nz;\n ans += mp[{nx, ny}] - now;\n }\n mp[{x, y}] -= z;\n }\n cout << ans << endl;\n}", "accuracy": 0.23076923076923078, "time_ms": 260, "memory_kb": 34816, "score_of_the_acc": -1.1799, "final_rank": 16 }, { "submission_id": "aoj_0434_10846872", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)\n#define all(a) (a).begin(),(a).end()\n\nvector<int> dx = {0, 1, 0, -1};\nvector<int> dy = {1, 0, -1, 0};\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n \n ll W, D, H, Q;\n cin >> W >> D >> H >> Q;\n vector<ll> x(Q), y(Q), z(Q);\n rep(i, 0, Q) cin >> x[i] >> y[i] >> z[i];\n \n map<pair<ll, ll>, ll> height;\n ll ans = 2 * (W*D + D*H + H*W);\n rep(i, 0, Q) {\n ll A;\n if (height.count({x[i], y[i]})) A = height[{x[i], y[i]}];\n else A = H;\n \n rep(dir, 0, 4) {\n int nx = x[i] + dx[dir];\n int ny = y[i] + dy[dir];\n \n if (nx == -1 || nx == W || ny == -1 || ny == D) {\n ans -= z[i];\n } else {\n ll B;\n if (height.count({nx, ny})) B = height[{nx, ny}];\n else B = H;\n \n ans -= abs(A - B);\n ans += abs(A - z[i] - B);\n }\n }\n \n height[{x[i], y[i]}] = A - z[i];\n }\n \n cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 11792, "score_of_the_acc": -0.1044, "final_rank": 1 }, { "submission_id": "aoj_0434_10846532", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define INF 1LL<<60\nint main(){\n \n ll w,d,h,c,ans=0;cin>>w>>d>>h>>c;\n map<pair<ll,ll>,ll> ma;\n vector<ll> f={0,1,0,-1,0,0};\n ans=2*w*d+2*w*h+2*d*h;\n for(ll i=0;i<c;i++){\n ll x,y,z;cin>>x>>y>>z;x++,y++;\n ma[{x,y}]+=z;\n }\n for(auto& i:ma){\n auto [x,y]=i.first;\n ll z=i.second;\n for(ll j=0;j<4;j++){\n ll nx=x+f[j],ny=y+f[j+1];\n if(nx==0||ny==0||nx==w+1||ny==d+1)ans-=z;\n else if(ma.find({nx,ny})==ma.end())ans+=z;\n else if(ma[{nx,ny}]<z)ans+=z-ma[{nx,ny}];\n }\n }\n cout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 9692, "score_of_the_acc": -0.1338, "final_rank": 3 }, { "submission_id": "aoj_0434_10846464", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define INF 1LL<<60\nint main(){\n \n ll w,d,h,c,ans=0;cin>>w>>d>>h>>c;\n map<pair<ll,ll>,ll> ma;\n vector<ll> f={1,0,-1,0,1};\n ans=2*w*d+2*w*h+2*d*h;\n for(ll i=0;i<c;i++){\n ll x,y,z;cin>>x>>y>>z;x++,y++;\n ma[{x,y}]=max(ma[{x,y}],z);\n }\n for(auto& i:ma){\n auto [x,y]=i.first;\n ll z=i.second;\n for(ll j=0;j<4;j++){\n ll nx=x+f[j],ny=y+f[j+1];\n if(nx==0||ny==0||nx==w+1||ny==d+1)ans-=z;\n else if(ma.find({nx,ny})==ma.end())ans+=z;\n else if(ma[{nx,ny}]<z)ans+=z-ma[{nx,ny}];\n }\n }\n cout<<ans<<endl;\n}", "accuracy": 0.23076923076923078, "time_ms": 90, "memory_kb": 9700, "score_of_the_acc": -0.1672, "final_rank": 15 }, { "submission_id": "aoj_0434_10846454", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define INF 1LL<<60\nint main(){\n \n ll w,d,h,c,ans=0;cin>>w>>d>>h>>c;\n map<pair<ll,ll>,ll> ma,mf;\n for(ll i=0;i<=w+1;i++)ma[{i,0}]=ma[{i,d+1}]=h;\n for(ll i=0;i<=d+1;i++)ma[{0,i}]=ma[{w+1,i}]=h;\n ans=2*w*d+h*(w+d)*2;\n for(ll i=0;i<c;i++){\n ll x,y,z;cin>>x>>y>>z;x++,y++;\n mf[{x,y}]=max(mf[{x,y}],z);\n }\n for(auto ass:mf){\n auto [x,y]=ass.first;\n auto z=ass.second;\n ans-=2*min({ma[{x-1,y}],ma[{x+1,y}],z});\n if(z>max(ma[{x-1,y}],ma[{x+1,y}]))ans+=2*(z-max(ma[{x-1,y}],ma[{x+1,y}]));\n\n ans-=2*min({ma[{x,y-1}],ma[{x,y+1}],z});\n if(z>max(ma[{x,y-1}],ma[{x,y+1}]))ans+=2*(z-max(ma[{x,y-1}],ma[{x,y+1}]));\n ma[{x,y}]=z;\n // cout<<x<<\" \"<<y<<\" \"<<z<<\" \"<<ans<<endl;\n }\n cout<<ans<<endl;\n}", "accuracy": 0.23076923076923078, "time_ms": 340, "memory_kb": 65876, "score_of_the_acc": -1.9981, "final_rank": 18 }, { "submission_id": "aoj_0434_10846410", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define INF 1LL<<60\n#define B 'B'\n#define R 'R'\n#define G 'G'\n#define Y 'Y'\nint main(){\n \n ll w,d,h,c,ans=0;cin>>w>>d>>h>>c;\n map<pair<ll,ll>,ll> ma,mf;\n vector<ll> f={1,0,-1,0,1};\n for(ll i=0;i<=w+1;i++)ma[{i,0}]=ma[{i,d+1}]=h;\n for(ll i=0;i<=d+1;i++)ma[{0,i}]=ma[{w+1,i}]=h;\n ans=2*w*d+h*(w+d)*2;\n for(ll i=0;i<c;i++){\n ll x,y,z;cin>>x>>y>>z;x++,y++;\n mf[{x,y}]=max(mf[{x,y}],z);\n }\n for(auto ass:mf){\n auto [x,y]=ass.first;\n auto z=ass.second;\n if(z==h)ans-=2;\n ans-=2*min({ma[{x-1,y}],ma[{x+1,y}],z});\n if(z>max(ma[{x-1,y}],ma[{x+1,y}]))ans+=2*(z-max(ma[{x-1,y}],ma[{x+1,y}]));\n\n ans-=2*min({ma[{x,y-1}],ma[{x,y+1}],z});\n if(z>max(ma[{x,y-1}],ma[{x,y+1}]))ans+=2*(z-max(ma[{x,y-1}],ma[{x,y+1}]));\n ma[{x,y}]=z;\n // cout<<x<<\" \"<<y<<\" \"<<z<<\" \"<<ans<<endl;\n }\n cout<<ans<<endl;\n}", "accuracy": 0.23076923076923078, "time_ms": 340, "memory_kb": 65984, "score_of_the_acc": -2, "final_rank": 19 }, { "submission_id": "aoj_0434_10846092", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define INF 1LL<<60\n#define B 'B'\n#define R 'R'\n#define G 'G'\n#define Y 'Y'\nint main(){\n \n ll w,d,h,c,ans=0;cin>>w>>d>>h>>c;\n map<pair<ll,ll>,ll> ma,mf;\n vector<ll> f={1,0,-1,0,1};\n for(ll i=0;i<=w+2;i++)ma[{i,0}]=ma[{i,d+2}]=h;\n for(ll i=0;i<=d+2;i++)ma[{0,i}]=ma[{w+2,i}]=h;\n ans=2*w*d+h*(w+d)*2;\n for(ll i=0;i<c;i++){\n ll x,y,z;cin>>x>>y>>z;x++,y++;\n mf[{x,y}]=max(mf[{x,y}],z);\n }\n// cout<<ans<<endl;\n for(auto ass:mf){\n auto [x,y]=ass.first;\n auto z=ass.second;\n if(z==h)ans-=2;\n if(x==w){\n ans-=2*min(ma[{x-1,y}],z);\n if(ma[{x-1,y}]<z)ans+=(z-ma[{x-1,y}]);\n }else if(x!=1){\n if(ma[{x-1,y}]<z)ans+=2*(z-ma[{x-1,y}]);\n }\n if(y==d){\n ans-=2*min(ma[{x,y-1}],z);\n if(ma[{x,y-1}]<z)ans+=(z-ma[{x,y-1}]);\n }else if(y!=1){\n if(ma[{x,y-1}]<z)ans+=2*(z-ma[{x,y-1}]);\n }\n ma[{x,y}]=z;\n // cout<<x<<\" \"<<y<<\" \"<<z<<\" \"<<ans<<endl;\n }\n cout<<ans<<endl;\n}", "accuracy": 0.11538461538461539, "time_ms": 220, "memory_kb": 53328, "score_of_the_acc": -1.3753, "final_rank": 20 }, { "submission_id": "aoj_0434_10835437", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint dx[4]={1,0,-1,0};\nint dy[4]={0,1,0,-1};\n\nint main(){\n\tint W,D,H,C;\n\tcin >> W >> D >> H >> C;\n\tmap<pair<int,int>,int> data;\n\tfor(;C--;){\n\t\tint x,y,z;\n\t\tcin >> x >> y >> z;\n\t\tdata[make_pair(x,y)]+=z;\n\t}\n\tlong long ans=(long long)W*D+(long long)D*H+(long long)H*W;\n\tans*=2;\n\tfor(auto[p,s] : data){\n\t\tfor(int i=0;i<4;i++){\n\t\t\tpair<int,int> q=make_pair(p.first+dx[i],p.second+dy[i]);\n\t\t\tif(data.count(q)){\n\t\t\t\tif(i>=2) continue;\n\t\t\t\tans+=abs(s-data[q]);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(q.first<0 || q.first>=W || q.second<0 || q.second>=D){\n\t\t\t\tans-=s;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tans+=s;\n\t\t}\n\t}\n\tcout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 9696, "score_of_the_acc": -0.1338, "final_rank": 4 } ]
aoj_0437_cpp
Copy and Sum There are two sequences, A and B, of length $N$. Denote the $i$-th elements of A and B by $a_i$ and $b_i$, respectively. $i$ is an integer between $1$ and $N$. Perform the following operations on these sequences of numbers. copy($x$, $y$, $z$) : replace $a_x, a_{x+1}, ..., a_{x+z-1}$ with $b_y, b_{y+1}, ..., b_{y+z-1}$ respectively. sum(p, q) : output the value of $a_p + a_{p+1} + ... + a_q$. Given a sequence of numbers A and B and some operations, write a program that outputs the result of the sum operation. Input The input is given in the following form. $N$ $M$ $a_1$ $a_2$ ... $a_N$ $b_1$ $b_2$ ... $b_N$ $op_1$ $op_2$ : $op_M$ In the first line, the length of the sequence $N$ ($1 \leq N \leq 200,000$) and the number of operations $M$ ($1 \leq M \leq 200,000$) are given. In the next line, the $i$-th element $a_i$ ($0 \leq a_i \leq 1,000,000,000$) of sequence A is given as integers. In the next line, the $i$-th element $b_i$ ($0 \leq b_i \leq 1,000,000,000$) of sequence B is given as integers. In the following $M$ lines, the information $op_i$ indicating the operation is given. Each $op_i$ is given in one of the following forms. 0 $x$ $y$ $z$ or 1 $p$ $q$ If the first character is 0, it indicates that the operation copy($x$, $y$, $z$) is to be performed. Note that $1 \leq x,y \leq N, 1 \leq z,$ max$(x,y)+z-1 \leq N$, where max($x$,$y$) is the larger of $x$ and $y$. If the first letter is 1, it indicates that the operation sum($p$, $q$) is to be performed. Note that $1 \leq p \leq q \leq N$. The operation sum is given to the input one or more times. Output For each sum operation given, output the result of the sum in a line. Sample Input and Output Sample Input 1 5 5 1 3 5 7 9 2 4 6 8 10 1 1 3 1 4 5 0 4 1 2 1 1 3 1 4 5 Sample Output 1 9 16 9 6 Sample Input 2 6 5 1 2 3 4 5 6 2 4 8 16 32 64 1 1 6 0 1 4 3 1 1 6 0 3 1 3 1 1 6 Sample Output 2 21 127 68
[ { "submission_id": "aoj_0437_11022398", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)\n\ntemplate<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id>\nstruct LazySegTree {\n\tint N, height, size;\n\tvector<S> data;\n\tvector<F> lazy;\n\t\n\tLazySegTree(const vector<S> &v) : N(v.size()) {\n\t\tsize = 1, height = 0;\n\t\twhile (size < N) size <<= 1, ++height;\n\t\tdata = vector<S>(2*size, e());\n\t\tlazy = vector<F>(2*size, id());\n\t\tfor (int i = 0; i < N; ++i) data[size + i] = v[i];\n\t\tfor (int i = size - 1; i >= 1; --i) update(i);\n\t}\n\t\n\tvoid update(int i) {\n\t\tdata[i] = op(data[2*i], data[2*i + 1]);\n\t}\n\t\n\tvoid all_apply(int i, F f) {\n\t\tdata[i] = mapping(f, data[i]);\n\t\tif (i < size) lazy[i] = composition(f, lazy[i]);\n\t}\n\t\n\tvoid push(int i) {\n\t\tall_apply(2*i, lazy[i]);\n\t\tall_apply(2*i + 1, lazy[i]);\n\t\tlazy[i] = id();\n\t}\n\t\n\tvoid set(int p, S x) {\n\t\tp += size;\n\t\tfor (int i = height; i >= 1; --i) push(p >> i);\n\t\tdata[p] = x;\n\t\tfor (int i = 1; i <= height; ++i) update(p >> i);\n\t}\n\t\n\tS get(int p) {\n\t\tp += size;\n\t\tfor (int i = height; i >= 1; --i) push(p >> i);\n\t\treturn data[p];\n\t}\n\t\n\tS prod(int l, int r) {\n\t\tif (l == r) return e();\n\t\tl += size, r += size;\n\t\tfor (int i = height; i >= 1; --i) {\n\t\t\tif (((l >> i) << i) != l) push(l >> i);\n\t\t\tif (((r >> i) << i) != r) push((r - 1) >> i);\n\t\t}\n\t\tS vl = e(), vr = e();\n\t\tfor (int a = l, b = r; a < b; a >>= 1, b >>= 1) {\n\t\t\tif (a & 1) vl = op(vl, data[a++]);\n\t\t\tif (b & 1) vr = op(data[--b], vr);\n\t\t}\n\t\treturn op(vl, vr);\n\t}\n\t\n\tvoid apply(int l, int r, F f) {\n\t\tif (l == r) return;\n\t\tl += size, r += size;\n\t\tfor (int i = height; i >= 1; --i) {\n\t\t\tif (((l >> i) << i) != l) push(l >> i);\n\t\t\tif (((r >> i) << i) != r) push((r - 1) >> i);\n\t\t}\n\t\tfor (int a = l, b = r; a < b; a >>= 1, b >>= 1) {\n\t\t\tif (a & 1) all_apply(a++, f);\n\t\t\tif (b & 1) all_apply(--b, f);\n\t\t}\n\t\tfor (int i = 1; i <= height; ++i) {\n\t\t\tif (((l >> i) << i) != l) update(l >> i);\n\t\t\tif (((r >> i) << i) != r) update((r - 1) >> i);\n\t\t}\n\t}\n};\n\nint N, M;\nvector<ll> A(200050), B(200050);\n\nstruct S {\n\tll val;\n\tint size, pos;\n};\nstruct F {\n\tint start, bias;\n};\n\nS op(S a, S b) { return {a.val + b.val, a.size + b.size, min(a.pos, b.pos)}; }\nS e() { return {0, 0, (int)1e9}; }\nS mapping(F f, S x) {\n\tif (f.start != -1) {\n\t\tint l = x.pos - f.start + f.bias;\n\t\tint r = l + x.size - 1;\n\t\tif (l == 0) x.val = B[r];\n\t\telse x.val = B[r] - B[l - 1];\n\t}\n\treturn x;\n}\nF composition(F f, F g) { return (f.start == -1 ? g : f); }\nF id() { return {-1, -1}; }\n\nint main() {\n\tcin.tie(nullptr);\n\tios_base::sync_with_stdio(false);\n\t\n\tcin >> N >> M;\n\trep(i, 0, N) cin >> A[i];\n\trep(i, 0, N) cin >> B[i];\n\t\n\trep(i, 1, N) B[i] += B[i - 1];\n\t\n\tvector<S> v(N);\n\trep(i, 0, N) v[i] = {A[i], 1, i};\n\tLazySegTree<S, op, e, F, mapping, composition, id> seg(v);\n\t\n\trep(query, 0, M) {\n\t\tint ord;\n\t\tcin >> ord;\n\t\t\n\t\tif (ord == 0) {\n\t\t\tint x, y, z;\n\t\t\tcin >> x >> y >> z;\n\t\t\t--x, --y;\n\t\t\tseg.apply(x, x + z, {x, y});\n\t\t} else {\n\t\t\tint p, q;\n\t\t\tcin >> p >> q;\n\t\t\t--p, --q;\n\t\t\tcout << seg.prod(p, q + 1).val << '\\n';\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 160, "memory_kb": 21540, "score_of_the_acc": -0.8498, "final_rank": 7 }, { "submission_id": "aoj_0437_10874666", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long \n#define ld long double\n#define rep(i,N) for(int i=0;i<(int)N;i++)\n#define all(x) x.begin(),x.end()\n#define fi first\n#define se second\n#define pb push_back\n\nclass seg{\n public:\n int N;\n vector<ll>data;\n vector<pair<int,int>>lazy;\n vector<ll>sum;\n void init(int n,vector<ll>A,vector<ll>B){\n N = 1;\n while(N<n)N*=2;\n data.assign(N*2,0);\n lazy.assign(N*2,{-1,-1});\n sum={0};\n rep(i,N)sum.pb(sum[i]+B[i]);\n rep(i,N)data[N+i-1]=A[i];\n for(int i = N-2;i>=0;i--)data[i]=data[i*2+1]+data[i*2+2];\n }\n void eval(int k){\n if(lazy[k].fi==-1)return;\n data[k]=sum[lazy[k].se]-sum[lazy[k].fi];\n if(lazy[k].se-lazy[k].fi>1){\n lazy[k*2+1]={lazy[k].fi,(lazy[k].se+lazy[k].fi)/2};\n lazy[k*2+2]={(lazy[k].se+lazy[k].fi)/2,lazy[k].se};\n }\n lazy[k]={-1,-1};\n }\n ll Sum(int a,int b,int k=0,int l=0,int r=-1){\n if(r<0)r=N;\n eval(k);\n if(b<=l||r<=a)return 0;\n if(a<=l&&r<=b)return data[k];\n return Sum(a,b,k*2+1,l,(l+r)/2)+Sum(a,b,k*2+2,(l+r)/2,r);\n }\n void update(int a,int b,int x,int y,int k=0,int l=0,int r=-1){\n if(r<0)r=N;\n eval(k);\n if(b<=l||r<=a)return;\n if(a<=l&&r<=b){\n lazy[k]={x+(l-a),x+(r-a)};\n eval(k);\n }\n else {\n update(a,b,x,y,k*2+1,l,(l+r)/2);\n update(a,b,x,y,k*2+2,(l+r)/2,r);\n data[k]=data[k*2+1]+data[k*2+2];\n }\n }\n};\n\nint main(){\n int N,M;cin>>N>>M;\n vector<ll>A(N),B(N);\n rep(i,N)cin>>A[i];\n rep(i,N)cin>>B[i];\n seg seg;\n seg.init(N,A,B);\n rep(m,M){\n int t;cin>>t;\n if(t==1){\n int p,q;cin>>p>>q;p--;\n cout<<seg.Sum(p,q)<<endl;\n }\n else {\n int x,y,z;cin>>x>>y>>z;\n x--;y--;\n seg.update(x,x+z,y,y+z);\n }\n }\n}", "accuracy": 1, "time_ms": 350, "memory_kb": 23324, "score_of_the_acc": -1.1306, "final_rank": 12 }, { "submission_id": "aoj_0437_10869739", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define ll long long\nconst long long mod=998244353;\nconst long long hmod=46216567629137;\nint N,M;\nll a[200009],b[200009];\nstruct S{\n ll value;\n int start,end;\n};\nusing F=ll;\nconst F ID=8e18;\nS e(){//Sの単位元\n S res={0,-1,-1};\n return res;\n}\nF id(){//Fの単位元\n return ID;\n}\nS op(S a,S b){//Sの結合\n if(a.start==-1) return b;\n if(b.start==-1) return a;\n S res;\n res.value=a.value+b.value;\n res.start=a.start;\n res.end=b.end;\n return res;\n}\nS mapping(F f,S x){//Sに遅延伝播をかける\n if(f==ID) return x;\n if(x.start==-1) return x;\n int s=x.start+f,t=x.end+f;\n S res;\n res.value=b[t]-b[s-1];\n res.start=x.start;\n res.end=x.end;\n return res;\n}\nF composition(F f,F g){//lazy同士の合成(gにfの操作をする)\n if(f==ID) return g;\n return f;\n}\nclass lazysegtree{\n public:\n S dat[800009];\n F lazy[800009];\n ll siz;\n lazysegtree(ll N){\n siz=1;\n while(siz<N) siz*=2;\n for(ll i=1;i<siz*2;i++){\n dat[i]=e();\n lazy[i]=id();\n }\n }\n\n S prod(int l,int r,int a,int b,int u){\n if(b<=l || r<=a)return e();\n if(l<=a && b<=r){\n return dat[u];\n }\n int m=(a+b)/2;\n S L=mapping(lazy[u],prod(l,r,a,m,u*2));\n S R=mapping(lazy[u],prod(l,r,m,b,u*2+1));\n return op(L,R);\n }\n S prod(int l,int r){\n return prod(l,r,1,siz+1,1);\n }\n S all_prod(){\n return prod(1,siz+1,1,siz+1,1);\n }\n S get(int p){\n return prod(p,p+1,1,siz+1,1);\n }\n void apply(int l,int r,int a,int b,int u,F f){\n if(b<=l || r<=a) return;\n if(l<=a && b<=r){\n lazy[u]=composition(f,lazy[u]);\n dat[u]=mapping(f,dat[u]);\n return;\n }\n lazy[u*2]=composition(lazy[u],lazy[u*2]);\n lazy[u*2+1]=composition(lazy[u],lazy[u*2+1]);\n dat[u*2]=mapping(lazy[u],dat[u*2]);\n dat[u*2+1]=mapping(lazy[u],dat[u*2+1]);\n lazy[u]=id();\n int m=(a+b)/2;\n apply(l,r,a,m,u*2,f);\n apply(l,r,m,b,u*2+1,f);\n S L=mapping(lazy[u],dat[u*2]);\n S R=mapping(lazy[u],dat[u*2+1]);\n dat[u]=op(L,R);\n return;\n }\n\n void apply(int p,F f){\n apply(p,p+1,1,siz+1,1,f);\n }\n void apply(int l,int r,F f){\n apply(l,r,1,siz+1,1,f);\n }\n void set(int p,S x){\n p=p+siz-1;\n dat[p]=x;\n while(p>=2){\n p/=2;\n dat[p]=op(dat[p*2],dat[p*2+1]);\n }\n return;\n }\n};\nint main(){\n cin.tie(0)->sync_with_stdio(0);\n cout.tie(0);\n cin>>N>>M;\n for(int i=1;i<=N;i++) cin>>a[i];\n for(int i=1;i<=N;i++) cin>>b[i];\n b[0]=0;\n for(int i=1;i<=N;i++) b[i]+=b[i-1];\n lazysegtree seg(N);\n for(int i=1;i<=N;i++){\n S d={a[i],i,i};\n seg.set(i,d);\n }\n for(int z=1;z<=M;z++){\n int query;\n cin>>query;\n if(query==0){\n int x,y,z;\n cin>>x>>y>>z;\n ll cnt=y-x;\n seg.apply(x,x+z,cnt);\n }\n if(query==1){\n int p,q;\n cin>>p>>q;\n cout<<seg.prod(p,q+1).value<<\"\\n\";\n }\n }\n}", "accuracy": 1, "time_ms": 160, "memory_kb": 22900, "score_of_the_acc": -0.9011, "final_rank": 9 }, { "submission_id": "aoj_0437_10868672", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ld=long double;\n#define fi first\n#define se second\n#define i128 __int128_t\n#define all(x) x.begin(),x.end()\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define si(a) (long)(a.size())\ntemplate<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}\ntemplate<typename T>bool chmax(T&a,T b){return b>a?(a=b,1):0;}\nconst int INF=1e9+100;\nconst long INFL=3e18+100;\nstruct _ {\n _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }\n} __;\n\n\nusing U = uint64_t;\ntemplate<class S, S (*op)(S, S), S (*e)(), class F, S (*mpp)(F, S), F (*cmpo)(F, F), F (*id)()> struct lazy_segtree {\n lazy_segtree() : lazy_segtree(0) {}\n explicit lazy_segtree(int n) : lazy_segtree(vector<S>(n, e())) {}\n explicit lazy_segtree(const vector<S>& v) : n(si(v)) {\n s = __bit_ceil(U(n));\n log = __countr_zero(U(s));\n d = vector<S>(2 * s, e());\n lz = vector<F>(s, id());\n rep(i, n) d[s + i] = v[i];\n for(int i=s; --i;) update(i);\n }\n void set(int p, S x) {\n p += s;\n PUSH(p);\n d[p] = x;\n for(int i=1;i<=log;i++) update(p >> i);\n }\n S get(int p) {\n p += s;\n PUSH(p);\n return d[p];\n }\n S prod(int l, int r) {\n if(l == r) return e();\n l += s, r += s;\n for(int i=log+1;--i;) {\n if(((l >> i) << i) != l) push(l >> i);\n if(((r >> i) << i) != r) push((r - 1) >> i);\n }\n S sml = e(), smr = e();\n while(l < r) {\n if(l & 1) sml = op(sml, d[l++]);\n if(r & 1) smr = op(d[--r], smr);\n l >>= 1, r >>= 1;\n }\n return op(sml, smr);\n }\n S all_prod() {\n return d[1];\n }\n void apply(int p, F f) {\n // assert(0 <= p && p < n);\n p += s;\n PUSH(p);\n d[p] = mpp(f, d[p]);\n for(int i=1;i<=log;i++) update(p >> i);\n }\n void apply(int l, int r, F f) {\n // assert(0 <= l && l <= r && r <= _n);\n if(l == r) return;\n l += s, r += s;\n\n for(int i=log+1;--i;) {\n if(((l >> i) << i) != l) push(l >> i);\n if(((r >> i) << i) != r) push((r - 1) >> i);\n }\n int ml = l, mr = r;\n while(l < r) {\n if(l & 1) all_apply(l++, f);\n if(r & 1) all_apply(--r, f);\n l >>= 1, r >>= 1;\n }\n l = ml, r = mr;\n for(int i=1;i<=log;i++) {\n if(((l >> i) << i) != l) update(l >> i);\n if(((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n template<class G> int max_right(int l, G g) {\n assert(g(e()));\n if(l == n) return n;\n l += s;\n PUSH(l);\n S sm = e();\n do {\n while(~l & 1) l >>= 1;\n if(!g(op(sm, d[l]))) {\n while(l < s) {\n push(l);\n l <<= 1;\n if(g(op(sm, d[l]))) {\n sm = op(sm, d[l]);\n l++;\n }\n }\n return l - s;\n }\n sm = op(sm, d[l]);\n l++;\n } while((l & -l) != l);\n return n;\n }\n template<class G> int min_left(int r, G g) {\n assert(g(e()));\n if(r == 0) return 0;\n r += s;\n PUSH(r - 1);\n S sm = e();\n do {\n r--;\n while(r > 1 && r & 1) r >>= 1;\n if(!g(op(d[r], sm))) {\n while(r < s) {\n push(r);\n r = (2 * r + 1);\n if(g(op(d[r], sm))) {\n sm = op(d[r], sm);\n r--;\n }\n }\n return r + 1 - s;\n }\n sm = op(d[r], sm);\n } while((r & -r) != r);\n return 0;\n }\n S operator[](int k) {\n return get(k);\n }\n int len() {\n return n;\n }\n\nprivate:\n int n, s, log;\n vector<S> d;\n vector<F> lz;\n void update(int k) {\n d[k] = op(d[2 * k], d[2 * k + 1]);\n }\n void all_apply(int k, F f) {\n d[k] = mpp(f, d[k]);\n if(k < s) lz[k] = cmpo(f, lz[k]);\n }\n void push(int k) {\n all_apply(2 * k, lz[k]);\n all_apply(2 * k + 1, lz[k]);\n lz[k] = id();\n }\n void PUSH(int k) {\n for(int i=log+1;--i;) push(k >> i);\n }\n};\n\nlong N,M,A[202020],B[202020];\n\n\nstruct S{\n long x;\n int l,r;\n};\nS e(){\n return {0,(int)1e9,-1};\n}\nS op(S l, S r){\n S s=e();\n s.l=min(l.l,r.l);\n s.r=max(l.r,r.r);\n s.x=l.x+r.x;\n return s;\n}\nstruct F{\n int x,y,z;\n};\nS mapping(F f, S s){\n if(f.x==-1) return s;\n int b=f.y+s.l-f.x;\n s.x=B[b+(s.r-s.l)]-B[b];\n return s;\n}\nF composition(F f, F g){\n return (f.x==-1?g:f);\n}\nF id(){\n return {-1,-1,-1};\n}\n\nint main(){\n cin>>N>>M;\n rep(i,N)cin>>A[i];\n rep(i,N)cin>>B[i+1],B[i+1]+=B[i];\n lazy_segtree<S,op,e,F,mapping,composition,id> seg(N);\n rep(i,N) seg.set(i, {A[i], i, i+1});\n while(M--){\n int o;\n cin>>o;\n if(o==0){\n int x,y,z;\n cin>>x>>y>>z;\n x--;y--;\n seg.apply(x,x+z,{x,y,z});\n }\n else{\n int p,q;\n cin>>p>>q;\n p--;\n S s=seg.prod(p,q);\n cout<<s.x<<\"\\n\";\n }\n }\n\n}", "accuracy": 1, "time_ms": 140, "memory_kb": 20892, "score_of_the_acc": -0.8028, "final_rank": 6 }, { "submission_id": "aoj_0437_10835503", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nconstexpr int bs = 300;\nusing ll = long long;\nstruct solver{\n vector<int> a, b;\n solver(vector<int> a_, vector<int> b_){\n a = a_;\n b = b_;\n }\n void q1(int x, int y, int z){\n return;\n for(int i = 0; i < z; i++){\n a[x + i] = b[y + i];\n }\n }\n void q2(int x, int y, ll ans){\n return;\n ll ret = 0;\n for(int i = x; i < y; i++) ret += a[i];\n if(ret != ans){\n cerr << x << \" \" << y << \" \" << ans << \" \" << ret << '\\n';\n }\n }\n};\nint main(){\n int n, q;\n cin >> n >> q;\n vector<int> a(n + bs), b(n + bs);\n for(int i = 0; i < n; i++) cin >> a[i];\n for(int i = 0; i < n; i++) cin >> b[i];\n vector<ll> asub(n / bs + 1);\n vector<int> aind(n / bs + 1, -1);\n for(int i = 0; i < n; i++) asub[i / bs] += a[i];\n vector<ll> bsum(n + 1);\n for(int i = 0; i < n; i++) bsum[i + 1] = bsum[i] + b[i];\n solver s(a, b);\n while(q--){\n int t;\n cin >> t;\n if(t == 0){\n int x, y, z;\n cin >> x >> y >> z;\n x--, y--;\n if(x % bs != 0){\n asub[x / bs] = 0;\n }\n if((x + z) % bs != 0){\n asub[(x + z) / bs] = 0;\n }\n for(int i = x; i < x + z;){\n if(i % bs == 0 && i + bs <= x + z){\n aind[i / bs] = y + (i - x);\n asub[i / bs] = bsum[y + i - x + bs] - bsum[y + i - x];\n i += bs;\n }else{\n a[i] = b[y + i - x];\n asub[i / bs] += a[i];\n i++;\n }\n }\n int u2 = -1;\n if(x % bs != 0){\n int u1 = aind[x / bs];\n u2 = u1;\n aind[x / bs] = -1;\n for(int i = x / bs * bs; i < x; i++){\n if(u1 != -1){\n a[i] = b[u1 + i - x / bs * bs];\n }\n asub[i / bs] += a[i];\n }\n }\n if((x + z) % bs != 0){\n int u1 = aind[(x + z) / bs];\n if((x + z) / bs == x / bs) u1 = max(u1, u2);\n aind[(x + z) / bs] = -1;\n //cerr << u1 << endl;\n for(int i = x + z; i < ((x + z) / bs + 1) * bs; i++){\n if(u1 != -1){\n a[i] = b[u1 + i % bs];\n }\n //cerr << a[i] << \" \";\n asub[i / bs] += a[i];\n }\n //cerr << endl;\n }\n s.q1(x, y, z);\n }else{\n int x, y;\n cin >> x >> y;\n x--;\n ll ans = 0;\n for(int i = x; i < y;){\n if(i % bs == 0 && i + bs <= y){\n ans += asub[i / bs];\n i += bs;\n }else{\n if(aind[i / bs] != -1) a[i] = b[aind[i / bs] + i % bs];\n ans += a[i];\n i++;\n }\n }\n cout << ans << '\\n';\n s.q2(x, y, ans);\n }\n }\n}", "accuracy": 1, "time_ms": 640, "memory_kb": 9416, "score_of_the_acc": -0.9312, "final_rank": 10 }, { "submission_id": "aoj_0437_10835492", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nconstexpr int bs = 499;\nusing ll = long long;\nstruct solver{\n vector<int> a, b;\n solver(vector<int> a_, vector<int> b_){\n a = a_;\n b = b_;\n }\n void q1(int x, int y, int z){\n return;\n for(int i = 0; i < z; i++){\n a[x + i] = b[y + i];\n }\n }\n void q2(int x, int y, ll ans){\n return;\n ll ret = 0;\n for(int i = x; i < y; i++) ret += a[i];\n if(ret != ans){\n cerr << x << \" \" << y << \" \" << ans << \" \" << ret << '\\n';\n }\n }\n};\nint main(){\n int n, q;\n cin >> n >> q;\n vector<int> a(n + bs), b(n + bs);\n for(int i = 0; i < n; i++) cin >> a[i];\n for(int i = 0; i < n; i++) cin >> b[i];\n vector<ll> asub(n / bs + 1);\n vector<int> aind(n / bs + 1, -1);\n for(int i = 0; i < n; i++) asub[i / bs] += a[i];\n vector<ll> bsum(n + 1);\n for(int i = 0; i < n; i++) bsum[i + 1] = bsum[i] + b[i];\n solver s(a, b);\n while(q--){\n int t;\n cin >> t;\n if(t == 0){\n int x, y, z;\n cin >> x >> y >> z;\n x--, y--;\n if(x % bs != 0){\n asub[x / bs] = 0;\n }\n if((x + z) % bs != 0){\n asub[(x + z) / bs] = 0;\n }\n for(int i = x; i < x + z;){\n if(i % bs == 0 && i + bs <= x + z){\n aind[i / bs] = y + (i - x);\n asub[i / bs] = bsum[y + i - x + bs] - bsum[y + i - x];\n i += bs;\n }else{\n a[i] = b[y + i - x];\n asub[i / bs] += a[i];\n i++;\n }\n }\n int u2 = -1;\n if(x % bs != 0){\n int u1 = aind[x / bs];\n u2 = u1;\n aind[x / bs] = -1;\n for(int i = x / bs * bs; i < x; i++){\n if(u1 != -1){\n a[i] = b[u1 + i - x / bs * bs];\n }\n asub[i / bs] += a[i];\n }\n }\n if((x + z) % bs != 0){\n int u1 = aind[(x + z) / bs];\n //cerr << u1 << endl;\n if((x + z) / bs == x / bs) u1 = u2;\n aind[(x + z) / bs] = -1;\n //cerr << u1 << endl;\n for(int i = x + z; i < ((x + z) / bs + 1) * bs; i++){\n if(u1 != -1){\n a[i] = b[u1 + i % bs];\n }\n //cerr << a[i] << \" \";\n asub[i / bs] += a[i];\n }\n //cerr << endl;\n }\n s.q1(x, y, z);\n }else{\n int x, y;\n cin >> x >> y;\n x--;\n ll ans = 0;\n for(int i = x; i < y;){\n if(i % bs == 0 && i + bs <= y){\n ans += asub[i / bs];\n i += bs;\n }else{\n if(aind[i / bs] != -1) a[i] = b[aind[i / bs] + i % bs];\n ans += a[i];\n i++;\n }\n }\n cout << ans << '\\n';\n s.q2(x, y, ans);\n }\n }\n}", "accuracy": 0.7692307692307693, "time_ms": 510, "memory_kb": 9236, "score_of_the_acc": -0.7783, "final_rank": 17 }, { "submission_id": "aoj_0437_10835455", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nconstexpr int bs = 500;\nusing ll = long long;\nstruct solver{\n vector<int> a, b;\n solver(vector<int> a_, vector<int> b_){\n a = a_;\n b = b_;\n }\n void q1(int x, int y, int z){\n return;\n for(int i = 0; i < z; i++){\n a[x + i] = b[y + i];\n }\n }\n void q2(int x, int y, ll ans){\n return;\n ll ret = 0;\n for(int i = x; i < y; i++) ret += a[i];\n if(ret != ans){\n cerr << x << \" \" << y << \" \" << ans << \" \" << ret << '\\n';\n }\n }\n};\nint main(){\n int n, q;\n cin >> n >> q;\n vector<int> a(n + bs), b(n + bs);\n for(int i = 0; i < n; i++) cin >> a[i];\n for(int i = 0; i < n; i++) cin >> b[i];\n vector<ll> asub(n / bs + 1);\n vector<int> aind(n / bs + 1, -1);\n for(int i = 0; i < n; i++) asub[i / bs] += a[i];\n vector<ll> bsum(n + 1);\n for(int i = 0; i < n; i++) bsum[i + 1] = bsum[i] + b[i];\n solver s(a, b);\n while(q--){\n int t;\n cin >> t;\n if(t == 0){\n int x, y, z;\n cin >> x >> y >> z;\n x--, y--;\n if(x % bs != 0){\n asub[x / bs] = 0;\n }\n if((x + z) % bs != 0){\n asub[(x + z) / bs] = 0;\n }\n for(int i = x; i < x + z;){\n if(i % bs == 0 && i + bs <= x + z){\n aind[i / bs] = y + (i - x);\n asub[i / bs] = bsum[y + i - x + bs] - bsum[y + i - x];\n i += bs;\n }else{\n a[i] = b[y + i - x];\n asub[i / bs] += a[i];\n i++;\n }\n }\n if(x % bs != 0){\n int u1 = aind[x / bs];\n aind[x / bs] = -1;\n for(int i = x / bs * bs; i < x; i++){\n if(u1 != -1){\n a[i] = b[u1 + i - x / bs * bs];\n }\n asub[i / bs] += a[i];\n }\n }\n if((x + z) % bs != 0){\n int u1 = aind[(x + z) / bs];\n aind[(x + z) / bs] = -1;\n for(int i = x + z; i < ((x + z) / bs + 1) * bs; i++){\n if(u1 != -1){\n a[i] = b[u1 + i - (x + z)];\n }\n asub[i / bs] += a[i];\n }\n }\n s.q1(x, y, z);\n }else{\n int x, y;\n cin >> x >> y;\n x--;\n ll ans = 0;\n for(int i = x; i < y;){\n if(i % bs == 0 && i + bs <= y){\n ans += asub[i / bs];\n i += bs;\n }else{\n if(aind[i / bs] != -1) a[i] = b[aind[i / bs] + i % bs];\n ans += a[i];\n i++;\n }\n }\n cout << ans << '\\n';\n s.q2(x, y, ans);\n }\n }\n}", "accuracy": 0.7692307692307693, "time_ms": 530, "memory_kb": 9308, "score_of_the_acc": -0.8035, "final_rank": 18 }, { "submission_id": "aoj_0437_10835452", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nconstexpr int bs = 700;\nusing ll = long long;\nstruct solver{\n vector<int> a, b;\n solver(vector<int> a_, vector<int> b_){\n a = a_;\n b = b_;\n }\n void q1(int x, int y, int z){\n return;\n for(int i = 0; i < z; i++){\n a[x + i] = b[y + i];\n }\n }\n void q2(int x, int y, ll ans){\n return;\n ll ret = 0;\n for(int i = x; i < y; i++) ret += a[i];\n if(ret != ans){\n cerr << x << \" \" << y << \" \" << ans << \" \" << ret << '\\n';\n }\n }\n};\nint main(){\n int n, q;\n cin >> n >> q;\n vector<int> a(n + bs), b(n + bs);\n for(int i = 0; i < n; i++) cin >> a[i];\n for(int i = 0; i < n; i++) cin >> b[i];\n vector<ll> asub(n / bs + 1);\n vector<int> aind(n / bs + 1, -1);\n for(int i = 0; i < n; i++) asub[i / bs] += a[i];\n vector<ll> bsum(n + 1);\n for(int i = 0; i < n; i++) bsum[i + 1] = bsum[i] + b[i];\n solver s(a, b);\n while(q--){\n int t;\n cin >> t;\n if(t == 0){\n int x, y, z;\n cin >> x >> y >> z;\n x--, y--;\n if(x % bs != 0){\n asub[x / bs] = 0;\n }\n if((x + z) % bs != 0){\n asub[(x + z) / bs] = 0;\n }\n for(int i = x; i < x + z;){\n if(i % bs == 0 && i + bs <= x + z){\n aind[i / bs] = y - (i - x);\n asub[i / bs] = bsum[y + i - x + bs] - bsum[y + i - x];\n i += bs;\n }else{\n a[i] = b[y + i - x];\n asub[i / bs] += a[i];\n i++;\n }\n }\n if(x % bs != 0){\n int u1 = aind[x / bs];\n aind[x / bs] = -1;\n for(int i = x / bs * bs; i < x; i++){\n if(u1 != -1){\n a[i] = b[u1 + i - x / bs * bs];\n }\n asub[i / bs] += a[i];\n }\n }\n if((x + z) % bs != 0){\n int u1 = aind[(x + z) / bs];\n aind[(x + z) / bs] = -1;\n for(int i = x + z; i < ((x + z) / bs + 1) * bs; i++){\n if(u1 != -1){\n a[i] = b[u1 + i - (x + z)];\n }\n asub[i / bs] += a[i];\n }\n }\n s.q1(x, y, z);\n }else{\n int x, y;\n cin >> x >> y;\n x--;\n ll ans = 0;\n for(int i = x; i < y;){\n if(i % bs == 0 && i + bs <= y){\n ans += asub[i / bs];\n i += bs;\n }else{\n if(aind[i / bs] != -1) a[i] = b[aind[i / bs] + i % bs];\n ans += a[i];\n i++;\n }\n }\n cout << ans << '\\n';\n s.q2(x, y, ans);\n }\n }\n}", "accuracy": 0.7692307692307693, "time_ms": 10, "memory_kb": 3504, "score_of_the_acc": 0, "final_rank": 16 }, { "submission_id": "aoj_0437_10835449", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nconstexpr int bs = 700;\nusing ll = long long;\nstruct solver{\n vector<int> a, b;\n solver(vector<int> a_, vector<int> b_){\n a = a_;\n b = b_;\n }\n void q1(int x, int y, int z){\n return;\n for(int i = 0; i < z; i++){\n a[x + i] = b[y + i];\n }\n }\n void q2(int x, int y, ll ans){\n return;\n ll ret = 0;\n for(int i = x; i < y; i++) ret += a[i];\n if(ret != ans){\n cerr << x << \" \" << y << \" \" << ans << \" \" << ret << '\\n';\n }\n }\n};\nint main(){\n int n, q;\n cin >> n >> q;\n vector<int> a(n + bs), b(n + bs);\n for(int i = 0; i < n; i++) cin >> a[i];\n for(int i = 0; i < n; i++) cin >> b[i];\n vector<ll> asub(n / bs + 1);\n vector<int> aind(n / bs + 1, -1);\n for(int i = 0; i < n; i++) asub[i / bs] += a[i];\n vector<ll> bsum(n + 1);\n for(int i = 0; i < n; i++) bsum[i + 1] = bsum[i] + b[i];\n solver s(a, b);\n while(q--){\n int t;\n cin >> t;\n if(t == 0){\n int x, y, z;\n cin >> x >> y >> z;\n x--, y--;\n if(x % bs != 0){\n asub[x / bs] = 0;\n }\n if((x + z) % bs != 0){\n asub[(x + z) / bs] = 0;\n }\n for(int i = x; i < x + z;){\n if(i % bs == 0 && i + bs <= x + z){\n aind[i / bs] = y;\n asub[i / bs] = bsum[y + i - x + bs] - bsum[y + i - x];\n i += bs;\n }else{\n a[i] = b[y + i - x];\n asub[i / bs] += a[i];\n i++;\n }\n }\n if(x % bs != 0){\n int u1 = aind[x / bs];\n aind[x / bs] = -1;\n for(int i = x / bs * bs; i < x; i++){\n if(u1 != -1){\n a[i] = b[u1 + i - x / bs * bs];\n }\n asub[i / bs] += a[i];\n }\n }\n if((x + z) % bs != 0){\n int u1 = aind[(x + z) / bs];\n aind[(x + z) / bs] = -1;\n for(int i = x + z; i < ((x + z) / bs + 1) * bs; i++){\n if(u1 != -1){\n a[i] = b[u1 + i - (x + z)];\n }\n asub[i / bs] += a[i];\n }\n }\n s.q1(x, y, z);\n }else{\n int x, y;\n cin >> x >> y;\n x--;\n ll ans = 0;\n for(int i = x; i < y;){\n if(i % bs == 0 && i + bs <= y){\n ans += asub[i / bs];\n i += bs;\n }else{\n if(aind[i / bs] != -1) a[i] = b[aind[i / bs] + i % bs];\n ans += a[i];\n i++;\n }\n }\n cout << ans << '\\n';\n s.q2(x, y, ans);\n }\n }\n}", "accuracy": 0.7692307692307693, "time_ms": 630, "memory_kb": 9276, "score_of_the_acc": -0.9146, "final_rank": 20 }, { "submission_id": "aoj_0437_10804829", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug.hpp>\n#else\n#define debug(...)\n#endif\n\ntemplate <class S, class T>\nstruct Intervals {\n static constexpr S INF = numeric_limits<S>::max() / 2;\n static constexpr S L = -INF, R = INF;\n T none_val;\n int total_num; // none_val でない区間の個数\n S total_len; // none_val でない区間の長さの合計\n map<S, T> data;\n\n // コンストラクタ：全体 [L, R) を none_val に初期化\n Intervals(T nv = -1) : none_val(nv), total_num(0), total_len(0) {\n data.emplace(L, none_val);\n data.emplace(R, none_val);\n }\n\n // 区間 [l, r) の値を v に設定\n void set(S l, S r, T v) {\n assert(L <= l && r < R);\n if (l >= r) return;\n auto it_l = split(l), it_r = split(r);\n // [l, r) に含まれる既存の区間をすべて削除\n for (auto it = it_l; it != it_r;) {\n if (it->second != none_val) {\n S seg_l = it->first, seg_r = next(it)->first;\n total_len -= (seg_r - seg_l);\n total_num--;\n }\n it = data.erase(it);\n }\n // 新たに [l, r) を挿入\n auto it = data.emplace(l, v).first;\n if (v != none_val) {\n total_len += (r - l);\n total_num++;\n }\n // 左側との結合\n if (it != data.begin()) {\n auto it_prev = prev(it);\n if (it_prev->second == v) {\n data.erase(it);\n total_num--;\n l = it_prev->first;\n it = it_prev;\n }\n }\n // 右側との結合\n auto it_next = next(it);\n if (it_next != data.end() && it_next->second == v) {\n data.erase(it_next);\n total_num--;\n }\n }\n\n // 点 i が含まれる [i, i + 1) の値を返す\n T get_value(S i) {\n assert(L <= i && i < R);\n auto it = prev(data.upper_bound(i));\n return it->second;\n }\n\n // 点 i が含まれる区間 [l, r) とその値 v を返す\n tuple<S, S, T> get(S i) {\n assert(L <= i && i < R);\n auto it_r = data.upper_bound(i), it_l = prev(it_r);\n return make_tuple(it_l->first, it_r->first, it_l->second);\n }\n\n // 区間 [l, r) 内の区間を（境界ごとに分割した） run-length 圧縮結果として返す\n vector<tuple<S, S, T>> get(S l, S r) {\n assert(L <= l && r < R);\n vector<tuple<S, S, T>> res;\n if (l >= r) return res;\n auto it_r = data.upper_bound(l), it_l = prev(it_r);\n while (it_l->first < r) {\n res.emplace_back(max(l, it_l->first), min(it_r->first, r), it_l->second);\n it_l = it_r++;\n }\n return res;\n }\n\n private:\n // 点 pos において区間を分割し，すでに境界があればその位置のイテレータを返す\n // そうでなければ，その区間 [l, r) を [l, pos) と [pos, r) に分割し，後者の先頭を返す\n typename map<S, T>::iterator split(S pos) {\n auto it = data.lower_bound(pos);\n if (it != data.end() && it->first == pos) return it;\n T v = prev(it)->second;\n auto res = data.emplace(pos, v).first;\n if (v != none_val) total_num++;\n return res;\n }\n};\n\ntemplate <class T>\nstruct BinaryIndexedTree {\n int N;\n vector<T> data;\n\n BinaryIndexedTree() = default;\n BinaryIndexedTree(int size) : N(size), data(size + 1, 0) {}\n BinaryIndexedTree(const vector<T>& v) : N(ssize(v)), data(N + 1) {\n for (int i = 1; i <= N; i++) {\n data[i] += v[i - 1];\n int j = i + (i & -i);\n if (j <= N) data[j] += data[i];\n }\n }\n // i 番目に x を加算\n void add(int i, T x) {\n assert(0 <= i && i < N);\n for (++i; i <= N; i += i & -i) data[i] += x;\n }\n // [l, r) に x を加算 (imos 法)\n void imos(int l, int r, T x) { add(l, x), add(r, -x); }\n // [0, i) の和 (imos 法で区間加算して i 番目の値を取るときは sum(i + 1))\n T sum(int i) const {\n if (i < 0) return T{};\n T res{};\n for (; i > 0; i -= i & -i) res += data[i];\n return res;\n }\n // [l, r) の和\n T sum(int l, int r) const { return sum(r) - sum(l); }\n // i 番目の値\n T operator[](int i) const { return sum(i + 1) - sum(i); }\n // [0, i) の和が w 以上となる最小の i\n int lower_bound(T w) const {\n if (w <= 0) return 0;\n int i = 0;\n for (int k = 1 << __lg(N); k > 0; k >>= 1) {\n if (i + k <= N && data[i + k] < w) {\n w -= data[i + k];\n i += k;\n }\n }\n return i + 1;\n }\n};\n\nconstexpr int INF = (1 << 30) - 1;\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N, M;\n cin >> N >> M;\n vector<ll> a(N), b(N);\n for (int i = 0; i < N; i++) cin >> a[i];\n for (int i = 0; i < N; i++) cin >> b[i];\n\n BinaryIndexedTree<ll> bit1(a), bit2(b);\n Intervals<int, int> I(INF);\n while (M--) {\n int t;\n cin >> t;\n if (t == 0) {\n int x, y, z;\n cin >> x >> y >> z, x--, y--;\n // [x, x + z) を b の [y, y + z) に置き換える\n I.set(x, x + z, y - x);\n }\n if (t == 1) {\n int p, q;\n cin >> p >> q, p--;\n ll ans = 0;\n for (auto [l, r, v] : I.get(p, q)) {\n if (v == INF) {\n ans += bit1.sum(l, r);\n } else {\n ans += bit2.sum(l + v, r + v);\n }\n }\n cout << ans << '\\n';\n }\n }\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 9600, "score_of_the_acc": -0.3089, "final_rank": 1 }, { "submission_id": "aoj_0437_10804805", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug.hpp>\n#else\n#define debug(...)\n#endif\n\ntemplate <class T, T (*op)(T, T), T (*e)(), class F, T (*mapp)(F, T), F (*comp)(F, F), F (*id)()>\nclass LazySegmentTree {\n int n, len, height;\n vector<T> data;\n vector<F> lazy;\n constexpr void update(int k) noexcept { data[k] = op(data[k << 1 | 0], data[k << 1 | 1]); }\n constexpr void push(int k) noexcept {\n if (lazy[k] == id()) return;\n all_apply(k << 1 | 0, lazy[k]);\n // 書き換え\n all_apply(k << 1 | 1, lazy[k] + data[k << 1].second);\n lazy[k] = id();\n }\n constexpr void all_apply(int k, F f) noexcept {\n data[k] = mapp(f, data[k]);\n if (k < len) lazy[k] = comp(f, lazy[k]);\n }\n\n public:\n LazySegmentTree() = default;\n LazySegmentTree(int size) : LazySegmentTree(vector<T>(size, e())) {}\n LazySegmentTree(const vector<T> &v) : n(int(v.size())) {\n len = 1, height = 0;\n while (len < n) len <<= 1, height++;\n data.assign(len << 1, e());\n lazy.assign(len << 1, id());\n for (int i = 0; i < n; i++) data[i + len] = v[i];\n for (int i = len - 1; i > 0; i--) update(i);\n }\n void set(int i, T x) {\n i += len;\n for (int j = height; j > 0; j--) push(i >> j);\n data[i] = x;\n while (i >>= 1) update(i);\n // for (int j = 1; j <= height; j++) update(i >> j);\n }\n T get(int i) {\n i += len;\n for (int j = height; j > 0; j--) push(i >> j);\n return data[i];\n }\n T operator[](int i) { return get(i); }\n T prod(int l, int r) {\n if (l >= r) return e();\n l += len, r += len;\n const int l_ctz = __builtin_ctz(l), r_ctz = __builtin_ctz(r);\n for (int i = height; i > l_ctz; i--) push(l >> i);\n for (int i = height; i > r_ctz; i--) push((r - 1) >> i);\n T resl = e(), resr = e();\n while (l < r) {\n if (l & 1) resl = op(resl, data[l++]);\n if (r & 1) resr = op(data[--r], resr);\n l >>= 1, r >>= 1;\n }\n return op(resl, resr);\n }\n T all_prod() const { return data[1]; }\n void update(int l, int r, F f) {\n if (l >= r) return;\n l += len, r += len;\n const int l_ctz = __builtin_ctz(l), r_ctz = __builtin_ctz(r);\n for (int i = height; i > l_ctz; i--) push(l >> i);\n for (int i = height; i > r_ctz; i--) push((r - 1) >> i);\n {\n const int l2 = l, r2 = r;\n // lf, rf を追加し、書き換え\n F lf = f, rf = f + r - l;\n while (l < r) {\n if (l & 1) all_apply(l++, lf), lf += data[l].second;\n if (r & 1) rf -= data[r - 1].second, all_apply(--r, rf);\n l >>= 1, r >>= 1;\n }\n // l = l2, r = r2;\n l = l2 >> l_ctz, r = (r2 - 1) >> r_ctz;\n }\n while (l >>= 1) update(l);\n while (r >>= 1) update(r);\n // for (int i = l_ctz + 1; i <= height; i++) update(l >> i);\n // for (int i = r_ctz + 1; i <= height; i++) update((r - 1) >> i);\n }\n // check(A[l] * ... * A[r - 1]) = true となる最大の r\n template <class C>\n int max_right(int l, const C &check) {\n assert(0 <= l && l <= n && check(e()));\n if (l == n) return n;\n l += len;\n for (int i = height; i > 0; i--) push(l >> i);\n T sum = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!check(op(sum, data[l]))) {\n while (l < len) {\n push(l);\n l = l << 1 | 0;\n if (check(op(sum, data[l]))) {\n sum = op(sum, data[l++]);\n }\n }\n return l - len;\n }\n sum = op(sum, data[l++]);\n } while ((l & -l) != l);\n return n;\n }\n\n // check(A[l] * ... * A[r - 1]) = true となる最小の l\n template <class C>\n int min_left(int r, const C &check) {\n assert(0 <= r && r <= n && check(e()));\n if (r == 0) return 0;\n r += len;\n for (int i = height; i > 0; i--) push((r - 1) >> i);\n T sum = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!check(op(data[r], sum))) {\n while (r < len) {\n push(r);\n r = r << 1 | 1;\n if (check(op(data[r], sum))) {\n sum = op(data[r--], sum);\n }\n }\n return r + 1 - len;\n }\n sum = op(data[r], sum);\n } while ((r & -r) != r);\n return 0;\n }\n};\n\n// B の累積和\nconstexpr int N2 = 200001;\narray<ll, N2> acc;\n\n// 範囲 copy, 区間和取得\nusing S = pair<ll, int>;\nS op(S a, S b) { return {a.first + b.first, a.second + b.second}; }\nS e() { return {0, 0}; }\nusing F = int; // B の copy の index\nF id() { return N2; }\nS mapp(F f, S x) {\n if (f >= id()) return x;\n return {acc[f + x.second] - acc[f], x.second};\n}\nF comp(F f, F g) { return f >= id() ? g : f; }\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N, M;\n cin >> N >> M;\n vector<ll> a(N), b(N);\n for (int i = 0; i < N; i++) cin >> a[i];\n for (int i = 0; i < N; i++) cin >> b[i];\n\n for (int i = 0; i < N; i++) acc[i + 1] = acc[i] + b[i];\n for (int i = N; i < N2; i++) acc[i + 1] = acc[i];\n\n vector<S> init(N);\n for (int i = 0; i < N; i++) init[i] = {a[i], 1};\n LazySegmentTree<S, op, e, F, mapp, comp, id> seg(init);\n\n while (M--) {\n int t;\n cin >> t;\n if (t == 0) {\n int x, y, z;\n cin >> x >> y >> z, x--, y--;\n // [x, x + z) を b の [y, y + z) に置き換える\n seg.update(x, x + z, y);\n }\n if (t == 1) {\n int p, q;\n cin >> p >> q, p--;\n cout << seg.prod(p, q).first << '\\n';\n }\n for (int i = 0; i < N; i++) {\n debug(i, seg[i].first);\n }\n }\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 21472, "score_of_the_acc": -0.7685, "final_rank": 4 }, { "submission_id": "aoj_0437_10804684", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug.hpp>\n#else\n#define debug(...)\n#endif\n\ntemplate <class S, class T>\nstruct Intervals {\n static constexpr S INF = numeric_limits<S>::max() / 2;\n static constexpr S L = -INF, R = INF;\n T none_val;\n int total_num; // none_val でない区間の個数\n S total_len; // none_val でない区間の長さの合計\n map<S, T> data;\n\n // コンストラクタ：全体 [L, R) を none_val に初期化\n Intervals(T nv = -1) : none_val(nv), total_num(0), total_len(0) {\n data.emplace(L, none_val);\n data.emplace(R, none_val);\n }\n\n // 区間 [l, r) の値を v に設定\n void set(S l, S r, T v) {\n assert(L <= l && r < R);\n if (l >= r) return;\n auto it_l = split(l), it_r = split(r);\n // [l, r) に含まれる既存の区間をすべて削除\n for (auto it = it_l; it != it_r;) {\n if (it->second != none_val) {\n S seg_l = it->first, seg_r = next(it)->first;\n total_len -= (seg_r - seg_l);\n total_num--;\n }\n it = data.erase(it);\n }\n // 新たに [l, r) を挿入\n auto it = data.emplace(l, v).first;\n if (v != none_val) {\n total_len += (r - l);\n total_num++;\n }\n // 左側との結合\n if (it != data.begin()) {\n auto it_prev = prev(it);\n if (it_prev->second == v) {\n data.erase(it);\n total_num--;\n l = it_prev->first;\n it = it_prev;\n }\n }\n // 右側との結合\n auto it_next = next(it);\n if (it_next != data.end() && it_next->second == v) {\n data.erase(it_next);\n total_num--;\n }\n }\n\n // 点 i が含まれる [i, i + 1) の値を返す\n T get_value(S i) {\n assert(L <= i && i < R);\n auto it = prev(data.upper_bound(i));\n return it->second;\n }\n\n // 点 i が含まれる区間 [l, r) とその値 v を返す\n tuple<S, S, T> get(S i) {\n assert(L <= i && i < R);\n auto it_r = data.upper_bound(i), it_l = prev(it_r);\n return make_tuple(it_l->first, it_r->first, it_l->second);\n }\n\n // 区間 [l, r) 内の区間を（境界ごとに分割した） run-length 圧縮結果として返す\n vector<tuple<S, S, T>> get(S l, S r) {\n assert(L <= l && r < R);\n vector<tuple<S, S, T>> res;\n if (l >= r) return res;\n auto it_r = data.upper_bound(l), it_l = prev(it_r);\n while (it_l->first < r) {\n res.emplace_back(max(l, it_l->first), min(it_r->first, r), it_l->second);\n it_l = it_r++;\n }\n return res;\n }\n\n private:\n // 点 pos において区間を分割し，すでに境界があればその位置のイテレータを返す\n // そうでなければ，その区間 [l, r) を [l, pos) と [pos, r) に分割し，後者の先頭を返す\n typename map<S, T>::iterator split(S pos) {\n auto it = data.lower_bound(pos);\n if (it != data.end() && it->first == pos) return it;\n T v = prev(it)->second;\n auto res = data.emplace(pos, v).first;\n if (v != none_val) total_num++;\n return res;\n }\n};\n\ntemplate <class T>\nstruct BinaryIndexedTree {\n int N;\n vector<T> data;\n\n BinaryIndexedTree() = default;\n BinaryIndexedTree(int size) : N(size), data(size + 1, 0) {}\n BinaryIndexedTree(const vector<T>& v) : N(ssize(v)), data(N + 1) {\n for (int i = 1; i <= N; i++) {\n data[i] += v[i - 1];\n int j = i + (i & -i);\n if (j <= N) data[j] += data[i];\n }\n }\n // i 番目に x を加算\n void add(int i, T x) {\n assert(0 <= i && i < N);\n for (++i; i <= N; i += i & -i) data[i] += x;\n }\n // [l, r) に x を加算 (imos 法)\n void imos(int l, int r, T x) { add(l, x), add(r, -x); }\n // [0, i) の和 (imos 法で区間加算して i 番目の値を取るときは sum(i + 1))\n T sum(int i) const {\n if (i < 0) return T{};\n T res{};\n for (; i > 0; i -= i & -i) res += data[i];\n return res;\n }\n // [l, r) の和\n T sum(int l, int r) const { return sum(r) - sum(l); }\n // i 番目の値\n T operator[](int i) const { return sum(i + 1) - sum(i); }\n // [0, i) の和が w 以上となる最小の i\n int lower_bound(T w) const {\n if (w <= 0) return 0;\n int i = 0;\n for (int k = 1 << __lg(N); k > 0; k >>= 1) {\n if (i + k <= N && data[i + k] < w) {\n w -= data[i + k];\n i += k;\n }\n }\n return i + 1;\n }\n};\n\nconstexpr int INF = (1 << 30) - 1;\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N, M;\n cin >> N >> M;\n vector<ll> a(N), b(N);\n for (int i = 0; i < N; i++) cin >> a[i];\n for (int i = 0; i < N; i++) cin >> b[i];\n\n BinaryIndexedTree<ll> bit1(a), bit2(b);\n Intervals<int, int> I(INF);\n while (M--) {\n int t;\n cin >> t;\n if (t == 0) {\n int x, y, z;\n cin >> x >> y >> z, x--, y--;\n // [x, x + z) を b の [y, y + z) に置き換える\n I.set(x, x + z, y - x);\n }\n if (t == 1) {\n int p, q;\n cin >> p >> q, p--;\n ll ans = 0;\n for (auto [l, r, v] : I.get(p, q)) {\n if (v == INF) {\n ans += bit1.sum(l, r);\n } else {\n ans += bit2.sum(l + v, r + v);\n }\n }\n cout << ans << '\\n';\n }\n }\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 9600, "score_of_the_acc": -0.3089, "final_rank": 1 }, { "submission_id": "aoj_0437_10779335", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep2(i, n) for (ll i = 0 ; i < (n) ; i++)\n#define rep3(i, a, b) for (ll i = a ; i < (b) ; i++)\n#define overload(a, b, c, d, ...) d\n#define rep(...) overload(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)\n#define all(a) begin(a), end(a)\n#define sz(a) ssize(a)\n\ntemplate <class S, auto op, auto e, class F, auto mapping, auto composition, auto id> struct LazySegmentTree {\n int n, logn;\n vector<S> dat;\n vector<pair<int, int>> lr;\n vector<F> lazy;\n LazySegmentTree(int n) : LazySegmentTree(vector<S>(n, e())) {}\n LazySegmentTree(const vector<S>& init) {\n n = 1, logn = 0;\n while (n < sz(init)) {\n n <<= 1;\n logn++;\n }\n dat.resize(n * 2, e());\n lazy.resize(n * 2, id());\n lr.resize(n * 2);\n for (int i = 0 ; i < n ; i++) lr[n + i] = {i, i + 1};\n copy(all(init), dat.begin() + n);\n for (int i = n - 1 ; i >= 1 ; i--) {\n update(i);\n lr[i].first = lr[i * 2].first;\n lr[i].second = lr[i * 2 + 1].second;\n }\n }\n void update(int i) { dat[i] = op(dat[i*2], dat[i*2 + 1]); }\n void propagate(int i, F f) {\n dat[i] = mapping(f, dat[i]);\n lazy[i] = composition(f, lazy[i]);\n }\n void push(int i) {\n if (lazy[i] != id()) {\n propagate(i * 2, lazy[i]);\n propagate(i * 2 + 1, lazy[i] + dat[i].cnt / 2);\n lazy[i] = id();\n }\n }\n S prod(int l, int r) {\n l += n, r += n;\n for (int i = logn ; i >= 1 ; i--) {\n push(l >> i);\n push((r - 1) >> i);\n }\n S left = e(), right = e();\n while (l < r) {\n if (l & 1) left = op(left, dat[l++]);\n if (r & 1) right = op(dat[--r], right);\n l >>= 1, r >>= 1;\n }\n return op(left, right);\n }\n void apply(int l, int r, F f) {\n auto ps = [&](int x) {\n int lsb = __builtin_ctz(x);\n for (int i = logn ; i > lsb ; i--) push(x >> i);\n };\n auto upd = [&](int x) {\n int lsb = __builtin_ctz(x);\n x >>= lsb + 1;\n while (x) {\n update(x);\n x >>= 1;\n }\n };\n l += n, r += n;\n ps(l), ps(r);\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) {\n propagate(l, f + lr[l].first - lr[l2].first);\n l++;\n }\n if (r & 1) {\n --r;\n propagate(r, f + lr[r].first - lr[l2].first);\n }\n l >>= 1, r >>= 1;\n }\n upd(l2), upd(r2);\n }\n};\nint N, M, A[2*200020], B[2*200020];\nlong long sumB[2*200020 + 1];\nstruct S {\n long long s = 0; \n int cnt = 0;\n S() = default;\n S(int val) : s{val}, cnt{1} {}\n};\nS op(S l, S r) {\n l.s += r.s;\n l.cnt += r.cnt;\n return l;\n}\nS e() { return S(); }\nusing F = int;\nF composition(F newf, F oldf) {\n if (newf == -1) return oldf;\n else return newf;\n}\nF id() { return -1; }\nS mapping(F f, S s) {\n if (f == -1) return s;\n s.s = sumB[f + s.cnt] - sumB[f];\n return s;\n}\n\nint main() {\n cin.tie(0);\n cout.tie(0);\n ios::sync_with_stdio(0);\n cin >> N >> M;\n for (int i = 0 ; i < N ; i++) cin >> A[i];\n for (int i = 0 ; i < N ; i++) {\n cin >> B[i];\n sumB[i + 1] = sumB[i] + B[i];\n }\n for (int i = N + 1 ; i <= 2 * N + 10 ; i++) sumB[i] = sumB[i - 1];\n LazySegmentTree<S, op, e, F, mapping, composition, id> seg([&]() {\n vector<S> init(N);\n for (int i = 0 ; i < N ; i++) init[i] = S(A[i]);\n return init;\n }());\n while (M--) {\n int t;\n cin >> t;\n if (t == 0) {\n int x, y, z;\n cin >> x >> y >> z;\n x--;\n y--;\n assert(0 <= y and y + z <= N);\n seg.apply(x, x + z, y);\n }\n else if (t == 1) {\n int p, q;\n cin >> p >> q;\n p--;\n cout << seg.prod(p, q).s << '\\n';\n }\n else assert(false);\n }\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 26964, "score_of_the_acc": -0.9872, "final_rank": 11 }, { "submission_id": "aoj_0437_10400332", "code_snippet": "#include <iostream>\n#include <string.h>\n#include <vector>\n#include <set>\nusing namespace std;\n\nstruct E{\n\tlong long int num,no;\n\tbool commit;\n};\nstruct E2{\n\tint l,r,x,y,z;\n};\nconst int maxS=600000;\nint R=262143;\nint no0=0;\nvector<E2> copyData;\nvector<long long int> areaSum;\nE segA[maxS];\n\nlong long int fSegASet(int no,int p1,int l2,int r2,long long int num){\n\tif(r2<p1 || p1<l2)return segA[no].num;\n\tif(l2==r2){\n\t\tsegA[no].num=num;\n\t\treturn segA[no].num;\n\t}\n\tint m=(l2+r2)/2;\n\tlong long int res=fSegASet(no*2+1,p1,l2,m,num);\n\tres+=fSegASet(no*2+2,p1,m+1,r2,num);\n\tsegA[no].num=res;\n\treturn res;\n}\n\nlong long int calc(int no,int no2,int no3,int l,int r,int l2,int r2,bool commit){\n\t//cout<<\"<\"<<commit<<\" \"<<no<<\",no2=\"<<no2<<\",no3=\"<<no3<<\",l=\"<<l<<\",r=\"<<r<<\",\"<<l2<<\",\"<<r2<<\",>\";\n\t\n\tif(commit==true){\n\t\t//cout<<1<<\" \"<<segA[no].num<<endl;\n\t\t\n\t\treturn segA[no].num;\n\t}else{\n\t\tE2 e2=copyData[no2];\n\t\tif(e2.x<=l2 && r2<=e2.x+e2.z){\n\t\t\tint l3=e2.y+(l2-e2.x);\n\t\t\tint r3=l3+(r2-l2)+1;\n\t\t\tlong long int t=areaSum[r3]-areaSum[l3];\n\t\t\treturn t;\n\t\t}\n\t\te2=copyData[no3];\n\t\t//cout<<3<<e2.x<<\" \"<<e2.z<<endl;\n\t\treturn areaSum[e2.x+e2.z]-areaSum[e2.x];\n\t}\n}\n\n\nlong long int fSegACalcAns(int no,int l,int r,int l2,int r2,int no2,bool commit){\n\tcommit=commit && segA[no].commit;\n\tno2=(no2<segA[no].no)?segA[no].no:no2;\n\tsegA[no].commit=commit;\n\tlong long int res=calc(no,no2,no2,l,r,l2,r2,commit);\n\tif(r2<l || r<l2){\n\t\treturn 0;\n\t}\n\n\tif(l<=l2 && r2<=r){\n\t\treturn res;\n\t}else{\n\t\tint m=(l2+r2)/2;\n\t\tres=fSegACalcAns(no*2+1,l,r,l2,m,no2,commit);\n\t\tres+=fSegACalcAns(no*2+2,l,r,m+1,r2,no2,commit);\n\t\treturn res;\n\t}\n}\n\nlong long int fSegAUpData(int no,int l,int r,int l2,int r2,int no2,int no3,bool commit){\n\tcommit=commit && segA[no].commit;\n\tno3=(no3<segA[no].no)?segA[no].no:no3;\n\tsegA[no].commit=commit;\n\tlong long int res=calc(no,no3,no3,l,r,l2,r2,commit);\n\t\n\tif(r2<l || r<l2){\n\t\treturn res;\n\t}\n\tres=calc(no,no2,no2,l,r,l2,r2,false);\n\tif(l2==r2){\n\t\tsegA[no].no=no2;\n\t\tsegA[no].num=res;\n\t\treturn res;\n\t}\n\tif(l<=l2 && r2<=r){\n\t\tsegA[no].no=no2;\n\t\tsegA[no].num=res;\n\t\tsegA[no].commit=true;\n\t\tsegA[no*2+1].commit=false;\n\t\tsegA[no*2+2].commit=false;\n\t\treturn res;\n\t}else{\n\t\tint m=(l2+r2)/2;\n\t\tres=fSegAUpData(no*2+1,l,r,l2,m,no2,no3,commit);\n\t\tres+=fSegAUpData(no*2+2,l,r,m+1,r2,no2,no3,commit);\n\t\tsegA[no].num=res;\n\t\tsegA[no].commit=true;\n\t\treturn res;\n\t}\n}\n\nint main() {\n\tfor(int i=0;i<maxS;i++){\n\t\tsegA[i].num=0;\n\t\tsegA[i].no=-1;\n\t\tsegA[i].commit=true;\n\t}\n\tint n,m;\n\tcin>>n>>m;\n\tfor(int i=0;i<n;i++){\n\t\tlong long int num;\n\t\tcin>>num;\n\t\tfSegASet(0,i,0,R,num);\n\t}\n\tareaSum.push_back(0);\n\tlong long int sum=0;\n\tfor(int i=0;i<n;i++){\n\t\tlong long int num;\n\t\tcin>>num;\n\t\tsum+=num;\n\t\tareaSum.push_back(sum);\n\t}\n\tfor(int i=0;i<maxS;i++){\n\t\tareaSum.push_back(sum);\n\t}\n\t\n\tfor(int i=0;i<m;i++){\n\t\tint c1,l,r,x,y,z;\n\t\tcin>>c1;\n\t\tif(c1==0){\n\t\t\tcin>>x>>y>>z;\n\t\t\tE2 e2;\n\t\t\te2.l=y-1;\n\t\t\te2.r=y-2+z;\n\t\t\te2.x=x-1;\n\t\t\te2.y=y-1;\n\t\t\te2.z=z;\n\t\t\tl=x-1;\n\t\t\tr=x-2+z;\n\t\t\tcopyData.push_back(e2);\n\t\t\tfSegAUpData(0,l,r,0,R,no0,-1,true);\n\t\t\tno0++;\n\t\t}else{\n\t\t\tcin>>l>>r;\n\t\t\tl--;\n\t\t\tr--;\n\t\t\tlong long int t=fSegACalcAns(0,l,r,0,R,-1,true);\n\t\t\tcout<<t<<endl;\n\t\t}\n\t\t//for(int i=0;i<maxS;i++){\n\t\t\t//cout<<\"(\"<<i<<\",\"<<segA[i].num<<\")\";\n\t\t//}\n\t//cout<<endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 400, "memory_kb": 29980, "score_of_the_acc": -1.4382, "final_rank": 15 }, { "submission_id": "aoj_0437_10400327", "code_snippet": "#include <iostream>\n#include <string.h>\n#include <vector>\n#include <set>\nusing namespace std;\n\nstruct E{\n\tlong long int num,no;\n\tbool commit;\n};\nstruct E2{\n\tint l,r,x,y,z;\n};\nconst int maxS=600000;\nint R=262143;\nint no0=0;\nvector<E2> copyData;\nvector<long long int> areaSum;\nE segA[maxS];\n\nlong long int fSegASet(int no,int p1,int l2,int r2,long long int num){\n\tif(r2<p1 || p1<l2)return segA[no].num;\n\tif(l2==r2){\n\t\tsegA[no].num=num;\n\t\treturn segA[no].num;\n\t}\n\tint m=(l2+r2)/2;\n\tlong long int res=fSegASet(no*2+1,p1,l2,m,num);\n\tres+=fSegASet(no*2+2,p1,m+1,r2,num);\n\tsegA[no].num=res;\n\treturn res;\n}\n\nlong long int calc(int no,int no2,int no3,int l,int r,int l2,int r2,bool commit){\n\t//cout<<\"<\"<<commit<<\" \"<<no<<\",no2=\"<<no2<<\",no3=\"<<no3<<\",l=\"<<l<<\",r=\"<<r<<\",\"<<l2<<\",\"<<r2<<\",>\";\n\tE2 e2=copyData[no2];\n\tif(commit==true){\n\t\t//cout<<1<<\" \"<<segA[no].num<<endl;\n\t\t\n\t\treturn segA[no].num;\n\t}else{\n\t\tif(e2.x<=l2 && r2<=e2.x+e2.z){\n\t\t\tint l3=e2.y+(l2-e2.x);\n\t\t\tint r3=l3+(r2-l2)+1;\n\t\t\tlong long int t=areaSum[r3]-areaSum[l3];\n\t\t\treturn t;\n\t\t}\n\t\te2=copyData[no3];\n\t\t//cout<<3<<e2.x<<\" \"<<e2.z<<endl;\n\t\treturn areaSum[e2.x+e2.z]-areaSum[e2.x];\n\t}\n}\n\n\nlong long int fSegACalcAns(int no,int l,int r,int l2,int r2,int no2,bool commit){\n\tcommit=commit && segA[no].commit;\n\tno2=(no2<segA[no].no)?segA[no].no:no2;\n\tsegA[no].commit=commit;\n\tlong long int res=calc(no,no2,no2,l,r,l2,r2,commit);\n\tif(r2<l || r<l2){\n\t\treturn 0;\n\t}\n\n\tif(l<=l2 && r2<=r){\n\t\treturn res;\n\t}else{\n\t\tint m=(l2+r2)/2;\n\t\tres=fSegACalcAns(no*2+1,l,r,l2,m,no2,commit);\n\t\tres+=fSegACalcAns(no*2+2,l,r,m+1,r2,no2,commit);\n\t\treturn res;\n\t}\n}\n\nlong long int fSegAUpData(int no,int l,int r,int l2,int r2,int no2,int no3,bool commit){\n\tcommit=commit && segA[no].commit;\n\tno3=(no3<segA[no].no)?segA[no].no:no3;\n\tsegA[no].commit=commit;\n\tlong long int res=calc(no,no3,no3,l,r,l2,r2,commit);\n\t\n\tif(r2<l || r<l2){\n\t\treturn res;\n\t}\n\tres=calc(no,no2,no2,l,r,l2,r2,false);\n\tif(l2==r2){\n\t\tsegA[no].no=no2;\n\t\tsegA[no].num=res;\n\t\treturn res;\n\t}\n\tif(l<=l2 && r2<=r){\n\t\tsegA[no].no=no2;\n\t\tsegA[no].num=res;\n\t\tsegA[no].commit=true;\n\t\tsegA[no*2+1].commit=false;\n\t\tsegA[no*2+2].commit=false;\n\t\treturn res;\n\t}else{\n\t\tint m=(l2+r2)/2;\n\t\tres=fSegAUpData(no*2+1,l,r,l2,m,no2,no3,commit);\n\t\tres+=fSegAUpData(no*2+2,l,r,m+1,r2,no2,no3,commit);\n\t\tsegA[no].num=res;\n\t\tsegA[no].commit=true;\n\t\treturn res;\n\t}\n}\n\nint main() {\n\tfor(int i=0;i<maxS;i++){\n\t\tsegA[i].num=0;\n\t\tsegA[i].no=-1;\n\t\tsegA[i].commit=true;\n\t}\n\tint n,m;\n\tcin>>n>>m;\n\tfor(int i=0;i<n;i++){\n\t\tlong long int num;\n\t\tcin>>num;\n\t\tfSegASet(0,i,0,R,num);\n\t}\n\tareaSum.push_back(0);\n\tlong long int sum=0;\n\tfor(int i=0;i<n;i++){\n\t\tlong long int num;\n\t\tcin>>num;\n\t\tsum+=num;\n\t\tareaSum.push_back(sum);\n\t}\n\tfor(int i=0;i<maxS;i++){\n\t\tareaSum.push_back(sum);\n\t}\n\t\n\tfor(int i=0;i<m;i++){\n\t\tint c1,l,r,x,y,z;\n\t\tcin>>c1;\n\t\tif(c1==0){\n\t\t\tcin>>x>>y>>z;\n\t\t\tE2 e2;\n\t\t\te2.l=y-1;\n\t\t\te2.r=y-2+z;\n\t\t\te2.x=x-1;\n\t\t\te2.y=y-1;\n\t\t\te2.z=z;\n\t\t\tl=x-1;\n\t\t\tr=x-2+z;\n\t\t\tcopyData.push_back(e2);\n\t\t\tfSegAUpData(0,l,r,0,R,no0,-1,true);\n\t\t\tno0++;\n\t\t}else{\n\t\t\tcin>>l>>r;\n\t\t\tl--;\n\t\t\tr--;\n\t\t\tlong long int t=fSegACalcAns(0,l,r,0,R,-1,true);\n\t\t\tcout<<t<<endl;\n\t\t}\n\t\t//for(int i=0;i<maxS;i++){\n\t\t\t//cout<<\"(\"<<i<<\",\"<<segA[i].num<<\")\";\n\t\t//}\n\t//cout<<endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 380, "memory_kb": 29956, "score_of_the_acc": -1.4148, "final_rank": 14 }, { "submission_id": "aoj_0437_10121826", "code_snippet": "// AOJ #437\n// Copy and Sum 2025.1.20\n\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\n// ----------------------------------------\n// グローバルに必要な配列や構造体を宣言\n// ----------------------------------------\n\n// 最大要素数 N に対して4倍程度のサイズでセグメント木を構築\nstatic const int MAXN = 200000; // 問題の N の最大値\nvector<ll> A, B, prefixB; // A, Bおよび B の prefix sum\nvector<ll> seg; // セグメント木(区間和)本体\nvector<ll> lazy; // 遅延伝搬: オフセット c = (y - x)\nvector<bool> lazyFlag; // 遅延伝搬が有効かどうか\n\nint N, M; // 配列長, 操作数\n\n// ----------------------------------------\n// B の区間和を O(1) で返す関数\n// B_{l} + ... + B_{r} = prefixB[r] - prefixB[l - 1] (1-indexed)\n// ----------------------------------------\nll getSumB(int l, int r) {\n // l, r は 1-indexed で、かつ 1 <= l <= r <= N 保証\n return prefixB[r] - prefixB[l - 1];\n}\n\n// ----------------------------------------\n// ノード [start, end] に対して「オフセット c で完全に上書き」したときの\n// 区間和を計算する\n// すなわち A_i = B_{i + c} (i in [start, end]) になった場合の合計\n// ----------------------------------------\nll calcRangeSum(int start, int end, ll c) {\n // 区間 [start, end] は 1-indexed\n // A_i = B_{i + c} なので合計は sum of B in [start + c, end + c]\n int lB = start + c; \n int rB = end + c;\n // 範囲外に行かないかは呼び出し側で保証 (y+z-1 <= N 等)\n return getSumB(lB, rB);\n}\n\n// ----------------------------------------\n// セグメント木を構築する (最初は配列 A の値で構築)\n// node: 節点番号 (1から始めることが多い)\n// start, end: node が担当する区間 [start, end]\n// ----------------------------------------\nvoid build(int node, int start, int end) {\n lazyFlag[node] = false; // 初期状態では遅延なし\n if (start == end) {\n // 葉ノード\n seg[node] = A[start]; \n return;\n }\n int mid = (start + end) / 2;\n build(node*2, start, mid);\n build(node*2+1, mid+1, end);\n seg[node] = seg[node*2] + seg[node*2+1];\n}\n\n// ----------------------------------------\n// 遅延値 lazy[node] を子ノードに伝搬させる\n// node が担当する区間は [start, end]\n// ----------------------------------------\nvoid pushDown(int node, int start, int end) {\n if (!lazyFlag[node]) return; // 遅延が無効なら何もしない\n\n // 子ノードの区間\n int mid = (start + end) / 2;\n int leftNode = node * 2;\n int rightNode = node * 2 + 1;\n\n // 子ノードを「オフセット lazy[node]」で完全上書き状態にする\n // 左の子\n lazyFlag[leftNode] = true;\n lazy[leftNode] = lazy[node];\n seg[leftNode] = calcRangeSum(start, mid, lazy[node]);\n\n // 右の子\n lazyFlag[rightNode] = true;\n lazy[rightNode] = lazy[node];\n seg[rightNode] = calcRangeSum(mid+1, end, lazy[node]);\n\n // 自分の遅延情報をクリア\n lazyFlag[node] = false;\n}\n\n// ----------------------------------------\n// セグメント木の区間上書き (copy相当)\n// 「区間 [l, r] をオフセット c (= y - x) で B 参照にする」\n// node が担当する区間 [start, end]\n// ----------------------------------------\nvoid update(int node, int start, int end, int l, int r, ll c) {\n if (r < start || end < l) {\n // 範囲がかぶらない\n return;\n }\n if (l <= start && end <= r) {\n // [start, end] が完全に [l, r] に含まれる → 一括上書き\n lazyFlag[node] = true;\n lazy[node] = c;\n seg[node] = calcRangeSum(start, end, c);\n return;\n }\n // 部分的にかぶる場合は子に伝搬する\n pushDown(node, start, end);\n int mid = (start + end) / 2;\n update(node*2, start, mid, l, r, c);\n update(node*2+1, mid+1, end, l, r, c);\n seg[node] = seg[node*2] + seg[node*2+1];\n}\n\n// ----------------------------------------\n// セグメント木の区間和取得 (sum相当)\n// [l, r] の和を返す\n// node が担当する区間 [start, end]\n// ----------------------------------------\nll query(int node, int start, int end, int l, int r) {\n if (r < start || end < l) {\n // 範囲がかぶらない\n return 0;\n }\n if (l <= start && end <= r) {\n // 完全に含まれる\n return seg[node];\n }\n // 部分的にかぶるときは pushDown して子ノードを見る\n pushDown(node, start, end);\n int mid = (start + end) / 2;\n ll sumLeft = query(node*2, start, mid, l, r);\n ll sumRight = query(node*2+1, mid+1, end, l, r);\n return sumLeft + sumRight;\n}\n\n// ----------------------------------------\n// メイン処理\n// ----------------------------------------\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n cin >> N >> M;\n A.resize(N+1);\n B.resize(N+1);\n prefixB.resize(N+1, 0LL);\n seg.resize(4*(N+1), 0LL);\n lazy.resize(4*(N+1), 0LL);\n lazyFlag.resize(4*(N+1), false);\n\n // A, B を 1-indexed で受け取る\n for (int i = 1; i <= N; i++) cin >> A[i];\n for (int i = 1; i <= N; i++) cin >> B[i];\n\n // B の prefix sum を作る\n // prefixB[i] = B[1] + B[2] + ... + B[i]\n for (int i = 1; i <= N; i++){\n prefixB[i] = prefixB[i-1] + B[i];\n }\n\n // セグメント木を A の値で構築\n build(1, 1, N);\n\n // M 個の操作を処理\n while (M--) {\n int t; \n cin >> t;\n if (t == 0) {\n // copy(x, y, z) → \"0 x y z\"\n ll x, y, z;\n cin >> x >> y >> z;\n // A[x..x+z-1] = B[y..y+z-1]\n // offset c = y - x を区間 [x, x+z-1] に一括上書き\n ll c = y - x; \n update(1, 1, N, x, x + z - 1, c);\n\n } else {\n // sum(p, q) → \"1 p q\"\n ll p, q;\n cin >> p >> q;\n // 出力\n ll ans = query(1, 1, N, p, q);\n cout << ans << \"\\n\";\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 150, "memory_kb": 20532, "score_of_the_acc": -0.8005, "final_rank": 5 }, { "submission_id": "aoj_0437_9633595", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing i64 = long long;\n#define rep(i, a, b) for (int i = a; i < b; i++)\n#define repi(i, a, b) for (int i = a - 1; i >= b; i--)\n\nstruct LazySeg {\n using S = pair<i64, int>;\n S op(S l, S r) {\n l.first += r.first;\n l.second += r.second;\n return l;\n }\n S e() {\n return S{0, 0};\n }\n using F = int;\n S mapping(F f, S x) {\n if (f < 0) return x;\n x.first = preb[f + x.second] - preb[f];\n return x;\n }\n F composition(F l, F r) {\n if (l < 0) return r;\n return l;\n }\n F id() { return -1e9; }\n\n int _n, size, log;\n vector<S> d;\n vector<i64> preb;\n vector<F> lz;\n\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n void all_apply(int k, F f) {\n d[k] = mapping(f, d[k]);\n if (k < size) lz[k] = composition(f, lz[k]);\n }\n void push(int k) {\n all_apply(2 * k, lz[k]);\n all_apply(2 * k + 1, lz[k] + d[2 * k].second);\n lz[k] = id();\n }\n\n LazySeg() = default;\n\n LazySeg(const vector<i64> &v, const vector<i64> &preb_) : _n(v.size()), log(0), preb(preb_) {\n while ((1 << log) < _n) ++log;\n size = 1 << log;\n d = vector<S>(2 * size, e());\n lz = vector<F>(size, id());\n for (int i = 0; i < _n; i++) d[size + i] = {v[i], 1};\n for (int i = size - 1; i >= 1; i--) update(i);\n }\n\n S prod(int l, int r) {\n assert(0 <= l and l <= r and r <= _n);\n if (l == r) return e();\n\n // rep (i, 1, 2 * size) {\n // cout << i << \" \" << d[i].first << \" \" << d[i].second << endl;\n // }\n\n l += size;\n r += size;\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push(r >> i);\n }\n\n S sml = e(), smr = e();\n while (l < r) {\n // cout << l << \" \" << r << endl;\n if (l & 1) {\n // cout << l << endl;\n sml = op(sml, d[l++]);\n }\n if (r & 1) {\n // cout << r << endl;\n smr = op(d[--r], smr);\n }\n l >>= 1;\n r >>= 1;\n }\n // cout << d[4].first << \" \" << d[4].second << endl;\n // cout << d[10].first << \" \" << d[8].second << endl;\n\n return op(sml, smr);\n }\n\n void apply(int l, int r, F f) {\n assert(0 <= l and l <= r and r <= _n);\n if (l == r) return;\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n {\n int l2 = l, r2 = r;\n F lf = f, rf = f + r - l;\n while (l < r) {\n // cout << lf << \" \" << rf << endl;\n if (l & 1) {\n all_apply(l, lf);\n // cout << lf << endl;\n lf += d[l].second;\n l++;\n }\n if (r & 1) {\n all_apply(r - 1, rf - d[r - 1].second);\n // cout << rf - d[r - 1].second << endl;\n rf -= d[r - 1].second;\n r--;\n }\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n }\n\n for (int i = 1; i <= log; i++) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n\n // rep (i, 1, 2 * size) {\n // cout << i << \" \" << d[i].first << \" \" << d[i].second << endl;\n // }\n }\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int n, m;\n cin >> n >> m;\n vector<i64> a(n);\n vector<i64> preb(n + 1);\n rep (i, 0, n) { cin >> a[i]; }\n rep (i, 0, n) { cin >> preb[i + 1]; }\n rep (i, 0, n) preb[i + 1] += preb[i];\n\n LazySeg seg(a, preb);\n\n rep (_, 0, m) {\n int t;\n cin >> t;\n if (t == 0) {\n int x, y, z;\n cin >> x >> y >> z;\n --x, --y;\n seg.apply(x, x + z, y);\n }\n if (t == 1) {\n int p, q;\n cin >> p >> q;\n --p;\n cout << seg.prod(p, q).first << \"\\n\";\n // cout << seg.prod(p, q).first << endl;\n // cout << seg.prod(p, q).second << endl;\n }\n // rep (i, 0, n) cout << seg.prod(i, i + 1).first << \" \";\n // cout << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 120, "memory_kb": 17120, "score_of_the_acc": -0.6379, "final_rank": 3 }, { "submission_id": "aoj_0437_9574061", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<typename T,T e>\nstruct segtree {\n\tvector<long long> v;\n\tlong long n;\n\tT f(T a,T b){\n\t\treturn a + b;\n\t}\n\tsegtree(long long n) : n(n) {\n\t\tv.resize(n * 2ll);\n\t\tfor(long long i = 0ll;i < n * 2ll;i++){\n\t\t\tv[i] = e;\n\t\t}\n\t}\n\tsegtree(vector<T> x) : n(x.size()) {\n\t\tv.resize(n * 2ll);\n\t\tfor(long long i = 0ll;i < n;i++){\n\t\t\tv[i + n] = x[i];\n\t\t}\n\t\tfor(long long i = n - 1ll;i >= 0ll;i--){\n\t\t\tv[i] = f(v[i * 2ll],v[i * 2ll + 1ll]);\n\t\t}\n\t}\n\tT operator[](long long a){\n\t\treturn v[a + n];\n\t}\n\tvoid set(long long a,long long b){\n\t\ta += n;\n\t\tv[a] = b;\n\t\twhile(a >>= 1ll){\n\t\t\tv[a] = f(v[a * 2ll],v[a * 2ll + 1ll]);\n\t\t}\n\t}\n\tT prod(long long l,long long r){\n\t\tT res = e;\n\t\tfor(l += n,r += n;l < r;l >>= 1ll,r >>= 1ll){\n\t\t\tif(l & 1ll){\n\t\t\t\tres = f(res,v[l++]);\n\t\t\t}\n\t\t\tif(r & 1ll){\n\t\t\t\tres = f(res,v[--r]);\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t}\n};\nint main()\n{\n\tlong long n,Q;\n\tcin >> n >> Q;\n\tvector<vector<long long>> a(2ll,vector<long long>(n));\n\tlong long m = 1ll;\n\twhile(m * m < n) m++;\n\tvector<long long> cou(m,0ll),u(m,-1ll);\n\tfor(long long j = 0ll;j < 2ll;j++){\n\t\tfor(long long i = 0ll;i < n;i++){\n\t\t\tcin >> a[j][i];\n\t\t}\n\t}\n\tfor(long long i = 0ll;i < n;i++){\n\t\tcou[i / m] += a[0ll][i];\n\t}\n\tsegtree<long long,0ll> seg(a[1ll]);\n\tfor(long long cnt = 0ll;cnt < Q;cnt++){\n\t\tlong long T;\n\t\tcin >> T;\n\t\tif(T == 0ll){\n\t\t\tlong long x,y,z;\n\t\t\tcin >> x >> y >> z;\n\t\t\tx--;y--;\n\t\t\tlong long l = x,r = x + z - 1ll;\n\t\t\tfor(long long i = 0ll;i < m;i++){\n\t\t\t\tlong long left = i * m,right = left + m - 1ll;\n\t\t\t\tif(right < l || r < left) continue;\n\t\t\t\tif(l <= left && right <= r){\n\t\t\t\t\tlong long it = left - l;\n\t\t\t\t\tcou[i] = seg.prod(y + it,y + it + m);\n\t\t\t\t\tu[i] = y + it;\n\t\t\t\t}else{\n\t\t\t\t\tcou[i] = 0ll;\n\t\t\t\t\tlong long it = left - l;\n\t\t\t\t\tfor(long long j = left;j <= min(right,n - 1ll);j++){\n\t\t\t\t\t\tif(u[i] != -1ll){\n\t\t\t\t\t\t\ta[0ll][j] = a[1ll][u[i] + (j - left)];\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(l <= j && j <= r){\n\t\t\t\t\t\t\ta[0ll][j] = a[1ll][y + it + (j - left)];\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcou[i] += a[0ll][j];\n\t\t\t\t\t}\n\t\t\t\t\tu[i] = -1ll;\n\t\t\t\t}\n\t\t\t}\n\t\t}else{\n\t\t\tlong long l,r;\n\t\t\tcin >> l >> r;\n\t\t\tl--;r--;\n\t\t\tlong long ans = 0ll;\n\t\t\tfor(long long i = 0ll;i < m;i++){\n\t\t\t\tlong long left = i * m,right = left + m - 1ll;\n\t\t\t\tif(right < l || r < left) continue;\n\t\t\t\tif(l <= left && right <= r){\n\t\t\t\t\tans += cou[i];\n\t\t\t\t}else{\n\t\t\t\t\tcou[i] = 0ll;\n\t\t\t\t\tfor(long long j = left;j <= min(right,n - 1ll);j++){\n\t\t\t\t\t\tif(u[i] != -1ll){\n\t\t\t\t\t\t\ta[0ll][j] = a[1ll][u[i] + (j - left)];\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcou[i] += a[0ll][j];\n\t\t\t\t\t\tif(l <= j && j <= r){\n\t\t\t\t\t\t\tans += a[0ll][j];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tu[i] = -1ll;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << ans << endl;\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 900, "memory_kb": 11020, "score_of_the_acc": -1.2839, "final_rank": 13 }, { "submission_id": "aoj_0437_8711884", "code_snippet": "#include <bits/stdc++.h>\n\nint main() {\n int n, m;\n std::cin >> n >> m;\n std::vector<long long> a(n), b(n);\n for (int i = 0; i < n; i++) std::cin >> a[i];\n for (int i = 0; i < n; i++) std::cin >> b[i];\n const int D = 700;\n const int b_size = (n + D - 1) / D;\n const std::pair<int, int> init = {-1, -1};\n std::vector<long long> totals(b_size);\n std::vector<std::pair<int, int>> querys(b_size, init);\n std::vector<long long> sum(n + 1);\n for (int i = 0; i < n; i++) sum[i + 1] = sum[i] + b[i];\n\n for (int i = 0; i < b_size; i++) {\n for (int j = i * D, r = std::min(n, (i + 1) * D); j < r; j++) {\n totals[i] += a[j];\n }\n }\n // for (int i = 0; i < b_size; i++) {\n // std::cerr << totals[i] << ' ';\n // }\n // std::cerr << std::endl;\n\n auto push = [&](int pos) {\n if (querys[pos] != init) {\n auto [l, r] = querys[pos];\n assert(r - l == D);\n int offset = D * pos;\n for (int i = 0; i < D; i++) {\n a[i + offset] = b[l + i];\n }\n totals[pos] = 0;\n for (int i = 0; i < D; i++) {\n totals[pos] += a[i + offset];\n }\n querys[pos] = init;\n }\n };\n\n auto update = [&](int pos) {\n assert(querys[pos] == init);\n totals[pos] = 0;\n int offset = pos * D;\n for (int i = 0; i < D; i++) {\n totals[pos] += a[i + offset];\n }\n };\n\n while (m--) {\n int t;\n std::cin >> t;\n if (t == 0) {\n int la, lb, len;\n std::cin >> la >> lb >> len;\n la--;\n lb--;\n int ra = la + len;\n int rb = lb + len;\n // left bucket\n if (la % D != 0) {\n int pos = la / D;\n push(pos);\n for (; la < ra && la % D != 0; la++, lb++) {\n a[la] = b[lb];\n }\n update(pos);\n }\n // right bucket\n if (ra % D != 0) {\n int pos = ra / D;\n push(pos);\n for (; la < ra && ra % D != 0; ) {\n ra--;\n rb--;\n a[ra] = b[rb];\n }\n update(pos);\n }\n assert(la == ra || (la % D == 0 && ra % D == 0));\n assert(ra - la == rb - lb);\n for (; la < ra; la += D, lb += D) {\n querys[la / D] = {lb, lb + D};\n totals[la / D] = sum[lb + D] - sum[lb];\n }\n } else {\n int l, r;\n std::cin >> l >> r;\n l--;\n long long res = 0;\n // left bucket\n if (l % D != 0) {\n int pos = l / D;\n push(pos);\n for (; l < r && l % D != 0; l++) {\n res += a[l];\n }\n }\n if (r % D != 0) {\n int pos = r / D;\n push(pos);\n for (; l < r && r % D != 0; ) {\n r--;\n res += a[r];\n }\n }\n assert(l == r || (l % D == 0 && r % D == 0));\n for (; l < r; l += D) {\n res += totals[l / D];\n }\n std::cout << res << '\\n';\n }\n }\n}", "accuracy": 1, "time_ms": 640, "memory_kb": 7824, "score_of_the_acc": -0.871, "final_rank": 8 }, { "submission_id": "aoj_0437_8711882", "code_snippet": "#include <bits/stdc++.h>\n\nint main() {\n int n, m;\n std::cin >> n >> m;\n std::vector<long long> a(n), b(n);\n for (int i = 0; i < n; i++) std::cin >> a[i];\n for (int i = 0; i < n; i++) std::cin >> b[i];\n const int D = 700;\n const int b_size = (n + D - 1) / D;\n const std::pair<int, int> init = {-1, -1};\n std::vector<long long> totals(b_size);\n std::vector<std::pair<int, int>> querys(b_size, init);\n std::vector<long long> sum(n + 1);\n for (int i = 0; i < n; i++) sum[i + 1] = sum[i] + b[i];\n\n for (int i = 0; i < b_size; i++) {\n for (int j = i * D, r = std::min(n, (i + 1) * D); j < r; j++) {\n totals[i] += a[j];\n }\n }\n // for (int i = 0; i < b_size; i++) {\n // std::cerr << totals[i] << ' ';\n // }\n // std::cerr << std::endl;\n\n auto push = [&](int pos) {\n if (querys[pos] != init) {\n auto [l, r] = querys[pos];\n assert(r - l == D);\n int offset = D * pos;\n for (int i = 0; i < D; i++) {\n a[i + offset] = b[l];\n }\n totals[pos] = 0;\n for (int i = 0; i < D; i++) {\n totals[pos] += a[i + offset];\n }\n querys[pos] = init;\n }\n };\n\n auto update = [&](int pos) {\n assert(querys[pos] == init);\n totals[pos] = 0;\n int offset = pos * D;\n for (int i = 0; i < D; i++) {\n totals[pos] += a[i + offset];\n }\n };\n\n while (m--) {\n int t;\n std::cin >> t;\n if (t == 0) {\n int la, lb, len;\n std::cin >> la >> lb >> len;\n la--;\n lb--;\n int ra = la + len;\n int rb = lb + len;\n // left bucket\n if (la % D != 0) {\n int pos = la / D;\n push(pos);\n for (; la < ra && la % D != 0; la++, lb++) {\n a[la] = b[lb];\n }\n update(pos);\n }\n // right bucket\n if (ra % D != 0) {\n int pos = ra / D;\n push(pos);\n for (; la < ra && ra % D != 0; ) {\n ra--;\n rb--;\n a[ra] = b[rb];\n }\n update(pos);\n }\n assert(la == ra || (la % D == 0 && ra % D == 0));\n assert(ra - la == rb - lb);\n for (; la < ra; la += D, lb += D) {\n querys[la / D] = {lb, lb + D};\n totals[la / D] = sum[lb + D] - sum[lb];\n }\n } else {\n int l, r;\n std::cin >> l >> r;\n l--;\n long long res = 0;\n // left bucket\n if (l % D != 0) {\n int pos = l / D;\n push(pos);\n for (; l < r && l % D != 0; l++) {\n res += a[l];\n }\n }\n if (r % D != 0) {\n int pos = r / D;\n push(pos);\n for (; l < r && r % D != 0; ) {\n r--;\n res += a[r];\n }\n }\n assert(l == r || (l % D == 0 && r % D == 0));\n for (; l < r; l += D) {\n res += totals[l / D];\n }\n std::cout << res << '\\n';\n }\n }\n}", "accuracy": 0.7692307692307693, "time_ms": 590, "memory_kb": 7780, "score_of_the_acc": -0.8132, "final_rank": 19 } ]
aoj_0438_cpp
Passport A new planet has been found that looks just like Earth. Each planet has countries numbered from $1$ to $N$. These countries are connected by rail and airlines. If there is an air route between country $i$ and country $j$ that satisfies $i When you enter each country, you will have the first letter of that country written in your passport. The first letter is a capital letter from 'A' to 'Z'. When you arrived on this planet, you entered country $1$. You are planning to travel in such a way that the string of letters written between your entry into country $1$ and your travel to country $N$, arranged in the order in which you entered the country, is the smallest in dictionary order (the order in which words are arranged in an English-Japanese dictionary). The first letter of the country and the airline route information are given. Write a program that outputs the string written in the passport when you travel by choosing a route so that the string made by arranging the words in the order they entered the country is the smallest in the lexical order. Input The input is given in the following form. $N$ $M$ $c_1$ $c_2$ ... $c_N$ $u_1$ $v_1$ $u_2$ $v_2$ : $u_M$ $v_M$ In the first line, the number of countries $N$ ($2 \leq N \leq 300,000$) and the number of airline routes $M$ ($0 \leq M \leq 300,000$) are given. In the second line, the first letter $c_i$ of country $i$ ($c_i$ is capitalized) is given. The following $M$ lines are the departure country $u_i$ ($1 \leq u_i < N$) and arrival country $v_i$ ($u_i < v_i \leq N$) of the $i$-th airline route. Output Outputs a string created by arranging the letters in the passport. Sample Input and Output Sample Input 1 4 1 A B C D 1 3 Sample Output 1 ABCD Sample Input 2 6 2 A M D U Z K 1 3 3 5 Sample Output 2 ADUZK
[ { "submission_id": "aoj_0438_10785688", "code_snippet": "#include <iostream>\n#include <iomanip>\n#include <cassert>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <numeric>\n#include <tuple>\n#include <ranges>\nnamespace ranges = std::ranges;\nnamespace views = std::views;\n// #include \"Src/Number/IntegerDivision.hpp\"\n// #include \"Src/Utility/BinarySearch.hpp\"\n// #include \"Src/Sequence/CompressedSequence.hpp\"\n// #include \"Src/Sequence/RunLengthEncoding.hpp\"\n// #include \"Src/Algebra/Group/AdditiveGroup.hpp\"\n// #include \"Src/DataStructure/FenwickTree/FenwickTree.hpp\"\n// #include \"Src/DataStructure/SegmentTree/SegmentTree.hpp\"\n// #include \"Src/DataStructure/DisjointSetUnion/DisjointSetUnion.hpp\"\n// using namespace zawa;\n\n\n\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\n\n\n\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param m `1 <= m`\n// @return x mod m\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\n// Fast modular multiplication by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n // @param m `1 <= m`\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n // @return m\n unsigned int umod() const { return _m; }\n\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n // [1] m = 1\n // a = b = im = 0, so okay\n\n // [2] m >= 2\n // im = ceil(2^64 / m)\n // -> im * m = 2^64 + r (0 <= r < m)\n // let z = a*b = c*m + d (0 <= c, d < m)\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\n // ((ab * im) >> 64) == c or c + 1\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned long long y = x * _m;\n return (unsigned int)(z - y + (z < y ? _m : 0));\n }\n};\n\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr long long bases[3] = {2, 7, 61};\n for (long long a : bases) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n // Contracts:\n // [1] s - m0 * a = 0 (mod b)\n // [2] t - m1 * a = 0 (mod b)\n // [3] s * |m1| + t * |m0| <= b\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n // [3]:\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\n // = s * |m1| + t * |m0| <= b\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n // by [3]: |m0| <= b/g\n // by g != b: |m0| < b/g\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\n// @param n `n < 2^32`\n// @param m `1 <= m < 2^32`\n// @return sum_{i=0}^{n-1} floor((ai + b) / m) (mod 2^64)\nunsigned long long floor_sum_unsigned(unsigned long long n,\n unsigned long long m,\n unsigned long long a,\n unsigned long long b) {\n unsigned long long ans = 0;\n while (true) {\n if (a >= m) {\n ans += n * (n - 1) / 2 * (a / m);\n a %= m;\n }\n if (b >= m) {\n ans += n * (b / m);\n b %= m;\n }\n\n unsigned long long y_max = a * n + b;\n if (y_max < m) break;\n // y_max < m * (n + 1)\n // floor(y_max / m) <= n\n n = (unsigned long long)(y_max / m);\n b = (unsigned long long)(y_max % m);\n std::swap(m, a);\n }\n return ans;\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n\n\n\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt(998244353);\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n// using mint = atcoder::modint998244353;\nusing namespace std;\nconst long long MOD = 1000000829; //{1000000829,1000001449,1000000753,1000008349,1000008791};\nusing mint = atcoder::static_modint<MOD>;\nconst long long BASE = 31415;\nint N, M;\nchar C[300030];\nvector<int> g[300030];\nint main() {\n cin.tie(0);\n cout.tie(0);\n ios::sync_with_stdio(0);\n cin >> N >> M;\n for (int i = 0 ; i < N ; i++) cin >> C[i];\n for (int i = 0 ; i < M ; i++) {\n int u, v;\n cin >> u >> v;\n u--; v--;\n g[u].push_back(v);\n }\n const int D = 20;\n vector<mint> pw(D + 1, BASE);\n for (int i = 1 ; i <= D ; i++) pw[i] = pw[i - 1] * pw[i - 1];\n vector dob(N + 1, vector<int>(D + 1, N));\n vector hash(N + 1, vector<mint>(D + 1));\n for (int i = N - 1 ; i >= 0 ; i--) {\n int bst = i + 1;\n for (int v : g[i]) if (bst < N) {\n int p = bst, q = v;\n for (int j = D ; j >= 0 ; j--) {\n if (dob[p][j] < N and dob[q][j] < N and hash[p][j] == hash[q][j]) {\n p = dob[p][j];\n q = dob[q][j];\n }\n }\n if (p < N and q == N) swap(bst, v);\n else if (p < N and q < N) {\n if (C[p] > C[q]) swap(bst, v);\n else if (C[p] == C[q] and dob[q][0] == N) swap(bst, v);\n }\n }\n dob[i][0] = bst;\n hash[i][0] = mint::raw(C[i]);\n for (int j = 1 ; j <= D ; j++) {\n dob[i][j] = dob[dob[i][j - 1]][j - 1];\n hash[i][j] = hash[i][j - 1] + hash[dob[i][j - 1]][j - 1] * pw[j - 1];\n }\n }\n string ans;\n for (int i = 0 ; i < N ; i = dob[i][0]) ans += C[i];\n cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 380, "memory_kb": 90784, "score_of_the_acc": -0.466, "final_rank": 3 }, { "submission_id": "aoj_0438_10783300", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nusing ull=unsigned long long;\nusing P=pair<ll,ll>;\ntemplate<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}\ntemplate<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}\ntemplate<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\ntemplate<typename T1,typename T2,typename T3>istream &operator>>(istream &is,tuple<T1,T2,T3>&a){is>>std::get<0>(a)>>std::get<1>(a)>>std::get<2>(a);return is;}\ntemplate<typename T,size_t n>istream &operator>>(istream &is,array<T,n>&a){for(auto&i:a)is>>i;return is;}\ntemplate<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}\ntemplate<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}\ntemplate<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}\ntemplate<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}\ntemplate<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}\n#define overload3(_1,_2,_3,name,...) name\n#define rep1(i,n) for(int i=0;i<(int)(n);i++)\n#define rep2(i,l,r) for(int i=(int)(l);i<(int)(r);i++)\n#define rep(...) overload3(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)\n#define reps(i,l,r) rep2(i,l,r)\n#define all(x) x.begin(),x.end()\n#define pcnt(x) __builtin_popcountll(x)\n#define fin(x) return cout<<(x)<<'\\n',static_cast<void>(0)\n#define yn(x) cout<<((x)?\"Yes\\n\":\"No\\n\")\n#define uniq(x) sort(all(x)),x.erase(unique(all(x)),x.end())\ntemplate<typename T>\ninline int fkey(vector<T>&z,T key){return lower_bound(z.begin(),z.end(),key)-z.begin();}\nll myceil(ll a,ll b){return (a+b-1)/b;}\ntemplate<typename T,size_t n,size_t id=0>\nauto vec(const int (&d)[n],const T &init=T()){\n if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));\n else return init;\n}\n#ifdef LOCAL\n#include<debug.h>\n#define SWITCH(a,b) (a)\n#else\n#define debug(...) static_cast<void>(0)\n#define debugg(...) static_cast<void>(0)\n#define SWITCH(a,b) (b)\ntemplate<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}\n#endif\nstruct Timer{\n clock_t start;\n Timer(){\n start=clock();\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout<<fixed<<setprecision(16);\n }\n inline double now(){return (double)(clock()-start)/1000;}\n #ifdef LOCAL\n ~Timer(){\n cerr<<\"time:\";\n cerr<<now();\n cerr<<\"ms\\n\";\n }\n #endif\n}timer;\nvoid SOLVE();\nint main(){\n int testcase=1;\n //cin>>testcase;\n for(int i=0;i<testcase;i++){\n SOLVE();\n }\n}\n#include<type_traits>\nstruct mint61{\nprivate:\n using ull=unsigned long long;\n static constexpr ull m=(1ull<<61)-1;\n static constexpr ull mask30=(1ull<<30)-1;\n static constexpr ull mask31=(1ull<<31)-1;\n static constexpr ull mul(ull a,ull b){\n ull au=a>>31;\n ull ad=a&mask31;\n ull bu=b>>31;\n ull bd=b&mask31;\n ull mid=au*bd+ad*bu;\n ull midu=mid>>30;\n ull midd=mid&mask30;\n mid=au*bu*2+midu+(midd<<31)+ad*bd;\n midu=mid>>61,midd=mid&m;\n mid=midu+midd;\n if(mid>=m)mid-=m;\n return mid;\n }\n ull v;\npublic:\n using value_type=ull;\n mint61():v(0){}\n template<typename T,std::enable_if_t<std::is_signed_v<T>,std::nullptr_t> =nullptr>\n mint61(T a){\n long long v2=a%(long long)m;\n if(v2<0)v2+=(long long)m;\n v=v2;\n }\n template<typename T,std::enable_if_t<std::is_unsigned_v<T>,std::nullptr_t> =nullptr>\n mint61(T a):v(a%m){}\n static mint61 raw(ull x){\n mint61 res;\n res.v=x;\n return res;\n }\n static constexpr ull mod(){return m;}\n inline mint61 operator++(int){\n mint61 res(*this);\n *this+=mint61::raw(1);\n return res;\n }\n inline mint61 operator--(int){\n mint61 res(*this);\n *this-=mint61::raw(1);\n return res;\n }\n inline mint61 operator-(){\n mint61 res;\n if(this->v==0)return res;\n res.v=m-this->v;\n return res;\n }\n inline mint61 &operator+=(const mint61&rhs){\n v+=rhs.v;\n if(v>=m)v-=m;\n return *this;\n }\n inline mint61 &operator-=(const mint61&rhs){\n v-=rhs.v;\n if(v>=m)v+=m;\n return *this;\n }\n inline mint61 &operator*=(const mint61&rhs){\n v=mul(v,rhs.v);\n return *this;\n }\n inline mint61 &operator/=(const mint61&rhs){\n (*this)*=rhs.inv();\n return *this;\n }\n ull val()const{return v;}\n mint61 pow(ull x)const{\n mint61 res=mint61::raw(1);\n mint61 a(*this);\n while(x){\n if(x&1)res*=a;\n a*=a;\n x>>=1;\n }\n return res;\n }\n mint61 inv()const{return (*this).pow(mod()-2);}\n friend inline mint61 operator+(const mint61&lhs,const mint61&rhs){return mint61(lhs)+=rhs;}\n friend inline mint61 operator-(const mint61&lhs,const mint61&rhs){return mint61(lhs)-=rhs;}\n friend inline mint61 operator*(const mint61&lhs,const mint61&rhs){return mint61(lhs)*=rhs;}\n friend inline mint61 operator/(const mint61&lhs,const mint61&rhs){return mint61(lhs)/=rhs;}\n friend inline bool operator==(const mint61&lhs,const mint61&rhs){return lhs.v==rhs.v;}\n friend inline bool operator!=(const mint61&lhs,const mint61&rhs){return lhs.v!=rhs.v;}\n friend std::istream &operator>>(std::istream &is,mint61&a){\n is>>a.v;\n return is;\n }\n friend std::ostream &operator<<(std::ostream &os,const mint61&a){\n os<<a.v;\n return os;\n }\n};\ntemplate<>\nstruct std::hash<mint61>{\n std::size_t operator()(mint61 x)const{\n return std::hash<unsigned long long>()(x.val());\n }\n};\nnamespace Random{\n std::mt19937_64 mt(std::random_device{}());\n template<typename T>inline std::enable_if_t<std::is_integral_v<T>,T> get(){return mt();}\n template<typename T>inline std::enable_if_t<std::is_floating_point_v<T>,T> get(){return T(mt())/T(-1ull);}\n template<typename T>inline std::enable_if_t<std::is_integral_v<T>,T>range(T n){return mt()%n;}\n template<typename T>inline std::enable_if_t<std::is_integral_v<T>,T>range(T l,T r){return l+mt()%(r-l);}\n template<typename T>inline std::enable_if_t<std::is_integral_v<T>,std::pair<T,T>>distinct(T n){\n T l=mt()%n,r=mt()%(n-1);\n if(l==r)r++;\n if(l>r)std::swap(l,r);\n return std::make_pair(l,r);\n }\n}\nstruct RollingHashBase{\n static mint61 base;\n static std::vector<mint61>power;\n static void resize(int n){\n if(power.size()<=n){\n int pre=power.size();\n power.resize(n+1);\n for(int i=pre;i<=n;i++)power[i]=power[i-1]*base;\n }\n }\n template<typename LHS,typename RHS>\n static int lcp(const LHS&lhs,int l1,int r1,const RHS&rhs,int l2,int r2){\n int ok=0,ng=std::min(r1-l1,r2-l2)+1;\n while(ng-ok>1){\n int mid=(ok+ng)/2;\n (lhs.get(l1,l1+mid)==rhs.get(l2,l2+mid)?ok:ng)=mid;\n }\n return ok;\n }\n};\nstd::vector<mint61> RollingHashBase::power{1};\nmint61 RollingHashBase::base=1773208334510344908;\nstruct PersistentRedBlackTree{\nprivate:\n struct node{\n #ifdef LOCAL\n static constexpr int MAX=5000;\n static constexpr int BORDER=4500;\n #else\n static constexpr int MAX=6500000;\n static constexpr int BORDER=19999000;\n #endif\n static node pool[];\n static int pos;\n mint61 v;\n bool isblack;\n node *left,*right;\n int sz,rank;\n template<int need=7>\n node* push(){\n return this;\n }\n static node* create_node(mint61 vv){\n node *nd=pool+pos++;\n nd->v=vv;\n nd->isblack=true;\n nd->left=nd->right=nullptr;\n nd->sz=1;\n nd->rank=0;\n return nd;\n }\n static node* create_node(node *l,node *r,bool b){\n node *nd=pool+pos++;\n if(l){\n nd->v=l->v*RollingHashBase::power[l->sz]+r->v;\n nd->sz=l->sz+r->sz;\n nd->rank=l->rank+l->isblack;\n nd->left=l;\n nd->right=r;\n }\n else{\n nd->v=mint61();\n nd->sz=1;\n nd->rank=0;\n nd->left=nd->right=nullptr;\n }\n nd->isblack=b;\n return nd;\n }\n static node* create_node(node *l,node *r,bool b,mint61 val){\n node *nd=pool+pos++;\n nd->v=val;\n nd->left=l;\n nd->right=r;\n nd->isblack=b;\n if(l){\n nd->sz=l->sz+r->sz;\n nd->rank=l->rank+l->isblack;\n }\n else{\n nd->sz=1;\n nd->rank=0;\n }\n return nd;\n }\n };\n node *root;\n node* imerge(node *l,node *r){\n if((l->rank)<(r->rank)){\n r=r->push();\n node *c=imerge(l,r->left);\n if(r->isblack&&!c->isblack&&!c->left->isblack){\n if(r->right->isblack){\n return node::create_node(c->left,node::create_node(c->right,r->right,false),true);\n }\n else{\n r->right=r->right->push();\n return node::create_node(node::create_node(c->left,c->right,true),node::create_node(r->right->left,r->right->right,true),false);\n }\n }\n else{\n return node::create_node(c,r->right,r->isblack);\n }\n }\n else if(l->rank>r->rank){\n l=l->push();\n node *c=imerge(l->right,r);\n if(l->isblack&&!c->isblack&&!c->right->isblack){\n if(l->left->isblack){\n return node::create_node(node::create_node(l->left,c->left,false),c->right,true);\n }\n else{\n l->left=l->left->push();\n return node::create_node(node::create_node(l->left->left,l->left->right,true),node::create_node(c->left,c->right,true),false);\n }\n }\n else{\n return node::create_node(l->left,c,l->isblack);\n }\n }\n else{\n return node::create_node(l,r,false);\n }\n return nullptr;\n }\n node* imerge2(node *l,node *r){\n if(!l)return r;\n if(!r)return l;\n node *nd=imerge(l,r);\n nd->isblack=true;\n return nd;\n }\n template<int need=1>\n node* as_root(node *nd){\n if(!nd||nd->isblack)return nd;\n if constexpr(need)return node::create_node(nd->left,nd->right,true,nd->v);\n else{\n nd->isblack=true;\n return nd;\n }\n }\n template<int need,int top=1>\n std::pair<node*,node*>isplit(node *nd,int k){\n if(k==0)return std::make_pair(nullptr,nd);\n if(k==nd->sz)return std::make_pair(nd,nullptr);\n if(k<nd->left->sz){\n nd=nd->template push<top*4+(need|1)>();\n auto [l,r]=isplit<need,0>(nd->left,k);\n if constexpr(need&2)return std::make_pair(l,imerge2(r,as_root<top>(nd->right)));\n else return std::make_pair(l,nullptr);\n }\n else if(k>nd->left->sz){\n nd=nd->template push<top*4+(need|2)>();\n auto [l,r]=isplit<need,0>(nd->right,k-nd->left->sz);\n if constexpr(need&1)return std::make_pair(imerge2(as_root<top>(nd->left),l),r);\n else return std::make_pair(nullptr,r);\n }\n else{\n nd=nd->template push<top*4+need>();\n node *res_l=nullptr,*res_r=nullptr;\n if constexpr(need&1)res_l=as_root<top>(nd->left);\n if constexpr(need&2)res_r=as_root<top>(nd->right);\n return std::make_pair(res_l,res_r);\n }\n }\n PersistentRedBlackTree(node *r):root(r){}\npublic:\n PersistentRedBlackTree():root(nullptr){}\n [[nodiscard]]PersistentRedBlackTree insert(int k,mint61 v){\n auto [l,r]=isplit<3>(root,k);\n node *nd=node::create_node(v);\n return PersistentRedBlackTree(imerge2(l,imerge2(nd,r)));\n }\n mint61 prod(int l,int r){\n if(l==r)return mint61();\n int prepos=node::pos;\n auto [left,right]=isplit<3>(root,l);\n auto [middle,right2]=isplit<3>(right,r-l);\n node::pos=prepos;\n return middle->v;\n }\n mint61 get(int i){\n node *nd=root;\n while(nd->left){\n if(nd->left->sz>i)nd=nd->left;\n else i-=nd->left->sz,nd=nd->right;\n }\n return nd->v;\n }\n void print(){\n auto dfs=[&](auto self,node *nd)->void {\n if(nd->left)self(self,nd->left),self(self,nd->right);\n else cout<<(char)nd->v.val();\n };\n dfs(dfs,root);\n cout<<'\\n';\n }\n int size()const{return root?root->sz:0;}\n};\ntypename PersistentRedBlackTree::node PersistentRedBlackTree::node::pool[PersistentRedBlackTree::node::MAX];\nint PersistentRedBlackTree::node::pos=0;\nint lcp(PersistentRedBlackTree lhs,PersistentRedBlackTree rhs){\n int ok=0,ng=min(lhs.size(),rhs.size())+1;\n while(ng-ok>1){\n int mid=(ok+ng)/2;\n (lhs.prod(0,mid)==rhs.prod(0,mid)?ok:ng)=mid;\n }\n return ok;\n}\nvoid SOLVE(){\n int n,m;\n cin>>n>>m;\n vector<char>s(n);\n cin>>s;\n vector<vector<int>>to(n);\n rep(i,m){\n int u,v;\n cin>>u>>v;\n u--,v--;\n to[u].push_back(v);\n }\n vector<PersistentRedBlackTree>dp(n);\n dp[n-1]=dp[n-1].insert(0,s[n-1]);\n for(int i=n-2;i>=0;i--){\n dp[i]=dp[i+1];\n for(int j:to[i]){\n int l=lcp(dp[i],dp[j]);\n debug(i,j,l);\n if(l==dp[j].size()||(l<dp[i].size()&&dp[i].get(l).val()>dp[j].get(l).val()))dp[i]=dp[j];\n }\n dp[i]=dp[i].insert(0,s[i]);\n }\n dp[0].print();\n}", "accuracy": 0.18181818181818182, "time_ms": 30, "memory_kb": 257484, "score_of_the_acc": -1, "final_rank": 20 }, { "submission_id": "aoj_0438_10173949", "code_snippet": "// AOJ #438\n// Passport 2025.2.2\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ull = unsigned long long;\nconst int MAXK = 20;\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n \n int N, M;\n cin >> N >> M;\n vector<char> letter(N+1);\n for (int i = 1; i <= N; i++) cin >> letter[i];\n \n vector<vector<int>> airlines(N+1);\n for (int i = 0; i < M; i++){\n int u, v;\n cin >> u >> v;\n airlines[u].push_back(v);\n }\n \n vector<ull> p_pow(N+1, 0);\n const ull base = 131ULL;\n p_pow[0] = 1;\n for (int i = 1; i <= N; i++){\n p_pow[i] = p_pow[i-1] * base;\n }\n \n vector<int> nxt(N+1, -1);\n vector<int> Larr(N+1, 0);\n \n vector<int> jumpTable((N+1) * MAXK, -1);\n vector<ull> segTable((N+1) * MAXK, 0);\n auto getJump = [&](int i, int k) -> int {\n return jumpTable[i * MAXK + k];\n };\n auto setJump = [&](int i, int k, int val) {\n jumpTable[i * MAXK + k] = val;\n };\n auto getSeg = [&](int i, int k) -> ull {\n return segTable[i * MAXK + k];\n };\n auto setSeg = [&](int i, int k, ull val) {\n segTable[i * MAXK + k] = val;\n };\n \n auto jump_from = [&](int i, int len) -> int {\n for (int k = MAXK - 1; k >= 0; k--){\n int step = 1 << k;\n if(len >= step){\n i = getJump(i, k);\n if(i == -1) return -1;\n len -= step;\n }\n }\n return i;\n };\n \n auto get_hash = [&](int i, int len) -> ull {\n ull res = 0;\n for (int k = MAXK - 1; k >= 0; k--){\n int step = 1 << k;\n if(len >= step){\n res = res * p_pow[step] + getSeg(i, k);\n i = getJump(i, k);\n len -= step;\n }\n }\n return res;\n };\n \n auto get_char_at = [&](int i, int pos) -> char {\n int idx = jump_from(i, pos);\n return (idx == -1 ? '\\0' : letter[idx]);\n };\n \n function<int(int,int)> LCP = [&](int i, int j) -> int {\n int lcp = 0;\n int p = i, q = j;\n for (int k = MAXK - 1; k >= 0; k--){\n int step = 1 << k;\n // We can jump if the remaining chain (from p and q) is at least \"step\" long.\n if(p != -1 && q != -1 && Larr[p] >= step && Larr[q] >= step){\n ull h1 = get_hash(p, step);\n ull h2 = get_hash(q, step);\n if(h1 == h2){\n lcp += step;\n p = jump_from(p, step);\n q = jump_from(q, step);\n }\n }\n }\n return lcp;\n };\n \n auto cmp_dp = [&](int i, int j) -> int {\n if(i == j) return 0;\n int common = LCP(i, j);\n if(common >= Larr[i] || common >= Larr[j]){\n if(Larr[i] == Larr[j]) return 0;\n return (Larr[i] < Larr[j] ? -1 : 1);\n }\n char a = get_char_at(i, common);\n char b = get_char_at(j, common);\n return (a < b ? -1 : 1);\n };\n \n for (int i = N; i >= 1; i--){\n int best;\n if(i == N){\n best = -1;\n } else {\n best = i + 1;\n }\n for (int candidate : airlines[i]) {\n if(best == -1){\n best = candidate;\n } else {\n int cmpVal = cmp_dp(candidate, best);\n if(cmpVal < 0) {\n best = candidate;\n }\n }\n }\n nxt[i] = best;\n Larr[i] = 1 + (best == -1 ? 0 : Larr[best]);\n \n setJump(i, 0, best);\n setSeg(i, 0, (ull)(letter[i] - 'A' + 1));\n for (int k = 1; k < MAXK; k++){\n int segLen = 1 << k;\n if(Larr[i] < segLen) break;\n int firstJump = getJump(i, k-1);\n if(firstJump == -1){\n setJump(i, k, -1);\n break;\n }\n int secondJump = getJump(firstJump, k-1);\n setJump(i, k, secondJump);\n ull combined = getSeg(i, k-1) * p_pow[ 1 << (k-1) ] + getSeg(firstJump, k-1);\n setSeg(i, k, combined);\n }\n }\n \n string ans;\n int cur = 1;\n while(cur != -1){\n ans.push_back(letter[cur]);\n cur = nxt[cur];\n }\n cout << ans << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 420, "memory_kb": 94980, "score_of_the_acc": -0.4993, "final_rank": 5 }, { "submission_id": "aoj_0438_9584089", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <long long Modulus>\nstruct modint {\n\tlong long x;\n\tconstexpr modint(const long long x = 0ll) noexcept : x(x % Modulus) {}\n\tconstexpr modint operator+(const modint rhs) const noexcept {\n\t\treturn modint(*this) += rhs;\n\t}\n\tconstexpr modint operator-(const modint rhs) const noexcept {\n\t\treturn modint(*this) -= rhs;\n\t}\n\tconstexpr modint operator*(const modint rhs) const noexcept {\n\t\treturn modint(*this) *= rhs;\n\t}\n\tconstexpr modint operator/(const modint rhs) const noexcept {\n\t\treturn modint(*this) /= rhs;\n\t}\n\tconstexpr modint &operator+=(const modint rhs) noexcept {\n\t\tx += rhs.x;\n\t\tif (x >= Modulus) {\n\t\t\tx -= Modulus;\n\t\t}\n\t\treturn *this;\n\t}\n\tconstexpr modint &operator-=(const modint rhs) noexcept {\n\t\tif (x < rhs.x) {\n\t\t\tx += Modulus;\n\t\t}\n\t\tx -= rhs.x;\n\t\treturn *this;\n\t}\n\tconstexpr modint &operator*=(const modint rhs) noexcept {\n\t\tx = x * rhs.x % Modulus;\n\t\treturn *this;\n\t}\n\tconstexpr modint &operator/=(modint rhs) noexcept {\n\t\t*this *= rhs.pow(Modulus - 2ll);\n\t\treturn *this;\n\t}\n\tconstexpr modint pow(long long t) const noexcept {\n\t\tmodint a = *this, res = 1ll;\n\t\twhile (t) {\n\t\t\tif (t & 1ll) {\n\t\t\t\tres *= a;\n\t\t\t}\n\t\t\ta *= a;\n\t\t\tt >>= 1ll;\n\t\t}\n\t\treturn res;\n\t}\n};\ntemplate <long long Modulus>\nostream& operator<<(ostream& os,modint<Modulus> m){\n\tos << m.x;\n\treturn os;\n}\nusing mint = modint<998244353>;\nint main()\n{\n\tcin.tie(nullptr);\n\tios_base::sync_with_stdio(false);\n\tint n,m;\n\tcin >> n >> m;\n\tvector<char> c(n);\n\tfor(int i = 0;i < n;i++){\n\t\tcin >> c[i];\n\t}\n\tvector<vector<int>> g(n,vector<int>());\n\tfor(int i = 0;i < m;i++){\n\t\tint u,v;\n\t\tcin >> u >> v;\n\t\tu--;v--;\n\t\tif(u + 1 == v) continue;\n\t\tg[u].push_back(v);\n\t}\n\tfor(int i = 0;i < n - 1;i++){\n\t\tg[i].push_back(i + 1);\n\t}\n\tvector<vector<int>> a(n,vector<int>(19,-1));\n\tvector<vector<mint>> b(n,vector<mint>(19,0));\n\tvector<int> ans(n,0);\n\tvector<mint> pw(n + 1,1);\n\tmint ran = 27;\n\tfor(int i = 1;i <= n;i++){\n\t\tpw[i] = pw[i - 1] * ran;\n\t}\n\tans[n - 1] = 1;\n\tb[n - 1][0] = c[n - 1] - 'A' + 1;\n\tauto con = [&](mint x,mint y,int s) -> mint {\n\t\treturn x * pw[s] + y;\n\t};\n\tauto getnum = [&](int x,int y) -> int {\n\t\tfor(int i = 0;i < 19;i++){\n\t\t\tif(y & (1 << i)){\n\t\t\t\tx = a[x][i];\n\t\t\t}\n\t\t}\n\t\treturn x;\n\t};\n\tauto get = [&](int x,int y) -> mint {\n\t\tmint res = 0;\n\t\tfor(int i = 0;i < 19;i++){\n\t\t\tif(y & (1 << i)){\n\t\t\t\tres = con(res,b[x][i],1 << i);\n\t\t\t\tx = a[x][i];\n\t\t\t}\n\t\t}\n\t\treturn res;\n\t};\n\tauto com = [&](int x,int y) -> int {\n\t\tif(ans[x] > ans[y]) swap(x,y);\n\t\tint low = 1,high = ans[x] + 1;\n\t\twhile(low < high){\n\t\t\tint mid = (low + high) / 2;\n\t\t\tif(get(x,mid).x != get(y,mid).x){\n\t\t\t\thigh = mid;\n\t\t\t}else{\n\t\t\t\tlow = mid + 1;\n\t\t\t}\n\t\t}\n\t\tif(low == ans[x] + 1) return x;\n\t\tint X = getnum(x,low - 1);\n\t\tint Y = getnum(y,low - 1);\n\t\tif(c[X] < c[Y]) return x;\n\t\treturn y;\n\t};\n\tfor(int i = n - 2;i >= 0;i--){\n\t\tchar mi = 'Z';\n\t\tfor(int j : g[i]){\n\t\t\tmi = min(mi,c[j]);\n\t\t}\n\t\tfor(int j : g[i]){\n\t\t\tif(c[j] != mi) continue;\n\t\t\tif(ans[i] == 0){\n\t\t\t\tans[i] = ans[j] + 1;\n\t\t\t\ta[i][0] = j;\n\t\t\t}else{\n\t\t\t\ta[i][0] = com(a[i][0],j);\n\t\t\t\tans[i] = ans[a[i][0]] + 1;\n\t\t\t}\n\t\t}\n\t\tb[i][0] = c[i] - 'A' + 1;\n\t\tfor(int j = 1;j < 19;j++){\n\t\t\tif(a[i][j - 1] == -1) continue;\n\t\t\ta[i][j] = a[a[i][j - 1]][j - 1];\n\t\t\tb[i][j] = con(b[i][j - 1],b[a[i][j - 1]][j - 1],1 << (j - 1));\n\t\t}\n\t}\n\tint now = 0;\n\twhile(now != -1){\n\t\tcout << c[now];\n\t\tnow = a[now][0];\n\t}\n\tcout << endl;\n}", "accuracy": 1, "time_ms": 2480, "memory_kb": 112724, "score_of_the_acc": -1.4122, "final_rank": 13 }, { "submission_id": "aoj_0438_9571632", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n,m;\n\tcin >> n >> m;\n\tvector<char> c(n);\n\tfor(int i = 0;i < n;i++){\n\t\tcin >> c[i];\n\t}\n\tvector<vector<int>> g(n,vector<int>());\n\tfor(int i = 0;i < m;i++){\n\t\tint u,v;\n\t\tcin >> u >> v;\n\t\tu--;v--;\n\t\tif(u + 1 == v) continue;\n\t\tg[u].push_back(v);\n\t\tg[v].push_back(u);\n\t}\n\tfor(int i = 0;i < n - 1;i++){\n\t\tg[i].push_back(i + 1);\n\t\tg[i + 1].push_back(i);\n\t}\n\tvector<int> ans(n,-1);\n\tans[0] = 0;\n\t{\n\t\tqueue<int> q;\n\t\tq.push(0);\n\t\twhile(ans[n - 1] == -1){\n\t\t\tchar mi = 'Z';\n\t\t\tqueue<int> nex;\n\t\t\twhile(!q.empty()){\n\t\t\t\tint it = q.front();\n\t\t\t\tnex.push(it);\n\t\t\t\tq.pop();\n\t\t\t\tfor(int i : g[it]){\n\t\t\t\t\tif(i < it) continue;\n\t\t\t\t\tmi = min(mi,c[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t\twhile(!nex.empty()){\n\t\t\t\tint it = nex.front();\n\t\t\t\tnex.pop();\n\t\t\t\tfor(int i : g[it]){\n\t\t\t\t\tif(i < it) continue;\n\t\t\t\t\tif(c[i] == mi){\n\t\t\t\t\t\tans[i] = ans[it] + 1;\n\t\t\t\t\t\tq.push(i);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tstring p = \"\";\n\tint now = ans[n - 1] + 1;\n\tfor(int i = n - 1;i >= 0;i--){\n\t\tif(ans[i] == now - 1){\n\t\t\tnow--;\n\t\t\tp += c[i];\n\t\t}\n\t}\n\treverse(p.begin(),p.end());\n\tcout << p << endl;\n}", "accuracy": 0.36363636363636365, "time_ms": 80, "memory_kb": 11216, "score_of_the_acc": -0.0204, "final_rank": 19 }, { "submission_id": "aoj_0438_9017717", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\n constexpr int MSB = 18;\n constexpr long long MOD = 1000000007;\n constexpr long long BASE = 998244353;\n vector<long long> base_pow(MSB+1, BASE);\n for(int i = 0; i < MSB; i++) {\n base_pow[i+1] = base_pow[i]*base_pow[i]%MOD;\n }\n\n int N, M;\n cin >> N >> M;\n vector<char> c(N+1, '$');\n vector<vector<int>> G(N+1);\n for(int i = 0; i < N; i++) {\n cin >> c[i];\n G[i].push_back(i+1);\n }\n for(int i = 0; i < M; i++) {\n int u, v;\n cin >> u >> v;\n G[u-1].push_back(v-1);\n }\n\n vector<vector<int>> dest(MSB+1, vector<int>(N+1, N));\n vector<vector<long long>> hash(MSB+1, vector<long long>(N+1, 0));\n auto mov = [&](int s, int l) -> pair<int, long long> {\n long long ret = 0;\n for(int k = MSB; k >= 0; k--) {\n if((l>>k)&1) {\n ret = (ret*base_pow[k]+hash[k][s])%MOD;\n s = dest[k][s];\n }\n }\n return make_pair(s, ret);\n };\n for(int i = N-1; i >= 0; i--) {\n int nxt = i+1;\n for(const int &j : G[i]) {\n int ok = 0, ng = N;\n while(ok+1 < ng) {\n int mid = (ok+ng)/2;\n if(mov(nxt, mid).second == mov(j, mid).second) ok = mid;\n else ng = mid;\n }\n if(c[mov(nxt, ok).first] > c[mov(j, ok).first]) nxt = j;\n }\n dest[0][i] = nxt;\n hash[0][i] = c[i];\n for(int k = 0; k < MSB; k++) {\n dest[k+1][i] = dest[k][dest[k][i]];\n hash[k+1][i] = (hash[k][i]*base_pow[k]+hash[k][dest[k][i]])%MOD;\n }\n }\n\n string ans;\n for(int i = 0; i < N; i = dest[0][i]) ans.push_back(c[i]);\n cout << ans << endl;\n\n}", "accuracy": 1, "time_ms": 1460, "memory_kb": 90140, "score_of_the_acc": -0.9042, "final_rank": 11 }, { "submission_id": "aoj_0438_9017242", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector<char> c(N);\n vector<vector<int>> G(N);\n for(int i = 0; i < N; i++) {\n cin >> c[i];\n }\n for(int i = 0; i < M; i++) {\n int u, v;\n cin >> u >> v;\n G[--u].push_back(--v);\n }\n for(int i = 0; i < N-1; i++) {\n G[i].push_back(i+1);\n }\n vector<string> dp(N);\n dp[N-1] = c[N-1];\n for(int i = N-2; i >= 0; i--) {\n string ep = dp[i+1];\n for(const int j : G[i]) ep = min(ep, dp[j]);\n dp[i] = c[i]+ep;\n }\n cout << dp[0] << endl;\n}", "accuracy": 0.3939393939393939, "time_ms": 100, "memory_kb": 43692, "score_of_the_acc": -0.1604, "final_rank": 14 }, { "submission_id": "aoj_0438_7590196", "code_snippet": "#include <algorithm>\n#include <utility>\n#include <cassert>\n#include <vector>\n#include <iostream>\n\nnamespace nachia{\n\ntemplate<class Key, class Payload>\nstruct Tree {\npublic:\n\nstruct FNode;\nstruct Node;\n\nstruct FNode {\n struct Node *p;\n unsigned int z;\n FNode(unsigned int _z) : p(nullptr), z(_z) {}\n struct Node *re(){ return (Node*)this; }\n};\n\nstruct Iterator {\n FNode* p = nullptr;\n bool isEnd() const { return p->z == 0; }\n unsigned int index() const { return p->z ? p->re()->index() : p->p->z; }\n const typename Node::Item& operator*() const { return p->re()->kv; }\n const typename Node::Item* operator->() const { return &p->re()->kv; }\n bool operator==(Iterator r) const { return p == r.p; }\n bool operator!=(Iterator r) const { return p != r.p; }\n bool operator<(Iterator r) const { return index() < r.index(); }\n bool operator>(Iterator r) const { return index() > r.index(); }\n bool operator<=(Iterator r) const { return index() <= r.index(); }\n bool operator>=(Iterator r) const { return index() >= r.index(); }\n Iterator& operator++(){ p = p->re()->next(); return *this; }\n Iterator& operator--(){ p = (isEnd() ? p->p->back() : p->re()->prev()); return *this; }\n};\n\nstruct Node : public FNode {\n static inline Node* NIL;\n unsigned int h;\n struct Item { Key key; Payload val; } kv;\n Payload sum;\n Node *l = nullptr;\n Node *r = nullptr;\n Node()\n : FNode(0), h(0)\n , kv({Key(),Payload::identity()})\n , sum(Payload::identity()) {}\n Node(Key _key, Payload p)\n : FNode(1), h(1)\n , kv({std::move(_key),p})\n , sum(p) {}\n static Node* GetNil(){\n if(!NIL){\n NIL = new Node();\n NIL->l = NIL->r = NIL->p = NIL;\n }\n return NIL;\n }\n static Node* NewNode(Key key, Payload val){\n GetNil();\n Node *res = new Node(key, val);\n res->l = res->r = res->p = NIL;\n res->z = 1;\n return res;\n }\n static Node* Construct(std::vector<std::pair<Key, Payload>> val){\n for(size_t i=0; i+1<val.size(); i++) assert(val[i].first < val[i+1].first);\n auto s = [&](auto& s, int l, int r) -> Node* {\n if(l == r) return GetNil();\n int m = (l + r) / 2;\n auto buf = NewNode(std::move(val[m].first), std::move(val[m].second));\n buf->setChildren(s(s,l,m), s(s,m+1,r));\n return buf;\n };\n return s(s, 0, (int)val.size());\n }\n void aggregate(){\n sum = kv.val;\n h = 1; this->z = 1;\n sum = l->sum + sum; this->z += l->z; h = std::max(h, l->h + 1);\n sum = sum + r->sum; this->z += r->z; h = std::max(h, r->h + 1);\n }\n void setChildren(Node* lc, Node* rc){\n l = lc; if(lc != NIL) lc->p = this;\n r = rc; if(rc != NIL) rc->p = this;\n aggregate();\n }\n // if the 2 children have unbalanced height, fix them\n Node* rebalance(){\n auto c = this;\n auto cl = c->l;\n auto cr = c->r;\n if(cl->h + 1 < cr->h){\n auto crl = cr->l;\n auto crr = cr->r;\n if(crl->h <= crr->h){\n cr->p = c->p;\n c->setChildren(cl, crl);\n cr->setChildren(c, crr);\n return cr;\n } else{\n crl->p = c->p;\n c->setChildren(cl, crl->l);\n cr->setChildren(crl->r, crr);\n crl->setChildren(c, cr);\n return crl;\n }\n }\n else if(cl->h > cr->h + 1){\n auto cll = cl->l;\n auto clr = cl->r;\n if(clr->h <= cll->h){\n cl->p = c->p;\n c->setChildren(clr, cr);\n cl->setChildren(cll, c);\n return cl;\n } else{\n clr->p = c->p;\n c->setChildren(clr->r, cr);\n cl->setChildren(cll, clr->l);\n clr->setChildren(cl, c);\n return clr;\n }\n }\n aggregate();\n return this;\n }\n // call rebalance from this node to the root\n Node* rebalanceToRoot(){\n auto c = this;\n while(c->p != NIL){\n auto cp = c->p;\n (cp->l == c ? cp->l : cp->r) = c->rebalance();\n c = cp;\n }\n return c->rebalance();\n }\n Node* next(){\n auto c = this;\n if(c->r != NIL){\n c = c->r;\n while(c->l != NIL) c = c->l;\n return c;\n }\n while(c->p->r == c) c = c->p;\n return c->p;\n }\n Node* prev(){\n auto c = this;\n if(c->l != NIL){\n c = c->l;\n while(c->r != NIL) c = c->r;\n return c;\n }\n while(c->p->l == c) c = c->p;\n return c->p;\n }\n unsigned int index(){\n auto c = this;\n if(c == NIL) return ~0u;\n unsigned int res = c->l->z;\n while(c->p != NIL){\n auto cp = c->p;\n if(cp->r == c) res += cp->l->z + 1;\n c = cp;\n }\n return res;\n }\n // kth node under this, returns alt if not exist\n Node* kth(unsigned int idx, Node* alt){\n if(idx >= this->z) return alt;\n auto c = this;\n while(true){\n if(c->l->z > idx) c = c->l;\n else if(c->l->z == idx) break;\n else{ idx -= c->l->z + 1; c = c->r; }\n }\n return c;\n }\n // most left no-less-than k under this, and the next\n std::pair<Node*, Node*> lBound(Key k){\n Node *ql = NIL;\n Node *qr = NIL;\n auto c = this;\n while(c != NIL){\n if(c->kv.key < k){ ql = c; c = c->r; }\n else{ qr = c; c = c->l; }\n }\n return std::make_pair(ql, qr);\n }\n // most left grater-than k under this, and the next\n std::pair<Node*, Node*> uBound(Key k){\n Node *ql = NIL;\n Node *qr = NIL;\n auto c = this;\n while(c != NIL){\n if(k < c->kv.key){ qr = c; c = c->l; }\n else{ ql = c; c = c->r; }\n }\n return std::make_pair(ql, qr);\n }\n // update the payload and aggregate upto root\n void set(Payload val){\n kv.val = std::move(val);\n auto c = this;\n while(c != NIL){ c->aggregate(); c = c->p; }\n }\n static Node* rootOf(Node* p){\n while(p->p != NIL) p = p->p;\n return p;\n }\n static Payload rangeSumR(Node* l){\n assert(l != NIL);\n Payload res = l->kv.val + l->r->sum;\n auto lp = l->p;\n while(lp != NIL){\n if(lp->l == l) res = res + lp->kv.val + lp->r->sum;\n l = lp; lp = l->p;\n }\n return res;\n }\n static Payload rangeSum(Node* l, Node* r){\n assert(l != NIL);\n assert(r != NIL);\n assert(l != r);\n assert(rootOf(l) == rootOf(r));\n assert(l->index() <= r->index());\n r = r->prev();\n if(l == r) return l->kv.val;\n Payload lsum = l->kv.val;\n Payload rsum = r->kv.val;\n while(l != r){\n if(l->h < r->h){\n Node* lp = l->p;\n lsum = lsum + l->r->sum;\n while(lp->l != l){ l = lp; lp = l->p; }\n if(lp == r) return lsum + rsum;\n lsum = lsum + lp->kv.val;\n l = lp;\n } else {\n Node* rp = r->p;\n rsum = r->l->sum + rsum;\n while(rp->r != r){ r = rp; rp = r->p; }\n if(rp == l) return lsum + rsum;\n rsum = rp->kv.val + rsum;\n r = rp;\n }\n }\n return lsum + rsum;\n }\n template<class Pred>\n static Node* maxRight(Node* l, Pred& pred){\n Payload q = l->kv.val;\n if(!pred(q)) return l;\n while(true){\n Payload q2 = q + l->r->sum;\n if(!pred(q2)) break;\n l = l->p;\n if(l == NIL) return NIL;\n q = q2 + l->kv.val;\n if(!pred(q)) return l;\n }\n auto c = l->r;\n while(c != NIL){\n Payload q2 = q + c->l->sum;\n if(!pred(q2)){ c = c->l; continue; }\n q = q2 + c->kv.val;\n if(!pred(q)) return c;\n c = c->r;\n }\n return NIL;\n }\n void clear(){\n if(this == NIL) return;\n l->clear(); if(l != NIL) delete(l);\n r->clear(); if(r != NIL) delete(r);\n }\n Node* insert(Node* x){\n if(this == NIL) return x;\n auto q = lBound(x->kv.key);\n if(q.first != NIL && q.first->r == NIL){\n q.first->setChildren(q.first->l, x);\n return q.first->rebalanceToRoot();\n }\n q.second->setChildren(x, q.second->r);\n return q.second->rebalanceToRoot();\n }\n Node* erase(Node* ql, Node* qr){\n auto qlp = ql->p;\n Node* res = NIL;\n if(ql->r == NIL){\n auto qll = ql->l;\n if(qll != NIL) qll->p = qlp;\n if(qlp != NIL) (qlp->l == ql ? qlp->l : qlp->r) = qll;\n res = (qlp == NIL ? qll : qlp->rebalanceToRoot());\n } else {\n assert(qr != NIL);\n assert(qr->l == NIL);\n auto qrp = qr->p;\n auto qrr = qr->r;\n if(qlp != NIL) (qlp->l == ql ? qlp->l : qlp->r) = qr;\n qr->p = qlp;\n qr->l = ql->l;\n if(qr->l != NIL) qr->l->p = qr;\n if(ql->r == qr){\n qr->aggregate();\n res = qr->rebalanceToRoot();\n } else {\n (qrp->l == qr ? qrp->l : qrp->r) = qrr;\n if(qrr != NIL) qrr->p = qrp;\n qr->r = ql->r;\n qr->r->p = qr;\n qr->aggregate();\n res = qrp->rebalanceToRoot();\n }\n }\n ql->l = ql->r = ql->p = NIL;\n ql->aggregate();\n return res;\n }\n Node* back(){\n auto c = this;\n while(c->r != NIL) c = c->r;\n return c;\n }\n};\n\n Tree() : rt(0) { rt.p = Node::GetNil(); }\n Tree(std::vector<std::pair<Key, Payload>> init) : rt(0) { rt.p = Node::Construct(std::move(init)); }\n Iterator end(){ return {&rt}; }\n Iterator begin(){\n FNode *p = rt.p->z ? rt.p->kth(0,nullptr) : &rt;\n return {p};\n }\n void clear(){\n if(rt.p != Node::GetNil()){\n rt.p->clear();\n delete(rt.p);\n rt.p = Node::NIL;\n }\n }\n ~Tree(){ clear(); }\n int size() const { return rt.p->z; }\n bool empty() const { return rt.p == Node::NIL; }\n Payload sum(Iterator l, Iterator r, Payload ifnull){\n if(l == r) return ifnull;\n if(r == end()) return Node::rangeSumR(l.p->re());\n return Node::rangeSum(l.p->re(), r.p->re());\n }\n Iterator kth(unsigned int idx){\n auto p = root()->kth(idx, nullptr);\n return p ? Iterator{p} : end();\n }\n Iterator lBound(Key key){\n auto p = root()->lBound(std::move(key)).second;\n return p == Node::NIL ? end() : Iterator{p};\n }\n Iterator uBound(Key key){\n auto p = root()->uBound(std::move(key)).second;\n return p == Node::NIL ? end() : Iterator{p};\n }\n Iterator insert(Key k, Payload v){\n auto x = Node::NewNode(std::move(k), std::move(v));\n rt.p = root()->insert(x);\n return Iterator{ x };\n }\n Iterator erase(Iterator i){\n assert(i != end());\n auto nx = i; ++nx;\n auto nxv = nx == end() ? Node::NIL : nx.p->re();\n rt.p = root()->erase(i.p->re(), nxv);\n delete(i.p->re());\n return nx;\n }\n Iterator changeKey(Iterator i, Key k){\n assert(i != end());\n auto nx = i; ++nx;\n auto ptr = i.p->re();\n auto nxv = nx == end() ? Node::NIL : nx.p->re();\n rt.p = root()->erase(i.p->re(), nxv);\n ptr->kv.key = std::move(k);\n rt.p = root()->insert(i.p->re());\n return i;\n }\n void output(){ root()->output(); }\n \nprivate:\n FNode rt;\n Node* root(){ return rt.p->re(); }\n};\n\n} // namespace nachia\n\n\n#include <vector>\n#include <algorithm>\n\nstruct Key;\nstruct Payload {\n static Payload identity(){ return {}; }\n Payload operator+(Payload) const { return {}; }\n};\nstruct Key {\n char ch;\n int nx;\n};\n\nusing TreeInst = nachia::Tree<Key, Payload>;\nTreeInst globalTree;\nstd::vector<TreeInst::Iterator> globalIters;\nbool operator<(Key l, Key r){\n if(l.ch != r.ch) return l.ch < r.ch;\n if(globalIters[l.nx] == globalTree.end()) return true;\n if(globalIters[r.nx] == globalTree.end()) return false;\n return globalIters[l.nx] < globalIters[r.nx];\n}\n\nint main() {\n using namespace std;\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n int N, M; cin >> N >> M;\n vector<char> C(N);\n for(int i=0; i<N; i++) cin >> C[i];\n vector<vector<int>> nxways(N);\n for(int i=0; i<M; i++){\n int u, v; cin >> u >> v; u--; v--;\n nxways[u].push_back(v);\n }\n\n globalIters.assign(N+1, globalTree.end());\n \n for(int i=N-1; i>=0; i--){\n int nx = i+1;\n for(int j : nxways[i]){\n if(globalIters[j] < globalIters[nx]) nx = j;\n }\n globalIters[i] = globalTree.insert({ C[i], nx }, {});\n }\n\n std::string res;\n auto readPos = globalIters[0];\n while(readPos != globalTree.end()){\n res.push_back(readPos->key.ch);\n readPos = globalIters[readPos->key.nx];\n }\n\n cout << res << '\\n';\n return 0;\n}", "accuracy": 1, "time_ms": 920, "memory_kb": 41148, "score_of_the_acc": -0.4848, "final_rank": 4 }, { "submission_id": "aoj_0438_5868951", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing LL = long long;\nusing ULL = unsigned long long;\n#define rep(i,n) for(int i=0; i<(n); i++)\n\nint N, M;\nchar S[300001];\nvector<int> E[300000];\n\nint Nx[300001];\n\n\nstruct SplayTreeByIdx {\n struct S { int i; };\n static S op(S l, S r) { return {}; }\n static S rev(S p) { return {}; }\n static S e() { return { -1 }; }\n struct F { };\n static S mapping(F f, S x) { return x; }\n static F composition(F f, F x) { return x; }\n static F id() { return {}; }\n struct Node {\n Node* l = 0, * r = 0, * p = 0;\n S a = e();\n S prod = e();\n F f = id();\n bool propagated = true;\n int z = 0;\n int sumz = 0;\n int rev = 0;\n };\n Node* NIL = nullptr;\n Node* R;\n void prepareDown(Node* c) {\n if (!c->propagated) {\n if (c->l != NIL) {\n c->l->prod = mapping(c->f, c->l->prod);\n c->l->f = composition(c->f, c->l->f);\n c->l->propagated = false;\n }\n if (c->r != NIL) {\n c->r->prod = mapping(c->f, c->r->prod);\n c->r->f = composition(c->f, c->r->f);\n c->r->propagated = false;\n }\n c->a = mapping(c->f, c->a);\n c->f = id();\n c->propagated = true;\n }\n if (c->rev) {\n swap(c->l, c->r);\n if (c->l != NIL) {\n c->l->rev ^= 1;\n c->l->prod = rev(c->l->prod);\n }\n if (c->r != NIL) {\n c->r->rev ^= 1;\n c->r->prod = rev(c->r->prod);\n }\n c->rev = 0;\n }\n }\n void prepareUp(Node* c) {\n c->sumz = c->l->sumz + c->r->sumz + 1;\n c->prod = op(op(c->l->prod, c->a), c->r->prod);\n }\n SplayTreeByIdx() {\n if (!NIL) {\n NIL = new Node();\n NIL->l = NIL->r = NIL->p = NIL;\n R = NIL;\n }\n }\n Node*& parentchild(Node* p) {\n if (p->p == NIL) return R;\n if (p->p->l == p) return p->p->l;\n else return p->p->r;\n }\n void rotL(Node* c) {\n Node* p = c->p;\n parentchild(p) = c;\n c->p = p->p; p->p = c;\n if (c->l != NIL) c->l->p = p;\n p->r = c->l; c->l = p;\n }\n void rotR(Node* c) {\n Node* p = c->p;\n parentchild(p) = c;\n c->p = p->p; p->p = c;\n if (c->r != NIL) c->r->p = p;\n p->l = c->r; c->r = p;\n }\n void splay(Node* c) {\n while (c->p != NIL) {\n Node* p = c->p;\n Node* pp = p->p;\n if (p->l == c) {\n if (pp == NIL) { rotR(c); }\n else if (pp->l == p) { rotR(p); rotR(c); }\n else if (pp->r == p) { rotR(c); rotL(c); }\n }\n else {\n if (pp == NIL) { rotL(c); }\n else if (pp->r == p) { rotL(p); rotL(c); }\n else if (pp->l == p) { rotL(c); rotR(c); }\n }\n if (pp != NIL) prepareUp(pp);\n if (p != NIL) prepareUp(p);\n }\n prepareUp(c);\n }\n Node* kth_element(int k) {\n if (k >= R->sumz) return NIL;\n Node* c = R;\n while (true) {\n prepareDown(c);\n auto cl = c->l;\n if (cl->sumz == k) break;\n if (cl->sumz > k) { c = cl; continue; }\n k -= cl->sumz + 1;\n c = c->r;\n }\n prepareDown(c);\n splay(c);\n return c;\n }\n Node* insert_at(int k, S x) {\n Node* nx = new Node(*NIL);\n nx->z = nx->sumz = 1;\n nx->a = nx->prod = x;\n if (k == R->sumz) {\n nx->l = R;\n if (R != NIL) R->p = nx;\n R = nx;\n prepareUp(nx);\n return nx;\n }\n auto p = kth_element(k);\n nx->l = p->l;\n nx->r = p;\n R = nx;\n if (p->l != NIL) {\n prepareDown(p->l);\n p->l->p = nx;\n }\n p->p = nx;\n p->l = NIL;\n prepareUp(p);\n prepareUp(nx);\n return nx;\n }\n void erase_at(int k) {\n if (k >= R->sumz) return;\n auto toerase = NIL;\n if (k == 0) {\n kth_element(0);\n prepareDown(R);\n toerase = R;\n R = R->r;\n if (R != NIL) R->p = NIL;\n }\n else {\n kth_element(k - 1);\n prepareDown(R);\n auto c = R->r;\n prepareDown(c);\n while (c->l != NIL) {\n c = c->l;\n prepareDown(c);\n }\n auto p = c->p;\n toerase = c;\n parentchild(c) = c->r;\n if (c->r != NIL) c->r->p = p;\n splay(p);\n }\n }\n Node* between(int l, int r) {\n if (l >= r) return NIL;\n if (l == 0 && r == R->sumz) return R;\n if (l == 0) return kth_element(r)->l;\n if (r == R->sumz) return kth_element(l - 1)->r;\n auto lp = kth_element(l - 1);\n auto rp = kth_element(r);\n while (rp->l != lp) {\n auto p = lp->p;\n prepareDown(p);\n prepareDown(lp);\n if (p->l == lp) rotR(lp);\n else rotL(lp);\n prepareUp(p);\n prepareUp(lp);\n }\n return lp->r;\n }\n void reverse(int l, int r) {\n if (l >= r) return;\n auto c = between(l, r);\n c->rev ^= 1;\n prepareDown(c);\n splay(c);\n }\n void apply(int l, int r, F f) {\n if (l >= r) return;\n auto c = between(l, r);\n c->prod = mapping(f, c->prod);\n c->f = composition(f, c->f);\n c->propagated = false;\n prepareDown(c);\n splay(c);\n }\n S prod(int l, int r) {\n if (l >= r) return e();\n return between(l, r)->prod;\n }\n\n vector<Node*> A;\n\n int index(int i){\n splay(A[i]);\n return A[i]->l->sumz;\n }\n\t// a < b\n\tbool comp(int a, int b) {\n\t\tif (::S[a] != ::S[b]) return ::S[a] < ::S[b];\n\t\treturn index(Nx[a]) < index(Nx[b]);\n\t}\n \n\tvoid init() {\n A.resize(N+1);\n\t\tNx[N] = N;\n A[N] = insert_at(0, {N});\n\t\tfor (int i = N - 1; i >= 0; i--) {\n\t\t\tpair<int, int> nx = { N * 2,N };\n\t\t\tfor (int e : E[i]) nx = min(nx, make_pair(index(e), e));\n\t\t\tNx[i] = nx.second;\n\t\t\tint l = 0, r = N-i+1;\n\t\t\twhile (l + 1 < r) {\n\t\t\t\tint m = (l + r) / 2;\n\t\t\t\tif (comp(kth_element(m - 1)->a.i, i)) l = m;\n\t\t\t\telse r = m;\n\t\t\t}\n A[i] = insert_at(l, {i});\n\t\t}\n\t}\n};\n\nint main() {\n\tscanf(\"%d%d\", &N, &M);\n\trep(i, N) scanf(\" %c\", &S[i]); S[N] = 0;\n\trep(i, N - 1) E[i].push_back(i + 1);\n\trep(i, M) {\n\t\tint u, v; scanf(\"%d%d\", &u, &v); u--; v--;\n\t\tif (u + 1 == v) continue;\n\t\tE[u].push_back(v);\n\t}\n\n\tSplayTreeByIdx G; G.init();\n\n\tint p = 0;\n\twhile (p != N) {\n\t\tprintf(\"%c\", S[p]);\n\t\tp = Nx[p];\n\t}\n\tprintf(\"\\n\");\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 2130, "memory_kb": 43280, "score_of_the_acc": -0.9873, "final_rank": 12 }, { "submission_id": "aoj_0438_5868729", "code_snippet": "#include <bits/stdc++.h>\n\ntemplate <class T> using Vec = std::vector<T>;\n\nusing u64 = std::uint64_t;\n\nu64 xorshift() {\n static u64 cur = 904;\n cur ^= cur << 9;\n cur ^= cur >> 7;\n return cur;\n}\n\nstruct Node;\nusing Ptr = std::unique_ptr<Node>;\nusing Weak = Node*;\n\nstruct Node {\n char front;\n int link;\n int size;\n u64 priority;\n Ptr left, right;\n Weak parent;\n explicit Node(char f, int l) : front(f), link(l), size(1), priority(xorshift()), left(), right(), parent(nullptr) {}\n};\n\nint get_size(const Ptr& p) { return p ? p->size : 0; }\n\nvoid reset(Ptr& p) {\n if (p->left) {\n p->left->parent = p.get();\n }\n if (p->right) {\n p->right->parent = p.get();\n }\n p->size = get_size(p->left) + 1 + get_size(p->right);\n}\n\nvoid rotate_right(Ptr& p) {\n Ptr q = std::move(p->left);\n q->parent = nullptr;\n p->left = std::move(q->right);\n reset(p);\n q->right = std::move(p);\n p = std::move(q);\n reset(p);\n}\n\nvoid rotate_left(Ptr& p) {\n Ptr q = std::move(p->right);\n q->parent = nullptr;\n p->right = std::move(q->left);\n reset(p);\n q->left = std::move(p);\n p = std::move(q);\n reset(p);\n}\n\ntemplate <class F> struct RecLambda : private F {\n explicit RecLambda(F&& f) : F(std::forward<F>(f)) {}\n template <class... Args> decltype(auto) operator()(Args&&... args) const {\n return F::operator()(*this, std::forward<Args>(args)...);\n }\n};\n\ntemplate <class F> decltype(auto) rec_lambda(F&& f) {\n using G = std::decay_t<F>;\n return RecLambda<G>(std::forward<G>(f));\n}\n\nint main() {\n int N, M;\n std::cin >> N >> M;\n Vec<char> C(N);\n for (auto& x : C) {\n std::cin >> x;\n }\n Vec<Vec<int>> to(N);\n while (M--) {\n int u, v;\n std::cin >> u >> v;\n to[u - 1].push_back(v - 1);\n }\n Ptr root;\n Vec<Weak> ptr(N + 1, nullptr);\n const auto calc_pos = [&](const int i) {\n if (i == N) return -1;\n Weak p = ptr[i];\n int ret = get_size(p->left);\n while (p->parent) {\n Weak q = p->parent;\n if (p == q->right.get()) {\n ret += get_size(q->left) + 1;\n }\n p = q;\n }\n return ret;\n };\n root = std::make_unique<Node>(C[N - 1], N);\n ptr[N - 1] = root.get();\n for (int i = N - 2; i >= 0; --i) {\n int min_pos = calc_pos(i + 1);\n int link = i + 1;\n for (const auto j : to[i]) {\n const int tmp = calc_pos(j);\n if (min_pos > tmp) {\n min_pos = tmp;\n link = j;\n }\n }\n ptr[i] = rec_lambda([&](auto&& dfs, Ptr& p) -> Weak {\n if (!p) {\n p = std::make_unique<Node>(C[i], link);\n return p.get();\n }\n if (p->front < C[i] or (p->front == C[i] and calc_pos(p->link) < min_pos)) {\n const auto ret = dfs(p->right);\n reset(p);\n if (p->priority < p->right->priority) {\n rotate_left(p);\n }\n return ret;\n } else {\n const auto ret = dfs(p->left);\n reset(p);\n if (p->priority < p->left->priority) {\n rotate_right(p);\n }\n return ret;\n }\n })(root);\n }\n Weak p = ptr[0];\n while (p) {\n std::cout << p->front;\n p = ptr[p->link];\n }\n std::cout << '\\n';\n return 0;\n}", "accuracy": 1, "time_ms": 1230, "memory_kb": 40796, "score_of_the_acc": -0.6099, "final_rank": 6 }, { "submission_id": "aoj_0438_5868092", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int N,M;\n cin >> N >> M;\n vector<char> c(N);\n for(int i=0;i<N;i++) cin >> c[i];\n vector<vector<int>> G(N);\n for(int i=0;i<M;i++){\n int u,v;\n cin >> u >> v;\n G[u-1].push_back(v-1);\n }\n map<int,string> dp;\n dp[N-1] = c[N-1];\n for(int i=N-2;i>=0;i--){\n string T = \"\";\n T += c[i];\n T += dp[i+1];\n dp[i] = T;\n if(G[i].size() == 0) continue;\n for(auto nv:G[i]){\n string S = \"\";\n S += c[i];\n S += dp[nv];\n dp[i] = min(dp[i],S);\n }\n }\n cout << dp[0] << endl;\n}", "accuracy": 0.3939393939393939, "time_ms": 180, "memory_kb": 55276, "score_of_the_acc": -0.2401, "final_rank": 18 }, { "submission_id": "aoj_0438_5868083", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int N,M;\n cin >> N >> M;\n vector<char> c(N);\n for(int i=0;i<N;i++) cin >> c[i];\n vector<vector<int>> G(N);\n for(int i=0;i<M;i++){\n int u,v;\n cin >> u >> v;\n G[u-1].push_back(v-1);\n }\n map<int,string> dp;\n dp[N-1] = c[N-1];\n for(int i=N-2;i>=0;i--){\n string T = \"\";\n T += c[i];\n T += dp[i+1];\n dp[i] = T;\n for(auto nv:G[i]){\n string S = \"\";\n S += c[i];\n S += dp[nv];\n dp[i] = min(dp[i],S);\n }\n }\n cout << dp[0] << endl;\n}", "accuracy": 0.3939393939393939, "time_ms": 170, "memory_kb": 55240, "score_of_the_acc": -0.2359, "final_rank": 17 }, { "submission_id": "aoj_0438_5868074", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int N,M;\n cin >> N >> M;\n vector<char> c(N);\n for(int i=0;i<N;i++) cin >> c[i];\n vector<vector<int>> G(N);\n for(int i=0;i<M;i++){\n int u,v;\n cin >> u >> v;\n G[u-1].push_back(v-1);\n }\n vector<string> dp(N,\"\");\n dp[N-1] += c[N-1];\n for(int i=N-2;i>=0;i--){\n dp[i] += c[i];\n dp[i] += dp[i+1];\n for(auto nv:G[i]){\n string S = \"\";\n S += c[i];\n S += dp[nv];\n dp[i] = min(dp[i],S);\n }\n }\n cout << dp[0] << endl;\n}", "accuracy": 0.3939393939393939, "time_ms": 110, "memory_kb": 50452, "score_of_the_acc": -0.192, "final_rank": 15 }, { "submission_id": "aoj_0438_5867963", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int LOG = 20;\nconst long long MOD = 1000000007;\nconst long long BASE = 1000000;\nint main(){\n int N, M;\n cin >> N >> M;\n vector<char> c(N);\n for (int i = 0; i < N; i++){\n cin >> c[i];\n }\n vector<vector<int>> E(N);\n for (int i = 0; i < M; i++){\n int u, v;\n cin >> u >> v;\n u--;\n v--;\n if (v - u > 1){\n E[u].push_back(v);\n }\n }\n vector<vector<int>> p(LOG, vector<int>(N, -1));\n vector<vector<long long>> hash(LOG, vector<long long>(N, 0));\n for (int i = 0; i < N; i++){\n hash[0][i] = c[i];\n }\n for (int i = N - 2; i >= 0; i--){\n int nxt = i + 1;\n for (int v : E[i]){\n int a = v, b = nxt;\n for (int j = LOG - 1; j >= 0; j--){\n if (p[j][a] != -1 && p[j][b] != -1){\n if (hash[j][a] == hash[j][b]){\n a = p[j][a];\n b = p[j][b];\n }\n }\n }\n if (c[a] < c[b] || c[a] == c[b] && a == N - 1){\n nxt = v;\n }\n }\n p[0][i] = nxt;\n long long c = BASE;\n for (int j = 0; j < LOG - 1; j++){\n if (p[j][i] != -1){\n p[j + 1][i] = p[j][p[j][i]];\n hash[j + 1][i] = (hash[j][i] + hash[j][p[j][i]] * c) % MOD;\n }\n c = c * c % MOD;\n }\n }\n string ans;\n for (int v = 0; v != -1; v = p[0][v]){\n ans += c[v];\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 270, "memory_kb": 92400, "score_of_the_acc": -0.4276, "final_rank": 2 }, { "submission_id": "aoj_0438_5867948", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int LOG = 19;\nconst long long MOD = 1000000007;\nconst long long BASE = 1000000;\nint main(){\n int N, M;\n cin >> N >> M;\n vector<char> c(N);\n for (int i = 0; i < N; i++){\n cin >> c[i];\n }\n vector<vector<int>> E(N);\n for (int i = 0; i < M; i++){\n int u, v;\n cin >> u >> v;\n u--;\n v--;\n E[u].push_back(v);\n }\n vector<vector<int>> p(LOG, vector<int>(N, -1));\n vector<vector<long long>> hash(LOG, vector<long long>(N, 0));\n for (int i = 0; i < N; i++){\n hash[0][i] = c[i];\n }\n for (int i = N - 2; i >= 0; i--){\n int nxt = i + 1;\n for (int v : E[i]){\n if (c[v] < c[nxt]){\n nxt = v;\n } else if (c[v] == c[nxt]){\n int a = v, b = nxt;\n for (int j = LOG - 1; j >= 0; j--){\n if (p[j][a] != -1 && p[j][b] != -1){\n if (hash[j][a] == hash[j][b]){\n a = p[j][a];\n b = p[j][b];\n }\n }\n }\n if (c[a] < c[b] || c[a] == c[b] && a == N - 1){\n nxt = v;\n }\n }\n }\n p[0][i] = nxt;\n long long c = BASE;\n for (int j = 0; j < LOG - 1; j++){\n if (p[j][i] != -1){\n p[j + 1][i] = p[j][p[j][i]];\n hash[j + 1][i] = (hash[j][i] + hash[j][p[j][i]] * c) % MOD;\n }\n c = c * c % MOD;\n }\n }\n string ans;\n for (int v = 0; v != -1; v = p[0][v]){\n ans += c[v];\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 270, "memory_kb": 88960, "score_of_the_acc": -0.4136, "final_rank": 1 }, { "submission_id": "aoj_0438_5503278", "code_snippet": "#define READ_FROM_FILE 0\n\n#include <fstream>\n#include <iostream>\n#include <string>\n#include <vector>\n#include <regex>\n\n\nint main() {\n#if READ_FROM_FILE\n std::string filename = \"/home/ichino/data/workspace/AizuOnlineJudgeCpp/test1.txt\";\n std::ifstream ifs(filename);\n#endif\n int n = - 1;\n int m = - 1;\n std::string buf;\n std::string c_str;\n std::istringstream ss;\n std::vector<std::vector<int> > airline_vec;\n std::vector<std::string> s_vec;\n\n\n#if READ_FROM_FILE\n std::getline(ifs, buf);\n ss = std::istringstream(buf);\n ss >> n >> m;\n\n std::getline(ifs, c_str);\n\n airline_vec.resize(n);\n\n for(int k = 0; k < m; k++){\n int i = - 1;\n int j = - 1;\n\n std::getline(ifs, buf);\n ss = std::istringstream(buf);\n ss >> i >> j;\n\n airline_vec[i - 1].push_back(j - 1);\n }\n#else\n std::getline(std::cin, buf);\n ss = std::istringstream(buf);\n ss >> n >> m;\n\n std::getline(std::cin, c_str);\n\n airline_vec.resize(n);\n\n for(int k = 0; k < m; k++){\n int i = - 1;\n int j = - 1;\n\n std::getline(std::cin, buf);\n ss = std::istringstream(buf);\n ss >> i >> j;\n\n airline_vec[i - 1].push_back(j - 1);\n }\n#endif\n c_str = std::regex_replace(c_str, std::regex(\" \"), \"\");\n s_vec.resize(n);\n\n s_vec.back().push_back(c_str[n - 1]);\n\n for(int i = n - 2; i >= 0; i--) {\n std::string tmp_str(1, c_str[i]);\n\n s_vec[i] = tmp_str + s_vec[i + 1];\n\n for(int j = 0; j < airline_vec[i].size(); j++) {\n std::string str_j = tmp_str + s_vec[airline_vec[i][j]];\n\n if(s_vec[i] > str_j) {\n s_vec[i] = str_j;\n }\n }\n }\n\n std::cout << s_vec[0] << std::endl;\n\n return 0;\n}", "accuracy": 0.3939393939393939, "time_ms": 170, "memory_kb": 50760, "score_of_the_acc": -0.2177, "final_rank": 16 }, { "submission_id": "aoj_0438_4986206", "code_snippet": "#include <cmath>\n#include <vector>\n#include <iostream>\n#include <algorithm>\n#include <set>\n#include <iomanip>\n#include <queue>\n#include <string>\n#include <map>\n#include <fstream>\n#include <cassert>\n#include <stack>\n#include <climits>\n#include <array>\n#include <unordered_set>\n#include <unordered_map>\n#include <memory>\n#include <functional>\n#include <cfloat>\n#include <numeric>\n#include <random>\ntemplate<typename T>\nclass Treap {\npublic:\n\tTreap(std::function<bool(const T&, const T&)> comparator) : comparator(comparator), rand{ 0 } {};\n\tstruct Node {\n\t\tint prioriy;\n\t\tint size;\n\t\tT value;\n\t\tNode* parent, * left, * right;\n\t};\n\tNode* const insert(const T& new_value) {\n\t\troot = insert_inner(root, new_value);\n\t\treturn temp;\n\t}\n\tint calc_rank(Node* const node) const {\n\t\treturn size_of(node->left) + calc_rank(node->parent, node);\n\t}\nprivate:\n\tstd::function<bool(const T&, const T&)> comparator;\n\tNode* root{ nullptr }, *temp{ nullptr };\n\tstd::mt19937 rand;\n\tstd::uniform_int_distribution<int> dist;\n\tNode* insert_inner(Node* current, const T& value) {\n\t\tif (current) {\n\t\t\tif (comparator(value, current->value)) {\n\t\t\t\tcurrent->left = insert_inner(current->left, value);\n\t\t\t\tcurrent->left->parent = current;\n\t\t\t\t++current->size;\n\t\t\t\tif (current->left->prioriy > current->prioriy) {\n\t\t\t\t\treturn rotate_right(current);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\treturn current;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcurrent->right = insert_inner(current->right, value);\n\t\t\t\tcurrent->right->parent = current;\n\t\t\t\t++current->size;\n\t\t\t\tif (current->right->prioriy > current->prioriy) {\n\t\t\t\t\treturn rotate_left(current);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\treturn current;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\treturn temp = new Node{ dist(rand), 1, value, nullptr, nullptr, nullptr };\n\t\t}\n\t}\n\tNode* rotate_left(Node* root) {\n\t\tconst auto right = root->right;\n\t\troot->right = right->left;\n\t\tif (root->right) root->right->parent = root;\n\t\tright->left = root;\n\t\tright->parent = root->parent;\n\t\troot->parent = right;\n\t\tright->size = root->size;\n\t\troot->size = size_of(root->left) + size_of(root->right) + 1;\n\t\treturn right;\n\t}\n\tNode* rotate_right(Node* root) {\n\t\tconst auto left = root->left;\n\t\troot->left = left->right;\n\t\tif (root->left) root->left->parent = root;\n\t\tleft->right = root;\n\t\tleft->parent = root->parent;\n\t\troot->parent = left;\n\t\tleft->size = root->size;\n\t\troot->size = size_of(root->left) + size_of(root->right) + 1;\n\t\treturn left;\n\t}\n\tint calc_rank(Node* const current, Node* const target) const {\n\t\tif (current) {\n\t\t\tif (current->right == target) return calc_rank(current->parent, current) + size_of(current->left) + 1;\n\t\t\telse return calc_rank(current->parent, current);\n\t\t}\n\t\telse return 0;\n\t\t\n\t}\n\tint size_of(Node* const node) const {\n\t\treturn node ? node->size : 0;\n\t}\n};\n\n\n\nint main() {\n\tint n, m; std::cin >> n >> m;\n\tstd::vector<char> country(n);\n\tfor (auto& c : country) std::cin >> c;\n\tcountry.push_back('\\0');\n\tstd::vector<std::vector<int>> next(n + 1);\n\tfor (auto i = 0; i < m; ++i) {\n\t\tint u, v; std::cin >> u >> v; --u; --v;\n\t\tnext[u].push_back(v);\n\t}\n\tfor (auto i = 0; i < n; ++i) {\n\t\tnext[i].push_back(i + 1);\n\t}\n\tstd::vector<int> next_min(n + 1, -1);\n\tstd::vector<Treap<int>::Node*> node(n + 1);\n\tTreap<int>* treap{ nullptr };\n\tconst auto comparator = [&treap, &country, &next_min, &node](const int i, const int j) {\n\t\tif (i == j) return false;\n\t\tif (country[i] != country[j]) return country[i] < country[j];\n\t\tif (next_min[i] == next_min[j]) return false;\n\t\treturn treap->calc_rank(node[next_min[i]]) < treap->calc_rank(node[next_min[j]]);\n\t};\n\ttreap = new Treap<int>(comparator);\n\tnode[n] = treap->insert(n);\n\tfor (auto i = n - 1; i >= 0; --i) {\n\t\tstd::sort(next[i].begin(), next[i].end(), comparator);\n\t\tnext_min[i] = *std::min_element(next[i].begin(), next[i].end(), comparator);\n\t\tnode[i] = treap->insert(i);\n\t}\n\tfor (auto i = 0; i != n; i = next_min[i]) {\n\t\tstd::cout << country[i];\n\t}\n\tstd::cout << std::endl;\n}", "accuracy": 1, "time_ms": 1590, "memory_kb": 37904, "score_of_the_acc": -0.7451, "final_rank": 7 }, { "submission_id": "aoj_0438_4968028", "code_snippet": "// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0438\n\n#include<bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\n#ifndef call_from_test\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n\n//BEGIN CUT HERE\ntemplate<typename T=int>\nvector<T> read(size_t n){\n vector<T> ts(n);\n for(size_t i=0;i<n;i++) cin>>ts[i];\n return ts;\n}\n//END CUT HERE\n#ifndef call_from_test\nsigned main(){\n return 0;\n}\n#endif\n\n#ifndef call_from_test\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\ntemplate<typename Impl, typename Data, typename Node, size_t LIM>\nstruct RBST{\n using u32 = uint32_t;\n u32 xor128(){\n static u32 x = 123456789;\n static u32 y = 362436069;\n static u32 z = 521288629;\n static u32 w = 88675123;\n\n u32 t = x ^ (x << 11);\n x = y; y = z; z = w;\n return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));\n }\n\n alignas(Node) static inline char pool[sizeof(Node)*LIM];\n static inline Node* ptr = (Node*)pool;\n static inline size_t size;\n\n template<typename... Args>\n inline Node* create(Args&&... args){\n return new (ptr+size++) Node(std::forward<Args>(args)...);\n }\n\n inline size_t count(const Node *t){return Data::count(t);}\n\n inline Node* touch(Node *t){\n return static_cast<Impl*>(this)->touch(t);\n }\n\n inline void toggle(Node *t){\n return static_cast<Impl*>(this)->toggle(t);\n }\n\n inline Node* pushup(Node *t){\n return static_cast<Impl*>(this)->pushup(t);\n }\n\n Node* toggle(Node *a,size_t l,size_t r){\n auto s=split(a,l);\n auto t=split(s.second,r-l);\n auto u=touch(t.first);\n toggle(u);\n return merge(s.first,merge(u,t.second));\n }\n\n Node* merge(Node* a,Node* b){\n if(a==nullptr) return b;\n if(b==nullptr) return a;\n if(xor128()%(count(a)+count(b))<count(a)){\n a=touch(a);\n a->r=merge(a->r,b);\n a->r->p=a;\n return pushup(a);\n }\n b=touch(b);\n b->l=merge(a,b->l);\n b->l->p=b;\n return pushup(b);\n }\n\n pair<Node*, Node*> split(Node* a,size_t k){\n if(a==nullptr) return make_pair(a,a);\n a=touch(a);\n if(k<=count(a->l)){\n if(a->l) a->l->p=nullptr;\n auto s=split(a->l,k);\n a->l=s.second;\n if(a->l) a->l->p=a;\n return make_pair(s.first,pushup(a));\n }\n if(a->r) a->r->p=nullptr;\n auto s=split(a->r,k-(count(a->l)+1));\n a->r=s.first;\n if(a->r) a->r->p=a;\n return make_pair(pushup(a),s.second);\n }\n\n Node* insert(Node *a,size_t k,Node v){\n Node* b=create(v);\n auto s=split(a,k);\n return merge(merge(s.first,b),s.second);\n }\n\n Node* erase(Node *a,size_t k){\n assert(k<count(a));\n auto s=split(a,k);\n auto t=split(s.second,1);\n return merge(s.first,t.second);\n }\n\n Node* find_by_order(Node *a,size_t k){\n assert(k<count(a));\n a=touch(a);\n size_t num=count(a->l);\n if(k<num) return find_by_order(a->l,k);\n if(k>num) return find_by_order(a->r,k-(num+1));\n return a;\n }\n\n inline bool is_right(Node* a){\n return a->p and a->p->r==a;\n }\n\n size_t order_of_key(Node* a){\n size_t res=count(a->l);\n while(a){\n if(is_right(a)) res+=count(a->p->l)+1;\n a=a->p;\n }\n return res;\n }\n\n Node* build(size_t l,size_t r,const vector<Node> &vs){\n if(l+1==r) return create(vs[l]);\n size_t m=(l+r)>>1;\n return merge(build(l,m,vs),build(m,r,vs));\n }\n\n Node* build(const vector<Node> &vs){\n return build(0,vs.size(),vs);\n }\n\n template<typename T>\n Node* set_val(Node *a,size_t k,T val){\n assert(k<count(a));\n a=touch(a);\n size_t num=count(a->l);\n if(k<num) a->l=set_val(a->l,k,val);\n if(k>num) a->r=set_val(a->r,k-(num+1),val);\n if(k==num) a->val=val;\n return pushup(a);\n }\n\n Node* get_val(Node *a,size_t k){\n assert(k<count(a));\n a=touch(a);\n size_t num=count(a->l);\n if(k<num) return get_val(a->l,k);\n if(k>num) return get_val(a->r,k-(num+1));\n return a;\n }\n\n template<typename E>\n Node* update(Node *a,size_t l,size_t r,E v){\n auto s=split(a,l);\n auto t=split(s.second,r-l);\n auto u=touch(t.first);\n propagate(u,v);\n return merge(s.first,merge(u,t.second));\n }\n\n decltype(auto) query(Node *&a,size_t l,size_t r){\n auto s=split(a,l);\n auto t=split(s.second,r-l);\n auto u=t.first;\n auto res=static_cast<Impl*>(this)->query(u);\n a=merge(s.first,merge(u,t.second));\n return res;\n }\n};\n//END CUT HERE\n#ifndef call_from_test\n//INSERT ABOVE HERE\nsigned main(){\n return 0;\n}\n#endif\n\n#ifndef call_from_test\n#include <bits/stdc++.h>\nusing namespace std;\n#endif\n//BEGIN CUT HERE\ntemplate<typename T>\nstruct Array{\n struct Node{\n Node *l,*r,*p;\n size_t cnt;\n bool rev;\n T val;\n Node(T val):\n cnt(1),rev(0),val(val){l=r=p=nullptr;}\n };\n\n static inline size_t count(const Node *t){\n return t?t->cnt:0;\n }\n\n inline void toggle(Node *t){\n swap(t->l,t->r);\n t->rev^=1;\n }\n\n inline bool dirty(Node *t){\n return t->rev;\n }\n\n inline Node* eval(Node* t){\n if(t->rev){\n if(t->l) toggle(t->l);\n if(t->r) toggle(t->r);\n t->rev=false;\n }\n return t;\n }\n\n inline Node* pushup(Node *t){\n t->cnt=count(t->l)+1+count(t->r);\n return t;\n }\n\n inline T reflect(Node *t){\n assert(t);\n return t->val;\n }\n\n void dump(typename vector<Node>::iterator it,Node* const t,bool rev){\n if(!count(t)) return;\n\n Node *l=t->l,*r=t->r;\n if(rev) swap(l,r);\n rev^=t->rev;\n\n dump(it,l,rev);\n *(it+count(l))=Node(t->val);\n dump(it+count(l)+1,r,rev);\n }\n\n vector<Node> dump(Node* t){\n assert(t!=nullptr);\n vector<Node> vs(count(t),*t);\n dump(vs.begin(),t,false);\n return vs;\n }\n};\n//END CUT HERE\n#ifndef call_from_test\n//INSERT ABOVE HERE\nsigned main(){\n return 0;\n}\n#endif\n\n#ifndef call_from_test\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define call_from_test\n#include \"../rbst.cpp\"\n#undef call_from_test\n\n#endif\n//BEGIN CUT HERE\ntemplate<typename Data, size_t LIM>\nstruct Basic : RBST<Basic<Data, LIM>, Data, typename Data::Node, LIM>{\n using super = RBST<Basic, Data, typename Data::Node, LIM>;\n using Node = typename Data::Node;\n\n Data data;\n\n template<class... Args>\n Basic(Args... args):data(forward<Args>(args)...){}\n\n inline Node* touch(Node *t){return data.eval(t);}\n\n using super::toggle;\n inline void toggle(Node *t){return data.toggle(t);}\n inline Node* pushup(Node *t){return data.pushup(t);}\n\n inline decltype(auto) get_val(Node *a,size_t k){\n return data.reflect(super::get_val(a,k));\n }\n\n using super::query;\n inline decltype(auto) query(Node *a){\n return data.reflect(a);\n }\n};\n//END CUT HERE\n#ifndef call_from_test\n//INSERT ABOVE HERE\nsigned main(){\n return 0;\n}\n#endif\n\n#undef call_from_test\n\nstruct T;\nusing Node = Array<T>::Node;\n\nstruct T{\n Node* nxt;\n char c;\n T():nxt(nullptr){}\n T(Node* nxt,char c):nxt(nxt),c(c){}\n};\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n int n,m;\n cin>>n>>m;\n auto cs=read<char>(n);\n\n vector<vector<int>> G(n);\n for(int i=0;i+1<n;i++)\n G[i].emplace_back(i+1);\n\n for(int i=0;i<m;i++){\n int u,v;\n cin>>u>>v;\n u--;v--;\n G[u].emplace_back(v);\n }\n\n const size_t LIM = 1e6;\n using Data = Array<T>;\n Basic<Data, LIM> H;\n vector<Node*> ps(n,nullptr);\n ps[n-1]=H.create(Node(T(nullptr,cs[n-1])));\n auto R=ps[n-1];\n\n for(int i=n-2;i>=0;i--){\n auto nxt=ps[i+1];\n\n auto comp1=[&](Node* a,Node* b){\n return H.order_of_key(a)<H.order_of_key(b);\n };\n\n for(int j:G[i])\n if(comp1(ps[j],nxt)) nxt=ps[j];\n\n ps[i]=H.create(Node(T(nxt,cs[i])));\n\n auto comp2=[&](Node* a,Node* b){\n if(a->val.c!=b->val.c) return (a->val.c)<(b->val.c);\n if(a->val.nxt==b->val.nxt) return false;\n if(!a->val.nxt) return true;\n if(!b->val.nxt) return false;\n return comp1(a->val.nxt,b->val.nxt);\n };\n\n int l=-1,r=n-(i+1);\n // comp(ps[i], l) : false\n // comp(ps[i], r) : true\n while(l+1<r){\n int m=(l+r)>>1;\n auto p=H.find_by_order(R,m);\n if(comp2(ps[i],p)) r=m;\n else l=m;\n }\n auto s=H.split(R,r);\n R=H.merge(H.merge(s.first,ps[i]),s.second);\n }\n\n auto cur=ps[0];\n while(cur){\n cout<<(cur->val.c);\n cur=cur->val.nxt;\n }\n cout<<endl;\n return 0;\n}", "accuracy": 1, "time_ms": 1870, "memory_kb": 41780, "score_of_the_acc": -0.8751, "final_rank": 10 }, { "submission_id": "aoj_0438_4943543", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nstruct RollingHash {\n static const uint64_t mod = (1ull << 61ull) - 1;\n using uint128_t = __uint128_t;\n vector< uint64_t > hashed, power;\n const uint64_t base;\n static inline uint64_t add(uint64_t a, uint64_t b){\n if((a += b) >= mod) a -= mod;\n return a;\n }\n static inline uint64_t mul(uint64_t a, uint64_t b){\n uint128_t c = (uint128_t) a * b;\n return add(c >> 61, c & mod);\n }\n static inline uint64_t generate_base() {\n mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());\n uniform_int_distribution< uint64_t > rand(1, RollingHash::mod - 1);\n return rand(mt);\n }\n RollingHash() = default;\n RollingHash(const string &s, uint64_t base) : base(base) {\n size_t sz = s.size();\n hashed.assign(sz + 1, 0);\n power.assign(sz + 1, 0);\n power[0] = 1;\n for(int i = 0; i < sz; i++) {\n power[i + 1] = mul(power[i], base);\n hashed[i + 1] = add(mul(hashed[i], base), s[i]);\n }\n }\n template< typename T >\n RollingHash(const vector< T > &s, uint64_t base) : base(base) {\n size_t sz = s.size();\n hashed.assign(sz + 1, 0);\n power.assign(sz + 1, 0);\n power[0] = 1;\n for(int i = 0; i < sz; i++) {\n power[i + 1] = mul(power[i], base);\n hashed[i + 1] = add(mul(hashed[i], base), s[i]);\n }\n }\n uint64_t query(int l, int r) const {\n return add(hashed[r], mod - mul(hashed[l], power[r - l]));\n }\n uint64_t combine(uint64_t h1, uint64_t h2, size_t h2len) const {\n return add(mul(h1, power[h2len]), h2);\n }\n int lcp(const RollingHash &b, int l1, int r1, int l2, int r2) const {\n assert(base == b.base);\n int len = min(r1 - l1, r2 - l2);\n int low = 0, high = len + 1;\n while(high - low > 1) {\n int mid = (low + high) / 2;\n if(query(l1, l1 + mid) == b.query(l2, l2 + mid)) low = mid;\n else high = mid;\n }\n return low;\n }\n};\n#define ll long long\n#define all(a) (a).begin(),(a).end()\n#define fi(g,n) for(int i=g;i<n;i++)\n#define fj(g,n) for(int j=g;j<n;j++)\n#define vc(a,z) vector<a> v(z,0)\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n int n,m,a,b,pos,aa,bb;\n cin>>n>>m;\n vector<char> c(n);\n fi(0,n){\n cin>>c[i];\n }\n RollingHash rh(c,RollingHash::generate_base());\n vector<vector<int>> load(n+1);\n fi(0,m){\n cin>>a>>b;\n --a;\n --b;\n load[a].emplace_back(b);\n }\n vector<vector<uint64_t>> hash(n+1,vector<uint64_t>(31));\n vector<vector<int>> next(n+1,vector<int>(31,-1));\n vector<int> siz(n+1);\n for(int i=n-2;i>=0;--i){\n pos=i+1;\n for(auto p:load[i]){\n if(c[pos]==c[p]){\n a=pos;\n b=p;\n if(siz[a]>siz[b]) swap(a,b);\n aa=a;\n bb=b;\n for(int j=25;j>=0;--j){\n if(next[a][j]!=-1){\n if(hash[a][j]==hash[b][j]){\n a=next[a][j];\n b=next[b][j];\n }\n }\n }\n if(next[a][0]==-1) pos=aa;\n else if(c[next[a][0]]<c[next[b][0]]) pos=aa;\n else pos=bb;\n }else if(c[pos]>c[p]){\n pos=p;\n }\n }\n next[i][0]=pos;\n hash[i][0]=rh.query(pos,pos+1);\n siz[i]=siz[pos]+1;\n fj(0,25){\n if(next[i][j]!=-1){\n next[i][j+1]=next[next[i][j]][j];\n hash[i][j+1]=rh.combine(hash[i][j],hash[next[i][j]][j],(1<<j));\n }else{\n next[i][j+1]=-1;\n }\n }\n }\n string ans;\n pos=0;\n while(pos!=-1){\n ans.push_back(c[pos]);\n pos=next[pos][0];\n }\n cout<<ans<<'\\n';\n return 0;\n}", "accuracy": 1, "time_ms": 480, "memory_kb": 157292, "score_of_the_acc": -0.7768, "final_rank": 8 }, { "submission_id": "aoj_0438_4939899", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 1000000000000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define SIZE 300005\n#define NUM1 1000000007\n#define NUM2 99999883\n#define POW_MAX 19\n\nstruct Info{\n\tull hash_1,hash_2;\n};\n\nint N,M;\nint POW2[POW_MAX+1];\nint NEXT[SIZE][POW_MAX];\nchar word[SIZE];\null POW[SIZE][2],HASH[SIZE][POW_MAX][2],LENGTH[SIZE][POW_MAX];\nvector<int> G[SIZE];\n\nvoid calc_POW(){\n\n\tPOW[0][0] = 1;\n\tPOW[0][1] = 1;\n\n\tfor(int i = 1; i <= N; i++){\n\n\t\tPOW[i][0] = POW[i-1][0]*NUM1;\n\t\tPOW[i][1] = POW[i-1][1]*NUM2;\n\t}\n}\n\nbool is_smaller(int a,int b){\n\n\tif(word[a] != word[b]){\n\t\treturn word[a] < word[b];\n\t}\n\n\tint tmp_a = a,tmp_b = b;\n\n\t//文字列が一致する最大長を求める\n\twhile(true){\n\n\t\tint left = 0,right = POW_MAX-1,mid = (left+right)/2;\n\t\tint tmp_pow = -1;\n\n\t\twhile(left <= right){\n\n\t\t\tint a_next = NEXT[tmp_a][mid];\n\t\t\tint b_next = NEXT[tmp_b][mid];\n\n\t\t\tif(a_next == -1 || b_next == -1){\n\n\t\t\t\tright = mid-1;\n\n\t\t\t}else{\n\n\t\t\t\tif(HASH[tmp_a][mid][0] == HASH[tmp_b][mid][0] &&\n\t\t\t\t\t\tHASH[tmp_a][mid][1] == HASH[tmp_b][mid][1]){\n\n\t\t\t\t\ttmp_pow = mid;\n\t\t\t\t\tleft = mid+1;\n\n\t\t\t\t}else{\n\n\t\t\t\t\tright = mid-1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tmid = (left+right)/2;\n\t\t}\n\t\tif(tmp_pow == -1)break;\n\n\t\ttmp_a = NEXT[tmp_a][tmp_pow];\n\t\ttmp_b = NEXT[tmp_b][tmp_pow];\n\t}\n\ttmp_a = NEXT[tmp_a][0];\n\ttmp_b = NEXT[tmp_b][0];\n\tif((tmp_a == -1 && tmp_b != -1)|| (tmp_a != -1 && tmp_b != -1 && word[tmp_a] < word[tmp_b])){\n\n\t\treturn true;\n\n\t}else{\n\n\t\treturn false;\n\t}\n}\n\nint main(){\n\n\tPOW2[0] = 1;\n\tfor(int i = 1; i <= POW_MAX; i++){\n\n\t\tPOW2[i] = POW2[i-1]*2;\n\t}\n\n\tscanf(\"%d %d\",&N,&M);\n\n\tchar buf[2];\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tscanf(\"%s\",buf);\n\t\tword[i] = buf[0];\n\t}\n\n\tint from,to;\n\n\tfor(int i = 0; i < M; i++){\n\t\tscanf(\"%d %d\",&from,&to);\n\t\tfrom--;\n\t\tto--;\n\t\tG[from].push_back(to);\n\t}\n\n\tcalc_POW();\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < POW_MAX; k++){\n\n\t\t\tNEXT[i][k] = -1;//国i始点の、POW[k]文字後のインデックス\n\t\t}\n\t}\n\n\tHASH[N-1][0][0] = 0;\n\tHASH[N-1][0][1] = 0;\n\tLENGTH[N-1][0] = 1;\n\n\tfor(int i = N-2; i >= 0; i--){\n\t\tint tmp_next = i+1;\n\t\tfor(int k = 0; k < G[i].size(); k++){\n\t\t\tint work_next = G[i][k];\n\n\t\t\tif(is_smaller(work_next,tmp_next)){\n\n\t\t\t\ttmp_next = work_next;\n\t\t\t}\n\t\t}\n\t\tNEXT[i][0] = tmp_next;\n\t\tHASH[i][0][0] = word[tmp_next];\n\t\tHASH[i][0][1] = word[tmp_next];\n\t\tLENGTH[i][0] = 1;\n\n\t\tfor(int k = 1; k < POW_MAX; k++){\n\t\t\tif(NEXT[i][k-1] == -1)break;\n\t\t\tNEXT[i][k] = NEXT[NEXT[i][k-1]][k-1];\n\t\t\tfor(int a = 0; a <= 1; a++){\n\t\t\t\tHASH[i][k][a] = HASH[i][k-1][a]*POW[LENGTH[NEXT[i][k-1]][k-1]][a]+HASH[NEXT[i][k-1]][k-1][a];\n\t\t\t}\n\t\t\tLENGTH[i][k] = LENGTH[i][k-1]+LENGTH[NEXT[i][k-1]][k-1];\n\t\t}\n\t}\n\n\tint tmp_node = 0;\n\twhile(true){\n\t\tprintf(\"%c\",word[tmp_node]);\n\t\ttmp_node = NEXT[tmp_node][0];\n\t\tif(tmp_node == -1)break;\n\t}\n\tprintf(\"\\n\");\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 390, "memory_kb": 180296, "score_of_the_acc": -0.8335, "final_rank": 9 } ]
aoj_0439_cpp
Coloured Mountain Hut You are in charge of $N$ huts and the roads that connect them. Each hut has a number from $1$ to $N$. There are $N-1$ paths in total. All paths are the same length and can be taken in either direction. Also, from any hut, you can reach any other hut by going through some of the paths. All the huts are painted with a color to mark them. Every hut has at least one other hut that is the same color as it, so that climbers can move between huts of the same color. For each hut, you are trying to find the hut that can be reached in the shortest travel distance among the other huts of the same color as that hut. You are given the color of the hut and information about the paths that connect the huts directly to each other. Write a program that, for each hut, find the hut with the shortest travel distance among the other huts of the same color as the hut, and outputs the shortest travel distance. The length of the path is assumed to be 1 for all. Input The input is given in the following format. $N$ $c_1$ $c_2$ : $c_N$ $s_1$ $t_1$ $s_2$ $t_2$ : $s_{N-1}$ $t_{N-1}$ In the first line, the number of huts $N$ ($2 \leq N \leq 200,000$) is given. In the following $N$ lines, the color of the $i$-th hut $c_i$ ($1 \leq c_i \leq N$) is given in integers. In the following $N-1$ lines, the information of the path directly connecting the two huts is given. $s_i$ and $t_i$ ($1 \leq s_i < t_i \leq N$) are the numbers of the two huts connected by the $i$-th path. For any two huts, there should be no more than one path that directly connects them. Output The output consists of $N$ lines. For hut $i$, find the hut with the shortest travel distance among the other huts of the same color, and output the shortest travel distance in line $i$. Sample Input and Output Sample Input 8 1 2 3 3 2 2 3 1 1 2 1 3 2 4 2 5 4 6 5 7 7 8 Sample Output 4 1 3 3 1 2 3 4
[ { "submission_id": "aoj_0439_10902262", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing pll = pair<ll, ll>;\n#define vc vector\nusing vl = vc<ll>;\n\n#define ov(a, b, c, name, ...) name\n#define rep2(i, l, r) for (ll i = (l); i < ll(r); i++)\n#define rep1(i, n) rep2(i, 0, n)\n#define rep(...) ov(__VA_ARGS__, rep2, rep1)(__VA_ARGS__)\n#define fec(...) for (const auto &__VA_ARGS__)\n#define per(i, a, b) for (ll i = ll(a) - 1; i >= ll(b); i--)\n\n#define ALL(x) begin(x), end(x)\n#define SZ(x) (ll) size(x)\n#define LB(v, x) (lower_bound(ALL(v), x) - begin(v))\n#define eb emplace_back\n\nbool chmin(auto& a, auto b) { return a > b ? a = b, 1 : 0; }\nbool chmax(auto& a, auto b) { return a < b ? a = b, 1 : 0; }\nconst ll INF = ll(4e18) + 100;\n\nvoid printvec(const auto& v) {\n for(auto it = begin(v); it != end(v); it++) cout << *it << \" \";\n cout << endl;\n}\n\n#ifdef LOCAL\n#define local(...) __VA_ARGS__\n#else\n#define local(...)\n#endif\n\ntemplate<class G> struct HLD {\n int n;\n G& g;\n vc<int> sub, in, out, head, rev, par, d;\n HLD(G& g, int root = 0) : n(g.size()), g(g), sub(n), in(n), out(n), head(n), rev(n), par(n), d(n) {\n int t = 0;\n head[root] = 0, dfs1(root, -1), dfs2(root, -1, t);\n }\n void dfs1(int x, int p) {\n par[x] = p, sub[x] = 1;\n if(g[x].size() and g[x][0] == p) swap(g[x][0], g[x].back());\n for(auto& e : g[x]) { // 変更する!\n if(e == p) continue;\n d[e] = d[x] + 1;\n dfs1(e, x);\n sub[x] += sub[e];\n if(sub[g[x][0]] < sub[e]) swap(g[x][0], e);\n }\n }\n void dfs2(int x, int p, int& t) {\n in[x] = t++, rev[in[x]] = x;\n fec(e : g[x]) {\n if(e == p) continue;\n head[e] = g[x][0] == e ? head[x] : e;\n dfs2(e, x, t);\n }\n out[x] = t;\n }\n int la(int v, int k) {\n while(1) {\n int u = head[v];\n if(in[v] - k >= in[u]) return rev[in[v] - k];\n k -= in[v] - in[u] + 1, v = par[u];\n }\n }\n int lca(int u, int v) {\n for(;; v = par[head[v]]) {\n if(in[u] > in[v]) swap(u, v);\n if(head[u] == head[v]) return u;\n }\n }\n // パス・部分木クエリのどちらも、v のデータを in[v] に載せておく\n // 部分木クエリは [in[v] + edge, out[v]) でよい\n // q(l, r, rev): [l, r) の総積、rev なら逆向き\n template<class S> S path_query(int u, int v, auto op, auto e, auto q, bool edge = false) {\n S l = e, r = e; // 可換なら x = e でよい\n bool rev = false; // 可換なら不要\n for(;; v = par[head[v]]) {\n if(in[u] > in[v]) swap(u, v), rev ^= 1;\n if(head[u] == head[v]) break;\n S m = q(in[head[v]], in[v] + 1, rev);\n rev ? l = op(l, m) : r = op(m, r);\n }\n return op(l, op(q(in[u] + edge, in[v] + 1, rev), r));\n }\n int dist(int u, int v) { return d[u] + d[v] - 2 * d[lca(u, v)]; }\n int jump(int s, int t, int i) {\n if(!i) return s;\n int l = lca(s, t);\n int dst = d[s] + d[t] - d[l] * 2;\n if(dst < i) return -1;\n if(d[s] - d[l] >= i) return la(s, i);\n i -= d[s] - d[l];\n return la(t, d[t] - d[l] - i);\n }\n // es: 圧縮後の木の辺 (親 → 子、0 が根)\n // itov: 圧縮後の木の各頂点がもとの木でどの頂点か (行きがけ順に格納)\n // 使う際は空グラフとなる場合に注意\n pair<vc<pair<int, int>>, vc<int>> aux_tree(vc<int> xs) {\n if(xs.empty()) return {{}, {}};\n ranges::sort(xs, {}, [&](int v) { return in.at(v); });\n int k = xs.size();\n rep(i, k - 1) xs.eb(lca(xs[i], xs[i + 1]));\n ranges::sort(xs, {}, [&](int v) { return in.at(v); });\n xs.erase(unique(ALL(xs)), end(xs));\n vc<pair<int, int>> es;\n stack<int> sta;\n rep(i, xs.size()) {\n while(!sta.empty()) {\n int j = sta.top(), u = xs[i], v = xs[j];\n if(in[u] >= in[v] && out[u] <= out[v]) {\n es.eb(j, i);\n break;\n }\n sta.pop();\n }\n sta.emplace(i);\n }\n return {es, xs};\n }\n};\n\nint main() {\n cin.tie(0)->sync_with_stdio(0);\n\n int N;\n cin >> N;\n vl C(N);\n rep(i, N) cin >> C.at(i), C.at(i)--;\n vc<vc<int>> ctovs(N);\n rep(i, N) ctovs.at(C.at(i)).eb(i);\n\n vc<vl> G(N);\n rep(_, N - 1) {\n ll u, v;\n cin >> u >> v;\n u--, v--;\n G.at(u).eb(v);\n G.at(v).eb(u);\n }\n\n HLD hld(G);\n vl ans(N, INF);\n rep(c, N) {\n auto [es, itov] = hld.aux_tree(ctovs.at(c));\n ll k = itov.size();\n if(k == 0) continue;\n vc<vc<pll>> H(k);\n fec([ i, j ] : es) {\n ll d = hld.dist(itov.at(i), itov.at(j));\n H.at(i).eb(j, d), H.at(j).eb(i, d);\n }\n vl dists(k, INF), id(k, -1);\n priority_queue<pll, vc<pll>, greater<pll>> pq;\n rep(i, k) if(C.at(itov.at(i)) == c) { pq.push({0, i}), dists.at(i) = 0, id.at(i) = i; }\n while(!pq.empty()) {\n auto [d, i] = pq.top();\n pq.pop();\n if(dists.at(i) != d) continue;\n fec([ ni, c ] : H.at(i)) {\n if(chmin(dists.at(ni), d + c)) {\n id.at(ni) = id.at(i);\n pq.push({d + c, ni});\n }\n }\n }\n rep(i, k) fec([ j, d ] : H.at(i)) {\n if(id.at(i) != id.at(j)) {\n chmin(ans.at(itov.at(id.at(i))), dists.at(i) + d + dists.at(j));\n chmin(ans.at(itov.at(id.at(j))), dists.at(i) + d + dists.at(j));\n }\n }\n\n local(\n\n cout << \"color=\" << c + 1 << endl;\n\n fec([ i, j ] : es) {\n ll u = itov.at(i), v = itov.at(j);\n cout << i << \" \" << j << \" \" << u + 1 << \" \" << v + 1 << \" \" << hld.dist(u, v) << endl;\n }\n\n printvec(itov);\n printvec(dists); printvec(id);\n\n );\n }\n fec(ansi : ans) cout << ansi << \"\\n\";\n}", "accuracy": 1, "time_ms": 150, "memory_kb": 35600, "score_of_the_acc": -0.0584, "final_rank": 1 }, { "submission_id": "aoj_0439_10868828", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ld=long double;\n#define fi first\n#define se second\n#define i128 __int128_t\n#define all(x) x.begin(),x.end()\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\n#define si(a) (long)(a.size())\ntemplate<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}\ntemplate<typename T>bool chmax(T&a,T b){return b>a?(a=b,1):0;}\nconst int INF=1e9+100;\nconst long INFL=3e18+100;\nstruct _ {\n _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }\n} __;\n\nstruct LCA {\n int N;\n vector<vector<int>> G, P;\n vector<int> dep;\n LCA(vector<vector<int>> G_, int root = 0) : N(si(G_)), G(G_), dep(si(G_)) {\n int lg = 0;\n while ((1 << lg) + 1 < N) lg++;\n P.assign(lg + 1, vector<int>(N));\n\n dfs(root, -1, 0);\n for (int k = 1; k < si(P); k++) {\n rep(i, N) {\n if (P[k - 1][i] == -1)\n P[k][i] = -1;\n else\n P[k][i] = P[k - 1][P[k - 1][i]];\n }\n }\n }\n void dfs(int u, int p, int d) {\n dep[u] = d;\n P[0][u] = p;\n for (int v : G[u])\n if (v != p) dfs(v, u, d + 1);\n }\n int lca(int u, int v) {\n if (dep[u] > dep[v]) swap(u, v);\n rep(k, si(P)) if ((dep[v] - dep[u]) >> k & 1) v = P[k][v];\n if (u == v) return u;\n for (int k = si(P); k--;)\n if (P[k][u] != P[k][v]) {\n u = P[k][u];\n v = P[k][v];\n }\n return P[0][u];\n }\n int dist(int u, int v) {\n int w = lca(u, v);\n return dep[u] + dep[v] - 2 * dep[w];\n }\n};\nstruct AuxiliaryTree : LCA {\n using super = LCA;\n\n vector<int> idx;\n vector<vector<int>> T;\n AuxiliaryTree(vector<vector<int>> G_, int root = 0)\n : super(G_, root), idx(si(G_)), T(si(G_)) {\n int pos = 0;\n dfs(root, -1, pos);\n }\n\n void dfs(int v, int p, int &pos) {\n idx[v] = pos++;\n for (int u : G[v])\n if (u != p) dfs(u, v, pos);\n }\n\n void add_aux_edge(int u, int v) {\n T[u].emplace_back(v);\n T[v].emplace_back(u);\n }\n\n using super::lca, super::dep;\n void query(vector<int> &vs) {\n assert(!vs.empty());\n sort(all(vs), [&](int a, int b) { return idx[a] < idx[b]; });\n vs.erase(unique(all(vs)), vs.end());\n\n int k = si(vs);\n stack<int> st;\n st.emplace(vs[0]);\n rep(i, k - 1) {\n int w = lca(vs[i], vs[i + 1]);\n if (w != vs[i]) {\n int l = st.top();\n st.pop();\n while (!st.empty() and dep[w] < dep[st.top()]) {\n add_aux_edge(st.top(), l);\n l = st.top();\n st.pop();\n }\n if (st.empty() or st.top() != w) {\n st.emplace(w);\n vs.emplace_back(w);\n }\n add_aux_edge(w, l);\n }\n st.emplace(vs[i + 1]);\n }\n\n while (si(st) > 1) {\n int c = st.top();\n st.pop();\n add_aux_edge(st.top(), c);\n }\n }\n\n void clear(const vector<int> &ws) {\n for (int w : ws) T[w].clear();\n }\n};\ntemplate <class T, class S>\nbool top2id_chmin(pair<pair<T,S>,pair<T,S>> &p, T v, S k){\n if(p.first.second==k){\n if(p.first.first>v){\n p.first.first=v;\n return 1;\n }\n }\n else if(p.second.second==k){\n if(p.second.first>v){\n p.second.first=v;\n if(p.first.first>p.second.first) swap(p.first,p.second);\n return 1;\n }\n }\n else{\n if(p.first.first>v){\n p.second=p.first;\n p.first=make_pair(v,k);\n return 1;\n }\n if(p.second.first>v){\n p.second=make_pair(v,k);\n if(p.first.first>p.second.first) swap(p.first,p.second);\n return 1;\n }\n }\n return 0;\n}\n\nint main(){\n int N;\n cin>>N;\n vector<int> C(N);\n rep(i,N)cin>>C[i],C[i]--;\n vector<vector<int>> G(N);\n rep(i,N-1){\n int s,t;\n cin>>s>>t;\n s--;t--;\n G[s].push_back(t);\n G[t].push_back(s);\n }\n AuxiliaryTree aux(G);\n \n vector<vector<int>> A(N,{0});\n rep(i,N) A[C[i]].push_back(i);\n\n pair<pair<int,int>,pair<int,int>> mie=make_pair(make_pair(1e9,-2),make_pair(1e9,-3));\n vector<pair<pair<int,int>,pair<int,int>>> mi(N,mie);\n vector<int> ans(N,1e9);\n rep(i,N){\n if(A[i].empty()) continue;\n aux.query(A[i]);\n\n auto dfs=[&](auto self, int v, int p)->void {\n if(C[v]==i) top2id_chmin(mi[v], 0, -1);\n \n for(int e: aux.T[v]){\n if(e==p) continue;\n self(self, e, v);\n top2id_chmin(mi[v], mi[e].fi.fi+aux.dist(e, v),e);\n }\n };\n dfs(dfs, 0, -1);\n\n auto dfs2=[&](auto self, int v, int p, int tk)->void {\n if(C[v]==i){\n chmin(ans[v], mi[v].se.fi);\n chmin(ans[v], tk);\n tk=0;\n }\n for(int e: aux.T[v]){\n if(e==p) continue;\n \n if(C[v]==i)self(self, e, v, tk+aux.dist(e,v));\n else{\n int nk=tk;\n if(mi[v].fi.se!=e) chmin(nk, mi[v].fi.fi);\n if(mi[v].se.se!=e) chmin(nk, mi[v].se.fi);\n self(self, e, v, nk+aux.dist(e,v));\n }\n\n }\n };\n dfs2(dfs2, 0, -1, 1e9);\n for(auto e: A[i]) mi[e]=mie;\n aux.clear(A[i]);\n }\n\n rep(i,N){\n cout<<ans[i]<<\"\\n\";\n }\n}\n/*\n\n*/", "accuracy": 1, "time_ms": 300, "memory_kb": 70936, "score_of_the_acc": -0.5296, "final_rank": 8 }, { "submission_id": "aoj_0439_10824153", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug.hpp>\n#else\n#define debug(...)\n#endif\n\ntemplate <class T, T (*op)(T, T), T (*e)()>\nstruct SegmentTree {\n int n, len, height = 0;\n vector<T> data;\n constexpr void update(int k) noexcept { data[k] = op(data[k << 1 | 0], data[k << 1 | 1]); }\n\n public:\n SegmentTree() = default;\n SegmentTree(int size) : SegmentTree(vector<T>(size, e())) {}\n SegmentTree(const vector<T> &v) : n(int(v.size())) {\n len = 1, height = 0;\n while (len < n) len <<= 1, height++;\n data.assign(len << 1, e());\n for (int i = 0; i < n; i++) data[i + len] = v[i];\n for (int i = len - 1; i > 0; i--) update(i);\n }\n void set(int i, T x) {\n i += len;\n data[i] = x;\n while (i >>= 1) update(i);\n }\n T get(int i) const {\n i += len;\n return data[i];\n }\n T operator[](int i) const { return get(i); }\n T prod(int l, int r) const {\n l += len, r += len;\n T resl = e(), resr = e();\n while (l < r) {\n if (l & 1) resl = op(resl, data[l++]);\n if (r & 1) resr = op(data[--r], resr);\n l >>= 1, r >>= 1;\n }\n return op(resl, resr);\n }\n T all_prod() const { return data[1]; }\n // check(A[l] * ... * A[r - 1]) = true となる最大の r\n template <class C>\n int max_right(int l, const C &check) const {\n assert(0 <= l && l <= n && check(e()));\n if (l == n) return n;\n l += len;\n T sum = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!check(op(sum, data[l]))) {\n while (l < len) {\n l = l << 1 | 0;\n if (check(op(sum, data[l]))) {\n sum = op(sum, data[l++]);\n }\n }\n return l - len;\n }\n sum = op(sum, data[l++]);\n } while ((l & -l) != l);\n return n;\n }\n // check(A[l] * ... * A[r - 1]) = true となる最小の l\n template <class C>\n int min_left(int r, const C &check) const {\n assert(0 <= r && r <= n && check(e()));\n if (r == 0) return 0;\n r += len;\n T sum = e();\n do {\n --r;\n while (r > 1 && r % 2) r >>= 1;\n if (!check(op(data[r], sum))) {\n while (r < len) {\n r = r << 1 | 1;\n if (check(op(data[r], sum))) {\n sum = op(data[r--], sum);\n }\n }\n return r + 1 - len;\n }\n sum = op(data[r], sum);\n } while ((r & -r) != r);\n return 0;\n }\n};\n\nstruct EulerTour {\n int n;\n vector<int> in, out, pos, depth;\n using S = pair<int, int>;\n static S op(S a, S b) { return min(a, b); }\n static S e() { return {numeric_limits<int>::max(), -1}; }\n SegmentTree<S, op, e> seg;\n void dfs(const vector<vector<int>> &G, int r) {\n int t = 0;\n auto f = [&](auto &&self, int v, int p) -> void {\n in[v] = t, pos[t] = v, t++;\n for (int u : G[v]) {\n if (u == p) continue;\n depth[u] = depth[v] + 1;\n self(self, u, v);\n pos[t] = v, t++;\n }\n out[v] = t;\n };\n f(f, r, -1);\n }\n\n EulerTour(const vector<vector<int>> &G, int r) : n(ssize(G)), in(n), out(n), pos(2 * n - 1), depth(n), seg(2 * n - 1) {\n dfs(G, r);\n vector<S> init(2 * n - 1);\n for (int i = 0; i < 2 * n - 1; i++) init[i] = {depth[pos[i]], pos[i]};\n seg = SegmentTree<S, op, e>(init);\n }\n int lca(int u, int v) const { return seg.prod(min(in[u], in[v]), max(out[u], out[v])).second; }\n int dist(int u, int v) const { return depth[u] + depth[v] - 2 * depth[lca(u, v)]; }\n};\n\nstruct AuxiliaryTree {\n EulerTour et;\n AuxiliaryTree(const vector<vector<int>> &G, int r) : et(G, r) {}\n // 頂点集合 vs とそれらの LCA を含む Auxiliary Tree を構築\n // 返り値: aux tree, aux tree と 元のグラフの対応表 id\n // aux tree の頂点 i は元のグラフの頂点 id[i] に対応\n pair<vector<vector<pair<int, int>>>, vector<int>> get(vector<int> vs) {\n int K = ssize(vs);\n sort(vs.begin(), vs.end(), [&](int a, int b) { return et.in[a] < et.in[b]; });\n for (int i = 0; i < K - 1; i++) {\n vs.emplace_back(et.lca(vs[i], vs[i + 1]));\n }\n sort(vs.begin(), vs.end(), [&](int a, int b) { return et.in[a] < et.in[b]; });\n vs.erase(unique(vs.begin(), vs.end()), vs.end());\n K = ssize(vs);\n stack<int> stk;\n vector<vector<pair<int, int>>> auxt(K);\n for (int i = 0; i < K; i++) {\n while (!stk.empty() && et.out[vs[stk.top()]] < et.in[vs[i]]) stk.pop();\n if (!stk.empty()) {\n int d = et.dist(vs[i], vs[stk.top()]);\n auxt[stk.top()].emplace_back(i, d);\n auxt[i].emplace_back(stk.top(), d);\n }\n stk.emplace(i);\n }\n return {auxt, vs};\n }\n};\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N;\n cin >> N;\n vector<int> C(N), ans(N, N);\n for (int i = 0; i < N; i++) cin >> C[i], C[i]--;\n vector<vector<int>> G(N);\n for (int i = 0; i < N - 1; i++) {\n int s, t;\n cin >> s >> t, s--, t--;\n G[s].emplace_back(t);\n G[t].emplace_back(s);\n if (C[s] == C[t]) ans[s] = ans[t] = 1;\n }\n\n // 色 i の頂点集合\n vector<vector<int>> groups(N);\n for (int i = 0; i < N; i++) groups[C[i]].emplace_back(i);\n\n AuxiliaryTree aux(G, 0);\n // 色 c 毎に解く\n vector<int> dp(N, N);\n for (int c = 0; c < N; c++) {\n auto [T, id] = aux.get(groups[c]);\n int M = ssize(T);\n // 色 c の Auxiliary Tree 上で木 dp\n // O(M^2) 時間だけど枝刈りが上手くいってる\n for (int i = 0; i < M; i++) {\n if (C[id[i]] != c || ans[id[i]] == 1) continue;\n auto dfs = [&](auto &&self, int v, int p, int d) -> void {\n for (auto [u, w] : T[v]) {\n if (u == p) continue;\n if (C[id[u]] != c) {\n // u が色 c の頂点でない場合: 次の頂点に移動\n self(self, u, v, d + w);\n } else {\n // u が色 c の頂点の場合: dp を更新\n dp[i] = min(dp[i], d + w);\n dp[u] = min(dp[u], d + w);\n }\n }\n };\n dfs(dfs, i, -1, 0);\n }\n for (int i = 0; i < M; i++) {\n if (C[id[i]] == c) ans[id[i]] = min(ans[id[i]], dp[i]);\n dp[i] = N;\n }\n }\n\n for (int i = 0; i < N; i++) cout << ans[i] << '\\n';\n}", "accuracy": 1, "time_ms": 1340, "memory_kb": 50244, "score_of_the_acc": -0.9372, "final_rank": 17 }, { "submission_id": "aoj_0439_10823988", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug.hpp>\n#else\n#define debug(...)\n#endif\n\ntemplate <class T, T (*op)(T, T), T (*e)()>\nstruct SegmentTree {\n int n, len, height = 0;\n vector<T> data;\n constexpr void update(int k) noexcept { data[k] = op(data[k << 1 | 0], data[k << 1 | 1]); }\n\n public:\n SegmentTree() = default;\n SegmentTree(int size) : SegmentTree(vector<T>(size, e())) {}\n SegmentTree(const vector<T> &v) : n(int(v.size())) {\n len = 1, height = 0;\n while (len < n) len <<= 1, height++;\n data.assign(len << 1, e());\n for (int i = 0; i < n; i++) data[i + len] = v[i];\n for (int i = len - 1; i > 0; i--) update(i);\n }\n void set(int i, T x) {\n i += len;\n data[i] = x;\n while (i >>= 1) update(i);\n }\n T get(int i) const {\n i += len;\n return data[i];\n }\n T operator[](int i) const { return get(i); }\n T prod(int l, int r) const {\n l += len, r += len;\n T resl = e(), resr = e();\n while (l < r) {\n if (l & 1) resl = op(resl, data[l++]);\n if (r & 1) resr = op(data[--r], resr);\n l >>= 1, r >>= 1;\n }\n return op(resl, resr);\n }\n T all_prod() const { return data[1]; }\n // check(A[l] * ... * A[r - 1]) = true となる最大の r\n template <class C>\n int max_right(int l, const C &check) const {\n assert(0 <= l && l <= n && check(e()));\n if (l == n) return n;\n l += len;\n T sum = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!check(op(sum, data[l]))) {\n while (l < len) {\n l = l << 1 | 0;\n if (check(op(sum, data[l]))) {\n sum = op(sum, data[l++]);\n }\n }\n return l - len;\n }\n sum = op(sum, data[l++]);\n } while ((l & -l) != l);\n return n;\n }\n // check(A[l] * ... * A[r - 1]) = true となる最小の l\n template <class C>\n int min_left(int r, const C &check) const {\n assert(0 <= r && r <= n && check(e()));\n if (r == 0) return 0;\n r += len;\n T sum = e();\n do {\n --r;\n while (r > 1 && r % 2) r >>= 1;\n if (!check(op(data[r], sum))) {\n while (r < len) {\n r = r << 1 | 1;\n if (check(op(data[r], sum))) {\n sum = op(data[r--], sum);\n }\n }\n return r + 1 - len;\n }\n sum = op(data[r], sum);\n } while ((r & -r) != r);\n return 0;\n }\n};\n\nstruct EulerTour {\n int n;\n vector<int> in, out, pos, depth;\n using S = pair<int, int>;\n static S op(S a, S b) { return min(a, b); }\n static S e() { return {numeric_limits<int>::max(), -1}; }\n SegmentTree<S, op, e> seg;\n void dfs(const vector<vector<int>> &G, int r) {\n int t = 0;\n auto f = [&](auto &&self, int v, int p) -> void {\n in[v] = t, pos[t] = v, t++;\n for (int u : G[v]) {\n if (u == p) continue;\n depth[u] = depth[v] + 1;\n self(self, u, v);\n pos[t] = v, t++;\n }\n out[v] = t;\n };\n f(f, r, -1);\n }\n\n EulerTour(const vector<vector<int>> &G, int r) : n(ssize(G)), in(n), out(n), pos(2 * n - 1), depth(n), seg(2 * n - 1) {\n dfs(G, r);\n vector<S> init(2 * n - 1);\n for (int i = 0; i < 2 * n - 1; i++) init[i] = {depth[pos[i]], pos[i]};\n seg = SegmentTree<S, op, e>(init);\n }\n int lca(int u, int v) const { return seg.prod(min(in[u], in[v]), max(out[u], out[v])).second; }\n int dist(int u, int v) const { return depth[u] + depth[v] - 2 * depth[lca(u, v)]; }\n};\n\nstruct AuxiliaryTree {\n EulerTour et;\n AuxiliaryTree(const vector<vector<int>> &G, int r) : et(G, r) {}\n // 頂点集合 vs とそれらの LCA を含む Auxiliary Tree を構築\n // 返り値: aux tree, aux tree と 元のグラフの対応表 id\n // aux tree の頂点 i は元のグラフの頂点 id[i] に対応\n pair<vector<vector<pair<int, int>>>, vector<int>> get(vector<int> vs) {\n int K = ssize(vs);\n sort(vs.begin(), vs.end(), [&](int a, int b) { return et.in[a] < et.in[b]; });\n for (int i = 0; i < K - 1; i++) {\n vs.emplace_back(et.lca(vs[i], vs[i + 1]));\n }\n sort(vs.begin(), vs.end(), [&](int a, int b) { return et.in[a] < et.in[b]; });\n vs.erase(unique(vs.begin(), vs.end()), vs.end());\n K = ssize(vs);\n stack<int> stk;\n vector<vector<pair<int, int>>> auxt(K);\n for (int i = 0; i < K; i++) {\n while (!stk.empty() && et.out[vs[stk.top()]] < et.in[vs[i]]) stk.pop();\n if (!stk.empty()) {\n int d = et.dist(vs[i], vs[stk.top()]);\n auxt[stk.top()].emplace_back(i, d);\n auxt[i].emplace_back(stk.top(), d);\n }\n stk.emplace(i);\n }\n return {auxt, vs};\n }\n};\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N;\n cin >> N;\n vector<int> C(N), ans(N, N);\n for (int i = 0; i < N; i++) cin >> C[i], C[i]--;\n vector<vector<int>> G(N);\n for (int i = 0; i < N - 1; i++) {\n int s, t;\n cin >> s >> t, s--, t--;\n G[s].emplace_back(t);\n G[t].emplace_back(s);\n if (C[s] == C[t]) ans[s] = ans[t] = 1;\n }\n\n // 色 i の頂点集合\n vector<vector<int>> groups(N);\n for (int i = 0; i < N; i++) groups[C[i]].emplace_back(i);\n\n AuxiliaryTree aux(G, 0);\n // 色 c 毎に解く\n for (int c = 0; c < N; c++) {\n auto [T, id] = aux.get(groups[c]);\n int M = ssize(T);\n // 色 c の Auxiliary Tree 上で木 dp\n // O(M^2) 時間だけど枝刈りが上手くいってる\n vector<int> dp(M, N);\n for (int i = 0; i < M; i++) {\n if (C[id[i]] != c || ans[id[i]] == 1) continue;\n auto dfs = [&](auto &&self, int v, int p, int d) -> void {\n for (auto [u, w] : T[v]) {\n if (u == p) continue;\n if (C[id[u]] != c) {\n // u が色 c の頂点でない場合: 次の頂点に移動\n self(self, u, v, d + w);\n } else {\n // u が色 c の頂点の場合: dp を更新\n dp[i] = min(dp[i], d + w);\n dp[u] = min(dp[u], d + w);\n }\n }\n };\n dfs(dfs, i, -1, 0);\n }\n for (int i = 0; i < M; i++) {\n if (C[id[i]] != c) continue;\n ans[id[i]] = min(ans[id[i]], dp[i]);\n }\n }\n\n for (int i = 0; i < N; i++) {\n cout << ans[i] << '\\n';\n }\n}", "accuracy": 1, "time_ms": 1340, "memory_kb": 50236, "score_of_the_acc": -0.9371, "final_rank": 16 }, { "submission_id": "aoj_0439_10823970", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug.hpp>\n#else\n#define debug(...)\n#endif\n\ntemplate <class T, T (*op)(T, T), T (*e)()>\nstruct SegmentTree {\n int n, len, height = 0;\n vector<T> data;\n constexpr void update(int k) noexcept { data[k] = op(data[k << 1 | 0], data[k << 1 | 1]); }\n\n public:\n SegmentTree() = default;\n SegmentTree(int size) : SegmentTree(vector<T>(size, e())) {}\n SegmentTree(const vector<T> &v) : n(int(v.size())) {\n len = 1, height = 0;\n while (len < n) len <<= 1, height++;\n data.assign(len << 1, e());\n for (int i = 0; i < n; i++) data[i + len] = v[i];\n for (int i = len - 1; i > 0; i--) update(i);\n }\n void set(int i, T x) {\n i += len;\n data[i] = x;\n while (i >>= 1) update(i);\n }\n T get(int i) const {\n i += len;\n return data[i];\n }\n T operator[](int i) const { return get(i); }\n T prod(int l, int r) const {\n l += len, r += len;\n T resl = e(), resr = e();\n while (l < r) {\n if (l & 1) resl = op(resl, data[l++]);\n if (r & 1) resr = op(data[--r], resr);\n l >>= 1, r >>= 1;\n }\n return op(resl, resr);\n }\n T all_prod() const { return data[1]; }\n // check(A[l] * ... * A[r - 1]) = true となる最大の r\n template <class C>\n int max_right(int l, const C &check) const {\n assert(0 <= l && l <= n && check(e()));\n if (l == n) return n;\n l += len;\n T sum = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!check(op(sum, data[l]))) {\n while (l < len) {\n l = l << 1 | 0;\n if (check(op(sum, data[l]))) {\n sum = op(sum, data[l++]);\n }\n }\n return l - len;\n }\n sum = op(sum, data[l++]);\n } while ((l & -l) != l);\n return n;\n }\n // check(A[l] * ... * A[r - 1]) = true となる最小の l\n template <class C>\n int min_left(int r, const C &check) const {\n assert(0 <= r && r <= n && check(e()));\n if (r == 0) return 0;\n r += len;\n T sum = e();\n do {\n --r;\n while (r > 1 && r % 2) r >>= 1;\n if (!check(op(data[r], sum))) {\n while (r < len) {\n r = r << 1 | 1;\n if (check(op(data[r], sum))) {\n sum = op(data[r--], sum);\n }\n }\n return r + 1 - len;\n }\n sum = op(data[r], sum);\n } while ((r & -r) != r);\n return 0;\n }\n};\n\nstruct EulerTour {\n int n;\n vector<int> in, out, pos, depth;\n using S = pair<int, int>;\n static S op(S a, S b) { return min(a, b); }\n static S e() { return {numeric_limits<int>::max(), -1}; }\n SegmentTree<S, op, e> seg;\n void dfs(const vector<vector<int>> &G, int r) {\n int t = 0;\n auto f = [&](auto &&self, int v, int p) -> void {\n in[v] = t, pos[t] = v, t++;\n for (int u : G[v]) {\n if (u == p) continue;\n depth[u] = depth[v] + 1;\n self(self, u, v);\n pos[t] = v, t++;\n }\n out[v] = t;\n };\n f(f, r, -1);\n }\n\n EulerTour(const vector<vector<int>> &G, int r) : n(ssize(G)), in(n), out(n), pos(2 * n - 1), depth(n), seg(2 * n - 1) {\n dfs(G, r);\n vector<S> init(2 * n - 1);\n for (int i = 0; i < 2 * n - 1; i++) init[i] = {depth[pos[i]], pos[i]};\n seg = SegmentTree<S, op, e>(init);\n }\n int lca(int u, int v) const { return seg.prod(min(in[u], in[v]), max(out[u], out[v])).second; }\n int dist(int u, int v) const { return depth[u] + depth[v] - 2 * depth[lca(u, v)]; }\n};\n\nstruct AuxiliaryTree {\n EulerTour et;\n AuxiliaryTree(const vector<vector<int>> &G, int r) : et(G, r) {}\n // 頂点集合 vs とそれらの LCA を含む Auxiliary Tree を構築\n // 返り値: aux tree, aux tree と 元のグラフの対応表 id\n // aux tree の頂点 i は元のグラフの頂点 id[i] に対応\n pair<vector<vector<pair<int, int>>>, vector<int>> get(vector<int> vs) {\n int K = ssize(vs);\n sort(vs.begin(), vs.end(), [&](int a, int b) { return et.in[a] < et.in[b]; });\n for (int i = 0; i < K - 1; i++) {\n vs.emplace_back(et.lca(vs[i], vs[i + 1]));\n }\n sort(vs.begin(), vs.end(), [&](int a, int b) { return et.in[a] < et.in[b]; });\n vs.erase(unique(vs.begin(), vs.end()), vs.end());\n K = ssize(vs);\n stack<int> stk;\n vector<vector<pair<int, int>>> auxt(K);\n for (int i = 0; i < K; i++) {\n while (!stk.empty() && et.out[vs[stk.top()]] < et.in[vs[i]]) stk.pop();\n if (!stk.empty()) {\n int d = et.dist(vs[i], vs[stk.top()]);\n auxt[stk.top()].emplace_back(i, d);\n auxt[i].emplace_back(stk.top(), d);\n }\n stk.emplace(i);\n }\n return {auxt, vs};\n }\n};\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N;\n cin >> N;\n vector<int> C(N), ans(N, N);\n for (int i = 0; i < N; i++) cin >> C[i], C[i]--;\n vector<vector<int>> G(N);\n for (int i = 0; i < N - 1; i++) {\n int s, t;\n cin >> s >> t, s--, t--;\n G[s].emplace_back(t);\n G[t].emplace_back(s);\n if (C[s] == C[t]) ans[s] = ans[t] = 1;\n }\n\n // 色 i の頂点集合\n vector<vector<int>> groups(N);\n for (int i = 0; i < N; i++) groups[C[i]].emplace_back(i);\n\n AuxiliaryTree aux(G, 0);\n // 色 c 毎に解く\n for (int c = 0; c < N; c++) {\n auto [T, id] = aux.get(groups[c]);\n int M = ssize(T);\n // 色 c の Auxiliary Tree 上で木 dp\n vector<int> dp(M, N);\n for (int i = 0; i < M; i++) {\n if (C[id[i]] != c || ans[id[i]] == 1) continue;\n auto dfs = [&](auto &&self, int v, int p, int d) -> void {\n for (auto [u, w] : T[v]) {\n if (u == p) continue;\n if (C[id[u]] != c) {\n // u が色 c の頂点でない場合: 次の頂点に移動\n self(self, u, v, d + w);\n } else {\n // u が色 c の頂点の場合: dp を更新\n dp[i] = min(dp[i], d + w);\n dp[u] = min(dp[u], d + w);\n }\n }\n };\n dfs(dfs, i, -1, 0);\n }\n for (int i = 0; i < M; i++) {\n if (C[id[i]] != c) continue;\n ans[id[i]] = min(ans[id[i]], dp[i]);\n }\n }\n\n for (int i = 0; i < N; i++) {\n cout << ans[i] << '\\n';\n }\n}", "accuracy": 1, "time_ms": 1320, "memory_kb": 50244, "score_of_the_acc": -0.9251, "final_rank": 15 }, { "submission_id": "aoj_0439_10823792", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug.hpp>\n#else\n#define debug(...)\n#endif\n\ntemplate <class T, class F>\nstruct SegmentTree {\n int n, len;\n vector<T> data;\n const F op;\n const T e;\n\n SegmentTree() = default;\n SegmentTree(int size, const F& operation, const T& identify) : n(size), op(operation), e(identify) { init(); }\n SegmentTree(const vector<T>& A, const F& operation, const T& identify) : n(int(A.size())), op(operation), e(identify) { init(), build(A); }\n void init() {\n len = 1;\n while (len < n) len <<= 1;\n data.assign(len << 1, e);\n }\n void build(const vector<T>& A) {\n for (int i = 0; i < n; i++) data[i + len] = A[i];\n for (int i = len - 1; i > 0; i--) data[i] = op(data[i << 1 | 0], data[i << 1 | 1]);\n }\n void update(int i, T x) {\n i += len, data[i] = x;\n while (i > 1) {\n i >>= 1;\n data[i] = op(data[i << 1 | 0], data[i << 1 | 1]);\n }\n }\n void add(int i, T x) {\n i += len, data[i] += x;\n while (i > 1) {\n i >>= 1;\n data[i] = op(data[i << 1 | 0], data[i << 1 | 1]);\n }\n }\n T prod(int l, int r) const {\n l += len, r += len;\n T resl = e, resr = e;\n while (l < r) {\n if (l & 1) resl = op(resl, data[l++]);\n if (r & 1) resr = op(data[--r], resr);\n l >>= 1, r >>= 1;\n }\n return op(resl, resr);\n }\n T all_prod() const { return data[1]; }\n T operator[](int i) const { return data[i + len]; }\n\n // check(A[l] * ... * A[r - 1]) = true となる最大の r\n template <class C>\n int max_right(int l, const C& check) const {\n assert(0 <= l && l <= n && check(e));\n if (l == n) return n;\n l += len;\n T sum = e;\n do {\n while (l % 2 == 0) l >>= 1;\n if (!check(op(sum, data[l]))) {\n while (l < len) {\n l = l << 1 | 0;\n if (check(op(sum, data[l]))) {\n sum = op(sum, data[l++]);\n }\n }\n return l - len;\n }\n sum = op(sum, data[l++]);\n } while ((l & -l) != l);\n return n;\n }\n\n // check(A[l] * ... * A[r - 1]) = true となる最小の l\n template <class C>\n int min_left(int r, const C& check) const {\n assert(0 <= r && r <= n && check(e));\n if (r == 0) return 0;\n r += len;\n T sum = e;\n do {\n --r;\n while (r > 1 && r % 2) r >>= 1;\n if (!check(op(data[r], sum))) {\n while (r < len) {\n r = r << 1 | 1;\n if (check(op(data[r], sum))) {\n sum = op(data[r--], sum);\n }\n }\n return r + 1 - len;\n }\n sum = op(data[r], sum);\n } while ((r & -r) != r);\n return 0;\n }\n};\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N;\n cin >> N;\n vector<int> C(N);\n for (int i = 0; i < N; i++) cin >> C[i], C[i]--;\n vector<vector<int>> G(N);\n for (int i = 0; i < N - 1; i++) {\n int s, t;\n cin >> s >> t, s--, t--;\n G[s].emplace_back(t);\n G[t].emplace_back(s);\n }\n\n // 色 i の頂点集合\n vector<vector<int>> groups(N);\n for (int i = 0; i < N; i++) groups[C[i]].emplace_back(i);\n\n // 区間最小値 Segment Tree\n using S = pair<int, int>;\n constexpr S e = {numeric_limits<int>::max(), -1};\n auto op = [](S a, S b) { return min(a, b); };\n // Euler Tour\n int t = 0;\n vector<int> in(N), out(N), depth(N), pos(2 * N - 1);\n auto et = [&](auto&& self, int v, int p) -> void {\n in[v] = t, pos[t] = v, t++;\n for (int u : G[v]) {\n if (u == p) continue;\n depth[u] = depth[v] + 1;\n self(self, u, v);\n pos[t] = v, t++;\n }\n out[v] = t;\n };\n et(et, 0, -1);\n vector<S> init(2 * N - 1);\n for (int i = 0; i < 2 * N - 1; i++) init[i] = {depth[pos[i]], pos[i]};\n SegmentTree seg(init, op, e);\n auto lca = [&](int a, int b) -> int { return seg.prod(min(in[a], in[b]), max(out[a], out[b])).second; };\n auto dist = [&](int a, int b) -> int { return depth[a] + depth[b] - 2 * depth[lca(a, b)]; };\n\n vector<int> ans(N, N);\n // 色 c 毎に解く\n for (int c = 0; c < N; c++) {\n int M = ssize(groups[c]);\n sort(groups[c].begin(), groups[c].end(), [&](int a, int b) { return in[a] < in[b]; });\n for (int i = 0; i < M - 1; i++) {\n int a = groups[c][i], b = groups[c][i + 1], l = lca(a, b);\n groups[c].emplace_back(l);\n }\n sort(groups[c].begin(), groups[c].end(), [&](int a, int b) { return in[a] < in[b]; });\n groups[c].erase(unique(groups[c].begin(), groups[c].end()), groups[c].end());\n M = ssize(groups[c]);\n // T := 色 c の Auxiliary Tree を構築\n vector<vector<pair<int, int>>> T(M);\n stack<int> stk;\n for (int i = 0; i < M; i++) {\n // stk の top が groups[c][i] の先祖になるまで pop\n while (!stk.empty() && out[groups[c][stk.top()]] < in[groups[c][i]]) stk.pop();\n if (!stk.empty()) {\n int d = dist(groups[c][i], groups[c][stk.top()]);\n T[stk.top()].emplace_back(i, d);\n T[i].emplace_back(stk.top(), d);\n }\n stk.emplace(i);\n }\n // Auxiliary Tree 上の木 dp を各頂点で行う\n vector<int> dp(M, N);\n for (int i = 0; i < M; i++) {\n if (C[groups[c][i]] != c) continue;\n auto dfs = [&](auto&& self, int v, int p, int d) -> void {\n for (auto [u, w] : T[v]) {\n if (u == p) continue;\n if (C[groups[c][u]] != c) {\n // u が色 c の頂点でない場合: 次の頂点に移動\n self(self, u, v, d + w);\n } else {\n // u が色 c の頂点の場合: dp を更新\n dp[i] = min(dp[i], d + w);\n dp[u] = min(dp[u], d + w);\n }\n }\n };\n dfs(dfs, i, -1, 0);\n }\n for (int i = 0; i < M; i++) {\n if (C[groups[c][i]] != c) continue;\n ans[groups[c][i]] = min(ans[groups[c][i]], dp[i]);\n }\n }\n\n for (int i = 0; i < N; i++) {\n cout << ans[i] << '\\n';\n }\n}", "accuracy": 1, "time_ms": 1480, "memory_kb": 43224, "score_of_the_acc": -0.9465, "final_rank": 18 }, { "submission_id": "aoj_0439_10786670", "code_snippet": "#include <iostream>\n#include <iomanip>\n#include <cassert>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <numeric>\n#include <tuple>\n#include <ranges>\nnamespace ranges = std::ranges;\nnamespace views = std::views;\n// #include \"Src/Number/IntegerDivision.hpp\"\n// #include \"Src/Utility/BinarySearch.hpp\"\n// #include \"Src/Sequence/CompressedSequence.hpp\"\n// #include \"Src/Sequence/RunLengthEncoding.hpp\"\n// #include \"Src/Algebra/Group/AdditiveGroup.hpp\"\n// #include \"Src/DataStructure/FenwickTree/FenwickTree.hpp\"\n\n\n#include <cstdint>\n#include <cstddef>\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n\n\n#include <concepts>\n\nnamespace zawa {\n\nnamespace concepts {\n\ntemplate <class T>\nconcept Semigroup = requires {\n typename T::Element;\n { T::operation(std::declval<typename T::Element>(), std::declval<typename T::Element>()) } -> std::same_as<typename T::Element>;\n};\n\n} // namespace concepts\n\n} // namespace zawa\n\n\nnamespace zawa {\n\nnamespace concepts {\n\ntemplate <class T>\nconcept Identitiable = requires {\n typename T::Element;\n { T::identity() } -> std::same_as<typename T::Element>;\n};\n\ntemplate <class T>\nconcept Monoid = Semigroup<T> and Identitiable<T>;\n\n} // namespace\n\n} // namespace zawa\n\n#include <functional>\n#include <type_traits>\n#include <ostream>\n\nnamespace zawa {\n\ntemplate <concepts::Monoid Monoid>\nclass SegmentTree {\npublic:\n\n using VM = Monoid;\n\n using V = typename VM::Element;\n\n using OM = Monoid;\n\n using O = typename OM::Element;\n\n SegmentTree() = default;\n\n explicit SegmentTree(usize n) : m_n{ n }, m_dat(n << 1, VM::identity()) {}\n\n explicit SegmentTree(const std::vector<V>& dat) : m_n{ dat.size() }, m_dat(dat.size() << 1, VM::identity()) {\n for (usize i{} ; i < m_n ; i++) {\n m_dat[i + m_n] = dat[i];\n }\n for (usize i{m_n} ; i-- ; ) {\n m_dat[i] = VM::operation(m_dat[left(i)], m_dat[right(i)]);\n }\n }\n\n [[nodiscard]] inline usize size() const noexcept {\n return m_n;\n }\n\n [[nodiscard]] V get(usize i) const {\n assert(i < size());\n return m_dat[i + m_n];\n }\n\n [[nodiscard]] V operator[](usize i) const {\n assert(i < size());\n return m_dat[i + m_n];\n }\n\n void operation(usize i, const O& value) {\n assert(i < size());\n i += size();\n m_dat[i] = OM::operation(m_dat[i], value);\n while (i = parent(i), i) {\n m_dat[i] = VM::operation(m_dat[left(i)], m_dat[right(i)]);\n }\n }\n\n void assign(usize i, const V& value) {\n assert(i < size());\n i += size();\n m_dat[i] = value;\n while (i = parent(i), i) {\n m_dat[i] = VM::operation(m_dat[left(i)], m_dat[right(i)]);\n }\n }\n\n [[nodiscard]] V product(u32 l, u32 r) const {\n assert(l <= r and r <= size());\n V L{ VM::identity() }, R{ VM::identity() };\n for (l += size(), r += size() ; l < r ; l = parent(l), r = parent(r)) {\n if (l & 1) {\n L = VM::operation(L, m_dat[l++]);\n }\n if (r & 1) {\n R = VM::operation(m_dat[--r], R);\n }\n }\n return VM::operation(L, R);\n }\n\n template <class F>\n requires std::predicate<F, V>\n [[nodiscard]] usize maxRight(usize l, const F& f) {\n assert(l < size());\n static_assert(std::is_convertible_v<decltype(f), std::function<bool(V)>>, \"maxRight's argument f must be function bool(T)\");\n assert(f(VM::identity()));\n usize res{l}, width{1};\n V prod{ VM::identity() };\n // 現在の見ている頂点の幅をwidthで持つ\n // 境界がある頂点を含む部分木の根を探す\n // (折り返す時は必要以上の幅を持つ根になるが、widthを持っているのでオーバーしない)\n for (l += size() ; res + width <= size() ; l = parent(l), width <<= 1) if (l & 1) {\n if (not f(VM::operation(prod, m_dat[l]))) break; \n res += width;\n prod = VM::operation(prod, m_dat[l++]);\n }\n // 根から下って、境界を発見する\n while (l = left(l), width >>= 1) {\n if (res + width <= size() and f(VM::operation(prod, m_dat[l]))) {\n res += width;\n prod = VM::operation(prod, m_dat[l++]);\n } \n }\n return res;\n }\n\n template <class F>\n requires std::predicate<F, V>\n [[nodiscard]] usize minLeft(usize r, const F& f) const {\n assert(r <= size());\n static_assert(std::is_convertible_v<decltype(f), std::function<bool(V)>>, \"minLeft's argument f must be function bool(T)\");\n assert(f(VM::identity()));\n usize res{r}, width{1};\n V prod{ VM::identity() };\n for (r += size() ; res >= width ; r = parent(r), width <<= 1) if (r & 1) {\n if (not f(VM::operation(m_dat[r - 1], prod))) break;\n res -= width;\n prod = VM::operation(prod, m_dat[--r]);\n }\n while (r = left(r), width >>= 1) {\n if (res >= width and f(VM::operation(m_dat[r - 1], prod))) {\n res -= width;\n prod = VM::operation(m_dat[--r], prod);\n }\n }\n return res;\n }\n\n friend std::ostream& operator<<(std::ostream& os, const SegmentTree& st) {\n for (usize i{1} ; i < 2 * st.size() ; i++) {\n os << st.m_dat[i] << (i + 1 == 2 * st.size() ? \"\" : \" \");\n }\n return os;\n }\n\nprivate:\n\n constexpr u32 left(u32 v) const {\n return v << 1;\n }\n\n constexpr u32 right(u32 v) const {\n return v << 1 | 1;\n }\n\n constexpr u32 parent(u32 v) const {\n return v >> 1;\n }\n\n usize m_n;\n\n std::vector<V> m_dat;\n};\n\n} // namespace zawa\n// #include \"Src/DataStructure/DisjointSetUnion/DisjointSetUnion.hpp\"\n\n\n#include <cmath>\n#include <limits>\n\nnamespace zawa {\n\ntemplate <class V>\nclass HeavyLightDecomposition {\npublic:\n\n static constexpr V Invalid() noexcept {\n return INVALID;\n }\n\n HeavyLightDecomposition() = default;\n\n HeavyLightDecomposition(std::vector<std::vector<V>> T, V root = 0u) \n : n_{T.size()}, par_(n_), top_(n_), idx_(n_), \n inv_(n_), size_(n_, usize{1}), dep_(n_) {\n\n auto dfs1{[&](auto dfs, V v, V p, usize d) -> usize {\n par_[v] = p;\n dep_[v] = d;\n if (p != INVALID) {\n for (u32 i{} ; i + 1 < T[v].size() ; i++) if (T[v][i] == p) {\n std::swap(T[v][i], T[v].back());\n break;\n }\n assert(T[v].back() == p);\n T[v].pop_back();\n }\n for (V x : T[v]) {\n size_[v] += dfs(dfs, x, v, d + 1);\n }\n for (u32 i{1} ; i < T[v].size() ; i++) if (size_[T[v][0]] < size_[T[v][i]]) {\n std::swap(T[v][0], T[v][i]);\n }\n return size_[v];\n }};\n\n auto dfs2{[&](auto dfs, V v, V idx, V top) -> V {\n idx_[v] = idx++;\n inv_[idx_[v]] = v;\n top_[v] = top;\n if (T[v].size()) {\n idx = dfs(dfs, T[v][0], idx, top);\n for (u32 i{1} ; i < T[v].size() ; i++) {\n idx = dfs(dfs, T[v][i], idx, T[v][i]);\n }\n }\n return idx;\n }};\n\n dfs1(dfs1, root, INVALID, 0u);\n dfs2(dfs2, root, 0u, root);\n }\n\n inline usize size() const noexcept {\n return n_;\n }\n\n usize size(V v) const noexcept {\n assert(v < (V)size());\n return size_[v];\n }\n\n usize depth(V v) const noexcept {\n assert(v < (V)size());\n return dep_[v];\n }\n\n usize top(V v) const noexcept {\n assert(v < (V)size());\n return top_[v];\n }\n\n V parent(V v) const noexcept {\n assert(v < (V)size());\n return par_[v];\n }\n\n V index(V v) const noexcept {\n assert(v < (V)size());\n return idx_[v];\n }\n\n V operator[](V v) const noexcept {\n assert(v < (V)size());\n return idx_[v];\n }\n\n std::vector<std::pair<V, V>> decomp(V s, V t) const {\n assert(s < (V)size());\n assert(t < (V)size());\n std::vector<std::pair<V, V>> res, ser;\n while (top_[s] != top_[t]) {\n if (dep_[top_[s]] >= dep_[top_[t]]) {\n res.emplace_back(s, top_[s]);\n s = top_[s];\n if (par_[s] != INVALID) s = par_[s];\n }\n else {\n ser.emplace_back(top_[t], t);\n t = top_[t];\n if (par_[t] != INVALID) t = par_[t];\n }\n }\n res.emplace_back(s, t);\n std::reverse(ser.begin(), ser.end());\n res.insert(res.end(), ser.begin(), ser.end()); \n return res;\n }\n\n std::vector<std::pair<V, V>> operator()(V s, V t) const {\n return decomp(s, t);\n }\n\n V lca(V u, V v) const {\n assert(u < (V)size());\n assert(v < (V)size());\n while (top_[u] != top_[v]) {\n if (dep_[top_[u]] >= dep_[top_[v]]) {\n u = top_[u];\n if (par_[u] != INVALID) u = par_[u];\n }\n else {\n v = top_[v];\n if (par_[v] != INVALID) v = par_[v];\n }\n }\n return (dep_[u] <= dep_[v] ? u : v);\n }\n\n // pはvの祖先か？\n bool isAncestor(V v, V p) {\n assert(v < size());\n assert(p < size());\n if (dep_[v] < dep_[p]) return false;\n while (v != INVALID and top_[v] != top_[p]) {\n v = par_[top_[v]];\n }\n return v != INVALID;\n }\n\n V levelAncestor(V v, usize step) const {\n assert(v < (V)size());\n if (step > dep_[v]) return INVALID;\n while (true) {\n usize dist{dep_[v] - dep_[top_[v]]};\n if (dist >= step) break;\n step -= dist + 1;\n v = par_[top_[v]];\n }\n step = (dep_[v] - dep_[top_[v]]) - step;\n return inv_[idx_[top_[v]] + step];\n }\n\n V jump(V s, V t, usize step) const {\n assert(s < (V)size());\n assert(t < (V)size());\n V uu{INVALID}, vv{INVALID};\n usize d{};\n for (auto [u, v] : decomp(s, t)) {\n usize dist{std::max(dep_[u], dep_[v]) - std::min(dep_[u], dep_[v])};\n if (dist >= step) {\n uu = u;\n vv = v;\n d = dist;\n break;\n }\n step -= dist + 1;\n }\n if (uu == INVALID) return INVALID;\n if (dep_[uu] <= dep_[vv]) {\n return inv_[idx_[uu] + step];\n }\n else {\n return inv_[idx_[vv] + (d - step)];\n }\n }\n\n usize distance(V s, V t) const {\n assert(s < (V)size());\n assert(t < (V)size());\n usize res{};\n for (auto [u, v] : decomp(s, t)) {\n if (dep_[u] > dep_[v]) std::swap(u, v);\n res += dep_[v] - dep_[u];\n }\n return res;\n }\n\nprivate:\n static constexpr V INVALID{static_cast<V>(-1)};\n usize n_{};\n std::vector<V> par_{}, top_{}, idx_{}, inv_{};\n std::vector<usize> size_{}, dep_{};\n};\n\n} // namespace zawa\nusing namespace zawa;\n// #include \"atcoder/modint\"\n// using mint = atcoder::modint998244353;\n#include <set>\nusing namespace std;\nstruct M {\n using Element = int;\n static Element identity() {\n return (int)1e9;\n }\n static Element operation(Element L, Element R) {\n return min(L, R);\n }\n};\nint N, Q, T[1000010], V[1000010];\nvector<vector<int>> g;\n// https://yukicoder.me/submissions/1110541\nvector<int> solver() {\n HeavyLightDecomposition hld{g};\n SegmentTree<M> seg(N), seg2(N);\n vector<set<pair<int, int>>> bk(N);\n auto upd = [&](int u, int v) -> void {\n pair<int, int> cur{hld.depth(v), v};\n auto it = bk[u].find(cur);\n if (it != bk[u].end()) bk[u].erase(it);\n else bk[u].insert(cur);\n seg.assign(hld[u], bk[u].size() ? (bk[u].begin()->first - 2 * (int)hld.depth(u)) : M::identity());\n seg2.assign(hld[u], bk[u].size() ? bk[u].begin()->first : M::identity());\n };\n vector<int> deep(N);\n for (int i = 0 ; i < N ; i++) {\n int tp = hld.top(i);\n if (hld.depth(deep[tp]) < hld.depth(i)) deep[tp] = i;\n }\n auto leaf_prod = [&](int v) -> int {\n int u = deep[hld.top(v)];\n tie(u, v) = minmax({hld[u], hld[v]});\n return seg2.product(u, v + 1);\n };\n vector<int> anses;\n for (int i = 0 ; i < Q ; i++) {\n if (T[i] == 1) {\n for (auto [u, v] : hld(V[i], 0)) {\n upd(u, V[i]);\n if (u != v) upd(v, V[i]);\n }\n }\n else if (T[i] == 2) {\n int ans = M::identity();\n for (auto [u, v] : hld(V[i], 0)) {\n if (hld.depth(u) > hld.depth(v)) {\n ans = min(ans, leaf_prod(u) - 2 * (int)hld.depth(u));\n }\n else {\n ans = min(ans, leaf_prod(v) - 2 * (int)hld.depth(v));\n }\n tie(u, v) = minmax({hld[u], hld[v]});\n ans = min<int>(ans, seg.product(u, v + 1));\n }\n ans += hld.depth(V[i]);\n anses.push_back(ans);\n }\n else assert(false);\n }\n return anses;\n}\nint main() {\n cin.tie(0);\n cout.tie(0);\n ios::sync_with_stdio(0);\n cin >> N;\n g.resize(N);\n vector<int> C(N);\n vector<vector<int>> buc(N);\n for (int i = 0 ; i < N ; i++) {\n cin >> C[i];\n C[i]--;\n buc[C[i]].push_back(i);\n }\n for (int i = 0 ; i < N - 1 ; i++) {\n int u, v;\n cin >> u >> v;\n u--; v--;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n auto flip = [&](int v) {\n T[Q] = 1;\n V[Q] = v;\n Q++;\n };\n auto query = [&](int v) {\n T[Q] = 2;\n V[Q] = v;\n Q++;\n };\n vector<int> ord;\n ord.reserve(N);\n for (int i = 0 ; i < N ; i++) if (buc[i].size()) {\n for (int v : buc[i]) flip(v);\n for (int v : buc[i]) {\n flip(v);\n query(v);\n ord.push_back(v);\n flip(v);\n }\n for (int v : buc[i]) flip(v);\n } \n vector<int> ans(N);\n auto p = solver();\n for (int i = 0 ; i < N ; i++) ans[ord[i]] = p[i];\n for (int i = 0 ; i < N ; i++) cout << ans[i] << '\\n';\n}", "accuracy": 1, "time_ms": 1050, "memory_kb": 63684, "score_of_the_acc": -0.9061, "final_rank": 14 }, { "submission_id": "aoj_0439_10173878", "code_snippet": "// AOJ #439\n// Coloured Mountain Hut 2025.2.2\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nconst ll INF = 1000000000000000000LL;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tif (c == '-') {\tc = gc();\n\t\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\t\treturn -n;\n\t}\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Cout(int n) {\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tif (n < 0) pc('-'), n = -n;\n\t\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n\t\twhile (i--) pc(b[i]);\n\t}\n\tpc('\\n');\n}\n\nint N;\nvector<vector<int>> tree; // 1-indexed\nvector<int> col;\n \nvector<int> depth, parent, inTime, outTime;\nint timer = 0;\n \nvoid dfsTree(int v, int p, int d) {\n depth[v] = d;\n parent[v] = p;\n inTime[v] = timer++;\n for (int nxt : tree[v]) {\n if(nxt == p) continue;\n dfsTree(nxt, v, d+1);\n }\n outTime[v] = timer;\n}\n \nint LOGN;\nvector<vector<int>> upTable;\nvoid buildLCA() {\n LOGN = 32 - __builtin_clz(N);\n upTable.assign(LOGN, vector<int>(N+1, 0));\n for (int v = 1; v <= N; v++){\n upTable[0][v] = parent[v];\n }\n for (int k = 1; k < LOGN; k++){\n for (int v = 1; v <= N; v++){\n int mid = upTable[k-1][v];\n upTable[k][v] = (mid == 0 ? 0 : upTable[k-1][mid]);\n }\n }\n}\n \nint getLCA(int a, int b) {\n if(depth[a] < depth[b])\n swap(a, b);\n int d = depth[a] - depth[b];\n for (int k = 0; k < LOGN; k++){\n if(d & (1 << k))\n a = upTable[k][a];\n }\n if(a == b) return a;\n for (int k = LOGN-1; k >= 0; k--){\n if(upTable[k][a] != upTable[k][b]){\n a = upTable[k][a];\n b = upTable[k][b];\n }\n }\n return parent[a];\n}\n \nint getDist(int a, int b) {\n int l = getLCA(a, b);\n return depth[a] + depth[b] - 2 * depth[l];\n}\n \npair<vector<int>, vector<vector<pair<int,int>>>> buildVirtualTree(const vector<int> &nodes) {\n vector<int> vt = nodes;\n for (size_t i = 0; i + 1 < nodes.size(); i++){\n int l = getLCA(nodes[i], nodes[i+1]);\n vt.push_back(l);\n }\n sort(vt.begin(), vt.end(), [&](int a, int b){\n return inTime[a] < inTime[b];\n });\n vt.erase(unique(vt.begin(), vt.end()), vt.end());\n \n int M = vt.size();\n vector<vector<pair<int,int>>> vtAdj(M);\n {\n vector<int> st;\n for (int i = 0; i < M; i++){\n while(!st.empty() && outTime[ vt[st.back()] ] <= inTime[ vt[i] ])\n st.pop_back();\n if(!st.empty()){\n int u = st.back(), v = i;\n int w = getDist(vt[u], vt[i]);\n vtAdj[u].push_back({v, w});\n vtAdj[v].push_back({u, w});\n }\n st.push_back(i);\n }\n }\n return {vt, vtAdj};\n}\n \nstruct State {\n ll dist;\n int v;\n int src;\n};\n \nstruct StateComp {\n bool operator()(const State &a, const State &b) const {\n return a.dist > b.dist;\n }\n};\n \nvoid multiSourceDijkstra(int M, const vector<vector<pair<int,int>>> &vtAdj,\n const vector<bool> &active,\n vector<ll> &bestDist, vector<int> &bestSrc,\n vector<ll> &secondDist, vector<int> &secondSrc)\n{\n bestDist.assign(M, INF);\n secondDist.assign(M, INF);\n bestSrc.assign(M, -1);\n secondSrc.assign(M, -1);\n \n priority_queue<State, vector<State>, StateComp> pq;\n for (int i = 0; i < M; i++){\n if(active[i]){\n bestDist[i] = 0;\n bestSrc[i] = i;\n pq.push({0, i, i});\n }\n }\n \n while(!pq.empty()){\n State st = pq.top();\n pq.pop();\n int v = st.v, s = st.src;\n ll d = st.dist;\n if(bestSrc[v] == s && d != bestDist[v]) continue;\n if(bestSrc[v] != s && d != secondDist[v]) continue;\n \n for(auto &edge : vtAdj[v]){\n int u = edge.first;\n int w = edge.second;\n ll nd = d + w;\n if(bestSrc[u] == s){\n if(nd < bestDist[u]){\n bestDist[u] = nd;\n pq.push({nd, u, s});\n }\n } else {\n if(nd < bestDist[u]){\n if(bestSrc[u] != -1){\n secondDist[u] = bestDist[u];\n secondSrc[u] = bestSrc[u];\n pq.push({secondDist[u], u, secondSrc[u]});\n }\n bestDist[u] = nd;\n bestSrc[u] = s;\n pq.push({nd, u, s});\n } else if(s != bestSrc[u] && nd < secondDist[u]){\n secondDist[u] = nd;\n secondSrc[u] = s;\n pq.push({nd, u, s});\n }\n }\n }\n }\n}\n \nvector<ll> ansGlobal;\n \nint main() {\n N = Cin();\n col.resize(N+1);\n for (int i = 1; i <= N; i++) col[i] = Cin();\n\n tree.assign(N+1, vector<int>());\n for (int i = 1; i <= N-1; i++){\n int u = Cin(), v = Cin();\n tree[u].push_back(v);\n tree[v].push_back(u);\n }\n \n depth.resize(N+1);\n parent.resize(N+1);\n inTime.resize(N+1);\n outTime.resize(N+1);\n timer = 0;\n dfsTree(1, 0, 0);\n buildLCA();\n \n // 各色ごとに頂点集合をグループ化\n vector<vector<int>> colorNodes(N+1);\n for (int v = 1; v <= N; v++){\n colorNodes[col[v]].push_back(v);\n }\n ansGlobal.assign(N+1, 0);\n \n // 各色グループごとに、仮想木を構築して multi–source Dijkstra を実行する\n for (int c = 1; c <= N; c++){\n if(colorNodes[c].empty() || colorNodes[c].size() < 2)\n continue;\n \n vector<int> nodes = colorNodes[c];\n sort(nodes.begin(), nodes.end(), [&](int a, int b){\n return inTime[a] < inTime[b];\n });\n \n auto vtPair = buildVirtualTree(nodes);\n vector<int> vtNodes = vtPair.first;\n vector<vector<pair<int,int>>> vtAdj = vtPair.second;\n int M = vtNodes.size();\n \n vector<bool> active(M, false);\n vector<bool> mark(N+1, false);\n for (int v : nodes)\n mark[v] = true;\n for (int i = 0; i < M; i++){\n if(mark[ vtNodes[i] ])\n active[i] = true;\n }\n \n vector<ll> bestDist, secondDist;\n vector<int> bestSrc, secondSrc;\n multiSourceDijkstra(M, vtAdj, active, bestDist, bestSrc, secondDist, secondSrc);\n \n for (int i = 0; i < M; i++){\n if(active[i]){\n ll candidate = (bestSrc[i] == i ? secondDist[i] : bestDist[i]);\n ansGlobal[ vtNodes[i] ] = candidate;\n }\n }\n }\n \n for (int i = 1; i <= N; i++) Cout(ansGlobal[i]);\n return 0;\n}", "accuracy": 1, "time_ms": 230, "memory_kb": 45760, "score_of_the_acc": -0.2162, "final_rank": 3 }, { "submission_id": "aoj_0439_10141180", "code_snippet": "#line 1 \"main.cpp\"\n// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/0439\n\n#include <iostream>\n#include <vector>\n#include <utility>\n#line 1 \"/workspaces/proconenv/lib/tools/auxiliary_tree.hpp\"\n\n\n\n#include <cstddef>\n#line 7 \"/workspaces/proconenv/lib/tools/auxiliary_tree.hpp\"\n#include <algorithm>\n#include <stack>\n#include <limits>\n#include <iterator>\n#include <type_traits>\n#line 1 \"/workspaces/proconenv/lib/tools/lca.hpp\"\n\n\n\n#include <cstdint>\n#line 7 \"/workspaces/proconenv/lib/tools/lca.hpp\"\n#include <cassert>\n#include <numeric>\n#line 13 \"/workspaces/proconenv/lib/tools/lca.hpp\"\n#include <tuple>\n#line 1 \"/workspaces/proconenv/lib/tools/ceil.hpp\"\n\n\n\n#line 6 \"/workspaces/proconenv/lib/tools/ceil.hpp\"\n\nnamespace tools {\n\ntemplate <typename M, typename N>\nconstexpr ::std::common_type_t<M, N> ceil(const M lhs, const N rhs) {\nusing T = ::std::common_type_t<M, N>;\nassert(rhs != N(0));\nreturn lhs / rhs + T(((lhs > M(0) && rhs > N(0)) || (lhs < M(0) && rhs < N(0))) && lhs % rhs);\n}\n}\n\n\n#line 1 \"/workspaces/proconenv/lib/tools/less_by.hpp\"\n\n\n\nnamespace tools {\n\ntemplate <class F>\nclass less_by {\nprivate:\nF selector;\n\npublic:\nless_by(const F& selector) : selector(selector) {\n}\n\ntemplate <class T>\nbool operator()(const T& x, const T& y) const {\nreturn selector(x) < selector(y);\n}\n};\n}\n\n\n#line 1 \"/workspaces/proconenv/lib/tools/ceil_log2.hpp\"\n\n\n\n#line 8 \"/workspaces/proconenv/lib/tools/ceil_log2.hpp\"\n#include <array>\n#line 10 \"/workspaces/proconenv/lib/tools/ceil_log2.hpp\"\n\n// Source: https://stackoverflow.com/questions/3272424/compute-fast-log-base-2-ceiling/15327567#15327567\n// License: CC BY-SA 3.0\n// Author: dgobbi\n\nnamespace tools {\n\ntemplate <typename T>\nT ceil_log2(T x) {\nstatic_assert(::std::is_integral_v<T>);\nassert(x > 0);\nif constexpr (::std::is_signed_v<T>) {\nreturn static_cast<T>(::tools::ceil_log2<::std::make_unsigned_t<T>>(x));\n} else {\nconst auto log2 = [](const int w) {\nif (w == 8) return 3;\nif (w == 16) return 4;\nif (w == 32) return 5;\nif (w == 64) return 6;\nreturn -1;\n};\nstatic_assert(log2(::std::numeric_limits<T>::digits) >= 0);\n\nconstexpr auto t = ::std::make_tuple(\n::std::array<::std::uint8_t, 3>({\nUINT8_C(0xf0),\nUINT8_C(0x0c),\nUINT8_C(0x02)\n}),\n::std::array<::std::uint16_t, 4>({\nUINT16_C(0xff00),\nUINT16_C(0x00f0),\nUINT16_C(0x000c),\nUINT16_C(0x0002)\n}),\n::std::array<::std::uint32_t, 5>({\nUINT32_C(0xffff0000),\nUINT32_C(0x0000ff00),\nUINT32_C(0x000000f0),\nUINT32_C(0x0000000c),\nUINT32_C(0x00000002)\n}),\n::std::array<::std::uint64_t, 6>({\nUINT64_C(0xffffffff00000000),\nUINT64_C(0x00000000ffff0000),\nUINT64_C(0x000000000000ff00),\nUINT64_C(0x00000000000000f0),\nUINT64_C(0x000000000000000c),\nUINT64_C(0x0000000000000002)\n})\n);\n\nT y = (((x & (x - 1)) == 0) ? 0 : 1);\nT j = ::std::numeric_limits<T>::digits / 2;\n\nfor (const auto t_i : ::std::get<log2(::std::numeric_limits<T>::digits) - 3>(t)) {\nT k = (((x & t_i) == 0) ? 0 : j);\ny += k;\nx >>= k;\nj >>= 1;\n}\n\nreturn y;\n}\n}\n}\n\n\n#line 1 \"/workspaces/proconenv/lib/tools/floor_log2.hpp\"\n\n\n\n#line 1 \"/workspaces/proconenv/lib/tools/popcount.hpp\"\n\n\n\n#line 8 \"/workspaces/proconenv/lib/tools/popcount.hpp\"\n\nnamespace tools {\n\ntemplate <typename T>\nT popcount(T x) {\nstatic_assert(::std::is_integral_v<T>);\nassert(x >= 0);\nif constexpr (::std::is_signed_v<T>) {\nreturn static_cast<T>(::tools::popcount<::std::make_unsigned_t<T>>(x));\n} else {\nconst auto log2 = [](const int w) {\nif (w == 8) return 3;\nif (w == 16) return 4;\nif (w == 32) return 5;\nif (w == 64) return 6;\nreturn -1;\n};\nstatic_assert(log2(::std::numeric_limits<T>::digits) >= 0);\n\nif constexpr (::std::numeric_limits<T>::digits == 8) {\nx = (x & UINT8_C(0x55)) + (x >> 1 & UINT8_C(0x55));\nx = (x & UINT8_C(0x33)) + (x >> 2 & UINT8_C(0x33));\nx = (x & UINT8_C(0x0f)) + (x >> 4 & UINT8_C(0x0f));\n} else if constexpr (::std::numeric_limits<T>::digits == 16) {\nx = (x & UINT16_C(0x5555)) + (x >> 1 & UINT16_C(0x5555));\nx = (x & UINT16_C(0x3333)) + (x >> 2 & UINT16_C(0x3333));\nx = (x & UINT16_C(0x0f0f)) + (x >> 4 & UINT16_C(0x0f0f));\nx = (x & UINT16_C(0x00ff)) + (x >> 8 & UINT16_C(0x00ff));\n} else if constexpr (::std::numeric_limits<T>::digits == 32) {\nx = (x & UINT32_C(0x55555555)) + (x >> 1 & UINT32_C(0x55555555));\nx = (x & UINT32_C(0x33333333)) + (x >> 2 & UINT32_C(0x33333333));\nx = (x & UINT32_C(0x0f0f0f0f)) + (x >> 4 & UINT32_C(0x0f0f0f0f));\nx = (x & UINT32_C(0x00ff00ff)) + (x >> 8 & UINT32_C(0x00ff00ff));\nx = (x & UINT32_C(0x0000ffff)) + (x >> 16 & UINT32_C(0x0000ffff));\n} else if constexpr (::std::numeric_limits<T>::digits == 64) {\nx = (x & UINT64_C(0x5555555555555555)) + (x >> 1 & UINT64_C(0x5555555555555555));\nx = (x & UINT64_C(0x3333333333333333)) + (x >> 2 & UINT64_C(0x3333333333333333));\nx = (x & UINT64_C(0x0f0f0f0f0f0f0f0f)) + (x >> 4 & UINT64_C(0x0f0f0f0f0f0f0f0f));\nx = (x & UINT64_C(0x00ff00ff00ff00ff)) + (x >> 8 & UINT64_C(0x00ff00ff00ff00ff));\nx = (x & UINT64_C(0x0000ffff0000ffff)) + (x >> 16 & UINT64_C(0x0000ffff0000ffff));\nx = (x & UINT64_C(0x00000000ffffffff)) + (x >> 32 & UINT64_C(0x00000000ffffffff));\n}\n\nreturn x;\n}\n}\n}\n\n\n#line 8 \"/workspaces/proconenv/lib/tools/floor_log2.hpp\"\n\nnamespace tools {\n\ntemplate <typename T>\nT floor_log2(T x) {\nstatic_assert(::std::is_integral_v<T>);\nassert(x > 0);\nif constexpr (::std::is_signed_v<T>) {\nreturn static_cast<T>(::tools::floor_log2<::std::make_unsigned_t<T>>(x));\n} else {\nconst auto log2 = [](const int w) {\nif (w == 8) return 3;\nif (w == 16) return 4;\nif (w == 32) return 5;\nif (w == 64) return 6;\nreturn -1;\n};\nstatic_assert(log2(::std::numeric_limits<T>::digits) >= 0);\n\nx |= (x >> 1);\nx |= (x >> 2);\nx |= (x >> 4);\nif constexpr (::std::numeric_limits<T>::digits > 8) x |= (x >> 8);\nif constexpr (::std::numeric_limits<T>::digits > 16) x |= (x >> 16);\nif constexpr (::std::numeric_limits<T>::digits > 32) x |= (x >> 32);\nreturn ::tools::popcount(x) - static_cast<T>(1);\n}\n}\n}\n\n\n#line 1 \"/workspaces/proconenv/lib/tools/pow2.hpp\"\n\n\n\n#line 6 \"/workspaces/proconenv/lib/tools/pow2.hpp\"\n\nnamespace tools {\n\ntemplate <typename T, typename ::std::enable_if<::std::is_unsigned<T>::value, ::std::nullptr_t>::type = nullptr>\nconstexpr T pow2(const T x) {\nreturn static_cast<T>(1) << x;\n}\n\ntemplate <typename T, typename ::std::enable_if<::std::is_signed<T>::value, ::std::nullptr_t>::type = nullptr>\nconstexpr T pow2(const T x) {\nreturn static_cast<T>(static_cast<typename ::std::make_unsigned<T>::type>(1) << static_cast<typename ::std::make_unsigned<T>::type>(x));\n}\n}\n\n\n#line 19 \"/workspaces/proconenv/lib/tools/lca.hpp\"\n\nnamespace tools {\nclass lca {\nusing u32 = ::std::uint32_t;\n::std::vector<::std::vector<u32>> m_graph;\n::std::vector<u32> m_depth;\n::std::vector<u32> m_tour;\n::std::vector<u32> m_in;\nu32 m_block_size;\n::std::vector<::std::vector<u32>> m_sparse_table;\n::std::vector<::std::vector<::std::vector<u32>>> m_lookup_table;\n::std::vector<u32> m_patterns;\n\nbool built() const {\nreturn !this->m_depth.empty();\n}\n\nu32 nblocks() const {\nreturn ::tools::ceil(this->m_tour.size(), this->m_block_size);\n}\n\nauto less_by_depth() const {\nreturn ::tools::less_by([&](const auto v) { return this->m_depth[v]; });\n}\n\npublic:\nlca() = default;\nexplicit lca(const ::std::size_t n) : m_graph(n) {\nassert(n >= 1);\n}\n\n::std::size_t size() const {\nreturn this->m_graph.size();\n}\n\nvoid add_edge(const ::std::size_t u, const ::std::size_t v) {\nassert(!this->built());\nassert(u < this->size());\nassert(v < this->size());\nassert(u != v);\nthis->m_graph[u].push_back(v);\nthis->m_graph[v].push_back(u);\n}\n\nvoid build(const ::std::size_t r) {\nassert(!this->built());\nassert(::std::accumulate(this->m_graph.begin(), this->m_graph.end(), static_cast<::std::size_t>(0), [](const auto sum, const auto& neighbors) { return sum + neighbors.size(); }) == 2 * (this->size() - 1));\n\nthis->m_depth.assign(this->size(), ::std::numeric_limits<u32>::max());\nthis->m_tour.resize(2 * this->size() - 1);\nthis->m_in.resize(this->size());\n\nu32 t = 0;\n::std::stack<::std::pair<u32, u32>> stack;\nstack.emplace(r, 0);\nwhile (!stack.empty()) {\nconst auto [here, depth] = stack.top();\nstack.pop();\nthis->m_tour[t] = here;\nif (this->m_depth[here] == ::std::numeric_limits<u32>::max()) {\nthis->m_depth[here] = depth;\nthis->m_in[here] = t;\nfor (const auto next : this->m_graph[here]) {\nif (this->m_depth[next] == ::std::numeric_limits<u32>::max()) {\nstack.emplace(here, depth);\nstack.emplace(next, depth + 1);\n}\n}\n}\n++t;\n}\n\nif (this->size() > 1) {\nthis->m_tour.pop_back();\n}\n\nthis->m_block_size = ::std::max<u32>(1, ::tools::ceil(::tools::ceil_log2(this->m_tour.size()), 2));\nthis->m_sparse_table.resize(::tools::floor_log2(this->nblocks()) + 1);\nthis->m_sparse_table[0].resize(this->nblocks());\nfor (u32 b = 0; (b + 1) * this->m_block_size <= this->m_tour.size(); ++b) {\nconst auto l = b * this->m_block_size;\nconst auto r = ::std::min<u32>(l + this->m_block_size, this->m_tour.size());\nthis->m_sparse_table[0][b] = *::std::min_element(this->m_tour.begin() + l, this->m_tour.begin() + r, this->less_by_depth());\n}\nfor (u32 h = 1; h < this->m_sparse_table.size(); ++h) {\nthis->m_sparse_table[h].resize(this->nblocks() + UINT32_C(1) - (UINT32_C(1) << h));\nfor (u32 b = 0; b < this->m_sparse_table[h].size(); ++b) {\nthis->m_sparse_table[h][b] = ::std::min(this->m_sparse_table[h - 1][b], this->m_sparse_table[h - 1][b + (UINT32_C(1) << (h - 1))], this->less_by_depth());\n}\n}\n\nthis->m_lookup_table.resize(::tools::pow2(this->m_block_size - 1));\nfor (u32 p = 0; p < this->m_lookup_table.size(); ++p) {\nthis->m_lookup_table[p].resize(this->m_block_size + 1);\nfor (u32 l = 0; l <= this->m_block_size; ++l) {\nthis->m_lookup_table[p][l].resize(this->m_block_size + 1);\n}\n\n::std::vector<u32> partial_sum(this->m_block_size);\npartial_sum[0] = this->m_block_size;\nfor (u32 i = 1; i < this->m_block_size; ++i) {\npartial_sum[i] = partial_sum[i - 1] - UINT32_C(1) + (((p >> (i - 1)) & UINT32_C(1)) << 1);\n}\n\nfor (u32 l = 0; l < this->m_block_size; ++l) {\nthis->m_lookup_table[p][l][l + 1] = l;\nfor (u32 r = l + 2; r <= this->m_block_size; ++r) {\nthis->m_lookup_table[p][l][r] = ::std::min(this->m_lookup_table[p][l][r - 1], r - 1, ::tools::less_by([&](const auto i) { return partial_sum[i]; }));\n}\n}\n}\n\nthis->m_patterns.resize(this->nblocks());\nfor (u32 b = 0; b * this->m_block_size < this->m_tour.size(); ++b) {\nconst auto l = b * this->m_block_size;\nconst auto r = ::std::min<u32>(l + this->m_block_size, this->m_tour.size());\nthis->m_patterns[b] = 0;\nfor (u32 i = l; i + 1 < r; ++i) {\nthis->m_patterns[b] |= static_cast<u32>(this->m_depth[this->m_tour[i]] < this->m_depth[this->m_tour[i + 1]]) << (i - l);\n}\n}\n}\n\n::std::size_t depth(const ::std::size_t v) const {\nassert(this->built());\nassert(v < this->size());\nreturn this->m_depth[v];\n}\n\n::std::size_t query(::std::size_t u, ::std::size_t v) const {\nassert(this->built());\nassert(u < this->size());\nassert(v < this->size());\n\n::std::tie(u, v) = ::std::minmax({u, v}, ::tools::less_by([&](const auto w) { return this->m_in[w]; }));\n\nconst auto l = this->m_in[u];\nconst auto r = this->m_in[v] + UINT32_C(1);\nconst auto bl = ::tools::ceil(l, this->m_block_size);\nconst auto br = r / this->m_block_size;\nu32 lca;\nif (br < bl) {\nlca = this->m_tour[br * this->m_block_size + this->m_lookup_table[this->m_patterns[br]][l % this->m_block_size][r % this->m_block_size]];\n} else {\nlca = u;\nif (bl < br) {\nconst auto h = ::tools::floor_log2(br - bl);\nlca = ::std::min(this->m_sparse_table[h][bl], this->m_sparse_table[h][br - (UINT32_C(1) << h)], this->less_by_depth());\n}\nif (l < bl * this->m_block_size) {\nlca = ::std::min(lca, this->m_tour[(bl - UINT32_C(1)) * this->m_block_size + this->m_lookup_table[this->m_patterns[bl - 1]][l % this->m_block_size][this->m_block_size]], this->less_by_depth());\n}\nif (br * this->m_block_size < r) {\nlca = ::std::min(lca, this->m_tour[br * this->m_block_size + this->m_lookup_table[this->m_patterns[br]][0][r % this->m_block_size]], this->less_by_depth());\n}\n}\n\nreturn lca;\n}\n\n// for tools::auxiliary_tree\n::std::size_t internal_in(const ::std::size_t v) const {\nassert(this->built());\nassert(v < this->size());\nreturn this->m_in[v];\n}\n};\n}\n\n\n#line 1 \"/workspaces/proconenv/lib/tools/less_by_first.hpp\"\n\n\n\n#line 5 \"/workspaces/proconenv/lib/tools/less_by_first.hpp\"\n\nnamespace tools {\n\nclass less_by_first {\npublic:\ntemplate <class T1, class T2>\nbool operator()(const ::std::pair<T1, T2>& x, const ::std::pair<T1, T2>& y) const {\nreturn x.first < y.first;\n}\n};\n}\n\n\n#line 15 \"/workspaces/proconenv/lib/tools/auxiliary_tree.hpp\"\n\nnamespace tools {\nclass auxiliary_tree {\n::tools::lca m_lca;\n\npublic:\nauxiliary_tree() = default;\nexplicit auxiliary_tree(const ::std::size_t n) : m_lca(n) {\n}\n\n::std::size_t size() const {\nreturn this->m_lca.size();\n}\n\nvoid add_edge(const ::std::size_t u, const ::std::size_t v) {\nthis->m_lca.add_edge(u, v);\n}\n\nvoid build(const ::std::size_t r) {\nthis->m_lca.build(r);\n}\n\n::std::size_t depth(const ::std::size_t v) const {\nreturn this->m_lca.depth(v);\n}\n\n::std::size_t lca(const ::std::size_t u, const ::std::size_t v) const {\nreturn this->m_lca.query(u, v);\n}\n\nclass query_result {\n::std::vector<::std::pair<::std::size_t, ::std::size_t>> m_parent;\n::std::vector<::std::vector<::std::size_t>> m_children;\n::std::size_t m_root;\n\ntemplate <typename InputIterator>\nquery_result(const ::tools::auxiliary_tree& tree, const InputIterator begin, const InputIterator end) {\n::std::vector<::std::size_t> X(begin, end);\nassert(!X.empty());\n::std::sort(X.begin(), X.end(), ::tools::less_by([&](const auto v) { return tree.m_lca.internal_in(v); }));\n\n::std::stack<::std::size_t> stack;\nauto it = X.begin();\nstack.push(*(it++));\nfor (; it != X.end(); ++it) {\nconst auto w = tree.lca(stack.top(), *it);\nwhile (!stack.empty() && tree.depth(w) < tree.depth(stack.top())) {\nconst auto u = stack.top();\nstack.pop();\nthis->m_parent.emplace_back(u, w);\nif (!stack.empty() && tree.depth(w) < tree.depth(stack.top())) {\nthis->m_parent.back().second = stack.top();\n}\n}\nif (stack.empty() || stack.top() != w) {\nstack.push(w);\n}\nstack.push(*it);\n}\nwhile (!stack.empty()) {\nconst auto u = stack.top();\nstack.pop();\nif (stack.empty()) {\nthis->m_parent.emplace_back(u, ::std::numeric_limits<::std::size_t>::max());\nthis->m_root = u;\n} else {\nthis->m_parent.emplace_back(u, stack.top());\n}\n}\n\n::std::sort(this->m_parent.begin(), this->m_parent.end(), ::tools::less_by_first{});\n\nthis->m_children.resize(this->m_parent.size());\nfor (const auto& [v, p] : this->m_parent) {\nif (v != this->m_root) {\nconst auto it = ::std::lower_bound(this->m_parent.begin(), this->m_parent.end(), ::std::make_pair(p, ::std::numeric_limits<::std::size_t>::max()), ::tools::less_by_first{});\nassert(it != this->m_parent.end());\nassert(it->first == p);\nthis->m_children[::std::distance(this->m_parent.begin(), it)].push_back(v);\n}\n}\n}\n\npublic:\nclass vertices_iterable {\nquery_result const *m_qr;\n\npublic:\nclass iterator {\nquery_result const *m_qr;\n::std::size_t m_i;\n\npublic:\nusing difference_type = ::std::ptrdiff_t;\nusing value_type = ::std::size_t;\nusing reference = const ::std::size_t&;\nusing pointer = const ::std::size_t*;\nusing iterator_category = ::std::input_iterator_tag;\n\niterator() = default;\niterator(query_result const * const qr, const ::std::size_t i) : m_qr(qr), m_i(i) {\n}\n\nreference operator*() const {\nreturn this->m_qr->m_parent[this->m_i].first;\n}\niterator& operator++() {\n++this->m_i;\nreturn *this;\n}\niterator operator++(int) {\nconst auto self = *this;\n++*this;\nreturn self;\n}\nfriend bool operator==(const iterator& lhs, const iterator& rhs) {\nassert(lhs.m_qr == rhs.m_qr);\nreturn lhs.m_i == rhs.m_i;\n}\nfriend bool operator!=(const iterator& lhs, const iterator& rhs) {\nreturn !(lhs == rhs);\n}\n};\n\nvertices_iterable() = default;\nvertices_iterable(query_result const * const qr) : m_qr(qr) {\n}\n\niterator begin() const {\nreturn iterator(this->m_qr, 0);\n};\niterator end() const {\nreturn iterator(this->m_qr, this->m_qr->m_parent.size());\n}\n};\n\nquery_result() = default;\n\n::std::size_t size() const {\nreturn this->m_parent.size();\n}\n\nvertices_iterable vertices() const {\nreturn vertices_iterable(this);\n}\n\n::std::size_t root() const {\nreturn this->m_root;\n}\n\n::std::size_t parent(const ::std::size_t v) const {\nconst auto it = ::std::lower_bound(this->m_parent.begin(), this->m_parent.end(), ::std::make_pair(v, ::std::numeric_limits<::std::size_t>::max()), ::tools::less_by_first{});\nassert(it != this->m_parent.end());\nassert(it->first == v);\nreturn it->second;\n}\n\nconst ::std::vector<::std::size_t>& children(const ::std::size_t v) const {\nconst auto it = ::std::lower_bound(this->m_parent.begin(), this->m_parent.end(), ::std::make_pair(v, ::std::numeric_limits<::std::size_t>::max()), ::tools::less_by_first{});\nassert(it != this->m_parent.end());\nassert(it->first == v);\nreturn this->m_children[::std::distance(this->m_parent.begin(), it)];\n}\n\nfriend ::tools::auxiliary_tree;\n};\n\ntemplate <typename InputIterator>\nquery_result query(const InputIterator begin, const InputIterator end) const {\nreturn query_result(*this, begin, end);\n}\n\ntemplate <typename Z, ::std::enable_if_t<::std::is_integral_v<Z>, ::std::nullptr_t> = nullptr>\nquery_result query(const ::std::vector<Z>& X) const {\nreturn this->query(X.begin(), X.end());\n}\n};\n}\n\n\n#line 1 \"/workspaces/proconenv/lib/tools/rerooting_dp.hpp\"\n\n\n\n#line 11 \"/workspaces/proconenv/lib/tools/rerooting_dp.hpp\"\n\nnamespace tools {\ntemplate <typename R, typename M, typename F_VE, typename F_EV>\nclass rerooting_dp {\nprivate:\n::std::vector<::std::size_t> m_edges;\n::std::vector<::std::vector<::std::size_t>> m_graph;\nF_VE m_f_ve;\nF_EV m_f_ev;\n\nclass vertex {\nprivate:\nconst ::tools::rerooting_dp<R, M, F_VE, F_EV> *m_self;\n\npublic:\n::std::size_t id;\n::std::size_t neighbor_id_of_parent;\n::std::vector<::std::size_t> neighbor_ids_of_children;\ntypename M::T parent_dp;\n::std::vector<typename M::T> children_dp;\n::std::vector<typename M::T> children_dp_cumsum1;\n::std::vector<typename M::T> children_dp_cumsum2;\n\nvertex() = default;\nvertex(const vertex&) = default;\nvertex(vertex&&) = default;\n~vertex() = default;\nvertex& operator=(const vertex&) = default;\nvertex& operator=(vertex&&) = default;\n\nexplicit vertex(const ::tools::rerooting_dp<R, M, F_VE, F_EV> * const self, const ::std::size_t id) :\nm_self(self), id(id), parent_dp(M::e()) {\n}\n\n::std::size_t parent_edge_id() const {\nreturn this->m_self->m_graph[this->id][this->neighbor_id_of_parent];\n}\n::std::size_t parent_vertex_id() const {\nreturn this->m_self->m_edges[this->parent_edge_id()] ^ this->id;\n}\n::std::size_t child_size() const {\nreturn this->neighbor_ids_of_children.size();\n}\n::std::size_t child_edge_id(const ::std::size_t child_number) const {\nreturn this->m_self->m_graph[this->id][this->neighbor_ids_of_children[child_number]];\n}\n::std::size_t child_vertex_id(const ::std::size_t child_number) const {\nreturn this->m_self->m_edges[this->child_edge_id(child_number)] ^ this->id;\n}\nR dp_as_root() const {\nreturn this->m_self->m_f_ev(M::op(this->parent_dp, this->children_dp_cumsum1.back()), this->id);\n}\nR dp_excluding_parent() const {\nreturn this->m_self->m_f_ev(this->children_dp_cumsum1.back(), this->id);\n}\nR dp_excluding_child(const ::std::size_t excluded_child_number) const {\nreturn this->m_self->m_f_ev(M::op(this->parent_dp, M::op(this->children_dp_cumsum1[excluded_child_number], this->children_dp_cumsum2[excluded_child_number + 1])), this->id);\n}\n};\n\npublic:\nrerooting_dp() = default;\nrerooting_dp(const ::tools::rerooting_dp<R, M, F_VE, F_EV>&) = default;\nrerooting_dp(::tools::rerooting_dp<R, M, F_VE, F_EV>&&) = default;\n~rerooting_dp() = default;\n::tools::rerooting_dp<R, M, F_VE, F_EV>& operator=(const ::tools::rerooting_dp<R, M, F_VE, F_EV>&) = default;\n::tools::rerooting_dp<R, M, F_VE, F_EV>& operator=(::tools::rerooting_dp<R, M, F_VE, F_EV>&&) = default;\n\nrerooting_dp(const ::std::size_t n, const F_VE& f_ve, const F_EV& f_ev) : m_graph(n), m_f_ve(f_ve), m_f_ev(f_ev) {\nassert(n >= 1);\n}\n\n::std::size_t size() const {\nreturn this->m_graph.size();\n}\n\n::std::size_t add_edge(const ::std::size_t u, const ::std::size_t v) {\nthis->m_graph[u].push_back(this->m_edges.size());\nthis->m_graph[v].push_back(this->m_edges.size());\nthis->m_edges.push_back(u ^ v);\nreturn this->m_edges.size() - 1;\n}\n\n::std::vector<R> query() const {\nassert(this->m_edges.size() + 1 == this->size());\n\nconst int PRE_VERTEX = 1;\nconst int POST_EDGE = 2;\nconst int POST_VERTEX = 3;\nconst ::std::size_t INVALID = ::std::numeric_limits<::std::size_t>::max();\n\n::std::vector<vertex> vertices;\nfor (::std::size_t i = 0; i < this->size(); ++i) {\nvertices.emplace_back(this, i);\n}\n\n::std::stack<::std::tuple<int, ::std::size_t, ::std::size_t>> stack;\n::std::vector<bool> will_visit(this->size(), false);\nstack.emplace(PRE_VERTEX, 0, INVALID);\nwill_visit[0] = true;\nwhile (!stack.empty()) {\nconst int type = ::std::get<0>(stack.top());\nif (type == PRE_VERTEX) {\n\nconst ::std::size_t vertex_id = ::std::get<1>(stack.top());\nstack.pop();\n\nvertex& v = vertices[vertex_id];\nstack.emplace(POST_VERTEX, vertex_id, INVALID);\nfor (::std::size_t neighbor_id = 0; neighbor_id < this->m_graph[vertex_id].size(); ++neighbor_id) {\nconst ::std::size_t child_vertex_id = this->m_edges[this->m_graph[vertex_id][neighbor_id]] ^ vertex_id;\nif (will_visit[child_vertex_id]) {\nv.neighbor_id_of_parent = neighbor_id;\n} else {\nv.neighbor_ids_of_children.push_back(neighbor_id);\nstack.emplace(POST_EDGE, vertex_id, v.child_size() - 1);\nstack.emplace(PRE_VERTEX, child_vertex_id, INVALID);\nwill_visit[child_vertex_id] = true;\n}\n}\nv.children_dp.resize(v.child_size());\n\n} else if (type == POST_EDGE) {\n\nconst ::std::size_t vertex_id = ::std::get<1>(stack.top());\nconst ::std::size_t child_number = ::std::get<2>(stack.top());\nstack.pop();\n\nvertex& v = vertices[vertex_id];\nconst vertex& c = vertices[v.child_vertex_id(child_number)];\nv.children_dp[child_number] = this->m_f_ve(c.dp_excluding_parent(), v.child_edge_id(child_number));\n\n} else { // POST_VERTEX\n\nconst ::std::size_t vertex_id = ::std::get<1>(stack.top());\nstack.pop();\n\nvertex& v = vertices[vertex_id];\n\nv.children_dp_cumsum1.reserve(v.child_size() + 1);\nv.children_dp_cumsum1.push_back(M::e());\nfor (::std::size_t child_number = 0; child_number < v.child_size(); ++child_number) {\nv.children_dp_cumsum1.push_back(M::op(v.children_dp_cumsum1.back(), v.children_dp[child_number]));\n}\n\nv.children_dp_cumsum2.reserve(v.child_size() + 1);\nv.children_dp_cumsum2.push_back(M::e());\nfor (::std::size_t child_number = v.child_size(); child_number --> 0;) {\nv.children_dp_cumsum2.push_back(M::op(v.children_dp[child_number], v.children_dp_cumsum2.back()));\n}\n::std::reverse(v.children_dp_cumsum2.begin(), v.children_dp_cumsum2.end());\n\n}\n}\n\nstack.emplace(PRE_VERTEX, 0, INVALID);\nwhile (!stack.empty()) {\nconst ::std::size_t vertex_id = ::std::get<1>(stack.top());\nstack.pop();\n\nconst vertex& v = vertices[vertex_id];\nfor (::std::size_t child_number = 0; child_number < v.child_size(); ++child_number) {\nvertex& c = vertices[v.child_vertex_id(child_number)];\nc.parent_dp = this->m_f_ve(v.dp_excluding_child(child_number), c.parent_edge_id());\nstack.emplace(PRE_VERTEX, c.id, INVALID);\n}\n}\n\n::std::vector<R> result;\nresult.reserve(this->size());\nfor (const vertex& v : vertices) {\nresult.push_back(v.dp_as_root());\n}\nreturn result;\n}\n};\n}\n\n\n#line 1 \"/workspaces/proconenv/lib/tools/monoid.hpp\"\n\n\n\n#line 1 \"/workspaces/proconenv/lib/tools/gcd.hpp\"\n\n\n\n#line 6 \"/workspaces/proconenv/lib/tools/gcd.hpp\"\n\nnamespace tools {\ntemplate <typename M, typename N>\nconstexpr ::std::common_type_t<M, N> gcd(const M m, const N n) {\nreturn ::std::gcd(m, n);\n}\n}\n\n\n#line 9 \"/workspaces/proconenv/lib/tools/monoid.hpp\"\n\nnamespace tools {\nnamespace monoid {\ntemplate <typename M, M ...dummy>\nstruct max;\n\ntemplate <typename M>\nstruct max<M> {\nstatic_assert(::std::is_arithmetic_v<M>, \"M must be a built-in arithmetic type.\");\n\nusing T = M;\nstatic T op(const T lhs, const T rhs) {\nreturn ::std::max(lhs, rhs);\n}\nstatic T e() {\nif constexpr (::std::is_integral_v<M>) {\nreturn ::std::numeric_limits<M>::min();\n} else {\nreturn -::std::numeric_limits<M>::infinity();\n}\n}\n};\n\ntemplate <typename M, M E>\nstruct max<M, E> {\nstatic_assert(::std::is_integral_v<M>, \"M must be a built-in integral type.\");\n\nusing T = M;\nstatic T op(const T lhs, const T rhs) {\nassert(E <= lhs);\nassert(E <= rhs);\nreturn ::std::max(lhs, rhs);\n}\nstatic T e() {\nreturn E;\n}\n};\n\ntemplate <typename M, M ...dummy>\nstruct min;\n\ntemplate <typename M>\nstruct min<M> {\nstatic_assert(::std::is_arithmetic_v<M>, \"M must be a built-in arithmetic type.\");\n\nusing T = M;\nstatic T op(const T lhs, const T rhs) {\nreturn ::std::min(lhs, rhs);\n}\nstatic T e() {\nif constexpr (::std::is_integral_v<M>) {\nreturn ::std::numeric_limits<M>::max();\n} else {\nreturn ::std::numeric_limits<M>::infinity();\n}\n}\n};\n\ntemplate <typename M, M E>\nstruct min<M, E> {\nstatic_assert(::std::is_integral_v<M>, \"M must be a built-in integral type.\");\n\nusing T = M;\nstatic T op(const T lhs, const T rhs) {\nassert(lhs <= E);\nassert(rhs <= E);\nreturn ::std::min(lhs, rhs);\n}\nstatic T e() {\nreturn E;\n}\n};\n\ntemplate <typename M>\nstruct multiplies {\nprivate:\nusing VR = ::std::conditional_t<::std::is_arithmetic_v<M>, const M, const M&>;\n\npublic:\nusing T = M;\nstatic T op(VR lhs, VR rhs) {\nreturn lhs * rhs;\n}\nstatic T e() {\nreturn T(1);\n}\n};\n\ntemplate <>\nstruct multiplies<bool> {\nusing T = bool;\nstatic T op(const bool lhs, const bool rhs) {\nreturn lhs && rhs;\n}\nstatic T e() {\nreturn true;\n}\n};\n\ntemplate <typename M>\nstruct gcd {\nprivate:\nstatic_assert(!::std::is_arithmetic_v<M> || (::std::is_integral_v<M> && !::std::is_same_v<M, bool>), \"If M is a built-in arithmetic type, it must be integral except for bool.\");\nusing VR = ::std::conditional_t<::std::is_arithmetic_v<M>, const M, const M&>;\n\npublic:\nusing T = M;\nstatic T op(VR lhs, VR rhs) {\nreturn ::tools::gcd(lhs, rhs);\n}\nstatic T e() {\nreturn T(0);\n}\n};\n\ntemplate <typename M, M E>\nstruct update {\nstatic_assert(::std::is_integral_v<M>, \"M must be a built-in integral type.\");\n\nusing T = M;\nstatic T op(const T lhs, const T rhs) {\nreturn lhs == E ? rhs : lhs;\n}\nstatic T e() {\nreturn E;\n}\n};\n}\n}\n\n\n#line 9 \"main.cpp\"\n\nint main() {\nstd::cin.tie(nullptr);\nstd::ios_base::sync_with_stdio(false);\n\nint N;\nstd::cin >> N;\nstd::vector<int> c(N);\nfor (auto&& c_i : c) {\nstd::cin >> c_i;\n--c_i;\n}\ntools::auxiliary_tree tree(N);\nfor (int i = 0; i < N - 1; ++i) {\nint s, t;\nstd::cin >> s >> t;\n--s, --t;\ntree.add_edge(s, t);\n}\ntree.build(0);\n\nstd::vector<std::vector<int>> huts(N);\nfor (int v = 0; v < N; ++v) {\nhuts[c[v]].push_back(v);\n}\n\nstd::vector<int> answers(N);\nstd::vector<int> tree2aux(N);\nfor (int color = 0; color < N; ++color) {\nif (huts[color].empty()) continue;\n\nconst auto aux = tree.query(huts[color].begin(), huts[color].end());\nstd::vector<int> aux2tree(aux.size());\n{\nint aux_v = 0;\nfor (const auto tree_v : aux.vertices()) {\ntree2aux[tree_v] = aux_v;\naux2tree[aux_v] = tree_v;\n++aux_v;\n}\n}\n\nstd::vector<int> w;\nconst auto f_ve = [&](const auto& v, const auto e) {\nreturn (v.second ? 0 : v.first) + w[e];\n};\nconst auto f_ev = [&](const auto e, const auto v) {\nreturn std::make_pair(e, c[aux2tree[v]] == color);\n};\ntools::rerooting_dp<std::pair<int, bool>, tools::monoid::min<int>, decltype(f_ve), decltype(f_ev)> dp(aux.size(), f_ve, f_ev);\nfor (const auto tree_v : aux.vertices()) {\nif (tree_v == aux.root()) continue;\ndp.add_edge(tree2aux[tree_v], tree2aux[aux.parent(tree_v)]);\nconst auto lca = tree.lca(tree_v, aux.parent(tree_v));\nw.push_back(tree.depth(tree_v) + tree.depth(aux.parent(tree_v)) - 2 * tree.depth(lca));\n}\nconst auto partial_answers = dp.query();\n\nfor (int aux_v = 0; std::cmp_less(aux_v, aux.size()); ++aux_v) {\nif (partial_answers[aux_v].second) {\nanswers[aux2tree[aux_v]] = partial_answers[aux_v].first;\n}\n}\n}\n\nfor (const auto answer : answers) {\nstd::cout << answer << '\\n';\n}\nreturn 0;\n}", "accuracy": 1, "time_ms": 250, "memory_kb": 30172, "score_of_the_acc": -0.0606, "final_rank": 2 }, { "submission_id": "aoj_0439_9571593", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct virtualtree{\n\tlong long n;\n\tvector<vector<long long>> g,p;\n\tvector<long long> o,d;\n\tlong long cou = 0ll;\n\tvirtualtree(vector<vector<long long>> g) : g(g), n(g.size()) {\n\t\to.resize(n,-1ll);\n\t\tp.resize(n);\n\t\td.resize(n);\n\t\tfor(long long i = 0ll;i < n;i++){\n\t\t\tp[i].resize(20ll);\n\t\t}\n\t\td[0ll] = 0ll;\n\t\tp[0ll][0ll] = 0ll;\n\t\tdfs(0ll);\n\t\tfor(long long i = 1ll;i < 20ll;i++){\n\t\t\tfor(long long j = 0ll;j < n;j++){\n\t\t\t\tp[j][i] = p[p[j][i - 1ll]][i - 1ll];\n\t\t\t}\n\t\t}\n\t}\n\tvoid dfs(long long x){\n\t\to[x] = cou;\n\t\tcou++;\n\t\tfor(long long i : g[x]){\n\t\t\tif(o[i] != -1ll){\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tp[i][0ll] = x;\n\t\t\td[i] = d[x] + 1ll;\n\t\t\tdfs(i);\n\t\t}\n\t}\n\tlong long root(long long a,long long b){\n\t\tfor(long long i = 0ll;i < 20ll;i++){\n\t\t\tif(b & (1ll << i)){\n\t\t\t\ta = p[a][i];\n\t\t\t}\n\t\t}\n\t\treturn a;\n\t}\n\tlong long lca(long long u,long long v){\n\t\tif(d[u] > d[v]){\n\t\t\tu = root(u,d[u] - d[v]);\n\t\t}\n\t\tif(d[v] > d[u]){\n\t\t\tv = root(v,d[v] - d[u]);\n\t\t}\n\t\tlong long low = 0ll,high = n;\n\t\twhile(low < high){\n\t\t\tlong long mid = (low + high) / 2ll;\n\t\t\tif(root(u,mid) == root(v,mid)){\n\t\t\t\thigh = mid;\n\t\t\t}else{\n\t\t\t\tlow = mid + 1ll;\n\t\t\t}\n\t\t}\n\t\treturn root(u,low);\n\t}\n\tlong long dist(long long u,long long v){\n\t\tlong long lc = lca(u,v);\n\t\treturn d[u] + d[v] - d[lc] * 2ll;\n\t}\n\tvector<vector<pair<long long,long long>>> get(vector<long long> x){\n\t\tvector<vector<pair<long long,long long>>> res(x.size(),vector<pair<long long,long long>>());\n\t\tauto com = [&](long long a,long long b) -> bool {\n\t\t\treturn o[a] < o[b];\n\t\t};\n\t\tmap<long long,long long> t;\n\t\tset<long long> c;\n\t\tsort(x.begin(),x.end(),com);\n\t\tfor(long long i = 0ll;i < (long long)x.size();i++){\n\t\t\tc.insert(x[i]);\n\t\t\tt[x[i]] = i;\n\t\t}\n\t\tx.push_back(x[0ll]);\n\t\tstack<long long> s;\n\t\ts.push(x[0ll]);\n\t\tfor(long long i = 1ll;i < (long long)x.size();i++){\n\t\t\tlong long lc = lca(x[i - 1ll],x[i]);\n\t\t\tif(!c.count(lc)){\n\t\t\t\tt[lc] = (long long)c.size();\n\t\t\t\tc.insert(lc);\n\t\t\t\tres.push_back({});\n\t\t\t}\n\t\t\tlong long last = -1ll;\n\t\t\twhile(!s.empty() && d[s.top()] >= d[lc]){\n\t\t\t\tlong long it = s.top();\n\t\t\t\ts.pop();\n\t\t\t\tif(last != -1ll && last != it){\n\t\t\t\t\tres[t[it]].push_back({t[last],dist(it,last)});\n\t\t\t\t\tres[t[last]].push_back({t[it],dist(it,last)});\n\t\t\t\t}\n\t\t\t\tlast = it;\n\t\t\t}\n\t\t\tif(last != -1ll && last != lc){\n\t\t\t\tres[t[last]].push_back({t[lc],dist(last,lc)});\n\t\t\t\tres[t[lc]].push_back({t[last],dist(last,lc)});\n\t\t\t}\n\t\t\ts.push(lc);\n\t\t\ts.push(x[i]);\n\t\t}\n\t\treturn res;\n\t}\n};\nint main()\n{\n\tlong long n;\n\tcin >> n;\n\tvector<vector<long long>> g(n,vector<long long>());\n\tvector<vector<long long>> a(n,vector<long long>());\n\tfor(long long i = 0ll;i < n;i++){\n\t\tlong long x;\n\t\tcin >> x;\n\t\ta[x - 1ll].push_back(i);\n\t}\n\tfor(long long i = 0ll;i < n - 1ll;i++){\n\t\tlong long u,v;\n\t\tcin >> u >> v;\n\t\tu--;v--;\n\t\tg[u].push_back(v);\n\t\tg[v].push_back(u);\n\t}\n\tvirtualtree v(g);\n\tauto f = [](vector<vector<pair<long long,long long>>> g,long long X) -> vector<long long> {\n\t\tlong long n = g.size();\n\t\tvector<long long> p(n,-1ll);\n\t\t{\n\t\t\tqueue<long long> q;\n\t\t\tq.push(0ll);\n\t\t\tp[0ll] = 0ll;\n\t\t\twhile(!q.empty()){\n\t\t\t\tlong long it = q.front();\n\t\t\t\tq.pop();\n\t\t\t\tfor(pair<long long,long long> i : g[it]){\n\t\t\t\t\tif(p[i.first] != -1ll) continue;\n\t\t\t\t\tp[i.first] = it;\n\t\t\t\t\tq.push(i.first);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector<pair<pair<long long,long long>,pair<long long,long long>>> b(n,{{1000000000ll,-1ll},{1000000000ll,-1ll}});\n\t\t{\n\t\t\tauto cal = [&](auto cal,long long x) -> pair<pair<long long,long long>,pair<long long,long long>> {\n\t\t\t\tpair<pair<long long,long long>,pair<long long,long long>> res = {{1000000000ll,-1ll},{1000000000ll,-1ll}};\n\t\t\t\tfor(pair<long long,long long> i : g[x]){\n\t\t\t\t\tif(i.first == p[x]) continue;\n\t\t\t\t\tpair<pair<long long,long long>,pair<long long,long long>> it = cal(cal,i.first);\n\t\t\t\t\tif(it.first.first + i.second < res.first.first){\n\t\t\t\t\t\tres.second = res.first;\n\t\t\t\t\t\tres.first = it.first;\n\t\t\t\t\t\tres.first.first += i.second;\n\t\t\t\t\t\tres.first.second = i.first;\n\t\t\t\t\t}else if(it.first.first + i.second < res.second.first){\n\t\t\t\t\t\tres.second = it.first;\n\t\t\t\t\t\tres.second.first += i.second;\n\t\t\t\t\t\tres.second.second = i.first;\n\t\t\t\t\t}\n\t\t\t\t\tif(it.second.first + i.second < res.second.first){\n\t\t\t\t\t\tres.second = it.second;\n\t\t\t\t\t\tres.second.first += i.second;\n\t\t\t\t\t\tres.second.second = i.first;\n\t\t\t\t\t}\n\t\t\t\t\tif(i.first < X){\n\t\t\t\t\t\tif(i.second < res.first.first){\n\t\t\t\t\t\t\tres.second = res.first;\n\t\t\t\t\t\t\tres.first = {i.second,i.first};\n\t\t\t\t\t\t}else if(i.second < res.second.first){\n\t\t\t\t\t\t\tres.second = {i.second,i.first};\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tb[x] = res;\n\t\t\t\treturn res;\n\t\t\t};\n\t\t\tcal(cal,0ll);\n\t\t}\n\t\tvector<long long> a(n,1000000000ll);\n\t\t{\n\t\t\tqueue<long long> q;\n\t\t\tfor(pair<long long,long long> i : g[0ll]){\n\t\t\t\tq.push(i.first);\n\t\t\t}\n\t\t\twhile(!q.empty()){\n\t\t\t\tlong long it = q.front();\n\t\t\t\tq.pop();\n\t\t\t\tfor(pair<long long,long long> i : g[it]){\n\t\t\t\t\tif(i.first == p[it]){\n\t\t\t\t\t\ta[it] = a[p[it]] + i.second;\n\t\t\t\t\t\tif(b[p[it]].first.second == it){\n\t\t\t\t\t\t\ta[it] = min(a[it],b[p[it]].second.first + i.second);\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\ta[it] = min(a[it],b[p[it]].first.first + i.second);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(i.first < X){\n\t\t\t\t\t\t\ta[it] = min(a[it],i.second);\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\tq.push(i.first);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tvector<long long> ans(X);\n\t\tfor(long long i = 0ll;i < X;i++){\n\t\t\tans[i] = min(a[i],b[i].first.first);\n\t\t}\n\t\treturn ans;\n\t};\n\tvector<long long> ans(n);\n\tfor(long long i = 0ll;i < n;i++){\n\t\tif(a[i].empty()) continue;\n\t\tvector<long long> it = f(v.get(a[i]),a[i].size());\n\t\tauto com = [&](long long a,long long b) -> bool {\n\t\t\treturn v.o[a] < v.o[b];\n\t\t};\n\t\tsort(a[i].begin(),a[i].end(),com);\n\t\tfor(long long j = 0ll;j < (long long)it.size();j++){\n\t\t\tans[a[i][j]] = it[j];\n\t\t}\n\t}\n\tfor(long long i = 0ll;i < n;i++){\n\t\tcout << ans[i] << endl;\n\t}\n}", "accuracy": 1, "time_ms": 1800, "memory_kb": 90324, "score_of_the_acc": -1.6474, "final_rank": 20 }, { "submission_id": "aoj_0439_9441553", "code_snippet": "#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing ve = vector<vector<int>>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\n#define rep(i,n) for(ll i = 0;i < (ll)n;i++)\n#define ALL(x) (x).begin(),(x).end()\n#define sz(c) ((ll)(c).size())\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\n// #define MOD 1000000007\n#define MOD 998244353\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\" \":\"\");return os;}\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<\" \"<<p.second;return os;}\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\n\n\nclass LCA{\n public:\n int n,root;\n const int beki = 30;\n vector<vector<int>> v;\n vector<vector<int>> nxt;\n vector<int> d;\n LCA(int n,int root = 0) : n(n),root(root),v(n),nxt(n,vector<int>(beki,root)),d(n,-1) {}\n LCA(const vector<vector<int>> &v,int root) : n(v.size()),root(root),v(v),nxt(v.size(),vector<int>(beki,root)),d(n,-1) {}\n void add_edge(int x,int y){\n v[x].push_back(y);\n v[y].push_back(x);\n }\n void bfs(){\n queue<int> que;\n d[root] = 0;\n que.push(root);\n while(!que.empty()){\n int ov = que.front();que.pop();\n for(auto nv : v[ov]){\n if(d[nv] != -1)continue;\n nxt[nv][0] = ov;\n d[nv] = d[ov]+1;\n que.push(nv);\n }\n }\n }\n void build(){\n bfs();\n for(int i = 1;i < 30;i++)for(int j = 0;j < n;j++)nxt[j][i] = nxt[nxt[j][i-1]][i-1];\n }\n int get_lca(int x,int y){\n if(d[x] < d[y])swap(x,y);\n for(int i = 29;i >= 0;i--)if(((d[x]-d[y]) >> i) & 1)x = nxt[x][i];\n if(x == y)return x;\n for(int i = 29;i >= 0;i--)if(nxt[x][i] != nxt[y][i])x = nxt[x][i],y = nxt[y][i];\n return nxt[x][0];\n }\n int dist(int x,int y){\n return d[x]+d[y]-2*d[get_lca(x,y)];\n }\n};\n\n// https://beet-aizu.github.io/library/tree/auxiliarytree.cpp.html\nstruct AuxiliaryTree : LCA{\n vector<int> idx;\n vector<vector<int>> T;\n AuxiliaryTree(int n,int root = 0):LCA(n,root),idx(n),T(n){}\n\n void dfs(int ov,int pre,int &pos){\n idx[ov] = pos++;\n for(auto nv : v[ov]){\n if(nv != pre)dfs(nv,ov,pos);\n }\n }\n void build(int root = 0){\n LCA::build();\n int pos = 0;\n dfs(root,-1,pos);\n }\n void add_aux_edge(int a,int b){\n T[a].emplace_back(b);\n T[b].emplace_back(a);\n }\n // O(sz(vs)log(sz(vs)))\n void query(vector<int> &vs){\n assert(!vs.empty());\n sort(vs.begin(),vs.end(),[&](int a,int b){return idx[a] < idx[b];});\n vs.erase(unique(vs.begin(),vs.end()),vs.end());\n stack<int> st;\n st.emplace(vs[0]);\n int k = vs.size();\n for(int i = 1;i < k;i++){\n int w = get_lca(vs[i-1],vs[i]);\n if(w != vs[i-1]){\n int l = st.top();st.pop();\n while(!st.empty() && d[w] < d[st.top()]){\n add_aux_edge(st.top(),l);\n l = st.top();st.pop();\n }\n if(st.empty() || st.top() != w){\n st.emplace(w);\n vs.emplace_back(w);\n }\n add_aux_edge(w,l);\n }\n st.emplace(vs[i]);\n }\n while(st.size() > 1){\n int c = st.top();st.pop();\n add_aux_edge(st.top(),c);\n }\n }\n void clear(const vector<int> &ws){\n for(auto ov : ws)T[ov].clear();\n }\n};\n\n\nint main(){\n \n ios_base::sync_with_stdio(0), cin.tie(0);\n int n;\n cin >> n;\n vi c(n);cin >> c;\n AuxiliaryTree at(n);\n rep(i,n-1){\n int a,b;cin >> a >> b;\n a--;b--;\n at.add_edge(a,b);\n }\n at.build();\n ve C(n);\n vi res(n,1ll << 50);\n rep(i,n)C[c[i]-1].emplace_back(i);\n vi ds(n),idx(n);\n auto dijk = [&](auto &vs,auto &ss){\n min_priority_queue<P> que;\n for(auto au : vs)ds[au] = 1ll << 50,idx[au] = -1;\n for(auto au : ss)ds[au] = 0,idx[au] = au,que.emplace(ds[au],au);\n while(!que.empty()){\n auto [od,ov] = que.top();que.pop();\n if(ds[ov] < od)continue;\n for(auto nv : at.T[ov]){\n int cst = abs(at.d[nv]-at.d[ov]);\n if(ds[nv] <= ds[ov] + cst)continue;\n ds[nv] = ds[ov] + cst;\n idx[nv] = idx[ov];\n que.emplace(ds[nv],nv);\n }\n }\n };\n rep(i,n){\n if(C[i].empty())continue;\n auto vs = C[i];\n at.query(vs);\n dijk(vs,C[i]);\n for(auto ov : vs){\n for(auto nv : at.T[ov]){\n if(idx[nv] == idx[ov])continue;\n chmin<ll>(res[idx[ov]],at.dist(idx[ov],idx[nv]));\n chmin<ll>(res[idx[nv]],at.dist(idx[ov],idx[nv]));\n }\n }\n at.clear(vs);\n }\n rep(i,n)cout << res[i] << \"\\n\";\n\n\n \n\n return 0;\n}", "accuracy": 1, "time_ms": 460, "memory_kb": 74132, "score_of_the_acc": -0.661, "final_rank": 11 }, { "submission_id": "aoj_0439_9441544", "code_snippet": "#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing ve = vector<vector<int>>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\n#define rep(i,n) for(ll i = 0;i < (ll)n;i++)\n#define ALL(x) (x).begin(),(x).end()\n#define sz(c) ((ll)(c).size())\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\n// #define MOD 1000000007\n#define MOD 998244353\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\" \":\"\");return os;}\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.first<<\" \"<<p.second;return os;}\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\n\n\nclass LCA{\n public:\n int n,root;\n const int beki = 30;\n vector<vector<int>> v;\n vector<vector<int>> nxt;\n vector<int> d;\n LCA(int n,int root = 0) : n(n),root(root),v(n),nxt(n,vector<int>(beki,root)),d(n,-1) {}\n LCA(const vector<vector<int>> &v,int root) : n(v.size()),root(root),v(v),nxt(v.size(),vector<int>(beki,root)),d(n,-1) {}\n void add_edge(int x,int y){\n v[x].push_back(y);\n v[y].push_back(x);\n }\n void bfs(){\n queue<int> que;\n d[root] = 0;\n que.push(root);\n while(!que.empty()){\n int ov = que.front();que.pop();\n for(auto nv : v[ov]){\n if(d[nv] != -1)continue;\n nxt[nv][0] = ov;\n d[nv] = d[ov]+1;\n que.push(nv);\n }\n }\n }\n void build(){\n bfs();\n for(int i = 1;i < 30;i++)for(int j = 0;j < n;j++)nxt[j][i] = nxt[nxt[j][i-1]][i-1];\n }\n int get_lca(int x,int y){\n if(d[x] < d[y])swap(x,y);\n for(int i = 29;i >= 0;i--)if(((d[x]-d[y]) >> i) & 1)x = nxt[x][i];\n if(x == y)return x;\n for(int i = 29;i >= 0;i--)if(nxt[x][i] != nxt[y][i])x = nxt[x][i],y = nxt[y][i];\n return nxt[x][0];\n }\n};\n\n// https://beet-aizu.github.io/library/tree/auxiliarytree.cpp.html\nstruct AuxiliaryTree : LCA{\n vector<int> idx;\n vector<vector<int>> T;\n AuxiliaryTree(int n,int root = 0):LCA(n,root),idx(n),T(n){}\n\n void dfs(int ov,int pre,int &pos){\n idx[ov] = pos++;\n for(auto nv : v[ov]){\n if(nv != pre)dfs(nv,ov,pos);\n }\n }\n void build(int root = 0){\n LCA::build();\n int pos = 0;\n dfs(root,-1,pos);\n }\n void add_aux_edge(int a,int b){\n T[a].emplace_back(b);\n T[b].emplace_back(a);\n }\n // O(sz(vs)log(sz(vs)))\n void query(vector<int> &vs){\n assert(!vs.empty());\n sort(vs.begin(),vs.end(),[&](int a,int b){return idx[a] < idx[b];});\n vs.erase(unique(vs.begin(),vs.end()),vs.end());\n stack<int> st;\n st.emplace(vs[0]);\n int k = vs.size();\n for(int i = 1;i < k;i++){\n int w = get_lca(vs[i-1],vs[i]);\n if(w != vs[i-1]){\n int l = st.top();st.pop();\n while(!st.empty() && d[w] < d[st.top()]){\n add_aux_edge(st.top(),l);\n l = st.top();st.pop();\n }\n if(st.empty() || st.top() != w){\n st.emplace(w);\n vs.emplace_back(w);\n }\n add_aux_edge(w,l);\n }\n st.emplace(vs[i]);\n }\n while(st.size() > 1){\n int c = st.top();st.pop();\n add_aux_edge(st.top(),c);\n }\n }\n void clear(const vector<int> &ws){\n for(auto ov : ws)T[ov].clear();\n }\n};\n\n\nint main(){\n \n ios_base::sync_with_stdio(0), cin.tie(0);\n int n;\n cin >> n;\n vi c(n);cin >> c;\n AuxiliaryTree at(n);\n rep(i,n-1){\n int a,b;cin >> a >> b;\n a--;b--;\n at.add_edge(a,b);\n }\n at.build();\n ve C(n);\n vi res(n,1ll << 50);\n rep(i,n)C[c[i]-1].emplace_back(i);\n vi ds(n),idx(n);\n auto dijk = [&](auto &vs,auto &ss){\n min_priority_queue<P> que;\n for(auto au : vs)ds[au] = 1ll << 50,idx[au] = -1;\n for(auto au : ss)ds[au] = 0,idx[au] = au,que.emplace(ds[au],au);\n while(!que.empty()){\n auto [od,ov] = que.top();que.pop();\n if(ds[ov] < od)continue;\n for(auto nv : at.T[ov]){\n int cst = abs(at.d[nv]-at.d[ov]);\n if(ds[nv] <= ds[ov] + cst)continue;\n ds[nv] = ds[ov] + cst;\n idx[nv] = idx[ov];\n que.emplace(ds[nv],nv);\n }\n }\n };\n rep(i,n){\n if(C[i].empty())continue;\n auto vs = C[i];\n at.query(vs);\n dijk(vs,C[i]);\n for(auto ov : vs){\n for(auto nv : at.T[ov]){\n if(idx[nv] == idx[ov])continue;\n chmin<ll>(res[idx[ov]],at.d[idx[nv]]+at.d[idx[ov]]-2*at.d[at.get_lca(idx[ov],idx[nv])]);\n chmin<ll>(res[idx[nv]],at.d[idx[nv]]+at.d[idx[ov]]-2*at.d[at.get_lca(idx[ov],idx[nv])]);\n }\n }\n at.clear(vs);\n }\n rep(i,n)cout << res[i] << \"\\n\";\n\n\n \n\n return 0;\n}", "accuracy": 1, "time_ms": 460, "memory_kb": 74188, "score_of_the_acc": -0.6616, "final_rank": 12 }, { "submission_id": "aoj_0439_9368185", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define all(v) v.begin(), v.end()\ntemplate <class T, class U>\ninline bool chmax(T &a, U b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T, class U>\ninline bool chmin(T &a, U b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\nconstexpr int INF = 1000000000;\nconstexpr int64_t llINF = 3000000000000000000;\nconst double pi = acos(-1);\nstruct linear_sieve {\n vector<int> least_factor, prime_list;\n linear_sieve(int n) : least_factor(n + 1, 0) {\n for (int i = 2; i <= n; i++) {\n if (least_factor[i] == 0) {\n least_factor[i] = i;\n prime_list.push_back(i);\n }\n for (int p : prime_list) {\n if (ll(i) * p > n || p > least_factor[i]) break;\n least_factor[i * p] = p;\n }\n }\n }\n};\nll extgcd(ll a, ll b, ll &x, ll &y) {\n if (b == 0) {\n x = 1;\n y = 0;\n return a;\n }\n ll d = extgcd(b, a % b, y, x);\n y -= a / b * x;\n return d;\n}\nll modpow(ll a, ll b, ll m) {\n ll res = 1;\n while (b) {\n if (b & 1) {\n res *= a;\n res %= m;\n }\n a *= a;\n a %= m;\n b >>= 1;\n }\n return res;\n}\ntemplate <int modulo>\nstruct modint {\n int x;\n modint() : x(0) {}\n modint(int64_t y) : x(y >= 0 ? y % modulo : (modulo - (-y) % modulo) % modulo) {}\n modint &operator+=(const modint &p) {\n if ((x += p.x) >= modulo) x -= modulo;\n return *this;\n }\n modint &operator-=(const modint &p) {\n if ((x += modulo - p.x) >= modulo) x -= modulo;\n return *this;\n }\n modint &operator*=(const modint &p) {\n x = (int)(1LL * x * p.x % modulo);\n return *this;\n }\n modint &operator/=(const modint &p) {\n *this *= p.inv();\n return *this;\n }\n modint operator-() const { return modint(-x); }\n modint operator+(const modint &p) const { return modint(*this) += p; }\n modint operator-(const modint &p) const { return modint(*this) -= p; }\n modint operator*(const modint &p) const { return modint(*this) *= p; }\n modint operator/(const modint &p) const { return modint(*this) /= p; }\n bool operator==(const modint &p) const { return x == p.x; }\n bool operator!=(const modint &p) const { return x != p.x; }\n modint inv() const {\n int a = x, b = modulo, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return modint(u);\n }\n modint pow(int64_t n) const {\n modint ret(1), mul(x);\n while (n > 0) {\n if (n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n friend ostream &operator<<(ostream &os, const modint &p) { return os << p.x; }\n friend istream &operator>>(istream &is, modint &a) {\n int64_t t;\n is >> t;\n a = modint<modulo>(t);\n return (is);\n }\n int val() const { return x; }\n static constexpr int mod() { return modulo; }\n static constexpr int half() { return (modulo + 1) >> 1; }\n};\ntemplate <typename T>\nstruct Binomial {\n vector<T> inv, fact, factinv;\n Binomial(int n) {\n inv.resize(n + 1);\n fact.resize(n + 1);\n factinv.resize(n + 1);\n inv[0] = fact[0] = factinv[0] = 1;\n for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * i;\n factinv[n] = fact[n].inv();\n inv[n] = fact[n - 1] * factinv[n];\n for (int i = n - 1; i >= 1; i--) {\n factinv[i] = factinv[i + 1] * (i + 1);\n inv[i] = fact[i - 1] * factinv[i];\n }\n }\n T C(int n, int r) {\n if (n < 0 || n < r || r < 0) return 0;\n return fact[n] * factinv[n - r] * factinv[r];\n }\n T P(int n, int r) {\n if (n < 0 || n < r || r < 0) return 0;\n return fact[n] * factinv[n - r];\n }\n T H(int n, int r) {\n if (n == 0 && r == 0) return 1;\n if (n < 0 || r < 0) return 0;\n return r == 0 ? 1 : C(n + r - 1, r);\n }\n};\ntemplate <class T>\nstruct Matrix {\n int n;\n vector<vector<T>> m;\n Matrix() : Matrix(0) {}\n Matrix(int x) : Matrix(vector<vector<T>>(x, vector<T>(x, 0))) {}\n Matrix(const vector<vector<T>> &a) {\n n = a.size();\n m = a;\n }\n vector<T> &operator[](int i) { return m[i]; }\n const vector<T> &operator[](int i) const { return m[i]; }\n static Matrix identity(int x) {\n Matrix res(x);\n for (int i = 0; i < x; i++) res[i][i] = 1;\n return res;\n }\n Matrix operator+(const Matrix &a) const {\n Matrix x = (*this);\n return x += a;\n }\n Matrix operator*(const Matrix &a) const {\n Matrix x = (*this);\n return x *= a;\n }\n Matrix &operator+=(const Matrix &a) {\n Matrix res(n);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n res[i][j] = m[i][j] + a[i][j];\n }\n }\n m = res.m;\n return *this;\n }\n Matrix &operator*=(const Matrix &a) {\n Matrix res(n);\n for (int i = 0; i < n; i++) {\n for (int k = 0; k < n; k++) {\n for (int j = 0; j < n; j++) {\n res[i][j] += m[i][k] * a[k][j];\n }\n }\n }\n m = res.m;\n return *this;\n }\n Matrix pow(ll b) const {\n Matrix x = *this, res = identity(n);\n while (b) {\n if (b & 1) {\n res *= x;\n }\n x *= x;\n b >>= 1;\n }\n return res;\n }\n};\ntemplate <class S, S (*op)(S, S), S (*e)()>\nstruct segtree {\n int siz = 1;\n vector<S> dat;\n segtree(int n) : segtree(vector<S>(n, e())) {}\n segtree(const vector<S> &a) {\n while (siz < a.size()) siz <<= 1;\n dat = vector<S>(siz << 1, e());\n for (int i = 0; i < a.size(); i++) dat[siz + i] = a[i];\n for (int i = siz - 1; i >= 1; i--) dat[i] = op(dat[2 * i], dat[2 * i + 1]);\n }\n void set(int p, S x) {\n p += siz;\n dat[p] = x;\n while (p > 0) {\n p >>= 1;\n dat[p] = op(dat[2 * p], dat[2 * p + 1]);\n }\n }\n void add(int p, S x) { set(p, get(p) + x); }\n S get(int p) { return dat[p + siz]; }\n S prod(int l, int r) {\n S vl = e(), vr = e();\n l += siz, r += siz;\n while (l < r) {\n if (l & 1) vl = op(vl, dat[l++]);\n if (r & 1) vr = op(dat[--r], vr);\n l >>= 1, r >>= 1;\n }\n return op(vl, vr);\n }\n S all_prod() { return dat[1]; }\n};\n\ntemplate <class T>\nstruct BIT {\n // 1-indexed\n int n, beki = 1;\n vector<T> bit;\n BIT(int x) {\n bit.resize(x + 1, 0);\n n = x;\n while (beki * 2 <= n) beki *= 2;\n }\n T sum(int i) {\n T res = 0;\n while (i > 0) {\n res += bit[i];\n i -= i & -i;\n }\n return res;\n }\n T sum(int l, int r) {\n //[l,r]\n return sum(r) - (l == 0 ? 0 : sum(l - 1));\n }\n void add(int i, T x) {\n while (i <= n) {\n bit[i] += x;\n i += i & -i;\n }\n }\n int lowerbound(T w) {\n if (w <= 0) return 0;\n int x = 0;\n for (int k = beki; k > 0; k >>= 1) {\n if (x + k <= n && bit[x + k] < w) {\n w -= bit[x + k];\n x += k;\n }\n }\n return x + 1;\n }\n};\ntemplate <class T, T (*op)(T, T), T (*e)()>\nstruct sparsetable {\n vector<vector<T>> table;\n vector<int> logtable;\n sparsetable() = default;\n sparsetable(vector<T> v) {\n int len = 0;\n while ((1 << len) <= v.size()) len++;\n table.assign(len, vector<T>(1 << len));\n for (int i = 0; i < (int)v.size(); i++) table[0][i] = v[i];\n for (int i = 1; i < len; i++) {\n for (int j = 0; j + (1 << i) <= (1 << len); j++) {\n table[i][j] = op(table[i - 1][j], table[i - 1][j + (1 << (i - 1))]);\n }\n }\n logtable.resize(v.size() + 1);\n for (int i = 2; i < logtable.size(); i++) {\n logtable[i] = logtable[(i >> 1)] + 1;\n }\n }\n T query(int l, int r) {\n assert(l <= r);\n if (l == r) return e();\n int len = logtable[r - l];\n return op(table[len][l], table[len][r - (1 << len)]);\n }\n};\ntemplate <class T, T (*op)(T, T), T (*e)()>\nstruct disjointsparsetable {\n vector<vector<T>> table;\n vector<int> logtable;\n disjointsparsetable() = default;\n disjointsparsetable(vector<T> v) {\n int len = 0;\n while ((1 << len) <= v.size()) len++;\n table.assign(len, vector<T>(1 << len, e()));\n for (int i = 0; i < (int)v.size(); i++) table[0][i] = v[i];\n for (int i = 1; i < len; i++) {\n int shift = 1 << i;\n for (int j = 0; j < (int)v.size(); j += shift << 1) {\n int t = min(j + shift, (int)v.size());\n table[i][t - 1] = v[t - 1];\n for (int k = t - 2; k >= j; k--) table[i][k] = op(v[k], table[i][k + 1]);\n if (v.size() <= t) break;\n table[i][t] = v[t];\n int r = min(t + shift, (int)v.size());\n for (int k = t + 1; k < r; k++) table[i][k] = op(table[i][k - 1], v[k]);\n }\n }\n logtable.resize(1 << len);\n for (int i = 2; i < logtable.size(); i++) {\n logtable[i] = logtable[(i >> 1)] + 1;\n }\n }\n T query(int l, int r) {\n if (l == r) return e();\n if (l >= --r) return table[0][l];\n int len = logtable[l ^ r];\n return op(table[len][l], table[len][r]);\n };\n};\npair<int, int> lcatree_op(pair<int, int> a, pair<int, int> b) { return min(a, b); }\npair<int, int> lcatree_e() { return {1000000000, -1}; }\nstruct lca_tree {\n int n, size;\n vector<int> in, ord, depth;\n sparsetable<pair<int, int>, lcatree_op, lcatree_e> st;\n lca_tree(vector<vector<int>> g, int root = 0) : n((int)g.size()), size(log2(n) + 2), in(n), depth(n, n) {\n depth[root] = 0;\n function<void(int, int)> dfs = [&](int v, int p) {\n in[v] = (int)ord.size();\n ord.push_back(v);\n for (int u : g[v]) {\n if (u == p) continue;\n if (depth[u] > depth[v] + 1) {\n depth[u] = depth[v] + 1;\n dfs(u, v);\n ord.push_back(v);\n }\n }\n };\n dfs(root, -1);\n vector<pair<int, int>> vec((int)ord.size());\n for (int i = 0; i < (int)ord.size(); i++) {\n vec[i] = make_pair(depth[ord[i]], ord[i]);\n }\n st = vec;\n }\n int lca(int u, int v) {\n if (in[u] > in[v]) swap(u, v);\n if (u == v) return u;\n return st.query(in[u], in[v]).second;\n }\n int dist(int u, int v) {\n int l = lca(u, v);\n return depth[u] + depth[v] - 2 * depth[l];\n }\n};\n\nstruct UnionFind {\n vector<int> par, siz, es;\n UnionFind(int x) {\n par.resize(x);\n siz.resize(x);\n es.resize(x);\n for (int i = 0; i < x; i++) {\n par[i] = i;\n siz[i] = 1;\n es[i] = 0;\n }\n }\n int find(int x) {\n if (par[x] == x) return x;\n return par[x] = find(par[x]);\n }\n bool unite(int x, int y) {\n x = find(x), y = find(y);\n if (x == y) {\n es[x]++;\n return false;\n }\n if (siz[x] < siz[y]) swap(x, y);\n par[y] = x;\n siz[x] += siz[y];\n es[x] += es[y] + 1;\n return true;\n }\n bool same(int x, int y) { return find(x) == find(y); }\n int size(int x) { return siz[find(x)]; }\n int edges(int x) { return es[find(x)]; }\n};\nstruct Mo {\n int n;\n vector<pair<int, int>> lr;\n\n explicit Mo(int n) : n(n) {}\n\n void add(int l, int r) { /* [l, r) */ lr.emplace_back(l, r); }\n\n template <typename AL, typename AR, typename EL, typename ER, typename O>\n void build(const AL &add_left, const AR &add_right, const EL &erase_left, const ER &erase_right, const O &out) {\n int q = (int)lr.size();\n int bs = n / min<int>(n, sqrt(q));\n vector<int> ord(q);\n iota(begin(ord), end(ord), 0);\n sort(begin(ord), end(ord), [&](int a, int b) {\n int ablock = lr[a].first / bs, bblock = lr[b].first / bs;\n if (ablock != bblock) return ablock < bblock;\n return (ablock & 1) ? lr[a].second > lr[b].second : lr[a].second < lr[b].second;\n });\n int l = 0, r = 0;\n for (auto idx : ord) {\n while (l > lr[idx].first) add_left(--l);\n while (r < lr[idx].second) add_right(r++);\n while (l < lr[idx].first) erase_left(l++);\n while (r > lr[idx].second) erase_right(--r);\n out(idx);\n }\n }\n\n template <typename A, typename E, typename O>\n void build(const A &add, const E &erase, const O &out) {\n build(add, add, erase, erase, out);\n }\n};\ntemplate <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S), F (*composition)(F, F), F (*id)()>\nstruct lazy_segtree {\n int _n, sz = 1;\n vector<S> dat;\n vector<F> lazy;\n lazy_segtree(vector<S> a) : _n(int(a.size())) {\n while (sz < _n) sz <<= 1;\n dat.resize(sz * 2, e());\n lazy.resize(sz * 2, id());\n rep(i, _n) dat[sz + i] = a[i];\n for (int i = sz - 1; i >= 1; i--) dat[i] = op(dat[2 * i], dat[2 * i + 1]);\n }\n void eval(int k) {\n dat[k] = mapping(lazy[k], dat[k]);\n if (k < sz) {\n lazy[k * 2] = composition(lazy[k], lazy[k * 2]);\n lazy[k * 2 + 1] = composition(lazy[k], lazy[k * 2 + 1]);\n }\n lazy[k] = id();\n }\n void apply(int a, int b, F f, int k = 1, int l = 0, int r = -1) {\n eval(k);\n if (r == -1) r = sz;\n if (r <= a || b <= l) return;\n if (a <= l && r <= b) {\n lazy[k] = composition(f, lazy[k]);\n eval(k);\n return;\n }\n int m = (l + r) >> 1;\n apply(a, b, f, 2 * k, l, m);\n apply(a, b, f, 2 * k + 1, m, r);\n dat[k] = op(dat[2 * k], dat[2 * k + 1]);\n }\n S prod(int a, int b, int k = 1, int l = 0, int r = -1) {\n eval(k);\n if (r == -1) r = sz;\n if (r <= a || b <= l) return e();\n if (a <= l && r <= b) return dat[k];\n int m = (l + r) >> 1;\n S vl = prod(a, b, 2 * k, l, m);\n S vr = prod(a, b, 2 * k + 1, m, r);\n return op(vl, vr);\n }\n};\n\ntemplate <class S, S (*op)(S, S), S (*e)()>\nstruct dual_segtree {\n int sz = 1, log = 0;\n vector<S> lz;\n dual_segtree(vector<S> a) {\n int n = a.size();\n while (sz < n) {\n sz <<= 1;\n log++;\n }\n lz.assign(sz << 1, e());\n for (int i = 0; i < n; i++) lz[i + sz] = a[i];\n }\n void push(int k) {\n int b = __builtin_ctz(k);\n for (int d = log; d > b; d--) {\n lz[k >> d << 1] = op(lz[k >> d << 1], lz[k >> d]);\n lz[k >> d << 1 | 1] = op(lz[k >> d << 1 | 1], lz[k >> d]);\n lz[k >> d] = e();\n }\n }\n void apply(int l, int r, S x) {\n l += sz, r += sz;\n push(l);\n push(r);\n while (l < r) {\n if (l & 1) {\n lz[l] = op(lz[l], x);\n l++;\n }\n if (r & 1) {\n r--;\n lz[r] = op(lz[r], x);\n }\n l >>= 1, r >>= 1;\n }\n }\n S get(int k) {\n k += sz;\n S res = e();\n while (k) {\n res = op(res, lz[k]);\n k >>= 1;\n }\n return res;\n }\n};\nll modinv(int x, int modulo) {\n int a = x, b = modulo, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return (u >= 0 ? u % modulo : (modulo - (-u) % modulo) % modulo);\n}\nstruct auxiliary_tree : lca_tree {\n vector<vector<int>> G;\n auxiliary_tree(vector<vector<int>> &g) : lca_tree(g), G(n) {}\n pair<int, vector<int>> query(vector<int> vs, bool decending = false) {\n // decending:親から子の方向のみ辺を貼る\n assert(!vs.empty());\n sort(vs.begin(), vs.end(), [&](int a, int b) { return in[a] < in[b]; });\n int m = vs.size();\n stack<int> st;\n st.push(vs[0]);\n for (int i = 0; i < m - 1; i++) {\n int w = lca(vs[i], vs[i + 1]);\n if (w != vs[i]) {\n int l = st.top();\n st.pop();\n while (!st.empty() && depth[w] < depth[st.top()]) {\n if (!decending) G[l].push_back(st.top());\n G[st.top()].push_back(l);\n l = st.top();\n st.pop();\n }\n if (st.empty() || st.top() != w) {\n st.push(w);\n vs.push_back(w);\n }\n if (!decending) G[l].push_back(w);\n G[w].push_back(l);\n }\n st.push(vs[i + 1]);\n }\n while (st.size() > 1) {\n int x = st.top();\n st.pop();\n if (!decending) G[x].push_back(st.top());\n G[st.top()].push_back(x);\n }\n // {root,vertex_list}\n return make_pair(st.top(), vs);\n }\n void clear(vector<int> vs) {\n for (int v : vs) G[v].clear();\n }\n};\nvoid solve() {\n int n;\n cin >> n;\n vector<int> a(n);\n rep(i, n) {\n cin >> a[i];\n a[i]--;\n }\n vector<vector<int>> g(n);\n rep(i, n - 1) {\n int u, v;\n cin >> u >> v;\n u--, v--;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n auxiliary_tree aux_tree(g);\n vector<vector<int>> vec(n);\n rep(i, n) vec[a[i]].push_back(i);\n vector<int> dist(n), idx(n);\n vector<int> ans(n, 1000000000);\n rep(color, n) {\n if (vec[color].empty()) continue;\n auto [root, vs] = aux_tree.query(vec[color]);\n using P = pair<int, int>;\n priority_queue<P, vector<P>, greater<P>> que;\n for (auto v : vs) dist[v] = n, idx[v] = -1;\n for (int s : vec[color]) dist[s] = 0, idx[s] = s, que.push({dist[s], s});\n while (!que.empty()) {\n auto [d, v] = que.top();\n que.pop();\n if (dist[v] != d) continue;\n for (auto u : aux_tree.G[v]) {\n int c = abs(aux_tree.depth[u] - aux_tree.depth[v]);\n if (chmin(dist[u], d + c)) {\n idx[u] = idx[v];\n que.push({dist[u], u});\n }\n }\n }\n for (int v : vs) {\n for (int u : aux_tree.G[v]) {\n if (idx[v] == idx[u]) continue;\n chmin(ans[idx[v]], aux_tree.dist(idx[v], idx[u]));\n chmin(ans[idx[u]], aux_tree.dist(idx[v], idx[u]));\n }\n }\n aux_tree.clear(vs);\n }\n rep(i, n) cout << ans[i] << \"\\n\";\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n /*int t;\n cin >> t;\n while (t--) */\n solve();\n}", "accuracy": 1, "time_ms": 220, "memory_kb": 123088, "score_of_the_acc": -1.0424, "final_rank": 19 }, { "submission_id": "aoj_0439_9269996", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)\n#define rrep(i, s, t) for(ll i = (ll)(t) - 1; i >= (ll)(s); i--)\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n\n#define TT template<typename T>\nTT using vec = vector<T>;\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\n\nconst int inf = 1001001001;\n\nstruct io_setup {\n io_setup() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\n\nstruct HLD {\n using vi = vec<int>;\n using pi = pair<int, int>;\n vi in, out, par, root, rev, dep;\n // 親/成分のtop/inの中身→頂点番号\n int n, r;//頂点数、根\n \n \n HLD(vec<vi> &g, int a): n(g.size()), r(a) {\n vi siz(n, 0);\n in = out = root = rev = vi(n);\n par = vi(n, -1);\n dep = vi(n, 0);\n root[r] = r;\n\n auto dfs_siz = [&](auto f, int v) -> void {\n siz[v]++;\n for(int& to : g[v]) if(to != par[v]) {\n dep[to] = dep[v] + 1;\n par[to] = v;\n f(f, to);\n siz[v] += siz[to];\n if(siz[to] > siz[g[v][0]] || g[v][0] == par[v]) swap(to, g[v][0]);\n }\n return;\n };\n\n dfs_siz(dfs_siz, r);\n \n int t = 0;\n\n auto dfs_hld = [&](auto f, int v) -> void {\n rev[t] = v;\n in[v]=t++;\n for(int to : g[v]) if(to != par[v]) {\n root[to] = (to == g[v][0] ? root[v] : to);\n f(f, to);\n }\n out[v] = t;\n };\n\n dfs_hld(dfs_hld, r);\n }\n\n\n //以下、欲しいもののみ書く\n\n\n int lca(int a, int b) {\n while(1) {\n if(in[a] > in[b]) swap(a, b);\n if(root[a] == root[b]) return a;\n b = par[root[b]];\n }\n }\n\n int dist(int a, int b) {\n int lc = lca(a, b);\n return dep[a] + dep[b] - 2 * dep[lc];\n }\n\n vec<pi> path(int s, int t, bool edge) {\n vec<pi> ls, rs;\n while(root[s] != root[t]) {\n if(dep[root[s]] > dep[root[t]]) {\n ls.emplace_back(in[s] + 1, in[root[s]]);//上り\n s = par[root[s]];\n }\n else {\n rs.emplace_back(in[root[t]], in[t] + 1);//下り\n t = par[root[t]];\n }\n }\n\n if(dep[s] > dep[t]) ls.emplace_back(in[s] + 1, in[t] + edge);//上り\n else rs.emplace_back(in[s] + edge, in[t] + 1);//下り\n \n reverse(all(rs));\n for(auto &p : rs) ls.push_back(p);\n return ls;\n }\n\n pi subtree(int u, bool edge) {\n return pi(in[u]+edge, out[u]);\n }\n\n int kth_ancestor(int v, int k) {\n if(k > dep[v]) return -1;\n while(v >= 0) {\n if(k <= dep[v] - dep[root[v]]) {\n return rev[in[v] - k];\n }\n else {\n k -= dep[v] - dep[root[v]] + 1;\n v = par[root[v]];\n }\n }\n }\n\n int jump(int s, int t, int k) {\n int m = lca(s, t);\n int le = dep[s] - dep[m];\n int ri = dep[t] - dep[m];\n if(0 <= k && k <= le + ri) {\n if(k < le) return kth_ancestor(s, k);\n else return kth_ancestor(t, le + ri - k);\n }\n return -1;\n }\n\n\n vi pre_vs;\n\n int aux_tree(vi vs, vec<vi> &g) {\n if(vs.empty()) return -1;\n \n auto cmp = [&](int i, int j) { return in[i] < in[j]; };\n sort(all(vs), cmp);\n int m = vs.size();\n\n rep(i, 0, m-1) vs.push_back(lca(vs[i], vs[i + 1]));\n sort(all(vs), cmp);\n vs.erase(unique(all(vs)), vs.end());\n\n vi st;\n for(auto v : vs) {\n while(st.size()) {\n int p = st.back();\n if(in[p] < in[v] && in[v] < out[p]) break;\n st.pop_back();\n }\n if(st.size()) {\n g[st.back()].push_back(v);\n g[v].push_back(st.back());\n }\n st.push_back(v);\n }\n\n swap(vs, pre_vs);\n return pre_vs[0];\n }\n\n void clean(vec<vi> &g) {\n for(auto v : pre_vs) g[v] = vi();\n pre_vs = vi();\n return;\n }\n}; \n\n\nvoid solve() {\n int n;\n cin >> n;\n vec<int> C(n);\n rep(i, 0, n) cin >> C[i], C[i]--;\n vec<vec<int>> G(n);\n rep(i, 0, n-1) {\n int u, v;\n cin >> u >> v;\n u--, v--;\n G[u].push_back(v);\n G[v].push_back(u);\n }\n\n vec<vec<int>> dp(n);\n vec<int> ans(n, inf);\n HLD hld(G, 0);\n\n vec<vec<int>> cv(n);\n rep(i, 0, n) cv[C[i]].push_back(i);\n\n vec<vec<int>> g(n);\n\n rep(c, 0, n) {\n int r = hld.aux_tree(cv[c], g);\n if(r == -1) continue;\n\n auto dfs = [&](auto f, int v, int p) -> int {\n int res = inf;\n int d = g[v].size();\n dp[v].resize(d);\n \n rep(i, 0, d) {\n int to = g[v][i];\n if(to == p) continue;\n dp[v][i] = f(f, to, v);\n int nw = dp[v][i] + hld.dist(v, to);//ここで到達済み\n chmin(res, nw);\n }\n //res++;\n if(C[v] == c) res = 0;\n return res;\n };\n\n auto bfs = [&](auto f, int v, int par, int p) -> void {\n int d = g[v].size();\n rep(i, 0, d) if(g[v][i] == p) dp[v][i] = par;\n\n vec<int> L(d+1, inf);\n vec<int> R(d+1, inf);\n rep(i, 0, d) {\n int nw = dp[v][i] + hld.dist(v, g[v][i]);\n L[i+1] = min(L[i], nw);\n }\n\n rrep(i, 0, d) {\n int nw = dp[v][i] + hld.dist(v, g[v][i]);\n R[i] = min(R[i+1], nw);\n }\n\n if(C[v] == c) {\n ans[v] = L[d];\n }\n\n rep(i, 0, d) {\n int to = g[v][i];\n if(to == p) continue;\n int nx = min(L[i], R[i+1]);\n if(C[v] == c) nx = 0;\n f(f, to, nx, v);\n }\n };\n\n dfs(dfs, r, -1);\n bfs(bfs, r, inf, -1);\n hld.clean(g);\n }\n\n rep(i, 0, n) cout << ans[i] << '\\n';\n \n\n}\n\n\nint main() {\n int T = 1;\n //cin >> T;\n while(T--) {\n solve();\n }\n\n}", "accuracy": 1, "time_ms": 210, "memory_kb": 50812, "score_of_the_acc": -0.2585, "final_rank": 4 }, { "submission_id": "aoj_0439_9161695", "code_snippet": "#include <bits/stdc++.h>\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\n#define FOR(i,l,r) for(int i=(int)(l);i<(int)(r);++i)\n#define ALL(v) (v).begin(),(v).end()\nusing llong = long long;\nusing vi = std::vector<int>;\nusing vvi = std::vector<vi>;\nusing pii = std::pair<int,int>;\nusing namespace std;\nconstexpr int INF = 1e9;\nconstexpr long long LINF = 1e18;\nconstexpr double EPS = 1e-10;\nconstexpr int MOD = 998'244'353;\nconstexpr int MOD2 = 1e9+7;\n\ntemplate <typename Type>\ninline std::istream &operator>>(std::istream &is, std::vector<Type> &v) {\n for(Type &in : v) is >> in;\n return is;\n}\n\ntemplate <typename Type>\ninline std::ostream &operator<<(std::ostream &os, const std::vector<Type> &v) {\n for(auto itr = v.cbegin(); itr != v.cend(); ++itr) os << (itr == v.cbegin() ? \"\" : \" \") << *itr;\n return os;\n}\n\n#ifdef DEBUG\n\n#include \"debug.hpp\"\nusing namespace algorithm;\n\n#else\n\n#define debug(...) static_cast<void>(0)\n\n#endif\n\n// Lowest Common Ancestor（最近共通祖先）.\ntemplate <typename T = int> // T:Type of cost.\nclass LCA {\n int m_vn; // m_vn:=(ノード数).\n int m_lb; // m_lb:=ceiling(log2(vn)).\n std::vector<std::vector<std::pair<int, T> > > m_g; // m_g[v][]:=(ノードvの隣接リスト). pair of (to, cost). グラフは木であること．\n std::vector<std::vector<int> > m_par; // m_par[k][v]:=(ノードvから2^k回辿って到達する親ノード番号). 親がいない場合は-1．\n std::vector<int> m_depth; // m_depth[v]:=(ノードvの深さ). 根に連結していない場合は-1．\n std::vector<T> m_dist; // m_dist[v]:=(根からノードvまでの距離).\n std::vector<int> m_ord; // m_ord[v]:=(DFS木におけるノードvの行きかけ順序).\n\n bool is_unconnected(int v) const { return m_ord[v] == -1; }\n void bottom_up(int u, int p, int depth, T distance, int &now) {\n assert(m_ord[u] == -1); // グラフ上に閉路はないこと．\n m_ord[u] = now++;\n m_par[0][u] = p;\n m_depth[u] = depth;\n m_dist[u] = distance;\n for(const auto &[v, cost] : m_g[u]) {\n if(v == p) continue;\n bottom_up(v, u, depth + 1, distance + cost, now);\n }\n }\n\npublic:\n LCA() : LCA(0) {}\n explicit LCA(size_t vn) : m_vn(vn), m_lb(1), m_g(vn), m_depth(vn, -1), m_dist(vn, infinity()), m_ord(vn, -1) {\n while(1 << m_lb < order()) m_lb++;\n m_par.assign(m_lb, std::vector<int>(order(), -1));\n }\n\n static constexpr T infinity() { return std::numeric_limits<T>::max(); }\n // ノード数を返す．\n int order() const { return m_vn; }\n // 無向辺を張る．ノードuとvは非連結であること．\n void add_edge(int u, int v, T cost = 0) {\n assert(0 <= u and u < order());\n assert(0 <= v and v < order());\n m_g[u].emplace_back(v, cost);\n m_g[v].emplace_back(u, cost);\n }\n // 祖先木を構築する．O(|V|*log|V|).\n void build(int rt = 0) {\n assert(0 <= rt and rt < order());\n for(std::vector<int> &v : m_par) std::fill(v.begin(), v.end(), -1);\n std::fill(m_depth.begin(), m_depth.end(), -1);\n std::fill(m_dist.begin(), m_dist.end(), infinity());\n std::fill(m_ord.begin(), m_ord.end(), -1);\n int now = 0;\n bottom_up(rt, -1, 0, 0, now);\n for(int k = 0; k < m_lb - 1; ++k) {\n for(int v = 0; v < order(); ++v) {\n if(m_par[k][v] != -1) m_par[k + 1][v] = m_par[k][m_par[k][v]];\n }\n }\n }\n // ノードvの祖先をk代遡る．O(log|V|).\n int trace_back(int v, int k) const {\n assert(0 <= v and v < order());\n assert(0 <= k and k < order());\n if(k > m_depth[v]) return -1;\n for(int i = 0; i < m_lb; ++i) {\n if(k >> i & 1) v = m_par[i][v];\n }\n return v;\n }\n // 木上のノードuとvの最も近い共通の祖先を求める．O(log|V|).\n int lca(int u, int v) const {\n assert(0 <= u and u < order());\n assert(0 <= v and v < order());\n if(is_unconnected(u) or is_unconnected(v)) return -1;\n if(m_depth[u] > m_depth[v]) std::swap(u, v);\n v = trace_back(v, m_depth[v] - m_depth[u]); // 同じ深さに合わせる．\n if(u == v) return u;\n for(int k = m_lb - 1; k >= 0; --k) {\n if(m_par[k][u] != m_par[k][v]) u = m_par[k][u], v = m_par[k][v]; // 異なったら根に近づける．\n }\n return m_par[0][u];\n }\n // ノードvの深さを返す．O(1).\n T depth(int v) const {\n assert(0 <= v and v < order());\n return m_depth[v];\n }\n // ノードu, v間の長さを求める．O(log|V|).\n int length(int u, int v) const {\n assert(0 <= u and u < order());\n assert(0 <= v and v < order());\n if(is_unconnected(u) or is_unconnected(v)) return -1;\n return m_depth[u] + m_depth[v] - 2 * m_depth[lca(u, v)];\n }\n // 根とノードv間の距離を返す．O(1).\n T distance(int v) const {\n assert(0 <= v and v < order());\n return m_dist[v];\n }\n // ノードu, v間の距離を求める．O(log|V|).\n T distance(int u, int v) const {\n assert(0 <= u and u < order());\n assert(0 <= v and v < order());\n if(is_unconnected(u) or is_unconnected(v)) return infinity();\n return m_dist[u] + m_dist[v] - 2 * m_dist[lca(u, v)];\n }\n // 木の圧縮．\n // 任意の頂点集合とそのLCAからなる，頂点同士の関係性を維持した木を作成する．O(K*log|V|).\n std::pair<int, std::map<int, std::vector<int> > > auxiliary_tree(std::vector<int> &vs) const {\n assert(std::find_if(vs.begin(), vs.end(), [&](int v) -> bool { return !(0 <= v and v < order()); }) == vs.end());\n std::map<int, std::vector<int> > res; // res[v][]:=(圧縮した木におけるノードvの隣接リスト).\n vs.erase(std::remove_if(vs.begin(), vs.end(), [&](int v) -> bool { return is_unconnected(v); }), vs.end());\n auto comp = [&](int u, int v) -> bool { return m_ord[u] < m_ord[v]; };\n std::sort(vs.begin(), vs.end(), comp);\n vs.erase(std::unique(vs.begin(), vs.end()), vs.end());\n const int n = vs.size();\n if(n == 0) return {-1, res};\n if(n == 1) {\n res[vs[0]];\n return {vs[0], res};\n }\n std::stack<int> st;\n st.push(vs[0]);\n for(int i = 1; i < n; ++i) {\n int w = lca(vs[i - 1], vs[i]);\n if(w != vs[i - 1]) {\n int v = st.top();\n st.pop();\n while(!st.empty() and m_depth[st.top()] > m_depth[w]) {\n res[st.top()].push_back(v);\n res[v].push_back(st.top());\n v = st.top();\n st.pop();\n }\n if(st.empty() or st.top() != w) {\n st.push(w);\n vs.push_back(w);\n }\n res[w].push_back(v);\n res[v].push_back(w);\n }\n st.push(vs[i]);\n }\n while(st.size() > 1) {\n int v = st.top();\n st.pop();\n res[st.top()].push_back(v);\n res[v].push_back(st.top());\n }\n std::sort(vs.begin(), vs.end(), comp);\n return {st.top(), res}; // pair of (root, tree).\n }\n};\n\ntemplate<typename Type> inline bool chmin(Type &a,const Type &b){if(a>b){a=b;return true;}return false;}\ntemplate<typename Type> inline bool chmax(Type &a,const Type &b){if(a<b){a=b;return true;}return false;}\n\nint main(){\n int n;\n cin>>n;\n\n vi c(n);\n vvi inv(n);\n REP(i,n){\n cin>>c[i];\n c[i]--;\n inv[c[i]].push_back(i);\n }\n\n LCA lca(n);\n REP(i,n-1){\n int s,t;\n cin>>s>>t;\n s--, t--;\n lca.add_edge(s,t);\n }\n lca.build();\n\n vi ans(n,INF);\n REP(i,n){\n if(inv[i].size()==0) continue;\n const auto &&[rt,tree]=lca.auxiliary_tree(inv[i]);\n debug(i,rt,inv[i],tree);\n\n map<int,vector<pii> > mp;\n for(auto v:inv[i]){\n auto &neighbors=mp[v];\n if(c[v]==i){\n neighbors.emplace_back(0,v);\n neighbors.emplace_back(INF,-1);\n }else{\n neighbors.emplace_back(INF,-1);\n neighbors.emplace_back(INF,-1);\n }\n }\n \n auto bottom_up=[&](auto self,int u,int p)->pii{\n auto &neighbors=mp[u];\n for(auto v:tree.at(u)){\n if(v==p) continue;\n const auto &&[d,w]=self(self,v,u);\n auto len=lca.length(u,v);\n chmin(neighbors[1],{d+len,w});\n if(neighbors[0]>neighbors[1]) swap(neighbors[0],neighbors[1]);\n }\n return neighbors[0];\n };\n bottom_up(bottom_up,rt,-1);\n\n auto top_down=[&](auto self,int u,int p)->void{\n const auto &neighbors_u=mp[u];\n for(auto v:tree.at(u)){\n if(v==p) continue;\n auto &neighbors_v=mp[v];\n auto len=lca.length(u,v);\n if(neighbors_u[0].second==neighbors_v[0].second) chmin(neighbors_v[1],{neighbors_u[1].first+len,neighbors_u[1].second});\n else chmin(neighbors_v[1],{neighbors_u[0].first+len,neighbors_u[0].second});\n if(neighbors_v[0]>neighbors_v[1]) swap(neighbors_v[0],neighbors_v[1]);\n self(self,v,u);\n }\n };\n top_down(top_down,rt,-1);\n\n for(const auto &[u,neighbors]:mp){\n if(c[u]==i){\n const auto &[d,v]=(neighbors[0].second==u?neighbors[1]:neighbors[0]);\n debug(u,v,d);\n ans[u]=d;\n }\n }\n }\n\n for(auto out:ans) cout<<out<<\"\\n\";\n}", "accuracy": 1, "time_ms": 590, "memory_kb": 47192, "score_of_the_acc": -0.4498, "final_rank": 5 }, { "submission_id": "aoj_0439_9161495", "code_snippet": "#include <bits/stdc++.h>\n#define REP(i,n) for(int i=0;i<(int)(n);++i)\n#define FOR(i,l,r) for(int i=(int)(l);i<(int)(r);++i)\n#define ALL(v) (v).begin(),(v).end()\nusing llong = long long;\nusing vi = std::vector<int>;\nusing vvi = std::vector<vi>;\nusing pii = std::pair<int,int>;\nusing namespace std;\nconstexpr int INF = 1e9;\nconstexpr long long LINF = 1e18;\nconstexpr double EPS = 1e-10;\nconstexpr int MOD = 998'244'353;\nconstexpr int MOD2 = 1e9+7;\n\ntemplate <typename Type>\ninline std::istream &operator>>(std::istream &is, std::vector<Type> &v) {\n for(Type &in : v) is >> in;\n return is;\n}\n\ntemplate <typename Type>\ninline std::ostream &operator<<(std::ostream &os, const std::vector<Type> &v) {\n for(auto itr = v.cbegin(); itr != v.cend(); ++itr) os << (itr == v.cbegin() ? \"\" : \" \") << *itr;\n return os;\n}\n\n#ifdef DEBUG\n\n#include \"debug.hpp\"\nusing namespace algorithm;\n\n#else\n\n#define debug(...) static_cast<void>(0)\n\n#endif\n\n// Lowest Common Ancestor（最近共通祖先）.\ntemplate <typename T = int> // T:Type of cost.\nclass LCA {\n int m_vn; // m_vn:=(ノード数).\n int m_lb; // m_lb:=ceiling(log2(vn)).\n std::vector<std::vector<std::pair<int, T> > > m_g; // m_g[v][]:=(ノードvの隣接リスト). pair of (to, cost). グラフは木であること．\n std::vector<std::vector<int> > m_par; // m_par[k][v]:=(ノードvから2^k回辿って到達する親ノード番号). 親がいない場合は-1．\n std::vector<int> m_depth; // m_depth[v]:=(ノードvの深さ). 根に連結していない場合は-1．\n std::vector<T> m_dist; // m_dist[v]:=(根からノードvまでの距離).\n std::vector<int> m_ord; // m_ord[v]:=(DFS木におけるノードvの行きかけ順序).\n\n bool is_unconnected(int v) const { return m_ord[v] == -1; }\n void bottom_up(int u, int p, int depth, T distance, int &now) {\n assert(m_ord[u] == -1); // グラフ上に閉路はないこと．\n m_ord[u] = now++;\n m_par[0][u] = p;\n m_depth[u] = depth;\n m_dist[u] = distance;\n for(const auto &[v, cost] : m_g[u]) {\n if(v == p) continue;\n bottom_up(v, u, depth + 1, distance + cost, now);\n }\n }\n\npublic:\n LCA() : LCA(0) {}\n explicit LCA(size_t vn) : m_vn(vn), m_lb(1), m_g(vn), m_depth(vn, -1), m_dist(vn, infinity()), m_ord(vn, -1) {\n while(1 << m_lb < order()) m_lb++;\n m_par.assign(m_lb, std::vector<int>(order(), -1));\n }\n\n static constexpr T infinity() { return std::numeric_limits<T>::max(); }\n // ノード数を返す．\n int order() const { return m_vn; }\n // 無向辺を張る．ノードuとvは非連結であること．\n void add_edge(int u, int v, T cost = 0) {\n assert(0 <= u and u < order());\n assert(0 <= v and v < order());\n m_g[u].emplace_back(v, cost);\n m_g[v].emplace_back(u, cost);\n }\n // 祖先木を構築する．O(|V|*log|V|).\n void build(int rt = 0) {\n assert(0 <= rt and rt < order());\n for(std::vector<int> &v : m_par) std::fill(v.begin(), v.end(), -1);\n std::fill(m_depth.begin(), m_depth.end(), -1);\n std::fill(m_dist.begin(), m_dist.end(), infinity());\n std::fill(m_ord.begin(), m_ord.end(), -1);\n int now = 0;\n bottom_up(rt, -1, 0, 0, now);\n for(int k = 0; k < m_lb - 1; ++k) {\n for(int v = 0; v < order(); ++v) {\n if(m_par[k][v] != -1) m_par[k + 1][v] = m_par[k][m_par[k][v]];\n }\n }\n }\n // ノードvの祖先をk代遡る．O(log|V|).\n int trace_back(int v, int k) const {\n assert(0 <= v and v < order());\n assert(0 <= k and k < order());\n if(k > m_depth[v]) return -1;\n for(int i = 0; i < m_lb; ++i) {\n if(k >> i & 1) v = m_par[i][v];\n }\n return v;\n }\n // 木上のノードuとvの最も近い共通の祖先を求める．O(log|V|).\n int lca(int u, int v) const {\n assert(0 <= u and u < order());\n assert(0 <= v and v < order());\n if(is_unconnected(u) or is_unconnected(v)) return -1;\n if(m_depth[u] > m_depth[v]) std::swap(u, v);\n v = trace_back(v, m_depth[v] - m_depth[u]); // 同じ深さに合わせる．\n if(u == v) return u;\n for(int k = m_lb - 1; k >= 0; --k) {\n if(m_par[k][u] != m_par[k][v]) u = m_par[k][u], v = m_par[k][v]; // 異なったら根に近づける．\n }\n return m_par[0][u];\n }\n // ノードvの深さを返す．O(1).\n T depth(int v) const {\n assert(0 <= v and v < order());\n return m_depth[v];\n }\n // ノードu, v間の長さを求める．O(log|V|).\n int length(int u, int v) const {\n assert(0 <= u and u < order());\n assert(0 <= v and v < order());\n if(is_unconnected(u) or is_unconnected(v)) return -1;\n return m_depth[u] + m_depth[v] - 2 * m_depth[lca(u, v)];\n }\n // 根とノードv間の距離を返す．O(1).\n T distance(int v) const {\n assert(0 <= v and v < order());\n return m_dist[v];\n }\n // ノードu, v間の距離を求める．O(log|V|).\n T distance(int u, int v) const {\n assert(0 <= u and u < order());\n assert(0 <= v and v < order());\n if(is_unconnected(u) or is_unconnected(v)) return infinity();\n return m_dist[u] + m_dist[v] - 2 * m_dist[lca(u, v)];\n }\n // 木の圧縮．\n // 任意の頂点集合とそのLCAからなる，頂点同士の関係性を維持した木を作成する．O(K*log|V|).\n std::pair<int, std::map<int, std::vector<int> > > auxiliary_tree(std::vector<int> &vs) const {\n assert(std::find_if(vs.begin(), vs.end(), [&](int v) -> bool { return !(0 <= v and v < order()); }) == vs.end());\n std::map<int, std::vector<int> > res; // res[v][]:=(圧縮した木におけるノードvの隣接リスト).\n vs.erase(std::remove_if(vs.begin(), vs.end(), [&](int v) -> bool { return is_unconnected(v); }), vs.end());\n auto comp = [&](int u, int v) -> bool { return m_ord[u] < m_ord[v]; };\n std::sort(vs.begin(), vs.end(), comp);\n vs.erase(std::unique(vs.begin(), vs.end()), vs.end());\n const int n = vs.size();\n if(n == 0) return {-1, res};\n if(n == 1) {\n res[vs[0]];\n return {vs[0], res};\n }\n std::stack<int> st;\n st.push(vs[0]);\n for(int i = 1; i < n; ++i) {\n int w = lca(vs[i - 1], vs[i]);\n if(w != vs[i - 1]) {\n int v = st.top();\n st.pop();\n while(!st.empty() and m_depth[st.top()] > m_depth[w]) {\n res[st.top()].push_back(v);\n res[v].push_back(st.top());\n v = st.top();\n st.pop();\n }\n if(st.empty() or st.top() != w) {\n st.push(w);\n vs.push_back(w);\n }\n res[w].push_back(v);\n res[v].push_back(w);\n }\n st.push(vs[i]);\n }\n while(st.size() > 1) {\n int v = st.top();\n st.pop();\n res[st.top()].push_back(v);\n res[v].push_back(st.top());\n }\n std::sort(vs.begin(), vs.end(), comp);\n return {st.top(), res}; // pair of (root, tree).\n }\n};\n\ntemplate<typename Type> inline bool chmin(Type &a,const Type &b){if(a>b){a=b;return true;}return false;}\ntemplate<typename Type> inline bool chmax(Type &a,const Type &b){if(a<b){a=b;return true;}return false;}\n\nint main(){\n int n;\n cin>>n;\n\n vi c(n);\n vvi inv(n);\n REP(i,n){\n cin>>c[i];\n c[i]--;\n inv[c[i]].push_back(i);\n }\n\n LCA lca(n);\n REP(i,n-1){\n int s,t;\n cin>>s>>t;\n s--, t--;\n lca.add_edge(s,t);\n }\n lca.build();\n\n vi ans(n,INF);\n REP(i,n){\n auto vs=inv[i];\n const auto &&[rt,tree]=lca.auxiliary_tree(vs);\n debug(i,rt,vs);\n if(vs.size()==0) continue;\n\n map<int,vector<pii> > mp;\n for(auto v:vs){\n auto &dist=mp[v];\n if(c[v]==i){\n dist.emplace_back(0,v);\n dist.emplace_back(INF,-1);\n }else{\n dist.emplace_back(INF,-1);\n dist.emplace_back(INF,-1);\n }\n }\n \n auto bottom_up=[&](auto self,int u,int p)->pii{\n auto &dist_u=mp[u];\n for(auto v:tree.at(u)){\n if(v==p) continue;\n auto [d,w]=self(self,v,u);\n auto len=lca.length(u,v);\n chmin(dist_u[1],{d+len,w});\n if(dist_u[0]>dist_u[1]) swap(dist_u[0],dist_u[1]);\n }\n return dist_u[0];\n };\n bottom_up(bottom_up,rt,-1);\n\n auto top_down=[&](auto self,int u,int p)->void{\n const auto &dist_u=mp[u];\n for(auto v:tree.at(u)){\n if(v==p) continue;\n auto &dist_v=mp[v];\n auto len=lca.length(u,v);\n if(dist_u[0].second==dist_v[0].second) chmin(dist_v[1],{dist_u[1].first+len,dist_u[1].second});\n else chmin(dist_v[1],{dist_u[0].first+len,dist_u[0].second});\n if(dist_v[0]>dist_v[1]) swap(dist_v[0],dist_v[1]);\n self(self,v,u);\n }\n };\n top_down(top_down,rt,-1);\n\n for(const auto &[u,dist]:mp){\n const auto &[d,v]=(dist[0].second==u?dist[1]:dist[0]);\n debug(u,v,d,lca.length(u,v));\n assert(d==lca.length(u,v));\n if(c[u]==i) ans[u]=d;\n }\n }\n\n for(auto out:ans) cout<<out<<\"\\n\";\n}", "accuracy": 1, "time_ms": 630, "memory_kb": 46348, "score_of_the_acc": -0.465, "final_rank": 6 }, { "submission_id": "aoj_0439_9016788", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<typename T=int> // T: type of cost\nstruct lca_tree {\n int n, root, l;\n vector<vector<int>> to;\n vector<vector<T>> co;\n vector<int> dep;\n vector<T> costs;\n vector<vector<int>> par;\n lca_tree(int n):n(n),to(n),co(n),dep(n),costs(n) {\n l = 0;\n while ((1<<l) < n) ++l;\n par = vector<vector<int>>(n+1,vector<int>(l,n));\n }\n void add_edge(int a, int b, T c=0) {\n to[a].push_back(b); co[a].push_back(c);\n to[b].push_back(a); co[b].push_back(c);\n }\n void dfs(int v, int d=0, T c=0, int p=-1) {\n if (p != -1) par[v][0] = p;\n dep[v] = d;\n costs[v] = c;\n for (int i = 0; i < to[v].size(); ++i) {\n int u = to[v][i];\n if (u == p) continue;\n dfs(u, d+1, c+co[v][i], v);\n }\n }\n void init(int _root=0) {\n root = _root;\n dfs(root);\n for (int i = 0; i < l-1; ++i) {\n for (int v = 0; v < n; ++v) {\n par[v][i+1] = par[par[v][i]][i];\n }\n }\n }\n // LCA\n int up(int v, int k) {\n for (int i = l-1; i >= 0; --i) {\n int len = 1<<i;\n if (k >= len) k -= len, v = par[v][i];\n }\n return v;\n }\n int lca(int a, int b) {\n if (dep[a] > dep[b]) swap(a,b);\n b = up(b, dep[b]-dep[a]);\n if (a == b) return a;\n for (int i = l-1; i >= 0; --i) {\n int na = par[a][i], nb = par[b][i];\n if (na != nb) a = na, b = nb;\n }\n return par[a][0];\n }\n int length(int a, int b) {\n int c = lca(a,b);\n return dep[a]+dep[b]-dep[c]*2;\n }\n T dist(int a, int b) {\n int c = lca(a,b);\n return costs[a]+costs[b]-costs[c]*2;\n }\n};\n\nint main() {\n int N;\n cin >> N;\n lca_tree G(N);\n vector c(N, int());\n vector vc(N, vector<int>());\n for(int i = 0; i < N; i++) {\n cin >> c[i];\n vc[--c[i]].push_back(i);\n }\n for(int i = 0; i < N-1; i++) {\n int s, t;\n cin >> s >> t;\n G.add_edge(--s, --t, 1);\n }\n G.init();\n // pre-orderを計算する\n vector<int> po(N);\n {\n int tim = 0;\n auto dfs = [&](auto dfs, int cur, int par) -> void {\n po[cur] = tim++;\n for(int nxt : G.to[cur]) {\n if(nxt == par) continue;\n dfs(dfs, nxt, cur);\n }\n };\n dfs(dfs, 0, -1);\n }\n vector<int> ans(N, N);\n for(int target = 0; target < N; target++) {\n // auxiliary treeを構築する\n vector<int> v = vc[target];\n if(v.empty()) continue;\n sort(v.begin(), v.end(), [&](int l, int r){return po[l] < po[r];});\n for(int i = 0, sz = int(v.size()); i < sz-1; i++) {\n v.push_back(G.lca(v[i], v[i+1]));\n }\n sort(v.begin(), v.end(), [&](int l, int r){return po[l] < po[r];});\n v.erase(unique(v.begin(), v.end()), v.end());\n unordered_map<int, vector<int>> aux;\n for(int i = 0, sz = int(v.size()); i < sz-1; i++) {\n int lca = G.lca(v[i], v[i+1]);\n aux[lca].push_back(v[i+1]);\n aux[v[i+1]].push_back(lca);\n }\n // auxiliary tree上でdpをする\n unordered_map<int, vector<int>> child;\n auto dfs = [&](auto dfs, int cur, int par) -> void {\n // 各子孫の部分木に対して、最も近い(色targetの)頂点を求める\n vector<pair<int, int>> min_dist;\n for(int nxt : aux[cur]) {\n if(nxt == par) continue;\n dfs(dfs, nxt, cur);\n min_dist.push_back(make_pair(N, nxt));\n for(int v : child[nxt]) {\n min_dist.back() = min(min_dist.back(), make_pair(G.dist(v, cur), nxt));\n }\n }\n sort(min_dist.begin(), min_dist.end());\n child[cur] = (c[cur] == target ? vector<int>{cur} : vector<int>{});\n for(int nxt : aux[cur]) {\n if(nxt == par) continue;\n if(c[cur] == target) {\n for(int v : child[nxt]) {\n ans[v] = min(ans[v], G.dist(v, cur));\n ans[cur] = min(ans[cur], G.dist(v, cur));\n }\n }else {\n for(int v : child[nxt]) {\n if(min_dist[0].second != nxt) {\n ans[v] = min(ans[v], G.dist(v, cur)+min_dist[0].first);\n }else if(int(min_dist.size()) >= 2) {\n ans[v] = min(ans[v], G.dist(v, cur)+min_dist[1].first);\n }\n }\n if(int(child[cur].size()) < int(child[nxt].size())) swap(child[cur], child[nxt]);\n child[cur].insert(child[cur].end(), child[nxt].begin(), child[nxt].end());\n }\n }\n };\n dfs(dfs, v[0], -1);\n }\n for(int i = 0; i < N; i++) {\n cout << ans[i] << \"\\n\";\n }\n}", "accuracy": 1, "time_ms": 820, "memory_kb": 62500, "score_of_the_acc": -0.754, "final_rank": 13 }, { "submission_id": "aoj_0439_8974987", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define all(v) v.begin(), v.end()\ntemplate <class T, class U>\ninline bool chmax(T& a, U b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T, class U>\ninline bool chmin(T& a, U b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\nconstexpr int INF = 1000000000;\nconstexpr int64_t llINF = 3000000000000000000;\nconstexpr double eps = 1e-10;\nconst double pi = acos(-1);\npair<vector<int>, vector<int>> calc_factor(int n) {\n vector<int> least_factor(n + 1, 0), prime_list;\n for (int i = 2; i <= n; i++) {\n if (least_factor[i] == 0) {\n least_factor[i] = i;\n prime_list.push_back(i);\n }\n for (int j = 0; j < (int)prime_list.size() && i * prime_list[j] <= n; j++) {\n least_factor[i * prime_list[j]] = prime_list[j];\n if (prime_list[j] == least_factor[i]) break;\n }\n }\n return make_pair(least_factor, prime_list);\n}\nll extgcd(ll a, ll b, ll& x, ll& y) {\n if (b == 0) {\n x = 1;\n y = 0;\n return a;\n }\n ll d = extgcd(b, a % b, y, x);\n y -= a / b * x;\n return d;\n}\nll modpow(ll a, ll b, ll m) {\n ll res = 1;\n while (b) {\n if (b & 1) {\n res *= a;\n res %= m;\n }\n a *= a;\n a %= m;\n b >>= 1;\n }\n return res;\n}\ntemplate <int modulo>\nstruct modint {\n int x;\n modint() : x(0) {}\n modint(int64_t y) : x(y >= 0 ? y % modulo : (modulo - (-y) % modulo) % modulo) {}\n modint& operator+=(const modint& p) {\n if ((x += p.x) >= modulo) x -= modulo;\n return *this;\n }\n modint& operator-=(const modint& p) {\n if ((x += modulo - p.x) >= modulo) x -= modulo;\n return *this;\n }\n modint& operator*=(const modint& p) {\n x = (int)(1LL * x * p.x % modulo);\n return *this;\n }\n modint& operator/=(const modint& p) {\n *this *= p.inv();\n return *this;\n }\n modint operator-() const { return modint(-x); }\n modint operator+(const modint& p) const { return modint(*this) += p; }\n modint operator-(const modint& p) const { return modint(*this) -= p; }\n modint operator*(const modint& p) const { return modint(*this) *= p; }\n modint operator/(const modint& p) const { return modint(*this) /= p; }\n bool operator==(const modint& p) const { return x == p.x; }\n bool operator!=(const modint& p) const { return x != p.x; }\n modint inv() const {\n int a = x, b = modulo, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return modint(u);\n }\n modint pow(int64_t n) const {\n modint ret(1), mul(x);\n while (n > 0) {\n if (n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n friend ostream& operator<<(ostream& os, const modint& p) { return os << p.x; }\n friend istream& operator>>(istream& is, modint& a) {\n int64_t t;\n is >> t;\n a = modint<modulo>(t);\n return (is);\n }\n int val() const { return x; }\n static constexpr int mod() { return modulo; }\n static constexpr int half() { return (modulo + 1) >> 1; }\n};\ntemplate <typename T>\nstruct Binomial {\n vector<T> inv, fact, factinv;\n Binomial(int n) {\n assert(n > 0);\n inv.resize(n + 1);\n fact.resize(n + 1);\n factinv.resize(n + 1);\n inv[0] = fact[0] = factinv[0] = 1;\n for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * i;\n factinv[n] = fact[n].inv();\n inv[n] = fact[n - 1] * factinv[n];\n for (int i = n - 1; i >= 1; i--) {\n factinv[i] = factinv[i + 1] * (i + 1);\n inv[i] = fact[i - 1] * factinv[i];\n }\n }\n T C(int n, int r) {\n if (n < 0 || n < r || r < 0) return 0;\n return fact[n] * factinv[n - r] * factinv[r];\n }\n T P(int n, int r) {\n if (n < 0 || n < r || r < 0) return 0;\n return fact[n] * factinv[n - r];\n }\n T H(int n, int r) {\n if (n == 0 && r == 0) return 1;\n if (n < 0 || r < 0) return 0;\n return r == 0 ? 1 : C(n + r - 1, r);\n }\n};\ntemplate <class S, S (*op)(S, S), S (*e)()>\nstruct segtree {\n int siz = 1;\n vector<S> dat;\n segtree(int n) : segtree(vector<S>(n, e())) {}\n segtree(const vector<S>& a) {\n while (siz < a.size()) siz <<= 1;\n dat = vector<S>(siz << 1, e());\n for (int i = 0; i < a.size(); i++) dat[siz + i] = a[i];\n for (int i = siz - 1; i >= 1; i--) dat[i] = op(dat[2 * i], dat[2 * i + 1]);\n }\n void set(int p, S x) {\n p += siz;\n dat[p] = x;\n while (p > 0) {\n p >>= 1;\n dat[p] = op(dat[2 * p], dat[2 * p + 1]);\n }\n }\n void add(int p, S x) { set(p, get(p) + x); }\n S get(int p) { return dat[p + siz]; }\n S prod(int l, int r) {\n S vl = e(), vr = e();\n l += siz, r += siz;\n while (l < r) {\n if (l & 1) vl = op(vl, dat[l++]);\n if (r & 1) vr = op(dat[--r], vr);\n l >>= 1, r >>= 1;\n }\n return op(vl, vr);\n }\n S all_prod() { return dat[1]; }\n};\n\ntemplate <class T>\nstruct BIT {\n // 1-indexed\n int n, beki = 1;\n vector<T> bit;\n BIT(int x) {\n bit.resize(x + 1, 0);\n n = x;\n while (beki * 2 <= n) beki *= 2;\n }\n T sum(int i) {\n T res = 0;\n while (i > 0) {\n res += bit[i];\n i -= i & -i;\n }\n return res;\n }\n T sum(int l, int r) {\n //[l,r]\n return sum(r) - (l == 0 ? 0 : sum(l - 1));\n }\n void add(int i, T x) {\n while (i <= n) {\n bit[i] += x;\n i += i & -i;\n }\n }\n int lowerbound(T w) {\n if (w <= 0) return 0;\n int x = 0;\n for (int k = beki; k > 0; k >>= 1) {\n if (x + k <= n && bit[x + k] < w) {\n w -= bit[x + k];\n x += k;\n }\n }\n return x + 1;\n }\n};\nusing mint = modint<998244353>;\ntemplate <class T, T (*op)(T, T), T (*e)()>\nstruct sparsetable {\n vector<vector<T>> table;\n vector<int> logtable;\n sparsetable(vector<T> v) {\n int len = 0;\n while ((1 << len) <= v.size()) len++;\n table.assign(len, vector<T>(1 << len));\n for (int i = 0; i < (int)v.size(); i++) table[0][i] = v[i];\n for (int i = 1; i < len; i++) {\n for (int j = 0; j + (1 << i) <= (1 << len); j++) {\n table[i][j] = op(table[i - 1][j], table[i - 1][j + (1 << (i - 1))]);\n }\n }\n logtable.resize(v.size() + 1);\n for (int i = 2; i < logtable.size(); i++) {\n logtable[i] = logtable[(i >> 1)] + 1;\n }\n }\n T query(int l, int r) {\n assert(l <= r);\n if (l == r) return e();\n int len = logtable[r - l];\n return op(table[len][l], table[len][r - (1 << len)]);\n }\n};\n\nstruct lca_tree {\n int n, size;\n vector<vector<int>> par;\n vector<int> depth;\n lca_tree(vector<vector<int>>& g, int root = 0) : n((int)g.size()), size(log2(n) + 2), par(size, vector<int>(n, -1)), depth(vector<int>(n, n)) {\n queue<int> que;\n depth[root] = 0;\n que.push(root);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n for (int i : g[p]) {\n if (depth[i] > depth[p] + 1) {\n depth[i] = depth[p] + 1;\n par[0][i] = p;\n que.push(i);\n }\n }\n }\n for (int k = 0; k < size - 1; k++) {\n for (int i = 0; i < n; i++) {\n if (par[k][i] == -1)\n par[k + 1][i] = -1;\n else\n par[k + 1][i] = par[k][par[k][i]];\n }\n }\n }\n int query(int u, int v) {\n if (depth[u] > depth[v]) swap(u, v);\n for (int k = size - 1; k >= 0; k--) {\n if (((depth[v] - depth[u]) >> k) & 1) v = par[k][v];\n if (u == v) return u;\n }\n for (int k = size - 1; k >= 0; k--) {\n if (par[k][u] != par[k][v]) {\n u = par[k][u];\n v = par[k][v];\n }\n }\n return par[0][u];\n }\n int dist(int u, int v) {\n int l = query(u, v);\n return depth[u] + depth[v] - 2 * depth[l];\n }\n int parent(int u, int d) {\n for (int k = size - 1; k >= 0; k--) {\n if ((d >> k) & 1) {\n if (u != -1) u = par[k][u];\n }\n }\n return u;\n }\n};\n\nstruct lca_tree_with_edge_ID {\n int n, size;\n vector<vector<pair<int, int>>> g;\n vector<vector<int>> par;\n vector<int> depth;\n lca_tree_with_edge_ID(vector<vector<pair<int, int>>> g_, int root = 0)\n : n((int)g_.size()), size(log2(n) + 2), g(g_), par(size, vector<int>(n, -1)), depth(vector<int>(n, n)) {\n queue<int> que;\n depth[root] = 0;\n que.push(root);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n for (auto [i, id] : g[p]) {\n if (depth[i] > depth[p] + 1) {\n depth[i] = depth[p] + 1;\n par[0][i] = p;\n que.push(i);\n }\n }\n }\n for (int k = 0; k < size - 1; k++) {\n for (int i = 0; i < n; i++) {\n if (par[k][i] == -1)\n par[k + 1][i] = -1;\n else\n par[k + 1][i] = par[k][par[k][i]];\n }\n }\n }\n int query(int u, int v) {\n if (depth[u] > depth[v]) swap(u, v);\n for (int k = size - 1; k >= 0; k--) {\n if (((depth[v] - depth[u]) >> k) & 1) v = par[k][v];\n if (u == v) return u;\n }\n for (int k = size - 1; k >= 0; k--) {\n if (par[k][u] != par[k][v]) {\n u = par[k][u];\n v = par[k][v];\n }\n }\n return par[0][u];\n }\n int dist(int u, int v) {\n int l = query(u, v);\n return depth[u] + depth[v] - 2 * depth[l];\n }\n};\n\nstruct UnionFind {\n vector<int> par, siz, es;\n UnionFind(int x) {\n par.resize(x);\n siz.resize(x);\n es.resize(x);\n for (int i = 0; i < x; i++) {\n par[i] = i;\n siz[i] = 1;\n es[i] = 0;\n }\n }\n int find(int x) {\n if (par[x] == x) return x;\n return par[x] = find(par[x]);\n }\n bool unite(int x, int y) {\n x = find(x), y = find(y);\n if (x == y) {\n es[x]++;\n return false;\n }\n if (siz[x] < siz[y]) swap(x, y);\n par[y] = x;\n siz[x] += siz[y];\n es[x] += es[y] + 1;\n return true;\n }\n bool same(int x, int y) { return find(x) == find(y); }\n int size(int x) { return siz[find(x)]; }\n int edges(int x) { return es[find(x)]; }\n};\nstruct Mo {\n int n;\n vector<pair<int, int>> lr;\n\n explicit Mo(int n) : n(n) {}\n\n void add(int l, int r) { /* [l, r) */\n lr.emplace_back(l, r);\n }\n\n template <typename AL, typename AR, typename EL, typename ER, typename O>\n void build(const AL& add_left, const AR& add_right, const EL& erase_left, const ER& erase_right, const O& out) {\n int q = (int)lr.size();\n int bs = n / min<int>(n, sqrt(q));\n vector<int> ord(q);\n iota(begin(ord), end(ord), 0);\n sort(begin(ord), end(ord), [&](int a, int b) {\n int ablock = lr[a].first / bs, bblock = lr[b].first / bs;\n if (ablock != bblock) return ablock < bblock;\n return (ablock & 1) ? lr[a].second > lr[b].second : lr[a].second < lr[b].second;\n });\n int l = 0, r = 0;\n for (auto idx : ord) {\n while (l > lr[idx].first) add_left(--l);\n while (r < lr[idx].second) add_right(r++);\n while (l < lr[idx].first) erase_left(l++);\n while (r > lr[idx].second) erase_right(--r);\n out(idx);\n }\n }\n\n template <typename A, typename E, typename O>\n void build(const A& add, const E& erase, const O& out) {\n build(add, add, erase, erase, out);\n }\n};\ntemplate <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S), F (*composition)(F, F), F (*id)()>\nstruct lazy_segtree {\n int _n, sz = 1;\n vector<S> dat;\n vector<F> lazy;\n lazy_segtree(vector<S> a) : _n(int(a.size())) {\n while (sz < _n) sz <<= 1;\n dat.resize(sz * 2, e());\n lazy.resize(sz * 2, id());\n rep(i, _n) dat[sz + i] = a[i];\n for (int i = sz - 1; i >= 1; i--) dat[i] = op(dat[2 * i], dat[2 * i + 1]);\n }\n void eval(int k) {\n dat[k] = mapping(lazy[k], dat[k]);\n if (k < sz) {\n lazy[k * 2] = composition(lazy[k], lazy[k * 2]);\n lazy[k * 2 + 1] = composition(lazy[k], lazy[k * 2 + 1]);\n }\n lazy[k] = id();\n }\n void apply(int a, int b, F f, int k = 1, int l = 0, int r = -1) {\n eval(k);\n if (r == -1) r = sz;\n if (r <= a || b <= l) return;\n if (a <= l && r <= b) {\n lazy[k] = composition(f, lazy[k]);\n eval(k);\n return;\n }\n int m = (l + r) >> 1;\n apply(a, b, f, 2 * k, l, m);\n apply(a, b, f, 2 * k + 1, m, r);\n dat[k] = op(dat[2 * k], dat[2 * k + 1]);\n }\n S prod(int a, int b, int k = 1, int l = 0, int r = -1) {\n eval(k);\n if (r == -1) r = sz;\n if (r <= a || b <= l) return e();\n if (a <= l && r <= b) return dat[k];\n int m = (l + r) >> 1;\n S vl = prod(a, b, 2 * k, l, m);\n S vr = prod(a, b, 2 * k + 1, m, r);\n return op(vl, vr);\n }\n};\nll modinv(int x, int modulo) {\n int a = x, b = modulo, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return (u >= 0 ? u % modulo : (modulo - (-u) % modulo) % modulo);\n}\ntemplate <class S, S (*op)(S, S), S (*e)()>\nstruct dual_segtree {\n int sz = 1, log = 0;\n vector<S> lz;\n dual_segtree(vector<S> a) {\n int n = a.size();\n while (sz < n) {\n sz <<= 1;\n log++;\n }\n lz.assign(sz << 1, e());\n for (int i = 0; i < n; i++) lz[i + sz] = a[i];\n }\n void push(int k) {\n int b = __builtin_ctz(k);\n for (int d = log; d > b; d--) {\n lz[k >> d << 1] = op(lz[k >> d << 1], lz[k >> d]);\n lz[k >> d << 1 | 1] = op(lz[k >> d << 1 | 1], lz[k >> d]);\n lz[k >> d] = e();\n }\n }\n void apply(int l, int r, S x) {\n l += sz, r += sz;\n push(l);\n push(r);\n while (l < r) {\n if (l & 1) {\n lz[l] = op(lz[l], x);\n l++;\n }\n if (r & 1) {\n r--;\n lz[r] = op(lz[r], x);\n }\n l >>= 1, r >>= 1;\n }\n }\n S get(int k) {\n k += sz;\n S res = e();\n while (k) {\n res = op(res, lz[k]);\n k >>= 1;\n }\n return res;\n }\n};\nstruct auxiliary_tree : lca_tree {\n vector<int> in;\n vector<vector<int>> G;\n auxiliary_tree(vector<vector<int>>& g) : lca_tree(g), in((int)g.size()), G((int)g.size()) {\n int t = 0;\n dfs(0, -1, t, g);\n }\n void dfs(int v, int p, int& t, vector<vector<int>>& g) {\n in[v] = t++;\n for (auto u : g[v]) {\n if (u != p) dfs(u, v, t, g);\n }\n }\n using lca_tree::depth;\n pair<int, vector<int>> query(vector<int> vs, bool decending = false) {\n // decending:親から子の方向のみ辺を貼る\n assert(!vs.empty());\n sort(vs.begin(), vs.end(), [&](int a, int b) { return in[a] < in[b]; });\n int m = vs.size();\n stack<int> st;\n st.push(vs[0]);\n for (int i = 0; i < m - 1; i++) {\n int w = lca_tree::query(vs[i], vs[i + 1]);\n if (w != vs[i]) {\n int l = st.top();\n st.pop();\n while (!st.empty() && depth[w] < depth[st.top()]) {\n if (!decending) G[l].push_back(st.top());\n G[st.top()].push_back(l);\n l = st.top();\n st.pop();\n }\n if (st.empty() || st.top() != w) {\n st.push(w);\n vs.push_back(w);\n }\n if (!decending) G[l].push_back(w);\n G[w].push_back(l);\n }\n st.push(vs[i + 1]);\n }\n while (st.size() > 1) {\n int x = st.top();\n st.pop();\n if (!decending) G[x].push_back(st.top());\n G[st.top()].push_back(x);\n }\n // {root,vertex_list}\n return make_pair(st.top(), vs);\n }\n void clear(vector<int> vs) {\n for (int v : vs) G[v].clear();\n }\n};\nvoid solve() {\n int n;\n cin >> n;\n vector<int> a(n);\n rep(i, n) {\n cin >> a[i];\n a[i]--;\n }\n vector<vector<int>> g(n);\n rep(i, n - 1) {\n int u, v;\n cin >> u >> v;\n u--, v--;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n auxiliary_tree aux_tree(g);\n vector<vector<int>> vec(n);\n rep(i, n) vec[a[i]].push_back(i);\n vector<int> dist(n), idx(n);\n vector<int> ans(n, INF);\n rep(color, n) {\n if (vec[color].empty()) continue;\n auto [root, vs] = aux_tree.query(vec[color]);\n using P = pair<int, int>;\n priority_queue<P, vector<P>, greater<P>> que;\n for (auto v : vs) dist[v] = n, idx[v] = -1;\n for (int s : vec[color]) dist[s] = 0, idx[s] = s, que.push({dist[s], s});\n while (!que.empty()) {\n auto [d, v] = que.top();\n que.pop();\n if (dist[v] != d) continue;\n for (auto u : aux_tree.G[v]) {\n int c = abs(aux_tree.depth[u] - aux_tree.depth[v]);\n if (chmin(dist[u], d + c)) {\n idx[u] = idx[v];\n que.push({dist[u], u});\n }\n }\n }\n for (int v : vs) {\n for (int u : aux_tree.G[v]) {\n if (idx[v] == idx[u]) continue;\n chmin(ans[idx[v]], aux_tree.dist(idx[v], idx[u]));\n chmin(ans[idx[u]], aux_tree.dist(idx[v], idx[u]));\n }\n }\n aux_tree.clear(vs);\n }\n rep(i, n) cout << ans[i] << endl;\n}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n solve();\n}", "accuracy": 1, "time_ms": 450, "memory_kb": 57996, "score_of_the_acc": -0.4813, "final_rank": 7 }, { "submission_id": "aoj_0439_8974984", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define all(v) v.begin(), v.end()\ntemplate <class T, class U>\ninline bool chmax(T& a, U b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T, class U>\ninline bool chmin(T& a, U b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\nconstexpr int INF = 1000000000;\nconstexpr int64_t llINF = 3000000000000000000;\nconstexpr double eps = 1e-10;\nconst double pi = acos(-1);\npair<vector<int>, vector<int>> calc_factor(int n) {\n vector<int> least_factor(n + 1, 0), prime_list;\n for (int i = 2; i <= n; i++) {\n if (least_factor[i] == 0) {\n least_factor[i] = i;\n prime_list.push_back(i);\n }\n for (int j = 0; j < (int)prime_list.size() && i * prime_list[j] <= n; j++) {\n least_factor[i * prime_list[j]] = prime_list[j];\n if (prime_list[j] == least_factor[i]) break;\n }\n }\n return make_pair(least_factor, prime_list);\n}\nll extgcd(ll a, ll b, ll& x, ll& y) {\n if (b == 0) {\n x = 1;\n y = 0;\n return a;\n }\n ll d = extgcd(b, a % b, y, x);\n y -= a / b * x;\n return d;\n}\nll modpow(ll a, ll b, ll m) {\n ll res = 1;\n while (b) {\n if (b & 1) {\n res *= a;\n res %= m;\n }\n a *= a;\n a %= m;\n b >>= 1;\n }\n return res;\n}\ntemplate <int modulo>\nstruct modint {\n int x;\n modint() : x(0) {}\n modint(int64_t y) : x(y >= 0 ? y % modulo : (modulo - (-y) % modulo) % modulo) {}\n modint& operator+=(const modint& p) {\n if ((x += p.x) >= modulo) x -= modulo;\n return *this;\n }\n modint& operator-=(const modint& p) {\n if ((x += modulo - p.x) >= modulo) x -= modulo;\n return *this;\n }\n modint& operator*=(const modint& p) {\n x = (int)(1LL * x * p.x % modulo);\n return *this;\n }\n modint& operator/=(const modint& p) {\n *this *= p.inv();\n return *this;\n }\n modint operator-() const { return modint(-x); }\n modint operator+(const modint& p) const { return modint(*this) += p; }\n modint operator-(const modint& p) const { return modint(*this) -= p; }\n modint operator*(const modint& p) const { return modint(*this) *= p; }\n modint operator/(const modint& p) const { return modint(*this) /= p; }\n bool operator==(const modint& p) const { return x == p.x; }\n bool operator!=(const modint& p) const { return x != p.x; }\n modint inv() const {\n int a = x, b = modulo, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return modint(u);\n }\n modint pow(int64_t n) const {\n modint ret(1), mul(x);\n while (n > 0) {\n if (n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n friend ostream& operator<<(ostream& os, const modint& p) { return os << p.x; }\n friend istream& operator>>(istream& is, modint& a) {\n int64_t t;\n is >> t;\n a = modint<modulo>(t);\n return (is);\n }\n int val() const { return x; }\n static constexpr int mod() { return modulo; }\n static constexpr int half() { return (modulo + 1) >> 1; }\n};\ntemplate <typename T>\nstruct Binomial {\n vector<T> inv, fact, factinv;\n Binomial(int n) {\n assert(n > 0);\n inv.resize(n + 1);\n fact.resize(n + 1);\n factinv.resize(n + 1);\n inv[0] = fact[0] = factinv[0] = 1;\n for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * i;\n factinv[n] = fact[n].inv();\n inv[n] = fact[n - 1] * factinv[n];\n for (int i = n - 1; i >= 1; i--) {\n factinv[i] = factinv[i + 1] * (i + 1);\n inv[i] = fact[i - 1] * factinv[i];\n }\n }\n T C(int n, int r) {\n if (n < 0 || n < r || r < 0) return 0;\n return fact[n] * factinv[n - r] * factinv[r];\n }\n T P(int n, int r) {\n if (n < 0 || n < r || r < 0) return 0;\n return fact[n] * factinv[n - r];\n }\n T H(int n, int r) {\n if (n == 0 && r == 0) return 1;\n if (n < 0 || r < 0) return 0;\n return r == 0 ? 1 : C(n + r - 1, r);\n }\n};\ntemplate <class S, S (*op)(S, S), S (*e)()>\nstruct segtree {\n int siz = 1;\n vector<S> dat;\n segtree(int n) : segtree(vector<S>(n, e())) {}\n segtree(const vector<S>& a) {\n while (siz < a.size()) siz <<= 1;\n dat = vector<S>(siz << 1, e());\n for (int i = 0; i < a.size(); i++) dat[siz + i] = a[i];\n for (int i = siz - 1; i >= 1; i--) dat[i] = op(dat[2 * i], dat[2 * i + 1]);\n }\n void set(int p, S x) {\n p += siz;\n dat[p] = x;\n while (p > 0) {\n p >>= 1;\n dat[p] = op(dat[2 * p], dat[2 * p + 1]);\n }\n }\n void add(int p, S x) { set(p, get(p) + x); }\n S get(int p) { return dat[p + siz]; }\n S prod(int l, int r) {\n S vl = e(), vr = e();\n l += siz, r += siz;\n while (l < r) {\n if (l & 1) vl = op(vl, dat[l++]);\n if (r & 1) vr = op(dat[--r], vr);\n l >>= 1, r >>= 1;\n }\n return op(vl, vr);\n }\n S all_prod() { return dat[1]; }\n};\n\ntemplate <class T>\nstruct BIT {\n // 1-indexed\n int n, beki = 1;\n vector<T> bit;\n BIT(int x) {\n bit.resize(x + 1, 0);\n n = x;\n while (beki * 2 <= n) beki *= 2;\n }\n T sum(int i) {\n T res = 0;\n while (i > 0) {\n res += bit[i];\n i -= i & -i;\n }\n return res;\n }\n T sum(int l, int r) {\n //[l,r]\n return sum(r) - (l == 0 ? 0 : sum(l - 1));\n }\n void add(int i, T x) {\n while (i <= n) {\n bit[i] += x;\n i += i & -i;\n }\n }\n int lowerbound(T w) {\n if (w <= 0) return 0;\n int x = 0;\n for (int k = beki; k > 0; k >>= 1) {\n if (x + k <= n && bit[x + k] < w) {\n w -= bit[x + k];\n x += k;\n }\n }\n return x + 1;\n }\n};\nusing mint = modint<998244353>;\ntemplate <class T, T (*op)(T, T), T (*e)()>\nstruct sparsetable {\n vector<vector<T>> table;\n vector<int> logtable;\n sparsetable(vector<T> v) {\n int len = 0;\n while ((1 << len) <= v.size()) len++;\n table.assign(len, vector<T>(1 << len));\n for (int i = 0; i < (int)v.size(); i++) table[0][i] = v[i];\n for (int i = 1; i < len; i++) {\n for (int j = 0; j + (1 << i) <= (1 << len); j++) {\n table[i][j] = op(table[i - 1][j], table[i - 1][j + (1 << (i - 1))]);\n }\n }\n logtable.resize(v.size() + 1);\n for (int i = 2; i < logtable.size(); i++) {\n logtable[i] = logtable[(i >> 1)] + 1;\n }\n }\n T query(int l, int r) {\n assert(l <= r);\n if (l == r) return e();\n int len = logtable[r - l];\n return op(table[len][l], table[len][r - (1 << len)]);\n }\n};\n\nstruct lca_tree {\n int n, size;\n vector<vector<int>> g, par;\n vector<int> depth;\n lca_tree(vector<vector<int>> g_, int root = 0)\n : n((int)g_.size()), size(log2(n) + 2), g(g_), par(size, vector<int>(n, -1)), depth(vector<int>(n, n)) {\n queue<int> que;\n depth[root] = 0;\n que.push(root);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n for (int i : g[p]) {\n if (depth[i] > depth[p] + 1) {\n depth[i] = depth[p] + 1;\n par[0][i] = p;\n que.push(i);\n }\n }\n }\n for (int k = 0; k < size - 1; k++) {\n for (int i = 0; i < n; i++) {\n if (par[k][i] == -1)\n par[k + 1][i] = -1;\n else\n par[k + 1][i] = par[k][par[k][i]];\n }\n }\n }\n int query(int u, int v) {\n if (depth[u] > depth[v]) swap(u, v);\n for (int k = size - 1; k >= 0; k--) {\n if (((depth[v] - depth[u]) >> k) & 1) v = par[k][v];\n if (u == v) return u;\n }\n for (int k = size - 1; k >= 0; k--) {\n if (par[k][u] != par[k][v]) {\n u = par[k][u];\n v = par[k][v];\n }\n }\n return par[0][u];\n }\n int dist(int u, int v) {\n int l = query(u, v);\n return depth[u] + depth[v] - 2 * depth[l];\n }\n int parent(int u, int d) {\n for (int k = size - 1; k >= 0; k--) {\n if ((d >> k) & 1) {\n if (u != -1) u = par[k][u];\n }\n }\n return u;\n }\n};\n\nstruct lca_tree_with_edge_ID {\n int n, size;\n vector<vector<pair<int, int>>> g;\n vector<vector<int>> par;\n vector<int> depth;\n lca_tree_with_edge_ID(vector<vector<pair<int, int>>> g_, int root = 0)\n : n((int)g_.size()), size(log2(n) + 2), g(g_), par(size, vector<int>(n, -1)), depth(vector<int>(n, n)) {\n queue<int> que;\n depth[root] = 0;\n que.push(root);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n for (auto [i, id] : g[p]) {\n if (depth[i] > depth[p] + 1) {\n depth[i] = depth[p] + 1;\n par[0][i] = p;\n que.push(i);\n }\n }\n }\n for (int k = 0; k < size - 1; k++) {\n for (int i = 0; i < n; i++) {\n if (par[k][i] == -1)\n par[k + 1][i] = -1;\n else\n par[k + 1][i] = par[k][par[k][i]];\n }\n }\n }\n int query(int u, int v) {\n if (depth[u] > depth[v]) swap(u, v);\n for (int k = size - 1; k >= 0; k--) {\n if (((depth[v] - depth[u]) >> k) & 1) v = par[k][v];\n if (u == v) return u;\n }\n for (int k = size - 1; k >= 0; k--) {\n if (par[k][u] != par[k][v]) {\n u = par[k][u];\n v = par[k][v];\n }\n }\n return par[0][u];\n }\n int dist(int u, int v) {\n int l = query(u, v);\n return depth[u] + depth[v] - 2 * depth[l];\n }\n};\n\nstruct UnionFind {\n vector<int> par, siz, es;\n UnionFind(int x) {\n par.resize(x);\n siz.resize(x);\n es.resize(x);\n for (int i = 0; i < x; i++) {\n par[i] = i;\n siz[i] = 1;\n es[i] = 0;\n }\n }\n int find(int x) {\n if (par[x] == x) return x;\n return par[x] = find(par[x]);\n }\n bool unite(int x, int y) {\n x = find(x), y = find(y);\n if (x == y) {\n es[x]++;\n return false;\n }\n if (siz[x] < siz[y]) swap(x, y);\n par[y] = x;\n siz[x] += siz[y];\n es[x] += es[y] + 1;\n return true;\n }\n bool same(int x, int y) { return find(x) == find(y); }\n int size(int x) { return siz[find(x)]; }\n int edges(int x) { return es[find(x)]; }\n};\nstruct Mo {\n int n;\n vector<pair<int, int>> lr;\n\n explicit Mo(int n) : n(n) {}\n\n void add(int l, int r) { /* [l, r) */\n lr.emplace_back(l, r);\n }\n\n template <typename AL, typename AR, typename EL, typename ER, typename O>\n void build(const AL& add_left, const AR& add_right, const EL& erase_left, const ER& erase_right, const O& out) {\n int q = (int)lr.size();\n int bs = n / min<int>(n, sqrt(q));\n vector<int> ord(q);\n iota(begin(ord), end(ord), 0);\n sort(begin(ord), end(ord), [&](int a, int b) {\n int ablock = lr[a].first / bs, bblock = lr[b].first / bs;\n if (ablock != bblock) return ablock < bblock;\n return (ablock & 1) ? lr[a].second > lr[b].second : lr[a].second < lr[b].second;\n });\n int l = 0, r = 0;\n for (auto idx : ord) {\n while (l > lr[idx].first) add_left(--l);\n while (r < lr[idx].second) add_right(r++);\n while (l < lr[idx].first) erase_left(l++);\n while (r > lr[idx].second) erase_right(--r);\n out(idx);\n }\n }\n\n template <typename A, typename E, typename O>\n void build(const A& add, const E& erase, const O& out) {\n build(add, add, erase, erase, out);\n }\n};\ntemplate <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S), F (*composition)(F, F), F (*id)()>\nstruct lazy_segtree {\n int _n, sz = 1;\n vector<S> dat;\n vector<F> lazy;\n lazy_segtree(vector<S> a) : _n(int(a.size())) {\n while (sz < _n) sz <<= 1;\n dat.resize(sz * 2, e());\n lazy.resize(sz * 2, id());\n rep(i, _n) dat[sz + i] = a[i];\n for (int i = sz - 1; i >= 1; i--) dat[i] = op(dat[2 * i], dat[2 * i + 1]);\n }\n void eval(int k) {\n dat[k] = mapping(lazy[k], dat[k]);\n if (k < sz) {\n lazy[k * 2] = composition(lazy[k], lazy[k * 2]);\n lazy[k * 2 + 1] = composition(lazy[k], lazy[k * 2 + 1]);\n }\n lazy[k] = id();\n }\n void apply(int a, int b, F f, int k = 1, int l = 0, int r = -1) {\n eval(k);\n if (r == -1) r = sz;\n if (r <= a || b <= l) return;\n if (a <= l && r <= b) {\n lazy[k] = composition(f, lazy[k]);\n eval(k);\n return;\n }\n int m = (l + r) >> 1;\n apply(a, b, f, 2 * k, l, m);\n apply(a, b, f, 2 * k + 1, m, r);\n dat[k] = op(dat[2 * k], dat[2 * k + 1]);\n }\n S prod(int a, int b, int k = 1, int l = 0, int r = -1) {\n eval(k);\n if (r == -1) r = sz;\n if (r <= a || b <= l) return e();\n if (a <= l && r <= b) return dat[k];\n int m = (l + r) >> 1;\n S vl = prod(a, b, 2 * k, l, m);\n S vr = prod(a, b, 2 * k + 1, m, r);\n return op(vl, vr);\n }\n};\nll modinv(int x, int modulo) {\n int a = x, b = modulo, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return (u >= 0 ? u % modulo : (modulo - (-u) % modulo) % modulo);\n}\ntemplate <class S, S (*op)(S, S), S (*e)()>\nstruct dual_segtree {\n int sz = 1, log = 0;\n vector<S> lz;\n dual_segtree(vector<S> a) {\n int n = a.size();\n while (sz < n) {\n sz <<= 1;\n log++;\n }\n lz.assign(sz << 1, e());\n for (int i = 0; i < n; i++) lz[i + sz] = a[i];\n }\n void push(int k) {\n int b = __builtin_ctz(k);\n for (int d = log; d > b; d--) {\n lz[k >> d << 1] = op(lz[k >> d << 1], lz[k >> d]);\n lz[k >> d << 1 | 1] = op(lz[k >> d << 1 | 1], lz[k >> d]);\n lz[k >> d] = e();\n }\n }\n void apply(int l, int r, S x) {\n l += sz, r += sz;\n push(l);\n push(r);\n while (l < r) {\n if (l & 1) {\n lz[l] = op(lz[l], x);\n l++;\n }\n if (r & 1) {\n r--;\n lz[r] = op(lz[r], x);\n }\n l >>= 1, r >>= 1;\n }\n }\n S get(int k) {\n k += sz;\n S res = e();\n while (k) {\n res = op(res, lz[k]);\n k >>= 1;\n }\n return res;\n }\n};\nstruct auxiliary_tree : lca_tree {\n vector<int> in;\n vector<vector<int>> G;\n auxiliary_tree(vector<vector<int>> g) : lca_tree(g), in((int)g.size()), G((int)g.size()) {\n int t = 0;\n dfs(0, -1, t);\n }\n void dfs(int v, int p, int& t) {\n in[v] = t++;\n for (auto u : lca_tree::g[v]) {\n if (u != p) dfs(u, v, t);\n }\n }\n using lca_tree::depth;\n pair<int, vector<int>> query(vector<int> vs, bool decending = false) {\n // decending:親から子の方向のみ辺を貼る\n assert(!vs.empty());\n sort(vs.begin(), vs.end(), [&](int a, int b) { return in[a] < in[b]; });\n int m = vs.size();\n stack<int> st;\n st.push(vs[0]);\n for (int i = 0; i < m - 1; i++) {\n int w = lca_tree::query(vs[i], vs[i + 1]);\n if (w != vs[i]) {\n int l = st.top();\n st.pop();\n while (!st.empty() && depth[w] < depth[st.top()]) {\n if (!decending) G[l].push_back(st.top());\n G[st.top()].push_back(l);\n l = st.top();\n st.pop();\n }\n if (st.empty() || st.top() != w) {\n st.push(w);\n vs.push_back(w);\n }\n if (!decending) G[l].push_back(w);\n G[w].push_back(l);\n }\n st.push(vs[i + 1]);\n }\n while (st.size() > 1) {\n int x = st.top();\n st.pop();\n if (!decending) G[x].push_back(st.top());\n G[st.top()].push_back(x);\n }\n // {root,vertex_list}\n return make_pair(st.top(), vs);\n }\n void clear(vector<int> vs) {\n for (int v : vs) G[v].clear();\n }\n};\nvoid solve() {\n int n;\n cin >> n;\n vector<int> a(n);\n rep(i, n) {\n cin >> a[i];\n a[i]--;\n }\n vector<vector<int>> g(n);\n rep(i, n - 1) {\n int u, v;\n cin >> u >> v;\n u--, v--;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n auxiliary_tree aux_tree(g);\n vector<vector<int>> vec(n);\n rep(i, n) vec[a[i]].push_back(i);\n vector<int> dist(n), idx(n);\n vector<int> ans(n, INF);\n rep(color, n) {\n if (vec[color].empty()) continue;\n auto [root, vs] = aux_tree.query(vec[color]);\n using P = pair<int, int>;\n priority_queue<P, vector<P>, greater<P>> que;\n for (auto v : vs) dist[v] = n, idx[v] = -1;\n for (int s : vec[color]) dist[s] = 0, idx[s] = s, que.push({dist[s], s});\n while (!que.empty()) {\n auto [d, v] = que.top();\n que.pop();\n if (dist[v] != d) continue;\n for (auto u : aux_tree.G[v]) {\n int c = abs(aux_tree.depth[u] - aux_tree.depth[v]);\n if (chmin(dist[u], d + c)) {\n idx[u] = idx[v];\n que.push({dist[u], u});\n }\n }\n }\n for (int v : vs) {\n for (int u : aux_tree.G[v]) {\n if (idx[v] == idx[u]) continue;\n chmin(ans[idx[v]], aux_tree.dist(idx[v], idx[u]));\n chmin(ans[idx[u]], aux_tree.dist(idx[v], idx[u]));\n }\n }\n aux_tree.clear(vs);\n }\n rep(i, n) cout << ans[i] << endl;\n}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n solve();\n}", "accuracy": 1, "time_ms": 480, "memory_kb": 67392, "score_of_the_acc": -0.6006, "final_rank": 10 }, { "submission_id": "aoj_0439_8974938", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define all(v) v.begin(), v.end()\ntemplate <class T, class U>\ninline bool chmax(T& a, U b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T, class U>\ninline bool chmin(T& a, U b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\nconstexpr int INF = 1000000000;\nconstexpr int64_t llINF = 3000000000000000000;\nconstexpr double eps = 1e-10;\nconst double pi = acos(-1);\npair<vector<int>, vector<int>> calc_factor(int n) {\n vector<int> least_factor(n + 1, 0), prime_list;\n for (int i = 2; i <= n; i++) {\n if (least_factor[i] == 0) {\n least_factor[i] = i;\n prime_list.push_back(i);\n }\n for (int j = 0; j < (int)prime_list.size() && i * prime_list[j] <= n; j++) {\n least_factor[i * prime_list[j]] = prime_list[j];\n if (prime_list[j] == least_factor[i]) break;\n }\n }\n return make_pair(least_factor, prime_list);\n}\nll extgcd(ll a, ll b, ll& x, ll& y) {\n if (b == 0) {\n x = 1;\n y = 0;\n return a;\n }\n ll d = extgcd(b, a % b, y, x);\n y -= a / b * x;\n return d;\n}\nll modpow(ll a, ll b, ll m) {\n ll res = 1;\n while (b) {\n if (b & 1) {\n res *= a;\n res %= m;\n }\n a *= a;\n a %= m;\n b >>= 1;\n }\n return res;\n}\ntemplate <int modulo>\nstruct modint {\n int x;\n modint() : x(0) {}\n modint(int64_t y) : x(y >= 0 ? y % modulo : (modulo - (-y) % modulo) % modulo) {}\n modint& operator+=(const modint& p) {\n if ((x += p.x) >= modulo) x -= modulo;\n return *this;\n }\n modint& operator-=(const modint& p) {\n if ((x += modulo - p.x) >= modulo) x -= modulo;\n return *this;\n }\n modint& operator*=(const modint& p) {\n x = (int)(1LL * x * p.x % modulo);\n return *this;\n }\n modint& operator/=(const modint& p) {\n *this *= p.inv();\n return *this;\n }\n modint operator-() const { return modint(-x); }\n modint operator+(const modint& p) const { return modint(*this) += p; }\n modint operator-(const modint& p) const { return modint(*this) -= p; }\n modint operator*(const modint& p) const { return modint(*this) *= p; }\n modint operator/(const modint& p) const { return modint(*this) /= p; }\n bool operator==(const modint& p) const { return x == p.x; }\n bool operator!=(const modint& p) const { return x != p.x; }\n modint inv() const {\n int a = x, b = modulo, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return modint(u);\n }\n modint pow(int64_t n) const {\n modint ret(1), mul(x);\n while (n > 0) {\n if (n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n friend ostream& operator<<(ostream& os, const modint& p) { return os << p.x; }\n friend istream& operator>>(istream& is, modint& a) {\n int64_t t;\n is >> t;\n a = modint<modulo>(t);\n return (is);\n }\n int val() const { return x; }\n static constexpr int mod() { return modulo; }\n static constexpr int half() { return (modulo + 1) >> 1; }\n};\ntemplate <typename T>\nstruct Binomial {\n vector<T> inv, fact, factinv;\n Binomial(int n) {\n assert(n > 0);\n inv.resize(n + 1);\n fact.resize(n + 1);\n factinv.resize(n + 1);\n inv[0] = fact[0] = factinv[0] = 1;\n for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * i;\n factinv[n] = fact[n].inv();\n inv[n] = fact[n - 1] * factinv[n];\n for (int i = n - 1; i >= 1; i--) {\n factinv[i] = factinv[i + 1] * (i + 1);\n inv[i] = fact[i - 1] * factinv[i];\n }\n }\n T C(int n, int r) {\n if (n < 0 || n < r || r < 0) return 0;\n return fact[n] * factinv[n - r] * factinv[r];\n }\n T P(int n, int r) {\n if (n < 0 || n < r || r < 0) return 0;\n return fact[n] * factinv[n - r];\n }\n T H(int n, int r) {\n if (n == 0 && r == 0) return 1;\n if (n < 0 || r < 0) return 0;\n return r == 0 ? 1 : C(n + r - 1, r);\n }\n};\ntemplate <class S, S (*op)(S, S), S (*e)()>\nstruct segtree {\n int siz = 1;\n vector<S> dat;\n segtree(int n) : segtree(vector<S>(n, e())) {}\n segtree(const vector<S>& a) {\n while (siz < a.size()) siz <<= 1;\n dat = vector<S>(siz << 1, e());\n for (int i = 0; i < a.size(); i++) dat[siz + i] = a[i];\n for (int i = siz - 1; i >= 1; i--) dat[i] = op(dat[2 * i], dat[2 * i + 1]);\n }\n void set(int p, S x) {\n p += siz;\n dat[p] = x;\n while (p > 0) {\n p >>= 1;\n dat[p] = op(dat[2 * p], dat[2 * p + 1]);\n }\n }\n void add(int p, S x) { set(p, get(p) + x); }\n S get(int p) { return dat[p + siz]; }\n S prod(int l, int r) {\n S vl = e(), vr = e();\n l += siz, r += siz;\n while (l < r) {\n if (l & 1) vl = op(vl, dat[l++]);\n if (r & 1) vr = op(dat[--r], vr);\n l >>= 1, r >>= 1;\n }\n return op(vl, vr);\n }\n S all_prod() { return dat[1]; }\n};\n\ntemplate <class T>\nstruct BIT {\n // 1-indexed\n int n, beki = 1;\n vector<T> bit;\n BIT(int x) {\n bit.resize(x + 1, 0);\n n = x;\n while (beki * 2 <= n) beki *= 2;\n }\n T sum(int i) {\n T res = 0;\n while (i > 0) {\n res += bit[i];\n i -= i & -i;\n }\n return res;\n }\n T sum(int l, int r) {\n //[l,r]\n return sum(r) - (l == 0 ? 0 : sum(l - 1));\n }\n void add(int i, T x) {\n while (i <= n) {\n bit[i] += x;\n i += i & -i;\n }\n }\n int lowerbound(T w) {\n if (w <= 0) return 0;\n int x = 0;\n for (int k = beki; k > 0; k >>= 1) {\n if (x + k <= n && bit[x + k] < w) {\n w -= bit[x + k];\n x += k;\n }\n }\n return x + 1;\n }\n};\nusing mint = modint<998244353>;\ntemplate <class T, T (*op)(T, T), T (*e)()>\nstruct sparsetable {\n vector<vector<T>> table;\n vector<int> logtable;\n sparsetable(vector<T> v) {\n int len = 0;\n while ((1 << len) <= v.size()) len++;\n table.assign(len, vector<T>(1 << len));\n for (int i = 0; i < (int)v.size(); i++) table[0][i] = v[i];\n for (int i = 1; i < len; i++) {\n for (int j = 0; j + (1 << i) <= (1 << len); j++) {\n table[i][j] = op(table[i - 1][j], table[i - 1][j + (1 << (i - 1))]);\n }\n }\n logtable.resize(v.size() + 1);\n for (int i = 2; i < logtable.size(); i++) {\n logtable[i] = logtable[(i >> 1)] + 1;\n }\n }\n T query(int l, int r) {\n assert(l <= r);\n if (l == r) return e();\n int len = logtable[r - l];\n return op(table[len][l], table[len][r - (1 << len)]);\n }\n};\n\nstruct lca_tree {\n int n, size;\n vector<vector<int>> g, par;\n vector<int> depth;\n lca_tree(vector<vector<int>> g_, int root = 0)\n : n((int)g_.size()), size(log2(n) + 2), g(g_), par(size, vector<int>(n, -1)), depth(vector<int>(n, n)) {\n queue<int> que;\n depth[root] = 0;\n que.push(root);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n for (int i : g[p]) {\n if (depth[i] > depth[p] + 1) {\n depth[i] = depth[p] + 1;\n par[0][i] = p;\n que.push(i);\n }\n }\n }\n for (int k = 0; k < size - 1; k++) {\n for (int i = 0; i < n; i++) {\n if (par[k][i] == -1)\n par[k + 1][i] = -1;\n else\n par[k + 1][i] = par[k][par[k][i]];\n }\n }\n }\n int query(int u, int v) {\n if (depth[u] > depth[v]) swap(u, v);\n for (int k = size - 1; k >= 0; k--) {\n if (((depth[v] - depth[u]) >> k) & 1) v = par[k][v];\n if (u == v) return u;\n }\n for (int k = size - 1; k >= 0; k--) {\n if (par[k][u] != par[k][v]) {\n u = par[k][u];\n v = par[k][v];\n }\n }\n return par[0][u];\n }\n int dist(int u, int v) {\n int l = query(u, v);\n return depth[u] + depth[v] - 2 * depth[l];\n }\n int parent(int u, int d) {\n for (int k = size - 1; k >= 0; k--) {\n if ((d >> k) & 1) {\n if (u != -1) u = par[k][u];\n }\n }\n return u;\n }\n};\n\nstruct lca_tree_with_edge_ID {\n int n, size;\n vector<vector<pair<int, int>>> g;\n vector<vector<int>> par;\n vector<int> depth;\n lca_tree_with_edge_ID(vector<vector<pair<int, int>>> g_, int root = 0)\n : n((int)g_.size()), size(log2(n) + 2), g(g_), par(size, vector<int>(n, -1)), depth(vector<int>(n, n)) {\n queue<int> que;\n depth[root] = 0;\n que.push(root);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n for (auto [i, id] : g[p]) {\n if (depth[i] > depth[p] + 1) {\n depth[i] = depth[p] + 1;\n par[0][i] = p;\n que.push(i);\n }\n }\n }\n for (int k = 0; k < size - 1; k++) {\n for (int i = 0; i < n; i++) {\n if (par[k][i] == -1)\n par[k + 1][i] = -1;\n else\n par[k + 1][i] = par[k][par[k][i]];\n }\n }\n }\n int query(int u, int v) {\n if (depth[u] > depth[v]) swap(u, v);\n for (int k = size - 1; k >= 0; k--) {\n if (((depth[v] - depth[u]) >> k) & 1) v = par[k][v];\n if (u == v) return u;\n }\n for (int k = size - 1; k >= 0; k--) {\n if (par[k][u] != par[k][v]) {\n u = par[k][u];\n v = par[k][v];\n }\n }\n return par[0][u];\n }\n int dist(int u, int v) {\n int l = query(u, v);\n return depth[u] + depth[v] - 2 * depth[l];\n }\n};\n\nstruct UnionFind {\n vector<int> par, siz, es;\n UnionFind(int x) {\n par.resize(x);\n siz.resize(x);\n es.resize(x);\n for (int i = 0; i < x; i++) {\n par[i] = i;\n siz[i] = 1;\n es[i] = 0;\n }\n }\n int find(int x) {\n if (par[x] == x) return x;\n return par[x] = find(par[x]);\n }\n bool unite(int x, int y) {\n x = find(x), y = find(y);\n if (x == y) {\n es[x]++;\n return false;\n }\n if (siz[x] < siz[y]) swap(x, y);\n par[y] = x;\n siz[x] += siz[y];\n es[x] += es[y] + 1;\n return true;\n }\n bool same(int x, int y) { return find(x) == find(y); }\n int size(int x) { return siz[find(x)]; }\n int edges(int x) { return es[find(x)]; }\n};\nstruct Mo {\n int n;\n vector<pair<int, int>> lr;\n\n explicit Mo(int n) : n(n) {}\n\n void add(int l, int r) { /* [l, r) */\n lr.emplace_back(l, r);\n }\n\n template <typename AL, typename AR, typename EL, typename ER, typename O>\n void build(const AL& add_left, const AR& add_right, const EL& erase_left, const ER& erase_right, const O& out) {\n int q = (int)lr.size();\n int bs = n / min<int>(n, sqrt(q));\n vector<int> ord(q);\n iota(begin(ord), end(ord), 0);\n sort(begin(ord), end(ord), [&](int a, int b) {\n int ablock = lr[a].first / bs, bblock = lr[b].first / bs;\n if (ablock != bblock) return ablock < bblock;\n return (ablock & 1) ? lr[a].second > lr[b].second : lr[a].second < lr[b].second;\n });\n int l = 0, r = 0;\n for (auto idx : ord) {\n while (l > lr[idx].first) add_left(--l);\n while (r < lr[idx].second) add_right(r++);\n while (l < lr[idx].first) erase_left(l++);\n while (r > lr[idx].second) erase_right(--r);\n out(idx);\n }\n }\n\n template <typename A, typename E, typename O>\n void build(const A& add, const E& erase, const O& out) {\n build(add, add, erase, erase, out);\n }\n};\ntemplate <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S), F (*composition)(F, F), F (*id)()>\nstruct lazy_segtree {\n int _n, sz = 1;\n vector<S> dat;\n vector<F> lazy;\n lazy_segtree(vector<S> a) : _n(int(a.size())) {\n while (sz < _n) sz <<= 1;\n dat.resize(sz * 2, e());\n lazy.resize(sz * 2, id());\n rep(i, _n) dat[sz + i] = a[i];\n for (int i = sz - 1; i >= 1; i--) dat[i] = op(dat[2 * i], dat[2 * i + 1]);\n }\n void eval(int k) {\n dat[k] = mapping(lazy[k], dat[k]);\n if (k < sz) {\n lazy[k * 2] = composition(lazy[k], lazy[k * 2]);\n lazy[k * 2 + 1] = composition(lazy[k], lazy[k * 2 + 1]);\n }\n lazy[k] = id();\n }\n void apply(int a, int b, F f, int k = 1, int l = 0, int r = -1) {\n eval(k);\n if (r == -1) r = sz;\n if (r <= a || b <= l) return;\n if (a <= l && r <= b) {\n lazy[k] = composition(f, lazy[k]);\n eval(k);\n return;\n }\n int m = (l + r) >> 1;\n apply(a, b, f, 2 * k, l, m);\n apply(a, b, f, 2 * k + 1, m, r);\n dat[k] = op(dat[2 * k], dat[2 * k + 1]);\n }\n S prod(int a, int b, int k = 1, int l = 0, int r = -1) {\n eval(k);\n if (r == -1) r = sz;\n if (r <= a || b <= l) return e();\n if (a <= l && r <= b) return dat[k];\n int m = (l + r) >> 1;\n S vl = prod(a, b, 2 * k, l, m);\n S vr = prod(a, b, 2 * k + 1, m, r);\n return op(vl, vr);\n }\n};\nll modinv(int x, int modulo) {\n int a = x, b = modulo, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return (u >= 0 ? u % modulo : (modulo - (-u) % modulo) % modulo);\n}\ntemplate <class S, S (*op)(S, S), S (*e)()>\nstruct dual_segtree {\n int sz = 1, log = 0;\n vector<S> lz;\n dual_segtree(vector<S> a) {\n int n = a.size();\n while (sz < n) {\n sz <<= 1;\n log++;\n }\n lz.assign(sz << 1, e());\n for (int i = 0; i < n; i++) lz[i + sz] = a[i];\n }\n void push(int k) {\n int b = __builtin_ctz(k);\n for (int d = log; d > b; d--) {\n lz[k >> d << 1] = op(lz[k >> d << 1], lz[k >> d]);\n lz[k >> d << 1 | 1] = op(lz[k >> d << 1 | 1], lz[k >> d]);\n lz[k >> d] = e();\n }\n }\n void apply(int l, int r, S x) {\n l += sz, r += sz;\n push(l);\n push(r);\n while (l < r) {\n if (l & 1) {\n lz[l] = op(lz[l], x);\n l++;\n }\n if (r & 1) {\n r--;\n lz[r] = op(lz[r], x);\n }\n l >>= 1, r >>= 1;\n }\n }\n S get(int k) {\n k += sz;\n S res = e();\n while (k) {\n res = op(res, lz[k]);\n k >>= 1;\n }\n return res;\n }\n};\npair<int, vector<pair<int, int>>> aux_tree(vector<int> vs, vector<vector<int>>& g, lca_tree& lt, vector<int>& in) {\n assert(!vs.empty());\n sort(vs.begin(), vs.end(), [&](int a, int b) { return in[a] < in[b]; });\n int m = vs.size();\n stack<int> st;\n st.push(vs[0]);\n vector<pair<int, int>> res;\n for (int i = 0; i < m - 1; i++) {\n int w = lt.query(vs[i], vs[i + 1]);\n if (w != vs[i]) {\n int l = st.top();\n st.pop();\n while (!st.empty() && lt.depth[w] < lt.depth[st.top()]) {\n res.push_back({l, st.top()});\n l = st.top();\n st.pop();\n }\n if (st.empty() || st.top() != w) {\n st.push(w);\n }\n res.push_back({l, w});\n }\n st.push(vs[i + 1]);\n }\n while (st.size() > 1) {\n int x = st.top();\n st.pop();\n res.push_back({x, st.top()});\n }\n for (auto [ver, par] : res) {\n assert(lt.depth[ver] > lt.depth[par]);\n }\n //{root,{{vertex,parent,},...}}\n return make_pair(st.top(), res);\n}\nvoid solve() {\n int n;\n cin >> n;\n vector<int> a(n);\n rep(i, n) {\n cin >> a[i];\n a[i]--;\n }\n vector<vector<int>> g(n);\n rep(i, n - 1) {\n int u, v;\n cin >> u >> v;\n u--, v--;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n vector<int> in(n);\n int t = 0;\n function<void(int, int)> dfs = [&](int v, int p) {\n in[v] = t++;\n for (auto u : g[v]) {\n if (u != p) dfs(u, v);\n }\n };\n dfs(0, -1);\n\n lca_tree lt(g);\n vector<vector<int>> vec(n);\n rep(i, n) vec[a[i]].push_back(i);\n vector<int> dist(n), idx(n);\n vector<vector<int>> G(n);\n vector<int> ans(n, INF);\n rep(color, n) {\n if (vec[color].empty()) continue;\n auto [root, vs] = aux_tree(vec[color], g, lt, in);\n using P = pair<int, int>;\n priority_queue<P, vector<P>, greater<P>> que;\n dist[root] = n, idx[root] = -1;\n for (auto [v, par] : vs) {\n dist[v] = n, idx[v] = -1;\n G[v].push_back(par);\n G[par].push_back(v);\n }\n for (int s : vec[color]) dist[s] = 0, idx[s] = s, que.push({dist[s], s});\n while (!que.empty()) {\n auto [d, v] = que.top();\n que.pop();\n if (dist[v] != d) continue;\n for (auto u : G[v]) {\n int c = abs(lt.depth[u] - lt.depth[v]);\n if (chmin(dist[u], d + c)) {\n idx[u] = idx[v];\n que.push({dist[u], u});\n }\n }\n }\n for (auto [v, par] : vs) {\n G[v].pop_back();\n G[par].pop_back();\n }\n for (auto [v, par] : vs) {\n int u = par;\n if (idx[v] == idx[u]) continue;\n // if (color == 2) cout << idx[v] << \" \" << idx[u] << \" \" << lt.dist(idx[u], idx[v]) << endl;\n chmin(ans[idx[v]], lt.dist(idx[v], idx[u]));\n chmin(ans[idx[u]], lt.dist(idx[v], idx[u]));\n }\n }\n\n rep(i, n) cout << ans[i] << endl;\n}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n solve();\n}", "accuracy": 1, "time_ms": 430, "memory_kb": 67308, "score_of_the_acc": -0.5694, "final_rank": 9 } ]
aoj_0444_cpp
Slot Machines Aizu Industry has developed a new slot machine. This slot machine displays $W$ numbers horizontally and $H$ numbers vertically from 0 to 9. An example of the numbers displayed where $W=5$ and $H=3$ is shown in Figure 1. Figure 1: Example of numbers displayed on a slot machine ($W=5, H=3$) In this slot machine, you get points according to the numbers displayed. The score is calculated as follows: when a specific same number appears in all the rows from column 1 to column $W$ (regardless of whether the rows match), you can get the score (that number) by connecting the numbers with a line to form a single broken line. If you can make multiple lines with different shapes, the sum of the scores of all the lines will be the score you get from the slot machine. If you can't make a single broken line, your score will be zero. Let's consider the scores obtained by the numbers displayed in Figure 1 in Figure 2. Figure 2: Example of calculating the score of a slot machine In the example of Figure 1, since 3 appears in every row, a polyline can be formed by connecting 3. The score for each line is 3 points, so the total score for the slot machine is 6 points. Write a program that reads the numbers shown in the slot machine and finds the score obtained. Input The input is given in the following format. $W$ $H$ $row_1$ $row_2$ : $row_H$ In the first row, the number of numbers in the horizontal direction $W$ ($1 \leq W \leq 1,000$), and the number of numbers in the vertical direction $H$ ($1 \leq H \leq 1,000$) are given. In the following $H$ rows, the $row_i$ of $W$ numbers to be displayed in row $i$ are given, where $row_i$ is a sequence of numbers from 0 to 9 with length $W$. Output Output the obtained score in a line. Print the remainder divided by 998,244,353. Sample Input and Output Sample Input 1 5 3 03077 50333 35743 Sample Output 1 6 Sample Input 2 4 4 3351 5335 3573 7350 Sample Output 2 28 In Sample Input 2, there are 6 lines in which 3 appears in any column, and 2 lines in which 5 appears in any column. Therefore, the score is 3 x 6 + 5 x 2 = 28. Sample Input 3 12 5 999999999999 999999999999 999999999999 999999999999 999999999999 Sample Output 3 200776919
[ { "submission_id": "aoj_0444_10958156", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n int h, w;\n cin >> w >> h;\n vector<string> s(h);\n for (auto &i : s) cin >> i;\n vector<vector<long long>> c(w, vector<long long>(10, 0));\n vector<vector<long long>> dp(w, vector<long long>(10, 0));\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n c[j][s[i][j] - '0']++;\n }\n }\n for (int i = 0; i < 10; i++) dp[0][i] = c[0][i];\n for (int i = 1; i < w; i++) {\n for (int j = 0; j < 10; j++) {\n dp[i][j] = (c[i][j] * dp[i - 1][j]) % 998244353;\n }\n }\n long long ans = 0;\n for (int i = 0; i < 10; i++) {\n ans += dp[w - 1][i] * i;\n ans %= 998244353;\n }\n cout << ans << \"\\n\";\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5516, "score_of_the_acc": -0.3962, "final_rank": 9 }, { "submission_id": "aoj_0444_10906760", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n\tint W, H;cin>>W>>H;\n\tvector<string> row(H);\n\tvector<vector<ll>> nums(W, vector<ll>(10, 0));//[w][9]\n\tfor(int i = 0;i<H;i++) cin >> row[i];\n\t\n\tvector<ll> sums(10, 1);\n\tfor(int j =0;j<W;j++){\n\t\n\t\tfor(int i = 0;i<H;i++){\n\t\t\tint index =(row[i][j]-'0');\n\t\t\t//cout << i <<\", \"<<j<<\", \"<<index<<endl;\n\t\t\tnums[j][index]++;\n\t\t\t\n\t\t}\n\t}\n//\tfor(int i=0;i<10;i++){\n//\t\tfor(int j=0;j<W;j++){\n//\t\t\tcout << nums[j][i] <<\" \";\n//\t\t}\n//\t\tcout <<endl;\n//\t}\n\t\n\tfor(int a = 1;a<10;a++){\n\t//sums[a] = 得点aについて得られる折れ線の数\n\t//nums[i][j] = i列目にあるjの数\n\t\tfor(int i = 0;i<W;i++){\n\t\t\tsums[a]=(sums[a] % 998244353) * (nums[i][a] %998244353);\n\t//\t\tif(0<sums[a]&&0<nums[i][a])\n\t//\t\tcout << a<<\": \"<<sums[a] <<\"*\" << nums[i][a] << endl;\n\t\t}\n\t}\n\tll ans = 0;\n\tfor(ll i = 0;i<10;i++){\n\tans+=(i*sums[i]%998244353);\n\t}\n\tcout<<ans%998244353<<endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5632, "score_of_the_acc": -0.4152, "final_rank": 11 }, { "submission_id": "aoj_0444_10899836", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std; \n/*#include <atcoder/all>\nusing namespace atcoder;\nusing mint = modint;*/\n//long long型=int64_tという認識で大丈夫です。\n//#define int long long\n#define ll long long\n#define ull unsigned long long\n#define vec vector\n#define vi vector<int>\n#define vll vector<ll>\n#define pq priority_queue\n#define pb push_back\n#define rep(i, l, r) for(ll i=(ll)(l); i<(ll)(r); i++)\n#define ld long double\n\nconst ll INF = 2e9;\nconst ll inf = 5e18;\nconst ld ep = 1e-15;\n\nstruct Edge {\n int to;\n ll cost;\n};\n\nstruct SEdge {\n int to;\n pair<ll, ll> cost;\n};\n\ntemplate<class T>\nusing spq = priority_queue<T, vec<T>, greater<T>>; \n\nconst vector<ll> di = {-1, 0, 1, 0}, dj = {0, -1, 0, 1};\n\ntemplate<class T>\nbool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T>\nbool chmax(T& a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T, class U> \nistream &operator>>(istream &is, pair<T, U> &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate<class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\ntemplate <class T>\nistream &operator>>(istream &is, vector<T> &v) {\n for(auto &x : v) {\n is >> x;\n }\n return is;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n for(int i = 0; i < (int)v.size(); i++) {\n if(i != (int)v.size() - 1)\n os << v[i] << \" \";\n else\n os << v[i];\n }\n return os;\n}\n\ntemplate <class T>\nbool jf(pair<T, T> a, pair<T, T> b) {\n if(a.second > b.second) return false;\n else return true;\n}\n\nusing S = ll;\n\nS op(S a, S b){ return max(a, b); }\nS e(){ return 0;}\n\nsigned main(){\n int h, w; cin >> w >> h;\n vec<string> s(h); rep(i, 0, h) cin >> s[i];\n vec<vi> dp(w, vi(h, -1)); vi cnt(10, 0); rep(i, 0, h) cnt[(int)(s[i][0] - '0')]++;\n rep(i, 1, w) {\n vi ncnt(10);\n rep(j, 0, h) {\n ncnt[(int)(s[j][i] - '0')] += cnt[(int)(s[j][i] - '0')];\n ncnt[(int)(s[j][i] - '0')] %= 998244353;\n }\n cnt = ncnt;\n }\n int ans = 0;\n rep(i, 0, 10) {\n rep(j, 0, i) {\n ans += cnt[i];\n ans %= 998244353;\n }\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 9204, "score_of_the_acc": -1, "final_rank": 15 }, { "submission_id": "aoj_0444_10859274", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nint main()\n{\n vector<ll> v[10];\n map<char,ll> mp;\n ll w,h,ss,ans=0,sum=1;\n cin>>w>>h;\n string s[1001];\n for(int i=0;i<h;i++){\n cin>>s[i];\n }\n for(int i=0;i<w;i++){\n for(int j=0;j<h;j++){\n mp[s[j][i]]++;\n }\n for(auto x:mp){\n ss=x.first-'0';\n v[ss].push_back(x.second);\n }\n mp.clear();\n }\n for(int i=0;i<10;i++){\n if(v[i].size()==w){\n for(int j=0;j<v[i].size();j++){\n sum*=v[i][j];\n sum=sum%998244353;\n }\n ans+=i*sum%998244353;\n sum=1;\n }\n }\n cout<<ans%998244353<<endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 5376, "score_of_the_acc": -1.0399, "final_rank": 19 }, { "submission_id": "aoj_0444_10859222", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n long long w,h,c=0,g=0; cin>>w>>h;\n int b[10*w]={},d[w*h]={}; char a[w*h];\n for(int i=0;i<h*w;i++){\n cin>>a[i];\n d[i]=a[i]-'0';\n }\n for(int i=0;i<w;i++){\n for(int j=0;j<h;j++){\n b[d[i+(w*j)]+(i*10)]++;\n }\n }\n for(int i=0;i<10;i++){\n for(int j=0;j<w;j++){\n if(j==0)c=b[i+(j*10)]%998244353;\n else c=c*b[i+(j*10)]%998244353;\n // cout<<b[i+(j*10)]%998244353;\n }\n g+=c*i;\n // cout<<\" \"<<g;\n // cout<<endl;\n c=0;\n }\n cout<<g%998244353<<endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 8140, "score_of_the_acc": -1.1591, "final_rank": 20 }, { "submission_id": "aoj_0444_10857039", "code_snippet": "#include<bits/stdc++.h>\n#include <vector>\nusing namespace std;\ntypedef pair<int,int>P;\nchar s[1001][1001];\nlong long w,h,sm,sum,cnt,a[1001][11],b;\nint main(void)\n{\n\tcin>>w>>h;\n\tfor(int i=1;i<=h;i++){\n\t\tfor(int j=1;j<=w;j++){\n\t\t\tcin>>s[i][j];\n\t\t}\n\t}\n\tfor(int i=1;i<=w;i++){\n\t\tfor(int j=1;j<=h;j++){\n\t\t\tb=s[j][i]-'0';\n\t\t\ta[i][b]++;\t\n\t\t}\n\t}\n\tfor(int i=1;i<=9;i++){\n\t\tsm=1;\n\t\tfor(int j=1;j<=w;j++){\n\t\t\tsm*=a[j][i];\n\t\t\tsm=sm%998244353;\n\t\t\t//cout<<a[j][i]<<endl;\n\t\t}\n\t\tsm*=i;\n\t\tsm=sm%998244353;\n\t\tsum+=sm;\n\t\tsum=sum%998244353;\n\t}\n\tcout<<sum<<endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4404, "score_of_the_acc": -0.5475, "final_rank": 12 }, { "submission_id": "aoj_0444_9710348", "code_snippet": "#include<iostream>\n#include<vector>\n#include<string>\nusing namespace std;\nint main()\n{\n int h,w;\n cin >> w >> h;\n vector<vector<int>>grid(h,vector<int>(w));\n for(int i=0;i<h;i++){\n string s;\n cin >> s;\n for(int j=0;j<w;j++)grid[i][j]=(s[j]-'0');\n }\n long long mod=998244353,ans=0;\n for(int num=1;num<=9;num++){\n long long count=1;\n for(int i=0;i<w;i++){\n int cnt=0;\n for(int j=0;j<h;j++)if(grid[j][i]==num)cnt++;\n count*=cnt;\n count%=mod;\n }\n ans+=count*num;\n ans%=mod;\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 7316, "score_of_the_acc": -1.0242, "final_rank": 18 }, { "submission_id": "aoj_0444_9520875", "code_snippet": "#include <bits/stdc++.h>\n\nconst int MOD{998244353};\n\nint main() {\n int W, H;\n std::cin >> W >> H;\n std::vector cnt(10, std::vector<int>(W));\n for (int i{} ; i < H ; i++) {\n for (int j{} ; j < W ; j++) {\n char c;\n std::cin >> c;\n cnt[c - '0'][j]++;\n }\n }\n long long ans{};\n for (int i{} ; i < 10 ; i++) {\n long long num{1};\n for (int j{} ; j < W ; j++) {\n num *= cnt[i][j];\n num %= MOD;\n }\n ans += (long long)i * num;\n ans %= MOD;\n }\n std::cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3488, "score_of_the_acc": -0.3975, "final_rank": 10 }, { "submission_id": "aoj_0444_8826789", "code_snippet": "#include <bits/stdc++.h>\n\nint main() {\n int h, w;\n std::cin >> w >> h;\n std::vector<std::string> s(h);\n for (int i = 0; i < h; i++) std::cin >> s[i];\n constexpr int W = 10;\n using Table = std::array<int, W>;\n std::vector<Table> freq(w);\n for (int i = 0; i < w; i++) freq[i].fill(0);\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n freq[j][s[i][j] - '0']++;\n }\n }\n // for (int i = 0; i < w; i++) {\n // for (int j = 0; j < W; j++) {\n // std::cerr << freq[i][j] << ' ';\n // }\n // std::cerr << std::endl;\n // }\n\n constexpr long long MOD = 998244353;\n long long ans = 0;\n for (int i = 0; i < W; i++) {\n long long now = i;\n for (int j = 0; j < w; j++) {\n now *= freq[j][i];\n now %= MOD;\n }\n ans += now;\n ans %= MOD;\n }\n std::cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5404, "score_of_the_acc": -0.3779, "final_rank": 7 }, { "submission_id": "aoj_0444_8472596", "code_snippet": "#include <iostream>\nusing namespace std;\nint main(void){\n // Your code here!\n \n char row;\n int cnt[10][1000];\n int W, H;\n long int SuM = 0, SuM2;\n cin >> W >> H;\n for(int i = 0; i < 10; i++)\n {\n for(int j = 0; j < 1000; j++)\n cnt[i][j] = 0;\n }\n for(int i = 0; i < H; i++)\n {\n for(int j = 0; j < W; j++)\n {\n cin >> row;\n row -= 48;\n cnt[(int)row][j]++;\n }\n }\n for(int i = 1; i < 10; i++)\n {\n SuM2 = 1;\n for(int j = 0; j < W; j++)\n {\n if(cnt[i][j] == 0)\n {\n SuM2 = 0;\n break;\n }\n SuM2 *= cnt[i][j];\n SuM2 %= 998244353;\n }\n SuM += SuM2 * i;\n SuM %= 998244353;\n }\n cout << SuM << endl;\n \n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3096, "score_of_the_acc": -1, "final_rank": 15 }, { "submission_id": "aoj_0444_8464817", "code_snippet": "#include <bits/stdc++.h>\n\n#define int long long\nusing namespace std;\n\nsigned main(){\n\tint w, h;cin >> w >> h;\n\tvector<vector<int>> A(w, vector<int>(10,0));\n\tfor (int i = 0; i < h; ++i){\n\t\tstring s;cin >> s;\n\t\tfor (int j = 0; j < w; ++j){\n\t\t\tA[j][(int)s[j] - 48] ++;\n\t\t}\n\t}\n\tint ans = 0;\n\tfor (int i = 1; i < 10; ++ i){\n\t\tint c = 1;\n\t\tfor (int j = 0; j < w; ++j){\n\t\t\tc *= A[j][i];\n\t\t\tc %= 998244353;\n\t\t}\n\t\tans += c * i;\n\t\tans %= 998244353;\n\t}\n\tcout << ans % 998244353 << endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3544, "score_of_the_acc": -0.0733, "final_rank": 3 }, { "submission_id": "aoj_0444_8443896", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n int MAX = 998244353;\n int w,h;\n cin >> w >> h;\n vector<vector<int>> vec(w,vector<int>(h));\n vector<long long> record(10);\n for(int i = 0; i < 10; i++) record[i] = i;\n for(int i = 0; i < h; i++){\n for(int j = 0; j < w; j++){\n char c;\n cin >> c;\n vec[j][i] = (int)c - 48;\n }\n }\n \n for(auto v : vec){\n vector<int> count(10);\n \n for(auto i : v){\n count[i]++;\n }\n \n for(int i = 0; i < 10; i++){\n record[i] = (record[i] % MAX) * (count[i] % MAX) % MAX;\n }\n }\n long long sum = 0;\n for(int i = 0; i < 10; i++) sum = (sum % MAX + record[i] % MAX) % MAX;\n \n cout << sum << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 7288, "score_of_the_acc": -1.0196, "final_rank": 17 }, { "submission_id": "aoj_0444_8378255", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tlong long w,h,mod = 998244353;\n\tcin >> w >> h;\n\tvector<vector<char>> s(h,vector<char>(w));\n\tvector<vector<long long>> cou(w,vector<long long>(11,0));\n\tfor(long long i = 0;i < h;i++){\n\t\tstring S;\n\t\tcin >> S;\n\t\tfor(long long j = 0;j < w;j++){\n\t\t\ts[i][j] = S[j];\n\t\t}\n\t}\n\tfor(long long j = 0;j < w;j++){\n\t\tfor(long long i = 0;i < h;i++){\n\t\t\tcou[j][s[i][j] - '0'] += 1ll;\n\t\t}\n\t}\n\tlong long ans = 0;\n\tlong long it = 1ll;\n\tfor(long long i = 1ll;i <= 9ll;i++){\n\t\tit = i;\n\t\tfor(long long j = 0;j < w;j++){\n\t\t\tit *= cou[j][i];\n\t\t\tit %= mod;\n\t\t}\n\t\twhile(it < 0) it += mod;\n\t\tans += it;\n\t\tans %= mod;\n\t}\n\tans %= mod;\n\twhile(ans < 0) ans += mod;\n\tcout << ans << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4544, "score_of_the_acc": -0.2371, "final_rank": 4 }, { "submission_id": "aoj_0444_8232985", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\n#define INF INT64_MAX;\nint main()\n{\n int h,w;\n LL sum=1,ans=0;\n cin>>w>>h;\n vector<string> g(h+2);\n for(int i=0;i<h;i++) cin>>g[i];\n for(int st=1;st<10;st++){\n //cout<<\"st=\"<<st<<endl;\n LL sum=1,cnt=0;\n for(int j=0;j<w;j++){\n cnt=0;\n for(int i=0;i<h;i++){\n //cout<<g[i][j]-'0'<<endl;\n if((g[i][j]-'0')==st) cnt++;//cout<<\"cnt=\"<<cnt<<endl;\n }\n sum=(sum*cnt)%998244353;\n //cout<<\"sum=\"<<sum<<endl;\n }\n //cout<<\"sum=\"<<sum<<endl;\n ans=(ans+sum*st)%998244353;\n }\n cout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3896, "score_of_the_acc": -0.7976, "final_rank": 13 }, { "submission_id": "aoj_0444_8140796", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\n#define INF INT64_MAX;\nint main()\n{\n int h,w;\n LL sum=1,ans=0;\n cin>>w>>h;\n vector<string> g(h+2);\n for(int i=0;i<h;i++) cin>>g[i];\n for(int st=1;st<10;st++){\n //cout<<\"st=\"<<st<<endl;\n LL sum=1,cnt=0;\n for(int j=0;j<w;j++){\n cnt=0;\n for(int i=0;i<h;i++){\n //cout<<g[i][j]-'0'<<endl;\n if((g[i][j]-'0')==st) cnt++;//cout<<\"cnt=\"<<cnt<<endl;\n }\n sum=(sum*cnt)%998244353;\n //cout<<\"sum=\"<<sum<<endl;\n }\n //cout<<\"sum=\"<<sum<<endl;\n ans=(ans+sum*st)%998244353;\n }\n cout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3968, "score_of_the_acc": -0.8094, "final_rank": 14 }, { "submission_id": "aoj_0444_7074806", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n\nint ctoi(char c) {\n\tif (c >= '0' && c <= '9') {\n\t\treturn c - '0';\n\t}\n\treturn 0;\n}\n\nint main()\n{\n int w,h; cin>>w>>h;\n int cnt[w][10];\n for(int i=0; i<w; i++)\n {\n for(int t=0; t<10; t++)\n {\n cnt[i][t]=0;\n }\n }\n for(int i=0; i<h; i++)\n {\n string s;\n cin>>s;\n for(int t=0; t<w; t++)\n {\n //sはstring\n int h=(s[t]-'0');\n cnt[t][h]++;\n }\n }\n\n ll ans=0;\n for(int i=0; i<10; i++)\n {\n ll now=1;\n for(int t=0; t<w; t++)\n {\n now*=(ll)cnt[t][i];\n now%=998244353;\n }\n now*=i;\n ans+=now;\n ans%=998244353;\n }\n cout<<ans<<endl;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3436, "score_of_the_acc": -0.0557, "final_rank": 1 }, { "submission_id": "aoj_0444_7073899", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define vi vector<int>\nusing namespace std;\nusing ll = long long;\nconstexpr int mod = 998244353;\n\nint main(){\n\tint h,w;\n\tcin >> w >> h;\n\tint cnt[w][10] = {};\n\trep(i, h){\n\t\trep(j, w){\n\t\t\tchar c; cin >> c;\n\t\t\tcnt[j][c - '0']++;\n\t\t}\n\t}\n\tll ans = 0;\n\tfor(int i = 1; i < 10; i++){\n\t\tll val = 1;\n\t\trep(j, w) (val *= cnt[j][i]) %= mod;\n\t\tans += (val * i) % mod;\n\t\tans %= mod;\n\t}\n\tcout << ans << \"\\n\";\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3372, "score_of_the_acc": -0.3785, "final_rank": 8 }, { "submission_id": "aoj_0444_7062291", "code_snippet": "#include <iostream>\n#include <string>\n#include <string.h>\nusing namespace std;\nconst long long int m1=998244353; \nlong long int as[1002][10];\nint main() {\n\t// your code goes here\n\tint w,h;\n\tcin>>w>>h;\n\tstring s1;\n\tmemset(as,0,sizeof(as));\n\tfor(int i=0;i<=9;i++)as[0][i]=1;\n\t\n\tfor(int i=0;i<h;i++){\n\t\t\n\t\tcin>>s1;\n\t\tfor(int j=1;j<=w;j++){\n\t\t\tint t=s1[j-1]-'0';\n\t\t\tas[j][t]++;\n\t\t}\n\t}\n\tlong long int ans=0;\n\tfor(int i=1;i<=w;i++){\n\t\tfor(int j=1;j<=9;j++){\n\t\t\tas[i][j]=(as[i][j]*as[i-1][j])%m1;\n\t\t\tif(i==w)ans=(ans+(j*as[i][j])%m1)%m1;\n\t\t}\n\t}\n\tcout<<ans<<endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3280, "score_of_the_acc": -0.3635, "final_rank": 5 }, { "submission_id": "aoj_0444_7053521", "code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define lol long long\n#define INF INT_MAX\n#define P pair<int,int>\n#define Pci pair<char,int>\n#define Pll pair<lol,lol>\n#define fi first\n#define se second\n#define mp(f,s) make_pair(f,s)\n\n// const int mod = (1e9) + 7;\nconst int mod = 998244353;\n\nint dx[] = {1,0,-1,0};\nint dy[] = {0,1,0,-1};\n\nint main(){\n int w,h;\n cin>>w>>h;\n\n // vec[i][j] : 列iでjが何回現れるか\n vector<vector<int>> vec(w,vector<int>(10,0));\n \n string str;\n for(int i=0;i<h;i++){\n cin>>str;\n for(int j=0;j<w;j++){\n vec[j][str[j]-'0']++;\n vec[j][str[j]-'0']%=mod;\n }\n }\n\n vector<lol> ans(10,1);\n\n for(int i=0;i<w;i++){\n for(int j=0;j<10;j++){\n ans[j] *= vec[i][j] % mod;\n ans[j] %= mod;\n }\n }\n\n lol a = 0;\n for(int i=0;i<10;i++){\n a += (ans[i]%mod * i)%mod; \n }\n cout<<a%mod<<\"\\n\";\n return(0);\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3440, "score_of_the_acc": -0.0563, "final_rank": 2 }, { "submission_id": "aoj_0444_7052807", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long;\nconst lint mod = 998244353;\n#define rep(i, n) for(int i = 0; i < int(n); i++)\n#define rep2(i, l, r) for(int i = int(l); i < int(r); i++)\n#define repr(i, n) for(int i = int(n) - 1; i >= 0; i--)\n#define repr2(i, l, r) for(int i = int(r) - 1; i >= int(l); i--)\n\nint main(){\n int w, h;\n cin >> w >> h;\n string s[h];\n rep(i, h){\n cin >> s[i];\n }\n \n int cnt[w][10];\n rep(i, w) rep(j, 10) cnt[i][j] = 0;\n \n rep(i, h) rep(j, w){\n int num = s[i][j] - '0';\n cnt[j][num]++;\n }\n \n lint ans = 0;\n rep(i, 10){\n lint res = 1;\n rep(j, w){\n res = (res * cnt[j][i]) % mod;\n }\n \n ans += res * i;\n }\n \n cout << ans % mod << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5320, "score_of_the_acc": -0.3641, "final_rank": 6 } ]
aoj_0445_cpp
Hanbunko Twin siblings, Yae and Joe, received a rice cracker as a snack from their mother. The rice cracker is shaped like a convex polygon and has slits on all the diagonals to make it easier to break. They want to split the rice cracker into two pieces, but since they are not strong enough, they can only do so by clamping their hands on both sides of one of the diagonals. They started to think about which diagonal line they should divide the rice cracker into two so that it would be closest to Hanbunko and the difference between their shares would be the smallest. Wreate a program which reads the information about the shape of the rice cracker represented by the convex polygon and finds the smallest difference between the two people's shares. The difference between two people's shares is expressed as the absolute value of the difference in their areas when the rice cracker is divided into two along one diagonal line. Input The input is given in the following form. $N$ $x_1$ $y_1$ $x_2$ $y_2$ : $x_N$ $y_N$ The first line gives the number of vertices of the convex polygon $N$ ($4 \leq N \leq 60,000$). In the following $N$ lines, the coordinates $x_i$, $y_i$ ($0 \leq x_i,y_i \leq 100,000,000$) of the vertices of the convex polygon are given as integers. The vertices of the convex polygon are given in such an order that the adjacent vertices are visited in a counterclockwise direction. Output Output the minimum difference between the two shares as a real number in a line. The error must not exceed plus or minus 0.0001. Sample Input and Output Sample Input 1 4 0 0 1 0 1 1 0 1 Sample Output 1 0.0 Sample Input 2 4 0 0 1 0 1 2 0 1 Sample Output 2 0.5000
[ { "submission_id": "aoj_0445_11014143", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nint main(){\n\tint N;\n\tcin>>N;\n\tll x[N*2+1],y[N*2+1];\n\tfor(int i=1;i<=N;i++){\n\t\tcin>>x[i]>>y[i];\n\t\tx[i+N]=x[i];\n\t\ty[i+N]=y[i];\n\t}\n\tll all=0;\n\tfor(int i=2;i<N;i++){\n\t\tll a1=x[i]-x[1],a2=y[i]-y[1];\n\t\tll b1=x[i+1]-x[1],b2=y[i+1]-y[1];\n\t\tall+=abs(a1*b2-a2*b1);\n\t}\n\tint place=2;\n\tll ans=2e18;\n\tll now=0;\n\tfor(int i=1;i<=N;i++){\n\t\twhile(true){\n\t\t\tif(now*2>all){\n\t\t\t\tans=min(ans,abs(all-now*2));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tll a1=x[place]-x[i],a2=y[place]-y[i];\n\t\t\tll b1=x[place+1]-x[i],b2=y[place+1]-y[i];\n\t\t\tnow+=abs(a1*b2-a2*b1);\n\t\t\tif(now*2>all){\n\t\t\t\tans=min(ans,abs(all-now*2));\n\t\t\t\tnow-=abs(a1*b2-a2*b1);\n\t\t\t\tans=min(ans,abs(all-now*2));\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tplace++;\n\t\t}\n\t\tll A1=x[i+1]-x[i],A2=y[i+1]-y[i],B1=x[place]-x[i],B2=y[place]-y[i];\n\t\tnow-=abs(A1*B2-A2*B1);\n\t}\n\tlong double answer=ans;\n\tanswer/=2;\n\tcout<<fixed<<setprecision(15)<<answer<<endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 5392, "score_of_the_acc": -0.5583, "final_rank": 10 }, { "submission_id": "aoj_0445_10958222", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing Point = complex<long double>;\nlong double cross(Point x, Point y) { return x.real() * y.imag() - x.imag() * y.real(); }\nint main() {\n int n;\n cin >> n;\n vector<Point> p(n);\n for (int i = 0; i < n; i++) {\n long double x, y;\n cin >> x >> y;\n p[i] = {x, y};\n }\n // 全体の面積を求めておく\n long double s = 0;\n for (int i = 1; i < n - 1; i++) {\n // p[i+1]-p[i]とp[0]-p[i]の面積\n s += abs(cross(p[i + 1] - p[i], p[0] - p[i])) / 2.0;\n }\n // 尺取り法\n long double ans = 1e50;\n int l = 0, r = 0;\n long double x = 0, y = s;\n while (true) {\n // 面積が小さいならrを増やす\n if (x < y) {\n if (r == n - 1) break;\n // l,r,(r+1)の三角形の面積を求める\n long double a = abs(cross(p[r] - p[l], p[r + 1] - p[l])) / 2;\n x += a;\n y -= a;\n r++;\n ans = min(ans, abs(x - y));\n }\n // 面積が大きいならlを増やす\n else {\n // l,(l+1),rの三角形の面積を求める\n long double a = abs(cross(p[l] - p[r], p[l + 1] - p[r])) / 2;\n x -= a;\n y += a;\n l++;\n ans = min(ans, abs(x - y));\n }\n }\n printf(\"%.4Lf\\n\", ans);\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 4956, "score_of_the_acc": -0.8334, "final_rank": 13 }, { "submission_id": "aoj_0445_10958217", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing Point = complex<double>;\ndouble cross(Point x, Point y) { return x.real() * y.imag() - x.imag() * y.real(); }\nint main() {\n int n;\n cin >> n;\n vector<Point> p(n);\n for (int i = 0; i < n; i++) {\n double x, y;\n cin >> x >> y;\n p[i] = {x, y};\n }\n // 全体の面積を求めておく\n double s = 0;\n for (int i = 1; i < n - 1; i++) {\n // p[i+1]-p[i]とp[0]-p[i]の面積\n s += abs(cross(p[i + 1] - p[i], p[0] - p[i])) / 2.0;\n }\n // 尺取り法\n double ans = 1e50;\n int l = 0, r = 0;\n double x = 0, y = s;\n while (true) {\n // 面積が小さいならrを増やす\n if (x < y) {\n if (r == n - 1) break;\n // l,r,(r+1)の三角形の面積を求める\n double a = abs(cross(p[r] - p[l], p[r + 1] - p[l])) / 2;\n x += a;\n y -= a;\n r++;\n ans = min(ans, abs(x - y));\n }\n // 面積が大きいならlを増やす\n else {\n // l,(l+1),rの三角形の面積を求める\n double a = abs(cross(p[l] - p[r], p[l + 1] - p[r])) / 2;\n x -= a;\n y += a;\n l++;\n ans = min(ans, abs(x - y));\n }\n }\n printf(\"%.4lf\\n\", ans);\n}", "accuracy": 0.6666666666666666, "time_ms": 30, "memory_kb": 3708, "score_of_the_acc": -0.6667, "final_rank": 17 }, { "submission_id": "aoj_0445_10899873", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std; \n/*#include <atcoder/all>\nusing namespace atcoder;\nusing mint = modint;*/\n//long long型=int64_tという認識で大丈夫です。\n//#define int long long\n#define ll long long\n#define ull unsigned long long\n#define vec vector\n#define vi vector<int>\n#define vll vector<ll>\n#define pq priority_queue\n#define pb push_back\n#define rep(i, l, r) for(ll i=(ll)(l); i<(ll)(r); i++)\n#define ld long double\n\nconst ll INF = 2e9;\nconst ll inf = 5e18;\nconst ld ep = 1e-15;\n\nstruct Edge {\n int to;\n ll cost;\n};\n\nstruct SEdge {\n int to;\n pair<ll, ll> cost;\n};\n\ntemplate<class T>\nusing spq = priority_queue<T, vec<T>, greater<T>>; \n\nconst vector<ll> di = {-1, 0, 1, 0}, dj = {0, -1, 0, 1};\n\ntemplate<class T>\nbool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T>\nbool chmax(T& a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T, class U> \nistream &operator>>(istream &is, pair<T, U> &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate<class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\ntemplate <class T>\nistream &operator>>(istream &is, vector<T> &v) {\n for(auto &x : v) {\n is >> x;\n }\n return is;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n for(int i = 0; i < (int)v.size(); i++) {\n if(i != (int)v.size() - 1)\n os << v[i] << \" \";\n else\n os << v[i];\n }\n return os;\n}\n\ntemplate <class T>\nbool jf(pair<T, T> a, pair<T, T> b) {\n if(a.second > b.second) return false;\n else return true;\n}\n\nusing S = ll;\n\nS op(S a, S b){ return max(a, b); }\nS e(){ return 0;}\n\nld tri(ld x1, ld y1, ld x2, ld y2, ld x3, ld y3) {\n return abs((x1 - x3) * (y2 - y3) - (x2 - x3) * (y1 - y3)) / 2;\n}\n\nsigned main(){\n int n; cin >> n;\n vec<ld> x(n), y(n); rep(i, 0, n) cin >> x[i] >> y[i];\n /*rep(i, 1, n) {x[i] -= x[0], y[i] -= y[0];}\n x[0] = 0, y[0] = 0;*/\n vec<ld> z(n + 1); z[0] = 0; z[1] = 0;\n rep(i, 1, n - 1) {\n z[i + 1] = z[i] + tri(x[i], y[i], x[i + 1], y[i + 1], x[0], y[0]);\n }\n z[n] = z[n - 1];\n int pos = 1;\n ld ans = inf;\n ld cnt = 0;\n rep(i, 0, n) {\n rep(j, pos, 2 * n) {\n if(cnt + tri(x[i], y[i], x[(j - 1) % n], y[(j - 1) % n], x[j % n], y[j % n]) > z[n] / 2) {\n pos = j;\n break;\n }\n cnt += tri(x[i], y[i], x[(j - 1) % n], y[(j - 1) % n], x[j % n], y[j % n]);\n if(j == 2 * n - 1) {\n pos = 2 * n;\n break;\n }\n }\n chmin(ans, z[n] - 2 * cnt);\n cnt -= tri(x[i], y[i], x[(i + 1) % n], y[(i + 1) % n], x[(pos - 1) % n], y[(pos - 1) % n]);\n }\n cout << fixed << setprecision(15) << ans << endl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 5936, "score_of_the_acc": -1.2977, "final_rank": 14 }, { "submission_id": "aoj_0445_9813074", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\nsigned main(){\n int n;\n cin >> n;\n deque<pair<int,int>> a(n);\n for(int i = 0;i < n;i++){\n cin >> a[i].first >> a[i].second;\n }\n auto c = [&](int t,int b,int c){\n pair<int,int> x,y; \n x = {a[b].first - a[t].first,a[b].second - a[t].second};\n y = {a[c].first - a[t].first,a[c].second - a[t].second};\n return abs(x.first * y.second - x.second * y.first);\n };\n long double ans = 1000000000000000000;\n long double sum = 0;\n for(int i = 2;i < n;i++){\n sum += c(0,i - 1,i);\n }\n int now = 1;\n long double it = sum / 2;\n long double cou = 0;\n for(int i = 0;i < n - 1;i++){\n while(now + 1 < n && cou + c(i,now,now + 1) <= it){\n cou += c(i,now,now + 1);\n now++;\n }\n ans = min(ans,abs(cou - (sum - cou)));\n if(now + 1 < n){\n int p = cou + c(i,now,now + 1);\n ans = min(ans,abs(p - (sum - p)));\n }\n cou -= c(i,i + 1,now);\n }\n cout << fixed << setprecision(2) << (long double)ans / (long double)2.0 << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4420, "score_of_the_acc": -0.4285, "final_rank": 9 }, { "submission_id": "aoj_0445_8510773", "code_snippet": "#line 1 \"0445.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/0445\"\n#define ERROR 0.0001\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/TypeAlias.hpp\"\n\n#include <cstdint>\n#include <cstddef>\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#include <iostream>\n#include <iomanip>\n\nnamespace zawa {\n\nvoid SetFastIO() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n}\n\nvoid SetPrecision(u32 dig) {\n std::cout << std::fixed << std::setprecision(dig);\n}\n\n} // namespace zawa\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/GeometryZ2/Polygon.hpp\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/GeometryZ2/Point.hpp\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/GeometryZ2/Zahlen.hpp\"\n\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/GeometryZ2/Zahlen.hpp\"\n\n#include <cassert>\n\nnamespace zawa {\n\nnamespace geometryZ2 {\n\nusing Zahlen = i64;\n\nnamespace internal {\n\nconstexpr i32 positive{1};\nconstexpr i32 zero{0};\nconstexpr i32 negative{-1};\n\n} // namespace internal\n\nconstexpr i32 Sign(Zahlen value) {\n if (value < 0) return internal::negative;\n if (value > 0) return internal::positive;\n return internal::zero;\n}\n\nconstexpr bool Positive(Zahlen value) {\n return Sign(value) == internal::positive;\n}\n\nconstexpr bool Zero(Zahlen value) {\n return Sign(value) == internal::zero;\n}\n\nconstexpr bool Negative(Zahlen value) {\n return Sign(value) == internal::negative;\n}\n\nconstexpr Zahlen Abs(Zahlen value) {\n return (value > 0 ? value : -value);\n}\n\nconstexpr Zahlen Square(Zahlen value) {\n return value * value;\n}\n\n} // namespace geometryZ2\n\n} // namespace zawa\n#line 5 \"/home/zawatin/compro/cp-documentation/Src/GeometryZ2/Point.hpp\"\n\n#line 8 \"/home/zawatin/compro/cp-documentation/Src/GeometryZ2/Point.hpp\"\n\nnamespace zawa {\n\nnamespace geometryZ2 {\n\nclass Point {\nprivate:\n Zahlen x_{}, y_{};\n static constexpr u32 origin{0};\n static constexpr u32 firstQuadrant{1};\n static constexpr u32 secondQuadrant{1};\n static constexpr u32 thirdQuadrant{1};\n static constexpr u32 forthQuadrant{1};\n\n u32 area() const {\n if (x_ == 0 and y_ == 0) return origin;\n if (x_ > 0 and y_ >= 0) return firstQuadrant;\n if (x_ <= 0 and y_ > 0) return secondQuadrant;\n if (x_ < 0 and y_ <= 0) return thirdQuadrant;\n return forthQuadrant;\n }\npublic:\n /* constructor */\n Point() = default;\n Point(const Point& p) : x_{p.x()}, y_{p.y()} {}\n Point(Zahlen x, Zahlen y) : x_{x}, y_{y} {}\n\n /* getter setter */\n Zahlen& x() {\n return x_;\n }\n const Zahlen& x() const {\n return x_;\n }\n Zahlen& y() {\n return y_;\n }\n const Zahlen& y() const {\n return y_;\n }\n\n /* operator */\n Point& operator=(const Point& p) {\n x() = p.x();\n y() = p.y();\n return *this;\n }\n Point& operator+=(const Point& p) {\n x() += p.x();\n y() += p.y();\n return *this;\n }\n friend Point operator+(const Point& p0, const Point& p1) {\n return Point{p0} += p1;\n }\n Point& operator-=(const Point& p) {\n x() -= p.x();\n y() -= p.y();\n return *this;\n }\n friend Point operator-(const Point& p0, const Point& p1) {\n return Point{p0} -= p1;\n }\n Point& operator*=(Zahlen k) {\n x() *= k;\n y() *= k;\n return *this;\n }\n friend Point operator*(const Point& p, Zahlen k) {\n return Point{p} *= k;\n }\n friend Point operator*(Zahlen k, const Point& p) {\n return Point{p} *= k;\n }\n Point& operator/=(Zahlen k) {\n assert(k);\n assert(x() % k == 0);\n assert(y() % k == 0);\n x() /= k;\n y() /= k;\n return *this;\n }\n friend Point operator/(const Point& p, Zahlen k) {\n return Point{p} /= k;\n }\n friend bool operator==(const Point& p0, const Point& p1) {\n return p0.x() == p1.x() and p0.y() == p1.y();\n }\n friend bool operator!=(const Point& p0, const Point& p1) {\n return p0.x() != p1.x() or p0.y() != p1.y();\n }\n friend bool operator<(const Point& p0, const Point& p1) {\n if (p0.x() != p1.x()) return p0.x() < p1.x();\n else return p0.y() < p1.y();\n }\n friend bool operator<=(const Point& p0, const Point& p1) {\n return (p0 < p1) or (p0 == p1);\n }\n friend bool operator>(const Point& p0, const Point& p1) {\n if (p0.x() != p1.x()) return p0.x() > p1.x();\n else return p0.y() > p1.y();\n }\n friend bool operator>=(const Point& p0, const Point& p1) {\n return (p0 > p1) or (p0 == p1);\n }\n friend std::istream& operator>>(std::istream& is, Point& p) {\n is >> p.x() >> p.y();\n return is;\n }\n friend std::ostream& operator<<(std::ostream& os, const Point& p) {\n os << '(' << p.x() << ',' << p.y() << ')';\n return os;\n }\n\n /* member function */\n Zahlen normSquare() const {\n return Square(x()) + Square(y());\n }\n\n /* friend function */\n friend Zahlen Dot(const Point& p0, const Point& p1) {\n return p0.x() * p1.x() + p0.y() * p1.y();\n }\n friend Zahlen Cross(const Point& p0, const Point& p1) {\n return p0.x() * p1.y() - p0.y() * p1.x();\n }\n friend bool ArgComp(const Point& p0, const Point& p1) {\n if (p0.area() != p1.area()) return p0.area() < p1.area();\n Zahlen cross{Cross(p0, p1)};\n return (!Zero(cross) ? Positive(cross) : p0.normSquare() < p1.normSquare());\n }\n};\nusing Vector = Point;\n\n} // namespace geometryZ2\n\n} // namespace zawa\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/GeometryZ2/Relation.hpp\"\n\n#line 5 \"/home/zawatin/compro/cp-documentation/Src/GeometryZ2/Relation.hpp\"\n\nnamespace zawa {\n\nnamespace geometryZ2 {\n\nenum RELATION {\n // p0 -> p1 -> p2の順で直線上に並んでいる\n ONLINE_FRONT = -2,\n // (p1 - p0) -> (p2 - p0)が時計回りになっている\n CLOCKWISE = -1,\n // p0 -> p2 -> p1の順で直線上に並んでいる\n ON_SEGMENT = 0,\n // (p1 - p0) -> (p2 - p0)が反時計回りになっている\n COUNTER_CLOCKWISE = +1,\n // p2 -> p0 -> p1、またはp1 -> p0 -> p2の順で直線上に並んでいる\n ONLINE_BACK = +2\n};\n\nRELATION Relation(const Point& p0, const Point& p1, const Point& p2) {\n Point a{p1 - p0}, b{p2 - p0};\n if (Positive(Cross(a, b))) return COUNTER_CLOCKWISE;\n if (Negative(Cross(a, b))) return CLOCKWISE;\n if (Negative(Dot(a, b))) return ONLINE_BACK;\n if (a.normSquare() < b.normSquare()) return ONLINE_FRONT;\n return ON_SEGMENT;\n};\n\n} // namespace geometryZ2\n\n} // namespace zawa\n#line 6 \"/home/zawatin/compro/cp-documentation/Src/GeometryZ2/Polygon.hpp\"\n\n#include <algorithm>\n#line 9 \"/home/zawatin/compro/cp-documentation/Src/GeometryZ2/Polygon.hpp\"\n#include <iterator>\n#include <vector>\n\nnamespace zawa {\n\nnamespace geometryZ2 {\n\nclass Polygon {\nprivate:\n std::vector<Point> data_;\npublic:\n usize size() const {\n return data_.size(); \n }\n\n /* constructor */\n Polygon() = default;\n Polygon(const Polygon& polygon) : data_{polygon.data_} {}\n Polygon(const std::vector<Point>& data) : data_{data} {}\n Polygon(usize n) : data_{n} {\n assert(n >= static_cast<usize>(3));\n }\n\n /* operator */\n Polygon& operator=(const Polygon& polygon) {\n data_ = polygon.data_;\n return *this;\n }\n Point& operator[](usize i) {\n assert(i < size());\n return data_[i];\n }\n const Point& operator[](usize i) const {\n assert(i < size());\n return data_[i];\n }\n friend std::istream& operator>>(std::istream& is, Polygon& polygon) {\n for (size_t i{} ; i < polygon.size() ; i++) {\n is >> polygon[i];\n }\n return is;\n }\n friend std::ostream& operator<<(std::ostream& os, const Polygon& polygon) {\n for (usize i{} ; i < polygon.size() ; i++) {\n std::cout << polygon[i] << (i + 1 == polygon.size() ? \"\" : \" \");\n }\n return os;\n }\n\n /* member function */\n void pushBack(const Point& p) {\n data_.push_back(p);\n }\n void emplaceBack(Zahlen x, Zahlen y) {\n data_.emplace_back(x, y);\n }\n void orderRotate(usize i) {\n assert(i < size());\n std::rotate(data_.begin(), data_.begin() + i, data_.end());\n }\n void normalForm() {\n auto index{std::distance(data_.begin(), std::min_element(data_.begin(), data_.end()))};\n orderRotate(index);\n }\n Polygon normalFormed() const {\n Polygon res{*this};\n res.normalForm();\n return res;\n }\n bool isConvex() const {\n assert(size() >= static_cast<usize>(3));\n for (usize i{} ; i < size() ; i++) {\n if (Relation(data_[i], data_[i+1==size()?0:i+1], data_[i+2>=size()?i+2-size():i+2])\n == CLOCKWISE) {\n return false;\n }\n }\n return true;\n }\n Zahlen areaTwice() const {\n assert(size() >= static_cast<usize>(3));\n Zahlen res{};\n for (usize i{1} ; i < size() ; i++) {\n res += Cross(data_[i] - data_[0], data_[i+1==size()?0:i+1] - data_[0]);\n }\n return res;\n }\n Polygon subtriangle(usize i, usize j, usize k) const {\n assert(i < size());\n assert(j < size());\n assert(k < size());\n return Polygon{std::vector<Point>{ data_[i], data_[j], data_[k] }};\n }\n};\n\n}\n\n} // namespace zawa\n#line 6 \"0445.test.cpp\"\n\nusing namespace zawa;\nusing namespace geometryZ2;\n\nint main() {\n SetFastIO();\n SetPrecision(6);\n int n; std::cin >> n;\n Polygon p(n);\n std::cin >> p;\n Zahlen total{p.areaTwice()};\n Zahlen area{};\n Zahlen ans{total};\n int r{};\n for (int l{} ; l < n ; l++) {\n while (area * 2 < total) {\n area += p.subtriangle(l, r, r+1==n?0:r+1).areaTwice();\n r = (r+1==n?0:r+1);\n }\n ans = std::min(ans, std::abs(area * 2 - total));\n if (l == r) r++;\n else area -= p.subtriangle(l, l+1==n?0:l+1, r).areaTwice();\n }\n std::cout << ans / 2.0 << '\\n';\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4132, "score_of_the_acc": -0.0567, "final_rank": 1 }, { "submission_id": "aoj_0445_8074575", "code_snippet": "#include<bits/stdc++.h>\n#define overload(a,b,c,d,...) d\n#define rep1(a) for(ll _=0;_<a;++_)\n#define rep2(i,a) for(ll i=0;i<a;++i)\n#define rep3(i,a,b) for(ll i=a;i<b;++i)\n#define rep(...) overload(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(i,a) for(ll i=(ll)a-1;i>=0;--i)\n#define rrep2(i,a,b) for(ll i=(ll)b-1;i>=(ll)a;--i)\n#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)\n#define all(x) x.begin(),x.end()\n#define rall(x) x.rbegin(),x.rend()\n#define eb emplace_back\n#define pb push_back\nusing namespace std;\nusing ll=long long;\nusing ull=unsigned long long;\nusing ld=long double;\ntemplate<typename T,typename U>inline bool chmin(T&a,const U&b){return (a>b?a=b,true:false);}\ntemplate<typename T,typename U>inline bool chmax(T&a,const U&b){return (a<b?a=b,true:false);}\nstatic constexpr ll inf=numeric_limits<ll>::max()/2;\nll calc(ll x1,ll y1,ll x2,ll y2,ll x3,ll y3){\n return abs((x1-x3)*(y2-y3)-(x2-x3)*(y1-y3));\n}\nint main(){\n ll n;cin>>n;\n vector<ll>x(n),y(n);\n rep(i,n)cin>>x[i]>>y[i];\n ll area=0;\n rep(i,1,n-1){\n area+=calc(x[0],y[0],x[i],y[i],x[i+1],y[i+1]);\n }\n ll j=1;\n ll ans=inf;\n ll sum=0;\n rep(i,n){\n while(sum*2<=area){\n sum+=calc(x[i],y[i],x[j],y[j],x[(j+1)%n],y[(j+1)%n]);\n chmin(ans,abs(area-2*sum));\n j++;\n j%=n;\n }\n sum-=calc(x[i],y[i],x[(i+1)%n],y[(i+1)%n],x[j],y[j]);\n chmin(ans,abs(area-sum*2));\n }\n cout<<fixed<<setprecision(12)<<(double)ans/2.0<<endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4136, "score_of_the_acc": -0.3905, "final_rank": 6 }, { "submission_id": "aoj_0445_7075098", "code_snippet": "#include <bits/stdc++.h>\nusing ll=long long;\nusing namespace std;\n#define rep(i,n) for(int i=0; i<(n); i++)\n#define REP2(i,x,n) for(int i=x; i<(n); i++)\n#define cin_int(i) int i;cin>>i\n#define cin_long(i) ll i;cin>>i\n#define cin_arrayint(i,k)vector<int>i; for(int t=0; t<k; t++){int x; cin>>x;i.push_back(x);} \n#define cin_arraylonglong(i,k)vector<long long>i; for(int t=0; t<k; t++){long long x; cin>>x;i.push_back(x);} \n#define cin_arraydouble(i,k)vector<double>i; for(int t=0; t<k; t++){double x; cin>>x;i.push_back(x);} \n#define foreach(i,t) for(auto i:t)\n#define ARRAY_LENGTH(array) (sizeof(array) / sizeof(array[0]))\n#define var auto\n#define List vector\n#define cw(i) cout<<i<<endl;\n#define HashSet unordered_set\n#define Dictionary unordered_map\n#define intreed() soloread<int>()\n#define longread() soloread<long>()\n#define all(i) i.begin(),i.end() \nconst ll LINF = 1e18;\nconst int INF = 1e9;\n\nclass union_find\n{ \n public:\n vector<int>tree;\n\n union_find(int i)\n {\n tree=vector<int>(i+1,-1);\n }\n\n int get_root(int i)\n {\n return tree[i]<0?i:tree[i]=get_root(tree[i]);\n }\n\n int group_check(int i,int t)\n {\n return get_root(i)==get_root(t);\n }\n\n bool unite(int i,int t)\n {\n var x=get_root(i);\n var y=get_root(t);\n if(x!=y)\n {\n if(tree[x]>tree[y])\n {\n swap(x,y);\n }\n tree[x]+=tree[y];\n tree[y]=x;\n }\n return x!=y;\n }\n\n bool Is_top(int i)\n {\n return tree[i]<0?true:false;\n }\n\n int get_cnt(int x)\n {\n return tree[get_root(x)]*-1;\n }\n};\n\ntemplate<typename T> T soloread()\n{\n T i;\n cin>>i;\n return i;\n}\n\ntemplate<typename T> vector<T> make_array(int n)\n{\n var back=List<T>();\n for(int i=0; i<n; i++)\n back.push_back(soloread<T>());\n return back;\n}\n\nvector<long long> CSun(vector<long long>N,bool mode=true)\n{\n if(mode==false)reverse(N.begin(),N.end());\n vector<long long>back(N.size()+1);\n back[0]=0;\n for(long long i=1; i<=N.size(); i++)\n {\n back[i]=back[i-1]+N[i-1];\n }\n return back;\n}\n\nvector<vector<bool>> bitallsearch(int N)\n{\n vector<vector<bool>>back(pow(2,N),vector<bool>(N));\n for (int i = 0; i < pow(2, N); i++)\n {\n for (int t = 0; t < N; t++)\n {\n var k = (i >> t) & 1;\n if (k == 1)\n {\n back[i][t] = true;\n }\n else\n {\n back[i][t]=false;\n }\n }\n }\n return back;\n}\n\nvoid YN(bool i)\n{\n if(i)\n {\n cw(\"Yes\");\n }\n else\n {\n cw(\"No\");\n }\n}\n\nint int_parse(char i)\n{\n return (int)(i-'0');\n}\n\nint int_parse(string i)\n{\n return stoi(i);\n}\n\nclass Dijkstra\n{\n public:\n vector<long long>dist;\n priority_queue<tuple<long long,int>,vector<tuple<long long,int>>,greater<tuple<long long,int>>>que;//コスト、頂点\n vector<vector<tuple<int,long long>>>G;//行先、コスト\n vector<int>prev;\n\n Dijkstra(int N)\n {\n dist=vector<long long>(N+1,LINF);\n prev=vector<int>(N+1,-1);\n for(int i=0; i<=N; i++)\n {\n G.push_back(vector<tuple<int,long long>>());\n }\n \n }\n\n void conect(int x,int y,long long cost,bool interactive=true)\n {\n G[x].emplace_back(make_tuple(y,cost));\n if(interactive)\n {\n G[y].emplace_back(make_tuple(x,cost));\n }\n }\n\n void start_Dijkstra(int start_point)\n {\n dist[start_point]=0;\n que.push(make_tuple(0,start_point));\n while (que.size()!=0)\n {\n auto now=que.top();//topでは削除されない\n que.pop();\n long long now_cost=get<0>(now);//現在の地点にいるためのコスト\n int now_point=get<1>(now);//現在の地点の番号\n if(dist[now_point]<now_cost)\n {\n continue;\n }\n for(int i=0; i<G[now_point].size(); i++)\n {\n auto next=G[now_point][i];\n long long next_cost=get<1>(next);// コスト\n int next_point=get<0>(next);//行先\n if(dist[next_point]>now_cost+next_cost)\n {\n dist[next_point]=now_cost+next_cost;\n que.push(make_tuple(dist[next_point],next_point));\n prev[next_point]=now_point;\n }\n }\n }\n }\n\n long long get_cost(int i)\n {\n return dist[i];\n }\n\n int get_prev(int i)\n {\n return prev[i];\n }\n\n void reset_dist()\n {\n int N=dist.size();\n dist=vector<long long>(N,LINF);\n }\n\n\n};\n\n\n\nclass BFS\n{ \n public:\n vector<int>dist;\n queue<int>que;\n vector<vector<int>>G;\n\n BFS(int N)\n {\n dist=vector<int>(N+1,-1);\n for(int i=0; i<=N; i++)\n {\n G.push_back(vector<int>());\n }\n }\n\n void conect(int x,int y)\n {\n G[x].push_back(y);\n G[y].push_back(x);\n }\n\n vector<int> start_bfs(int i)\n {\n que.push(i);\n var back=vector<int>();\n back.push_back(i);\n dist[i]=0;\n while (que.size()!=0)\n {\n var t=que.front();\n que.pop();\n for(int w=0; w<G[t].size(); w++)\n {\n if(dist[G[t][w]]==-1)\n {\n que.push(G[t][w]);\n back.push_back(G[t][w]);\n dist[G[t][w]] = dist[t] + 1;\n }\n }\n }\n return back;\n }\n\n\n};\n\nll get_area(ll x1,ll y1,ll x2,ll y2,ll x3,ll y3)\n{\n return abs((x3-x1)*(y2-y1)-(y3-y1)*(x2-x1));\n}\n\nint main(){\n int n; cin>>n;\n vector<int> x(n),y(n);\n //入力をする\n for(int i=0; i<n; i++)\n {\n int a,b; cin>>a>>b;\n x[i]=a;\n y[i]=b;\n }\n\n ll ans=ll(1e18)+20;\n\n ll S_all=0;\n for(int i=1;i<n-1;i++)S_all+=get_area(x[0],y[0],x[i],y[i],x[i+1],y[i+1]);\n\n deque<int> q;\n rep(i,3)q.emplace_back(i);\n ll now=get_area(x[0],y[0],x[1],y[1],x[2],y[2]);\n for(;;){\n //左端はqの左端\n //「足してギリ半分以上」になるまで伸ばす\n int l=q.front();\n if(l>=n)break;\n while(now*2<S_all){\n int r=q.back();\n now+=get_area(x[l],y[l],x[r%n],y[r%n],x[(r+1)%n],y[(r+1)%n]);\n r++;\n q.emplace_back(r);\n }\n ans=min(ans,2*now-S_all);\n int r=q.back();\n now-=get_area(x[l],y[l],x[(l+1)%n],y[(l+1)%n],x[r%n],y[r%n]);\n q.pop_front();\n }\n cout << fixed << setprecision(10);\n cout << ans/2.0 << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3760, "score_of_the_acc": -0.3403, "final_rank": 3 }, { "submission_id": "aoj_0445_7074079", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define vi vector<int>\n#define pll pair<ll,ll>\nusing namespace std;\nusing ll = long long;\n\nll cross(const pll &a, const pll &b){\n\treturn a.first * b.second - a.second * b.first;\n}\nll dot(const pll &a, const pll &b){\n\treturn a.first * b.first + a.second * b.second;\n}\npll sub(const pll &a, const pll &b){\n\treturn { a.first - b.first, a.second - b.second };\n}\nint main(){\n\tint n;\n\tcin >> n;\n\tvector<pll> ps(n);\n\trep(i, n) cin >> ps[i].first >> ps[i].second;\n\tps.insert(ps.end(), ps.begin(), ps.end());\n\tauto calc = [&](int i, int j, int k) -> ll {\n\t\treturn abs(cross(sub(ps[j], ps[i]), sub(ps[k], ps[i])));\n\t};\n\tll all_area = 0;\n\trep(i, n){\n\t\tall_area += calc(0, i, i+1);\n\t}\n\tll cur = 0;\n\tll ans = 1e18;\n\tint right = 0;\n\tfor(int left = 0; left <= n; left++){\n\t\twhile(right < n*2 && (cur+calc(left, right, right+1))*2 <= all_area){\n\t\t\tcur += calc(left, right, right+1);\n\t\t\tright++;\n\t\t}\n\t\tans = min(ans, all_area - cur*2);\n\t\tans = min(ans, (cur+calc(left,right,right+1))*2 - all_area);\n\t\tif(left == right){\n\t\t\tright++;\n\t\t\tcur = 0;\n\t\t\tcontinue;\n\t\t}\n\t\tcur -= calc(left, left+1, right);\n\t}\n\tprintf(\"%.3lf\\n\", (double)ans / 2);\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 5752, "score_of_the_acc": -0.6064, "final_rank": 11 }, { "submission_id": "aoj_0445_7052871", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long;\nconst lint mod = 998244353;\n#define rep(i, n) for(int i = 0; i < int(n); i++)\n#define rep2(i, l, r) for(int i = int(l); i < int(r); i++)\n#define repr(i, n) for(int i = int(n) - 1; i >= 0; i--)\n#define repr2(i, l, r) for(int i = int(r) - 1; i >= int(l); i--)\n\nstruct P{\n lint x, y;\n};\n\nlint triangle_2S(P p1, P p2, P p3){\n p2.x -= p1.x;\n p2.y -= p1.y;\n p3.x -= p1.x;\n p3.y -= p1.y;\n \n return abs(p2.x * p3.y - p3.x * p2.y);\n}\n\nint main(){\n int n;\n cin >> n;\n P points[n];\n rep(i, n){\n cin >> points[i].x;\n cin >> points[i].y;\n }\n \n lint all_2S = 0;\n rep2(i, 1, n - 1){\n all_2S += triangle_2S(points[0], points[i], points[i + 1]);\n }\n \n int p = 0, q = 0;\n lint now_2S = 0;\n lint min_diff = all_2S;\n while(p < n * 2){\n if(now_2S * 2 < all_2S){\n int q2 = q + 1;\n \n now_2S += triangle_2S(points[p % n], points[q % n], points[q2 % n]);\n q = q2;\n }else{\n int p2 = p + 1;\n \n now_2S -= triangle_2S(points[p % n], points[p2 % n], points[q % n]);\n p = p2;\n }\n \n min_diff = min(min_diff, abs(now_2S * 2 - all_2S));\n \n// cout << p << \" \" << q << \" \" << now_2S << endl;\n }\n \n cout << fixed << setprecision(5) << min_diff / 2.0 << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4380, "score_of_the_acc": -0.4231, "final_rank": 8 }, { "submission_id": "aoj_0445_6905355", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\ntemplate<class T> struct point{\n T x, y;\n point(): x(0), y(0){}\n point(T a, T b): x(a), y(b){}\n point& operator += (const point& rhs) {x += rhs.x, y += rhs.y; return *this;}\n point& operator -= (const point& rhs) {x -= rhs.x, y -= rhs.y; return *this;}\n point& operator *= (const T& rhs) {x *= rhs, y *= rhs; return *this;}\n point& operator /= (const T& rhs) {x /= rhs, y /= rhs; return *this;}\n point operator +() const { return *this; }\n point operator -() const { return point() - *this; }\n friend point operator + (const point& lhs, const point& rhs) {return point(lhs) += rhs;}\n friend point operator - (const point& lhs, const point& rhs) {return point(lhs) -= rhs;}\n friend point operator * (const point& lhs, const T& rhs) {return point(lhs) *= rhs;}\n friend point operator * (const T& lhs, const point& rhs) {return point(rhs) *= lhs;}\n friend point operator / (const point& lhs, const T& rhs) {return point(lhs) /= rhs;}\n friend T operator * (const point& lhs, const point& rhs) {return lhs.x * rhs.x + lhs.y * rhs.y;}\n friend T operator ^ (const point& lhs, const point& rhs) {return lhs.x * rhs.y - lhs.y * rhs.x;}\n friend istream& operator >> (istream& os, point& rhs) noexcept {\n os >> rhs.x >> rhs.y;\n return os;\n }\n friend constexpr ostream& operator << (ostream &os, const point& rhs) noexcept {\n return os << '('<< rhs.x << ',' << rhs.y << ')';\n }\n double norm(){return sqrt(x * x + y * y);}\n T norm2(){return x * x + y * y;}\n int orthant(){//第何象限かのベクトルを返す(0,0は0象限とする)\n if(x == 0 && y == 0)return 0;\n if(y > 0)return (x > 0 ? 1 : 2);\n return (x > 0 ? 4 : 3);\n }\n //偏角ソート->ベクトルの大きさの小さい順の優先度\n friend bool operator < (point &lhs, point &rhs){\n int lo = lhs.orthant(), ro = rhs.orthant();\n if(lo != ro)return (lo < ro);\n T cv = (lhs ^ rhs);\n if(cv != 0)return (cv > 0);\n return (lhs.norm2() < rhs.norm2());\n }\n};\n\nint main(){\n int n;\n cin >> n;\n vector<point<ll>> p(n);\n for(auto &&pos:p)cin >> pos;\n p.resize(2 * n);\n for(int i = 0; i < n; i++)p[i + n] = p[i];\n ll S = 0, T = 0, ans = 1ll << 62;\n for(int i = 0; i < n; i++){\n S += (p[i] ^ p[i + 1]);\n }\n for(int l = 0, r = 1; l < n; l++){\n while(2 * T <= S){\n ans = min(ans, abs(2 * T - S));\n T += abs((p[r] - p[l]) ^ (p[r + 1] - p[l]));\n r++;\n }\n ans = min(ans, abs(2 * T - S));\n T -= abs((p[l] - p[r]) ^ (p[l + 1] - p[r]));\n }\n printf(\"%.15lf\\n\", double(ans) / 2);\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 5752, "score_of_the_acc": -0.6064, "final_rank": 11 }, { "submission_id": "aoj_0445_6605556", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nlong long int Area(long long int x1,long long int y1,long long int x2,long long int y2,long long int x3,long long int y3){\n long long int X2 = x2-x1;\n long long int Y2 = y2-y1;\n long long int X3 = x3-x1;\n long long int Y3 = y3-y1;\n long long int Ans = abs(X2*Y3-Y2*X3)*4;\n return Ans;\n}\n\nint main(){\n int N;\n cin >> N;\n vector<long long int> X(N),Y(N);\n for(int i=0;i<N;i++) cin >> X[i] >> Y[i];\n long long int S = 0;\n for(int i=1;i<N-1;i++) S += Area(X[0],Y[0],X[i],Y[i],X[i+1],Y[i+1]);\n long long int a = S/2;\n int l = 1;\n long long int Sl = 0;\n long long int Sr = Area(X[0],Y[0],X[1],Y[1],X[2],Y[2]);\n long long int ans = 2000000000000000000;\n ans = min(ans,abs(S-Sl));\n ans = min(ans,abs(S-Sr));\n for(int i=0;i<N;i++){\n for(;;){\n if(Sl-a <= 0 && Sr-a >= 0){\n if(Sl != 0) ans = min(ans,abs(Sl-a));\n if(Sr != 0) ans = min(ans,abs(Sr-a));\n break;\n }\n if(Sl-a >= 0 && Sr-a <= 0){\n if(Sl != 0) ans = min(ans,abs(Sl-S));\n if(Sr != 0) ans = min(ans,abs(Sr-S));\n break;\n }\n int nl = l+1;\n if(nl >= N) nl -= N;\n Sl += Area(X[i],Y[i],X[l],Y[l],X[nl],Y[nl]);\n Sr += Area(X[i],Y[i],X[nl],Y[nl],X[(nl+1)%N],Y[(nl+1)%N]);\n l = nl;\n }\n Sl -= Area(X[i],Y[i],X[(i+1)%N],Y[(i+1)%N],X[l],Y[l]);\n Sr -= Area(X[i],Y[i],X[(i+1)%N],Y[(i+1)%N],X[(l+1)%N],Y[(l+1)%N]);\n }\n cout << ans/4;\n if(ans%4 == 0) cout << endl;\n else if(ans%4 == 1) cout << \".25\" << endl;\n else if(ans%4 == 2) cout << \".5\" << endl;\n else cout << \".75\" << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3940, "score_of_the_acc": -0.3643, "final_rank": 4 }, { "submission_id": "aoj_0445_6048138", "code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <tuple>\n#include <cstdint>\n#include <cstdio>\n#include <map>\n#include <cstdint>\n#include <queue>\n#include <set>\n#include <stack>\n#include <deque>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <cctype>\n#include <functional>\n#include <ctime>\n#include <fstream>\n#include <cmath>\n#include <limits>\n#include <chrono>\n#include <numeric>\n#include <type_traits>\n#include <iomanip>\n#include <float.h>\n#include <math.h>\n#include <cassert>\n#include <random>\n#pragma warning (disable: 4996)\nusing namespace std;\n\nusing ll = long long;\n\n\nint main() {\n\tll n;\n\tcin >> n;\n\tvector<ll> x(3*n);\n\tvector<ll> y(3*n);\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> x[i] >> y[i];\n\t\tx[i + n] = x[i];\n\t\ty[i + n] = y[i];\n\t\tx[i + n*2] = x[i];\n\t\ty[i + n*2] = y[i];\n\t}\n\tvector<long double> ac(3*n-1);\n\tfor (int i = 0; i < 3*n-1; i++) {\n\t\tac[i] = ((long double)x[i] - (long double)x[i + 1]) * ((long double)y[i] + (long double)y[i + 1]);\n\t}\n\tvector<long double> tc(3 * n);\n\tfor (int i = 0; i < 3 * n - 1; i++) {\n\t\ttc[i + 1] = tc[i] + ac[i];\n\t}\n\tlong double s = abs(tc[n]);\n\ts /= (long double)2;\n\tlong double zans = s;\n\tfor (int i = 0; i < n; i++) {\n\t\tll ok = i;\n\t\tll ng = i + n;\n\t\twhile (ng - ok > 1) {\n\t\t\tll mid = (ok + ng) / 2;\n\t\t\tif (abs(tc[mid]-tc[i] + ((long double)x[mid] - (long double)x[i]) * ((long double)y[mid] + (long double)y[i])) <= s)ok = mid;\n\t\t\telse ng = mid;\n\t\t}\n\t\tzans = min({ zans,abs(abs(tc[ok] - tc[i] + ((long double)x[ok] - (long double)x[i]) * ((long double)y[ok] + (long double)y[i])) - s), abs(abs(tc[ng] - tc[i] + ((long double)x[ng] - (long double)x[i]) * ((long double)y[ng] + (long double)y[i])) - s) });\n\n\t}\n\tcout <<fixed << setprecision(40)<< zans << endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 11192, "score_of_the_acc": -1.6667, "final_rank": 16 }, { "submission_id": "aoj_0445_6044369", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <limits>\nusing namespace std;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\ntypedef long long ll;\ntypedef pair<long long, long long> P;\nconst long long INF = 1e16;\ntemplate <typename T>\nvoid input_arr(vector<T>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i];\n\t}\n}\ntemplate <typename T, typename Q>\nvoid input_arr(vector<pair<T, Q>>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i].first >> A[i].second;\n\t}\n}\ntemplate <typename T>\nvoid input_arr(vector<vector<T>>& A, ll H, ll W) {\n\tfor (ll i = 0; i < H; i++) {\n\t\tfor (ll j = 0; j < W; j++) {\n\t\t\tcin >> A[i][j];\n\t\t}\n\t}\n}\n#define EPS (1e-10)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\nclass Point {\npublic:\n long double x;\n long double y;\n\n Point(long double x = 0, long double y = 0) : x(x), y(y) {}\n\n Point operator+(Point p) { return Point(x + p.x, y + p.y); }\n Point operator-(Point p) { return Point(x - p.x, y - p.y); }\n Point operator*(long double a) { return Point(a * x, a * y); }\n Point operator/(long double a) { return Point(x / a, y / a); }\n\n long double abs() { return sqrt(norm()); }\n long double norm() { return x * x + y * y; }\n\n bool operator<(const Point& p) const {\n return x != p.x ? x < p.x : y < p.y;\n }\n bool operator==(const Point& p) const {\n return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);\n }\n};\ntypedef Point Vector;\nstruct Segment {\n Point A;\n Point B;\n};\ntypedef Segment Line;\nclass Circle {\npublic:\n Point C;\n long double r;\n Circle(Point C = Point(), long double r = 0.0) : C(C), r(r) {}\n};\ntypedef vector<Point> Polygon;\nlong double dot(Vector A, Vector B) {\n return A.x * B.x + A.y * B.y;\n}\nlong double cross(Vector A, Vector B) {\n return A.x * B.y - A.y * B.x;\n}\nlong double Area(Polygon S) {\n if (S.size() < 3) return 0;\n long double ans = 0;\n Point O = S[0];\n for (ll i = 1; i + 1 < S.size(); i++) {\n Point A = S[i], B = S[i + 1];\n Vector C = A - O;\n Vector D = B - O;\n long double area = cross(C, D);\n ans += area;\n }\n return ans / 2;\n}\nint main() {\n ll N; cin >> N;\n Polygon S(N); \n for (ll i = 0; i < N; i++) cin >> S[i].x >> S[i].y;\n long double area = Area(S);\n long double ans = area;\n ll pos1 = 0, pos2 = 0;\n long double sum = 0;\n while (true) {\n Polygon A = { S[pos1], S[pos2], S[(pos2 + 1) % N] };\n long double area2 = Area(A);\n ans = min(ans, abs(sum + area2 - (area - sum - area2)));\n if (2 * (sum + area2) <= area) {\n sum += area2;\n pos2 = (pos2 + 1) % N;\n }\n else {\n Polygon B = { S[pos1], S[(pos1 + 1) % N], S[pos2] };\n long double area3 = Area(B);\n sum -= area3;\n pos1 = (pos1 + 1) % N;\n if (pos1 == 0) break;\n }\n }\n cout << fixed << setprecision(12) << ans << endl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 6868, "score_of_the_acc": -1.4222, "final_rank": 15 }, { "submission_id": "aoj_0445_6044367", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <limits>\nusing namespace std;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\ntypedef long long ll;\ntypedef pair<long long, long long> P;\nconst long long INF = 1e18;\ntemplate <typename T>\nvoid input_arr(vector<T>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i];\n\t}\n}\ntemplate <typename T, typename Q>\nvoid input_arr(vector<pair<T, Q>>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i].first >> A[i].second;\n\t}\n}\ntemplate <typename T>\nvoid input_arr(vector<vector<T>>& A, ll H, ll W) {\n\tfor (ll i = 0; i < H; i++) {\n\t\tfor (ll j = 0; j < W; j++) {\n\t\t\tcin >> A[i][j];\n\t\t}\n\t}\n}\n#define EPS (1e-10)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\nclass Point {\npublic:\n double x;\n double y;\n\n Point(double x = 0, double y = 0) : x(x), y(y) {}\n\n Point operator+(Point p) { return Point(x + p.x, y + p.y); }\n Point operator-(Point p) { return Point(x - p.x, y - p.y); }\n Point operator*(double a) { return Point(a * x, a * y); }\n Point operator/(double a) { return Point(x / a, y / a); }\n\n double abs() { return sqrt(norm()); }\n double norm() { return x * x + y * y; }\n\n bool operator<(const Point& p) const {\n return x != p.x ? x < p.x : y < p.y;\n }\n bool operator==(const Point& p) const {\n return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);\n }\n};\ntypedef Point Vector;\nstruct Segment {\n Point A;\n Point B;\n};\ntypedef Segment Line;\nclass Circle {\npublic:\n Point C;\n double r;\n Circle(Point C = Point(), double r = 0.0) : C(C), r(r) {}\n};\ntypedef vector<Point> Polygon;\ndouble dot(Vector A, Vector B) {\n return A.x * B.x + A.y * B.y;\n}\ndouble cross(Vector A, Vector B) {\n return A.x * B.y - A.y * B.x;\n}\ndouble Area(Polygon S) {\n if (S.size() < 3) return 0;\n double ans = 0;\n Point O = S[0];\n for (ll i = 1; i + 1 < S.size(); i++) {\n Point A = S[i], B = S[i + 1];\n Vector C = A - O;\n Vector D = B - O;\n double area = cross(C, D) * 0.5;\n ans += area;\n }\n return ans;\n}\nint main() {\n ll N; cin >> N;\n Polygon S(N); \n for (ll i = 0; i < N; i++) cin >> S[i].x >> S[i].y;\n double area = Area(S);\n double ans = (double)INF;\n ll j = 0;\n double sum = 0;\n for (ll i = 0; i < N; i++) {\n while (sum < area / 2) {\n Polygon a = { S[i], S[j + 1], S[j + 2] };\n sum += Area(a);\n j++;\n }\n ans = min(ans, abs(area - 2 * sum));\n S.push_back(S[i]);\n Polygon b = { S[i], S[i + 1], S[j + 1] };\n sum -= Area(b);\n }\n cout << fixed << setprecision(12) << ans << endl;\n}", "accuracy": 0.6666666666666666, "time_ms": 30, "memory_kb": 4716, "score_of_the_acc": -0.8014, "final_rank": 19 }, { "submission_id": "aoj_0445_6044141", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <limits>\nusing namespace std;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\ntypedef long long ll;\ntypedef pair<long long, long long> P;\nconst long long INF = 1e18;\ntemplate <typename T>\nvoid input_arr(vector<T>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i];\n\t}\n}\ntemplate <typename T, typename Q>\nvoid input_arr(vector<pair<T, Q>>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i].first >> A[i].second;\n\t}\n}\ntemplate <typename T>\nvoid input_arr(vector<vector<T>>& A, ll H, ll W) {\n\tfor (ll i = 0; i < H; i++) {\n\t\tfor (ll j = 0; j < W; j++) {\n\t\t\tcin >> A[i][j];\n\t\t}\n\t}\n}\n#define EPS (1e-10)\n#define equals(a, b) (fabs((a) - (b)) < EPS)\nclass Point {\npublic:\n double x;\n double y;\n\n Point(double x = 0, double y = 0) : x(x), y(y) {}\n\n Point operator+(Point p) { return Point(x + p.x, y + p.y); }\n Point operator-(Point p) { return Point(x - p.x, y - p.y); }\n Point operator*(double a) { return Point(a * x, a * y); }\n Point operator/(double a) { return Point(x / a, y / a); }\n\n double abs() { return sqrt(norm()); }\n double norm() { return x * x + y * y; }\n\n bool operator<(const Point& p) const {\n return x != p.x ? x < p.x : y < p.y;\n }\n bool operator==(const Point& p) const {\n return fabs(x - p.x) < (1e-10) && fabs(y - p.y) < (1e-10);\n }\n};\ntypedef Point Vector;\nstruct Segment {\n Point A;\n Point B;\n};\ntypedef Segment Line;\nclass Circle {\npublic:\n Point C;\n double r;\n Circle(Point C = Point(), double r = 0.0) : C(C), r(r) {}\n};\ntypedef vector<Point> Polygon;\ndouble dot(Vector A, Vector B) {\n return A.x * B.x + A.y * B.y;\n}\ndouble cross(Vector A, Vector B) {\n return A.x * B.y - A.y * B.x;\n}\ndouble Area(Polygon S) {\n if (S.size() < 3) return 0;\n double ans = 0;\n Point O = S[0];\n for (ll i = 1; i + 1 < S.size(); i++) {\n Point A = S[i], B = S[i + 1];\n Vector C = A - O;\n Vector D = B - O;\n double area = cross(C, D) * 0.5;\n ans += area;\n }\n return ans;\n}\nint main() {\n ll N; cin >> N;\n Polygon S(N); \n for (ll i = 0; i < N; i++) cin >> S[i].x >> S[i].y;\n double area = Area(S);\n double ans = (double)INF;\n ll j = 0;\n double sum = 0;\n for (ll i = 0; i < N; i++) {\n while (sum < area / 2) {\n Polygon a = { S[i], S[j + 1], S[j + 2] };\n sum += Area(a);\n j++;\n }\n ans = min(ans, abs(area - 2 * sum));\n S.push_back(S[i]);\n Polygon b = { S[i], S[i + 1], S[j + 1] };\n sum -= Area(b);\n }\n cout << fixed << setprecision(12) << ans << endl;\n}", "accuracy": 0.6666666666666666, "time_ms": 30, "memory_kb": 4748, "score_of_the_acc": -0.8056, "final_rank": 20 }, { "submission_id": "aoj_0445_6025696", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\ntemplate<class T> using vc = vector<T>;\ntemplate<class T> using vvc = vc<vc<T>>;\ntemplate<class T> using vvvc = vc<vvc<T>>;\ntemplate<class T> using vvvvc = vvc<vvc<T>>;\ntemplate<class T> using PQ = priority_queue<T>;\ntemplate<class T> using invPQ = priority_queue<T, vector<T>, greater<T>>;\nusing IP = pair<int, int>;\nusing LP = pair<ll, ll>;\n#define all(x) begin(x), end(x)\n#define allr(x) rbegin(x), rend(x)\n#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)\n#define rep3(i, m, n) for (int i = (m); (i) < (int)(n); i++)\n#define repr(i, n) for (int i = (n) - 1; (i) >= 0; i--)\n#define rep3r(i, m, n) for (int i = (n) - 1; (i) >= (int)(m); i--)\ntemplate<class T> inline bool chmax(T & a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T & a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\nsigned main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int N;\n cin >> N;\n vc<long long> x(N), y(N);\n rep (i, N) cin >> x[i] >> y[i];\n\n vc<long long> s(N+1);\n rep (i, N) {\n s[i+1] = (x[i]*y[(i+1)%N] - y[i]*x[(i+1)%N]);\n }\n rep (i, N) s[i+1] += s[i];\n\n long long ans = s[N];\n\n rep (i, N-2) {\n int l = i + 2, r = N;\n if (i < 2) r -= 2 - i;\n while (r - l > 1) {\n int mid = (l + r) / 2;\n if ((s[mid] - s[i] + (x[mid]*y[i] - y[mid]*x[i])) * 2 - s[N] >= 0) r = mid;\n else l = mid;\n }\n chmin(ans, abs(s[N] - (s[l] - s[i] + (x[l]*y[i] - y[l]*x[i])) * 2));\n if (r < N) chmin(ans, abs(s[N] - (s[r] - s[i] + (x[r]*y[i] - y[r]*x[i])) * 2));\n }\n\n printf(\"%.10f\\n\", (double)ans/2);\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4392, "score_of_the_acc": -0.0914, "final_rank": 2 }, { "submission_id": "aoj_0445_5936952", "code_snippet": "#ifdef LOGX\n#define _GLIBCXX_DEBUG\n#endif\n#include <bits/stdc++.h>\nusing namespace std;\n//#include <atcoder/all>\n//using namespace atcoder;\n\n/*---------macro---------*/\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)\n#define unless(x) if(!(x))\n#define until(x) while(!(x))\n#define ALL(a) a.begin(),a.end()\n#define RALL(a) a.rbegin(),a.rend()\n#define mybit(i,j) (((i)>>(j))&1)\n\n/*---------type/const---------*/\nconst int big=1000000007;\n//const int big=998244353;\nconst double EPS=1e-8; //適宜変える\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef std::string::const_iterator state; //構文解析\nconst int dx[4]={1,0,-1,0};\nconst int dy[4]={0,1,0,-1};\nconst char newl='\\n';\nstruct{\n constexpr operator int(){return -int(1e9)-10;}\n constexpr operator ll(){return -ll(1e18)-10;}\n}neginf;\nstruct{\n constexpr operator int(){return int(1e9)+10;}\n constexpr operator ll(){return ll(1e18)+10;}\n constexpr auto operator -(){return neginf;}\n}inf;\n\n/*---------debug---------*/\n#ifdef LOGX\n#include <template/debug.hpp>\n#else\n#define dbg(...) ;\n#define dbgnewl ;\n#define prt(x) ;\n#define _prt(x) ;\n#endif\n\n/*---------function---------*/\ntemplate<typename T> T max(const std::vector<T> &a){T ans=a[0];for(T elem:a){ans=max(ans,elem);}return ans;}\ntemplate<typename T> T min(const std::vector<T> &a){T ans=a[0];for(T elem:a){ans=min(ans,elem);}return ans;}\ntemplate<typename T,typename U> bool chmin(T &a,const U b){if(a>b){a=b;return true;}return false;}\ntemplate<typename T,typename U> bool chmax(T &a,const U b){if(a<b){a=b;return true;}return false;}\nbool valid(int i,int j,int h,int w){return (i>=0 && j>=0 && i<h && j<w);}\ntemplate<class T,class U>T expm(T x,U y,const ll mod=big){T res=1;while(y){if(y&1)(res*=x)%=mod;(x*=x)%=mod;y>>=1;}return res;}\ntemplate<class T,class U>T exp(T x,U y){T res=1;while(y){if(y&1)res*=x;x*=x;y>>=1;}return res;}\n\n\n\nint main(){\n //std::ios::sync_with_stdio(false);\n //std::cin.tie(nullptr);\n std::cout << fixed << setprecision(10);\n/*------------------------------------*/\n \n int n;\n cin >> n;\n vector<complex<ll>> vec(n);\n rep(i,n){\n int a,b;\n cin >> a >> b;\n vec[i]={a,b};\n }\n auto MOD=[&](int i){\n return (i%n+n)%n;\n };\n auto calc=[&](int i,int j,int k){\n i=MOD(i);\n j=MOD(j);\n k=MOD(k);\n auto a=vec[i]-vec[k],b=vec[j]-vec[k];\n return abs(a.real()*b.imag()-a.imag()*b.real());\n };\n \n ll ans=inf;\n ll A=0,B=0;\n rep(i,n-1){\n B+=calc(0,i,i+1);\n }\n\n int j=1;\n rep(i,n){\n while(A<B){\n ans=min(ans,abs(A-B));\n A+=calc(i,j,j+1);\n B-=calc(i,j,j+1);\n j++;\n }\n ans=min(ans,abs(A-B));\n A-=calc(i,i+1,j);\n B+=calc(i,i+1,j);\n ans=min(ans,abs(A-B));\n }\n cout << ans/2.0 << newl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4188, "score_of_the_acc": -0.3975, "final_rank": 7 }, { "submission_id": "aoj_0445_5936923", "code_snippet": "#ifdef LOGX\n#define _GLIBCXX_DEBUG\n#endif\n#include <bits/stdc++.h>\nusing namespace std;\n//#include <atcoder/all>\n//using namespace atcoder;\n\n/*---------macro---------*/\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)\n#define unless(x) if(!(x))\n#define until(x) while(!(x))\n#define ALL(a) a.begin(),a.end()\n#define RALL(a) a.rbegin(),a.rend()\n#define mybit(i,j) (((i)>>(j))&1)\n\n/*---------type/const---------*/\nconst int big=1000000007;\n//const int big=998244353;\nconst double EPS=1e-8; //適宜変える\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef std::string::const_iterator state; //構文解析\nconst int dx[4]={1,0,-1,0};\nconst int dy[4]={0,1,0,-1};\nconst char newl='\\n';\nstruct{\n constexpr operator int(){return -int(1e9)-10;}\n constexpr operator ll(){return -ll(1e18)-10;}\n}neginf;\nstruct{\n constexpr operator int(){return int(1e9)+10;}\n constexpr operator ll(){return ll(1e18)+10;}\n constexpr auto operator -(){return neginf;}\n}inf;\n\n/*---------debug---------*/\n#ifdef LOGX\n#include <template/debug.hpp>\n#else\n#define dbg(...) ;\n#define dbgnewl ;\n#define prt(x) ;\n#define _prt(x) ;\n#endif\n\n/*---------function---------*/\ntemplate<typename T> T max(const std::vector<T> &a){T ans=a[0];for(T elem:a){ans=max(ans,elem);}return ans;}\ntemplate<typename T> T min(const std::vector<T> &a){T ans=a[0];for(T elem:a){ans=min(ans,elem);}return ans;}\ntemplate<typename T,typename U> bool chmin(T &a,const U b){if(a>b){a=b;return true;}return false;}\ntemplate<typename T,typename U> bool chmax(T &a,const U b){if(a<b){a=b;return true;}return false;}\nbool valid(int i,int j,int h,int w){return (i>=0 && j>=0 && i<h && j<w);}\ntemplate<class T,class U>T expm(T x,U y,const ll mod=big){T res=1;while(y){if(y&1)(res*=x)%=mod;(x*=x)%=mod;y>>=1;}return res;}\ntemplate<class T,class U>T exp(T x,U y){T res=1;while(y){if(y&1)res*=x;x*=x;y>>=1;}return res;}\n\n\n\nint main(){\n //std::ios::sync_with_stdio(false);\n //std::cin.tie(nullptr);\n std::cout.precision(10);\n/*------------------------------------*/\n \n int n;\n cin >> n;\n vector<complex<ll>> vec(n);\n rep(i,n){\n int a,b;\n cin >> a >> b;\n vec[i]={a,b};\n }\n auto MOD=[&](int i){\n return (i%n+n)%n;\n };\n auto calc=[&](int i,int j,int k){\n i=MOD(i);\n j=MOD(j);\n k=MOD(k);\n auto a=vec[i]-vec[k],b=vec[j]-vec[k];\n return abs(a.real()*b.imag()-a.imag()*b.real());\n };\n \n ll ans=inf;\n ll A=0,B=0;\n rep(i,n-1){\n B+=calc(0,i,i+1);\n }\n\n int j=1;\n rep(i,n){\n while(A<B){\n ans=min(ans,abs(A-B));\n A+=calc(i,j,j+1);\n B-=calc(i,j,j+1);\n j++;\n }\n ans=min(ans,abs(A-B));\n A-=calc(i,i+1,j);\n B+=calc(i,i+1,j);\n ans=min(ans,abs(A-B));\n }\n cout << (ans>>1) << '.' << (ans&1 ? 5:0) << newl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4124, "score_of_the_acc": -0.3889, "final_rank": 5 }, { "submission_id": "aoj_0445_5887968", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i = 0; i < (n); i++)\nusing namespace std;\ntypedef long long ll;\nusing Real = double;\nusing Point = complex< double >;\nusing Polygon = vector< Point >;\nconst Real EPS = 1e-6, PI = acos(-1);\nconstexpr int COUNTER_CLOCKWISE = +1;\nconstexpr int CLOCKWISE = -1;\nconstexpr int ONLINE_BACK = +2; // c-a-b\nconstexpr int ONLINE_FRONT = -2; // a-b-c\nconstexpr int ON_SEGMENT = 0; // a-c-b\n\nPoint operator*(const Point &p, const Real &d) {\n return Point(real(p) * d, imag(p) * d);\n}\n\nPoint operator/(const Point &p, const Real &d) {\n return Point(real(p) / d, imag(p) / d);\n}\n\nistream &operator>>(istream &is, Point &p) {\n Real a, b; is >> a >> b;\n p = Point(a, b);\n return is;\n}\n\nostream &operator<<(ostream &os, const Point &p) {\n return os << fixed << setprecision(10) << real(p) << \" \" << imag(p);\n}\n\nnamespace std {\n bool operator<(const Point &a, const Point &b) {\n return a.real() != b.real() ? a.real() < b.real() : a.imag() < b.imag();\n }\n}\n\n// 符号\ninline int sign(const Real &r) {\n return r <= -EPS ? -1 : r >= EPS ? 1 : 0;\n}\n\n// a = b ? \ninline bool equals(const Real &a, const Real &b) {\n return sign(a - b) == 0;\n}\n\n\n// 単位ベクトル\nPoint unitVec(const Point &a){ return a / abs(a); }\n\n// 法線ベクトル 半時計周り\nPoint normVec(const Point &a){ return a * Point(0, 1); }\n//Point normVec(const Point &a){ return a * Point(0,-1); }\n\n// 内積\nReal dot(const Point &a, const Point &b) {\n return (a.real() * b.real() + a.imag() * b.imag());\n}\n\n// 外積\nReal cross(const Point &a, const Point &b) {\n return (a.real() * b.imag() - a.imag() * b.real());\n}\n\nPoint rotate(const Point &p, const Real &theta) {\n return Point(cos(theta) * p.real() - sin(theta) * p.imag(),\n sin(theta) * p.real() + cos(theta) * p.imag());\n}\n\nReal Radian_To_Degree(const Real &radian){ return radian * 180.0 / PI; }\nReal Degree_To_Radian(const Real &degree){ return degree * PI / 180.0; }\n\nstruct Line {\n Point a, b;\n Line() = default;\n Line(Point a, Point b) : a(a), b(b) {}\n\n // Ax + By = C\n Line(Real A, Real B, Real C) {\n if(equals(A, 0)) {\n a = Point(0, C / B), b = Point(1, C / B);\n }else if(equals(B,0)) {\n b = Point(C / A, 0), b = Point(C / A, 1);\n }else{\n a = Point(0, C / B), b = Point(C / A, 0);\n }\n }\n\n friend ostream &operator<<(ostream &os, Line &p) {\n return os << p.a << \" \" << p.b;\n }\n\n friend istream &operator>>(istream &is, Line &a) {\n return is >> a.a >> a.b;\n }\n};\n\nstruct Segment : Line {\n Segment() = default;\n Segment(Point a, Point b) : Line(a, b) {}\n};\n\nstruct Circle {\n Point p;\n Real r;\n Circle() = default;\n Circle(Point p, Real r) : p(p), r(r) {}\n\n friend ostream &operator<<(ostream &os, Circle &c) {\n return os << c.p << \" \" << c.r;\n }\n\n friend istream &operator>>(istream &is, Circle &c) {\n return is >> c.p >> c.r;\n }\n};\n\n// 直線lに点pから引いた垂線の足を求める\nPoint projection(const Line &l, const Point &p) {\n Real t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\n\nPoint projection(const Segment &l, const Point &p) {\n Real t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\n\n// 直線lに関して点pと対称な点を求める\nPoint reflection(const Line &l, const Point &p) {\n return p + (projection(l, p) - p) * 2.0;\n}\n\n// 点の回転方向\n// 点aを基準に点b,cの位置関係\nint ccw(const Point &a, Point b, Point c) {\n b = b - a, c = c - a;\n if(sign(cross(b, c)) == +1) return COUNTER_CLOCKWISE; // 反時計回り\n if(sign(cross(b, c)) == -1) return CLOCKWISE; // 時計回り\n if(sign(dot(b, c)) == -1) return ONLINE_BACK; // c - a - b\n if(norm(b) < norm(c)) return ONLINE_FRONT; // a - b - c\n return ON_SEGMENT; // a - c - b\n}\n\n// 2直線の直交判定\nbool is_orthogonal(const Line &a, const Line &b) {\n return equals(dot(a.b - a.a, b.b - b.a), 0);\n}\n\n// 2直線の平行判定\nbool is_parallel(const Line &a, const Line &b) {\n return equals(cross(a.b - a.a, b.b - b.a), 0);\n}\n\n// 線分の交差判定\nbool is_intersect_ss(const Segment &s, const Segment &t) {\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 &&\n ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\n\n// 直線の交差判定\nbool is_intersect_ll(const Line &l, const Line &m) {\n Real A = cross(l.b - l.a, m.b - m.a);\n Real B = cross(l.b - l.a, l.b - m.a);\n if(equals(abs(A), 0) && equals(abs(B), 0)) return true;\n return !is_parallel(l, m);\n}\n\n// 線分に点が乗っているか\nbool is_intersect_sp(const Segment &s, const Point &p) {\n return ccw(s.a, s.b, p) == ON_SEGMENT;\n}\n\n// 点と点の距離\nReal distance_pp(const Point &p1, const Point &p2) {\n return sqrt(pow(real(p1)-real(p2), 2) + pow(imag(p1)-imag(p2), 2));\n}\n\n// 点と直線の距離\nReal distance_lp(const Line &l, const Point &p) {\n return abs(p - projection(l, p));\n}\n\n// 直線と直線の距離\nReal distance_ll(const Line &l, const Line &m) {\n return is_intersect_ll(l, m) ? 0 : distance_lp(l, m.a);\n}\n\n// 点と線分の距離\nReal distance_sp(const Segment &s, const Point &p) {\n Point r = projection(s, p);\n if(is_intersect_sp(s, r)) return abs(r - p);\n return min(abs(s.a - p), abs(s.b - p));\n}\n\n// 線分と線分の距離\nReal distance_ss(const Segment &a, const Segment &b) {\n if(is_intersect_ss(a, b)) return 0;\n return min({distance_sp(a, b.a), distance_sp(a, b.b), distance_sp(b, a.a), distance_sp(b, a.b)});\n}\n\n// 交点\nPoint cross_point_ll(const Line &l, const Line &m) {\n Real A = cross(l.b - l.a, m.b - m.a);\n Real B = cross(l.b - l.a, l.b - m.a);\n if(equals(abs(A), 0) && equals(abs(B), 0)) return m.a;\n return m.a + (m.b - m.a) * B / A;\n}\n\n// 円と円の位置関係\nint intersect(Circle c1, Circle c2) {\n if(c1.r < c2.r) swap(c1, c2);\n Real d = abs(c1.p - c2.p);\n if(c1.r + c2.r < d) return 4;\n if(equals(c1.r + c2.r, d)) return 3;\n if(c1.r - c2.r < d) return 2;\n if(equals(c1.r - c2.r, d)) return 1;\n return 0;\n}\n\nbool is_convex(const Polygon &p){\n for(int i = 0; i < p.size(); i++){\n if(ccw(p[(i + p.size() - 1) % p.size()], p[i], p[(i + 1) % p.size()]) == -1) return false;\n }\n return true;\n}\n\nenum { OUT, ON, IN };\nint contains(const Polygon &Q, const Point &p){\n bool in = false;\n for(int i = 0; i < Q.size(); i++){\n Point a = Q[i] - p, b = Q[(i + 1) % Q.size()] - p;\n if(a.imag() > b.imag()) swap(a, b);\n if(a.imag() <= 0 && 0 < b.imag() && cross(a, b) < 0) in = !in;\n if(cross(a, b) == 0 && dot(a, b) <= 0) return ON;\n }\n return in ? IN : OUT;\n}\n\nPolygon convex_hull(Polygon &p, bool strict = true){\n int n = (int)p.size(), k = 0;\n if(n <= 2) return p;\n sort(p.begin(), p.end());\n Polygon ch(2 * n);\n for(int i = 0; i < n; ch[k++] = p[i++]){\n while(k >= 2 && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < 0) --k;\n }\n for(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]){\n while(k >= t && cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < 0) --k;\n }\n ch.resize(k - 1);\n return ch;\n}\n\nReal convex_diameter(const Polygon &p){\n int n = (int)p.size();\n int is = 0, js = 0;\n for(int i = 1; i < n; i++){\n if(p[i].imag() > p[is].imag()) is = i;\n if(p[i].imag() < p[js].imag()) js = i;\n }\n Real maxdis = norm(p[is] - p[js]);\n int maxi, maxj, i, j;\n i = maxi = is;\n j = maxj = js;\n do {\n if(cross(p[(i + 1) % n] - p[i], p[(j + 1) % n] - p[j]) >= 0){\n j = (j + 1) % n;\n }else{\n i = (i + 1) % n;\n }\n\n if(norm(p[i] - p[j]) > maxdis){\n maxdis = norm(p[i] - p[j]);\n maxi = i;\n maxj = j;\n }\n\n }while(i != is || j != js);\n return sqrt(maxdis);\n}\n\nPolygon convex_cut(const Polygon &U, Line l){\n Polygon ret;\n for(int i = 0; i < U.size(); i++){\n Point now = U[i], nxt = U[(i + 1) % U.size()];\n if(ccw(l.a, l.b, now) != -1) ret.push_back(now);\n if(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0){\n ret.push_back(cross_point_ll(Line(now, nxt), l));\n }\n }\n return ret;\n}\n\nReal ClosetPair(Polygon& ps){\n if(ps.size() <= 1) throw (0);\n sort(begin(ps), end(ps));\n\n auto compare_y = [&](const Point &a, const Point &b) {\n return a.imag() < b.imag();\n };\n Polygon beet(ps.size());\n const double INF = 1e18;\n\n function< double(int, int) > rec = [&](int left, int right) {\n if(right - left <= 1) return INF;\n int mid = (left + right) >> 1;\n auto x = ps[mid].real();\n auto ret = min(rec(left, mid), rec(mid, right));\n inplace_merge(begin(ps) + left, begin(ps) + mid, begin(ps) + right, compare_y);\n int ptr = 0;\n for(int i = left; i < right; i++) {\n if(fabs((ps[i].real()) - x) >= ret) continue;\n for(int j = 0; j < ptr; j++) {\n auto luz = ps[i] - beet[ptr - j - 1];\n if(luz.imag() >= ret) break;\n ret = min(ret, abs(luz));\n }\n beet[ptr++] = ps[i];\n }\n return ret;\n };\n return rec(0, (int) ps.size());\n}\n\npair< Point, Point > cross_point_cc(const Circle &c1, const Circle &c2) {\n Real d = abs(c1.p - c2.p);\n Real a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\n Real t = atan2(c2.p.imag() - c1.p.imag(), c2.p.real() - c1.p.real());\n Point p1 = c1.p + Point(cos(t + a) * c1.r, sin(t + a) * c1.r);\n Point p2 = c1.p + Point(cos(t - a) * c1.r, sin(t - a) * c1.r);\n return {p1, p2};\n}\n\nconst int BOTTOM = 0;\nconst int LEFT = 1;\nconst int RIGHT = 2;\nconst int TOP = 3;\n\nclass endPoint {\n public:\n Point p;\n int seg; // id of Point\n int st; // kind of Point\n endPoint(){}\n endPoint(Point inp, int inseg, int inst):p(inp),seg(inseg),st(inst){}\n bool operator<(const endPoint &ep)const {\n if(p.imag() == ep.p.imag()) return st < ep.st;\n else return p.imag() < ep.p.imag();\n }\n};\n\nendPoint EP[220000];\nint Manhattan_Intersections(vector< Segment > s){\n int n = s.size();\n double hoge;\n\n for(int i = 0, k = 0; i < n; i++){\n if(s[i].a.imag() == s[i].b.imag()){\n if(s[i].a.real() > s[i].b.real()){\n hoge = s[i].a.real();\n s[i].a.real(s[i].b.real());\n s[i].b.real(hoge);\n }\n }else if(s[i].a.imag() > s[i].b.imag()){\n hoge = s[i].a.imag();\n s[i].a.imag(s[i].b.imag());\n s[i].b.imag(hoge);\n }\n\n if(s[i].a.imag() == s[i].b.imag()){\n EP[k++] = endPoint(s[i].a, i, LEFT);\n EP[k++] = endPoint(s[i].b, i, RIGHT);\n }else{\n EP[k++] = endPoint(s[i].a, i, BOTTOM);\n EP[k++] = endPoint(s[i].b, i, TOP);\n }\n }\n\n sort(EP, EP + 2 * n);\n set<int> BT;\n BT.insert(1000000001);\n int cnt = 0;\n for(int i = 0; i < 2 * n; i++){\n if(EP[i].st == TOP) BT.erase(EP[i].p.real());\n else if(EP[i].st == BOTTOM) BT.insert(EP[i].p.real());\n else if(EP[i].st == LEFT){\n set<int>::iterator b = lower_bound(BT.begin(), BT.end(), s[EP[i].seg].a.real());\n set<int>::iterator e = upper_bound(BT.begin(), BT.end(), s[EP[i].seg].b.real());\n cnt += distance(b, e);\n }\n }\n\n return cnt;\n}\n\n// 内接円\nCircle Inscribed_Circle(const Point& a, const Point& b, const Point& c){\n double A = abs(b - c), B = abs(c - a), C = abs(a - b);\n Point x = Point((a * A + b * B + c * C) / (A + B + C));\n double r = distance_sp(Segment(a,b),x);\n return Circle(x, r);\n}\n\n// 外接円\nCircle Circumscribed_Circle(const Point& a, const Point& b, const Point& c){\n Point m1((a+b)/2.0), m2((b+c)/2.0);\n Point v((b-a).imag(), (a-b).real()), w((b-c).imag(), (c-b).real());\n Line s(m1, Point(m1+v)), t(m2, Point(m2+w));\n const Point x = cross_point_ll(s, t);\n return Circle(x, abs(a-x));\n}\n\npair< Point, Point > cross_point_cl(const Circle &c, const Line &l) {\n Point pr = projection(l, c.p);\n if(equals(abs(pr - c.p), c.r)) return {pr, pr};\n Point e = (l.b - l.a) / abs(l.b - l.a);\n auto k = sqrt(norm(c.r) - norm(pr - c.p));\n return {pr - e * k, pr + e * k};\n}\n\n// 点pを通る円の接線\npair<Point,Point> tangent_cp(const Circle &c, const Point &p) {\n return cross_point_cc(c, Circle(p, sqrt(norm(c.p - p) - c.r * c.r)));\n}\n\n// 二つの円の共通接線\nvector< Line > tangent_cc(Circle c1, Circle c2){\n vector< Line > ret;\n if(c1.r < c2.r) swap(c1,c2);\n double g = norm(c1.p-c2.p);\n if(equals(g,0.0)) return ret;\n Point u = (c2.p-c1.p)/sqrt(g);\n Point v = rotate(u, PI * 0.5);\n for(int s:{-1,1}){\n double h = (c1.r+ s*c2.r)/sqrt(g);\n if(equals(1- h*h, 0)){\n ret.emplace_back(c1.p+u*c1.r, c1.p+(u+v)*c1.r);\n }else if(1-h*h > 0){\n Point uu = u*h, vv = v*sqrt(1-h*h);\n ret.emplace_back(c1.p+(uu+vv)*c1.r, c2.p-(uu+vv)*c2.r*s);\n ret.emplace_back(c1.p+(uu-vv)*c1.r, c2.p-(uu-vv)*c2.r*s);\n }\n }\n return ret;\n}\n\nReal area_poly_c(const Polygon &p, const Circle &c) {\n if(p.size() < 3) return 0.0;\n function< Real(Circle, Point, Point) > cross_area = [&](const Circle &c, const Point &a, const Point &b) {\n Point va = c.p - a, vb = c.p - b;\n Real f = cross(va, vb), ret = 0.0;\n if(equals(f, 0.0)) return ret;\n if(max(abs(va), abs(vb)) < c.r + EPS) return f;\n if(distance_sp(Segment(a, b), c.p) > c.r - EPS) return c.r * c.r * arg(vb * conj(va));\n auto u = cross_point_cl(c, Segment(a, b));\n vector< Point > tot{a, u.first, u.second, b};\n for(int i = 0; i + 1 < tot.size(); i++) {\n ret += cross_area(c, tot[i], tot[i + 1]);\n }\n return ret;\n };\n Real A = 0;\n for(int i = 0; i < p.size(); i++) {\n A += cross_area(c, p[i], p[(i + 1) % p.size()]);\n }\n return A;\n}\n\nReal area_cc(const Circle &c1, const Circle &c2) {\n Real d = abs(c1.p - c2.p);\n if(c1.r + c2.r <= d + EPS) return 0.0;\n if(d <= fabs(c1.r - c2.r) + EPS) {\n Real r = min(c1.r, c2.r);\n return r * r * PI;\n }\n Real rc = (d * d + c1.r * c1.r - c2.r * c2.r) / (2 * d);\n Real theta = acos(rc / c1.r);\n Real phi = acos((d - rc) / c2.r);\n return (c1.r * c1.r*theta + c2.r*c2.r*phi - d*c1.r*sin(theta));\n}\n\nReal area(const Polygon &p){\n Real A = 0;\n for(int i = 0; i < p.size(); i++){\n A += cross(p[i], p[(i + 1) % p.size()]);\n }\n return A * 0.5;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n int N; cin >> N;\n Polygon p(N);\n rep(i,N) cin >> p[i];\n \n vector< Real > sum(N, 0);\n rep(i,N-1) sum[i + 1] += sum[i] + cross(p[i], p[i + 1]);\n\n int r = 0;\n Real AREA = area(p) * 2.0;\n Real ans = AREA;\n rep(l,N){\n r = max(r, l);\n while(r < N) {\n Real T = sum[r] - sum[l] + cross(p[r], p[l]);\n Real diff = AREA - 2.0 * T;\n ans = min(ans, abs(diff));\n if(diff <= 0) break;\n r++;\n }\n }\n cout.precision(17);\n cout << ans * 0.5 << endl;\n}", "accuracy": 0.6666666666666666, "time_ms": 10, "memory_kb": 9576, "score_of_the_acc": -0.7841, "final_rank": 18 } ]
aoj_0449_cpp
Persimmon As autumn deepens, the persimmon tree in our garden has borne fruit again this year. However, the weather was not good this year, so there were only three fruits. The sun shone from the top of the persimmon tree and created shadows on the ground, which were circular and overlapped or separated depending on the position of the sun. Write a program which reads the information about the shadows of each of the three persimmon fruits and finds the area of the shadows. The shadows of the three persimmon fruits all have the same radius. Input The input is given in the following form $r$ $x_1$ $y_1$ $x_2$ $y_2$ $x_3$ $y_3$ In the first line, the radius of the circle representing the shade of the three persimmon fruits $r$ ($1 \leq r \leq 500$) is given as an integer. In the next three lines, the coordinates $x_i,y_i$ ($0 \leq x_i,y_i \leq 500$) of the center of the $i$-th circle are given as integers. The coordinates of the centers of all the circles are different (if $i \ne j$, then $x_i \ne x_j$ or $y_i \ne y_j$). Output Output the shaded area of the persimmon fruit as a real number in a line. The error must not exceed plus or minus 0.00001. Sample Input and Output Sample Input 1 2 0 0 2 0 1 5 Sample Output 1 32.7856330486 Sample Input 2 3 3 2 5 2 4 5 Sample Output 2 55.2157319565
[ { "submission_id": "aoj_0449_9570638", "code_snippet": "#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n\ndouble R;\ndouble X[3], Y[3];\nconst double STEP{1.75 * 1e-5};\ndouble U[3], D[3];\n\ndouble calc(double x) {\n for (int i{} ; i < 3 ; i++) {\n if (std::abs(x - X[i]) > R) U[i] = D[i] = 0;\n else {\n double v{sqrt(R * R - std::abs(x - X[i]) * std::abs(x - X[i]))};\n U[i] = Y[i] + v;\n D[i] = Y[i] - v;\n }\n } \n double res{};\n for (int bit{1} ; bit < (1 << 3) ; bit++) {\n double d{-1e18}, u{1e18};\n for (int i{} ; i < 3 ; i++) if (bit & (1 << i)) {\n d = std::max(d, D[i]);\n u = std::min(u, U[i]);\n }\n res += (__builtin_popcount(bit) & 1 ? 1 : -1) * std::max<long double>(0, u - d);\n }\n return res;\n}\n\n\nint main() {\n std::cin >> R;\n for (int i{} ; i < 3 ; i++) std::cin >> X[i] >> Y[i];\n double ans{};\n double min{*std::min_element(X, X + 3)};\n double max{*std::max_element(X, X + 3)};\n for (double x{min - R} ; x <= max + R ; x += STEP) {\n ans += STEP * calc(x);\n }\n std::cout << std::fixed << std::setprecision(8) << ans << '\\n';\n}", "accuracy": 0.4230769230769231, "time_ms": 870, "memory_kb": 3584, "score_of_the_acc": -0.8793, "final_rank": 9 }, { "submission_id": "aoj_0449_9570636", "code_snippet": "#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n\ndouble R;\ndouble X[3], Y[3];\nconst double STEP{2e-5};\ndouble U[3], D[3];\n\ndouble calc(double x) {\n for (int i{} ; i < 3 ; i++) {\n if (std::abs(x - X[i]) > R) U[i] = D[i] = 0;\n else {\n double v{sqrt(R * R - std::abs(x - X[i]) * std::abs(x - X[i]))};\n U[i] = Y[i] + v;\n D[i] = Y[i] - v;\n }\n } \n double res{};\n for (int bit{1} ; bit < (1 << 3) ; bit++) {\n double d{-1e18}, u{1e18};\n for (int i{} ; i < 3 ; i++) if (bit & (1 << i)) {\n d = std::max(d, D[i]);\n u = std::min(u, U[i]);\n }\n res += (__builtin_popcount(bit) & 1 ? 1 : -1) * std::max<long double>(0, u - d);\n }\n return res;\n}\n\n\nint main() {\n std::cin >> R;\n for (int i{} ; i < 3 ; i++) std::cin >> X[i] >> Y[i];\n double ans{};\n double min{*std::min_element(X, X + 3)};\n double max{*std::max_element(X, X + 3)};\n for (double x{min - R} ; x <= max + R ; x += STEP) {\n ans += STEP * calc(x);\n }\n std::cout << std::fixed << std::setprecision(8) << ans << '\\n';\n}", "accuracy": 0.4230769230769231, "time_ms": 760, "memory_kb": 3516, "score_of_the_acc": -0.7667, "final_rank": 8 }, { "submission_id": "aoj_0449_9570634", "code_snippet": "#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n\ndouble R;\ndouble X[3], Y[3];\nconst double STEP{3e-5};\ndouble U[3], D[3];\n\ndouble calc(double x) {\n for (int i{} ; i < 3 ; i++) {\n if (std::abs(x - X[i]) > R) U[i] = D[i] = 0;\n else {\n double v{sqrt(R * R - std::abs(x - X[i]) * std::abs(x - X[i]))};\n U[i] = Y[i] + v;\n D[i] = Y[i] - v;\n }\n } \n double res{};\n for (int bit{1} ; bit < (1 << 3) ; bit++) {\n double d{-1e18}, u{1e18};\n for (int i{} ; i < 3 ; i++) if (bit & (1 << i)) {\n d = std::max(d, D[i]);\n u = std::min(u, U[i]);\n }\n res += (__builtin_popcount(bit) & 1 ? 1 : -1) * std::max<long double>(0, u - d);\n }\n return res;\n}\n\n\nint main() {\n std::cin >> R;\n for (int i{} ; i < 3 ; i++) std::cin >> X[i] >> Y[i];\n double ans{};\n double min{*std::min_element(X, X + 3)};\n double max{*std::max_element(X, X + 3)};\n for (double x{min - R} ; x <= max + R ; x += STEP) {\n ans += STEP * calc(x);\n }\n std::cout << std::fixed << std::setprecision(8) << ans << '\\n';\n}", "accuracy": 0.4230769230769231, "time_ms": 510, "memory_kb": 3572, "score_of_the_acc": -0.5119, "final_rank": 6 }, { "submission_id": "aoj_0449_9570632", "code_snippet": "#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n\ndouble R;\ndouble X[3], Y[3];\nconst double STEP{5e-5};\ndouble U[3], D[3];\n\ndouble calc(double x) {\n for (int i{} ; i < 3 ; i++) {\n if (std::abs(x - X[i]) > R) U[i] = D[i] = 0;\n else {\n double v{sqrt(R * R - std::abs(x - X[i]) * std::abs(x - X[i]))};\n U[i] = Y[i] + v;\n D[i] = Y[i] - v;\n }\n } \n double res{};\n for (int bit{1} ; bit < (1 << 3) ; bit++) {\n double d{-1e18}, u{1e18};\n for (int i{} ; i < 3 ; i++) if (bit & (1 << i)) {\n d = std::max(d, D[i]);\n u = std::min(u, U[i]);\n }\n res += (__builtin_popcount(bit) & 1 ? 1 : -1) * std::max<long double>(0, u - d);\n }\n return res;\n}\n\n\nint main() {\n std::cin >> R;\n for (int i{} ; i < 3 ; i++) std::cin >> X[i] >> Y[i];\n double ans{};\n double min{*std::min_element(X, X + 3)};\n double max{*std::max_element(X, X + 3)};\n for (double x{min - R} ; x <= max + R ; x += STEP) {\n ans += STEP * calc(x);\n }\n std::cout << std::fixed << std::setprecision(8) << ans << '\\n';\n}", "accuracy": 0.4230769230769231, "time_ms": 300, "memory_kb": 3516, "score_of_the_acc": -0.2973, "final_rank": 5 }, { "submission_id": "aoj_0449_9570610", "code_snippet": "#include <bits/stdc++.h>\n\ndouble R;\ndouble X[3], Y[3];\nconst double STEP{5e-5};\ndouble U[3], D[3];\n\ndouble calc(double x) {\n for (int i{} ; i < 3 ; i++) {\n if (std::abs(x - X[i]) > R) U[i] = D[i] = 0;\n else {\n double v{sqrt(R * R - std::abs(x - X[i]) * std::abs(x - X[i]))};\n U[i] = Y[i] + v;\n D[i] = Y[i] - v;\n }\n } \n double res{};\n for (int bit{1} ; bit < (1 << 3) ; bit++) {\n double d{-1e18}, u{1e18};\n for (int i{} ; i < 3 ; i++) if (bit & (1 << i)) {\n d = std::max(d, D[i]);\n u = std::min(u, U[i]);\n }\n res += (__builtin_popcount(bit) & 1 ? 1 : -1) * std::max<long double>(0, u - d);\n }\n return res;\n}\n\n\nint main() {\n std::cin >> R;\n for (int i{} ; i < 3 ; i++) std::cin >> X[i] >> Y[i];\n double ans{};\n double min{*std::min_element(X, X + 3)};\n double max{*std::max_element(X, X + 3)};\n for (double x{min - R} ; x <= max + R ; x += STEP) {\n ans += STEP * calc(x);\n }\n std::cout << std::fixed << std::setprecision(8) << ans << '\\n';\n}", "accuracy": 0.4230769230769231, "time_ms": 620, "memory_kb": 3568, "score_of_the_acc": -0.6241, "final_rank": 7 }, { "submission_id": "aoj_0449_9570609", "code_snippet": "#include <bits/stdc++.h>\n\ndouble R;\ndouble X[3], Y[3];\nconst double STEP{8e-5};\ndouble U[3], D[3];\n\ndouble calc(double x) {\n for (int i{} ; i < 3 ; i++) {\n if (std::abs(x - X[i]) > R) U[i] = D[i] = 0;\n else {\n double v{sqrt(R * R - std::abs(x - X[i]) * std::abs(x - X[i]))};\n U[i] = Y[i] + v;\n D[i] = Y[i] - v;\n }\n } \n double res{};\n for (int bit{1} ; bit < (1 << 3) ; bit++) {\n double d{-1e18}, u{1e18};\n for (int i{} ; i < 3 ; i++) if (bit & (1 << i)) {\n d = std::max(d, D[i]);\n u = std::min(u, U[i]);\n }\n res += (__builtin_popcount(bit) & 1 ? 1 : -1) * std::max<long double>(0, u - d);\n }\n return res;\n}\n\n\nint main() {\n std::cin >> R;\n for (int i{} ; i < 3 ; i++) std::cin >> X[i] >> Y[i];\n double ans{};\n double min{*std::min_element(X, X + 3)};\n double max{*std::max_element(X, X + 3)};\n for (double x{min - R} ; x <= max + R ; x += STEP) {\n ans += STEP * calc(x);\n }\n std::cout << std::fixed << std::setprecision(8) << ans << '\\n';\n}", "accuracy": 0.38461538461538464, "time_ms": 60, "memory_kb": 3604, "score_of_the_acc": -0.0528, "final_rank": 11 }, { "submission_id": "aoj_0449_9570607", "code_snippet": "#include <bits/stdc++.h>\n\ndouble R;\ndouble X[3], Y[3];\nconst double STEP{9e-5};\ndouble U[3], D[3];\n\ndouble calc(double x) {\n for (int i{} ; i < 3 ; i++) {\n if (std::abs(x - X[i]) > R) U[i] = D[i] = 0;\n else {\n double v{sqrt(R * R - std::abs(x - X[i]) * std::abs(x - X[i]))};\n U[i] = Y[i] + v;\n D[i] = Y[i] - v;\n }\n } \n double res{};\n for (int bit{1} ; bit < (1 << 3) ; bit++) {\n double d{-1e18}, u{1e18};\n for (int i{} ; i < 3 ; i++) if (bit & (1 << i)) {\n d = std::max(d, D[i]);\n u = std::min(u, U[i]);\n }\n res += (__builtin_popcount(bit) & 1 ? 1 : -1) * std::max<long double>(0, u - d);\n }\n return res;\n}\n\n\nint main() {\n std::cin >> R;\n for (int i{} ; i < 3 ; i++) std::cin >> X[i] >> Y[i];\n double ans{};\n for (double x{-1000} ; x <= 1000 ; x += STEP) {\n ans += STEP * calc(x);\n }\n std::cout << std::fixed << std::setprecision(8) << ans << '\\n';\n}", "accuracy": 0.6153846153846154, "time_ms": 930, "memory_kb": 3568, "score_of_the_acc": -0.9404, "final_rank": 2 }, { "submission_id": "aoj_0449_9570604", "code_snippet": "#include <bits/stdc++.h>\n\ndouble R;\ndouble X[3], Y[3];\nconst double STEP{1e-4};\ndouble U[3], D[3];\n\ndouble calc(double x) {\n for (int i{} ; i < 3 ; i++) {\n if (std::abs(x - X[i]) > R) U[i] = D[i] = 0;\n else {\n double v{sqrt(R * R - std::abs(x - X[i]) * std::abs(x - X[i]))};\n U[i] = Y[i] + v;\n D[i] = Y[i] - v;\n }\n } \n double res{};\n for (int bit{1} ; bit < (1 << 3) ; bit++) {\n double d{-1e18}, u{1e18};\n for (int i{} ; i < 3 ; i++) if (bit & (1 << i)) {\n d = std::max(d, D[i]);\n u = std::min(u, U[i]);\n }\n res += (__builtin_popcount(bit) & 1 ? 1 : -1) * std::max<long double>(0, u - d);\n }\n return res;\n}\n\n\nint main() {\n std::cin >> R;\n for (int i{} ; i < 3 ; i++) std::cin >> X[i] >> Y[i];\n double ans{};\n for (double x{-1000} ; x <= 1000 ; x += STEP) {\n ans += STEP * calc(x);\n }\n std::cout << std::fixed << std::setprecision(8) << ans << '\\n';\n}", "accuracy": 0.2692307692307692, "time_ms": 810, "memory_kb": 3568, "score_of_the_acc": -0.818, "final_rank": 12 }, { "submission_id": "aoj_0449_9570601", "code_snippet": "#include <bits/stdc++.h>\n\nlong double R;\nlong double X[3], Y[3];\nconst long double STEP{2e-4};\nlong double U[3], D[3];\n\nlong double calc(long double x) {\n for (int i{} ; i < 3 ; i++) {\n if (std::abs(x - X[i]) > R) U[i] = D[i] = 0;\n else {\n long double v{sqrtl(R * R - std::abs(x - X[i]) * std::abs(x - X[i]))};\n U[i] = Y[i] + v;\n D[i] = Y[i] - v;\n }\n } \n long double res{};\n for (int bit{1} ; bit < (1 << 3) ; bit++) {\n long double d{-1e18}, u{1e18};\n for (int i{} ; i < 3 ; i++) if (bit & (1 << i)) {\n d = std::max(d, D[i]);\n u = std::min(u, U[i]);\n }\n res += (__builtin_popcount(bit) & 1 ? 1 : -1) * std::max<long double>(0, u - d);\n }\n return res;\n}\n\n\nint main() {\n std::cin >> R;\n for (int i{} ; i < 3 ; i++) std::cin >> X[i] >> Y[i];\n long double ans{};\n for (long double x{-1000} ; x <= 1000 ; x += STEP) {\n ans += STEP * calc(x);\n }\n std::cout << std::fixed << std::setprecision(8) << ans << '\\n';\n}", "accuracy": 0.038461538461538464, "time_ms": 770, "memory_kb": 3476, "score_of_the_acc": -0.7768, "final_rank": 20 }, { "submission_id": "aoj_0449_9160454", "code_snippet": "#pragma region Macros\n\n#pragma GCC optimize(\"O3,unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n\n#include <boost/geometry.hpp>\n#include <boost/geometry/geometry.hpp>\n#include <boost/geometry/geometries/box.hpp>\n#include <boost/geometry/geometries/polygon.hpp>\n#include <boost/geometry/geometries/point_xy.hpp>\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define pb emplace_back\n#define endl '\\n'\n\n#pragma endregion\n\nnamespace bg = boost::geometry;\nnamespace bgsg = boost::geometry::strategy::buffer;\n\ntypedef bg::model::d2::point_xy<float> point;\ntypedef bg::model::box<point> box;\ntypedef bg::model::polygon<point> polygon;\n\nsigned main() {\n cout << fixed << setprecision(10);\n\n float r, x1, y1, x2, y2, x3, y3; // この問題はrが共通\n cin >> r >> x1 >> y1 >> x2 >> y2 >> x3 >> y3;\n point c1(x1, y1), c2(x2, y2), c3(x3, y3);\n\n int points_per_circle = 1300000; //この個数の点で近似している? 最低3\n bgsg::distance_symmetric<float> distance_strategy(r);\n bgsg::join_round join_strategy(points_per_circle);\n bgsg::end_round end_strategy(points_per_circle);\n bgsg::point_circle circle_strategy(points_per_circle);\n bgsg::side_straight side_strategy;\n\n bg::model::multi_polygon<polygon> C1, C2, C3;\n\n bg::buffer(c1, C1, distance_strategy, side_strategy, join_strategy, end_strategy, circle_strategy);\n bg::buffer(c2, C2, distance_strategy, side_strategy, join_strategy, end_strategy, circle_strategy);\n bg::buffer(c3, C3, distance_strategy, side_strategy, join_strategy, end_strategy, circle_strategy);\n\n\n bg::model::multi_polygon<polygon> C4;\n bg::union_(C1.front(), C2.front(), C4);\n\n bg::model::multi_polygon<polygon> C5;\n bg::union_(C3.front(), C4.front(), C5);\n\n float U = 0; // 和集合の面積\n int sz = C5.size();\n for (int i = 0; i < sz; i++) {\n U += bg::area(C5[i]);\n }\n cout << U << endl;\n}", "accuracy": 0.07692307692307693, "time_ms": 860, "memory_kb": 244948, "score_of_the_acc": -1.8673, "final_rank": 16 }, { "submission_id": "aoj_0449_9160398", "code_snippet": "#pragma region Macros\n\n#pragma GCC optimize(\"O3,unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n\n#include <boost/geometry.hpp>\n#include <boost/geometry/geometry.hpp>\n#include <boost/geometry/geometries/box.hpp>\n#include <boost/geometry/geometries/polygon.hpp>\n#include <boost/geometry/geometries/point_xy.hpp>\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define pb emplace_back\n#define endl '\\n'\n\n#pragma endregion\n\nnamespace bg = boost::geometry;\nnamespace bgsg = boost::geometry::strategy::buffer;\n\ntypedef bg::model::d2::point_xy<double> point;\ntypedef bg::model::box<point> box;\ntypedef bg::model::polygon<point> polygon;\n\nsigned main() {\n cout << fixed << setprecision(10);\n\n double r, x1, y1, x2, y2, x3, y3; // この問題はrが共通\n cin >> r >> x1 >> y1 >> x2 >> y2 >> x3 >> y3;\n point c1(x1, y1), c2(x2, y2), c3(x3, y3);\n\n int points_per_circle = 1000000;\n // 何? 72や90にしているのも見る。この個数の点で近似している? 最低3っぽい\n bgsg::distance_symmetric<double> distance_strategy(r);\n bgsg::join_round join_strategy(points_per_circle);\n bgsg::end_round end_strategy(points_per_circle);\n bgsg::point_circle circle_strategy(points_per_circle);\n bgsg::side_straight side_strategy;\n\n bg::model::multi_polygon<polygon> C1, C2, C3;\n\n bg::buffer(c1, C1, distance_strategy, side_strategy, join_strategy, end_strategy, circle_strategy);\n bg::buffer(c2, C2, distance_strategy, side_strategy, join_strategy, end_strategy, circle_strategy);\n bg::buffer(c3, C3, distance_strategy, side_strategy, join_strategy, end_strategy, circle_strategy);\n\n\n bg::model::multi_polygon<polygon> C4;\n bg::union_(C1.front(), C2.front(), C4);\n\n bg::model::multi_polygon<polygon> C5;\n bg::union_(C3.front(), C4.front(), C5);\n\n double U = 0; // 和集合の面積\n int sz = C5.size();\n for (int i = 0; i < sz; i++) {\n U += bg::area(C5[i]);\n }\n cout << U << endl;\n}", "accuracy": 0.07692307692307693, "time_ms": 480, "memory_kb": 159924, "score_of_the_acc": -1.1279, "final_rank": 15 }, { "submission_id": "aoj_0449_7528850", "code_snippet": "#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#line 1 \"f.cpp\"\n#include<bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < int(n); ++i)\n#define repp(i,n,m) for (int i = m; i < int(n); ++i)\n#define reb(i,n) for (int i = int(n)-1; i >= 0; --i)\n#define all(v) v.begin(),v.end()\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<int,int>;\nusing PL = pair<ll,ll>;\n\ntemplate<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}\n\ntemplate<typename T1, typename T2>void print(pair<T1,T2> a);\ntemplate<typename T>void print(vector<T> v);\ntemplate<typename T>void print(vector<vector<T>> v);\nvoid print(){ putchar(' '); }\nvoid print(bool a){ printf(\"%d\", a); }\nvoid print(int a){ printf(\"%d\", a); }\nvoid print(long a){ printf(\"%ld\", a); }\nvoid print(long long a){ printf(\"%lld\", a); }\nvoid print(char a){ printf(\"%c\", a); }\nvoid print(char a[]){ printf(\"%s\", a); }\nvoid print(const char a[]){ printf(\"%s\", a); }\nvoid print(long double a){ printf(\"%.15Lf\", a); }\nvoid print(const string& a){ for(auto&& i : a) print(i); }\nvoid print(unsigned int a){ printf(\"%u\", a); }\ntemplate<class T> void print(const T& a){ cout << a;}\nint out(){ putchar('\\n'); return 0; }\ntemplate<class T> int out(const T& t){ print(t); putchar('\\n'); return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\ntemplate<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}\ntemplate<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}\ntemplate<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}\n\ntemplate<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}\ntemplate<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\n\nvoid fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);}\n\nnamespace noya2{\n\nconst int INF = 1001001007;\nconst long long mod1 = 998244353;\nconst long long mod2 = 1000000007;\nconst long long inf = 2e18;\nconst long double pi = 3.14159265358979323;\nconst long double eps = 1e-7;\nvector<int> dx = {0,1,0,-1,1,1,-1,-1};\nvector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\nvoid o(){out(\"!?\");}\nvoid yn(bool f){out(f ? \"Yes\" : \"No\");}\nvoid YN(bool F){out(F ? \"YES\" : \"NO\");}\ntemplate<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}\ntemplate<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}\n\n} // namespace noya2\nusing namespace noya2;\n\n\nvoid solve(){\n ld r; cin >> r;\n int n = 3;\n vector<ld> xs(n), ys(n);\n rep(i,n) cin >> xs[i] >> ys[i];\n const int m = 2e7;\n const ld d = ld(1500) / ld(m);\n const ld le = -500;\n const ld ri = 1000;\n ld sum = 0;\n rep(t,m){\n ld x = le + d * (ld(t) + 0.5);\n vector<pair<ld,int>> vec;\n rep(i,n){\n ld rem = r * r - (x - xs[i]) * (x - xs[i]);\n if (rem > 0){\n ld sqr = sqrtl(rem);\n ld ly = ys[i] - sqr;\n ld ry = ys[i] + sqr;\n vec.emplace_back(ly,1);\n vec.emplace_back(ry,-1);\n }\n }\n sort(all(vec));\n int cnt = 0;\n ld lx = -1e7;\n for (auto p : vec){\n if (cnt > 0){\n ld rx = p.first;\n if (rx > lx) sum += (rx - lx) * d;\n }\n lx = p.first;\n cnt += p.second;\n }\n }\n out(sum);\n}\n\nint main(){\n fast_io();\n int t = 1; //cin >> t;\n while(t--) solve();\n}", "accuracy": 0.5, "time_ms": 940, "memory_kb": 3608, "score_of_the_acc": -0.9508, "final_rank": 3 }, { "submission_id": "aoj_0449_7528830", "code_snippet": "#line 1 \"f.cpp\"\n#include<bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < int(n); ++i)\n#define repp(i,n,m) for (int i = m; i < int(n); ++i)\n#define reb(i,n) for (int i = int(n)-1; i >= 0; --i)\n#define all(v) v.begin(),v.end()\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<int,int>;\nusing PL = pair<ll,ll>;\n\ntemplate<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}\n\ntemplate<typename T1, typename T2>void print(pair<T1,T2> a);\ntemplate<typename T>void print(vector<T> v);\ntemplate<typename T>void print(vector<vector<T>> v);\nvoid print(){ putchar(' '); }\nvoid print(bool a){ printf(\"%d\", a); }\nvoid print(int a){ printf(\"%d\", a); }\nvoid print(long a){ printf(\"%ld\", a); }\nvoid print(long long a){ printf(\"%lld\", a); }\nvoid print(char a){ printf(\"%c\", a); }\nvoid print(char a[]){ printf(\"%s\", a); }\nvoid print(const char a[]){ printf(\"%s\", a); }\nvoid print(long double a){ printf(\"%.15Lf\", a); }\nvoid print(const string& a){ for(auto&& i : a) print(i); }\nvoid print(unsigned int a){ printf(\"%u\", a); }\ntemplate<class T> void print(const T& a){ cout << a;}\nint out(){ putchar('\\n'); return 0; }\ntemplate<class T> int out(const T& t){ print(t); putchar('\\n'); return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\ntemplate<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}\ntemplate<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}\ntemplate<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}\n\ntemplate<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}\ntemplate<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\n\nvoid fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);}\n\nnamespace noya2{\n\nconst int INF = 1001001007;\nconst long long mod1 = 998244353;\nconst long long mod2 = 1000000007;\nconst long long inf = 2e18;\nconst long double pi = 3.14159265358979323;\nconst long double eps = 1e-7;\nvector<int> dx = {0,1,0,-1,1,1,-1,-1};\nvector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\nvoid o(){out(\"!?\");}\nvoid yn(bool f){out(f ? \"Yes\" : \"No\");}\nvoid YN(bool F){out(F ? \"YES\" : \"NO\");}\ntemplate<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}\ntemplate<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}\n\n} // namespace noya2\nusing namespace noya2;\n\n\nvoid solve(){\n ld r; cin >> r;\n int n = 3;\n vector<ld> xs(n), ys(n);\n rep(i,n) cin >> xs[i] >> ys[i];\n const int m = 2e7;\n const ld d = ld(1500) / ld(m);\n const ld le = -500;\n const ld ri = 1000;\n ld sum = 0;\n rep(t,m){\n ld x = le + d * (ld(t) + 0.5);\n vector<pair<ld,int>> vec;\n rep(i,n){\n ld rem = r * r - (x - xs[i]) * (x - xs[i]);\n if (rem > 0){\n ld ly = ys[i] - sqrtl(rem);\n ld ry = ys[i] + sqrtl(rem);\n vec.emplace_back(ly,1);\n vec.emplace_back(ry,-1);\n }\n }\n sort(all(vec));\n int cnt = 0;\n ld ix = -1e7;\n for (auto p : vec){\n if (cnt > 0){\n ld lx = ix;\n ld rx = p.first;\n if (rx > lx) sum += (rx - lx) * d;\n }\n ix = p.first;\n cnt += p.second;\n }\n }\n out(sum);\n}\n\nint main(){\n fast_io();\n int t = 1; //cin >> t;\n while(t--) solve();\n}", "accuracy": 0.5, "time_ms": 990, "memory_kb": 3540, "score_of_the_acc": -1.0015, "final_rank": 4 }, { "submission_id": "aoj_0449_7528828", "code_snippet": "#line 1 \"f.cpp\"\n#include<bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < int(n); ++i)\n#define repp(i,n,m) for (int i = m; i < int(n); ++i)\n#define reb(i,n) for (int i = int(n)-1; i >= 0; --i)\n#define all(v) v.begin(),v.end()\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<int,int>;\nusing PL = pair<ll,ll>;\n\ntemplate<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}\n\ntemplate<typename T1, typename T2>void print(pair<T1,T2> a);\ntemplate<typename T>void print(vector<T> v);\ntemplate<typename T>void print(vector<vector<T>> v);\nvoid print(){ putchar(' '); }\nvoid print(bool a){ printf(\"%d\", a); }\nvoid print(int a){ printf(\"%d\", a); }\nvoid print(long a){ printf(\"%ld\", a); }\nvoid print(long long a){ printf(\"%lld\", a); }\nvoid print(char a){ printf(\"%c\", a); }\nvoid print(char a[]){ printf(\"%s\", a); }\nvoid print(const char a[]){ printf(\"%s\", a); }\nvoid print(long double a){ printf(\"%.15Lf\", a); }\nvoid print(const string& a){ for(auto&& i : a) print(i); }\nvoid print(unsigned int a){ printf(\"%u\", a); }\ntemplate<class T> void print(const T& a){ cout << a;}\nint out(){ putchar('\\n'); return 0; }\ntemplate<class T> int out(const T& t){ print(t); putchar('\\n'); return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\ntemplate<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}\ntemplate<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}\ntemplate<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}\n\ntemplate<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}\ntemplate<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\n\nvoid fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);}\n\nnamespace noya2{\n\nconst int INF = 1001001007;\nconst long long mod1 = 998244353;\nconst long long mod2 = 1000000007;\nconst long long inf = 2e18;\nconst long double pi = 3.14159265358979323;\nconst long double eps = 1e-7;\nvector<int> dx = {0,1,0,-1,1,1,-1,-1};\nvector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\nvoid o(){out(\"!?\");}\nvoid yn(bool f){out(f ? \"Yes\" : \"No\");}\nvoid YN(bool F){out(F ? \"YES\" : \"NO\");}\ntemplate<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}\ntemplate<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}\n\n} // namespace noya2\nusing namespace noya2;\n\n\nvoid solve(){\n ld r; cin >> r;\n int n = 3;\n vector<ld> xs(n), ys(n);\n rep(i,n) cin >> xs[i] >> ys[i];\n const int m = 5e6;\n const ld d = ld(1500) / ld(m);\n const ld le = -500;\n const ld ri = 1000;\n ld sum = 0;\n rep(t,m){\n ld x = le + d * (ld(t) + 0.5);\n vector<pair<ld,int>> vec;\n rep(i,n){\n ld rem = r * r - (x - xs[i]) * (x - xs[i]);\n if (rem > 0){\n ld ly = ys[i] - sqrtl(rem);\n ld ry = ys[i] + sqrtl(rem);\n vec.emplace_back(ly,1);\n vec.emplace_back(ry,-1);\n }\n }\n sort(all(vec));\n int cnt = 0;\n ld ix = -1e7;\n for (auto p : vec){\n if (cnt > 0){\n ld lx = ix;\n ld rx = p.first;\n if (rx > lx) sum += (rx - lx) * d;\n }\n ix = p.first;\n cnt += p.second;\n }\n }\n out(sum);\n}\n\nint main(){\n fast_io();\n int t = 1; //cin >> t;\n while(t--) solve();\n}", "accuracy": 0.07692307692307693, "time_ms": 50, "memory_kb": 3532, "score_of_the_acc": -0.0423, "final_rank": 14 }, { "submission_id": "aoj_0449_6941758", "code_snippet": "#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <stdio.h>\n#include <math.h>\n#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <set>\n#include <map>\n#include <unordered_set>\n#include <unordered_map>\n#include <queue>\n#include <string>\n#include <stack>\n#include <numeric>\n#include <algorithm>\nusing namespace std;\nusing ll = long long;\n//#include <atcoder/all>\n//using namespace atcoder;\n//using mint = modint998244353;\n#define rep(i, n) for (ll i = 0; i < n; i++)\n#define ALL(a) (a).begin(), (a).end()\n\nint main()\n{\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int r;\n cin >> r;\n vector<vector<int>> a(3, vector<int>(2));\n rep(i, 3) rep(j, 2) cin >> a[i][j];\n double x = -500;\n const double dx = 1e-5;\n double ans = 0;\n vector<double> le(3), ri(3);\n while (x < 1000)\n {\n rep(i, 3)\n {\n const double s = abs(x - a[i][0]);\n if (s > r)\n {\n le[i] = ri[i] = 0;\n continue;\n }\n const double y = sqrt(r * r - s * s);\n le[i] = a[i][1] - y;\n ri[i] = a[i][1] + y;\n }\n for (int i = 0; i < 3; i++)\n for (int j = 2; j > i; j--)\n if (le[i] > le[j])\n swap(le[i], le[j]), swap(ri[i], ri[j]);\n for (int i = 0; i < 3;)\n {\n int j = i + 1;\n double has1 = le[i];\n double has2 = ri[i];\n while (j != 3 && has2 >= le[j])\n {\n has2 = max(has2, ri[j]);\n j++;\n }\n ans += has2 - has1;\n i = j;\n }\n x += dx;\n }\n cout << ans * dx << endl;\n return 0;\n}", "accuracy": 0.4230769230769231, "time_ms": 950, "memory_kb": 3548, "score_of_the_acc": -0.9607, "final_rank": 10 }, { "submission_id": "aoj_0449_5875206", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define sqr(x) ((x)*(x))\n#define maxrec 64\n\n\nint n = 3;\ndouble r, x[10], y[10];\n\nvector<pair<double, double> >Merge(vector<pair<double, double> >v)\n{\n\tdouble eps = 1e-8;\n\t\n if (v.empty()) return {};\n sort(v.begin(), v.end());\n vector<pair<double, double> > ret;\n int n = v.size();\n for (int i=0; i<n; )\n\t{\n double L = v[i].first;\n double R = v[i].second;\n int j = i;\n while ((j + 1 < n) && (v[j + 1].first < R + eps))\n\t\t{\n j++;\n R = max(R, v[j].second);\n }\n ret.push_back(make_pair(L, R));\n i = j + 1;\n }\n return ret;\n}\n\ndouble f(double X, double eps = 1e-8)\n{\n vector<pair<double, double> > Cir, Mgc;\n for (int i=1; i<=n; i++)\n\t{\n if ((X > x[i] - r + eps) && (X < x[i] + r - eps))\n\t\t{\n double d = sqrt(sqr(r) - sqr(X - x[i]));\n Cir.push_back(make_pair(y[i] - d, y[i] + d));\n }\n }\n \n Mgc = Merge(Cir);\t\n double ret = 0;\n for (auto &t : Mgc) {\n ret += t.second - t.first;\n }\n return ret;\n}\n\ndouble Adaptive(double l, double r, double m, double eps, double s, double fl, double fr, double fm, int lim)\n{\n double h = (r - l) / 12;\n double u = ldexp(l + m, -1), v = ldexp(m + r, -1);\n double fu = f(u), fv = f(v);\n double sl = (fl + fm + ldexp(fu, 2)) * h, sr = (fm + fr + ldexp(fv, 2)) * h, s2 = sl + sr;\n if ((lim <= 0) || (fabs(s2 - s) <= eps)) return s2 + (s2 - s) / 15;\n eps = ldexp(eps, -1); --lim;\n \n return Adaptive(l, m, u, eps, sl, fl, fm, fu, lim) + Adaptive(m, r, v, eps, sr, fm, fr, fv, lim);\n}\n\ndouble Simpson(double l, double r, double eps = 1e-8)\n{\n\tdouble m = ldexp(l + r, -1);\n double fl = f(l), fm = f(m), fr = f(r);\n return Adaptive(l, r, m, eps * 63, (r - l) / 6 * (fl + fr + ldexp(fm, 2)), fl, fr, fm, maxrec);\n}\n\nint main()\n{\n\tvector<pair<double, double> > Cir, Mgc;\n\tdouble eps = 1e-8;\n\t\n\tscanf(\"%lf\", &r);\n\t\n\tfor (int i=1; i<=n; i++)\n\t{\n\t\tscanf(\"%lf%lf\", &x[i], &y[i]);\n\t\tCir.push_back(make_pair(x[i] - r, x[i] + r));\n\t}\n\t\n\tMgc = Merge(Cir);\n\tdouble Res = 0;\n\tfor (auto &t:Mgc) Res += Simpson(t.first, t.second);\n\t\n\tprintf(\"%.10lf\\n\", Res);\n}", "accuracy": 1, "time_ms": 890, "memory_kb": 3560, "score_of_the_acc": -0.8996, "final_rank": 1 }, { "submission_id": "aoj_0449_5426158", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\n\t\tif(fabs(x-p.x) > EPS){\n\n\t\t\treturn x < p.x;\n\t\t}else{\n\n\t\t\treturn y < p.y;\n\t\t}\n\t}\n\n\tbool operator == (const Point &p) const{\n\t\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n\t}\n\n\n\tvoid debug(){\n\n\t\tprintf(\"(%.3lf,%.3lf)\\n\",x,y);\n\t}\n\n\tdouble x,y;\n};\n\ntypedef Point Vector;\n\nstruct Line{\n\tLine(){\n\n\t}\n\tLine(Point a,Point b){\n\t\tp[0] = a;\n\t\tp[1] = b;\n\t}\n\t/*void outPut(){\n\n\t\tprintf(\"(%.3lf,%.3lf)-(%.3lf,%.3lf)\\n\",p[0].x,p[0].y,p[1].x,p[1].y);\n\t}*/\n\tPoint p[2];\n};\n\nstruct Circle{\n\tPoint center;\n\tdouble r;\n};\n\nCircle C[3];\n\n\ndouble calc_dist(Point A,Point B){\n\n\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\n}\n\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2;\nstatic const int ONLINE_FRONT = -2;\nstatic const int ON_SEGMENT = 0;\n\n/*\n * p0を基準点として、p1から見てp2が\n * 反時計回り側にあれば\n * COUNTER_CLOCKWISE\n * */\nint ccw(Point p0,Point p1,Point p2){\n\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\n\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS)return CLOCKWISE;\n\tif(dot(a,b) < -EPS)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\n\nPoint project(Line l,Point p){\n\n\tVector base = l.p[1]-l.p[0];\n\tdouble r = dot(p-l.p[0],base)/norm(base);\n\treturn l.p[0]+base*r;\n}\n\n//円と直線の交点を求める関数\nvector<Point> getCrossPoints(Circle c,Line l){\n\n\tvector<Point> ret;\n\n\tVector pr = project(l,c.center);\n\tVector e = (l.p[1]-l.p[0])/abs(l.p[1]-l.p[0]);\n\n\tdouble base;\n\n\tif(fabs(c.r*c.r-norm(pr-c.center)) < EPS){\n\n\t\tbase = 0;\n\t}else{\n\t\tbase = sqrt(c.r*c.r-norm(pr-c.center));\n\t}\n\n\tret.push_back(Point(pr+e*base));\n\tret.push_back(Point(pr-e*base));\n\n\treturn ret;\n}\n\n\nPoint calc_minus(Point a,Point b){\n Point ret;\n\n ret.x = a.x-b.x;\n ret.y = a.y-b.y;\n\n return ret;\n}\n\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\nint main(){\n\n\tdouble R;\n\tscanf(\"%lf\",&R);\n\n\tdouble left = HUGE_NUM,right = -HUGE_NUM;\n\n\tfor(int i = 0; i < 3; i++){\n\n\t\tscanf(\"%lf %lf\",&C[i].center.x,&C[i].center.y);\n\t\tC[i].r = R;\n\n\t\tleft = min(left,C[i].center.x-R);\n\t\tright = max(right,C[i].center.x+R);\n\t}\n\n\tdouble diff = 0.0002;\n\tdouble NUM = 10000;\n\n\tdouble ans = 0;\n\n\tfor(double x = left; x <= right; x += diff){\n\n\t\tLine tmp_line = Line(Point(x,-NUM),Point(x,NUM));\n\n\t\tvector<Point> P;\n\n\t\tfor(int i = 0; i < 3; i++){\n\n\t\t\tdouble tmp_dist = fabs(x-C[i].center.x);\n\n\t\t\tif(tmp_dist > R+EPS)continue;\n\n\t\t\tvector<Point> vec = getCrossPoints(C[i],tmp_line);\n\t\t\tfor(int a = 0; a < vec.size(); a++){\n\n\t\t\t\tP.push_back(vec[a]);\n\t\t\t}\n\t\t}\n\n\t\tsort(P.begin(),P.end());\n\n\t\tfor(int i = 1; i < P.size(); i++){\n\n\t\t\tif(P.size() == 2){\n\n\t\t\t\tans += (P[i].y-P[i-1].y)*diff;\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tPoint mid = (P[i]+P[i-1])/2;\n\t\t\tbool FLG = false;\n\t\t\tfor(int a = 0; a < 3; a++){\n\n\t\t\t\tif(calc_dist(C[a].center,mid) <= R+EPS){\n\n\t\t\t\t\tFLG = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif(FLG){\n\n\t\t\t\tans += (P[i].y-P[i-1].y)*diff;\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%.12lf\\n\",ans);\n\n\treturn 0;\n}", "accuracy": 0.038461538461538464, "time_ms": 10, "memory_kb": 3200, "score_of_the_acc": -0.0001, "final_rank": 17 }, { "submission_id": "aoj_0449_5426091", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\nenum Type{\n\tTop,\n\tUnder,\n};\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\n\t\tif(fabs(x-p.x) > EPS){\n\n\t\t\treturn x < p.x;\n\t\t}else{\n\n\t\t\treturn y < p.y;\n\t\t}\n\t}\n\n\tbool operator == (const Point &p) const{\n\t\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n\t}\n\n\n\tvoid debug(){\n\n\t\tprintf(\"(%.3lf,%.3lf)\\n\",x,y);\n\t}\n\n\tdouble x,y;\n};\n\ntypedef Point Vector;\n\nstruct Line{\n\tLine(){\n\n\t}\n\tLine(Point a,Point b){\n\t\tp[0] = a;\n\t\tp[1] = b;\n\t}\n\t/*void outPut(){\n\n\t\tprintf(\"(%.3lf,%.3lf)-(%.3lf,%.3lf)\\n\",p[0].x,p[0].y,p[1].x,p[1].y);\n\t}*/\n\tPoint p[2];\n};\n\nstruct Circle{\n\tPoint center;\n\tdouble r;\n};\n\nstruct Info{\n\tInfo(Point arg_p,Type arg_type,int arg_index){\n\t\tp = arg_p;\n\t\ttype = arg_type;\n\t\tindex = arg_index;\n\t}\n\tbool operator<(const struct Info& arg) const{\n\n\t\treturn p < arg.p;\n\t}\n\tPoint p;\n\tType type;\n\tint index;\n};\n\nCircle C[3];\n\n\ndouble calc_dist(Point A,Point B){\n\n\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\n}\n\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2;\nstatic const int ONLINE_FRONT = -2;\nstatic const int ON_SEGMENT = 0;\n\n/*\n * p0を基準点として、p1から見てp2が\n * 反時計回り側にあれば\n * COUNTER_CLOCKWISE\n * */\nint ccw(Point p0,Point p1,Point p2){\n\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\n\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS)return CLOCKWISE;\n\tif(dot(a,b) < -EPS)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\n\nPoint project(Line l,Point p){\n\n\tVector base = l.p[1]-l.p[0];\n\tdouble r = dot(p-l.p[0],base)/norm(base);\n\treturn l.p[0]+base*r;\n}\n\n//円と直線の交点を求める関数\nvector<Point> getCrossPoints(Circle c,Line l){\n\n\tvector<Point> ret;\n\n\tVector pr = project(l,c.center);\n\tVector e = (l.p[1]-l.p[0])/abs(l.p[1]-l.p[0]);\n\n\tdouble base;\n\n\tif(fabs(c.r*c.r-norm(pr-c.center)) < EPS){\n\n\t\tbase = 0;\n\t}else{\n\t\tbase = sqrt(c.r*c.r-norm(pr-c.center));\n\t}\n\n\tret.push_back(Point(pr+e*base));\n\tret.push_back(Point(pr-e*base));\n\n\treturn ret;\n}\n\n\nPoint calc_minus(Point a,Point b){\n Point ret;\n\n ret.x = a.x-b.x;\n ret.y = a.y-b.y;\n\n return ret;\n}\n\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\nint main(){\n\n\tdouble R;\n\tscanf(\"%lf\",&R);\n\n\tdouble left = HUGE_NUM,right = -HUGE_NUM;\n\n\tfor(int i = 0; i < 3; i++){\n\n\t\tscanf(\"%lf %lf\",&C[i].center.x,&C[i].center.y);\n\t\tC[i].r = R;\n\n\t\tleft = min(left,C[i].center.x-R);\n\t\tright = max(right,C[i].center.x+R);\n\t}\n\n\tdouble diff = 0.00005;\n\tdouble NUM = 10000;\n\n\tdouble ans = 0;\n\n\tfor(double x = left; x <= right; x += diff){\n\n\t\tLine tmp_line = Line(Point(x,-NUM),Point(x,NUM));\n\n\t\tvector<Info> P;\n\n\t\tfor(int i = 0; i < 3; i++){\n\n\t\t\tdouble tmp_dist = getDistanceLP(tmp_line,C[i].center);\n\t\t\tif(tmp_dist > R+EPS)continue;\n\n\t\t\tvector<Point> vec = getCrossPoints(C[i],tmp_line);\n\n\t\t\tif(vec[0].y > vec[1].y){\n\n\t\t\t\tswap(vec[0],vec[1]);\n\t\t\t}\n\t\t\tP.push_back(Info(vec[0],Under,i));\n\t\t\tP.push_back(Info(vec[1],Top,i));\n\t\t}\n\n\t\tif(P.size() == 0)continue;\n\n\t\tsort(P.begin(),P.end());\n\n\t\tdouble pre = -1;\n\t\tint sum = 0;\n\n\t\tfor(int i = 0; i < P.size(); i++){\n\n\t\t\tif(i == 0){\n\n\t\t\t\tsum = 1;\n\t\t\t\tpre = P[i].p.y;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(sum > 0){\n\n\t\t\t\tans += (P[i].p.y-pre)*diff;\n\t\t\t}\n\t\t\tif(P[i].type == Under){\n\n\t\t\t\tsum++;\n\t\t\t}else{\n\n\t\t\t\tsum--;\n\t\t\t}\n\t\t\tpre = P[i].p.y;\n\t\t}\n\t}\n\n\tprintf(\"%.12lf\\n\",ans);\n\n\treturn 0;\n}", "accuracy": 0.11538461538461539, "time_ms": 140, "memory_kb": 3200, "score_of_the_acc": -0.1328, "final_rank": 13 }, { "submission_id": "aoj_0449_5426039", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\nenum Type{\n\tTop,\n\tUnder,\n};\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\n\t\tif(fabs(x-p.x) > EPS){\n\n\t\t\treturn x < p.x;\n\t\t}else{\n\n\t\t\treturn y < p.y;\n\t\t}\n\t}\n\n\tbool operator == (const Point &p) const{\n\t\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n\t}\n\n\n\tvoid debug(){\n\n\t\tprintf(\"(%.3lf,%.3lf)\\n\",x,y);\n\t}\n\n\tdouble x,y;\n};\n\ntypedef Point Vector;\n\nstruct Line{\n\tLine(){\n\n\t}\n\tLine(Point a,Point b){\n\t\tp[0] = a;\n\t\tp[1] = b;\n\t}\n\t/*void outPut(){\n\n\t\tprintf(\"(%.3lf,%.3lf)-(%.3lf,%.3lf)\\n\",p[0].x,p[0].y,p[1].x,p[1].y);\n\t}*/\n\tPoint p[2];\n};\n\nstruct Circle{\n\tPoint center;\n\tdouble r;\n};\n\nstruct Info{\n\tInfo(Point arg_p,Type arg_type){\n\t\tp = arg_p;\n\t\ttype = arg_type;\n\t}\n\tbool operator<(const struct Info& arg) const{\n\n\t\treturn p < arg.p;\n\t}\n\tPoint p;\n\tType type;\n};\n\nCircle C[3];\n\n\ndouble calc_dist(Point A,Point B){\n\n\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\n}\n\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2;\nstatic const int ONLINE_FRONT = -2;\nstatic const int ON_SEGMENT = 0;\n\n/*\n * p0を基準点として、p1から見てp2が\n * 反時計回り側にあれば\n * COUNTER_CLOCKWISE\n * */\nint ccw(Point p0,Point p1,Point p2){\n\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\n\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS)return CLOCKWISE;\n\tif(dot(a,b) < -EPS)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\n\nPoint project(Line l,Point p){\n\n\tVector base = l.p[1]-l.p[0];\n\tdouble r = dot(p-l.p[0],base)/norm(base);\n\treturn l.p[0]+base*r;\n}\n\n//円と直線の交点を求める関数\nvector<Point> getCrossPoints(Circle c,Line l){\n\n\tvector<Point> ret;\n\n\tVector pr = project(l,c.center);\n\tVector e = (l.p[1]-l.p[0])/abs(l.p[1]-l.p[0]);\n\n\tdouble base;\n\n\tif(fabs(c.r*c.r-norm(pr-c.center)) < EPS){\n\n\t\tbase = 0;\n\t}else{\n\t\tbase = sqrt(c.r*c.r-norm(pr-c.center));\n\t}\n\n\tret.push_back(Point(pr+e*base));\n\tret.push_back(Point(pr-e*base));\n\n\treturn ret;\n}\n\n\nPoint calc_minus(Point a,Point b){\n Point ret;\n\n ret.x = a.x-b.x;\n ret.y = a.y-b.y;\n\n return ret;\n}\n\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\nint main(){\n\n\tdouble R;\n\tscanf(\"%lf\",&R);\n\n\tdouble left = HUGE_NUM,right = -HUGE_NUM;\n\n\tfor(int i = 0; i < 3; i++){\n\n\t\tscanf(\"%lf %lf\",&C[i].center.x,&C[i].center.y);\n\t\tC[i].r = R;\n\n\t\tleft = min(left,C[i].center.x-R);\n\t\tright = max(right,C[i].center.x+R);\n\t}\n\n\tdouble diff = 0.00001;\n\tdouble NUM = 10000;\n\n\tdouble ans = 0;\n\n\tfor(double x = left; x <= right; x += diff){\n\n\t\tLine tmp_line = Line(Point(x,-NUM),Point(x,NUM));\n\n\t\tvector<Info> P;\n\n\t\tfor(int i = 0; i < 3; i++){\n\n\t\t\tdouble tmp_dist = getDistanceLP(tmp_line,C[i].center);\n\t\t\tif(tmp_dist > R+EPS)continue;\n\n\t\t\tvector<Point> vec = getCrossPoints(C[i],tmp_line);\n\n\t\t\tif(vec[0].y > vec[1].y){\n\n\t\t\t\tswap(vec[0],vec[1]);\n\t\t\t}\n\t\t\tP.push_back(Info(vec[0],Under));\n\t\t\tP.push_back(Info(vec[1],Top));\n\t\t}\n\n\t\tif(P.size() == 0)continue;\n\n\t\tsort(P.begin(),P.end());\n\n\t\tfor(int i = 1; i < P.size(); i++){\n\n\t\t\tif(P[i].type == Under && P[i-1].type == Top)continue;\n\n\t\t\tans += (P[i].p.y-P[i-1].p.y)*diff;\n\t\t}\n\t}\n\n\tprintf(\"%.12lf\\n\",ans);\n\n\treturn 0;\n}", "accuracy": 0.038461538461538464, "time_ms": 260, "memory_kb": 3172, "score_of_the_acc": -0.2551, "final_rank": 19 }, { "submission_id": "aoj_0449_5426036", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\nenum Type{\n\tTop,\n\tUnder,\n};\n\nstruct Point{\n\tPoint(double arg_x,double arg_y){\n\t\tx = arg_x;\n\t\ty = arg_y;\n\t}\n\n\tPoint(){\n\t\tx = y = 0.0;\n\t}\n\n\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\n\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\n\tPoint operator * (double a){ return Point(a*x,a*y); }\n\tPoint operator / (double a){ return Point(x/a,y/a); }\n\n\tdouble abs(){ return sqrt(norm()); }\n\tdouble norm(){ return x*x + y*y; }\n\n\tbool operator<(const Point &p) const{\n\n\t\tif(fabs(x-p.x) > EPS){\n\n\t\t\treturn x < p.x;\n\t\t}else{\n\n\t\t\treturn y < p.y;\n\t\t}\n\t}\n\n\tbool operator == (const Point &p) const{\n\t\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\n\t}\n\n\n\tvoid debug(){\n\n\t\tprintf(\"(%.3lf,%.3lf)\\n\",x,y);\n\t}\n\n\tdouble x,y;\n};\n\ntypedef Point Vector;\n\nstruct Line{\n\tLine(){\n\n\t}\n\tLine(Point a,Point b){\n\t\tp[0] = a;\n\t\tp[1] = b;\n\t}\n\t/*void outPut(){\n\n\t\tprintf(\"(%.3lf,%.3lf)-(%.3lf,%.3lf)\\n\",p[0].x,p[0].y,p[1].x,p[1].y);\n\t}*/\n\tPoint p[2];\n};\n\nstruct Circle{\n\tPoint center;\n\tdouble r;\n};\n\nstruct Info{\n\tInfo(Point arg_p,Type arg_type){\n\t\tp = arg_p;\n\t\ttype = arg_type;\n\t}\n\tbool operator<(const struct Info& arg) const{\n\n\t\treturn p < arg.p;\n\t}\n\tPoint p;\n\tType type;\n};\n\nCircle C[3];\n\n\ndouble calc_dist(Point A,Point B){\n\n\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\n}\n\n\ndouble norm(Vector a){\n\treturn a.x*a.x+a.y*a.y;\n}\n\ndouble abs(Vector a){\n\treturn sqrt(norm(a));\n}\n\ndouble cross(Vector a,Vector b){\n return a.x*b.y-a.y*b.x;\n}\n\ndouble dot(Vector a,Vector b){\n return a.x*b.x + a.y*b.y;\n}\n\nstatic const int COUNTER_CLOCKWISE = 1;\nstatic const int CLOCKWISE = -1;\nstatic const int ONLINE_BACK = 2;\nstatic const int ONLINE_FRONT = -2;\nstatic const int ON_SEGMENT = 0;\n\n/*\n * p0を基準点として、p1から見てp2が\n * 反時計回り側にあれば\n * COUNTER_CLOCKWISE\n * */\nint ccw(Point p0,Point p1,Point p2){\n\n\tVector a = p1 - p0;\n\tVector b = p2 - p0;\n\n\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\n\tif(cross(a,b) < -EPS)return CLOCKWISE;\n\tif(dot(a,b) < -EPS)return ONLINE_BACK;\n\tif(a.norm() < b.norm())return ONLINE_FRONT;\n\n\treturn ON_SEGMENT;\n}\n\n\nPoint project(Line l,Point p){\n\n\tVector base = l.p[1]-l.p[0];\n\tdouble r = dot(p-l.p[0],base)/norm(base);\n\treturn l.p[0]+base*r;\n}\n\n//円と直線の交点を求める関数\nvector<Point> getCrossPoints(Circle c,Line l){\n\n\tvector<Point> ret;\n\n\tVector pr = project(l,c.center);\n\tVector e = (l.p[1]-l.p[0])/abs(l.p[1]-l.p[0]);\n\n\tdouble base;\n\n\tif(fabs(c.r*c.r-norm(pr-c.center)) < EPS){\n\n\t\tbase = 0;\n\t}else{\n\t\tbase = sqrt(c.r*c.r-norm(pr-c.center));\n\t}\n\n\tret.push_back(Point(pr+e*base));\n\tret.push_back(Point(pr-e*base));\n\n\treturn ret;\n}\n\n\nPoint calc_minus(Point a,Point b){\n Point ret;\n\n ret.x = a.x-b.x;\n ret.y = a.y-b.y;\n\n return ret;\n}\n\ndouble calc_len(Vector a){\n return sqrt(a.x*a.x+a.y*a.y);\n}\n\n//線分ではなく直線と点の距離\ndouble getDistanceLP(Line l,Point p){\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\n}\n\nint main(){\n\n\tdouble R;\n\tscanf(\"%lf\",&R);\n\n\tdouble left = HUGE_NUM,right = -HUGE_NUM;\n\n\tfor(int i = 0; i < 3; i++){\n\n\t\tscanf(\"%lf %lf\",&C[i].center.x,&C[i].center.y);\n\t\tC[i].r = R;\n\n\t\tleft = min(left,C[i].center.x-R);\n\t\tright = max(right,C[i].center.x+R);\n\t}\n\n\tdouble diff = 0.00005;\n\tdouble NUM = 10000;\n\n\tdouble ans = 0;\n\n\tfor(double x = left; x <= right; x += diff){\n\n\t\tLine tmp_line = Line(Point(x,-NUM),Point(x,NUM));\n\n\t\tvector<Info> P;\n\n\t\tfor(int i = 0; i < 3; i++){\n\n\t\t\tdouble tmp_dist = getDistanceLP(tmp_line,C[i].center);\n\t\t\tif(tmp_dist > R+EPS)continue;\n\n\t\t\tvector<Point> vec = getCrossPoints(C[i],tmp_line);\n\n\t\t\tif(vec[0].y > vec[1].y){\n\n\t\t\t\tswap(vec[0],vec[1]);\n\t\t\t}\n\t\t\tP.push_back(Info(vec[0],Under));\n\t\t\tP.push_back(Info(vec[1],Top));\n\t\t}\n\n\t\tif(P.size() == 0)continue;\n\n\t\tsort(P.begin(),P.end());\n\n\t\tfor(int i = 1; i < P.size(); i++){\n\n\t\t\tif(P[i].type == Under && P[i-1].type == Top)continue;\n\n\t\t\tans += (P[i].p.y-P[i-1].p.y)*diff;\n\t\t}\n\t}\n\n\tprintf(\"%.12lf\\n\",ans);\n\n\treturn 0;\n}", "accuracy": 0.038461538461538464, "time_ms": 50, "memory_kb": 3204, "score_of_the_acc": -0.0409, "final_rank": 18 } ]
aoj_0443_cpp
Minimum MAW A contiguous substring of a string $S$ is a sequence of characters of length zero or more removed from the beginning and the end of $S$, respectively (except for all the characters of $S$ that have been removed). For example, the string abc has six consecutive substrings: a, ab, abc, b, bc, c. Given a string $S$ and $T$, if $T$ satisfies the following conditions, then $T$ is said to be a minimal absent word (hereafter written as MAW) of $S$. $T$ is at least two in length. $T$ is not a continuous substring of $S$. Any continuous substring of $T$ that is not a $T$ is a continuous substring of $S$. For example, if the string $S$ is aabb, then the MAW of $S$ is the string aaa, ba, bbb. The string is given. Write a program to find the smallest string in the MAW of that string in lexicographic order (the order in which words are arranged in an English-Japanese dictionary). Input The input is given in the following form. $N$ $str$ The first line is the length of the string $N$ ($3 \leq N \leq 400,000$), and the second line is a string of length $N$ consisting of lowercase letters. Output Output the smallest MAW in lexical order in a line. Sample Input and Output Sample Input 1 4 aabb Sample Output 1 aaa Sample Input 2 4 tree Sample Output 2 eee
[ { "submission_id": "aoj_0443_10906687", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n\tint N;cin >> N;\n\tstring S;cin >> S;\n\tint mn = 28;\n\tfor (int i = 0;i < N;i++) mn = min(mn, S[i]-'a');\n\tint it = 0;\n\tint mx = 0;\n\tchar mm = 'a';\n\tmm += mn;\n\twhile (it < N) {\n\t\t\n\t\tif (S[it] == mm) {\n\t\t\tint cnt = 0;\n\t\t\tfor (int i = it;it < N;i++) {\n\t\t\t\tif (S[i] == mm) {\n\t\t\t\t\tcnt++;\n\t\t\t\t} else {\n\t\t\t\t\tit = i + 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tmx = max(mx, cnt);\n\t\t} else {\n\t\t\tit++;\n\t\t}\n\t}\n\tfor (int i = 0;i < mx+1;i++) cout << mm;\n\tcout << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3968, "score_of_the_acc": -0.0387, "final_rank": 10 }, { "submission_id": "aoj_0443_10856889", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int c=0,f=0,ii=0,mx=0,n,b[26]={};\n string s,a={\"abcdefghijklmnopqrstuvwxyz\"};\n cin>>n>>s;\n for(int i=0;i<n;i++){\n for(int j=0;j<26;j++){\n if(s[i]==a[j]){\n b[j]=1;\n }\n }\n }\n for(int i=0;i<26;i++){\n if(b[i]==1){\n ii=i;\n break;\n }\n }\n for(int i=0;i<n;i++){\n if(s[i]==a[ii])f=1;\n if(f==1&&s[i]==a[ii]){c++;if(mx<c)mx=c;}\n else{f=0;c=0;}\n }\n for(int i=0;i<mx;i++){\n cout<<a[ii];\n }\n cout<<a[ii]<<endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3736, "score_of_the_acc": -0.0167, "final_rank": 3 }, { "submission_id": "aoj_0443_10849570", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nint main()\n{\n\n ll f=0,c=0,mx=0,n,a[26]={},ii; string s,g={\"abcdefghijklmnopqrstuvwxyz\"};\n cin>>n>>s;\n for(int i=0;i<26;i++){\n for(int j=0;j<n;j++){\n if(s[j]==g[i])a[i]=1;\n }\n }\n for(int i=0;i<26;i++){\n if(a[i]==1){\n ii=i;\n break;\n }\n }\n for(int i=0;i<n;i++){\n if(g[ii]==s[i])f=1;\n if(f==1&&g[ii]==s[i]){\n c++;\n if(mx<c)mx=c;\n }\n else{f=0;c=0;}\n }\n for(int i=0;i<mx+1;i++){\n cout<<g[ii];\n }\n cout<<endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3748, "score_of_the_acc": -0.0179, "final_rank": 5 }, { "submission_id": "aoj_0443_10849520", "code_snippet": "#include<bits/stdc++.h>\n#include <vector>\nusing namespace std;\ntypedef pair<int,int>P;\nmap<char,int>mp;\nint main(void)\n{\n\tint n;\n\tcin>>n;\n\tstring s;\n\tcin>>s;\n\tint a,b;\n\tb=1;\n\tfor(int i=0;i<s.size();i++){\n\t\tif(s[i]==s[i+1]) b++;\n\t\telse {\n\t\t\tif(mp[s[i]]<b) mp[s[i]]=b;\n\t\t\tb=1;\n\t\t}\n\t}\n\tfor(char i='a';i<='z';i++){\n\t\tif(mp[i]>=1){\n\t\t\ta=mp[i];\n\t\t\tfor(int j=0;j<=a;j++){\n\t\t\t\tcout<<i;\n\t\t\t}\n\t\t\tbreak;\n\t\t}\n\t}\n\tcout<<endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3764, "score_of_the_acc": -0.0194, "final_rank": 6 }, { "submission_id": "aoj_0443_9812988", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n;\n cin >> n;\n string s;\n cin >> s;\n vector<pair<char,int>> a;\n for(int i = 0;i < n;i++){\n if(a.empty() || a.back().first != s[i]){\n a.push_back({s[i],-1});\n }else{\n a.back().second--;\n }\n }\n sort(a.begin(),a.end());\n for(int i = 0;i <= -a[0].second;i++){\n cout << a[0].first;\n }\n cout << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 8408, "score_of_the_acc": -0.4603, "final_rank": 14 }, { "submission_id": "aoj_0443_9810003", "code_snippet": "#include <bits/stdc++.h>\n//\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\nusing Graph = vector<vector<ll>>;\ntemplate <typename T>\nbool chmax(T &a, const T &b)\n{\n if (a < b)\n {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <typename T>\nbool chmin(T &a, const T &b)\n{\n if (a > b)\n {\n a = b;\n return true;\n }\n return false;\n}\n#define reps(i, a, n) for (ll i = (a); i < (ll)(n); ++i)\n#define rep(i, n) reps(i, 0, n)\n#define rrep(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)\n#define rreps(i ,a, n) for (ll i = (ll)(n)-1; i >=(ll) a; i--)\n#define ALL(box) (box).begin(), (box).end()\n#define all(box) (box).begin(), (box).end()\n#define RALL(box) (box).rbegin(), (box).rend()\n#define rall(box) (box).rbegin(), (box).rend()\nll inf=((1LL<<62)-(1LL<<31))/15;\nll sum = 0;\nll num = 0;\nint pum = 0;\nll mum = 0;\nint min1 = 1000000;\nint max1 = 0;\nll min2 = inf;\nll max2 = -inf;\nll MOD1 = 1000000007;\nll MOD = 998244353;\nint dx[4] = {0, 1, 0, -1};\nint dy[4] = {1, 0, -1, 0}; // 右、下、左、上\nint dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};\nint dy8[8] = {1, 1, 0, -1, -1, -1, 0, 1};\n// sort(box.rbegin(), box.rend());\n// printf(\"%.7Lf\", n);\n// reverse(t.begin(), t.end());\n// unique(box.begin(), box.end());\n// auto It = lower_bound(ALL(box), n);以上 4\n// auto It = upper_bound(ALL(box), n);含まない上 7\n// cout << box.end() - It ; 末尾までの距離\n// cout << It - a.begin() ; 先頭までの距離\n// auto It =box.upper_bound( k);set,multiset\n// pqueue < int, vector<int>, greater<int>> q;\n// priority_queue<pii, vector<pii>, greater<pii>> pq;//小さい順\n// segtree<ll, op, e> seg(N);\n// lazy_segtree<S, op, e, F, mapping, composition, id> seg(N);\n// box.erase(unique(all(box), box.end());\n// st.erase(st.find(5));\nll zaatu(vector<ll>&A){map<ll,ll>m;for(auto&&x:A)m[x]=0;ll ret = 0;for(auto&&[key,val]:m)val=ret++;for(auto&&x:A)x=m[x];return ret;}\nvector<pair<char, ll>> runLengthEncoding(string s) {\n ll n = s.length();\n\n vector<pair<char, ll>> res;\n char pre = s[0];\n ll cnt = 1;\n reps(i, 1, n) {\n if (pre != s[i]) {\n res.push_back({ pre, cnt });\n pre = s[i];\n cnt = 1;\n }\n else cnt++;\n }\n\n res.push_back({ pre, cnt });\n return res;\n}\nint main(){\n int N;\n cin>>N;\n string S;\n cin>>S;\n auto box=runLengthEncoding(S);\n rep(i,box.size()){\n box[i].second*=-1;\n }\n sort(all(box));\n rep(i,box[0].second*-1+1){\n cout <<box[0].first;\n }\n cout<<endl;\n \n}", "accuracy": 1, "time_ms": 10, "memory_kb": 14092, "score_of_the_acc": -1, "final_rank": 15 }, { "submission_id": "aoj_0443_9636058", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n\nint main() {\n//#ifndef ONLINE_JUDGE\n// freopen(\"Input.txt\", \"r\", stdin);\n// freopen(\"Output.txt\", \"w\", stdout);\n//#endif\n int n ;\n cin >> n;\n string s;\n cin >> s ;\n map<char,int>mp;\n char st = s[0] ;\n int cnt = 0;\n for (int i = 0; i < n; ++i) {\n if(s[i] == st){\n cnt++;\n }\n else {\n mp[st] = max((int)mp[st] , cnt);\n cnt = 1;\n st = s[i];\n }\n }\n mp[st] = max((int)mp[st] , cnt);\n string t;\n for (int i = 0; i <= mp.begin()->second ; ++i) {\n t += mp.begin()->first;\n }\n cout << t << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3880, "score_of_the_acc": -0.0304, "final_rank": 8 }, { "submission_id": "aoj_0443_8469518", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug_print.hpp>\n#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define debug(...) (static_cast<void>(0))\n#endif\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N;\n string S;\n cin >> N >> S;\n // len[i] := a ~ z の S の最大の連続長\n vector<int> len(26);\n for(int i = 0; i < 26; i++){\n int l = 0;\n for(int j = 0; j < N; j++){\n if(S[j] == (char)(i + 'a')){\n l++;\n }else{\n l = 0;\n }\n len[i] = max(len[i], l);\n }\n }\n\n debug(len);\n for(int i = 0; i < 26; i++){\n if(len[i] == 0) continue;\n string ans = string(len[i] + 1, (char)(i + 'a'));\n cout << ans << '\\n';\n return 0;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3988, "score_of_the_acc": -0.0406, "final_rank": 11 }, { "submission_id": "aoj_0443_8439601", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n int n,b = -1;\n string s;\n cin >> n >> s;\n s += '1';\n set<string> st;\n \n for(int i = 0; i < n; i++){\n if(s[i] != s[i+1]){ \n st.insert(s.substr(b+1,i-b)); \n b = i;\n }\n }\n s = *st.begin();\n char c = s[0];\n vector<string> vec;\n for(auto ss : st) if(ss[0] == c) vec.push_back(ss);\n reverse(vec.begin(),vec.end());\n cout << vec[0] << vec[0][0] << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4740, "score_of_the_acc": -1.112, "final_rank": 17 }, { "submission_id": "aoj_0443_8232781", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\n#define INF INT64_MAX;\nint main(void)\n{\n int n,mx=-1,cnt=0;\n string s,t;\n cin>>n>>s;\n t=s;\n sort(t.begin(),t.end());\n for(int i=0;i<s.size();i++){\n if(s[i]==t[0]){\n cnt++;\n }\n else{\n mx=max(mx,cnt);\n cnt=0;\n }\n }\n mx=max(mx,cnt);\n for(int i=0;i<=mx;i++) cout<<t[0];\n cout<<endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3952, "score_of_the_acc": -0.0372, "final_rank": 9 }, { "submission_id": "aoj_0443_8191079", "code_snippet": "#include<bits/stdc++.h>\n#include<algorithm>\n#include<stdio.h>\nusing namespace std;\n#define int long long int\n#define endl '\\n'\n#define mod 1000000007\n#define pb push_back\n#define operation(); ios_base:: sync_with_stdio(0);cin.tie(0);cout.tie(0)\n#define ff first\n#define ss second\n#define srt sort(ar,ar+n)\n#define yes cout<<\"YES\"<<endl;\n#define no cout<<\"NO\"<<endl;\n#define cn for(int i=0;i<n;i++) cin>>ar[i]\n#define df cout<<\"NOTICE\"<<endl;\nconst int inf=10e+15;\nint ar[500009];\nint gcd(int a,int b)\n{\n if(b==0)\n return a;\n return gcd(b,a%b);\n}\nint vis[200001];\nvector<int>vt;\npair<int,char>pr[500009];\nint arr[200001];\nset<int>st;\n\n//vector<vector<int>>adj;\nint32_t main()\n{\n // operation();\n int tt;\n // cin>>tt;\n // for(int ii=1; ii<=tt; ii++)\n {\n string s;int n;\n cin>>n;\n cin>>s;\n char c;\n c= s[0];\n for(int i=1;i<n;i++)\n {\n if(s[i]<c) c=s[i];\n }\n int mx = -1;\n int cnt =1;\n // cout<<cnt<<endl;\n for(int i=0;i<n-1;i++)\n {\n if(s[i]==s[i+1]&& s[i]==c)\n cnt++;\n else\n {\n mx=max(cnt,mx);\n cnt =1;\n }\n }\n if(s[n-1]==s[n-2])\n mx= max(cnt,mx);\n // cout<<mx<<endl;\n for(int i=1;i<=mx+1;i++) cout<<c;\n cout<<endl;\n\n\n }\n\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5744, "score_of_the_acc": -0.2074, "final_rank": 13 }, { "submission_id": "aoj_0443_8140603", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\n#define INF INT64_MAX;\nint main(void)\n{\n int n;\n string s,st;\n cin>>n>>s;\n st=s; \n vector<bool> f(n+1,false);\n sort(st.begin(),st.end());\n char nxt=st[0];\n int cnt=0;\n for(int i=0;i<n;i++){\n if(s[i]==nxt) cnt++;\n else{\n f[cnt]=true;\n cnt=0;\n }\n f[cnt]=true;\n }\n f[cnt]=true;\n for(int i=1;i<=n;i++){\n if(f[i+1]==false){\n for(int j=0;j<i;j++) cout<<st[0];\n cout<<st[0]<<endl;\n return 0;\n }\n }\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3908, "score_of_the_acc": -1.033, "final_rank": 16 }, { "submission_id": "aoj_0443_8073896", "code_snippet": "#include<bits/stdc++.h>\n#define overload(a,b,c,d,...) d\n#define rep1(a) for(ll _=0;_<a;++_)\n#define rep2(i,a) for(ll i=0;i<a;++i)\n#define rep3(i,a,b) for(ll i=a;i<b;++i)\n#define rep(...) overload(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(i,a) for(ll i=(ll)a-1;i>=0;--i)\n#define rrep2(i,a,b) for(ll i=(ll)b-1;i>=(ll)a;--i)\n#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)\n#define all(x) x.begin(),x.end()\n#define rall(x) x.rbegin(),x.rend()\n#define eb emplace_back\n#define pb push_back\nusing namespace std;\nusing ll=long long;\nusing ull=unsigned long long;\nusing ld=long double;\ntemplate<typename T,typename U>inline bool chmin(T&a,const U&b){return (a>b?a=b,true:false);}\ntemplate<typename T,typename U>inline bool chmax(T&a,const U&b){return (a<b?a=b,true:false);}\nstatic constexpr ll inf=numeric_limits<ll>::max()/2;\nint main(){\n ll n;cin>>n;\n string s;\n cin>>s;\n char mi='z';\n ll mx=0;\n rep(i,n){\n char c=s[i];\n ll l=i;\n while(s[i]==c){\n i++;\n }\n ll sz=i-l;\n if(mi>c){\n mi=c;\n mx=sz;\n }\n else if(mi==c&&mx<sz){\n mx=sz;\n }\n i--;\n }\n rep(i,mx+1)cout<<mi;\n cout<<endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3672, "score_of_the_acc": -0.0106, "final_rank": 2 }, { "submission_id": "aoj_0443_7078460", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint n, k, u;\nstring s;\nchar t = 'z';\n\nint main(){\n cin >> n >> s;\n \n for(int i = 0; i < s.size(); i++){\n if(t >= s[i]){\n if(t > s[i]){\n t = s[i];\n k = 1;\n }\n \n u = 1;\n \n while(i < s.size() && s[i] == t){\n u++;\n i++;\n }\n \n i--;\n k = max(k, u);\n }\n }\n \n for(int i = 0; i < k; i++)\n cout << t;\n cout << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3560, "score_of_the_acc": 0, "final_rank": 1 }, { "submission_id": "aoj_0443_7076472", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int) n; i++)\n#define all(v) v.begin(), v.end()\n\nint main() {\n int N; cin >> N;\n string S; cin >> S;\n vector<char> V(N);\n rep(i, N) V[i] = S[i];\n sort(V.begin(), V.end());\n int max_count = 0;\n int f = 0;\n rep(i, N) {\n int count = 0;\n if (S[i] != V[0]) continue;\n else f = 1;\n int j = 0;\n for (;; j++) {\n if (S[i + j] != V[0]) break;\n count++;\n }\n f = 0;\n i += j;\n max_count = max(max_count, count);\n }\n \n string T = \"\";\n rep(i, max_count + 1) {\n T += V[0];\n }\n cout << T << endl;\n\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4496, "score_of_the_acc": -0.0889, "final_rank": 12 }, { "submission_id": "aoj_0443_7074757", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n\nint main()\n{\n int n; cin>>n;\n string s; cin>>s;\n char use='z';\n for(int i=0; i<n; i++)\n {\n if(use>s[i])\n {\n use=s[i];\n }\n }\n int ans=0;\n int now=0;\n for(int i=0;i<n;i++)\n {\n if(s[i]!=use)now=0;\n else{\n now++;\n ans=max(now,ans);\n }\n }\n ans=max(now,ans);\n //cout<<ans<<endl;\n for(int i=0; i<ans+1; i++)\n {\n cout<<use;\n }\n cout<<endl;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3764, "score_of_the_acc": -0.0194, "final_rank": 6 }, { "submission_id": "aoj_0443_7073032", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\nconst long long INF = 1e17;\nusing P = pair<ll, ll>;\nvoid solve() {\n ll N; cin >> N;\n string S; cin >> S;\n string T = S;\n sort(T.begin(), T.end());\n char ch = T[0];\n vector<ll>A(N, 0);\n if (S[0] == ch) A[0] = 1;\n for (ll i = 1; i < N; i++) {\n if (S[i] == ch) A[i] = A[i - 1] + 1;\n else A[i] = 0;\n }\n sort(A.begin(), A.end());\n for (ll i = 0; i <= A.back(); i++) {\n cout << ch;\n }\n cout << endl;\n} \nint main() {\n ll T = 1; //cin >> T;\n while (T--) {\n solve();\n }\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 7208, "score_of_the_acc": -1.3464, "final_rank": 18 }, { "submission_id": "aoj_0443_7052804", "code_snippet": "//#include <atcoder/all>\n#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long;\nconstexpr lint mod = 1e9 + 7;\n#define all(x) begin(x), end(x)\n#define bitcount(n) __builtin_popcountll((lint)(n))\n#define fcout cout << fixed << setprecision(15)\n#define highest(x) (63 - __builtin_clzll(x))\n#define rep(i, n) for(int i = 0; i < int(n); i++)\n#define rep2(i, l, r) for(int i = int(l); i < int(r); i++)\n#define repr(i, n) for(int i = int(n) - 1; i >= 0; i--)\n#define repr2(i, l, r) for(int i = int(r) - 1; i >= int(l); i--)\n#define accumulate you cannot use this word!\nconstexpr int inf9 = 1e9; constexpr lint inf18 = 1e18;\ninline void Yes(bool condition){ if(condition) cout << \"Yes\" << endl; else cout << \"No\" << endl; }\ntemplate<class itr> void array_output(itr start, itr goal){ for(auto i = start; i != goal; i++) cout << (i == start ? \"\" : \" \") << (*i); cout << endl; }\ntemplate<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }\ntemplate<class T> T gcd(T a, T b){ if(b) return gcd(b, a % b); else return a; }\ntemplate<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }\ntemplate<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b){ if(b < a){ a = b; return 1; } return 0; }\ninline int has(lint i, int j){ return (i >> j) & 1; }\nint dy[4] = {1, 0, -1, 0}; int dx[4] = {0, 1, 0, -1};\nbool is_inside(lint y, lint x, lint H, lint W){ return (0 <= y && y < H && 0 <= x && x < W); }\n\nstruct io_init {\n io_init() {\n cin.tie(nullptr); cout.tie(nullptr);\n std::ios::sync_with_stdio(false);\n }\n} io_init;\n\nint main(){\n int n;\n cin >> n;\n string s;\n cin >> s;\n map<char, int> max_len;\n \n char c = s[0];\n int len = 1;\n max_len[c] = max(max_len[c], len);\n \n rep2(i, 1, n){\n if(s[i] == c){\n len++;\n }else{\n c = s[i];\n len = 1;\n }\n max_len[c] = max(max_len[c], len);\n assert(len >= 1);\n }\n \n for(auto [c0, len0]: max_len){\n if(len0 <= 0) continue;\n \n rep(_, len0 + 1) cout << c0;\n cout << endl;\n return 0;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3740, "score_of_the_acc": -0.0171, "final_rank": 4 }, { "submission_id": "aoj_0443_7052796", "code_snippet": "//#include <atcoder/all>\n#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long;\nconstexpr lint mod = 1e9 + 7;\n#define all(x) begin(x), end(x)\n#define bitcount(n) __builtin_popcountll((lint)(n))\n#define fcout cout << fixed << setprecision(15)\n#define highest(x) (63 - __builtin_clzll(x))\n#define rep(i, n) for(int i = 0; i < int(n); i++)\n#define rep2(i, l, r) for(int i = int(l); i < int(r); i++)\n#define repr(i, n) for(int i = int(n) - 1; i >= 0; i--)\n#define repr2(i, l, r) for(int i = int(r) - 1; i >= int(l); i--)\n#define accumulate you cannot use this word!\nconstexpr int inf9 = 1e9; constexpr lint inf18 = 1e18;\ninline void Yes(bool condition){ if(condition) cout << \"Yes\" << endl; else cout << \"No\" << endl; }\ntemplate<class itr> void array_output(itr start, itr goal){ for(auto i = start; i != goal; i++) cout << (i == start ? \"\" : \" \") << (*i); cout << endl; }\ntemplate<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }\ntemplate<class T> T gcd(T a, T b){ if(b) return gcd(b, a % b); else return a; }\ntemplate<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }\ntemplate<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b){ if(b < a){ a = b; return 1; } return 0; }\ninline int has(lint i, int j){ return (i >> j) & 1; }\nint dy[4] = {1, 0, -1, 0}; int dx[4] = {0, 1, 0, -1};\nbool is_inside(lint y, lint x, lint H, lint W){ return (0 <= y && y < H && 0 <= x && x < W); }\n\nstruct io_init {\n io_init() {\n cin.tie(nullptr); cout.tie(nullptr);\n std::ios::sync_with_stdio(false);\n }\n} io_init;\n\nint main(){\n int n;\n cin >> n;\n string s;\n cin >> s;\n map<char, int> max_len;\n \n char c = s[0];\n int len = 1;\n max_len[c] = max(max_len[c], len);\n \n rep2(i, 1, n){\n if(s[i] == c){\n len++;\n }else{\n c = s[i];\n len = 1;\n }\n max_len[c] = max(max_len[c], len);\n assert(len >= 1);\n }\n \n char c0 = (*max_len.begin()).first;\n char len0 = (*max_len.begin()).second;\n// assert('a' <= c0 && c0 <= 'z');\n rep(_, len0 + 1) cout << c0;\n cout << endl;\n}", "accuracy": 0.96, "time_ms": 10, "memory_kb": 3744, "score_of_the_acc": -0.0175, "final_rank": 19 }, { "submission_id": "aoj_0443_7052794", "code_snippet": "//#include <atcoder/all>\n#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long;\nconstexpr lint mod = 1e9 + 7;\n#define all(x) begin(x), end(x)\n#define bitcount(n) __builtin_popcountll((lint)(n))\n#define fcout cout << fixed << setprecision(15)\n#define highest(x) (63 - __builtin_clzll(x))\n#define rep(i, n) for(int i = 0; i < int(n); i++)\n#define rep2(i, l, r) for(int i = int(l); i < int(r); i++)\n#define repr(i, n) for(int i = int(n) - 1; i >= 0; i--)\n#define repr2(i, l, r) for(int i = int(r) - 1; i >= int(l); i--)\n#define accumulate you cannot use this word!\nconstexpr int inf9 = 1e9; constexpr lint inf18 = 1e18;\ninline void Yes(bool condition){ if(condition) cout << \"Yes\" << endl; else cout << \"No\" << endl; }\ntemplate<class itr> void array_output(itr start, itr goal){ for(auto i = start; i != goal; i++) cout << (i == start ? \"\" : \" \") << (*i); cout << endl; }\ntemplate<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }\ntemplate<class T> T gcd(T a, T b){ if(b) return gcd(b, a % b); else return a; }\ntemplate<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }\ntemplate<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b){ if(b < a){ a = b; return 1; } return 0; }\ninline int has(lint i, int j){ return (i >> j) & 1; }\nint dy[4] = {1, 0, -1, 0}; int dx[4] = {0, 1, 0, -1};\nbool is_inside(lint y, lint x, lint H, lint W){ return (0 <= y && y < H && 0 <= x && x < W); }\n\nstruct io_init {\n io_init() {\n cin.tie(nullptr); cout.tie(nullptr);\n std::ios::sync_with_stdio(false);\n }\n} io_init;\n\nint main(){\n int n;\n cin >> n;\n string s;\n cin >> s;\n map<char, int> max_len;\n \n char c = s[0];\n int len = 1;\n max_len[c] = max(max_len[c], len);\n assert(len >= 1);\n \n rep2(i, 1, n){\n if(s[i] == c){\n len++;\n }else{\n c = s[i];\n len = 1;\n }\n max_len[c] = max(max_len[c], len);\n assert(len >= 1);\n }\n \n char c0 = (*max_len.begin()).first;\n char len0 = (*max_len.begin()).second;\n// assert('a' <= c0 && c0 <= 'z');\n assert(len0 >= 1);\n rep(_, len0 + 1) cout << c0;\n cout << endl;\n}", "accuracy": 0.96, "time_ms": 10, "memory_kb": 3744, "score_of_the_acc": -0.0175, "final_rank": 19 } ]
aoj_0447_cpp
Broken Exit The popular game "Broken Exits" is a puzzle game where the goal is to escape from a maze with the least number of moves. The maze consists of $N \times M$ squares and each square is assigned a row number and a column number. A square with row number $r$ and column number $c$ is denoted by ($r, c$). The top left corner of the square is occupied by square (0, 0) and the bottom right corner is occupied by square ($N-1, M-1$). Each square is assigned one of the following symbols: . Ground E Exit # Wall In each play of the game, you start from the square designated for each play and try to reach the exit. Each exit can be reached from any square except walls. If the adjacent square above, below, right or left of the square you are in is the ground or an exit, you can move to that square. However, you cannot move to a square without a square. A maze may contain two or more exits, one of which is broken. Which exit is broken is specified for each play. The play ends when you reach an exit that is not broken. If an exit is broken, you can still move to that exit square, but it does not end the game. Write a program which reads a maze and the information for each play and outputs the minimum number of moves until each play is completed. Input The input is given in the following form. $N$ $M$ $row_1$ $row_2$ : $row_N$ $P$ $sr_1$ $sc_1$ $br_1$ $bc_1$ $sr_2$ $sc_2$ $br_2$ $bc_2$ : $sr_P$ $sc_P$ $br_P$ $bc_P$ In the first line, two integers $N$ ($2 \leq N \leq 1,000$) and $M$ ($2 \leq M \leq 1,000$) are given to represent the size of a maze. A string $row_i$ is given in the next $N$ lines to represent the information of the $i$-th square from the top. $row_i$ is a string of length $M$ and the $j$-th character represents the symbol of square ($i-1,j-1$). In the following line, the number of plays $P$ ($1 \leq P \leq 100,000$) is given. The subsequent $P$ lines give the integers $sr_i$,$sc_i$,$br_i$,$bc_i$ ($0 \leq sr_i,br_i < N, 0 \leq sc_i, bc_i < M$) that represent the starting ground square ($sr_i, sc_i$) and the broken exit square ($br_i, bc_i$) specified in each play. Output The output is $P$ rows. Output the minimum number of moves for each play in a line. Sample Input and Output Sample Input 4 5 ..... .#.#E ..##. .E... 3 0 0 3 1 1 2 3 1 1 2 1 4 Sample Output 5 4 7
[ { "submission_id": "aoj_0447_11014002", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nstruct dat{\n\tint r,c,cost;\n\tint root;\n};\nint main(){\n\tint N,M;\n\tcin>>N>>M;\n\tauto get_place=[&](int a,int b){\n\t\tint res=0;\n\t\tres+=M*(a-1);\n\t\tres+=b;\n\t\treturn res;\n\t};\n\tchar S[N+1][M+1];\n\tfor(int i=1;i<=N;i++){\n\t\tfor(int j=1;j<=M;j++) cin>>S[i][j];\n\t}\n\tint goal[N+1][M+1];\n\tint dist1[N+1][M+1],dist2[N+1][M+1];\n\tqueue<dat>que;\n\tfor(int i=1;i<=N;i++){\n\t\tfor(int j=1;j<=M;j++){\n\t\t\tgoal[i][j]=-1;\n\t\t\tdist1[i][j]=1e9;\n\t\t\tdist2[i][j]=1e9;\n\t\t\tif(S[i][j]=='E'){\n\t\t\t\tdist1[i][j]=0;\n\t\t\t\tgoal[i][j]=get_place(i,j);\n\t\t\t\tque.push({i,j,0,goal[i][j]});\n\t\t\t}\n\t\t}\n\t}\n\tconst int dx[4]={-1,1,0,0},dy[4]={0,0,-1,1};\n\twhile(!que.empty()){\n\t\tint r=que.front().r,c=que.front().c,now_cost=que.front().cost,now_root=que.front().root;\n\t\tque.pop();\n\t\tfor(int k=0;k<4;k++){\n\t\t\tint nr=r+dx[k],nc=c+dy[k];\n\t\t\tif(nr<=0||nr>N||nc<=0||nc>M) continue;\n\t\t\tif(S[nr][nc]=='#') continue;\n\t\t\tif(now_cost+1<dist1[nr][nc]){\n\t\t\t\tdist1[nr][nc]=now_cost+1;\n\t\t\t\tgoal[nr][nc]=now_root;\n\t\t\t\tque.push({nr,nc,now_cost+1,now_root});\n\t\t\t}\n\t\t\telse if(now_cost+1<dist2[nr][nc]){\n\t\t\t\tif(goal[nr][nc]!=now_root){\n\t\t\t\t\tdist2[nr][nc]=now_cost+1;\n\t\t\t\t\tque.push({nr,nc,now_cost+1,now_root});\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\t\n\tint P;\n\tcin>>P;\n\tfor(int z=1;z<=P;z++){\n\t\tint sr,sc,br,bc;\n\t\tcin>>sr>>sc>>br>>bc;\n\t\tsr++;sc++;br++;bc++;\n\t\tint break_pos=get_place(br,bc);\n\t\tif(goal[sr][sc]==break_pos){\n\t\t\tcout<<dist2[sr][sc]<<endl;\n\t\t}\n\t\telse{\n\t\t\tcout<<dist1[sr][sc]<<endl;\n\t\t}\n\t}\n\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 32284, "score_of_the_acc": -0.1459, "final_rank": 6 }, { "submission_id": "aoj_0447_10926745", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)\n\nvector<int> di = {0, 1, 0, -1};\nvector<int> dj = {1, 0, -1, 0};\n\nint main() {\n\tcin.tie(nullptr);\n\tios_base::sync_with_stdio(false);\n\t\n\tint H, W;\n\tcin >> H >> W;\n\tvector S(H, vector<char>(W));\n\trep(i, 0, H) rep(j, 0, W) cin >> S[i][j];\n\t\n\tvector dist(2, vector(H, vector<int>(W, -1)));\n\tvector exit(2, vector(H, vector<int>(W, -1)));\n\t\n\tqueue<pair<pair<int, int>, int>> que;\n\t\n\trep(i, 0, H) rep(j, 0, W) {\n\t\tif (S[i][j] == 'E') {\n\t\t\tdist[0][i][j] = 0;\n\t\t\texit[0][i][j] = i*W + j;\n\t\t\tque.push({{i, j}, 0});\n\t\t}\n\t}\n\t\n\twhile (!que.empty()) {\n\t\tint vi = que.front().first.first;\n\t\tint vj = que.front().first.second;\n\t\tint vk = que.front().second;\n\t\tque.pop();\n\t\t\n\t\trep(dir, 0, 4) {\n\t\t\tint ni = vi + di[dir];\n\t\t\tint nj = vj + dj[dir];\n\t\t\tif (ni < 0 || H <= ni || nj < 0 || W <= nj) continue;\n\t\t\tif (S[ni][nj] == '#') continue;\n\t\t\tif (dist[1][ni][nj] != -1) continue;\n\t\t\tif (exit[0][ni][nj] == exit[vk][vi][vj]) continue;\n\t\t\t\n\t\t\tif (dist[0][ni][nj] == -1) {\n\t\t\t\tdist[0][ni][nj] = dist[vk][vi][vj] + 1;\n\t\t\t\texit[0][ni][nj] = exit[vk][vi][vj];\n\t\t\t\tque.push({{ni, nj}, 0});\n\t\t\t} else {\n\t\t\t\tdist[1][ni][nj] = dist[vk][vi][vj] + 1;\n\t\t\t\texit[1][ni][nj] = exit[vk][vi][vj];\n\t\t\t\tque.push({{ni, nj}, 1});\n\t\t\t}\n\t\t}\n\t}\n\t\n\tint Q;\n\tcin >> Q;\n\trep(query, 0, Q) {\n\t\tint si, sj, bi, bj;\n\t\tcin >> si >> sj >> bi >> bj;\n\t\t\n\t\tif (exit[0][si][sj] == bi*W + bj) cout << dist[1][si][sj] << '\\n';\n\t\telse cout << dist[0][si][sj] << '\\n';\n\t}\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 32052, "score_of_the_acc": -0.0292, "final_rank": 2 }, { "submission_id": "aoj_0447_10900681", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std; \n/*#include <boost/multiprecision/cpp_dec_float.hpp>\n#include <boost/multiprecision/cpp_int.hpp>\n#include <boost/rational.hpp>\nusing namespace boost::multiprecision;*/\n/*#include <atcoder/all>\nusing namespace atcoder;\nusing mint = modint;*/\n//long long型=int64_tという認識で大丈夫です。\n//#define int long long\n#define ll long long\n#define ull unsigned long long\n#define vec vector\n#define vi vector<int>\n#define vll vector<ll>\n#define pq priority_queue\n#define pb push_back\n#define rep(i, l, r) for(ll i=(ll)(l); i<(ll)(r); i++)\n#define ld long double\n\nconst ll INF = 2e9;\nconst ll inf = 5e18;\nconst ld ep = 1e-15;\n\nstruct Edge {\n int to;\n ll cost;\n};\n\nstruct SEdge {\n int to;\n pair<ll, ll> cost;\n};\n\ntemplate<class T>\nusing spq = priority_queue<T, vec<T>, greater<T>>; \n\nconst vector<ll> di = {-1, 0, 1, 0}, dj = {0, -1, 0, 1};\n\ntemplate<class T>\nbool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T>\nbool chmax(T& a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T, class U> \nistream &operator>>(istream &is, pair<T, U> &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate<class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << p.first << \" \" << p.second;\n return os;\n}\ntemplate <class T>\nistream &operator>>(istream &is, vector<T> &v) {\n for(auto &x : v) {\n is >> x;\n }\n return is;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n for(int i = 0; i < (int)v.size(); i++) {\n if(i != (int)v.size() - 1)\n os << v[i] << \" \";\n else\n os << v[i];\n }\n return os;\n}\n\nstring strplus(string a, string b) {\n reverse(a.begin(), a.end()); reverse(b.begin(), b.end());\n bool ch = false;\n if(a.size() < b.size()) {\n swap(a, b);\n ch = true;\n }\n string ret;\n int cnt = 0;\n rep(i, 0, a.size()) {\n if(i >= b.size()) {\n ret += (char)(((int)(a[i] - '0') + cnt) % 10 + '0');\n cnt = (((int)(a[i] - '0') + cnt) / 10);\n }\n else {\n ret += (char)(((int)(a[i] - '0' + b[i] - '0') + cnt) % 10 + '0');\n cnt = ((int)(a[i] - '0' + b[i] - '0') + cnt) / 10;\n }\n }\n if(cnt != 0) ret += \"1\";\n reverse(ret.begin(), ret.end());\n return ret;\n}\n\nstring strminus(string a, string b) {\n reverse(a.begin(), a.end()); reverse(b.begin(), b.end());\n bool ch = false;\n if(a.size() < b.size()) {\n swap(a, b);\n ch = true;\n }\n else if(a.size() == b.size() && a < b) {\n swap(a, b);\n ch = true;\n }\n string ret;\n int cnt = 0;\n rep(i, 0, a.size()) {\n if(i >= b.size()) {\n ret += (char)(((int)(a[i] - '0') + cnt + 10) % 10 + '0');\n cnt = ((int)(a[i] - '0') + cnt + 10) / 10 - 1;\n }\n else {\n ret += (char)(((int)(a[i] - b[i]) + cnt + 10) % 10 + '0');\n cnt = ((int)(a[i] - b[i]) + cnt + 10) / 10 - 1;\n }\n }\n while(ret[ret.size() - 1] == '0' && ret.size() >= 1) ret.erase(--ret.end());\n if(ret != \"0\" && ch) ret += '-';\n reverse(ret.begin(), ret.end());\n return ret;\n}\n\ntemplate <class T>\nbool jf(pair<T, T> a, pair<T, T> b) {\n if(a.second > b.second) return false;\n else return true;\n}\n\nusing S = ll;\n\nS op(S a, S b){ return max(a, b); }\nS e(){ return 0;}\nsigned main(){\n int n, m; cin >> n >> m;\n vec<string> s(n); rep(i, 0, n) cin >> s[i];\n queue<tuple<int, int, int, int, int>> Q;\n vec<vec<vec<tuple<int, int, int>>>> dist(n, vec<vec<tuple<int, int, int>>>(m, vec<tuple<int, int, int>>(2, {INF, -1, -1})));\n rep(i, 0, n) rep(j, 0, m) if(s[i][j] == 'E') {Q.push({0, i, j, i, j});dist[i][j][0] = {0, i, j};}\n while(!Q.empty()) {\n auto[num, posi, posj, gi, gj] = Q.front(); Q.pop();\n rep(i, 0, 4) {\n int nexi = posi + di[i], nexj = posj + dj[i];\n if(nexi < 0 || nexi >= n || nexj < 0 || nexj >= m) continue;\n if(s[nexi][nexj] == '#') continue;\n if(tuple<int, int, int>{num + 1, gi, gj} < dist[nexi][nexj][0]) {\n dist[nexi][nexj][1] = dist[nexi][nexj][0];\n dist[nexi][nexj][0] = tuple<int, int, int>{num + 1, gi, gj};\n Q.push({num + 1, nexi, nexj, gi, gj});\n continue;\n }\n if(tuple<int, int, int>{num + 1, gi, gj} < dist[nexi][nexj][1]) {\n auto[nexm, nexr, nexc] = dist[nexi][nexj][0];\n if(gi == nexr && gj == nexc) continue;\n dist[nexi][nexj][1] = tuple<int, int, int>{num + 1, gi, gj};\n Q.push({num + 1, nexi, nexj, gi, gj});\n }\n }\n }\n int p; cin >> p;\n rep(i, 0, p) {\n int sr, sc, br, bc; cin >> sr >> sc >> br >> bc;// sr--, sc--, br--, bc--;\n rep(j, 0, 2) {\n auto[ans, gi, gj] = dist[sr][sc][j];\n if(gi == br && gj == bc) continue;\n cout << ans << endl;\n break;\n }\n }\n}", "accuracy": 1, "time_ms": 290, "memory_kb": 80296, "score_of_the_acc": -0.5587, "final_rank": 13 }, { "submission_id": "aoj_0447_9813127", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\nsigned main(){\n int h,w;\n cin >> h >> w;\n vector<vector<char>> s(h,vector<char>(w));\n priority_queue<pair<pair<int,int>,pair<int,int>>,vector<pair<pair<int,int>,pair<int,int>>>,greater<pair<pair<int,int>,pair<int,int>>>> q;\n vector<vector<int>> x(h,vector<int>(w));\n int now = 0;\n for(int i = 0;i < h;i++){\n string S;\n cin >> S;\n for(int j = 0;j < w;j++){\n s[i][j] = S[j];\n if(s[i][j] == 'E'){\n x[i][j] = now++;\n q.push({{0,x[i][j]},{i,j}});\n }\n }\n }\n vector<vector<vector<pair<int,int>>>> t(h,vector<vector<pair<int,int>>>(w,vector<pair<int,int>>(2,{-1,-1})));\n vector<int> dx = {0,0,1,-1};\n vector<int> dy = {1,-1,0,0};\n while(!q.empty()){\n pair<pair<int,int>,pair<int,int>> it = q.top();\n q.pop();\n if(t[it.second.first][it.second.second][1].first != -1) continue;\n if(t[it.second.first][it.second.second][0].second == it.first.second) continue;\n if(t[it.second.first][it.second.second][0].first== -1){\n t[it.second.first][it.second.second][0].first = it.first.first;\n t[it.second.first][it.second.second][0].second = it.first.second;\n }else{\n t[it.second.first][it.second.second][1].first = it.first.first;\n }\n for(int i = 0;i < 4;i++){\n int ny = it.second.first + dy[i];\n int nx = it.second.second + dx[i];\n if(ny < 0 || ny >= h || nx < 0 || nx >= w) continue;\n if(s[ny][nx] == '#') continue;\n if(t[ny][nx][0].second == it.first.second) continue;\n if(t[ny][nx][1].first != -1) continue;\n q.push({{it.first.first + 1,it.first.second},{ny,nx}});\n }\n }\n int Q;\n cin >> Q;\n for(int i = 0;i < Q;i++){\n int a,b,c,d;\n cin >> a >> b >> c >> d;\n if(t[a][b][0].second == x[c][d]){\n cout << t[a][b][1].first << endl;\n }else{\n cout << t[a][b][0].first << endl;\n }\n }\n}", "accuracy": 1, "time_ms": 850, "memory_kb": 214384, "score_of_the_acc": -2, "final_rank": 20 }, { "submission_id": "aoj_0447_9752898", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(n);++i)\nusing namespace std;\nusing ll = long long;\n\nstruct P{\n ll v;\n ll y,x;\n};\n\n\nvector<vector<int>> dd = {{0,1},{0,-1},{-1,0},{1,0}};\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n int n,m;\n cin >> n >> m;\n vector<string> s(n);\n rep(i,n) cin >> s[i];\n\n vector<vector<int>> goal;\n rep(i,n){\n rep(j,m){\n if(s[i][j]=='E'){\n goal.push_back({i,j});\n s[i][j] = '.';\n }\n }\n }\n int gs = goal.size();\n\n\n\n vector<vector<vector<P>>> dist(n,vector<vector<P>>(m,vector<P>(2,P{(int)1e9, -1, -1})));\n queue<vector<int>> q;\n rep(i,gs){\n dist[goal[i][0]][goal[i][1]][0] = P{0, goal[i][0], goal[i][1]};\n q.push({goal[i][0],goal[i][1],0});\n }\n\n while(!q.empty()){\n vector<int> p = q.front();\n q.pop();\n\n rep(i,4){\n int y = p[0]+dd[i][0];\n int x = p[1]+dd[i][1];\n if(y<0 || n<=y || x<0 || m<=x) continue;\n if(s[y][x]=='#') continue;\n\n if(dist[y][x][0].v>dist[p[0]][p[1]][p[2]].v+1){\n if(dist[y][x][0].y!=dist[p[0]][p[1]][p[2]].y || dist[y][x][0].x!=dist[p[0]][p[1]][p[2]].x) swap(dist[y][x][0],dist[y][x][1]);\n dist[y][x][0] = dist[p[0]][p[1]][p[2]];\n dist[y][x][0].v+=1;\n\n q.push({y,x,0});\n }\n else if(dist[y][x][1].v>dist[p[0]][p[1]][p[2]].v+1 && (dist[y][x][0].y!=dist[p[0]][p[1]][p[2]].y || dist[y][x][0].x!=dist[p[0]][p[1]][p[2]].x)){\n dist[y][x][1] = dist[p[0]][p[1]][p[2]];\n dist[y][x][1].v+=1;\n q.push({y,x,1});\n }\n }\n }\n\n int p;\n cin >> p;\n rep(i,p){\n int sr,sc,br,bc;\n cin >> sr >> sc >> br >> bc;\n if(dist[sr][sc][0].y==br && dist[sr][sc][0].x==bc){\n cout << dist[sr][sc][1].v << endl;\n }\n else{\n cout << dist[sr][sc][0].v << endl;\n }\n }\n\n\n}", "accuracy": 1, "time_ms": 390, "memory_kb": 173456, "score_of_the_acc": -1.1895, "final_rank": 19 }, { "submission_id": "aoj_0447_9710485", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n// #include<atcoder/all>\n// using namespace atcoder;\n// using mint=atcoder::modint998244353;\n\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#define int long long\n\narray<int,3> dist[1009][1009][2];\n\n\ntemplate<class T>\nusing pqmin=priority_queue<T,vector<T>,greater<T>>;\n\nsigned main(){\n\tint h,w;cin>>h>>w;\n\tvector<string> s(h);for(auto&&e:s)cin>>e;\n\n\tint q;cin>>q;\n\tvector<array<int,4>> qs(q);\n\n\tfor(auto&&v:qs){\n\t\tfor(auto&&e:v)cin>>e;\n\t}\n\n\tfor(int i=0;i<h;i++){\n\t\tfor(int j=0;j<w;j++){\n\t\t\tfor(int k=0;k<2;k++){\n\t\t\t\tdist[i][j][k]={(int)1e9,-1,-1};\n\t\t\t}\n\t\t}\n\t}\n\n\tqueue<array<int,5>> pq;\n\tfor(int i=0;i<h;i++){\n\t\tfor(int j=0;j<w;j++){\n\t\t\tif(s[i][j]=='E'){\n\t\t\t\tdist[i][j][0]={0,i,j};\n\t\t\t\tpq.push({0,i,j,i,j});\n\t\t\t}\n\t\t}\n\t}\n\n\tint di[4]={-1,0,1,0};\n\tint dj[4]={0,-1,0,1};\n\n\twhile(pq.size()){\n\t\tauto[cost,pi,pj,i,j]=pq.front();pq.pop();\n\n\t\t// cout<<pi<<\" \"<<pj<<\" : \"<<cost<<\" \"<<i<<\" \"<<j<<endl;\n\n\t\tif(cost>dist[pi][pj][1][0])continue;\n\n\t\tfor(int k=0;k<4;k++){\n\t\t\tint ni=pi+di[k],nj=pj+dj[k];\n\n\t\t\tif(0<=ni&&ni<h&&0<=nj&&nj<w&&s[ni][nj]!='#'){\n\t\t\t\tif(dist[ni][nj][0]>array<int,3>{cost+1,i,j}){\n\t\t\t\t\tdist[ni][nj][0]=array<int,3>{cost+1,i,j};\n\t\t\t\t\tpq.push({cost+1,ni,nj,i,j});\n\t\t\t\t}else if(dist[ni][nj][1]>array<int,3>{cost+1,i,j}&&(dist[ni][nj][0][1]!=i||dist[ni][nj][0][2]!=j)){\n\t\t\t\t\tdist[ni][nj][1]=array<int,3>{cost+1,i,j};\n\t\t\t\t\tpq.push({cost+1,ni,nj,i,j});\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t// for(int i=0;i<h;i++){\n\t// \tfor(int j=0;j<w;j++){\n\t// \t\tcout<<((dist[i][j][0][0]<1e9)?dist[i][j][0][0]:-1)<<\" \";\n\t// \t}\n\t// \tcout<<endl;\n\t// }\n\n\t\n\t// cout<<endl;\n\n\t// for(int i=0;i<h;i++){\n\t// \tfor(int j=0;j<w;j++){\n\t// \t\tcout<<((dist[i][j][0][0]<1e9)?dist[i][j][0][1]:-1)<<\" \";\n\t// \t}\n\t// \tcout<<endl;\n\t// }\n\n\tfor(auto&&v:qs){\n\t\tauto[cost,i,j]=dist[v[0]][v[1]][0];\n\n\t\tif(i==v[2]&&j==v[3]){\n\t\t\tcout<<dist[v[0]][v[1]][1][0]<<endl;\n\t\t}else{\n\t\t\tcout<<cost<<endl;\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 220, "memory_kb": 96612, "score_of_the_acc": -0.557, "final_rank": 12 }, { "submission_id": "aoj_0447_9522183", "code_snippet": "#include <bits/stdc++.h>\n\nconst int dx[4]{ 1, 0, -1, 0 }, dy[4]{ 0, 1, 0, -1 };\n\nint main() {\n int N, M;\n std::cin >> N >> M;\n std::vector<std::string> S(N);\n for (auto& s : S) std::cin >> s;\n const int INF{(int)1e9};\n std::vector d1(N, std::vector<int>(M, INF)), d2{d1};\n std::vector p1(N, std::vector<std::pair<int, int>>(M, { -1, -1 })), p2{p1};\n std::queue<std::pair<int, int>> que;\n for (int i{} ; i < N ; i++) {\n for (int j{} ; j < M ; j++) {\n if (S[i][j] == 'E') {\n que.push(std::make_pair(i, j));\n d1[i][j] = 0;\n p1[i][j] = std::make_pair(i, j);\n }\n }\n }\n auto in{[&](int x, int y) -> bool {\n return 0 <= x and x < N and 0 <= y and y < M and S[x][y] != '#';\n }};\n while (que.size()) {\n auto [x, y]{que.front()};\n que.pop();\n for (int d{} ; d < 4 ; d++) {\n int nx{x + dx[d]}, ny{y + dy[d]};\n if (!in(nx, ny)) continue;\n bool upd{};\n if (d1[nx][ny] > d1[x][y] + 1) {\n upd = true;\n d2[nx][ny] = d1[nx][ny];\n p2[nx][ny] = p1[nx][ny];\n d1[nx][ny] = d1[x][y] + 1;\n p1[nx][ny] = p1[x][y];\n }\n else if (p1[x][y] != p1[nx][ny] and d2[nx][ny] > d1[x][y] + 1) {\n upd = true;\n d2[nx][ny] = d1[x][y] + 1;\n p2[nx][ny] = p1[x][y];\n }\n else if (p2[x][y] != p1[nx][ny] and d2[nx][ny] > d2[x][y] + 1) {\n upd = true;\n d2[nx][ny] = d2[x][y] + 1;\n p2[nx][ny] = p2[x][y];\n }\n if (upd) que.push(std::make_pair(nx, ny));\n }\n }\n int P;\n std::cin >> P;\n while (P--) {\n int sr, sc, br, bc;\n std::cin >> sr >> sc >> br >> bc;\n if (p1[sr][sc] == std::make_pair(br, bc)) {\n std::cout << d2[sr][sc] << '\\n';\n }\n else {\n std::cout << d1[sr][sc] << '\\n';\n }\n }\n}", "accuracy": 1, "time_ms": 210, "memory_kb": 36952, "score_of_the_acc": -0.2223, "final_rank": 8 }, { "submission_id": "aoj_0447_8826932", "code_snippet": "#include <bits/stdc++.h>\n\nint main() {\n int n, m;\n std::cin >> n >> m;\n std::vector<std::string> s(n);\n for (int i = 0; i < n; i++) std::cin >> s[i];\n const int N = 2;\n const int NONE = -1;\n std::vector dist(N, std::vector(n, std::vector<int>(m, NONE)));\n std::vector exit(N, std::vector(n, std::vector<std::pair<int, int>>(m, {NONE, NONE})));\n std::queue<std::tuple<int, int, int>> que;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n if (s[i][j] == 'E') {\n que.emplace(0, i, j);\n dist[0][i][j] = 0;\n exit[0][i][j] = {i, j};\n }\n }\n }\n const int D[] = {0, 1, 0, -1, 0};\n while (!que.empty()) {\n auto [level, i, j] = que.front();\n que.pop();\n for (int d = 0; d < 4; d++) {\n int ni = i + D[d];\n int nj = j + D[d + 1];\n if (ni < 0 || nj < 0 || ni >= n || nj >= m) continue;\n if (s[ni][nj] == '#') continue;\n if (dist[0][ni][nj] == -1) {\n // assert(level == 0);\n dist[0][ni][nj] = dist[level][i][j] + 1;\n exit[0][ni][nj] = exit[level][i][j];\n que.emplace(0, ni, nj);\n } else if (dist[1][ni][nj] == -1 && exit[level][i][j] != exit[0][ni][nj]) {\n // assert(level == 1);\n dist[1][ni][nj] = dist[level][i][j] + 1;\n exit[1][ni][nj] = exit[level][i][j];\n que.emplace(1, ni, nj);\n }\n }\n }\n int q;\n std::cin >> q;\n while (q--) {\n int si, sj;\n std::cin >> si >> sj;\n int gi, gj;\n std::cin >> gi >> gj;\n if (exit[0][si][sj] != std::pair<int, int>(gi, gj)) {\n std::cout << dist[0][si][sj] << '\\n';\n } else {\n std::cout << dist[1][si][sj] << '\\n';\n }\n }\n}", "accuracy": 1, "time_ms": 190, "memory_kb": 41064, "score_of_the_acc": -0.2189, "final_rank": 7 }, { "submission_id": "aoj_0447_8471339", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int INF = (1 << 30) - 1;\n\nconst vector<int> dx = {0, 1, 0, -1};\nconst vector<int> dy = {1, 0, -1, 0};\n#ifdef LOCAL\n#include <debug_print.hpp>\n#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define debug(...) (static_cast<void>(0))\n#endif\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N, M;\n cin >> N >> M;\n vector<string> A(N);\n for(int i = 0; i < N; i++) cin >> A[i];\n \n // 全出口に id を付けて, その出口からの各マスの距離を求める\n // 各マスについて, 最も近い出口と次に近い出口を求める\n map<pair<int, int>, int> exit;\n vector dist(N, vector(M, vector<int>(2, -1)));\n // {x, y, id, f := 最も近いか, 2 番目に近いか}\n queue<tuple<int, int, int, int>> que;\n // s[i][j][0] := (i, j) に最も近い出口の id\n // s[i][j][1] := (i, j) に 2 番目に近い出口の id\n vector s(N, vector(M, vector<int>(2, -1)));\n int cnt = 0;\n for(int i = 0; i < N; i++){\n for(int j = 0; j < M; j++){\n if(A[i][j] == 'E'){\n dist[i][j][0] = 0;\n que.emplace(i, j, cnt, 0);\n s[i][j] = {cnt, -1};\n exit[{i, j}] = cnt++;\n }\n }\n }\n\n while(!que.empty()){\n auto [x, y, id, f] = que.front();\n que.pop();\n for(int k = 0; k < 4; k++){\n int nx = x + dx[k], ny = y + dy[k];\n if(nx < 0 || nx >= N || ny < 0 || ny >= M) continue;\n if(A[nx][ny] == '#') continue;\n // 最も近い地点を更新\n if(dist[nx][ny][0] == -1){\n dist[nx][ny][0] = dist[x][y][f] + 1;\n s[nx][ny][0] = id;\n que.emplace(nx, ny, id, 0);\n // 2 番目に近い地点を更新\n }else if(dist[nx][ny][1] == -1 && s[nx][ny][0] != id){\n dist[nx][ny][1] = dist[x][y][f] + 1;\n s[nx][ny][1] = id;\n que.emplace(nx, ny, id, 1);\n }\n }\n }\n debug(dist, s);\n int P;\n cin >> P;\n while(P--){\n int sx, sy, br, bc; cin >> sx >> sy >> br >> bc;\n // 最も近い出口が壊れていない場合\n if(s[sx][sy][0] != exit[{br, bc}]){\n cout << dist[sx][sy][0] << \"\\n\";\n // 壊れている場合, 2 番目に近い出口\n }else{\n cout << dist[sx][sy][1] << \"\\n\";\n }\n }\n}", "accuracy": 1, "time_ms": 300, "memory_kb": 161392, "score_of_the_acc": -1.009, "final_rank": 18 }, { "submission_id": "aoj_0447_8074174", "code_snippet": "#include<bits/stdc++.h>\n#define overload(a,b,c,d,...) d\n#define rep1(a) for(ll _=0;_<a;++_)\n#define rep2(i,a) for(ll i=0;i<a;++i)\n#define rep3(i,a,b) for(ll i=a;i<b;++i)\n#define rep(...) overload(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(i,a) for(ll i=(ll)a-1;i>=0;--i)\n#define rrep2(i,a,b) for(ll i=(ll)b-1;i>=(ll)a;--i)\n#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)\n#define all(x) x.begin(),x.end()\n#define rall(x) x.rbegin(),x.rend()\n#define eb emplace_back\n#define pb push_back\nusing namespace std;\nusing ll=long long;\nusing ull=unsigned long long;\nusing ld=long double;\ntemplate<typename T,typename U>inline bool chmin(T&a,const U&b){return (a>b?a=b,true:false);}\ntemplate<typename T,typename U>inline bool chmax(T&a,const U&b){return (a<b?a=b,true:false);}\nstatic constexpr ll inf=numeric_limits<ll>::max()/2;\n/*\nll calc(ll x1,ll y1,ll x2,ll y2,ll x3,ll y3){\n return abs((x1-x3)*(y2-y3)-(x2-x3)*(y1-y3));\n}\nint main(){\n ll n;cin>>n;\n vector<ll>x(n),y(n);\n rep(i,n)cin>>x[i]>>y[i];\n ll area=0;\n rep(i,1,n-1){\n area+=calc(x[0],y[0],x[i],y[i],x[i+1],y[i+1]);\n }\n ll l=0,r=2;\n ll now=calc(x[0],y[0],x[1],y[1],x[2],y[2]);\n ll ans=abs(area-now*2);\n while(l<n){\n if(now>area/2){\n chmin(ans,abs(area-now*2));\n now-=calc(x[l],y[l],x[(l+1)%n],y[(l+1)%n],x[r],y[r]);\n l++;\n l%=n;\n if((r-l+n)%3==1){\n now+=calc(x[l],y[l],x[r],y[r],x[(r+1)%n],y[(r+1)%n]);\n r++;\n r%=n;\n }\n if(l==0)break;\n }\n chmin(ans,abs(area-now*2));\n now+=calc(x[l],y[l],x[r],y[r],x[(r+1)%n],y[(r+1)%n]);\n r++;\n r%=n;\n }\n cout<<fixed<<setprecision(12)<<ans/2.0<<endl;\n}*/\nconstexpr int dx[]={-1,0,1,0};\nconstexpr int dy[]={0,-1,0,1};\nusing T=pair<pair<ll,ll>,pair<ll,ll>>;\nconst T e={{inf,inf},{inf,inf}};\nT merge(T a,T b){\n vector<pair<ll,ll>>v;\n T ans=e;\n ans=a;\n if(b.first.first<ans.first.first){\n if(b.first.second!=ans.first.second){\n ans={b.first,ans.first};\n }\n else{\n ans={b.first,ans.second};\n }\n }\n else if(b.first.first<ans.second.first){\n if(b.first.second!=ans.first.second){\n ans={ans.first,b.first};\n }\n }\n if(b.second.first<ans.first.first){\n if(b.second.second!=ans.first.second){\n ans={b.second,ans.first};\n }\n else{\n ans={b.second,ans.second};\n }\n }\n else if(b.second.first<ans.second.first){\n if(b.second.second!=ans.first.second){\n ans={ans.first,b.second};\n }\n }\n return ans;\n}\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n ll n,m;\n cin>>n>>m;\n vector<string>s(n);\n for(auto&e:s)cin>>e;\n vector<T>dist(n*m,e);\n queue<pair<T,ll>>pq;\n rep(i,n)rep(j,m)if(s[i][j]=='E'){\n dist[i*m+j]={{0,i*m+j},{inf,inf}};\n pq.push({dist[i*m+j],i*m+j});\n }\n vector<ll>vis(n*m);\n int cnt=0;\n while(!pq.empty()){\n //cerr<<pq.size()<<endl;\n auto a=pq.front();pq.pop();\n T d=a.first;\n ll id=a.second;\n if(dist[id]!=d)continue;\n cnt++;\n ll x=id/m,y=id%m;\n //cerr<<cnt<<endl;\n //cerr<<x<<\" \"<<y<<endl;\n //cerr<<'{'<<dist[id].first.first<<\" \"<<dist[id].first.second<<'}'<<\" {\"<<dist[id].second.first<<\" \"<<dist[id].second.second<<\"}\"<<endl;\n rep(dir,4){\n ll nx=x+dx[dir],ny=y+dy[dir];\n if(nx<0||nx>=n||ny<0||ny>=m||s[nx][ny]=='#')continue;\n T nxt=d;\n nxt.first.first++,nxt.second.first++;\n auto tmp=merge(dist[nx*m+ny],nxt);\n if(tmp!=dist[nx*m+ny]){\n dist[nx*m+ny]=tmp;\n pq.push({dist[nx*m+ny],nx*m+ny});\n }\n }\n }\n /*\n rep(i,n){\n rep(j,m){\n cerr<<'{'<<dist[i*m+j].first.first<<\" \"<<dist[i*m+j].first.second<<'}'<<\" {\"<<dist[i*m+j].second.first<<\" \"<<dist[i*m+j].second.second<<\"} \";\n }\n cout<<endl;\n }*/\n ll q;cin>>q;\n while(q--){\n ll sx,sy,bx,by;\n cin>>sx>>sy>>bx>>by;\n if(dist[sx*m+sy].first.second==bx*m+by){\n cout<<dist[sx*m+sy].second.first<<endl;\n }\n else{\n cout<<dist[sx*m+sy].first.first<<endl;\n }\n }\n}", "accuracy": 1, "time_ms": 200, "memory_kb": 84500, "score_of_the_acc": -0.466, "final_rank": 11 }, { "submission_id": "aoj_0447_7282119", "code_snippet": "#pragma GCC target(\"avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int N, M;\n cin >> N >> M;\n vector<string> S(N);\n vector<pair<int, int>> dir = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};\n vector<vector<vector<int>>> dist(N, vector<vector<int>>(M, vector<int>(6)));\n queue<int> que;\n for( int i = 0; i < N; i++ ) {\n cin >> S[i];\n for( int j = 0; j < M; j++ ) {\n if( S[i][j] == 'E' ) {\n dist[i][j] = {0, i, j, N*M, -1, -1};\n que.emplace((i<<10)|j);\n }else {\n dist[i][j] = {N*M, -1, -1, N*M, -1, -1};\n }\n }\n }\n auto is_valid_cell = [&](int x, int y) {\n return ( 0 <= x && x < N && 0 <= y && y < M && S[x][y] != '#' );\n };\n while( !que.empty() ) {\n int f = que.front(), cx = f>>10, cy = f&1023;\n que.pop();\n for( int k = 0; k < 6; k+=3 ) {\n for( auto& [x, y] : dir ) {\n int nx = cx+x, ny = cy+y;\n if( is_valid_cell(nx, ny) && dist[nx][ny][3] > dist[cx][cy][k]+1 ) {\n if( ( dist[nx][ny][1] == dist[cx][cy][k+1] && dist[nx][ny][2] == dist[cx][cy][k+2] ) || ( dist[nx][ny][4] == dist[cx][cy][k+1] && dist[nx][ny][5] == dist[cx][cy][k+2] ) ) continue;\n que.emplace((nx<<10)|ny);\n dist[nx][ny][3] = dist[cx][cy][k]+1;\n dist[nx][ny][4] = dist[cx][cy][k+1];\n dist[nx][ny][5] = dist[cx][cy][k+2];\n if( dist[nx][ny][0] > dist[nx][ny][3] ) {\n for( int l = 0; l < 3; l++ ) {\n swap(dist[nx][ny][l], dist[nx][ny][3+l]);\n }\n }\n }\n }\n }\n }\n int P;\n cin >> P;\n for( int p = 0; p < P; p++ ) {\n int sr, sc, br, bc;\n cin >> sr >> sc >> br >> bc;\n if( dist[sr][sc][1] == br && dist[sr][sc][2] == bc ) {\n cout << dist[sr][sc][3] << endl;\n }else {\n cout << dist[sr][sc][0] << endl;\n }\n }\n}", "accuracy": 1, "time_ms": 290, "memory_kb": 62844, "score_of_the_acc": -0.4646, "final_rank": 10 }, { "submission_id": "aoj_0447_7074852", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<int(n);i++)\n\nconstexpr int inf=1e9+10;\nconstexpr char newl='\\n';\nconstexpr int dx[]={0,1,0,-1};\nconstexpr int dy[]={1,0,-1,0};\n\nbool valid(int i,int j,int h,int w){\n return 0<=i && i<h && 0<=j && j<w;\n}\n\nvector<int> add(vector<int> s,vector<int> t){\n while(s.size()<t.size())s.emplace_back(0);\n while(t.size()<s.size())t.emplace_back(0);\n s.emplace_back(0);\n rep(i,t.size()){\n s[i]+=t[i];\n if(s[i]>=10){\n s[i]-=10;\n s[i+1]++;\n }\n }\n if(s.back()==0)s.pop_back();\n return s;\n}\nvector<int> prod(vector<int> s,int x){\n vector<int> ans={0};\n rep(i,x)ans=add(ans,s);\n return ans;\n}\nstruct value{\n int x,y;\n int dist;\n value(int x=-1,int y=-1,int dist=inf):x(x),y(y),dist(dist){}\n //distが等しかったらfalse\n bool operator<(const value r)const{\n return dist<r.dist;\n }\n value add_one()const{\n return value(x,y,dist+1);\n }\n pair<int,int> beg()const{\n return make_pair(x,y);\n }\n};\n\ntemplate<typename T>\nbool chmin(T &a,T b){\n return b<a ? a=b,true:false;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int n,m;\n cin >> n >> m;\n vector<string> s(n);\n rep(i,n)cin >> s[i];\n vector<vector<array<value,2>>> dp(n,vector<array<value,2>>(m));\n //{{点},0番or1番}\n queue<pair<pair<int,int>,int>> q;\n rep(i,n)rep(j,m){\n if(s[i][j]=='E'){\n dp[i][j][0]=value(i,j,0);\n q.push({{i,j},0});\n }\n }\n while(!q.empty()){\n auto [p,k]=q.front();q.pop();\n auto [i,j]=p;\n auto now=dp[i][j][k];\n rep(k,4){\n int ni=i+dx[k],nj=j+dy[k];\n if(valid(ni,nj,n,m) && s[ni][nj]!='#'){\n //一番を更新できるか？更新できるなら2番に1番を移すのを忘れない、、？\n //距離が短いところから見ているので、1番が更新できる => まだ一度も見ていない\n if(chmin(dp[ni][nj][0],now.add_one())){\n q.push({{ni,nj},0});\n }\n else if(dp[ni][nj][0].beg()!=now.beg() && chmin(dp[ni][nj][1],now.add_one())){\n q.push({{ni,nj},1});\n }\n }\n }\n }\n\n int p;\n cin >> p;\n while(p--){\n int sx,sy,gx,gy;\n cin >> sx >> sy >> gx >> gy;\n if(dp[sx][sy][0].beg()!=make_pair(gx,gy)){\n cout << dp[sx][sy][0].dist << newl;\n }\n else{\n cout << dp[sx][sy][1].dist << newl;\n }\n }\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 39864, "score_of_the_acc": -0.0842, "final_rank": 4 }, { "submission_id": "aoj_0447_7074383", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define vi vector<int>\n#define pii pair<int,int>\n#define pll pair<ll,ll>\nusing namespace std;\nusing ll = long long;\n\nconstexpr int dy[] = { -1,0,1,0 }, dx[] = { 0,-1,0,1 };\n\nint main(){\n\tint n,m;\n\tcin >> n >> m;\n\tvector<string> s(n);\n\trep(i, n) cin >> s[i];\n\tqueue<pii> que;\n\tvector<vector<pii>> dist(n, vector<pii>(m, { -1, -1 }));\n\tvector<vector<pii>> dist2(n, vector<pii>(m, { -1, -1 }));\n\trep(i, n) rep(j, m) if(s[i][j] == 'E'){\n\t\tdist[i][j] = { 0, i*m+j };\n\t\tque.push({ i*m+j, i*m+j });\n\t}\n\twhile(!que.empty()){\n\t\tconst int posy = que.front().first / m;\n\t\tconst int posx = que.front().first % m;\n\t\tconst int idx = que.front().second;\n\t\tque.pop();\n\t\tconst int d = dist[posy][posx].second == idx ? dist[posy][posx].first+1 : dist2[posy][posx].first+1;\n\t\trep(i, 4){\n\t\t\tconst int y = posy + dy[i];\n\t\t\tconst int x = posx + dx[i];\n\t\t\tif(y < 0 || x < 0 || y >= n || x >= m) continue;\n\t\t\tif(s[y][x] == '#') continue;\n\t\t\tif(dist[y][x].first == -1){\n\t\t\t\tdist[y][x] = { d, idx };\n\t\t\t\tque.push({ y*m+x, idx });\n\t\t\t}else if(dist2[y][x].first == -1 && dist[y][x].second != idx){\n\t\t\t\tdist2[y][x] = { d, idx };\n\t\t\t\tque.push({ y*m+x, idx });\n\t\t\t}\n\t\t}\n\t}\n\tint p; cin >> p;\n\trep(i, p){\n\t\tint sy,sx, by,bx;\n\t\tcin >> sy >> sx >> by >> bx;\n\t\tif(dist[sy][sx].second != by*m+bx) cout << dist[sy][sx].first << \"\\n\";\n\t\telse cout << dist2[sy][sx].first << \"\\n\";\n\t}\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 29008, "score_of_the_acc": -0.1282, "final_rank": 5 }, { "submission_id": "aoj_0447_7052981", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long;\nconst lint mod = 998244353;\n#define rep(i, n) for(int i = 0; i < int(n); i++)\n#define rep2(i, l, r) for(int i = int(l); i < int(r); i++)\n#define repr(i, n) for(int i = int(n) - 1; i >= 0; i--)\n#define repr2(i, l, r) for(int i = int(r) - 1; i >= int(l); i--)\n\nint dy[4] = {0, 1, 0, -1};\nint dx[4] = {1, 0, -1, 0};\n\nusing Graph = vector<vector<int>>;\n\nvector<pair<pair<int, int>, int>> BFS(const Graph &g, vector<int> s){ // dist, dist2, nearest\n int n = int(g.size());\n \n pair<int, int> dist[n]; // length, born\n pair<int, int> dist2[n]; // length, born\n rep(i, n) dist[i] = {-1, -1};\n rep(i, n) dist2[i] = {-1, -1};\n rep(i, s.size()){\n dist[s[i]] = {0, i};\n }\n \n queue<pair<int, pair<int, int>>> que; // at, length, born\n rep(i, s.size()){\n que.push({s[i], {0, i}});\n }\n \n while(!que.empty()){\n auto top = que.front();\n que.pop();\n int at = top.first;\n int length = top.second.first;\n int born = top.second.second;\n \n for(int to: g[at]){\n if(dist[to].first == -1){\n dist[to] = {length + 1, born};\n que.push({to, {length + 1, born}});\n }else if(dist2[to].first == -1 && dist[to].second != born){\n dist2[to] = {length + 1, born};\n que.push({to, {length + 1, born}});\n }\n }\n }\n \n vector<pair<pair<int, int>, int>> res(n);\n rep(i, n){\n res[i] = {{dist[i].first, dist2[i].first}, dist[i].second};\n }\n return res;\n}\n\nstring s[1010];\nint exit_num[1010][1010];\n\nint main(){\n int n, m;\n cin >> n >> m;\n rep(i, n) cin >> s[i];\n \n Graph g(n * m);\n auto func = [&](int y, int x){ return y * m + x; };\n auto is_inside = [&](int y, int x){ return 0 <= y && y < n && 0 <= x && x < m; };\n rep(y, n){\n rep(x, m){\n rep(c, 4){\n int y2 = y + dy[c];\n int x2 = x + dx[c];\n if(!is_inside(y2, x2)) continue;\n if(s[y2][x2] == '#') continue;\n \n int a = func(y, x), b = func(y2, x2);\n g[a].push_back(b);\n }\n }\n }\n \n vector<int> exits;\n rep(i, n) rep(j, m){\n if(s[i][j] == 'E'){\n exit_num[i][j] = int(exits.size());\n \n exits.push_back(func(i, j));\n }\n }\n \n auto dist_data = BFS(g, exits);\n \n int p;\n cin >> p;\n rep(_, p){\n int sy, sx, gy, gx;\n cin >> sy >> sx >> gy >> gx;\n int s = func(sy, sx);\n int g_num = exit_num[gy][gx];\n \n int dist = dist_data[s].first.first;\n int dist2 = dist_data[s].first.second;\n int nearest_exit = dist_data[s].second;\n \n if(g_num != nearest_exit){\n cout << dist << endl;\n }else{\n cout << dist2 << endl;\n }\n }\n}", "accuracy": 1, "time_ms": 280, "memory_kb": 106928, "score_of_the_acc": -0.6896, "final_rank": 15 }, { "submission_id": "aoj_0447_6981751", "code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 0447.cc: Broken Exit\n */\n\n#include<cstdio>\n#include<vector>\n#include<queue>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 1000;\nconst int MAX_M = 1000;\nconst int MAX_NM = MAX_N * MAX_M;\n\nconst int dxs[] = { 1, 0, -1, 0 }, dys[] = { 0, -1, 0, 1 };\n\n/* typedef */\n\ntypedef vector<int> vi;\n\nstruct Stat {\n int d, i, e;\n Stat() {}\n Stat(int _d, int _i, int _e): d(_d), i(_i), e(_e) {}\n};\n\n/* global variables */\n\nchar fs[MAX_N][MAX_M + 4];\nint ds0[MAX_NM], ds1[MAX_NM], des0[MAX_NM], des1[MAX_NM];\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, m;\n scanf(\"%d%d\", &n, &m);\n int nm = n * m;\n\n vi ev;\n for (int y = 0, p = 0; y < n; y++) {\n scanf(\"%s\", fs[y]);\n for (int x = 0; x < m; x++, p++)\n if (fs[y][x] == 'E') ev.push_back(p);\n }\n\n fill(ds0, ds0 + nm, -1);\n fill(ds1, ds1 + nm, -1);\n\n queue<Stat> q;\n for (auto e: ev)\n ds0[e] = 0, des0[e] = e, q.push(Stat(0, e, e));\n\n while (! q.empty()) {\n Stat u = q.front(); q.pop();\n int uy = u.i / m, ux = u.i % m;\n int vd = u.d + 1;\n\n for (int di = 0; di < 4; di++) {\n int vy = uy + dys[di], vx = ux + dxs[di];\n if (vy >= 0 && vy < n && vx >= 0 && vx < m && fs[vy][vx] != '#') {\n\tint v = vy * m + vx;\n\tif (ds0[v] < 0)\n\t ds0[v] = vd, des0[v] = u.e, q.push(Stat(vd, v, u.e));\n\telse if (ds1[v] < 0 && des0[v] != u.e)\n\t ds1[v] = vd, des1[v] = u.e, q.push(Stat(vd, v, u.e));\n }\n }\n }\n\n int qn;\n scanf(\"%d\", &qn);\n\n while (qn--) {\n int sy, sx, by, bx;\n scanf(\"%d%d%d%d\", &sy, &sx, &by, &bx);\n int s = sy * m + sx;\n int b = by * m + bx;\n\n printf(\"%d\\n\", (des0[s] != b) ? ds0[s] : ds1[s]);\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 33152, "score_of_the_acc": -0.0224, "final_rank": 1 }, { "submission_id": "aoj_0447_6955164", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\n\nint INF = 1 << 20;\nvvi Directions = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};\n\nint main() {\n int n, m, p;\n cin >> n >> m;\n\n vector<string> S;\n for (int i = 0; i < n; ++i) {\n string s;\n cin >> s;\n S.push_back(s);\n }\n\n vi E;\n vvi MinE(n, vi(m));\n vector<vvi> DP(n, vvi(m, vi(2)));\n queue<vi> Que;\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < m; ++j) {\n if (S[i][j] == 'E') {\n E.push_back(i * m + j);\n MinE[i][j] = i * m + j;\n DP[i][j][0] = 0;\n DP[i][j][1] = INF;\n Que.push({i, j, i, j, 0});\n }\n else {\n DP[i][j][0] = INF;\n DP[i][j][1] = INF;\n }\n }\n }\n\n while (!Que.empty()) {\n int ci, cj, ei, ej, di, dj, ni, nj, d;\n ci = Que.front()[0];\n cj = Que.front()[1];\n ei = Que.front()[2];\n ej = Que.front()[3];\n d = Que.front()[4];\n Que.pop();\n for (int i = 0; i < 4; ++i) {\n di = Directions[i][0];\n dj = Directions[i][1];\n ni = ci + di;\n nj = cj + dj;\n if (0 <= ni && ni < n && 0 <= nj && nj < m) {\n if (S[ni][nj] == '#') {\n continue;\n }\n if (DP[ni][nj][d] <= DP[ci][cj][d] + 1) {\n if (d == 0) {\n if (DP[ni][nj][1] <= DP[ci][cj][0] + 1) {\n continue;\n }\n if (MinE[ni][nj] == ei * m + ej) {\n continue;\n }\n DP[ni][nj][1] = DP[ci][cj][0] + 1;\n Que.push({ni, nj, ei, ej, 1});\n }\n }\n else {\n DP[ni][nj][d] = DP[ci][cj][d] + 1;\n if (d == 0) {\n MinE[ni][nj] = ei * m + ej;\n }\n Que.push({ni, nj, ei, ej, d});\n }\n }\n }\n }\n\n cin >> p;\n for (int i = 0; i < p; ++i) {\n int ci, cj, ei, ej;\n cin >> ci >> cj >> ei >> ej;\n if (MinE[ci][cj] == ei * m + ej) {\n cout << DP[ci][cj][1] << endl;\n }\n else {\n cout << DP[ci][cj][0] << endl;\n }\n }\n\n}", "accuracy": 1, "time_ms": 340, "memory_kb": 120680, "score_of_the_acc": -0.8407, "final_rank": 16 }, { "submission_id": "aoj_0447_6955139", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint INF = 1 << 20;\nvector<vector<int>> Directions = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};\n\nint main() {\n int n, m, p;\n cin >> n >> m;\n\n vector<string> S;\n for (int i = 0; i < n; ++i) {\n string s;\n cin >> s;\n S.push_back(s);\n }\n\n vector<int> E;\n vector<vector<int>> MinE(n, vector<int>(m));\n vector<vector<vector<int>>> DP(n, vector<vector<int>>(m, vector<int>(2)));\n queue<vector<int>> Que;\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < m; ++j) {\n if (S[i][j] == 'E') {\n E.push_back(i * m + j);\n MinE[i][j] = i * m + j;\n DP[i][j][0] = 0;\n DP[i][j][1] = INF;\n Que.push({i, j, i, j, 0});\n }\n else {\n DP[i][j][0] = INF;\n DP[i][j][1] = INF;\n }\n }\n }\n\n while (!Que.empty()) {\n int ci, cj, ei, ej, di, dj, ni, nj, d;\n ci = Que.front()[0];\n cj = Que.front()[1];\n ei = Que.front()[2];\n ej = Que.front()[3];\n d = Que.front()[4];\n Que.pop();\n for (int i = 0; i < 4; ++i) {\n di = Directions[i][0];\n dj = Directions[i][1];\n ni = ci + di;\n nj = cj + dj;\n if (0 <= ni && ni < n && 0 <= nj && nj < m) {\n if (S[ni][nj] == '#') {\n continue;\n }\n if (DP[ni][nj][d] <= DP[ci][cj][d] + 1) {\n if (d == 0) {\n if (DP[ni][nj][1] <= DP[ci][cj][0] + 1) {\n continue;\n }\n if (MinE[ni][nj] == ei * m + ej) {\n continue;\n }\n DP[ni][nj][1] = DP[ci][cj][0] + 1;\n Que.push({ni, nj, ei, ej, 1});\n }\n }\n else {\n DP[ni][nj][d] = DP[ci][cj][d] + 1;\n if (d == 0) {\n MinE[ni][nj] = ei * m + ej;\n }\n Que.push({ni, nj, ei, ej, d});\n }\n }\n }\n }\n\n cin >> p;\n for (int i = 0; i < p; ++i) {\n int ci, cj, ei, ej;\n cin >> ci >> cj >> ei >> ej;\n if (MinE[ci][cj] == ei * m + ej) {\n cout << DP[ci][cj][1] << endl;\n }\n else {\n cout << DP[ci][cj][0] << endl;\n }\n }\n\n}", "accuracy": 1, "time_ms": 360, "memory_kb": 120652, "score_of_the_acc": -0.8662, "final_rank": 17 }, { "submission_id": "aoj_0447_6044339", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long mod1 = 1000000007;\nconst long long mod2 = 998244353;\ndouble pi = 3.141592653589;\nusing ll = long long;\nvector<ll> dx = {-1,0,1,0,1,1,-1,-1};\nvector<ll> dy = {0,1,0,-1,1,-1,1,-1};\nvector<char> abc = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};\nvector<char> ABC = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};\n \nstruct UnionFind{\n vector<ll> par, siz;\n \n UnionFind(ll n):par(n,-1),siz(n,1){}\n \n ll root(ll x){//親を返す\n if(par[x] == -1) return x;\n else return par[x] = root(par[x]);\n }\n \n bool issame(ll x,ll y){//同じグループかどうか\n return root(x) == root(y);\n }\n \n bool unite(ll x, ll y){//合体\n x = root(x); y = root(y);\n if(x == y) return false;\n if(siz[x] < siz[y]) swap(x,y);\n par[y] = x;\n siz[x] += siz[y];\n return true;\n }\n \n ll size(ll x){//xがいるグループのサイズ\n return siz[root(x)];\n }\n \n \n \n};\n \nlong long pow2(long long x,long long n){\n long long ans = 1;\n while(n != 0){\n long long a = x;\n long long z = 1;\n while(z*2 <= n){\n a *=a;\n a=a%mod2;\n z*=2;\n }\n ans*=a;\n ans=ans%mod2;\n n-=z;\n }\n return ans; \n}//累乗 x^n\n \ntemplate<typename T>\nvoid input_vec(vector<T> &A){\n ll N = A.size();\n for(int i = 0; i < N; i++){\n cin >> A.at(i);\n }\n return;\n}//入力を配列で受け取る\n \ntemplate<typename T>\nvoid output_vec(vector<T> &A){\n ll N = A.size();\n for(int i = 0; i < N; i++){\n if(i != 0){\n cout << \" \";\n }\n cout << A.at(i);\n }\n cout << endl;\n return;\n}//配列を出力\n \ntemplate<typename T>\nlong long count_x(vector<T> &A,T x){\n long long counter = 0;\n for(int i = 0; i < (int)A.size(); i++){\n if(A.at(i) == x){\n counter++;\n }\n }\n return counter;\n}//配列内のxの個数をreturn\n \ntemplate<typename T>\nlong long duplicate(vector<T> &A){\n ll ans = 0;\n ll N = A.size();\n T a = A.at(0);\n for(int i = 1; i < N; i++){\n if(a == A.at(i)) ans++;\n else a = A.at(i);\n }\n return ans;\n}\n \ntemplate<typename T>\nvoid chmin(T &a,T b){\n if(a>b){\n a = b;\n }\n return;\n}\n \ntemplate<typename T>\nvoid chmax(T&a,T b){\n if(a < b){\n a = b;\n }\n return;\n}\n\n/*\n絶対値 abs()\n配列の要素の追加 push_back() \nchar→intに変換 -'0'\nstring→intに変換 atoi(文字列名.c_str())\n配列の中身をN個の０で初期化 配列名.resize(N)\n配列の中身をN個のaで初期化 配列名.assign(N,a)\n配列の中からK以上の数字の最小値を出力　lower_bound(配列.begin(),配列.end(),K)\n入力scanf(\"%lld %lld\",&a,&b) みたいな感じ &を忘れずに\n小数の桁数設定cout << fixed << setprecision(桁数);\n*/\nvector<vector<ll>> ans;\nvector<vector<ll>> ans2;\nvector<vector<pair<ll,ll>>> check;\nvector<string> g;\nint main(){\n ll N,M; cin >> N >> M;\n g.assign(N,\"\");\n input_vec(g);\n queue<tuple<ll,ll,ll,ll,ll>> q;\n ans.assign(N,vector<ll>(M,-1));\n ans2.assign(N,vector<ll>(M,-1));\n check.assign(N,vector<pair<ll,ll>>(M));\n for(int i = 0; i < N; i++){\n for(int j = 0; j < M; j++){\n if(g[i][j] == 'E'){\n q.push(make_tuple(i,j,i,j,0));\n ans[i][j] = 0;\n check[i][j] = make_pair(i,j);\n }\n }\n }\n \n while(!q.empty()){\n ll x,y,ox,oy,r; tie(x,y,ox,oy,r) = q.front();\n q.pop();\n for(int i = 0; i < 4; i++){\n ll nx = x+dx[i];\n ll ny = y+dy[i];\n if(nx<0||nx>=N||ny<0||ny>=M) continue;\n if(g[nx][ny] == '#') continue;\n if(ans2[nx][ny] != -1) continue;\n if(ans[nx][ny] == -1){\n ans[nx][ny] = r+1;\n check[nx][ny] = make_pair(ox,oy);\n q.push(make_tuple(nx,ny,ox,oy,r+1));\n }\n else if(check[nx][ny] == make_pair(ox,oy)) continue;\n else {\n ans2[nx][ny] = r+1;\n q.push(make_tuple(nx,ny,ox,oy,r+1));\n }\n }\n }\n \n /*for(int i = 0; i < N; i++){\n for(int j = 0; j < M; j++){\n cout << ans[i][j] << \" \";\n }\n cout << endl;\n }*/\n \n ll P; cin >> P;\n for(int i = 0; i < P; i++){\n ll sx,sy,gx,gy; cin >> sx >> sy >> gx >> gy;\n if(check[sx][sy] == make_pair(gx,gy)) cout << ans2[sx][sy] << endl;\n else cout << ans[sx][sy] << endl;\n }\n \n \n}", "accuracy": 1, "time_ms": 220, "memory_kb": 77652, "score_of_the_acc": -0.4547, "final_rank": 9 }, { "submission_id": "aoj_0447_6035040", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\ntemplate<class T> using vc = vector<T>;\ntemplate<class T> using vvc = vc<vc<T>>;\ntemplate<class T> using vvvc = vc<vvc<T>>;\ntemplate<class T> using vvvvc = vvc<vvc<T>>;\ntemplate<class T> using PQ = priority_queue<T>;\ntemplate<class T> using invPQ = priority_queue<T, vector<T>, greater<T>>;\nusing IP = pair<int, int>;\nusing LP = pair<ll, ll>;\n#define all(x) begin(x), end(x)\n#define allr(x) rbegin(x), rend(x)\n#define rep(i, n) for (int i = 0; (i) < (int)(n); i++)\n#define rep3(i, m, n) for (int i = (m); (i) < (int)(n); i++)\n#define repr(i, n) for (int i = (n) - 1; (i) >= 0; i--)\n#define rep3r(i, m, n) for (int i = (n) - 1; (i) >= (int)(m); i--)\ntemplate<class T> inline bool chmax(T & a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T & a, T b) { if (a > b) { a = b; return 1; } return 0; }\n#define INF 1000000\n\nint dx[4] = { 1, 0, -1, 0 },\n dy[4] = { 0, 1, 0, -1 };\n\nbool chmin2(pair<IP, IP> &a, IP b) {\n if (a.first.second < b.first) return false;\n if (a.second.first == b.second) {\n if (a.first.first > b.first) {\n a.first.first = b.first;\n return true;\n }\n else {\n return false;\n }\n }\n else if (a.second.second == b.second) {\n if (a.first.first > b.first) {\n a.first.second = a.first.first;\n a.second.second = a.second.first;\n a.first.first = b.first;\n a.second.first = b.second;\n return true;\n }\n else {\n a.first.second = b.first;\n return true;\n }\n }\n if (a.first.first > b.first) {\n a.first.second = a.first.first;\n a.second.second = a.second.first;\n a.first.first = b.first;\n a.second.first = b.second;\n return true;\n }\n a.first.second = b.first;\n a.second.second = b.second;\n return true;\n}\n\nsigned main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n \n int N, M;\n cin >> N >> M;\n vc<string> row(N);\n rep (i, N) cin >> row[i];\n int P;\n cin >> P;\n vc<int> sr(P), sc(P), br(P), bc(P);\n rep (i, P) cin >> sr[i] >> sc[i] >> br[i] >> bc[i];\n \n vvc<pair<IP, IP>> dist(N, vc<pair<IP, IP>>(M, make_pair(make_pair(INF, INF), make_pair(-1, -1))));\n queue<tuple<int, int, int>> que;\n vvvc<bool> seen(N, vvc<bool>(M, vc<bool>(2)));\n rep (i, N) rep (j, M) {\n if (row[i][j] == 'E') {\n dist[i][j].first.first = 0;\n dist[i][j].second.first = i*M+j;\n que.push({ 0, i*M+j, i*M+j });\n seen[i][j][0] = true;\n }\n }\n \n while (!que.empty()) {\n int r = get<1>(que.front()) / M, c = get<1>(que.front()) % M, d = get<0>(que.front()), e = get<2>(que.front()); que.pop();\n rep (i, 4) {\n int er = r + dx[i], ec = c + dy[i];\n if (er < 0 || er >= N || ec < 0 || ec >= M || row[er][ec] == '#' || seen[er][ec][1]) continue;\n if (!seen[er][ec][0]) {\n seen[er][ec][0] = true;\n dist[er][ec].first.first = d+1;\n dist[er][ec].second.first = e;\n que.push({ d+1, er*M+ec, e });\n }\n else if (!seen[er][ec][1] && !(dist[er][ec].second.first == e)) {\n seen[er][ec][1] = true;\n dist[er][ec].first.second = d+1;\n dist[er][ec].second.second = e;\n que.push({ d+1, er*M+ec, e });\n }\n }\n }\n \n rep (i, P) {\n if (dist[sr[i]][sc[i]].second.first == br[i] * M + bc[i]) cout << dist[sr[i]][sc[i]].first.second << endl;\n else cout << dist[sr[i]][sc[i]].first.first << endl;\n }\n}", "accuracy": 1, "time_ms": 260, "memory_kb": 103788, "score_of_the_acc": -0.647, "final_rank": 14 }, { "submission_id": "aoj_0447_6022144", "code_snippet": "#include <bits/stdc++.h>\n\nusing ll = long long;\n\ntemplate <class T> using Vec = std::vector<T>;\n\nconstexpr int dx[] = {0, 1, 0, -1};\nconstexpr int dy[] = {1, 0, -1, 0};\n\nint main() {\n std::ios_base::sync_with_stdio(false);\n std::cin.tie(nullptr);\n int n, m;\n std::cin >> n >> m;\n Vec<Vec<char>> grid(n + 2, Vec<char>(m + 2, '#'));\n Vec<std::pair<int, int>> exit;\n for (int i = 1; i <= n; ++i) {\n for (int j = 1; j <= m; ++j) {\n std::cin >> grid[i][j];\n if (grid[i][j] == 'E') {\n exit.emplace_back(i, j);\n }\n }\n }\n Vec<Vec<std::array<int, 2>>> dist(n + 2, Vec<std::array<int, 2>>(m + 2));\n Vec<Vec<std::array<int, 2>>> exit_id(n + 2, Vec<std::array<int, 2>>(m + 2));\n for (int i = 0; i <= n + 1; ++i) {\n for (int j = 0; j <= m + 1; ++j) {\n dist[i][j].fill(-1);\n exit_id[i][j].fill(-1);\n }\n }\n std::queue<std::tuple<int, int, int>> que;\n auto push = [&](int i, int j, int d, int e) {\n if (dist[i][j][0] == -1) {\n dist[i][j][0] = d;\n exit_id[i][j][0] = e;\n que.emplace(i, j, 0);\n } else if (dist[i][j][1] == -1 and exit_id[i][j][0] != e) {\n dist[i][j][1] = d;\n exit_id[i][j][1] = e;\n que.emplace(i, j, 1);\n }\n };\n for (int e = 0; e < (int)exit.size(); ++e) {\n push(exit[e].first, exit[e].second, 0, e);\n }\n while (!que.empty()) {\n const auto [i, j, k] = que.front();\n que.pop();\n for (int dir = 0; dir < 4; ++dir) {\n int ni = i + dx[dir];\n int nj = j + dy[dir];\n if (grid[ni][nj] != '#') {\n push(ni, nj, dist[i][j][k] + 1, exit_id[i][j][k]);\n }\n }\n }\n int q;\n std::cin >> q;\n while (q--) {\n int a, b, c, d;\n std::cin >> a >> b >> c >> d;\n a += 1, b += 1, c += 1, d += 1;\n for (int k = 0; k < 2; ++k) {\n const auto& [x, y] = exit[exit_id[a][b][k]];\n if (x != c or y != d) {\n std::cout << dist[a][b][k] << '\\n';\n break;\n }\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 35980, "score_of_the_acc": -0.0504, "final_rank": 3 } ]
aoj_0448_cpp
Robot Arm PCK Industry is developing a new robot arm. The task of this robot arm is to sort $N$ parts assigned numbers from 1 to $N$ in a single row, in order of decreasing number. The robot arm can select three parts in one operation (they do not have to be next to each other) and perform the following exchange operations on them. When the selected parts are numbered a, b, and c from the beginning, swap the positions of these parts in the order b, c, a or c, a, b. For example, if the parts are lined up as 3 6 1 5 4 2 and the robot arm selects the part with 6 5 4, these positions can be swapped and rearranged in the order 3 5 1 4 6 2 or 3 4 1 6 5 2. Write a program which reads a sequence of parts and finds the minimum number of operations of the robot arm required to sort them in the order of decreasing number. If it is not possible to sort the parts in decreasing order no matter how the operations are performed, output -1. Input The input is given in the following format. $N$ $h_1$ $h_2$ ... $h_N$ The first line gives the number of parts $N$ ($3 \leq N \leq 200,000$). The second line gives the number of each part $h_i$ ($1 \leq h_i \leq N$). All numbers are different (if $i \ne j$, then $h_i \ne h_j$) Output Output the minimum number of operations in a line. If the numbers cannot be sorted in decreasing order, output -1 . Sample Input and Output Sample Input 1 6 2 3 4 1 6 5 Sample Output 1 3 Sample Input 2 4 2 3 4 1 Sample Output 2 -1
[ { "submission_id": "aoj_0448_9612568", "code_snippet": "#include <bits/stdc++.h>\n#define ll long long\nusing namespace std;\n\nclass DSU\n{\n\tvector<int> parent, sz;\n\npublic:\n\tDSU(const int size) : parent(size, -1),sz(size,1) {};\n\tint find(const int a)\n\t{\n\t\treturn parent[a] < 0 ? a : parent[a] = find(parent[a]);\n\t}\n\tint groupSize(const int a)\n\t{\n\t\treturn sz[find(a)];\n\t}\n\tvoid merge(int a, int b)\n\t{\n\t\ta = find(a);\n\t\tb = find(b);\n\t\tif (a == b)\n\t\t\treturn;\n\t\tif (parent[a] > parent[b])\n\t\t\tswap(a, b);\n\t\tsz[a] += sz[b];\n\t\tparent[b] = a;\n\t}\n};\nint main()\n{\n\tint n;\n\tcin >> n;\n\tvector<int> permutation(n);\n\tfor (auto &p : permutation)\n\t{\n\t\tcin >> p;\n\t\t--p;\n\t}\n\tDSU dsu(n);\n\tfor (auto i = 0; i < n; ++i)\n\t{\n\t\tdsu.merge(i, permutation[i]);\n\t}\n\tint count=0;\n\tint even_count=0;\n\tfor (auto i = 0; i < n; ++i)\n\t{\n\t\tif (dsu.find(i) != i)\n\t\t\tcontinue;\n\t\tif (dsu.groupSize(i) % 2 == 0)\n\t\t\teven_count ++;\n\t\tcount += dsu.groupSize(i) >> 1;\n\t}\n\tif (even_count%2 == 0)\n\t\tcout << count << '\\n';\n\telse\n\t\tcout << \"-1\\n\";\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 5464, "score_of_the_acc": -0.461, "final_rank": 12 }, { "submission_id": "aoj_0448_9567777", "code_snippet": "#include <bits/stdc++.h>\n\nint main() {\n int N;\n std::cin >> N;\n std::vector<int> H(N);\n for (auto& h : H) {\n std::cin >> h;\n h--;\n }\n std::vector<int> I(N);\n for (int i{} ; i < N ; i++) I[H[i]] = i;\n std::vector<bool> vis(N);\n int ans{}, even{};\n for (int i{} ; i < N ; i++) if (!vis[i] and i != H[i]) {\n // std::cout << \"hello \" << i << std::endl;\n int num{1};\n vis[i] = true;\n for (int cur{H[i]} ; cur != i ; cur = H[cur]) {\n num++;\n assert(vis[cur] == false);\n vis[cur] = true;\n }\n even += (num % 2 == 0);\n ans += num / 2;\n }\n std::cout << (even % 2 ? -1 : ans) << '\\n';\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 4696, "score_of_the_acc": -0.4328, "final_rank": 10 }, { "submission_id": "aoj_0448_8827003", "code_snippet": "#include <bits/stdc++.h>\n\nint main() {\n int n;\n std::cin >> n;\n std::vector<int> p(n);\n for (int i = 0; i < n; i++) std::cin >> p[i];\n for (int i = 0; i < n; i++) p[i]--;\n int ans = 0;\n std::vector<bool> used(n);\n int even = 0;\n for (int i = 0; i < n; i++) {\n if (used[i]) continue;\n int size = 0;\n int cur = i;\n while (!used[cur]) {\n size++;\n used[cur] = true;\n cur = p[cur];\n }\n if (size == 1) continue;\n if (size % 2 == 0) {\n even++;\n ans += (size - 2) / 2;\n } else {\n ans += (size - 1) / 2;\n }\n }\n if (even % 2 == 0) {\n ans += even;\n } else {\n ans = -1;\n }\n std::cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3872, "score_of_the_acc": -0.4025, "final_rank": 8 }, { "submission_id": "aoj_0448_8074639", "code_snippet": "#include<bits/stdc++.h>\n#define overload(a,b,c,d,...) d\n#define rep1(a) for(ll _=0;_<a;++_)\n#define rep2(i,a) for(ll i=0;i<a;++i)\n#define rep3(i,a,b) for(ll i=a;i<b;++i)\n#define rep(...) overload(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(i,a) for(ll i=(ll)a-1;i>=0;--i)\n#define rrep2(i,a,b) for(ll i=(ll)b-1;i>=(ll)a;--i)\n#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)\n#define all(x) x.begin(),x.end()\n#define rall(x) x.rbegin(),x.rend()\n#define eb emplace_back\n#define pb push_back\nusing namespace std;\nusing ll=long long;\nusing ull=unsigned long long;\nusing ld=long double;\ntemplate<typename T,typename U>inline bool chmin(T&a,const U&b){return (a>b?a=b,true:false);}\ntemplate<typename T,typename U>inline bool chmax(T&a,const U&b){return (a<b?a=b,true:false);}\nstatic constexpr ll inf=numeric_limits<ll>::max()/2;\nint main(){\n ll n;cin>>n;\n vector<ll>h(n);\n for(auto&e:h)cin>>e;\n for(auto&e:h)e--;\n vector<ll>vis(n,0);\n ll cnt=0;\n ll ans=0;\n rep(i,n)if(!vis[i]){\n ll sz=0;\n ll now=i;\n while(!vis[now]){\n vis[now]=1;\n now=h[now];\n sz++;\n }\n if(sz%2)ans+=sz/2;\n else ans+=sz/2-1,cnt++;\n }\n if(cnt%2==0)ans+=cnt;\n else ans=-1;\n cout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 6324, "score_of_the_acc": -0.4926, "final_rank": 13 }, { "submission_id": "aoj_0448_7075968", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<int(n);i++)\n\nconstexpr int inf=1e9+10;\nconstexpr char newl='\\n';\nconstexpr int dx[]={0,1,0,-1};\nconstexpr int dy[]={1,0,-1,0};\nusing ll=long long;\n\nbool valid(int i,int j,int h,int w){\n return 0<=i && i<h && 0<=j && j<w;\n}\n\ntemplate<typename T>\nbool chmin(T &a,T b){\n return b<a ? a=b,true:false;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int n;\n cin >> n;\n vector<int> p(n);\n rep(i,n)cin >> p[i],p[i]--;\n\n vector<bool> al(n,false);\n int ans=0;\n vector<int> ev_sz;\n rep(i,n)if(!al[i]){\n int j=i;\n int sz=1;\n al[j]=true;\n while(!al[p[j]]){\n sz++;\n j=p[j];\n al[j]=true;\n }\n if(sz%2==0)ev_sz.emplace_back(sz);\n ans+=sz/2;\n }\n if(ev_sz.size()%2==1)cout << -1 << endl;\n else cout << ans << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4404, "score_of_the_acc": -0.0221, "final_rank": 2 }, { "submission_id": "aoj_0448_7074766", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define vi vector<int>\n#define pii pair<int,int>\n#define pll pair<ll,ll>\nusing namespace std;\nusing ll = long long;\n\n\nint main(){\n\tint n;\n\tcin >> n;\n\tvi h(n);\n\trep(i, n){\n\t\tcin >> h[i];\n\t\th[i]--;\n\t}\n\tvi used(n);\n\tint ans = 0;\n\tint evens = 0;\n\trep(i, n) if(!used[i]){\n\t\tused[i] = 1;\n\t\tint pos = h[i];\n\t\tint cnt = 1;\n\t\twhile(pos != i){\n\t\t\tused[pos] = 1;\n\t\t\tpos = h[pos];\n\t\t\tcnt++;\n\t\t}\n\t\tif(!(cnt & 1)) evens++;\n\t\tans += cnt / 2;\n\t}\n\tif(evens & 1) cout << \"-1\\n\";\n\telse cout << ans << \"\\n\";\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 4692, "score_of_the_acc": -0.4326, "final_rank": 9 }, { "submission_id": "aoj_0448_6981859", "code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 0448.cc: Robot Arm\n */\n\n#include<cstdio>\n#include<algorithm>\n#include<utility>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 200000;\n\n/* typedef */\n\ntypedef long long ll;\ntypedef pair<int,int> pii;\n\n/* global variables */\n\nint hs[MAX_N], ps[MAX_N];\npii his[MAX_N], tmp[MAX_N];\nbool used[MAX_N];\n\n/* subroutines */\n\ntemplate <typename T>\nll merge_sort(T as[], T tmp[], int l, int r) { // [l, r)\n ll ic = 0;\n\n if (l + 1 < r) {\n int m = (l + r) / 2;\n \n ic = merge_sort(as, tmp, l, m) + merge_sort(as, tmp, m, r);\n\n int i = l, j = m, k = l;\n\n while (i < m && j < r) {\n if (as[i] <= as[j]) tmp[k++] = as[i++];\n else tmp[k++] = as[j++], ic += m - i;\n }\n\n while (i < m) tmp[k++] = as[i++];\n while (j < r) tmp[k++] = as[j++];\n\n for (int i = l; i < r; i++) as[i] = tmp[i];\n } \n\n return ic;\n}\n\n/* main */\n\nint main() {\n int n;\n scanf(\"%d\", &n);\n for (int i = 0; i < n; i++) scanf(\"%d\", hs + i);\n\n for (int i = 0; i < n; i++) his[i] = pii(hs[i], i);\n ll ic = merge_sort(his, tmp, 0, n);\n if (ic & 1) { puts(\"-1\"); return 0; }\n\n for (int i = 0; i < n; i++) ps[his[i].second] = i;\n //for (int i = 0; i < n; i++) printf(\"%d \", ps[i]); putchar('\\n');\n\n int sum = 0;\n for (int st = 0; st < n; st++)\n if (! used[st]) {\n int l = 0;\n for (int u = st; ! used[u]; u = ps[u]) l++, used[u] = true;\n sum += l / 2;\n }\n\n printf(\"%d\\n\", sum);\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 7820, "score_of_the_acc": -0.3476, "final_rank": 5 }, { "submission_id": "aoj_0448_6370374", "code_snippet": "#include <stdio.h>\n#include <math.h>\n#include <iostream>\n#include <iomanip>\n#include <vector>\n#include <numeric>\n#include <algorithm>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define endl '\\n'\n#define print(n) cout << (n) << endl\nint main()\n{\n int n;\n cin >> n;\n vector<int> a(n);\n vector<bool> t(n);\n rep(i, n) cin >> a[i], a[i]--;\n int ans = 0;\n bool s = true;\n rep(i, n)\n {\n if (t[i]) continue;\n int id = i, c = 0;\n do\n {\n t[id] = true;\n id = a[id];\n c++;\n } while (!t[id]);\n ans += c >> 1;\n s ^= !(c & 1);\n }\n print(s ? ans : -1);\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3828, "score_of_the_acc": -0.4009, "final_rank": 6 }, { "submission_id": "aoj_0448_6123535", "code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#include <set>\n#include <deque>\n#include <stack>\n#include <sstream>\n#include <utility>\n#include <cstring>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <array>\n#include <bitset>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n // https://codeforces.com/contest/1591/problem/D\n int q = 1;\n while(q--){\n int n; cin >> n;\n vector<int> a(n);\n for(int i=0;i<n;i++){\n cin >> a[i];\n }\n vector<int> v = a;\n sort(v.begin(), v.end());\n // 本来iにあるべき要素が今どこにあるか\n vector<int> idx(n);\n for(int i=0;i<n;i++){\n idx[lower_bound(v.begin(), v.end(), a[i]) - v.begin()] = i;\n a[i] = lower_bound(v.begin(), v.end(), a[i]) - v.begin();\n }\n int res = 0;\n int rev = 0;\n for(int _i=n-1;_i>=0;_i--){\n if(idx[_i] == _i) continue;\n if(idx[_i] == a[_i]){\n rev++;\n int i = idx[_i];\n int j = a[_i];\n swap(a[i], a[j]);\n idx[i] = i;\n idx[j] = j;\n continue;\n }\n // i→j j→k k→i\n int i = idx[_i];\n int j = _i;\n int k = a[_i];\n swap(a[i], a[j]);\n swap(a[i], a[k]);\n idx[a[i]] = i;\n idx[a[j]] = j;\n idx[a[k]] = k;\n res++;\n }\n if(rev%2 == 0){\n cout << res+rev << \"\\n\";\n }\n else{\n cout << -1 << \"\\n\";\n }\n }\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 5480, "score_of_the_acc": -0.8616, "final_rank": 16 }, { "submission_id": "aoj_0448_6123532", "code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#include <set>\n#include <deque>\n#include <stack>\n#include <sstream>\n#include <utility>\n#include <cstring>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <array>\n#include <bitset>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n // https://codeforces.com/contest/1591/problem/D\n int q = 1;\n while(q--){\n int n; cin >> n;\n vector<int> a(n);\n for(int i=0;i<n;i++){\n cin >> a[i];\n }\n vector<int> v = a;\n sort(v.begin(), v.end());\n // 本来iにあるべき要素が今どこにあるか\n vector<int> idx(n);\n for(int i=0;i<n;i++){\n idx[lower_bound(v.begin(), v.end(), a[i]) - v.begin()] = i;\n a[i] = lower_bound(v.begin(), v.end(), a[i]) - v.begin();\n }\n int res = 0;\n int rev = 0;\n for(int _i=n-1;_i>=0;_i--){\n if(idx[_i] == _i) continue;\n if(idx[_i] == a[_i]){\n rev++;\n int i = idx[_i];\n int j = a[_i];\n swap(a[i], a[j]);\n idx[i] = i;\n idx[j] = j;\n continue;\n }\n // i→j j→k k→i\n int i = idx[_i];\n int j = _i;\n int k = a[_i];\n swap(a[i], a[j]);\n swap(a[i], a[k]);\n // cout << a[0] << \" \" << a[1] << \" \" << a[2] << endl;\n idx[a[i]] = i;\n idx[a[j]] = j;\n idx[a[k]] = k;\n res++;\n }\n if(rev%2 == 0){\n cout << res+rev << \"\\n\";\n }\n else{\n cout << -1 << \"\\n\";\n }\n }\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 5456, "score_of_the_acc": -0.8607, "final_rank": 15 }, { "submission_id": "aoj_0448_6044278", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long mod1 = 1000000007;\nconst long long mod2 = 998244353;\ndouble pi = 3.141592653589;\nusing ll = long long;\nvector<ll> dx = {-1,0,1,0,1,1,-1,-1};\nvector<ll> dy = {0,1,0,-1,1,-1,1,-1};\nvector<char> abc = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};\nvector<char> ABC = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};\n \nstruct UnionFind{\n vector<ll> par, siz;\n \n UnionFind(ll n):par(n,-1),siz(n,1){}\n \n ll root(ll x){//親を返す\n if(par[x] == -1) return x;\n else return par[x] = root(par[x]);\n }\n \n bool issame(ll x,ll y){//同じグループかどうか\n return root(x) == root(y);\n }\n \n bool unite(ll x, ll y){//合体\n x = root(x); y = root(y);\n if(x == y) return false;\n if(siz[x] < siz[y]) swap(x,y);\n par[y] = x;\n siz[x] += siz[y];\n return true;\n }\n \n ll size(ll x){//xがいるグループのサイズ\n return siz[root(x)];\n }\n \n \n \n};\n \nlong long pow2(long long x,long long n){\n long long ans = 1;\n while(n != 0){\n long long a = x;\n long long z = 1;\n while(z*2 <= n){\n a *=a;\n a=a%mod2;\n z*=2;\n }\n ans*=a;\n ans=ans%mod2;\n n-=z;\n }\n return ans; \n}//累乗 x^n\n \ntemplate<typename T>\nvoid input_vec(vector<T> &A){\n ll N = A.size();\n for(int i = 0; i < N; i++){\n cin >> A.at(i);\n }\n return;\n}//入力を配列で受け取る\n \ntemplate<typename T>\nvoid output_vec(vector<T> &A){\n ll N = A.size();\n for(int i = 0; i < N; i++){\n if(i != 0){\n cout << \" \";\n }\n cout << A.at(i);\n }\n cout << endl;\n return;\n}//配列を出力\n \ntemplate<typename T>\nlong long count_x(vector<T> &A,T x){\n long long counter = 0;\n for(int i = 0; i < (int)A.size(); i++){\n if(A.at(i) == x){\n counter++;\n }\n }\n return counter;\n}//配列内のxの個数をreturn\n \ntemplate<typename T>\nlong long duplicate(vector<T> &A){\n ll ans = 0;\n ll N = A.size();\n T a = A.at(0);\n for(int i = 1; i < N; i++){\n if(a == A.at(i)) ans++;\n else a = A.at(i);\n }\n return ans;\n}\n \ntemplate<typename T>\nvoid chmin(T &a,T b){\n if(a>b){\n a = b;\n }\n return;\n}\n \ntemplate<typename T>\nvoid chmax(T&a,T b){\n if(a < b){\n a = b;\n }\n return;\n}\n\n/*\n絶対値 abs()\n配列の要素の追加 push_back() \nchar→intに変換 -'0'\nstring→intに変換 atoi(文字列名.c_str())\n配列の中身をN個の０で初期化 配列名.resize(N)\n配列の中身をN個のaで初期化 配列名.assign(N,a)\n配列の中からK以上の数字の最小値を出力　lower_bound(配列.begin(),配列.end(),K)\n入力scanf(\"%lld %lld\",&a,&b) みたいな感じ &を忘れずに\n小数の桁数設定cout << fixed << setprecision(桁数);\n*/\n\n\nint main(){\n ll N; cin >> N;\n vector<ll> h(N);\n input_vec(h);\n UnionFind uf(N);\n vector<vector<ll>> count(N);\n vector<vector<ll>> li;\n for (int i = 0; i < N; i++) h[i]--;\n for(int i = 0; i < N; i++){\n uf.unite(i,h[i]);\n }\n for(int i = 0; i < N; i++){\n count[uf.root(i)].push_back(i);\n }\n for(int i = 0; i < N; i++){\n if((int)count[i].size() == 0) continue;\n li.push_back(count[i]);\n }\n \n ll ans = 0;\n ll count2 = 0;\n for(auto a: li){\n if((int)a.size()%2 == 0) count2++;\n ans+=((int)a.size()-1)/2;\n } \n if(count2%2 == 0) cout << count2+ans << endl;\n else cout << -1 << endl;\n \n \n}", "accuracy": 1, "time_ms": 50, "memory_kb": 31004, "score_of_the_acc": -1.8, "final_rank": 18 }, { "submission_id": "aoj_0448_6044260", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long mod1 = 1000000007;\nconst long long mod2 = 998244353;\ndouble pi = 3.141592653589;\nusing ll = long long;\nvector<ll> dx = {-1,0,1,0,1,1,-1,-1};\nvector<ll> dy = {0,1,0,-1,1,-1,1,-1};\nvector<char> abc = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};\nvector<char> ABC = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};\n \nstruct UnionFind{\n vector<ll> par, siz;\n \n UnionFind(ll n):par(n,-1),siz(n,1){}\n \n ll root(ll x){//親を返す\n if(par[x] == -1) return x;\n else return par[x] = root(par[x]);\n }\n \n bool issame(ll x,ll y){//同じグループかどうか\n return root(x) == root(y);\n }\n \n bool unite(ll x, ll y){//合体\n x = root(x); y = root(y);\n if(x == y) return false;\n if(siz[x] < siz[y]) swap(x,y);\n par[y] = x;\n siz[x] += siz[y];\n return true;\n }\n \n ll size(ll x){//xがいるグループのサイズ\n return siz[root(x)];\n }\n \n \n \n};\n \nlong long pow2(long long x,long long n){\n long long ans = 1;\n while(n != 0){\n long long a = x;\n long long z = 1;\n while(z*2 <= n){\n a *=a;\n a=a%mod2;\n z*=2;\n }\n ans*=a;\n ans=ans%mod2;\n n-=z;\n }\n return ans; \n}//累乗 x^n\n \ntemplate<typename T>\nvoid input_vec(vector<T> &A){\n ll N = A.size();\n for(int i = 0; i < N; i++){\n cin >> A.at(i);\n }\n return;\n}//入力を配列で受け取る\n \ntemplate<typename T>\nvoid output_vec(vector<T> &A){\n ll N = A.size();\n for(int i = 0; i < N; i++){\n if(i != 0){\n cout << \" \";\n }\n cout << A.at(i);\n }\n cout << endl;\n return;\n}//配列を出力\n \ntemplate<typename T>\nlong long count_x(vector<T> &A,T x){\n long long counter = 0;\n for(int i = 0; i < (int)A.size(); i++){\n if(A.at(i) == x){\n counter++;\n }\n }\n return counter;\n}//配列内のxの個数をreturn\n \ntemplate<typename T>\nlong long duplicate(vector<T> &A){\n ll ans = 0;\n ll N = A.size();\n T a = A.at(0);\n for(int i = 1; i < N; i++){\n if(a == A.at(i)) ans++;\n else a = A.at(i);\n }\n return ans;\n}\n \ntemplate<typename T>\nvoid chmin(T &a,T b){\n if(a>b){\n a = b;\n }\n return;\n}\n \ntemplate<typename T>\nvoid chmax(T&a,T b){\n if(a < b){\n a = b;\n }\n return;\n}\n\n/*\n絶対値 abs()\n配列の要素の追加 push_back() \nchar→intに変換 -'0'\nstring→intに変換 atoi(文字列名.c_str())\n配列の中身をN個の０で初期化 配列名.resize(N)\n配列の中身をN個のaで初期化 配列名.assign(N,a)\n配列の中からK以上の数字の最小値を出力　lower_bound(配列.begin(),配列.end(),K)\n入力scanf(\"%lld %lld\",&a,&b) みたいな感じ &を忘れずに\n小数の桁数設定cout << fixed << setprecision(桁数);\n*/\nvector<ll> h;\nvector<ll> li;\nvoid change(ll a, ll b, ll c){\n swap(h[a],h[b]);\n swap(h[a],h[c]);\n li[h[a]] = a;\n li[h[b]] = b;\n li[h[c]] = c;\n return;\n}\n\nint main(){\n ll N; cin >> N;\n h.resize(N);\n li.resize(N);\n input_vec(h);\n ll count = 0;\n ll point = 0;\n vector<pair<ll,ll>> p;\n for(int i = 0; i < N; i++) {\n h[i]--;\n li[h[i]] = i;\n }\n for(int i = 0; i < N; i++) if(li[i] == i) point++;\n for(int i = 0; i < N; i++) if(li[i] == h[i]&&h[i]>i) p.push_back(make_pair(i,h[i]));\n for(int i = 0; point < N-2; i++){\n //cout << \"point: \" << point << endl;\n ll nh = li[i];\n if(nh == i)continue;\n count++;\n ll a = nh;\n ll b = i;\n ll c = -1;\n if(h[b]!=a){\n //cout << \"x\" << endl;\n c = h[b];\n }\n else if(b!= li[a]&&li[a] != a){\n c = li[a];\n //cout << \"y\" << endl;\n }\n else{\n //cout << \"c: \" << c << endl;\n for(int j = i+1; j < N&&c == -1; j++){\n //cout << \"j: \" << j << endl;\n if(a == j) continue;\n if(b == j) continue;\n if(li[j] == j) continue;\n if(li[j] == h[j])c = j;\n }\n if(c == -1){\n for(int j = N-1; j >= 0; j--){\n if(li[j] == j) continue;\n c = j;\n }\n }\n }\n //printf(\"change %lld %lld %lld\\n\",a,b,c);\n change(a,b,c);\n if(li[i] != i) change(a,b,c);\n //output_vec(h);\n //output_vec(li);\n if(h[a] == a) point++;\n if(h[b] == b) point++;\n if(h[c] == c) point++;\n \n }\n if(point == N) cout << count << endl;\n else cout << -1 << endl;\n \n \n \n \n \n \n \n \n \n \n}", "accuracy": 0.84, "time_ms": 30, "memory_kb": 6196, "score_of_the_acc": -0.4879, "final_rank": 19 }, { "submission_id": "aoj_0448_6044243", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long mod1 = 1000000007;\nconst long long mod2 = 998244353;\ndouble pi = 3.141592653589;\nusing ll = long long;\nvector<ll> dx = {-1,0,1,0,1,1,-1,-1};\nvector<ll> dy = {0,1,0,-1,1,-1,1,-1};\nvector<char> abc = {'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};\nvector<char> ABC = {'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};\n \nstruct UnionFind{\n vector<ll> par, siz;\n \n UnionFind(ll n):par(n,-1),siz(n,1){}\n \n ll root(ll x){//親を返す\n if(par[x] == -1) return x;\n else return par[x] = root(par[x]);\n }\n \n bool issame(ll x,ll y){//同じグループかどうか\n return root(x) == root(y);\n }\n \n bool unite(ll x, ll y){//合体\n x = root(x); y = root(y);\n if(x == y) return false;\n if(siz[x] < siz[y]) swap(x,y);\n par[y] = x;\n siz[x] += siz[y];\n return true;\n }\n \n ll size(ll x){//xがいるグループのサイズ\n return siz[root(x)];\n }\n \n \n \n};\n \nlong long pow2(long long x,long long n){\n long long ans = 1;\n while(n != 0){\n long long a = x;\n long long z = 1;\n while(z*2 <= n){\n a *=a;\n a=a%mod2;\n z*=2;\n }\n ans*=a;\n ans=ans%mod2;\n n-=z;\n }\n return ans; \n}//累乗 x^n\n \ntemplate<typename T>\nvoid input_vec(vector<T> &A){\n ll N = A.size();\n for(int i = 0; i < N; i++){\n cin >> A.at(i);\n }\n return;\n}//入力を配列で受け取る\n \ntemplate<typename T>\nvoid output_vec(vector<T> &A){\n ll N = A.size();\n for(int i = 0; i < N; i++){\n if(i != 0){\n cout << \" \";\n }\n cout << A.at(i);\n }\n cout << endl;\n return;\n}//配列を出力\n \ntemplate<typename T>\nlong long count_x(vector<T> &A,T x){\n long long counter = 0;\n for(int i = 0; i < (int)A.size(); i++){\n if(A.at(i) == x){\n counter++;\n }\n }\n return counter;\n}//配列内のxの個数をreturn\n \ntemplate<typename T>\nlong long duplicate(vector<T> &A){\n ll ans = 0;\n ll N = A.size();\n T a = A.at(0);\n for(int i = 1; i < N; i++){\n if(a == A.at(i)) ans++;\n else a = A.at(i);\n }\n return ans;\n}\n \ntemplate<typename T>\nvoid chmin(T &a,T b){\n if(a>b){\n a = b;\n }\n return;\n}\n \ntemplate<typename T>\nvoid chmax(T&a,T b){\n if(a < b){\n a = b;\n }\n return;\n}\n\n/*\n絶対値 abs()\n配列の要素の追加 push_back() \nchar→intに変換 -'0'\nstring→intに変換 atoi(文字列名.c_str())\n配列の中身をN個の０で初期化 配列名.resize(N)\n配列の中身をN個のaで初期化 配列名.assign(N,a)\n配列の中からK以上の数字の最小値を出力　lower_bound(配列.begin(),配列.end(),K)\n入力scanf(\"%lld %lld\",&a,&b) みたいな感じ &を忘れずに\n小数の桁数設定cout << fixed << setprecision(桁数);\n*/\nvector<ll> h;\nvector<ll> li;\nvoid change(ll a, ll b, ll c){\n swap(h[a],h[b]);\n swap(h[a],h[c]);\n li[h[a]] = a;\n li[h[b]] = b;\n li[h[c]] = c;\n return;\n}\n\nint main(){\n ll N; cin >> N;\n h.resize(N);\n li.resize(N);\n input_vec(h);\n ll count = 0;\n ll point = 0;\n vector<pair<ll,ll>> p;\n for(int i = 0; i < N; i++) {\n h[i]--;\n li[h[i]] = i;\n }\n for(int i = 0; i < N; i++) if(li[i] == i) point++;\n for(int i = 0; i < N; i++) if(li[i] == h[i]&&h[i]>i) p.push_back(make_pair(i,h[i]));\n for(int i = 0; point < N-2; i++){\n //cout << \"point: \" << point << endl;\n ll nh = li[i];\n if(nh == i)continue;\n count++;\n ll a = nh;\n ll b = i;\n ll c = -1;\n if(h[b]!=a){\n //cout << \"x\" << endl;\n c = h[b];\n }\n else if(b!= li[a]&&li[a] != a){\n c = li[a];\n //cout << \"y\" << endl;\n }\n else{\n //cout << \"c: \" << c << endl;\n for(int j = i+1; j < N&&c == -1; j++){\n //cout << \"j: \" << j << endl;\n if(a == j) continue;\n if(b == j) continue;\n if(li[j] == j) continue;\n if(li[j] == h[j])c = j;\n }\n if(c == -1){\n cout << -1 << endl;\n return 0;\n }\n }\n //printf(\"change %lld %lld %lld\\n\",a,b,c);\n change(a,b,c);\n if(li[i] != i) change(a,b,c);\n //output_vec(h);\n //output_vec(li);\n if(h[a] == a) point++;\n if(h[b] == b) point++;\n if(h[c] == c) point++;\n \n }\n if(point == N) cout << count << endl;\n else cout << -1 << endl;\n \n \n \n \n \n \n \n \n \n \n}", "accuracy": 0.84, "time_ms": 30, "memory_kb": 6324, "score_of_the_acc": -0.4926, "final_rank": 20 }, { "submission_id": "aoj_0448_6031854", "code_snippet": "#ifdef LOGX\n#define _GLIBCXX_DEBUG\n#endif\n#include <bits/stdc++.h>\nusing namespace std;\n//#include <atcoder/all>\n//using namespace atcoder;\n\n/*---------macro---------*/\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define rep2(i, s, n) for (int i = s; i < (int)(n); i++)\n#define unless(x) if(!(x))\n#define until(x) while(!(x))\n#define ALL(a) a.begin(),a.end()\n#define RALL(a) a.rbegin(),a.rend()\n#define mybit(i,j) (((i)>>(j))&1)\n\n/*---------type/const---------*/\nconst int big=1000000007;\n//const int big=998244353;\nconst double EPS=1e-8; //適宜変える\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef std::string::const_iterator state; //構文解析\nconst int dx[4]={1,0,-1,0};\nconst int dy[4]={0,1,0,-1};\nconst char newl='\\n';\nstruct{\n constexpr operator int(){return -int(1e9)-10;}\n constexpr operator ll(){return -ll(1e18)-10;}\n}neginf;\nstruct{\n constexpr operator int(){return int(1e9)+10;}\n constexpr operator ll(){return ll(1e18)+10;}\n constexpr auto operator -(){return neginf;}\n}inf;\n\n/*---------debug---------*/\n#ifdef LOGX\n#include <template/debug.hpp>\n#else\n#define dbg(...) ;\n#define dbgnewl ;\n#define prt(x) ;\n#define _prt(x) ;\n#endif\n\n/*---------function---------*/\ntemplate<typename T> T max(const std::vector<T> &a){T ans=a[0];for(T elem:a){ans=max(ans,elem);}return ans;}\ntemplate<typename T> T min(const std::vector<T> &a){T ans=a[0];for(T elem:a){ans=min(ans,elem);}return ans;}\ntemplate<typename T,typename U> bool chmin(T &a,const U b){if(a>b){a=b;return true;}return false;}\ntemplate<typename T,typename U> bool chmax(T &a,const U b){if(a<b){a=b;return true;}return false;}\nbool valid(int i,int j,int h,int w){return (i>=0 && j>=0 && i<h && j<w);}\ntemplate<class T,class U>T expm(T x,U y,const ll mod=big){T res=1;while(y){if(y&1)(res*=x)%=mod;(x*=x)%=mod;y>>=1;}return res;}\ntemplate<class T,class U>T exp(T x,U y){T res=1;while(y){if(y&1)res*=x;x*=x;y>>=1;}return res;}\n\nstruct unionfind{\n int n;\n std::vector<int> par;\n unionfind(const int _):n(_),par(_,-1){}\n int find(const int x){\n if(par[x]<0)return x;\n return par[x]=find(par[x]);\n }\n bool same(const int x,const int y){\n return find(x)==find(y);\n }\n void unite(int x,int y){\n x=find(x);\n y=find(y);\n if(x==y)return;\n if(par[x]<par[y])std::swap(x,y);\n int t=par[y]+par[x];\n par[y]=t;\n par[x]=y;\n n--;\n return;\n }\n int getsize(int i){\n i=find(i);\n return -par[i];\n }\n};\n\nint main(){\n //std::ios::sync_with_stdio(false);\n //std::cin.tie(nullptr);\n std::cout.precision(10);\n/*------------------------------------*/\n \n int n;\n cin >> n;\n unionfind uf(n);\n rep(i,n){\n int h;\n cin >> h;\n h--;\n uf.unite(i,h);\n }\n int ans=0;\n bool is_odd=false;\n rep(i,n)if(uf.find(i)==i){\n int sz=uf.getsize(i);\n if(sz%2==1){\n ans+=sz/2;\n }\n else{\n ans+=(sz-2)/2;\n if(is_odd)ans+=2;\n is_odd=!is_odd;\n }\n }\n cout << (is_odd ? -1:ans) << newl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3836, "score_of_the_acc": -0.4012, "final_rank": 7 }, { "submission_id": "aoj_0448_6022160", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> P;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\ntypedef vector<P> vp;\ntypedef vector<bool> vb;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define REP(i,k,n) for(ll i=(ll)(k);i<(ll)(n);i++)\n#define fi first\n#define se second\n#define pb emplace_back\n#define all(a) a.begin(),a.end()\n#define lb(v,k) (lower_bound(all(v),k)-v.begin())\ntemplate<class T> void out(T a){cout<<a<<'\\n';}\ntemplate<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\\n';}\ntemplate<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}\nconst ll mod=998244353;\nint main(){\n ll n;cin>>n;\n vi v(n);\n rep(i,n){\n cin>>v[i];v[i]--;\n }\n vb seen(n,false);\n ll ans=0,tmp=0;\n rep(i,n)if(!seen[i]){\n ll cnt=0;\n ll x=i;\n while(!seen[x]){\n seen[x]=true;\n x=v[x];cnt++;\n }\n ans+=(cnt-1)/2;\n if(cnt%2==0)tmp++;\n }\n if(tmp%2==0)out(ans+tmp);\n else out(-1);\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 4696, "score_of_the_acc": -0.4328, "final_rank": 10 }, { "submission_id": "aoj_0448_5875165", "code_snippet": "#include <bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\n#define _GLIBCXX_DEBUG\nusing namespace std;\nusing std::cout;\nusing std::cin;\nusing std::endl;\nusing ll=long long;\nusing ld=long double;\nll ILL=1167167167167167167;\nconst int INF=2100000000;\nll mod=1e9+7;\n#define rep(i,a) for (ll i=0;i<a;i++)\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\nvoid yneos(bool a){if(a) cout<<\"Yes\\n\"; else cout<<\"No\\n\";}\n\n\n\n// rainy ~ 雨に打たれて ~\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\t\n\tint n;\n\tcin>>n;\n\tvector<int> p(n);\n\trep(i,n){\n\t\tcin>>p[i];\n\t\tp[i]--;\n\t}\n\tvector<int> seen(n,-1);\n\tint ans=0,x=0;\n\trep(i,n){\n\t\tif(seen[i]==1) continue;\n\t\tint tmp=0;\n\t\tint now=i;\n\t\twhile(seen[now]==-1){\n\t\t\tseen[now]=1;\n\t\t\ttmp++;\n\t\t\tnow=p[now];\n\t\t}\n\t\tif(tmp%2==0) x++;\n\t\tans+=tmp/2;\n\t}\n\tif(x%2==1) cout<<\"-1\\n\";\n\telse cout<<ans<<\"\\n\";\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4520, "score_of_the_acc": -0.0263, "final_rank": 3 }, { "submission_id": "aoj_0448_5874922", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing uint = unsigned;\nusing pcc = pair<char, char>;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing pdd = pair<ld, ld>;\nusing tuplis = array<ll, 3>;\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\nconst ll LINF=0x1fffffffffffffff;\nconst ll MINF=0x7fffffffffff;\nconst int INF=0x3fffffff;\nconst int MOD=1000000007;\nconst int MODD=998244353;\nconst ld DINF=numeric_limits<ld>::infinity();\nconst ld EPS=1e-9;\nconst ld PI=3.1415926535897932;\nconst ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};\nconst ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};\n#define overload5(a,b,c,d,e,name,...) name\n#define overload4(a,b,c,d,name,...) name\n#define overload3(a,b,c,name,...) name\n#define rep1(n) for(ll i=0;i<n;++i)\n#define rep2(i,n) for(ll i=0;i<n;++i)\n#define rep3(i,a,b) for(ll i=a;i<b;++i)\n#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)\n#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(n) for(ll i=n;i--;)\n#define rrep2(i,n) for(ll i=n;i--;)\n#define rrep3(i,a,b) for(ll i=b;i-->(a);)\n#define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c)\n#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)\n#define each1(i,a) for(auto&&i:a)\n#define each2(x,y,a) for(auto&&[x,y]:a)\n#define each3(x,y,z,a) for(auto&&[x,y,z]:a)\n#define each4(w,x,y,z,a) for(auto&&[w,x,y,z]:a)\n#define each(...) overload5(__VA_ARGS__,each4,each3,each2,each1)(__VA_ARGS__)\n#define all1(i) begin(i),end(i)\n#define all2(i,a) begin(i),begin(i)+a\n#define all3(i,a,b) begin(i)+a,begin(i)+b\n#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)\n#define rall1(i) (i).rbegin(),(i).rend()\n#define rall2(i,k) (i).rbegin(),(i).rbegin()+k\n#define rall3(i,a,b) (i).rbegin()+a,(i).rbegin()+b\n#define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__)\n#define sum(...) accumulate(all(__VA_ARGS__),0LL)\n#define dsum(...) accumulate(all(__VA_ARGS__),0.0L)\n#define Msum(...) accumulate(all(__VA_ARGS__),0_M)\n#define elif else if\n#define unless(a) if(!(a))\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\n#define Sort(a) sort(all(a))\n#define Rev(a) reverse(all(a))\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\n#define VEC(type,name,size) vector<type>name(size);in(name)\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\ntemplate<class T> bool chmin(T& a, const T& b){ if(a > b){ a = b; return 1; } return 0; }\ntemplate<class T> bool chmax(T& a, const T& b){ if(a < b){ a = b; return 1; } return 0; }\ntemplate<class T, class U> bool chmin(T& a, const U& b){ if(a > T(b)){ a = b; return 1; } return 0; }\ntemplate<class T, class U> bool chmax(T& a, const U& b){ if(a < T(b)){ a = b; return 1; } return 0; }\nvector<ll> iota(ll n, ll begin = 0){ vector<ll> a(n); iota(a.begin(), a.end(), begin); return a; }\nvector<pll> factor(ull x){ vector<pll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }\nvector<ll> divisor(ull x){ vector<ll> ans; for(ull i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }\ntemplate<class T> unordered_map<T, ll> press(vector<T>& a){ Uniq(a); unordered_map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }\ntemplate<class T> auto run_press(const T& a){ vector<pair<remove_const_t<remove_reference_t<decltype(a[0])>>, ll>> ans; each(x, a){ if(ans.empty() || ans.back().first != x) ans.emplace_back(x, 1); else ans.back().second++; } return ans; }\nint scan(){ return getchar(); }\nvoid scan(int& a){ scanf(\"%d\", &a); }\nvoid scan(unsigned& a){ scanf(\"%u\", &a); }\nvoid scan(long& a){ scanf(\"%ld\", &a); }\nvoid scan(long long& a){ scanf(\"%lld\", &a); }\nvoid scan(unsigned long long& a){ scanf(\"%llu\", &a); }\nvoid scan(char& a){ do a = getchar(); while(a == ' ' || a == '\\n'); }\nvoid scan(float& a){ scanf(\"%f\", &a); }\nvoid scan(double& a){ scanf(\"%lf\", &a); }\nvoid scan(long double& a){ scanf(\"%Lf\", &a); }\nvoid scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++){ int b; scan(b); a[i] = b; } }\nvoid scan(char a[]){ scanf(\"%s\", a); }\nvoid scan(string& a){ cin >> a; }\ntemplate<class T> void scan(vector<T>&);\ntemplate<class T, size_t size> void scan(array<T, size>&);\ntemplate<class T, class L> void scan(pair<T, L>&);\ntemplate<class T, size_t size> void scan(T(&)[size]);\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T> void scan(deque<T>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); }\ntemplate<class T, size_t size> void scan(T (&a)[size]){ for(auto&& i : a) scan(i); }\ntemplate<class T> void scan(T& a){ cin >> a; }\nvoid in(){}\ntemplate <class... T> void in(T&... a){ (void)initializer_list<int>{ (scan(a), 0)... }; }\nvoid print(){ putchar(' '); }\nvoid print(bool a){ printf(\"%d\", a); }\nvoid print(int a){ printf(\"%d\", a); }\nvoid print(unsigned a){ printf(\"%u\", a); }\nvoid print(long a){ printf(\"%ld\", a); }\nvoid print(long long a){ printf(\"%lld\", a); }\nvoid print(unsigned long long a){ printf(\"%llu\", a); }\nvoid print(char a){ printf(\"%c\", a); }\nvoid print(char a[]){ printf(\"%s\", a); }\nvoid print(const char a[]){ printf(\"%s\", a); }\nvoid print(float a){ printf(\"%.15f\", a); }\nvoid print(double a){ printf(\"%.15f\", a); }\nvoid print(long double a){ printf(\"%.15Lf\", a); }\nvoid print(const string& a){ for(auto&& i : a) print(i); }\ntemplate<class T> void print(const complex<T>& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag()); print('i'); }\ntemplate<class T> void print(const vector<T>&);\ntemplate<class T, size_t size> void print(const array<T, size>&);\ntemplate<class T, class L> void print(const pair<T, L>& p);\ntemplate<class T, size_t size> void print(const T (&)[size]);\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }\ntemplate<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }\ntemplate<class T> void print(const T& a){ cout << a; }\nint out(){ putchar('\\n'); return 0; }\ntemplate<class T> int out(const T& t){ print(t); putchar('\\n'); return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\n#ifdef DEBUG\ninline ll __lg(ull x){ return 63 - __builtin_clzll(x); }\n#define debug(...) { print(#__VA_ARGS__); print(\":\"); out(__VA_ARGS__); }\n#else\n#define debug(...) void(0)\n#endif\nint first(bool i = true){ return out(i?\"first\":\"second\"); }\nint First(bool i = true){ return out(i?\"First\":\"Second\"); }\nint yes(bool i = true){ return out(i?\"yes\":\"no\"); }\nint Yes(bool i = true){ return out(i?\"Yes\":\"No\"); }\nint No(){ return out(\"No\"); }\nint YES(bool i = true){ return out(i?\"YES\":\"NO\"); }\nint NO(){ return out(\"NO\"); }\nint Yay(bool i = true){ return out(i?\"Yay!\":\":(\"); }\nint possible(bool i = true){ return out(i?\"possible\":\"impossible\"); }\nint Possible(bool i = true){ return out(i?\"Possible\":\"Impossible\"); }\nint POSSIBLE(bool i = true){ return out(i?\"POSSIBLE\":\"IMPOSSIBLE\"); }\nvoid Case(ll i){ printf(\"Case #%lld: \", i); }\n\n\n\nint main(){\n LL(n);\n VEC(ll,h,n);\n ll ans=0,parity=0;\n vec(bool,used,n);\n each(i,h)i--;\n rep(n)if(!used[i]){\n ll at=i;\n ll l=0;\n do{\n l++;\n used[at]=1;\n }while(!used[at=h[at]]);\n ans+=l/2;\n parity^=l&1^1;\n }\n out(parity?-1:ans);\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4680, "score_of_the_acc": -0.0322, "final_rank": 4 }, { "submission_id": "aoj_0448_5266387", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing LL = long long;\nusing ULL = unsigned long long;\n#define rep(i,n) for(int i=0; i<(n); i++)\n\nint main(){\n int N; cin>>N;\n vector<int> tg;\n {\n vector<int> A(N); rep(i,N) cin>>A[i];\n vector<pair<int,int>> S(N); rep(i,N) S[i]={A[i],i};\n sort(S.begin(),S.end());\n vector<int> sw(N); rep(i,N) sw[i]=S[i].second;\n vector<bool> F(N);\n rep(s,N){\n if(F[s]) continue;\n vector<int> tmp = {s}; F[s]=true;\n int p = sw[s];\n while(p!=s){\n tmp.push_back(p); F[p]=true;\n p = sw[p];\n }\n tg.push_back(tmp.size());\n }\n }\n\n int ans=0, crr=0;\n for(int t : tg){\n ans += (t-1)/2;\n crr += (t-1)%2;\n }\n if(crr%2==1){ cout<<-1<<endl; }\n else cout<<(ans+crr)<<endl;\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 6960, "score_of_the_acc": -1.116, "final_rank": 17 }, { "submission_id": "aoj_0448_5131082", "code_snippet": "#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nint solve(vector<int> &h){\n int con = 0, ans = 0;\n vector<bool> used(h.size());\n \n for(int i = 0; i < h.size(); i++){\n if(used[i]) continue;\n \n int size = 0, cur = i;\n \n for(;!used[cur];size++) used[cur] = true, cur = h[cur];\n \n if(size % 2 == 0) con++;\n \n ans += (size - 1) / 2;\n }\n \n if(con % 2) return -1;\n \n ans += con;\n \n return ans;\n}\n\nsigned main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n \n int N;\n vector<int> h;\n \n cin>>N;\n \n h.resize(N);\n \n for(int i = 0; i < N; i++){\n cin>>h[i];\n h[i]--;\n }\n \n cout<<solve(h)<<endl;\n \n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3804, "score_of_the_acc": 0, "final_rank": 1 }, { "submission_id": "aoj_0448_5044189", "code_snippet": "#include<iostream>\nusing namespace std;\nint N;\nint A[2<<17],inv[2<<17];\nint ans,rev;\nmain()\n{\n\tcin>>N;\n\tfor(int i=0;i<N;i++)\n\t{\n\t\tcin>>A[i];\n\t\tA[i]--;\n\t\tinv[A[i]]=i;\n\t}\n\tfor(int i=0;i<N;i++)if(A[i]!=i)\n\t{\n\t\tif(inv[i]==A[i])\n\t\t{\n\t\t\tA[A[i]]=A[i];\n\t\t\tinv[A[i]]=A[i];\n\t\t\tA[i]=i;\n\t\t\tinv[i]=i;\n\t\t\trev++;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tans++;\n\t\t\tinv[A[A[i]]]=inv[i];\n\t\t\tinv[A[i]]=A[i];\n\t\t\tA[inv[i]]=A[A[i]];\n\t\t\tinv[i]=i;\n\t\t\tA[A[i]]=A[i];\n\t\t\tA[i]=i;\n\t\t}\n\t}\n\tcout<<(rev%2?-1:ans+rev)<<endl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 4664, "score_of_the_acc": -0.6316, "final_rank": 14 } ]
aoj_0450_cpp
Reorganization of Highway Network The highway network in the country of Zuia consists of cities (points) and the roads that connect them. This highway network has been constructed to meet the following conditions: There are $N$ cities (points) assigned the numbers 1 to $N$. The roads are one-way, and there are only two roads at most that directly connect one point to another (and when there are two, they are opposite of each other). From any point, you can always get to all the other points. Maintaining a highway network costs money for each road. To avoid financial difficulties, the country of Zuia has decided to discontinue some roads and has appointed you as the person in charge. You have to reorganize the entire highway network so that the cost of maintaining it is minimized, without changing the conditions above. Write a program which reads the number of points and information about the roads and finds the minimum maintenance cost of the entire highway network after the reorganization. Input The input is given in the following form. $N$ $M$ $u_1$ $v_1$ $c_1$ $u_2$ $v_2$ $c_2$ : $u_M$ $v_M$ $c_M$ In the first line, the number of points $N$ ($2 \leq N \leq 13$) and the number of roads $M$ ($N \leq M \leq N \times (N-1)$) are given. In the following $M$ lines, the starting point $u_i$ and the ending point $v_i$ of the $i$-th road ($1 \leq u_i \ne v_i \leq N$) and the maintenance cost $c_i$ ($1 \leq c_i \leq 10,000$) are given. Output Output the minimum value of the maintenance cost of the entire highway network after the reorganization in a line. Sample Input and Output Sample Input 1 3 4 1 2 2 2 3 3 1 3 1 3 1 1 Sample Output 1 6 Sample Input 2 5 8 1 2 7 1 5 2 2 1 8 2 3 3 3 4 5 4 5 8 5 1 5 5 2 1 Sample Output 2 24
[ { "submission_id": "aoj_0450_11031860", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define rng(i,l,r) for(int i=(l);i<(r);i++)\n#define rrep(i,n) for(int i=(n)-1;i>=0;i--)\n#define rrng(i,l,r) for(int i=(r)-1;i>=(l);i--)\n#define fi first\n#define se second\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n\ntemplate<class T> bool chmin(T &a,T b){return (a>b)?a=b,1:0;}\ntemplate<class T> bool chmax(T &a,T b){return (a<b)?a=b,1:0;}\n\nint dp1[13][13][1<<13];\nint dp2[13][13][1<<13];\nint dp3[1<<13];\n\nsigned main(){\n\tint N,M;cin>>N>>M;\n\t\n\tvector<vector<int>> d(N,vector<int>(N,1e9));\n\trep(i,M){\n\t\tint u,v,w;cin>>u>>v>>w;\n\t\tu--,v--;\n\t\td[u][v]=w;\n\t}\n\t\n\trep(u,N)rep(i,N)rep(s,1<<N)dp1[u][i][s]=1e9;\n\trep(i,N){\n\t\tdp1[i][i][1<<i]=0;\n\t}\n\trep(u,N)rep(s,1<<N)rep(i,N){\n\t\tif(s>>i&1){\n\t\t\trep(j,N){\n\t\t\t\tif(s>>j&1)continue;\n\t\t\t\tchmin(dp1[u][j][s|(1<<j)],dp1[u][i][s]+d[i][j]);\n\t\t\t}\n\t\t}\n\t}\n\t\n\trep(u,N)rep(v,N){\n\t\trep(s,1<<N){\n\t\t\tdp2[u][v][s]=1e9;\n\t\t\t\n\t\t\tif(s>>u&1)continue;\n\t\t\tif(s>>v&1)continue;\n\t\t\t\n\t\t\trep(a,N)rep(b,N){\n\t\t\t\tif((s>>a&1)&&(s>>b&1)){\n\t\t\t\t\tchmin(dp2[u][v][s],d[u][a]+d[b][v]+dp1[a][b][s]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\trep(s,1<<N)dp3[s]=1e9;\n\trep(i,N)dp3[1<<i]=0;\n\trep(s,1<<N){\n\t\tint rs=((1<<N)-1)^s;\n\t\tint cur=rs;\n\t\t\n\t\twhile(cur){\n\t\t\trep(u,N)rep(v,N){\n\t\t\t\tif((s>>u&1)&&(s>>v&1)){\n\t\t\t\t\tchmin(dp3[s|cur],dp3[s]+dp2[u][v][cur]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tcur--;\n\t\t\tcur&=rs;\n\t\t}\n\t}\n\t\n\tcout<<dp3[(1<<N)-1]<<\"\\n\";\n}", "accuracy": 1, "time_ms": 320, "memory_kb": 25048, "score_of_the_acc": -0.7437, "final_rank": 15 }, { "submission_id": "aoj_0450_10435854", "code_snippet": "// AOJ #0450 Reorganization of Highway Network\n// 2025.4.30\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = (ll)1e15;\n\n#define gc() getchar_unlocked()\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nint main(){\n int n = Cin(), m = Cin();\n\n vector<vector<ll>> c(n, vector<ll>(n, INF));\n for(int i = 0; i < m; i++){\n int u = Cin()-1, v = Cin()-1; ll w = Cin();\n c[u][v] = min(c[u][v], w);\n }\n\n int LIM = 1 << n;\n vector<ll> cost_cycle(LIM, INF);\n for(int r = 0; r < n; r++){\n vector<vector<ll>> dp(LIM, vector<ll>(n, INF));\n dp[1<<r][r] = 0;\n for(int mask = 1; mask < LIM; mask++){\n if(!(mask & (1<<r))) continue;\n for(int v = 0; v < n; v++){\n if(v == r || !(mask & (1<<v))) continue;\n int pm = mask ^ (1<<v);\n if(!(pm & (1<<r))) continue;\n ll best = INF;\n for(int u = 0; u < n; u++){\n if(!(pm & (1<<u))) continue;\n if(dp[pm][u] == INF || c[u][v] == INF) continue;\n best = min(best, dp[pm][u] + c[u][v]);\n }\n dp[mask][v] = best;\n }\n for(int v = 0; v < n; v++){\n if(v == r) continue;\n if(dp[mask][v] < INF && c[v][r] < INF)\n cost_cycle[mask] = min(cost_cycle[mask], dp[mask][v] + c[v][r]);\n }\n }\n }\n\n vector<ll> f(LIM, INF);\n f[0] = 0;\n for(int mask = 1; mask < LIM; mask++){\n int bc = __builtin_popcount(mask);\n if(bc == 1){\n f[mask] = 0;\n continue;\n }\n f[mask] = cost_cycle[mask];\n int low = mask & -mask;\n for(int A = (mask-1)&mask; A; A = (A-1)&mask){\n if(!(A & low)) continue;\n int B = mask ^ A;\n if(B == 0) continue;\n ll fa = f[A], fb = f[B];\n if(fa == INF || fb == INF) continue;\n ll e1 = INF, e2 = INF;\n for(int u = 0; u < n; u++) if(A & (1<<u))\n for(int v = 0; v < n; v++) if(B & (1<<v)) e1 = min(e1, c[u][v]);\n if(e1 == INF) continue;\n for(int u = 0; u < n; u++) if(B & (1<<u))\n for(int v = 0; v < n; v++) if(A & (1<<v)) e2 = min(e2, c[u][v]);\n if(e2 == INF) continue;\n f[mask] = min(f[mask], fa + fb + e1 + e2);\n }\n }\n\n ll ans = f[LIM-1];\n for(int m1 = 1; m1 < LIM-1; m1++){\n if(cost_cycle[m1] == INF) continue;\n int cm = (LIM-1) ^ m1;\n for(int s = m1; s; s = (s-1)&m1){\n int m2 = cm | s;\n if(cost_cycle[m2] == INF) continue;\n ans = min(ans, cost_cycle[m1] + cost_cycle[m2]);\n }\n }\n cout << ans << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 210, "memory_kb": 4168, "score_of_the_acc": -0.2914, "final_rank": 8 }, { "submission_id": "aoj_0450_9568233", "code_snippet": "#include <bits/stdc++.h>\n\nint main() {\n int N, M;\n std::cin >> N >> M;\n std::vector<std::vector<std::pair<int, int>>> g(N);\n for (int i{} ; i < M ; i++) {\n int u, v, w;\n std::cin >> u >> v >> w;\n u--; v--;\n g[u].push_back(std::make_pair(v, w));\n }\n const int INF{(int)2e9};\n std::vector dp(N, std::vector(N, std::vector<int>(1 << N, INF)));\n for (int s{} ; s < N ; s++) {\n dp[s][s][1 << s] = 0;\n for (int bit{} ; bit < (1 << N) ; bit++) {\n for (int t{} ; t < N ; t++) if ((bit & (1 << t)) and dp[s][t][bit] != INF) {\n for (auto [v, w] : g[t]) {\n dp[s][v][bit | (1 << v)] = std::min(dp[s][v][bit | (1 << v)], dp[s][t][bit] + w);\n }\n }\n }\n }\n std::vector<int> ep(1 << N, INF);\n ep[1 << 0] = 0;\n const int all{(1 << N) - 1};\n for (int bit{} ; bit < (1 << N) ; bit++) if (ep[bit] != INF) {\n for (int s{} ; s < N ; s++) if (bit & (1 << s)) {\n for (int t{} ; t < N ; t++) if (bit & (1 << t)) {\n for (int mask{all ^ bit} ; mask ; mask = (mask - 1) & (all ^ bit)) {\n ep[bit | mask] = std::min(ep[bit | mask], ep[bit] + dp[s][t][mask | (1 << s) | (1 << t)]);\n }\n }\n }\n }\n std::cout << ep[all] << '\\n';\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 8924, "score_of_the_acc": -0.0916, "final_rank": 1 }, { "submission_id": "aoj_0450_8827308", "code_snippet": "#include <bits/stdc++.h>\n\nint main() {\n const int INF = 1e8;\n int n, m;\n std::cin >> n >> m;\n std::vector graph(n, std::vector<int>(n, INF));\n for (int i = 0; i < m; i++) {\n int u, v, w;\n std::cin >> u >> v >> w;\n u--; v--;\n graph[u][v] = w;\n }\n\n std::vector dp(1 << n, INF);\n for (int i = 0; i < n; i++) {\n dp[1 << i] = 0;\n }\n\n std::vector elem(1 << n, std::vector<int>());\n std::vector no_elem(1 << n, std::vector<int>());\n for (int state = 0; state < (1 << n); state++) {\n for (int i = 0; i < n; i++) {\n if (state & (1 << i)) elem[state].push_back(i);\n else no_elem[state].push_back(i);\n }\n }\n\n std::vector dp2(1 << n, std::vector(n, std::vector<int>(n, INF)));\n for (int i = 0; i < n; i++) {\n dp2[1 << i][i][i] = 0;\n }\n for (int state = 0; state < (1 << n); state++) {\n for (int i: elem[state]) {\n for (int j: elem[state]) {\n if (dp2[state][i][j] == INF) continue;\n for (int k: no_elem[state]) {\n dp2[state | (1 << k)][i][k] = std::min(dp2[state | (1 << k)][i][k], dp2[state][i][j] + graph[j][k]);\n }\n }\n }\n }\n for (int state = 0; state < (1 << n); state++) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n dp[state] = std::min(dp[state], dp2[state][i][j] + graph[j][i]);\n }\n }\n }\n for (int state = 1; state < (1 << n); state++) {\n for (int lhs = (state - 1) & state; lhs > 0; lhs = (lhs - 1) & state) {\n int rhs = state ^ lhs;\n if (dp[lhs] == INF) continue;\n // lhs -> rhs\n int lhs_to_rhs = INF;\n int rhs_to_lhs = INF;\n for (int i: elem[lhs]) {\n for (int j: elem[rhs]) {\n lhs_to_rhs = std::min(lhs_to_rhs, graph[i][j]);\n }\n }\n for (int i: elem[rhs]) {\n for (int j: elem[lhs]) {\n rhs_to_lhs = std::min(rhs_to_lhs, graph[i][j]);\n }\n }\n dp[state] = std::min(dp[state], dp[lhs] + dp[rhs] + lhs_to_rhs + rhs_to_lhs);\n for (int i: elem[lhs]) {\n for (int j: elem[lhs]) {\n dp[state] = std::min(dp[state], dp[lhs] + dp2[rhs | (1 << i) | (1 << j)][i][j]);\n dp[state] = std::min(dp[state], dp[lhs] + dp2[rhs | (1 << i) | (1 << j)][j][i]);\n }\n }\n\n for (int i: elem[lhs]) {\n for (int j: elem[rhs]) {\n dp[state] = std::min(dp[state], dp[lhs] + dp2[rhs | (1 << i)][i][j] + graph[j][i]);\n }\n }\n }\n }\n // for (int i = 0; i < (1 << n); i++) {\n // std::cerr << i << \": \" << dp[i] << '\\n';\n // }\n std::cout << dp.back() << '\\n';\n}", "accuracy": 1, "time_ms": 180, "memory_kb": 13632, "score_of_the_acc": -0.384, "final_rank": 13 }, { "submission_id": "aoj_0450_8073868", "code_snippet": "#include<bits/stdc++.h>\n#define overload(a,b,c,d,...) d\n#define rep1(a) for(ll _=0;_<a;++_)\n#define rep2(i,a) for(ll i=0;i<a;++i)\n#define rep3(i,a,b) for(ll i=a;i<b;++i)\n#define rep(...) overload(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(i,a) for(ll i=(ll)a-1;i>=0;--i)\n#define rrep2(i,a,b) for(ll i=(ll)b-1;i>=(ll)a;--i)\n#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)\n#define all(x) x.begin(),x.end()\n#define rall(x) x.rbegin(),x.rend()\n#define eb emplace_back\n#define pb push_back\nusing namespace std;\nusing ll=long long;\nusing ull=unsigned long long;\nusing ld=long double;\ntemplate<typename T,typename U>inline bool chmin(T&a,const U&b){return (a>b?a=b,true:false);}\ntemplate<typename T,typename U>inline bool chmax(T&a,const U&b){return (a<b?a=b,true:false);}\nstatic constexpr ll inf=numeric_limits<ll>::max()/2;\nint main(){\n ll n,m;\n cin>>n>>m;\n vector<ll>dp(1<<n,inf);\n rep(i,n)dp[1<<i]=0;\n vector<vector<ll>>cost(n,vector<ll>(n,inf));\n rep(i,m){\n ll u,v,c;\n cin>>u>>v>>c;\n u--,v--;\n cost[u][v]=c;\n }\n vector<vector<vector<ll>>>ndp(1<<n,vector<vector<ll>>(n,vector<ll>(n,inf)));\n rep(i,n)rep(j,n)if(cost[i][j]!=inf)ndp[1<<i|1<<j][i][j]=cost[i][j];\n rep(bit,1,1<<n){\n rep(i,n)rep(j,n)if(ndp[bit][i][j]!=inf){\n if(cost[j][i]!=inf)chmin(ndp[bit][i][i],ndp[bit][i][j]+cost[j][i]);\n rep(k,n)if(!((bit>>k)&1))if(cost[j][k]!=inf){\n chmin(ndp[bit|1<<k][i][k],ndp[bit][i][j]+cost[j][k]);\n }\n }\n }\n rep(bit,1<<n){\n rep(i,n)chmin(dp[bit],ndp[bit][i][i]);\n }\n //for(auto&i:dp)cerr<<i<<endl;\n rep(bit,1,1<<n){\n ll nowbit=bit-1;\n while(nowbit){\n //cerr<<nowbit<<endl;\n nowbit&=bit;\n if(nowbit<(bit-nowbit))break;\n ll nxtbit=bit^nowbit;\n if(dp[nowbit]==inf||dp[nxtbit]==inf){\n nowbit--;\n continue;\n }\n ll atob=inf,btoa=inf;\n rep(i,n)if((nowbit>>i)&1){\n rep(j,n)if((nxtbit>>j)&1){\n chmin(atob,cost[i][j]);\n chmin(btoa,cost[j][i]);\n }\n }\n if(atob==inf||btoa==inf){\n nowbit--;\n continue;\n }\n chmin(dp[bit],dp[nowbit]+dp[nxtbit]+atob+btoa);\n nowbit--;\n }\n }\n cout<<dp.back()<<endl;\n}", "accuracy": 1, "time_ms": 140, "memory_kb": 17712, "score_of_the_acc": -0.3857, "final_rank": 14 }, { "submission_id": "aoj_0450_7074994", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<int(n);i++)\n\nconstexpr int inf=1e9+10;\nconstexpr char newl='\\n';\nconstexpr int dx[]={0,1,0,-1};\nconstexpr int dy[]={1,0,-1,0};\nusing ll=long long;\n\nbool valid(int i,int j,int h,int w){\n return 0<=i && i<h && 0<=j && j<w;\n}\n\ntemplate<typename T>\nbool chmin(T &a,T b){\n return b<a ? a=b,true:false;\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int n,m;\n cin >> n >> m;\n vector<vector<pair<int,int>>> g(n);\n rep(i,m){\n int a,b,c;\n cin >> a >> b >> c;\n a--,b--;\n g[a].emplace_back(b,c);\n }\n vector<vector<vector<int>>> dist(1<<n,vector<vector<int>>(n,vector<int>(n,inf)));\n //dp1[i][j][T]->dp[i][k][T+{j}]\n using P=pair<int,pair<pair<int,int>,int>>;\n priority_queue<P,vector<P>,greater<P>> q;\n rep(i,n){\n dist[0][i][i]=0;\n for(auto [j,c]:g[i]){\n dist[0][i][j]=c;\n q.push({c,{{i,j},0}});\n }\n }\n while(!q.empty()){\n auto [d,pp]=q.top();q.pop();\n auto [p,T]=pp;\n auto [i,j]=p;\n if(d!=dist[T][i][j])continue;\n for(auto [k,c]:g[j]){\n if(chmin(dist[T | (1<<j)][i][k],d+c)){\n q.push({d+c,{{i,k},T|(1<<j)}});\n }\n }\n }\n\n const int all_mask=(1<<n)-1;\n vector<int> dp(1<<n,inf);\n rep(i,n)dp[1<<i]=0;\n for(int S=1;S<(1<<n);S++){\n const int nxt_mask=all_mask^S;\n const int now=dp[S];\n rep(i,n)if((S>>i)&1)rep(j,n)if((S>>j)&1){//i->j\n for(int T=nxt_mask;;T=(T-1)&(nxt_mask)){\n chmin(dp[S|T],now+dist[T][i][j]);\n if(T==0)break;\n }\n }\n }\n cout << dp.back() << endl;\n}", "accuracy": 1, "time_ms": 700, "memory_kb": 45268, "score_of_the_acc": -1.5669, "final_rank": 19 }, { "submission_id": "aoj_0450_6022618", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> P;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\ntypedef vector<P> vp;\ntypedef vector<bool> vb;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define REP(i,k,n) for(ll i=(ll)(k);i<(ll)(n);i++)\n#define fi first\n#define se second\n#define pb emplace_back\n#define all(a) a.begin(),a.end()\n#define lb(v,k) (lower_bound(all(v),k)-v.begin())\ntemplate<class T> void out(T a){cout<<a<<'\\n';}\ntemplate<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\\n';}\ntemplate<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}\ntemplate<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}\nconst ll mod=998244353;\nconst ll inf=1001001001001001;\nint main(){\n ll n,m;cin>>n>>m;\n vvi g(n,vi(n,inf));\n rep(i,m){\n ll a,b,c;cin>>a>>b>>c;\n g[a-1][b-1]=c;\n }\n ll t=1;rep(i,n-1)t*=3;\n vvi dp(t,vi(n-1,inf));\n dp[0][0]=0;\n vi fac(n+1);\n fac[0]=1;rep(i,n)fac[i+1]=fac[i]*3;\n auto encode=[&](vi v){\n ll res=0;\n for(ll i=n-2;i>=0;i--){\n res*=3;res+=v[i];\n }\n return res;\n };\n auto decode=[&](ll a){\n vi res(n-1);\n rep(i,n-1){\n res[i]=a%3;a/=3;\n }\n return res;\n };\n rep(bit,t){\n vi v=decode(bit);\n bool tmp=false;\n rep(i,n-1)if(v[i]==1)tmp=true;\n if(tmp){\n rep(i,n-1)if(v[i]==1){\n ll nbit=bit;\n rep(j,n-1)if(v[j]==1)nbit+=fac[j];\n rep(j,n){\n if(j==0||v[j-1]==2)chmin(dp[nbit][0],dp[bit][i]+g[i+1][j]);\n else if(v[j-1]==0)chmin(dp[bit+fac[j-1]][j-1],dp[bit][i]+g[i+1][j]);\n }\n }\n }\n else{\n rep(i,n)if(i==0||v[i-1]==2)REP(j,1,n)if(v[j-1]==0){\n chmin(dp[bit+fac[j-1]][j-1],dp[bit][0]+g[i][j]);\n }\n }\n }\n ll tmp=0;\n rep(i,n-1)tmp+=2*fac[i];\n out(dp[tmp][0]);\n // out(dp[27][0]);\n // out(dp[29][1]);\n}", "accuracy": 1, "time_ms": 190, "memory_kb": 73696, "score_of_the_acc": -1.2535, "final_rank": 18 }, { "submission_id": "aoj_0450_5876951", "code_snippet": "#line 1 \"a.cpp\"\n#include <iostream>\n#include <algorithm>\n#include <utility>\n#include <string>\n#include <vector>\n#include <set>\n#include <stack>\n#include <queue>\n#include <map>\n#include <math.h>\n#include <string.h>\n#include <iomanip>\n#include <numeric>\n#include <cstdlib>\n#include <cstdint>\n#include <cmath>\n#include <functional>\n#include <limits>\n#include <cassert>\n#include <bitset>\n#include <chrono>\n#include <random>\n#include <memory>\n \n/* macro */\n \n#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)\n#define rrep(i, a, n) for (int i = ((int)(n-1)); i >= (int)(a); i--)\n#define Rep(i, a, n) for (i64 i = (i64)(a); i< (i64)(n); i++)\n#define RRep(i, a, n) for (i64 i = ((i64)(n-i64(1))); i>=(i64)(a); i--)\n#define all(v) (v).begin(),(v).end()\n#define rall(v) (v).rbegin(),(v).rend()\n#define Bit(n) (1LL<<(n))\n \n/* macro end */\n \n/* template */\n \nnamespace ebi {\n \n#ifdef LOCAL\n#define debug(...) \\\n std::cerr << \"LINE: \" << __LINE__ << \" [\" << #__VA_ARGS__ << \"]:\", \\\n debug_out(__VA_ARGS__)\n#else\n#define debug(...)\n#endif\n \nvoid debug_out() { std::cerr << std::endl; }\n \ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head h, Tail... t) {\n std::cerr << \" \" << h;\n if (sizeof...(t) > 0) std::cout << \" :\";\n debug_out(t...);\n}\n \ntemplate <typename T1, typename T2>\nstd::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {\n return os << pa.first << \" \" << pa.second;\n}\n \ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& os, std::vector<T> vec) {\n for (std::size_t i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? \"\" : \" \");\n return os;\n}\n \nusing size_t = std::size_t;\nusing i64 = std::int64_t;\nusing u64 = std::uint64_t;\n \ntemplate<class T> void fill(std::vector<T> &v) { for(T &e: v) std::cin >> e; }\n \ntemplate <class T>\ninline bool chmin(T &a, T b) {\n if (a > b){\n a = b;\n return true;\n }\n return false;\n}\n \ntemplate <class T>\ninline bool chmax(T &a, T b) {\n if (a < b){\n a = b;\n return true;\n }\n return false;\n}\n \ntemplate <class T>\nT gcd(T a, T b){\n if( b==0 ) return a;\n else return gcd(b, a%b);\n}\n \ntemplate <class T>\nT lcm(T a, T b) {\n return (a*b)/gcd(a,b);\n}\n \ntemplate<class T>\nT Pow(T x, i64 n) {\n T res = 1;\n while(n>0){\n if(n&1) res = res *x;\n x = x*x;\n n>>=1;\n }\n return res;\n}\n \ntemplate<class T>\nT scan() {\n T val;\n std::cin >> val;\n return val;\n}\n \nconstexpr i64 LNF = std::numeric_limits<i64>::max()/4;\n \nconstexpr int INF = std::numeric_limits<int>::max()/2;\n \nconst long double PI = acos(-1);\n \nconst std::vector<int> dy = {1,0,-1,0,1,1,-1,-1};\nconst std::vector<int> dx = {0,1,0,-1,1,-1,1,-1};\n \n}\n \n/* template end */\n\n#line 2 \"graph/template.hpp\"\n\n#line 4 \"graph/template.hpp\"\n\nnamespace ebi {\n\ntemplate<class T>\nstruct Edge {\n int to;\n T cost;\n Edge(int to, T cost=1) : to(to), cost(cost) { }\n};\n\ntemplate<class T>\nstruct Graph : std::vector<std::vector<Edge<T>>> {\n using std::vector<std::vector<Edge<T>>>::vector;\n void add_edge(int u, int v, T w, bool directed = false) {\n (*this)[u].emplace_back(v, w);\n if(directed) return; \n (*this)[v].emplace_back(u, w);\n }\n};\n\nstruct graph : std::vector<std::vector<int>> {\n using std::vector<std::vector<int>>::vector;\n void add_edge(int u, int v, bool directed = false) {\n (*this)[u].emplace_back(v);\n if(directed) return;\n (*this)[v].emplace_back(u);\n }\n};\n\n} // namespace ebi\n#line 136 \"a.cpp\"\n\nnamespace ebi {\n\nusing ld = long double;\n\nvoid main_() {\n int n,m;\n std::cin >> n >> m;\n std::vector w(n, std::vector<i64>(n, LNF));\n graph g(n);\n rep(i,0,m) {\n int u,v;\n i64 c;\n std::cin >> u >> v >> c;\n u--; v--;\n g.add_edge(u, v);\n w[u][v] = c;\n }\n std::vector dist(n, std::vector(n, std::vector<i64>(1<<n, LNF)));\n rep(i,0,n) {\n for(auto nv: g[i]) {\n dist[i][nv][0] = w[i][nv];\n }\n rep(bit,0,1<<n) {\n rep(v,0,n) {\n if(dist[i][v][bit] == LNF) continue;\n for(auto nv: g[v]) {\n chmin(dist[i][nv][bit ^ (1<<v)], dist[i][v][bit] + w[v][nv]);\n }\n }\n }\n }\n std::vector dp(1<<n, LNF);\n std::vector seen(1<<n, -1);\n auto f = [&](auto &&self, int S) -> i64 {\n if(seen[S] > 0) return dp[S];\n if(S == 1) {\n seen[S] = 1;\n return dp[S] = 0;\n }\n for(int T = (S-1)&S; T > 0; T = (T-1)&S) {\n rep(i,0,n) {\n if(!(S & (1<<i))) continue;\n rep(j,0,n) {\n if(!(S & (1<<j))) continue;\n if((T & (1<<i)) || (T & (1<<j))) continue;\n chmin(dp[S], self(self, S^T) + dist[i][j][T]);\n }\n }\n }\n seen[S] = 1;\n return dp[S];\n };\n std::cout << f(f, Bit(n)-1) << std::endl;\n}\n \n}\n\n \nint main() {\n std::cout << std::fixed << std::setprecision(15);\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n int t = 1;\n // std::cin >> t;\n while(t--) {\n ebi::main_();\n }\n return 0;\n}", "accuracy": 1, "time_ms": 550, "memory_kb": 14960, "score_of_the_acc": -0.924, "final_rank": 16 }, { "submission_id": "aoj_0450_5875183", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing uint = unsigned;\nusing pcc = pair<char, char>;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing pdd = pair<ld, ld>;\nusing tuplis = array<ll, 3>;\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\nconst ll LINF=0x1fffffffffffffff;\nconst ll MINF=0x7fffffffffff;\nconst int INF=0x3fffffff;\nconst int MOD=1000000007;\nconst int MODD=998244353;\nconst ld DINF=numeric_limits<ld>::infinity();\nconst ld EPS=1e-9;\nconst ld PI=3.1415926535897932;\nconst ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};\nconst ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};\n#define overload5(a,b,c,d,e,name,...) name\n#define overload4(a,b,c,d,name,...) name\n#define overload3(a,b,c,name,...) name\n#define rep1(n) for(ll i=0;i<n;++i)\n#define rep2(i,n) for(ll i=0;i<n;++i)\n#define rep3(i,a,b) for(ll i=a;i<b;++i)\n#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)\n#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(n) for(ll i=n;i--;)\n#define rrep2(i,n) for(ll i=n;i--;)\n#define rrep3(i,a,b) for(ll i=b;i-->(a);)\n#define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c)\n#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)\n#define each1(i,a) for(auto&&i:a)\n#define each2(x,y,a) for(auto&&[x,y]:a)\n#define each3(x,y,z,a) for(auto&&[x,y,z]:a)\n#define each4(w,x,y,z,a) for(auto&&[w,x,y,z]:a)\n#define each(...) overload5(__VA_ARGS__,each4,each3,each2,each1)(__VA_ARGS__)\n#define all1(i) begin(i),end(i)\n#define all2(i,a) begin(i),begin(i)+a\n#define all3(i,a,b) begin(i)+a,begin(i)+b\n#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)\n#define rall1(i) (i).rbegin(),(i).rend()\n#define rall2(i,k) (i).rbegin(),(i).rbegin()+k\n#define rall3(i,a,b) (i).rbegin()+a,(i).rbegin()+b\n#define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__)\n#define sum(...) accumulate(all(__VA_ARGS__),0LL)\n#define dsum(...) accumulate(all(__VA_ARGS__),0.0L)\n#define Msum(...) accumulate(all(__VA_ARGS__),0_M)\n#define elif else if\n#define unless(a) if(!(a))\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\n#define Sort(a) sort(all(a))\n#define Rev(a) reverse(all(a))\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\n#define VEC(type,name,size) vector<type>name(size);in(name)\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\ntemplate<class T> bool chmin(T& a, const T& b){ if(a > b){ a = b; return 1; } return 0; }\ntemplate<class T> bool chmax(T& a, const T& b){ if(a < b){ a = b; return 1; } return 0; }\ntemplate<class T, class U> bool chmin(T& a, const U& b){ if(a > T(b)){ a = b; return 1; } return 0; }\ntemplate<class T, class U> bool chmax(T& a, const U& b){ if(a < T(b)){ a = b; return 1; } return 0; }\nvector<ll> iota(ll n, ll begin = 0){ vector<ll> a(n); iota(a.begin(), a.end(), begin); return a; }\nvector<pll> factor(ull x){ vector<pll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }\nvector<ll> divisor(ull x){ vector<ll> ans; for(ull i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }\ntemplate<class T> unordered_map<T, ll> press(vector<T>& a){ Uniq(a); unordered_map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }\ntemplate<class T> auto run_press(const T& a){ vector<pair<remove_const_t<remove_reference_t<decltype(a[0])>>, ll>> ans; each(x, a){ if(ans.empty() || ans.back().first != x) ans.emplace_back(x, 1); else ans.back().second++; } return ans; }\nint scan(){ return getchar(); }\nvoid scan(int& a){ scanf(\"%d\", &a); }\nvoid scan(unsigned& a){ scanf(\"%u\", &a); }\nvoid scan(long& a){ scanf(\"%ld\", &a); }\nvoid scan(long long& a){ scanf(\"%lld\", &a); }\nvoid scan(unsigned long long& a){ scanf(\"%llu\", &a); }\nvoid scan(char& a){ do a = getchar(); while(a == ' ' || a == '\\n'); }\nvoid scan(float& a){ scanf(\"%f\", &a); }\nvoid scan(double& a){ scanf(\"%lf\", &a); }\nvoid scan(long double& a){ scanf(\"%Lf\", &a); }\nvoid scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++){ int b; scan(b); a[i] = b; } }\nvoid scan(char a[]){ scanf(\"%s\", a); }\nvoid scan(string& a){ cin >> a; }\ntemplate<class T> void scan(vector<T>&);\ntemplate<class T, size_t size> void scan(array<T, size>&);\ntemplate<class T, class L> void scan(pair<T, L>&);\ntemplate<class T, size_t size> void scan(T(&)[size]);\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T> void scan(deque<T>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); }\ntemplate<class T, size_t size> void scan(T (&a)[size]){ for(auto&& i : a) scan(i); }\ntemplate<class T> void scan(T& a){ cin >> a; }\nvoid in(){}\ntemplate <class... T> void in(T&... a){ (void)initializer_list<int>{ (scan(a), 0)... }; }\nvoid print(){ putchar(' '); }\nvoid print(bool a){ printf(\"%d\", a); }\nvoid print(int a){ printf(\"%d\", a); }\nvoid print(unsigned a){ printf(\"%u\", a); }\nvoid print(long a){ printf(\"%ld\", a); }\nvoid print(long long a){ printf(\"%lld\", a); }\nvoid print(unsigned long long a){ printf(\"%llu\", a); }\nvoid print(char a){ printf(\"%c\", a); }\nvoid print(char a[]){ printf(\"%s\", a); }\nvoid print(const char a[]){ printf(\"%s\", a); }\nvoid print(float a){ printf(\"%.15f\", a); }\nvoid print(double a){ printf(\"%.15f\", a); }\nvoid print(long double a){ printf(\"%.15Lf\", a); }\nvoid print(const string& a){ for(auto&& i : a) print(i); }\ntemplate<class T> void print(const complex<T>& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag()); print('i'); }\ntemplate<class T> void print(const vector<T>&);\ntemplate<class T, size_t size> void print(const array<T, size>&);\ntemplate<class T, class L> void print(const pair<T, L>& p);\ntemplate<class T, size_t size> void print(const T (&)[size]);\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }\ntemplate<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }\ntemplate<class T> void print(const T& a){ cout << a; }\nint out(){ putchar('\\n'); return 0; }\ntemplate<class T> int out(const T& t){ print(t); putchar('\\n'); return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\n#ifdef DEBUG\ninline ll __lg(ull x){ return 63 - __builtin_clzll(x); }\n#define debug(...) { print(#__VA_ARGS__); print(\":\"); out(__VA_ARGS__); }\n#else\n#define debug(...) void(0)\n#endif\nint first(bool i = true){ return out(i?\"first\":\"second\"); }\nint First(bool i = true){ return out(i?\"First\":\"Second\"); }\nint yes(bool i = true){ return out(i?\"yes\":\"no\"); }\nint Yes(bool i = true){ return out(i?\"Yes\":\"No\"); }\nint No(){ return out(\"No\"); }\nint YES(bool i = true){ return out(i?\"YES\":\"NO\"); }\nint NO(){ return out(\"NO\"); }\nint Yay(bool i = true){ return out(i?\"Yay!\":\":(\"); }\nint possible(bool i = true){ return out(i?\"possible\":\"impossible\"); }\nint Possible(bool i = true){ return out(i?\"Possible\":\"Impossible\"); }\nint POSSIBLE(bool i = true){ return out(i?\"POSSIBLE\":\"IMPOSSIBLE\"); }\nvoid Case(ll i){ printf(\"Case #%lld: \", i); }\n\n\n#define ll int\nstruct WeightedEdge{\n ll to, cost;\n WeightedEdge(){}\n WeightedEdge(ll to, ll cost): to(to), cost(cost){}\n operator ll() const { return to; }\n};\nstruct WeightedGraph{\n using E = WeightedEdge;\n vector<vector<E>> g;\n WeightedGraph(){}\n WeightedGraph(ll n): g(n){}\n vector<E>& operator[](ll at){ return g[at]; }\n operator vector<vector<E>>&(){ return g; }\n auto begin(){ return g.begin(); }\n auto end(){ return g.end(); }\n auto begin() const { return g.cbegin(); }\n auto end() const { return g.cend(); }\n ll size() const { return g.size(); }\n void resize(ll n){ g.resize(n); }\n const vector<E>& operator[](ll at) const { return g[at]; }\n operator const vector<vector<E>>&() const { return g; }\n void add_edge(ll a, ll b, ll cost){\n g[a].emplace_back(b, cost);\n g[b].emplace_back(a, cost);\n }\n void add_directed_edge(ll from, ll to, ll cost){\n g[from].emplace_back(to, cost);\n }\n template<ll start_index = 1> void input_graph(ll m){\n while(m--){\n ll a, b, c;\n scanf(\"%lld%lld%lld\", &a, &b, &c);\n a -= start_index;\n b -= start_index;\n g[a].emplace_back(b, c);\n g[b].emplace_back(a, c);\n }\n }\n template<ll start_index = 1> void input_directed_graph(ll m){\n while(m--){\n ll a, b, c;\n scanf(\"%d%d%d\", &a, &b, &c);\n a -= start_index;\n b -= start_index;\n g[a].emplace_back(b, c);\n }\n }\n template<ll start_index = 1> void input_tree(ll n = -1){ if(n == -1) n = g.size(); input_graph<start_index>(n - 1); }\n};\nint main(){\n LL(n,m);\n WeightedGraph g(n);\n g.input_directed_graph(m);\n vec(ll,cost,1<<n,INF);\n cost[1]=0;\n rep(bit,1,1<<n){\n unordered_map<ll,ll>cost2;\n pq<array<int,3>>q;\n auto update=[&](ll cost,ll bit,ll i){\n const ll key=i<<16|bit;\n if(chmin(cost2.try_emplace(key,INF).first->second,cost))q.push({cost,bit,i});\n };\n rep(n)if(bit&1<<i)update(cost[bit],bit,i);\n while(q.size()){\n auto[c,bit1,at]=q.top();\n q.pop();\n if(cost2[at<<16|bit1]!=c)continue;\n each(i,g[at]){\n if(bit&1<<i)chmin(cost[bit1],c+i.cost);\n else update(c+i.cost,bit1|1<<i,i);\n }\n }\n }\n out(cost.back());\n}", "accuracy": 1, "time_ms": 720, "memory_kb": 4504, "score_of_the_acc": -1.0145, "final_rank": 17 }, { "submission_id": "aoj_0450_5266448", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n#define rep(i,n) for(int i=0; i<(n); i++)\n\ntemplate<class T>\nvoid chmin(T& l,T r){ if(r<l) l=r; }\n\nint N,M;\nll E[13][13];\nll dp[13][13][1<<13];\nll dp2[1<<13];\n\nint main(){\n cin>>N>>M;\n rep(i,N) rep(j,N) E[i][j]=1000000000;\n rep(i,N) E[i][i]=0;\n rep(i,M){ int u,v,c; cin>>u>>v>>c; u--; v--; E[u][v]=c; }\n rep(s,N) rep(t,N) rep(b,1<<N) dp[s][t][b]=1000000000;\n rep(i,N) rep(j,N) rep(k,N) chmin(E[j][k],E[j][i]+E[i][k]);\n \n rep(s,N){\n dp[s][s][1<<s]=0;\n rep(b,1<<N){\n rep(p,N) rep(e,N) chmin(dp[s][e][b],dp[s][p][b]+E[p][e]);\n rep(p,N) rep(e,N){\n if((b&(1<<p))==0) continue;\n if((b&(1<<e))!=0) continue;\n chmin(dp[s][e][b|(1<<e)],dp[s][p][b]+E[p][e]);\n }\n }\n rep(d,N) rep(e,N) rep(b,1<<N) chmin(dp[s][e][b],dp[s][e][b|(1<<d)]);\n }\n\n rep(b,1<<N) dp2[b]=1000000000;\n dp2[1]=0;\n for(int b=1; b<(1<<N); b++){\n rep(u,N) rep(v,N){\n if((b&(1<<u))==0) continue;\n if((b&(1<<v))==0) continue;\n for(int e=((1<<N)-1)&(~b); e!=0; e=(e-1)&(~b)) chmin(dp2[b|e],dp2[b]+dp[u][v][e]);\n }\n }\n\n cout<<dp2[(1<<N)-1]<<endl;\n return 0;\n}", "accuracy": 1, "time_ms": 120, "memory_kb": 13992, "score_of_the_acc": -0.3046, "final_rank": 11 }, { "submission_id": "aoj_0450_5259160", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n//#define MOD 998244353\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 14\n\nstruct Edge{\n\tEdge(int arg_to,int arg_cost){\n\t\tto = arg_to;\n\t\tcost = arg_cost;\n\t}\n\tint to,cost;\n};\n\nint N,E;\nint POW[SIZE];\nint dp[SIZE][SIZE][1024*64],dp2[1024*64];\nvector<Edge> G[SIZE];\n\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i < SIZE; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\tscanf(\"%d %d\",&N,&E);\n\n\tint from,to,cost;\n\n\tfor(int i = 0; i < E; i++){\n\n\t\tscanf(\"%d %d %d\",&from,&to,&cost);\n\t\tfrom--;\n\t\tto--;\n\n\t\tG[from].push_back(Edge(to,cost));\n\t}\n\n\tfor(int s = 0; s < N; s++){\n\t\tfor(int t = 0; t < N; t++){\n\t\t\tfor(int state = 0; state < POW[N]; state++){\n\n\t\t\t\tdp[s][t][state] = BIG_NUM;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int s = 0; s < N; s++){\n\n\t\tdp[s][s][0] = 0;\n\t\tfor(int i = 0; i < G[s].size(); i++){ //sから行けるノード\n\n\t\t\tdp[s][G[s][i].to][0] = G[s][i].cost;\n\t\t}\n\n\t\tfor(int state = 0; state < POW[N]; state++){\n\t\t\tfor(int last = 0; last < N; last++){\n\t\t\t\tif(dp[s][last][state] == BIG_NUM)continue;\n\n\t\t\t\tfor(int i = 0; i < G[last].size(); i++){\n\n\t\t\t\t\tint next_node = G[last][i].to;\n\t\t\t\t\tint next_dist = dp[s][last][state]+G[last][i].cost;\n\t\t\t\t\tint next_state = state|POW[last];\n\n\t\t\t\t\tif(dp[s][next_node][next_state] > next_dist){\n\n\t\t\t\t\t\tdp[s][next_node][next_state] = next_dist;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int state = 0; state < POW[N]; state++){\n\n\t\tdp2[state] = BIG_NUM;\n\t}\n\n\tdp2[0] = 0;\n\tfor(int i = 0; i < N; i++){\n\n\t\tdp2[POW[i]] = 0;\n\t}\n\n\tfor(int state = 0; state < POW[N]-1; state++){\n\t\tif(dp2[state] == BIG_NUM)continue;\n\n\t\tint rest = (POW[N]-1)-state;\n\n\t\tfor(int s = 0; s < N; s++){\n\t\t\tif((state&POW[s]) == 0)continue;\n\n\t\t\tfor(int t = 0; t < N; t++){\n\t\t\t\tif((state&POW[t]) == 0)continue;\n\n\t\t\t\tfor(int add = rest; add > 0; add = (add-1)&rest){\n\t\t\t\t\tif(dp[s][t][add] == BIG_NUM)continue;\n\n\t\t\t\t\tdp2[state|add] = min(dp2[state|add],dp2[state]+dp[s][t][add]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",dp2[POW[N]-1]);\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 9328, "score_of_the_acc": -0.21, "final_rank": 4 }, { "submission_id": "aoj_0450_5256957", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n//#define MOD 998244353\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 15\n\nstruct Edge{\n\tEdge(int arg_to,ll arg_cost){\n\t\tto = arg_to;\n\t\tcost = arg_cost;\n\t}\n\n\tint to;\n\tll cost;\n};\n\nll POW[SIZE];\nll dp[SIZE][SIZE][1024*32],dp2[1024*32];\nvector<Edge> G[SIZE];\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i < SIZE; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\tint N,E;\n\tscanf(\"%d %d\",&N,&E);\n\n\tint from,to;\n\tll cost;\n\n\tfor(int i = 0; i < E; i++){\n\n\t\tscanf(\"%d %d %lld\",&from,&to,&cost);\n\t\tfrom--;\n\t\tto--;\n\n\t\tG[from].push_back(Edge(to,cost));\n\t}\n\n\tfor(int s = 0; s < N; s++){\n\t\tfor(int t = 0; t < N; t++){\n\t\t\tfor(int state = 0; state < POW[N]; state++){\n\n\t\t\t\tdp[s][t][state] = HUGE_NUM;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tdp[i][i][0] = 0; //dp[始点][終点][始点と終点以外の、頂点集合] := 最小訪問コスト\n\t\tfor(int k = 0; k < G[i].size(); k++){\n\n\t\t\tdp[i][G[i][k].to][0] = G[i][k].cost;\n \t\t}\n\t\tfor(int state = 0; state < POW[N]; state++){\n\t\t\tfor(int last = 0; last < N; last++){\n\n\t\t\t\tif(dp[i][last][state] == HUGE_NUM)continue;\n\n\t\t\t\tfor(int k = 0; k < G[last].size(); k++){\n\n\t\t\t\t\tint next = G[last][k].to;\n\t\t\t\t\tll next_cost = dp[i][last][state]+G[last][k].cost;\n\n\t\t\t\t\tint next_state = state|POW[last];\n\n\t\t\t\t\tif(dp[i][next][next_state] > next_cost){\n\n\t\t\t\t\t\tdp[i][next][next_state] = next_cost;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int state = 0; state < POW[N]; state++){\n\n\t\tdp2[state] = HUGE_NUM;\n\t}\n\n\tdp2[0] = 0; //dp2[集合] = 最小コスト\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tdp2[POW[i]] = 0;\n\t}\n\n\tfor(int state = 0; state < POW[N]; state++){\n\t\tif(dp2[state] == HUGE_NUM)continue;\n\n\t\tint rest = (POW[N]-1)-state; //補集合\n\n\t\tfor(int s = 0; s < N; s++){\n\t\t\tif((state&POW[s]) == 0)continue;\n\t\t\tfor(int t = 0; t < N; t++){\n\t\t\t\tif((state&POW[t]) == 0)continue;\n\n\t\t\t\tfor(int add = rest; add != 0; add = (add-1)&rest){\n\n\t\t\t\t\tif(dp[s][t][add] == HUGE_NUM)continue;\n\n\t\t\t\t\tdp2[state+add] = min(dp2[state+add],dp2[state]+dp[s][t][add]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%lld\\n\",dp2[POW[N]-1]);\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 110, "memory_kb": 14768, "score_of_the_acc": -0.3016, "final_rank": 10 }, { "submission_id": "aoj_0450_5171999", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define SIZE 15\n\nstruct Edge{\n\tEdge(int arg_to,int arg_cost){\n\t\tto = arg_to;\n\t\tcost = arg_cost;\n\t}\n\tint to,cost;\n};\n\n\nint POW[SIZE];\nint dp[1024*32][SIZE][SIZE],dp2[1024*32];\nvector<Edge> G[SIZE];\n\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i < SIZE; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\tint N,M;\n\tscanf(\"%d %d\",&N,&M);\n\n\n\tint from,to,cost;\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tscanf(\"%d %d %d\",&from,&to,&cost);\n\t\tfrom--;\n\t\tto--;\n\t\tG[from].push_back(Edge(to,cost));\n\t}\n\n\tfor(int state = 0; state < POW[N]; state++){\n\n\t\tdp2[state] = BIG_NUM;\n\t\tfor(int s = 0; s < N; s++){\n\t\t\tfor(int t = 0; t < N; t++){\n\n\t\t\t\tdp[state][s][t] = BIG_NUM;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int s = 0; s < N; s++){\n\t\tfor(int i = 0; i < G[s].size(); i++){\n\n\t\t\tdp[0][s][G[s][i].to] = G[s][i].cost; //dp[s,t以外の訪問頂点集合][s][t] := 最小コスト\n\t\t}\n\t\tfor(int state = 0; state < POW[N]; state++){\n\t\t\tfor(int node = 0; node < N; node++){\n\t\t\t\tif(dp[state][s][node] == BIG_NUM)continue;\n\n\t\t\t\tfor(int k = 0; k < G[node].size(); k++){\n\n\t\t\t\t\tint next_node = G[node][k].to;\n\t\t\t\t\tint next_cost = dp[state][s][node]+G[node][k].cost;\n\t\t\t\t\tint next_state = state|POW[node];\n\n\n\t\t\t\t\tdp[next_state][s][next_node] = min(dp[next_state][s][next_node],next_cost);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tdp2[0] = 0;\n\n\tfor(int i = 0; i < N; i++){\n\n\t\tdp2[POW[i]] = 0;\n\t}\n\n\tfor(int state = 0; state < POW[N]; state++){\n\t\tif(dp2[state] == BIG_NUM)continue;\n\n\t\tint rest = (POW[N]-1)-state;\n\n\t\t//printf(\"\\nstate:%d dp2[state]:%d\\n\",state,dp2[state]);\n\n\t\tfor(int other = rest; other != 0; other = (other-1) & rest){\n\t\t\t//printf(\"other:%d\\n\",other);\n\t\t\tfor(int s = 0; s < N; s++){\n\t\t\t\tif(!(state & POW[s]))continue;\n\t\t\t\tfor(int t = 0; t < N; t++){\n\t\t\t\t\tif(!(state & POW[t]))continue;\n\t\t\t\t\tif(dp[other][s][t] == BIG_NUM)continue;\n\n\t\t\t\t\t//printf(\"s:%d t:%d dp[other][s][t]:%d\\n\",s,t,dp[other][s][t]);\n\n\t\t\t\t\tint next_state = state+other;\n\t\t\t\t\tdp2[next_state] = min(dp2[next_state],dp2[state]+dp[other][s][t]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",dp2[POW[N]-1]);\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 110, "memory_kb": 10452, "score_of_the_acc": -0.2401, "final_rank": 5 }, { "submission_id": "aoj_0450_5131085", "code_snippet": "#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nconstexpr int inf = 1<<29;\n\nint main(){\n int N, M;\n vector<vector<vector<int>>> dp;\n vector<vector<int>> cost;\n vector<int> dp2;\n \n cin>>N>>M;\n \n dp.resize(N, vector<vector<int>>(N, vector<int>(1<<N, inf)));\n dp2.resize(1<<N, inf);\n cost.resize(N, vector<int>(N, inf));\n \n for(int i = 0; i < M; i++){\n int u, v, c;\n \n cin>>u>>v>>c;\n \n u--, v--;\n \n cost[u][v] = c;\n }\n \n for(int i = 0; i < N; i++){\n cost[i][i] = 0;\n }\n \n for(int l = 0; l < N; l++) { \n dp[l][l][0] = 0;\n \n for(int i = 0; i < 1<<N; i++){\n for(int j = 0; j < N; j++){\n for(int k = 0; k < N; k++){\n if((i>>k)&1) continue;\n dp[l][k][i|(1<<k)] = min(dp[l][k][i|(1<<k)], dp[l][j][i] + cost[j][k]);\n }\n }\n }\n }\n \n for(int i = 0; i < N; i++){\n dp2[1<<i] = 0;\n }\n \n for(int i = 0; i < 1<<N; i++){\n int t = i^((1<<N)-1);\n for(int j = t; j > 0; j = (j - 1) & t){\n for(int k = 0; k < N; k++){\n if(!((i>>k)&1)) continue;\n for(int l = 0; l < N; l++){\n if(!((i>>l)&1)) continue;\n dp2[i|j] = min(dp2[i|j], dp2[i] + dp[k][l][j|(1<<k)|(1<<l)]);\n }\n }\n }\n }\n \n cout<<dp2[(1<<N)-1]<<endl;\n \n return 0;\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 8620, "score_of_the_acc": -0.2422, "final_rank": 6 }, { "submission_id": "aoj_0450_5101707", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define MAX 15\n\nstruct Edge{\n\tEdge(int arg_to,int arg_cost){\n\t\tto = arg_to;\n\t\tcost = arg_cost;\n\t}\n\tint to,cost;\n};\n\nint POW[MAX];\nint dp[MAX][MAX][1024*32],dp2[1024*32];\nvector<Edge> G[MAX];\n\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i < MAX; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\tint N,E;\n\tscanf(\"%d %d\",&N,&E);\n\n\tint from,to,cost;\n\tfor(int loop = 0; loop < E; loop++){\n\n\t\tscanf(\"%d %d %d\",&from,&to,&cost);\n\t\tfrom--;\n\t\tto--;\n\t\tG[from].push_back(Edge(to,cost));\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tfor(int state = 0; state < POW[N]; state++){\n\n\t\t\t\tdp[i][k][state] = BIG_NUM;\n\t\t\t}\n\t\t}\n\t}\n\n\n\tfor(int s = 0; s < N; s++){\n\t\tfor(int a = 0; a < G[s].size(); a++){\n\n\t\t\tdp[s][G[s][a].to][0] = G[s][a].cost;\n\t\t}\n\t\tfor(int state = 0; state < POW[N]; state++){\n\t\t\tfor(int last = 0; last < N; last++){\n\t\t\t\tif(dp[s][last][state] == BIG_NUM)continue;\n\n\t\t\t\tfor(int i = 0; i < G[last].size(); i++){\n\n\t\t\t\t\tint next_node = G[last][i].to;\n\t\t\t\t\tint next_state = state|POW[last];\n\n\t\t\t\t\tdp[s][next_node][next_state] = min(dp[s][next_node][next_state],dp[s][last][state]+G[last][i].cost);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int state = 0; state < POW[N]; state++){\n\n\t\tdp2[state] = BIG_NUM;\n\t}\n\n\tdp2[POW[0]] = 0;\n\tfor(int state = 1; state < POW[N]-1; state++){\n\t\tif(dp2[state] == BIG_NUM)continue;\n\t\tfor(int other = 0; other < POW[N]; other++){\n\t\t\tif((state & other) != 0)continue;\n\n\t\t\tfor(int s = 0; s < N; s++){\n\t\t\t\tif((state & POW[s]) == 0)continue;\n\t\t\t\tfor(int t = 0; t < N; t++){\n\t\t\t\t\tif((state & POW[t]) == 0)continue;\n\n\t\t\t\t\tdp2[state+other] = min(dp2[state+other],dp2[state]+dp[s][t][other]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",dp2[POW[N]-1]);\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 160, "memory_kb": 9344, "score_of_the_acc": -0.2947, "final_rank": 9 }, { "submission_id": "aoj_0450_5101701", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define MAX 15\n\nstruct Edge{\n\tEdge(int arg_to,int arg_cost){\n\t\tto = arg_to;\n\t\tcost = arg_cost;\n\t}\n\tint to,cost;\n};\n\nint POW[MAX];\nint dp[MAX][MAX][1024*32],dp2[1024*32];\nvector<Edge> G[MAX];\n\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i < MAX; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\tint N,E;\n\tscanf(\"%d %d\",&N,&E);\n\n\tint from,to,cost;\n\tfor(int loop = 0; loop < E; loop++){\n\n\t\tscanf(\"%d %d %d\",&from,&to,&cost);\n\t\tfrom--;\n\t\tto--;\n\t\tG[from].push_back(Edge(to,cost));\n\t}\n\n\tfor(int i = 0; i < N; i++){\n\t\tfor(int k = 0; k < N; k++){\n\t\t\tfor(int state = 0; state < POW[N]; state++){\n\n\t\t\t\tdp[i][k][state] = BIG_NUM;\n\t\t\t}\n\t\t}\n\t}\n\n\n\tfor(int s = 0; s < N; s++){\n\t\tfor(int a = 0; a < G[s].size(); a++){\n\n\t\t\tdp[s][G[s][a].to][0] = G[s][a].cost;\n\t\t}\n\t\tfor(int state = 0; state < POW[N]; state++){\n\t\t\tfor(int last = 0; last < N; last++){\n\t\t\t\tif(dp[s][last][state] == BIG_NUM)continue;\n\n\t\t\t\tfor(int i = 0; i < G[last].size(); i++){\n\n\t\t\t\t\tint next_node = G[last][i].to;\n\t\t\t\t\tint next_state = state|POW[last];\n\n\t\t\t\t\tdp[s][next_node][next_state] = min(dp[s][next_node][next_state],dp[s][last][state]+G[last][i].cost);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int state = 0; state < POW[N]; state++){\n\n\t\tdp2[state] = BIG_NUM;\n\t}\n\n\tdp2[POW[0]] = 0;\n\tfor(int state = 1; state < POW[N]-1; state++){\n\t\tif(dp2[state] == BIG_NUM)continue;\n\t\tfor(int other = 0; other < POW[N]; other++){\n\t\t\tif((state & POW[other]) != 0)continue;\n\n\t\t\tfor(int s = 0; s < N; s++){\n\t\t\t\tif((state & POW[s]) == 0)continue;\n\t\t\t\tfor(int t = 0; t < N; t++){\n\t\t\t\t\tif((state & POW[t]) == 0)continue;\n\n\t\t\t\t\tdp2[state+other] = min(dp2[state+other],dp2[state]+dp[s][t][other]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",dp2[POW[N]-1]);\n\n\treturn 0;\n}", "accuracy": 0.3055555555555556, "time_ms": 10, "memory_kb": 3484, "score_of_the_acc": 0, "final_rank": 20 }, { "submission_id": "aoj_0450_5091353", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n\n#define MAX 15\n\nstruct Edge{\n\tEdge(int arg_to,int arg_cost){\n\t\tto = arg_to;\n\t\tcost = arg_cost;\n\t}\n\tint to,cost;\n};\n\nint N,M;\nint POW[MAX];\nint dp[MAX][MAX][1024*16],dp2[1024*16];\nvector<Edge> G[MAX];\n\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i < MAX; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\tscanf(\"%d %d\",&N,&M);\n\n\tint from,to,cost;\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tscanf(\"%d %d %d\",&from,&to,&cost);\n\t\tfrom--;\n\t\tto--;\n\n\t\tG[from].push_back(Edge(to,cost));\n\t}\n\n\tfor(int s = 0; s < MAX; s++){\n\t\tfor(int t = 0; t < MAX; t++){\n\t\t\tfor(int state = 0; state < POW[N]; state++){\n\n\t\t\t\tdp[s][t][state] = BIG_NUM;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int s = 0; s < N; s++){\n\t\tfor(int i = 0; i < G[s].size(); i++){\n\n\t\t\tdp[s][G[s][i].to][0] = G[s][i].cost;\n\t\t}\n\t\tfor(int state = 0; state < POW[N]; state++){\n\t\t\tfor(int last = 0; last < N; last++){\n\t\t\t\tif(dp[s][last][state] == BIG_NUM)continue;\n\n\t\t\t\tfor(int i = 0; i < G[last].size(); i++){\n\n\t\t\t\t\tint next_node = G[last][i].to;\n\t\t\t\t\tint next_cost = G[last][i].cost+dp[s][last][state];\n\t\t\t\t\tint next_state = state|POW[last];\n\n\t\t\t\t\tdp[s][next_node][next_state] = min(dp[s][next_node][next_state],next_cost);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int state = 2; state < POW[N]; state++){\n\n\t\tdp2[state] = BIG_NUM;\n\t}\n\n\tdp2[POW[0]] = 0;\n\n\tfor(int state = 1; state < POW[N]; state++){\n\t\tif(dp2[state] == BIG_NUM)continue;\n\t\tfor(int rest = 1; rest < POW[N]; rest++){\n\t\t\tif((state & rest) > 0)continue;\n\n\t\t\tfor(int a = 0; a < N; a++){\n\t\t\t\tif((state & POW[a]) == 0)continue;\n\t\t\t\tfor(int b = 0; b < N; b++){\n\t\t\t\t\tif((state & POW[b]) == 0)continue;\n\n\n\t\t\t\t\tdp2[state|rest] = min(dp2[state|rest],dp2[state]+dp[a][b][rest]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\",dp2[POW[N]-1]);\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 11376, "score_of_the_acc": -0.2814, "final_rank": 7 }, { "submission_id": "aoj_0450_5044192", "code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nint N,M;\nvector<pair<int,int> >G[13];\nint dist[1<<13][13][13];\nint loop[1<<13];\nmain()\n{\n\tcin>>N>>M;\n\tfor(int i=0;i<M;i++)\n\t{\n\t\tint a,b,c;cin>>a>>b>>c;\n\t\tG[a-1].push_back(make_pair(b-1,c));\n\t}\n\tfor(int i=0;i<1<<N;i++)\n\t{\n\t\tfor(int j=0;j<N;j++)for(int k=0;k<N;k++)dist[i][j][k]=1e9;\n\t\tloop[i]=1e9;\n\t}\n\tfor(int i=0;i<N;i++)dist[1<<i][i][i]=0;\n\tfor(int i=1;i<1<<N;i++)for(int j=0;j<N;j++)for(int k=0;k<N;k++)if(dist[i][j][k]<(int)1e9)\n\t{\n\t\tif(j==k&&i>1<<j)loop[i]=min(loop[i],dist[i][j][k]);\n\t\tfor(pair<int,int>e:G[k])\n\t\t{\n\t\t\tdist[i|1<<e.first][j][e.first]=min(dist[i|1<<e.first][j][e.first],dist[i][j][k]+e.second);\n\t\t}\n\t}\n\tloop[0]=0;\n\tfor(int i=0;i<1<<N;i++)for(int j=0;j<N;j++)for(int k=0;k<N;k++)if(dist[i][j][k]<(int)1e9)\n\t{\n\t\tif(j==k&&i==1<<j)continue;\n\t\tint T=(1<<N)-1&~i;\n\t\tint t=T;\n\t\tdo{\n\t\t\tloop[t|i]=min(loop[t|i],loop[t|1<<j|1<<k]+dist[i][j][k]);\n\t\t\tt=t-1&T;\n\t\t}while(t!=T);\n\t}\n\tcout<<loop[(1<<N)-1]<<endl;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 8564, "score_of_the_acc": -0.1287, "final_rank": 2 }, { "submission_id": "aoj_0450_5010628", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;\n\ntemplate <class T, class U>\nvector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }\n\ntemplate<class... Ts, class U>\nauto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }\n\ntemplate<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }\ntemplate<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector<vector<pair<int, int>>> G(n);\n for (int i = 0; i < m; ++i) {\n int a, b, c;\n scanf(\"%d %d %d\", &a, &b, &c);\n a--; b--;\n G[a].emplace_back(b, c);\n }\n auto dp = make_v(n, n, 1 << n, INF<int>);\n for (int i = 0; i < n; ++i) {\n dp[i][i][1 << i] = 0;\n }\n for (int S = 0; S < (1 << n); ++S) {\n for (int i = 0; i < n; ++i) {\n if(!(S & (1 << i))) continue;\n for (int j = 0; j < n; ++j) {\n if(dp[i][j][S] == INF<int>) continue;\n for (auto [k, c] : G[j]) {\n chmin(dp[i][k][S|(1 << k)], dp[i][j][S]+c);\n }\n }\n }\n }\n vector<int> ans(1 << n, INF<int>);\n for (int i = 0; i < n; ++i) ans[1 << i] = 0;\n for (int S = 0; S < (1 << n); ++S) {\n int k = (1 << n)-1-S;\n for (int T = k; T != 0; T = (T-1)&k) {\n for (int i = 0; i < n; ++i) {\n if(!(S & (1 << i))) continue;\n for (int j = 0; j < n; ++j) {\n if(!(S & (1 << j))) continue;\n chmin(ans[S|T], ans[S]+dp[i][j][T|(1 << i)|(1 << j)]);\n }\n }\n }\n }\n cout << ans.back() << \"\\n\";\n return 0;\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 8944, "score_of_the_acc": -0.1764, "final_rank": 3 }, { "submission_id": "aoj_0450_5001638", "code_snippet": "#include <cmath>\n#include <vector>\n#include <iostream>\n#include <algorithm>\n#include <set>\n#include <iomanip>\n#include <queue>\n#include <string>\n#include <map>\n#include <fstream>\n#include <cassert>\n#include <stack>\n#include <climits>\n#include <array>\n#include <unordered_set>\n#include <unordered_map>\n#include <memory>\n#include <functional>\n#include <cfloat>\n#include <numeric>\n#include <random>\n#include <sstream>\n#include <bitset>\nusing namespace std;\nstatic std::vector<std::vector<std::vector<int>>> path_memo(13, std::vector<std::vector<int>>(13, std::vector<int>(1 << 13, -2)));\nstruct Road {\n\tint dest, cost;\n};\nstatic std::vector<std::vector<Road>> roads;\n\nint min_cost_path(const int from, const int to, const int pattern) {\n\tif (from == to && (pattern & (1<<from)) == 0) return pattern == 0 ? 0 : -1;\n\tif (path_memo[from][to][pattern] >= -1) return path_memo[from][to][pattern];\n\tint result{ INT_MAX };\n\tfor (const auto next : roads[from]) {\n\t\tif (((1 << next.dest) & pattern) != 0) {\n\t\t\tconst auto res = min_cost_path(next.dest, to, pattern ^ (1 << next.dest));\n\t\t\tif (res >= 0) {\n\t\t\t\tresult = std::min(result, res + next.cost);\n\t\t\t}\n\t\t}\n\t}\n\tif (result == INT_MAX) return path_memo[from][to][pattern] = -1;\n\telse return path_memo[from][to][pattern] = result;\n}\nint min_cost_cycle(const int pattern) {\n\tint result{ INT_MAX };\n\tfor (auto i = 0; i < roads.size(); ++i) {\n\t\tif ((pattern >> i) & 1) {\n\t\t\tconst auto res = min_cost_path(i, i, pattern);\n\t\t\tif (res >= 0) result = std::min(result, res);\n\t\t}\n\t}\n\treturn result == INT_MAX ? -1 : result;\n}\nstatic std::vector<int> memo(1 << 13, -2);\nint min_cost_strong_connection(const int pattern) {\n\tif (memo[pattern] >= -1) return memo[pattern];\n\tint result{ INT_MAX };\n\tfor (auto from = 0; from < roads.size(); ++from) {\n\t\tif (((pattern >> from) & 1) == 0) continue;\n\t\tfor (auto to = 0; to < roads.size(); ++to) {\n\t\t\tif (((pattern >> to) & 1) == 0) continue;\n\t\t\tfor (auto add = (pattern + 1) & ~pattern; add < (1 << roads.size()); add = ((add + pattern) + 1) & (~pattern)) {\n\t\t\t\tconst auto path = min_cost_path(from, to, add | (1 << to));\n\t\t\t\tif (path == -1) continue;\n\t\t\t\tconst auto rest = min_cost_strong_connection(pattern + add);\n\t\t\t\tif (rest == -1) continue;\n\t\t\t\tresult = std::min(result, path + rest);\n\t\t\t}\n\t\t}\n\t}\n\treturn result == INT_MAX ? memo[pattern] = -1 : memo[pattern] = result;\n}\nint solve() {\n\tmemo[(1 << roads.size()) - 1] = 0;\n\tint result{ INT_MAX };\n\tfor (auto outer = 0; outer < (1 << roads.size()); ++outer) {\n\t\tconst auto cost = min_cost_cycle(outer);\n\t\tif (cost == -1) continue;\n\t\tconst auto all = min_cost_strong_connection(outer);\n\t\tif (all == -1) continue;\n\t\tresult = std::min(result, all + cost);\n\t}\n\treturn result;\n}\nint main() {\n\tint n, m; std::cin >> n >> m;\n\troads = std::vector<std::vector<Road>>(n);\n\tfor (auto i = 0; i < m; ++i) {\n\t\tint u, v, c; std::cin >> u >> v >> c; --u; --v;\n\t\troads[u].push_back(Road{ v, c });\n\t}\n\tstd::cout << solve() << std::endl;\n}", "accuracy": 1, "time_ms": 200, "memory_kb": 8792, "score_of_the_acc": -0.3432, "final_rank": 12 } ]
aoj_0451_cpp
Swap and Inversion Number The inversion number of a sequence of length $N$ $\{a_1, a_2,.... . a_N\}$ is the total number of pairs ($a_i, a_j$) of elements satisfying $1 \leq i < j \leq N$ and $a_i > a_j$. The inversion number of a sequence is also known as the number of exchanges in the elementary alignment algorithm, bubble sort. In this problem, we perform the operation of exchanging the values of two elements in a number sequence and output the inversion number of the sequence after the exchange. Wreate a program that reads a number sequence and information about multiple operations and outputs the result of each operation. Each operation after the first one shall be performed on the number sequence obtained as a result of the immediately preceding operation. Input The input is given in the following form. $N$ $a_1$ $a_2$ ... $a_N$ $M$ $b_1$ $e_1$ $b_2$ $e_2$ : $b_M$ $e_M$ The first line gives the number of elements of the sequence $N$ ($2 \leq N \leq 500,000$); the second line gives the value of the $i$-th element of the sequence $a_i$ ($0 \leq a_i \leq 1,000,000,000$). The values of all elements are different (if $i \ne j$, then $a_i \ne a_j$). In the subsequent line, the number of operations $M$ ($1 \leq M \leq 30,000$) is given. In the following $M$ lines, the pair of integers $b_i$ and $e_i$ ($1 \leq b_i < e_i \leq N$) representing the information of the $i$-th operation are given. $b_i$ and $e_i$ indicate that it is the values of the $b_i$-th and $e_i$-th elements of the sequence of numbers that are exchanged in the $i$-th operation. Output The output consists of $M$ rows. For each operation, output the result of the operation in a line. Sample Input and Output Sample Input 6 4 6 5 3 1 2 3 2 4 3 6 1 5 Sample Output 9 8 3
[ { "submission_id": "aoj_0451_10205602", "code_snippet": "// AOJ #451\n// Swap and Inversion Number 2025.2.9\n \n#include <bits/stdc++.h>\nusing namespace std;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tif (c == '-') {\tc = gc();\n\t\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\t\treturn -n;\n\t}\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Cout(int n) { // 整数の表示（出力）\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tif (n < 0) pc('-'), n = -n;\n\t\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n\t\twhile (i--) pc(b[i]);\n\t}\n\tpc('\\n');\n}\n\nint main() {\n int N = Cin(); \n vector<int> A(N+1);\n vector<int> tmp(N);\n for (int i = 1; i <= N; i++){\n A[i] = Cin();\n tmp[i-1] = A[i];\n }\n sort(tmp.begin(), tmp.end());\n tmp.erase(unique(tmp.begin(), tmp.end()), tmp.end());\n for (int i = 1; i <= N; i++){\n int rank = int(lower_bound(tmp.begin(), tmp.end(), A[i]) - tmp.begin()) + 1;\n A[i] = rank;\n }\n vector<int> fenw(N+1,0);\n auto fenw_update = [&](int idx, int delta) {\n for(; idx <= N; idx += idx & -idx) fenw[idx] += delta;\n };\n auto fenw_query = [&](int idx) -> int {\n int s = 0;\n for(; idx > 0; idx -= idx & -idx) s += fenw[idx];\n return s;\n };\n long long invCount = 0;\n for (int i = 1; i <= N; i++){\n int cnt = (i - 1) - fenw_query(A[i]);\n invCount += cnt;\n fenw_update(A[i], 1);\n }\n \n const int B = 1000;\n int nblocks = (N + B - 1) / B;\n vector<int> blockL(nblocks), blockR(nblocks), blockId(N+1);\n vector<vector<int>> blocks(nblocks);\n for (int b = 0; b < nblocks; b++){\n blockL[b] = b * B + 1;\n blockR[b] = min(N, (b+1) * B);\n blocks[b].resize(blockR[b] - blockL[b] + 1);\n for (int i = blockL[b]; i <= blockR[b]; i++){\n blockId[i] = b;\n blocks[b][i - blockL[b]] = A[i];\n }\n sort(blocks[b].begin(), blocks[b].end());\n }\n \n auto query_range = [&](int L, int R, int low, int high) -> int {\n if(L > R) return 0;\n int res = 0;\n int bL = blockId[L], bR = blockId[R];\n if(bL == bR){\n for(int i = L; i <= R; i++){\n if(A[i] > low && A[i] < high) res++;\n }\n return res;\n }\n int endFirst = blockR[bL];\n for (int i = L; i <= endFirst; i++){\n if(A[i] > low && A[i] < high) res++;\n }\n for (int b = bL + 1; b < bR; b++){\n int cnt = int(lower_bound(blocks[b].begin(), blocks[b].end(), high) - \n upper_bound(blocks[b].begin(), blocks[b].end(), low));\n res += cnt;\n }\n int startLast = blockL[bR];\n for (int i = startLast; i <= R; i++){\n if(A[i] > low && A[i] < high) res++;\n }\n return res;\n };\n \n auto update_position = [&](int pos, int new_val) {\n int b = blockId[pos];\n int old_val = A[pos];\n auto it = std::lower_bound(blocks[b].begin(), blocks[b].end(), old_val);\n if(it != blocks[b].end() && *it == old_val)\n blocks[b].erase(it);\n auto it2 = std::upper_bound(blocks[b].begin(), blocks[b].end(), new_val);\n blocks[b].insert(it2, new_val);\n A[pos] = new_val;\n };\n \n auto rebuild_block = [&](int b) {\n blocks[b].clear();\n blocks[b].resize(blockR[b] - blockL[b] + 1);\n for (int i = blockL[b]; i <= blockR[b]; i++){\n blocks[b][i - blockL[b]] = A[i];\n }\n sort(blocks[b].begin(), blocks[b].end());\n };\n \n int M = Cin(); \n for (int op = 0; op < M; op++){\n int i = Cin(), j = Cin(); \n \n int x = A[i], y = A[j];\n int low = min(x,y), high = max(x,y);\n \n int countBetween = 0;\n if(j - i > 1)\n countBetween = query_range(i+1, j-1, low, high);\n \n int delta = 0;\n if(x < y) delta = 2 * countBetween + 1;\n else delta = - (2 * countBetween + 1);\n \n invCount += delta;\n cout << invCount << endl;\n \n int b1 = blockId[i], b2 = blockId[j];\n if(b1 == b2){\n swap(A[i], A[j]);\n rebuild_block(b1);\n } else {\n int temp_x = A[i], temp_y = A[j];\n update_position(i, temp_y);\n update_position(j, temp_x);\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 620, "memory_kb": 12796, "score_of_the_acc": -0.2869, "final_rank": 1 }, { "submission_id": "aoj_0451_10157144", "code_snippet": "#include <bits/stdc++.h>\n#include <ext/pb_ds/assoc_container.hpp> \n#include <ext/pb_ds/tree_policy.hpp>\n\n\nusing namespace std;\nusing namespace __gnu_pbds;\n\ntypedef tree<\nint,\nnull_type,\nless<int>,\nrb_tree_tag,\ntree_order_statistics_node_update>\nordered_set;\n\nconst int N = 5e5 + 10;\n\nvector<ordered_set>t(4 * N);\nvector<int>a(N);\n\nvoid build(int v, int tl, int tr){\n if (tl == tr){\n t[v].insert(a[tl]);\n return;\n }\n\n int tm = (tl + tr) / 2;\n build(v * 2, tl, tm);\n build(v * 2 + 1, tm + 1, tr);\n t[v] = t[v * 2];\n for (auto x : t[v * 2 + 1])t[v].insert(x);\n} \n\npair<int, int> qry(int v, int tl, int tr, int l, int r, int x){\n if (tl > r || tr < l)return {0, 0};\n if (l <= tl && tr <= r){\n int cls = t[v].order_of_key(x);\n int cgr = (tr - tl + 1) - cls;\n return {cls, cgr};\n }\n int tm = (tl + tr) / 2;\n pair<int, int>resl= qry(v * 2, tl, tm, l, r, x);\n pair<int, int>resr = qry(v * 2 + 1, tm + 1, tr, l, r, x);\n return {resl.first + resr.first, resl.second + resr.second};\n}\n\nvoid upd(int v, int tl, int tr, int x, int y){\n if (t[v].find(x) == t[v].end())return;\n if (tl == tr){\n t[v].clear();\n t[v].insert(y);\n return;\n }\n\n int tm = (tl + tr) / 2;\n upd(v * 2, tl, tm, x, y);\n upd(v * 2 + 1, tm + 1, tr, x, y);\n t[v].erase(x);\n t[v].insert(y);\n}\n\nvoid print(int v, int tl, int tr){\n if (tl == tr)\n cout << *t[v].begin() << ' ';\n else {\n int tm = (tl + tr) / 2;\n print(v * 2, tl, tm);\n print(v * 2 + 1, tm + 1, tr);\n }\n}\n\n\nint fen[N];\nint sum(int r){\n int res = 0;\n for (; r > 0; r -= r & -r)\n res += fen[r];\n return res;\n}\n\nvoid add (int k, int v){\n for (; k < N; k += k & -k)\n fen[k] += v;\n}\n\nsigned main(){\n int n;\n cin >> n;\n vector<int>b(n);\n for (int i = 0; i < n; i++){\n cin >> a[i];\n b[i] = a[i];\n }\n sort(b.begin(), b.end());\n int cinv = 0;\n for (int i = 0; i < n; i++){\n int id = lower_bound(b.begin(), b.end(), a[i]) - b.begin();\n a[i] = id + 1;\n cinv += i - sum(id + 1);\n add(id + 1, 1);\n }\n build(1, 0, n - 1);\n int q;\n cin >> q;\n while(q--){\n int i, j;\n cin >> i >> j;\n i--;j--;\n pair<int, int> il = qry(1, 0, n - 1, 0, i - 1, a[i]);\n pair<int, int> ir = qry(1, 0, n - 1, i + 1, n - 1, a[i]);\n pair<int, int> jl = qry(1, 0, n - 1, 0, j - 1, a[j]);\n pair<int, int> jr = qry(1, 0, n - 1, j + 1, n - 1, a[j]);\n cinv -= il.second + ir.first;\n cinv -= jl.second + jr.first;\n if (a[i] > a[j])cinv++;\n upd(1, 0, n - 1, a[i], -a[j]);\n upd(1, 0, n - 1, a[j], -a[i]);\n upd(1, 0, n - 1, -a[i], a[i]);\n upd(1, 0, n - 1, -a[j], a[j]);\n //print(1, 0, n - 1);\n //cout << endl;\n swap(a[i], a[j]);\n il = qry(1, 0, n - 1, 0, i - 1, a[i]);\n ir = qry(1, 0, n - 1, i + 1, n - 1, a[i]);\n jl = qry(1, 0, n - 1, 0, j - 1, a[j]);\n jr = qry(1, 0, n - 1, j + 1, n - 1, a[j]);\n cinv += il.second + ir.first;\n cinv += jl.second + jr.first;\n cout << cinv << endl;\n }\n return 0;\n}", "accuracy": 0.05, "time_ms": 70, "memory_kb": 161144, "score_of_the_acc": -0.3424, "final_rank": 20 }, { "submission_id": "aoj_0451_9710592", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n// #include<atcoder/all>\n// using namespace atcoder;\n// using mint=atcoder::modint998244353;\n\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#define int long long\n\nsigned main(){\n\tint n;cin>>n;\n\n\tvector<int> a(n);for(auto&&e:a)cin>>e;\n\n\tauto slv=[&](auto slv,vector<int> v)->int {\n\t\tif(v.size()==1)return 0;\n\t\tvector<int> vl(v.begin(),v.begin()+v.size()/2);\n\t\tvector<int> vr(v.begin()+v.size()/2,v.end());\n\t\tint res=slv(slv,vl)+slv(slv,vr);\n\t\tsort(vr.begin(),vr.end());\n\t\tfor(auto&&e:vl){\n\t\t\tres+=lower_bound(vr.begin(),vr.end(),e)-vr.begin();\n\t\t}\n\t\treturn res;\n\t};\n\n\tint ans=slv(slv,a);\n\n\tconst int B=1000;\n\n\tvector<vector<int>> bs((n-1)/B+1);\n\n\tfor(int i=0;i<n;i++){\n\t\tbs[i/B].push_back(a[i]);\n\t}\n\tfor(auto&&v:bs)sort(v.begin(),v.end());\n\n\tint q;cin>>q;\n\n\twhile(q--){\n\t\tint x,y;cin>>x>>y;x--;y--;\n\n\t\tfor(int i=0;i<bs.size();i++){\n\t\t\tif(x<i*B){\n\t\t\t\tans-=bs[i].end()-lower_bound(bs[i].begin(),bs[i].end(),a[x]);\n\t\t\t}\n\t\t\tif(i*B+B-1<x){\n\t\t\t\tans-=lower_bound(bs[i].begin(),bs[i].end(),a[x])-bs[i].begin();\n\t\t\t}\n\t\t\tif(y<i*B){\n\t\t\t\tans-=bs[i].end()-lower_bound(bs[i].begin(),bs[i].end(),a[y]);\n\t\t\t}\n\t\t\tif(i*B+B-1<y){\n\t\t\t\tans-=lower_bound(bs[i].begin(),bs[i].end(),a[y])-bs[i].begin();\n\t\t\t}\n\t\t}\n\n\t\tfor(int i=x/B*B;i<min(n,x/B*B+B);i++){\n\t\t\tif(i<x){\n\t\t\t\tif(a[i]>a[x])ans--;\n\t\t\t}else{\n\t\t\t\tif(a[i]<a[x])ans--;\n\t\t\t}\n\t\t}\n\n\t\tfor(int i=y/B*B;i<min(n,y/B*B+B-1);i++){\n\t\t\tif(i<y){\n\t\t\t\tif(a[i]>a[y])ans--;\n\t\t\t}else{\n\t\t\t\tif(a[i]<a[y])ans--;\n\t\t\t}\n\t\t}\n\n\t\tans+=(a[x]>a[y]);\n\n\t\tbs[x/B].erase(find(bs[x/B].begin(),bs[x/B].end(),a[x]));\n\t\tbs[x/B].push_back(a[y]);\n\t\tsort(bs[x/B].begin(),bs[x/B].end());\n\t\t\n\t\tbs[y/B].erase(find(bs[y/B].begin(),bs[y/B].end(),a[y]));\n\t\tbs[y/B].push_back(a[x]);\n\t\tsort(bs[y/B].begin(),bs[y/B].end());\n\n\t\tswap(a[x],a[y]);\n\n\t\tans=-ans;\n\n\t\tfor(int i=0;i<bs.size();i++){\n\t\t\tif(x<i*B){\n\t\t\t\tans-=bs[i].end()-lower_bound(bs[i].begin(),bs[i].end(),a[x]);\n\t\t\t}\n\t\t\tif(i*B+B-1<x){\n\t\t\t\tans-=lower_bound(bs[i].begin(),bs[i].end(),a[x])-bs[i].begin();\n\t\t\t}\n\t\t\tif(y<i*B){\n\t\t\t\tans-=bs[i].end()-lower_bound(bs[i].begin(),bs[i].end(),a[y]);\n\t\t\t}\n\t\t\tif(i*B+B-1<y){\n\t\t\t\tans-=lower_bound(bs[i].begin(),bs[i].end(),a[y])-bs[i].begin();\n\t\t\t}\n\t\t}\n\n\t\tfor(int i=x/B*B;i<min(n,x/B*B+B);i++){\n\t\t\tif(i<x){\n\t\t\t\tif(a[i]>a[x])ans--;\n\t\t\t}else{\n\t\t\t\tif(a[i]<a[x])ans--;\n\t\t\t}\n\t\t}\n\n\t\tfor(int i=y/B*B;i<min(n,y/B*B+B-1);i++){\n\t\t\tif(i<y){\n\t\t\t\tif(a[i]>a[y])ans--;\n\t\t\t}else{\n\t\t\t\tif(a[i]<a[y])ans--;\n\t\t\t}\n\t\t}\n\n\t\tans+=(a[x]>a[y]);\n\n\t\tans=-ans;\n\n\t\tcout<<ans<<endl;\n\t}\n}", "accuracy": 0.6, "time_ms": 230, "memory_kb": 3724, "score_of_the_acc": -0.0969, "final_rank": 19 }, { "submission_id": "aoj_0451_9524934", "code_snippet": "#include <bits/stdc++.h>\n\n\nnamespace zawa {\n\ntemplate <class T>\nclass AdditiveGroup {\npublic:\n using Element = T;\n static constexpr T identity() noexcept {\n return T{};\n }\n static constexpr T operation(const T& l, const T& r) noexcept {\n return l + r;\n }\n static constexpr T inverse(const T& v) noexcept {\n return -v;\n }\n};\n\n} // namespace zawa\n\n\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n\n#include <type_traits>\n\nnamespace zawa {\n\ntemplate <class Group>\nclass FenwickTree {\nprivate:\n using Value = typename Group::Element;\n\n usize n_;\n u32 bitWidth_;\n std::vector<Value> a_, dat_;\n\n constexpr i32 lsb(i32 x) const noexcept {\n return x & -x;\n }\n \n // a[i] <- a[i] + v\n void addDat(i32 i, const Value& v) {\n assert(0 <= i and i < static_cast<i32>(n_));\n for ( i++ ; i < static_cast<i32>(dat_.size()) ; i += lsb(i)) {\n dat_[i] = Group::operation(dat_[i], v);\n }\n }\n\n // return a[0] + a[1] + .. + a[i - 1]\n Value product(i32 i) const {\n assert(0 <= i and i <= static_cast<i32>(n_));\n Value res{ Group::identity() };\n for ( ; i > 0 ; i -= lsb(i)) {\n res = Group::operation(res, dat_[i]);\n }\n return res;\n }\n\npublic:\n FenwickTree() : n_{}, bitWidth_{}, a_{}, dat_{} {}\n\n FenwickTree(usize n) : n_{ n }, bitWidth_{ std::__lg(static_cast<u32>(n)) + 1 }, a_(n), dat_(n + 1, Group::identity()) {\n dat_.shrink_to_fit();\n }\n\n FenwickTree(const std::vector<Value>& a) : n_{ a.size() }, bitWidth_{ std::__lg(static_cast<u32>(a.size())) + 1 }, a_(a), dat_(a.size() + 1, Group::identity()) {\n dat_.shrink_to_fit(); \n for (i32 i{} ; i < static_cast<i32>(n_) ; i++) {\n addDat(i, a[i]);\n }\n }\n\n // return a[i]\n const Value& get(usize i) const noexcept {\n assert(i < n_);\n return a_[i];\n }\n\n // return a[i]\n const Value& operator[](usize i) const noexcept {\n assert(i < n_);\n return a_[i];\n }\n\n usize size() const noexcept {\n return n_;\n }\n\n // a[i] <- a[i] + v\n void operation(usize i, const Value& v) {\n assert(i < n_);\n addDat(i, v);\n a_[i] = Group::operation(a_[i], v);\n }\n\n // a[i] <- v\n void set(usize i, const Value& v) {\n assert(i < n_);\n addDat(i, Group::operation(Group::inverse(a_[i]), v));\n a_[i] = v;\n }\n\n // return a[0] + a[1] + ... + a[r - 1]\n Value prefixProduct(usize r) const {\n assert(r <= n_);\n return product(r);\n }\n\n // return a[l] + a[l + 1] ... + a[r - 1]\n Value product(usize l, usize r) const {\n assert(l <= r and r <= n_);\n return Group::operation(Group::inverse(product(l)), product(r));\n }\n\n template <class Function>\n u32 maxRight(usize l, const Function& f) const {\n static_assert(std::is_convertible_v<decltype(f), std::function<bool(Value)>>, \"maxRight's argument f must be function bool(T)\");\n assert(l < n_);\n Value sum{ Group::inverse(product(l)) }; \n u32 r{};\n for (u32 bit{ bitWidth_ } ; bit ; ) {\n bit--;\n u32 nxt{ r | (1u << bit) };\n if (nxt < dat_.size() and f(Group::operation(sum, dat_[nxt]))) {\n sum = Group::operation(sum, dat_[nxt]);\n r = std::move(nxt);\n }\n }\n assert(l <= r);\n return r;\n }\n\n template <class Function>\n u32 minLeft(usize r, const Function& f) const {\n static_assert(std::is_convertible_v<decltype(f), std::function<bool(Value)>>, \"minLeft's argument f must be function bool(T)\");\n assert(r <= n_);\n Value sum{ product(r) };\n u32 l{};\n for (u32 bit{ bitWidth_ } ; bit ; ) {\n bit--;\n u32 nxt{ l | (1u << bit) };\n if (nxt <= r and not f(Group::operation(Group::inverse(dat_[nxt]), sum))) {\n sum = Group::operation(Group::inverse(dat_[nxt]), sum);\n l = std::move(nxt);\n }\n }\n assert(l <= r);\n return l;\n }\n\n // debug print\n friend std::ostream& operator<<(std::ostream& os, const FenwickTree& ft) {\n for (u32 i{} ; i <= ft.size() ; i++) {\n os << ft.prefixProduct(i) << (i == ft.size() ? \"\" : \" \");\n }\n return os;\n }\n\n};\n\n\n} // namespace zawa\n\n\n\nnamespace zawa {\n\ntemplate <class InputIterator>\nu64 InversionNumber(InputIterator first, InputIterator last) {\n assert((usize)std::distance(first, last) >= usize{0});\n std::vector<std::remove_reference_t<decltype(*first)>> A(first, last);\n auto rec{[&](auto rec, usize L, usize R) -> u64 {\n if (R - L <= usize{1}) return 0; \n usize M{(L + R) >> 1};\n u64 res{rec(rec, L, M) + rec(rec, M, R)};\n std::vector<u64> tmp(R - L);\n usize i{L}, j{M}, k{};\n while (i < M and j < R) {\n if (A[i] <= A[j]) {\n tmp[k++] = A[i++];\n }\n else {\n res += M - i;\n tmp[k++] = A[j++];\n }\n }\n while (i < M) tmp[k++] = A[i++];\n while (j < R) tmp[k++] = A[j++];\n for (usize l{L} ; l < R ; l++) {\n A[l] = tmp[l - L];\n }\n return res;\n }};\n return rec(rec, usize{0}, usize{A.size()});\n}\n\ntemplate <class InputIterator>\nbool InversionParity(InputIterator first, InputIterator last) {\n assert((usize)std::distance(first, last) >= usize{0});\n std::vector<std::remove_reference_t<decltype(*first)>> A(first, last);\n auto rec{[&](auto rec, usize L, usize R) -> bool {\n if (R - L <= usize{1}) return 0; \n usize M{(L + R) >> 1};\n bool res{rec(rec, L, M) != rec(rec, M, R)};\n std::vector<u64> tmp(R - L);\n usize i{L}, j{M}, k{};\n while (i < M and j < R) {\n if (A[i] <= A[j]) {\n tmp[k++] = A[i++];\n }\n else {\n res ^= (M - i) & 1;\n tmp[k++] = A[j++];\n }\n }\n while (i < M) tmp[k++] = A[i++];\n while (j < R) tmp[k++] = A[j++];\n for (usize l{L} ; l < R ; l++) {\n A[l] = tmp[l - L];\n }\n return res;\n }};\n return rec(rec, usize{0}, usize{A.size()});\n}\n\n} // namespace zawa\nusing namespace zawa;\n\nconst int sq{3000};\n\nint main() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n\n int N;\n std::cin >> N;\n std::vector<int> A(N);\n for (auto& a : A) std::cin >> a;\n int M;\n std::cin >> M;\n std::vector<int> B(M), E(M);\n for (int i{} ; i < M ; i++) {\n std::cin >> B[i] >> E[i];\n B[i]--; E[i]--;\n }\n const int sz{(N + sq - 1) / sq};\n std::vector<std::vector<int>> app(sz);\n for (int i{} ; i < N ; i++) {\n app[i / sq].push_back(A[i]);\n }\n {\n std::vector<int> tmp(A);\n for (int i{} ; i < M ; i++) {\n std::swap(tmp[B[i]], tmp[E[i]]);\n app[B[i] / sq].push_back(tmp[B[i]]);\n app[E[i] / sq].push_back(tmp[E[i]]);\n }\n }\n for (int i{} ; i < sz ; i++) {\n std::sort(app[i].begin(), app[i].end());\n app[i].erase(std::unique(app[i].begin(), app[i].end()), app[i].end());\n }\n std::vector<FenwickTree<AdditiveGroup<int>>> fen(sz);\n auto comp{[&](int i, int x) -> int {\n return (int)std::distance(app[i].begin(), std::lower_bound(app[i].begin(), app[i].end(), x));\n }};\n for (int i{} ; i < sz ; i++) {\n fen[i] = FenwickTree<AdditiveGroup<int>>(app[i].size());\n for (int j{i * sq} ; j < std::min(N, (i + 1) * sq) ; j++) {\n fen[i].operation(comp(i, A[j]), 1);\n }\n }\n // j = 0, 1, ..., i - 1について、x以上の値の数\n auto pref{[&](int i, int x) -> int {\n int pos{i / sq}, res{};\n for (int j{} ; j < pos ; j++) {\n res += fen[j].product(comp(j, x), app[j].size());\n }\n for (int j{pos * sq} ; j < i ; j++) {\n if (A[j] >= x) res++;\n }\n return res;\n }};\n // j = i + 1, i + 2, ..., N - 1について、x以上の値の数\n auto suf{[&](int i, int x) -> int {\n int pos{i / sq}, res{};\n for (int j{i + 1} ; j < std::min(N, (pos + 1) * sq) ; j++) {\n if (A[j] >= x) res++;\n }\n for (int j{pos + 1} ; j < sz ; j++) {\n res += fen[j].product(comp(j, x), app[j].size());\n }\n return res;\n }};\n long long inv{(long long)InversionNumber(A.begin(), A.end())};\n for (int i{} ; i < M ; i++) {\n int u{A[B[i]]}, v{A[E[i]]};\n // A[B[i]] <- v\n inv -= pref(B[i], A[B[i]] + 1);\n inv -= (N - B[i] - 1) - suf(B[i], A[B[i]]);\n fen[B[i] / sq].operation(comp(B[i] / sq, A[B[i]]), -1);\n fen[B[i] / sq].operation(comp(B[i] / sq, v), 1);\n A[B[i]] = v;\n inv += pref(B[i], A[B[i]] + 1);\n inv += (N - B[i] - 1) - suf(B[i], A[B[i]]);\n // A[E[i]] <- u\n inv -= pref(E[i], A[E[i]] + 1);\n inv -= (N - E[i] - 1) - suf(E[i], A[E[i]]);\n fen[E[i] / sq].operation(comp(E[i] / sq, A[E[i]]), -1);\n fen[E[i] / sq].operation(comp(E[i] / sq, u), 1);\n A[E[i]] = u;\n inv += pref(E[i], A[E[i]] + 1);\n inv += (N - E[i] - 1) - suf(E[i], A[E[i]]);\n std::cout << inv << '\\n';\n }\n}", "accuracy": 1, "time_ms": 1910, "memory_kb": 20216, "score_of_the_acc": -0.8701, "final_rank": 5 }, { "submission_id": "aoj_0451_9524931", "code_snippet": "#include <bits/stdc++.h>\n\n\nnamespace zawa {\n\ntemplate <class T>\nclass AdditiveGroup {\npublic:\n using Element = T;\n static constexpr T identity() noexcept {\n return T{};\n }\n static constexpr T operation(const T& l, const T& r) noexcept {\n return l + r;\n }\n static constexpr T inverse(const T& v) noexcept {\n return -v;\n }\n};\n\n} // namespace zawa\n\n\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n\n#include <type_traits>\n\nnamespace zawa {\n\ntemplate <class Group>\nclass FenwickTree {\nprivate:\n using Value = typename Group::Element;\n\n usize n_;\n u32 bitWidth_;\n std::vector<Value> a_, dat_;\n\n constexpr i32 lsb(i32 x) const noexcept {\n return x & -x;\n }\n \n // a[i] <- a[i] + v\n void addDat(i32 i, const Value& v) {\n assert(0 <= i and i < static_cast<i32>(n_));\n for ( i++ ; i < static_cast<i32>(dat_.size()) ; i += lsb(i)) {\n dat_[i] = Group::operation(dat_[i], v);\n }\n }\n\n // return a[0] + a[1] + .. + a[i - 1]\n Value product(i32 i) const {\n assert(0 <= i and i <= static_cast<i32>(n_));\n Value res{ Group::identity() };\n for ( ; i > 0 ; i -= lsb(i)) {\n res = Group::operation(res, dat_[i]);\n }\n return res;\n }\n\npublic:\n FenwickTree() : n_{}, bitWidth_{}, a_{}, dat_{} {}\n\n FenwickTree(usize n) : n_{ n }, bitWidth_{ std::__lg(static_cast<u32>(n)) + 1 }, a_(n), dat_(n + 1, Group::identity()) {\n dat_.shrink_to_fit();\n }\n\n FenwickTree(const std::vector<Value>& a) : n_{ a.size() }, bitWidth_{ std::__lg(static_cast<u32>(a.size())) + 1 }, a_(a), dat_(a.size() + 1, Group::identity()) {\n dat_.shrink_to_fit(); \n for (i32 i{} ; i < static_cast<i32>(n_) ; i++) {\n addDat(i, a[i]);\n }\n }\n\n // return a[i]\n const Value& get(usize i) const noexcept {\n assert(i < n_);\n return a_[i];\n }\n\n // return a[i]\n const Value& operator[](usize i) const noexcept {\n assert(i < n_);\n return a_[i];\n }\n\n usize size() const noexcept {\n return n_;\n }\n\n // a[i] <- a[i] + v\n void operation(usize i, const Value& v) {\n assert(i < n_);\n addDat(i, v);\n a_[i] = Group::operation(a_[i], v);\n }\n\n // a[i] <- v\n void set(usize i, const Value& v) {\n assert(i < n_);\n addDat(i, Group::operation(Group::inverse(a_[i]), v));\n a_[i] = v;\n }\n\n // return a[0] + a[1] + ... + a[r - 1]\n Value prefixProduct(usize r) const {\n assert(r <= n_);\n return product(r);\n }\n\n // return a[l] + a[l + 1] ... + a[r - 1]\n Value product(usize l, usize r) const {\n assert(l <= r and r <= n_);\n return Group::operation(Group::inverse(product(l)), product(r));\n }\n\n template <class Function>\n u32 maxRight(usize l, const Function& f) const {\n static_assert(std::is_convertible_v<decltype(f), std::function<bool(Value)>>, \"maxRight's argument f must be function bool(T)\");\n assert(l < n_);\n Value sum{ Group::inverse(product(l)) }; \n u32 r{};\n for (u32 bit{ bitWidth_ } ; bit ; ) {\n bit--;\n u32 nxt{ r | (1u << bit) };\n if (nxt < dat_.size() and f(Group::operation(sum, dat_[nxt]))) {\n sum = Group::operation(sum, dat_[nxt]);\n r = std::move(nxt);\n }\n }\n assert(l <= r);\n return r;\n }\n\n template <class Function>\n u32 minLeft(usize r, const Function& f) const {\n static_assert(std::is_convertible_v<decltype(f), std::function<bool(Value)>>, \"minLeft's argument f must be function bool(T)\");\n assert(r <= n_);\n Value sum{ product(r) };\n u32 l{};\n for (u32 bit{ bitWidth_ } ; bit ; ) {\n bit--;\n u32 nxt{ l | (1u << bit) };\n if (nxt <= r and not f(Group::operation(Group::inverse(dat_[nxt]), sum))) {\n sum = Group::operation(Group::inverse(dat_[nxt]), sum);\n l = std::move(nxt);\n }\n }\n assert(l <= r);\n return l;\n }\n\n // debug print\n friend std::ostream& operator<<(std::ostream& os, const FenwickTree& ft) {\n for (u32 i{} ; i <= ft.size() ; i++) {\n os << ft.prefixProduct(i) << (i == ft.size() ? \"\" : \" \");\n }\n return os;\n }\n\n};\n\n\n} // namespace zawa\n\n\n\nnamespace zawa {\n\ntemplate <class InputIterator>\nu64 InversionNumber(InputIterator first, InputIterator last) {\n assert((usize)std::distance(first, last) >= usize{0});\n std::vector<std::remove_reference_t<decltype(*first)>> A(first, last);\n auto rec{[&](auto rec, usize L, usize R) -> u64 {\n if (R - L <= usize{1}) return 0; \n usize M{(L + R) >> 1};\n u64 res{rec(rec, L, M) + rec(rec, M, R)};\n std::vector<u64> tmp(R - L);\n usize i{L}, j{M}, k{};\n while (i < M and j < R) {\n if (A[i] <= A[j]) {\n tmp[k++] = A[i++];\n }\n else {\n res += M - i;\n tmp[k++] = A[j++];\n }\n }\n while (i < M) tmp[k++] = A[i++];\n while (j < R) tmp[k++] = A[j++];\n for (usize l{L} ; l < R ; l++) {\n A[l] = tmp[l - L];\n }\n return res;\n }};\n return rec(rec, usize{0}, usize{A.size()});\n}\n\ntemplate <class InputIterator>\nbool InversionParity(InputIterator first, InputIterator last) {\n assert((usize)std::distance(first, last) >= usize{0});\n std::vector<std::remove_reference_t<decltype(*first)>> A(first, last);\n auto rec{[&](auto rec, usize L, usize R) -> bool {\n if (R - L <= usize{1}) return 0; \n usize M{(L + R) >> 1};\n bool res{rec(rec, L, M) != rec(rec, M, R)};\n std::vector<u64> tmp(R - L);\n usize i{L}, j{M}, k{};\n while (i < M and j < R) {\n if (A[i] <= A[j]) {\n tmp[k++] = A[i++];\n }\n else {\n res ^= (M - i) & 1;\n tmp[k++] = A[j++];\n }\n }\n while (i < M) tmp[k++] = A[i++];\n while (j < R) tmp[k++] = A[j++];\n for (usize l{L} ; l < R ; l++) {\n A[l] = tmp[l - L];\n }\n return res;\n }};\n return rec(rec, usize{0}, usize{A.size()});\n}\n\n} // namespace zawa\nusing namespace zawa;\n\nconst int sq{2000};\n\nint main() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n\n int N;\n std::cin >> N;\n std::vector<int> A(N);\n for (auto& a : A) std::cin >> a;\n int M;\n std::cin >> M;\n std::vector<int> B(M), E(M);\n for (int i{} ; i < M ; i++) {\n std::cin >> B[i] >> E[i];\n B[i]--; E[i]--;\n }\n const int sz{(N + sq - 1) / sq};\n std::vector<std::vector<int>> app(sz);\n for (int i{} ; i < N ; i++) {\n app[i / sq].push_back(A[i]);\n }\n {\n std::vector<int> tmp(A);\n for (int i{} ; i < M ; i++) {\n std::swap(tmp[B[i]], tmp[E[i]]);\n app[B[i] / sq].push_back(tmp[B[i]]);\n app[E[i] / sq].push_back(tmp[E[i]]);\n }\n }\n for (int i{} ; i < sz ; i++) {\n std::sort(app[i].begin(), app[i].end());\n app[i].erase(std::unique(app[i].begin(), app[i].end()), app[i].end());\n }\n std::vector<FenwickTree<AdditiveGroup<int>>> fen(sz);\n auto comp{[&](int i, int x) -> int {\n return (int)std::distance(app[i].begin(), std::lower_bound(app[i].begin(), app[i].end(), x));\n }};\n for (int i{} ; i < sz ; i++) {\n fen[i] = FenwickTree<AdditiveGroup<int>>(app[i].size());\n for (int j{i * sq} ; j < std::min(N, (i + 1) * sq) ; j++) {\n fen[i].operation(comp(i, A[j]), 1);\n }\n }\n // j = 0, 1, ..., i - 1について、x以上の値の数\n auto pref{[&](int i, int x) -> int {\n int pos{i / sq}, res{};\n for (int j{} ; j < pos ; j++) {\n res += fen[j].product(comp(j, x), app[j].size());\n }\n for (int j{pos * sq} ; j < i ; j++) {\n if (A[j] >= x) res++;\n }\n return res;\n }};\n // j = i + 1, i + 2, ..., N - 1について、x以上の値の数\n auto suf{[&](int i, int x) -> int {\n int pos{i / sq}, res{};\n for (int j{i + 1} ; j < std::min(N, (pos + 1) * sq) ; j++) {\n if (A[j] >= x) res++;\n }\n for (int j{pos + 1} ; j < sz ; j++) {\n res += fen[j].product(comp(j, x), app[j].size());\n }\n return res;\n }};\n long long inv{(long long)InversionNumber(A.begin(), A.end())};\n for (int i{} ; i < M ; i++) {\n int u{A[B[i]]}, v{A[E[i]]};\n // A[B[i]] <- v\n inv -= pref(B[i], A[B[i]] + 1);\n inv -= (N - B[i] - 1) - suf(B[i], A[B[i]]);\n fen[B[i] / sq].operation(comp(B[i] / sq, A[B[i]]), -1);\n fen[B[i] / sq].operation(comp(B[i] / sq, v), 1);\n A[B[i]] = v;\n inv += pref(B[i], A[B[i]] + 1);\n inv += (N - B[i] - 1) - suf(B[i], A[B[i]]);\n // A[E[i]] <- u\n inv -= pref(E[i], A[E[i]] + 1);\n inv -= (N - E[i] - 1) - suf(E[i], A[E[i]]);\n fen[E[i] / sq].operation(comp(E[i] / sq, A[E[i]]), -1);\n fen[E[i] / sq].operation(comp(E[i] / sq, u), 1);\n A[E[i]] = u;\n inv += pref(E[i], A[E[i]] + 1);\n inv += (N - E[i] - 1) - suf(E[i], A[E[i]]);\n std::cout << inv << '\\n';\n }\n}", "accuracy": 1, "time_ms": 2270, "memory_kb": 21264, "score_of_the_acc": -1.0308, "final_rank": 8 }, { "submission_id": "aoj_0451_9193260", "code_snippet": "#pragma region Macros\n\n// #pragma GCC optimize(\"O3,unroll-loops\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n\n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\n\n#define pb emplace_back\n// #define int ll\n#define endl '\\n'\n// #define unordered_map<int, int> gp_hash_table<int, int, custom_hash> \n\n#define sqrt __builtin_sqrtl\n#define cbrt __builtin_cbrtl\n#define hypot __builtin_hypotl\n\n#define next asdnext\n#define prev asdprev\n\nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\nconst int MOD = 998244353;\n// const int MOD = 1000000007;\n\nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n\n#define EC int\nstruct Edge {\n int from, to;\n EC cost;\n Edge() : from(-1), to(-1), cost(-1) {}\n Edge(int to, EC cost) : to(to), cost(cost) {}\n Edge(int from, int to, EC cost) : from(from), to(to), cost(cost) {}\n bool operator ==(const Edge& e) {\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\n }\n bool operator !=(const Edge& e) {\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\n }\n};\n\nchrono::system_clock::time_point start;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n\nrandom_device seed_gen;\nmt19937_64 rng(seed_gen());\nuniform_int_distribution<int> dist_x(0, 1e9);\nstruct RNG {\n unsigned Int(unsigned l, unsigned r) {\n return dist_x(rng) % (r - l + 1) + l;\n }\n ld Double() {\n return ld(dist_x(rng)) / 1e9;\n }\n} rnd;\n\nusing i64 = ll;\n// using i64 = uint64_t;\n// bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\ni64 lrmask(i64 l, i64 r) { return (1LL << r) - (1LL << l); }\ni64 sub_bit(i64 x, i64 l, i64 r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\ni64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\n\ni64 popcount(i64 x) { return __builtin_popcountll(x); }\ni64 popcount(i64 x, i64 l, i64 r) { return __builtin_popcountll(sub_bit(x, l, r)); }\ni64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); }\ni64 unpopcount(i64 x, i64 l, i64 r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); }\nbool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; } // xが負のときは常にfalse\nbool is_pow4(i64 x) { return __builtin_popcount(x) == 1 && __builtin_ctz(x) % 2 == 0; }\n\ni64 top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\ni64 bot_bit(i64 x) { return __builtin_ctzll(x);} // 2^kの位 (x > 0)\n// i64 next_bit(i64 x, i64 k) { return 0; }\n// i64 prev_bit(i64 x, i64 k) { return 0; }\n// i64 kth_bit(i64 x, i64 k) { return 0; }\ni64 MSB(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\ni64 LSB(i64 x) { return (x & -x); } // mask\n\ni64 countl_zero(i64 x) { return __builtin_clzll(x); }\ni64 countl_one(i64 x) {\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\n return ret;\n}\ni64 countr_zero(i64 x) { return __builtin_ctzll(x); } // x==0のとき64が返ることに注意\ni64 countr_one(i64 x) { i64 ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\n\ni64 floor_log2(i64 x) { if (x == 0) return 0; return 63 - __builtin_clzll(x); }\ni64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // MSBと同じ\ni64 ceil_log2(i64 x) { if (x == 0) return 0; return 64 - __builtin_clzll(x - 1); }\ni64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\n\ni64 rotl(i64 x, i64 k) { // 有効bit内でrotate. オーバーフロー注意\n i64 w = bit_width(x); k %= w;\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\ni64 rotr(i64 x, i64 k) {\n i64 w = bit_width(x); k %= w;\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\ni64 bit_reverse(i64 x) { // 有効bit内で左右反転\n i64 r = 0, w = bit_width(x);\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\n return r;\n}\n// i64 bit_reverse(i64 x, i64 l, i64 r) { return 0; }\n\nbool is_palindrome(i64 x) { return x == bit_reverse(x); }\nbool is_palindrome(i64 x, i64 l, i64 r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\ni64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\ni64 erase(i64 x, i64 l, i64 r) { return x>>r<<l | x&(1LL<<l - 1); } // [l, r) をカット\n\ni64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\ni64 hamming(i64 a, i64 b, i64 l, i64 r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\ni64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\ni64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\ni64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\n\ni64 next_combination(i64 x) {\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctzll(x) + 1));\n}\n\n\n__int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n}\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n}\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n if (x >= 0) return x % y;\n __int128_t ret = x % y; // (x < 0)\n ret += (__int128_t)abs(y) * INFL;\n ret %= abs(y);\n return ret;\n}\nint floor(int x, int y) { // (ld)x / y 以下の最大の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x >= 0 ? x / y : (x + 1) / y - 1;\n}\nint ceil(int x, int y) { // (ld)x / y 以上の最小の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x > 0 ? (x - 1) / y + 1 : x / y;\n}\nint round(int x, int y) {\n assert(y != 0);\n return (x * 2 + y) / (y * 2);\n}\nint round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\n assert(y != 0); // TODO\n return INF;\n}\nint round2(int x, int y) { // 五捨五超入 // 未verify\n assert(y != 0);\n if (y < 0) y = -y, x = -x;\n int z = z / y;\n if ((z * 2 + 1) * y <= y * 2) z++;\n return z;\n}\n// int round(ld x, int k) { // xを10^kの位に関して四捨五入\n// }\n// int floor(ld x, int k) { // xを10^kの位に関してflooring\n// }\n// int ceil(ld x, int k) { // xを10^kの位に関してceiling\n// }\n// int kth(int x, int y, int k) { // x / yの10^kの位の桁\n// }\nint floor(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return floor(x / y);\n // floor(x) = ceil(x - 1) という話も\n}\nint ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\n assert(!equals(y, 0));\n return ceil(x / y);\n // ceil(x) = floor(x + 1)\n}\nint perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\n assert(!equals(y, 0));\n if (x >= 0 && y > 0) return floor(x / y)+EPS;\n if (x >= 0 && y < 0) return -floor(x / fabs(y));\n if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\n return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n}\nld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\n // 未verify. 誤差対策TODO. -0.0が返りうる。\n assert(!equals(y, 0));\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\n return x - fabs(y)*floor(x, fabs(y));\n}\nint seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\nint modf(ld x) {\n\tif (x < 0) return ceill(x);\n\telse return floorl(x);\n}\n// 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\nint seisuu(int x, int y) {\n assert(y != 0);\n return x / y;\n}\nint seisuu(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return (int)(x / y);\n}\n\ntemplate <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\n return b;\n}\ntemplate <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\n return b;\n}\n\ntemplate <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; } return false;\n}\ntemplate <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; } return false;\n}\ntemplate <class T> T mid(T a, T b, T c) { // 誤差対策TODO\n return a + b + c - max({a, b, c}) - min({a, b, c});\n}\ntemplate <class T> void Sort(T &a, T &b, bool rev = false) { \n if (rev == false) { // TODO テンプレート引数\n if (a > b) swap(a, b);\n } else {\n if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void Sort(T &a, T &b, T &c, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (b > c) swap(b, c);\n } else {\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void Sort(T &a, T &b, T &c, T &d, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\n if (b > c) swap(b, c); if (b > d) swap(b, d); if (c > d) swap(c, d);\n } else {\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n\n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\nclass Compress {\npublic:\n int sz = 0;\n // gp_hash_table<int, int, custom_hash> Z, UZ;\n unordered_map<int, int> Z; // 元の値 -> 圧縮した値\n unordered_map<int, int> UZ; // 圧縮した値 -> 元の値\n\n Compress(const vector<int> &V, int base = 0) {\n this->sz = base;\n set<int> s(V.begin(), V.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {\n this->sz = base;\n vector<int> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<int> s(V3.begin(), V3.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {\n this->sz = base;\n vector<int> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<int> s(V4.begin(), V4.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2,\n const vector<int> &V3, const vector<int> &V4, int base = 0) {\n this->sz = base;\n vector<int> V5 = V1;\n V5.insert(V5.end(), V2.begin(), V2.end());\n V5.insert(V5.end(), V3.begin(), V3.end());\n V5.insert(V5.end(), V4.begin(), V4.end());\n set<int> s(V5.begin(), V5.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n vector<int> zip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[ret[i]];\n }\n return ret;\n }\n\n vector<int> unzip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = UZ[ret[i]];\n }\n return ret;\n }\n\n int size() { return sz; }\n\n int encode(int x) { return Z[x]; }\n int decode(int x) {\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\n return UZ[x];\n }\n};\n\nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n return true;\n\t}\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase( remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }), G.end());\n return G;\n }\nprivate:\n\tvector<int> par, sz;\n};\n\ntemplate<typename T>\nstruct BIT {\n int N; // 要素数\n vector<T> bit[2]; // データの格納先\n BIT(int N_, int x = 0) {\n N = N_ + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n if (x != 0) {\n for (int i = 0; i < N; i++) add(i, x);\n }\n }\n BIT(const vector<int> &A) {\n N = A.size() + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\n }\n void add_sub(int p, int i, T x) {\n while (i < N) { bit[p][i] += x; i += (i & -i); }\n }\n void add(int l, int r, T x) {\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\n }\n void add(int i, T x) { add(i, i + 1, x); }\n T sum_sub(int p, int i) {\n T ret = 0;\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\n return ret;\n }\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\n T sum(int l, int r) { return sum(r) - sum(l); }\n T get(int i) { return sum(i, i + 1); }\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\n};\n\n#pragma endregion\n\n// #define pb emplace_back\n// using ll = long long;\n// const int INF = 1 << 30;\n// const ll INFL = 1LL << 61;\n\nconst int Nmax = 500003, Qmax = 30007, NQmax = 530011, V = 25000030;\n\nint N, Q, A[Nmax], B[NQmax], sz; // 座圧列と座圧後のサイズ？\n\nstruct qry {\n int t, l, r, x, k;\n} query[Qmax];\n\nint v(int x) {\n return lower_bound(B + 1, B + sz + 1, x) - B;\n}\n\nvoid disc(int N, int Q) { // 座圧\n memcpy(B, A, sizeof A);\n\n // for (int i = 0; i < Q; i++) {\n // if (query[i].t != 2) B[++N] = query[i].x;\n // }\n\n sort(B + 1, B + N + 1);\n sz = unique(B + 1, B + N + 1) - B - 1;\n B[0] = -INF - 1, B[sz + 1] = INF + 1;\n}\n\nvector<int> rt(NQmax), xl(NQmax), xr(NQmax);\nint vl, vr;\nclass LOJ {\n class seg {\n int c;\n\n struct node {\n int l, r, x;\n } a[V];\n\n void up(int x) {\n a[x].x = a[a[x].l].x + a[a[x].r].x;\n }\n\n public:\n\n void add(int p, int x, int &X, int l = 1, int r = sz) {\n a[++c] = a[X], X = c;\n\n if (l == r) {\n a[X].x += x;\n return;\n }\n\n int m = l + r >> 1;\n p <= m ? add(p, x, a[X].l, l, m) : add(p, x, a[X].r, m + 1, r);\n up(X);\n }\n\n int rank(int x, int l = 1, int r = sz) {\n if (l == r) return 1;\n\n int m = l + r >> 1;\n\n if (x <= m) {\n for (int i = 1; i <= vl; i++) xl[i] = a[xl[i]].l;\n for (int i = 1; i <= vr; i++) xr[i] = a[xr[i]].l;\n\n return rank(x, l, m);\n } else {\n int t = 0;\n\n for (int i = 1; i <= vl; i++) t -= a[a[xl[i]].l].x, xl[i] = a[xl[i]].r;\n for (int i = 1; i <= vr; i++) t += a[a[xr[i]].l].x, xr[i] = a[xr[i]].r;\n\n return t + rank(x, m + 1, r);\n }\n }\n\n int kth_smallest(int x, int l = 1, int r = sz) {\n if (l == r)\n return l;\n\n int m = l + r >> 1, t = 0;\n\n for (int i = 1; i <= vl; i++) t -= a[a[xl[i]].l].x;\n for (int i = 1; i <= vr; i++) t += a[a[xr[i]].l].x;\n\n if (x <= t) {\n for (int i = 1; i <= vl; i++) xl[i] = a[xl[i]].l;\n for (int i = 1; i <= vr; i++) xr[i] = a[xr[i]].l;\n\n return kth_smallest(x, l, m);\n } else {\n for (int i = 1; i <= vl; i++) xl[i] = a[xl[i]].r;\n for (int i = 1; i <= vr; i++) xr[i] = a[xr[i]].r;\n\n return kth_smallest(x - t, m + 1, r);\n }\n }\n } s;\n\npublic:\n\n void add(int p1, int p2, int x) {\n for (int i = p1; i <= N; i += i & -i) s.add(p2, x, rt[i]);\n }\n\n void _X(int l, int r) {\n vl = vr = 0;\n\n for (int i = l - 1; i > 0; i &= i - 1) xl[++vl] = rt[i];\n\n for (int i = r; i > 0; i &= i - 1) xr[++vr] = rt[i];\n }\n\n int rank(int l, int r, int x) {\n _X(l, r);\n return s.rank(x);\n }\n\n int count(int l, int r, int x) { // 未verify\n return rank(l, r, x + 1) - rank(l, r, x);\n }\n\n int count(int l, int r, int a, int b) { // 未verify\n return rank(l, r, b) - rank(l, r, a);\n }\n\n int kth_smallest(int l, int r, int k) {\n // assert(0 <= k && k < r - l);\n _X(l, r);\n return s.kth_smallest(k);\n }\n\n int kth_largest(int l, int r, int k) { // 未verify\n return kth_smallest(l, r, r - l - k - 1);\n }\n\n // int get(int i) {\n // return kth_smallest(i, i + 1, 0);\n // return ;\n // }\n\n int prev_value(int l, int r, int x) {\n int t = rank(l, r, x) - 1;\n return t ? kth_smallest(l, r, t) : 0;\n }\n\n int next_value(int l, int r, int x) {\n int t = rank(l, r, x + 1);\n return t <= r - l + 1 ? kth_smallest(l, r, t) : sz + 1;\n }\n} seg;\n\nsigned main() {\n cin >> N;\n\n // Aの入力は1-indexed\n for (int i = 1; i <= N; i++) cin >> A[i];\n\n cin >> Q;\n\n // 区間は1-indexの閉区間\n for (int i = 0; i < Q; i++) {\n cin >> query[i].l >> query[i].r;\n }\n\n disc(N, Q);\n\n for (int i = 1; i <= N; i++) seg.add(i, v(A[i]), 1);\n\n tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> tr;\n int t = 0; // 初めの転倒数\n for (int i = N; i >= 1; i--) {\n tr.insert(A[i]);\n // A[i]未満の個数を逆順に加算していく\n t += tr.order_of_key(A[i]);\n }\n\n for (int i = 0; i < Q; i++) {\n t -= seg.count(query[i].l + 1, N, 0, A[query[i].l]);\n t -= seg.count(query[i].r + 1, N, 0, A[query[i].r]);\n\n t -= seg.count(query[i].l + 1, query[i].r, A[query[i].r] + 1, NQmax);\n\n int temp = A[query[i].l];\n\n seg.add(query[i].l, v(A[query[i].l]), -1);\n A[query[i].l] = A[query[i].r];\n seg.add(query[i].l, v(A[query[i].l]), 1);\n\n seg.add(query[i].r, v(A[query[i].r]), -1);\n A[query[i].r] = temp;\n seg.add(query[i].r, v(A[query[i].r]), 1);\n\n t += seg.count(query[i].l + 1, query[i].r, A[query[i].r] + 1, NQmax);\n\n t += seg.count(query[i].l + 1, N, 0, A[query[i].l]);\n t += seg.count(query[i].r + 1, N, 0, A[query[i].r]);\n\n cout << t << endl;\n }\n}", "accuracy": 0.7, "time_ms": 80, "memory_kb": 81752, "score_of_the_acc": -0.1875, "final_rank": 10 }, { "submission_id": "aoj_0451_9193259", "code_snippet": "#pragma region Macros\n\n// #pragma GCC optimize(\"O3,unroll-loops\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n\n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\n\n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n// #define unordered_map<int, int> gp_hash_table<int, int, custom_hash> \n\n#define sqrt __builtin_sqrtl\n#define cbrt __builtin_cbrtl\n#define hypot __builtin_hypotl\n\n#define next asdnext\n#define prev asdprev\n\nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\nconst int MOD = 998244353;\n// const int MOD = 1000000007;\n\nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n\n#define EC int\nstruct Edge {\n int from, to;\n EC cost;\n Edge() : from(-1), to(-1), cost(-1) {}\n Edge(int to, EC cost) : to(to), cost(cost) {}\n Edge(int from, int to, EC cost) : from(from), to(to), cost(cost) {}\n bool operator ==(const Edge& e) {\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\n }\n bool operator !=(const Edge& e) {\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\n }\n};\n\nchrono::system_clock::time_point start;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n\nrandom_device seed_gen;\nmt19937_64 rng(seed_gen());\nuniform_int_distribution<int> dist_x(0, 1e9);\nstruct RNG {\n unsigned Int(unsigned l, unsigned r) {\n return dist_x(rng) % (r - l + 1) + l;\n }\n ld Double() {\n return ld(dist_x(rng)) / 1e9;\n }\n} rnd;\n\nusing i64 = ll;\n// using i64 = uint64_t;\n// bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\ni64 lrmask(i64 l, i64 r) { return (1LL << r) - (1LL << l); }\ni64 sub_bit(i64 x, i64 l, i64 r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\ni64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\n\ni64 popcount(i64 x) { return __builtin_popcountll(x); }\ni64 popcount(i64 x, i64 l, i64 r) { return __builtin_popcountll(sub_bit(x, l, r)); }\ni64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); }\ni64 unpopcount(i64 x, i64 l, i64 r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); }\nbool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; } // xが負のときは常にfalse\nbool is_pow4(i64 x) { return __builtin_popcount(x) == 1 && __builtin_ctz(x) % 2 == 0; }\n\ni64 top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\ni64 bot_bit(i64 x) { return __builtin_ctzll(x);} // 2^kの位 (x > 0)\n// i64 next_bit(i64 x, i64 k) { return 0; }\n// i64 prev_bit(i64 x, i64 k) { return 0; }\n// i64 kth_bit(i64 x, i64 k) { return 0; }\ni64 MSB(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\ni64 LSB(i64 x) { return (x & -x); } // mask\n\ni64 countl_zero(i64 x) { return __builtin_clzll(x); }\ni64 countl_one(i64 x) {\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\n return ret;\n}\ni64 countr_zero(i64 x) { return __builtin_ctzll(x); } // x==0のとき64が返ることに注意\ni64 countr_one(i64 x) { i64 ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\n\ni64 floor_log2(i64 x) { if (x == 0) return 0; return 63 - __builtin_clzll(x); }\ni64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // MSBと同じ\ni64 ceil_log2(i64 x) { if (x == 0) return 0; return 64 - __builtin_clzll(x - 1); }\ni64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\n\ni64 rotl(i64 x, i64 k) { // 有効bit内でrotate. オーバーフロー注意\n i64 w = bit_width(x); k %= w;\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\ni64 rotr(i64 x, i64 k) {\n i64 w = bit_width(x); k %= w;\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\ni64 bit_reverse(i64 x) { // 有効bit内で左右反転\n i64 r = 0, w = bit_width(x);\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\n return r;\n}\n// i64 bit_reverse(i64 x, i64 l, i64 r) { return 0; }\n\nbool is_palindrome(i64 x) { return x == bit_reverse(x); }\nbool is_palindrome(i64 x, i64 l, i64 r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\ni64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\ni64 erase(i64 x, i64 l, i64 r) { return x>>r<<l | x&(1LL<<l - 1); } // [l, r) をカット\n\ni64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\ni64 hamming(i64 a, i64 b, i64 l, i64 r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\ni64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\ni64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\ni64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\n\ni64 next_combination(i64 x) {\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctzll(x) + 1));\n}\n\n\n__int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n}\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n}\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n if (x >= 0) return x % y;\n __int128_t ret = x % y; // (x < 0)\n ret += (__int128_t)abs(y) * INFL;\n ret %= abs(y);\n return ret;\n}\nint floor(int x, int y) { // (ld)x / y 以下の最大の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x >= 0 ? x / y : (x + 1) / y - 1;\n}\nint ceil(int x, int y) { // (ld)x / y 以上の最小の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x > 0 ? (x - 1) / y + 1 : x / y;\n}\nint round(int x, int y) {\n assert(y != 0);\n return (x * 2 + y) / (y * 2);\n}\nint round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\n assert(y != 0); // TODO\n return INF;\n}\nint round2(int x, int y) { // 五捨五超入 // 未verify\n assert(y != 0);\n if (y < 0) y = -y, x = -x;\n int z = z / y;\n if ((z * 2 + 1) * y <= y * 2) z++;\n return z;\n}\n// int round(ld x, int k) { // xを10^kの位に関して四捨五入\n// }\n// int floor(ld x, int k) { // xを10^kの位に関してflooring\n// }\n// int ceil(ld x, int k) { // xを10^kの位に関してceiling\n// }\n// int kth(int x, int y, int k) { // x / yの10^kの位の桁\n// }\nint floor(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return floor(x / y);\n // floor(x) = ceil(x - 1) という話も\n}\nint ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\n assert(!equals(y, 0));\n return ceil(x / y);\n // ceil(x) = floor(x + 1)\n}\nint perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\n assert(!equals(y, 0));\n if (x >= 0 && y > 0) return floor(x / y)+EPS;\n if (x >= 0 && y < 0) return -floor(x / fabs(y));\n if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\n return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n}\nld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\n // 未verify. 誤差対策TODO. -0.0が返りうる。\n assert(!equals(y, 0));\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\n return x - fabs(y)*floor(x, fabs(y));\n}\nint seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\nint modf(ld x) {\n\tif (x < 0) return ceill(x);\n\telse return floorl(x);\n}\n// 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\nint seisuu(int x, int y) {\n assert(y != 0);\n return x / y;\n}\nint seisuu(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return (int)(x / y);\n}\n\ntemplate <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\n return b;\n}\ntemplate <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\n return b;\n}\n\ntemplate <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; } return false;\n}\ntemplate <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; } return false;\n}\ntemplate <class T> T mid(T a, T b, T c) { // 誤差対策TODO\n return a + b + c - max({a, b, c}) - min({a, b, c});\n}\ntemplate <class T> void Sort(T &a, T &b, bool rev = false) { \n if (rev == false) { // TODO テンプレート引数\n if (a > b) swap(a, b);\n } else {\n if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void Sort(T &a, T &b, T &c, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (b > c) swap(b, c);\n } else {\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void Sort(T &a, T &b, T &c, T &d, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\n if (b > c) swap(b, c); if (b > d) swap(b, d); if (c > d) swap(c, d);\n } else {\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n\n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\nclass Compress {\npublic:\n int sz = 0;\n // gp_hash_table<int, int, custom_hash> Z, UZ;\n unordered_map<int, int> Z; // 元の値 -> 圧縮した値\n unordered_map<int, int> UZ; // 圧縮した値 -> 元の値\n\n Compress(const vector<int> &V, int base = 0) {\n this->sz = base;\n set<int> s(V.begin(), V.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {\n this->sz = base;\n vector<int> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<int> s(V3.begin(), V3.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {\n this->sz = base;\n vector<int> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<int> s(V4.begin(), V4.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2,\n const vector<int> &V3, const vector<int> &V4, int base = 0) {\n this->sz = base;\n vector<int> V5 = V1;\n V5.insert(V5.end(), V2.begin(), V2.end());\n V5.insert(V5.end(), V3.begin(), V3.end());\n V5.insert(V5.end(), V4.begin(), V4.end());\n set<int> s(V5.begin(), V5.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n vector<int> zip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[ret[i]];\n }\n return ret;\n }\n\n vector<int> unzip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = UZ[ret[i]];\n }\n return ret;\n }\n\n int size() { return sz; }\n\n int encode(int x) { return Z[x]; }\n int decode(int x) {\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\n return UZ[x];\n }\n};\n\nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n return true;\n\t}\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase( remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }), G.end());\n return G;\n }\nprivate:\n\tvector<int> par, sz;\n};\n\ntemplate<typename T>\nstruct BIT {\n int N; // 要素数\n vector<T> bit[2]; // データの格納先\n BIT(int N_, int x = 0) {\n N = N_ + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n if (x != 0) {\n for (int i = 0; i < N; i++) add(i, x);\n }\n }\n BIT(const vector<int> &A) {\n N = A.size() + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\n }\n void add_sub(int p, int i, T x) {\n while (i < N) { bit[p][i] += x; i += (i & -i); }\n }\n void add(int l, int r, T x) {\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\n }\n void add(int i, T x) { add(i, i + 1, x); }\n T sum_sub(int p, int i) {\n T ret = 0;\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\n return ret;\n }\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\n T sum(int l, int r) { return sum(r) - sum(l); }\n T get(int i) { return sum(i, i + 1); }\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\n};\n\n#pragma endregion\n\n// #define pb emplace_back\n// using ll = long long;\n// const int INF = 1 << 30;\n// const ll INFL = 1LL << 61;\n\nconst int Nmax = 500003, Qmax = 30007, NQmax = 530011, V = 25000030;\n\nint N, Q, A[Nmax], B[NQmax], sz; // 座圧列と座圧後のサイズ？\n\nstruct qry {\n int t, l, r, x, k;\n} query[Qmax];\n\nint v(int x) {\n return lower_bound(B + 1, B + sz + 1, x) - B;\n}\n\nvoid disc(int N, int Q) { // 座圧\n memcpy(B, A, sizeof A);\n\n // for (int i = 0; i < Q; i++) {\n // if (query[i].t != 2) B[++N] = query[i].x;\n // }\n\n sort(B + 1, B + N + 1);\n sz = unique(B + 1, B + N + 1) - B - 1;\n B[0] = -INF, B[sz + 1] = INF;\n}\n\nvector<int> rt(NQmax), xl(NQmax), xr(NQmax);\nint vl, vr;\nclass LOJ {\n class seg {\n int c;\n\n struct node {\n int l, r, x;\n } a[V];\n\n void up(int x) {\n a[x].x = a[a[x].l].x + a[a[x].r].x;\n }\n\n public:\n\n void add(int p, int x, int &X, int l = 1, int r = sz) {\n a[++c] = a[X], X = c;\n\n if (l == r) {\n a[X].x += x;\n return;\n }\n\n int m = l + r >> 1;\n p <= m ? add(p, x, a[X].l, l, m) : add(p, x, a[X].r, m + 1, r);\n up(X);\n }\n\n int rank(int x, int l = 1, int r = sz) {\n if (l == r) return 1;\n\n int m = l + r >> 1;\n\n if (x <= m) {\n for (int i = 1; i <= vl; i++) xl[i] = a[xl[i]].l;\n for (int i = 1; i <= vr; i++) xr[i] = a[xr[i]].l;\n\n return rank(x, l, m);\n } else {\n int t = 0;\n\n for (int i = 1; i <= vl; i++) t -= a[a[xl[i]].l].x, xl[i] = a[xl[i]].r;\n for (int i = 1; i <= vr; i++) t += a[a[xr[i]].l].x, xr[i] = a[xr[i]].r;\n\n return t + rank(x, m + 1, r);\n }\n }\n\n int kth_smallest(int x, int l = 1, int r = sz) {\n if (l == r)\n return l;\n\n int m = l + r >> 1, t = 0;\n\n for (int i = 1; i <= vl; i++) t -= a[a[xl[i]].l].x;\n for (int i = 1; i <= vr; i++) t += a[a[xr[i]].l].x;\n\n if (x <= t) {\n for (int i = 1; i <= vl; i++) xl[i] = a[xl[i]].l;\n for (int i = 1; i <= vr; i++) xr[i] = a[xr[i]].l;\n\n return kth_smallest(x, l, m);\n } else {\n for (int i = 1; i <= vl; i++) xl[i] = a[xl[i]].r;\n for (int i = 1; i <= vr; i++) xr[i] = a[xr[i]].r;\n\n return kth_smallest(x - t, m + 1, r);\n }\n }\n } s;\n\npublic:\n\n void add(int p1, int p2, int x) {\n for (int i = p1; i <= N; i += i & -i) s.add(p2, x, rt[i]);\n }\n\n void _X(int l, int r) {\n vl = vr = 0;\n\n for (int i = l - 1; i > 0; i &= i - 1) xl[++vl] = rt[i];\n\n for (int i = r; i > 0; i &= i - 1) xr[++vr] = rt[i];\n }\n\n int rank(int l, int r, int x) {\n _X(l, r);\n return s.rank(x);\n }\n\n int count(int l, int r, int x) { // 未verify\n return rank(l, r, x + 1) - rank(l, r, x);\n }\n\n int count(int l, int r, int a, int b) { // 未verify\n return rank(l, r, b) - rank(l, r, a);\n }\n\n int kth_smallest(int l, int r, int k) {\n // assert(0 <= k && k < r - l);\n _X(l, r);\n return s.kth_smallest(k);\n }\n\n int kth_largest(int l, int r, int k) { // 未verify\n return kth_smallest(l, r, r - l - k - 1);\n }\n\n // int get(int i) {\n // return kth_smallest(i, i + 1, 0);\n // return ;\n // }\n\n int prev_value(int l, int r, int x) {\n int t = rank(l, r, x) - 1;\n return t ? kth_smallest(l, r, t) : 0;\n }\n\n int next_value(int l, int r, int x) {\n int t = rank(l, r, x + 1);\n return t <= r - l + 1 ? kth_smallest(l, r, t) : sz + 1;\n }\n} seg;\n\nsigned main() {\n cin >> N;\n\n // Aの入力は1-indexed\n for (int i = 1; i <= N; i++) cin >> A[i];\n\n cin >> Q;\n\n // 区間は1-indexの閉区間\n for (int i = 0; i < Q; i++) {\n cin >> query[i].l >> query[i].r;\n }\n\n disc(N, Q);\n\n for (int i = 1; i <= N; i++) seg.add(i, v(A[i]), 1);\n\n tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> tr;\n int t = 0; // 初めの転倒数\n for (int i = N; i >= 1; i--) {\n tr.insert(A[i]);\n // A[i]未満の個数を逆順に加算していく\n t += tr.order_of_key(A[i]);\n }\n\n for (int i = 0; i < Q; i++) {\n t -= seg.count(query[i].l + 1, N, 0, A[query[i].l]);\n t -= seg.count(query[i].r + 1, N, 0, A[query[i].r]);\n\n t -= seg.count(query[i].l + 1, query[i].r, A[query[i].r] + 1, NQmax);\n\n int temp = A[query[i].l];\n\n seg.add(query[i].l, v(A[query[i].l]), -1);\n A[query[i].l] = A[query[i].r];\n seg.add(query[i].l, v(A[query[i].l]), 1);\n\n seg.add(query[i].r, v(A[query[i].r]), -1);\n A[query[i].r] = temp;\n seg.add(query[i].r, v(A[query[i].r]), 1);\n\n t += seg.count(query[i].l + 1, query[i].r, A[query[i].r] + 1, NQmax);\n\n t += seg.count(query[i].l + 1, N, 0, A[query[i].l]);\n t += seg.count(query[i].r + 1, N, 0, A[query[i].r]);\n\n cout << t << endl;\n }\n}", "accuracy": 0.7, "time_ms": 100, "memory_kb": 155664, "score_of_the_acc": -0.3446, "final_rank": 14 }, { "submission_id": "aoj_0451_9193256", "code_snippet": "#pragma region Macros\n\n// #pragma GCC optimize(\"O3,unroll-loops\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n\n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\n\n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n// #define unordered_map<int, int> gp_hash_table<int, int, custom_hash> \n\n#define sqrt __builtin_sqrtl\n#define cbrt __builtin_cbrtl\n#define hypot __builtin_hypotl\n\n#define next asdnext\n#define prev asdprev\n\nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\nconst int MOD = 998244353;\n// const int MOD = 1000000007;\n\nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n\n#define EC int\nstruct Edge {\n int from, to;\n EC cost;\n Edge() : from(-1), to(-1), cost(-1) {}\n Edge(int to, EC cost) : to(to), cost(cost) {}\n Edge(int from, int to, EC cost) : from(from), to(to), cost(cost) {}\n bool operator ==(const Edge& e) {\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\n }\n bool operator !=(const Edge& e) {\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\n }\n};\n\nchrono::system_clock::time_point start;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n\nrandom_device seed_gen;\nmt19937_64 rng(seed_gen());\nuniform_int_distribution<int> dist_x(0, 1e9);\nstruct RNG {\n unsigned Int(unsigned l, unsigned r) {\n return dist_x(rng) % (r - l + 1) + l;\n }\n ld Double() {\n return ld(dist_x(rng)) / 1e9;\n }\n} rnd;\n\nusing i64 = ll;\n// using i64 = uint64_t;\n// bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\ni64 lrmask(i64 l, i64 r) { return (1LL << r) - (1LL << l); }\ni64 sub_bit(i64 x, i64 l, i64 r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\ni64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\n\ni64 popcount(i64 x) { return __builtin_popcountll(x); }\ni64 popcount(i64 x, i64 l, i64 r) { return __builtin_popcountll(sub_bit(x, l, r)); }\ni64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); }\ni64 unpopcount(i64 x, i64 l, i64 r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); }\nbool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; } // xが負のときは常にfalse\nbool is_pow4(i64 x) { return __builtin_popcount(x) == 1 && __builtin_ctz(x) % 2 == 0; }\n\ni64 top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\ni64 bot_bit(i64 x) { return __builtin_ctzll(x);} // 2^kの位 (x > 0)\n// i64 next_bit(i64 x, i64 k) { return 0; }\n// i64 prev_bit(i64 x, i64 k) { return 0; }\n// i64 kth_bit(i64 x, i64 k) { return 0; }\ni64 MSB(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\ni64 LSB(i64 x) { return (x & -x); } // mask\n\ni64 countl_zero(i64 x) { return __builtin_clzll(x); }\ni64 countl_one(i64 x) {\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\n return ret;\n}\ni64 countr_zero(i64 x) { return __builtin_ctzll(x); } // x==0のとき64が返ることに注意\ni64 countr_one(i64 x) { i64 ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\n\ni64 floor_log2(i64 x) { if (x == 0) return 0; return 63 - __builtin_clzll(x); }\ni64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // MSBと同じ\ni64 ceil_log2(i64 x) { if (x == 0) return 0; return 64 - __builtin_clzll(x - 1); }\ni64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\n\ni64 rotl(i64 x, i64 k) { // 有効bit内でrotate. オーバーフロー注意\n i64 w = bit_width(x); k %= w;\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\ni64 rotr(i64 x, i64 k) {\n i64 w = bit_width(x); k %= w;\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\ni64 bit_reverse(i64 x) { // 有効bit内で左右反転\n i64 r = 0, w = bit_width(x);\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\n return r;\n}\n// i64 bit_reverse(i64 x, i64 l, i64 r) { return 0; }\n\nbool is_palindrome(i64 x) { return x == bit_reverse(x); }\nbool is_palindrome(i64 x, i64 l, i64 r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\ni64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\ni64 erase(i64 x, i64 l, i64 r) { return x>>r<<l | x&(1LL<<l - 1); } // [l, r) をカット\n\ni64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\ni64 hamming(i64 a, i64 b, i64 l, i64 r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\ni64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\ni64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\ni64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\n\ni64 next_combination(i64 x) {\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctzll(x) + 1));\n}\n\n\n__int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n}\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n}\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n if (x >= 0) return x % y;\n __int128_t ret = x % y; // (x < 0)\n ret += (__int128_t)abs(y) * INFL;\n ret %= abs(y);\n return ret;\n}\nint floor(int x, int y) { // (ld)x / y 以下の最大の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x >= 0 ? x / y : (x + 1) / y - 1;\n}\nint ceil(int x, int y) { // (ld)x / y 以上の最小の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x > 0 ? (x - 1) / y + 1 : x / y;\n}\nint round(int x, int y) {\n assert(y != 0);\n return (x * 2 + y) / (y * 2);\n}\nint round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\n assert(y != 0); // TODO\n return INF;\n}\nint round2(int x, int y) { // 五捨五超入 // 未verify\n assert(y != 0);\n if (y < 0) y = -y, x = -x;\n int z = z / y;\n if ((z * 2 + 1) * y <= y * 2) z++;\n return z;\n}\n// int round(ld x, int k) { // xを10^kの位に関して四捨五入\n// }\n// int floor(ld x, int k) { // xを10^kの位に関してflooring\n// }\n// int ceil(ld x, int k) { // xを10^kの位に関してceiling\n// }\n// int kth(int x, int y, int k) { // x / yの10^kの位の桁\n// }\nint floor(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return floor(x / y);\n // floor(x) = ceil(x - 1) という話も\n}\nint ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\n assert(!equals(y, 0));\n return ceil(x / y);\n // ceil(x) = floor(x + 1)\n}\nint perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\n assert(!equals(y, 0));\n if (x >= 0 && y > 0) return floor(x / y)+EPS;\n if (x >= 0 && y < 0) return -floor(x / fabs(y));\n if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\n return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n}\nld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\n // 未verify. 誤差対策TODO. -0.0が返りうる。\n assert(!equals(y, 0));\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\n return x - fabs(y)*floor(x, fabs(y));\n}\nint seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\nint modf(ld x) {\n\tif (x < 0) return ceill(x);\n\telse return floorl(x);\n}\n// 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\nint seisuu(int x, int y) {\n assert(y != 0);\n return x / y;\n}\nint seisuu(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return (int)(x / y);\n}\n\ntemplate <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\n return b;\n}\ntemplate <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\n return b;\n}\n\ntemplate <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; } return false;\n}\ntemplate <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; } return false;\n}\ntemplate <class T> T mid(T a, T b, T c) { // 誤差対策TODO\n return a + b + c - max({a, b, c}) - min({a, b, c});\n}\ntemplate <class T> void Sort(T &a, T &b, bool rev = false) { \n if (rev == false) { // TODO テンプレート引数\n if (a > b) swap(a, b);\n } else {\n if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void Sort(T &a, T &b, T &c, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (b > c) swap(b, c);\n } else {\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void Sort(T &a, T &b, T &c, T &d, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\n if (b > c) swap(b, c); if (b > d) swap(b, d); if (c > d) swap(c, d);\n } else {\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n\n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\nclass Compress {\npublic:\n int sz = 0;\n // gp_hash_table<int, int, custom_hash> Z, UZ;\n unordered_map<int, int> Z; // 元の値 -> 圧縮した値\n unordered_map<int, int> UZ; // 圧縮した値 -> 元の値\n\n Compress(const vector<int> &V, int base = 0) {\n this->sz = base;\n set<int> s(V.begin(), V.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {\n this->sz = base;\n vector<int> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<int> s(V3.begin(), V3.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {\n this->sz = base;\n vector<int> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<int> s(V4.begin(), V4.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2,\n const vector<int> &V3, const vector<int> &V4, int base = 0) {\n this->sz = base;\n vector<int> V5 = V1;\n V5.insert(V5.end(), V2.begin(), V2.end());\n V5.insert(V5.end(), V3.begin(), V3.end());\n V5.insert(V5.end(), V4.begin(), V4.end());\n set<int> s(V5.begin(), V5.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n vector<int> zip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[ret[i]];\n }\n return ret;\n }\n\n vector<int> unzip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = UZ[ret[i]];\n }\n return ret;\n }\n\n int size() { return sz; }\n\n int encode(int x) { return Z[x]; }\n int decode(int x) {\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\n return UZ[x];\n }\n};\n\nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n return true;\n\t}\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase( remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }), G.end());\n return G;\n }\nprivate:\n\tvector<int> par, sz;\n};\n\ntemplate<typename T>\nstruct BIT {\n int N; // 要素数\n vector<T> bit[2]; // データの格納先\n BIT(int N_, int x = 0) {\n N = N_ + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n if (x != 0) {\n for (int i = 0; i < N; i++) add(i, x);\n }\n }\n BIT(const vector<int> &A) {\n N = A.size() + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\n }\n void add_sub(int p, int i, T x) {\n while (i < N) { bit[p][i] += x; i += (i & -i); }\n }\n void add(int l, int r, T x) {\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\n }\n void add(int i, T x) { add(i, i + 1, x); }\n T sum_sub(int p, int i) {\n T ret = 0;\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\n return ret;\n }\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\n T sum(int l, int r) { return sum(r) - sum(l); }\n T get(int i) { return sum(i, i + 1); }\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\n};\n\n#pragma endregion\n\n// #define pb emplace_back\n// using ll = long long;\n// const int INF = 1 << 30;\n// const ll INFL = 1LL << 61;\n\nconst int Nmax = 500002, Qmax = 30002, NQmax = 530004, V = 25000005;\n\nint N, Q, A[Nmax], B[NQmax], sz; // 座圧列と座圧後のサイズ？\n\nstruct qry {\n int t, l, r, x, k;\n} query[Qmax];\n\nint v(int x) {\n return lower_bound(B + 1, B + sz + 1, x) - B;\n}\n\nvoid disc(int N, int Q) { // 座圧\n memcpy(B, A, sizeof A);\n\n // for (int i = 0; i < Q; i++) {\n // if (query[i].t != 2) B[++N] = query[i].x;\n // }\n\n sort(B + 1, B + N + 1);\n sz = unique(B + 1, B + N + 1) - B - 1;\n B[0] = -INF, B[sz + 1] = INF;\n}\n\nvector<int> rt(NQmax), xl(NQmax), xr(NQmax);\nint vl, vr;\nclass LOJ {\n class seg {\n int c;\n\n struct node {\n int l, r, x;\n } a[V];\n\n void up(int x) {\n a[x].x = a[a[x].l].x + a[a[x].r].x;\n }\n\n public:\n\n void add(int p, int x, int &X, int l = 1, int r = sz) {\n a[++c] = a[X], X = c;\n\n if (l == r) {\n a[X].x += x;\n return;\n }\n\n int m = l + r >> 1;\n p <= m ? add(p, x, a[X].l, l, m) : add(p, x, a[X].r, m + 1, r);\n up(X);\n }\n\n int rank(int x, int l = 1, int r = sz) {\n if (l == r) return 1;\n\n int m = l + r >> 1;\n\n if (x <= m) {\n for (int i = 1; i <= vl; i++) xl[i] = a[xl[i]].l;\n for (int i = 1; i <= vr; i++) xr[i] = a[xr[i]].l;\n\n return rank(x, l, m);\n } else {\n int t = 0;\n\n for (int i = 1; i <= vl; i++) t -= a[a[xl[i]].l].x, xl[i] = a[xl[i]].r;\n for (int i = 1; i <= vr; i++) t += a[a[xr[i]].l].x, xr[i] = a[xr[i]].r;\n\n return t + rank(x, m + 1, r);\n }\n }\n\n int kth_smallest(int x, int l = 1, int r = sz) {\n if (l == r)\n return l;\n\n int m = l + r >> 1, t = 0;\n\n for (int i = 1; i <= vl; i++) t -= a[a[xl[i]].l].x;\n for (int i = 1; i <= vr; i++) t += a[a[xr[i]].l].x;\n\n if (x <= t) {\n for (int i = 1; i <= vl; i++) xl[i] = a[xl[i]].l;\n for (int i = 1; i <= vr; i++) xr[i] = a[xr[i]].l;\n\n return kth_smallest(x, l, m);\n } else {\n for (int i = 1; i <= vl; i++) xl[i] = a[xl[i]].r;\n for (int i = 1; i <= vr; i++) xr[i] = a[xr[i]].r;\n\n return kth_smallest(x - t, m + 1, r);\n }\n }\n } s;\n\npublic:\n\n void add(int p1, int p2, int x) {\n for (int i = p1; i <= N; i += i & -i) s.add(p2, x, rt[i]);\n }\n\n void _X(int l, int r) {\n vl = vr = 0;\n\n for (int i = l - 1; i > 0; i &= i - 1) xl[++vl] = rt[i];\n\n for (int i = r; i > 0; i &= i - 1) xr[++vr] = rt[i];\n }\n\n int rank(int l, int r, int x) {\n _X(l, r);\n return s.rank(x);\n }\n\n int count(int l, int r, int x) { // 未verify\n return rank(l, r, x + 1) - rank(l, r, x);\n }\n\n int count(int l, int r, int a, int b) { // 未verify\n return rank(l, r, b) - rank(l, r, a);\n }\n\n int kth_smallest(int l, int r, int k) {\n // assert(0 <= k && k < r - l);\n _X(l, r);\n return s.kth_smallest(k);\n }\n\n int kth_largest(int l, int r, int k) { // 未verify\n return kth_smallest(l, r, r - l - k - 1);\n }\n\n // int get(int i) {\n // return kth_smallest(i, i + 1, 0);\n // return ;\n // }\n\n int prev_value(int l, int r, int x) {\n int t = rank(l, r, x) - 1;\n return t ? kth_smallest(l, r, t) : 0;\n }\n\n int next_value(int l, int r, int x) {\n int t = rank(l, r, x + 1);\n return t <= r - l + 1 ? kth_smallest(l, r, t) : sz + 1;\n }\n} seg;\n\nsigned main() {\n cin >> N;\n\n // Aの入力は1-indexed\n for (int i = 1; i <= N; i++) cin >> A[i];\n\n cin >> Q;\n\n // 区間は1-indexの閉区間\n for (int i = 0; i < Q; i++) {\n cin >> query[i].l >> query[i].r;\n }\n\n disc(N, Q);\n\n for (int i = 1; i <= N; i++) seg.add(i, v(A[i]), 1);\n\n tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> tr;\n int t = 0; // 初めの転倒数\n for (int i = N; i >= 1; i--) {\n tr.insert(A[i]);\n // A[i]未満の個数を逆順に加算していく\n t += tr.order_of_key(A[i]);\n }\n\n for (int i = 0; i < Q; i++) {\n t -= seg.count(query[i].l + 1, N, 0, A[query[i].l]);\n t -= seg.count(query[i].r + 1, N, 0, A[query[i].r]);\n\n t -= seg.count(query[i].l + 1, query[i].r, A[query[i].r] + 1, NQmax);\n\n int temp = A[query[i].l];\n\n seg.add(query[i].l, v(A[query[i].l]), -1);\n A[query[i].l] = A[query[i].r];\n seg.add(query[i].l, v(A[query[i].l]), 1);\n\n seg.add(query[i].r, v(A[query[i].r]), -1);\n A[query[i].r] = temp;\n seg.add(query[i].r, v(A[query[i].r]), 1);\n\n t += seg.count(query[i].l + 1, query[i].r, A[query[i].r] + 1, NQmax);\n\n t += seg.count(query[i].l + 1, N, 0, A[query[i].l]);\n t += seg.count(query[i].r + 1, N, 0, A[query[i].r]);\n\n cout << t << endl;\n }\n}", "accuracy": 0.7, "time_ms": 90, "memory_kb": 155616, "score_of_the_acc": -0.3401, "final_rank": 12 }, { "submission_id": "aoj_0451_9193212", "code_snippet": "#pragma region Macros\n\n// #pragma GCC optimize(\"O3,unroll-loops\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n\n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\n\n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n// #define unordered_map<int, int> gp_hash_table<int, int, custom_hash> \n\n#define sqrt __builtin_sqrtl\n#define cbrt __builtin_cbrtl\n#define hypot __builtin_hypotl\n\n#define next asdnext\n#define prev asdprev\n\nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\nconst int MOD = 998244353;\n// const int MOD = 1000000007;\n\nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n\n#define EC int\nstruct Edge {\n int from, to;\n EC cost;\n Edge() : from(-1), to(-1), cost(-1) {}\n Edge(int to, EC cost) : to(to), cost(cost) {}\n Edge(int from, int to, EC cost) : from(from), to(to), cost(cost) {}\n bool operator ==(const Edge& e) {\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\n }\n bool operator !=(const Edge& e) {\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\n }\n};\n\nchrono::system_clock::time_point start;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n\nrandom_device seed_gen;\nmt19937_64 rng(seed_gen());\nuniform_int_distribution<int> dist_x(0, 1e9);\nstruct RNG {\n unsigned Int(unsigned l, unsigned r) {\n return dist_x(rng) % (r - l + 1) + l;\n }\n ld Double() {\n return ld(dist_x(rng)) / 1e9;\n }\n} rnd;\n\nusing i64 = ll;\n// using i64 = uint64_t;\n// bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\ni64 lrmask(i64 l, i64 r) { return (1LL << r) - (1LL << l); }\ni64 sub_bit(i64 x, i64 l, i64 r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\ni64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\n\ni64 popcount(i64 x) { return __builtin_popcountll(x); }\ni64 popcount(i64 x, i64 l, i64 r) { return __builtin_popcountll(sub_bit(x, l, r)); }\ni64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); }\ni64 unpopcount(i64 x, i64 l, i64 r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); }\nbool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; } // xが負のときは常にfalse\nbool is_pow4(i64 x) { return __builtin_popcount(x) == 1 && __builtin_ctz(x) % 2 == 0; }\n\ni64 top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\ni64 bot_bit(i64 x) { return __builtin_ctzll(x);} // 2^kの位 (x > 0)\n// i64 next_bit(i64 x, i64 k) { return 0; }\n// i64 prev_bit(i64 x, i64 k) { return 0; }\n// i64 kth_bit(i64 x, i64 k) { return 0; }\ni64 MSB(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\ni64 LSB(i64 x) { return (x & -x); } // mask\n\ni64 countl_zero(i64 x) { return __builtin_clzll(x); }\ni64 countl_one(i64 x) {\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\n return ret;\n}\ni64 countr_zero(i64 x) { return __builtin_ctzll(x); } // x==0のとき64が返ることに注意\ni64 countr_one(i64 x) { i64 ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\n\ni64 floor_log2(i64 x) { if (x == 0) return 0; return 63 - __builtin_clzll(x); }\ni64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // MSBと同じ\ni64 ceil_log2(i64 x) { if (x == 0) return 0; return 64 - __builtin_clzll(x - 1); }\ni64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\n\ni64 rotl(i64 x, i64 k) { // 有効bit内でrotate. オーバーフロー注意\n i64 w = bit_width(x); k %= w;\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\ni64 rotr(i64 x, i64 k) {\n i64 w = bit_width(x); k %= w;\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\ni64 bit_reverse(i64 x) { // 有効bit内で左右反転\n i64 r = 0, w = bit_width(x);\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\n return r;\n}\n// i64 bit_reverse(i64 x, i64 l, i64 r) { return 0; }\n\nbool is_palindrome(i64 x) { return x == bit_reverse(x); }\nbool is_palindrome(i64 x, i64 l, i64 r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\ni64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\ni64 erase(i64 x, i64 l, i64 r) { return x>>r<<l | x&(1LL<<l - 1); } // [l, r) をカット\n\ni64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\ni64 hamming(i64 a, i64 b, i64 l, i64 r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\ni64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\ni64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\ni64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\n\ni64 next_combination(i64 x) {\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctzll(x) + 1));\n}\n\n\n__int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n}\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n}\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n if (x >= 0) return x % y;\n __int128_t ret = x % y; // (x < 0)\n ret += (__int128_t)abs(y) * INFL;\n ret %= abs(y);\n return ret;\n}\nint floor(int x, int y) { // (ld)x / y 以下の最大の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x >= 0 ? x / y : (x + 1) / y - 1;\n}\nint ceil(int x, int y) { // (ld)x / y 以上の最小の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x > 0 ? (x - 1) / y + 1 : x / y;\n}\nint round(int x, int y) {\n assert(y != 0);\n return (x * 2 + y) / (y * 2);\n}\nint round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\n assert(y != 0); // TODO\n return INF;\n}\nint round2(int x, int y) { // 五捨五超入 // 未verify\n assert(y != 0);\n if (y < 0) y = -y, x = -x;\n int z = z / y;\n if ((z * 2 + 1) * y <= y * 2) z++;\n return z;\n}\n// int round(ld x, int k) { // xを10^kの位に関して四捨五入\n// }\n// int floor(ld x, int k) { // xを10^kの位に関してflooring\n// }\n// int ceil(ld x, int k) { // xを10^kの位に関してceiling\n// }\n// int kth(int x, int y, int k) { // x / yの10^kの位の桁\n// }\nint floor(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return floor(x / y);\n // floor(x) = ceil(x - 1) という話も\n}\nint ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\n assert(!equals(y, 0));\n return ceil(x / y);\n // ceil(x) = floor(x + 1)\n}\nint perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\n assert(!equals(y, 0));\n if (x >= 0 && y > 0) return floor(x / y)+EPS;\n if (x >= 0 && y < 0) return -floor(x / fabs(y));\n if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\n return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n}\nld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\n // 未verify. 誤差対策TODO. -0.0が返りうる。\n assert(!equals(y, 0));\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\n return x - fabs(y)*floor(x, fabs(y));\n}\nint seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\nint modf(ld x) {\n\tif (x < 0) return ceill(x);\n\telse return floorl(x);\n}\n// 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\nint seisuu(int x, int y) {\n assert(y != 0);\n return x / y;\n}\nint seisuu(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return (int)(x / y);\n}\n\ntemplate <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\n return b;\n}\ntemplate <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\n return b;\n}\n\ntemplate <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; } return false;\n}\ntemplate <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; } return false;\n}\ntemplate <class T> T mid(T a, T b, T c) { // 誤差対策TODO\n return a + b + c - max({a, b, c}) - min({a, b, c});\n}\ntemplate <class T> void Sort(T &a, T &b, bool rev = false) { \n if (rev == false) { // TODO テンプレート引数\n if (a > b) swap(a, b);\n } else {\n if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void Sort(T &a, T &b, T &c, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (b > c) swap(b, c);\n } else {\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void Sort(T &a, T &b, T &c, T &d, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\n if (b > c) swap(b, c); if (b > d) swap(b, d); if (c > d) swap(c, d);\n } else {\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n\n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\nclass Compress {\npublic:\n int sz = 0;\n // gp_hash_table<int, int, custom_hash> Z, UZ;\n unordered_map<int, int> Z; // 元の値 -> 圧縮した値\n unordered_map<int, int> UZ; // 圧縮した値 -> 元の値\n\n Compress(const vector<int> &V, int base = 0) {\n this->sz = base;\n set<int> s(V.begin(), V.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {\n this->sz = base;\n vector<int> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<int> s(V3.begin(), V3.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {\n this->sz = base;\n vector<int> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<int> s(V4.begin(), V4.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2,\n const vector<int> &V3, const vector<int> &V4, int base = 0) {\n this->sz = base;\n vector<int> V5 = V1;\n V5.insert(V5.end(), V2.begin(), V2.end());\n V5.insert(V5.end(), V3.begin(), V3.end());\n V5.insert(V5.end(), V4.begin(), V4.end());\n set<int> s(V5.begin(), V5.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n vector<int> zip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[ret[i]];\n }\n return ret;\n }\n\n vector<int> unzip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = UZ[ret[i]];\n }\n return ret;\n }\n\n int size() { return sz; }\n\n int encode(int x) { return Z[x]; }\n int decode(int x) {\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\n return UZ[x];\n }\n};\n\nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n return true;\n\t}\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase( remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }), G.end());\n return G;\n }\nprivate:\n\tvector<int> par, sz;\n};\n\ntemplate<typename T>\nstruct BIT {\n int N; // 要素数\n vector<T> bit[2]; // データの格納先\n BIT(int N_, int x = 0) {\n N = N_ + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n if (x != 0) {\n for (int i = 0; i < N; i++) add(i, x);\n }\n }\n BIT(const vector<int> &A) {\n N = A.size() + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\n }\n void add_sub(int p, int i, T x) {\n while (i < N) { bit[p][i] += x; i += (i & -i); }\n }\n void add(int l, int r, T x) {\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\n }\n void add(int i, T x) { add(i, i + 1, x); }\n T sum_sub(int p, int i) {\n T ret = 0;\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\n return ret;\n }\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\n T sum(int l, int r) { return sum(r) - sum(l); }\n T get(int i) { return sum(i, i + 1); }\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\n};\n\n#pragma endregion\n\n// #define pb emplace_back\n// using ll = long long;\n// const int INF = 1 << 30;\n// const ll INFL = 1LL << 61;\n\nconst int Nmax = 500001, Qmax = 30001, NQmax = 530002, V = 2500005;\n\nint N, Q, A[Nmax], B[NQmax], sz; // 座圧列と座圧後のサイズ？\n\nstruct qry {\n int t, l, r, x, k;\n} query[Qmax];\n\nint v(int x) {\n return lower_bound(B + 1, B + sz + 1, x) - B;\n}\n\nvoid disc(int N, int Q) { // 座圧\n memcpy(B, A, sizeof A);\n\n // for (int i = 0; i < Q; i++) {\n // if (query[i].t != 2) B[++N] = query[i].x;\n // }\n\n sort(B + 1, B + N + 1);\n sz = unique(B + 1, B + N + 1) - B - 1;\n B[0] = -INF, B[sz + 1] = INF;\n}\n\nvector<int> rt(NQmax), xl(NQmax), xr(NQmax);\nint vl, vr;\nclass LOJ {\n class seg {\n int c;\n\n struct node {\n int l, r, x;\n } a[V];\n\n void up(int x) {\n a[x].x = a[a[x].l].x + a[a[x].r].x;\n }\n\n public:\n\n void add(int p, int x, int &X, int l = 1, int r = sz) {\n a[++c] = a[X], X = c;\n\n if (l == r) {\n a[X].x += x;\n return;\n }\n\n int m = l + r >> 1;\n p <= m ? add(p, x, a[X].l, l, m) : add(p, x, a[X].r, m + 1, r);\n up(X);\n }\n\n int rank(int x, int l = 1, int r = sz) {\n if (l == r) return 1;\n\n int m = l + r >> 1;\n\n if (x <= m) {\n for (int i = 1; i <= vl; i++) xl[i] = a[xl[i]].l;\n for (int i = 1; i <= vr; i++) xr[i] = a[xr[i]].l;\n\n return rank(x, l, m);\n } else {\n int t = 0;\n\n for (int i = 1; i <= vl; i++) t -= a[a[xl[i]].l].x, xl[i] = a[xl[i]].r;\n for (int i = 1; i <= vr; i++) t += a[a[xr[i]].l].x, xr[i] = a[xr[i]].r;\n\n return t + rank(x, m + 1, r);\n }\n }\n\n int kth_smallest(int x, int l = 1, int r = sz) {\n if (l == r)\n return l;\n\n int m = l + r >> 1, t = 0;\n\n for (int i = 1; i <= vl; i++) t -= a[a[xl[i]].l].x;\n for (int i = 1; i <= vr; i++) t += a[a[xr[i]].l].x;\n\n if (x <= t) {\n for (int i = 1; i <= vl; i++) xl[i] = a[xl[i]].l;\n for (int i = 1; i <= vr; i++) xr[i] = a[xr[i]].l;\n\n return kth_smallest(x, l, m);\n } else {\n for (int i = 1; i <= vl; i++) xl[i] = a[xl[i]].r;\n for (int i = 1; i <= vr; i++) xr[i] = a[xr[i]].r;\n\n return kth_smallest(x - t, m + 1, r);\n }\n }\n } s;\n\npublic:\n\n void add(int p1, int p2, int x) {\n for (int i = p1; i <= N; i += i & -i) s.add(p2, x, rt[i]);\n }\n\n void _X(int l, int r) {\n vl = vr = 0;\n\n for (int i = l - 1; i > 0; i &= i - 1) xl[++vl] = rt[i];\n\n for (int i = r; i > 0; i &= i - 1) xr[++vr] = rt[i];\n }\n\n int rank(int l, int r, int x) {\n _X(l, r);\n return s.rank(x);\n }\n\n int count(int l, int r, int x) { // 未verify\n return rank(l, r, x + 1) - rank(l, r, x);\n }\n\n int count(int l, int r, int a, int b) { // 未verify\n return rank(l, r, b) - rank(l, r, a);\n }\n\n int kth_smallest(int l, int r, int k) {\n // assert(0 <= k && k < r - l);\n _X(l, r);\n return s.kth_smallest(k);\n }\n\n int kth_largest(int l, int r, int k) { // 未verify\n return kth_smallest(l, r, r - l - k - 1);\n }\n\n // int get(int i) {\n // return kth_smallest(i, i + 1, 0);\n // return ;\n // }\n\n int prev_value(int l, int r, int x) {\n int t = rank(l, r, x) - 1;\n return t ? kth_smallest(l, r, t) : 0;\n }\n\n int next_value(int l, int r, int x) {\n int t = rank(l, r, x + 1);\n return t <= r - l + 1 ? kth_smallest(l, r, t) : sz + 1;\n }\n} seg;\n\nsigned main() {\n cin >> N;\n\n // Aの入力は1-indexed\n for (int i = 1; i <= N; i++) cin >> A[i];\n\n cin >> Q;\n\n // 区間は1-indexの閉区間\n for (int i = 0; i < Q; i++) {\n cin >> query[i].l >> query[i].r;\n }\n\n disc(N, Q);\n\n for (int i = 1; i <= N; i++) seg.add(i, v(A[i]), 1);\n\n tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> tr;\n int t = 0; // 初めの転倒数\n for (int i = N; i >= 1; i--) {\n tr.insert(A[i]);\n // A[i]未満の個数を逆順に加算していく\n t += tr.order_of_key(A[i]);\n }\n\n for (int i = 0; i < Q; i++) {\n t -= seg.count(query[i].l + 1, N, 0, A[query[i].l]);\n t -= seg.count(query[i].r + 1, N, 0, A[query[i].r]);\n\n t -= seg.count(query[i].l + 1, query[i].r, A[query[i].r] + 1, NQmax);\n\n int temp = A[query[i].l];\n\n seg.add(query[i].l, v(A[query[i].l]), -1);\n A[query[i].l] = A[query[i].r];\n seg.add(query[i].l, v(A[query[i].l]), 1);\n\n seg.add(query[i].r, v(A[query[i].r]), -1);\n A[query[i].r] = temp;\n seg.add(query[i].r, v(A[query[i].r]), 1);\n\n t += seg.count(query[i].l + 1, query[i].r, A[query[i].r] + 1, NQmax);\n\n t += seg.count(query[i].l + 1, N, 0, A[query[i].l]);\n t += seg.count(query[i].r + 1, N, 0, A[query[i].r]);\n\n cout << t << endl;\n }\n}", "accuracy": 0.65, "time_ms": 10, "memory_kb": 52484, "score_of_the_acc": -0.0979, "final_rank": 16 }, { "submission_id": "aoj_0451_9193206", "code_snippet": "#pragma region Macros\n\n// #pragma GCC optimize(\"O3,unroll-loops\")\n// #pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2\")\n\n#include <bits/extc++.h>\n// #include <atcoder/all>\n// using namespace atcoder;\nusing namespace std;\nusing namespace __gnu_pbds;\n\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// #include <boost/multiprecision/cpp_int.hpp>\n// namespace mp = boost::multiprecision;\n// using Bint = mp::cpp_int;\n// using Bdouble = mp::number<mp::cpp_dec_float<256>>;\n// Bdouble Beps = 0.00000000000000000000000000000001; // 1e-32\n// const bool equals(Bdouble a, Bdouble b) { return mp::fabs(a - b) < Beps; }\n\n#define pb emplace_back\n#define int ll\n#define endl '\\n'\n// #define unordered_map<int, int> gp_hash_table<int, int, custom_hash> \n\n#define sqrt __builtin_sqrtl\n#define cbrt __builtin_cbrtl\n#define hypot __builtin_hypotl\n\n#define next asdnext\n#define prev asdprev\n\nusing ll = long long;\nusing ld = long double;\nconst ld PI = acosl(-1);\nconst int INF = 1 << 30;\nconst ll INFL = 1LL << 61;\nconst int MOD = 998244353;\n// const int MOD = 1000000007;\n\nconst ld EPS = 1e-10;\nconst bool equals(ld a, ld b) { return fabs((a) - (b)) < EPS; }\n\nconst vector<int> dx = {0, 1, 0, -1, 1, 1, -1, -1}; // → ↓ ← ↑ ↘ ↙ ↖ ↗\nconst vector<int> dy = {1, 0, -1, 0, 1, -1, -1, 1};\n\n#define EC int\nstruct Edge {\n int from, to;\n EC cost;\n Edge() : from(-1), to(-1), cost(-1) {}\n Edge(int to, EC cost) : to(to), cost(cost) {}\n Edge(int from, int to, EC cost) : from(from), to(to), cost(cost) {}\n bool operator ==(const Edge& e) {\n return this->from == e.from && this->to == e.to && this->cost == e.cost;\n }\n bool operator !=(const Edge& e) {\n return this->from != e.from or this->to != e.to or this->cost != e.cost;\n }\n};\n\nchrono::system_clock::time_point start;\n__attribute__((constructor))\nvoid constructor() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(10);\n start = chrono::system_clock::now();\n}\n\nrandom_device seed_gen;\nmt19937_64 rng(seed_gen());\nuniform_int_distribution<int> dist_x(0, 1e9);\nstruct RNG {\n unsigned Int(unsigned l, unsigned r) {\n return dist_x(rng) % (r - l + 1) + l;\n }\n ld Double() {\n return ld(dist_x(rng)) / 1e9;\n }\n} rnd;\n\nusing i64 = ll;\n// using i64 = uint64_t;\n// bit演算, x==0の場合は例外処理した方がよさそう. 区間は [l, r)\ni64 lrmask(i64 l, i64 r) { return (1LL << r) - (1LL << l); }\ni64 sub_bit(i64 x, i64 l, i64 r) { i64 b = x & ((1LL << r) - (1LL << l)); return b >> l; } // r溢れ可\ni64 bit_width(i64 x) { return 64 - __builtin_clzll(x) + (x == 0); }\n\ni64 popcount(i64 x) { return __builtin_popcountll(x); }\ni64 popcount(i64 x, i64 l, i64 r) { return __builtin_popcountll(sub_bit(x, l, r)); }\ni64 unpopcount(i64 x) { return bit_width(x) - __builtin_popcountll(x); }\ni64 unpopcount(i64 x, i64 l, i64 r) { return r - l - __builtin_popcountll(sub_bit(x, l, r)); }\nbool is_pow2(i64 x) { return __builtin_popcountll(x) == 1; } // xが負のときは常にfalse\nbool is_pow4(i64 x) { return __builtin_popcount(x) == 1 && __builtin_ctz(x) % 2 == 0; }\n\ni64 top_bit(i64 x) { return 63 - __builtin_clzll(x);} // 2^kの位 (x > 0)\ni64 bot_bit(i64 x) { return __builtin_ctzll(x);} // 2^kの位 (x > 0)\n// i64 next_bit(i64 x, i64 k) { return 0; }\n// i64 prev_bit(i64 x, i64 k) { return 0; }\n// i64 kth_bit(i64 x, i64 k) { return 0; }\ni64 MSB(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // mask\ni64 LSB(i64 x) { return (x & -x); } // mask\n\ni64 countl_zero(i64 x) { return __builtin_clzll(x); }\ni64 countl_one(i64 x) {\n i64 ret = 0, k = 63 - __builtin_clzll(x);\n while (k != -1 && (x & (1LL << k))) { k--; ret++; }\n return ret;\n}\ni64 countr_zero(i64 x) { return __builtin_ctzll(x); } // x==0のとき64が返ることに注意\ni64 countr_one(i64 x) { i64 ret = 0; while (x & 1) { x >>= 1; ret++; } return ret; }\n\ni64 floor_log2(i64 x) { if (x == 0) return 0; return 63 - __builtin_clzll(x); }\ni64 bit_floor(i64 x) { if (x == 0) return 0; return 1LL << (63 - __builtin_clzll(x)); } // MSBと同じ\ni64 ceil_log2(i64 x) { if (x == 0) return 0; return 64 - __builtin_clzll(x - 1); }\ni64 bit_ceil(i64 x) { if (x == 0) return 0; return 1LL << (64 - __builtin_clzll(x - 1)); }\n\ni64 rotl(i64 x, i64 k) { // 有効bit内でrotate. オーバーフロー注意\n i64 w = bit_width(x); k %= w;\n return ((x << k) | (x >> (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotl(i64 x, i64 l, i64 m, i64 r) {}\ni64 rotr(i64 x, i64 k) {\n i64 w = bit_width(x); k %= w;\n return ((x >> k) | (x << (w - k))) & ((1LL << w) - 1);\n}\n// i64 rotr(i64 x, i64 l, i64 m, i64 r) {}\ni64 bit_reverse(i64 x) { // 有効bit内で左右反転\n i64 r = 0, w = bit_width(x);\n for (i64 i = 0; i < w; i++) r |= ((x >> i) & 1) << (w - i - 1);\n return r;\n}\n// i64 bit_reverse(i64 x, i64 l, i64 r) { return 0; }\n\nbool is_palindrome(i64 x) { return x == bit_reverse(x); }\nbool is_palindrome(i64 x, i64 l, i64 r) { i64 b = sub_bit(x, l, r); return b == bit_reverse(b); }\ni64 concat(i64 a, i64 b) { return (a << bit_width(b)) | b; } // オーバーフロー注意\ni64 erase(i64 x, i64 l, i64 r) { return x>>r<<l | x&(1LL<<l - 1); } // [l, r) をカット\n\ni64 hamming(i64 a, i64 b) { return __builtin_popcountll(a ^ b); }\ni64 hamming(i64 a, i64 b, i64 l, i64 r) { return __builtin_popcountll(sub_bit(a, l, r) ^ sub_bit(b, l, r)); }\ni64 compcount(i64 x) { return (__builtin_popcountll(x ^ (x >> 1)) + (x & 1)) / 2; }\ni64 compcount2(i64 x) { return compcount(x & (x >> 1)); } // 長さ2以上の連結成分の個数\ni64 adjacount(i64 x) { return __builtin_popcountll(x & (x >> 1)); } // 隣接する1のペアの個数\n\ni64 next_combination(i64 x) {\n i64 t = x | (x - 1); return (t + 1) | (((~t & -~t) - 1) >> (__builtin_ctzll(x) + 1));\n}\n\n\n__int128_t POW(__int128_t x, int n) {\n __int128_t ret = 1;\n assert(n >= 0);\n if (x == 1 or n == 0) ret = 1;\n else if (x == -1 && n % 2 == 0) ret = 1; \n else if (x == -1) ret = -1; \n else if (n % 2 == 0) {\n assert(x < INFL);\n ret = POW(x * x, n / 2);\n } else {\n assert(x < INFL);\n ret = x * POW(x, n - 1);\n }\n return ret;\n}\nint per(int x, int y) { // x = qy + r (0 <= r < y) を満たすq\n assert(y != 0);\n if (x >= 0 && y > 0) return x / y;\n if (x >= 0 && y < 0) return x / y - (x % y < 0);\n if (x < 0 && y < 0) return x / y + (x % y < 0);\n return x / y - (x % y < 0); // (x < 0 && y > 0) \n}\nint mod(int x, int y) { // x = qy + r (0 <= r < y) を満たすr\n assert(y != 0);\n if (x >= 0) return x % y;\n __int128_t ret = x % y; // (x < 0)\n ret += (__int128_t)abs(y) * INFL;\n ret %= abs(y);\n return ret;\n}\nint floor(int x, int y) { // (ld)x / y 以下の最大の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x >= 0 ? x / y : (x + 1) / y - 1;\n}\nint ceil(int x, int y) { // (ld)x / y 以上の最小の整数\n assert(y != 0);\n if (y < 0) x = -x, y = -y;\n return x > 0 ? (x - 1) / y + 1 : x / y;\n}\nint round(int x, int y) {\n assert(y != 0);\n return (x * 2 + y) / (y * 2);\n}\nint round(int x, int y, int k) { // (ld)(x/y)を10^kの位に関して四捨五入\n assert(y != 0); // TODO\n return INF;\n}\nint round2(int x, int y) { // 五捨五超入 // 未verify\n assert(y != 0);\n if (y < 0) y = -y, x = -x;\n int z = z / y;\n if ((z * 2 + 1) * y <= y * 2) z++;\n return z;\n}\n// int round(ld x, int k) { // xを10^kの位に関して四捨五入\n// }\n// int floor(ld x, int k) { // xを10^kの位に関してflooring\n// }\n// int ceil(ld x, int k) { // xを10^kの位に関してceiling\n// }\n// int kth(int x, int y, int k) { // x / yの10^kの位の桁\n// }\nint floor(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return floor(x / y);\n // floor(x) = ceil(x - 1) という話も\n}\nint ceil(ld x, ld y) { // 誤差対策TODO // ceil(p/q) = -floor(-(p/q))らしい\n assert(!equals(y, 0));\n return ceil(x / y);\n // ceil(x) = floor(x + 1)\n}\nint perl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす q\n // 未verify. 誤差対策TODO. EPS外してもいいかも。\n assert(!equals(y, 0));\n if (x >= 0 && y > 0) return floor(x / y)+EPS;\n if (x >= 0 && y < 0) return -floor(x / fabs(y));\n if (x < 0 && y < 0) return floor(x / y) + (x - floor(x/y)*y < -EPS);\n return floor(x / y) - (x - floor(x/y)*y < -EPS); // (x < 0 && y > 0) \n}\nld modl(ld x, ld y) { // x = qy + r (0 <= r < y, qは整数) を満たす r\n // 未verify. 誤差対策TODO. -0.0が返りうる。\n assert(!equals(y, 0));\n if (x >= 0) return x - fabs(y)*fabs(per(x, y));\n return x - fabs(y)*floor(x, fabs(y));\n}\nint seisuu(ld x) { return (int)x; } // 整数部分. 誤差対策TODO\nint modf(ld x) {\n\tif (x < 0) return ceill(x);\n\telse return floorl(x);\n}\n// 正なら+EPS, 負なら-EPSしてから、文字列に直して小数点以下を捨てる?\nint seisuu(int x, int y) {\n assert(y != 0);\n return x / y;\n}\nint seisuu(ld x, ld y) { // 誤差対策TODO\n assert(!equals(y, 0));\n return (int)(x / y);\n}\n\ntemplate <class T> pair<T, T> max(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first > b.first or a.first == b.first && a.second > b.second) return a;\n return b;\n}\ntemplate <class T> pair<T, T> min(const pair<T, T> &a, const pair<T, T> &b) {\n if (a.first < b.first or a.first == b.first && a.second < b.second) return a;\n return b;\n}\n\ntemplate <class T> bool chmax(T &a, const T& b) {\n if (a < b) { a = b; return true; } return false;\n}\ntemplate <class T> bool chmin(T &a, const T& b) {\n if (a > b) { a = b; return true; } return false;\n}\ntemplate <class T> T mid(T a, T b, T c) { // 誤差対策TODO\n return a + b + c - max({a, b, c}) - min({a, b, c});\n}\ntemplate <class T> void Sort(T &a, T &b, bool rev = false) { \n if (rev == false) { // TODO テンプレート引数\n if (a > b) swap(a, b);\n } else {\n if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void Sort(T &a, T &b, T &c, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (b > c) swap(b, c);\n } else {\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\ntemplate <class T> void Sort(T &a, T &b, T &c, T &d, bool rev = false) {\n if (rev == false) { \n if (a > b) swap(a, b); if (a > c) swap(a, c); if (a > d) swap(a, d);\n if (b > c) swap(b, c); if (b > d) swap(b, d); if (c > d) swap(c, d);\n } else {\n if (d > c) swap(d, c); if (d > b) swap(d, b); if (d > a) swap(d, a);\n if (c > b) swap(c, b); if (c > a) swap(c, a); if (b > a) swap(b, a);\n }\n}\n\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n\n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\nclass Compress {\npublic:\n int sz = 0;\n // gp_hash_table<int, int, custom_hash> Z, UZ;\n unordered_map<int, int> Z; // 元の値 -> 圧縮した値\n unordered_map<int, int> UZ; // 圧縮した値 -> 元の値\n\n Compress(const vector<int> &V, int base = 0) {\n this->sz = base;\n set<int> s(V.begin(), V.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n \n Compress(const vector<int> &V1, const vector<int> &V2, int base = 0) {\n this->sz = base;\n vector<int> V3 = V2;\n V3.insert(V3.end(), V1.begin(), V1.end());\n set<int> s(V3.begin(), V3.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2, const vector<int> &V3, int base = 0) {\n this->sz = base;\n vector<int> V4 = V1;\n V4.insert(V4.end(), V2.begin(), V2.end());\n V4.insert(V4.end(), V3.begin(), V3.end());\n set<int> s(V4.begin(), V4.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n Compress(const vector<int> &V1, const vector<int> &V2,\n const vector<int> &V3, const vector<int> &V4, int base = 0) {\n this->sz = base;\n vector<int> V5 = V1;\n V5.insert(V5.end(), V2.begin(), V2.end());\n V5.insert(V5.end(), V3.begin(), V3.end());\n V5.insert(V5.end(), V4.begin(), V4.end());\n set<int> s(V5.begin(), V5.end());\n\n for (int x : s) {\n this->Z[x] = this->sz;\n this->UZ[this->sz] = x;\n this->sz++;\n }\n }\n\n vector<int> zip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = Z[ret[i]];\n }\n return ret;\n }\n\n vector<int> unzip(const vector<int> &V) {\n vector<int> ret = V;\n for (int i = 0; i < (int)V.size(); i++) {\n ret[i] = UZ[ret[i]];\n }\n return ret;\n }\n\n int size() { return sz; }\n\n int encode(int x) { return Z[x]; }\n int decode(int x) {\n if (UZ.find(x) == UZ.end()) return -1; // xが元の配列に存在しないとき\n return UZ[x];\n }\n};\n\nclass UnionFind {\npublic:\n\tUnionFind() = default;\n UnionFind(int N) : par(N), sz(N, 1) {\n iota(par.begin(), par.end(), 0);\n }\n\tint root(int x) {\n\t\tif (par[x] == x) return x;\n\t\treturn (par[x] = root(par[x]));\n\t}\n\tbool unite(int x, int y) {\n\t\tint rx = root(x);\n\t\tint ry = root(y);\n if (rx == ry) return false;\n\t\tif (sz[rx] < sz[ry]) swap(rx, ry);\n\t\tsz[rx] += sz[ry];\n\t\tpar[ry] = rx;\n return true;\n\t}\n\tbool issame(int x, int y) { return (root(x) == root(y)); }\n\tint size(int x) { return sz[root(x)]; }\n vector<vector<int>> groups(int N) {\n vector<vector<int>> G(N);\n for (int x = 0; x < N; x++) {\n G[root(x)].push_back(x);\n }\n\t\tG.erase( remove_if(G.begin(), G.end(),\n [&](const vector<int>& V) { return V.empty(); }), G.end());\n return G;\n }\nprivate:\n\tvector<int> par, sz;\n};\n\ntemplate<typename T>\nstruct BIT {\n int N; // 要素数\n vector<T> bit[2]; // データの格納先\n BIT(int N_, int x = 0) {\n N = N_ + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n if (x != 0) {\n for (int i = 0; i < N; i++) add(i, x);\n }\n }\n BIT(const vector<int> &A) {\n N = A.size() + 1;\n bit[0].assign(N, 0); bit[1].assign(N, 0);\n for (int i = 0; i < (int)A.size(); i++) add(i, A[i]);\n }\n void add_sub(int p, int i, T x) {\n while (i < N) { bit[p][i] += x; i += (i & -i); }\n }\n void add(int l, int r, T x) {\n add_sub(0, l + 1, -x * l); add_sub(0, r + 1, x * r);\n add_sub(1, l + 1, x); add_sub(1, r + 1, -x);\n }\n void add(int i, T x) { add(i, i + 1, x); }\n T sum_sub(int p, int i) {\n T ret = 0;\n while (i > 0) { ret += bit[p][i]; i -= (i & -i); }\n return ret;\n }\n T sum(int i) { return sum_sub(0, i) + sum_sub(1, i) * i; }\n T sum(int l, int r) { return sum(r) - sum(l); }\n T get(int i) { return sum(i, i + 1); }\n void set(int i, T x) { T s = get(i); add(i, -s + x); }\n};\n\n#pragma endregion\n\n// #define pb emplace_back\n// using ll = long long;\n// const int INF = 1 << 30;\n// const ll INFL = 1LL << 61;\n\nconst int Nmax = 500001, Qmax = 30001, NQmax = 530002, V = 25000005;\n\nint N, Q, A[Nmax], B[NQmax], sz; // 座圧列と座圧後のサイズ？\n\nstruct qry {\n int t, l, r, x, k;\n} query[Qmax];\n\nint v(int x) {\n return lower_bound(B + 1, B + sz + 1, x) - B;\n}\n\nvoid disc(int N, int Q) { // 座圧\n memcpy(B, A, sizeof A);\n\n // for (int i = 0; i < Q; i++) {\n // if (query[i].t != 2) B[++N] = query[i].x;\n // }\n\n sort(B + 1, B + N + 1);\n sz = unique(B + 1, B + N + 1) - B - 1;\n B[0] = -INF, B[sz + 1] = INF;\n}\n\nvector<int> rt(NQmax), xl(NQmax), xr(NQmax);\nint vl, vr;\nclass LOJ {\n class seg {\n int c;\n\n struct node {\n int l, r, x;\n } a[V];\n\n void up(int x) {\n a[x].x = a[a[x].l].x + a[a[x].r].x;\n }\n\n public:\n\n void add(int p, int x, int &X, int l = 1, int r = sz) {\n a[++c] = a[X], X = c;\n\n if (l == r) {\n a[X].x += x;\n return;\n }\n\n int m = l + r >> 1;\n p <= m ? add(p, x, a[X].l, l, m) : add(p, x, a[X].r, m + 1, r);\n up(X);\n }\n\n int rank(int x, int l = 1, int r = sz) {\n if (l == r) return 1;\n\n int m = l + r >> 1;\n\n if (x <= m) {\n for (int i = 1; i <= vl; i++) xl[i] = a[xl[i]].l;\n for (int i = 1; i <= vr; i++) xr[i] = a[xr[i]].l;\n\n return rank(x, l, m);\n } else {\n int t = 0;\n\n for (int i = 1; i <= vl; i++) t -= a[a[xl[i]].l].x, xl[i] = a[xl[i]].r;\n for (int i = 1; i <= vr; i++) t += a[a[xr[i]].l].x, xr[i] = a[xr[i]].r;\n\n return t + rank(x, m + 1, r);\n }\n }\n\n int kth_smallest(int x, int l = 1, int r = sz) {\n if (l == r)\n return l;\n\n int m = l + r >> 1, t = 0;\n\n for (int i = 1; i <= vl; i++) t -= a[a[xl[i]].l].x;\n for (int i = 1; i <= vr; i++) t += a[a[xr[i]].l].x;\n\n if (x <= t) {\n for (int i = 1; i <= vl; i++) xl[i] = a[xl[i]].l;\n for (int i = 1; i <= vr; i++) xr[i] = a[xr[i]].l;\n\n return kth_smallest(x, l, m);\n } else {\n for (int i = 1; i <= vl; i++) xl[i] = a[xl[i]].r;\n for (int i = 1; i <= vr; i++) xr[i] = a[xr[i]].r;\n\n return kth_smallest(x - t, m + 1, r);\n }\n }\n } s;\n\npublic:\n\n void add(int p1, int p2, int x) {\n for (int i = p1; i <= N; i += i & -i) s.add(p2, x, rt[i]);\n }\n\n void _X(int l, int r) {\n vl = vr = 0;\n\n for (int i = l - 1; i > 0; i &= i - 1) xl[++vl] = rt[i];\n\n for (int i = r; i > 0; i &= i - 1) xr[++vr] = rt[i];\n }\n\n int rank(int l, int r, int x) {\n _X(l, r);\n return s.rank(x);\n }\n\n int count(int l, int r, int x) { // 未verify\n return rank(l, r, x + 1) - rank(l, r, x);\n }\n\n int count(int l, int r, int a, int b) { // 未verify\n return rank(l, r, b) - rank(l, r, a);\n }\n\n int kth_smallest(int l, int r, int k) {\n // assert(0 <= k && k < r - l);\n _X(l, r);\n return s.kth_smallest(k);\n }\n\n int kth_largest(int l, int r, int k) { // 未verify\n return kth_smallest(l, r, r - l - k - 1);\n }\n\n // int get(int i) {\n // return kth_smallest(i, i + 1, 0);\n // return ;\n // }\n\n int prev_value(int l, int r, int x) {\n int t = rank(l, r, x) - 1;\n return t ? kth_smallest(l, r, t) : 0;\n }\n\n int next_value(int l, int r, int x) {\n int t = rank(l, r, x + 1);\n return t <= r - l + 1 ? kth_smallest(l, r, t) : sz + 1;\n }\n} seg;\n\nsigned main() {\n cin >> N;\n\n // Aの入力は1-indexed\n for (int i = 1; i <= N; i++) cin >> A[i];\n\n cin >> Q;\n\n // 区間は1-indexの閉区間\n for (int i = 0; i < Q; i++) {\n cin >> query[i].l >> query[i].r;\n }\n\n disc(N, Q);\n\n for (int i = 1; i <= N; i++) seg.add(i, v(A[i]), 1);\n\n tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> tr;\n int t = 0; // 初めの転倒数\n for (int i = N; i >= 1; i--) {\n tr.insert(A[i]);\n // A[i]未満の個数を逆順に加算していく\n t += tr.order_of_key(A[i]);\n }\n\n for (int i = 0; i < Q; i++) {\n t -= seg.count(query[i].l + 1, N, 0, A[query[i].l]);\n t -= seg.count(query[i].r + 1, N, 0, A[query[i].r]);\n\n t -= seg.count(query[i].l + 1, query[i].r, A[query[i].r] + 1, NQmax);\n\n int temp = A[query[i].l];\n\n seg.add(query[i].l, v(A[query[i].l]), -1);\n A[query[i].l] = A[query[i].r];\n seg.add(query[i].l, v(A[query[i].l]), 1);\n\n seg.add(query[i].r, v(A[query[i].r]), -1);\n A[query[i].r] = temp;\n seg.add(query[i].r, v(A[query[i].r]), 1);\n\n t += seg.count(query[i].l + 1, query[i].r, A[query[i].r] + 1, NQmax);\n\n t += seg.count(query[i].l + 1, N, 0, A[query[i].l]);\n t += seg.count(query[i].r + 1, N, 0, A[query[i].r]);\n\n cout << t << endl;\n }\n}", "accuracy": 0.7, "time_ms": 100, "memory_kb": 155492, "score_of_the_acc": -0.3443, "final_rank": 13 }, { "submission_id": "aoj_0451_8828028", "code_snippet": "#include <bits/stdc++.h>\n\nstruct Compressor {\n std::vector<int> data;\n Compressor() {}\n void add(int value) {\n data.push_back(value);\n }\n void build() {\n std::sort(data.begin(), data.end());\n data.erase(std::unique(data.begin(), data.end()), data.end());\n }\n int size() {\n return data.size();\n }\n int compress(int value) {\n return std::lower_bound(data.begin(), data.end(), value) - data.begin();\n }\n int operator[](int value) {\n return std::lower_bound(data.begin(), data.end(), value) - data.begin();\n }\n};\n\nstruct BIT {\n int n;\n std::vector<int> data;\n BIT() {}\n BIT(int n): n(n), data(n + 1) {}\n void insert(int key) {\n for (key++; key <= n; key += key & -key) {\n data[key]++;\n }\n }\n void erase(int key) {\n for (key++; key <= n; key += key & -key) {\n data[key]--;\n }\n }\n int sum(int upper) {\n int res = 0;\n for (; upper > 0; upper -= upper & -upper) {\n res += data[upper];\n }\n return res;\n }\n int sum(int lower, int upper) {\n return sum(upper) - sum(lower);\n }\n};\n\nint main() {\n std::cin.tie(0)->sync_with_stdio(0);\n int n;\n std::cin >> n;\n std::vector<int> a(n);\n for (int i = 0; i < n; i++) std::cin >> a[i];\n {\n auto b = a;\n std::sort(b.begin(), b.end());\n for (int i = 0; i < n; i++) {\n a[i] = std::distance(b.begin(), std::lower_bound(b.begin(), b.end(), a[i]));\n }\n }\n\n const int B = 3500;\n const int bucket_num = (n + B - 1) / B;\n std::vector<Compressor> compressor(bucket_num);\n for (int i = 0; i < n; i++) {\n compressor[i / B].add(a[i]);\n }\n\n int m;\n std::cin >> m;\n std::vector<std::pair<int, int>> query;\n query.reserve(m);\n {\n auto b = a;\n for (int i = 0; i < m; i++) {\n int u, v;\n std::cin >> u >> v;\n u--;\n v--;\n query.emplace_back(u, v);\n std::swap(b[u], b[v]);\n compressor[u / B].add(b[u]);\n compressor[v / B].add(b[v]);\n }\n }\n for (int i = 0; i < bucket_num; i++) {\n compressor[i].build();\n }\n\n std::vector<BIT> bucket(bucket_num);\n for (int i = 0; i < bucket_num; i++) {\n bucket[i] = BIT(compressor[i].size());\n }\n for (int i = 0; i < n; i++) {\n bucket[i / B].insert(compressor[i / B][a[i]]);\n }\n long long ans = 0;\n {\n BIT bit(n);\n for (int i = 0; i < n; i++) {\n ans += bit.sum(a[i], n);\n bit.insert(a[i]);\n }\n }\n\n auto contribute = [&](int u) {\n const int offset = (u / B) * B;\n long long res = 0;\n for (int i = 0; i < u / B; i++) {\n res += bucket[i].sum(compressor[i][a[u]], compressor[i][n]);\n }\n for (int i = offset, right = std::min(offset + B, n); i < right; i++) {\n if (i < u && a[i] > a[u])\n res++;\n else if (i > u && a[i] < a[u])\n res++;\n }\n for (int i = (offset / B) + 1; i < bucket_num; i++) {\n res += bucket[i].sum(compressor[i][a[u]]);\n }\n return res;\n };\n\n for (int i = 0; i < m; i++) {\n auto [u, v] = query[i];\n\n ans -= contribute(u) + contribute(v);\n if (a[u] > a[v]) ans++;\n bucket[u / B].erase(compressor[u / B][a[u]]);\n bucket[v / B].erase(compressor[v / B][a[v]]);\n bucket[u / B].insert(compressor[u / B][a[v]]);\n bucket[v / B].insert(compressor[v / B][a[u]]);\n std::swap(a[u], a[v]);\n ans += contribute(u) + contribute(v);\n if (a[u] > a[v]) ans--;\n std::cout << ans << '\\n';\n }\n}", "accuracy": 1, "time_ms": 2280, "memory_kb": 12024, "score_of_the_acc": -1.0167, "final_rank": 7 }, { "submission_id": "aoj_0451_8827871", "code_snippet": "#include <bits/stdc++.h>\n\nint n;\n\nstruct Node;\nusing NodePtr = Node*;\nstruct Node {\n NodePtr left = nullptr;\n NodePtr right = nullptr;\n int value = 0;\n};\n\nstruct NodeManager {\n static constexpr int N = 1000000;\n int pos = 0;\n std::array<Node, N> nodes;\n NodeManager() {}\n bool limit() {\n return N - pos < 20000;\n }\n void init() {\n for (int i = 0; i < pos; i++) {\n nodes[i].left = nullptr;\n nodes[i].right = nullptr;\n nodes[i].value = 0;\n }\n pos = 0;\n }\n NodePtr make_node() {\n return &nodes[pos++];\n }\n NodePtr make_node(NodePtr node) {\n nodes[pos].left = node->left;\n nodes[pos].right = node->right;\n nodes[pos].value = node->value;\n return &nodes[pos++];\n }\n};\nNodeManager NM;\n\nNodePtr insert(NodePtr root, int key) {\n NodePtr result = NM.make_node(root);\n NodePtr node = result;\n int left = 0;\n int right = n;\n while (right - left > 1) {\n assert(node);\n node->value++;\n int mid = (left + right) / 2;\n if (left <= key && key < mid) {\n if (node->left) {\n node->left = NM.make_node(node->left);\n } else {\n node->left = NM.make_node();\n }\n node = node->left;\n right = mid;\n } else {\n if (node->right) {\n node->right = NM.make_node(node->right);\n } else {\n node->right = NM.make_node();\n }\n node = node->right;\n left = mid;\n }\n }\n assert(key == left);\n // assert(node->value == 0);\n node->value++;\n return result;\n}\n\nNodePtr erase(NodePtr root, int key) {\n NodePtr result = NM.make_node(root);\n NodePtr node = result;\n int left = 0;\n int right = n;\n while (right - left > 1) {\n assert(node);\n // assert(node->value > 0);\n node->value--;\n int mid = (left + right) / 2;\n if (left <= key && key < mid) {\n if (node->left) {\n node->left = NM.make_node(node->left);\n } else {\n node->left = NM.make_node();\n }\n node = node->left;\n right = mid;\n } else {\n if (node->right) {\n node->right = NM.make_node(node->right);\n } else {\n node->right = NM.make_node();\n }\n node = node->right;\n left = mid;\n }\n }\n assert(key == left);\n // assert(node->value == 1);\n node->value--;\n return result;\n}\n\nint prod(NodePtr root, int left, int right) {\n auto dfs = [&](auto self, NodePtr node, int l, int r) -> int {\n if (!node) return 0;\n if (left <= l && r <= right) {\n return node->value;\n } else if (r <= left || right <= l) {\n return 0;\n } else {\n int m = (l + r) / 2;\n return self(self, node->left, l, m) + self(self, node->right, m, r);\n }\n };\n return dfs(dfs, root, 0, n);\n}\n\nint main() {\n std::cin >> n;\n std::vector<int> a(n);\n for (int i = 0; i < n; i++) std::cin >> a[i];\n {\n auto b = a;\n std::sort(b.begin(), b.end());\n for (int i = 0; i < n; i++) {\n a[i] = std::distance(b.begin(), std::lower_bound(b.begin(), b.end(), a[i]));\n }\n }\n\n\n int q;\n std::cin >> q;\n std::vector<std::tuple<int, int, int, int>> query;\n query.reserve(q);\n {\n auto b = a;\n for (int i = 0; i < q; i++) {\n int u, v;\n std::cin >> u >> v;\n u--; v--;\n query.emplace_back(u, v, b[u], b[v]);\n std::swap(b[u], b[v]);\n }\n }\n\n std::vector<NodePtr> roots(n);\n auto init = [&](int t) {\n NM.init();\n roots[0] = NM.make_node();\n for (int i = 0; i + 1 < n; i++) {\n roots[i + 1] = insert(roots[i], a[i]);\n }\n long long inv = 0;\n for (int i = 0; i < n; i++) {\n inv += prod(roots[i], a[i], n);\n }\n return inv;\n };\n\n const int B = 500;\n // 次に処理すべきクエリ番号\n std::vector<int> last_update(n);\n long long ans = 0;\n for (int t = 0; t < q; t++) {\n if (t % B == 0 || NM.limit()) {\n ans = init(t);\n last_update.assign(n, t);\n }\n auto [u, v, lv, rv] = query[t];\n\n // 1. 遅延していたswap処理を行う\n for (auto i: {u, v}) {\n for (; last_update[i] < t; last_update[i]++) {\n int cur = last_update[i];\n auto [p, q, lhs, rhs] = query[cur];\n if (p < i) {\n roots[i] = insert(erase(roots[i], lhs), rhs);\n }\n if (q < i) {\n roots[i] = insert(erase(roots[i], rhs), lhs);\n }\n }\n }\n\n auto contribute = [&](int pos) {\n int left_large = prod(roots[pos], a[pos], n);\n int left_small = (pos - left_large);\n int right_small = a[pos] - left_small;\n return left_large + right_small;\n };\n\n // 2. 寄与を削除\n ans -= contribute(u) + contribute(v);\n if (a[u] > a[v]) ans++;\n\n // 3. swap, swapによる寄与を追加\n std::swap(a[u], a[v]);\n ans += contribute(u);\n roots[v] = insert(erase(roots[v], lv), rv);\n ans += contribute(v);\n if (a[u] > a[v]) ans--;\n\n last_update[u] = t + 1;\n last_update[v] = t + 1;\n assert(a[u] == rv);\n assert(a[v] == lv);\n\n std::cout << ans << '\\n';\n }\n}", "accuracy": 0.7, "time_ms": 430, "memory_kb": 26924, "score_of_the_acc": -0.2316, "final_rank": 11 }, { "submission_id": "aoj_0451_8827853", "code_snippet": "#include <bits/stdc++.h>\n\nint n;\n\nstruct Node;\nusing NodePtr = Node*;\nstruct Node {\n NodePtr left = nullptr;\n NodePtr right = nullptr;\n int value = 0;\n};\n\nstruct NodeManager {\n static constexpr int N = 200000;\n int pos = 0;\n std::array<Node, N> nodes;\n NodeManager() {}\n bool limit() {\n return N - pos < 10000;\n }\n void init() {\n for (int i = 0; i < pos; i++) {\n nodes[i].left = nullptr;\n nodes[i].right = nullptr;\n nodes[i].value = 0;\n }\n pos = 0;\n }\n NodePtr make_node() {\n return &nodes[pos++];\n }\n NodePtr make_node(NodePtr node) {\n nodes[pos].left = node->left;\n nodes[pos].right = node->right;\n nodes[pos].value = node->value;\n return &nodes[pos++];\n }\n};\nNodeManager NM;\n\nNodePtr insert(NodePtr root, int key) {\n NodePtr result = NM.make_node(root);\n NodePtr node = result;\n int left = 0;\n int right = n;\n while (right - left > 1) {\n assert(node);\n node->value++;\n int mid = (left + right) / 2;\n if (left <= key && key < mid) {\n if (node->left) {\n node->left = NM.make_node(node->left);\n } else {\n node->left = NM.make_node();\n }\n node = node->left;\n right = mid;\n } else {\n if (node->right) {\n node->right = NM.make_node(node->right);\n } else {\n node->right = NM.make_node();\n }\n node = node->right;\n left = mid;\n }\n }\n assert(key == left);\n // assert(node->value == 0);\n node->value++;\n return result;\n}\n\nNodePtr erase(NodePtr root, int key) {\n NodePtr result = NM.make_node(root);\n NodePtr node = result;\n int left = 0;\n int right = n;\n while (right - left > 1) {\n assert(node);\n // assert(node->value > 0);\n node->value--;\n int mid = (left + right) / 2;\n if (left <= key && key < mid) {\n if (node->left) {\n node->left = NM.make_node(node->left);\n } else {\n node->left = NM.make_node();\n }\n node = node->left;\n right = mid;\n } else {\n if (node->right) {\n node->right = NM.make_node(node->right);\n } else {\n node->right = NM.make_node();\n }\n node = node->right;\n left = mid;\n }\n }\n assert(key == left);\n // assert(node->value == 1);\n node->value--;\n return result;\n}\n\nint prod(NodePtr root, int left, int right) {\n auto dfs = [&](auto self, NodePtr node, int l, int r) -> int {\n if (!node) return 0;\n if (left <= l && r <= right) {\n return node->value;\n } else if (r <= left || right <= l) {\n return 0;\n } else {\n int m = (l + r) / 2;\n return self(self, node->left, l, m) + self(self, node->right, m, r);\n }\n };\n return dfs(dfs, root, 0, n);\n}\n\nint main() {\n std::cin >> n;\n std::vector<int> a(n);\n for (int i = 0; i < n; i++) std::cin >> a[i];\n {\n auto b = a;\n std::sort(b.begin(), b.end());\n for (int i = 0; i < n; i++) {\n a[i] = std::distance(b.begin(), std::lower_bound(b.begin(), b.end(), a[i]));\n }\n }\n\n\n int q;\n std::cin >> q;\n std::vector<std::tuple<int, int, int, int>> query;\n query.reserve(q);\n {\n auto b = a;\n for (int i = 0; i < q; i++) {\n int u, v;\n std::cin >> u >> v;\n u--; v--;\n query.emplace_back(u, v, b[u], b[v]);\n std::swap(b[u], b[v]);\n }\n }\n\n std::vector<NodePtr> roots(n);\n auto init = [&]() {\n NM.init();\n roots[0] = NM.make_node();\n for (int i = 0; i + 1 < n; i++) {\n roots[i + 1] = insert(roots[i], a[i]);\n }\n long long inv = 0;\n for (int i = 0; i < n; i++) {\n inv += prod(roots[i], a[i], n);\n }\n return inv;\n };\n\n const int B = 1000;\n // 次に処理すべきクエリ番号\n std::vector<int> last_update(n);\n long long ans = 0;\n for (int t = 0; t < q; t++) {\n if (t % B == 0 || NM.limit()) {\n ans = init();\n last_update.assign(n, t);\n }\n auto [u, v, lv, rv] = query[t];\n\n // 1. 遅延していたswap処理を行う\n for (auto i: {u, v}) {\n for (; last_update[i] < t; last_update[i]++) {\n int cur = last_update[i];\n auto [p, q, lhs, rhs] = query[cur];\n if (p < i) {\n roots[i] = insert(erase(roots[i], lhs), rhs);\n }\n if (q < i) {\n roots[i] = insert(erase(roots[i], rhs), lhs);\n }\n }\n }\n\n auto contribute = [&](int pos) {\n int left_large = prod(roots[pos], a[pos], n);\n int left_small = (pos - left_large);\n int right_small = a[pos] - left_small;\n return left_large + right_small;\n };\n\n // 2. 寄与を削除\n ans -= contribute(u) + contribute(v);\n if (a[u] > a[v]) ans++;\n\n // 3. swap, swapによる寄与を追加\n std::swap(a[u], a[v]);\n ans += contribute(u);\n roots[v] = insert(erase(roots[v], lv), rv);\n ans += contribute(v);\n if (a[u] > a[v]) ans--;\n\n last_update[u] = t + 1;\n last_update[v] = t + 1;\n assert(a[u] == rv);\n assert(a[v] == lv);\n\n std::cout << ans << '\\n';\n }\n}", "accuracy": 0.7, "time_ms": 1560, "memory_kb": 8320, "score_of_the_acc": -0.692, "final_rank": 15 }, { "submission_id": "aoj_0451_8074403", "code_snippet": "#include<bits/stdc++.h>\n#define overload(a,b,c,d,...) d\n#define rep1(a) for(ll _=0;_<a;++_)\n#define rep2(i,a) for(ll i=0;i<a;++i)\n#define rep3(i,a,b) for(ll i=a;i<b;++i)\n#define rep(...) overload(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(i,a) for(ll i=(ll)a-1;i>=0;--i)\n#define rrep2(i,a,b) for(ll i=(ll)b-1;i>=(ll)a;--i)\n#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)\n#define all(x) x.begin(),x.end()\n#define rall(x) x.rbegin(),x.rend()\n#define eb emplace_back\n#define pb push_back\nusing namespace std;\nusing ll=long long;\nusing ull=unsigned long long;\nusing ld=long double;\ntemplate<typename T,typename U>inline bool chmin(T&a,const U&b){return (a>b?a=b,true:false);}\ntemplate<typename T,typename U>inline bool chmax(T&a,const U&b){return (a<b?a=b,true:false);}\nstatic constexpr ll inf=numeric_limits<ll>::max()/2;\n/*\nll calc(ll x1,ll y1,ll x2,ll y2,ll x3,ll y3){\n return abs((x1-x3)*(y2-y3)-(x2-x3)*(y1-y3));\n}\nint main(){\n ll n;cin>>n;\n vector<ll>x(n),y(n);\n rep(i,n)cin>>x[i]>>y[i];\n ll area=0;\n rep(i,1,n-1){\n area+=calc(x[0],y[0],x[i],y[i],x[i+1],y[i+1]);\n }\n ll l=0,r=2;\n ll now=calc(x[0],y[0],x[1],y[1],x[2],y[2]);\n ll ans=abs(area-now*2);\n while(l<n){\n if(now>area/2){\n chmin(ans,abs(area-now*2));\n now-=calc(x[l],y[l],x[(l+1)%n],y[(l+1)%n],x[r],y[r]);\n l++;\n l%=n;\n if((r-l+n)%3==1){\n now+=calc(x[l],y[l],x[r],y[r],x[(r+1)%n],y[(r+1)%n]);\n r++;\n r%=n;\n }\n if(l==0)break;\n }\n chmin(ans,abs(area-now*2));\n now+=calc(x[l],y[l],x[r],y[r],x[(r+1)%n],y[(r+1)%n]);\n r++;\n r%=n;\n }\n cout<<fixed<<setprecision(12)<<ans/2.0<<endl;\n}*/\nstruct BIT{\n private:\n int n;\n vector<int>bit;\n public:\n BIT(int n_):n(n_),bit(n_+1){}\n void add(int i,ll x){\n i++;\n while(i<=n){\n bit[i]+=x;\n i+=i&-i;\n }\n }\n int sum(int k)const{\n ll res=0;\n while(k){\n res+=bit[k];\n k-=k&-k;\n }\n return res;\n }\n int sum(int l,int r)const{return sum(r)-sum(l);}\n};\nstatic constexpr ll block_size=2000;\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n ll n;cin>>n;\n vector<ll>a(n);\n for(auto&e:a)cin>>e;\n auto b=a;\n sort(all(b));\n b.erase(unique(all(b)),b.end());\n //cout<<b.size()<<endl;\n rep(i,n)a[i]=lower_bound(all(b),a[i])-b.begin();\n vector<BIT>vec((n+block_size-1)/block_size,BIT(b.size()));\n BIT bit(b.size());\n ll ans=0;\n rep(i,n){\n ans+=bit.sum(a[i]+1,b.size());\n bit.add(a[i],1);\n ll now=i/block_size;\n vec[now].add(a[i],1);\n }\n ll m;cin>>m;\n rep(i,m){\n ll l,r;cin>>l>>r;\n l--,r--;\n ll now=l/block_size;\n rep(j,now){\n ans-=vec[j].sum(a[l]+1,b.size());\n ans+=vec[j].sum(a[r]+1,b.size());\n }\n rep(j,now*block_size,l){\n if(a[j]>a[l])ans--;\n if(a[j]>a[r])ans++;\n }\n rep(j,l+1,min(n,(now+1)*block_size)){\n if(a[j]<a[l])ans--;\n if(a[j]<a[r])ans++;\n }\n rep(j,now+1,vec.size()){\n ans-=vec[j].sum(a[l]);\n ans+=vec[j].sum(a[r]);\n }\n //cerr<<ans<<endl;\n vec[now].add(a[l],-1);\n vec[now].add(a[r],1);\n ll tmpl=a[l],tmpr=a[r];\n a[l]=tmpr;\n now=r/block_size;\n rep(j,now){\n ans-=vec[j].sum(a[r]+1,b.size());\n ans+=vec[j].sum(tmpl+1,b.size());\n }\n rep(j,now*block_size,r){\n if(a[j]>a[r])ans--;\n if(a[j]>tmpl)ans++;\n }\n rep(j,r+1,min(n,(now+1)*block_size)){\n if(a[j]<a[r])ans--;\n if(a[j]<tmpl)ans++;\n }\n rep(j,now+1,vec.size()){\n ans-=vec[j].sum(a[r]);\n ans+=vec[j].sum(tmpl);\n }\n vec[now].add(a[r],-1);\n vec[now].add(tmpl,1);\n a[r]=tmpl;\n cout<<ans<<endl;\n }\n}", "accuracy": 1, "time_ms": 2100, "memory_kb": 501920, "score_of_the_acc": -1.9207, "final_rank": 9 }, { "submission_id": "aoj_0451_6022265", "code_snippet": "#include <bits/stdc++.h>\n\nusing ll = long long;\n\ntemplate <class T> using Vec = std::vector<T>;\n\nvoid make_unique(std::vector<int>& v) {\n std::sort(v.begin(), v.end());\n v.erase(std::unique(v.begin(), v.end()), v.end());\n}\n\nint lowb(const std::vector<int>& v, int x) {\n return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x));\n}\n\nstruct Fenwick {\n int n;\n Vec<int> data;\n Fenwick() {}\n Fenwick(int n): n(n), data(n + 1) {}\n void add(int i, int v) {\n i += 1;\n while (i <= n) {\n data[i] += v;\n i += i & -i;\n }\n }\n int get(int i) const {\n int v = 0;\n while (i > 0) {\n v += data[i];\n i -= i & -i;\n }\n return v;\n }\n int fold(int l, int r) const {\n return get(r) - get(l);\n }\n};\n\nint main() {\n std::ios_base::sync_with_stdio(false);\n std::cin.tie(nullptr);\n int n;\n std::cin >> n;\n Vec<int> a(n);\n for (auto& x : a) {\n std::cin >> x;\n }\n int q;\n std::cin >> q;\n Vec<std::pair<int, int>> swap(q);\n for (auto& [x, y] : swap) {\n std::cin >> x >> y;\n x -= 1, y -= 1;\n }\n {\n auto cmp = a;\n make_unique(cmp);\n for (auto& x : a) {\n x = lowb(cmp, x);\n }\n }\n Vec<Vec<int>> appear(n + 1);\n Vec<Fenwick> fen(n + 1);\n {\n auto add = [&](int x, int y) {\n x += 1;\n while (x <= n) {\n appear[x].push_back(y);\n x += x & -x;\n }\n };\n for (int i = 0; i < n; ++i) {\n add(i, a[i]);\n }\n auto a2 = a;\n for (const auto& [x, y] : swap) {\n std::swap(a2[x], a2[y]);\n add(x, a2[x]);\n add(y, a2[y]);\n }\n for (int i = 1; i <= n; ++i) {\n make_unique(appear[i]);\n fen[i] = Fenwick((int)appear[i].size());\n }\n }\n const auto add = [&](int x, int y, int v) {\n x += 1;\n while (x <= n) {\n fen[x].add(lowb(appear[x], y), v);\n x += x & -x;\n }\n };\n const auto get = [&](int x, int l, int r) {\n int v = 0;\n while (x > 0) {\n v += fen[x].fold(lowb(appear[x], l), lowb(appear[x], r));\n x -= x & -x;\n }\n return v;\n };\n ll ans = 0;\n {\n Fenwick tmp(n);\n for (int i = 0; i < n; ++i) {\n ans += tmp.fold(a[i] + 1, n);\n tmp.add(a[i], 1);\n }\n }\n for (int i = 0; i < n; ++i) {\n add(i, a[i], 1);\n }\n for (const auto& [x, y] : swap) {\n if (a[x] < a[y]) {\n ans += 2 * (get(y, a[x], a[y]) - get(x + 1, a[x], a[y])) + 1;\n } else {\n ans -= 2 * (get(y, a[y], a[x]) - get(x + 1, a[y], a[x])) + 1;\n }\n std::cout << ans << '\\n';\n add(x, a[x], -1);\n add(y, a[y], -1);\n std::swap(a[x], a[y]);\n add(x, a[x], 1);\n add(y, a[y], 1);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 860, "memory_kb": 109304, "score_of_the_acc": -0.5864, "final_rank": 2 }, { "submission_id": "aoj_0451_5875741", "code_snippet": "#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\n\n\nconst int MAX = 500000;\nint N, Q;\nint a[MAX];\nint bit[MAX + 1];\nvoid add(int i, int x) {\n for (i++; i <= MAX; i += i & -i) bit[i] += x;\n}\nint sum(int i) {\n int ans = 0;\n for (; i; i -= i & -i) ans += bit[i];\n return ans;\n}\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cin >> N;\n for(int i = 0; i < N; i++) cin >> a[i];\n vector<int> idx(N);\n iota(idx.begin(), idx.end(), 0);\n sort(idx.begin(), idx.end(), [](int x, int y){ return a[x] < a[y]; });\n int64_t ans = 0;\n for(int i = N; i--; ){\n ans += sum(idx[i]);\n add(idx[i], 1);\n }\n cin >> Q;\n while(Q--){\n int x, y;\n cin >> x >> y;\n x--; y--;\n if(a[x] < a[y]){\n int cnt = 0;\n for(int i = x + 1; i < y; i++) cnt += a[x] < a[i] && a[i] < a[y];\n ans += cnt * 2 + 1;\n }\n else{\n int cnt = 0;\n for(int i = x + 1; i < y; i++) cnt += a[y] < a[i] && a[i] < a[x];\n ans -= cnt * 2 + 1;\n }\n swap(a[x], a[y]);\n cout << ans << '\\n';\n }\n}", "accuracy": 1, "time_ms": 1340, "memory_kb": 9032, "score_of_the_acc": -0.5966, "final_rank": 3 }, { "submission_id": "aoj_0451_5875684", "code_snippet": "#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\n\n\nconst int MAX = 500000;\nint N, Q;\nint a[MAX];\nint bit[MAX + 1];\nvoid add(int i, int x) {\n for (i++; i <= MAX; i += i & -i) bit[i] += x;\n}\nint sum(int i) {\n int ans = 0;\n for (; i; i -= i & -i) ans += bit[i];\n return ans;\n}\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cin >> N;\n for(int i = 0; i < N; i++) cin >> a[i];\n vector<int> idx(N);\n iota(idx.begin(), idx.end(), 0);\n sort(idx.begin(), idx.end(), [](int x, int y){ return a[x] < a[y]; });\n int64_t ans = 0;\n for(int i = N; i--; ){\n ans += sum(idx[i]);\n add(idx[i], 1);\n }\n cin >> Q;\n while(Q--){\n int x, y;\n cin >> x >> y;\n x--; y--;\n if(a[x] < a[y]){\n ans++;\n for(int i = x + 1; i < y; i++) if(a[x] < a[i] && a[i] < a[y]) ans += 2;\n }\n else{\n ans--;\n for(int i = x + 1; i < y; i++) if(a[y] < a[i] && a[i] < a[x]) ans -= 2;\n }\n swap(a[x], a[y]);\n cout << ans << '\\n';\n }\n}", "accuracy": 1, "time_ms": 2200, "memory_kb": 8936, "score_of_the_acc": -0.9752, "final_rank": 6 }, { "submission_id": "aoj_0451_5875682", "code_snippet": "#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\n\n\nconst int MAX = 500000;\nint N, Q;\nint a[MAX];\nint bit[MAX + 1];\nvoid add(int i, int x) {\n for (i++; i <= MAX; i += i & -i) bit[i] += x;\n}\nint sum(int i) {\n int ans = 0;\n for (; i; i -= i & -i) ans += bit[i];\n return ans;\n}\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cin >> N;\n for(int i = 0; i < N; i++) cin >> a[i];\n vector<int> idx(N);\n iota(idx.begin(), idx.end(), 0);\n sort(idx.begin(), idx.end(), [](int x, int y){ return a[x] < a[y]; });\n int64_t ans = 0;\n for(int i = N; i--; ){\n ans += sum(idx[i]);\n add(idx[i], 1);\n }\n cin >> Q;\n while(Q--){\n int x, y;\n cin >> x >> y;\n x--; y--;\n if(a[x] < a[y]){\n int cnt = 0;\n for(int i = x + 1; i < y; i++) cnt += a[x] < a[i] && a[i] < a[y];\n ans += cnt * 2 + 1;\n }\n else{\n int cnt = 0;\n for(int i = x + 1; i < y; i++) cnt += a[y] < a[i] && a[i] < a[x];\n ans -= cnt * 2 + 1;\n }\n swap(a[x], a[y]);\n cout << ans << '\\n';\n }\n}", "accuracy": 1, "time_ms": 1350, "memory_kb": 9028, "score_of_the_acc": -0.601, "final_rank": 4 }, { "submission_id": "aoj_0451_5875514", "code_snippet": "#include <bits/stdc++.h>\n\n// https://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=4063729#1\nstruct dynamic_bitvector {\n\n\n struct node;\n using size_type = std::size_t;\n using height_type = long long;\n using node_type = std::unique_ptr<struct node>;\n using node_reference = const node_type&;\n using bits_type = std::uint64_t;\n using children_type = std::array<node_type, 2>;\n\n\n const static size_type bit_limit = 32;\n\n struct bitvector_builder {\n const static size_type bit_size = bit_limit * 2;\n const size_type len;\n std::vector<bits_type> bits;\n bitvector_builder(size_type len): len(len), bits(len / bit_size + !!(len & (bit_size - 1))) {}\n void set(size_type i) { bits[i / bit_size] |= (bits_type(1) << (i & (bit_size - 1))); }\n dynamic_bitvector build() const {\n return dynamic_bitvector(bits, len);\n }\n };\n\n static size_type bits_popcount(bits_type bits) {\n return __builtin_popcountll(bits);\n }\n\n struct section_t {\n height_type he;\n children_type ch;\n };\n\n struct leaf_t {\n bits_type bits;\n };\n\n union info_t {\n section_t section;\n leaf_t leaf;\n info_t(section_t sec): section(std::move(sec)) {}\n info_t(leaf_t leaf): leaf(leaf) {}\n ~info_t() {}\n };\n\n struct node {\n const bool is_leaf;\n size_type sz;\n size_type popcnt;\n info_t info;\n\n static node_type new_section(node_type left, node_type right) {\n node* n = new node(section_t { 0, children_type { std::move(left), std::move(right) } });\n n->fix();\n return node_type(n);\n }\n\n static node_type new_leaf(bits_type bits, size_type sz, size_type popcnt) {\n node* n = new node(leaf_t { bits });\n n->sz = sz;\n n->popcnt = popcnt;\n return node_type(n);\n }\n\n node(section_t sec): is_leaf(false), info(std::move(sec)) {}\n node(leaf_t leaf): is_leaf(true), info(leaf) {}\n\n height_type height() const {\n if(is_leaf) return 0;\n else return info.section.he;\n }\n size_type size() const {\n return sz;\n }\n\n size_type popcount() const {\n return popcnt;\n }\n\n // operation for only section node\n\n node_type take(size_type dir) {\n assert(!is_leaf);\n return std::move(info.section.ch[dir]);\n }\n\n node_type swap(size_type dir, node_type new_node) {\n assert(!is_leaf);\n node_type old_node = take(dir);\n info.section.ch[dir] = std::move(new_node);\n return old_node;\n }\n\n const node_type& child(size_type dir) const {\n assert(!is_leaf);\n return info.section.ch[dir];\n }\n\n height_type diff() const {\n assert(!is_leaf);\n return child(0)->height() - child(1)->height();\n }\n\n void fix() {\n assert(!is_leaf);\n sz = child(0)->size() + child(1)->size();\n popcnt = child(0)->popcount() + child(1)->popcount();\n info.section.he = std::max(child(0)->height(), child(1)->height()) + 1;\n }\n\n // operation for only leaf node\n\n bits_type bits() const {\n assert(is_leaf);\n return info.leaf.bits;\n }\n\n bool at_bits(size_type pos) const {\n assert(is_leaf);\n return (bits() >> pos) & 1;\n }\n\n size_type rank(size_type pos) const {\n assert(pos <= size());\n return bits_popcount(bits() & ((bits_type(1) << pos) - 1));\n }\n\n void set_bits(bits_type bits, size_type sz_, size_type popcnt_) {\n assert(is_leaf);\n sz = sz_;\n popcnt = popcnt_;\n info.leaf.bits = bits;\n }\n\n // [0, pos) and [pos, sz)\n std::pair<bits_type, bits_type> split_bits(size_type pos) const {\n assert(is_leaf);\n assert(pos <= size());\n return std::make_pair(bits() & ((bits_type(1) << pos) - 1), bits() >> pos);\n }\n\n void insert_bit(size_type pos, bool bit) {\n assert(is_leaf);\n assert(sz < bit_limit * 2);\n bits_type l, r;\n std::tie(l, r) = split_bits(pos);\n // std::cout << \"insert \" << bit << \" to \" << pos << std::endl;\n // std::cout << \"insert \" << std::bitset<bit_limit * 2>(l) << \" \" << std::bitset<bit_limit * 2>(r) << std::endl;\n // std::cout << \"insert \" << std::bitset<bit_limit * 2>(bits()) << \" -> \" << std::bitset<bit_limit * 2>(l | ((bits_type(bit) << pos)) | (r << (pos + 1))) << std::endl;\n set_bits(l | ((bits_type(bit) << pos)) | (r << (pos + 1)), sz + 1, popcount() + bit);\n }\n\n void erase_bit(size_type pos) {\n assert(is_leaf);\n assert(0 < sz);\n bits_type l, r;\n std::tie(l, r) = split_bits(pos);\n size_type pos_bit = r & 1;\n r >>= 1;\n set_bits(l | (r << pos), sz - 1, popcount() - pos_bit);\n }\n };\n\n\n static node_type rotate(node_type x, size_type dir) {\n node_type y = x->take(1 - dir);\n node_type b = y->take(dir);\n x->swap(1 - dir, std::move(b));\n x->fix();\n y->swap(dir, std::move(x));\n y->fix();\n return std::move(y);\n }\n\n static node_type balance(node_type node) {\n node->fix();\n if(node->diff() == 2) {\n if(node->child(0)->diff() == -1) {\n auto ch = node->take(0);\n node->swap(0, rotate(std::move(ch), 0));\n }\n return rotate(std::move(node), 1);\n }\n else if(node->diff() == -2) {\n if(node->child(1)->diff() == 1) {\n auto ch = node->take(1);\n node->swap(1, rotate(std::move(ch), 1));\n }\n return rotate(std::move(node), 0);\n }\n else return std::move(node);\n }\n\n static node_type split_node(node_type node) {\n assert(node->is_leaf);\n bits_type l, r;\n std::tie(l, r) = node->split_bits(bit_limit);\n return node::new_section(\n node::new_leaf(l, bit_limit, bits_popcount(l)), node::new_leaf(r, node->size() - bit_limit, bits_popcount(r))\n );\n }\n\n static node_type insert(node_type node, size_type pos, bool bit) {\n if(node->is_leaf) {\n if(node->size() == 2 * bit_limit) {\n return insert(split_node(std::move(node)), pos, bit);\n }\n else {\n node->insert_bit(pos, bit);\n return node;\n }\n }\n else if(pos < node->child(0)->size()) {\n node->swap(0, insert(node->take(0), pos, bit));\n return balance(std::move(node));\n }\n else {\n node->swap(1, insert(node->take(1), pos - node->child(0)->size(), bit));\n return balance(std::move(node));\n }\n }\n\n template<const size_type dir>\n static std::tuple<node_type, bits_type, size_type> take_bit(node_type node, size_type len) {\n if(node->is_leaf) {\n if(node->size() < bit_limit / 2 + len) {\n return std::tuple<node_type, bits_type, size_type>{ node_type(nullptr), node->bits(), node->size() };\n }\n else {\n auto p = node->split_bits(dir == 0 ? len : node->size() - len);\n bits_type node_bit = std::get<1 - dir>(p);\n bits_type take = std::get<dir>(p);\n node->set_bits(node_bit, node->size() - len, bits_popcount(node_bit));\n return std::tuple<node_type, bits_type, size_type> { std::move(node), take, len };\n }\n }\n else {\n node_type ch;\n bits_type bits;\n size_type take_len;\n std::tie(ch, bits, take_len) = take_bit<dir>(node->take(dir), len);\n if(ch) {\n node->swap(dir, std::move(ch));\n return std::tuple<node_type, bits_type, size_type>{ balance(std::move(node)), bits, take_len };\n }\n else {\n return std::tuple<node_type, bits_type, size_type> { node->take(1 - dir), bits, take_len };\n }\n }\n }\n\n static node_type erase(node_type node, size_type pos) {\n if(node->is_leaf) {\n node->erase_bit(pos);\n return node;\n }\n else if(pos < node->child(0)->size()) {\n auto left = erase(node->take(0), pos);\n if(left->size() < bit_limit / 2) {\n assert(left->is_leaf);\n node_type right;\n bits_type bits;\n size_type len;\n std::tie(right, bits, len) = take_bit<0>(node->take(1), bit_limit / 2 - left->size());\n\n left->set_bits(left->bits() | (bits << left->size()), left->size() + len, left->popcount() + bits_popcount(bits));\n if(right) {\n node->swap(0, std::move(left));\n node->swap(1, std::move(right));\n return balance(std::move(node));\n }\n else {\n return left;\n }\n }\n else {\n node->swap(0, std::move(left));\n return balance(std::move(node));\n }\n }\n else {\n auto right = erase(node->take(1), pos - node->child(0)->size());\n if(right->size() < bit_limit / 2) {\n assert(right->is_leaf);\n node_type left;\n bits_type bits;\n size_type len;\n std::tie(left, bits, len) = take_bit<1>(node->take(0), bit_limit / 2 - right->size());\n\n right->set_bits((right->bits() << len) | bits, right->size() + len, right->popcount() + bits_popcount(bits));\n if(left) {\n node->swap(0, std::move(left));\n node->swap(1, std::move(right));\n return balance(std::move(node));\n }\n else {\n return right;\n }\n }\n else {\n node->swap(1, std::move(right));\n return balance(std::move(node));\n }\n }\n }\n\n static node_type merge_dir(node_type dst, node_type src, size_type dir) {\n if(std::abs(dst->height() - src->height()) <= 1) {\n if(dir == 0)\n return node::new_section(std::move(src), std::move(dst));\n else\n return node::new_section(std::move(dst), std::move(src));\n }\n else {\n node_type ch = dst->take(dir);\n assert(ch);\n dst->swap(dir, merge_dir(std::move(ch), std::move(src), dir));\n return balance(std::move(dst));\n }\n }\n\n static node_type merge(node_type left, node_type right) {\n if(!left) { return std::move(right); }\n else if(!right) { return std::move(left); }\n else if(left->height() >= right->height()) {\n return merge_dir(std::move(left), std::move(right), 1);\n }\n else {\n return merge_dir(std::move(right), std::move(left), 0);\n }\n }\n\n static node_type build(const std::vector<bits_type>& bits, size_type l, size_type r, size_type len) {\n //std::cout << \"build \" << l << \" \" << r << \" \" << len << std::endl;\n if(l + 1 >= r) {\n //std::cout << \"create leaf\" << std::endl;\n //std::cout << \"-----------\" << std::endl;\n return node::new_leaf(bits[l], len, bits_popcount(bits[l]));\n }\n else {\n size_type m = (l + r) >> 1;\n return merge(build(bits, l, m, (m - l) * 64), build(bits, m, r, len - (m - l) * 64));\n }\n }\n\n static size_type at(node_reference node, size_type pos) {\n if(node->is_leaf) {\n return node->at_bits(pos);\n }\n else if(pos < node->child(0)->size()) {\n return at(node->child(0), pos);\n }\n else {\n return at(node->child(1), pos - node->child(0)->size());\n }\n }\n\n static size_type rank(node_reference node, size_type pos) {\n if(node->is_leaf) {\n return node->rank(pos);\n }\n else if(pos < node->child(0)->size()) {\n return rank(node->child(0), pos);\n }\n else {\n return node->child(0)->popcount() + rank(node->child(1), pos - node->child(0)->size());\n }\n }\n\n\n node_type root;\n\n dynamic_bitvector(): root(node::new_leaf(0, 0, 0)) {}\n dynamic_bitvector(const std::vector<bits_type>& bits, size_type len): root(build(bits, 0, bits.size(), len)) {}\n void insert(size_type pos, bool bit) {\n root = insert(std::move(root), pos, bit);\n }\n void erase(size_type pos) {\n root = erase(std::move(root), pos);\n }\n bool at(size_type pos) const {\n return at(root, pos);\n }\n size_type rank(size_type pos) const {\n return rank(root, pos);\n }\n size_type rank(size_type pos, bool bit) const {\n if(bit) {\n return rank(root, pos);\n }\n else {\n return pos - rank(root, pos);\n }\n }\n size_type size() const {\n return root->size();\n }\n\n void debug_tree(node_reference node, std::string d) const {\n if(node->is_leaf) {\n std::cout << d << \"leaf \" << node->size() << \" \" << node->popcount() << \" -----------\" << std::endl;\n std::cout << d << std::bitset<bit_limit * 2>(node->bits()) << std::endl;\n std::cout << d << \"-------------\" << std::endl;\n }\n else {\n std::cout << d << \"node \" << node->size() << \" \" << node->popcount() << \" ----------\" << std::endl;\n std::cout << d << \"left\" << std::endl;\n debug_tree(node->child(0), d + \" \");\n std::cout << d << \"--------------\" << std::endl;\n std::cout << d << \"right\" << std::endl;\n debug_tree(node->child(1), d + \" \");\n std::cout << d << \"--------------\" << std::endl;\n }\n }\n\n void debug_tree() const {\n debug_tree(root, \"\");\n }\n};\n\n#include <vector>\nstruct dynamic_wavelet_matrix {\n using Integer = std::size_t;\n using integer_type = Integer;\n using size_type = std::size_t;\n\n\n const size_type depth;\n const size_type len;\n std::vector<dynamic_bitvector> mat;\n std::vector<size_type> spl;\n\npublic:\n\n dynamic_wavelet_matrix(const std::vector<integer_type>& arr, size_type de)\n : depth(de),\n mat(de),\n len(arr.size()),\n spl(std::vector<size_type>(depth, 0)) {\n std::vector<size_type> idx(len);\n std::vector<size_type> left(len), right(len);\n\n for(size_type i = 0;i < len;i++) idx[i] = i;\n\n for(size_type d = depth; d-- > 0;) {\n size_type l = 0, r = 0;\n dynamic_bitvector::bitvector_builder builder(len);\n for(size_type i = 0; i < len; i++) {\n size_type k = (arr[idx[i]] >> d) & 1;\n if(k) right[r++] = idx[i], builder.set(i);\n else left[l++] = idx[i];\n }\n mat[d] = builder.build();\n spl[d] = l;\n swap(idx, left);\n for(size_type i = 0; i < r; i++) idx[i + l] = right[i];\n }\n }\n\n void insert(size_type i, integer_type x) {\n for(size_type d = depth; d --> 0;) {\n size_type k = ((x >> d) & 1);\n mat[d].insert(i, k);\n i = mat[d].rank(i, k) + spl[d] * k;\n if(k == 0) spl[d]++;\n }\n }\n\n void erase(size_type i) {\n for(size_type d = depth; d--> 0;) {\n size_type k = mat[d].at(i);\n mat[d].erase(i);\n i = mat[d].rank(i, k) + spl[d] * k;\n if(k == 0) spl[d]--;\n }\n }\n\n integer_type at(size_type i) const {\n integer_type x = static_cast<integer_type>(0);\n for(size_type d = depth; d-- > 0;) {\n size_type k = mat[d].at(i);\n x |= (static_cast<integer_type>(k) << d);\n i = mat[d].rank(i, k) + spl[d] * k;\n }\n return x;\n }\n\n // counting elements that equal to x in range [left, right)\n size_type rank_x(size_type left, size_type right, integer_type x) const {\n for(size_type d = depth; d-- > 0;) {\n size_type k = ((x >> d) & 1);\n left = mat[d].rank(left, k) + spl[d] * k;\n right = mat[d].rank(right, k) + spl[d] * k;\n }\n return right - left;\n }\n\n // sorted(arr[left..right])[i]\n integer_type quantile(size_type left, size_type right, size_type i) const {\n integer_type x = static_cast<integer_type>(0);\n for(size_type d = depth; d-- > 0;) {\n size_type cnt = mat[d].rank(right, 0) - mat[d].rank(left, 0);\n size_type k = (i < cnt) ? 0 : 1;\n x |= (k << d);\n left = mat[d].rank(left, k) + spl[d] * k;\n right = mat[d].rank(right, k) + spl[d] * k;\n }\n return x;\n }\n\n struct rank_result {\n size_type le;\n size_type eq;\n size_type mo;\n };\n\n // couting elements that less than x, equal to x, and more than x in range [left, right)\n rank_result rank_less_eq_more(size_type left, size_type right, integer_type x) const {\n size_type le = 0, mo = 0;\n for(size_type d = depth; d --> 0;) {\n size_type k = (x >> d) & 1;\n size_type l = mat[d].rank(left, 1);\n size_type r = mat[d].rank(right, 1);\n if(k == 0) {\n mo += r - l;\n left -= l;\n right -= r;\n }\n else {\n le += (right - left) - (r - l);\n left = l + spl[d];\n right = r + spl[d];\n }\n }\n return rank_result { le, right - left, mo };\n }\n\n size_type rangefreq(size_type left, size_type right, integer_type x, integer_type y, integer_type l, size_type d) const {\n integer_type r = l + (1 << d);\n if(x <= l && r <= y) {\n return right - left;\n }\n else if(y <= l || r <= x) {\n return 0;\n }\n else {\n d--;\n size_type lr = mat[d].rank(left, 1);\n size_type rr = mat[d].rank(right, 1);\n return\n rangefreq(left - lr, right - rr, x, y, l, d) +\n rangefreq(lr + spl[d], rr + spl[d], x, y, l + (1 << d), d);\n }\n }\n\n size_type rangefreq(size_type left, size_type right, integer_type x, integer_type y) const {\n return rangefreq(left, right, x, y, 0, depth);\n }\n\n size_type rangefreq_count(size_type left, size_type right, integer_type x, integer_type y) const {\n auto p = rank_less_eq_more(left, right, x);\n auto q = rank_less_eq_more(left, right, y);\n return p.eq + p.mo - q.eq - q.mo;\n }\n};\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing uint = unsigned;\nusing pcc = pair<char, char>;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing pdd = pair<ld, ld>;\nusing tuplis = array<ll, 3>;\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\nconst ll LINF=0x1fffffffffffffff;\nconst ll MINF=0x7fffffffffff;\nconst int INF=0x3fffffff;\nconst int MOD=1000000007;\nconst int MODD=998244353;\nconst ld DINF=numeric_limits<ld>::infinity();\nconst ld EPS=1e-9;\nconst ld PI=3.1415926535897932;\nconst ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};\nconst ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};\n#define overload5(a,b,c,d,e,name,...) name\n#define overload4(a,b,c,d,name,...) name\n#define overload3(a,b,c,name,...) name\n#define rep1(n) for(ll i=0;i<n;++i)\n#define rep2(i,n) for(ll i=0;i<n;++i)\n#define rep3(i,a,b) for(ll i=a;i<b;++i)\n#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)\n#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(n) for(ll i=n;i--;)\n#define rrep2(i,n) for(ll i=n;i--;)\n#define rrep3(i,a,b) for(ll i=b;i-->(a);)\n#define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c)\n#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)\n#define each1(i,a) for(auto&&i:a)\n#define each2(x,y,a) for(auto&&[x,y]:a)\n#define each3(x,y,z,a) for(auto&&[x,y,z]:a)\n#define each4(w,x,y,z,a) for(auto&&[w,x,y,z]:a)\n#define each(...) overload5(__VA_ARGS__,each4,each3,each2,each1)(__VA_ARGS__)\n#define all1(i) begin(i),end(i)\n#define all2(i,a) begin(i),begin(i)+a\n#define all3(i,a,b) begin(i)+a,begin(i)+b\n#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)\n#define rall1(i) (i).rbegin(),(i).rend()\n#define rall2(i,k) (i).rbegin(),(i).rbegin()+k\n#define rall3(i,a,b) (i).rbegin()+a,(i).rbegin()+b\n#define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__)\n#define sum(...) accumulate(all(__VA_ARGS__),0LL)\n#define dsum(...) accumulate(all(__VA_ARGS__),0.0L)\n#define Msum(...) accumulate(all(__VA_ARGS__),0_M)\n#define elif else if\n#define unless(a) if(!(a))\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\n#define Sort(a) sort(all(a))\n#define Rev(a) reverse(all(a))\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\n#define VEC(type,name,size) vector<type>name(size);in(name)\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\ntemplate<class T> bool chmin(T& a, const T& b){ if(a > b){ a = b; return 1; } return 0; }\ntemplate<class T> bool chmax(T& a, const T& b){ if(a < b){ a = b; return 1; } return 0; }\ntemplate<class T, class U> bool chmin(T& a, const U& b){ if(a > T(b)){ a = b; return 1; } return 0; }\ntemplate<class T, class U> bool chmax(T& a, const U& b){ if(a < T(b)){ a = b; return 1; } return 0; }\nvector<ll> iota(ll n, ll begin = 0){ vector<ll> a(n); iota(a.begin(), a.end(), begin); return a; }\nvector<pll> factor(ull x){ vector<pll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }\nvector<ll> divisor(ull x){ vector<ll> ans; for(ull i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }\ntemplate<class T> unordered_map<T, ll> press(vector<T>& a){ Uniq(a); unordered_map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }\ntemplate<class T> auto run_press(const T& a){ vector<pair<remove_const_t<remove_reference_t<decltype(a[0])>>, ll>> ans; each(x, a){ if(ans.empty() || ans.back().first != x) ans.emplace_back(x, 1); else ans.back().second++; } return ans; }\nint scan(){ return getchar(); }\nvoid scan(int& a){ scanf(\"%d\", &a); }\nvoid scan(unsigned& a){ scanf(\"%u\", &a); }\nvoid scan(long& a){ scanf(\"%ld\", &a); }\nvoid scan(long long& a){ scanf(\"%lld\", &a); }\nvoid scan(unsigned long long& a){ scanf(\"%llu\", &a); }\nvoid scan(char& a){ do a = getchar(); while(a == ' ' || a == '\\n'); }\nvoid scan(float& a){ scanf(\"%f\", &a); }\nvoid scan(double& a){ scanf(\"%lf\", &a); }\nvoid scan(long double& a){ scanf(\"%Lf\", &a); }\nvoid scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++){ int b; scan(b); a[i] = b; } }\nvoid scan(char a[]){ scanf(\"%s\", a); }\nvoid scan(string& a){ cin >> a; }\ntemplate<class T> void scan(vector<T>&);\ntemplate<class T, size_t size> void scan(array<T, size>&);\ntemplate<class T, class L> void scan(pair<T, L>&);\ntemplate<class T, size_t size> void scan(T(&)[size]);\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T> void scan(deque<T>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); }\ntemplate<class T, size_t size> void scan(T (&a)[size]){ for(auto&& i : a) scan(i); }\ntemplate<class T> void scan(T& a){ cin >> a; }\nvoid in(){}\ntemplate <class... T> void in(T&... a){ (void)initializer_list<int>{ (scan(a), 0)... }; }\nvoid print(){ putchar(' '); }\nvoid print(bool a){ printf(\"%d\", a); }\nvoid print(int a){ printf(\"%d\", a); }\nvoid print(unsigned a){ printf(\"%u\", a); }\nvoid print(long a){ printf(\"%ld\", a); }\nvoid print(long long a){ printf(\"%lld\", a); }\nvoid print(unsigned long long a){ printf(\"%llu\", a); }\nvoid print(char a){ printf(\"%c\", a); }\nvoid print(char a[]){ printf(\"%s\", a); }\nvoid print(const char a[]){ printf(\"%s\", a); }\nvoid print(float a){ printf(\"%.15f\", a); }\nvoid print(double a){ printf(\"%.15f\", a); }\nvoid print(long double a){ printf(\"%.15Lf\", a); }\nvoid print(const string& a){ for(auto&& i : a) print(i); }\ntemplate<class T> void print(const complex<T>& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag()); print('i'); }\ntemplate<class T> void print(const vector<T>&);\ntemplate<class T, size_t size> void print(const array<T, size>&);\ntemplate<class T, class L> void print(const pair<T, L>& p);\ntemplate<class T, size_t size> void print(const T (&)[size]);\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }\ntemplate<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }\ntemplate<class T> void print(const T& a){ cout << a; }\nint out(){ putchar('\\n'); return 0; }\ntemplate<class T> int out(const T& t){ print(t); putchar('\\n'); return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\n#ifdef DEBUG\ninline ll __lg(ull x){ return 63 - __builtin_clzll(x); }\n#define debug(...) { print(#__VA_ARGS__); print(\":\"); out(__VA_ARGS__); }\n#else\n#define debug(...) void(0)\n#endif\nint first(bool i = true){ return out(i?\"first\":\"second\"); }\nint First(bool i = true){ return out(i?\"First\":\"Second\"); }\nint yes(bool i = true){ return out(i?\"yes\":\"no\"); }\nint Yes(bool i = true){ return out(i?\"Yes\":\"No\"); }\nint No(){ return out(\"No\"); }\nint YES(bool i = true){ return out(i?\"YES\":\"NO\"); }\nint NO(){ return out(\"NO\"); }\nint Yay(bool i = true){ return out(i?\"Yay!\":\":(\"); }\nint possible(bool i = true){ return out(i?\"possible\":\"impossible\"); }\nint Possible(bool i = true){ return out(i?\"Possible\":\"Impossible\"); }\nint POSSIBLE(bool i = true){ return out(i?\"POSSIBLE\":\"IMPOSSIBLE\"); }\nvoid Case(ll i){ printf(\"Case #%lld: \", i); }\n\n\n\ntemplate<class T>\nstruct SegmentTree{\n virtual T f(const T&, const T&) const = 0;\n const T def_value;\n ll size = 1, rank = 0, expected_size;\n vector<T> data;\n SegmentTree(ll n, const T& def_value): def_value(def_value), expected_size(n){\n while(size < expected_size){\n size *= 2;\n rank++;\n }\n data.assign(size * 2, def_value);\n }\n SegmentTree(const vector<T>& v, const T& def_value): def_value(def_value), expected_size(v.size()){\n while(size < expected_size){\n size *= 2;\n rank++;\n }\n data.assign(size * 2, def_value);\n for(ll i = 0; i < v.size(); i++) data[size + i] = v[i];\n // for(ll i = Base::size; --i;) Base::data[i] = f(Base::data[i * 2], Base::data[i * 2 + 1]);\n }\n T operator[](ll at) const {\n return data[size + at];\n }\n void update(ll at){\n while(at /= 2) data[at] = f(data[at * 2], data[at * 2 + 1]);\n }\n void set(ll at, const T& val){\n at += size;\n data[at] = val;\n update(at);\n }\n void add(ll at, const T& val){\n at += size;\n data[at] += val;\n update(at);\n }\n T get(ll l, ll r) const {\n T L = def_value, R = def_value;\n l += size; r += size;\n for(; l < r; l /= 2, r /= 2){\n if(l & 1) L = f(L, data[l++]);\n if(r & 1) R = f(data[--r], R);\n }\n return f(L, R);\n }\n template<class F> ll find_last(const F& check, ll l = 0) const { // max x s.t. check(get(l, x)) == true\n if(l == expected_size) return expected_size;\n ll height = 0, at = l + size;\n T val = def_value;\n for(; height <= rank; height++) if(at >> height & 1){\n T val2 = f(val, data[at >> height]);\n if(check(val2)){\n at += 1 << height;\n if(at == size * 2) return expected_size;\n val = val2;\n }\n else break;\n }\n for(; height--; ){\n T val2 = f(val, data[at >> height]);\n if(check(val2)){\n at += 1 << height;\n if(at == size * 2) return expected_size;\n val = val2;\n }\n }\n return min(at - size, expected_size);\n }\n template<class F> ll find_first(const F& check, ll r) const { // min x s.t. check(get(x, r)) == true\n if(!r) return 0;\n ll height = 0, at = r + size;\n T val = def_value;\n for(; height <= rank; height++) if(at >> height & 1){\n T val2 = f(val, data[at >> height ^ 1]);\n if(check(val2)){\n at -= 1 << height;\n if(at == size) return 0;\n val = val2;\n }\n else break;\n }\n for(; height--; ){\n T val2 = f(val, data[(at >> height) - 1]);\n if(check(val2)){\n at -= 1 << height;\n if(at == size) return 0;\n val = val2;\n }\n }\n return at - size;\n }\n void clear(){\n for(auto& i : data) i = def_value;\n }\n};\ntemplate<class T>\nstruct RSQ : SegmentTree<T>{\n using Base = SegmentTree<T>;\n T f(const T& a, const T& b) const {return a + b;}\n RSQ(ll n, const T& def_value = T()) : Base(n, def_value){}\n RSQ(const vector<T>& v, const T& def_value = T()) : Base(v, def_value){\n for(ll i = Base::size; --i;) Base::data[i] = f(Base::data[i * 2], Base::data[i * 2 + 1]);\n }\n};\nint main(){\n LL(n);\n VEC(ll,a,n);\n {\n auto b=a;\n auto p=press(b);\n each(x,a)x=p[x];\n }\n dynamic_wavelet_matrix wm(std::vector<std::size_t>(all(a)), 31);\n RSQ<ll>seg(n);\n ll ans=0;\n each(x,a){\n ans+=seg.get(x+1,seg.size);\n seg.set(x,1);\n }\n LL(q);\n rep(q){\n LL(x,y);\n x--;\n y--;\n if(a[x]<a[y])ans+=wm.rangefreq(x+1,y,a[x],a[y])*2+1;\n else ans-=wm.rangefreq(x+1,y,a[y],a[x])*2+1;\n wm.erase(x);\n wm.insert(x,a[y]);\n wm.erase(y);\n wm.insert(y,a[x]);\n swap(a[x],a[y]);\n out(ans);\n }\n}", "accuracy": 0.6, "time_ms": 40, "memory_kb": 4272, "score_of_the_acc": -0.0143, "final_rank": 18 }, { "submission_id": "aoj_0451_5875505", "code_snippet": "#include <bits/stdc++.h>\n\n// https://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=4063729#1\nstruct dynamic_bitvector {\n\n\n struct node;\n using size_type = std::size_t;\n using height_type = long long;\n using node_type = std::unique_ptr<struct node>;\n using node_reference = const node_type&;\n using bits_type = std::uint64_t;\n using children_type = std::array<node_type, 2>;\n\n\n const static size_type bit_limit = 32;\n\n struct bitvector_builder {\n const static size_type bit_size = bit_limit * 2;\n const size_type len;\n std::vector<bits_type> bits;\n bitvector_builder(size_type len): len(len), bits(len / bit_size + !!(len & (bit_size - 1))) {}\n void set(size_type i) { bits[i / bit_size] |= (bits_type(1) << (i & (bit_size - 1))); }\n dynamic_bitvector build() const {\n return dynamic_bitvector(bits, len);\n }\n };\n\n static size_type bits_popcount(bits_type bits) {\n return __builtin_popcountll(bits);\n }\n\n struct section_t {\n height_type he;\n children_type ch;\n };\n\n struct leaf_t {\n bits_type bits;\n };\n\n union info_t {\n section_t section;\n leaf_t leaf;\n info_t(section_t sec): section(std::move(sec)) {}\n info_t(leaf_t leaf): leaf(leaf) {}\n ~info_t() {}\n };\n\n struct node {\n const bool is_leaf;\n size_type sz;\n size_type popcnt;\n info_t info;\n\n static node_type new_section(node_type left, node_type right) {\n node* n = new node(section_t { 0, children_type { std::move(left), std::move(right) } });\n n->fix();\n return node_type(n);\n }\n\n static node_type new_leaf(bits_type bits, size_type sz, size_type popcnt) {\n node* n = new node(leaf_t { bits });\n n->sz = sz;\n n->popcnt = popcnt;\n return node_type(n);\n }\n\n node(section_t sec): is_leaf(false), info(std::move(sec)) {}\n node(leaf_t leaf): is_leaf(true), info(leaf) {}\n\n height_type height() const {\n if(is_leaf) return 0;\n else return info.section.he;\n }\n size_type size() const {\n return sz;\n }\n\n size_type popcount() const {\n return popcnt;\n }\n\n // operation for only section node\n\n node_type take(size_type dir) {\n assert(!is_leaf);\n return std::move(info.section.ch[dir]);\n }\n\n node_type swap(size_type dir, node_type new_node) {\n assert(!is_leaf);\n node_type old_node = take(dir);\n info.section.ch[dir] = std::move(new_node);\n return old_node;\n }\n\n const node_type& child(size_type dir) const {\n assert(!is_leaf);\n return info.section.ch[dir];\n }\n\n height_type diff() const {\n assert(!is_leaf);\n return child(0)->height() - child(1)->height();\n }\n\n void fix() {\n assert(!is_leaf);\n sz = child(0)->size() + child(1)->size();\n popcnt = child(0)->popcount() + child(1)->popcount();\n info.section.he = std::max(child(0)->height(), child(1)->height()) + 1;\n }\n\n // operation for only leaf node\n\n bits_type bits() const {\n assert(is_leaf);\n return info.leaf.bits;\n }\n\n bool at_bits(size_type pos) const {\n assert(is_leaf);\n return (bits() >> pos) & 1;\n }\n\n size_type rank(size_type pos) const {\n assert(pos <= size());\n return bits_popcount(bits() & ((bits_type(1) << pos) - 1));\n }\n\n void set_bits(bits_type bits, size_type sz_, size_type popcnt_) {\n assert(is_leaf);\n sz = sz_;\n popcnt = popcnt_;\n info.leaf.bits = bits;\n }\n\n // [0, pos) and [pos, sz)\n std::pair<bits_type, bits_type> split_bits(size_type pos) const {\n assert(is_leaf);\n assert(pos <= size());\n return std::make_pair(bits() & ((bits_type(1) << pos) - 1), bits() >> pos);\n }\n\n void insert_bit(size_type pos, bool bit) {\n assert(is_leaf);\n assert(sz < bit_limit * 2);\n bits_type l, r;\n std::tie(l, r) = split_bits(pos);\n // std::cout << \"insert \" << bit << \" to \" << pos << std::endl;\n // std::cout << \"insert \" << std::bitset<bit_limit * 2>(l) << \" \" << std::bitset<bit_limit * 2>(r) << std::endl;\n // std::cout << \"insert \" << std::bitset<bit_limit * 2>(bits()) << \" -> \" << std::bitset<bit_limit * 2>(l | ((bits_type(bit) << pos)) | (r << (pos + 1))) << std::endl;\n set_bits(l | ((bits_type(bit) << pos)) | (r << (pos + 1)), sz + 1, popcount() + bit);\n }\n\n void erase_bit(size_type pos) {\n assert(is_leaf);\n assert(0 < sz);\n bits_type l, r;\n std::tie(l, r) = split_bits(pos);\n size_type pos_bit = r & 1;\n r >>= 1;\n set_bits(l | (r << pos), sz - 1, popcount() - pos_bit);\n }\n };\n\n\n static node_type rotate(node_type x, size_type dir) {\n node_type y = x->take(1 - dir);\n node_type b = y->take(dir);\n x->swap(1 - dir, std::move(b));\n x->fix();\n y->swap(dir, std::move(x));\n y->fix();\n return std::move(y);\n }\n\n static node_type balance(node_type node) {\n node->fix();\n if(node->diff() == 2) {\n if(node->child(0)->diff() == -1) {\n auto ch = node->take(0);\n node->swap(0, rotate(std::move(ch), 0));\n }\n return rotate(std::move(node), 1);\n }\n else if(node->diff() == -2) {\n if(node->child(1)->diff() == 1) {\n auto ch = node->take(1);\n node->swap(1, rotate(std::move(ch), 1));\n }\n return rotate(std::move(node), 0);\n }\n else return std::move(node);\n }\n\n static node_type split_node(node_type node) {\n assert(node->is_leaf);\n bits_type l, r;\n std::tie(l, r) = node->split_bits(bit_limit);\n return node::new_section(\n node::new_leaf(l, bit_limit, bits_popcount(l)), node::new_leaf(r, node->size() - bit_limit, bits_popcount(r))\n );\n }\n\n static node_type insert(node_type node, size_type pos, bool bit) {\n if(node->is_leaf) {\n if(node->size() == 2 * bit_limit) {\n return insert(split_node(std::move(node)), pos, bit);\n }\n else {\n node->insert_bit(pos, bit);\n return node;\n }\n }\n else if(pos < node->child(0)->size()) {\n node->swap(0, insert(node->take(0), pos, bit));\n return balance(std::move(node));\n }\n else {\n node->swap(1, insert(node->take(1), pos - node->child(0)->size(), bit));\n return balance(std::move(node));\n }\n }\n\n template<const size_type dir>\n static std::tuple<node_type, bits_type, size_type> take_bit(node_type node, size_type len) {\n if(node->is_leaf) {\n if(node->size() < bit_limit / 2 + len) {\n return std::tuple<node_type, bits_type, size_type>{ node_type(nullptr), node->bits(), node->size() };\n }\n else {\n auto p = node->split_bits(dir == 0 ? len : node->size() - len);\n bits_type node_bit = std::get<1 - dir>(p);\n bits_type take = std::get<dir>(p);\n node->set_bits(node_bit, node->size() - len, bits_popcount(node_bit));\n return std::tuple<node_type, bits_type, size_type> { std::move(node), take, len };\n }\n }\n else {\n node_type ch;\n bits_type bits;\n size_type take_len;\n std::tie(ch, bits, take_len) = take_bit<dir>(node->take(dir), len);\n if(ch) {\n node->swap(dir, std::move(ch));\n return std::tuple<node_type, bits_type, size_type>{ balance(std::move(node)), bits, take_len };\n }\n else {\n return std::tuple<node_type, bits_type, size_type> { node->take(1 - dir), bits, take_len };\n }\n }\n }\n\n static node_type erase(node_type node, size_type pos) {\n if(node->is_leaf) {\n node->erase_bit(pos);\n return node;\n }\n else if(pos < node->child(0)->size()) {\n auto left = erase(node->take(0), pos);\n if(left->size() < bit_limit / 2) {\n assert(left->is_leaf);\n node_type right;\n bits_type bits;\n size_type len;\n std::tie(right, bits, len) = take_bit<0>(node->take(1), bit_limit / 2 - left->size());\n\n left->set_bits(left->bits() | (bits << left->size()), left->size() + len, left->popcount() + bits_popcount(bits));\n if(right) {\n node->swap(0, std::move(left));\n node->swap(1, std::move(right));\n return balance(std::move(node));\n }\n else {\n return left;\n }\n }\n else {\n node->swap(0, std::move(left));\n return balance(std::move(node));\n }\n }\n else {\n auto right = erase(node->take(1), pos - node->child(0)->size());\n if(right->size() < bit_limit / 2) {\n assert(right->is_leaf);\n node_type left;\n bits_type bits;\n size_type len;\n std::tie(left, bits, len) = take_bit<1>(node->take(0), bit_limit / 2 - right->size());\n\n right->set_bits((right->bits() << len) | bits, right->size() + len, right->popcount() + bits_popcount(bits));\n if(left) {\n node->swap(0, std::move(left));\n node->swap(1, std::move(right));\n return balance(std::move(node));\n }\n else {\n return right;\n }\n }\n else {\n node->swap(1, std::move(right));\n return balance(std::move(node));\n }\n }\n }\n\n static node_type merge_dir(node_type dst, node_type src, size_type dir) {\n if(std::abs(dst->height() - src->height()) <= 1) {\n if(dir == 0)\n return node::new_section(std::move(src), std::move(dst));\n else\n return node::new_section(std::move(dst), std::move(src));\n }\n else {\n node_type ch = dst->take(dir);\n assert(ch);\n dst->swap(dir, merge_dir(std::move(ch), std::move(src), dir));\n return balance(std::move(dst));\n }\n }\n\n static node_type merge(node_type left, node_type right) {\n if(!left) { return std::move(right); }\n else if(!right) { return std::move(left); }\n else if(left->height() >= right->height()) {\n return merge_dir(std::move(left), std::move(right), 1);\n }\n else {\n return merge_dir(std::move(right), std::move(left), 0);\n }\n }\n\n static node_type build(const std::vector<bits_type>& bits, size_type l, size_type r, size_type len) {\n //std::cout << \"build \" << l << \" \" << r << \" \" << len << std::endl;\n if(l + 1 >= r) {\n //std::cout << \"create leaf\" << std::endl;\n //std::cout << \"-----------\" << std::endl;\n return node::new_leaf(bits[l], len, bits_popcount(bits[l]));\n }\n else {\n size_type m = (l + r) >> 1;\n return merge(build(bits, l, m, (m - l) * 64), build(bits, m, r, len - (m - l) * 64));\n }\n }\n\n static size_type at(node_reference node, size_type pos) {\n if(node->is_leaf) {\n return node->at_bits(pos);\n }\n else if(pos < node->child(0)->size()) {\n return at(node->child(0), pos);\n }\n else {\n return at(node->child(1), pos - node->child(0)->size());\n }\n }\n\n static size_type rank(node_reference node, size_type pos) {\n if(node->is_leaf) {\n return node->rank(pos);\n }\n else if(pos < node->child(0)->size()) {\n return rank(node->child(0), pos);\n }\n else {\n return node->child(0)->popcount() + rank(node->child(1), pos - node->child(0)->size());\n }\n }\n\n\n node_type root;\n\n dynamic_bitvector(): root(node::new_leaf(0, 0, 0)) {}\n dynamic_bitvector(const std::vector<bits_type>& bits, size_type len): root(build(bits, 0, bits.size(), len)) {}\n void insert(size_type pos, bool bit) {\n root = insert(std::move(root), pos, bit);\n }\n void erase(size_type pos) {\n root = erase(std::move(root), pos);\n }\n bool at(size_type pos) const {\n return at(root, pos);\n }\n size_type rank(size_type pos) const {\n return rank(root, pos);\n }\n size_type rank(size_type pos, bool bit) const {\n if(bit) {\n return rank(root, pos);\n }\n else {\n return pos - rank(root, pos);\n }\n }\n size_type size() const {\n return root->size();\n }\n\n void debug_tree(node_reference node, std::string d) const {\n if(node->is_leaf) {\n std::cout << d << \"leaf \" << node->size() << \" \" << node->popcount() << \" -----------\" << std::endl;\n std::cout << d << std::bitset<bit_limit * 2>(node->bits()) << std::endl;\n std::cout << d << \"-------------\" << std::endl;\n }\n else {\n std::cout << d << \"node \" << node->size() << \" \" << node->popcount() << \" ----------\" << std::endl;\n std::cout << d << \"left\" << std::endl;\n debug_tree(node->child(0), d + \" \");\n std::cout << d << \"--------------\" << std::endl;\n std::cout << d << \"right\" << std::endl;\n debug_tree(node->child(1), d + \" \");\n std::cout << d << \"--------------\" << std::endl;\n }\n }\n\n void debug_tree() const {\n debug_tree(root, \"\");\n }\n};\n\n#include <vector>\nstruct dynamic_wavelet_matrix {\n using Integer = std::size_t;\n using integer_type = Integer;\n using size_type = std::size_t;\n\n\n const size_type depth;\n const size_type len;\n std::vector<dynamic_bitvector> mat;\n std::vector<size_type> spl;\n\npublic:\n\n dynamic_wavelet_matrix(const std::vector<integer_type>& arr, size_type de)\n : depth(de),\n mat(de),\n len(arr.size()),\n spl(std::vector<size_type>(depth, 0)) {\n std::vector<size_type> idx(len);\n std::vector<size_type> left(len), right(len);\n\n for(size_type i = 0;i < len;i++) idx[i] = i;\n\n for(size_type d = depth; d-- > 0;) {\n size_type l = 0, r = 0;\n dynamic_bitvector::bitvector_builder builder(len);\n for(size_type i = 0; i < len; i++) {\n size_type k = (arr[idx[i]] >> d) & 1;\n if(k) right[r++] = idx[i], builder.set(i);\n else left[l++] = idx[i];\n }\n mat[d] = builder.build();\n spl[d] = l;\n swap(idx, left);\n for(size_type i = 0; i < r; i++) idx[i + l] = right[i];\n }\n }\n\n void insert(size_type i, integer_type x) {\n for(size_type d = depth; d --> 0;) {\n size_type k = ((x >> d) & 1);\n mat[d].insert(i, k);\n i = mat[d].rank(i, k) + spl[d] * k;\n if(k == 0) spl[d]++;\n }\n }\n\n void erase(size_type i) {\n for(size_type d = depth; d--> 0;) {\n size_type k = mat[d].at(i);\n mat[d].erase(i);\n i = mat[d].rank(i, k) + spl[d] * k;\n if(k == 0) spl[d]--;\n }\n }\n\n integer_type at(size_type i) const {\n integer_type x = static_cast<integer_type>(0);\n for(size_type d = depth; d-- > 0;) {\n size_type k = mat[d].at(i);\n x |= (static_cast<integer_type>(k) << d);\n i = mat[d].rank(i, k) + spl[d] * k;\n }\n return x;\n }\n\n // counting elements that equal to x in range [left, right)\n size_type rank_x(size_type left, size_type right, integer_type x) const {\n for(size_type d = depth; d-- > 0;) {\n size_type k = ((x >> d) & 1);\n left = mat[d].rank(left, k) + spl[d] * k;\n right = mat[d].rank(right, k) + spl[d] * k;\n }\n return right - left;\n }\n\n // sorted(arr[left..right])[i]\n integer_type quantile(size_type left, size_type right, size_type i) const {\n integer_type x = static_cast<integer_type>(0);\n for(size_type d = depth; d-- > 0;) {\n size_type cnt = mat[d].rank(right, 0) - mat[d].rank(left, 0);\n size_type k = (i < cnt) ? 0 : 1;\n x |= (k << d);\n left = mat[d].rank(left, k) + spl[d] * k;\n right = mat[d].rank(right, k) + spl[d] * k;\n }\n return x;\n }\n\n struct rank_result {\n size_type le;\n size_type eq;\n size_type mo;\n };\n\n // couting elements that less than x, equal to x, and more than x in range [left, right)\n rank_result rank_less_eq_more(size_type left, size_type right, integer_type x) const {\n size_type le = 0, mo = 0;\n for(size_type d = depth; d --> 0;) {\n size_type k = (x >> d) & 1;\n size_type l = mat[d].rank(left, 1);\n size_type r = mat[d].rank(right, 1);\n if(k == 0) {\n mo += r - l;\n left -= l;\n right -= r;\n }\n else {\n le += (right - left) - (r - l);\n left = l + spl[d];\n right = r + spl[d];\n }\n }\n return rank_result { le, right - left, mo };\n }\n\n size_type rangefreq(size_type left, size_type right, integer_type x, integer_type y, integer_type l, size_type d) const {\n integer_type r = l + (1 << d);\n if(x <= l && r <= y) {\n return right - left;\n }\n else if(y <= l || r <= x) {\n return 0;\n }\n else {\n d--;\n size_type lr = mat[d].rank(left, 1);\n size_type rr = mat[d].rank(right, 1);\n return\n rangefreq(left - lr, right - rr, x, y, l, d) +\n rangefreq(lr + spl[d], rr + spl[d], x, y, l + (1 << d), d);\n }\n }\n\n size_type rangefreq(size_type left, size_type right, integer_type x, integer_type y) const {\n return rangefreq(left, right, x, y, 0, depth);\n }\n\n size_type rangefreq_count(size_type left, size_type right, integer_type x, integer_type y) const {\n auto p = rank_less_eq_more(left, right, x);\n auto q = rank_less_eq_more(left, right, y);\n return p.eq + p.mo - q.eq - q.mo;\n }\n};\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing uint = unsigned;\nusing pcc = pair<char, char>;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nusing pdd = pair<ld, ld>;\nusing tuplis = array<ll, 3>;\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\nconst ll LINF=0x1fffffffffffffff;\nconst ll MINF=0x7fffffffffff;\nconst int INF=0x3fffffff;\nconst int MOD=1000000007;\nconst int MODD=998244353;\nconst ld DINF=numeric_limits<ld>::infinity();\nconst ld EPS=1e-9;\nconst ld PI=3.1415926535897932;\nconst ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};\nconst ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};\n#define overload5(a,b,c,d,e,name,...) name\n#define overload4(a,b,c,d,name,...) name\n#define overload3(a,b,c,name,...) name\n#define rep1(n) for(ll i=0;i<n;++i)\n#define rep2(i,n) for(ll i=0;i<n;++i)\n#define rep3(i,a,b) for(ll i=a;i<b;++i)\n#define rep4(i,a,b,c) for(ll i=a;i<b;i+=c)\n#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(n) for(ll i=n;i--;)\n#define rrep2(i,n) for(ll i=n;i--;)\n#define rrep3(i,a,b) for(ll i=b;i-->(a);)\n#define rrep4(i,a,b,c) for(ll i=(a)+((b)-(a)-1)/(c)*(c);i>=(a);i-=c)\n#define rrep(...) overload4(__VA_ARGS__,rrep4,rrep3,rrep2,rrep1)(__VA_ARGS__)\n#define each1(i,a) for(auto&&i:a)\n#define each2(x,y,a) for(auto&&[x,y]:a)\n#define each3(x,y,z,a) for(auto&&[x,y,z]:a)\n#define each4(w,x,y,z,a) for(auto&&[w,x,y,z]:a)\n#define each(...) overload5(__VA_ARGS__,each4,each3,each2,each1)(__VA_ARGS__)\n#define all1(i) begin(i),end(i)\n#define all2(i,a) begin(i),begin(i)+a\n#define all3(i,a,b) begin(i)+a,begin(i)+b\n#define all(...) overload3(__VA_ARGS__,all3,all2,all1)(__VA_ARGS__)\n#define rall1(i) (i).rbegin(),(i).rend()\n#define rall2(i,k) (i).rbegin(),(i).rbegin()+k\n#define rall3(i,a,b) (i).rbegin()+a,(i).rbegin()+b\n#define rall(...) overload3(__VA_ARGS__,rall3,rall2,rall1)(__VA_ARGS__)\n#define sum(...) accumulate(all(__VA_ARGS__),0LL)\n#define dsum(...) accumulate(all(__VA_ARGS__),0.0L)\n#define Msum(...) accumulate(all(__VA_ARGS__),0_M)\n#define elif else if\n#define unless(a) if(!(a))\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define ULL(...) ull __VA_ARGS__;in(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__;in(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__;in(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__;in(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__;in(__VA_ARGS__)\n#define Sort(a) sort(all(a))\n#define Rev(a) reverse(all(a))\n#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\n#define vec(type,name,...) vector<type>name(__VA_ARGS__)\n#define VEC(type,name,size) vector<type>name(size);in(name)\n#define vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name)\n#define vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\ntemplate<class T> auto min(const T& a){ return *min_element(all(a)); }\ntemplate<class T> auto max(const T& a){ return *max_element(all(a)); }\ninline ll popcnt(ull a){ return __builtin_popcountll(a); }\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\ntemplate<class T> bool chmin(T& a, const T& b){ if(a > b){ a = b; return 1; } return 0; }\ntemplate<class T> bool chmax(T& a, const T& b){ if(a < b){ a = b; return 1; } return 0; }\ntemplate<class T, class U> bool chmin(T& a, const U& b){ if(a > T(b)){ a = b; return 1; } return 0; }\ntemplate<class T, class U> bool chmax(T& a, const U& b){ if(a < T(b)){ a = b; return 1; } return 0; }\nvector<ll> iota(ll n, ll begin = 0){ vector<ll> a(n); iota(a.begin(), a.end(), begin); return a; }\nvector<pll> factor(ull x){ vector<pll> ans; for(ull i = 2; i * i <= x; i++) if(x % i == 0){ ans.push_back({i, 1}); while((x /= i) % i == 0) ans.back().second++; } if(x != 1) ans.push_back({x, 1}); return ans; }\nvector<ll> divisor(ull x){ vector<ll> ans; for(ull i = 1; i * i <= x; i++) if(x % i == 0) ans.push_back(i); rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]); return ans; }\ntemplate<class T> unordered_map<T, ll> press(vector<T>& a){ Uniq(a); unordered_map<T, ll> ans; rep(a.size()) ans[a[i]] = i; return ans; }\ntemplate<class T> auto run_press(const T& a){ vector<pair<remove_const_t<remove_reference_t<decltype(a[0])>>, ll>> ans; each(x, a){ if(ans.empty() || ans.back().first != x) ans.emplace_back(x, 1); else ans.back().second++; } return ans; }\nint scan(){ return getchar(); }\nvoid scan(int& a){ scanf(\"%d\", &a); }\nvoid scan(unsigned& a){ scanf(\"%u\", &a); }\nvoid scan(long& a){ scanf(\"%ld\", &a); }\nvoid scan(long long& a){ scanf(\"%lld\", &a); }\nvoid scan(unsigned long long& a){ scanf(\"%llu\", &a); }\nvoid scan(char& a){ do a = getchar(); while(a == ' ' || a == '\\n'); }\nvoid scan(float& a){ scanf(\"%f\", &a); }\nvoid scan(double& a){ scanf(\"%lf\", &a); }\nvoid scan(long double& a){ scanf(\"%Lf\", &a); }\nvoid scan(vector<bool>& a){ for(unsigned i = 0; i < a.size(); i++){ int b; scan(b); a[i] = b; } }\nvoid scan(char a[]){ scanf(\"%s\", a); }\nvoid scan(string& a){ cin >> a; }\ntemplate<class T> void scan(vector<T>&);\ntemplate<class T, size_t size> void scan(array<T, size>&);\ntemplate<class T, class L> void scan(pair<T, L>&);\ntemplate<class T, size_t size> void scan(T(&)[size]);\ntemplate<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T> void scan(deque<T>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i); }\ntemplate<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); }\ntemplate<class T, size_t size> void scan(T (&a)[size]){ for(auto&& i : a) scan(i); }\ntemplate<class T> void scan(T& a){ cin >> a; }\nvoid in(){}\ntemplate <class... T> void in(T&... a){ (void)initializer_list<int>{ (scan(a), 0)... }; }\nvoid print(){ putchar(' '); }\nvoid print(bool a){ printf(\"%d\", a); }\nvoid print(int a){ printf(\"%d\", a); }\nvoid print(unsigned a){ printf(\"%u\", a); }\nvoid print(long a){ printf(\"%ld\", a); }\nvoid print(long long a){ printf(\"%lld\", a); }\nvoid print(unsigned long long a){ printf(\"%llu\", a); }\nvoid print(char a){ printf(\"%c\", a); }\nvoid print(char a[]){ printf(\"%s\", a); }\nvoid print(const char a[]){ printf(\"%s\", a); }\nvoid print(float a){ printf(\"%.15f\", a); }\nvoid print(double a){ printf(\"%.15f\", a); }\nvoid print(long double a){ printf(\"%.15Lf\", a); }\nvoid print(const string& a){ for(auto&& i : a) print(i); }\ntemplate<class T> void print(const complex<T>& a){ if(a.real() >= 0) print('+'); print(a.real()); if(a.imag() >= 0) print('+'); print(a.imag()); print('i'); }\ntemplate<class T> void print(const vector<T>&);\ntemplate<class T, size_t size> void print(const array<T, size>&);\ntemplate<class T, class L> void print(const pair<T, L>& p);\ntemplate<class T, size_t size> void print(const T (&)[size]);\ntemplate<class T> void print(const vector<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T> void print(const deque<T>& a){ if(a.empty()) return; print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T, size_t size> void print(const array<T, size>& a){ print(a[0]); for(auto i = a.begin(); ++i != a.end(); ){ putchar(' '); print(*i); } }\ntemplate<class T, class L> void print(const pair<T, L>& p){ print(p.first); putchar(' '); print(p.second); }\ntemplate<class T, size_t size> void print(const T (&a)[size]){ print(a[0]); for(auto i = a; ++i != end(a); ){ putchar(' '); print(*i); } }\ntemplate<class T> void print(const T& a){ cout << a; }\nint out(){ putchar('\\n'); return 0; }\ntemplate<class T> int out(const T& t){ print(t); putchar('\\n'); return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\n#ifdef DEBUG\ninline ll __lg(ull x){ return 63 - __builtin_clzll(x); }\n#define debug(...) { print(#__VA_ARGS__); print(\":\"); out(__VA_ARGS__); }\n#else\n#define debug(...) void(0)\n#endif\nint first(bool i = true){ return out(i?\"first\":\"second\"); }\nint First(bool i = true){ return out(i?\"First\":\"Second\"); }\nint yes(bool i = true){ return out(i?\"yes\":\"no\"); }\nint Yes(bool i = true){ return out(i?\"Yes\":\"No\"); }\nint No(){ return out(\"No\"); }\nint YES(bool i = true){ return out(i?\"YES\":\"NO\"); }\nint NO(){ return out(\"NO\"); }\nint Yay(bool i = true){ return out(i?\"Yay!\":\":(\"); }\nint possible(bool i = true){ return out(i?\"possible\":\"impossible\"); }\nint Possible(bool i = true){ return out(i?\"Possible\":\"Impossible\"); }\nint POSSIBLE(bool i = true){ return out(i?\"POSSIBLE\":\"IMPOSSIBLE\"); }\nvoid Case(ll i){ printf(\"Case #%lld: \", i); }\n\n\n\ntemplate<class T>\nstruct SegmentTree{\n virtual T f(const T&, const T&) const = 0;\n const T def_value;\n ll size = 1, rank = 0, expected_size;\n vector<T> data;\n SegmentTree(ll n, const T& def_value): def_value(def_value), expected_size(n){\n while(size < expected_size){\n size *= 2;\n rank++;\n }\n data.assign(size * 2, def_value);\n }\n SegmentTree(const vector<T>& v, const T& def_value): def_value(def_value), expected_size(v.size()){\n while(size < expected_size){\n size *= 2;\n rank++;\n }\n data.assign(size * 2, def_value);\n for(ll i = 0; i < v.size(); i++) data[size + i] = v[i];\n // for(ll i = Base::size; --i;) Base::data[i] = f(Base::data[i * 2], Base::data[i * 2 + 1]);\n }\n T operator[](ll at) const {\n return data[size + at];\n }\n void update(ll at){\n while(at /= 2) data[at] = f(data[at * 2], data[at * 2 + 1]);\n }\n void set(ll at, const T& val){\n at += size;\n data[at] = val;\n update(at);\n }\n void add(ll at, const T& val){\n at += size;\n data[at] += val;\n update(at);\n }\n T get(ll l, ll r) const {\n T L = def_value, R = def_value;\n l += size; r += size;\n for(; l < r; l /= 2, r /= 2){\n if(l & 1) L = f(L, data[l++]);\n if(r & 1) R = f(data[--r], R);\n }\n return f(L, R);\n }\n template<class F> ll find_last(const F& check, ll l = 0) const { // max x s.t. check(get(l, x)) == true\n if(l == expected_size) return expected_size;\n ll height = 0, at = l + size;\n T val = def_value;\n for(; height <= rank; height++) if(at >> height & 1){\n T val2 = f(val, data[at >> height]);\n if(check(val2)){\n at += 1 << height;\n if(at == size * 2) return expected_size;\n val = val2;\n }\n else break;\n }\n for(; height--; ){\n T val2 = f(val, data[at >> height]);\n if(check(val2)){\n at += 1 << height;\n if(at == size * 2) return expected_size;\n val = val2;\n }\n }\n return min(at - size, expected_size);\n }\n template<class F> ll find_first(const F& check, ll r) const { // min x s.t. check(get(x, r)) == true\n if(!r) return 0;\n ll height = 0, at = r + size;\n T val = def_value;\n for(; height <= rank; height++) if(at >> height & 1){\n T val2 = f(val, data[at >> height ^ 1]);\n if(check(val2)){\n at -= 1 << height;\n if(at == size) return 0;\n val = val2;\n }\n else break;\n }\n for(; height--; ){\n T val2 = f(val, data[(at >> height) - 1]);\n if(check(val2)){\n at -= 1 << height;\n if(at == size) return 0;\n val = val2;\n }\n }\n return at - size;\n }\n void clear(){\n for(auto& i : data) i = def_value;\n }\n};\ntemplate<class T>\nstruct RSQ : SegmentTree<T>{\n using Base = SegmentTree<T>;\n T f(const T& a, const T& b) const {return a + b;}\n RSQ(ll n, const T& def_value = T()) : Base(n, def_value){}\n RSQ(const vector<T>& v, const T& def_value = T()) : Base(v, def_value){\n for(ll i = Base::size; --i;) Base::data[i] = f(Base::data[i * 2], Base::data[i * 2 + 1]);\n }\n};\nint main(){\n LL(n);\n VEC(ll,a,n);\n {\n auto b=a;\n auto p=press(b);\n each(x,a)x=p[x];\n }\n dynamic_wavelet_matrix wm(std::vector<std::size_t>(all(a)), 31);\n RSQ<ll>seg(n);\n ll ans=0;\n each(x,a){\n ans+=seg.get(x+1,seg.size);\n seg.set(x,1);\n }\n LL(q);\n rep(q){\n LL(x,y);\n x--;\n y--;\n if(a[x]<a[y])ans+=wm.rangefreq(x+1,y,a[x],a[y])*2+1;\n else ans-=wm.rangefreq(x+1,y,a[y],a[x])*2+1;\n wm.erase(x);\n wm.insert(x,a[y]);\n wm.erase(y);\n wm.insert(y,a[x]);\n swap(a[x],a[y]);\n out(ans);\n }\n}", "accuracy": 0.6, "time_ms": 40, "memory_kb": 4260, "score_of_the_acc": -0.0143, "final_rank": 17 } ]
aoj_0452_cpp
Stamp Rally You are in charge of $N$ lodges and the road that connects each lodge. Each lodge has a number from 1 to $N$. There are $N-1$ paths in total. All paths can be traveled in both directions. Also, from any lodge, you can reach other lodges by taking some of the paths. You decide to start a stamp rally by placing stamps at all the lodges so that the lodge visitors can enjoy themselves. The rules of this stamp rally are as follows. Visitors choose a number of mountain lodges. At this time, the number of lodges that can be chosen is from 2 to $N$. After that, they move to one of the lodges they have chosen and start the stamp rally from there. During the stamp rally, visitors move between the lodges along a path. They will visit all the lodges that they pass during their journey and stamp them there. If the user visits a lodge that has already been stamped, the stamp rally fails and ends at that point. When you have visited all the lodges you have chosen, the stamp rally will be successful and you will receive a prize. In order to make the stamp rally successful, users need to choose the correct route to visit the mountain lodges. However, depending on how the mountain lodges are chosen, it will not be possible to succeed no matter how the route is chosen. Therefore, we decided to only allow people to choose mountain lodges that would allow them to successfully complete the stamp rally. How many such combination of mountain lodges are there? You are given the information on the number of lodges and the paths that connect the lodges directly to each other will be given. When choosing from 2 to $N$ mountain lodges each, find the number of ways to choose mountain lodges that would allow the stamp rally to be successful for each number of lodges chosen. Input The input is given in the following form. $N$ $s_1$ $t_1$ $s_2$ $t_2$ : $s_{N-1}$ $t_{N-1}$ In the first line, the number of lodges $N$ ($2 \leq N \leq 200,000$) is given. In the following $N-1$ lines, the information of the path directly connecting the two lodges is given. $s_i$ and $t_i$ ($1 \leq s_i < t_i \leq N$) are the numbers of the two lodges connected by the $i$-th path. For any two lodges, there should be no more than one path that directly connects them. Output The output consists of $N-1$ lines, where the $i$-th line is the number of ways to choose lodge that would make the stamp rally successful if $i+1$ lodges were chosen. Divide the answer by 998,244,353 and output the remainder. Sample Input and Output Sample Input 5 1 2 2 3 3 4 3 5 Sample Output 10 8 2 0
[ { "submission_id": "aoj_0452_10397825", "code_snippet": "// AOJ #0452 Stamp Rally\n// 2025.4.19\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int MOD = 998244353, G = 3;\nconst ll MERGE_THRESHOLD = 1000000LL;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() {\n\tint n = 0; int c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Cout(int n) {\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tif (n < 0) pc('-'), n = -n;\n\t\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n\t\twhile (i--) pc(b[i]);\n\t}\n\tpc('\\n');\n}\n\nll modpow(ll a, ll e = MOD - 2) {\n ll r = 1;\n while (e) {\n if (e & 1) r = r * a % MOD;\n a = a * a % MOD;\n e >>= 1;\n }\n return r;\n}\n\nvoid ntt(vector<ll> &a, bool inv) {\n int n = a.size(), j = 0;\n for (int i = 1; i < n; i++) {\n int bit = n >> 1;\n for (; j & bit; bit >>= 1) j ^= bit;\n j |= bit;\n if (i < j) swap(a[i], a[j]);\n }\n for (int len = 1; len < n; len <<= 1) {\n ll w0 = modpow(G, (MOD - 1) / (len << 1));\n if (inv) w0 = modpow(w0);\n vector<ll> w(len);\n w[0] = 1;\n for (int i = 1; i < len; i++) w[i] = w[i - 1] * w0 % MOD;\n for (int i = 0; i < n; i += len << 1) {\n for (int k = 0; k < len; k++) {\n ll u = a[i + k];\n ll v = a[i + k + len] * w[k] % MOD;\n a[i + k] = (u + v < MOD ? u + v : u + v - MOD);\n a[i + k + len] = (u - v >= 0 ? u - v : u - v + MOD);\n }\n }\n }\n if (inv) {\n ll invn = modpow(n);\n for (ll &x : a) x = x * invn % MOD;\n }\n}\n\nvector<ll> conv(const vector<ll> &A, const vector<ll> &B) {\n int na = A.size(), nb = B.size(), n = 1;\n while (n < na + nb - 1) n <<= 1;\n vector<ll> a(A.begin(), A.end()), b(B.begin(), B.end());\n a.resize(n); b.resize(n);\n ntt(a, false);\n ntt(b, false);\n for (int i = 0; i < n; i++) a[i] = a[i] * b[i] % MOD;\n ntt(a, true);\n a.resize(na + nb - 1);\n return a;\n}\n\nint n;\nvector<vector<int>> g;\nvector<bool> used;\nvector<int> sz;\nvector<ll> freq;\nconst ll INV2 = (MOD + 1) / 2;\n\nvoid dfs_sz(int u, int p) {\n sz[u] = 1;\n for (int v : g[u]) if (v != p && !used[v]) {\n dfs_sz(v, u);\n sz[u] += sz[v];\n }\n}\n\nint find_centroid(int u, int p, int tot) {\n for (int v : g[u]) if (v != p && !used[v] && sz[v] > tot / 2) return find_centroid(v, u, tot);\n return u;\n}\n\nvoid dfs_dist(int u, int p, int d, vector<ll> &ds) {\n if ((int)ds.size() <= d) ds.resize(d + 1);\n ds[d]++;\n for (int v : g[u]) if (v != p && !used[v]) dfs_dist(v, u, d + 1, ds);\n}\n\nvoid decomp(int root) {\n dfs_sz(root, -1);\n int c = find_centroid(root, -1, sz[root]);\n used[c] = true;\n\n vector<ll> cnt(1, 1);\n for (int v : g[c]) if (!used[v]) {\n vector<ll> ds;\n dfs_dist(v, c, 1, ds);\n int s = ds.size();\n int t = cnt.size();\n\n if (1LL * s * t <= MERGE_THRESHOLD) {\n for (int i = 1; i < s; i++) {\n if (!ds[i]) continue;\n for (int j = 0; j < t; j++) freq[i + j] = (freq[i + j] + ds[i] * cnt[j]) % MOD;\n }\n } else {\n auto C = conv(ds, cnt);\n for (int k = 0, L = C.size(); k < L; k++) freq[k] = (freq[k] + C[k]) % MOD;\n }\n if (s > t) cnt.resize(s);\n for (int i = 1; i < s; i++) {\n cnt[i] += ds[i];\n if (cnt[i] >= MOD) cnt[i] -= MOD;\n }\n }\n for (int v : g[c]) if (!used[v]) decomp(v);\n}\n\nint main() {\n n = Cin();\n g.assign(n, {});\n for (int i = 0; i < n - 1; i++) {\n int u = Cin()-1, v = Cin()-1;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n\n used.assign(n, false);\n sz.assign(n, 0);\n freq.assign(n, 0);\n\n decomp(0);\n\n vector<ll> fact(n+1,1), ifact(n+1,1);\n for (int i = 1; i <= n; i++) fact[i] = fact[i-1] * i % MOD;\n ifact[n] = modpow(fact[n]);\n for (int i = n; i > 0; i--) ifact[i-1] = ifact[i] * i % MOD;\n\n int D = n - 1;\n vector<ll> Gv(D);\n for (int i = 0; i < D; i++) Gv[i] = freq[i+1];\n\n vector<ll> F(D);\n for (int i = 0; i < D; i++) F[i] = Gv[i] * fact[i] % MOD;\n\n vector<ll> Rv = F;\n reverse(Rv.begin(), Rv.end());\n vector<ll> Iv(D);\n for (int j = 0; j < D; j++) Iv[j] = ifact[j];\n\n auto W = conv(Rv, Iv);\n\n vector<ll> H(D);\n for (int j = 0; j < D; j++) {\n ll v = W[D-1-j] % MOD;\n H[j] = v * ifact[j] % MOD;\n }\n\n for (int k = 2; k <= n; k++) Cout(H[k-2]);\n return 0;\n}", "accuracy": 1, "time_ms": 380, "memory_kb": 53492, "score_of_the_acc": -0.2446, "final_rank": 3 }, { "submission_id": "aoj_0452_10388120", "code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\n#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)\n#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)\n#define Endl endl\n#define all(a) a.begin(), a.end()\n#define pr(i, j) make_pair(i, j)\n#define isin(x, l, r) (l <= x && x < r)\n#define chmin(a, b) a = min(a, b)\n#define chmax(a, b) a = max(a, b)\n#define srt(ar) sort(ar.begin(), ar.end())\n#define rev(ar) reverse(ar.begin(), ar.end())\n#define jge(f, s, t) cout << (f ? s : t) << endl\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#define printar(ar) \\\n do \\\n { \\\n for (auto dbg : ar) \\\n { \\\n cout << dbg << \" \"; \\\n } \\\n cout << endl; \\\n } while (0)\nconst ll inf = 1e18;\nconst ld pi = 3.14159265358979;\nconst ld eps = 1e-9;\ntemplate <class T, ll n, ll idx = 0>\nauto make_vec(const ll (&d)[n], const T &init) noexcept\n{\n if constexpr (idx < n)\n return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\n else\n return init;\n}\n\ntemplate <class T, ll n>\nauto make_vec(const ll (&d)[n]) noexcept\n{\n return make_vec(d, T{});\n}\n//////////////// 以下を貼る ////////////////\ntemplate <class T>\nsize_t HashCombine(const size_t seed, const T &v)\n{\n return seed ^ (std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2));\n}\n/* pair用 */\ntemplate <class T, class S>\nstruct std::hash<std::pair<T, S>>\n{\n size_t operator()(const std::pair<T, S> &keyval) const noexcept\n {\n return HashCombine(std::hash<T>()(keyval.first), keyval.second);\n }\n};\n\nclass CentroidDecomposition\n{\nprivate:\n void build_inside(vector<int> &lavels, vector<vector<int>> &g, int from)\n {\n int x = centroid(g);\n int r = lavels[x];\n /*\n lavels_each[r] = lavels;\n graph_each[r] = g;\n 重いので使用不可！\n */\n if (from != -1)\n {\n centroid_graph[r].push_back(from);\n centroid_graph[from].push_back(r);\n centroid_graph_belong[r] = from;\n }\n else\n {\n G = r;\n }\n vector<int> visit_t(lavels.size(), -1);\n rep(i, 0, g[x].size())\n {\n int next = g[x][i];\n vector<int> lavels_new;\n vector<int> v_g;\n queue<pair<int, int>> bfs;\n bfs.push(pr(next, x));\n int t = 0;\n while (!bfs.empty())\n {\n int now = bfs.front().first;\n int prev = bfs.front().second;\n bfs.pop();\n lavels_new.push_back(lavels[now]);\n v_g.push_back(now);\n visit_t[now] = t;\n t++;\n for (auto v : g[now])\n {\n if (v != prev)\n {\n bfs.push(pr(v, now));\n }\n }\n }\n vector<vector<int>> g_new(lavels_new.size());\n bfs.push(pr(next, x));\n while (!bfs.empty())\n {\n int now = bfs.front().first;\n int prev = bfs.front().second;\n int nx = visit_t[now];\n bfs.pop();\n for (auto v : g[now])\n {\n if (v != prev)\n {\n g_new[nx].push_back(visit_t[v]);\n g_new[visit_t[v]].push_back(nx);\n bfs.push(pr(v, now));\n }\n }\n }\n build_inside(lavels_new, g_new, r);\n }\n }\n int centroid(vector<vector<int>> &g)\n {\n int N = g.size();\n vector<int> sz(N);\n vector<int> centroid;\n function<void(int, int)> dfs = [&](int u, int prev)\n {\n sz[u] = 1;\n bool is_centroid = true;\n for (auto v : g[u])\n {\n if (v != prev)\n {\n dfs(v, u);\n sz[u] += sz[v];\n if (sz[v] > N / 2)\n {\n is_centroid = false;\n }\n }\n }\n if (N - sz[u] > N / 2)\n {\n is_centroid = false;\n }\n if (is_centroid)\n {\n centroid.push_back(u);\n }\n };\n dfs(0, -1);\n return centroid[0];\n }\n\npublic:\n /*\n vector<vector<int>> lavels_each; // graph_eachのラベル\n vector<vector<vector<int>>> graph_each; // 頂点iが重心(かつ根)となっているような木を返す\n 重いので使用不可！\n */\n vector<vector<int>> centroid_graph; // 重心同士を結んだ木\n vector<int> centroid_graph_belong; // 重心同士を結んだ木の、頂点iの親\n int G; // 元のグラフの重心\n void build(vector<vector<int>> &g)\n {\n int N = g.size();\n /*\n lavels_each.resize(N);\n graph_each.resize(N);\n */\n centroid_graph.resize(N);\n centroid_graph_belong.resize(N, -1);\n vector<int> lavels(N);\n rep(i, 0, N)\n {\n lavels[i] = i;\n }\n build_inside(lavels, g, -1);\n }\n void debug()\n {\n rep(i, 0, centroid_graph.size())\n {\n printar(centroid_graph[i]);\n }\n }\n CentroidDecomposition(vector<vector<int>> &g)\n {\n build(g);\n }\n};\n\nclass Num\n{\nprivate:\n vector<ll> fac_mod_ar = {};\n vector<ll> mobius_ar = {};\n vector<bool> isprime_ar = {};\n vector<ll> base_2_ar = {};\n\npublic:\n // gcd(a,b)を返す\n ll gcd(ll a, ll b)\n {\n if (a == 0 || b == 0)\n return 0;\n if (b > a)\n swap(a, b);\n if (a % b == 0)\n return b;\n else\n {\n return gcd(b, a % b);\n }\n }\n // lcm(a,b)を返す\n ll lcm(ll a, ll b)\n {\n return b / gcd(a, b) * a;\n }\n // a^b (modp)を返す\n ll exp(ll a, ll b, ll p)\n {\n if (b == 0)\n return 1;\n ll l = log2((b));\n ll num = l + 1;\n // cout << num << endl;\n base_2_ar.resize(num);\n base_2_ar[0] = a;\n rep(i, 1, num)\n {\n base_2_ar[i] = base_2_ar[i - 1] * base_2_ar[i - 1];\n base_2_ar[i] %= p;\n // cout << base_2[i] << endl;\n }\n ll ret = 1;\n rep(i, 0, num)\n {\n // cout << (b >> i) % 2;\n if ((b >> i) % 2 == 1)\n ret *= base_2_ar[i];\n ret %= p;\n }\n return ret;\n }\n // ax+by=gcd(a,b)を満たすx,yを求める\n ll ax_by(ll a, ll b, ll &x, ll &y)\n {\n if (b == 0)\n {\n x = 1;\n y = 0;\n return a;\n }\n ll d = ax_by(b, a % b, y, x);\n y -= a / b * x;\n return d;\n }\n // a(mod m1),b(modm2)なるxを求める 中国剰余定理\n ll CRT(ll a, ll m1, ll b, ll m2)\n {\n ll x, y;\n ax_by(m1, m2, x, y);\n y *= (a - b);\n x %= m2;\n x *= (b - a);\n x %= m2;\n ll k = (m1 * x + a);\n k %= m1 * m2;\n k += m1 * m2;\n k %= m1 * m2;\n return k;\n }\n // mod pにおけるaの逆元を求める\n ll inv(ll a, ll p)\n {\n ll ret, b;\n ax_by(a, p, ret, b);\n ret %= p;\n ret += p;\n ret %= p;\n return ret;\n }\n\n // φ(n)を求める\n ll phi(ll n)\n {\n ll ret = n;\n for (ll i = 2; i * i <= n; i++)\n {\n if (n % i == 0)\n {\n while (n % i == 0)\n n /= i;\n ret *= (i - 1);\n ret /= i;\n }\n }\n if (n != 1)\n {\n ret *= (n - 1);\n ret /= n;\n }\n return ret;\n }\n // 素数判定のための前計算 O(nloglogn)\n void isprime_init(ll n)\n {\n if (isprime_ar.size() >= n + 1)\n return;\n isprime_ar.resize(n + 1, true);\n isprime_ar[0] = false;\n isprime_ar[1] = false;\n for (ll i = 2; i <= n; i++)\n {\n if (isprime_ar[i])\n {\n for (ll j = 2 * i; j <= n; j += i)\n {\n isprime_ar[j] = false;\n }\n }\n }\n }\n // nCrmodのための前計算 O(n)\n void nCrmod_init(ll n, ll p)\n {\n if (fac_mod_ar.size() >= n + 1)\n return;\n fac_mod_ar.resize(0);\n fac_mod_ar.resize(n + 1);\n fac_mod_ar[0] = 1;\n rep(i, 1, n + 1)\n {\n fac_mod_ar[i] = fac_mod_ar[i - 1] * i;\n fac_mod_ar[i] %= p;\n }\n }\n // メビウス関数のための前計算 O(nloglogn)\n void mobius_init(ll n)\n {\n if (mobius_ar.size() >= n + 1)\n return;\n mobius_ar.resize(n + 1, 1);\n isprime_init(n);\n mobius_ar[1] = 1;\n for (ll i = 2; i <= n; i++)\n {\n if (!isprime(i))\n continue;\n mobius_ar[i] = -1;\n for (ll j = 2 * i; j <= n; j += i)\n {\n if (j % (i * i) == 0)\n mobius_ar[j] = 0;\n else\n mobius_ar[j] *= -1;\n }\n }\n }\n // nの素数判定 前計算が必要\n bool isprime(ll n)\n {\n isprime_init(n);\n return isprime_ar[n];\n }\n // n! mod pを求める 前計算が必要\n ll fac(ll n, ll p)\n {\n nCrmod_init(n, p);\n return fac_mod_ar[n];\n }\n // nCr(mod p)を求める 前計算が必要\n ll nCrmod(ll n, ll r, ll p)\n {\n nCrmod_init(n, p);\n ll ret = 1;\n ret *= fac_mod_ar[n];\n ret %= p;\n ret *= inv(fac_mod_ar[r], p);\n ret %= p;\n ret *= inv(fac_mod_ar[n - r], p);\n ret %= p;\n return ret;\n }\n // μ(n)を求める　前計算が必要\n ll mobius(ll n)\n {\n mobius_init(n);\n return mobius_ar[n];\n }\n};\n////////////////////////////////////////////////\n\nclass FastFourierTransform\n{\nprivate:\n ll P = 998244353;\n ll R = 1107296257;\n vector<ll> r_p;\n vector<ll> r_r;\n vector<ll> r_p_inv;\n vector<ll> r_r_inv;\n bool f_p = false;\n bool f_r = false;\n ll mod_inv(ll n, ll p)\n {\n ll b = p, u = 1, v = 0;\n while (b)\n {\n ll t = n / b;\n n -= t * b;\n swap(n, b);\n u -= t * v;\n swap(u, v);\n }\n u %= p;\n if (u < 0)\n u += p;\n return u;\n }\n void dft(vector<complex<ld>> &func, bool isinv)\n {\n ll n = func.size();\n if (n == 1)\n {\n return;\n }\n else\n {\n vector<complex<ld>> a, b;\n rep(i, 0, n)\n {\n if (i % 2 == 0)\n {\n a.push_back(func[i]);\n }\n else\n {\n b.push_back(func[i]);\n }\n }\n dft(a, isinv);\n dft(b, isinv);\n complex<ld> now = 1;\n ld theta = (2.0 * acos(-1)) / n;\n if (isinv)\n {\n theta *= -1.0;\n }\n complex<ld> z = polar((ld)1.0, theta);\n rep(i, 0, n)\n {\n func[i] = a[i % (n / 2)] + now * b[i % (n / 2)];\n now *= z;\n }\n return;\n }\n }\n void nft_int(vector<ll> &func, bool isinv, ll p)\n {\n ll n = func.size();\n if (n == 1)\n {\n return;\n }\n else\n {\n ll x = log2(n);\n rep(i, 0, n)\n {\n ll j = 0;\n rep(k, 0, x)\n {\n j |= ((i >> k) & 1LL) << (x - 1 - k);\n }\n if (i < j)\n {\n swap(func[i], func[j]);\n }\n }\n rep(i, 0, x)\n {\n ll b = (1LL << i);\n ll now = 1;\n ll z = -1;\n if (p == P)\n {\n z = r_p[i + 1];\n if (isinv)\n {\n z = r_p_inv[i + 1];\n }\n }\n else\n {\n z = r_r[i + 1];\n if (isinv)\n {\n z = r_r_inv[i + 1];\n }\n }\n rep(j, 0, b)\n {\n for (int k = 0; k < n; k += b * 2)\n {\n ll s = func[j + k];\n ll t = func[j + k + b] * now;\n t %= p;\n ll A = s + t;\n A %= p;\n ll B = s - t + p;\n B %= p;\n func[j + k] = A;\n func[j + k + b] = B;\n }\n now *= z;\n now %= p;\n }\n }\n return;\n }\n }\n vector<ll> convolution_110(vector<ll> f, vector<ll> g)\n {\n if (!f_r)\n {\n r_r.resize(26);\n r_r_inv.resize(26);\n r_r[25] = 1087287097;\n drep(i, 25, 0)\n {\n r_r[i] = r_r[i + 1] * r_r[i + 1];\n r_r[i] %= R;\n }\n rep(i, 0, 26)\n {\n r_r_inv[i] = mod_inv(r_r[i], R);\n }\n f_r = true;\n }\n ll n = 1;\n ll m = f.size() + g.size() - 1;\n while (n <= m)\n {\n\n n *= 2;\n }\n f.resize(n);\n g.resize(n);\n assert(f.size() != 0 && g.size() != 0);\n vector<ll> nf, ng;\n rep(i, 0, n)\n {\n nf.push_back(f[i]);\n ng.push_back(g[i]);\n }\n nft_int(nf, false, R);\n nft_int(ng, false, R);\n vector<ll> inv(n);\n rep(i, 0, n)\n {\n inv[i] = nf[i] * ng[i];\n inv[i] %= R;\n }\n nft_int(inv, true, R);\n vector<ll> ret(n);\n ll n_inv = mod_inv(n, R);\n rep(i, 0, n)\n {\n ret[i] = inv[i] * n_inv;\n ret[i] %= R;\n }\n ret.resize(m);\n return ret;\n }\n\npublic:\n vector<complex<ld>> convolution(vector<complex<ld>> f, vector<complex<ld>> g)\n {\n ll n = 1;\n ll m = f.size() + g.size() - 1;\n while (n < m)\n {\n n *= 2;\n }\n f.resize(n);\n g.resize(n);\n assert(f.size() != 0 && g.size() != 0);\n vector<complex<ld>> nf, ng;\n rep(i, 0, n)\n {\n nf.push_back(f[i]);\n ng.push_back(g[i]);\n }\n dft(nf, false),\n dft(ng, false);\n vector<complex<ld>> inv(n);\n rep(i, 0, n)\n {\n inv[i] = nf[i] * ng[i];\n }\n dft(inv, true);\n vector<complex<ld>> ret(n);\n rep(i, 0, n)\n {\n ret[i] = (inv[i].real()) / (ld)n;\n }\n ret.resize(m);\n return ret;\n }\n vector<ll> convolution_998(vector<ll> f, vector<ll> g)\n {\n if (!f_p)\n {\n r_p.resize(24);\n r_p_inv.resize(24);\n r_p[23] = 15311432;\n drep(i, 23, 0)\n {\n r_p[i] = r_p[i + 1] * r_p[i + 1];\n r_p[i] %= P;\n }\n rep(i, 0, 24)\n {\n r_p_inv[i] = mod_inv(r_p[i], P);\n }\n f_p = true;\n }\n ll n = 1;\n ll m = f.size() + g.size() - 1;\n while (n <= m)\n {\n n *= 2;\n }\n f.resize(n);\n g.resize(n);\n assert(f.size() != 0 && g.size() != 0);\n vector<ll> nf, ng;\n rep(i, 0, n)\n {\n nf.push_back(f[i]);\n ng.push_back(g[i]);\n }\n nft_int(nf, false, P);\n nft_int(ng, false, P);\n vector<ll> inv(n);\n rep(i, 0, n)\n {\n inv[i] = nf[i] * ng[i];\n inv[i] %= P;\n }\n nft_int(inv, true, P);\n vector<ll> ret(n);\n ll n_inv = mod_inv(n, P);\n rep(i, 0, n)\n {\n ret[i] = inv[i] * n_inv;\n ret[i] %= P;\n }\n ret.resize(m);\n return ret;\n }\n /*\n vector<ll> convolution_ll(vector<ll> f, vector<ll> g)\n {\n vector<ll> a = convolution_110(f, g);\n vector<ll> b = convolution_998(f, g);\n Num N;\n vector<ll> ret;\n rep(i, 0, a.size())\n {\n ll x = N.CRT(a[i], R, b[i], P);\n ret.push_back(x);\n }\n return ret;\n }\n */\n};\nvector<bool> flg;\nvector<vector<int>> G;\nll mod = 998244353;\nFastFourierTransform FFT;\nvector<ll> f(int rt)\n{\n vector<ll> s(1, 1);\n vector<ll> ans1(1, 1);\n vector<ll> ans2(1, 1);\n rep(i, 0, G[rt].size())\n {\n vector<ll> d(1, 0);\n function<void(int, int, int)> dfs = [&](int u, int prev, int depth)\n {\n if (depth >= (int)d.size())\n {\n d.push_back(1);\n }\n else\n {\n d[depth]++;\n }\n for (auto v : G[u])\n {\n if (v != prev && !flg[v])\n {\n dfs(v, u, depth + 1);\n }\n }\n };\n if (!flg[G[rt][i]])\n {\n dfs(G[rt][i], rt, 1);\n }\n vector<ll> ar = FFT.convolution_998(d, d);\n rep(i, 1, d.size())\n {\n if (ar.size() <= 2 * i)\n {\n ar.resize(2 * i + 1);\n }\n ar[2 * i] += mod - d[i];\n ar[2 * i] %= mod;\n if (s.size() <= i)\n {\n s.resize(i + 1);\n }\n s[i] += d[i];\n s[i] %= mod;\n }\n rep(i, 1, ar.size())\n {\n ar[i] *= 499122177;\n ar[i] %= mod;\n if (ans1.size() <= i)\n {\n ans1.resize(i + 1);\n }\n ans1[i] += ar[i];\n ans1[i] %= mod;\n }\n }\n ans2 = FFT.convolution_998(s, s);\n rep(i, 1, ans2.size())\n {\n if (i % 2 == 0 && (i / 2) < s.size())\n {\n ans2[i] += mod - s[i / 2];\n ans2[i] %= mod;\n }\n ans2[i] *= 499122177;\n ans2[i] %= mod;\n ans2[i] += mod - ans1[i];\n ans2[i] %= mod;\n }\n ans2[0] = 0;\n return ans2;\n}\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n ll n;\n cin >> n;\n G.resize(n);\n flg.resize(n);\n rep(i, 0, n - 1)\n {\n ll a, b;\n cin >> a >> b;\n a--;\n b--;\n G[a].push_back(b);\n G[b].push_back(a);\n }\n vector<ll> ans(n);\n CentroidDecomposition CD(G);\n queue<ll> que;\n que.push(CD.G);\n while (!que.empty())\n {\n ll now = que.front();\n que.pop();\n vector<ll> a = f(now);\n flg[now] = true;\n rep(i, 0, a.size())\n {\n ans[i] += a[i];\n ans[i] %= mod;\n }\n rep(i, 0, CD.centroid_graph[now].size())\n {\n ll nxt = CD.centroid_graph[now][i];\n if (nxt != CD.centroid_graph_belong[now])\n {\n que.push(nxt);\n }\n }\n }\n Num N;\n N.nCrmod_init(2 * n, mod);\n vector<ll> x(n - 1), y(n - 1);\n rep(i, 0, n - 1)\n {\n x[i] = ans[n - 1 - i] * N.fac(n - 2 - i, mod);\n x[i] %= mod;\n y[i] = N.inv(N.fac(i, mod), mod);\n }\n vector<ll> ans2 = FFT.convolution_998(x, y);\n rep(i, 0, n - 1)\n {\n ans2[i] *= N.inv(N.fac(n - i - 2, mod), mod);\n ans2[i] %= mod;\n }\n ans2.resize(n - 1);\n rev(ans2);\n rep(i, 0, n - 1)\n {\n cout << ans2[i] << endl;\n }\n}", "accuracy": 1, "time_ms": 2550, "memory_kb": 92220, "score_of_the_acc": -1.9998, "final_rank": 13 }, { "submission_id": "aoj_0452_10388115", "code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\n#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)\n#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)\n#define Endl endl\n#define all(a) a.begin(), a.end()\n#define pr(i, j) make_pair(i, j)\n#define isin(x, l, r) (l <= x && x < r)\n#define chmin(a, b) a = min(a, b)\n#define chmax(a, b) a = max(a, b)\n#define srt(ar) sort(ar.begin(), ar.end())\n#define rev(ar) reverse(ar.begin(), ar.end())\n#define jge(f, s, t) cout << (f ? s : t) << endl\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#define printar(ar) \\\n do \\\n { \\\n for (auto dbg : ar) \\\n { \\\n cout << dbg << \" \"; \\\n } \\\n cout << endl; \\\n } while (0)\nconst ll inf = 1e18;\nconst ld pi = 3.14159265358979;\nconst ld eps = 1e-9;\ntemplate <class T, ll n, ll idx = 0>\nauto make_vec(const ll (&d)[n], const T &init) noexcept\n{\n if constexpr (idx < n)\n return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\n else\n return init;\n}\n\ntemplate <class T, ll n>\nauto make_vec(const ll (&d)[n]) noexcept\n{\n return make_vec(d, T{});\n}\n//////////////// 以下を貼る ////////////////\ntemplate <class T>\nsize_t HashCombine(const size_t seed, const T &v)\n{\n return seed ^ (std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2));\n}\n/* pair用 */\ntemplate <class T, class S>\nstruct std::hash<std::pair<T, S>>\n{\n size_t operator()(const std::pair<T, S> &keyval) const noexcept\n {\n return HashCombine(std::hash<T>()(keyval.first), keyval.second);\n }\n};\n\nclass CentroidDecomposition\n{\nprivate:\n void build_inside(vector<int> &lavels, vector<vector<int>> &g, int from)\n {\n int x = centroid(g);\n int r = lavels[x];\n /*\n lavels_each[r] = lavels;\n graph_each[r] = g;\n 重いので使用不可！\n */\n if (from != -1)\n {\n centroid_graph[r].push_back(from);\n centroid_graph[from].push_back(r);\n centroid_graph_belong[r] = from;\n }\n else\n {\n G = r;\n }\n vector<int> visit_t(lavels.size(), -1);\n rep(i, 0, g[x].size())\n {\n int next = g[x][i];\n vector<int> lavels_new;\n vector<int> v_g;\n queue<pair<int, int>> bfs;\n bfs.push(pr(next, x));\n int t = 0;\n while (!bfs.empty())\n {\n int now = bfs.front().first;\n int prev = bfs.front().second;\n bfs.pop();\n lavels_new.push_back(lavels[now]);\n v_g.push_back(now);\n visit_t[now] = t;\n t++;\n for (auto v : g[now])\n {\n if (v != prev)\n {\n bfs.push(pr(v, now));\n }\n }\n }\n vector<vector<int>> g_new(lavels_new.size());\n bfs.push(pr(next, x));\n while (!bfs.empty())\n {\n int now = bfs.front().first;\n int prev = bfs.front().second;\n int nx = visit_t[now];\n bfs.pop();\n for (auto v : g[now])\n {\n if (v != prev)\n {\n g_new[nx].push_back(visit_t[v]);\n g_new[visit_t[v]].push_back(nx);\n bfs.push(pr(v, now));\n }\n }\n }\n build_inside(lavels_new, g_new, r);\n }\n }\n int centroid(vector<vector<int>> &g)\n {\n int N = g.size();\n vector<int> sz(N);\n vector<int> centroid;\n function<void(int, int)> dfs = [&](int u, int prev)\n {\n sz[u] = 1;\n bool is_centroid = true;\n for (auto v : g[u])\n {\n if (v != prev)\n {\n dfs(v, u);\n sz[u] += sz[v];\n if (sz[v] > N / 2)\n {\n is_centroid = false;\n }\n }\n }\n if (N - sz[u] > N / 2)\n {\n is_centroid = false;\n }\n if (is_centroid)\n {\n centroid.push_back(u);\n }\n };\n dfs(0, -1);\n return centroid[0];\n }\n\npublic:\n /*\n vector<vector<int>> lavels_each; // graph_eachのラベル\n vector<vector<vector<int>>> graph_each; // 頂点iが重心(かつ根)となっているような木を返す\n 重いので使用不可！\n */\n vector<vector<int>> centroid_graph; // 重心同士を結んだ木\n vector<int> centroid_graph_belong; // 重心同士を結んだ木の、頂点iの親\n int G; // 元のグラフの重心\n void build(vector<vector<int>> &g)\n {\n int N = g.size();\n /*\n lavels_each.resize(N);\n graph_each.resize(N);\n */\n centroid_graph.resize(N);\n centroid_graph_belong.resize(N, -1);\n vector<int> lavels(N);\n rep(i, 0, N)\n {\n lavels[i] = i;\n }\n build_inside(lavels, g, -1);\n }\n void debug()\n {\n rep(i, 0, centroid_graph.size())\n {\n printar(centroid_graph[i]);\n }\n }\n CentroidDecomposition(vector<vector<int>> &g)\n {\n build(g);\n }\n};\n\nclass Num\n{\nprivate:\n vector<ll> fac_mod_ar = {};\n vector<ll> mobius_ar = {};\n vector<bool> isprime_ar = {};\n vector<ll> base_2_ar = {};\n\npublic:\n // gcd(a,b)を返す\n ll gcd(ll a, ll b)\n {\n if (a == 0 || b == 0)\n return 0;\n if (b > a)\n swap(a, b);\n if (a % b == 0)\n return b;\n else\n {\n return gcd(b, a % b);\n }\n }\n // lcm(a,b)を返す\n ll lcm(ll a, ll b)\n {\n return b / gcd(a, b) * a;\n }\n // a^b (modp)を返す\n ll exp(ll a, ll b, ll p)\n {\n if (b == 0)\n return 1;\n ll l = log2((b));\n ll num = l + 1;\n // cout << num << endl;\n base_2_ar.resize(num);\n base_2_ar[0] = a;\n rep(i, 1, num)\n {\n base_2_ar[i] = base_2_ar[i - 1] * base_2_ar[i - 1];\n base_2_ar[i] %= p;\n // cout << base_2[i] << endl;\n }\n ll ret = 1;\n rep(i, 0, num)\n {\n // cout << (b >> i) % 2;\n if ((b >> i) % 2 == 1)\n ret *= base_2_ar[i];\n ret %= p;\n }\n return ret;\n }\n // ax+by=gcd(a,b)を満たすx,yを求める\n ll ax_by(ll a, ll b, ll &x, ll &y)\n {\n if (b == 0)\n {\n x = 1;\n y = 0;\n return a;\n }\n ll d = ax_by(b, a % b, y, x);\n y -= a / b * x;\n return d;\n }\n // a(mod m1),b(modm2)なるxを求める 中国剰余定理\n ll CRT(ll a, ll m1, ll b, ll m2)\n {\n ll x, y;\n ax_by(m1, m2, x, y);\n y *= (a - b);\n x %= m2;\n x *= (b - a);\n x %= m2;\n ll k = (m1 * x + a);\n k %= m1 * m2;\n k += m1 * m2;\n k %= m1 * m2;\n return k;\n }\n // mod pにおけるaの逆元を求める\n ll inv(ll a, ll p)\n {\n ll ret, b;\n ax_by(a, p, ret, b);\n ret %= p;\n ret += p;\n ret %= p;\n return ret;\n }\n\n // φ(n)を求める\n ll phi(ll n)\n {\n ll ret = n;\n for (ll i = 2; i * i <= n; i++)\n {\n if (n % i == 0)\n {\n while (n % i == 0)\n n /= i;\n ret *= (i - 1);\n ret /= i;\n }\n }\n if (n != 1)\n {\n ret *= (n - 1);\n ret /= n;\n }\n return ret;\n }\n // 素数判定のための前計算 O(nloglogn)\n void isprime_init(ll n)\n {\n if (isprime_ar.size() >= n + 1)\n return;\n isprime_ar.resize(n + 1, true);\n isprime_ar[0] = false;\n isprime_ar[1] = false;\n for (ll i = 2; i <= n; i++)\n {\n if (isprime_ar[i])\n {\n for (ll j = 2 * i; j <= n; j += i)\n {\n isprime_ar[j] = false;\n }\n }\n }\n }\n // nCrmodのための前計算 O(n)\n void nCrmod_init(ll n, ll p)\n {\n if (fac_mod_ar.size() >= n + 1)\n return;\n fac_mod_ar.resize(0);\n fac_mod_ar.resize(n + 1);\n fac_mod_ar[0] = 1;\n rep(i, 1, n + 1)\n {\n fac_mod_ar[i] = fac_mod_ar[i - 1] * i;\n fac_mod_ar[i] %= p;\n }\n }\n // メビウス関数のための前計算 O(nloglogn)\n void mobius_init(ll n)\n {\n if (mobius_ar.size() >= n + 1)\n return;\n mobius_ar.resize(n + 1, 1);\n isprime_init(n);\n mobius_ar[1] = 1;\n for (ll i = 2; i <= n; i++)\n {\n if (!isprime(i))\n continue;\n mobius_ar[i] = -1;\n for (ll j = 2 * i; j <= n; j += i)\n {\n if (j % (i * i) == 0)\n mobius_ar[j] = 0;\n else\n mobius_ar[j] *= -1;\n }\n }\n }\n // nの素数判定 前計算が必要\n bool isprime(ll n)\n {\n isprime_init(n);\n return isprime_ar[n];\n }\n // n! mod pを求める 前計算が必要\n ll fac(ll n, ll p)\n {\n nCrmod_init(n, p);\n return fac_mod_ar[n];\n }\n // nCr(mod p)を求める 前計算が必要\n ll nCrmod(ll n, ll r, ll p)\n {\n nCrmod_init(n, p);\n ll ret = 1;\n ret *= fac_mod_ar[n];\n ret %= p;\n ret *= inv(fac_mod_ar[r], p);\n ret %= p;\n ret *= inv(fac_mod_ar[n - r], p);\n ret %= p;\n return ret;\n }\n // μ(n)を求める　前計算が必要\n ll mobius(ll n)\n {\n mobius_init(n);\n return mobius_ar[n];\n }\n};\n////////////////////////////////////////////////\n\nclass FastFourierTransform\n{\nprivate:\n ll P = 998244353;\n ll R = 1107296257;\n vector<ll> r_p;\n vector<ll> r_r;\n vector<ll> r_p_inv;\n vector<ll> r_r_inv;\n bool f_p = false;\n bool f_r = false;\n ll mod_inv(ll n, ll p)\n {\n ll b = p, u = 1, v = 0;\n while (b)\n {\n ll t = n / b;\n n -= t * b;\n swap(n, b);\n u -= t * v;\n swap(u, v);\n }\n u %= p;\n if (u < 0)\n u += p;\n return u;\n }\n void dft(vector<complex<ld>> &func, bool isinv)\n {\n ll n = func.size();\n if (n == 1)\n {\n return;\n }\n else\n {\n vector<complex<ld>> a, b;\n rep(i, 0, n)\n {\n if (i % 2 == 0)\n {\n a.push_back(func[i]);\n }\n else\n {\n b.push_back(func[i]);\n }\n }\n dft(a, isinv);\n dft(b, isinv);\n complex<ld> now = 1;\n ld theta = (2.0 * acos(-1)) / n;\n if (isinv)\n {\n theta *= -1.0;\n }\n complex<ld> z = polar((ld)1.0, theta);\n rep(i, 0, n)\n {\n func[i] = a[i % (n / 2)] + now * b[i % (n / 2)];\n now *= z;\n }\n return;\n }\n }\n void nft_int(vector<ll> &func, bool isinv, ll p)\n {\n ll n = func.size();\n if (n == 1)\n {\n return;\n }\n else\n {\n ll x = log2(n);\n rep(i, 0, n)\n {\n ll j = 0;\n rep(k, 0, x)\n {\n j |= ((i >> k) & 1LL) << (x - 1 - k);\n }\n if (i < j)\n {\n swap(func[i], func[j]);\n }\n }\n rep(i, 0, x)\n {\n ll b = (1LL << i);\n ll now = 1;\n ll z = -1;\n if (p == P)\n {\n z = r_p[i + 1];\n if (isinv)\n {\n z = r_p_inv[i + 1];\n }\n }\n else\n {\n z = r_r[i + 1];\n if (isinv)\n {\n z = r_r_inv[i + 1];\n }\n }\n rep(j, 0, b)\n {\n for (int k = 0; k < n; k += b * 2)\n {\n ll s = func[j + k];\n ll t = func[j + k + b] * now;\n t %= p;\n ll A = s + t;\n A %= p;\n ll B = s - t + p;\n B %= p;\n func[j + k] = A;\n func[j + k + b] = B;\n }\n now *= z;\n now %= p;\n }\n }\n return;\n }\n }\n vector<ll> convolution_110(vector<ll> f, vector<ll> g)\n {\n if (!f_r)\n {\n r_r.resize(26);\n r_r_inv.resize(26);\n r_r[25] = 1087287097;\n drep(i, 25, 0)\n {\n r_r[i] = r_r[i + 1] * r_r[i + 1];\n r_r[i] %= R;\n }\n rep(i, 0, 26)\n {\n r_r_inv[i] = mod_inv(r_r[i], R);\n }\n f_r = true;\n }\n ll n = 1;\n ll m = f.size() + g.size() - 1;\n while (n <= m)\n {\n\n n *= 2;\n }\n f.resize(n);\n g.resize(n);\n assert(f.size() != 0 && g.size() != 0);\n vector<ll> nf, ng;\n rep(i, 0, n)\n {\n nf.push_back(f[i]);\n ng.push_back(g[i]);\n }\n nft_int(nf, false, R);\n nft_int(ng, false, R);\n vector<ll> inv(n);\n rep(i, 0, n)\n {\n inv[i] = nf[i] * ng[i];\n inv[i] %= R;\n }\n nft_int(inv, true, R);\n vector<ll> ret(n);\n ll n_inv = mod_inv(n, R);\n rep(i, 0, n)\n {\n ret[i] = inv[i] * n_inv;\n ret[i] %= R;\n }\n ret.resize(m);\n return ret;\n }\n\npublic:\n vector<complex<ld>> convolution(vector<complex<ld>> f, vector<complex<ld>> g)\n {\n ll n = 1;\n ll m = f.size() + g.size() - 1;\n while (n < m)\n {\n n *= 2;\n }\n f.resize(n);\n g.resize(n);\n assert(f.size() != 0 && g.size() != 0);\n vector<complex<ld>> nf, ng;\n rep(i, 0, n)\n {\n nf.push_back(f[i]);\n ng.push_back(g[i]);\n }\n dft(nf, false),\n dft(ng, false);\n vector<complex<ld>> inv(n);\n rep(i, 0, n)\n {\n inv[i] = nf[i] * ng[i];\n }\n dft(inv, true);\n vector<complex<ld>> ret(n);\n rep(i, 0, n)\n {\n ret[i] = (inv[i].real()) / (ld)n;\n }\n ret.resize(m);\n return ret;\n }\n vector<ll> convolution_998(vector<ll> f, vector<ll> g)\n {\n if (!f_p)\n {\n r_p.resize(24);\n r_p_inv.resize(24);\n r_p[23] = 15311432;\n drep(i, 23, 0)\n {\n r_p[i] = r_p[i + 1] * r_p[i + 1];\n r_p[i] %= P;\n }\n rep(i, 0, 24)\n {\n r_p_inv[i] = mod_inv(r_p[i], P);\n }\n f_p = true;\n }\n ll n = 1;\n ll m = f.size() + g.size() - 1;\n while (n <= m)\n {\n n *= 2;\n }\n f.resize(n);\n g.resize(n);\n assert(f.size() != 0 && g.size() != 0);\n vector<ll> nf, ng;\n rep(i, 0, n)\n {\n nf.push_back(f[i]);\n ng.push_back(g[i]);\n }\n nft_int(nf, false, P);\n nft_int(ng, false, P);\n vector<ll> inv(n);\n rep(i, 0, n)\n {\n inv[i] = nf[i] * ng[i];\n inv[i] %= P;\n }\n nft_int(inv, true, P);\n vector<ll> ret(n);\n ll n_inv = mod_inv(n, P);\n rep(i, 0, n)\n {\n ret[i] = inv[i] * n_inv;\n ret[i] %= P;\n }\n ret.resize(m);\n return ret;\n }\n /*\n vector<ll> convolution_ll(vector<ll> f, vector<ll> g)\n {\n vector<ll> a = convolution_110(f, g);\n vector<ll> b = convolution_998(f, g);\n Num N;\n vector<ll> ret;\n rep(i, 0, a.size())\n {\n ll x = N.CRT(a[i], R, b[i], P);\n ret.push_back(x);\n }\n return ret;\n }\n */\n};\nvector<bool> flg;\nvector<vector<int>> G;\nll mod = 998244353;\nFastFourierTransform FFT;\nvector<ll> f(int rt)\n{\n vector<ll> s(1, 1);\n vector<ll> ans1(1, 1);\n vector<ll> ans2(1, 1);\n rep(i, 0, G[rt].size())\n {\n vector<ll> d(1, 0);\n function<void(int, int, int)> dfs = [&](int u, int prev, int depth)\n {\n if (depth >= (int)d.size())\n {\n d.push_back(1);\n }\n else\n {\n d[depth]++;\n }\n for (auto v : G[u])\n {\n if (v != prev && !flg[v])\n {\n dfs(v, u, depth + 1);\n }\n }\n };\n if (!flg[G[rt][i]])\n {\n dfs(G[rt][i], rt, 1);\n }\n vector<ll> ar = FFT.convolution_998(d, d);\n rep(i, 1, d.size())\n {\n if (ar.size() <= 2 * i)\n {\n ar.resize(2 * i + 1);\n }\n ar[2 * i] -= d[i];\n if (s.size() <= i)\n {\n s.resize(i + 1);\n }\n s[i] += d[i];\n }\n rep(i, 1, ar.size())\n {\n ar[i] /= 2;\n if (ans1.size() <= i)\n {\n ans1.resize(i + 1);\n }\n ans1[i] += ar[i];\n }\n }\n ans2 = FFT.convolution_998(s, s);\n rep(i, 1, ans2.size())\n {\n if (i % 2 == 0 && (i / 2) < s.size())\n {\n ans2[i] -= s[i / 2];\n ans2[i] %= mod;\n ans2[i] += mod;\n ans2[i] %= mod;\n }\n ans2[i] *= 499122177;\n ans2[i] -= ans1[i];\n ans2[i] %= mod;\n }\n ans2[0] = 0;\n return ans2;\n}\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n ll n;\n cin >> n;\n G.resize(n);\n flg.resize(n);\n rep(i, 0, n - 1)\n {\n ll a, b;\n cin >> a >> b;\n a--;\n b--;\n G[a].push_back(b);\n G[b].push_back(a);\n }\n vector<ll> ans(n);\n CentroidDecomposition CD(G);\n queue<ll> que;\n que.push(CD.G);\n while (!que.empty())\n {\n ll now = que.front();\n que.pop();\n vector<ll> a = f(now);\n flg[now] = true;\n rep(i, 0, a.size())\n {\n ans[i] += a[i];\n ans[i] %= mod;\n }\n rep(i, 0, CD.centroid_graph[now].size())\n {\n ll nxt = CD.centroid_graph[now][i];\n if (nxt != CD.centroid_graph_belong[now])\n {\n que.push(nxt);\n }\n }\n }\n Num N;\n N.nCrmod_init(2 * n, mod);\n vector<ll> x(n - 1), y(n - 1);\n rep(i, 0, n - 1)\n {\n x[i] = ans[n - 1 - i] * N.fac(n - 2 - i, mod);\n x[i] %= mod;\n y[i] = N.inv(N.fac(i, mod), mod);\n }\n vector<ll> ans2 = FFT.convolution_998(x, y);\n rep(i, 0, n - 1)\n {\n ans2[i] *= N.inv(N.fac(n - i - 2, mod), mod);\n ans2[i] %= mod;\n }\n ans2.resize(n - 1);\n rev(ans2);\n rep(i, 0, n - 1)\n {\n cout << ans2[i] << endl;\n }\n}", "accuracy": 0.9523809523809523, "time_ms": 2520, "memory_kb": 92220, "score_of_the_acc": -1.9859, "final_rank": 15 }, { "submission_id": "aoj_0452_10388102", "code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\n#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)\n#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)\n#define Endl endl\n#define all(a) a.begin(), a.end()\n#define pr(i, j) make_pair(i, j)\n#define isin(x, l, r) (l <= x && x < r)\n#define chmin(a, b) a = min(a, b)\n#define chmax(a, b) a = max(a, b)\n#define srt(ar) sort(ar.begin(), ar.end())\n#define rev(ar) reverse(ar.begin(), ar.end())\n#define jge(f, s, t) cout << (f ? s : t) << endl\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#define printar(ar) \\\n do \\\n { \\\n for (auto dbg : ar) \\\n { \\\n cout << dbg << \" \"; \\\n } \\\n cout << endl; \\\n } while (0)\nconst ll inf = 1e18;\nconst ld pi = 3.14159265358979;\nconst ld eps = 1e-9;\ntemplate <class T, ll n, ll idx = 0>\nauto make_vec(const ll (&d)[n], const T &init) noexcept\n{\n if constexpr (idx < n)\n return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\n else\n return init;\n}\n\ntemplate <class T, ll n>\nauto make_vec(const ll (&d)[n]) noexcept\n{\n return make_vec(d, T{});\n}\n//////////////// 以下を貼る ////////////////\ntemplate <class T>\nsize_t HashCombine(const size_t seed, const T &v)\n{\n return seed ^ (std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2));\n}\n/* pair用 */\ntemplate <class T, class S>\nstruct std::hash<std::pair<T, S>>\n{\n size_t operator()(const std::pair<T, S> &keyval) const noexcept\n {\n return HashCombine(std::hash<T>()(keyval.first), keyval.second);\n }\n};\n\nclass CentroidDecomposition\n{\nprivate:\n void build_inside(vector<int> &lavels, vector<vector<int>> &g, int from)\n {\n int x = centroid(g);\n int r = lavels[x];\n /*\n lavels_each[r] = lavels;\n graph_each[r] = g;\n 重いので使用不可！\n */\n if (from != -1)\n {\n centroid_graph[r].push_back(from);\n centroid_graph[from].push_back(r);\n centroid_graph_belong[r] = from;\n }\n else\n {\n G = r;\n }\n vector<int> visit_t(lavels.size(), -1);\n rep(i, 0, g[x].size())\n {\n int next = g[x][i];\n vector<int> lavels_new;\n vector<int> v_g;\n queue<pair<int, int>> bfs;\n bfs.push(pr(next, x));\n int t = 0;\n while (!bfs.empty())\n {\n int now = bfs.front().first;\n int prev = bfs.front().second;\n bfs.pop();\n lavels_new.push_back(lavels[now]);\n v_g.push_back(now);\n visit_t[now] = t;\n t++;\n for (auto v : g[now])\n {\n if (v != prev)\n {\n bfs.push(pr(v, now));\n }\n }\n }\n vector<vector<int>> g_new(lavels_new.size());\n bfs.push(pr(next, x));\n while (!bfs.empty())\n {\n int now = bfs.front().first;\n int prev = bfs.front().second;\n int nx = visit_t[now];\n bfs.pop();\n for (auto v : g[now])\n {\n if (v != prev)\n {\n g_new[nx].push_back(visit_t[v]);\n g_new[visit_t[v]].push_back(nx);\n bfs.push(pr(v, now));\n }\n }\n }\n build_inside(lavels_new, g_new, r);\n }\n }\n int centroid(vector<vector<int>> &g)\n {\n int N = g.size();\n vector<int> sz(N);\n vector<int> centroid;\n function<void(int, int)> dfs = [&](int u, int prev)\n {\n sz[u] = 1;\n bool is_centroid = true;\n for (auto v : g[u])\n {\n if (v != prev)\n {\n dfs(v, u);\n sz[u] += sz[v];\n if (sz[v] > N / 2)\n {\n is_centroid = false;\n }\n }\n }\n if (N - sz[u] > N / 2)\n {\n is_centroid = false;\n }\n if (is_centroid)\n {\n centroid.push_back(u);\n }\n };\n dfs(0, -1);\n return centroid[0];\n }\n\npublic:\n /*\n vector<vector<int>> lavels_each; // graph_eachのラベル\n vector<vector<vector<int>>> graph_each; // 頂点iが重心(かつ根)となっているような木を返す\n 重いので使用不可！\n */\n vector<vector<int>> centroid_graph; // 重心同士を結んだ木\n vector<int> centroid_graph_belong; // 重心同士を結んだ木の、頂点iの親\n int G; // 元のグラフの重心\n void build(vector<vector<int>> &g)\n {\n int N = g.size();\n /*\n lavels_each.resize(N);\n graph_each.resize(N);\n */\n centroid_graph.resize(N);\n centroid_graph_belong.resize(N, -1);\n vector<int> lavels(N);\n rep(i, 0, N)\n {\n lavels[i] = i;\n }\n build_inside(lavels, g, -1);\n }\n void debug()\n {\n rep(i, 0, centroid_graph.size())\n {\n printar(centroid_graph[i]);\n }\n }\n CentroidDecomposition(vector<vector<int>> &g)\n {\n build(g);\n }\n};\n\n\nclass Num\n{\nprivate:\n vector<ll> fac_mod_ar = {};\n vector<ll> mobius_ar = {};\n vector<bool> isprime_ar = {};\n vector<ll> base_2_ar = {};\n\npublic:\n // gcd(a,b)を返す\n ll gcd(ll a, ll b)\n {\n if (a == 0 || b == 0)\n return 0;\n if (b > a)\n swap(a, b);\n if (a % b == 0)\n return b;\n else\n {\n return gcd(b, a % b);\n }\n }\n // lcm(a,b)を返す\n ll lcm(ll a, ll b)\n {\n return b / gcd(a, b) * a;\n }\n // a^b (modp)を返す\n ll exp(ll a, ll b, ll p)\n {\n if (b == 0)\n return 1;\n ll l = log2((b));\n ll num = l + 1;\n // cout << num << endl;\n base_2_ar.resize(num);\n base_2_ar[0] = a;\n rep(i, 1, num)\n {\n base_2_ar[i] = base_2_ar[i - 1] * base_2_ar[i - 1];\n base_2_ar[i] %= p;\n // cout << base_2[i] << endl;\n }\n ll ret = 1;\n rep(i, 0, num)\n {\n // cout << (b >> i) % 2;\n if ((b >> i) % 2 == 1)\n ret *= base_2_ar[i];\n ret %= p;\n }\n return ret;\n }\n // ax+by=gcd(a,b)を満たすx,yを求める\n ll ax_by(ll a, ll b, ll &x, ll &y)\n {\n if (b == 0)\n {\n x = 1;\n y = 0;\n return a;\n }\n ll d = ax_by(b, a % b, y, x);\n y -= a / b * x;\n return d;\n }\n // a(mod m1),b(modm2)なるxを求める 中国剰余定理\n ll CRT(ll a, ll m1, ll b, ll m2)\n {\n ll x, y;\n ax_by(m1, m2, x, y);\n y *= (a - b);\n x %= m2;\n x *= (b - a);\n x %= m2;\n ll k = (m1 * x + a);\n k %= m1 * m2;\n k += m1 * m2;\n k %= m1 * m2;\n return k;\n }\n // mod pにおけるaの逆元を求める\n ll inv(ll a, ll p)\n {\n ll ret, b;\n ax_by(a, p, ret, b);\n ret %= p;\n ret += p;\n ret %= p;\n return ret;\n }\n\n // φ(n)を求める\n ll phi(ll n)\n {\n ll ret = n;\n for (ll i = 2; i * i <= n; i++)\n {\n if (n % i == 0)\n {\n while (n % i == 0)\n n /= i;\n ret *= (i - 1);\n ret /= i;\n }\n }\n if (n != 1)\n {\n ret *= (n - 1);\n ret /= n;\n }\n return ret;\n }\n // 素数判定のための前計算 O(nloglogn)\n void isprime_init(ll n)\n {\n if (isprime_ar.size() >= n + 1)\n return;\n isprime_ar.resize(n + 1, true);\n isprime_ar[0] = false;\n isprime_ar[1] = false;\n for (ll i = 2; i <= n; i++)\n {\n if (isprime_ar[i])\n {\n for (ll j = 2 * i; j <= n; j += i)\n {\n isprime_ar[j] = false;\n }\n }\n }\n }\n // nCrmodのための前計算 O(n)\n void nCrmod_init(ll n, ll p)\n {\n if (fac_mod_ar.size() >= n + 1)\n return;\n fac_mod_ar.resize(0);\n fac_mod_ar.resize(n + 1);\n fac_mod_ar[0] = 1;\n rep(i, 1, n + 1)\n {\n fac_mod_ar[i] = fac_mod_ar[i - 1] * i;\n fac_mod_ar[i] %= p;\n }\n }\n // メビウス関数のための前計算 O(nloglogn)\n void mobius_init(ll n)\n {\n if (mobius_ar.size() >= n + 1)\n return;\n mobius_ar.resize(n + 1, 1);\n isprime_init(n);\n mobius_ar[1] = 1;\n for (ll i = 2; i <= n; i++)\n {\n if (!isprime(i))\n continue;\n mobius_ar[i] = -1;\n for (ll j = 2 * i; j <= n; j += i)\n {\n if (j % (i * i) == 0)\n mobius_ar[j] = 0;\n else\n mobius_ar[j] *= -1;\n }\n }\n }\n // nの素数判定 前計算が必要\n bool isprime(ll n)\n {\n isprime_init(n);\n return isprime_ar[n];\n }\n // n! mod pを求める 前計算が必要\n ll fac(ll n, ll p)\n {\n nCrmod_init(n, p);\n return fac_mod_ar[n];\n }\n // nCr(mod p)を求める 前計算が必要\n ll nCrmod(ll n, ll r, ll p)\n {\n nCrmod_init(n, p);\n ll ret = 1;\n ret *= fac_mod_ar[n];\n ret %= p;\n ret *= inv(fac_mod_ar[r], p);\n ret %= p;\n ret *= inv(fac_mod_ar[n - r], p);\n ret %= p;\n return ret;\n }\n // μ(n)を求める　前計算が必要\n ll mobius(ll n)\n {\n mobius_init(n);\n return mobius_ar[n];\n }\n};\n////////////////////////////////////////////////\n\nclass FastFourierTransform\n{\nprivate:\n ll P = 998244353;\n ll R = 1107296257;\n vector<ll> r_p;\n vector<ll> r_r;\n vector<ll> r_p_inv;\n vector<ll> r_r_inv;\n bool f_p = false;\n bool f_r = false;\n ll mod_inv(ll n, ll p)\n {\n ll b = p, u = 1, v = 0;\n while (b)\n {\n ll t = n / b;\n n -= t * b;\n swap(n, b);\n u -= t * v;\n swap(u, v);\n }\n u %= p;\n if (u < 0)\n u += p;\n return u;\n }\n void dft(vector<complex<ld>> &func, bool isinv)\n {\n ll n = func.size();\n if (n == 1)\n {\n return;\n }\n else\n {\n vector<complex<ld>> a, b;\n rep(i, 0, n)\n {\n if (i % 2 == 0)\n {\n a.push_back(func[i]);\n }\n else\n {\n b.push_back(func[i]);\n }\n }\n dft(a, isinv);\n dft(b, isinv);\n complex<ld> now = 1;\n ld theta = (2.0 * acos(-1)) / n;\n if (isinv)\n {\n theta *= -1.0;\n }\n complex<ld> z = polar((ld)1.0, theta);\n rep(i, 0, n)\n {\n func[i] = a[i % (n / 2)] + now * b[i % (n / 2)];\n now *= z;\n }\n return;\n }\n }\n void nft_int(vector<ll> &func, bool isinv, ll p)\n {\n ll n = func.size();\n if (n == 1)\n {\n return;\n }\n else\n {\n ll x = log2(n);\n rep(i, 0, n)\n {\n ll j = 0;\n rep(k, 0, x)\n {\n j |= ((i >> k) & 1LL) << (x - 1 - k);\n }\n if (i < j)\n {\n swap(func[i], func[j]);\n }\n }\n rep(i, 0, x)\n {\n ll b = (1LL << i);\n ll now = 1;\n ll z = -1;\n if (p == P)\n {\n z = r_p[i + 1];\n if (isinv)\n {\n z = r_p_inv[i + 1];\n }\n }\n else\n {\n z = r_r[i + 1];\n if (isinv)\n {\n z = r_r_inv[i + 1];\n }\n }\n rep(j, 0, b)\n {\n for (int k = 0; k < n; k += b * 2)\n {\n ll s = func[j + k];\n ll t = func[j + k + b] * now;\n t %= p;\n ll A = s + t;\n A %= p;\n ll B = s - t + p;\n B %= p;\n func[j + k] = A;\n func[j + k + b] = B;\n }\n now *= z;\n now %= p;\n }\n }\n return;\n }\n }\n vector<ll> convolution_110(vector<ll> f, vector<ll> g)\n {\n if (!f_r)\n {\n r_r.resize(26);\n r_r_inv.resize(26);\n r_r[25] = 1087287097;\n drep(i, 25, 0)\n {\n r_r[i] = r_r[i + 1] * r_r[i + 1];\n r_r[i] %= R;\n }\n rep(i, 0, 26)\n {\n r_r_inv[i] = mod_inv(r_r[i], R);\n }\n f_r = true;\n }\n ll n = 1;\n ll m = f.size() + g.size() - 1;\n while (n <= m)\n {\n\n n *= 2;\n }\n f.resize(n);\n g.resize(n);\n assert(f.size() != 0 && g.size() != 0);\n vector<ll> nf, ng;\n rep(i, 0, n)\n {\n nf.push_back(f[i]);\n ng.push_back(g[i]);\n }\n nft_int(nf, false, R);\n nft_int(ng, false, R);\n vector<ll> inv(n);\n rep(i, 0, n)\n {\n inv[i] = nf[i] * ng[i];\n inv[i] %= R;\n }\n nft_int(inv, true, R);\n vector<ll> ret(n);\n ll n_inv = mod_inv(n, R);\n rep(i, 0, n)\n {\n ret[i] = inv[i] * n_inv;\n ret[i] %= R;\n }\n ret.resize(m);\n return ret;\n }\n\npublic:\n vector<complex<ld>> convolution(vector<complex<ld>> f, vector<complex<ld>> g)\n {\n ll n = 1;\n ll m = f.size() + g.size() - 1;\n while (n < m)\n {\n n *= 2;\n }\n f.resize(n);\n g.resize(n);\n assert(f.size() != 0 && g.size() != 0);\n vector<complex<ld>> nf, ng;\n rep(i, 0, n)\n {\n nf.push_back(f[i]);\n ng.push_back(g[i]);\n }\n dft(nf, false),\n dft(ng, false);\n vector<complex<ld>> inv(n);\n rep(i, 0, n)\n {\n inv[i] = nf[i] * ng[i];\n }\n dft(inv, true);\n vector<complex<ld>> ret(n);\n rep(i, 0, n)\n {\n ret[i] = (inv[i].real()) / (ld)n;\n }\n ret.resize(m);\n return ret;\n }\n vector<ll> convolution_998(vector<ll> f, vector<ll> g)\n {\n if (!f_p)\n {\n r_p.resize(24);\n r_p_inv.resize(24);\n r_p[23] = 15311432;\n drep(i, 23, 0)\n {\n r_p[i] = r_p[i + 1] * r_p[i + 1];\n r_p[i] %= P;\n }\n rep(i, 0, 24)\n {\n r_p_inv[i] = mod_inv(r_p[i], P);\n }\n f_p = true;\n }\n ll n = 1;\n ll m = f.size() + g.size() - 1;\n while (n <= m)\n {\n n *= 2;\n }\n f.resize(n);\n g.resize(n);\n assert(f.size() != 0 && g.size() != 0);\n vector<ll> nf, ng;\n rep(i, 0, n)\n {\n nf.push_back(f[i]);\n ng.push_back(g[i]);\n }\n nft_int(nf, false, P);\n nft_int(ng, false, P);\n vector<ll> inv(n);\n rep(i, 0, n)\n {\n inv[i] = nf[i] * ng[i];\n inv[i] %= P;\n }\n nft_int(inv, true, P);\n vector<ll> ret(n);\n ll n_inv = mod_inv(n, P);\n rep(i, 0, n)\n {\n ret[i] = inv[i] * n_inv;\n ret[i] %= P;\n }\n ret.resize(m);\n return ret;\n }\n /*\n vector<ll> convolution_ll(vector<ll> f, vector<ll> g)\n {\n vector<ll> a = convolution_110(f, g);\n vector<ll> b = convolution_998(f, g);\n Num N;\n vector<ll> ret;\n rep(i, 0, a.size())\n {\n ll x = N.CRT(a[i], R, b[i], P);\n ret.push_back(x);\n }\n return ret;\n }\n */\n};\nvector<bool> flg;\nvector<vector<int>> G;\nll mod = 998244353;\nFastFourierTransform FFT;\nvector<ll> f(int rt)\n{\n vector<ll> s(1, 1);\n vector<ll> ans1(1, 1);\n vector<ll> ans2(1, 1);\n rep(i, 0, G[rt].size())\n {\n vector<ll> d(1, 0);\n function<void(int, int, int)> dfs = [&](int u, int prev, int depth)\n {\n if (depth >= (int)d.size())\n {\n d.push_back(1);\n }\n else\n {\n d[depth]++;\n }\n for (auto v : G[u])\n {\n if (v != prev && !flg[v])\n {\n dfs(v, u, depth + 1);\n }\n }\n };\n if (!flg[G[rt][i]])\n {\n dfs(G[rt][i], rt, 1);\n }\n vector<ll> ar = FFT.convolution_998(d, d);\n rep(i, 1, d.size())\n {\n if (ar.size() <= 2 * i)\n {\n ar.resize(2 * i + 1);\n }\n ar[2 * i] -= d[i];\n if (s.size() <= i)\n {\n s.resize(i + 1);\n }\n s[i] += d[i];\n }\n rep(i, 1, ar.size())\n {\n ar[i] /= 2;\n if (ans1.size() <= i)\n {\n ans1.resize(i + 1);\n }\n ans1[i] += ar[i];\n }\n }\n ans2 = FFT.convolution_998(s, s);\n rep(i, 1, ans2.size())\n {\n if (i % 2 == 0 && (i / 2) < s.size())\n {\n ans2[i] -= s[i / 2];\n }\n ans2[i] /= 2;\n ans2[i] -= ans1[i];\n }\n ans2[0] = 0;\n return ans2;\n}\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n ll n;\n cin >> n;\n G.resize(n);\n flg.resize(n);\n rep(i, 0, n - 1)\n {\n ll a, b;\n cin >> a >> b;\n a--;\n b--;\n G[a].push_back(b);\n G[b].push_back(a);\n }\n vector<ll> ans(n);\n CentroidDecomposition CD(G);\n queue<ll> que;\n que.push(CD.G);\n while (!que.empty())\n {\n ll now = que.front();\n que.pop();\n vector<ll> a = f(now);\n flg[now] = true;\n rep(i, 0, a.size())\n {\n ans[i] += a[i];\n }\n rep(i, 0, CD.centroid_graph[now].size())\n {\n ll nxt = CD.centroid_graph[now][i];\n if (nxt != CD.centroid_graph_belong[now])\n {\n que.push(nxt);\n }\n }\n }\n Num N;\n N.nCrmod_init(2 * n, mod);\n vector<ll> x(n - 1), y(n - 1);\n rep(i, 0, n - 1)\n {\n x[i] = ans[n - 1 - i] * N.fac(n - 2 - i, mod);\n x[i] %= mod;\n y[i] = N.inv(N.fac(i, mod), mod);\n }\n vector<ll> ans2 = FFT.convolution_998(x, y);\n rep(i, 0, n - 1)\n {\n ans2[i] *= N.inv(N.fac(n - i - 2, mod), mod);\n ans2[i] %= mod;\n }\n ans2.resize(n - 1);\n rev(ans2);\n rep(i, 0, n - 1)\n {\n cout << ans2[i] << endl;\n }\n}", "accuracy": 0.9523809523809523, "time_ms": 2510, "memory_kb": 92232, "score_of_the_acc": -1.9816, "final_rank": 14 }, { "submission_id": "aoj_0452_10386110", "code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\n#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)\n#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)\n#define Endl endl\n#define all(a) a.begin(), a.end()\n#define pr(i, j) make_pair(i, j)\n#define isin(x, l, r) (l <= x && x < r)\n#define chmin(a, b) a = min(a, b)\n#define chmax(a, b) a = max(a, b)\n#define srt(ar) sort(ar.begin(), ar.end())\n#define rev(ar) reverse(ar.begin(), ar.end())\n#define jge(f, s, t) cout << (f ? s : t) << endl\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#define printar(ar) \\\n do \\\n { \\\n for (auto dbg : ar) \\\n { \\\n cout << dbg << \" \"; \\\n } \\\n cout << endl; \\\n } while (0)\nconst ll inf = 1e18;\nconst ld pi = 3.14159265358979;\nconst ld eps = 1e-9;\ntemplate <class T, ll n, ll idx = 0>\nauto make_vec(const ll (&d)[n], const T &init) noexcept\n{\n if constexpr (idx < n)\n return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\n else\n return init;\n}\n\ntemplate <class T, ll n>\nauto make_vec(const ll (&d)[n]) noexcept\n{\n return make_vec(d, T{});\n}\n//////////////// 以下を貼る ////////////////\ntemplate <class T>\nsize_t HashCombine(const size_t seed, const T &v)\n{\n return seed ^ (std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2));\n}\n/* pair用 */\ntemplate <class T, class S>\nstruct std::hash<std::pair<T, S>>\n{\n size_t operator()(const std::pair<T, S> &keyval) const noexcept\n {\n return HashCombine(std::hash<T>()(keyval.first), keyval.second);\n }\n};\n\ntemplate <int mod>\nstruct ModInt\n{\n int x;\n ModInt() : x(0) {}\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n ModInt &operator+=(const ModInt &p)\n {\n if ((x += p.x) >= mod)\n x -= mod;\n return *this;\n }\n ModInt &operator-=(const ModInt &p)\n {\n if ((x += mod - p.x) >= mod)\n x -= mod;\n return *this;\n }\n ModInt &operator*=(const ModInt &p)\n {\n x = (int)(1LL * x * p.x % mod);\n return *this;\n }\n ModInt &operator/=(const ModInt &p)\n {\n *this *= p.inverse();\n return *this;\n }\n ModInt operator-() const { return ModInt(-x); }\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n bool operator==(const ModInt &p) const { return x == p.x; }\n bool operator!=(const ModInt &p) const { return x != p.x; }\n\n ModInt inverse() const\n {\n int a = x, b = mod, u = 1, v = 0, t;\n while (b > 0)\n {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n\n ModInt pow(int64_t n) const\n {\n ModInt ret(1), mul(x);\n while (n > 0)\n {\n if (n & 1)\n ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n\n friend ostream &operator<<(ostream &os, const ModInt &p)\n {\n return os << p.x;\n }\n\n friend istream &operator>>(istream &is, ModInt &a)\n {\n int64_t t;\n is >> t;\n a = ModInt<mod>(t);\n return (is);\n }\n\n static int get_mod() { return mod; }\n};\nusing mint = ModInt<998244353>;\nusing vm = vector<mint>;\n\nstruct NumberTheoreticTransform\n{\n\n int mod = mint::get_mod();\n int mxb;\n mint r;\n\n NumberTheoreticTransform()\n {\n auto tmp = mod - 1;\n mxb = 0;\n while (tmp % 2 == 0)\n tmp >>= 1, mxb++;\n r = 2;\n while (r.pow((mod - 1) >> 1) == 1)\n r += 1;\n assert(r.pow(mod - 1) == 1);\n r = r.pow((mod - 1) >> mxb);\n }\n\n void ntt(vm &f, int lg, bool inv)\n {\n int sz = (int)f.size();\n for (int i = 0; i < sz; ++i)\n {\n int j = 0;\n for (int k = 0; k < lg; ++k)\n {\n j |= ((i >> k) & 1) << (lg - 1 - k);\n }\n if (i < j)\n swap(f[i], f[j]);\n }\n\n for (int i = 0; i < lg; ++i)\n {\n int b = 1 << i;\n mint now = 1;\n mint z = r.pow(1 << (mxb - 1 - i));\n if (inv)\n z = z.inverse();\n for (int j = 0; j < b; ++j)\n {\n for (int k = 0; k < sz; k += b * 2)\n {\n mint s = f[j + k];\n mint t = f[j + k + b] * now;\n f[j + k] = s + t;\n f[j + k + b] = s - t;\n }\n now *= z;\n }\n }\n }\n\n vm multiply(const vm &f, const vm &g)\n {\n vm nf, ng;\n size_t need = f.size() + g.size() - 1;\n int sz = 1, lg = 0;\n while (sz < (int)(f.size() + g.size()))\n {\n sz *= 2;\n ++lg;\n }\n nf.resize(sz), ng.resize(sz);\n for (int i = 0; i < (int)f.size(); ++i)\n {\n nf[i] = f[i];\n }\n for (int i = 0; i < (int)g.size(); ++i)\n {\n ng[i] = g[i];\n }\n ntt(nf, lg, 0);\n ntt(ng, lg, 0);\n for (int i = 0; i < sz; ++i)\n {\n nf[i] *= ng[i];\n }\n ntt(nf, lg, 1);\n vm ret(sz);\n mint inv_sz = mint(1) / sz;\n for (int i = 0; i < sz; ++i)\n {\n ret[i] = nf[i] * inv_sz;\n }\n ret.resize(need);\n return ret;\n }\n} ntt;\nclass CentroidDecomposition\n{\nprivate:\n void build_inside(vector<int> &lavels, vector<vector<int>> &g, int from)\n {\n int x = centroid(g);\n int r = lavels[x];\n /*\n lavels_each[r] = lavels;\n graph_each[r] = g;\n 重いので使用不可！\n */\n if (from != -1)\n {\n centroid_graph[r].push_back(from);\n centroid_graph[from].push_back(r);\n centroid_graph_belong[r] = from;\n }\n else\n {\n G = r;\n }\n vector<int> visit_t(lavels.size(), -1);\n rep(i, 0, g[x].size())\n {\n int next = g[x][i];\n vector<int> lavels_new;\n vector<int> v_g;\n queue<pair<int, int>> bfs;\n bfs.push(pr(next, x));\n int t = 0;\n while (!bfs.empty())\n {\n int now = bfs.front().first;\n int prev = bfs.front().second;\n bfs.pop();\n lavels_new.push_back(lavels[now]);\n v_g.push_back(now);\n visit_t[now] = t;\n t++;\n for (auto v : g[now])\n {\n if (v != prev)\n {\n bfs.push(pr(v, now));\n }\n }\n }\n vector<vector<int>> g_new(lavels_new.size());\n bfs.push(pr(next, x));\n while (!bfs.empty())\n {\n int now = bfs.front().first;\n int prev = bfs.front().second;\n int nx = visit_t[now];\n bfs.pop();\n for (auto v : g[now])\n {\n if (v != prev)\n {\n g_new[nx].push_back(visit_t[v]);\n g_new[visit_t[v]].push_back(nx);\n bfs.push(pr(v, now));\n }\n }\n }\n build_inside(lavels_new, g_new, r);\n }\n }\n int centroid(vector<vector<int>> &g)\n {\n int N = g.size();\n vector<int> sz(N);\n vector<int> centroid;\n function<void(int, int)> dfs = [&](int u, int prev)\n {\n sz[u] = 1;\n bool is_centroid = true;\n for (auto v : g[u])\n {\n if (v != prev)\n {\n dfs(v, u);\n sz[u] += sz[v];\n if (sz[v] > N / 2)\n {\n is_centroid = false;\n }\n }\n }\n if (N - sz[u] > N / 2)\n {\n is_centroid = false;\n }\n if (is_centroid)\n {\n centroid.push_back(u);\n }\n };\n dfs(0, -1);\n return centroid[0];\n }\n\npublic:\n /*\n vector<vector<int>> lavels_each; // graph_eachのラベル\n vector<vector<vector<int>>> graph_each; // 頂点iが重心(かつ根)となっているような木を返す\n 重いので使用不可！\n */\n vector<vector<int>> centroid_graph; // 重心同士を結んだ木\n vector<int> centroid_graph_belong; // 重心同士を結んだ木の、頂点iの親\n int G; // 元のグラフの重心\n void build(vector<vector<int>> &g)\n {\n int N = g.size();\n /*\n lavels_each.resize(N);\n graph_each.resize(N);\n */\n centroid_graph.resize(N);\n centroid_graph_belong.resize(N, -1);\n vector<int> lavels(N);\n rep(i, 0, N)\n {\n lavels[i] = i;\n }\n build_inside(lavels, g, -1);\n }\n void debug()\n {\n rep(i, 0, centroid_graph.size())\n {\n printar(centroid_graph[i]);\n }\n }\n CentroidDecomposition(vector<vector<int>> &g)\n {\n build(g);\n }\n};\n\nvector<bool> flg;\nvector<vector<int>> G;\nll mod = 998244353;\nvector<mint> f(int rt)\n{\n vector<mint> s(1, 1);\n vector<mint> ret(1, 1);\n rep(i, 0, G[rt].size())\n {\n if (flg[G[rt][i]])\n {\n continue;\n }\n vector<mint> d(1, 0);\n function<void(int, int, int)> dfs = [&](int u, int prev, int depth)\n {\n if (depth >= (int)d.size())\n {\n d.push_back(1);\n }\n else\n {\n d[depth] += 1;\n }\n for (auto v : G[u])\n {\n if (v != prev && !flg[v])\n {\n dfs(v, u, depth + 1);\n }\n }\n };\n dfs(G[rt][i], rt, 1);\n vector<mint> ar = ntt.multiply(d, s);\n rep(i, 0, ar.size())\n {\n if (ret.size() <= i)\n {\n ret.resize(i + 1);\n }\n ret[i] += ar[i];\n }\n rep(i, 1, d.size())\n {\n if (s.size() <= i)\n {\n s.resize(i + 1);\n }\n s[i] += d[i];\n }\n }\n ret[0] = 1;\n return ret;\n}\n////////////////////////////////////////////////\n// 整数関係のアルゴリズム\ntemplate <typename T>\nclass Num\n{\nprivate:\n vector<ll> fac_mod_ar = {};\n vector<ll> mobius_ar = {};\n vector<bool> isprime_ar = {};\n vector<ll> base_2_ar = {};\n\npublic:\n // gcd(a,b)を返す\n T gcd(T a, T b)\n {\n if (a == 0 || b == 0)\n return 0;\n if (b > a)\n swap(a, b);\n if (a % b == 0)\n return b;\n else\n {\n return gcd(b, a % b);\n }\n }\n // lcm(a,b)を返す\n T lcm(T a, T b)\n {\n return b / gcd(a, b) * a;\n }\n // a^b (modp)を返す\n T exp(T a, T b, T p)\n {\n if (b == 0)\n return 1;\n ll l = log2((b));\n ll num = l + 1;\n // cout << num << endl;\n base_2_ar.resize(num);\n base_2_ar[0] = a;\n rep(i, 1, num)\n {\n base_2_ar[i] = base_2_ar[i - 1] * base_2_ar[i - 1];\n base_2_ar[i] %= p;\n // cout << base_2[i] << endl;\n }\n ll ret = 1;\n rep(i, 0, num)\n {\n // cout << (b >> i) % 2;\n if ((b >> i) % 2 == 1)\n ret *= base_2_ar[i];\n ret %= p;\n }\n return ret;\n }\n // ax+by=gcd(a,b)を満たすx,yを求める\n T ax_by(T a, T b, T &x, T &y)\n {\n if (b == 0)\n {\n x = 1;\n y = 0;\n return a;\n }\n T d = ax_by(b, a % b, y, x);\n y -= a / b * x;\n return d;\n }\n // a(mod m1),b(modm2)なるxを求める 中国剰余定理\n T CRT(T a, T m1, T b, T m2)\n {\n T x, y;\n ax_by(m1, m2, x, y);\n y *= (a - b);\n x *= (b - a);\n T k = (m1 * x + a);\n k %= m1 * m2;\n k += m1 * m2;\n k %= m1 * m2;\n return k;\n }\n // mod pにおけるaの逆元を求める\n T inv(T a, T p)\n {\n T ret, b;\n ax_by(a, p, ret, b);\n ret %= p;\n ret += p;\n ret %= p;\n return ret;\n }\n\n // φ(n)を求める\n T phi(T n)\n {\n ll ret = n;\n for (ll i = 2; i * i <= n; i++)\n {\n if (n % i == 0)\n {\n while (n % i == 0)\n n /= i;\n ret *= (i - 1);\n ret /= i;\n }\n }\n if (n != 1)\n {\n ret *= (n - 1);\n ret /= n;\n }\n return ret;\n }\n // 素数判定のための前計算 O(nloglogn)\n void isprime_init(ll n)\n {\n if (isprime_ar.size() >= n + 1)\n return;\n isprime_ar.resize(n + 1, true);\n isprime_ar[0] = false;\n isprime_ar[1] = false;\n for (ll i = 2; i <= n; i++)\n {\n if (isprime_ar[i])\n {\n for (ll j = 2 * i; j <= n; j += i)\n {\n isprime_ar[j] = false;\n }\n }\n }\n }\n // nCrmodのための前計算 O(n)\n void nCrmod_init(T n, T p)\n {\n if (fac_mod_ar.size() >= n + 1)\n return;\n fac_mod_ar.resize(0);\n fac_mod_ar.resize(n + 1);\n fac_mod_ar[0] = 1;\n rep(i, 1, n + 1)\n {\n fac_mod_ar[i] = fac_mod_ar[i - 1] * i;\n fac_mod_ar[i] %= p;\n }\n }\n // メビウス関数のための前計算 O(nloglogn)\n void mobius_init(T n)\n {\n if (mobius_ar.size() >= n + 1)\n return;\n mobius_ar.resize(n + 1, 1);\n isprime_init(n);\n mobius_ar[1] = 1;\n for (ll i = 2; i <= n; i++)\n {\n if (!isprime(i))\n continue;\n mobius_ar[i] = -1;\n for (ll j = 2 * i; j <= n; j += i)\n {\n if (j % (i * i) == 0)\n mobius_ar[j] = 0;\n else\n mobius_ar[j] *= -1;\n }\n }\n }\n // nの素数判定 前計算が必要\n bool isprime(ll n)\n {\n isprime_init(n);\n return isprime_ar[n];\n }\n // n! mod pを求める 前計算が必要\n T fac(T n, T p)\n {\n nCrmod_init(n, p);\n return fac_mod_ar[n];\n }\n // nCr(mod p)を求める 前計算が必要\n T nCrmod(T n, T r, T p)\n {\n nCrmod_init(n, p);\n ll ret = 1;\n ret *= fac_mod_ar[n];\n ret %= p;\n ret *= inv(fac_mod_ar[r], p);\n ret %= p;\n ret *= inv(fac_mod_ar[n - r], p);\n ret %= p;\n return ret;\n }\n // μ(n)を求める　前計算が必要\n T mobius(T n)\n {\n mobius_init(n);\n return mobius_ar[n];\n }\n};\n////////////////////////////////////////////////\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n ll n;\n cin >> n;\n G.resize(n);\n flg.resize(n);\n rep(i, 0, n - 1)\n {\n ll a, b;\n cin >> a >> b;\n a--;\n b--;\n G[a].push_back(b);\n G[b].push_back(a);\n }\n vector<mint> ans(n);\n CentroidDecomposition CD(G);\n queue<ll> que;\n que.push(CD.G);\n while (!que.empty())\n {\n ll now = que.front();\n que.pop();\n vector<mint> a = f(now);\n flg[now] = true;\n rep(i, 0, a.size())\n {\n ans[i] += a[i];\n }\n rep(i, 0, CD.centroid_graph[now].size())\n {\n ll nxt = CD.centroid_graph[now][i];\n if (nxt != CD.centroid_graph_belong[now])\n {\n que.push(nxt);\n }\n }\n }\n Num<ll> N;\n N.nCrmod_init(2 * n, mod);\n vector<mint> x(n - 1), y(n - 1);\n rep(i, 0, n - 1)\n {\n x[i] = ans[n - 1 - i] * N.fac(n - 2 - i, mod);\n y[i] = N.inv(N.fac(i, mod), mod);\n }\n vector<mint> ans2 = ntt.multiply(x, y);\n rep(i, 0, n - 1)\n {\n ans2[i] *= N.inv(N.fac(n - i - 2, mod), mod);\n }\n ans2.resize(n - 1);\n rev(ans2);\n rep(i, 0, n - 1)\n {\n cout << ans2[i] << endl;\n }\n}", "accuracy": 1, "time_ms": 1130, "memory_kb": 69664, "score_of_the_acc": -0.9056, "final_rank": 9 }, { "submission_id": "aoj_0452_9554927", "code_snippet": "#include <bits/stdc++.h>\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n\nnamespace zawa {\n\nvoid SetFastIO() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n}\n\nvoid SetPrecision(u32 dig) {\n std::cout << std::fixed << std::setprecision(dig);\n}\n\n} // namespace zawa\n\nusing namespace zawa;\n\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param m `1 <= m`\n// @return x mod m\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\n// Fast modular multiplication by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n // @param m `1 <= m`\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n // @return m\n unsigned int umod() const { return _m; }\n\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n // [1] m = 1\n // a = b = im = 0, so okay\n\n // [2] m >= 2\n // im = ceil(2^64 / m)\n // -> im * m = 2^64 + r (0 <= r < m)\n // let z = a*b = c*m + d (0 <= c, d < m)\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\n // ((ab * im) >> 64) == c or c + 1\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned long long y = x * _m;\n return (unsigned int)(z - y + (z < y ? _m : 0));\n }\n};\n\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr long long bases[3] = {2, 7, 61};\n for (long long a : bases) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n // Contracts:\n // [1] s - m0 * a = 0 (mod b)\n // [2] t - m1 * a = 0 (mod b)\n // [3] s * |m1| + t * |m0| <= b\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n // [3]:\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\n // = s * |m1| + t * |m0| <= b\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n // by [3]: |m0| <= b/g\n // by g != b: |m0| < b/g\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\n} // namespace internal\n\n} // namespace atcoder\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\n#if __cplusplus >= 202002L\n#include <bit>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n#if __cplusplus >= 202002L\n\nusing std::bit_ceil;\n\n#else\n\n// @return same with std::bit::bit_ceil\nunsigned int bit_ceil(unsigned int n) {\n unsigned int x = 1;\n while (x < (unsigned int)(n)) x *= 2;\n return x;\n}\n\n#endif\n\n// @param n `1 <= n`\n// @return same with std::bit::countr_zero\nint countr_zero(unsigned int n) {\n#ifdef _MSC_VER\n unsigned long index;\n _BitScanForward(&index, n);\n return index;\n#else\n return __builtin_ctz(n);\n#endif\n}\n\n// @param n `1 <= n`\n// @return same with std::bit::countr_zero\nconstexpr int countr_zero_constexpr(unsigned int n) {\n int x = 0;\n while (!(n & (1 << x))) x++;\n return x;\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n\nnamespace atcoder {\n\nnamespace internal {\n\ntemplate <class mint,\n int g = internal::primitive_root<mint::mod()>,\n internal::is_static_modint_t<mint>* = nullptr>\nstruct fft_info {\n static constexpr int rank2 = countr_zero_constexpr(mint::mod() - 1);\n std::array<mint, rank2 + 1> root; // root[i]^(2^i) == 1\n std::array<mint, rank2 + 1> iroot; // root[i] * iroot[i] == 1\n\n std::array<mint, std::max(0, rank2 - 2 + 1)> rate2;\n std::array<mint, std::max(0, rank2 - 2 + 1)> irate2;\n\n std::array<mint, std::max(0, rank2 - 3 + 1)> rate3;\n std::array<mint, std::max(0, rank2 - 3 + 1)> irate3;\n\n fft_info() {\n root[rank2] = mint(g).pow((mint::mod() - 1) >> rank2);\n iroot[rank2] = root[rank2].inv();\n for (int i = rank2 - 1; i >= 0; i--) {\n root[i] = root[i + 1] * root[i + 1];\n iroot[i] = iroot[i + 1] * iroot[i + 1];\n }\n\n {\n mint prod = 1, iprod = 1;\n for (int i = 0; i <= rank2 - 2; i++) {\n rate2[i] = root[i + 2] * prod;\n irate2[i] = iroot[i + 2] * iprod;\n prod *= iroot[i + 2];\n iprod *= root[i + 2];\n }\n }\n {\n mint prod = 1, iprod = 1;\n for (int i = 0; i <= rank2 - 3; i++) {\n rate3[i] = root[i + 3] * prod;\n irate3[i] = iroot[i + 3] * iprod;\n prod *= iroot[i + 3];\n iprod *= root[i + 3];\n }\n }\n }\n};\n\ntemplate <class mint, internal::is_static_modint_t<mint>* = nullptr>\nvoid butterfly(std::vector<mint>& a) {\n int n = int(a.size());\n int h = internal::countr_zero((unsigned int)n);\n\n static const fft_info<mint> info;\n\n int len = 0; // a[i, i+(n>>len), i+2*(n>>len), ..] is transformed\n while (len < h) {\n if (h - len == 1) {\n int p = 1 << (h - len - 1);\n mint rot = 1;\n for (int s = 0; s < (1 << len); s++) {\n int offset = s << (h - len);\n for (int i = 0; i < p; i++) {\n auto l = a[i + offset];\n auto r = a[i + offset + p] * rot;\n a[i + offset] = l + r;\n a[i + offset + p] = l - r;\n }\n if (s + 1 != (1 << len))\n rot *= info.rate2[countr_zero(~(unsigned int)(s))];\n }\n len++;\n } else {\n // 4-base\n int p = 1 << (h - len - 2);\n mint rot = 1, imag = info.root[2];\n for (int s = 0; s < (1 << len); s++) {\n mint rot2 = rot * rot;\n mint rot3 = rot2 * rot;\n int offset = s << (h - len);\n for (int i = 0; i < p; i++) {\n auto mod2 = 1ULL * mint::mod() * mint::mod();\n auto a0 = 1ULL * a[i + offset].val();\n auto a1 = 1ULL * a[i + offset + p].val() * rot.val();\n auto a2 = 1ULL * a[i + offset + 2 * p].val() * rot2.val();\n auto a3 = 1ULL * a[i + offset + 3 * p].val() * rot3.val();\n auto a1na3imag =\n 1ULL * mint(a1 + mod2 - a3).val() * imag.val();\n auto na2 = mod2 - a2;\n a[i + offset] = a0 + a2 + a1 + a3;\n a[i + offset + 1 * p] = a0 + a2 + (2 * mod2 - (a1 + a3));\n a[i + offset + 2 * p] = a0 + na2 + a1na3imag;\n a[i + offset + 3 * p] = a0 + na2 + (mod2 - a1na3imag);\n }\n if (s + 1 != (1 << len))\n rot *= info.rate3[countr_zero(~(unsigned int)(s))];\n }\n len += 2;\n }\n }\n}\n\ntemplate <class mint, internal::is_static_modint_t<mint>* = nullptr>\nvoid butterfly_inv(std::vector<mint>& a) {\n int n = int(a.size());\n int h = internal::countr_zero((unsigned int)n);\n\n static const fft_info<mint> info;\n\n int len = h; // a[i, i+(n>>len), i+2*(n>>len), ..] is transformed\n while (len) {\n if (len == 1) {\n int p = 1 << (h - len);\n mint irot = 1;\n for (int s = 0; s < (1 << (len - 1)); s++) {\n int offset = s << (h - len + 1);\n for (int i = 0; i < p; i++) {\n auto l = a[i + offset];\n auto r = a[i + offset + p];\n a[i + offset] = l + r;\n a[i + offset + p] =\n (unsigned long long)(mint::mod() + l.val() - r.val()) *\n irot.val();\n ;\n }\n if (s + 1 != (1 << (len - 1)))\n irot *= info.irate2[countr_zero(~(unsigned int)(s))];\n }\n len--;\n } else {\n // 4-base\n int p = 1 << (h - len);\n mint irot = 1, iimag = info.iroot[2];\n for (int s = 0; s < (1 << (len - 2)); s++) {\n mint irot2 = irot * irot;\n mint irot3 = irot2 * irot;\n int offset = s << (h - len + 2);\n for (int i = 0; i < p; i++) {\n auto a0 = 1ULL * a[i + offset + 0 * p].val();\n auto a1 = 1ULL * a[i + offset + 1 * p].val();\n auto a2 = 1ULL * a[i + offset + 2 * p].val();\n auto a3 = 1ULL * a[i + offset + 3 * p].val();\n\n auto a2na3iimag =\n 1ULL *\n mint((mint::mod() + a2 - a3) * iimag.val()).val();\n\n a[i + offset] = a0 + a1 + a2 + a3;\n a[i + offset + 1 * p] =\n (a0 + (mint::mod() - a1) + a2na3iimag) * irot.val();\n a[i + offset + 2 * p] =\n (a0 + a1 + (mint::mod() - a2) + (mint::mod() - a3)) *\n irot2.val();\n a[i + offset + 3 * p] =\n (a0 + (mint::mod() - a1) + (mint::mod() - a2na3iimag)) *\n irot3.val();\n }\n if (s + 1 != (1 << (len - 2)))\n irot *= info.irate3[countr_zero(~(unsigned int)(s))];\n }\n len -= 2;\n }\n }\n}\n\ntemplate <class mint, internal::is_static_modint_t<mint>* = nullptr>\nstd::vector<mint> convolution_naive(const std::vector<mint>& a,\n const std::vector<mint>& b) {\n int n = int(a.size()), m = int(b.size());\n std::vector<mint> ans(n + m - 1);\n if (n < m) {\n for (int j = 0; j < m; j++) {\n for (int i = 0; i < n; i++) {\n ans[i + j] += a[i] * b[j];\n }\n }\n } else {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n ans[i + j] += a[i] * b[j];\n }\n }\n }\n return ans;\n}\n\ntemplate <class mint, internal::is_static_modint_t<mint>* = nullptr>\nstd::vector<mint> convolution_fft(std::vector<mint> a, std::vector<mint> b) {\n int n = int(a.size()), m = int(b.size());\n int z = (int)internal::bit_ceil((unsigned int)(n + m - 1));\n a.resize(z);\n internal::butterfly(a);\n b.resize(z);\n internal::butterfly(b);\n for (int i = 0; i < z; i++) {\n a[i] *= b[i];\n }\n internal::butterfly_inv(a);\n a.resize(n + m - 1);\n mint iz = mint(z).inv();\n for (int i = 0; i < n + m - 1; i++) a[i] *= iz;\n return a;\n}\n\n} // namespace internal\n\ntemplate <class mint, internal::is_static_modint_t<mint>* = nullptr>\nstd::vector<mint> convolution(std::vector<mint>&& a, std::vector<mint>&& b) {\n int n = int(a.size()), m = int(b.size());\n if (!n || !m) return {};\n\n int z = (int)internal::bit_ceil((unsigned int)(n + m - 1));\n assert((mint::mod() - 1) % z == 0);\n\n if (std::min(n, m) <= 60) return convolution_naive(a, b);\n return internal::convolution_fft(a, b);\n}\ntemplate <class mint, internal::is_static_modint_t<mint>* = nullptr>\nstd::vector<mint> convolution(const std::vector<mint>& a,\n const std::vector<mint>& b) {\n int n = int(a.size()), m = int(b.size());\n if (!n || !m) return {};\n\n int z = (int)internal::bit_ceil((unsigned int)(n + m - 1));\n assert((mint::mod() - 1) % z == 0);\n\n if (std::min(n, m) <= 60) return convolution_naive(a, b);\n return internal::convolution_fft(a, b);\n}\n\ntemplate <unsigned int mod = 998244353,\n class T,\n std::enable_if_t<internal::is_integral<T>::value>* = nullptr>\nstd::vector<T> convolution(const std::vector<T>& a, const std::vector<T>& b) {\n int n = int(a.size()), m = int(b.size());\n if (!n || !m) return {};\n\n using mint = static_modint<mod>;\n\n int z = (int)internal::bit_ceil((unsigned int)(n + m - 1));\n assert((mint::mod() - 1) % z == 0);\n\n std::vector<mint> a2(n), b2(m);\n for (int i = 0; i < n; i++) {\n a2[i] = mint(a[i]);\n }\n for (int i = 0; i < m; i++) {\n b2[i] = mint(b[i]);\n }\n auto c2 = convolution(std::move(a2), std::move(b2));\n std::vector<T> c(n + m - 1);\n for (int i = 0; i < n + m - 1; i++) {\n c[i] = c2[i].val();\n }\n return c;\n}\n\n} // namespace atcoder\n\nusing mint = atcoder::modint998244353;\n\nint main() {\n SetFastIO();\n\n int N;\n std::cin >> N;\n std::vector<std::vector<int>> T(N);\n for (int i{} ; i < N - 1 ; i++) {\n int s, t;\n std::cin >> s >> t;\n s--; t--;\n T[s].push_back(t);\n T[t].push_back(s);\n }\n std::vector<bool> removed(N);\n std::vector<int> sz(N);\n auto calc_sz{[&](auto dfs, int v, int p) -> int {\n assert(!removed[v]);\n sz[v] = 1;\n for (auto x : T[v]) if (x != p and !removed[x]) {\n sz[v] += dfs(dfs, x, v);\n }\n return sz[v];\n }};\n auto cent{[&](int v) -> int {\n calc_sz(calc_sz, v, -1);\n int p{-1};\n bool fn{false};\n int all{sz[v]};\n while (!fn) {\n fn = true;\n for (auto x : T[v]) {\n if (x == p or removed[x] or 2 * sz[x] <= all) {\n continue;\n }\n fn = false;\n p = v;\n v = x;\n break;\n }\n }\n return v;\n }};\n std::vector<mint> P(N + 1, mint{1});\n for (int i{1} ; i <= N ; i++) P[i] = P[i - 1] * mint::raw(i);\n std::vector<mint> I(N + 1);\n I[N] = P[N].inv();\n for (int i{N - 1} ; i >= 0 ; i--) I[i] = I[i + 1] * mint::raw(i + 1);\n auto comb{[&](int n, int r) -> mint {\n assert(0 <= n and n <= N);\n assert(0 <= r and r <= n);\n return P[n] * I[r] * I[n - r];\n }};\n std::vector<int> dep(N);\n auto calc_dep{[&](auto dfs, int v, int p, int d) -> void {\n assert(!removed[v]);\n dep[v] = d;\n for (auto x : T[v]) if (x != p and !removed[x]) {\n dfs(dfs, x, v, d + 1);\n }\n }};\n auto calc_max_dep{[&](auto dfs, int v, int p) -> int {\n assert(!removed[v]);\n int res{dep[v]};\n for (auto x : T[v]) if (x != p and !removed[x]) {\n res = std::max(res, dfs(dfs, x, v));\n }\n return res;\n }};\n auto calc_dep_cnt{[&](auto dfs, int v, int p, std::vector<mint>& dep_cnt) -> void {\n assert(!removed[v]);\n dep_cnt[dep[v]]++; \n for (auto x : T[v]) if (x != p and !removed[x]) {\n dfs(dfs, x, v, dep_cnt);\n } \n }};\n std::vector<mint> cnt(N + 1);\n const mint inv{mint::raw(2).inv()};\n auto dfs{[&](auto dfs, int v) -> void {\n v = cent(v);\n calc_dep(calc_dep, v, -1, 0);\n int sz{calc_max_dep(calc_max_dep, v, -1)};\n std::vector<mint> sum_sq(sz + 1);\n calc_dep_cnt(calc_dep_cnt, v, -1, sum_sq);\n sum_sq = atcoder::convolution(sum_sq, sum_sq);\n std::vector<mint> sq_sum(2 * sz + 1);\n for (auto x : T[v]) if (!removed[x]) {\n int max{calc_max_dep(calc_max_dep, x, v)};\n std::vector<mint> cur(max + 1);\n calc_dep_cnt(calc_dep_cnt, x, v, cur);\n cur = atcoder::convolution(cur, cur);\n for (int i{} ; i < (int)cur.size() ; i++) sq_sum[i] += cur[i];\n }\n assert(sq_sum.size() == sum_sq.size());\n for (int i{} ; i < std::min(N + 1, (int)sum_sq.size()) ; i++) {\n cnt[i] += inv * (sum_sq[i] - sq_sum[i]);\n }\n removed[v] = true;\n for (auto x : T[v]) if (!removed[x]) dfs(dfs, x);\n }};\n dfs(dfs, 0);\n std::vector<mint> L(N);\n for (int i{1} ; i < N + 1 ; i++) {\n L[i - 1] = cnt[i];\n }\n std::reverse(L.begin(), L.end());\n std::vector<mint> X(N), Y(N);\n for (int i{} ; i < N ; i++) {\n X[i] = P[N - 1 - i] * L[i];\n Y[i] = I[i];\n }\n std::vector<mint> ans{atcoder::convolution(X, Y)};\n for (int i{N - 1} ; i >= 1 ; i--) {\n ans[i] *= I[N - 1 - i];\n std::cout << ans[i].val() << '\\n';\n }\n}", "accuracy": 1, "time_ms": 510, "memory_kb": 48844, "score_of_the_acc": -0.2139, "final_rank": 2 }, { "submission_id": "aoj_0452_6048130", "code_snippet": "#include <bits/stdc++.h>\n#define fi first\n#define se second\n#define rep(i,s,n) for (int i = (s); i < (n); ++i)\n#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)\n#define all(a) a.begin(),a.end()\n#define rall(a) a.rbegin(),a.rend()\n#define len(x) (int)(x).size()\n#define dup(x,y) (((x)+(y)-1)/(y))\n#define pb push_back\n#define eb emplace_back\n#define Field(T) vector<vector<T>>\n#define pq(T) priority_queue<T,vector<T>,greater<T>>\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n\ntemplate< int mod >\nstruct ModInt {\n int x;\n ModInt() : x(0) {}\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n ModInt &operator+=(const ModInt &p) {\n if((x += p.x) >= mod) x -= mod;\n return *this;\n }\n ModInt &operator-=(const ModInt &p) {\n if((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n ModInt &operator*=(const ModInt &p) {\n x = (int) (1LL * x * p.x % mod);\n return *this;\n }\n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n ModInt operator-() const { return ModInt(-x); }\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n bool operator==(const ModInt &p) const { return x == p.x; }\n bool operator!=(const ModInt &p) const { return x != p.x; }\n\n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while(b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n\n ModInt pow(int64_t n) const {\n ModInt ret(1), mul(x);\n while(n > 0) {\n if(n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n\n friend ostream &operator<<(ostream &os, const ModInt &p) {\n return os << p.x;\n }\n\n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt< mod >(t);\n return (is);\n }\n\n static int get_mod() { return mod; }\n};\n\nusing mint = ModInt<998244353>;\nusing vm = vector<mint>;\nstruct modinv {\n int n; vm d;\n modinv(): n(2), d({0,1}) {}\n mint operator()(int i) {\n while (n <= i) {\n d.pb(-d[mint::get_mod()%n]*(mint::get_mod()/n)), ++n;\n }\n return d[i];\n }\n mint operator[](int i) const { return d[i];}\n} invs;\nstruct modfact {\n int n; vm d;\n modfact(): n(2), d({1,1}) {}\n mint operator()(int i) { while (n <= i) d.pb(d.back()*n), ++n; return d[i];}\n mint operator[](int i) const { return d[i];}\n} facs;\nstruct modfactinv {\n int n; vm d;\n modfactinv(): n(2), d({1,1}) {}\n mint operator()(int i) { while (n <= i) d.pb(d.back()*invs(n)), ++n; return d[i];}\n mint operator[](int i) const { return d[i];}\n} ifacs;\nmint comb(int a, int b) {\n if (a < b || b < 0) return 0;\n return facs(a)*ifacs(b)*ifacs(a-b);\n}\n\nstruct NumberTheoreticTransform {\n\n int mod = mint::get_mod();\n int mxb;\n mint r;\n\n NumberTheoreticTransform() {\n auto tmp = mod - 1;\n mxb = 0;\n while(tmp % 2 == 0) tmp >>= 1, mxb++;\n r = 2;\n while(r.pow((mod - 1) >> 1) == 1) r += 1;\n assert(r.pow(mod - 1) == 1);\n r = r.pow((mod - 1) >> mxb);\n }\n\n void ntt(vm &f, int lg, bool inv) {\n int sz = (int)f.size();\n for (int i = 0; i < sz; ++i) {\n int j = 0;\n for (int k = 0; k < lg; ++k) {\n j |= ((i >> k) & 1) << (lg - 1 - k);\n }\n if (i < j) swap(f[i], f[j]);\n }\n\n for (int i = 0; i < lg; ++i) {\n int b = 1 << i;\n mint now = 1;\n mint z = r.pow(1 << (mxb - 1 - i));\n if (inv) z = z.inverse();\n for (int j = 0; j < b; ++j) {\n for (int k = 0; k < sz; k += b*2) {\n mint s = f[j + k];\n mint t = f[j + k + b] * now;\n f[j + k] = s + t;\n f[j + k + b] = s - t;\n }\n now *= z;\n }\n }\n }\n\n vm multiply(const vm &f, const vm &g) {\n vm nf, ng;\n size_t need = f.size() + g.size() - 1;\n int sz = 1, lg = 0;\n while(sz < (int)(f.size() + g.size())) {\n sz *= 2;\n ++lg;\n }\n nf.resize(sz), ng.resize(sz);\n for (int i = 0; i < (int)f.size(); ++i) {\n nf[i] = f[i];\n }\n for (int i = 0; i < (int)g.size(); ++i) {\n ng[i] = g[i];\n }\n ntt(nf, lg, 0);\n ntt(ng, lg, 0);\n for (int i = 0; i < sz; ++i) {\n nf[i] *= ng[i];\n }\n ntt(nf, lg, 1);\n vm ret(sz);\n mint inv_sz = mint(1)/sz;\n for (int i = 0; i < sz; ++i) {\n ret[i] = nf[i] * inv_sz;\n }\n ret.resize(need);\n return ret;\n }\n} ntt;\n\nstruct FPS : vm {\n#define d (*this)\n#define s int(vm::size())\n template<class...Args> FPS(Args...args): vm(args...) {}\n FPS(initializer_list<mint> a): vm(all(a)) {}\n int size() const { return vm::size();}\n void rsz(int n) { if (s < n) resize(n);}\n FPS& low_(int n) { resize(n); return d;}\n FPS low(int n) const { return FPS(d).low_(n);}\n FPS low(FPS a, int n) const { return a.low_(n);}\n FPS& rev_() { reverse(all(d)); return d;}\n FPS rev() const { return FPS(d).rev_();}\n FPS rev(FPS a) const { return a.rev_();}\n mint& operator[](int i) { rsz(i+1); return vm::operator[](i);}\n mint operator[](int i) const { return i<s ? vm::operator[](i) : 0;}\n mint operator()(mint x) const { mint r; rrep(i,s,0) r = r*x+d[i]; return r;}\n FPS operator<<(int a) const { FPS r(d); r.insert(r.begin(), a, 0); return r;}\n FPS operator>>(int a) const { FPS r(d); r.rsz(a); r.erase(r.begin(), r.begin()+a); return r;}\n FPS& fit() { while (s && !back().x) pop_back(); return d;}\n FPS operator-() const { FPS r(d); rep(i,0,s) r[i] = -r[i]; return r;}\n FPS& operator+=(const FPS& a) { rsz(len(a)); rep(i,0,len(a)) d[i] += a[i]; return d;}\n FPS& operator-=(const FPS& a) { rsz(len(a)); rep(i,0,len(a)) d[i] -= a[i]; return d;}\n FPS& operator*=(const FPS& a) { return d = ntt.multiply(a, d);}\n FPS& operator/=(const FPS& a) {\n int w = s-len(a)+1; if (w <= 0) return d = 0;\n return (rev_().low_(w) *= a.rev().inv(w)).low_(w).rev_();\n }\n FPS& operator%=(const FPS& a) { return (d -= d/a*a).low_(len(a)-1);}\n FPS& operator*=(mint a) { rep(i,0,s) d[i] *= a; return d;}\n FPS& operator/=(mint a) { return d *= a.inverse();}\n FPS& operator*=(int a) { return d *= mint(a);}\n FPS& operator/=(int a) { return d /= mint(a);}\n FPS operator+(const FPS& a) const { return FPS(d) += a;}\n FPS operator-(const FPS& a) const { return FPS(d) -= a;}\n FPS operator*(const FPS& a) const { return FPS(d) *= a;}\n FPS operator/(const FPS& a) const { return FPS(d) /= a;}\n FPS operator%(const FPS& a) const { return FPS(d) %= a;}\n FPS operator*(mint a) const { return FPS(d) *= a;}\n FPS operator/(mint a) const { return FPS(d) *= a.inverse();}\n FPS operator*(int a) const { return FPS(d) *= mint(a);}\n FPS operator/(int a) const { return FPS(d) /= mint(a);}\n FPS& mul1(mint a) { pb(0); rrep(i,s-1,0) d[i+1] += d[i], d[i] *= a; return d;} // *=(x+a), /=(x+a)\n FPS& div1(mint a) { mint pre = back(); pop_back(); rrep(i,s,0) std::swap(pre, d[i]), pre -= d[i]*a; return d;}\n FPS dif() const { FPS r(s-1); rep(i,1,len(r)) r[i-1] = d[i]*i; return r;}\n FPS integ() const { FPS r(s+1); rep(i,1,s) r[i] = d[i-1]*invs(i); return r;}\n FPS inv() const { return inv(s);}\n FPS inv(int w) const {\n FPS r({d[0].inverse()});\n for (int i = 1; i < w; i <<= 1) r = r*2 - low(r*r*low(i<<1), i<<1);\n return r.low_(w);\n }\n vm operator()(const vm& x) const {\n int n = len(x), n2 = n<<1;\n vector<FPS> t(n2);\n rep(i,0,n) t[n+i] = {-x[i],1};\n for (int i = n-1; i; --i) t[i] = t[i<<1]*t[i<<1|1];\n t[1] = d%t[1];\n rep(i,2,n2) t[i] = t[i>>1]%t[i];\n vm r(n);\n rep(i,0,n) r[i] = t[n+i][0];\n return r;\n }\n FPS shift(mint c) const {\n FPS res;\n vm a(s), b(s,1);\n rep(i,0,s) a[i] = d[i]*facs(i);\n rrep(i,s-1,0) b[i] = b[i+1]*c;\n rep(i,0,s) b[i] *= ifacs(s-1-i);\n a = ntt.multiply(a,b);\n rep(i,0,s) res[i] = a[s-1+i]*ifacs[i];\n return res;\n }\n#undef s\n#undef d\n};\n\nstruct Centroid {\n vector<vector<int>> G, Cg;\n vector<int> sz, dead;\n\n Centroid(int n) : G(n), Cg(n), sz(n, 1), dead(n, 0) {}\n\n void add_edge(int u, int v) {\n G[u].emplace_back(v);\n G[v].emplace_back(u);\n }\n\n int dfs(int v, int p) {\n sz[v] = 1;\n for (int nv : G[v]) {\n if (nv == p || dead[nv]) continue;\n sz[v] += dfs(nv, v);\n }\n return sz[v];\n }\n\n int find(int v, int p, int tmp) {\n for (int nv : G[v]) {\n if (nv == p || dead[nv]) continue;\n if (sz[nv] > tmp/2) return find(nv, v, tmp);\n }\n return v;\n }\n\n int build(int x = 0) {\n int c = find(x, -1, dfs(x, -1));\n dead[c] = true;\n for (auto nv : G[c]) {\n if (!dead[nv]) {\n Cg[c].emplace_back(build(nv));\n }\n }\n dead[c] = false;\n return c;\n }\n};\n\nint main() {\n int n;\n cin >> n;\n Centroid cent(n);\n rep(i,0,n-1) {\n int s, t;\n cin >> s >> t;\n --s, --t;\n cent.add_edge(s, t);\n }\n int r = cent.build();\n FPS dep, a(len(cent.G)-1);\n int d = 0;\n function<void(int,int)> dfs = [&](int v, int p) {\n if (len(dep) == d) {\n dep.push_back(1);\n } else {\n dep[d] += 1;\n }\n ++d;\n for (auto nv : cent.G[v]) {\n if (nv == p || cent.dead[nv]) continue;\n dfs(nv, v);\n }\n --d;\n };\n function<void(int)> cdfs = [&](int c) {\n cent.dead[c] = true;\n FPS s = {0};\n for (auto nv : cent.G[c]) {\n if (cent.dead[nv]) continue;\n dep.clear();\n dfs(nv, -1);\n a += (s * dep) << 1;\n s += dep;\n a += dep;\n }\n for (auto nc : cent.Cg[c]) {\n cdfs(nc);\n }\n };\n cdfs(r);\n a = a.shift(1);\n rep(i,0,n-1) {\n cout << a[i] << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 1070, "memory_kb": 52800, "score_of_the_acc": -0.5491, "final_rank": 7 }, { "submission_id": "aoj_0452_6022546", "code_snippet": "#include <bits/stdc++.h>\n\nusing ll = long long;\n\ntemplate <class T> using Vec = std::vector<T>;\n\ntemplate <class F> struct RecLambda : private F {\n explicit RecLambda(F&& f): F(std::forward<F>(f)) {}\n template <class... Args> decltype(auto) operator()(Args&&... args) const {\n return F::operator()(*this, std::forward<Args>(args)...);\n }\n};\n\nconstexpr int MOD = 998244353;\nconstexpr int PROOT = 3;\n\nstruct Fp {\n int x;\n Fp() : x(0) {}\n Fp(int v): x(v) {}\n Fp& operator += (const Fp& t) {\n if ((x += t.x) >= MOD) x -= MOD;\n return *this;\n }\n Fp operator + (const Fp& t) const {\n return Fp(*this) += t;\n }\n Fp& operator -= (const Fp& t) {\n if ((x += MOD - t.x) >= MOD) x -= MOD;\n return *this;\n }\n Fp operator - (const Fp& t) const {\n return Fp(*this) -= t;\n }\n Fp& operator *= (const Fp& t) {\n return *this = *this * t;\n }\n Fp operator * (const Fp& t) const {\n return Fp((ll) x * t.x % MOD);\n }\n Fp pow(int e) const {\n Fp ret(1), mul(*this);\n while (e > 0) {\n if (e & 1) ret *= mul;\n mul *= mul;\n e >>= 1;\n }\n return ret;\n }\n Fp inv() const {\n return pow(MOD - 2);\n }\n Fp& operator /= (const Fp& t) {\n return *this *= t.inv();\n }\n Fp operator / (const Fp& t) const {\n return *this * t.inv();\n }\n};\n\nvoid butterfly(Vec<Fp>& a, bool inv = false) {\n int n = a.size();\n int d = __builtin_ctz(n);\n for (int i = 0; i < n; ++i) {\n int j = 0;\n for (int k = 0; k < d; ++k) {\n if (i >> k & 1) {\n j |= 1 << (d - k - 1);\n }\n }\n if (i < j) {\n std::swap(a[i], a[j]);\n }\n }\n Vec<Fp> coeff(d);\n coeff[d - 1] = (inv ? Fp(PROOT).inv() : Fp(PROOT)).pow((MOD - 1) >> d); \n for (int i = d - 1; i > 0; --i) {\n coeff[i - 1] = coeff[i] * coeff[i];\n }\n for (int s = 0; s < d; ++s) {\n int mh = 1 << s;\n int m = mh << 1;\n for (int i = 0; i < n; i += m) {\n Fp c = 1;\n for (int j = i; j < i + mh; ++j) {\n Fp x = a[j], y = a[j + mh] * c;\n a[j] = x + y;\n a[j + mh] = x - y;\n c *= coeff[s];\n }\n }\n }\n}\n\nVec<Fp> convolution(Vec<Fp> a, Vec<Fp> b) {\n if (a.empty() or b.empty()) return {};\n int len = a.size() + b.size() - 1;\n if (len == 1) return {a[0] * b[0]};\n int sz = 1;\n while (sz < len) {\n sz *= 2;\n }\n a.resize(sz);\n b.resize(sz);\n butterfly(a);\n butterfly(b);\n for (int i = 0; i < sz; ++i) {\n a[i] *= b[i];\n }\n butterfly(a, true);\n a.resize(len);\n auto inv = Fp(sz).inv();\n for (auto& x : a) {\n x *= inv;\n }\n return a;\n}\n\nVec<Fp> square(Vec<Fp> a) {\n if (a.empty()) return {};\n int len = 2 * a.size() - 1;\n if (len == 1) return {a[0] * a[0]};\n int sz = 1;\n while (sz < len) {\n sz *= 2;\n }\n a.resize(sz);\n butterfly(a);\n for (auto& x : a) {\n x *= x;\n }\n butterfly(a, true);\n a.resize(len);\n auto inv = Fp(sz).inv();\n for (auto& x : a) {\n x *= inv;\n }\n return a;\n}\n\nint main() {\n std::ios_base::sync_with_stdio(false);\n std::cin.tie(nullptr);\n \n int n;\n std::cin >> n;\n Vec<Vec<int>> graph(n);\n for (int i = 1; i < n; ++i) {\n int s, t;\n std::cin >> s >> t;\n s -= 1, t -= 1;\n graph[s].push_back(t);\n graph[t].push_back(s);\n }\n\n Vec<char> used(n);\n Vec<int> subtree(n);\n \n \n const auto setup = RecLambda([&](auto&& dfs, int u, int p) -> void {\n subtree[u] = 1;\n for (int v : graph[u]) {\n if (v != p and !used[v]) {\n dfs(v, u);\n subtree[u] += subtree[v];\n }\n } \n });\n\n const auto search = RecLambda([&](auto&& dfs, int u, int p, int d, Vec<Fp>& count) -> void {\n if (d >= (int)count.size()) {\n count.emplace_back();\n }\n count[d] += 1;\n for (int v : graph[u]) {\n if (v != p and !used[v]) {\n dfs(v, u, d + 1, count);\n }\n }\n });\n\n Vec<Fp> exact(n - 1);\n\n const auto decompose = RecLambda([&](auto&& dfs, int u, int p, int whole) -> void {\n for (int v : graph[u]) {\n if (v != p and !used[v] and subtree[v] * 2 > whole) {\n dfs(v, u, whole);\n return;\n }\n }\n used[u] = true;\n Vec<Fp> sum;\n for (int v : graph[u]) {\n if (used[v]) continue;\n Vec<Fp> count;\n search(v, u, 0, count);\n for (int i = 0; i < (int)count.size(); ++i) {\n if (i >= (int)sum.size()) {\n sum.emplace_back();\n }\n sum[i] += count[i];\n exact[i] += Fp(2) * count[i];\n }\n count = square(count);\n for (int i = 0; i < std::min(n - 2, (int)count.size()); ++i) {\n exact[i + 1] -= count[i];\n }\n }\n sum = square(sum);\n for (int i = 0; i < std::min(n - 2, (int)sum.size()); ++i) {\n exact[i + 1] += sum[i];\n }\n for (int v : graph[u]) {\n if (used[v]) continue;\n setup(v, u);\n dfs(v, u, subtree[v]);\n }\n });\n\n setup(0, -1);\n decompose(0, -1, n);\n\n Vec<Fp> fact(n), ifact(n);\n fact[0] = 1;\n for (int i = 1; i < n; ++i) {\n fact[i] = fact[i - 1] * Fp(i);\n }\n ifact.back() = fact.back().inv();\n for (int i = n - 1; i > 0; --i) {\n ifact[i - 1] = ifact[i] * Fp(i);\n }\n\n Vec<Fp> coeff(n - 1);\n for (int i = 0; i < n - 1; ++i) {\n exact[i] *= Fp((998244353 + 1) / 2);\n exact[i] *= fact[i];\n coeff[i] = ifact[n - i - 2];\n }\n\n Vec<Fp> ans = convolution(exact, coeff);\n for (int i = 0; i < n - 1; ++i) {\n std::cout << (ans[i + n - 2] * ifact[i]).x << '\\n';\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 1380, "memory_kb": 73904, "score_of_the_acc": -1.1034, "final_rank": 12 }, { "submission_id": "aoj_0452_5894825", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i = 0; i < (n); i++)\nusing namespace std;\ntypedef long long ll;\n\ntemplate<int MOD> struct Fp {\n long long val;\n constexpr Fp(long long v = 0) noexcept : val(v % MOD) {\n if (val < 0) val += MOD;\n }\n constexpr int getmod() const { return MOD; }\n constexpr Fp operator - () const noexcept {\n return val ? MOD - val : 0;\n }\n constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }\n constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }\n constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }\n constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }\n constexpr Fp& operator += (const Fp& r) noexcept {\n val += r.val;\n if (val >= MOD) val -= MOD;\n return *this;\n }\n constexpr Fp& operator -= (const Fp& r) noexcept {\n val -= r.val;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr Fp& operator *= (const Fp& r) noexcept {\n val = val * r.val % MOD;\n return *this;\n }\n constexpr Fp& operator /= (const Fp& r) noexcept {\n long long a = r.val, b = MOD, u = 1, v = 0;\n while (b) {\n long long t = a / b;\n a -= t * b, swap(a, b);\n u -= t * v, swap(u, v);\n }\n val = val * u % MOD;\n if (val < 0) val += MOD;\n return *this;\n }\n constexpr bool operator == (const Fp& r) const noexcept {\n return this->val == r.val;\n }\n constexpr bool operator != (const Fp& r) const noexcept {\n return this->val != r.val;\n }\n constexpr bool operator < (const Fp& r) const noexcept {\n return this->val < r.val;\n }\n friend constexpr istream& operator >> (istream& is, Fp<MOD>& x) noexcept {\n is >> x.val;\n x.val %= MOD;\n if (x.val < 0) x.val += MOD;\n return is;\n }\n friend constexpr ostream& operator << (ostream& os, const Fp<MOD>& x) noexcept {\n return os << x.val;\n }\n friend constexpr Fp<MOD> modpow(const Fp<MOD>& a, long long n) noexcept {\n if (n == 0) return 1;\n auto t = modpow(a, n / 2);\n t = t * t;\n if (n & 1) t = t * a;\n return t;\n }\n};\n\n// NTT\nnamespace NTT {\n long long modpow(long long a, long long n, int mod) {\n long long res = 1;\n while (n > 0) {\n if (n & 1) res = res * a % mod;\n a = a * a % mod;\n n >>= 1;\n }\n return res;\n }\n\n long long modinv(long long a, int mod) {\n long long b = mod, u = 1, v = 0;\n while (b) {\n long long t = a / b;\n a -= t * b, swap(a, b);\n u -= t * v, swap(u, v);\n }\n u %= mod;\n if (u < 0) u += mod;\n return u;\n }\n\n int calc_primitive_root(int mod) {\n if (mod == 2) return 1;\n if (mod == 167772161) return 3;\n if (mod == 469762049) return 3;\n if (mod == 754974721) return 11;\n if (mod == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n long long x = (mod - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (long long i = 3; i * i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) x /= i;\n }\n }\n if (x > 1) divs[cnt++] = x;\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (modpow(g, (mod - 1) / divs[i], mod) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n }\n\n int get_fft_size(int N, int M) {\n int size_a = 1, size_b = 1;\n while (size_a < N) size_a <<= 1;\n while (size_b < M) size_b <<= 1;\n return max(size_a, size_b) << 1;\n }\n\n // number-theoretic transform\n template<class mint> void trans(vector<mint> &v, bool inv = false) {\n if (v.empty()) return;\n int N = (int)v.size();\n int MOD = v[0].getmod();\n int PR = calc_primitive_root(MOD);\n static bool first = true;\n static vector<long long> vbw(30), vibw(30);\n if (first) {\n first = false;\n for (int k = 0; k < 30; ++k) {\n vbw[k] = modpow(PR, (MOD - 1) >> (k + 1), MOD);\n vibw[k] = modinv(vbw[k], MOD);\n }\n }\n for (int i = 0, j = 1; j < N - 1; j++) {\n for (int k = N >> 1; k > (i ^= k); k >>= 1);\n if (i > j) swap(v[i], v[j]);\n }\n for (int k = 0, t = 2; t <= N; ++k, t <<= 1) {\n long long bw = vbw[k];\n if (inv) bw = vibw[k];\n for (int i = 0; i < N; i += t) {\n mint w = 1;\n for (int j = 0; j < t/2; ++j) {\n int j1 = i + j, j2 = i + j + t/2;\n mint c1 = v[j1], c2 = v[j2] * w;\n v[j1] = c1 + c2;\n v[j2] = c1 - c2;\n w *= bw;\n }\n }\n }\n if (inv) {\n long long invN = modinv(N, MOD);\n for (int i = 0; i < N; ++i) v[i] = v[i] * invN;\n }\n }\n\n // for garner\n static constexpr int MOD0 = 754974721;\n static constexpr int MOD1 = 167772161;\n static constexpr int MOD2 = 469762049;\n using mint0 = Fp<MOD0>;\n using mint1 = Fp<MOD1>;\n using mint2 = Fp<MOD2>;\n static const mint1 imod0 = 95869806; // modinv(MOD0, MOD1);\n static const mint2 imod1 = 104391568; // modinv(MOD1, MOD2);\n static const mint2 imod01 = 187290749; // imod1 / MOD0;\n\n // small case (T = mint, long long)\n template<class T> vector<T> naive_mul \n (const vector<T> &A, const vector<T> &B) {\n if (A.empty() || B.empty()) return {};\n int N = (int)A.size(), M = (int)B.size();\n vector<T> res(N + M - 1);\n for (int i = 0; i < N; ++i)\n for (int j = 0; j < M; ++j)\n res[i + j] += A[i] * B[j];\n return res;\n }\n\n // mint\n template<class mint> vector<mint> mul\n (const vector<mint> &A, const vector<mint> &B) {\n if (A.empty() || B.empty()) return {};\n int N = (int)A.size(), M = (int)B.size();\n if (min(N, M) < 30) return naive_mul(A, B);\n int MOD = A[0].getmod();\n int size_fft = get_fft_size(N, M);\n if (MOD == 998244353) {\n vector<mint> a(size_fft), b(size_fft), c(size_fft);\n for (int i = 0; i < N; ++i) a[i] = A[i];\n for (int i = 0; i < M; ++i) b[i] = B[i];\n trans(a), trans(b);\n vector<mint> res(size_fft);\n for (int i = 0; i < size_fft; ++i) res[i] = a[i] * b[i];\n trans(res, true);\n res.resize(N + M - 1);\n return res;\n }\n vector<mint0> a0(size_fft, 0), b0(size_fft, 0), c0(size_fft, 0);\n vector<mint1> a1(size_fft, 0), b1(size_fft, 0), c1(size_fft, 0);\n vector<mint2> a2(size_fft, 0), b2(size_fft, 0), c2(size_fft, 0);\n for (int i = 0; i < N; ++i)\n a0[i] = A[i].val, a1[i] = A[i].val, a2[i] = A[i].val;\n for (int i = 0; i < M; ++i)\n b0[i] = B[i].val, b1[i] = B[i].val, b2[i] = B[i].val;\n trans(a0), trans(a1), trans(a2), trans(b0), trans(b1), trans(b2);\n for (int i = 0; i < size_fft; ++i) {\n c0[i] = a0[i] * b0[i];\n c1[i] = a1[i] * b1[i];\n c2[i] = a2[i] * b2[i];\n }\n trans(c0, true), trans(c1, true), trans(c2, true);\n static const mint mod0 = MOD0, mod01 = mod0 * MOD1;\n vector<mint> res(N + M - 1);\n for (int i = 0; i < N + M - 1; ++i) {\n int y0 = c0[i].val;\n int y1 = (imod0 * (c1[i] - y0)).val;\n int y2 = (imod01 * (c2[i] - y0) - imod1 * y1).val;\n res[i] = mod01 * y2 + mod0 * y1 + y0;\n }\n return res;\n }\n\n // long long\n vector<long long> mul_ll\n (const vector<long long> &A, const vector<long long> &B) {\n if (A.empty() || B.empty()) return {};\n int N = (int)A.size(), M = (int)B.size();\n if (min(N, M) < 30) return naive_mul(A, B);\n int size_fft = get_fft_size(N, M);\n vector<mint0> a0(size_fft, 0), b0(size_fft, 0), c0(size_fft, 0);\n vector<mint1> a1(size_fft, 0), b1(size_fft, 0), c1(size_fft, 0);\n vector<mint2> a2(size_fft, 0), b2(size_fft, 0), c2(size_fft, 0);\n for (int i = 0; i < N; ++i)\n a0[i] = A[i], a1[i] = A[i], a2[i] = A[i];\n for (int i = 0; i < M; ++i)\n b0[i] = B[i], b1[i] = B[i], b2[i] = B[i];\n trans(a0), trans(a1), trans(a2), trans(b0), trans(b1), trans(b2);\n for (int i = 0; i < size_fft; ++i) {\n c0[i] = a0[i] * b0[i];\n c1[i] = a1[i] * b1[i];\n c2[i] = a2[i] * b2[i];\n }\n trans(c0, true), trans(c1, true), trans(c2, true);\n static const long long mod0 = MOD0, mod01 = mod0 * MOD1;\n vector<long long> res(N + M - 1);\n for (int i = 0; i < N + M - 1; ++i) {\n int y0 = c0[i].val;\n int y1 = (imod0 * (c1[i] - y0)).val;\n int y2 = (imod01 * (c2[i] - y0) - imod1 * y1).val;\n res[i] = mod01 * y2 + mod0 * y1 + y0;\n }\n return res;\n }\n};\n\n// Binomial coefficient\ntemplate<class T> struct BiCoef {\n vector<T> fact_, inv_, finv_;\n constexpr BiCoef() {}\n constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {\n init(n);\n }\n constexpr void init(int n) noexcept {\n fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);\n int MOD = fact_[0].getmod();\n for(int i = 2; i < n; i++){\n fact_[i] = fact_[i-1] * i;\n inv_[i] = -inv_[MOD%i] * (MOD/i);\n finv_[i] = finv_[i-1] * inv_[i];\n }\n }\n constexpr T com(int n, int k) const noexcept {\n if (n < k || n < 0 || k < 0) return 0;\n return fact_[n] * finv_[k] * finv_[n-k];\n }\n constexpr T fact(int n) const noexcept {\n if (n < 0) return 0;\n return fact_[n];\n }\n constexpr T inv(int n) const noexcept {\n if (n < 0) return 0;\n return inv_[n];\n }\n constexpr T finv(int n) const noexcept {\n if (n < 0) return 0;\n return finv_[n];\n }\n};\n\nconst int MOD = 998244353;\nusing mint = Fp<MOD>;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n int N; cin >> N;\n vector<vector<int>> G(N);\n rep(i,N-1){\n int u,v; cin >> u >> v; u--; v--;\n G[u].push_back(v);\n G[v].push_back(u);\n }\n\n vector<int> sz(N), dead(N, 0);\n auto centroid = [&](int root) {\n function<void(int,int)> get_size = [&](int v, int p) -> void {\n sz[v] = 1;\n for(int to : G[v]) {\n if(to == p || dead[to]) continue;\n get_size(to, v);\n sz[v] += sz[to];\n }\n }; get_size(root, -1);\n\n int M = sz[root];\n function<int(int,int)> dfs = [&](int v, int p) -> int {\n for(int to : G[v]) {\n if(to == p || dead[to]) continue;\n if(sz[to] > M / 2) return dfs(to, v);\n }\n return v;\n }; return dfs(root, -1);\n };\n\n vector<mint> ans(N, 0);\n function<void(int)> rec = [&](int v) {\n int c = centroid(v);\n dead[c] = true;\n for(int to : G[c]) {\n if(dead[to]) continue;\n rec(to);\n }\n\n vector<mint> whole_depth;\n whole_depth.push_back(1);\n\n for(int to : G[c]) {\n if(dead[to]) continue;\n vector<mint> depth;\n function<void(int,int,int)> calc_depth = [&](int v, int p, int d) -> void {\n while(whole_depth.size() <= d) whole_depth.push_back(0);\n while(depth.size() <= d) depth.push_back(0);\n whole_depth[d] += 1;\n depth[d] += 1;\n for(int u : G[v]) {\n if(u == p || dead[u]) continue;\n calc_depth(u, v, d + 1);\n }\n }; calc_depth(to, c, 1);\n\n auto res = NTT::mul(depth, depth);\n for(int i = 0; i < min(ans.size(), res.size()); i++) ans[i] -= res[i];\n }\n\n auto whole_res = NTT::mul(whole_depth, whole_depth);\n for(int i = 0; i < min(ans.size(), whole_res.size()); i++) ans[i] += whole_res[i];\n dead[c] = false;\n }; rec(0);\n\n ans.erase(ans.begin()); ans.push_back(0);\n BiCoef<mint> bc(220000);\n rep(i,ans.size()) ans[i] *= bc.fact(i) * bc.inv(2);\n reverse(ans.begin(), ans.end());\n vector<mint> coef(N + 1);\n rep(i,N+1) coef[i] = bc.finv(i);\n ans = NTT::mul(ans, coef);\n ans.resize(N);\n reverse(ans.begin(), ans.end());\n rep(i,N) ans[i] *= bc.finv(i);\n rep(i,N-1) cout << ans[i] << '\\n';\n}", "accuracy": 1, "time_ms": 900, "memory_kb": 58996, "score_of_the_acc": -0.5916, "final_rank": 8 }, { "submission_id": "aoj_0452_5869535", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nusing i32 = int32_t;\nusing u32 = uint32_t;\nusing i64 = int64_t;\nusing u64 = uint64_t;\n#define rep(i,n) for(int i=0; i<(n); i++)\n\n\n#include <vector>\n#include <algorithm>\n\n\ntemplate<unsigned int MOD>\nu64 powm(u64 a, u64 i) {\n if (i == 0) return 1;\n u64 r = powm<MOD>(a * a % MOD, i / 2);\n if (i & 1) r = r * a % MOD;\n return r;\n}\n\n\ntemplate<unsigned int MOD>\nvoid NTT(vector<u64>& A, u64 g) {\n int N = 1;\n while (N < A.size()) N *= 2;\n for (int i = 0, j = 0; j < N; j++) {\n if (i < j) swap(A[i], A[j]);\n for (int k = N >> 1; k > (i ^= k); k >>= 1);\n }\n for (int i = 1; i < N; i <<= 1) {\n u64 q = powm<MOD>(g, (MOD - 1) / i / 2), qj = 1;\n for (int j = 0; j < i; j++) {\n for (int k = j; k < N; k += i * 2) {\n u64 l = A[k];\n u64 r = A[k + i] * qj % MOD;\n A[k] = l + r;\n if (A[k] >= MOD) A[k] -= MOD;\n A[k + i] = l + MOD - r;\n if (A[k + i] >= MOD) A[k + i] -= MOD;\n }\n qj = qj * q % MOD;\n }\n }\n}\n\n\ntemplate<unsigned int MOD, unsigned int g>\nvector<u64> convolution_static(const vector<u64>& A, const vector<u64>& B) {\n int reqsize = A.size() + B.size() - 1;\n int Z = 1; while (Z < reqsize) Z *= 2;\n vector<u64> Ax(Z), Bx(Z);\n vector<u64> res(reqsize);\n u64 iZ = powm<MOD>(Z, MOD - 2);\n rep(i, A.size()) Ax[i] = A[i];\n rep(i, B.size()) Bx[i] = B[i];\n NTT<MOD>(Ax, g); NTT<MOD>(Bx, g);\n rep(i, Z) Ax[i] = Ax[i] * Bx[i] % MOD;\n NTT<MOD>(Ax, g);\n reverse(Ax.begin() + 1, Ax.end());\n rep(i, Z) Ax[i] = Ax[i] * iZ % MOD;\n Ax.resize(A.size() + B.size() - 1);\n return move(Ax);\n}\n\n/*\nvector<u64> convolution(const vector<u64>& A, const vector<u64>& B) {\n static const u64 MOD0 = 998244353;\n static const u64 MOD1 = 1107296257;\n vector<u64> res0 = convolution_static<MOD0, 3>(A, B);\n vector<u64> res1 = convolution_static<MOD1, 10>(A, B);\n vector<u64> res(res0.size());\n u64 t = powm<MOD1>(MOD0, MOD1 - 2);\n rep(i, res.size()) {\n u64 x = res1[i] + MOD1 - res0[i];\n if (x >= MOD1) x -= MOD1;\n x = x * t % MOD1;\n res[i] = res0[i] + x * MOD0;\n }\n return res;\n}\n*/\nvector<u64> convolution(const vector<u64>& A, const vector<u64>& B) {\n return convolution_static<998244353,3>(A,B);\n}\n\n\nvector<u64> frequency_table_of_tree_distance(const vector<vector<int>>& E) {\n int n = E.size();\n vector<int> Z(n, 1);\n vector<u64> ans(n, 0);\n auto dfsz = [&](int p, int pre, auto dfsz)->void {\n for (int e : E[p]) if (e != pre) {\n dfsz(e, p, dfsz);\n Z[p] += Z[e];\n }\n };\n dfsz(0, -1, dfsz);\n auto dfsmain = [&](int s, auto dfsmain)->void {\n if (Z[s] == 1) { Z[s] = 0; return; }\n while (true) {\n int mxz = E[s][0];\n for (int e : E[s]) if (Z[e] > Z[mxz]) mxz = e;\n if (Z[mxz] * 2 > Z[s]) { Z[s] -= Z[mxz]; Z[mxz] += Z[s]; s = mxz; }\n else break;\n }\n Z[s] = 0;\n vector<vector<u64>> dcnt;\n for (int s2 : E[s]) if (Z[s2] != 0) {\n vector<int> I = { s2 };\n vector<int> D = { 1 };\n vector<int> P = { -1 };\n rep(i, I.size()) {\n int p = I[i];\n for (int e : E[p]) if (e != P[i]) if (Z[e] != 0) {\n I.push_back(e);\n D.push_back(D[i] + 1);\n P.push_back(p);\n }\n }\n vector<u64> tmp(D.back() + 1);\n for (int d : D) tmp[d]++;\n dcnt.emplace_back(move(tmp));\n }\n\n sort(dcnt.begin(), dcnt.end(),\n [](const vector<u64>& l, const vector<u64>& r)->bool\n { return l.size() < r.size(); }\n );\n rep(i, dcnt.size() - 1) {\n vector<u64> tmp = convolution(dcnt[i + 1], dcnt[i]);\n rep(k, tmp.size()) ans[k] += tmp[k];\n rep(k, dcnt[i].size()) dcnt[i + 1][k] += dcnt[i][k];\n }\n rep(k, dcnt.back().size()) ans[k] += dcnt.back()[k];\n\n for (int s2 : E[s]) if (Z[s2] != 0) dfsmain(s2, dfsmain);\n };\n dfsmain(0, dfsmain);\n return ans;\n}\n\nconst u64 MOD = 998244353;\n\n\nint main(){\n int N; cin >> N;\n vector<vector<int>> E(N);\n rep(i,N-1){\n int u,v; cin >> u >> v; u--; v--;\n E[u].push_back(v);\n E[v].push_back(u);\n }\n\n vector<u64> F(N+1,1);\n for(int i=1; i<=N; i++) F[i] = F[i-1] * i % MOD;\n vector<u64> I(N+1,1);\n for(int i=2; i<=N; i++) I[i] = (MOD - MOD / i) * I[MOD%i] % MOD;\n vector<u64> iF(N+1,1);\n for(int i=1; i<=N; i++) iF[i] = iF[i-1] * I[i] % MOD;\n\n auto res = frequency_table_of_tree_distance(E);\n for(int i=1; i<res.size(); i++) res[i-1] = res[i];\n res.back() = 0;\n rep(i,res.size()) res[i] = res[i] * F[i] % MOD;\n reverse(res.begin(), res.end());\n res = convolution(res, iF);\n res.resize(N);\n reverse(res.begin(), res.end());\n rep(i,res.size()) res[i] = res[i] * iF[i] % MOD;\n rep(i,N-1) cout << res[i] << \"\\n\";\n return 0;\n}\n\n\n\n\nstruct ios_do_not_sync {\n ios_do_not_sync() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n }\n} ios_do_not_sync_instance;", "accuracy": 1, "time_ms": 520, "memory_kb": 52032, "score_of_the_acc": -0.2806, "final_rank": 5 }, { "submission_id": "aoj_0452_5234655", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nstruct FastIO {\n const static int ibufsiz = 4<<20, obufsiz = 18<<20;\n char ibuf[ibufsiz], *ipos = ibuf, obuf[obufsiz], *opos = obuf;\n FastIO() { fread(ibuf, 1, ibufsiz, stdin); }\n ~FastIO() { fwrite(obuf, 1, opos - obuf, stdout); }\n template<class T> FastIO& operator>>(T &x) {\n bool sign = 0; while (!isdigit(*ipos)) { if (*ipos == '-') sign = 1; ++ipos; } \n x = *ipos++ & 15;\n while (isdigit(*ipos)) x = x * 10 + (*ipos++ & 15);\n if (sign) x = -x;\n return *this;\n }\n template<class T> FastIO& operator<<(T n) {\n static char _buf[18];\n char* _pos = _buf;\n if (n < 0) *opos++ = '-', n = -n;\n do *_pos++ = '0' + n % 10; while (n /= 10);\n while (_pos != _buf) *opos++ = *--_pos;\n return *this;\n }\n FastIO& operator<<(char ch) { *opos++ = ch; return *this; }\n};\n\nconst long long mod = 998244353, G = 3, Gi = (mod + 1) / 3;\n\ntemplate <unsigned mod> struct modint {\n unsigned val;\npublic:\n modint() : val(0) {}\n template <class T> modint(T x) { x %= mod; if (x < 0) x += mod; val = (unsigned)x; }\n modint& operator++() { val++; if (val == mod) val = 0; return *this; }\n modint& operator--() { if (val == 0) val = mod; val--; return *this; }\n modint& operator+=(const modint &x) { val += x.val; if (val >= mod) val -= mod; return *this; }\n modint& operator-=(const modint &x) { val -= x.val; if (val >= mod) val += mod; return *this; }\n modint& operator*=(const modint &x) { val = 1ull * val * x.val % mod; return *this; }\n modint& operator/=(const modint &x) { return *this *= x.inv(); }\n modint pow(unsigned long long n) const { modint x = *this, r(1); while (n) { if (n&1) r *= x; x *= x; n>>=1; } return r; }\n modint inv() const { return pow(mod - 2); }\n friend modint operator+(const modint &a, const modint &b) { return modint(a) += b; }\n friend modint operator-(const modint &a, const modint &b) { return modint(a) -= b; }\n friend modint operator*(const modint &a, const modint &b) { return modint(a) *= b; }\n friend modint operator/(const modint &a, const modint &b) { return modint(a) /= b; }\n};\n\nusing mint = modint<mod>;\n\ntemplate <unsigned ntt_mod, unsigned ntt_root> class NTT {\n using mint = modint<ntt_mod>;\n static const int maxbit = 25;\n mint e[maxbit], ie[maxbit], sum_e[maxbit], sum_ie[maxbit];\npublic:\n NTT() {\n int cnt = __builtin_ctz(ntt_mod-1);\n mint w = mint(ntt_root).pow((ntt_mod-1)>>cnt), iw = w.inv();\n for (int i = cnt; ~i; i--, w *= w, iw *= iw) e[i] = w, ie[i] = iw;\n w = 1, iw = 1;\n for (int i = 0; i <= cnt-2; i++) {\n sum_e[i] = e[i+2] * w; w *= ie[i+2];\n sum_ie[i] = ie[i+2] * iw; iw *= e[i+2]; \n }\n }\n void transform(vector<mint> &F, int sing) {\n const int n = F.size();\n int h = 0;\n while ((unsigned)(1<<h) < (unsigned)n) h++;\n if (~sing) {\n for (int i = 0; i < h; i++) {\n mint s = 1;\n for (int j = 0, t = 1<<i, gap = 1<<(h-i-1); j < t; j++) {\n for (int k = j<<h-i; k < (j<<h-i)+gap; k++) {\n mint x = F[k], y = F[gap+k] * s;\n F[k] = x + y, F[gap+k] = x - y;\n }\n s *= sum_e[__builtin_ctz(~(unsigned int)j)];\n }\n }\n }\n else {\n for (int i = h-1; ~i; i--) {\n mint s = 1;\n for (int j = 0, t = 1<<i, gap = 1<<(h-i-1); j < t; j++) {\n for (int k = j<<(h-i); k < (j<<h-i)+gap; k++) {\n mint x = F[k], y = F[gap+k];\n F[k] = x + y, F[gap+k] = (x - y) * s;\n }\n s *= sum_ie[__builtin_ctz(~(unsigned int)j)];\n }\n }\n mint inv = mint(1<<h).inv();\n for (int i = 0; i < (1<<h); i++) F[i] *= inv;\n }\n }\n};\n\nNTT<mod, G> ntt;\n\nstruct poly {\n vector<mint> v;\n poly(int n = 1) : v(n) {}\n int size() const { return (int)v.size(); }\n inline void clear() { v.clear(); }\n inline void cut(int len) { if (len < size()) v.resize(static_cast<size_t>(len)); } \n inline mint& operator[](int i) { return v[i]; }\n poly& operator+=(const poly &a) {\n this->v.resize(max(size(), a.size()));\n for (int i = a.size()-1; ~i; i--) this->v[i] += a.v[i];\n return *this;\n }\n poly& operator-=(const poly &a) {\n this->v.resize(max(size(), a.size()));\n for (int i = a.size()-1; ~i; i--) this->v[i] -= a.v[i];\n return *this;\n }\n poly& operator*=(poly a) {\n int N = size() + a.size() - 1;\n int len = 1;\n while (len < N) len <<= 1;\n this->v.resize(len), a.v.resize(len);\n ntt.transform(this->v, 1), ntt.transform(a.v, 1);\n for (int i = 0; i < len; i++) v[i] *= a[i];\n ntt.transform(this->v, -1);\n this->cut(N);\n return *this;\n }\n poly operator+(const poly &a) { return poly(*this) += a; }\n poly operator-(const poly &a) { return poly(*this) -= a; }\n poly operator*(const poly &a) { return poly(*this) *= a; }\n};\n\ntemplate<class T> struct Factorial {\n vector<T> fac, ifac;\npublic:\n Factorial(int n) : fac(n+1), ifac(n+1) {\n fac[0] = T(1);\n for (int i = 1; i <= n; i++) fac[i] = fac[i-1] * T(i);\n ifac[n] = fac[n].inv();\n for (int i = n-1; ~i; i--) ifac[i] = ifac[i+1] * T(i+1);\n }\n T& operator[](int i) { return i >= 0 ? fac[i] : ifac[-i]; }\n T C(int n, int m) { return fac[n] * ifac[m] * ifac[n-m]; }\n};\n\nconst int N = 2e5 + 5;\nvector<int> g[N];\nbitset<N> vis;\npoly cnt, tmp;\nint siz[N];\n\nint getsiz(int u, int f) {\n siz[u] = 1;\n for (const int &v : g[u]) {\n if (vis[v] || v == f) continue;\n siz[u] += getsiz(v, u);\n }\n return siz[u];\n}\nint Findcen(int u, const int &s) {\n for (const int &v : g[u]) {\n if (vis[v] || siz[v] > siz[u]) continue;\n else if (siz[v]*2 > s) return Findcen(v, s);\n }\n return u;\n}\nvoid dfs(int u, int f, int dep) {\n while (tmp.size() <= dep) tmp.v.emplace_back();\n tmp[dep] += mint(1);\n for (const int &v : g[u])\n if (!vis[v] && v != f)\n dfs(v, u, dep+1);\n \n}\nvoid divide(int u) {\n int s = getsiz(u, u);\n u = Findcen(u, s);\n vis[u] = 1;\n poly all;\n all[0] = 1;\n for (const int &v : g[u]) {\n if (vis[v]) continue;\n divide(v);\n tmp.clear();\n dfs(v, v, 1);\n all += tmp;\n cnt -= tmp * tmp;\n }\n cnt += all * all;\n vis[u] = 0;\n}\n\nFastIO IO;\n#define cin IO\n#define cout IO\n\nvoid solve() {\n int n;\n cin >> n;\n for (int i = 1; i < n; i++) {\n int u, v;\n cin >> u >> v;\n g[u].emplace_back(v);\n g[v].emplace_back(u);\n }\n divide(1);\n Factorial<mint> F(n);\n poly H(n + n);\n mint inv = mint(2).inv();\n for (int i = 0, len = cnt.size(); i < len; i++) cnt[i] *= F[i-1] * inv;\n for (int i = 0; i <= n; i++) H[i] = F[i-n];\n cnt *= H;\n for (int i = 2; i <= n; i++) cout << (cnt[n + i - 1] * F[2-i]).val << '\\n'; \n}\nint main() {\n //ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n solve();\n}", "accuracy": 1, "time_ms": 830, "memory_kb": 43412, "score_of_the_acc": -0.2554, "final_rank": 4 }, { "submission_id": "aoj_0452_5224843", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconst long long mod = 998244353, G = 3, Gi = (mod + 1) / 3;\n\nstruct modint {\n long long val;\n modint(long long v = 0) : val(v) {}\n modint& operator+=(const modint &x) { val += x.val; if (val >= mod) val -= mod; return *this; }\n modint& operator-=(const modint &x) { val -= x.val; if (val < 0) val += mod; return *this; }\n modint& operator*=(const modint &x) { val = val * x.val % mod; return *this; }\n friend modint operator+(const modint &x, const modint &y) { return modint(x) += y; }\n friend modint operator-(const modint &x, const modint &y) { return modint(x) -= y; }\n friend modint operator*(const modint &x, const modint &y) { return modint(x) *= y; }\n modint pow(long long n) { modint x = *this, r(1); while (n) { if (n&1) r *= x; x *= x; n>>=1; } return r; }\n modint inv() { return pow(mod-2); }\n};\n\nvoid NTT(vector<modint> &F, int sign) {\n int len = F.size(), L = __lg(len);\n vector<int> rev(len);\n for (int i = 1; i < len; i++) rev[i] = (rev[i>>1]>>1) | ((i&1)<<(L-1));\n for (int i = 0; i < len; i++) if (i < rev[i]) swap(F[i], F[rev[i]]);\n for (int mid = 1; mid < len; mid<<=1) {\n modint wn = modint(sign == 1 ? G : Gi).pow((mod-1) / (mid<<1));\n for (int i = 0; i < len; i += mid<<1) {\n modint w = 1;\n for (int j = 0; j < mid; j++, w *= wn) {\n modint x = F[i+j], y = F[i+j+mid] * w;\n F[i+j] = x + y, F[i+j+mid] = x - y;\n }\n }\n }\n if (sign == -1) {\n modint inv = modint(len).inv();\n for (int i = 0; i < len; i++) F[i] *= inv;\n }\n}\n\nstruct poly {\n vector<modint> v;\n poly(int n = 1) : v(n) {}\n int size() const { return (int)v.size(); }\n inline void clear() { v.clear(); }\n inline void cut(int len) { if (len < size()) v.resize(static_cast<size_t>(len)); } \n inline modint& operator[](int i) { return v[i]; }\n poly& operator+=(const poly &a) {\n this->v.resize(max(size(), a.size()));\n for (int i = a.size()-1; ~i; i--) this->v[i] += a.v[i];\n return *this;\n }\n poly& operator-=(const poly &a) {\n this->v.resize(max(size(), a.size()));\n for (int i = a.size()-1; ~i; i--) this->v[i] -= a.v[i];\n return *this;\n }\n poly& operator*=(poly a) {\n int N = size() + a.size() - 1;\n int len = 1;\n while (len < N) len <<= 1;\n this->v.resize(len), a.v.resize(len);\n NTT(this->v, 1), NTT(a.v, 1);\n for (int i = 0; i < len; i++) v[i] *= a[i];\n NTT(this->v, -1);\n this->cut(N);\n return *this;\n }\n poly operator+(const poly &a) { return poly(*this) += a; }\n poly operator-(const poly &a) { return poly(*this) -= a; }\n poly operator*(const poly &a) { return poly(*this) *= a; }\n};\n\nstruct Factorial {\n vector<modint> fact, ifact;\n Factorial(int n) : fact(n+1), ifact(n+1) {\n fact[0] = 1;\n for (int i = 1; i <= n; i++) fact[i] = fact[i-1] * modint(i);\n ifact[n] = fact[n].inv();\n for (int i = n-1; ~i; i--) ifact[i] = ifact[i+1] * modint(i+1);\n }\n modint operator[](int i) { return i >= 0 ? fact[i] : ifact[-i]; }\n};\n\nconst int N = 2e5 + 5;\nvector<int> g[N];\nbitset<N> vis;\npoly cnt, tmp;\nint siz[N];\n\nint getsiz(int u, int f) {\n siz[u] = 1;\n for (const int &v : g[u]) {\n if (vis[v] || v == f) continue;\n siz[u] += getsiz(v, u);\n }\n return siz[u];\n}\nint Findcen(int u, const int &s) {\n for (const int &v : g[u]) {\n if (vis[v] || siz[v] > siz[u]) continue;\n else if (siz[v]*2 > s) return Findcen(v, s);\n }\n return u;\n}\nvoid dfs(int u, int f, int dep) {\n while (tmp.size() <= dep) tmp.v.emplace_back();\n tmp[dep] += modint(1);\n for (const int &v : g[u])\n if (!vis[v] && v != f)\n dfs(v, u, dep+1);\n \n}\nvoid divide(int u) {\n int s = getsiz(u, u);\n u = Findcen(u, s);\n vis[u] = 1;\n poly all;\n all[0] = 1;\n for (const int &v : g[u]) {\n if (vis[v]) continue;\n divide(v);\n tmp.clear();\n dfs(v, v, 1);\n all += tmp;\n cnt -= tmp * tmp;\n }\n cnt += all * all;\n vis[u] = 0;\n}\nvoid solve() {\n int n;\n cin >> n;\n for (int i = 1; i < n; i++) {\n int u, v;\n cin >> u >> v;\n g[u].emplace_back(v);\n g[v].emplace_back(u);\n }\n divide(1);\n Factorial F(n);\n poly H(n + n);\n modint inv = modint(2).inv();\n for (int i = 0, len = cnt.size(); i < len; i++) cnt[i] *= F[i-1] * inv;\n for (int i = 0; i <= n; i++) H[i] = F[i-n];\n cnt *= H;\n for (int i = 2; i <= n; i++) cout << (cnt[n + i - 1] * F[2-i]).val << '\\n'; \n}\nint main() {\n ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);\n solve();\n}", "accuracy": 1, "time_ms": 1740, "memory_kb": 59604, "score_of_the_acc": -0.9905, "final_rank": 10 }, { "submission_id": "aoj_0452_5012759", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;\n\nclass CentroidDecomposition {\n int dfs(int x, int par){\n sz[x] = 1;\n for (auto &&i : G[x]) {\n if(i == par || v[i]) continue;\n sz[x] += dfs(i, x);\n }\n return sz[x];\n }\n\n int search_centroid(int x, int p, const int mid){\n for (auto &&i : G[x]) {\n if(i == p || v[i]) continue;\n if(sz[i] > mid) return search_centroid(i, x, mid);\n }\n return x;\n }\npublic:\n int n;\n vector<vector<int>> G, out;\n vector<int> sz, v;\n CentroidDecomposition(int n) : n(n), G(n), out(n), sz(n), v(n) {}\n void add_edge(int l, int r){\n G[l].emplace_back(r);\n G[r].emplace_back(l);\n }\n int get(int x){\n int centroid = search_centroid(x, -1, dfs(x, -1)/2);\n v[centroid] = true;\n for (auto &&i : G[centroid]) {\n if(!v[i]) out[centroid].emplace_back(get(i));\n }\n v[centroid] = false;\n return centroid;\n }\n};\n\nconstexpr int ntt_mod = 998244353, ntt_root = 3;\n// 1012924417 -> 5, 924844033 -> 5\n// 998244353 -> 3, 897581057 -> 3\n// 645922817 -> 3;\ntemplate <u32 M>\nstruct modint {\n u32 val;\npublic:\n static modint raw(int v) { modint x; x.val = v; return x; }\n modint() : val(0) {}\n template <class T>\n modint(T v) { ll x = (ll)(v%(ll)(M)); if (x < 0) x += M; val = u32(x); }\n modint(bool v) { val = ((unsigned int)(v) % M); }\n modint& operator++() { val++; if (val == M) val = 0; return *this; }\n modint& operator--() { if (val == 0) val = M; val--; return *this; }\n modint operator++(int) { modint result = *this; ++*this; return result; }\n modint operator--(int) { modint result = *this; --*this; return result; }\n modint& operator+=(const modint& rhs) { val += rhs.val; if (val >= M) val -= M; return *this; }\n modint& operator-=(const modint& rhs) { val -= rhs.val; if (val >= M) val += M; return *this; }\n modint& operator*=(const modint& rhs) { u64 z = val; z *= rhs.val; val = (u32)(z % M); return *this; }\n modint& operator/=(const modint& rhs) { return *this = *this * rhs.inv(); }\n modint operator+() const { return *this; }\n modint operator-() const { return modint() - *this; }\n modint pow(long long n) const { modint x = *this, r = 1; while (n) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }\n modint inv() const { return pow(M-2); }\n friend modint operator+(const modint& lhs, const modint& rhs) { return modint(lhs) += rhs; }\n friend modint operator-(const modint& lhs, const modint& rhs) { return modint(lhs) -= rhs; }\n friend modint operator*(const modint& lhs, const modint& rhs) { return modint(lhs) *= rhs; }\n friend modint operator/(const modint& lhs, const modint& rhs) { return modint(lhs) /= rhs; }\n friend bool operator==(const modint& lhs, const modint& rhs) { return lhs.val == rhs.val; }\n friend bool operator!=(const modint& lhs, const modint& rhs) { return lhs.val != rhs.val; }\n};\nusing mint = modint<998244353>;\n\nclass NTT {\n static constexpr int max_base = 20, maxN = 1 << max_base; // N <= 524288 * 2\n mint sum_e[30], sum_ie[30];\npublic:\n mint es[30], ies[30];\n NTT() {\n int cnt2 = __builtin_ctz(ntt_mod-1);\n mint e = mint(ntt_root).pow((ntt_mod-1) >> cnt2), ie = e.inv();\n for (int i = cnt2; i >= 0; i--){\n es[i] = e; ies[i] = ie;\n e *= e; ie *= ie;\n }\n mint now = 1, nowi = 1;\n for (int i = 0; i < cnt2 - 2; i++) {\n sum_e[i] = es[i+2] * now; now *= ies[i+2];\n sum_ie[i] = ies[i+2] * nowi; nowi *= es[i+2];\n }\n }\n\n void transform(vector<mint> &a, int sign){\n const int n = a.size();\n int h = 0;\n while ((1U << h) < (unsigned int)(n)) h++;\n if(!sign){ // fft\n for (int ph = 1; ph <= h; ph++) {\n int w = 1 << (ph-1), p = 1 << (h-ph);\n mint now = 1;\n for (int s = 0; s < w; s++) {\n int offset = s << (h-ph+1);\n for (int i = 0; i < p; i++) {\n auto l = a[i+offset], r = a[i+offset+p]*now;\n a[i+offset] = l+r, a[i+offset+p] = l-r;\n }\n now *= sum_e[__builtin_ctz(~(unsigned int)(s))];\n }\n }\n }else { // ifft\n for (int ph = h; ph >= 1; ph--) {\n int w = 1 << (ph-1), p = 1 << (h-ph);\n mint inow = 1;\n for (int s = 0; s < w; s++) {\n int offset = s << (h-ph+1);\n for (int i = 0; i < p; i++) {\n auto l = a[i+offset], r = a[i+offset+p];\n a[i+offset] = l+r, a[i+offset+p] = (l-r)*inow;\n }\n inow *= sum_ie[__builtin_ctz(~(unsigned int)(s))];\n }\n }\n }\n }\n};\n\nNTT ntt;\n\nstruct poly {\n vector<mint> v;\n poly() = default;\n explicit poly(int n) : v(n) {};\n explicit poly(vector<mint> vv) : v(std::move(vv)) {};\n int size() const {return (int)v.size(); }\n poly cut(int len){\n if(len < v.size()) v.resize(static_cast<unsigned long>(len));\n return *this;\n }\n inline mint& operator[] (int i) {return v[i]; }\n poly& operator+=(const poly &a) {\n this->v.resize(max(size(), a.size()));\n for (int i = 0; i < a.size(); ++i) this->v[i] += a.v[i];\n return *this;\n }\n poly& operator-=(const poly &a) {\n this->v.resize(max(size(), a.size()));\n for (int i = 0; i < a.size(); ++i) this->v[i] -= a.v[i];\n return *this;\n }\n poly& operator*=(poly a) {\n int N = size()+a.size()-1;\n int sz = 1;\n while(sz < N) sz <<= 1;\n this->v.resize(sz); a.v.resize(sz);\n ntt.transform(this->v, 0); ntt.transform(a.v, 0);\n for(int i = 0; i < sz; ++i) this->v[i] *= a.v[i];\n ntt.transform(this->v, 1);\n this->v.resize(N);\n mint iz = mint(sz).inv();\n for (int i = 0; i < N; i++) this->v[i] *= iz;\n return *this;\n }\n poly& operator/=(const poly &a){ return (*this *= a.inv()); }\n poly operator+(const poly &a) const { return poly(*this) += a; }\n poly operator-(const poly &a) const { return poly(*this) -= a; }\n poly operator*(const poly &a) const { return poly(*this) *= a; }\n\n poly inv() const {\n int n = size();\n poly r(1);\n r[0] = (this->v[0]).inv();\n for (int k = 1; k < n; k <<= 1) {\n poly ff(2*k);\n for (int i = 0; i < min(k*2, n); ++i) ff[i] = this->v[i];\n poly nr = (r*r*ff).cut(k*2);\n for (int i = 0; i < k; ++i) {\n nr[i] = (r[i]+r[i]-nr[i]);\n nr[i+k] = -nr[i+k];\n }\n r = nr;\n }\n r.v.resize(n);\n return r;\n }\n};\n\nclass Factorial {\n vector<mint> facts, factinv;\npublic:\n explicit Factorial(int n) : facts(n+1), factinv(n+1) {\n facts[0] = 1;\n for (int i = 1; i < n+1; ++i) facts[i] = facts[i-1] * mint(i);\n factinv[n] = facts[n].inv();\n for (int i = n-1; i >= 0; --i) factinv[i] = factinv[i+1] * mint(i+1);\n }\n mint fact(int k) const {\n if(k >= 0) return facts[k]; else return factinv[-k];\n }\n mint operator[](const int &k) const {\n if(k >= 0) return facts[k]; else return factinv[-k];\n }\n mint C(int p, int q) const {\n if(q < 0 || p < q) return 0;\n return facts[p] * factinv[q] * factinv[p-q];\n }\n mint P(int p, int q) const {\n if(q < 0 || p < q) return 0;\n return facts[p] * factinv[p-q];\n }\n mint H(int p, int q) const {\n if(p < 0 || q < 0) return 0;\n return q == 0 ? 1 : C(p+q-1, q);\n }\n};\n\n\nint main() {\n int n;\n cin >> n;\n CentroidDecomposition G(n);\n for (int i = 0; i < n-1; ++i) {\n int u, v;\n scanf(\"%d %d\", &u, &v);\n u--; v--;\n G.add_edge(u, v);\n }\n int root = G.get(0);\n vector<int> bad(n);\n poly val;\n auto dfs = [&](int centroid, auto &&f) -> void {\n bad[centroid] = 1;\n poly all(1);\n all[0] = 1;\n for (auto &&i : G.G[centroid]) {\n if(bad[i]) continue;\n poly a;\n queue<tuple<int, int, int>> Q;\n Q.emplace(i, centroid, 1);\n while(!Q.empty()){\n auto [x, par, dep] = Q.front(); Q.pop();\n while(a.size() <= dep) a.v.emplace_back();\n while(all.size() <= dep) all.v.emplace_back();\n a[dep]++; all[dep]++;\n for (auto &&y : G.G[x]) {\n if(y != par && !bad[y]) Q.emplace(y, x, dep+1);\n }\n }\n val -= a * a;\n }\n val += all * all;\n for (auto &&i : G.out[centroid]) f(i, f);\n };\n dfs(root, dfs);\n Factorial f(n);\n for (int i = 1; i < val.size(); ++i) {\n val[i-1] = val[i]*mint(499122177)*f[i-1];\n }\n val.v.pop_back();\n poly fact(n);\n for (int i = 0; i < n; ++i) {\n fact[i] = f[-(n-1-i)];\n }\n val *= fact;\n for (int i = 0; i < n-1; ++i) {\n if(n+i < val.size()+1) printf(\"%d\\n\", (val[n-1+i]*f[-i]).val);\n else printf(\"%d\\n\", 0);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 660, "memory_kb": 49972, "score_of_the_acc": -0.305, "final_rank": 6 }, { "submission_id": "aoj_0452_5004210", "code_snippet": "#include <cmath>\n#include <vector>\n#include <iostream>\n#include <algorithm>\n#include <set>\n#include <iomanip>\n#include <queue>\n#include <string>\n#include <map>\n#include <fstream>\n#include <cassert>\n#include <stack>\n#include <climits>\n#include <array>\n#include <unordered_set>\n#include <unordered_map>\n#include <memory>\n#include <functional>\n#include <cfloat>\n#include <numeric>\n#include <random>\n#include <sstream>\n#include <bitset>\nusing namespace std;\nconstexpr int MOD = 998244353;\n\nstatic std::array<int, 20> primitive_root{ 0, 998244352, 911660635, 372528824, 69212480, 617152567, 926351381, 553154607, 835711138, 476870429, 578036328, 579795361, 533803820, 843506711, 57929585, 670729537, 341689982, 178698007, 3411409, 1847 };\nstatic std::array<int, 20> reverse_root{ 0, 998244352, 86583718, 509520358, 661054123, 134322755, 77113778, 871797313, 179557483, 757331369, 195869564, 981311075, 229697978, 936970679, 760640816, 113194219, 815372449, 798661279, 53782855, 510742238 };\n\nint log2ceil(int size) {\n\tint log{ 0 };\n\twhile (size > 1) {\n\t\tsize = (size + 1) >> 1;\n\t\t++log;\n\t}\n\treturn log;\n}\nlong long int power(long long int base, int exp) {\n\tlong long int result{ 1 };\n\twhile (exp > 0) {\n\t\tif (exp & 1) {\n\t\t\tresult = result * base % MOD;\n\t\t}\n\t\tbase = (base * base) % MOD;\n\t\texp >>= 1;\n\t}\n\treturn result;\n}\nstd::vector<int> ft(std::vector<int> a, const bool inverse = false) {\n\tconst auto log = log2ceil(a.size());\n\tfor (auto i = a.size(); i < (1 << log); ++i) a.push_back(0);\n\tstd::vector<int> result(a.size(), 0);\n\tfor (auto i = 0; i < result.size(); ++i) {\n\t\tconst auto root = inverse ? power(reverse_root[log], i) : power(primitive_root[log], i);\n\t\tauto r = 1LL;\n\t\tfor (auto j = 0; j < a.size(); ++j){\n\t\t\tresult[i] = (result[i] + a[j] * r) % MOD;\n\t\t\tr = (r * root) % MOD;\n\t\t}\n\t\tresult[i] %= MOD;\n\t}\n\tif (inverse) {\n\t\tconst auto rev = power(a.size(), MOD - 2);\n\t\tfor (auto& n : result) n = (n * rev) % MOD;\n\t}\n\treturn result;\n}\nstd::vector<int> fft(std::vector<int> a, const bool inverse = false) {\n\tconst auto log = log2ceil(a.size());\n\ta.reserve(1 << log);\n\tfor (auto i = a.size(); i < (1 << log); ++i) {\n\t\ta.push_back(0);\n\t}\n\tfor (auto i = 0; i < a.size(); ++i) {\n\t\tint rev{ 0 };\n\t\tfor (auto j = 0; j < log; ++j) {\n\t\t\trev <<= 1;\n\t\t\trev += (i >> j) & 1;\n\t\t}\n\t\tif (i < rev) std::swap(a[i], a[rev]);\n\t}\n\tfor (auto d = 0; (1 << d) < a.size(); ++d) {\n\t\tconst auto width = 1 << d;\n\t\tauto root = 1LL;\n\t\tconst auto half = inverse ? reverse_root[1] : primitive_root[1];\n\t\tconst auto w = inverse ? reverse_root[d + 1] : primitive_root[d + 1];\n\t\tfor (auto i = 0; i < width; ++i) {\n\t\t\tfor (auto j = 0; j < a.size(); j += width << 1) {\n\t\t\t\tconst auto pos = a[i + j + width] * root % MOD;\n\t\t\t\ta[i + j + width] = (a[i + j] + pos * half % MOD) % MOD;\n\t\t\t\ta[i + j] = (a[i + j] + pos) % MOD;\n\t\t\t}\n\t\t\troot = root * w % MOD;\n\t\t}\n\t}\n\tif (inverse) {\n\t\tconst auto rev = power(a.size(), MOD - 2);\n\t\tfor (auto& x : a) x = (x * rev) % MOD;\n\t}\n\treturn a;\n}\nstd::vector<int> fold_fft(std::vector<int> a, std::vector<int> b) {\n\tconst auto result_size = a.size() + b.size() - 1;\n\tconst auto log = log2ceil(result_size);\n\tfor (auto i = a.size(); i < (1 << log); ++i) {\n\t\ta.push_back(0);\n\t}\n\tconst auto a_fft = fft(std::move(a));\n\tfor (auto i = b.size(); i < (1 << log); ++i) {\n\t\tb.push_back(0);\n\t}\n\tconst auto b_fft = fft(std::move(b));\n\tstd::vector<int> c(1 << log);\n\tfor (auto i = 0; i < c.size(); ++i) {\n\t\tc[i] = (long long int)a_fft[i] * b_fft[i] % MOD;\n\t}\n\tauto result = fft(std::move(c), true);\n\tresult.resize(result_size);\n\treturn result;\n}\n\nclass Tree {\n\tstd::vector<std::vector<int>> nodes;\n\tstd::vector<int> tree_size;\n\tstd::vector<bool> used;\n\tstd::vector<int> sum_route;\n\tstd::vector<int> sum_path;\n\tstd::vector<int> history;\n\tint call{ 0 };\n\tstd::vector<int> calc_route_count(const int root) {\n\t\tstd::queue<int> queue; queue.push(root);\n\t\tstd::vector<int> result;\n\t\thistory[root] = ++call;\n\t\twhile (!queue.empty()) {\n\t\t\tresult.push_back(queue.size());\n\t\t\tfor (auto i = 0; i < result.back(); ++i) {\n\t\t\t\tconst auto top = queue.front(); queue.pop();\n\t\t\t\tfor (const auto child : nodes[top]) {\n\t\t\t\t\tif (used[child]) continue;\n\t\t\t\t\tif (history[child] == call) continue;\n\t\t\t\t\thistory[child] = call;\n\t\t\t\t\tqueue.push(child);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t}\n\tvoid calc_subtree(const int node) {\n\t\tconst auto center = find_center(node);\n\t\tused[center] = true;\n\t\tstd::vector<std::vector<int>> children;\n\t\tsum_path.clear();\n\t\tfor (const auto child : nodes[center]) {\n\t\t\tif (used[child]) continue;\n\t\t\tconst auto count = calc_route_count(child);\n\t\t\tif (sum_path.empty()) {\n\t\t\t\tsum_path = count;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tconst auto fold = fold_fft(sum_path, count);\n\t\t\t\tfor (auto i = 0; i < fold.size(); ++i) {\n\t\t\t\t\tsum_route[i + 2] = (sum_route[i + 2] + fold[i]) % MOD;\n\t\t\t\t}\n\t\t\t\tif (count.size() > sum_path.size()) {\n\t\t\t\t\tfor (auto i = sum_path.size(); i < count.size(); ++i) sum_path.push_back(0);\n\t\t\t\t}\n\t\t\t\tfor (auto i = 0; i < count.size(); ++i) sum_path[i] = (sum_path[i] + count[i]) % MOD;\n\t\t\t}\n\t\t}\n\t\tfor (auto i = 0; i < sum_path.size(); ++i) {\n\t\t\tsum_route[i + 1] = (sum_route[i + 1] + sum_path[i]) % MOD;\n\t\t}\n\t\tfor (const auto child : nodes[center]) {\n\t\t\tif (used[child]) continue;\n\t\t\tcalc_subtree(child);\n\t\t}\n\t}\n\tint find_center(const int node) {\n\t\tstd::stack<std::pair<int, int>> stack, reverse;\n\t\ttree_size[node] = 1;\n\t\tfor (const auto child : nodes[node]) {\n\t\t\tif (used[child]) {\n\t\t\t\ttree_size[child] = 0;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tstack.emplace(node, child);\n\t\t}\n\t\twhile (!stack.empty()) {\n\t\t\tconst auto [parent, current] = stack.top(); stack.pop();\n\t\t\treverse.emplace(parent, current);\n\t\t\ttree_size[current] = 1;\n\t\t\tfor (const auto child : nodes[current]) {\n\t\t\t\tif (parent == child) continue;\n\t\t\t\tif (used[child]) {\n\t\t\t\t\ttree_size[child] = 0;\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tstack.emplace(current, child);\n\t\t\t}\n\t\t}\n\t\twhile (!reverse.empty()) {\n\t\t\tconst auto [parent, child] = reverse.top(); reverse.pop();\n\t\t\ttree_size[parent] += tree_size[child];\n\t\t}\n\t\tconst auto full_size = tree_size[node];\n\t\tint center = node;\n\t\twhile (std::any_of(nodes[center].begin(), nodes[center].end(), [&](const int i) {return (tree_size[i] << 1) > full_size; })) {\n\t\t\tconst auto max = *std::max_element(nodes[center].begin(), nodes[center].end(), [&](const int i, const int j) {return tree_size[i] < tree_size[j]; });\n\t\t\ttree_size[center] = full_size - tree_size[max];\n\t\t\ttree_size[max] = full_size;\n\t\t\tcenter = max;\n\t\t}\n\t\treturn center;\n\t}\npublic:\n\tTree(const std::vector<std::vector<int>>& nodes) : nodes{ nodes }, tree_size(nodes.size(), 0), used(nodes.size(), false), sum_route(nodes.size() + 1, 0), history(nodes.size(), -1) {\n\t\tcalc_subtree(0);\n\t}\n\tconst std::vector<int>& route_count() const {\n\t\treturn sum_route;\n\t}\n};\nint main() {\n\tint n; std::cin >> n;\n\tstd::vector<std::vector<int>> cotage(n);\n\tfor (auto i = 1; i < n; ++i) {\n\t\tint s, t; std::cin >> s >> t; --s; --t;\n\t\tcotage[s].push_back(t);\n\t\tcotage[t].push_back(s);\n\t}\n\tTree tree(cotage);\n\tstd::vector<int> factorial(n + 1, 1), div(n + 1, 1), inverse(n + 1, 1);\n\tfor (auto i = 2; i < factorial.size(); ++i) {\n\t\tfactorial[i] = ((long long int)i * factorial[i - 1]) % MOD;\n\t\tdiv[i] = (long long int)(MOD - MOD / i) * div[MOD % i] % MOD;\n\t\tinverse[i] = (long long int)div[i] * inverse[i - 1] % MOD;\n\t}\n\tconst auto route_count = tree.route_count();\n\tstd::vector<int> right(n + 1, 0);\n\tfor (auto i = 1; i < right.size(); ++i) {\n\t\tright[i] = (long long int)factorial[n - i] * route_count[n - i + 1] % MOD;\n\t}\n\tconst auto res = fold_fft(inverse, right);\n\tfor (auto i = 2; i <= n; ++i) {\n\t\tstd::cout << ((long long int)res[n - i + 2] * inverse[i - 2]) % MOD << '\\n';\n\t}\n}", "accuracy": 1, "time_ms": 720, "memory_kb": 40948, "score_of_the_acc": -0.1567, "final_rank": 1 }, { "submission_id": "aoj_0452_5001470", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Centroid{\n vector<int> sz,dead;\n vector< vector<int> > G;\n Centroid(int n):sz(n,1),dead(n,0),G(n){}\n\n void add_edge(int u,int v){\n G[u].emplace_back(v);\n G[v].emplace_back(u);\n }\n\n int dfs(int v,int p){\n sz[v]=1;\n for(int u:G[v])\n if(u!=p and !dead[u]) sz[v]+=dfs(u,v);\n return sz[v];\n }\n\n void find(int v,int p,int tmp,vector<int> &cs) {\n int ok=1;\n for (int u:G[v]){\n if(u==p or dead[u]) continue;\n find(u,v,tmp,cs);\n ok&=(sz[u]<=tmp/2);\n }\n ok&=(tmp-sz[v]<=tmp/2);\n if(ok) cs.emplace_back(v);\n }\n\n vector<int> build(int r) {\n int tmp=dfs(r,-1);\n vector<int> cs;\n find(r,-1,tmp,cs);\n return cs;\n }\n\n const vector<int>& operator[](int k)const{return G[k];}\n void disable(int v){dead[v]=1;}\n void enable(int v){dead[v]=0;}\n int alive(int v){return !dead[v];}\n};\n\ntemplate<typename F>\nstruct FixPoint : F{\n FixPoint(F&& f):F(forward<F>(f)){}\n template<typename... Args>\n decltype(auto) operator()(Args&&... args) const{\n return F::operator()(*this,forward<Args>(args)...);\n }\n};\n\ntemplate<typename F>\ninline decltype(auto) MFP(F&& f){\n return FixPoint<F>{forward<F>(f)};\n}\n\n\ntemplate<typename T, T MOD = 1000000007>\nstruct Mint{\n static constexpr T mod = MOD;\n T v;\n Mint():v(0){}\n Mint(signed v):v(v){}\n Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}\n\n Mint pow(long long k){\n Mint res(1),tmp(v);\n while(k){\n if(k&1) res*=tmp;\n tmp*=tmp;\n k>>=1;\n }\n return res;\n }\n\n static Mint add_identity(){return Mint(0);}\n static Mint mul_identity(){return Mint(1);}\n\n Mint inv(){return pow(MOD-2);}\n\n Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}\n Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}\n Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}\n Mint& operator/=(Mint a){return (*this)*=a.inv();}\n\n Mint operator+(Mint a) const{return Mint(v)+=a;}\n Mint operator-(Mint a) const{return Mint(v)-=a;}\n Mint operator*(Mint a) const{return Mint(v)*=a;}\n Mint operator/(Mint a) const{return Mint(v)/=a;}\n\n Mint operator-() const{return v?Mint(MOD-v):Mint(v);}\n\n bool operator==(const Mint a)const{return v==a.v;}\n bool operator!=(const Mint a)const{return v!=a.v;}\n bool operator <(const Mint a)const{return v <a.v;}\n\n static Mint comb(long long n,int k){\n Mint num(1),dom(1);\n for(int i=0;i<k;i++){\n num*=Mint(n-i);\n dom*=Mint(i+1);\n }\n return num/dom;\n }\n};\ntemplate<typename T, T MOD> constexpr T Mint<T, MOD>::mod;\ntemplate<typename T, T MOD>\nostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}\n\n\nconstexpr int bmds(int x){\n const int v[] = {1012924417, 924844033, 998244353,\n 897581057, 645922817};\n return v[x];\n}\nconstexpr int brts(int x){\n const int v[] = {5, 5, 3, 3, 3};\n return v[x];\n}\n\ntemplate<int X>\nstruct NTT{\n static constexpr int md = bmds(X);\n static constexpr int rt = brts(X);\n using M = Mint<int, md>;\n vector< vector<M> > rts,rrts;\n\n void ensure_base(int n){\n if((int)rts.size()>=n) return;\n rts.resize(n);rrts.resize(n);\n for(int i=1;i<n;i<<=1){\n if(!rts[i].empty()) continue;\n M w=M(rt).pow((md-1)/(i<<1));\n M rw=w.inv();\n rts[i].resize(i);rrts[i].resize(i);\n rts[i][0]=M(1);rrts[i][0]=M(1);\n for(int k=1;k<i;k++){\n rts[i][k]=rts[i][k-1]*w;\n rrts[i][k]=rrts[i][k-1]*rw;\n }\n }\n }\n\n void ntt(vector<M> &as,bool f){\n int n=as.size();\n assert((n&(n-1))==0);\n ensure_base(n);\n\n for(int i=0,j=1;j+1<n;j++){\n for(int k=n>>1;k>(i^=k);k>>=1);\n if(i>j) swap(as[i],as[j]);\n }\n\n for(int i=1;i<n;i<<=1){\n for(int j=0;j<n;j+=i*2){\n for(int k=0;k<i;k++){\n M z=as[i+j+k]*(f?rrts[i][k]:rts[i][k]);\n as[i+j+k]=as[j+k]-z;\n as[j+k]+=z;\n }\n }\n }\n\n if(f){\n M tmp=M(n).inv();\n for(int i=0;i<n;i++) as[i]*=tmp;\n }\n }\n\n vector<M> multiply(vector<M> as,vector<M> bs){\n int need=as.size()+bs.size()-1;\n int sz=1;\n while(sz<need) sz<<=1;\n as.resize(sz,M(0));\n bs.resize(sz,M(0));\n\n ntt(as,0);ntt(bs,0);\n for(int i=0;i<sz;i++) as[i]*=bs[i];\n ntt(as,1);\n\n as.resize(need);\n return as;\n }\n\n vector<int> multiply(vector<int> as,vector<int> bs){\n vector<M> am(as.size()),bm(bs.size());\n for(int i=0;i<(int)am.size();i++) am[i]=M(as[i]);\n for(int i=0;i<(int)bm.size();i++) bm[i]=M(bs[i]);\n vector<M> cm=multiply(am,bm);\n vector<int> cs(cm.size());\n for(int i=0;i<(int)cs.size();i++) cs[i]=cm[i].v;\n return cs;\n }\n};\ntemplate<int X> constexpr int NTT<X>::md;\ntemplate<int X> constexpr int NTT<X>::rt;\n\n\ntemplate<typename M_>\nclass Enumeration{\n using M = M_;\nprotected:\n static vector<M> fact,finv,invs;\npublic:\n static void init(int n){\n n=min<decltype(M::mod)>(n,M::mod-1);\n\n int m=fact.size();\n if(n<m) return;\n\n fact.resize(n+1,1);\n finv.resize(n+1,1);\n invs.resize(n+1,1);\n\n if(m==0) m=1;\n for(int i=m;i<=n;i++) fact[i]=fact[i-1]*M(i);\n finv[n]=M(1)/fact[n];\n for(int i=n;i>=m;i--) finv[i-1]=finv[i]*M(i);\n for(int i=m;i<=n;i++) invs[i]=finv[i]*fact[i-1];\n }\n\n static M Fact(int n){\n init(n);\n return fact[n];\n }\n static M Finv(int n){\n init(n);\n return finv[n];\n }\n static M Invs(int n){\n init(n);\n return invs[n];\n }\n\n static M C(int n,int k){\n if(n<k or k<0) return M(0);\n init(n);\n return fact[n]*finv[n-k]*finv[k];\n }\n\n static M P(int n,int k){\n if(n<k or k<0) return M(0);\n init(n);\n return fact[n]*finv[n-k];\n }\n\n // put n identical balls into k distinct boxes\n static M H(int n,int k){\n if(n<0 or k<0) return M(0);\n if(!n and !k) return M(1);\n init(n+k);\n return C(n+k-1,n);\n }\n};\ntemplate<typename M>\nvector<M> Enumeration<M>::fact=vector<M>();\ntemplate<typename M>\nvector<M> Enumeration<M>::finv=vector<M>();\ntemplate<typename M>\nvector<M> Enumeration<M>::invs=vector<M>();\n\n//INSERT ABOVE HERE\n\nsigned main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n\n NTT<2> ntt;\n using M = decltype(ntt)::M;\n using E = Enumeration<M>;\n E::init(1e6);\n\n int n;\n cin>>n;\n Centroid G(n);\n for(int i=1;i<n;i++){\n int a,b;\n cin>>a>>b;\n a--;b--;\n G.add_edge(a,b);\n }\n\n queue<int> que;\n que.emplace(G.build(0)[0]);\n\n vector<M> ans(n,0);\n while(!que.empty()){\n int r=que.front();que.pop();\n vector<M> cnt;\n cnt.emplace_back(1);\n for(int c:G[r]){\n if(!G.alive(c)) continue;\n vector<M> num;\n MFP([&](auto dfs,int v,int p,int d)->void{\n while((int)cnt.size()<=d)\n cnt.emplace_back(0);\n while((int)num.size()<=d)\n num.emplace_back(0);\n cnt[d]+=M(1);\n num[d]+=M(1);\n for(int u:G[v]){\n if(u==p or !G.alive(u)) continue;\n dfs(u,v,d+1);\n }\n })(c,r,1);\n auto ns=ntt.multiply(num,num);\n for(int i=0;i<(int)min(ans.size(),ns.size());i++) ans[i]-=ns[i];\n }\n auto cs=ntt.multiply(cnt,cnt);\n for(int i=0;i<(int)min(ans.size(),cs.size());i++) ans[i]+=cs[i];\n\n G.disable(r);\n for(int c:G[r])\n if(G.alive(c))\n que.emplace(G.build(c)[0]);\n }\n\n ans.resize(n+3);\n for(int i=0;i<n;i++) ans[i]/=M(2);\n // for(int i=0;i<n;i++) cout<<ans[i]<<endl;\n\n using Poly = vector<M>;\n Poly fs(n+1);\n for(int i=0;i<=n;i++) fs[i]=ans[n+1-i]*E::Fact(n-i);\n\n Poly gs(n+1);\n for(int i=0;i<=n;i++) gs[i]=E::Finv(i);\n\n // for(int i=0;i<=n;i++) cout<<fs[i]<<' '<<gs[i]<<endl;\n\n Poly hs=ntt.multiply(fs,gs);\n for(int i=0;i<=n;i++) hs[i]*=E::Finv(n-i);\n\n for(int i=0;i+1<n;i++)\n cout<<hs[n-i]<<'\\n';\n return 0;\n}", "accuracy": 1, "time_ms": 820, "memory_kb": 87076, "score_of_the_acc": -1.1022, "final_rank": 11 } ]
aoj_0468_cpp
Sort Riddles A sort riddle is a game in which you guess the original English word from a string of letters in an English word, rearranged in alphabetical order. For example, if you are given the string aet , you can guess that the original English word was eat , ate , and so on. To play this game, PCK, who is not good at English words, decided to think of the given string and all the strings that are rearranged. Given a rearranged string, write a program to output the number of strings that PCK will consider. Input The input is given in the following format. $str$ A string $str$ rearranged into a single line is given. $str$ contains only lowercase letters, and its length is between 1 and 8. Also, each character is arranged in alphabetical order from the beginning. Output Output the number of strings that PCK will think about. Sample Input and Output Sample Input 1 aet Sample Output 1 6 Sample Input 2 eeei Sample Output 2 4
[ { "submission_id": "aoj_0468_10709130", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n\tint cnt=0;\n\tstring str;\n\tmap<string,int> mp;\n\tcin>>str;\n\tdo{\n\t\tif(mp[str]==0){\n\t\t\tcnt++;\n\t\t\tmp[str]=1;\n\t\t}\n\t}while(next_permutation(str.begin(),str.end()));\n\tcout<<cnt<<endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 6504, "score_of_the_acc": -0.1656, "final_rank": 3 }, { "submission_id": "aoj_0468_10520422", "code_snippet": "//kouu42ga8\n#include <bits/stdc++.h>\nusing namespace std;\nint main(void){\n\tint i,cnt=0;\n\tstring s;\n\tmap<string,int> mp;\n\tcin>>s;\n\tdo{\n\t\tif(mp[s]==0){\n\t\t\tcnt++;\n\t\t\tmp[s]=1;\n\t\t}\n\t}while(next_permutation(s.begin(),s.end()));\n\tcout<<cnt<<endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 6596, "score_of_the_acc": -0.2375, "final_rank": 4 }, { "submission_id": "aoj_0468_8138542", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\n#define INF INT64_MAX;\nmap<string,bool> mp;\nint main(void)\n{\n LL cnt=0;\n string s;\n cin>>s;\n do{\n if(!mp[s]) cnt++,mp[s]=true;\n }while(next_permutation(s.begin(),s.end()));\n cout<<cnt<<endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 7548, "score_of_the_acc": -0.9812, "final_rank": 7 }, { "submission_id": "aoj_0468_7076639", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define all(v) v.begin(), v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define ll long long\n#define ptn(v) next_permutation(v.begin(), v.end())\n#define fixed(v) fixed << setprecision(v)\n#define total(n) ((n) * ((n) + 1) / 2)\n#define combi(n) ((n) * ((n)-1) / 2) // n個の数の組み合わせ数\n#define lcm(a, b) ((a) * (b) / __gcd(a, b))\n// binery_search(all(v),key) = keyがあるかないかをboolで返す\n// lower_bound(all(v),key) = key以上のイテレーターを返す(一番左)\n// upper_bound(all(v),key) = keyより大きい要素のイテレーターを返す\n// 最小値＝max_element(v.begin(),v.end());\n// 最大値＝min_element(v.begin(),v.end());\n\ntemplate <class x>\nx rng_total(x l, x r)\n{ // l ~ rまでの数の総和\n return ((l + r) * (r - l + 1) / 2);\n}\n\ntemplate <class x>\nx rng_combi(x l, x r)\n{ //「n個の物からr個取った組み合わせ数」\n x ans = 1;\n l++;\n for (x i = 1; i <= r; i++)\n {\n x sub = l - i;\n ans *= sub;\n ans /= i;\n }\n return (ans);\n}\n\ntemplate <class x>\nx dig_sum(x num)\n{ // 各桁の総和\n x ans = 0;\n while (num > 0)\n {\n ans += num % 10;\n num /= 10;\n }\n return (ans);\n}\n\nint main()\n{\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n //-----------------------------------------------------\n\n string s;\n cin >> s;\n set<string> st;\n sort(all(s));\n do {\n if (!st.count(s)) {\n st.insert(s);\n }\n } while (ptn(s));\n cout << st.size() << endl;\n\n return (0);\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 6596, "score_of_the_acc": -0.2375, "final_rank": 4 }, { "submission_id": "aoj_0468_7073356", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nvoid permutations(const string& s, string& v, vector<bool>& b, set<string>& p) {\n if (v.length() == s.length()) {\n p.insert(v);\n }\n else {\n for (int i = 0; i < (int)s.length(); ++i) {\n if (!b[i]) {\n v += s[i];\n b[i] = true;\n permutations(s, v, b, p);\n b[i] = false;\n v.pop_back();\n }\n }\n }\n}\nint main() {\n string s;\n cin >> s;\n vector<bool> b(s.length(), false);\n set<string> p;\n string v = \"\";\n permutations(s, v, b, p);\n cout << p.size() << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 6292, "score_of_the_acc": 0, "final_rank": 1 }, { "submission_id": "aoj_0468_7069106", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int count=0;\n string str;cin>>str;\n map<string,bool>mp;\n sort(str.begin(),str.end());\n do\n {\n if(mp[str]==false){\n count++;\n mp[str]=true;\n }\n } while (next_permutation(str.begin(),str.end()));\n cout<<count<<endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 6480, "score_of_the_acc": -0.1469, "final_rank": 2 }, { "submission_id": "aoj_0468_7059885", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for(int i = 0; i < n; ++i)\n#define INF 2047483647 //大きすぎる可能性有り\n#define ll long long\n\nint main(){\n string str; cin>>str;\n int kaisu=0;\n sort(str.begin(),str.end());\n map<string,bool> mp;\n int count=0;\n do{ \n if(mp[str]==false){ count++; mp[str]=true;}\n }while(next_permutation(str.begin(),str.end()));\n cout<<count<<endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 7572, "score_of_the_acc": -1, "final_rank": 8 }, { "submission_id": "aoj_0468_6872030", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nclass extension {\n//イテレーター省略\n#define all(v) v.begin(),v.end()\n//配列の読み取り\n#define loadVector(n,v) for (int i = 0;i < n;i++) cin >> v[i]\n//pair型配列の読み取り\n#define loadVectors(n,v) for (int i = 0;i < n;i++) cin >> v[i].first >> v[i].second\n//逆ソート\n#define r_sort(v) sort(v.rbegin(),v.rend())\n//long long省略\n#define ll long long\n//指定したkeyがmapに存在するかどうか\n#define mapFind(m,x) m.find(x) != end(m)\n//long doubleの省略\n#define ld long double\n//unsigned long longの省略\n#define ull unsigned long long\n//priority_queueの省略\n#define pq priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>\n\n//nをbase_number進数に変換する\npublic:string To_oct(int n, int base_number) {\n string s;\n while (n) {\n s = to_string(n % base_number) + s;\n n /= base_number;\n }\n return s;\n}\n\n//エラトステネスの篩\nvector<int> Eratosthenes(int N) {\n vector<bool> is_prime(N + 1);\n for (int i = 0; i <= N; i++) is_prime[i] = true;\n vector<int> P;\n for (int i = 2; i <= N; i++)\n {\n if (is_prime[i])\n {\n for (int j = 2 * i; j <= N; j += i)\n {\n is_prime[j] = false;\n }\n P.emplace_back(i);\n }\n }\n return P;\n}\n\n//文字列を分割する\nvector<string> Split(const string& str, char sep) {\n vector<string> v;\n stringstream ss(str);\n string buffer;\n while(getline(ss, buffer, sep)) {\n v.push_back(buffer);\n }\n return v;\n}\n\n//約数全列挙\nvector<ll> Divisor(ll n) {\n vector<ll> result;\n set<ll> s;\n for (ll i = 1; i <= sqrt(n); i++) {\n if (n % i == 0) {\n s.insert(i);\n s.insert(n / i);\n }\n }\n\n for (int x : s) {\n result.push_back(x);\n }\n return result;\n}\n\n//連立方程式を解く\npair<int,int> SimultaneousEquations(int a,int b,int c,int d,int e,int f) {\n double matrix;\n\tmatrix = a * e - b*d;\n\n\tdouble x, y;\n\tif (matrix == 0) {\n\t\tcout << \"連立方程式の解はありません\\n\";\n\t\treturn make_pair(-1,-1);\n\t}\n\telse {\n\t\tx = (c * e - b * f) / matrix;\n\t\ty = (a * f - c * d) / matrix;\n\t\t\n\t\tif (floor(x) != x || floor(y) != y) return make_pair(-1,-1);\n\t\treturn make_pair(x,y);\n\t}\n}\n\n//コンビネーション(nCr)\nunsigned long long Combination(int n, int r)\n{\n if (n < 0 || r < 0 || r > n) cout << \"無効な値です\" << endl;\n\n if (n - r < r) r = n - r;\n if (r == 0) return 1;\n if (r == 1) return n;\n\n vector<int> numerator(r);\n vector<int> denominator(r);\n\n for (int k = 0; k < r; k++)\n {\n numerator[k] = n - r + k + 1;\n denominator[k] = k + 1;\n }\n\n for (int p = 2; p <= r; p++)\n {\n int pivot = denominator[p - 1];\n if (pivot > 1)\n {\n int offset = (n - r) % p;\n for (int k = p - 1; k < r; k += p)\n {\n numerator[k - offset] /= pivot;\n denominator[k] /= pivot;\n }\n }\n }\n\n unsigned long long result = 1;\n for (int k = 0; k < r; k++)\n {\n if (numerator[k] > 1) result *= numerator[k];\n }\n\n return result;\n}\n\n//二分探索\nint Binary_Search(vector<int> _x,int key) {\n int left = -1,right = _x.size();\n \n while (right - left > 1) {\n int mid = (left+right) / 2;\n \n if (_x[mid] >= key) right = mid;\n else left = mid;\n }\n \n return right;\n}\n\n//ワ―シャルフロイド法\nvoid Floyd_warshall(vector<vector<int>>& g,int vertexCnt) {\n for (int i = 0;i < vertexCnt;i++) {\n for (int j = 0;j < vertexCnt;j++) {\n for (int k = 0;k < vertexCnt;k++) {\n if (g[j][i] == 1e9 || g[i][k] == 1e9) continue;\n g[j][k] = min(g[j][k],g[j][i]+g[i][k]);\n }\n }\n }\n}\n\n// 第一引数と第二引数を比較し、第一引数(a)をより大きい/小さい値に上書き\ntemplate <typename T> inline bool chmin(T& a, const T& b) {bool compare = a > b; if (a > b) a = b; return compare;}\ntemplate <typename T> inline bool chmax(T& a, const T& b) {bool compare = a < b; if (a < b) a = b; return compare;}\n\n//配列の出力\ntemplate <typename T> inline void print(const vector<T>& v, string s = \" \")\n {for (int i = 0;i < v.size();i++) cout << v[i] << (i != (ll)v.size() - 1 ? s : \"\\n\");}\n//pairの出力\ntemplate <typename T, typename S> inline void print(const pair<T, S>& p)\n {cout << p.first << \" \" << p.second << endl;}\n//普通の出力\ntemplate <typename T> inline void print(const T& x) {cout << x << \"\\n\";}\n//pair型配列の出力\ntemplate <typename T, typename S> inline void print(const vector<pair<T, S>>& v)\n {for (auto&& p : v) print(p);}\n};\n\nclass Mathf {\n public:\n template <typename T> inline T clamp(const T& a,const T& b,const T& c) {\n if (a < b) return b;\n if (a > c) return c;\n return a;\n }\n template <typename T> inline T clamp01(const T& a) {\n if (a < 0) return 0;\n if (a > 1) return 1;\n return a;\n }\n template <typename T> inline void lerp(T& a) {\n T _min = log2(a);\n cout << _min << endl;\n }\n //度からラジアン角\n const long double deg2rad = 0.0174532925199432954743716805979;\n //ラジアン角から度\n const long double rad2deg = 57.2957795130823228646477218717;\n //円周率\n const long double pi = M_PI;\n};\n\nset<string> anses;\nvoid dfs(string a,map<char,int> b) {\n bool check = true;\n \n for (auto x : b) {\n if (x.second != 0) check = false;\n }\n \n if (check) {\n anses.insert(a);\n return;\n }\n \n map<char,int> c;\n for (auto x : b) {\n c[x.first] = x.second;\n }\n \n for (auto x : c) {\n if (x.second == 0) continue;\n \n c[x.first]--;\n dfs(a + x.first,c);\n \n c[x.first]++;\n }\n}\n\nint main(void) {\n // Your code here!\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n \n //拡張クラスのインスタンス化\n extension ex = extension();\n Mathf mathf = Mathf();\n \n ////////ここから処理内容記述/////////////\n string s;\n cin >> s;\n \n map<char,int> m;\n for (int i = 0;i < s.length();i++) m[s[i]]++;\n \n dfs(\"\",m);\n \n ex.print(anses.size());\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 6512, "score_of_the_acc": -1.1719, "final_rank": 9 }, { "submission_id": "aoj_0468_6241632", "code_snippet": "//#ifdef DEBUG\n#define _GLIBCXX_DEBUG\n//#endif\n#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<string>\n#include<cmath>\n#include<queue>\n#include<stack>\n#include<map>\n#include<numeric>\n#include<climits>\n#include<limits>//\n#include <stdio.h>//\n#include<cmath>\n#include<iomanip>\n#include <cmath>\n#include <set>\n#include <unordered_set>\n#include <unordered_map>\n//#include <windows.h>\n//#include <stdlib.h>\n//#include <atcoder/all>\n\nusing namespace std;\n//using namespace atcoder;\n\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\ntypedef long long ll;\n\ntemplate <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }\ntemplate <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }\n\nint dy[] = {1, 0, -1, 0};\nint dx[] = {0, 1, 0, -1};\ndouble pie = 3.14159265358979323846264338;\n\\\nll updiv(ll a, ll b){\n return ((a + b - 1) / b);\n}\n\n//using mint = modint998244353;\n//using mint = modint1000000007;\n\nbool Pn (int a){\n if (a == 1){\n return (false);\n }\n\n if (a == 2){\n return (true);\n }\n\n if (a % 2 == 0){\n return (false);\n }\n \n \n int n = sqrt(a);\n\n for (int i = 3; i <= n; i+=2){\n if (a % i == 0){\n return (false);\n } \n }\n return (true);\n}\n\nbool PrimeNumber (int a){\n if (a == 1){\n return (false);\n }\n if (a == 2){\n return (true);\n } \n if (a % 2 == 0){\n return (false);\n }\n\n int m = sqrt(a);\n\n for (int i = 0; i <= m; i++){\n if (a % i == 0){\n return (false);\n } \n }\n return (true);\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n string s;\n cin >> s;\n int n = s.size(),cnt = 0;\n vector<int> a(n);\n map<string,int> mp;\n\n for (int i = 0; i < n; i++){\n a[i] = i;\n }\n \n\n do{\n string t;\n for (int i = 0; i < n; i++){\n t.push_back(s[a[i]]);\n }\n \n if (mp[t] == 0){\n mp[t] = 1;\n cnt++;\n }\n \n \n } while (next_permutation(a.begin(),a.end()));\n \n cout << cnt << '\\n';\n\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 6616, "score_of_the_acc": -0.9198, "final_rank": 6 } ]
aoj_0463_cpp
Fishermen Following the Rules Kenjiro is a fisherman who collects fish from the lake. The entire lake is rectangular in shape. The lake is lined with a grid of square-shaped administrative blocks. On the map, the coordinates of the upper-left control area of the lake are (1,1), and the coordinates of the i-th control area from the top and j-th control area from the left are (i,j). From our previous experience, we know that there is one fish in every management compartment and the price of each fish. Fishing is done by setting up a rectangular net and enclosing some of the management plots with the net. Any fish in the netted management plots can be obtained. However, it was decided to introduce rules to protect the growth of fish and fishermen will have to abide by these rules when fishing. We don't know the details of the rule yet, but we do know that the rule will be based on the price of the fish that is the $K$th from the cheapest when the fish obtained in a single net placement are listed in order of price. Kenjirou decided to find out the price of the $K$th fish from the cheapest one for all the places where nets could be set so that he could comply with the rule and start fishing as soon as possible. Given the price of the fish in each section of the lake, the size of the net surrounding the control section, and the location $K$ where the price of the fish is to be checked, create a program that displays the price of the fish located $K$th from the cheapest for all locations where the net can be placed. However, the net will not rotate or deform. Input Input is given in the following format. $H$ $W$ $R$ $C$ $K$ $a_{1,1}$ $a_{1,2}$ ... $a_{1,W}$ $a_{2,1}$ $a_{2,2}$ ... $a_{2,W}$ ： $a_{H,1}$ $a_{H,2}$ ... $a_{H,W}$ In the first line, we are given the number of vertical plots in the lake, $H$ ($1\leq H \leq 400$), the number of horizontal plots, $W$ ($1\leq W \leq 400$), the number of vertical plots in the net surrounding the management plot, $R$ ($1\leq R \leq H$), and the number of horizontal plots, $C$ ($1\leq C \leq W $) are given. In the following line, the position $K$ ($1 \leq K \leq R \times C$) for examining the price is given. In the subsequent $H$ line, the price $a_{i,j}$ ($0 \leq a_{i,j} \leq 1,000,000,000$) of the fish in the plot at coordinates (i,j) is given. Output The output is $(H-R+1)\times(W-C+1)$ lines, one per line, in ascending order, with the fish prices obtained for each location where the net can be set. Sample Input and Output Sample Input 3 3 2 2 3 5 7 9 8 9 2 3 2 1 Sample Output 2 8 8 9 The third from the cheapest of prices 5, 7, 8, and 9 for the fish in the section where the upper left is (1,1) and the lower right is (2,2) is 8. The third price from the lowest of 7,9,9,2 is 9 for the fish in the section where the top left is (1,2) and the bottom right is (2,3). The third price from the lowest of 8,9,3,2 is 8 for the fish in the section where the top left is (2,1) and the bottom right is (3,2). The third price ...(truncated)
[ { "submission_id": "aoj_0463_11009998", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)\n\ntemplate<typename T>\nstruct FenwickTree {\n\tvector<T> data;\n\tFenwickTree(int size) : data(size + 1, 0) {}\n\t\n\tvoid add(int k, T x) {\n\t\tfor (++k; k < data.size(); k += k & -k) data[k] += x;\n\t}\n\t\n\tT sum(int k) {\n\t\tif (k < 0) return 0;\n\t\tT res = 0;\n\t\tfor (++k; k > 0; k -= k & -k) res += data[k];\n\t\treturn res;\n\t}\n\t\n\tT sum(int l, int r) {\n\t\treturn sum(r) - sum(l - 1);\n\t}\n};\n\nint main() {\n\tcin.tie(nullptr);\n\tios_base::sync_with_stdio(false);\n\t\n\tint H, W, R, C, K;\n\tcin >> H >> W >> R >> C >> K;\n\tvector A(H, vector<int>(W));\n\trep(i, 0, H) rep(j, 0, W) cin >> A[i][j];\n\t\n\tvector<int> B(H*W);\n\trep(i, 0, H) rep(j, 0, W) B[i*W + j] = A[i][j];\n\tsort(B.begin(), B.end());\n\tB.erase(unique(B.begin(), B.end()), B.end());\n\trep(i, 0, H) rep(j, 0, W) A[i][j] = lower_bound(B.begin(), B.end(), A[i][j]) - B.begin();\n\t\n\tFenwickTree<int> fw(H*W);\n\trep(i, 0, R) rep(j, 0, C) fw.add(A[i][j], 1);\n\t\n\tvector<int> ans;\n\t\n\tint pi = 0, pj = 0;\n\trep(itr, 0, (H - R + 1)*(W - C + 1)) {\n\t\tint ok = H*W - 1, ng = -1;\n\t\twhile (ok - ng > 1) {\n\t\t\tint mid = (ok + ng) / 2;\n\t\t\tif (fw.sum(0, mid) >= K) ok = mid;\n\t\t\telse ng = mid;\n\t\t}\n\t\tans.push_back(B[ok]);\n\t\t\n\t\tif (itr == (H - R + 1)*(W - C + 1) - 1) break;\n\t\t\n\t\tif (pi % 2 == 0) {\n\t\t\tif (pj == W - C) {\n\t\t\t\trep(j, 0, C) fw.add(A[pi][pj + j], -1);\n\t\t\t\trep(j ,0, C) fw.add(A[pi + R][pj + j], 1);\n\t\t\t\t++pi;\n\t\t\t} else {\n\t\t\t\trep(i, 0, R) fw.add(A[pi + i][pj], -1);\n\t\t\t\trep(i, 0, R) fw.add(A[pi + i][pj + C], 1);\n\t\t\t\t++pj;\n\t\t\t}\n\t\t} else {\n\t\t\tif (pj == 0) {\n\t\t\t\trep(j, 0, C) fw.add(A[pi][pj + j], -1);\n\t\t\t\trep(j ,0, C) fw.add(A[pi + R][pj + j], 1);\n\t\t\t\t++pi;\n\t\t\t} else {\n\t\t\t\t--pj;\n\t\t\t\trep(i, 0, R) fw.add(A[pi + i][pj], 1);\n\t\t\t\trep(i, 0, R) fw.add(A[pi + i][pj + C], -1);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tsort(ans.begin(), ans.end());\n\tfor (int t : ans) cout << t << '\\n';\n}", "accuracy": 1, "time_ms": 370, "memory_kb": 6044, "score_of_the_acc": -0.1795, "final_rank": 3 }, { "submission_id": "aoj_0463_10874497", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <typename T>\nstruct binary_trie{\n static_assert(is_unsigned_v<T>);\n \n struct node_t{\n T value;\n int width;\n int count;\n array<node_t*, 4> child;\n node_t() = default;\n node_t(T v, int w, int c) : value(v), width(w), count(c), child{&nil, &nil, &nil, &nil} {}\n node_t(T v, int w, int c, node_t* c0, node_t* c1, node_t* c2, node_t* c3) : value(v), width(w), count(c), child{c0, c1, c2, c3} {}\n static node_t nil;\n };\n \n struct ref_node_t{\n T val;\n bool exist;\n ref_node_t(T x, bool e) : val{x}, exist{e} {}\n };\n \n struct Pool {\n constexpr static int SIZ = 1<<12;\n node_t* ptr = nullptr, *en = nullptr;\n node_t* get() {\n if(ptr == en) {\n ptr = new node_t[SIZ];\n en = ptr + SIZ;\n }\n return ptr++;\n }\n };\n \n static constexpr T one = 1;\n static constexpr int bit_width = sizeof(T) * 8;\n static Pool pool;\n static constexpr T xor_val = 0;\n node_t* root;\n int siz = 0;\n \n template<typename _Tp>\n inline int clz(_Tp x) const {\n if constexpr(sizeof(_Tp) == 8ull) return __builtin_clzll(x);\n else return __builtin_clz(x);\n }\n \n inline T mask(int l, int r) const {\n if(r >= bit_width){\n if(l >= bit_width) return 0;\n else return -(one<<l);\n }\n return (one<<r) - (one<<l);\n }\n \n inline T masked(T v, int l, int r) const {\n return mask(l, r) & v;\n }\n \n inline int diff_bit(T x, T y) const {\n return ((bit_width-1 - clz(x^y))|1) + 1;\n }\n \n template<typename... Args>\n inline node_t* make_node(Args ...args) {\n return &((*pool.get()) = node_t(args...));\n }\n \n public:\n \n binary_trie(){\n root = make_node(0, bit_width, 0);\n }\n \n binary_trie<T>& operator=(binary_trie<T>&& o) noexcept = default;\n \n binary_trie(binary_trie&& o) noexcept = default;\n \n void insert(T v) {\n node_t* pos = root;\n int bit = bit_width;\n siz++;\n v ^= xor_val;\n while(true){\n T mv = masked(v, bit-pos->width, bit);\n T mnv = masked(pos->value, bit-pos->width, bit);\n if(mv != mnv){\n int diff = diff_bit(mv, mnv);\n int b = (mv>>(diff-2))&3;\n int nb = (mnv>>(diff-2))&3;\n node_t* inter = make_node(pos->value, pos->width-bit+diff, pos->count, pos->child[0], pos->child[1], pos->child[2], pos->child[3]);\n node_t* leaf = make_node(v, diff, 1);\n pos->width = bit-diff;\n pos->count++;\n pos->child = {&node_t::nil, &node_t::nil, &node_t::nil, &node_t::nil};\n pos->child[b] = leaf;\n pos->child[nb] = inter;\n return;\n } else {\n pos->count++;\n bit -= pos->width;\n if(bit == 0) return;\n int b = (v>>(bit-2))&3;\n if(pos->child[b] == &node_t::nil){\n pos->child[b] = make_node(v, bit, 1);\n return;\n }\n pos = pos->child[b];\n }\n }\n }\n \n int count(T v) const {\n node_t* pos = root;\n int bit = bit_width;\n v ^= xor_val;\n while(pos != &node_t::nil){\n T mv = masked(v, bit-pos->width, bit);\n T mnv = masked(pos->value, bit-pos->width, bit);\n if(mv != mnv) return 0;\n bit -= pos->width;\n if(bit == 0) return pos->count;\n pos = pos->child[(v>>(bit-2))&3];\n }\n return 0;\n }\n \n void erase(T v) {\n node_t* pos = root;\n int bit = bit_width;\n siz--;\n v ^= xor_val;\n while(true){\n pos->count--;\n bit -= pos->width;\n if(bit == 0) return;\n pos = pos->child[(v>>(bit-2))&3];\n }\n }\n \n void erase_all(T v) {\n int n = count(v);\n if(n == 0) return;\n node_t* pos = root;\n int bit = bit_width;\n siz -= n;\n v ^= xor_val;\n while(true){\n pos->count -= n;\n bit -= pos->width;\n if(bit == 0) return;\n pos = pos->child[(v>>(bit-2))&3];\n }\n }\n \n const T operator[](int k) const {\n if(k < 0) k += siz;\n \n k++;\n node_t* pos = root;\n int bit = bit_width;\n while(true){\n bit -= pos->width;\n if(bit == 0) return pos->value^xor_val;\n int b = (xor_val>>(bit-2))&3;\n auto &child = pos->child;\n if(k <= child[b]->count){\n pos = child[b];\n } else {\n k -= child[b]->count;\n if(k <= child[b^1]->count){\n pos = child[b^1];\n } else {\n k -= child[b^1]->count;\n if(k <= child[b^2]->count){\n pos = child[b^2];\n } else {\n k -= child[b^2]->count;\n pos = child[b^3];\n }\n }\n }\n }\n }\n \n T min() const {\n node_t* pos = root;\n int bit = bit_width;\n while(true){\n bit -= pos->width;\n if(bit == 0) return pos->value^xor_val;\n int b = (xor_val>>(bit-2))&3;\n auto &child = pos->child;\n if(child[b]->count) pos = child[b];\n else if(child[b^1]->count) pos = child[b^1];\n else if(child[b^2]->count) pos = child[b^2];\n else pos = child[b^3];\n }\n }\n \n T max() const {\n node_t* pos = root;\n int bit = bit_width;\n while(true){\n bit -= pos->width;\n if(bit == 0) return pos->value^xor_val;\n int b = (xor_val>>(bit-2))&3;\n auto &child = pos->child;\n if(child[b^3]->count) pos = child[b^3];\n else if(child[b^2]->count) pos = child[b^2];\n else if(child[b^1]->count) pos = child[b^1];\n else pos = child[b];\n }\n }\n \n int order(T v) const {\n if(v == 0) return 0;\n v--;\n int res = 0;\n node_t* pos = root;\n int bit = bit_width;\n while(pos != &node_t::nil){\n T mv = masked(v, bit-pos->width, bit);\n T mnv = masked(pos->value^xor_val, bit-pos->width, bit);\n if(mv < mnv){\n return res;\n } else {\n if(mv > mnv){\n res += pos->count;\n return res;\n } else {\n bit -= pos->width;\n if(bit == 0) return res + pos->count;\n int b = (v>>(bit-2))&3;\n auto &child = pos->child;\n T mxv = (xor_val>>(bit-2))&3;\n \n if(b >= 1){\n res += child[mxv]->count;\n if(b >= 2){\n res += child[mxv^1]->count;\n if(b >= 3){\n res += child[mxv^2]->count;\n }\n }\n }\n pos = child[b^mxv];\n }\n }\n }\n return res;\n }\n \n const ref_node_t lower_bound(T v) const {\n int ord = order(v);\n if(siz == ord) return ref_node_t{0, false};\n else return ref_node_t{(*this)[ord], true};\n }\n \n const ref_node_t less_bound(T v) const {\n int ord = v!=numeric_limits<T>::max() ? order(v+1) : siz;\n if(ord == 0) return ref_node_t{0, false};\n else return ref_node_t{(*this)[ord-1], true};\n }\n \n int size() const {\n return siz;\n }\n};\ntemplate<typename T> typename binary_trie<T>::node_t binary_trie<T>::node_t::nil = node_t(0, bit_width, 0, &node_t::nil, &node_t::nil, &node_t::nil, &node_t::nil);\ntemplate<typename T> typename binary_trie<T>::Pool binary_trie<T>::pool = Pool();\n\nint main(){\n cin.tie(0)->sync_with_stdio(0);\n \n int h, w, r, c;\n cin >> h >> w >> r >> c;\n int k;\n cin >> k;\n vector<vector<int>> A(h, vector<int>(w));\n for(auto &i : A) for(auto &j : i) cin >> j;\n \n vector<int> ans;\n binary_trie<unsigned> bin;\n \n for(int i = 0; i < h-r+1; i++){\n for(int j = 0; j < r; j++) for(int k = 0; k < c; k++) bin.insert(A[i+j][k]);\n for(int j = 0; j < w-c+1; j++){\n ans.push_back(bin[k-1]);\n if(j != w-c){\n for(int k = 0; k < r; k++) bin.erase(A[i+k][j]);\n for(int k = 0; k < r; k++) bin.insert(A[i+k][j+c]);\n }\n }\n for(int j = 0; j < r; j++) for(int k = 0; k < c; k++) bin.erase(A[i+j][k+(w-c)]);\n }\n \n sort(ans.begin(), ans.end());\n for(int i : ans) cout << i << '\\n';\n}", "accuracy": 1, "time_ms": 1520, "memory_kb": 16536, "score_of_the_acc": -0.811, "final_rank": 9 }, { "submission_id": "aoj_0463_10844247", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n// #include<atcoder/all>\n// using mint = atcoder::modint998244353;\nusing ld = long double;\n#define fi first\n#define se second\n#define all(x) x.begin(),x.end()\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\ntemplate<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}\ntemplate<typename T>bool chmax(T&a,T b){return b>a?(a=b,1):0;}\n\ntemplate <class T> struct fenwick_tree {\n using U = T;\n public:\n fenwick_tree() : _n(0) {}\n explicit fenwick_tree(int n) : _n(n), data(n) {}\n\n void add(int p, T x) {\n assert(0 <= p && p < _n);\n p++;\n while (p <= _n) {\n data[p - 1] += U(x);\n p += p & -p;\n }\n }\n\n T sum(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n return sum(r) - sum(l);\n }\n\n int lower_bound(T x) {\n if (x <= 0) return 0;\n int i = 0;\n T sum = 0;\n int k = 1;\n while (k << 1 <= _n) k <<= 1;\n for (; k > 0; k >>= 1) {\n if (i + k <= _n && sum + data[i + k - 1] < x) {\n sum += data[i + k - 1];\n i += k;\n }\n }\n return i;\n }\n\n private:\n int _n;\n std::vector<U> data;\n U sum(int r) {\n U s = 0;\n while (r > 0) {\n s += data[r - 1];\n r -= r & -r;\n }\n return s;\n }\n};\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n int H,W,R,C;\n cin>>H>>W>>R>>C;\n int K;\n cin>>K;\n vector A(H,vector<int>(W));\n rep(i,H)rep(j,W)cin>>A[i][j];\n\n\n vector<int> z;\n rep(i,H)rep(j,W)z.push_back(A[i][j]);\n sort(all(z));\n z.erase(unique(all(z)),z.end());\n rep(i,H)rep(j,W)A[i][j]=lower_bound(all(z), A[i][j])-z.begin();\n\n vector<int> ans;\n rep(h,H-R+1){\n fenwick_tree<int> bit(ssize(z));\n rep(i,R){\n rep(j,C){\n bit.add(A[i+h][j], 1);\n }\n }\n ans.push_back(z[bit.lower_bound(K)]);\n rep(w,W-C){\n rep(i,R){\n bit.add(A[h+i][w], -1);\n bit.add(A[h+i][w+C], 1);\n }\n ans.push_back(z[bit.lower_bound(K)]);\n }\n }\n sort(all(ans));\n for(int e: ans)cout<<e<<\"\\n\";\n}", "accuracy": 1, "time_ms": 350, "memory_kb": 6748, "score_of_the_acc": -0.172, "final_rank": 2 }, { "submission_id": "aoj_0463_10844179", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n// #include<atcoder/all>\n// using mint = atcoder::modint998244353;\nusing ld = long double;\n#define fi first\n#define se second\n#define all(x) x.begin(),x.end()\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\ntemplate<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}\ntemplate<typename T>bool chmax(T&a,T b){return b>a?(a=b,1):0;}\n\n#include <ext/pb_ds/assoc_container.hpp>\nusing namespace __gnu_pbds;\ntemplate <typename T>\nusing ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n int H,W,R,C;\n cin>>H>>W>>R>>C;\n int K;\n cin>>K;\n K--;\n vector A(H,vector<int>(W));\n rep(i,H)rep(j,W)cin>>A[i][j];\n\n vector<int> z;\n rep(i,H)rep(j,W)z.push_back(A[i][j]);\n sort(all(z));\n z.erase(unique(all(z)),z.end());\n rep(i,H)rep(j,W)A[i][j]=lower_bound(all(z), A[i][j])-z.begin();\n\n vector<int> ans;\n rep(h,H-R+1){\n ordered_set<pair<int,int>> st;\n rep(i,R){\n rep(j,C){\n st.insert({A[i+h][j], (i+h)*W+j});\n }\n }\n ans.push_back(z[st.find_by_order(K)->fi]);\n rep(w,W-C){\n rep(i,R){\n st.erase({A[h+i][w], (h+i)*W+w});\n st.insert({A[h+i][w+C], (h+1)*W+w+C});\n }\n ans.push_back(z[st.find_by_order(K)->fi]);\n }\n }\n sort(all(ans));\n for(int e: ans)cout<<e<<\"\\n\";\n}", "accuracy": 0.10810810810810811, "time_ms": 20, "memory_kb": 6252, "score_of_the_acc": -0.0008, "final_rank": 20 }, { "submission_id": "aoj_0463_10205787", "code_snippet": "// AOJ #463\n// Fishermen Following the Rules 2025.2.9\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tif (c == '-') {\tc = gc();\n\t\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\t\treturn -n;\n\t}\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Cout(int n) { // 整数の表示（出力）\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tif (n < 0) pc('-'), n = -n;\n\t\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n\t\twhile (i--) pc(b[i]);\n\t}\n\tpc('\\n');\n}\n\nint main(){\n int H = Cin(), W = Cin(), R = Cin(), C = Cin();\n int K = Cin();\n vector<vector<int>> grid(H, vector<int>(W));\n vector<int> all;\n all.reserve(H * W);\n for (int i = 0; i < H; i++){\n for (int j = 0; j < W; j++){\n grid[i][j] = Cin();\n all.push_back(grid[i][j]);\n }\n }\n sort(all.begin(), all.end());\n all.erase(unique(all.begin(), all.end()), all.end());\n int D = all.size();\n vector<vector<int>> disc(H, vector<int>(W));\n for (int i = 0; i < H; i++){\n for (int j = 0; j < W; j++){\n int pos = int(lower_bound(all.begin(), all.end(), grid[i][j]) - all.begin());\n disc[i][j] = pos + 1;\n }\n }\n \n vector<int> freq(D, 0);\n const int BS = 256;\n int nb = (D + BS - 1) / BS;\n vector<int> block(nb, 0);\n \n auto updateFreq = [&](int pos, int delta) {\n freq[pos] += delta;\n block[pos / BS] += delta;\n };\n \n auto kthQuery = [&]() -> int {\n int need = K;\n int b = 0;\n for(; b < nb; b++){\n if(block[b] < need)\n need -= block[b];\n else {\n int start = b * BS;\n int end = min(D, start + BS);\n for (int i = start; i < end; i++){\n if(freq[i] < need)\n need -= freq[i];\n else\n return i;\n }\n }\n }\n return -1;\n };\n \n int totalWindows = (H - R + 1) * (W - C + 1);\n vector<int> answers;\n answers.reserve(totalWindows);\n \n for (int r = 0; r < R; r++){\n for (int c = 0; c < C; c++){\n updateFreq(disc[r][c] - 1, 1);\n }\n }\n \n for (int i = 0; i <= H - R; i++){\n for (int j = 0; j <= W - C; j++){\n int idx = kthQuery();\n int price = all[idx];\n answers.push_back(price);\n \n if(j < W - C){\n for (int r = i; r < i + R; r++){\n updateFreq(disc[r][j] - 1, -1);\n updateFreq(disc[r][j + C] - 1, 1);\n }\n }\n }\n \n for (int j = W - C; j >= 1; j--){\n for (int r = i; r < i + R; r++){\n updateFreq(disc[r][j - 1 + C] - 1, -1);\n updateFreq(disc[r][j - 1] - 1, 1);\n }\n }\n \n if(i < H - R){\n for (int c = 0; c < C; c++){\n updateFreq(disc[i][c] - 1, -1);\n updateFreq(disc[i + R][c] - 1, 1);\n }\n }\n }\n \n sort(answers.begin(), answers.end());\n for (int val : answers) Cout(val);\n return 0;\n}", "accuracy": 1, "time_ms": 110, "memory_kb": 6152, "score_of_the_acc": -0.0466, "final_rank": 1 }, { "submission_id": "aoj_0463_9643417", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug_print.hpp>\n#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define debug(...) (static_cast<void>(0))\n#endif\n\ntemplate <class T>\nstruct BinaryIndexedTree {\n int N;\n vector<T> data;\n\n BinaryIndexedTree() = default;\n BinaryIndexedTree(int size) : N(size), data(size + 1, 0) {}\n BinaryIndexedTree(const vector<T>& v) : N(int(v.size())), data(N + 1, 0) {\n for (int i = 0; i < N; i++) add(i, v[i]);\n }\n void add(int i, T x) {\n ++i;\n while (i <= N) {\n data[i] += x;\n i += i & -i;\n }\n }\n void add(int l, int r, T x) { add(l, x), add(r + 1, -x); }\n T sum(int i) const {\n if (i < 0) return T{};\n T res = 0;\n while (i > 0) {\n res += data[i];\n i -= i & -i;\n }\n return res;\n }\n T sum(int l, int r) const { return sum(r) - sum(l); }\n T operator[](int i) const { return sum(i + 1) - sum(i); }\n // minimize i s.t. sum(i) >= w\n int lower_bound(T w) const {\n if (w <= 0) return 0;\n int i = 0;\n for (int k = 1 << __lg(N); k > 0; k >>= 1) {\n if (i + k <= N && data[i + k] < w) {\n w -= data[i + k];\n i += k;\n }\n }\n return i;\n }\n // minimize i s.t. sum(i) > w\n int upper_bound(T w) const {\n if (w < 0) return 0;\n int i = 0;\n for (int k = 1 << __lg(N); k > 0; k >>= 1) {\n if (i + k <= N && data[i + k] <= w) {\n w -= data[i + k];\n i += k;\n }\n }\n return i;\n }\n};\n\ntemplate <class T>\nvector<T> compress(vector<T>& v) {\n int n = v.size();\n vector<T> res = v;\n sort(res.begin(), res.end());\n res.erase(unique(res.begin(), res.end()), res.end());\n for (int i = 0; i < n; i++) {\n v[i] = lower_bound(res.begin(), res.end(), v[i]) - res.begin();\n }\n return res;\n}\n\n// O(M^3 log M^2) 時間\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int H, W, R, C, K;\n cin >> H >> W >> R >> C >> K;\n vector A(H, vector<int>(W));\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n cin >> A[i][j];\n }\n }\n\n // compress\n vector<int> values;\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n values.emplace_back(A[i][j]);\n }\n }\n sort(values.begin(), values.end());\n values.erase(unique(values.begin(), values.end()), values.end());\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n A[i][j] = lower_bound(values.begin(), values.end(), A[i][j]) - values.begin();\n }\n }\n\n debug(values, A);\n vector<int> ans;\n vector<BinaryIndexedTree<int>> bit(H - R + 1, BinaryIndexedTree<int>(values.size() + 1));\n // [i, i + R)[0, C) の bit \n for (int i = 0; i < H - R + 1; i++) {\n for (int j = 0; j < C; j++) {\n for (int k = 0; k < R; k++) {\n bit[i].add(A[i + k][j], 1);\n }\n }\n ans.emplace_back(values[bit[i].lower_bound(K)]);\n }\n\n // 移動\n for (int i = 0; i < H - R + 1; i++) {\n for (int j = 1; j < W - C + 1; j++) {\n for (int k = 0; k < R; k++) {\n bit[i].add(A[i + k][j - 1], -1);\n bit[i].add(A[i + k][j + C - 1], 1);\n }\n ans.emplace_back(values[bit[i].lower_bound(K)]);\n }\n }\n\n sort(ans.begin(), ans.end());\n for (auto&& v: ans) cout << v << '\\n';\n}", "accuracy": 1, "time_ms": 500, "memory_kb": 257120, "score_of_the_acc": -1.2462, "final_rank": 14 }, { "submission_id": "aoj_0463_9642602", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define INF (ll)2e18\nusing pii = pair<int,int>;\nusing qii = priority_queue<pii,vector<pii>,greater<pii>>;//{cost,node}\nvector<pii> d = {{0,1},{1,0},{-1,0},{0,-1}};\n\ntemplate<typename T> bool chmin(T &a, T b) { if (a > b){a = b;return true;}else return false; }\ntemplate<typename T> bool chmax(T &a, T b) { if (a < b){a = b;return true;}else return false; }\ntemplate<typename T> void vec_out(vector<T> a){for (int i = 0;i < a.size();i++)cout << a[i] << ' ';}\n\n\ntemplate<typename T>\nstruct segtree {//completely varified\n function<T(T, T)> op;\n T e;\n vector<T> tree;\n int n;\n\n segtree(function<T(T, T)> op_, T e_, const vector<T>& v_) \n : op(op_), e(e_), n(v_.size()) {\n tree.resize(2 * n);\n for (int i = 0; i < n; ++i) {\n tree[n + i] = v_[i];\n }\n for (int i = n - 1; i > 0; --i) {\n tree[i] = op(tree[i * 2], tree[i * 2 + 1]);\n }\n }\n\n T query(int l, int r) {\n T resl = e, resr = e;\n l += n;\n r += n;\n while (l < r) {\n if (l & 1) resl = op(resl, tree[l++]);\n if (r & 1) resr = op(tree[--r], resr);\n l /= 2;\n r /= 2;\n }\n return op(resl, resr);\n }\n\n void update(int idx, T val) {\n idx += n;\n tree[idx] = val;\n while (idx > 1) {\n idx /= 2;\n tree[idx] = op(tree[2 * idx], tree[2 * idx + 1]);\n }\n }\n void incriment(int idx){\n update(idx,query(idx,idx + 1) + 1);\n } \n void decriment(int idx){\n update(idx,query(idx,idx + 1) - 1);\n }\n int kth_min(int k){//op(a,b) return a + b;\n int l = 0,r = n;\n while (l < r){\n int mid = (l + r) / 2;\n if (query(0,mid + 1) < k){\n l = mid + 1;\n }\n else{\n r = mid;\n }\n }\n //update(r,tree[r + n] - 1);\n return r;\n }\n};\n\nint op(int a,int b){return a + b;}\nint e = 0;\n\nint main(){\n int h,w,r,c;\n cin >> h >> w >> r >> c;\n int k;\n cin >> k;\n vector<vector<int>> a(h,vector<int> (w));\n vector<int> uniq;\n for (int i = 0;i < h;i++){\n for (int j = 0;j < w;j++){\n cin >> a[i][j];\n uniq.push_back(a[i][j]);\n }\n }\n sort(uniq.begin(),uniq.end());\n uniq.erase(unique(uniq.begin(),uniq.end()),uniq.end());\n vector<vector<int>> compressed(h,vector<int> (w));\n for (int i= 0;i < h;i++){\n for (int j = 0;j < w;j++){\n compressed[i][j] = lower_bound(uniq.begin(),uniq.end(),a[i][j]) - uniq.begin();\n }\n }\n vector<int> b(160001);\n segtree<int> seg(op,e,b);\n for (int i = 0;i < r;i++){\n for (int j = 0;j < c;j++){\n seg.incriment(compressed[i][j]);\n }\n }\n \n vector<vector<int>> ans(h - r + 1,vector<int> (w - c + 1));\n bool straight = true;\n int idx = 0;\n for (int i = 0;i < h - r + 1;i++){\n if (straight){\n for (int j = 0;j < w -c + 1;j++){\n ans[i][j] = seg.kth_min(k);\n if (j == w - c && i != h - r){\n for (int k = w - c;k < w;k++){\n seg.decriment(compressed[i][k]);\n seg.incriment(compressed[i + r][k]);\n }\n continue;\n }\n if (j == w - c)continue;\n for (int k = 0;k < r;k++){\n seg.decriment(compressed[i + k][j]);\n seg.incriment(compressed[i + k][j + c]);\n }\n }\n straight = false;\n }\n else{\n for (int j = w - c;j >= 0;j--){\n ans[i][j] = seg.kth_min(k);\n if (j == 0 && i != h - r){\n for (int k = 0;k < c;k++){\n seg.decriment(compressed[i][k]);\n seg.incriment(compressed[i + r][k]);\n }\n continue;\n }\n if (j == 0)continue;\n for (int k = 0;k < r;k++){\n seg.decriment(compressed[i + k][j + c - 1]);\n seg.incriment(compressed[i + k][j - 1]);\n }\n }\n straight = true;\n }\n }\n\n vector<int> sortedans;\n for (int i = 0;i < h - r + 1;i++){\n for (int j = 0;j < w - c + 1;j++){\n sortedans.push_back(uniq[ans[i][j]]);\n }\n }\n sort(sortedans.begin(),sortedans.end());\n for (int i = 0;i < (h - r + 1) * (w - c + 1);i++){\n cout << sortedans[i] << endl;\n }\n \n\n}", "accuracy": 1, "time_ms": 1180, "memory_kb": 8956, "score_of_the_acc": -0.6065, "final_rank": 8 }, { "submission_id": "aoj_0463_9636448", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nstruct segtree{\n int n;\n vector<ll> node;\n segtree(int N){\n n = 1;\n while(n<N) n*=2;\n node.resize(2*n-1,0);\n }\n void update(int a,ll x){\n int i = a+n-1;\n node[i] = x;\n while(i>0){\n i = (i-1)/2;\n node[i] = node[2*i+1]+node[2*i+2];\n }\n }\n ll find(ll a,ll b,ll k=0,ll l=0,ll r=-1){\n if(r<0) r = n;\n if(b<=l||r<=a) return 0;\n if(a<=l&&r<=b) return node[k];\n ll vl = find(a,b,2*k+1,l,(l+r)/2);\n ll vr = find(a,b,2*k+2,(l+r)/2,r);\n return vl+vr;\n }\n};\nint main() {\n int H,W,R,C;\n cin >> H >> W >> R >> C;\n int K;\n cin >> K;\n vector<vector<ll>> a(H,vector<ll>(W));\n for(int i=0;i<H;i++){\n for(int j=0;j<W;j++) cin >> a[i][j];\n }\n vector<pair<ll,ll>> B;\n for(int i=0;i<H;i++){\n for(int j=0;j<W;j++) B.push_back(pair(a[i][j],i*W+j));\n }\n sort(B.begin(),B.end());\n vector<ll> sB(H*W);\n vector<ll> iB(H*W);\n segtree seg(H*W);\n for(int i=0;i<B.size();i++){\n sB[i] = B[i].first;\n iB[B[i].second] = i;\n }\n vector<ll> ans;\n for(int i=0;i<=H-R;i++){\n if(i%2==0){\n for(int j=0;j<=W-C;j++){\n if(R*C==1){\n }\n if(i==0&&j==0){\n for(int k=0;k<R;k++){\n for(int l=0;l<C;l++){\n seg.update(iB[k*W+l],1);\n }\n }\n }else if(j==0){\n for(int k=j;k<j+C;k++){\n seg.update(iB[(i-1)*W+k],0);\n }\n for(int k=j;k<j+C;k++){\n seg.update(iB[(i+R-1)*W+k],1);\n }\n }else{\n for(int k=i;k<i+R;k++){\n seg.update(iB[k*W+j-1],0);\n }\n for(int k=i;k<i+R;k++){\n seg.update(iB[k*W+j+C-1],1);\n }\n }\n ll left = -1;\n ll right = H*W;\n while(right-left>1){\n ll mid = (left+right)/2;\n if(seg.find(0,mid+1)<K) left = mid;\n else right = mid;\n }\n ans.push_back(sB[right]);\n }\n }else{\n for(int j=W-C;j>=0;j--){\n if(j==W-C){\n for(int k=j;k<j+C;k++){\n seg.update(iB[(i-1)*W+k],0);\n }\n for(int k=j;k<j+C;k++){\n seg.update(iB[(i+R-1)*W+k],1);\n }\n }else{\n for(int k=i;k<i+R;k++){\n seg.update(iB[k*W+j],1);\n }\n for(int k=i;k<i+R;k++){\n seg.update(iB[k*W+j+C],0);\n }\n }\n ll left = -1;\n ll right = H*W;\n while(right-left>1){\n ll mid = (left+right)/2;\n if(seg.find(0,mid+1)<K) left = mid;\n else right = mid;\n }\n ans.push_back(sB[right]);\n }\n }\n }\n sort(ans.begin(),ans.end());\n for(auto x:ans){\n cout << x << endl;\n }\n}", "accuracy": 1, "time_ms": 780, "memory_kb": 18112, "score_of_the_acc": -0.4378, "final_rank": 7 }, { "submission_id": "aoj_0463_9626167", "code_snippet": "#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\nusing namespace std;\n#define all(v) (v).begin(),(v).end()\n#define pb(a) push_back(a)\n#define rep(i, n) for(int i=0;i<n;i++)\n#define foa(e, v) for(auto& e : v)\nusing ll = long long;\nconst ll MOD7 = 1000000007, MOD998 = 998244353, INF = (1LL << 60);\n#define dout(a) cout<<fixed<<setprecision(10)<<a<<endl;\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n// Reference: https://en.wikipedia.org/wiki/Fenwick_tree\ntemplate <class T> struct fenwick_tree {\n using U = internal::to_unsigned_t<T>;\n\n public:\n fenwick_tree() : _n(0) {}\n fenwick_tree(int n) : _n(n), data(n) {}\n\n void add(int p, T x) {\n assert(0 <= p && p < _n);\n p++;\n while (p <= _n) {\n data[p - 1] += U(x);\n p += p & -p;\n }\n }\n\n T sum(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n return sum(r) - sum(l);\n }\n\n private:\n int _n;\n std::vector<U> data;\n\n U sum(int r) {\n U s = 0;\n while (r > 0) {\n s += data[r - 1];\n r -= r & -r;\n }\n return s;\n }\n};\n\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int h, w, r, c;\n cin >> h >> w >> r >> c;\n int k;\n cin >> k;\n vector<vector<int>> a(h, vector(w, 0));\n rep(i, h) rep(j, w) cin >> a[i][j];\n map<tuple<int, int, int>, int> mp;\n rep(i, h) rep(j, w) mp[{a[i][j], i, j}];\n int id = 0;\n vector ID(h, vector(w, 0));\n vector<int> inv;\n for(auto [x, y] : mp) {\n auto [A, B, C] = x;\n ID[B][C] = id ++;\n inv.pb(A);\n }\n vector<int> ans;\n rep(i, h - r + 1) {\n fenwick_tree<int> bit(h * w);\n for(int x = 0; x < r; x ++) {\n for(int y = 0; y < c - 1; y ++) {\n bit.add(ID[i + x][y], 1);\n }\n }\n for(int y = c - 1; y < w; y ++) {\n for(int x = 0; x < r; x ++) bit.add(ID[i + x][y], 1);\n int le = -1, ri = h * w;\n while(ri - le > 1) {\n int mid = (ri + le) / 2;\n if(bit.sum(0, mid) >= k) ri = mid; \n else le = mid;\n }\n ans.pb(inv[le]);\n for(int x = 0; x < r; x ++) bit.add(ID[i + x][y - (c - 1)], -1);\n }\n }\n sort(all(ans));\n foa(e, ans) cout << e << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 490, "memory_kb": 17008, "score_of_the_acc": -0.2847, "final_rank": 5 }, { "submission_id": "aoj_0463_9565482", "code_snippet": "#pragma GCC optimize(\"O3\")\n#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tcin.tie(nullptr);\n\tios_base::sync_with_stdio(false);\n\tint h,w,r,c,K;\n\tcin >> h >> w >> r >> c >> K;\n\tvector<pair<int,pair<int,int>>> t;\n\tint x = 1,y = 1;\n\twhile(x * x < w) x++;\n\twhile(y * y < h) y++;\n\tif(r >= 100){\n\t\ty = 11;\n\t}\n\tif(c >= 100){\n\t\tx = 11;\n\t}\n\tif(r >= 300){\n\t\ty = 17;\n\t}\n\tif(c >= 300){\n\t\tx = 17;\n\t}\n\tvector<vector<vector<int>>> s(h / y + 1,vector<vector<int>>(w / x + 1,vector<int>(K,0)));\n\tvector<vector<int>> now(h,vector<int>(w,0));\n\tvector<vector<int>> cou(h / y + 1,vector<int>(w / x + 1,0));\n\tfor(int i = 0;i < h;i++){\n\t\tfor(int j = 0;j < w;j++){\n\t\t\tint tmp;\n\t\t\tcin >> tmp;\n\t\t\tt.push_back({tmp,{i,j}});\n\t\t\tif(i <= (h - r + 1) && j <= (w - c + 1)){\n\t\t\t\ts[i / y][j / x][0]++;\n\t\t\t}\n\t\t}\n\t}\n\tsort(t.begin(),t.end());\n\tauto f = [](pair<pair<int,int>,pair<int,int>> a,pair<pair<int,int>,pair<int,int>> b) -> bool {\n\t\tpair<int,int> flg;\n\t\tflg.first = b.second.first < a.first.first || a.second.first < b.first.first;\n\t\tflg.second = b.second.second < a.first.second || a.second.second < b.first.second;\n\t\tif(flg.first || flg.second) return false;\n\t\treturn true;\n\t};\n\tint ans = 0;\n\tfor(pair<int,pair<int,int>> i : t){\n\t\tpair<pair<int,int>,pair<int,int>> p = {{max(0,i.second.first - r + 1),max(0,i.second.second - c + 1)},{min(h - r + 1,i.second.first),min(w - c + 1,i.second.second)}};\n\t\tif(ans >= (h - r + 1) * (w - c + 1)) break;\n\t\tfor(int k = p.first.first / y;k <= p.second.first / y;k++){\n\t\t\tfor(int l = p.first.second / x;l <= p.second.second / x;l++){\n\t\t\t\tpair<pair<int,int>,pair<int,int>> it = {{k * y,l * x},{k * y + y - 1,l * x + x - 1}};\n\t\t\t\tif(!f(p,it)){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif(p.first.first <= it.first.first && it.second.first <= p.second.first && p.first.second <= it.first.second && it.second.second <= p.second.second){\n\t\t\t\t\tcou[k][l]++;\n\t\t\t\t\tif(K - cou[k][l] >= 0){\n\t\t\t\t\t\tfor(int j = 0;j < s[k][l][K - cou[k][l]];j++){\n\t\t\t\t\t\t\tans++;\n\t\t\t\t\t\t\tcout << i.first << \"\\n\";\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tfor(int u = it.first.first;u <= it.second.first;u++){\n\t\t\t\t\t\tfor(int v = it.first.second;v <= it.second.second;v++){\n\t\t\t\t\t\t\tif(u < 0 || u > (h - r) || v < 0 || v > (w - c)) continue;\n\t\t\t\t\t\t\tif(now[u][v] < K){\n\t\t\t\t\t\t\t\ts[k][l][now[u][v]]--;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tnow[u][v] += cou[k][l];\n\t\t\t\t\t\t\tif(now[u][v] < K){\n\t\t\t\t\t\t\t\ts[k][l][now[u][v]]++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif(p.first.first <= u && u <= p.second.first && p.first.second <= v && v <= p.second.second){\n\t\t\t\t\t\t\t\tif(now[u][v] >= K) continue;\n\t\t\t\t\t\t\t\ts[k][l][now[u][v]]--;\n\t\t\t\t\t\t\t\tnow[u][v]++;\n\t\t\t\t\t\t\t\tif(now[u][v] < K){\n\t\t\t\t\t\t\t\t\ts[k][l][now[u][v]]++;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif(now[u][v] == K){\n\t\t\t\t\t\t\t\t\tans++;\n\t\t\t\t\t\t\t\t\tcout << i.first << \"\\n\";\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tcou[k][l] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 1970, "memory_kb": 222728, "score_of_the_acc": -1.863, "final_rank": 15 }, { "submission_id": "aoj_0463_9565436", "code_snippet": "#pragma GCC optimize(\"O3\")\n#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tcin.tie(nullptr);\n\tios_base::sync_with_stdio(false);\n\tlong long h,w,r,c,K;\n\tcin >> h >> w >> r >> c >> K;\n\tvector<vector<long long>> a(h,vector<long long>(w));\n\tvector<pair<long long,pair<long long,long long>>> t;\n\tlong long x = 1ll,y = 1ll;\n\twhile(x * x < w) x++;\n\twhile(y * y < h) y++;\n\tif(r >= 100){\n\t\ty = 10;\n\t}\n\tif(c >= 100){\n\t\tx = 10;\n\t}\n\tvector<vector<vector<long long>>> s(y,vector<vector<long long>>(x,vector<long long>(K,0ll)));\n\tvector<vector<long long>> now(h,vector<long long>(w,0ll));\n\tvector<vector<long long>> cou(h / y + 1,vector<long long>(w / x + 1,0ll));\n\tfor(long long i = 0ll;i < h;i++){\n\t\tfor(long long j = 0ll;j < w;j++){\n\t\t\tcin >> a[i][j];\n\t\t\tt.push_back({a[i][j],{i,j}});\n\t\t\tif(i <= (h - r + 1ll) && j <= (w - c + 1ll)){\n\t\t\t\ts[i / y][j / x][0ll]++;\n\t\t\t}\n\t\t}\n\t}\n\tsort(t.begin(),t.end());\n\tauto f = [](pair<pair<long long,long long>,pair<long long,long long>> a,pair<pair<long long,long long>,pair<long long,long long>> b) -> bool {\n\t\tpair<long long,long long> flg;\n\t\tflg.first = b.second.first < a.first.first || a.second.first < b.first.first;\n\t\tflg.second = b.second.second < a.first.second || a.second.second < b.first.second;\n\t\tif(flg.first || flg.second) return false;\n\t\treturn true;\n\t};\n\tvector<long long> ans;\n\tfor(pair<long long,pair<long long,long long>> i : t){\n\t\tpair<pair<long long,long long>,pair<long long,long long>> p = {{max(0ll,i.second.first - r + 1ll),max(0ll,i.second.second - c + 1ll)},{min(h - r + 1ll,i.second.first),min(w - c + 1ll,i.second.second)}};\n\t\tif((int)ans.size() >= (h - r + 1) * (w - c + 1)) break;\n\t\tfor(long long k = 0ll;k < h / y + 1;k++){\n\t\t\tfor(long long l = 0ll;l < w / x + 1;l++){\n\t\t\t\tpair<pair<long long,long long>,pair<long long,long long>> it = {{k * y,l * x},{k * y + y - 1ll,l * x + x - 1ll}};\n\t\t\t\tif(!f(p,it)){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif(p.first.first <= it.first.first && it.second.first <= p.second.first && p.first.second <= it.first.second && it.second.second <= p.second.second){\n\t\t\t\t\tcou[k][l]++;\n\t\t\t\t\tif(K - cou[k][l] >= 0ll){\n\t\t\t\t\t\tfor(long long j = 0ll;j < s[k][l][K - cou[k][l]];j++){\n\t\t\t\t\t\t\tans.push_back(i.first);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tfor(long long u = it.first.first;u <= it.second.first;u++){\n\t\t\t\t\t\tfor(long long v = it.first.second;v <= it.second.second;v++){\n\t\t\t\t\t\t\tif(u < 0ll || u > (h - r) || v < 0ll || v > (w - c)) continue;\n\t\t\t\t\t\t\tif(now[u][v] < K){\n\t\t\t\t\t\t\t\ts[k][l][now[u][v]]--;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tnow[u][v] += cou[k][l];\n\t\t\t\t\t\t\tif(now[u][v] < K){\n\t\t\t\t\t\t\t\ts[k][l][now[u][v]]++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tcou[k][l] = 0ll;\n\t\t\t\t\tfor(long long u = it.first.first;u <= it.second.first;u++){\n\t\t\t\t\t\tfor(long long v = it.first.second;v <= it.second.second;v++){\n\t\t\t\t\t\t\tif(u < 0ll || u > (h - r) || v < 0ll || v > (w - c)) continue;\n\t\t\t\t\t\t\tif(p.first.first <= u && u <= p.second.first && p.first.second <= v && v <= p.second.second){\n\t\t\t\t\t\t\t\tif(now[u][v] >= K) continue;\n\t\t\t\t\t\t\t\ts[k][l][now[u][v]]--;\n\t\t\t\t\t\t\t\tnow[u][v]++;\n\t\t\t\t\t\t\t\tif(now[u][v] < K){\n\t\t\t\t\t\t\t\t\ts[k][l][now[u][v]]++;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif(now[u][v] == K){\n\t\t\t\t\t\t\t\t\tans.push_back(i.first);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor(long long i = 0ll;i < (long long)ans.size();i++){\n\t\tcout << ans[i] << endl;\n\t}\n}", "accuracy": 0.32432432432432434, "time_ms": 840, "memory_kb": 12964, "score_of_the_acc": -0.4481, "final_rank": 17 }, { "submission_id": "aoj_0463_9565432", "code_snippet": "#pragma GCC optimize(\"O3\")\n#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tcin.tie(nullptr);\n\tios_base::sync_with_stdio(false);\n\tlong long h,w,r,c,K;\n\tcin >> h >> w >> r >> c >> K;\n\tvector<vector<long long>> a(h,vector<long long>(w));\n\tvector<pair<long long,pair<long long,long long>>> t;\n\tlong long x = 1ll,y = 1ll;\n\twhile(x * x < w) x++;\n\twhile(y * y < h) y++;\n\tif(r >= 100){\n\t\ty = 10;\n\t}\n\tif(c >= 100){\n\t\tx = 10;\n\t}\n\tvector<vector<vector<long long>>> s(y,vector<vector<long long>>(x,vector<long long>(K,0ll)));\n\tvector<vector<long long>> now(h,vector<long long>(w,0ll));\n\tvector<vector<long long>> cou(y,vector<long long>(x,0ll));\n\tfor(long long i = 0ll;i < h;i++){\n\t\tfor(long long j = 0ll;j < w;j++){\n\t\t\tcin >> a[i][j];\n\t\t\tt.push_back({a[i][j],{i,j}});\n\t\t\tif(i <= (h - r + 1ll) && j <= (w - c + 1ll)){\n\t\t\t\ts[i / y][j / x][0ll]++;\n\t\t\t}\n\t\t}\n\t}\n\tsort(t.begin(),t.end());\n\tauto f = [](pair<pair<long long,long long>,pair<long long,long long>> a,pair<pair<long long,long long>,pair<long long,long long>> b) -> bool {\n\t\tpair<long long,long long> flg;\n\t\tflg.first = b.second.first < a.first.first || a.second.first < b.first.first;\n\t\tflg.second = b.second.second < a.first.second || a.second.second < b.first.second;\n\t\tif(flg.first || flg.second) return false;\n\t\treturn true;\n\t};\n\tvector<long long> ans;\n\tfor(pair<long long,pair<long long,long long>> i : t){\n\t\tpair<pair<long long,long long>,pair<long long,long long>> p = {{max(0ll,i.second.first - r + 1ll),max(0ll,i.second.second - c + 1ll)},{min(h - r + 1ll,i.second.first),min(w - c + 1ll,i.second.second)}};\n\t\tif((int)ans.size() >= (h - r + 1) * (w - c + 1)) break;\n\t\tfor(long long k = 0ll;k < y;k++){\n\t\t\tfor(long long l = 0ll;l < x;l++){\n\t\t\t\tpair<pair<long long,long long>,pair<long long,long long>> it = {{k * y,l * x},{k * y + y - 1ll,l * x + x - 1ll}};\n\t\t\t\tif(!f(p,it)){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif(p.first.first <= it.first.first && it.second.first <= p.second.first && p.first.second <= it.first.second && it.second.second <= p.second.second){\n\t\t\t\t\tcou[k][l]++;\n\t\t\t\t\tif(K - cou[k][l] >= 0ll){\n\t\t\t\t\t\tfor(long long j = 0ll;j < s[k][l][K - cou[k][l]];j++){\n\t\t\t\t\t\t\tans.push_back(i.first);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tfor(long long u = it.first.first;u <= it.second.first;u++){\n\t\t\t\t\t\tfor(long long v = it.first.second;v <= it.second.second;v++){\n\t\t\t\t\t\t\tif(u < 0ll || u > (h - r) || v < 0ll || v > (w - c)) continue;\n\t\t\t\t\t\t\tif(now[u][v] < K){\n\t\t\t\t\t\t\t\ts[k][l][now[u][v]]--;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tnow[u][v] += cou[k][l];\n\t\t\t\t\t\t\tif(now[u][v] < K){\n\t\t\t\t\t\t\t\ts[k][l][now[u][v]]++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tcou[k][l] = 0ll;\n\t\t\t\t\tfor(long long u = it.first.first;u <= it.second.first;u++){\n\t\t\t\t\t\tfor(long long v = it.first.second;v <= it.second.second;v++){\n\t\t\t\t\t\t\tif(u < 0ll || u > (h - r) || v < 0ll || v > (w - c)) continue;\n\t\t\t\t\t\t\tif(p.first.first <= u && u <= p.second.first && p.first.second <= v && v <= p.second.second){\n\t\t\t\t\t\t\t\tif(now[u][v] >= K) continue;\n\t\t\t\t\t\t\t\ts[k][l][now[u][v]]--;\n\t\t\t\t\t\t\t\tnow[u][v]++;\n\t\t\t\t\t\t\t\tif(now[u][v] < K){\n\t\t\t\t\t\t\t\t\ts[k][l][now[u][v]]++;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif(now[u][v] == K){\n\t\t\t\t\t\t\t\t\tans.push_back(i.first);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor(long long i = 0ll;i < (long long)ans.size();i++){\n\t\tcout << ans[i] << endl;\n\t}\n}", "accuracy": 0.32432432432432434, "time_ms": 390, "memory_kb": 14732, "score_of_the_acc": -0.2243, "final_rank": 16 }, { "submission_id": "aoj_0463_9565401", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tlong long h,w,r,c,K;\n\tcin >> h >> w >> r >> c >> K;\n\tvector<vector<long long>> a(h,vector<long long>(w));\n\tvector<pair<long long,pair<long long,long long>>> t;\n\tlong long x = 1ll,y = 1ll;\n\twhile(x * x < w) x++;\n\twhile(y * y < h) y++;\n\tvector<vector<vector<long long>>> s(y,vector<vector<long long>>(x,vector<long long>(K,0ll)));\n\tvector<vector<long long>> now(h,vector<long long>(w,0ll));\n\tvector<vector<long long>> cou(y,vector<long long>(x,0ll));\n\tfor(long long i = 0ll;i < h;i++){\n\t\tfor(long long j = 0ll;j < w;j++){\n\t\t\tcin >> a[i][j];\n\t\t\tt.push_back({a[i][j],{i,j}});\n\t\t\tif(i <= (h - r + 1ll) && j <= (w - c + 1ll)){\n\t\t\t\ts[i / y][j / x][0ll]++;\n\t\t\t}\n\t\t}\n\t}\n\tsort(t.begin(),t.end());\n\tauto f = [](pair<pair<long long,long long>,pair<long long,long long>> a,pair<pair<long long,long long>,pair<long long,long long>> b) -> bool {\n\t\tpair<long long,long long> flg;\n\t\tflg.first = b.second.first < a.first.first || a.second.first < b.first.first;\n\t\tflg.second = b.second.second < a.first.second || a.second.second < b.first.second;\n\t\tif(flg.first || flg.second) return false;\n\t\treturn true;\n\t};\n\tvector<long long> ans;\n\tfor(pair<long long,pair<long long,long long>> i : t){\n\t\tpair<pair<long long,long long>,pair<long long,long long>> p = {{max(0ll,i.second.first - r + 1ll),max(0ll,i.second.second - c + 1ll)},{min(h - r + 1ll,i.second.first),min(w - c + 1ll,i.second.second)}};\n\t\tfor(long long k = 0ll;k < y;k++){\n\t\t\tfor(long long l = 0ll;l < x;l++){\n\t\t\t\tpair<pair<long long,long long>,pair<long long,long long>> it = {{k * y,l * x},{k * y + y - 1ll,l * x + x - 1ll}};\n\t\t\t\tif(!f(p,it)){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif(p.first.first <= it.first.first && it.second.first <= p.second.first && p.first.second <= it.first.second && it.second.second <= p.second.second){\n\t\t\t\t\tcou[k][l]++;\n\t\t\t\t\tif(K - cou[k][l] >= 0ll){\n\t\t\t\t\t\tfor(long long j = 0ll;j < s[k][l][K - cou[k][l]];j++){\n\t\t\t\t\t\t\tans.push_back(i.first);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tfor(long long u = it.first.first;u <= it.second.first;u++){\n\t\t\t\t\t\tfor(long long v = it.first.second;v <= it.second.second;v++){\n\t\t\t\t\t\t\tif(u < 0ll || u > (h - r) || v < 0ll || v > (w - c)) continue;\n\t\t\t\t\t\t\tnow[u][v] += cou[k][l];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tcou[k][l] = 0ll;\n\t\t\t\t\tfor(long long u = it.first.first;u <= it.second.first;u++){\n\t\t\t\t\t\tfor(long long v = it.first.second;v <= it.second.second;v++){\n\t\t\t\t\t\t\tif(u < 0ll || u > (h - r) || v < 0ll || v > (w - c)) continue;\n\t\t\t\t\t\t\tif(p.first.first <= u && u <= p.second.first && p.first.second <= v && v <= p.second.second){\n\t\t\t\t\t\t\t\tif(now[u][v] >= K) continue;\n\t\t\t\t\t\t\t\ts[k][l][now[u][v]]--;\n\t\t\t\t\t\t\t\tnow[u][v]++;\n\t\t\t\t\t\t\t\tif(now[u][v] < K){\n\t\t\t\t\t\t\t\t\ts[k][l][now[u][v]]++;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif(now[u][v] == K){\n\t\t\t\t\t\t\t\t\tans.push_back(i.first);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor(long long i = 0ll;i < (long long)ans.size();i++){\n\t\tcout << ans[i] << endl;\n\t}\n}", "accuracy": 0.16216216216216217, "time_ms": 390, "memory_kb": 13720, "score_of_the_acc": -0.2203, "final_rank": 18 }, { "submission_id": "aoj_0463_9565400", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint h,w,r,c,K;\n\tcin >> h >> w >> r >> c >> K;\n\tvector<vector<int>> a(h,vector<int>(w));\n\tvector<pair<int,pair<int,int>>> t;\n\tint x = 1,y = 1;\n\twhile(x * x < w) x++;\n\twhile(y * y < h) y++;\n\tvector<vector<vector<int>>> s(y,vector<vector<int>>(x,vector<int>(K,0)));\n\tvector<vector<int>> now(h,vector<int>(w,0));\n\tvector<vector<int>> cou(y,vector<int>(x,0));\n\tfor(int i = 0;i < h;i++){\n\t\tfor(int j = 0;j < w;j++){\n\t\t\tcin >> a[i][j];\n\t\t\tt.push_back({a[i][j],{i,j}});\n\t\t\tif(i <= (h - r + 1) && j <= (w - c + 1)){\n\t\t\t\ts[i / y][j / x][0]++;\n\t\t\t}\n\t\t}\n\t}\n\tsort(t.begin(),t.end());\n\tauto f = [](pair<pair<int,int>,pair<int,int>> a,pair<pair<int,int>,pair<int,int>> b) -> bool {\n\t\tpair<int,int> flg;\n\t\tflg.first = b.second.first < a.first.first || a.second.first < b.first.first;\n\t\tflg.second = b.second.second < a.first.second || a.second.second < b.first.second;\n\t\tif(flg.first || flg.second) return false;\n\t\treturn true;\n\t};\n\tvector<int> ans;\n\tfor(pair<int,pair<int,int>> i : t){\n\t\tpair<pair<int,int>,pair<int,int>> p = {{max(0,i.second.first - r + 1),max(0,i.second.second - c + 1)},{min(h - r + 1,i.second.first),min(w - c + 1,i.second.second)}};\n\t\tfor(int k = 0;k < y;k++){\n\t\t\tfor(int l = 0;l < x;l++){\n\t\t\t\tpair<pair<int,int>,pair<int,int>> it = {{k * y,l * x},{k * y + y - 1,l * x + x - 1}};\n\t\t\t\tif(!f(p,it)){\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif(p.first.first <= it.first.first && it.second.first <= p.second.first && p.first.second <= it.first.second && it.second.second <= p.second.second){\n\t\t\t\t\tcou[k][l]++;\n\t\t\t\t\tif(K - cou[k][l] >= 0){\n\t\t\t\t\t\tfor(int j = 0;j < s[k][l][K - cou[k][l]];j++){\n\t\t\t\t\t\t\tans.push_back(i.first);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}else{\n\t\t\t\t\tfor(int u = it.first.first;u <= it.second.first;u++){\n\t\t\t\t\t\tfor(int v = it.first.second;v <= it.second.second;v++){\n\t\t\t\t\t\t\tif(u < 0 || u > (h - r) || v < 0 || v > (w - c)) continue;\n\t\t\t\t\t\t\tnow[u][v] += cou[k][l];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tcou[k][l] = 0;\n\t\t\t\t\tfor(int u = it.first.first;u <= it.second.first;u++){\n\t\t\t\t\t\tfor(int v = it.first.second;v <= it.second.second;v++){\n\t\t\t\t\t\t\tif(u < 0 || u > (h - r) || v < 0 || v > (w - c)) continue;\n\t\t\t\t\t\t\tif(p.first.first <= u && u <= p.second.first && p.first.second <= v && v <= p.second.second){\n\t\t\t\t\t\t\t\tif(now[u][v] >= K) continue;\n\t\t\t\t\t\t\t\ts[k][l][now[u][v]]--;\n\t\t\t\t\t\t\t\tnow[u][v]++;\n\t\t\t\t\t\t\t\tif(now[u][v] < K){\n\t\t\t\t\t\t\t\t\ts[k][l][now[u][v]]++;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif(now[u][v] == K){\n\t\t\t\t\t\t\t\t\tans.push_back(i.first);\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i = 0;i < (int)ans.size();i++){\n\t\tcout << ans[i] << endl;\n\t}\n}", "accuracy": 0.16216216216216217, "time_ms": 430, "memory_kb": 8796, "score_of_the_acc": -0.2212, "final_rank": 19 }, { "submission_id": "aoj_0463_9426500", "code_snippet": "#include <bits/stdc++.h>\n\nstruct FenwickTree {\n int lsb(int x) const { return x & (-x); }\n std::vector<int> dat;\n FenwickTree(int n) : dat(n + 1) {}\n void add(int i, int v) {\n for (i++ ; i < (int)dat.size() ; i += lsb(i)) {\n dat[i] += v;\n }\n }\n int pref(int r) const {\n int res{};\n for (int i{r} ; i ; i -= lsb(i)) {\n res += dat[i];\n }\n return res;\n }\n int prod(int l, int r) const {\n return -pref(l) + pref(r);\n }\n};\n\nint main() {\n int H, W, R, C;\n std::cin >> H >> W >> R >> C;\n int K;\n std::cin >> K;\n std::vector A(H, std::vector<int>(W));\n std::vector<int> app;\n for (int i{} ; i < H ; i++) {\n for (int j{} ; j < W ; j++) {\n std::cin >> A[i][j];\n app.push_back(A[i][j]);\n }\n }\n std::sort(app.begin(), app.end());\n app.erase(std::unique(app.begin(), app.end()), app.end());\n std::vector B(H, std::vector<int>(W));\n for (int i{} ; i < H ; i++) {\n for (int j{} ; j < W ; j++) {\n B[i][j] = (int)std::distance(app.begin(), std::lower_bound(app.begin(), app.end(), A[i][j]));\n }\n }\n FenwickTree fen(app.size());\n for (int i{} ; i < R ; i++) {\n for (int j{} ; j < C ; j++) {\n fen.add(B[i][j], 1);\n }\n }\n std::vector ans(H - R + 1, std::vector<int>(W - C + 1));\n std::vector<int> sorted;\n for (int i{} ; i < H - R + 1 ; i++) {\n for (int j{} ; j < W - C + 1 ; j++) {\n int ok{(int)app.size()}, ng{};\n while (ok - ng > 1) {\n int mid{(ok + ng) / 2};\n if (fen.prod(0, mid) >= K) {\n ok = mid;\n }\n else {\n ng = mid;\n }\n }\n assert(ok > 0);\n ans[i][j] = app[ok - 1];\n sorted.push_back(ans[i][j]);\n // std::cout << i << ' ' << j << std::endl;\n if (j + 1 < W - C + 1) {\n if (i % 2 == 0) {\n for (int k{} ; k < R ; k++) {\n fen.add(B[i + k][j], -1);\n fen.add(B[i + k][j + C], +1);\n }\n }\n else {\n for (int k{} ; k < R ; k++) {\n fen.add(B[i + k][W - j - 1], -1);\n fen.add(B[i + k][W - C - j - 1], +1);\n }\n }\n }\n }\n if (i + 1 < H - R + 1) {\n if (i % 2 == 0) {\n for (int k{} ; k < C ; k++) {\n fen.add(B[i][W - C + k], -1);\n fen.add(B[i + R][W - C + k], +1);\n }\n }\n else {\n for (int k{} ; k < C ; k++) {\n fen.add(B[i][k], -1);\n fen.add(B[i + R][k], +1);\n }\n }\n }\n }\n std::sort(sorted.begin(), sorted.end());\n for (auto s : sorted) {\n std::cout << s << '\\n';\n }\n // for (int i{} ; i < H - R + 1 ; i++) {\n // for (int j{} ; j < W - C + 1 ; j++) {\n // std::cout << ans[i][j] << (j + 1 == W - C + 1 ? '\\n' : ' ');\n // }\n // }\n}", "accuracy": 1, "time_ms": 400, "memory_kb": 7828, "score_of_the_acc": -0.202, "final_rank": 4 }, { "submission_id": "aoj_0463_9292266", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nstruct Mo {\nprivate:\n int n;\n vector<pair<int, int> > ij;\n\npublic:\n Mo(int n) : n(n) {}\n\n // ([0, i), [0, j))\n void insert(int i, int j){\n ij.emplace_back(i, j);\n }\n\n template<typename II, typename DI, typename IJ, typename DJ, typename O>\n void run(const II &inc_i, const DI &dec_i, const IJ &inc_j, const DJ &dec_j, const O &out){\n int q = (int) ij.size();\n int bs = n / min<int>(n, sqrt(q));\n vector<int> ord(q);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), [&](int a, int b){\n int ablock = ij[a].first / bs, bblock = ij[b].first / bs;\n if(ablock != bblock) return (ablock < bblock);\n if(ablock & 1) return (ij[a].second > ij[b].second);\n return (ij[a].second < ij[b].second);\n });\n int i = 0, j = 0;\n for(auto idx : ord){\n while(i < ij[idx].first) inc_i(i++, j);\n while(i > ij[idx].first) dec_i(--i, j);\n while(j < ij[idx].second) inc_j(i, j++);\n while(j > ij[idx].second) dec_j(i, --j);\n out(idx);\n }\n }\n};\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n int h, w, r, c, k;\n cin >> h >> w >> r >> c >> k;\n\n vector<vector<int> > a(h, vector<int>(w));\n vector<tuple<int, int, int> > cod_xy, cod_yx;\n vector<int> v;\n\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n cin >> a[i][j];\n v.emplace_back(a[i][j]);\n }\n }\n\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n\n int sq = 1;\n while (sq * sq < v.size()) sq++;\n\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n a[i][j] = lower_bound(v.begin(), v.end(), a[i][j]) - v.begin();\n cod_xy.emplace_back(i, j, a[i][j]);\n }\n }\n\n cod_xy.emplace_back(INT_MAX, INT_MAX, INT_MAX);\n cod_yx = cod_xy;\n\n for (auto &&[x, y, v] : cod_yx) swap(x, y);\n\n sort(cod_xy.begin(), cod_xy.end());\n sort(cod_yx.begin(), cod_yx.end());\n\n Mo mo(h * w);\n vector<int> sign;\n int q = 0;\n\n for (int i = r; i <= h; ++i) {\n for (int j = c; j <= w; ++j) {\n q++;\n int l = i - r, r = i, d = j - c, u = j;\n l = lower_bound(cod_xy.begin(), cod_xy.end(), tuple(l, 0, 0)) - cod_xy.begin();\n d = lower_bound(cod_yx.begin(), cod_yx.end(), tuple(d, 0, 0)) - cod_yx.begin();\n r = lower_bound(cod_xy.begin(), cod_xy.end(), tuple(r, 0, 0)) - cod_xy.begin();\n u = lower_bound(cod_yx.begin(), cod_yx.end(), tuple(u, 0, 0)) - cod_yx.begin();\n mo.insert(l, d);\n mo.insert(l, u);\n mo.insert(r, d);\n mo.insert(r, u);\n sign.emplace_back(1);\n sign.emplace_back(-1);\n sign.emplace_back(-1);\n sign.emplace_back(1);\n }\n }\n\n vector<int> re(q, 0), cnt(q);\n\n {\n // vector<vector<int> > memo(q, vector<int>(sq));\n vector memo(q, vector<int16_t>(sq));\n vector<int> seg(sq * sq);\n mo.run([&](int i, int j) {\n if (get<1>(cod_xy[i]) < get<0>(cod_yx[j])) {\n seg[get<2>(cod_xy[i]) / sq]++;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_xy[i]) < get<0>(cod_yx[j])) {\n seg[get<2>(cod_xy[i]) / sq]--;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_yx[j]) < get<0>(cod_xy[i])) {\n seg[get<2>(cod_yx[j]) / sq]++;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_yx[j]) < get<0>(cod_xy[i])) {\n seg[get<2>(cod_yx[j]) / sq]--;\n }\n }, [&](int i) {\n for (int j = 0; j < sq; ++j) {\n memo[i >> 2][j] += seg[j] * sign[i];\n }\n });\n for (int i = 0; i < q; ++i) {\n for (int j = 0; j < sq; ++j) {\n if ((cnt[i] + memo[i][j]) >= k) {\n re[i] = j * sq;\n break;\n }\n cnt[i] += memo[i][j];\n }\n }\n }\n\n {\n vector memo(q, vector<int16_t>(sq));\n vector<int> seg(sq * sq);\n mo.run([&](int i, int j) {\n if (get<1>(cod_xy[i]) < get<0>(cod_yx[j])) {\n seg[get<2>(cod_xy[i])]++;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_xy[i]) < get<0>(cod_yx[j])) {\n seg[get<2>(cod_xy[i])]--;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_yx[j]) < get<0>(cod_xy[i])) {\n seg[get<2>(cod_yx[j])]++;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_yx[j]) < get<0>(cod_xy[i])) {\n seg[get<2>(cod_yx[j])]--;\n }\n }, [&](int i) {\n for (int j = 0; j < sq; ++j) {\n memo[i >> 2][j] += seg[re[i >> 2] + j] * sign[i];\n }\n });\n for (int i = 0; i < q; ++i) {\n for (int j = 0; j < sq; ++j) {\n if ((cnt[i] += memo[i][j]) >= k) {\n re[i] = re[i] + j;\n break;\n }\n }\n }\n }\n\n vector<int> res;\n\n for (int i = 0; i < q; ++i) {\n res.emplace_back(v[re[i]]);\n }\n\n sort(res.begin(), res.end());\n\n for (auto e : res) {\n cout << e << '\\n';\n }\n\n return (0);\n}", "accuracy": 1, "time_ms": 960, "memory_kb": 153188, "score_of_the_acc": -1.0681, "final_rank": 13 }, { "submission_id": "aoj_0463_9279239", "code_snippet": "#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nstruct Mo {\nprivate:\n int n;\n vector<pair<int, int> > ij;\n\npublic:\n Mo(int n) : n(n) {}\n\n // ([0, i), [0, j))\n void insert(int i, int j){\n ij.emplace_back(i, j);\n }\n\n template<typename II, typename DI, typename IJ, typename DJ, typename O>\n void run(const II &inc_i, const DI &dec_i, const IJ &inc_j, const DJ &dec_j, const O &out){\n int q = (int) ij.size();\n int bs = n / min<int>(n, sqrt(q));\n vector<int> ord(q);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), [&](int a, int b){\n int ablock = ij[a].first / bs, bblock = ij[b].first / bs;\n if(ablock != bblock) return (ablock < bblock);\n if(ablock & 1) return (ij[a].second > ij[b].second);\n return (ij[a].second < ij[b].second);\n });\n int i = 0, j = 0;\n for(auto idx : ord){\n while(i < ij[idx].first) inc_i(i++, j);\n while(i > ij[idx].first) dec_i(--i, j);\n while(j < ij[idx].second) inc_j(i, j++);\n while(j > ij[idx].second) dec_j(i, --j);\n out(idx);\n }\n }\n};\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n int h, w, r, c, k;\n cin >> h >> w >> r >> c >> k;\n\n vector<vector<int> > a(h, vector<int>(w));\n vector<tuple<int, int, int> > cod_xy, cod_yx;\n vector<int> v;\n\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n cin >> a[i][j];\n v.emplace_back(a[i][j]);\n }\n }\n\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n\n int sq = 1;\n while (sq * sq < v.size()) sq++;\n\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n a[i][j] = lower_bound(v.begin(), v.end(), a[i][j]) - v.begin();\n cod_xy.emplace_back(i, j, a[i][j]);\n }\n }\n\n cod_xy.emplace_back(INT_MAX, INT_MAX, INT_MAX);\n cod_yx = cod_xy;\n\n for (auto &&[x, y, v] : cod_yx) swap(x, y);\n\n sort(cod_xy.begin(), cod_xy.end());\n sort(cod_yx.begin(), cod_yx.end());\n\n Mo mo(h * w);\n vector<int> sign;\n int q = 0;\n\n for (int i = r; i <= h; ++i) {\n for (int j = c; j <= w; ++j) {\n q++;\n int l = i - r, r = i, d = j - c, u = j;\n l = lower_bound(cod_xy.begin(), cod_xy.end(), tuple(l, 0, 0)) - cod_xy.begin();\n d = lower_bound(cod_yx.begin(), cod_yx.end(), tuple(d, 0, 0)) - cod_yx.begin();\n r = lower_bound(cod_xy.begin(), cod_xy.end(), tuple(r, 0, 0)) - cod_xy.begin();\n u = lower_bound(cod_yx.begin(), cod_yx.end(), tuple(u, 0, 0)) - cod_yx.begin();\n mo.insert(l, d);\n mo.insert(l, u);\n mo.insert(r, d);\n mo.insert(r, u);\n sign.emplace_back(1);\n sign.emplace_back(-1);\n sign.emplace_back(-1);\n sign.emplace_back(1);\n }\n }\n\n vector<int> re(q, 0), cnt(q);\n\n {\n // vector<vector<int> > memo(q, vector<int>(sq));\n vector memo(q, vector<int16_t>(sq));\n vector<int> seg(sq * sq);\n mo.run([&](int i, int j) {\n if (get<1>(cod_xy[i]) < get<0>(cod_yx[j])) {\n seg[get<2>(cod_xy[i]) / sq]++;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_xy[i]) < get<0>(cod_yx[j])) {\n seg[get<2>(cod_xy[i]) / sq]--;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_yx[j]) < get<0>(cod_xy[i])) {\n seg[get<2>(cod_yx[j]) / sq]++;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_yx[j]) < get<0>(cod_xy[i])) {\n seg[get<2>(cod_yx[j]) / sq]--;\n }\n }, [&](int i) {\n for (int j = 0; j < sq; ++j) {\n memo[i >> 2][j] += seg[j] * sign[i];\n }\n });\n for (int i = 0; i < q; ++i) {\n for (int j = 0; j < sq; ++j) {\n if ((cnt[i] + memo[i][j]) >= k) {\n re[i] = j * sq;\n break;\n }\n cnt[i] += memo[i][j];\n }\n }\n }\n\n {\n vector memo(q, vector<int16_t>(sq));\n vector<int> seg(sq * sq);\n mo.run([&](int i, int j) {\n if (get<1>(cod_xy[i]) < get<0>(cod_yx[j])) {\n seg[get<2>(cod_xy[i])]++;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_xy[i]) < get<0>(cod_yx[j])) {\n seg[get<2>(cod_xy[i])]--;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_yx[j]) < get<0>(cod_xy[i])) {\n seg[get<2>(cod_yx[j])]++;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_yx[j]) < get<0>(cod_xy[i])) {\n seg[get<2>(cod_yx[j])]--;\n }\n }, [&](int i) {\n for (int j = 0; j < sq; ++j) {\n memo[i >> 2][j] += seg[re[i >> 2] + j] * sign[i];\n }\n });\n for (int i = 0; i < q; ++i) {\n for (int j = 0; j < sq; ++j) {\n if ((cnt[i] += memo[i][j]) >= k) {\n re[i] = re[i] + j;\n break;\n }\n }\n }\n }\n\n vector<int> res;\n\n for (int i = 0; i < q; ++i) {\n res.emplace_back(v[re[i]]);\n }\n\n sort(res.begin(), res.end());\n\n for (auto e : res) {\n cout << e << '\\n';\n }\n\n return (0);\n}", "accuracy": 1, "time_ms": 690, "memory_kb": 152800, "score_of_the_acc": -0.9281, "final_rank": 10 }, { "submission_id": "aoj_0463_9279238", "code_snippet": "#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nstruct Mo {\nprivate:\n int n;\n vector<pair<int, int> > ij;\n\npublic:\n Mo(int n) : n(n) {}\n\n // ([0, i), [0, j))\n void insert(int i, int j){\n ij.emplace_back(i, j);\n }\n\n template<typename II, typename DI, typename IJ, typename DJ, typename O>\n void run(const II &inc_i, const DI &dec_i, const IJ &inc_j, const DJ &dec_j, const O &out){\n int q = (int) ij.size();\n int bs = n / min<int>(n, sqrt(q));\n vector<int> ord(q);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), [&](int a, int b){\n int ablock = ij[a].first / bs, bblock = ij[b].first / bs;\n if(ablock != bblock) return (ablock < bblock);\n if(ablock & 1) return (ij[a].second > ij[b].second);\n return (ij[a].second < ij[b].second);\n });\n int i = 0, j = 0;\n for(auto idx : ord){\n while(i < ij[idx].first) inc_i(i++, j);\n while(i > ij[idx].first) dec_i(--i, j);\n while(j < ij[idx].second) inc_j(i, j++);\n while(j > ij[idx].second) dec_j(i, --j);\n out(idx);\n }\n }\n};\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n int h, w, r, c, k;\n cin >> h >> w >> r >> c >> k;\n\n vector<vector<int> > a(h, vector<int>(w));\n vector<tuple<int, int, int> > cod_xy, cod_yx;\n vector<int> v;\n\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n cin >> a[i][j];\n v.emplace_back(a[i][j]);\n }\n }\n\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n\n int sq = 1;\n while (sq * sq < v.size()) sq++;\n\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n a[i][j] = lower_bound(v.begin(), v.end(), a[i][j]) - v.begin();\n cod_xy.emplace_back(i, j, a[i][j]);\n }\n }\n\n cod_xy.emplace_back(INT_MAX, INT_MAX, INT_MAX);\n cod_yx = cod_xy;\n\n for (auto &&[x, y, v] : cod_yx) swap(x, y);\n\n sort(cod_xy.begin(), cod_xy.end());\n sort(cod_yx.begin(), cod_yx.end());\n\n Mo mo(h * w);\n vector<int> sign;\n int q = 0;\n\n for (int i = r; i <= h; ++i) {\n for (int j = c; j <= w; ++j) {\n q++;\n int l = i - r, r = i, d = j - c, u = j;\n l = lower_bound(cod_xy.begin(), cod_xy.end(), tuple(l, 0, 0)) - cod_xy.begin();\n d = lower_bound(cod_yx.begin(), cod_yx.end(), tuple(d, 0, 0)) - cod_yx.begin();\n r = lower_bound(cod_xy.begin(), cod_xy.end(), tuple(r, 0, 0)) - cod_xy.begin();\n u = lower_bound(cod_yx.begin(), cod_yx.end(), tuple(u, 0, 0)) - cod_yx.begin();\n mo.insert(l, d);\n mo.insert(l, u);\n mo.insert(r, d);\n mo.insert(r, u);\n sign.emplace_back(1);\n sign.emplace_back(-1);\n sign.emplace_back(-1);\n sign.emplace_back(1);\n }\n }\n\n vector<int> re(q, 0), cnt(q);\n\n {\n // vector<vector<int> > memo(q, vector<int>(sq));\n vector memo(q, vector<int16_t>(sq));\n vector<int> seg(sq * sq);\n mo.run([&](int i, int j) {\n if (get<1>(cod_xy[i]) < get<0>(cod_yx[j])) {\n seg[get<2>(cod_xy[i]) / sq]++;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_xy[i]) < get<0>(cod_yx[j])) {\n seg[get<2>(cod_xy[i]) / sq]--;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_yx[j]) < get<0>(cod_xy[i])) {\n seg[get<2>(cod_yx[j]) / sq]++;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_yx[j]) < get<0>(cod_xy[i])) {\n seg[get<2>(cod_yx[j]) / sq]--;\n }\n }, [&](int i) {\n for (int j = 0; j < sq; ++j) {\n memo[i >> 2][j] += seg[j] * sign[i];\n }\n });\n for (int i = 0; i < q; ++i) {\n for (int j = 0; j < sq; ++j) {\n if ((cnt[i] + memo[i][j]) >= k) {\n re[i] = j * sq;\n break;\n }\n cnt[i] += memo[i][j];\n }\n }\n }\n\n {\n vector memo(q, vector<int16_t>(sq));\n vector<int> seg(sq * sq);\n mo.run([&](int i, int j) {\n if (get<1>(cod_xy[i]) < get<0>(cod_yx[j])) {\n seg[get<2>(cod_xy[i])]++;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_xy[i]) < get<0>(cod_yx[j])) {\n seg[get<2>(cod_xy[i])]--;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_yx[j]) < get<0>(cod_xy[i])) {\n seg[get<2>(cod_yx[j])]++;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_yx[j]) < get<0>(cod_xy[i])) {\n seg[get<2>(cod_yx[j])]--;\n }\n }, [&](int i) {\n for (int j = 0; j < sq; ++j) {\n memo[i >> 2][j] += seg[re[i >> 2] + j] * sign[i];\n }\n });\n for (int i = 0; i < q; ++i) {\n for (int j = 0; j < sq; ++j) {\n if ((cnt[i] += memo[i][j]) >= k) {\n re[i] = re[i] + j;\n break;\n }\n }\n }\n }\n\n vector<int> res;\n\n for (int i = 0; i < q; ++i) {\n res.emplace_back(v[re[i]]);\n }\n\n sort(res.begin(), res.end());\n\n for (auto e : res) {\n cout << e << '\\n';\n }\n\n return (0);\n}", "accuracy": 1, "time_ms": 810, "memory_kb": 153032, "score_of_the_acc": -0.9906, "final_rank": 11 }, { "submission_id": "aoj_0463_9279234", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\n\nstruct Mo {\nprivate:\n int n;\n vector<pair<int, int> > ij;\n\npublic:\n Mo(int n) : n(n) {}\n\n // ([0, i), [0, j))\n void insert(int i, int j){\n ij.emplace_back(i, j);\n }\n\n template<typename II, typename DI, typename IJ, typename DJ, typename O>\n void run(const II &inc_i, const DI &dec_i, const IJ &inc_j, const DJ &dec_j, const O &out){\n int q = (int) ij.size();\n int bs = n / min<int>(n, sqrt(q));\n vector<int> ord(q);\n iota(ord.begin(), ord.end(), 0);\n sort(ord.begin(), ord.end(), [&](int a, int b){\n int ablock = ij[a].first / bs, bblock = ij[b].first / bs;\n if(ablock != bblock) return (ablock < bblock);\n if(ablock & 1) return (ij[a].second > ij[b].second);\n return (ij[a].second < ij[b].second);\n });\n int i = 0, j = 0;\n for(auto idx : ord){\n while(i < ij[idx].first) inc_i(i++, j);\n while(i > ij[idx].first) dec_i(--i, j);\n while(j < ij[idx].second) inc_j(i, j++);\n while(j > ij[idx].second) dec_j(i, --j);\n out(idx);\n }\n }\n};\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n int h, w, r, c, k;\n cin >> h >> w >> r >> c >> k;\n\n vector<vector<int> > a(h, vector<int>(w));\n vector<tuple<int, int, int> > cod_xy, cod_yx;\n vector<int> v;\n\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n cin >> a[i][j];\n v.emplace_back(a[i][j]);\n }\n }\n\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n\n int sq = 1;\n while (sq * sq < v.size()) sq++;\n\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n a[i][j] = lower_bound(v.begin(), v.end(), a[i][j]) - v.begin();\n cod_xy.emplace_back(i, j, a[i][j]);\n }\n }\n\n cod_xy.emplace_back(INT_MAX, INT_MAX, INT_MAX);\n cod_yx = cod_xy;\n\n for (auto &&[x, y, v] : cod_yx) swap(x, y);\n\n sort(cod_xy.begin(), cod_xy.end());\n sort(cod_yx.begin(), cod_yx.end());\n\n Mo mo(h * w);\n vector<int> sign;\n int q = 0;\n\n for (int i = r; i <= h; ++i) {\n for (int j = c; j <= w; ++j) {\n q++;\n int l = i - r, r = i, d = j - c, u = j;\n l = lower_bound(cod_xy.begin(), cod_xy.end(), tuple(l, 0, 0)) - cod_xy.begin();\n d = lower_bound(cod_yx.begin(), cod_yx.end(), tuple(d, 0, 0)) - cod_yx.begin();\n r = lower_bound(cod_xy.begin(), cod_xy.end(), tuple(r, 0, 0)) - cod_xy.begin();\n u = lower_bound(cod_yx.begin(), cod_yx.end(), tuple(u, 0, 0)) - cod_yx.begin();\n mo.insert(l, d);\n mo.insert(l, u);\n mo.insert(r, d);\n mo.insert(r, u);\n sign.emplace_back(1);\n sign.emplace_back(-1);\n sign.emplace_back(-1);\n sign.emplace_back(1);\n }\n }\n\n vector<int> re(q, 0), cnt(q);\n\n {\n // vector<vector<int> > memo(q, vector<int>(sq));\n vector memo(q, vector<int16_t>(sq));\n vector<int> seg(sq * sq);\n mo.run([&](int i, int j) {\n if (get<1>(cod_xy[i]) < get<0>(cod_yx[j])) {\n seg[get<2>(cod_xy[i]) / sq]++;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_xy[i]) < get<0>(cod_yx[j])) {\n seg[get<2>(cod_xy[i]) / sq]--;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_yx[j]) < get<0>(cod_xy[i])) {\n seg[get<2>(cod_yx[j]) / sq]++;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_yx[j]) < get<0>(cod_xy[i])) {\n seg[get<2>(cod_yx[j]) / sq]--;\n }\n }, [&](int i) {\n for (int j = 0; j < sq; ++j) {\n memo[i >> 2][j] += seg[j] * sign[i];\n }\n });\n for (int i = 0; i < q; ++i) {\n for (int j = 0; j < sq; ++j) {\n if ((cnt[i] + memo[i][j]) >= k) {\n re[i] = j * sq;\n break;\n }\n cnt[i] += memo[i][j];\n }\n }\n }\n\n {\n vector memo(q, vector<int16_t>(sq));\n vector<int> seg(sq * sq);\n mo.run([&](int i, int j) {\n if (get<1>(cod_xy[i]) < get<0>(cod_yx[j])) {\n seg[get<2>(cod_xy[i])]++;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_xy[i]) < get<0>(cod_yx[j])) {\n seg[get<2>(cod_xy[i])]--;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_yx[j]) < get<0>(cod_xy[i])) {\n seg[get<2>(cod_yx[j])]++;\n }\n }, [&](int i, int j) {\n if (get<1>(cod_yx[j]) < get<0>(cod_xy[i])) {\n seg[get<2>(cod_yx[j])]--;\n }\n }, [&](int i) {\n for (int j = 0; j < sq; ++j) {\n memo[i >> 2][j] += seg[re[i >> 2] + j] * sign[i];\n }\n });\n for (int i = 0; i < q; ++i) {\n for (int j = 0; j < sq; ++j) {\n if ((cnt[i] += memo[i][j]) >= k) {\n re[i] = re[i] + j;\n break;\n }\n }\n }\n }\n\n vector<int> res;\n\n for (int i = 0; i < q; ++i) {\n res.emplace_back(v[re[i]]);\n }\n\n sort(res.begin(), res.end());\n\n for (auto e : res) {\n cout << e << '\\n';\n }\n\n return (0);\n}", "accuracy": 1, "time_ms": 930, "memory_kb": 154640, "score_of_the_acc": -1.0585, "final_rank": 12 }, { "submission_id": "aoj_0463_8709170", "code_snippet": "#include <bits/stdc++.h>\n\nstruct Compressor {\n std::vector<int> data;\n Compressor() {}\n void add(int val) {\n data.push_back(val);\n }\n void build() {\n std::sort(data.begin(), data.end());\n data.erase(std::unique(data.begin(), data.end()), data.end());\n }\n int compress(int val) {\n return std::lower_bound(data.begin(), data.end(), val) - data.begin();\n }\n int decompress(int pos) {\n return data[pos];\n }\n int size() {\n return data.size();\n }\n};\n\nstruct SegmentTree {\n std::vector<int> data;\n int size;\n SegmentTree(int n) {\n int log = 0;\n while (n > (1 << log)) log++;\n size = 1 << log;\n data.resize(2 * size);\n }\n void add(int pos, int diff) {\n pos += size;\n data[pos] += diff;\n for (pos >>= 1; pos > 0; pos >>= 1) {\n data[pos] = data[2 * pos] + data[2 * pos + 1];\n }\n }\n int kth_element(int k) {\n int pos = 1;\n int now = 0;\n while (pos < size) {\n if (now + data[2 * pos] < k) {\n now += data[2 * pos];\n pos = 2 * pos + 1;\n } else {\n pos = 2 * pos;\n }\n }\n assert(now < k);\n assert(now + data[pos] >= k);\n return pos - size;\n }\n void clear() {\n data.assign(2 * size, 0);\n }\n};\n\nvoid test() {\n SegmentTree segtree(10);\n segtree.add(0, 1);\n segtree.add(3, 1);\n segtree.add(7, 1);\n std::cout << segtree.kth_element(1) << '\\n';\n std::cout << segtree.kth_element(2) << '\\n';\n std::cout << segtree.kth_element(3) << '\\n';\n}\n\nint main() {\n int h, w, r, c;\n std::cin >> h >> w >> r >> c;\n int k;\n std::cin >> k;\n std::vector a(h, std::vector<int>(w));\n Compressor compressor;\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n std::cin >> a[i][j];\n compressor.add(a[i][j]);\n }\n }\n compressor.build();\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n a[i][j] = compressor.compress(a[i][j]);\n }\n }\n std::vector<int> ans;\n SegmentTree segtree(compressor.size());\n for (int i = 0; i + r <= h; i++) {\n int right = 0;\n segtree.clear();\n for (int left = 0; left + c <= w; left++) {\n while (right < left + c) {\n for (int j = 0; j < r; j++) {\n segtree.add(a[i + j][right], 1);\n }\n right++;\n }\n ans.push_back(compressor.decompress(segtree.kth_element(k)));\n for (int j = 0; j < r; j++) {\n segtree.add(a[i + j][left], -1);\n }\n }\n }\n std::sort(ans.begin(), ans.end());\n for (auto v: ans) {\n std::cout << v << '\\n';\n }\n}", "accuracy": 1, "time_ms": 630, "memory_kb": 7964, "score_of_the_acc": -0.3205, "final_rank": 6 } ]
aoj_0464_cpp
Rotating Mass Game A special feature of the Idua High School Sports Festival is the rotating mass game. In this game, the students rotate and turn their bodies in response to the teacher's command. The students move in unison, which is very cool. The $N$ students participating in the mass game are numbered from 1 to $N$. At the beginning, the $N$ students are lined up in a row from east to west in order of number from 1 to $N$, and all students stand facing north. The teacher instructs the students how many turns to make. The teacher shouts out three numbers, a, b, and c, and the students from a to b turn their bodies in unison according to the value of c. c is an integer, and if it is positive, the student turns left, and if it is negative, the student turns right, and he/she turns a quarter of a turn for every 1 of the number. For example, if the number is 1, the student turns a quarter turn to the left, if the number is -2, the student turns half a turn to the right, if the number is 4, the student turns one turn to the left, and if the number is -6, the student turns one and a half turns to the right. The teacher in charge of issuing the instruction received a query from the principal who wanted to know the number of students facing north minus the number of students facing south in a specified range of numbers immediately after the instruction at several points in time. I have the notes of the history of the order at hand, so I should be able to write a program to determine the number of students I want to know at any point in time. Given the teacher's order and the information about the inquiries from the principal, create a program to find the number of students facing north minus the number of students facing south for each inquiry. Input Input is given in the following format. $N$ $M$ $info_1$ $info_2$ : $info_M$ In the first line, the number of students who participated in the mass game $N$ ($1 \leq N \leq 300,000$) and the number of information about the order and query $M$ ($1 \leq M \leq 100,000$) are given. In the following $M$ line, the information $info_i$ about the order and query is given. The information is arranged in chronological order. Each $info_i$ is given in one of the following formats. 1 $a$ $b$ $c$ or 2 $d$ $e$ 1 $a$ $b$ $c$ denotes the order that the students from the $a$th to the $b$th should rotate according to the number $c$. However, $1 \leq a \leq b \leq N$ and $-1,000 \leq c \leq 1000$. 2 $d$ $e$ denotes the query of how many students from the $d$th to the $e$th are facing north minus the number of students facing south immediately after the preceding issue. However, $1 \leq d \leq e \leq N$. One or more pieces of information about the query will be given. Output For each query, output the number of students facing north minus the number of students facing south on a single line. Sample Input and Output Sample Input 5 5 2 1 5 1 1 2 2 2 1 5 1 2 5 -1 2 1 5 Sample Output 5 1 -1
[ { "submission_id": "aoj_0464_11031261", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)\n\ntemplate<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id>\nstruct LazySegTree {\n\tint N, height, size;\n\tvector<S> data;\n\tvector<F> lazy;\n\t\n\tLazySegTree(const vector<S> &v) : N(v.size()) {\n\t\tsize = 1, height = 0;\n\t\twhile (size < N) size <<= 1, ++height;\n\t\tdata = vector<S>(2*size, e());\n\t\tlazy = vector<F>(2*size, id());\n\t\tfor (int i = 0; i < N; ++i) data[size + i] = v[i];\n\t\tfor (int i = size - 1; i >= 1; --i) update(i);\n\t}\n\t\n\tvoid update(int i) {\n\t\tdata[i] = op(data[2*i], data[2*i + 1]);\n\t}\n\t\n\tvoid all_apply(int i, F f) {\n\t\tdata[i] = mapping(f, data[i]);\n\t\tif (i < size) lazy[i] = composition(f, lazy[i]);\n\t}\n\t\n\tvoid push(int i) {\n\t\tall_apply(2*i, lazy[i]);\n\t\tall_apply(2*i + 1, lazy[i]);\n\t\tlazy[i] = id();\n\t}\n\t\n\tS prod(int l, int r) {\n\t\tif (l == r) return e();\n\t\tl += size, r += size;\n\t\tfor (int i = height; i >= 1; --i) {\n\t\t\tif (((l >> i) << i) != l) push(l >> i);\n\t\t\tif (((r >> i) << i) != r) push((r - 1) >> i);\n\t\t}\n\t\tS vl = e(), vr = e();\n\t\tfor (int a = l, b = r; a < b; a >>= 1, b >>= 1) {\n\t\t\tif (a & 1) vl = op(vl, data[a++]);\n\t\t\tif (b & 1) vr = op(data[--b], vr);\n\t\t}\n\t\treturn op(vl, vr);\n\t}\n\t\n\tvoid apply(int l, int r, F f) {\n\t\tif (l == r) return;\n\t\tl += size, r += size;\n\t\tfor (int i = height; i >= 1; --i) {\n\t\t\tif (((l >> i) << i) != l) push(l >> i);\n\t\t\tif (((r >> i) << i) != r) push((r - 1) >> i);\n\t\t}\n\t\tfor (int a = l, b = r; a < b; a >>= 1, b >>= 1) {\n\t\t\tif (a & 1) all_apply(a++, f);\n\t\t\tif (b & 1) all_apply(--b, f);\n\t\t}\n\t\tfor (int i = 1; i <= height; ++i) {\n\t\t\tif (((l >> i) << i) != l) update(l >> i);\n\t\t\tif (((r >> i) << i) != r) update((r - 1) >> i);\n\t\t}\n\t}\n};\n\nusing S = vector<int>;\nusing F = ll;\n\nS op(S &a, S &b) {\n\tS res(4);\n\trep(i, 0, 4) res[i] = a[i] + b[i];\n\treturn res;\n}\nS e() { return {0, 0, 0, 0}; }\nS mapping(F f, S &x) {\n\tf = (f % 4 + 4) % 4;\n\tS res(4);\n\trep(i, 0, 4) res[i] = x[(i + f) % 4];\n\treturn res;\n}\nF composition(F f, F g) { return f + g; }\nF id() { return 0; }\n\nint main() {\n\tcin.tie(nullptr);\n\tios_base::sync_with_stdio(false);\n\t\n\tint N, M;\n\tcin >> N >> M;\n\t\n\tvector<S> vec(N);\n\trep(i, 0, N) vec[i] = {1, 0, 0, 0};\n\tLazySegTree<S, op, e, F, mapping, composition, id> seg(vec);\n\t\n\trep(query, 0, M) {\n\t\tint ord;\n\t\tcin >> ord;\n\t\t\n\t\tif (ord == 1) {\n\t\t\tint a, b, c;\n\t\t\tcin >> a >> b >> c;\n\t\t\t--a, --b;\n\t\t\tseg.apply(a, b + 1, (ll)c);\n\t\t} else {\n\t\t\tint d, e;\n\t\t\tcin >> d >> e;\n\t\t\t--d, --e;\n\t\t\tS res = seg.prod(d, e + 1);\n\t\t\tcout << res[0] - res[2] << '\\n';\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 340, "memory_kb": 85144, "score_of_the_acc": -1.3333, "final_rank": 19 }, { "submission_id": "aoj_0464_10873433", "code_snippet": "#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <typename T, typename E>\nstruct LazySegmentTree {\n using F = function<T(T, T)>;\n using G = function<T(T, E)>;\n using H = function<E(E, E)>;\n\n int n, height;\n vector<T> tree;\n vector<E> lazy;\n const F f;\n const G g;\n const H h;\n const T ti;\n const E ei;\n\n LazySegmentTree() {}\n LazySegmentTree(F f, G g, H h, T ti, E ei)\n : f(f), g(g), h(h), ti(ti), ei(ei) {}\n\n void init(int n_) {\n n = 1, height = 0;\n while (n < n_) n *= 2, ++height;\n\n tree.assign(2 * n, ti);\n lazy.assign(2 * n, ei);\n }\n\n void build(const vector<T>& v) {\n int n_ = v.size();\n init(n_);\n for (int i = 0; i < n_; ++i) tree[n + i] = v[i];\n for (int i = n - 1; i > 0; i--)\n tree[i] = f(tree[2 * i], tree[2 * i + 1]);\n }\n\n inline T reflect(int k) {\n return (lazy[k] == ei ? tree[k] : g(tree[k], lazy[k]));\n }\n\n inline void eval(int k) {\n if (lazy[k] == ei) return;\n lazy[2 * k] = h(lazy[2 * k], lazy[k]);\n lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);\n tree[k] = reflect(k);\n lazy[k] = ei;\n }\n\n inline void thrust(int k) {\n for (int i = height; i > 0; --i) eval(k >> i);\n }\n\n inline void recalc(int k) {\n while (k >>= 1) tree[k] = f(reflect(2 * k), reflect(2 * k + 1));\n }\n\n void update(int s, int t, const E& x) {\n s += n, t += n;\n thrust(s), thrust(t - 1);\n int l = s, r = t;\n while (l < r) {\n if (l & 1) lazy[l] = h(lazy[l], x), ++l;\n if (r & 1) --r, lazy[r] = h(lazy[r], x);\n l >>= 1, r >>= 1;\n }\n recalc(s), recalc(t - 1);\n }\n\n T find(int s, int t) {\n s += n, t += n;\n thrust(s), thrust(t - 1);\n int l = s, r = t;\n T ll = ti, rr = ti;\n while (l < r) {\n if (l & 1) ll = f(ll, reflect(l++));\n if (r & 1) rr = f(rr, reflect(--r));\n l >>= 1, r >>= 1;\n }\n return f(ll, rr);\n }\n\n T at(int i) { return find(i, i + 1); }\n};\n\nconstexpr int BIG_INT = 1'000'000'100;\nconstexpr long BIG_LONG = 1'000'000'000'000'000'100;\n\nstruct S {\n int a, b, c, d;\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n auto f = [](S a, S b) {\n return S{a.a + b.a, a.b + b.b, a.c + b.c, a.d + b.d};\n };\n auto g = [](S a, int x) {\n for (int i = 0; i < x; i++) {\n a = S{a.b, a.c, a.d, a.a};\n }\n return a;\n };\n auto h = [](int x, int y) { return (x + y) % 4; };\n LazySegmentTree<S, int> sg(f, g, h, S{0, 0, 0, 0}, 0);\n\n int n, m;\n cin >> n >> m;\n sg.build(vector(n, S{1, 0, 0, 0}));\n while (m--) {\n int qn;\n cin >> qn;\n if (qn == 1) {\n int a, b, c;\n cin >> a >> b >> c;\n a--;\n sg.update(a, b, (c + 4000) % 4);\n } else {\n int d, e;\n cin >> d >> e;\n d--;\n auto [A, B, C, D] = sg.find(d, e);\n cout << A - C << '\\n';\n }\n }\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 28320, "score_of_the_acc": -0.3435, "final_rank": 9 }, { "submission_id": "aoj_0464_10873431", "code_snippet": "#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\n\n#ifndef ATCODER_LAZYSEGTREE_HPP\n#define ATCODER_LAZYSEGTREE_HPP 1\n\n#include <algorithm>\n#include <cassert>\n#include <functional>\n#include <vector>\n\n#ifndef ATCODER_INTERNAL_BITOP_HPP\n#define ATCODER_INTERNAL_BITOP_HPP 1\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\n#if __cplusplus >= 202002L\n#include <bit>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n#if __cplusplus >= 202002L\n\nusing std::bit_ceil;\n\n#else\n\n// @return same with std::bit::bit_ceil\nunsigned int bit_ceil(unsigned int n) {\n unsigned int x = 1;\n while (x < (unsigned int)(n)) x *= 2;\n return x;\n}\n\n#endif\n\n// @param n `1 <= n`\n// @return same with std::bit::countr_zero\nint countr_zero(unsigned int n) {\n#ifdef _MSC_VER\n unsigned long index;\n _BitScanForward(&index, n);\n return index;\n#else\n return __builtin_ctz(n);\n#endif\n}\n\n// @param n `1 <= n`\n// @return same with std::bit::countr_zero\nconstexpr int countr_zero_constexpr(unsigned int n) {\n int x = 0;\n while (!(n & (1 << x))) x++;\n return x;\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n#endif // ATCODER_INTERNAL_BITOP_HPP\n\nnamespace atcoder {\n\n#if __cplusplus >= 201703L\n\ntemplate <class S, auto op, auto e, class F, auto mapping, auto composition,\n auto id>\nstruct lazy_segtree {\n static_assert(std::is_convertible_v<decltype(op), std::function<S(S, S)>>,\n \"op must work as S(S, S)\");\n static_assert(std::is_convertible_v<decltype(e), std::function<S()>>,\n \"e must work as S()\");\n static_assert(\n std::is_convertible_v<decltype(mapping), std::function<S(F, S)>>,\n \"mapping must work as S(F, S)\");\n static_assert(\n std::is_convertible_v<decltype(composition), std::function<F(F, F)>>,\n \"composition must work as F(F, F)\");\n static_assert(std::is_convertible_v<decltype(id), std::function<F()>>,\n \"id must work as F()\");\n\n#else\n\ntemplate <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S),\n F (*composition)(F, F), F (*id)()>\nstruct lazy_segtree {\n\n#endif\n\n public:\n lazy_segtree() : lazy_segtree(0) {}\n explicit lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}\n explicit lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {\n size = (int)internal::bit_ceil((unsigned int)(_n));\n log = internal::countr_zero((unsigned int)size);\n d = std::vector<S>(2 * size, e());\n lz = std::vector<F>(size, id());\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) {\n update(i);\n }\n }\n\n void set(int p, S x) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n\n S get(int p) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n return d[p];\n }\n\n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return e();\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n S sml = e(), smr = e();\n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n\n return op(sml, smr);\n }\n\n S all_prod() { return d[1]; }\n\n void apply(int p, F f) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = mapping(f, d[p]);\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n void apply(int l, int r, F f) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return;\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n {\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) all_apply(l++, f);\n if (r & 1) all_apply(--r, f);\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n }\n\n for (int i = 1; i <= log; i++) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n\n template <bool (*g)(S)>\n int max_right(int l) {\n return max_right(l, [](S x) { return g(x); });\n }\n template <class G>\n int max_right(int l, G g) {\n assert(0 <= l && l <= _n);\n assert(g(e()));\n if (l == _n) return _n;\n l += size;\n for (int i = log; i >= 1; i--) push(l >> i);\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!g(op(sm, d[l]))) {\n while (l < size) {\n push(l);\n l = (2 * l);\n if (g(op(sm, d[l]))) {\n sm = op(sm, d[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = op(sm, d[l]);\n l++;\n } while ((l & -l) != l);\n return _n;\n }\n\n template <bool (*g)(S)>\n int min_left(int r) {\n return min_left(r, [](S x) { return g(x); });\n }\n template <class G>\n int min_left(int r, G g) {\n assert(0 <= r && r <= _n);\n assert(g(e()));\n if (r == 0) return 0;\n r += size;\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!g(op(d[r], sm))) {\n while (r < size) {\n push(r);\n r = (2 * r + 1);\n if (g(op(d[r], sm))) {\n sm = op(d[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = op(d[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n\n private:\n int _n, size, log;\n std::vector<S> d;\n std::vector<F> lz;\n\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n void all_apply(int k, F f) {\n d[k] = mapping(f, d[k]);\n if (k < size) lz[k] = composition(f, lz[k]);\n }\n void push(int k) {\n all_apply(2 * k, lz[k]);\n all_apply(2 * k + 1, lz[k]);\n lz[k] = id();\n }\n};\n\n} // namespace atcoder\n\n#endif // ATCODER_LAZYSEGTREE_HPP\n\nconstexpr int BIG_INT = 1'000'000'100;\nconstexpr long BIG_LONG = 1'000'000'000'000'000'100;\n\nstruct S {\n int a, b, c, d;\n};\n\nS op(S a, S b) { return S{a.a + b.a, a.b + b.b, a.c + b.c, a.d + b.d}; }\nS e() { return {0, 0, 0, 0}; }\nusing F = int;\nS mapping(F f, S x) {\n for (int i = 0; i < f; i++) {\n x = {x.b, x.c, x.d, x.a};\n }\n return x;\n}\nF composition(F f, F g) { return (f + g) % 4; }\nF id() { return 0; }\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int n, m;\n cin >> n >> m;\n atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> sg(\n vector(n, S{1, 0, 0, 0}));\n while (m--) {\n int qn;\n cin >> qn;\n if (qn == 1) {\n int a, b, c;\n cin >> a >> b >> c;\n a--;\n sg.apply(a, b, (c + 4000) % 4);\n } else {\n int d, e;\n cin >> d >> e;\n d--;\n auto [A, B, C, D] = sg.prod(d, e);\n cout << A - C << '\\n';\n }\n }\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 26276, "score_of_the_acc": -0.2825, "final_rank": 6 }, { "submission_id": "aoj_0464_10869759", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define ll long long\nconst long long mod=998244353;\nconst long long hmod=46216567629137;\nstruct S{\n int n,e,s,w;\n};\nusing F=ll;\nconst F ID=0;\nS e(){//Sの単位元\n S res;\n res.n=0;\n res.e=0;\n res.s=0;\n res.w=0;\n return res;\n}\nF id(){//Fの単位元\n return ID;\n}\nS op(S a,S b){//Sの結合\n S res;\n res.n=a.n+b.n;\n res.e=a.e+b.e;\n res.s=a.s+b.s;\n res.w=a.w+b.w;\n return res;\n}\nS mapping(F f,S x){//Sに遅延伝播をかける\n f%=4;\n if(f<0) f+=4;\n S res;\n if(f==0){\n res=x;\n }\n if(f==1){\n res.n=x.e;\n res.e=x.s;\n res.s=x.w;\n res.w=x.n;\n }\n if(f==2){\n res.n=x.s;\n res.e=x.w;\n res.s=x.n;\n res.w=x.e;\n }\n if(f==3){\n res.n=x.w;\n res.e=x.n;\n res.s=x.e;\n res.w=x.s;\n }\n return res;\n}\nF composition(F f,F g){//lazy同士の合成(gにfの操作をする)\n F res=(f+g)%4;\n if(res<0) res+=4;\n return res;\n}\nclass lazysegtree{\n public:\n S dat[1200009];\n F lazy[1200009];\n ll siz;\n lazysegtree(ll N){\n siz=1;\n while(siz<N) siz*=2;\n for(ll i=1;i<siz*2;i++){\n dat[i]=e();\n lazy[i]=id();\n }\n }\n\n S prod(int l,int r,int a,int b,int u){\n if(b<=l || r<=a)return e();\n if(l<=a && b<=r){\n return dat[u];\n }\n int m=(a+b)/2;\n S L=mapping(lazy[u],prod(l,r,a,m,u*2));\n S R=mapping(lazy[u],prod(l,r,m,b,u*2+1));\n return op(L,R);\n }\n S prod(int l,int r){\n return prod(l,r,1,siz+1,1);\n }\n S all_prod(){\n return prod(1,siz+1,1,siz+1,1);\n }\n S get(int p){\n return prod(p,p+1,1,siz+1,1);\n }\n void apply(int l,int r,int a,int b,int u,F f){\n if(b<=l || r<=a) return;\n if(l<=a && b<=r){\n lazy[u]=composition(f,lazy[u]);\n dat[u]=mapping(f,dat[u]);\n return;\n }\n lazy[u*2]=composition(lazy[u],lazy[u*2]);\n lazy[u*2+1]=composition(lazy[u],lazy[u*2+1]);\n dat[u*2]=mapping(lazy[u],dat[u*2]);\n dat[u*2+1]=mapping(lazy[u],dat[u*2+1]);\n lazy[u]=id();\n int m=(a+b)/2;\n apply(l,r,a,m,u*2,f);\n apply(l,r,m,b,u*2+1,f);\n S L=mapping(lazy[u],dat[u*2]);\n S R=mapping(lazy[u],dat[u*2+1]);\n dat[u]=op(L,R);\n return;\n }\n\n void apply(int p,F f){\n apply(p,p+1,1,siz+1,1,f);\n }\n void apply(int l,int r,F f){\n apply(l,r,1,siz+1,1,f);\n }\n void set(int p,S x){\n p=p+siz-1;\n dat[p]=x;\n while(p>=2){\n p/=2;\n dat[p]=op(dat[p*2],dat[p*2+1]);\n }\n return;\n }\n};\nint main(){\n cin.tie(0)->sync_with_stdio(0);\n cout.tie(0);\n int N,M;\n cin>>N>>M;\n lazysegtree seg(N);\n for(int i=1;i<=N;i++){\n S d={1,0,0,0};\n seg.set(i,d);\n }\n for(int z=1;z<=M;z++){\n int query;\n cin>>query;\n if(query==1){\n int a,b,c;\n cin>>a>>b>>c;\n c%=4;\n if(c<0) c+=4;\n seg.apply(a,b+1,c);\n }\n if(query==2){\n int d,e;\n cin>>d>>e;\n S dat=seg.prod(d,e+1);\n cout<<dat.n-dat.s<<\"\\n\";\n }\n }\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 31120, "score_of_the_acc": -0.3782, "final_rank": 11 }, { "submission_id": "aoj_0464_10844315", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n// #include<atcoder/all>\n// using mint = atcoder::modint998244353;\nusing ld = long double;\n#define fi first\n#define se second\n#define all(x) x.begin(),x.end()\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\ntemplate<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}\ntemplate<typename T>bool chmax(T&a,T b){return b>a?(a=b,1):0;}\n\n\ntemplate <class S, \n S (*op)(S, S), \n S (*e)(), \n class F, \n S (*mapping)(F, S), \n F (*composition)(F, F), \n F (*id)()>\nstruct lazy_segtree {\n public:\n lazy_segtree() : lazy_segtree(0) {}\n explicit lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}\n explicit lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {\n size = (int)bit_ceil(_n);\n log = countr_zero(size);\n d = std::vector<S>(2 * size, e());\n lz = std::vector<F>(size, id());\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) {\n update(i);\n }\n }\n\n void set(int p, S x) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n\n S get(int p) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n return d[p];\n }\n\n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return e();\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n S sml = e(), smr = e();\n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n\n return op(sml, smr);\n }\n\n S all_prod() { return d[1]; }\n\n void apply(int p, F f) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = mapping(f, d[p]);\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n void apply(int l, int r, F f) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return;\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n {\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) all_apply(l++, f);\n if (r & 1) all_apply(--r, f);\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n }\n\n for (int i = 1; i <= log; i++) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n\n template <bool (*g)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return g(x); });\n }\n template <class G> int max_right(int l, G g) {\n assert(0 <= l && l <= _n);\n assert(g(e()));\n if (l == _n) return _n;\n l += size;\n for (int i = log; i >= 1; i--) push(l >> i);\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!g(op(sm, d[l]))) {\n while (l < size) {\n push(l);\n l = (2 * l);\n if (g(op(sm, d[l]))) {\n sm = op(sm, d[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = op(sm, d[l]);\n l++;\n } while ((l & -l) != l);\n return _n;\n }\n\n template <bool (*g)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return g(x); });\n }\n template <class G> int min_left(int r, G g) {\n assert(0 <= r && r <= _n);\n assert(g(e()));\n if (r == 0) return 0;\n r += size;\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!g(op(d[r], sm))) {\n while (r < size) {\n push(r);\n r = (2 * r + 1);\n if (g(op(d[r], sm))) {\n sm = op(d[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = op(d[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n\n private:\n int _n, size, log;\n std::vector<S> d;\n std::vector<F> lz;\n\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n void all_apply(int k, F f) {\n d[k] = mapping(f, d[k]);\n if (k < size) lz[k] = composition(f, lz[k]);\n }\n void push(int k) {\n all_apply(2 * k, lz[k]);\n all_apply(2 * k + 1, lz[k]);\n lz[k] = id();\n }\n\n static int bit_ceil(int x) {\n return 1 << (32 - __builtin_clz(x - 1));\n }\n\n static int countr_zero(int x) {\n return __builtin_ctz(x);\n }\n};\n\n\nusing S=array<int,4>;\nS op(S l, S r){\n rep(i,4) l[i]+=r[i];\n return l;\n}\nS e(){return {0,0,0,0};}\nusing F=int;\nS mapping(F f, S s){\n S ret;\n rep(i,4) ret[(i+f)%4]=s[i];\n return ret;\n}\nF composition(F f, F g){\n return (f+g)%4;\n}\nF id(){return 0;}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n \n int N,M;\n cin>>N>>M;\n lazy_segtree<S,op,e,F,mapping,composition,id> seg(N);\n rep(i,N) seg.set(i, {1,0,0,0});\n rep(i,M){\n int t;\n cin>>t;\n if(t==1){\n int a,b,c;\n cin>>a>>b>>c;\n a--;\n c=(c+1000)%4;\n seg.apply(a,b,c);\n }\n else{\n int d,c;\n cin>>d>>c;\n d--;\n S s=seg.prod(d,c);\n cout<<s[0]-s[2]<<\"\\n\";\n }\n }\n}", "accuracy": 1, "time_ms": 220, "memory_kb": 26504, "score_of_the_acc": -0.4639, "final_rank": 15 }, { "submission_id": "aoj_0464_10684174", "code_snippet": "//#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n\n#ifndef ONLINE_JUDGE\n#define _GLIBCXX_DEBUG\n#endif\n\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n\n#define rep(i, N) for (int i = 0; i < N; i++)\n#define repn(i, n, N) for (int i = n; i < N; i++)\n#define fore(i, x) for(auto i : x)\n#define rep1(i, N) for(int i = 1; i <= N; i++)\n#define ll long long\n#define ull unsigned long long\n\ntemplate<class T> inline bool chmin(T& a, T b){ if(a > b){ a = b; return 1;} return 0;}\ntemplate<class T> inline bool chmax(T& a, T b){ if (a < b){a = b; return 1;} return 0;}\n\nconst long long INF_LL = 1LL << 60;\nconst int INF_I = 1 << 30;\n\nint dy[4] = {0, 1, 0, -1};\nint dx[4] = {1, 0, -1, 0};\n\nint RandInt(int a, int b){\n return a + rand() % (b - a + 1);\n}\n\ndouble RandDouble(){\n return 1.0 * rand() / RAND_MAX;\n}\n\nvoid overflow(ll a) {if(a < 0) throw;}\n\n\n#if __cplusplus >= 201703L\n\ntemplate <class S,\n auto op,\n auto e,\n class F,\n auto mapping,\n auto composition,\n auto id>\nstruct lazy_segtree {\n static_assert(std::is_convertible_v<decltype(op), std::function<S(S, S)>>,\n \"op must work as S(S, S)\");\n static_assert(std::is_convertible_v<decltype(e), std::function<S()>>,\n \"e must work as S()\");\n static_assert(\n std::is_convertible_v<decltype(mapping), std::function<S(F, S)>>,\n \"mapping must work as S(F, S)\");\n static_assert(\n std::is_convertible_v<decltype(composition), std::function<F(F, F)>>,\n \"composition must work as F(F, F)\");\n static_assert(std::is_convertible_v<decltype(id), std::function<F()>>,\n \"id must work as F()\");\n\n#else\n\ntemplate <class S,\n S (*op)(S, S),\n S (*e)(),\n class F,\n S (*mapping)(F, S),\n F (*composition)(F, F),\n F (*id)()>\nstruct lazy_segtree {\n\n#endif\n\n public:\n lazy_segtree() : lazy_segtree(0) {}\n explicit lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}\n explicit lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {\n size = (int)bit_ceil((unsigned int)(_n));\n log = countr_zero((unsigned int)size);\n d = std::vector<S>(2 * size, e());\n lz = std::vector<F>(size, id());\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) {\n update(i);\n }\n }\n\n void set(int p, S x) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n\n S get(int p) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n return d[p];\n }\n\n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return e();\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n S sml = e(), smr = e();\n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n\n return op(sml, smr);\n }\n\n S all_prod() { return d[1]; }\n\n void apply(int p, F f) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = mapping(f, d[p]);\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n void apply(int l, int r, F f) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return;\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n {\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) all_apply(l++, f);\n if (r & 1) all_apply(--r, f);\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n }\n\n for (int i = 1; i <= log; i++) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n\n template <bool (*g)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return g(x); });\n }\n template <class G> int max_right(int l, G g) {\n assert(0 <= l && l <= _n);\n assert(g(e()));\n if (l == _n) return _n;\n l += size;\n for (int i = log; i >= 1; i--) push(l >> i);\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!g(op(sm, d[l]))) {\n while (l < size) {\n push(l);\n l = (2 * l);\n if (g(op(sm, d[l]))) {\n sm = op(sm, d[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = op(sm, d[l]);\n l++;\n } while ((l & -l) != l);\n return _n;\n }\n\n template <bool (*g)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return g(x); });\n }\n template <class G> int min_left(int r, G g) {\n assert(0 <= r && r <= _n);\n assert(g(e()));\n if (r == 0) return 0;\n r += size;\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!g(op(d[r], sm))) {\n while (r < size) {\n push(r);\n r = (2 * r + 1);\n if (g(op(d[r], sm))) {\n sm = op(d[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = op(d[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n\n private:\n int _n, size, log;\n std::vector<S> d;\n std::vector<F> lz;\n\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n void all_apply(int k, F f) {\n d[k] = mapping(f, d[k]);\n if (k < size) lz[k] = composition(f, lz[k]);\n }\n void push(int k) {\n all_apply(2 * k, lz[k]);\n all_apply(2 * k + 1, lz[k]);\n lz[k] = id();\n }\n};\n\n\nstruct S{\n int d[4];\n};\n\nusing F = int;\n\nS op(S a, S b){\n S s;\n s.d[0] = a.d[0] + b.d[0];\n s.d[1] = a.d[1] + b.d[1];\n s.d[2] = a.d[2] + b.d[2];\n s.d[3] = a.d[3] + b.d[3];\n return s;\n}\n\nS e(){\n S s;\n s.d[0] = 0;\n s.d[1] = 0;\n s.d[2] = 0;\n s.d[3] = 0;\n return s;\n}\n\nS mapping(F f, S x){\n S s;\n for(int i = 0; i < 4; i++){\n s.d[(i + f + 4000) % 4] = x.d[i];\n }\n\n return s;\n}\n\nF composition(F f, F g){\n return (f + g + 400000) % 4;\n}\n\nF id(){return 0;}\n\n\nint main(){\n int N, M; cin >> N >> M;\n\n S init = e();\n init.d[0] = 1;\n\n vector<S> v(N, init);\n\n lazy_segtree<S, op, e, F, mapping, composition, id> seg(v);\n\n for(;M--;){\n int q; cin >> q;\n\n if(q == 1){\n int a, b, c; cin >> a >> b >> c;\n a--;\n seg.apply(a, b, c);\n }\n if(q == 2){\n int d, e; cin >> d >> e;\n d--;\n\n S x = seg.prod(d, e);\n cout << x.d[0] - x.d[2] << endl;\n }\n }\n}", "accuracy": 1, "time_ms": 150, "memory_kb": 26480, "score_of_the_acc": -0.3802, "final_rank": 12 }, { "submission_id": "aoj_0464_10205755", "code_snippet": "// AOJ #464\n// Rotating Mass Game 2025.2.9\n \n#include <bits/stdc++.h>\nusing namespace std;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tif (c == '-') {\tc = gc();\n\t\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\t\treturn -n;\n\t}\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Cout(int n) { // 整数の表示（出力）\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tif (n < 0) pc('-'), n = -n;\n\t\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n\t\twhile (i--) pc(b[i]);\n\t}\n\tpc('\\n');\n}\n\nconst int MAXN = 300000;\nconst int SEG_SIZE = 4 * MAXN;\n\nstruct Node { int cnt[4]; };\n\nNode seg[SEG_SIZE];\nint lazy[SEG_SIZE];\n\nvoid build(int idx, int l, int r) {\n if(l == r) {\n seg[idx].cnt[0] = 1;\n seg[idx].cnt[1] = 0;\n seg[idx].cnt[2] = 0;\n seg[idx].cnt[3] = 0;\n lazy[idx] = 0;\n return;\n }\n int mid = (l + r) / 2;\n build(idx * 2, l, mid);\n build(idx * 2 + 1, mid + 1, r);\n lazy[idx] = 0;\n for(int i = 0; i < 4; i++){\n seg[idx].cnt[i] = seg[idx * 2].cnt[i] + seg[idx * 2 + 1].cnt[i];\n }\n}\n\nvoid apply(int idx, int d) {\n if(d == 0) return;\n int tmp[4];\n for (int i = 0; i < 4; i++) {\n tmp[i] = seg[idx].cnt[i];\n }\n for (int i = 0; i < 4; i++){\n seg[idx].cnt[i] = tmp[((i - d) % 4 + 4) % 4];\n }\n lazy[idx] = (lazy[idx] + d) % 4;\n}\n\nvoid pushDown(int idx) {\n if(lazy[idx] != 0) {\n int d = lazy[idx];\n apply(idx * 2, d);\n apply(idx * 2 + 1, d);\n lazy[idx] = 0;\n }\n}\n\nvoid update(int idx, int l, int r, int ql, int qr, int d) {\n if(ql <= l && r <= qr) {\n apply(idx, d);\n return;\n }\n pushDown(idx);\n int mid = (l + r) / 2;\n if(ql <= mid)\n update(idx * 2, l, mid, ql, qr, d);\n if(qr > mid)\n update(idx * 2 + 1, mid + 1, r, ql, qr, d);\n for (int i = 0; i < 4; i++){\n seg[idx].cnt[i] = seg[idx * 2].cnt[i] + seg[idx * 2 + 1].cnt[i];\n }\n}\n\nNode query(int idx, int l, int r, int ql, int qr) {\n if(ql <= l && r <= qr) return seg[idx];\n pushDown(idx);\n int mid = (l + r) / 2;\n Node res;\n for (int i = 0; i < 4; i++) res.cnt[i] = 0;\n if(ql <= mid) {\n Node leftRes = query(idx * 2, l, mid, ql, qr);\n for (int i = 0; i < 4; i++) res.cnt[i] += leftRes.cnt[i];\n }\n if(qr > mid) {\n Node rightRes = query(idx * 2 + 1, mid + 1, r, ql, qr);\n for (int i = 0; i < 4; i++) res.cnt[i] += rightRes.cnt[i];\n }\n return res;\n}\n \nint main(){\n int N = Cin(), M = Cin();\n\n build(1, 1, N);\n \n for (int i = 0; i < M; i++){\n int type = Cin();\n if(type == 1) {\n int a = Cin(), b = Cin(), c = Cin();\n int d = ((c % 4) + 4) % 4;\n update(1, 1, N, a, b, d);\n } else {\n int d = Cin(), e = Cin();\n Node ans = query(1, 1, N, d, e);\n int result = ans.cnt[0] - ans.cnt[2];\n Cout(result);\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 25868, "score_of_the_acc": -0.2655, "final_rank": 4 }, { "submission_id": "aoj_0464_9565547", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\tint n,m;\n\tcin >> n >> m;\n\tvector<int> a(n,0);\n\tint q = 1;\n\twhile(q * q < n) q++;\n\tvector<vector<int>> cou(q,vector<int>(4,0));\n\tvector<int> sum(q,0);\n\tfor(int i = 0;i < n;i++){\n\t\tcou[i / q][0]++;\n\t}\n\tfor(int i = 0;i < m;i++){\n\t\tint p;\n\t\tcin >> p;\n\t\tif(p == 1){\n\t\t\tint l,r,c;\n\t\t\tcin >> l >> r >> c;\n\t\t\tl--;r--;\n\t\t\tc += 4000;\n\t\t\tc %= 4;\n\t\t\tfor(int j = 0;j < q;j++){\n\t\t\t\tint left = j * q,right = j * q + q - 1;\n\t\t\t\tif(right < l || r < left) continue;\n\t\t\t\tif(l <= left && right <= r){\n\t\t\t\t\tsum[j] += c;\n\t\t\t\t\tvector<int> nex(4,0);\n\t\t\t\t\tfor(int k = 0;k < 4;k++){\n\t\t\t\t\t\tnex[(k + c) % 4] = cou[j][k];\n\t\t\t\t\t}\n\t\t\t\t\tswap(cou[j],nex);\n\t\t\t\t}else{\n\t\t\t\t\tfor(int k = left;k <= right;k++){\n\t\t\t\t\t\tif(k >= n) break;\n\t\t\t\t\t\ta[k] = (a[k] + sum[j]) % 4;\n\t\t\t\t\t\tcou[j][a[k]]--;\n\t\t\t\t\t\tif(l <= k && k <= r){\n\t\t\t\t\t\t\ta[k] = (a[k] + c) % 4;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcou[j][a[k]]++;\n\t\t\t\t\t}\n\t\t\t\t\tsum[j] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}else{\n\t\t\tint l,r;\n\t\t\tcin >> l >> r;\n\t\t\tl--;r--;\n\t\t\tint ans = 0;\n\t\t\tfor(int j = 0;j < q;j++){\n\t\t\t\tint left = j * q,right = j * q + q - 1;\n\t\t\t\tif(right < l || r < left) continue;\n\t\t\t\tif(l <= left && right <= r){\n\t\t\t\t\tans += cou[j][0];\n\t\t\t\t\tans -= cou[j][2];\n\t\t\t\t}else{\n\t\t\t\t\tfor(int k = left;k <= right;k++){\n\t\t\t\t\t\tif(k >= n) break;\n\t\t\t\t\t\ta[k] = (a[k] + sum[j]) % 4;\n\t\t\t\t\t\tif(l <= k && k <= r){\n\t\t\t\t\t\t\tif(a[k] == 0){\n\t\t\t\t\t\t\t\tans++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tif(a[k] == 2){\n\t\t\t\t\t\t\t\tans--;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tsum[j] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << ans << endl;\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 900, "memory_kb": 4440, "score_of_the_acc": -1, "final_rank": 16 }, { "submission_id": "aoj_0464_9540928", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\ntemplate <class T> using V = vector<T>;\n#define REP(i, n) for (ll i = 0; i < (n); i++)\n#define REP2(i, a, b) for (ll i = (a); i < (b); i++)\n\ntemplate <class S,\n auto op,\n auto e,\n class F,\n auto mapping,\n auto composition,\n auto id>\nstruct lazy_segtree {\n public:\n lazy_segtree() : lazy_segtree(0) {}\n explicit lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}\n explicit lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {\n\t\t{\n\t\t\tunsigned int x = 1;\n\t\t\twhile (x < (unsigned int)(_n)) x *= 2;\n\t\t\tsize = (int)x;\n\t\t}\n log = __builtin_ctz((unsigned int)size);\n d = std::vector<S>(2 * size, e());\n lz = std::vector<F>(size, id());\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) {\n update(i);\n }\n }\n\n void set(int p, S x) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n\n S get(int p) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n return d[p];\n }\n\n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return e();\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n S sml = e(), smr = e();\n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n\n return op(sml, smr);\n }\n\n S all_prod() { return d[1]; }\n\n void apply(int p, F f) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = mapping(f, d[p]);\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n void apply(int l, int r, F f) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return;\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n {\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) all_apply(l++, f);\n if (r & 1) all_apply(--r, f);\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n }\n\n for (int i = 1; i <= log; i++) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n private:\n int _n, size, log;\n std::vector<S> d;\n std::vector<F> lz;\n\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n void all_apply(int k, F f) {\n d[k] = mapping(f, d[k]);\n if (k < size) lz[k] = composition(f, lz[k]);\n }\n void push(int k) {\n all_apply(2 * k, lz[k]);\n all_apply(2 * k + 1, lz[k]);\n lz[k] = id();\n }\n};\n\nusing S = array<int, 4>;\nusing F = int;\nS op(S a, S b) {\n\treturn S{a[0] + b[0], \\\n\t\ta[1] + b[1], \\\n\t\ta[2] + b[2], \\\n\t\ta[3] + b[3]};\n}\nS e() { return S{0, 0, 0, 0}; }\nS mapping(F f, S a) {\n\treturn S{a[(f + 0) % 4], a[(f + 1) % 4], a[(f + 2) % 4], a[(f + 3) % 4]};\n}\nF composition(F f, F g) {\n\treturn f + g;\n}\nF id() { return 0; }\n\nint main()\n{\n\tint n, m; cin >> n >> m;\n\tlazy_segtree<S, op, e, F, mapping, composition, id> seg(V<S>(n, array<int, 4>{1, 0, 0, 0}));\n\tREP(_, m) {\n\t\tint t; cin >> t;\n\t\tif (t == 1) {\n\t\t\tint a, b, c; cin >> a >> b >> c;\n\t\t\tseg.apply(a - 1, b, (c % 4 + 4) % 4);\n\t\t} else {\n\t\t\tint d, e; cin >> d >> e;\n\t\t\tauto res = seg.prod(d - 1, e);\n\t\t\tcout << res[0] - res[2] << endl;\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 26304, "score_of_the_acc": -0.3542, "final_rank": 10 }, { "submission_id": "aoj_0464_9426527", "code_snippet": "#include <bits/stdc++.h>\n\nnamespace zawa {\n\nusing u32 = std::uint32_t;\nusing usize = std::size_t;\n\ntemplate <class Structure>\nclass LazySegmentTree {\npublic:\n using VM = typename Structure::ValueMonoid;\n using OM = typename Structure::OperatorMonoid;\n using Value = typename VM::Element;\n using Operator = typename OM::Element;\nprivate:\n static constexpr u32 parent(u32 v) noexcept {\n return v >> 1;\n }\n static constexpr u32 left(u32 v) noexcept {\n return v << 1 | 0;\n }\n static constexpr u32 right(u32 v) noexcept {\n return v << 1 | 1;\n }\n static constexpr u32 depth(u32 v) noexcept {\n return 31u - __builtin_clz(v);\n }\n static constexpr u32 trailingZeros(u32 v) noexcept {\n return __builtin_ctz(v);\n }\n\n struct Node {\n Value v_{VM::identity()};\n Operator o_{OM::identity()};\n Node() = default;\n Node(const Value& v, const Operator& o) : v_{v}, o_{o} {}\n };\n\n usize n_{};\n std::vector<Node> dat_;\n\n static Value action(const Node& node) {\n return Structure::mapping(node.v_, node.o_);\n }\n\n void propagate(u32 v) {\n dat_[left(v)].o_ = OM::operation(dat_[left(v)].o_, dat_[v].o_);\n dat_[right(v)].o_ = OM::operation(dat_[right(v)].o_, dat_[v].o_);\n dat_[v].o_ = OM::identity();\n }\n\n void propagateAncestor(u32 v) {\n u32 dep{depth(v)};\n u32 zeros{trailingZeros(v)};\n for (u32 d{dep} ; d != zeros ; d--) {\n propagate(v >> d);\n }\n }\n\n void recalc(u32 v) {\n dat_[v].v_ = VM::operation(action(dat_[left(v)]), action(dat_[right(v)]));\n }\n\n void recalcAncestor(u32 v) {\n v >>= trailingZeros(v);\n for (v = parent(v) ; v ; v = parent(v)) {\n recalc(v);\n }\n }\n\n template <class InputIterator>\n void datInit(InputIterator first) {\n auto it{first};\n for (u32 i{} ; i < n_ ; i++) {\n dat_[i + n_].v_ = *it;\n it++;\n }\n for (u32 i{static_cast<u32>(n_)} ; --i ; ) {\n dat_[i].v_ = VM::operation(dat_[left(i)].v_, dat_[right(i)].v_);\n }\n }\n\npublic:\n LazySegmentTree() = default;\n LazySegmentTree(usize n) : n_{n}, dat_((n << 1)) {\n assert(n_);\n }\n LazySegmentTree(const std::vector<Value>& a) : n_{a.size()}, dat_((a.size() << 1)) {\n assert(!a.empty());\n datInit(a.begin());\n }\n usize size() const noexcept {\n return n_;\n }\n void operation(u32 L, u32 R, const Operator& o) {\n assert(L <= n_ and R <= n_);\n L += size();\n R += size();\n propagateAncestor(L);\n propagateAncestor(R);\n for (u32 l = L, r = R ; l < r ; l = parent(l), r = parent(r)) {\n if (l & 1) {\n dat_[l].o_ = OM::operation(dat_[l].o_, o);\n l++;\n }\n if (r & 1) {\n r--;\n dat_[r].o_ = OM::operation(dat_[r].o_, o);\n }\n }\n recalcAncestor(L);\n recalcAncestor(R);\n }\n Value product(u32 L, u32 R) {\n assert(L <= n_ and R <= n_);\n L += size();\n R += size();\n propagateAncestor(L);\n propagateAncestor(R);\n recalcAncestor(L);\n recalcAncestor(R);\n Value l{VM::identity()}, r{VM::identity()};\n for ( ; L < R ; L = parent(L), R = parent(R)) {\n if (L & 1) {\n l = VM::operation(l, action(dat_[L]));\n L++;\n }\n if (R & 1) {\n R--;\n r = VM::operation(action(dat_[R]), r);\n }\n }\n return VM::operation(l, r);\n }\n};\n\n} // namespace zawa\n\nstruct VM {\n using Element = std::array<int, 4>;\n static Element identity() {\n Element res{};\n res.fill(0);\n return res;\n }\n static Element operation(Element L, const Element& R) {\n for (int i{} ; i < 4 ; i++) L[i] += R[i];\n return L;\n }\n};\n\nstruct OM {\n using Element = int;\n static Element identity() {\n return 0;\n }\n static Element operation(Element L, Element R) {\n return L + R;\n }\n};\n\nstruct Structure {\n using ValueMonoid = VM;\n using OperatorMonoid = OM;\n static VM::Element mapping(const VM::Element& A, const OM::Element& B) {\n int v{((B % 4) + 4) % 4};\n VM::Element res{VM::identity()};\n for (int i{} ; i < 4 ; i++) {\n res[(i + v) % 4] = A[i];\n }\n return res;\n }\n};\n\nusing namespace zawa;\n\nint main() {\n int N, M;\n std::cin >> N >> M;\n LazySegmentTree<Structure> seg(std::vector<VM::Element>(N, VM::Element{ 1, 0, 0, 0 }));\n while (M--) {\n int t;\n std::cin >> t;\n if (t == 1) {\n int L, R, v;\n std::cin >> L >> R >> v;\n L--;\n seg.operation(L, R, v);\n }\n else if (t == 2) {\n int L, R;\n std::cin >> L >> R;\n L--;\n auto val{seg.product(L, R)};\n std::cout << val[0] - val[2] << '\\n';\n }\n else {\n assert(false);\n }\n }\n}", "accuracy": 1, "time_ms": 150, "memory_kb": 19568, "score_of_the_acc": -0.2946, "final_rank": 7 }, { "submission_id": "aoj_0464_9011488", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n\n#include <algorithm>\n#include <cassert>\n#include <functional>\n#include <vector>\n\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\n#if __cplusplus >= 202002L\n#include <bit>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n#if __cplusplus >= 202002L\n\nusing std::bit_ceil;\n\n#else\n\nunsigned int bit_ceil(unsigned int n) {\n unsigned int x = 1;\n while (x < (unsigned int)(n)) x *= 2;\n return x;\n}\n\n#endif\n\nint countr_zero(unsigned int n) {\n#ifdef _MSC_VER\n unsigned long index;\n _BitScanForward(&index, n);\n return index;\n#else\n return __builtin_ctz(n);\n#endif\n}\n\nconstexpr int countr_zero_constexpr(unsigned int n) {\n int x = 0;\n while (!(n & (1 << x))) x++;\n return x;\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n\nnamespace atcoder {\n\n#if __cplusplus >= 201703L\n\ntemplate <class S,\n auto op,\n auto e,\n class F,\n auto mapping,\n auto composition,\n auto id>\nstruct lazy_segtree {\n static_assert(std::is_convertible_v<decltype(op), std::function<S(S, S)>>,\n \"op must work as S(S, S)\");\n static_assert(std::is_convertible_v<decltype(e), std::function<S()>>,\n \"e must work as S()\");\n static_assert(\n std::is_convertible_v<decltype(mapping), std::function<S(F, S)>>,\n \"mapping must work as F(F, S)\");\n static_assert(\n std::is_convertible_v<decltype(composition), std::function<F(F, F)>>,\n \"compostiion must work as F(F, F)\");\n static_assert(std::is_convertible_v<decltype(id), std::function<F()>>,\n \"id must work as F()\");\n\n#else\n\ntemplate <class S,\n S (*op)(S, S),\n S (*e)(),\n class F,\n S (*mapping)(F, S),\n F (*composition)(F, F),\n F (*id)()>\nstruct lazy_segtree {\n\n#endif\n\n public:\n lazy_segtree() : lazy_segtree(0) {}\n explicit lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}\n explicit lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {\n size = (int)internal::bit_ceil((unsigned int)(_n));\n log = internal::countr_zero((unsigned int)size);\n d = std::vector<S>(2 * size, e());\n lz = std::vector<F>(size, id());\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) {\n update(i);\n }\n }\n\n void set(int p, S x) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n\n S get(int p) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n return d[p];\n }\n\n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return e();\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n S sml = e(), smr = e();\n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n\n return op(sml, smr);\n }\n\n S all_prod() { return d[1]; }\n\n void apply(int p, F f) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = mapping(f, d[p]);\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n void apply(int l, int r, F f) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return;\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n {\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) all_apply(l++, f);\n if (r & 1) all_apply(--r, f);\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n }\n\n for (int i = 1; i <= log; i++) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n\n template <bool (*g)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return g(x); });\n }\n template <class G> int max_right(int l, G g) {\n assert(0 <= l && l <= _n);\n assert(g(e()));\n if (l == _n) return _n;\n l += size;\n for (int i = log; i >= 1; i--) push(l >> i);\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!g(op(sm, d[l]))) {\n while (l < size) {\n push(l);\n l = (2 * l);\n if (g(op(sm, d[l]))) {\n sm = op(sm, d[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = op(sm, d[l]);\n l++;\n } while ((l & -l) != l);\n return _n;\n }\n\n template <bool (*g)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return g(x); });\n }\n template <class G> int min_left(int r, G g) {\n assert(0 <= r && r <= _n);\n assert(g(e()));\n if (r == 0) return 0;\n r += size;\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!g(op(d[r], sm))) {\n while (r < size) {\n push(r);\n r = (2 * r + 1);\n if (g(op(d[r], sm))) {\n sm = op(d[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = op(d[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n\n private:\n int _n, size, log;\n std::vector<S> d;\n std::vector<F> lz;\n\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n void all_apply(int k, F f) {\n d[k] = mapping(f, d[k]);\n if (k < size) lz[k] = composition(f, lz[k]);\n }\n void push(int k) {\n all_apply(2 * k, lz[k]);\n all_apply(2 * k + 1, lz[k]);\n lz[k] = id();\n }\n};\n\n} // namespace atcoder\n\nusing namespace atcoder;\n\nusing S = array<int, 2>;\nusing F = array<int, 2>;\n\nS op(S x, S y) {\n return S{x[0]+y[0], x[1]+y[1]};\n}\n\nS e() {\n return S{0, 0};\n}\n\nS mapping(F f, S x) {\n return S{x[0]*f[0]-x[1]*f[1], x[1]*f[0]+x[0]*f[1]};\n}\n\nF composition(F f, F g) {\n return F{f[0]*g[0]-f[1]*g[1], f[1]*g[0]+f[0]*g[1]};\n}\n\nF id() {\n return F{1, 0};\n}\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector<S> student(N, S{1, 0});\n lazy_segtree<S, op, e, F, mapping, composition, id> seg(student);\n for( int i = 0; i < M; i++ ) {\n int t;\n cin >> t;\n if( t == 1 ) {\n int a, b, c;\n cin >> a >> b >> c;\n for( int j = 0; j < abs(c)%4; j++ ) {\n seg.apply(a-1, b, F{0, c/abs(c)});\n }\n }else {\n int a, b;\n cin >> a >> b;\n cout << seg.prod(a-1, b)[0] << endl;\n }\n }\n}", "accuracy": 1, "time_ms": 120, "memory_kb": 17684, "score_of_the_acc": -0.2355, "final_rank": 1 }, { "submission_id": "aoj_0464_9011485", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n\n#include <algorithm>\n#include <cassert>\n#include <functional>\n#include <vector>\n\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\n#if __cplusplus >= 202002L\n#include <bit>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n#if __cplusplus >= 202002L\n\nusing std::bit_ceil;\n\n#else\n\nunsigned int bit_ceil(unsigned int n) {\n unsigned int x = 1;\n while (x < (unsigned int)(n)) x *= 2;\n return x;\n}\n\n#endif\n\nint countr_zero(unsigned int n) {\n#ifdef _MSC_VER\n unsigned long index;\n _BitScanForward(&index, n);\n return index;\n#else\n return __builtin_ctz(n);\n#endif\n}\n\nconstexpr int countr_zero_constexpr(unsigned int n) {\n int x = 0;\n while (!(n & (1 << x))) x++;\n return x;\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n\nnamespace atcoder {\n\n#if __cplusplus >= 201703L\n\ntemplate <class S,\n auto op,\n auto e,\n class F,\n auto mapping,\n auto composition,\n auto id>\nstruct lazy_segtree {\n static_assert(std::is_convertible_v<decltype(op), std::function<S(S, S)>>,\n \"op must work as S(S, S)\");\n static_assert(std::is_convertible_v<decltype(e), std::function<S()>>,\n \"e must work as S()\");\n static_assert(\n std::is_convertible_v<decltype(mapping), std::function<S(F, S)>>,\n \"mapping must work as F(F, S)\");\n static_assert(\n std::is_convertible_v<decltype(composition), std::function<F(F, F)>>,\n \"compostiion must work as F(F, F)\");\n static_assert(std::is_convertible_v<decltype(id), std::function<F()>>,\n \"id must work as F()\");\n\n#else\n\ntemplate <class S,\n S (*op)(S, S),\n S (*e)(),\n class F,\n S (*mapping)(F, S),\n F (*composition)(F, F),\n F (*id)()>\nstruct lazy_segtree {\n\n#endif\n\n public:\n lazy_segtree() : lazy_segtree(0) {}\n explicit lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}\n explicit lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {\n size = (int)internal::bit_ceil((unsigned int)(_n));\n log = internal::countr_zero((unsigned int)size);\n d = std::vector<S>(2 * size, e());\n lz = std::vector<F>(size, id());\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) {\n update(i);\n }\n }\n\n void set(int p, S x) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n\n S get(int p) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n return d[p];\n }\n\n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return e();\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n S sml = e(), smr = e();\n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n\n return op(sml, smr);\n }\n\n S all_prod() { return d[1]; }\n\n void apply(int p, F f) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = mapping(f, d[p]);\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n void apply(int l, int r, F f) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return;\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n {\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) all_apply(l++, f);\n if (r & 1) all_apply(--r, f);\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n }\n\n for (int i = 1; i <= log; i++) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n\n template <bool (*g)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return g(x); });\n }\n template <class G> int max_right(int l, G g) {\n assert(0 <= l && l <= _n);\n assert(g(e()));\n if (l == _n) return _n;\n l += size;\n for (int i = log; i >= 1; i--) push(l >> i);\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!g(op(sm, d[l]))) {\n while (l < size) {\n push(l);\n l = (2 * l);\n if (g(op(sm, d[l]))) {\n sm = op(sm, d[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = op(sm, d[l]);\n l++;\n } while ((l & -l) != l);\n return _n;\n }\n\n template <bool (*g)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return g(x); });\n }\n template <class G> int min_left(int r, G g) {\n assert(0 <= r && r <= _n);\n assert(g(e()));\n if (r == 0) return 0;\n r += size;\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!g(op(d[r], sm))) {\n while (r < size) {\n push(r);\n r = (2 * r + 1);\n if (g(op(d[r], sm))) {\n sm = op(d[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = op(d[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n\n private:\n int _n, size, log;\n std::vector<S> d;\n std::vector<F> lz;\n\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n void all_apply(int k, F f) {\n d[k] = mapping(f, d[k]);\n if (k < size) lz[k] = composition(f, lz[k]);\n }\n void push(int k) {\n all_apply(2 * k, lz[k]);\n all_apply(2 * k + 1, lz[k]);\n lz[k] = id();\n }\n};\n\n} // namespace atcoder\n\nusing namespace atcoder;\n\nusing S = array<int, 2>;\nusing F = array<int, 2>;\n\nS op(S x, S y) {\n return S{x[0]+y[0], x[1]+y[1]};\n}\n\nS e() {\n return S{0, 0};\n}\n\nS mapping(F f, S x) {\n return S{x[0]*f[0]-x[1]*f[1], x[1]*f[0]+x[0]*f[1]};\n}\n\nF composition(F f, F g) {\n return F{f[0]*g[0]-f[1]*g[1], f[1]*g[0]+f[0]*g[1]};\n}\n\nF id() {\n return F{1, 0};\n}\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector<S> student(N, S{1, 0});\n lazy_segtree<S, op, e, F, mapping, composition, id> seg(student);\n for( int i = 0; i < M; i++ ) {\n int t;\n cin >> t;\n if( t == 1 ) {\n int a, b, c;\n cin >> a >> b >> c;\n for( int j = 0; j < abs(c)%4; j++ ) {\n seg.apply(a-1, b, c < 0 ? F{0, 1} : F{0, -1});\n }\n }else {\n int a, b;\n cin >> a >> b;\n cout << seg.prod(a-1, b)[0] << endl;\n }\n }\n}", "accuracy": 1, "time_ms": 120, "memory_kb": 17860, "score_of_the_acc": -0.2377, "final_rank": 2 }, { "submission_id": "aoj_0464_8709257", "code_snippet": "#include <bits/stdc++.h>\n\nusing Data = std::array<int, 4>;\nconst int D = 1000000000;\n\nData op(const Data& lhs, const Data& rhs) {\n Data data;\n data.fill(0);\n for (int i = 0; i < 4; i++) {\n data[i] = lhs[i] + rhs[i];\n }\n return data;\n}\n\nData mapping(const Data& data, int lazy) {\n lazy = (lazy + D) % 4;\n Data res;\n for (int i = 0; i < 4; i++) {\n res[i] = data[(i + lazy) % 4];\n }\n return res;\n}\n\nstruct SegmentTree {\n std::vector<Data> data;\n std::vector<int> lazy;\n int size;\n SegmentTree(int n) {\n int log = 0;\n while (n > (1 << log)) log++;\n size = 1 << log;\n data.assign(2 * size, {1, 0, 0, 0});\n lazy.assign(2 * size, 0);\n for (int i = size - 1; i > 0; i--) {\n data[i] = op(data[2 * i], data[2 * i + 1]);\n }\n }\n void push(int pos) {\n std::vector<int> stack;\n for (int i = pos + size; i > 0; i >>= 1) stack.push_back(i);\n std::reverse(stack.begin(), stack.end());\n stack.pop_back();\n for (auto i: stack) {\n assert(i < size);\n data[2 * i] = mapping(data[2 * i], lazy[i]);\n data[2 * i + 1] = mapping(data[2 * i + 1], lazy[i]);\n lazy[2 * i] += lazy[i];\n lazy[2 * i + 1] += lazy[i];\n lazy[i] = 0;\n }\n }\n void update(int pos) {\n pos += size;\n pos >>= 1;\n for (; pos > 0; pos >>= 1) {\n data[2 * pos] = mapping(data[2 * pos], lazy[pos]);\n data[2 * pos + 1] = mapping(data[2 * pos + 1], lazy[pos]);\n lazy[2 * pos] += lazy[pos];\n lazy[2 * pos + 1] += lazy[pos];\n lazy[pos] = 0;\n data[pos] = op(data[2 * pos], data[2 * pos + 1]);\n }\n }\n void apply(int left, int right, int val) {\n int l = left;\n int r = right;\n push(left);\n push(right - 1);\n for (left += size, right += size; left < right; left >>= 1, right >>= 1) {\n if (left & 1) {\n data[left] = mapping(data[left], val);\n lazy[left] += val;\n left++;\n }\n if (right & 1) {\n right--;\n data[right] = mapping(data[right], val);\n lazy[right] += val;\n }\n }\n update(l);\n update(r - 1);\n }\n Data prod(int left, int right) {\n push(left);\n push(right - 1);\n Data res;\n res.fill(0);\n for (left += size, right += size; left < right; left >>= 1, right >>= 1) {\n if (left & 1) res = op(res, data[left++]);\n if (right & 1) res = op(res, data[--right]);\n }\n return res;\n }\n Data get(int pos) {\n push(pos);\n return data[pos + size];\n }\n};\n\nint main() {\n int n, m;\n std::cin >> n >> m;\n SegmentTree segtree(n);\n for (int i = 0; i < m; i++) {\n int t;\n std::cin >> t;\n if (t == 1) {\n int l, r, v;\n std::cin >> l >> r >> v;\n l--;\n segtree.apply(l, r, v);\n } else {\n int l, r;\n std::cin >> l >> r;\n l--;\n auto data = segtree.prod(l, r);\n // for (int k = 0; k < 4; k++) {\n // std::cerr << data[k] << ' ';\n // }\n // std::cerr << std::endl;\n std::cout << data[0] - data[2] << '\\n';\n }\n // std::cerr << \"turn \" << i << '\\n';\n // for (int j = 0; j < n; j++) {\n // auto data = segtree.get(j);\n // std::cerr << j << \": \";\n // for (int k = 0; k < 4; k++) {\n // std::cerr << data[k] << ' ';\n // }\n // std::cerr << '\\n';\n // }\n }\n}", "accuracy": 1, "time_ms": 210, "memory_kb": 23604, "score_of_the_acc": -0.416, "final_rank": 14 }, { "submission_id": "aoj_0464_8256621", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define all(v) v.begin(), v.end()\ntemplate <class T, class U>\ninline bool chmax(T &a, U b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T, class U>\ninline bool chmin(T &a, U b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\nconstexpr int INF = 1000000000;\nconstexpr ll llINF = 3000000000000000000;\nconstexpr double pi = 3.141592653589793238;\nconstexpr double eps = 1e-10;\nstruct segtree {\n int siz = 1;\n vector<int> dat;\n segtree(int n) : segtree(vector<int>(n, 0)) {}\n segtree(const vector<int> &a) {\n while (siz < a.size()) siz <<= 1;\n dat = vector<int>(siz << 1, 0);\n for (int i = 0; i < a.size(); i++) dat[siz + i] = a[i];\n for (int i = siz - 1; i >= 1; i--) dat[i] = dat[2 * i] + dat[2 * i + 1];\n }\n void set(int p, int x) {\n p += siz;\n dat[p] = x;\n while (p > 0) {\n p >>= 1;\n dat[p] = dat[2 * p] + dat[2 * p + 1];\n }\n }\n int prod(int l, int r) {\n int vl = 0, vr = 0;\n l += siz, r += siz;\n while (l < r) {\n if (l & 1) vl = vl + dat[l++];\n if (r & 1) vr = dat[--r] + vr;\n l >>= 1, r >>= 1;\n }\n return vl + vr;\n }\n};\nstruct BIT {\n // 1-indexed\n int n, beki = 1;\n vector<int> bit;\n BIT(int x) {\n bit.resize(x + 1, 0);\n n = x;\n while (beki * 2 <= n) beki *= 2;\n }\n int sum(int i) {\n int res = 0;\n while (i > 0) {\n res += bit[i];\n i -= i & -i;\n }\n return res;\n }\n int sum(int l, int r) {\n //[l,r]\n return sum(r) - (l == 0 ? 0 : sum(l - 1));\n }\n void add(int i, int x) {\n while (i <= n) {\n bit[i] += x;\n i += i & -i;\n }\n }\n};\ntemplate <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S), F (*composition)(F, F), F (*id)()>\nstruct lazy_segtree {\n int _n, sz = 1;\n vector<S> dat;\n vector<F> lazy;\n lazy_segtree(vector<S> a) : _n(int(a.size())) {\n while (sz < _n) sz <<= 1;\n dat.resize(sz * 2, e());\n lazy.resize(sz * 2, id());\n rep(i, _n) dat[sz + i] = a[i];\n for (int i = sz - 1; i >= 1; i--) dat[i] = op(dat[2 * i], dat[2 * i + 1]);\n }\n void eval(int k) {\n dat[k] = mapping(lazy[k], dat[k]);\n if (k < sz) {\n lazy[k * 2] = composition(lazy[k], lazy[k * 2]);\n lazy[k * 2 + 1] = composition(lazy[k], lazy[k * 2 + 1]);\n }\n lazy[k] = id();\n }\n void apply(int a, int b, F f, int k = 1, int l = 0, int r = -1) {\n eval(k);\n if (r == -1) r = sz;\n if (r <= a || b <= l) return;\n if (a <= l && r <= b) {\n lazy[k] = composition(f, lazy[k]);\n eval(k);\n return;\n }\n int m = (l + r) >> 1;\n apply(a, b, f, 2 * k, l, m);\n apply(a, b, f, 2 * k + 1, m, r);\n dat[k] = op(dat[2 * k], dat[2 * k + 1]);\n }\n S prod(int a, int b, int k = 1, int l = 0, int r = -1) {\n eval(k);\n if (r == -1) r = sz;\n if (r <= a || b <= l) return e();\n if (a <= l && r <= b) return dat[k];\n int m = (l + r) >> 1;\n S vl = prod(a, b, 2 * k, l, m);\n S vr = prod(a, b, 2 * k + 1, m, r);\n return op(vl, vr);\n }\n};\nusing S = array<int, 4>;\nusing F = int;\nS op(S a, S b) { return {a[0] + b[0], a[1] + b[1], a[2] + b[2], a[3] + b[3]}; }\nS e() { return {0, 0, 0, 0}; }\nS mapping(F f, S a) { return {a[(f + 1000000000) % 4], a[(f + 1000000001) % 4], a[(f + 1000000002) % 4], a[(f + 1000000003) % 4]}; }\nF composition(F f, F g) { return f + g; }\nF id() { return 0; }\nint main() {\n int n, m;\n cin >> n >> m;\n lazy_segtree<S, op, e, F, mapping, composition, id> seg(vector<S>(n, {1, 0, 0, 0}));\n while (m--) {\n int type;\n cin >> type;\n if (type == 1) {\n int a, b, c;\n cin >> a >> b >> c;\n a--;\n seg.apply(a, b, c);\n } else {\n int d, e;\n cin >> d >> e;\n d--;\n auto res = seg.prod(d, e);\n cout << res[0] - res[2] << endl;\n }\n }\n}", "accuracy": 1, "time_ms": 150, "memory_kb": 28364, "score_of_the_acc": -0.4036, "final_rank": 13 }, { "submission_id": "aoj_0464_8161411", "code_snippet": "#include <string.h>\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cfloat>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <ctime>\n#include <deque>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <iterator>\n#include <list>\n#include <map>\n#include <memory>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\nusing namespace std;\n\nvoid mpl(int &x,int y) {\n x += y;\n if(x >= 4) x -= 4;\n}\n\ntemplate <typename T>\nstruct LazySegmentTree {\n int n;\n vector<T> dat;\n vector<int>lazy;\n LazySegmentTree() {};\n LazySegmentTree(int N) {\n n = 1;\n while(n < N) {\n n *= 2;\n }\n dat.resize(n*2);\n lazy.resize(n*2,0);\n for(int i = n; i < 2*n; i++) {\n dat[i] = {1,0,0,0};\n }\n for(int i = n-1; i >= 1; i--) {\n dat[i] = {dat[i*2][0]+dat[i*2+1][0],0,0,0};\n }\n }\n void eval(int k,int l,int r) {\n if(lazy[k] == 0) return;\n if(k < n) {\n mpl(lazy[k*2],lazy[k]);\n mpl(lazy[k*2+1],lazy[k]);\n }\n vector<int>nxt(4);\n for(int i = 0; i < 4; i++) {\n nxt[(lazy[k]+i)%4] = dat[k][i];\n }\n dat[k] = nxt;\n lazy[k] = 0;\n }\n void update(int a, int b, int x, int k, int l, int r) {\n eval(k,l,r);\n if(a <= l && r <= b) {\n mpl(lazy[k],x);\n eval(k,l,r);\n }\n else if(a < r && l < b) {\n update(a, b, x, k*2, l, (l+r)/2);\n update(a, b, x, k*2+1, (l+r)/2, r);\n for(int i = 0; i < 4; i++) {\n dat[k][i] = dat[k*2][i]+dat[k*2+1][i];\n }\n }\n }\n void update(int a, int b, int x) {//[a,b)\n update(a, b, x, 1, 0, n);\n }\n T query_sub(int a, int b, int k, int l, int r) {\n eval(k,l,r);\n if (r <= a || b <= l) {\n return {0,0,0,0};\n }\n else if (a <= l && r <= b) {\n return dat[k];\n }\n else {\n T vl = query_sub(a, b, k*2, l, (l+r)/2);\n T vr = query_sub(a, b, k*2+1, (l+r)/2, r);\n vector<int>ans(4);\n for(int i = 0; i < 4; i++) ans[i] = vl[i]+vr[i];\n return ans;\n }\n }\n T query(int a, int b) {//[a,b)\n return query_sub(a, b, 1, 0, n);\n }\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N,M;\n cin >> N >> M;\n LazySegmentTree<vector<int>>Seg(N);\n for(int i = 0; i < M; i++) {\n int f;\n cin >> f;\n if(f == 1) {\n int a,b,c;\n cin >> a >> b >> c;\n a--;\n Seg.update(a,b,(c%4+4)%4);\n }\n else {\n int d,e;\n cin >> d >> e;\n d--;\n auto a = Seg.query(d,e);\n cout << a[0]-a[2] << \"\\n\";\n }\n }\n}", "accuracy": 1, "time_ms": 290, "memory_kb": 64468, "score_of_the_acc": -1.0176, "final_rank": 17 }, { "submission_id": "aoj_0464_6984910", "code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 0464.cc: Rotating Mass Game\n */\n\n#include<cstdio>\n#include<vector>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 300000;\n\n/* typedef */\n\nstruct Elm {\n int vs[4];\n Elm(): vs() {}\n Elm(int _a, int _b, int _c, int _d) {\n vs[0] = _a, vs[1] = _b, vs[2] = _c, vs[3] = _d;\n }\n\n Elm operator+(const Elm &e) const {\n Elm r;\n for (int i = 0; i < 4; i++) r.vs[i] = vs[i] + e.vs[i];\n return r;\n }\n\n void rot(int c) {\n int tmp[4];\n for (int i = 0; i < 4; i++) tmp[(i + c) & 3] = vs[i];\n copy(tmp, tmp + 4, vs);\n }\n};\n\nstruct SegTreeDelay {\n typedef Elm T;\n int e2;\n vector<T> nodes;\n T defv;\n vector<int> dls;\n SegTreeDelay() {}\n\n void init(int n, T _defv) {\n defv = _defv;\n for (e2 = 1; e2 < n; e2 <<= 1);\n nodes.assign(e2 * 2, defv);\n dls.assign(e2 * 2, 0);\n }\n\n T &geti(int i) { return nodes[e2 - 1 + i]; }\n void seti(int i, T v) { geti(i) = v; }\n\n void setall() {\n for (int j = e2 - 2; j >= 0; j--)\n nodes[j] = nodes[j * 2 + 1] + nodes[j * 2 + 2];\n }\n\n void __update(int k) {\n if (dls[k]) {\n int k0 = k * 2 + 1, k1 = k0 + 1;\n nodes[k0].rot(dls[k]);\n nodes[k1].rot(dls[k]);\n dls[k0] = (dls[k0] + dls[k]) & 3;\n dls[k1] = (dls[k1] + dls[k]) & 3;\n dls[k] = 0;\n }\n }\n\n void rot_range(int r0, int r1, int c, int k, int i0, int i1) {\n if (r1 <= i0 || i1 <= r0) return;\n if (r0 <= i0 && i1 <= r1) {\n nodes[k].rot(c);\n dls[k] = (dls[k] + c) & 3;\n return;\n }\n\n __update(k);\n\n int im = (i0 + i1) / 2;\n int k0 = k * 2 + 1, k1 = k0 + 1;\n rot_range(r0, r1, c, k0, i0, im);\n rot_range(r0, r1, c, k1, im, i1);\n nodes[k] = nodes[k0] + nodes[k1];\n }\n void rot_range(int r0, int r1, int c) { rot_range(r0, r1, c, 0, 0, e2); }\n\n T sum_range(int r0, int r1, int k, int i0, int i1) {\n if (r1 <= i0 || i1 <= r0) return defv;\n if (r0 <= i0 && i1 <= r1) return nodes[k];\n\n __update(k);\n\n int im = (i0 + i1) / 2;\n T v0 = sum_range(r0, r1, k * 2 + 1, i0, im);\n T v1 = sum_range(r0, r1, k * 2 + 2, im, i1);\n return v0 + v1;\n }\n T sum_range(int r0, int r1) { return sum_range(r0, r1, 0, 0, e2); }\n};\n\n/* global variables */\n\nSegTreeDelay st;\n\n/* subroutines */\n\n/* main */\n\nint main() {\n int n, m;\n scanf(\"%d%d\", &n, &m);\n\n st.init(n, Elm(0, 0, 0, 0));\n for (int i = 0; i < n; i++) st.seti(i, Elm(1, 0, 0, 0));\n st.setall();\n\n while (m--) {\n int op;\n scanf(\"%d\", &op);\n\n if (op == 1) {\n int l, r, c;\n scanf(\"%d%d%d\", &l, &r, &c), l--;\n st.rot_range(l, r, c);\n }\n else {\n int l, r;\n scanf(\"%d%d\", &l, &r), l--;\n\n Elm e = st.sum_range(l, r);\n printf(\"%d\\n\", e.vs[0] - e.vs[2]);\n }\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 23060, "score_of_the_acc": -0.2545, "final_rank": 3 }, { "submission_id": "aoj_0464_6950901", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\n#define endl \"\\n\"\ntypedef pair<int, int> Pii;\n#define REP(i, n) for (int i = 0; i < (n); ++i)\n#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))\n#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)\n#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define ALL(x) begin(x), end(x)\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\n#define fore(i,a) for(auto &i:a)\n#define all(s) (s).begin(),(s).end()\n#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)\n#define drep(i, n) drep2(i, n, 0)\n#define rever(vec) reverse(vec.begin(), vec.end())\n#define sor(vec) sort(vec.begin(), vec.end())\n#define fi first\n#define se second\n#define pb push_back\n#define P pair<ll,ll>\n#define PQminll priority_queue<ll, vector<ll>, greater<ll>>\n#define PQmaxll priority_queue<ll,vector<ll>,less<ll>>\n#define PQminP priority_queue<P, vector<P>, greater<P>>\n#define PQmaxP priority_queue<P,vector<P>,less<P>>\n#define NP next_permutation\n//const ll mod = 1000000009;\nconst ll mod = 998244353;\n//const ll mod = 1000000007;\nconst ll inf = 4100000000000000000ll;\nconst ld eps = ld(0.00000000001);\nstatic const long double pi = 3.141592653589793;\ntemplate<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}\ntemplate<class T,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}\ntemplate<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<\" \";}cout<<endl;}\ntemplate<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}\ntemplate<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<\" \";}cout<<endl;}cout<<endl;}\nvoid yes(bool a){cout<<(a?\"yes\":\"no\")<<endl;}\nvoid YES(bool a){cout<<(a?\"YES\":\"NO\")<<endl;}\nvoid Yes(bool a){cout<<(a?\"Yes\":\"No\")<<endl;}\nvoid possible(bool a){ cout<<(a?\"possible\":\"impossible\")<<endl; }\nvoid Possible(bool a){ cout<<(a?\"Possible\":\"Impossible\")<<endl; }\nvoid POSSIBLE(bool a){ cout<<(a?\"POSSIBLE\":\"IMPOSSIBLE\")<<endl; }\ntemplate<class T>auto min(const T& a){ return *min_element(all(a)); }\ntemplate<class T>auto max(const T& a){ return *max_element(all(a)); }\ntemplate<class T,class F>void print(pair<T,F> a){cout<<a.fi<<\" \"<<a.se<<endl;}\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;}\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;}\ntemplate<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}\ntemplate<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}\nll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}\nll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }\nvector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }\nll pop(ll x){return __builtin_popcountll(x);}\nll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}\nP hyou(P a){ll x=fastgcd(abs(a.fi),abs(a.se));a.fi/=x;a.se/=x;if(a.se<0){a.fi*=-1;a.se*=-1;}return a;}\nP Pplus(P a,P b){ return hyou({a.fi*b.se+b.fi*a.se,a.se*b.se});}\nP Ptimes(P a,ll b){ return hyou({a.fi*b,a.se});}\nP Ptimes(P a,P b){ return hyou({a.fi*b.fi,a.se*b.se});}\nP Pminus(P a,P b){ return hyou({a.fi*b.se-b.fi*a.se,a.se*b.se});}\nP Pgyaku(P a){ return hyou({a.se,a.fi});}\ntemplate<class T>\nstruct Sum{\n vector<T> data;\n Sum(const vector<T>& v):data(v.size()+1){\n for(ll i=0;i<v.size();i++) data[i+1]=data[i]+v[i];\n }\n T get(ll l,ll r) const {\n return data[r]-data[l];\n }\n};\ntemplate<class T>\nstruct Sum2{\n vector<vector<T>> data;\n Sum2(const vector<vector<T>> &v):data(v.size()+1,vector<T>(v[0].size()+1)){\n for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]=data[i][j+1]+v[i][j];\n for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]+=data[i+1][j];\n }\n T get(ll x1,ll y1,ll x2,ll y2) const {\n return data[x2][y2]+data[x1][y1]-data[x1][y2]-data[x2][y1];\n }\n};\n\nvoid cincout(){\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n cout<< fixed << setprecision(15);\n}\nstruct lazysegtree{\n vector<vector<ll>> node;\n vector<ll> lazy;\n ll n;\n vector<ll> merge(vector<ll> a,vector<ll> b){\n for(int i=0;i<4;i++) a[i]+=b[i];\n return a;\n }\n lazysegtree(ll N){\n ll x=1;\n while(x<N) x*=2;\n n=x;\n node.resize(2*n);\n lazy.resize(2*n);\n for(int i=n;i<2*n;i++){\n node[i].resize(4);\n if(i<n+N) node[i][0]=1;\n }\n for(int i=n-1;i>=1;i--){\n node[i]=merge(node[2*i],node[2*i+1]);\n }\n }\n void eval(ll k){\n if(lazy[k]==0) return;\n if(k<n){\n lazy[2*k]+=lazy[k];\n lazy[2*k+1]+=lazy[k];\n }\n vector<ll> d(4);\n for(int i=0;i<4;i++) d[(i+lazy[k])%4]=node[k][i];\n node[k]=d;\n lazy[k]=0;\n }\n void update(ll a,ll b,ll k,ll l,ll r,ll x){\n eval(k);\n if(a>=r||l>=b) return;\n if(a<=l&&r<=b){\n lazy[k]+=x;\n eval(k);\n return;\n }\n update(a,b,2*k,l,(l+r)/2,x);\n update(a,b,2*k+1,(l+r)/2,r,x);\n node[k]=merge(node[2*k],node[2*k+1]);\n }\n void update(ll a,ll b,ll x){\n update(a,b,1,0,n,x);\n }\n vector<ll> query(ll a,ll b,ll k,ll l,ll r){\n eval(k);\n if(a>=r||l>=b) return {0,0,0,0};\n if(a<=l&&r<=b){\n return node[k];\n }\n return merge(query(a,b,2*k,l,(l+r)/2),query(a,b,2*k+1,(l+r)/2,r));\n }\n vector<ll> query(ll a,ll b){\n return query(a,b,1,0,n);\n }\n};\nint main() {\n cincout();\n ll n,m;\n cin>>n>>m;\n lazysegtree seg(n);\n for(int i=0;i<m;i++){\n ll t;\n cin>>t;\n if(t==1){\n ll a,b,c;\n cin>>a>>b>>c;\n a--;\n b--;\n c+=1000;\n c%=4;\n seg.update(a,b+1,c);\n }\n else{\n ll a,b;\n cin>>a>>b;\n a--;\n b--;\n vector<ll> q=seg.query(a,b+1);\n cout<<q[0]-q[2]<<endl;\n }\n }\n}", "accuracy": 1, "time_ms": 370, "memory_kb": 85020, "score_of_the_acc": -1.3675, "final_rank": 20 }, { "submission_id": "aoj_0464_6949975", "code_snippet": "#include <iostream>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <tuple>\n#include <cstdint>\n#include <cstdio>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <deque>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <cctype>\n#include <climits>\n#include <functional>\n#include <cassert>\n#include <numeric>\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define per(i, n) for(int i = (n) - 1; i >= 0; i--)\nusing ll = long long;\n#define vi vector<int>\n#define vvi vector<vi>\n#define vl vector<ll>\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define all(a) (a).begin(), (a).end()\n#define rall(a) (a).rbegin(), (a).rend()\n#define mod 1000000007\nusing namespace std;\ntemplate<class T, class U>\nbool chmax(T &a, const U &b){ return a < b ? (a = b, 1) : 0; }\ntemplate<class T, class U>\nbool chmin(T &a, const U &b){ return a > b ? (a = b, 1) : 0; }\ntemplate <class T, T(*op)(const T&,const T&), T(*e)(), class F,\n T(*mapping)(const F&,const T&), F(*composition)(const F&,const F&), F(*id)()>\nstruct LazySegmentTree {\n LazySegmentTree(int _n) : n(_n){\n while((1 << log) < n) log++;\n len = 1 << log;\n d.assign(len * 2, e());\n lazy.assign(len, id());\n }\n void set(const int &i, const T &x){\n assert(0 <= i && i < n);\n d[i + len] = x;\n }\n T get(int p){\n assert(0 <= p && p < n);\n p += len;\n for(int i = log; i >= 1; i--) push(p >> i);\n return d[p];\n }\n void build(){\n for(int i = len - 1; i >= 1; i--) update(i);\n }\n void update(int l, int r, const F &x){\n assert(0 <= l && l <= r && r <= n);\n l += len; r += len;\n const int l_ctz = __builtin_ctz(l);\n const int r_ctz = __builtin_ctz(r);\n for(int i = log; i > l_ctz; i--) push(l >> i);\n for(int i = log; i > r_ctz; i--) push((r - 1) >> i);\n const int lt = l, rt = r;\n while(l < r){\n if(l & 1) apply(l++, x);\n if(r & 1) apply(--r, x);\n l >>= 1; r >>= 1;\n }\n l = lt; r = rt;\n for(int i = l_ctz + 1; i <= log; i++) update(l >> i);\n for(int i = r_ctz + 1; i <= log; i++) update((r - 1) >> i);\n }\n T query(int l, int r){\n assert(0 <= l && l <= r && r <= n);\n l += len; r += len;\n const int l_ctz = __builtin_ctz(l);\n const int r_ctz = __builtin_ctz(r);\n for(int i = log; i > l_ctz; i--) push(l >> i);\n for(int i = log; i > r_ctz; i--) push((r - 1) >> i);\n T left = e(), right = e();\n while(l < r){\n if(l & 1) left = op(left, d[l++]);\n if(r & 1) right = op(d[--r], right);\n l >>= 1; r >>= 1;\n }\n return op(left, right);\n }\n private:\n vector<T> d;\n vector<F> lazy;\n int n = 1, log = 0, len = 0;\n void update(const int &k){ d[k] = op(d[2*k], d[2*k+1]); }\n void apply(const int &k, const F &x){\n d[k] = mapping(x, d[k]);\n if(k < len) lazy[k] = composition(lazy[k], x);\n }\n void push(const int &k){\n apply(2*k, lazy[k]);\n apply(2*k+1, lazy[k]);\n lazy[k] = id();\n }\n};\nusing Data = array<int, 4>;\nusing Lazy = int;\nData op(const Data &a, const Data &b){\n Data res = {};\n rep(i, 4) res[i] = a[i] + b[i];\n return res;\n}\nData e(){\n return { 0, 0, 0, 0 };\n}\nData mapping(const Lazy &a, const Data &b){\n Data res = {};\n rep(i, 4) res[(i+4+a) % 4] = b[i];\n return res;\n}\nLazy composition(const Lazy &a, const Lazy &b){\n return (a + b + 8) % 4;\n}\nLazy id(){\n return 0;\n}\nint main(){\n int n,m;\n cin >> n >> m;\n LazySegmentTree<Data,op,e,Lazy,mapping,composition,id> seg(n);\n rep(i, n) seg.set(i, { 1, 0, 0, 0 });\n seg.build();\n rep(i, m){\n int t;\n cin >> t;\n if(t == 1){\n int a,b,c;\n cin >> a >> b >> c;\n seg.update(a-1, b, c % 4);\n }else{\n int d,e;\n cin >> d >> e;\n const Data res = seg.query(d-1, e);\n cout << res[0] - res[2] << \"\\n\";\n }\n }\n}", "accuracy": 1, "time_ms": 160, "memory_kb": 21464, "score_of_the_acc": -0.33, "final_rank": 8 }, { "submission_id": "aoj_0464_6932014", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define emb emplace_back\n#define all(v) (v).begin(),(v).end()\nusing ll = long long;\nusing S = array<int,4>;\nusing F = int;\nS op(const S &l,const S &r){return {l[0]+r[0],l[1]+r[1],l[2]+r[2],l[3]+r[3]};}\nvoid apply(S &l,const F x){\n static S ret;\n for(int i=0;i<4;i++) ret[(i+x)%4] = l[i];\n for(int i=0;i<4;i++) l[i] = ret[i];\n}\nclass lazysegtree{\n int N;vector<S> data;vector<F> lazy;\n void eval(int itr){\n apply(data[itr],lazy[itr]);\n if(itr<N){\n lazy[itr<<1] = (lazy[itr<<1]+lazy[itr])%4;\n lazy[itr<<1|1] = (lazy[itr<<1|1]+lazy[itr])%4;\n }\n lazy[itr] = 0;\n }\n void update(int l,int r,F x,int itr,int a,int b){\n eval(itr);\n if(b<=l || r<=a) return;\n if(l<=a && b<=r){\n lazy[itr] = x;eval(itr);\n }\n else{\n update(l,r,x,itr<<1,a,(a+b)>>1);\n update(l,r,x,itr<<1|1,(a+b)>>1,b);\n data[itr] = op(data[itr<<1],data[itr<<1|1]);\n }\n }\n S query(int l,int r,int itr,int a,int b){\n if(b<=l || r<=a) return {0,0,0,0};\n eval(itr);\n if(l<=a && b<=r) return data[itr];\n else return op(query(l,r,itr<<1,a,(a+b)>>1),query(l,r,itr<<1|1,(a+b)>>1,b));\n }\npublic:\n lazysegtree(int I_N){\n N = 1;\n while(N < I_N) N <<= 1;\n data.resize(N<<1);lazy.resize(N<<1);\n for(int i=N;i<(N<<1);i++) data[i] = {1,0,0,0};\n for(int i=N-1;i>=1;i--) data[i] = op(data[i<<1],data[i<<1|1]);\n }\n void update(int l,int r,F x){\n x = (x+1000)%4;\n update(l,r,x,1,0,N);\n }\n int query(int l,int r){\n S res = query(l,r,1,0,N);\n return res[0]-res[2];\n }\n};\nint main(){\n cin.tie(0);ios::sync_with_stdio(false);\n int N,M;cin >> N >> M;\n lazysegtree seg(N);\n while(M--){\n int t;cin >> t;\n if(t == 1){\n int a,b,c;cin >> a >> b >> c;a--;b--;\n seg.update(a,b+1,c);\n }\n else{\n int d,e;cin >> d >> e;d--;e--;\n cout << seg.query(d,e+1) << \"\\n\";\n }\n }\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 23664, "score_of_the_acc": -0.2739, "final_rank": 5 }, { "submission_id": "aoj_0464_6930339", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n#define SIZE 300005\n\nenum DIR{\n\tNorth,\n\tWest,\n\tSouth,\n\tEast,\n};\n\nstruct NA{\n\tNA(){\n\n\t\tfor(int i = 0; i < 4; i++){\n\n\t\t\tvalue[i] = 0;\n\t\t}\n\t}\n\tNA(ll arg_value[4]){\n\n\t\tfor(int i = 0; i < 4; i++){\n\n\t\t\tvalue[i] = arg_value[i];\n\t\t}\n\t}\n\tll value[4];\n};\n\nint N = 1;\nint table[6*SIZE];\nNA ans[6*SIZE];\n\n\nvoid init(int first_N){\n\twhile(N < first_N)N *= 2;\n}\n\nvoid first_add(int loc){\n\n\tloc += N-1;\n\n\tans[loc].value[North] = 1;\n\n\tif(N == 1)return;\n\n\tint parent = (loc-1)/2;\n\n\twhile(true){\n\t\tans[parent].value[North] = ans[2*parent+1].value[North]+ans[2*parent+2].value[North];\n\n\t\tif(parent == 0)break;\n\t\telse{\n\t\t\tparent = (parent-1)/2;\n\t\t}\n\t}\n}\n\n\nvoid update(int update_left,int update_right,ll move,int node_id,int node_left,int node_right){\n\n\tif(update_right < node_left || update_left > node_right)return;\n\n\tif(update_left <= node_left && update_right >= node_right){\n\n\t\tint work[4];\n\t\tfor(int i = 0; i < 4; i++){\n\n\t\t\twork[(i+move)%4] = ans[node_id].value[i];\n\t\t}\n\t\tfor(int i = 0; i < 4; i++){\n\n\t\t\tans[node_id].value[i] = work[i];\n\t\t}\n\n\t\ttable[node_id] += move;\n\n\t\treturn;\n\n\t}else{\n\n\t\tif(table[node_id] > 0){ //蓄積分\n\n\t\t\tupdate(node_left,node_right,table[node_id],2*node_id+1,node_left,(node_left+node_right)/2);\n\t\t\tupdate(node_left,node_right,table[node_id],2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\t\t\ttable[node_id] = 0;\n\t\t}\n\n\t\tint L = 2*node_id+1,R = 2*node_id+2;\n\n\t\tupdate(update_left,update_right,move,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tupdate(update_left,update_right,move,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\t\t//個数を再計算\n\t\tfor(int i = 0; i < 4; i++){\n\n\t\t\tans[node_id].value[i] = ans[L].value[i]+ans[R].value[i];\n\t\t}\n\t}\n}\n\nvector<int> query(int search_left,int search_right,int node_id,int node_left,int node_right){\n\n\tvector<int> ret;\n\n\tif(search_right < node_left || search_left > node_right){\n\n\t\tfor(int i = 0; i < 4; i++){\n\n\t\t\tret.push_back(0);\n\t\t}\n\n\t\treturn ret;\n\t}\n\n\tif(search_left <= node_left && search_right >= node_right){\n\n\n\t\tfor(int i = 0; i < 4; i++){\n\n\t\t\tret.push_back(ans[node_id].value[i]);\n\t\t}\n\n\t\treturn ret;\n\n\n\t}else{\n\n\t\tif(table[node_id] > 0){ //蓄積分\n\n\t\t\tupdate(node_left,node_right,table[node_id],2*node_id+1,node_left,(node_left+node_right)/2);\n\t\t\tupdate(node_left,node_right,table[node_id],2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\t\t\ttable[node_id] = 0;\n\t\t}\n\n\t\tvector<int> vec_L = query(search_left,search_right,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tvector<int> vec_R = query(search_left,search_right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\n\t\tfor(int i = 0; i < 4; i++){\n\n\t\t\tret.push_back(vec_L[i]+vec_R[i]);\n\t\t}\n\n\t\treturn ret;\n\t}\n}\n\n\nint main(){\n\n\tint first_N,Q;\n\tscanf(\"%d %d\",&first_N,&Q);\n\n\tinit(first_N);\n\n\t//printf(\"N:%d\\n\",N);\n\n\tfor(int i = 0; i <= 2*N-2; i++){\n\t\tfor(int a = 0; a < 4; a++){\n\n\t\t\tans[i].value[a] = 0;\n\t\t}\n\t}\n\tfor(int i = 0; i < first_N; i++){\n\n\t\tfirst_add(i);\n\t}\n\n\tint command;\n\tint left,right;\n\tint move;\n\n\tfor(int i = 0; i < Q; i++){\n\n\t\tscanf(\"%d %d %d\",&command,&left,&right);\n\t\tleft--;\n\t\tright--;\n\n\t\tif(command == 1){ //回転命令\n\n\t\t\tscanf(\"%d\",&move);\n\n\t\t\tif(move < 0){\n\n\t\t\t\tmove = -((abs(move)%4));\n\t\t\t\tmove += 4;\n\t\t\t\tmove %= 4;\n\n\t\t\t}else{\n\n\t\t\t\tmove %= 4;\n\t\t\t}\n\n\t\t\tif(move == 0)continue;\n\n\t\t\tupdate(left,right,move,0,0,N-1);\n\n\t\t}else{ //出力命令\n\n\t\t\tvector<int> ret = query(left,right,0,0,N-1);\n\n\t\t\tint to_N = ret[North];\n\t\t\tint to_S = ret[South];\n\n\t\t\tprintf(\"%d\\n\",to_N-to_S);\n\t\t}\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 370, "memory_kb": 64992, "score_of_the_acc": -1.1193, "final_rank": 18 } ]
aoj_0465_cpp
Commuting Route In the town of Aizu, where PCK lives, there are N points and $N-1$ roads connecting each point. Each point is numbered from $1$ to $N$, and all roads can be traveled in both directions. Also, from any point, you can reach other points by taking some paths. PCK, the CEO of IZUA Corporation, decides to change his route to work every day as a routine work to add a change to his daily life. PCK commutes to work by a route that satisfies the following conditions. It is a route that departs from the nearest point $u$ at home and arrives at the nearest point $v$ at work. The route passes through $u$ and $v$ exactly once on departure and arrival, respectively. Each point on the path except $u$ and $v$ is passed at most twice. Each path on the route is traversed up to two times. PCK is considering relocating his home and office and wants to know how many different ways he can enjoy his commute after the move. We are given the number of points, information about the roads that directly connect the points and the nearest point $u$ to our home and $v$ to our office after the relocation. However, several pairs of $u$ and $v$ are given as questions. For each question, create a program to find the number of commuting routes. Input Input is given in the following format. $N$ $s_1$ $t_1$ $s_2$ $t_2$ : $s_{N-1}$ $t_{N-1}$ $Q$ $u_1$ $v_1$ $u_2$ $v_2$ : $u_Q$ $v_Q$ On the first line, the number of points $N$ ($2 \leq N \leq 100,000$) is given. In the following $N-1$ line, the information about the road that directly connects the two points is given. $s_i$ and $t_i$ ($1 \leq s_i < t_i \leq N$) are the numbers of the two points connected by the $i$th path. However, for any two points, no more than one road connects them directly. The number of questions $Q$ ($1 \leq Q\leq 100,000$) is given in the following line. The subsequent $Q$ line is given two integers $u_i$ and $v_i$ ($1 \leq u_i < v_i \leq N$) representing each question. Output For each question, output the remainder of the number of commuting routes divided by 998,244,353 on one line. Sample Input and Output Sample Input 4 1 2 2 3 2 4 2 1 2 1 3 Sample Output 1 2
[ { "submission_id": "aoj_0465_10844716", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n// #include<atcoder/all>\n// using mint = atcoder::modint998244353;\nusing ld = long double;\n#define fi first\n#define se second\n#define all(x) x.begin(),x.end()\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\ntemplate<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}\ntemplate<typename T>bool chmax(T&a,T b){return b>a?(a=b,1):0;}\n\n\nstruct LCA{\n int N;\n vector<vector<int>> G,parent;\n vector<int> depth;\n LCA(const vector<vector<int>> &G_, int root=0):N(G_.size()), G(G_), depth(G_.size())\n {\n int lg = 0;\n while((1<<lg)+1<N)lg++;\n parent.assign(lg+1, vector<int>(N));\n\n dfs(root,-1,0);\n for(int k=1;k<(int)parent.size();k++)\n {\n for(int i=0;i<N;i++)\n {\n if(parent[k-1][i]==-1)parent[k][i]=-1;\n else parent[k][i]=parent[k-1][parent[k-1][i]];\n }\n }\n\n }\n void dfs(int u, int p, int d)\n {\n depth[u]=d;\n parent[0][u]=p;\n for(int v:G[u]) if(v!=p) dfs(v, u, d+1);\n }\n int lca(int u, int v)\n {\n if(depth[u]>depth[v])swap(u,v);\n for(int k=0;k<(int)parent.size();k++) if((depth[v]-depth[u])>>k&1) v=parent[k][v];\n if(u==v) return u;\n for(int k=parent.size();k--;) if(parent[k][u]!=parent[k][v])\n {\n u=parent[k][u];\n v=parent[k][v];\n }\n return parent[0][u];\n }\n int kth_ancestor(int v, int k){\n rep(i,parent.size()){\n if(k&1){\n v=parent[i][v];\n }\n k>>=1;\n }\n return v;\n }\n};\n\ntemplate <std::uint_fast64_t Modulus> class modint {\n using u64 = std::uint_fast64_t;\n\npublic:\n u64 a;\n\n constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}\n constexpr u64 &value() noexcept { return a; }\n constexpr const u64 &value() const noexcept { return a; }\n constexpr modint operator+(const modint rhs) const noexcept {\n return modint(*this) += rhs;\n }\n constexpr modint operator-(const modint rhs) const noexcept {\n return modint(*this) -= rhs;\n }\n constexpr modint operator*(const modint rhs) const noexcept {\n return modint(*this) *= rhs;\n }\n constexpr modint operator/(const modint rhs) const noexcept {\n return modint(*this) /= rhs;\n }\n constexpr modint &operator+=(const modint rhs) noexcept {\n a += rhs.a;\n if (a >= Modulus) {\n a -= Modulus;\n }\n return *this;\n }\n constexpr modint &operator-=(const modint rhs) noexcept {\n if (a < rhs.a) {\n a += Modulus;\n }\n a -= rhs.a;\n return *this;\n }\n constexpr modint &operator*=(const modint rhs) noexcept {\n a = a * rhs.a % Modulus;\n return *this;\n }\n constexpr modint &operator/=(modint rhs) noexcept {\n u64 exp = Modulus - 2;\n while (exp) {\n if (exp % 2) {\n *this *= rhs;\n }\n rhs *= rhs;\n exp /= 2;\n }\n return *this;\n }\n};\n\nusing mint=modint<998244353>;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n int N;\n cin>>N;\n vector<vector<int>> G(N);\n rep(i,N-1){\n int s,t;\n cin>>s>>t;\n s--;t--;\n G[s].push_back(t);\n G[t].push_back(s);\n }\n LCA lca(G);\n\n\n vector<int> sz(N,0);\n auto dfs_sz=[&](auto self, int v, int p)->void {\n sz[v]=1;\n for(int e: G[v]){\n if(e==p) continue;\n self(self,e,v);\n sz[v]+=sz[e];\n }\n\n };\n dfs_sz(dfs_sz, 0, -1);\n\n vector<mint> m(N,1);\n auto dfs_mul=[&](auto self, int v, int p)->void {\n for(int e: G[v]){\n if(e==p) continue;\n m[e]=m[v]*(sz[v]-sz[e]);\n self(self, e, v);\n }\n };\n dfs_mul(dfs_mul, 0, -1);\n int Q;\n cin>>Q;\n while(Q--){\n int u,v;\n cin>>u>>v;\n u--;v--;\n int l=lca.lca(u,v);\n mint ans=1;\n if(l==v) swap(u,v);\n if(l==u){\n ans*=m[v];\n int a=lca.kth_ancestor(v, lca.depth[v]-lca.depth[l]-1);\n ans/=m[a];\n }\n else{\n ans*=m[u]*m[v];\n int a=lca.kth_ancestor(u, lca.depth[u]-lca.depth[l]-1);\n int b=lca.kth_ancestor(v, lca.depth[v]-lca.depth[l]-1);\n ans/=m[a];\n ans/=m[b];\n ans*=(N-sz[a]-sz[b]);\n }\n\n cout<<ans.value()<<\"\\n\";\n }\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 27832, "score_of_the_acc": -0.6247, "final_rank": 7 }, { "submission_id": "aoj_0465_10232783", "code_snippet": "// AOJ #465 Commuting Route\n// 2025.2.19\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll MOD = 998244353;\nconst int NMAX = 100005;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Cout(int n) { // 整数の表示（出力）\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tif (n < 0) pc('-'), n = -n;\n\t\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n\t\twhile (i--) pc(b[i]);\n\t}\n\tpc('\\n');\n}\n\nint N;\nvector<int> adj[NMAX];\nint parent[NMAX], depth[NMAX], subSize[NMAX];\nint upTable[20][NMAX];\n \nvoid dfs(int v, int p) {\n parent[v] = p;\n depth[v] = (p == -1 ? 0 : depth[p] + 1);\n subSize[v] = 1;\n for (int nv : adj[v]) {\n if(nv == p) continue;\n dfs(nv, v);\n subSize[v] += subSize[nv];\n }\n}\n \nvoid buildLCA() {\n for (int v = 0; v < N; v++) upTable[0][v] = parent[v];\n for (int k = 1; k < 20; k++){\n for (int v = 0; v < N; v++){\n int mid = upTable[k-1][v];\n upTable[k][v] = (mid == -1 ? -1 : upTable[k-1][mid]);\n }\n }\n}\n \nint LCA(int a, int b) {\n if(depth[a] < depth[b]) swap(a, b);\n int d = depth[a] - depth[b];\n for (int k = 0; k < 20; k++){\n if(d & (1 << k)) a = upTable[k][a];\n }\n if(a == b) return a;\n for (int k = 19; k >= 0; k--){\n if(upTable[k][a] != upTable[k][b]){\n a = upTable[k][a];\n b = upTable[k][b];\n }\n }\n return parent[a];\n}\n \nint lift(int u, int d) {\n for (int k = 0; k < 20; k++){\n if(d & (1 << k)){\n u = upTable[k][u];\n if(u == -1) break;\n }\n }\n return u;\n}\n \nll modinv(ll a, ll m = MOD) {\n ll res = 1, e = a, p = m - 2;\n while(p){\n if(p & 1) res = (res * e) % m;\n e = (e * e) % m;\n p >>= 1;\n }\n return res;\n}\n \nvector<ll> parProd; \nvector<ll> diff;\n \nvoid calcDiffAndParProd(int v, int p) {\n if(v == 0) {\n diff[v] = 1;\n parProd[v] = 1;\n } else {\n diff[v] = ((ll) subSize[p] - subSize[v]) % MOD;\n if(diff[v] < 0) diff[v] += MOD;\n parProd[v] = (parProd[p] * diff[v]) % MOD;\n }\n for (int nv : adj[v]) {\n if(nv == p) continue;\n calcDiffAndParProd(nv, v);\n }\n}\n \nint main() {\n N = Cin();\n for (int i = 0; i < N-1; i++){\n int u = Cin()-1, v = Cin()-1;\n adj[u].push_back(v);\n adj[v].push_back(u);\n }\n \n dfs(0, -1);\n buildLCA();\n diff.resize(N); parProd.resize(N);\n calcDiffAndParProd(0, -1);\n \n int Q = Cin();\n while(Q--){\n int uu = Cin()-1, vv = Cin()-1;\n if(uu == vv){\n Cout(1);\n continue;\n }\n \n int l = LCA(uu, vv);\n \n ll prodUp = 1;\n if(uu != l){\n int d = depth[uu] - depth[l];\n if(d >= 2){\n int cu = lift(uu, d - 1);\n prodUp = (parProd[uu] * modinv(parProd[cu])) % MOD;\n }\n }\n \n ll prodDown = 1;\n if(vv != l){\n int d = depth[vv] - depth[l];\n if(d >= 2){\n int cv = lift(vv, d - 1);\n prodDown = (parProd[vv] * modinv(parProd[cv])) % MOD;\n }\n }\n \n ll ans = (prodUp * prodDown) % MOD;\n \n if(uu != l && vv != l){\n int d1 = depth[uu] - depth[l];\n int d2 = depth[vv] - depth[l];\n int cu = lift(uu, d1 - 1);\n int cv = lift(vv, d2 - 1);\n ll factorL = (1 + (((ll) (N - 1) - subSize[cu] - subSize[cv]) % MOD)) % MOD;\n if(factorL < 0) factorL += MOD;\n ans = (ans * factorL) % MOD;\n }\n Cout(ans);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 25104, "score_of_the_acc": -0.5466, "final_rank": 4 }, { "submission_id": "aoj_0465_10232765", "code_snippet": "// AOJ #465 Commuting Route\n// 2025.2.19\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll MOD = 998244353;\nconst int NMAX = 100005;\n \nint N;\nvector<int> adj[NMAX];\nint parent[NMAX], depth[NMAX], subSize[NMAX];\nint upTable[20][NMAX];\n \nvoid dfs(int v, int p) {\n parent[v] = p;\n depth[v] = (p == -1 ? 0 : depth[p] + 1);\n subSize[v] = 1;\n for (int nv : adj[v]) {\n if(nv == p) continue;\n dfs(nv, v);\n subSize[v] += subSize[nv];\n }\n}\n \nvoid buildLCA() {\n for (int v = 0; v < N; v++) upTable[0][v] = parent[v];\n for (int k = 1; k < 20; k++){\n for (int v = 0; v < N; v++){\n int mid = upTable[k-1][v];\n upTable[k][v] = (mid == -1 ? -1 : upTable[k-1][mid]);\n }\n }\n}\n \nint LCA(int a, int b) {\n if(depth[a] < depth[b]) swap(a, b);\n int d = depth[a] - depth[b];\n for (int k = 0; k < 20; k++){\n if(d & (1 << k)) a = upTable[k][a];\n }\n if(a == b) return a;\n for (int k = 19; k >= 0; k--){\n if(upTable[k][a] != upTable[k][b]){\n a = upTable[k][a];\n b = upTable[k][b];\n }\n }\n return parent[a];\n}\n \nint lift(int u, int d) {\n for (int k = 0; k < 20; k++){\n if(d & (1 << k)){\n u = upTable[k][u];\n if(u == -1) break;\n }\n }\n return u;\n}\n \nll modinv(ll a, ll m = MOD) {\n ll res = 1, e = a, p = m - 2;\n while(p){\n if(p & 1) res = (res * e) % m;\n e = (e * e) % m;\n p >>= 1;\n }\n return res;\n}\n \nvector<ll> parProd; \nvector<ll> diff;\n \nvoid calcDiffAndParProd(int v, int p) {\n if(v == 0) {\n diff[v] = 1;\n parProd[v] = 1;\n } else {\n diff[v] = ((ll) subSize[p] - subSize[v]) % MOD;\n if(diff[v] < 0) diff[v] += MOD;\n parProd[v] = (parProd[p] * diff[v]) % MOD;\n }\n for (int nv : adj[v]) {\n if(nv == p) continue;\n calcDiffAndParProd(nv, v);\n }\n}\n \nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n \n cin >> N;\n for (int i = 0; i < N-1; i++){\n int u, v;\n cin >> u >> v;\n u--; v--;\n adj[u].push_back(v);\n adj[v].push_back(u);\n }\n \n dfs(0, -1);\n buildLCA();\n diff.resize(N); parProd.resize(N);\n calcDiffAndParProd(0, -1);\n \n int Q; cin >> Q;\n while(Q--){\n int uu, vv;\n cin >> uu >> vv;\n uu--; vv--;\n if(uu == vv){\n cout << 1 << endl;\n continue;\n }\n \n int l = LCA(uu, vv);\n \n ll prodUp = 1;\n if(uu != l){\n int d = depth[uu] - depth[l];\n if(d >= 2){\n int cu = lift(uu, d - 1);\n prodUp = (parProd[uu] * modinv(parProd[cu])) % MOD;\n }\n }\n \n ll prodDown = 1;\n if(vv != l){\n int d = depth[vv] - depth[l];\n if(d >= 2){\n int cv = lift(vv, d - 1);\n prodDown = (parProd[vv] * modinv(parProd[cv])) % MOD;\n }\n }\n \n ll ans = (prodUp * prodDown) % MOD;\n \n if(uu != l && vv != l){\n int d1 = depth[uu] - depth[l];\n int d2 = depth[vv] - depth[l];\n int cu = lift(uu, d1 - 1);\n int cv = lift(vv, d2 - 1);\n ll factorL = (1 + (((ll) (N - 1) - subSize[cu] - subSize[cv]) % MOD)) % MOD;\n if(factorL < 0) factorL += MOD;\n ans = (ans * factorL) % MOD;\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 150, "memory_kb": 25244, "score_of_the_acc": -0.7016, "final_rank": 9 }, { "submission_id": "aoj_0465_9954965", "code_snippet": "#line 1 \"0465.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/0465\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/TypeAlias.hpp\"\n\n#include <cstdint>\n#include <cstddef>\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#include <iostream>\n#include <iomanip>\n\nnamespace zawa {\n\nvoid SetFastIO() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n}\n\nvoid SetPrecision(u32 dig) {\n std::cout << std::fixed << std::setprecision(dig);\n}\n\n} // namespace zawa\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Graph/Tree/HeavyLightDecomposition.hpp\"\n\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Graph/Tree/HeavyLightDecomposition.hpp\"\n\n#include <algorithm>\n#include <cassert>\n#include <cmath>\n#include <limits>\n#include <utility>\n#include <vector>\n\nnamespace zawa {\n\ntemplate <class V>\nclass HeavyLightDecomposition {\npublic:\n\n static constexpr V Invalid() noexcept {\n return INVALID;\n }\n\n HeavyLightDecomposition() = default;\n\n HeavyLightDecomposition(std::vector<std::vector<V>> T, V root = 0u) \n : n_{T.size()}, par_(n_), top_(n_), idx_(n_), \n inv_(n_), size_(n_, usize{1}), dep_(n_) {\n\n auto dfs1{[&](auto dfs, V v, V p, usize d) -> usize {\n par_[v] = p;\n dep_[v] = d;\n if (p != INVALID) {\n for (u32 i{} ; i + 1 < T[v].size() ; i++) if (T[v][i] == p) {\n std::swap(T[v][i], T[v].back());\n break;\n }\n assert(T[v].back() == p);\n T[v].pop_back();\n }\n for (V x : T[v]) {\n size_[v] += dfs(dfs, x, v, d + 1);\n }\n for (u32 i{1} ; i < T[v].size() ; i++) if (size_[T[v][0]] < size_[T[v][i]]) {\n std::swap(T[v][0], T[v][i]);\n }\n return size_[v];\n }};\n\n auto dfs2{[&](auto dfs, V v, V idx, V top) -> V {\n idx_[v] = idx++;\n inv_[idx_[v]] = v;\n top_[v] = top;\n if (T[v].size()) {\n idx = dfs(dfs, T[v][0], idx, top);\n for (u32 i{1} ; i < T[v].size() ; i++) {\n idx = dfs(dfs, T[v][i], idx, T[v][i]);\n }\n }\n return idx;\n }};\n\n dfs1(dfs1, root, INVALID, 0u);\n dfs2(dfs2, root, 0u, root);\n }\n\n inline usize size() const noexcept {\n return n_;\n }\n\n usize size(V v) const noexcept {\n assert(v < (V)size());\n return size_[v];\n }\n\n usize depth(V v) const noexcept {\n assert(v < (V)size());\n return dep_[v];\n }\n\n V parent(V v) const noexcept {\n assert(v < (V)size());\n return par_[v];\n }\n\n V index(V v) const noexcept {\n assert(v < (V)size());\n return idx_[v];\n }\n\n V operator[](V v) const noexcept {\n assert(v < (V)size());\n return idx_[v];\n }\n\n std::vector<std::pair<V, V>> decomp(V s, V t) const {\n assert(s < (V)size());\n assert(t < (V)size());\n std::vector<std::pair<V, V>> res, ser;\n while (top_[s] != top_[t]) {\n if (dep_[top_[s]] >= dep_[top_[t]]) {\n res.emplace_back(s, top_[s]);\n s = top_[s];\n if (par_[s] != INVALID) s = par_[s];\n }\n else {\n ser.emplace_back(top_[t], t);\n t = top_[t];\n if (par_[t] != INVALID) t = par_[t];\n }\n }\n res.emplace_back(s, t);\n std::reverse(ser.begin(), ser.end());\n res.insert(res.end(), ser.begin(), ser.end()); \n return res;\n }\n\n std::vector<std::pair<V, V>> operator()(V s, V t) const {\n return decomp(s, t);\n }\n\n V lca(V u, V v) const {\n assert(u < (V)size());\n assert(v < (V)size());\n while (top_[u] != top_[v]) {\n if (dep_[top_[u]] >= dep_[top_[v]]) {\n u = top_[u];\n if (par_[u] != INVALID) u = par_[u];\n }\n else {\n v = top_[v];\n if (par_[v] != INVALID) v = par_[v];\n }\n }\n return (dep_[u] <= dep_[v] ? u : v);\n }\n\n // pはvの祖先か？\n bool isAncestor(V v, V p) {\n assert(v < size());\n assert(p < size());\n if (dep_[v] < dep_[p]) return false;\n while (v != INVALID and top_[v] != top_[p]) {\n v = par_[top_[v]];\n }\n return v != INVALID;\n }\n\n V levelAncestor(V v, usize step) const {\n assert(v < (V)size());\n if (step > dep_[v]) return INVALID;\n while (true) {\n usize dist{dep_[v] - dep_[top_[v]]};\n if (dist >= step) break;\n step -= dist + 1;\n v = par_[top_[v]];\n }\n step = (dep_[v] - dep_[top_[v]]) - step;\n return inv_[idx_[top_[v]] + step];\n }\n\n V jump(V s, V t, usize step) const {\n assert(s < (V)size());\n assert(t < (V)size());\n V uu{INVALID}, vv{INVALID};\n usize d{};\n for (auto [u, v] : decomp(s, t)) {\n usize dist{std::max(dep_[u], dep_[v]) - std::min(dep_[u], dep_[v])};\n if (dist >= step) {\n uu = u;\n vv = v;\n d = dist;\n break;\n }\n step -= dist + 1;\n }\n if (uu == INVALID) return INVALID;\n if (dep_[uu] <= dep_[vv]) {\n return inv_[idx_[uu] + step];\n }\n else {\n return inv_[idx_[vv] + (d - step)];\n }\n }\n\n usize distance(V s, V t) const {\n assert(s < (V)size());\n assert(t < (V)size());\n usize res{};\n for (auto [u, v] : decomp(s, t)) {\n if (dep_[u] > dep_[v]) std::swap(u, v);\n res += dep_[v] - dep_[u];\n }\n return res;\n }\n\nprivate:\n static constexpr V INVALID{static_cast<V>(-1)};\n usize n_{};\n std::vector<V> par_{}, top_{}, idx_{}, inv_{};\n std::vector<usize> size_{}, dep_{};\n};\n\n} // namespace zawa\n#line 5 \"0465.test.cpp\"\n\n#line 10 \"0465.test.cpp\"\n\n#line 1 \"/home/zawatin/compro/cp-documentation/ac-library/atcoder/modint.hpp\"\n\n\n\n#line 5 \"/home/zawatin/compro/cp-documentation/ac-library/atcoder/modint.hpp\"\n#include <numeric>\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\n#line 1 \"/home/zawatin/compro/cp-documentation/ac-library/atcoder/internal_math.hpp\"\n\n\n\n#line 5 \"/home/zawatin/compro/cp-documentation/ac-library/atcoder/internal_math.hpp\"\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param m `1 <= m`\n// @return x mod m\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\n// Fast modular multiplication by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n // @param m `1 <= m`\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n // @return m\n unsigned int umod() const { return _m; }\n\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n // [1] m = 1\n // a = b = im = 0, so okay\n\n // [2] m >= 2\n // im = ceil(2^64 / m)\n // -> im * m = 2^64 + r (0 <= r < m)\n // let z = a*b = c*m + d (0 <= c, d < m)\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\n // ((ab * im) >> 64) == c or c + 1\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned long long y = x * _m;\n return (unsigned int)(z - y + (z < y ? _m : 0));\n }\n};\n\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr long long bases[3] = {2, 7, 61};\n for (long long a : bases) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n // Contracts:\n // [1] s - m0 * a = 0 (mod b)\n // [2] t - m1 * a = 0 (mod b)\n // [3] s * |m1| + t * |m0| <= b\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n // [3]:\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\n // = s * |m1| + t * |m0| <= b\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n // by [3]: |m0| <= b/g\n // by g != b: |m0| < b/g\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\n// @param n `n < 2^32`\n// @param m `1 <= m < 2^32`\n// @return sum_{i=0}^{n-1} floor((ai + b) / m) (mod 2^64)\nunsigned long long floor_sum_unsigned(unsigned long long n,\n unsigned long long m,\n unsigned long long a,\n unsigned long long b) {\n unsigned long long ans = 0;\n while (true) {\n if (a >= m) {\n ans += n * (n - 1) / 2 * (a / m);\n a %= m;\n }\n if (b >= m) {\n ans += n * (b / m);\n b %= m;\n }\n\n unsigned long long y_max = a * n + b;\n if (y_max < m) break;\n // y_max < m * (n + 1)\n // floor(y_max / m) <= n\n n = (unsigned long long)(y_max / m);\n b = (unsigned long long)(y_max % m);\n std::swap(m, a);\n }\n return ans;\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#line 1 \"/home/zawatin/compro/cp-documentation/ac-library/atcoder/internal_type_traits.hpp\"\n\n\n\n#line 7 \"/home/zawatin/compro/cp-documentation/ac-library/atcoder/internal_type_traits.hpp\"\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#line 14 \"/home/zawatin/compro/cp-documentation/ac-library/atcoder/modint.hpp\"\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt(998244353);\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#line 12 \"0465.test.cpp\"\nusing mint = atcoder::modint998244353;\nusing namespace zawa;\n\nint main() {\n SetFastIO();\n\n int N;\n std::cin >> N;\n std::vector<std::vector<int>> T(N);\n for (int _{} ; _ < N - 1 ; _++) {\n int s, t;\n std::cin >> s >> t;\n s--; t--;\n T[s].push_back(t);\n T[t].push_back(s);\n }\n HeavyLightDecomposition hld(T, 0);\n std::vector<mint> prod(N), invprod(N);\n auto dfs{[&](auto dfs, int v, int p) -> void {\n prod[v] = (p == -1 ? mint::raw(1) : prod[p] * mint{hld.size(p) - hld.size(v)});\n invprod[v] = prod[v].inv();\n for (auto x : T[v]) if (x != p) dfs(dfs, x, v);\n }};\n dfs(dfs, 0, -1);\n int Q;\n std::cin >> Q;\n while (Q--) {\n int u, v;\n std::cin >> u >> v;\n u--; v--;\n if (hld.depth(u) < hld.depth(v)) std::swap(u, v);\n int lca{(int)hld.lca(u, v)};\n assert(u != lca);\n if (v == lca) {\n auto a{hld.levelAncestor(u, hld.depth(u) - hld.depth(v) - 1)};\n assert(a != hld.Invalid());\n mint ans{prod[u] * invprod[a]};\n std::cout << ans.val() << '\\n';\n } \n else {\n auto a{hld.levelAncestor(u, hld.depth(u) - hld.depth(lca) - 1)};\n auto b{hld.levelAncestor(v, hld.depth(v) - hld.depth(lca) - 1)};\n assert(a != hld.Invalid());\n assert(b != hld.Invalid());\n mint ans{1};\n ans *= prod[u] * invprod[a];\n ans *= mint{N - hld.size(a) - hld.size(b)};\n ans *= prod[v] * invprod[b];\n std::cout << ans.val() << '\\n';\n }\n }\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 26488, "score_of_the_acc": -0.5673, "final_rank": 5 }, { "submission_id": "aoj_0465_9644548", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nll mod = 998244353;\nll power(ll a,ll b){\n ll res = 1;\n while(b>0){\n if(b%2==0){\n b/=2;\n a*=a;\n a%=mod;\n }else{\n b--;\n res*=a;\n res%=mod;\n }\n }\n return res;\n}\nstruct segtree{\n int n;\n vector<ll> node;\n segtree(int N){\n n = 1;\n while(n<N) n*=2;\n node.resize(2*n-1,1);\n }\n void update(ll a,ll x){\n int i = a+n-1;\n node[i] = x;\n while(i>0){\n i=(i-1)/2;\n node[i] = (node[i*2+1]*node[i*2+2])%mod;\n }\n }\n ll find(ll a,ll b,ll k=0,ll l=0,ll r=-1){\n if(r<0) r = n;\n if(b<=l||r<=a) return 1;\n if(a<=l&&r<=b) return node[k];\n ll vl = find(a,b,k*2+1,l,(l+r)/2);\n ll vr = find(a,b,k*2+2,(l+r)/2,r);\n return (vl*vr)%mod;\n }\n};\nint main() {\n int N;\n cin >> N;\n vector<vector<int>> G(N);\n for(int i=0;i<N-1;i++){\n int a,b;\n cin >> a >> b;\n a--;\n b--;\n G[a].push_back(b);\n G[b].push_back(a);\n }\n for(int i=0;i<N;i++){\n sort(G[i].begin(),G[i].end());\n }\n vector<ll> A(N,1);\n vector<ll> parent(N);\n vector<ll> depth(N,0);\n auto dfs = [&](auto dfs,int u,int p)->void{\n for(auto v:G[u]){\n if(v==p) continue;\n depth[v] = depth[u]+1;\n dfs(dfs,v,u);\n A[u] += A[v];\n parent[v] = u;\n }\n };\n dfs(dfs,0,-1);\n parent[0] = -1;\n vector<vector<ll>> rp(20,vector<ll>(N,0));\n rp[0] = parent;\n for(int i=0;i<19;i++){\n for(int j=0;j<N;j++){\n if(rp[i][j]==-1) rp[i+1][j] = -1;\n else rp[i+1][j] = rp[i][rp[i][j]]; \n }\n }\n vector<vector<ll>> chsum(N);\n for(int i=0;i<N;i++){\n for(auto j:G[i]) {\n chsum[i].push_back(A[j]);\n }\n }\n for(int i=0;i<N;i++){\n for(int j=0;j<chsum[i].size()-1;j++){\n chsum[i][j+1] += chsum[i][j];\n chsum[i][j+1]%=mod;\n }\n }\n vector<ll> dp(N);\n dp[0] = 1;\n auto dfs1 = [&](auto dfs1,int u,int p)->void{\n for(auto v:G[u]){\n if(v==p) continue;\n dp[v] = dp[u]*(A[u]-A[v]);\n dp[v] %= mod;\n dfs1(dfs1,v,u);\n }\n };\n dfs1(dfs1,0,-1);\n auto calcLCA = [&](ll a,ll b)->pair<ll,ll>{\n if(depth[a]>depth[b]) swap(a,b);\n int pa = -1;\n int pb = -1;\n for(int w=19;w>=0;w--){\n const int o = rp[w][b];\n if(o==-1) continue;\n if(depth[o]>depth[a]) {\n b = o;\n }\n }\n pb = b;\n if(depth[a]!=depth[b])b = parent[b];\n if(a==b) return pair(pa,pb);\n for(int w=19;w>=0;w--){\n int na = rp[w][a], nb = rp[w][b];\n if(na!=nb){\n a = na;\n b = nb;\n }\n }\n return pair(a,b);\n };\n int Q;\n cin >> Q;\n for(int i=0;i<Q;i++){\n int u,v;\n cin >> u >> v;\n u--;\n v--;\n if(depth[u]>depth[v]) swap(u,v);\n pair<ll,ll> p = calcLCA(u,v);\n ll ans = 1;\n ll sum = 0;\n if(p.first==-1){\n ans *= (dp[v]*power(dp[parent[p.second]],mod-2))%mod;\n ans %= mod;\n sum += A[parent[p.second]]-A[p.second];\n ans *= power(sum,mod-2);\n ans %= mod;\n }else{\n sum++;\n if(parent[p.second]!=0){\n sum += A[0]-A[parent[p.second]];\n }\n ll a = lower_bound(G[parent[p.first]].begin(),G[parent[p.first]].end(),p.first)-G[parent[p.first]].begin();\n ll b = lower_bound(G[parent[p.first]].begin(),G[parent[p.first]].end(),p.second)-G[parent[p.first]].begin();\n if(a>b) swap(a,b);\n if(a>0){\n sum += chsum[parent[p.first]][a-1];\n }\n if(b-a>1){\n sum += chsum[parent[p.first]][b-1]-chsum[parent[p.first]][a];\n }\n sum += chsum[parent[p.first]][chsum[parent[p.first]].size()-1]-chsum[parent[p.first]][b];\n if(parent[parent[p.first]]!=-1) sum -= A[parent[parent[p.first]]];\n sum %= mod;\n ans *= (dp[u]*power(dp[p.first],mod-2))%mod;\n ans %= mod;\n ans *= (dp[v]*power(dp[p.second],mod-2))%mod;\n ans %= mod;\n if(sum!=0) ans *= sum;\n ans %= mod;\n }\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 340, "memory_kb": 43584, "score_of_the_acc": -1.5846, "final_rank": 18 }, { "submission_id": "aoj_0465_9566000", "code_snippet": "#include <bits/stdc++.h>\n\n\n#include <utility>\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param m `1 <= m`\n// @return x mod m\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\n// Fast modular multiplication by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n // @param m `1 <= m < 2^31`\n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n // @return m\n unsigned int umod() const { return _m; }\n\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n // [1] m = 1\n // a = b = im = 0, so okay\n\n // [2] m >= 2\n // im = ceil(2^64 / m)\n // -> im * m = 2^64 + r (0 <= r < m)\n // let z = a*b = c*m + d (0 <= c, d < m)\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\n // ((ab * im) >> 64) == c or c + 1\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned int v = (unsigned int)(z - x * _m);\n if (_m <= v) v += _m;\n return v;\n }\n};\n\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr long long bases[3] = {2, 7, 61};\n for (long long a : bases) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n // Contracts:\n // [1] s - m0 * a = 0 (mod b)\n // [2] t - m1 * a = 0 (mod b)\n // [3] s * |m1| + t * |m0| <= b\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n // [3]:\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\n // = s * |m1| + t * |m0| <= b\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n // by [3]: |m0| <= b/g\n // by g != b: |m0| < b/g\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt = 998244353;\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\nusing namespace std;\nusing mint = atcoder::modint998244353;\n\nint main()\n{\n long long n;\n cin >> n;\n vector<vector<long long>> g(n,vector<long long>());\n for(long long i = 0ll;i < n - 1ll;i++){\n long long u,v;\n cin >> u >> v;\n u--;v--;\n g[u].push_back(v);\n g[v].push_back(u);\n }\n vector<vector<long long>> r(n,vector<long long>(20ll));\n vector<mint> cou(n,0ll),c(n);\n vector<long long> d(n,-1ll);\n {\n d[0ll] = 0ll;\n queue<long long> q;\n q.push(0ll);\n while(!q.empty()){\n long long it = q.front();\n q.pop();\n for(long long i : g[it]){\n if(d[i] != -1ll) continue;\n d[i] = d[it] + 1ll;\n q.push(i);\n }\n }\n for(long long i = 0ll;i < n;i++){\n r[i][0ll] = i;\n for(long long j : g[i]){\n if(d[j] < d[i]){\n r[i][0ll] = j;\n }\n }\n }\n for(long long i = 1ll;i < 20ll;i++){\n for(long long j = 0ll;j < n;j++){\n r[j][i] = r[r[j][i - 1ll]][i - 1ll];\n }\n }\n auto cal = [&](auto cal,long long now) -> mint {\n cou[now]++;\n for(long long i : g[now]){\n if(d[i] > d[now]){\n cou[now] += cal(cal,i);\n }\n }\n return cou[now];\n };\n cal(cal,0ll);\n }\n {\n queue<long long> q;\n for(long long i : g[0ll]){\n c[i] = 1ll;\n for(long long j : g[i]){\n if(j == 0ll) continue;\n q.push(j);\n }\n }\n while(!q.empty()){\n long long it = q.front();\n q.pop();\n c[it] = c[r[it][0ll]] * (cou[r[it][0ll]] - cou[it]);\n for(long long i : g[it]){\n if(d[i] > d[it]){\n q.push(i);\n }\n }\n }\n }\n auto root = [&](long long x,long long y) -> long long {\n if(y < 0ll) return x;\n long long res = x;\n for(long long i = 0ll;i < 20ll;i++){\n if(y & (1ll << i)){\n res = r[res][i];\n }\n }\n return res;\n };\n auto lca = [&](long long a,long long b) -> long long {\n if(d[a] > d[b]){\n a = root(a,d[a] - d[b]);\n }\n if(d[a] < d[b]){\n b = root(b,d[b] - d[a]);\n }\n long long low = 0ll,high = n;\n while(low < high){\n long long mid = (low + high) / 2ll;\n if(root(a,mid) == root(b,mid)){\n high = mid;\n }else{\n low = mid + 1ll;\n }\n }\n return low;\n };\n long long Q;\n cin >> Q;\n for(long long i = 0ll;i < Q;i++){\n long long u,v;\n cin >> u >> v;\n u--;v--;\n pair<long long,long long> dis(lca(u,v),lca(u,v));\n if(d[u] > d[v]){\n dis.first += d[u] - d[v];\n }\n if(d[u] < d[v]){\n dis.second += d[v] - d[u];\n }\n pair<long long,long long> p = {root(u,dis.first - 1ll),root(v,dis.second - 1ll)};\n long long it = root(u,dis.first);\n mint ans = 0ll;\n if(it == u){\n ans = c[v] / c[p.second];\n }else if(it == v){\n ans = c[u] / c[p.first];\n }else if(it == 0ll){\n ans = c[u] * c[v];\n ans *= n - cou[p.first] - cou[p.second];\n }else{\n ans = c[u] / c[p.first];\n ans *= c[v] / c[p.second];\n ans *= n - cou[p.first] - cou[p.second];\n }\n cout << ans.val() << endl;\n }\n}", "accuracy": 1, "time_ms": 370, "memory_kb": 37296, "score_of_the_acc": -1.4613, "final_rank": 16 }, { "submission_id": "aoj_0465_9470105", "code_snippet": "#line 1 \"0465.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/0465\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/TypeAlias.hpp\"\n\n#include <cstdint>\n#include <cstddef>\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#include <iostream>\n#include <iomanip>\n\nnamespace zawa {\n\nvoid SetFastIO() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n}\n\nvoid SetPrecision(u32 dig) {\n std::cout << std::fixed << std::setprecision(dig);\n}\n\n} // namespace zawa\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Graph/Tree/Tree.hpp\"\n\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Graph/Tree/Tree.hpp\"\n\n#include <cassert>\n#include <vector>\n\nnamespace zawa {\n\nusing Tree = std::vector<std::vector<u32>>;\n\nvoid AddEdge(Tree& T, u32 u, u32 v) {\n assert(u < T.size());\n assert(v < T.size());\n T[u].emplace_back(v);\n T[v].emplace_back(u);\n}\n\nvoid AddDirectedEdge(Tree& T, u32 from, u32 to) {\n assert(from < T.size());\n assert(to < T.size());\n T[from].emplace_back(to);\n}\n\n} // namespace zawa\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Graph/Tree/HeavyLightDecomposition.hpp\"\n\n#line 5 \"/home/zawatin/compro/cp-documentation/Src/Graph/Tree/HeavyLightDecomposition.hpp\"\n\n#include <algorithm>\n#line 8 \"/home/zawatin/compro/cp-documentation/Src/Graph/Tree/HeavyLightDecomposition.hpp\"\n#include <cmath>\n#include <limits>\n#include <utility>\n#line 12 \"/home/zawatin/compro/cp-documentation/Src/Graph/Tree/HeavyLightDecomposition.hpp\"\n\nnamespace zawa {\n\nclass HeavyLightDecomposition {\npublic:\n using Vertex = u32;\n\n static constexpr Vertex Invalid() noexcept {\n return INVALID;\n }\n\n HeavyLightDecomposition() = default;\n\n HeavyLightDecomposition(Tree T, Vertex root = 0u) \n : n_{T.size()}, par_(n_), top_(n_), idx_(n_), \n inv_(n_), size_(n_, usize{1}), dep_(n_) {\n\n auto dfs1{[&](auto dfs, Vertex v, Vertex p, usize d) -> usize {\n par_[v] = p;\n dep_[v] = d;\n if (p != INVALID) {\n for (u32 i{} ; i + 1 < T[v].size() ; i++) if (T[v][i] == p) {\n std::swap(T[v][i], T[v].back());\n break;\n }\n assert(T[v].back() == p);\n T[v].pop_back();\n }\n for (Vertex x : T[v]) {\n size_[v] += dfs(dfs, x, v, d + 1);\n }\n for (u32 i{1} ; i < T[v].size() ; i++) if (size_[T[v][0]] < size_[T[v][i]]) {\n std::swap(T[v][0], T[v][i]);\n }\n return size_[v];\n }};\n\n auto dfs2{[&](auto dfs, Vertex v, Vertex idx, Vertex top) -> Vertex {\n idx_[v] = idx++;\n inv_[idx_[v]] = v;\n top_[v] = top;\n if (T[v].size()) {\n idx = dfs(dfs, T[v][0], idx, top);\n for (u32 i{1} ; i < T[v].size() ; i++) {\n idx = dfs(dfs, T[v][i], idx, T[v][i]);\n }\n }\n return idx;\n }};\n\n dfs1(dfs1, root, INVALID, 0u);\n dfs2(dfs2, root, 0u, root);\n }\n\n inline usize size() const noexcept {\n return n_;\n }\n\n usize size(Vertex v) const noexcept {\n assert(v < size());\n return size_[v];\n }\n\n usize depth(Vertex v) const noexcept {\n assert(v < size());\n return dep_[v];\n }\n\n Vertex parent(Vertex v) const noexcept {\n assert(v < size());\n return par_[v];\n }\n\n Vertex index(Vertex v) const noexcept {\n assert(v < size());\n return idx_[v];\n }\n\n Vertex operator[](Vertex v) const noexcept {\n assert(v < size());\n return idx_[v];\n }\n\n\n std::vector<std::pair<Vertex, Vertex>> decomp(Vertex s, Vertex t) const {\n assert(s < size());\n assert(t < size());\n std::vector<std::pair<Vertex, Vertex>> res, ser;\n while (top_[s] != top_[t]) {\n if (dep_[top_[s]] >= dep_[top_[t]]) {\n res.emplace_back(s, top_[s]);\n s = top_[s];\n if (par_[s] != INVALID) s = par_[s];\n }\n else {\n ser.emplace_back(top_[t], t);\n t = top_[t];\n if (par_[t] != INVALID) t = par_[t];\n }\n }\n res.emplace_back(s, t);\n std::reverse(ser.begin(), ser.end());\n res.insert(res.end(), ser.begin(), ser.end()); \n return res;\n }\n\n std::vector<std::pair<Vertex, Vertex>> operator()(Vertex s, Vertex t) const {\n return decomp(s, t);\n }\n\n Vertex lca(u32 u, u32 v) const {\n assert(u < size());\n assert(v < size());\n while (top_[u] != top_[v]) {\n if (dep_[top_[u]] >= dep_[top_[v]]) {\n u = top_[u];\n if (par_[u] != INVALID) u = par_[u];\n }\n else {\n v = top_[v];\n if (par_[v] != INVALID) v = par_[v];\n }\n }\n return (dep_[u] <= dep_[v] ? u : v);\n }\n\n // pはvの祖先か？\n bool isAncestor(Vertex v, Vertex p) {\n assert(v < size());\n assert(p < size());\n if (dep_[v] < dep_[p]) return false;\n while (v != INVALID and top_[v] != top_[p]) {\n v = par_[top_[v]];\n }\n return v != INVALID;\n }\n\n Vertex levelAncestor(Vertex v, usize step) const {\n assert(v < size());\n if (step > dep_[v]) return INVALID;\n while (true) {\n usize dist{dep_[v] - dep_[top_[v]]};\n if (dist >= step) break;\n step -= dist + 1;\n v = par_[top_[v]];\n }\n step = (dep_[v] - dep_[top_[v]]) - step;\n return inv_[idx_[top_[v]] + step];\n }\n\n Vertex jump(Vertex s, Vertex t, usize step) const {\n assert(s < size());\n assert(t < size());\n Vertex uu{INVALID}, vv{INVALID};\n usize d{};\n for (auto [u, v] : decomp(s, t)) {\n usize dist{std::max(dep_[u], dep_[v]) - std::min(dep_[u], dep_[v])};\n if (dist >= step) {\n uu = u;\n vv = v;\n d = dist;\n break;\n }\n step -= dist + 1;\n }\n if (uu == INVALID) return INVALID;\n if (dep_[uu] <= dep_[vv]) {\n return inv_[idx_[uu] + step];\n }\n else {\n return inv_[idx_[vv] + (d - step)];\n }\n }\n\n usize distance(Vertex s, Vertex t) const {\n assert(s < size());\n assert(t < size());\n usize res{};\n for (auto [u, v] : decomp(s, t)) {\n if (dep_[u] > dep_[v]) std::swap(u, v);\n res += dep_[v] - dep_[u];\n }\n return res;\n }\n\nprivate:\n static constexpr Vertex INVALID{static_cast<Vertex>(-1)};\n usize n_{};\n std::vector<Vertex> par_{}, top_{}, idx_{}, inv_{};\n std::vector<usize> size_{}, dep_{};\n};\n\n} // namespace zawa\n#line 6 \"0465.test.cpp\"\n\n#line 11 \"0465.test.cpp\"\n\n#line 1 \"/home/zawatin/compro/cp-documentation/ac-library/atcoder/modint.hpp\"\n\n\n\n#line 5 \"/home/zawatin/compro/cp-documentation/ac-library/atcoder/modint.hpp\"\n#include <numeric>\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\n#line 1 \"/home/zawatin/compro/cp-documentation/ac-library/atcoder/internal_math.hpp\"\n\n\n\n#line 5 \"/home/zawatin/compro/cp-documentation/ac-library/atcoder/internal_math.hpp\"\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param m `1 <= m`\n// @return x mod m\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\n// Fast modular multiplication by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n // @param m `1 <= m`\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n // @return m\n unsigned int umod() const { return _m; }\n\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n // [1] m = 1\n // a = b = im = 0, so okay\n\n // [2] m >= 2\n // im = ceil(2^64 / m)\n // -> im * m = 2^64 + r (0 <= r < m)\n // let z = a*b = c*m + d (0 <= c, d < m)\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\n // ((ab * im) >> 64) == c or c + 1\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned long long y = x * _m;\n return (unsigned int)(z - y + (z < y ? _m : 0));\n }\n};\n\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr long long bases[3] = {2, 7, 61};\n for (long long a : bases) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n // Contracts:\n // [1] s - m0 * a = 0 (mod b)\n // [2] t - m1 * a = 0 (mod b)\n // [3] s * |m1| + t * |m0| <= b\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n // [3]:\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\n // = s * |m1| + t * |m0| <= b\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n // by [3]: |m0| <= b/g\n // by g != b: |m0| < b/g\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\n// @param n `n < 2^32`\n// @param m `1 <= m < 2^32`\n// @return sum_{i=0}^{n-1} floor((ai + b) / m) (mod 2^64)\nunsigned long long floor_sum_unsigned(unsigned long long n,\n unsigned long long m,\n unsigned long long a,\n unsigned long long b) {\n unsigned long long ans = 0;\n while (true) {\n if (a >= m) {\n ans += n * (n - 1) / 2 * (a / m);\n a %= m;\n }\n if (b >= m) {\n ans += n * (b / m);\n b %= m;\n }\n\n unsigned long long y_max = a * n + b;\n if (y_max < m) break;\n // y_max < m * (n + 1)\n // floor(y_max / m) <= n\n n = (unsigned long long)(y_max / m);\n b = (unsigned long long)(y_max % m);\n std::swap(m, a);\n }\n return ans;\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#line 1 \"/home/zawatin/compro/cp-documentation/ac-library/atcoder/internal_type_traits.hpp\"\n\n\n\n#line 7 \"/home/zawatin/compro/cp-documentation/ac-library/atcoder/internal_type_traits.hpp\"\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#line 14 \"/home/zawatin/compro/cp-documentation/ac-library/atcoder/modint.hpp\"\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt(998244353);\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n#line 13 \"0465.test.cpp\"\nusing mint = atcoder::modint998244353;\nusing namespace zawa;\n\nint main() {\n SetFastIO();\n\n int N;\n std::cin >> N;\n Tree T(N);\n for (int _{} ; _ < N - 1 ; _++) {\n int s, t;\n std::cin >> s >> t;\n s--; t--;\n AddEdge(T, s, t);\n }\n HeavyLightDecomposition hld(T, 0);\n std::vector<mint> prod(N), invprod(N);\n auto dfs{[&](auto dfs, int v, int p) -> void {\n prod[v] = (p == -1 ? mint::raw(1) : prod[p] * mint{hld.size(p) - hld.size(v)});\n invprod[v] = prod[v].inv();\n for (auto x : T[v]) if (x != p) dfs(dfs, x, v);\n }};\n dfs(dfs, 0, -1);\n int Q;\n std::cin >> Q;\n while (Q--) {\n int u, v;\n std::cin >> u >> v;\n u--; v--;\n if (hld.depth(u) < hld.depth(v)) std::swap(u, v);\n int lca{(int)hld.lca(u, v)};\n assert(u != lca);\n if (v == lca) {\n auto a{hld.levelAncestor(u, hld.depth(u) - hld.depth(v) - 1)};\n assert(a != hld.Invalid());\n mint ans{prod[u] * invprod[a]};\n std::cout << ans.val() << '\\n';\n } \n else {\n auto a{hld.levelAncestor(u, hld.depth(u) - hld.depth(lca) - 1)};\n auto b{hld.levelAncestor(v, hld.depth(v) - hld.depth(lca) - 1)};\n assert(a != hld.Invalid());\n assert(b != hld.Invalid());\n mint ans{1};\n ans *= prod[u] * invprod[a];\n ans *= mint{N - hld.size(a) - hld.size(b)};\n ans *= prod[v] * invprod[b];\n std::cout << ans.val() << '\\n';\n }\n }\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 26368, "score_of_the_acc": -0.5828, "final_rank": 6 }, { "submission_id": "aoj_0465_9468300", "code_snippet": "#include <bits/stdc++.h>\n\n\n\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\n\n\n\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param m `1 <= m`\n// @return x mod m\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\n// Fast modular multiplication by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n // @param m `1 <= m`\n explicit barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n // @return m\n unsigned int umod() const { return _m; }\n\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n // [1] m = 1\n // a = b = im = 0, so okay\n\n // [2] m >= 2\n // im = ceil(2^64 / m)\n // -> im * m = 2^64 + r (0 <= r < m)\n // let z = a*b = c*m + d (0 <= c, d < m)\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\n // ((ab * im) >> 64) == c or c + 1\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned long long y = x * _m;\n return (unsigned int)(z - y + (z < y ? _m : 0));\n }\n};\n\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n constexpr long long bases[3] = {2, 7, 61};\n for (long long a : bases) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n // Contracts:\n // [1] s - m0 * a = 0 (mod b)\n // [2] t - m1 * a = 0 (mod b)\n // [3] s * |m1| + t * |m0| <= b\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n // [3]:\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\n // = s * |m1| + t * |m0| <= b\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n // by [3]: |m0| <= b/g\n // by g != b: |m0| < b/g\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\n// @param n `n < 2^32`\n// @param m `1 <= m < 2^32`\n// @return sum_{i=0}^{n-1} floor((ai + b) / m) (mod 2^64)\nunsigned long long floor_sum_unsigned(unsigned long long n,\n unsigned long long m,\n unsigned long long a,\n unsigned long long b) {\n unsigned long long ans = 0;\n while (true) {\n if (a >= m) {\n ans += n * (n - 1) / 2 * (a / m);\n a %= m;\n }\n if (b >= m) {\n ans += n * (b / m);\n b %= m;\n }\n\n unsigned long long y_max = a * n + b;\n if (y_max < m) break;\n // y_max < m * (n + 1)\n // floor(y_max / m) <= n\n n = (unsigned long long)(y_max / m);\n b = (unsigned long long)(y_max % m);\n std::swap(m, a);\n }\n return ans;\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n\n\n\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt(998244353);\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\nusing mint = atcoder::modint998244353;\n\nstd::vector<int> g[100100];\nint par[100100], sz[100100], dep[100100];\nvoid dfs_par(int v, int p) {\n par[v] = p;\n for (int i{} ; i + 1 < (int)g[v].size() ; i++) {\n if (g[v][i] == p) std::swap(g[v][i], g[v].back());\n }\n if (g[v].back() == p) g[v].pop_back();\n for (auto x : g[v]) dfs_par(x, v);\n}\nint dfs_sz(int v) {\n sz[v] = 1;\n for (auto x : g[v]) sz[v] += dfs_sz(x);\n return sz[v];\n}\nvoid dfs_dep(int v, int d) {\n dep[v] = d;\n for (auto x : g[v]) dfs_dep(x, d + 1);\n}\nvoid dfs_hld(int v) {\n for (int i{1} ; i < (int)g[v].size() ; i++) {\n if (sz[g[v][0]] < sz[g[v][i]]) std::swap(g[v][0], g[v][i]);\n }\n for (auto x : g[v]) dfs_hld(x);\n}\nint idx[100100], top[100100];\nint dfs_decomp(int v, int tp, int id) {\n idx[v] = id++;\n top[v] = tp;\n if (g[v].size()) id = dfs_decomp(g[v][0], tp, id);\n for (int i{1} ; i < (int)g[v].size() ; i++) {\n id = dfs_decomp(g[v][i], g[v][i], id);\n }\n return id;\n}\nmint travel(int v, int i) {\n assert(i < (int)g[v].size());\n return mint::raw(sz[v] - sz[g[v][i]]);\n}\nmint A[100100], invA[100100], mult[100100], invmult[100100];\nstd::map<std::pair<int, int>, int> edge;\nint main() {\n int N;\n std::cin >> N;\n for (int _{} ; _ < N - 1 ; _++) {\n int s, t;\n std::cin >> s >> t;\n s--; t--;\n g[s].push_back(t);\n g[t].push_back(s);\n }\n dfs_par(0, -1);\n dfs_sz(0);\n dfs_dep(0, 0);\n dfs_hld(0);\n dfs_decomp(0, 0, 0);\n mult[0] = invmult[0] = mint::raw(1);\n for (int v{} ; v < N ; v++) {\n A[idx[v]] = (sz[v] == 1 ? mint::raw(1) : travel(v, 0));\n invA[idx[v]] = A[idx[v]].inv();\n }\n for (int v{} ; v < N ; v++) {\n mult[v + 1] = mult[v] * A[v];\n invmult[v + 1] = mult[v + 1].inv();\n }\n for (int v{} ; v < N ; v++) {\n for (int i{} ; i < (int)g[v].size() ; i++) {\n edge[std::make_pair(v, g[v][i])] = i;\n }\n }\n int Q;\n std::cin >> Q;\n while (Q--) {\n int u, v;\n std::cin >> u >> v;\n u--; v--;\n int pu{-1}, pv{-1};\n mint ans{1};\n while (top[u] != top[v]) {\n if (dep[top[u]] >= dep[top[v]]) {\n // std::cout << u + 1 << \" -> \" << top[u] + 1 << std::endl;\n int L{idx[top[u]]}, R{idx[u]};\n assert(L <= R);\n mint cur{mult[R] * invmult[L]};\n if (pu != -1) {\n std::pair<int, int> search{u, pu};\n auto it{edge.find(search)};\n assert(it != edge.end());\n cur *= travel(u, it->second);\n }\n // std::cout << cur.val() << std::endl;\n ans *= cur;\n u = top[u];\n pu = u;\n if (par[u] != -1) u = par[u];\n }\n else {\n int L{idx[top[v]]}, R{idx[v]};\n // std::cout << v + 1 << \" -> \" << top[v] + 1 << std::endl;\n assert(L <= R);\n mint cur{mult[R] * invmult[L]};\n if (pv != -1) {\n std::pair<int, int> search{v, pv};\n auto it{edge.find(search)};\n assert(it != edge.end());\n cur *= travel(v, it->second);\n }\n // std::cout << cur.val() << std::endl;\n ans *= cur;\n v = top[v];\n pv = v;\n if (par[v] != -1) v = par[v];\n }\n }\n if (u != v) {\n assert(dep[u] != dep[v]);\n if (dep[u] > dep[v]) {\n std::swap(u, v);\n std::swap(pu, pv);\n }\n // std::cout << u + 1 << \" -> \" << v + 1 << std::endl;\n int L{idx[u]}, R{idx[v]};\n assert(L < R);\n mint cur{mult[R] * invmult[L]};\n if (pv != -1 and pv != v) {\n std::pair<int, int> search{v, pv};\n auto it{edge.find(search)};\n assert(it != edge.end());\n cur *= travel(v, it->second);\n }\n\n cur *= invA[idx[u]];\n if (pu != -1) {\n int num{sz[u]};\n if (pu != u) {\n auto it{edge.find(std::make_pair(u, pu))};\n assert(it != edge.end());\n assert(it->second != 0);\n num -= sz[g[u][it->second]];\n }\n if (sz[u] != 1) {\n num -= sz[g[u][0]];\n }\n if (pu != -1) {\n num += N - sz[u];\n }\n cur *= num;\n }\n\n // std::cout << cur.val() << std::endl;\n ans *= cur;\n }\n else if (pu != -1 and pv != -1) {\n // std::cout << \"only top \" << u + 1 << std::endl;\n // std::cout << pu + 1 << ' ' << pv + 1 << std::endl;\n mint cur{N};\n cur -= sz[u == pu ? 0 : g[u][edge.find(std::make_pair(u, pu))->second]];\n cur -= sz[v == pv ? 0 : g[u][edge.find(std::make_pair(v, pv))->second]];\n // std::cout << cur.val() << std::endl;\n ans *= cur;\n }\n std::cout << ans.val() << '\\n';\n }\n}", "accuracy": 1, "time_ms": 360, "memory_kb": 21660, "score_of_the_acc": -0.9953, "final_rank": 12 }, { "submission_id": "aoj_0465_9012391", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int N;\n cin >> N;\n vector<vector<int>> G(N);\n for( int i = 0; i < N-1; i++ ) {\n int s, t;\n cin >> s >> t;\n s--, t--;\n G[s].push_back(t);\n G[t].push_back(s);\n }\n vector<int> d(N, 1), s(N, 1), p(N, -1);\n auto dfs = [&](auto dfs, int cur, int pre) -> void {\n for( const int &nxt : G[cur] ) {\n if( nxt == pre ) continue;\n p[nxt] = cur;\n d[nxt] = d[cur]+1;\n dfs(dfs, nxt, cur);\n s[cur] += s[nxt];\n }\n };\n dfs(dfs, 0, -1);\n constexpr int lg = 18;\n constexpr long long MOD = 998244353;\n vector<vector<int>> dest(lg, vector<int>(N, -1));\n vector<vector<long long>> prod(lg, vector<long long>(N, 0));\n for( int i = 0; i < N; i++ ) {\n dest[0][i] = p[i];\n if( dest[0][i] == -1 ) continue;\n prod[0][i] = s[p[i]]-s[i];\n }\n for( int k = 1; k < lg; k++ ) {\n for( int i = 0; i < N; i++ ) {\n if( dest[k-1][i] == -1 ) continue;\n dest[k][i] = dest[k-1][dest[k-1][i]];\n prod[k][i] = prod[k-1][i]*prod[k-1][dest[k-1][i]]%MOD;\n }\n }\n int Q;\n cin >> Q;\n for( int q = 0; q < Q; q++ ) {\n int u, v;\n cin >> u >> v;\n u--, v--;\n if( d[u] < d[v] ) swap(u, v);\n int diff = abs(d[u]-d[v]);\n long long ret = 1;\n for( int k = lg-1; k >= 0; k-- ) {\n if( diff > 0 && ((diff-1)>>k)%2 == 1 ) {\n ret *= prod[k][u];\n ret %= MOD;\n u = dest[k][u];\n }\n }\n if( dest[0][u] == v ) {\n cout << ret << endl;\n continue;\n }else if( diff > 0 ) {\n ret *= prod[0][u];\n ret %= MOD;\n u = dest[0][u];\n }\n for( int k = lg-1; k >= 0; k-- ) {\n if( dest[k][u] != dest[k][v] ) {\n ret *= prod[k][u];\n ret %= MOD;\n u = dest[k][u];\n ret *= prod[k][v];\n ret %= MOD;\n v = dest[k][v];\n }\n }\n ret *= N-(s[u]+s[v]);\n ret %= MOD;\n cout << ret << endl;\n }\n}", "accuracy": 1, "time_ms": 180, "memory_kb": 40900, "score_of_the_acc": -1.2059, "final_rank": 14 }, { "submission_id": "aoj_0465_8415356", "code_snippet": "// time complexity: O(N + Q * (log N + log MOD))\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nconst int MOD = 998244353;\n\nclass modint {\nprivate:\n\tint x;\npublic:\n\tmodint() : x(0) {}\n\tmodint(long long n) : x(n >= 0 ? n % MOD : (MOD - (-n) % MOD) % MOD) {}\n\tint get() const { return x; }\n\tmodint operator-() const { return modint(x != 0 ? MOD - x : 0); }\n\tmodint operator+=(const modint& m) { x = (x + m.x) % MOD; return *this; }\n\tmodint operator-=(const modint& m) { x = (x - m.x + MOD) % MOD; return *this; }\n\tmodint operator*=(const modint& m) { x = 1LL * x * m.x % MOD; return *this; }\n\tmodint operator+(const modint& m) const { return modint(*this) += m; }\n\tmodint operator-(const modint& m) const { return modint(*this) -= m; }\n\tmodint operator*(const modint& m) const { return modint(*this) *= m; }\n\tmodint pow(long long b) const {\n\t\tmodint res(1), a(*this);\n\t\twhile (b >= 1) {\n\t\t\tif (b % 2 == 1) {\n\t\t\t\tres *= a;\n\t\t\t}\n\t\t\ta *= a;\n\t\t\tb /= 2;\n\t\t}\n\t\treturn res;\n\t}\n\tmodint inv() const {\n\t\treturn pow(MOD - 2);\n\t}\n};\n\nint main() {\n\t// step #1. input & make graph\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tint N;\n\tcin >> N;\n\tvector<vector<int> > G(N);\n\tfor (int i = 0; i < N - 1; i++) {\n\t\tint a, b;\n\t\tcin >> a >> b;\n\t\tG[a - 1].push_back(b - 1);\n\t\tG[b - 1].push_back(a - 1);\n\t}\n\n\t// step #2. ordering\n\tvector<int> subsize(N);\n\tvector<int> par(N, -1);\n\tvector<vector<int> > child(N);\n\tauto ordering = [&](auto& self, int pos) -> void {\n\t\tsubsize[pos] = 1;\n\t\tfor (int i : G[pos]) {\n\t\t\tif (i != par[pos]) {\n\t\t\t\tpar[i] = pos;\n\t\t\t\tchild[pos].push_back(i);\n\t\t\t\tself(self, i);\n\t\t\t\tsubsize[pos] += subsize[i];\n\t\t\t}\n\t\t}\n\t\tfor (int& v : child[pos]) {\n\t\t\tif (subsize[v] > subsize[child[pos][0]]) {\n\t\t\t\tswap(v, child[pos][0]);\n\t\t\t}\n\t\t}\n\t};\n\tordering(ordering, 0);\n\n\t// step #3. calculate multiples\n\tvector<modint> mult(N);\n\tfor (int i = 0; i < N; i++) {\n\t\tif (i != 0 && !child[i].empty()) {\n\t\t\tmult[i] = subsize[i] - subsize[child[i][0]];\n\t\t}\n\t\telse {\n\t\t\tmult[i] = 1;\n\t\t}\n\t}\n\n\t// step #4. build tree\n\tint counter = 0;\n\tvector<int> ordinv(N);\n\tvector<int> ord(N);\n\tvector<int> head(N);\n\tauto build_tree = [&](auto& self, int pos) -> void {\n\t\tord[pos] = counter;\n\t\tordinv[counter] = pos;\n\t\tcounter += 1;\n\t\tfor (int i : child[pos]) {\n\t\t\thead[i] = (i == child[pos][0] ? head[pos] : i);\n\t\t\tif (i == child[pos][0]) {\n\t\t\t\tmult[i] *= mult[pos];\n\t\t\t}\n\t\t\tself(self, i);\n\t\t}\n\t};\n\tbuild_tree(build_tree, 0);\n\n\t// step #5. lca\n\tauto lcainfo = [&](int va, int vb) -> array<int, 3> {\n\t\tarray<int, 3> res = { -1, -1, -1 };\n\t\twhile (head[va] != head[vb]) {\n\t\t\tif (ord[va] < ord[vb]) {\n\t\t\t\tres[2] = head[vb];\n\t\t\t\tvb = par[head[vb]];\n\t\t\t}\n\t\t\telse {\n\t\t\t\tres[1] = head[va];\n\t\t\t\tva = par[head[va]];\n\t\t\t}\n\t\t}\n\t\tif (ord[va] < ord[vb]) {\n\t\t\tres[2] = ordinv[ord[va] + 1];\n\t\t}\n\t\tif (ord[va] > ord[vb]) {\n\t\t\tres[1] = ordinv[ord[vb] + 1];\n\t\t}\n\t\tres[0] = (ord[va] < ord[vb] ? va : vb);\n\t\treturn res;\n\t};\n\n\t// step #6. heavy-light decomposition\n\tauto query = [&](int pos, int tar) -> modint {\n\t\tmodint ans = 1;\n\t\tint pre = pos;\n\t\tpos = par[pos];\n\t\twhile (head[pos] != head[tar]) {\n\t\t\tans *= subsize[pos] - subsize[pre];\n\t\t\tans *= (pos != head[pos] ? mult[par[pos]] : modint(1));\n\t\t\tpre = head[pos];\n\t\t\tpos = par[pre];\n\t\t}\n\t\tans *= subsize[pos] - subsize[pre];\n\t\tif (pos != tar) {\n\t\t\tans *= mult[par[pos]] * (tar != head[tar] ? mult[par[tar]].inv() : modint(1));\n\t\t}\n\t\treturn ans;\n\t};\n\n\t// step #7. process queries\n\tint Q;\n\tcin >> Q;\n\tfor (int id = 1; id <= Q; id++) {\n\t\tint s, t;\n\t\tcin >> s >> t;\n\t\ts -= 1;\n\t\tt -= 1;\n\t\tarray<int, 3> v = lcainfo(s, t);\n\t\tmodint ans = 1;\n\t\tif (v[1] != -1 && v[2] != -1) {\n\t\t\tans *= N - (subsize[v[1]] + subsize[v[2]]);\n\t\t}\n\t\tif (v[1] != -1 && s != v[1]) {\n\t\t\tans *= query(s, v[1]);\n\t\t}\n\t\tif (v[2] != -1 && t != v[2]) {\n\t\t\tans *= query(t, v[2]);\n\t\t}\n\t\tcout << ans.get() << '\\n';\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 30280, "score_of_the_acc": -0.6758, "final_rank": 8 }, { "submission_id": "aoj_0465_8268154", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define all(v) v.begin(), v.end()\ntemplate <class T, class U>\ninline bool chmax(T& a, U b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T, class U>\ninline bool chmin(T& a, U b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\nconstexpr int INF = 1000000000;\nconstexpr int64_t llINF = 3000000000000000000;\nconstexpr double eps = 1e-10;\nconst double pi = acos(-1);\npair<vector<int>, vector<int>> calc_factor(int n) {\n vector<int> least_factor(n + 1, 0), prime_list;\n for (int i = 2; i <= n; i++) {\n if (least_factor[i] == 0) {\n least_factor[i] = i;\n prime_list.push_back(i);\n }\n for (int j = 0; j < (int)prime_list.size() && i * prime_list[j] <= n; j++) {\n least_factor[i * prime_list[j]] = prime_list[j];\n if (prime_list[j] == least_factor[i]) break;\n }\n }\n return make_pair(least_factor, prime_list);\n}\nll extgcd(ll a, ll b, ll& x, ll& y) {\n if (b == 0) {\n x = 1;\n y = 0;\n return a;\n }\n ll d = extgcd(b, a % b, y, x);\n y -= a / b * x;\n return d;\n}\nll modpow(ll a, ll b, ll m) {\n ll res = 1;\n while (b) {\n if (b & 1) {\n res *= a;\n res %= m;\n }\n a *= a;\n a %= m;\n b >>= 1;\n }\n return res;\n}\ntemplate <int modulo>\nstruct modint {\n int x;\n modint() : x(0) {}\n modint(int64_t y) : x(y >= 0 ? y % modulo : (modulo - (-y) % modulo) % modulo) {}\n modint& operator+=(const modint& p) {\n if ((x += p.x) >= modulo) x -= modulo;\n return *this;\n }\n modint& operator-=(const modint& p) {\n if ((x += modulo - p.x) >= modulo) x -= modulo;\n return *this;\n }\n modint& operator*=(const modint& p) {\n x = (int)(1LL * x * p.x % modulo);\n return *this;\n }\n modint& operator/=(const modint& p) {\n *this *= p.inv();\n return *this;\n }\n modint operator-() const { return modint(-x); }\n modint operator+(const modint& p) const { return modint(*this) += p; }\n modint operator-(const modint& p) const { return modint(*this) -= p; }\n modint operator*(const modint& p) const { return modint(*this) *= p; }\n modint operator/(const modint& p) const { return modint(*this) /= p; }\n bool operator==(const modint& p) const { return x == p.x; }\n bool operator!=(const modint& p) const { return x != p.x; }\n modint inv() const {\n int a = x, b = modulo, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return modint(u);\n }\n modint pow(int64_t n) const {\n modint ret(1), mul(x);\n while (n > 0) {\n if (n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n friend ostream& operator<<(ostream& os, const modint& p) { return os << p.x; }\n friend istream& operator>>(istream& is, modint& a) {\n int64_t t;\n is >> t;\n a = modint<modulo>(t);\n return (is);\n }\n int val() const { return x; }\n static constexpr int mod() { return modulo; }\n static constexpr int half() { return (modulo + 1) >> 1; }\n};\ntemplate <typename T>\nstruct Binomial {\n vector<T> inv, fact, factinv;\n Binomial(int n) {\n assert(n > 0);\n inv.resize(n + 1);\n fact.resize(n + 1);\n factinv.resize(n + 1);\n inv[0] = fact[0] = factinv[0] = 1;\n for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * i;\n factinv[n] = fact[n].inv();\n inv[n] = fact[n - 1] * factinv[n];\n for (int i = n - 1; i >= 1; i--) {\n factinv[i] = factinv[i + 1] * (i + 1);\n inv[i] = fact[i - 1] * factinv[i];\n }\n }\n T C(int n, int r) {\n if (n < 0 || n < r || r < 0) return 0;\n return fact[n] * factinv[n - r] * factinv[r];\n }\n T P(int n, int r) {\n if (n < 0 || n < r || r < 0) return 0;\n return fact[n] * factinv[n - r];\n }\n T H(int n, int r) {\n if (n == 0 && r == 0) return 1;\n if (n < 0 || r < 0) return 0;\n return r == 0 ? 1 : C(n + r - 1, r);\n }\n};\ntemplate <class S, S (*op)(S, S), S (*e)()>\nstruct segtree {\n int siz = 1;\n vector<S> dat;\n segtree(int n) : segtree(vector<S>(n, e())) {}\n segtree(const vector<S>& a) {\n while (siz < a.size()) siz <<= 1;\n dat = vector<S>(siz << 1, e());\n for (int i = 0; i < a.size(); i++) dat[siz + i] = a[i];\n for (int i = siz - 1; i >= 1; i--) dat[i] = op(dat[2 * i], dat[2 * i + 1]);\n }\n void set(int p, S x) {\n p += siz;\n dat[p] = x;\n while (p > 0) {\n p >>= 1;\n dat[p] = op(dat[2 * p], dat[2 * p + 1]);\n }\n }\n void add(int p, S x) { set(p, get(p) + x); }\n S get(int p) { return dat[p + siz]; }\n S prod(int l, int r) {\n S vl = e(), vr = e();\n l += siz, r += siz;\n while (l < r) {\n if (l & 1) vl = op(vl, dat[l++]);\n if (r & 1) vr = op(dat[--r], vr);\n l >>= 1, r >>= 1;\n }\n return op(vl, vr);\n }\n S all_prod() { return dat[1]; }\n};\n\ntemplate <class T>\nstruct BIT {\n // 1-indexed\n int n, beki = 1;\n vector<T> bit;\n BIT(int x) {\n bit.resize(x + 1, 0);\n n = x;\n while (beki * 2 <= n) beki *= 2;\n }\n T sum(int i) {\n T res = 0;\n while (i > 0) {\n res += bit[i];\n i -= i & -i;\n }\n return res;\n }\n T sum(int l, int r) {\n //[l,r]\n return sum(r) - (l == 0 ? 0 : sum(l - 1));\n }\n void add(int i, T x) {\n while (i <= n) {\n bit[i] += x;\n i += i & -i;\n }\n }\n int lowerbound(T w) {\n if (w <= 0) return 0;\n int x = 0;\n for (int k = beki; k > 0; k >>= 1) {\n if (x + k <= n && bit[x + k] < w) {\n w -= bit[x + k];\n x += k;\n }\n }\n return x + 1;\n }\n};\nusing mint = modint<998244353>;\ntemplate <class T, T (*op)(T, T), T (*e)()>\nstruct sparsetable {\n vector<vector<T>> table;\n vector<int> logtable;\n sparsetable(vector<T> v) {\n int len = 0;\n while ((1 << len) <= v.size()) len++;\n table.assign(len, vector<T>(1 << len));\n for (int i = 0; i < (int)v.size(); i++) table[0][i] = v[i];\n for (int i = 1; i < len; i++) {\n for (int j = 0; j + (1 << i) <= (1 << len); j++) {\n table[i][j] = op(table[i - 1][j], table[i - 1][j + (1 << (i - 1))]);\n }\n }\n logtable.resize(v.size() + 1);\n for (int i = 2; i < logtable.size(); i++) {\n logtable[i] = logtable[(i >> 1)] + 1;\n }\n }\n T query(int l, int r) {\n assert(l <= r);\n if (l == r) return e();\n int len = logtable[r - l];\n return op(table[len][l], table[len][r - (1 << len)]);\n }\n};\n\nstruct lca_tree {\n int n, size;\n vector<vector<int>> g, par;\n vector<int> depth;\n lca_tree(vector<vector<int>> g_, int root = 0)\n : n((int)g_.size()), size(log2(n) + 2), g(g_), par(size, vector<int>(n, -1)), depth(vector<int>(n, n)) {\n queue<int> que;\n depth[root] = 0;\n que.push(root);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n for (int i : g[p]) {\n if (depth[i] > depth[p] + 1) {\n depth[i] = depth[p] + 1;\n par[0][i] = p;\n que.push(i);\n }\n }\n }\n for (int k = 0; k < size - 1; k++) {\n for (int i = 0; i < n; i++) {\n if (par[k][i] == -1)\n par[k + 1][i] = -1;\n else\n par[k + 1][i] = par[k][par[k][i]];\n }\n }\n }\n int query(int u, int v) {\n if (depth[u] > depth[v]) swap(u, v);\n for (int k = size - 1; k >= 0; k--) {\n if (((depth[v] - depth[u]) >> k) & 1) v = par[k][v];\n if (u == v) return u;\n }\n for (int k = size - 1; k >= 0; k--) {\n if (par[k][u] != par[k][v]) {\n u = par[k][u];\n v = par[k][v];\n }\n }\n return par[0][u];\n }\n int dist(int u, int v) {\n int l = query(u, v);\n return depth[u] + depth[v] - 2 * depth[l];\n }\n int parent(int u, int d) {\n for (int k = size - 1; k >= 0; k--) {\n if ((d >> k) & 1) {\n if (u != -1) u = par[k][u];\n }\n }\n return u;\n }\n};\n\nstruct lca_tree_with_edge_ID {\n int n, size;\n vector<vector<pair<int, int>>> g;\n vector<vector<int>> par;\n vector<int> depth;\n lca_tree_with_edge_ID(vector<vector<pair<int, int>>> g_, int root = 0)\n : n((int)g_.size()), size(log2(n) + 2), g(g_), par(size, vector<int>(n, -1)), depth(vector<int>(n, n)) {\n queue<int> que;\n depth[root] = 0;\n que.push(root);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n for (auto [i, id] : g[p]) {\n if (depth[i] > depth[p] + 1) {\n depth[i] = depth[p] + 1;\n par[0][i] = p;\n que.push(i);\n }\n }\n }\n for (int k = 0; k < size - 1; k++) {\n for (int i = 0; i < n; i++) {\n if (par[k][i] == -1)\n par[k + 1][i] = -1;\n else\n par[k + 1][i] = par[k][par[k][i]];\n }\n }\n }\n int query(int u, int v) {\n if (depth[u] > depth[v]) swap(u, v);\n for (int k = size - 1; k >= 0; k--) {\n if (((depth[v] - depth[u]) >> k) & 1) v = par[k][v];\n if (u == v) return u;\n }\n for (int k = size - 1; k >= 0; k--) {\n if (par[k][u] != par[k][v]) {\n u = par[k][u];\n v = par[k][v];\n }\n }\n return par[0][u];\n }\n int dist(int u, int v) {\n int l = query(u, v);\n return depth[u] + depth[v] - 2 * depth[l];\n }\n};\n\nstruct UnionFind {\n vector<int> par, siz, es;\n UnionFind(int x) {\n par.resize(x);\n siz.resize(x);\n es.resize(x);\n for (int i = 0; i < x; i++) {\n par[i] = i;\n siz[i] = 1;\n es[i] = 0;\n }\n }\n int find(int x) {\n if (par[x] == x) return x;\n return par[x] = find(par[x]);\n }\n bool unite(int x, int y) {\n x = find(x), y = find(y);\n if (x == y) {\n es[x]++;\n return false;\n }\n if (siz[x] < siz[y]) swap(x, y);\n par[y] = x;\n siz[x] += siz[y];\n es[x] += es[y] + 1;\n return true;\n }\n bool same(int x, int y) { return find(x) == find(y); }\n int size(int x) { return siz[find(x)]; }\n int edges(int x) { return es[find(x)]; }\n};\nstruct Mo {\n int n;\n vector<pair<int, int>> lr;\n\n explicit Mo(int n) : n(n) {}\n\n void add(int l, int r) { /* [l, r) */\n lr.emplace_back(l, r);\n }\n\n template <typename AL, typename AR, typename EL, typename ER, typename O>\n void build(const AL& add_left, const AR& add_right, const EL& erase_left, const ER& erase_right, const O& out) {\n int q = (int)lr.size();\n int bs = n / min<int>(n, sqrt(q));\n vector<int> ord(q);\n iota(begin(ord), end(ord), 0);\n sort(begin(ord), end(ord), [&](int a, int b) {\n int ablock = lr[a].first / bs, bblock = lr[b].first / bs;\n if (ablock != bblock) return ablock < bblock;\n return (ablock & 1) ? lr[a].second > lr[b].second : lr[a].second < lr[b].second;\n });\n int l = 0, r = 0;\n for (auto idx : ord) {\n while (l > lr[idx].first) add_left(--l);\n while (r < lr[idx].second) add_right(r++);\n while (l < lr[idx].first) erase_left(l++);\n while (r > lr[idx].second) erase_right(--r);\n out(idx);\n }\n }\n\n template <typename A, typename E, typename O>\n void build(const A& add, const E& erase, const O& out) {\n build(add, add, erase, erase, out);\n }\n};\ntemplate <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S), F (*composition)(F, F), F (*id)()>\nstruct lazy_segtree {\n int _n, sz = 1;\n vector<S> dat;\n vector<F> lazy;\n lazy_segtree(vector<S> a) : _n(int(a.size())) {\n while (sz < _n) sz <<= 1;\n dat.resize(sz * 2, e());\n lazy.resize(sz * 2, id());\n rep(i, _n) dat[sz + i] = a[i];\n for (int i = sz - 1; i >= 1; i--) dat[i] = op(dat[2 * i], dat[2 * i + 1]);\n }\n void eval(int k) {\n dat[k] = mapping(lazy[k], dat[k]);\n if (k < sz) {\n lazy[k * 2] = composition(lazy[k], lazy[k * 2]);\n lazy[k * 2 + 1] = composition(lazy[k], lazy[k * 2 + 1]);\n }\n lazy[k] = id();\n }\n void apply(int a, int b, F f, int k = 1, int l = 0, int r = -1) {\n eval(k);\n if (r == -1) r = sz;\n if (r <= a || b <= l) return;\n if (a <= l && r <= b) {\n lazy[k] = composition(f, lazy[k]);\n eval(k);\n return;\n }\n int m = (l + r) >> 1;\n apply(a, b, f, 2 * k, l, m);\n apply(a, b, f, 2 * k + 1, m, r);\n dat[k] = op(dat[2 * k], dat[2 * k + 1]);\n }\n S prod(int a, int b, int k = 1, int l = 0, int r = -1) {\n eval(k);\n if (r == -1) r = sz;\n if (r <= a || b <= l) return e();\n if (a <= l && r <= b) return dat[k];\n int m = (l + r) >> 1;\n S vl = prod(a, b, 2 * k, l, m);\n S vr = prod(a, b, 2 * k + 1, m, r);\n return op(vl, vr);\n }\n};\nll modinv(int x, int modulo) {\n int a = x, b = modulo, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return (u >= 0 ? u % modulo : (modulo - (-u) % modulo) % modulo);\n}\n\nvoid solve() {\n int n;\n cin >> n;\n vector<vector<int>> g(n);\n rep(i, n - 1) {\n int s, t;\n cin >> s >> t;\n s--, t--;\n g[s].push_back(t);\n g[t].push_back(s);\n }\n lca_tree lt(g);\n\n vector<mint> dp(n);\n vector<int> siz(n);\n function<void(int, int)> dfs_sz = [&](int v, int p) {\n siz[v] = 1;\n for (auto to : g[v]) {\n if (to != p) {\n dfs_sz(to, v);\n siz[v] += siz[to];\n }\n }\n };\n dfs_sz(0, -1);\n dp[0] = 1;\n function<void(int, int)> dfs_dp = [&](int v, int p) {\n for (auto to : g[v]) {\n if (to != p) {\n dp[to] = dp[v] * (siz[v] - siz[to]);\n dfs_dp(to, v);\n }\n }\n };\n dfs_dp(0, -1);\n int q;\n cin >> q;\n while (q--) {\n int u, v;\n cin >> u >> v;\n u--, v--;\n int l = lt.query(u, v);\n if (v == l) swap(u, v);\n if (u == l) {\n cout << dp[v] / dp[lt.parent(v, lt.dist(l, v) - 1)] << \"\\n\";\n } else {\n int pl = lt.parent(u, lt.dist(l, u) - 1);\n int pr = lt.parent(v, lt.dist(l, v) - 1);\n mint vl = dp[u] / dp[pl];\n mint vr = dp[v] / dp[pr];\n mint vm = n - siz[pl] - siz[pr];\n cout << vl * vr * vm << \"\\n\";\n }\n }\n}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n solve();\n}", "accuracy": 1, "time_ms": 110, "memory_kb": 34040, "score_of_the_acc": -0.8777, "final_rank": 11 }, { "submission_id": "aoj_0465_6933950", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define emb emplace_back\n#define all(v) (v).begin(),(v).end()\nusing ll = long long;\nconstexpr ll MOD = 998244353;\nvector<vector<int>> G;\nvector<ll> sub_cnt,walk_cnt,rp;\nll modinv(ll a){\n ll b = MOD,u = 1,v = 0;\n while(b){\n ll t = a/b;\n a -= t*b;swap(a,b);\n u -= t*v;swap(u,v);\n }\n u %= MOD;\n if(u < 0) u += MOD;\n return u;\n}\nvoid dfs(int p,int bef){\n int total = 1;\n for(int nex:G[p]){\n if(nex == bef) continue;\n dfs(nex,p);total += sub_cnt[nex];\n }\n sub_cnt[p] = total;\n for(int nex:G[p]){\n if(nex == bef) continue;\n walk_cnt[nex] = total-sub_cnt[nex];\n }\n}\nvoid dfs2(int p,int bef){\n for(int nex:G[p]){\n if(nex == bef) continue;\n rp[nex] = rp[p]*walk_cnt[nex]%MOD;\n dfs2(nex,p);\n }\n}\nclass LCA{\n int N,l2N;\n vector<int> dep;vector<vector<int>> par;\n void dfs3(int p,int bef,vector<vector<int>> &G){\n for(int i=1;i<l2N;i++) par[p][i] = par[par[p][i-1]][i-1];\n for(int nex:G[p]){\n if(nex == bef) continue;\n dep[nex] = dep[p]+1;par[nex][0] = p;dfs3(nex,p,G);\n }\n }\npublic:\n LCA(int I_N,vector<vector<int>> &G):N(I_N){\n l2N = 1;\n while((1<<l2N) < N) l2N++;\n dep.resize(N);par.resize(N,vector<int>(l2N));\n dfs3(0,-1,G);\n }\n int depth(int x){return dep[x];}\n int parent(int x,int len=1){\n for(int i=0;i<l2N;i++){\n if(len&(1<<i)) x = par[x][i];\n }\n return x;\n }\n int query(int x,int y){\n if(dep[x] > dep[y]) swap(x,y);\n for(int i=l2N-1;i>=0;i--){\n if(dep[y]-(1<<i) >= dep[x]) y = par[y][i];\n }\n if(x == y) return x;\n for(int i=l2N-1;i>=0;i--){\n if(par[x][i] != par[y][i]){\n x = par[x][i];y = par[y][i];\n }\n }\n return par[x][0];\n }\n};\n\nint main(){\n cin.tie(0);ios::sync_with_stdio(false);\n int N;cin >> N;\n G.resize(N);\n for(int i=0;i<N-1;i++){\n int s,t;cin >> s >> t;s--;t--;\n G[s].emb(t);G[t].emb(s);\n }\n sub_cnt.resize(N);walk_cnt.resize(N);rp.resize(N);\n dfs(0,-1);walk_cnt[0] = rp[0] = 1;dfs2(0,-1);\n // for(int i=0;i<N;i++) cout << sub_cnt[i] << (i==N-1 ? \"\\n\":\" \");\n // for(int i=0;i<N;i++) cout << walk_cnt[i] << (i==N-1 ? \"\\n\":\" \");\n // for(int i=0;i<N;i++) cout << rp[i] << (i==N-1 ? \"\\n\":\" \");\n LCA lca(N,G);\n int Q;cin >> Q;\n while(Q--){\n int u,v;cin >> u >> v;u--;v--;\n int l = lca.query(u,v);\n if(l == u || l == v){\n if(l == v) swap(u,v);\n int lc1 = lca.parent(v,lca.depth(v)-lca.depth(l)-1);\n cout << rp[v]*modinv(rp[lc1])%MOD << \"\\n\";\n }\n else{\n int lc1_u = lca.parent(u,lca.depth(u)-lca.depth(l)-1);\n int lc1_v = lca.parent(v,lca.depth(v)-lca.depth(l)-1);\n ll ans = rp[u]*modinv(rp[lc1_u])%MOD*rp[v]%MOD*modinv(rp[lc1_v])%MOD;\n ans = ans*(N-sub_cnt[lc1_u]-sub_cnt[lc1_v])%MOD;\n cout << ans << \"\\n\";\n }\n }\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 29088, "score_of_the_acc": -0.7738, "final_rank": 10 }, { "submission_id": "aoj_0465_6625795", "code_snippet": "#include <cstdio>\n#include <string>\n\nnamespace nachia{\n\n\nconst unsigned int INPUT_BUF_SIZE = 6 << 20;\nconst unsigned int OUTPUT_BUF_SIZE = 2 << 20;\n\nchar input_buf[INPUT_BUF_SIZE];\n\nstruct input_buf_init{\n input_buf_init(){\n input_buf[fread(input_buf, 1, INPUT_BUF_SIZE-1, stdin)] = '\\0';\n }\n} input_buf_init_instance;\n\nstruct input_buf_iterator{\nprivate:\n unsigned int p = 0;\npublic:\n static bool is_whitespace(char ch){\n switch(ch){\n case ' ': case '\\n': case '\\r': case '\\t': return true;\n }\n return false;\n }\n void skip_whitespace(){\n while(is_whitespace(input_buf[p])) p++;\n }\n unsigned int next_uint(){\n skip_whitespace();\n unsigned int buf = 0;\n while(true){\n char tmp = input_buf[p];\n if('9' < tmp || tmp < '0') break;\n buf = buf * 10 + (tmp - '0');\n p++;\n }\n return buf;\n }\n int next_int(){\n skip_whitespace();\n if(input_buf[p] == '-'){\n p++;\n return (int)(-next_uint());\n }\n return (int)next_uint();\n }\n unsigned long long next_ulong(){\n skip_whitespace();\n unsigned long long buf = 0;\n while(true){\n char tmp = input_buf[p];\n if('9' < tmp || tmp < '0') break;\n buf = buf * 10 + (tmp - '0');\n p++;\n }\n return buf;\n }\n long long next_long(){\n skip_whitespace();\n if(input_buf[p] == '-'){\n p++;\n return (long long)(-next_ulong());\n }\n return (long long)next_ulong();\n }\n char next_char(){\n skip_whitespace();\n return input_buf[p++];\n }\n std::string next_token(){\n skip_whitespace();\n std::string buf;\n while(true){\n char ch = input_buf[p];\n if(is_whitespace(ch)) break;\n buf.push_back(ch);\n p++;\n }\n return buf;\n }\n};\n\n\nchar output_buf[OUTPUT_BUF_SIZE] = {};\n\nstruct fastoutput_table{\n char dig3lz[1000][4];\n char dig3nlz[1000][4];\n fastoutput_table(){\n for(unsigned int d=0; d<1000; d++){\n unsigned int x = d;\n unsigned int i = 0;\n dig3lz[d][i++] = ('0' + x / 100 % 10);\n dig3lz[d][i++] = ('0' + x / 10 % 10);\n dig3lz[d][i++] = ('0' + x / 1 % 10);\n dig3lz[d][i++] = '\\0';\n }\n for(unsigned int d=0; d<1000; d++){\n unsigned int x = d;\n unsigned int i = 0;\n if(x >= 100) dig3nlz[d][i++] = ('0' + x / 100 % 10);\n if(x >= 10) dig3nlz[d][i++] = ('0' + x / 10 % 10);\n if(x >= 1) dig3nlz[d][i++] = ('0' + x / 1 % 10);\n dig3nlz[d][i++] = '\\0';\n }\n }\n} fastoutput_table_inst;\n\nstruct output_buf_iterator{\n unsigned int p = 0;\n void next_char(char c){\n output_buf[p++] = c;\n }\n void next_eoln(){\n next_char('\\n');\n }\n void next_cstr(char* s){\n int i = 0;\n while(s[i]) next_char(s[i++]);\n }\n void next_dig9(unsigned int x){\n unsigned int y;\n y = x / 1'000'000; x -= y * 1'000'000;\n next_cstr(fastoutput_table_inst.dig3lz [y]);\n y = x / 1'000; x -= y * 1'000;\n next_cstr(fastoutput_table_inst.dig3lz [y]);\n y = x;\n next_cstr(fastoutput_table_inst.dig3lz [y]);\n }\n void next_uint(unsigned int x){\n unsigned int y = 0;\n if(x >= 1'000'000'000){\n y = x / 1'000'000'000; x -= y * 1'000'000'000;\n next_cstr(fastoutput_table_inst.dig3nlz[y]);\n next_dig9(x);\n }\n else if(x >= 1'000'000){\n y = x / 1'000'000; x -= y * 1'000'000;\n next_cstr(fastoutput_table_inst.dig3nlz[y]);\n y = x / 1'000; x -= y * 1'000;\n next_cstr(fastoutput_table_inst.dig3lz [y]);\n next_cstr(fastoutput_table_inst.dig3lz [x]);\n }\n else if(x >= 1'000){\n y = x / 1'000; x -= y * 1'000;\n next_cstr(fastoutput_table_inst.dig3nlz[y]);\n next_cstr(fastoutput_table_inst.dig3lz [x]);\n }\n else if(x >= 1){\n next_cstr(fastoutput_table_inst.dig3nlz[x]);\n }\n else{\n next_char('0');\n }\n }\n void next_ulong(unsigned long long x){\n unsigned int y = 0;\n if(x >= 1'000'000'000'000'000'000){\n y = x / 1'000'000'000'000'000'000; x -= (unsigned long long)y * 1'000'000'000'000'000'000;\n next_uint(y);\n y = x / 1'000'000'000; x -= (unsigned long long)y * 1'000'000'000;\n next_dig9(y);\n next_dig9(x);\n }\n else if(x >= 1'000'000'000){\n y = x / 1'000'000'000; x -= (unsigned long long)y * 1'000'000'000;\n next_uint(y);\n next_dig9(x);\n }\n else{\n next_uint(x);\n }\n }\n void write_to_file(){\n fwrite(output_buf, p, 1, stdout);\n }\n};\n\n} // namespace nachia\n\n\n#include <vector>\n#include <algorithm>\n\n\n#include <utility>\n\nnamespace nachia{\n \nstruct AdjacencyList{\npublic:\n struct AdjacencyListRange{\n using iterator = typename std::vector<int>::const_iterator;\n iterator begi, endi;\n iterator begin() const { return begi; }\n iterator end() const { return endi; }\n int size() const { return (int)std::distance(begi, endi); }\n const int& operator[](int i) const { return begi[i]; }\n };\nprivate:\n int mn;\n std::vector<int> E;\n std::vector<int> I;\npublic:\n AdjacencyList(int n, std::vector<std::pair<int,int>> edges, bool rev){\n mn = n;\n std::vector<int> buf(n+1, 0);\n for(auto [u,v] : edges){ ++buf[u]; if(rev) ++buf[v]; }\n for(int i=1; i<=n; i++) buf[i] += buf[i-1];\n E.resize(buf[n]);\n for(int i=(int)edges.size()-1; i>=0; i--){\n auto [u,v] = edges[i];\n E[--buf[u]] = v;\n if(rev) E[--buf[v]] = u;\n }\n I = std::move(buf);\n }\n AdjacencyList(const std::vector<std::vector<int>>& edges = {}){\n int n = mn = edges.size();\n std::vector<int> buf(n+1, 0);\n for(int i=0; i<n; i++) buf[i+1] = buf[i] + edges[i].size();\n E.resize(buf[n]);\n for(int i=0; i<n; i++) for(int j=0; j<(int)edges[i].size(); j++) E[buf[i]+j] = edges[i][j];\n I = std::move(buf);\n }\n static AdjacencyList from_raw(std::vector<int> targets, std::vector<int> bounds){\n AdjacencyList res;\n res.mn = bounds.size() - 1;\n res.E = std::move(targets);\n res.I = std::move(bounds);\n return res;\n }\n AdjacencyListRange operator[](int u) const {\n return AdjacencyListRange{ E.begin() + I[u], E.begin() + I[u+1] };\n }\n int num_vertices() const { return mn; }\n int size() const { return num_vertices(); }\n int num_edges() const { return E.size(); }\n AdjacencyList reversed_edges() const {\n AdjacencyList res;\n int n = res.mn = mn;\n std::vector<int> buf(n+1, 0);\n for(int v : E) ++buf[v];\n for(int i=1; i<=n; i++) buf[i] += buf[i-1];\n res.E.resize(buf[n]);\n for(int u=0; u<n; u++) for(int v : operator[](u)) res.E[--buf[v]] = u;\n res.I = std::move(buf);\n return res;\n }\n};\n\nstruct AdjacencyListEdgeIndexed{\npublic:\n struct Edge { int to; int edgeidx; };\n struct AdjacencyListRange{\n using iterator = typename std::vector<Edge>::const_iterator;\n iterator begi, endi;\n iterator begin() const { return begi; }\n iterator end() const { return endi; }\n int size() const { return (int)std::distance(begi, endi); }\n const Edge& operator[](int i) const { return begi[i]; }\n };\nprivate:\n int mn;\n std::vector<Edge> E;\n std::vector<int> I;\npublic:\n AdjacencyListEdgeIndexed(int n, const std::vector<std::pair<int,int>>& edges, bool rev){\n mn = n;\n std::vector<int> buf(n+1, 0);\n for(auto [u,v] : edges){ ++buf[u]; if(rev) ++buf[v]; }\n for(int i=1; i<=n; i++) buf[i] += buf[i-1];\n E.resize(buf[n]);\n for(int i=(int)edges.size()-1; i>=0; i--){\n auto [u,v] = edges[i];\n E[--buf[u]] = { v, i };\n if(rev) E[--buf[v]] = { u, i };\n }\n I = std::move(buf);\n }\n AdjacencyListEdgeIndexed() : AdjacencyListEdgeIndexed(0, {}, false) {}\n AdjacencyListRange operator[](int u) const {\n return AdjacencyListRange{ E.begin() + I[u], E.begin() + I[u+1] };\n }\n int num_vertices() const { return mn; }\n int size() const { return num_vertices(); }\n int num_edges() const { return E.size(); }\n AdjacencyListEdgeIndexed reversed_edges() const {\n AdjacencyListEdgeIndexed res;\n int n = res.mn = mn;\n std::vector<int> buf(n+1, 0);\n for(auto [v,i] : E) ++buf[v];\n for(int i=1; i<=n; i++) buf[i] += buf[i-1];\n res.E.resize(buf[n]);\n for(int u=0; u<n; u++) for(auto [v,i] : operator[](u)) res.E[--buf[v]] = {u,i};\n res.I = std::move(buf);\n return res;\n }\n};\n\n} // namespace nachia\n\nnamespace nachia{\n\nstruct HeavyLightDecomposition{\nprivate:\n\n int N;\n std::vector<int> P;\n std::vector<int> PP;\n std::vector<int> PD;\n std::vector<int> D;\n std::vector<int> I;\n\n std::vector<int> rangeL;\n std::vector<int> rangeR;\n\npublic:\n\n HeavyLightDecomposition(const AdjacencyList& E = AdjacencyList(1, {}, false)){\n N = E.num_vertices();\n P.assign(N, -1);\n I = {0};\n I.reserve(N);\n for(int i=0; i<(int)I.size(); i++){\n int p = I[i];\n for(int e : E[p]) if(P[p] != e){\n I.push_back(e);\n P[e] = p;\n }\n }\n std::vector<int> Z(N, 1);\n std::vector<int> nx(N, -1);\n PP.resize(N);\n for(int i=0; i<N; i++) PP[i] = i;\n for(int i=N-1; i>=1; i--){\n int p = I[i];\n Z[P[p]] += Z[p];\n if(nx[P[p]] == -1) nx[P[p]] = p;\n if(Z[nx[P[p]]] < Z[p]) nx[P[p]] = p;\n }\n\n for(int p : I) if(nx[p] != -1) PP[nx[p]] = p;\n\n PD.assign(N,N);\n PD[0] = 0;\n D.assign(N,0);\n for(int p : I) if(p != 0){\n PP[p] = PP[PP[p]];\n PD[p] = std::min(PD[PP[p]], PD[P[p]]+1);\n D[p] = D[P[p]]+1;\n }\n \n rangeL.assign(N,0);\n rangeR.assign(N,0);\n \n for(int p : I){\n rangeR[p] = rangeL[p] + Z[p];\n int ir = rangeR[p];\n for(int e : E[p]) if(P[p] != e) if(e != nx[p]){\n rangeL[e] = (ir -= Z[e]);\n }\n if(nx[p] != -1){\n rangeL[nx[p]] = rangeL[p] + 1;\n }\n }\n\n I.resize(N);\n for(int i=0; i<N; i++) I[rangeL[i]] = i;\n }\n\n int depth(int p) const { return D[p]; }\n int to_seq(int vertex) const { return rangeL[vertex]; }\n int to_vtx(int seqidx) const { return I[seqidx]; }\n int parent_of(int v) const { return P[v]; }\n int heavy_root_of(int v) const { return PP[v]; }\n int heavy_child_of(int v) const {\n if(to_seq(v) == N-1) return -1;\n int cand = to_vtx(to_seq(v) + 1);\n if(PP[v] == PP[cand]) return cand;\n return v;\n }\n\n int lca(int u, int v) const {\n if(PD[u] < PD[v]) std::swap(u, v);\n while(PD[u] > PD[v]) u = P[PP[u]];\n while(PP[u] != PP[v]){ u = P[PP[u]]; v = P[PP[v]]; }\n return (D[u] > D[v]) ? v : u;\n }\n\n int dist(int u, int v) const {\n return depth(u) + depth(v) - depth(lca(u,v)) * 2;\n }\n\n std::vector<std::pair<int,int>> path(int r, int c, bool include_root = true, bool reverse_path = false) const {\n if(PD[c] < PD[r]) return {};\n std::vector<std::pair<int,int>> res(PD[c]-PD[r]+1);\n for(int i=0; i<(int)res.size()-1; i++){\n res[i] = std::make_pair(rangeL[PP[c]], rangeL[c]+1);\n c = P[PP[c]];\n }\n if(PP[r] != PP[c] || D[r] > D[c]) return {};\n res.back() = std::make_pair(rangeL[r]+(include_root?0:1), rangeL[c]+1);\n if(res.back().first == res.back().second) res.pop_back();\n if(!reverse_path) std::reverse(res.begin(),res.end());\n else for(auto& a : res) a = std::make_pair(N - a.second, N - a.first);\n return move(res);\n }\n\n std::pair<int,int> subtree(int p){\n return std::make_pair(rangeL[p], rangeR[p]);\n }\n\n int median(int x, int y, int z) const {\n return lca(x,y) ^ lca(y,z) ^ lca(x,z);\n }\n\n int la(int from, int to, int d) const {\n if(d < 0) return -1;\n int g = lca(from,to);\n int dist0 = D[from] - D[g] * 2 + D[to];\n if(dist0 < d) return -1;\n int p = from;\n if(D[from] - D[g] < d){ p = to; d = dist0 - d; }\n while(D[p] - D[PP[p]] < d){\n d -= D[p] - D[PP[p]] + 1;\n p = P[PP[p]];\n }\n return I[rangeL[p] - d];\n }\n};\n\n} // namespace nachia\n\n\nnamespace nachia{\n\ntemplate<unsigned int MOD>\nstruct StaticModint{\nprivate:\n using u64 = unsigned long long;\n unsigned int x;\npublic:\n\n using my_type = StaticModint;\n template< class Elem >\n static Elem safe_mod(Elem x){\n if(x < 0){\n if(0 <= x+MOD) return x + MOD;\n return MOD - ((-(x+MOD)-1) % MOD + 1);\n }\n return x % MOD;\n }\n\n StaticModint() : x(0){}\n StaticModint(const my_type& a) : x(a.x){}\n template< class Elem >\n StaticModint(Elem v) : x(safe_mod(v)){}\n unsigned int operator*() const { return x; }\n my_type& operator+=(const my_type& r){ auto t = x + r.x; if(t >= MOD) t -= MOD; x = t; return *this; }\n my_type operator+(const my_type& r) const { my_type res = *this; return res += r; }\n my_type& operator-=(const my_type& r){ auto t = x + MOD - r.x; if(t >= MOD) t -= MOD; x = t; return *this; }\n my_type operator-(const my_type& r) const { my_type res = *this; return res -= r; }\n my_type operator-() const { my_type res = *this; res.x = ((res.x == 0) ? 0 : (MOD - res.x)); return res; }\n my_type& operator*=(const my_type& r){ x = (u64)x * r.x % MOD; return *this; }\n my_type operator*(const my_type& r) const { my_type res = *this; return res *= r; }\n my_type pow(unsigned long long i) const {\n my_type a = *this, res = 1;\n while(i){ if(i & 1) res *= a; a *= a; i >>= 1; }\n return res;\n }\n my_type inv() const { return pow(MOD-2); }\n unsigned int val() const { return x; }\n static unsigned int get_mod() { return MOD; }\n my_type& operator/=(const my_type& r){ return operator*=(r.inv()); }\n my_type operator/(const my_type& r) const { return operator*(r.inv()); }\n};\n\n}\n\n#include <iostream>\n#include <string>\n#include <array>\nusing namespace std;\nusing i32 = int32_t;\nusing u32 = uint32_t;\nusing i64 = int64_t;\nusing u64 = uint64_t;\n#define rep(i,n) for(int i=0; i<(int)(n); i++)\n\nconst i64 INF = 1001001001001001001;\n\nconst u32 MOD = 998244353;\n\nint main(){\n nachia::input_buf_iterator iitr;\n nachia::output_buf_iterator oitr;\n\n int N = iitr.next_uint();\n vector<pair<int,int>> edges(N-1);\n rep(i,N-1){\n int u = iitr.next_uint();\n int v = iitr.next_uint();\n u--; v--;\n edges[i] = make_pair(u,v);\n }\n\n nachia::HeavyLightDecomposition hld(nachia::AdjacencyList(N, edges, true));\n\n using Modint = nachia::StaticModint<MOD>;\n vector<int> s(N);\n for(int i=0; i<N; i++) s[i] = hld.subtree(i).second - hld.subtree(i).first;\n \n vector<Modint> inv_table(N+1, Modint(1));\n for(int i=2; i<=N; i++) inv_table[i] = -inv_table[MOD%i] * (MOD/i);\n\n vector<Modint> Prod(N, Modint(1));\n vector<Modint> inv_Prod(N, Modint(1));\n for(int seq=1; seq<N; seq++){\n int v = hld.to_vtx(seq);\n Prod[v] = Prod[hld.parent_of(v)] * (s[hld.parent_of(v)] - s[v]);\n inv_Prod[v] = inv_Prod[hld.parent_of(v)] * inv_table[s[hld.parent_of(v)] - s[v]];\n }\n\n int Q = iitr.next_uint();\n rep(qi, Q){\n int u = iitr.next_uint();\n int v = iitr.next_uint();\n u--; v--;\n Modint ans = 1;\n if(hld.depth(u) > hld.depth(v)) swap(u,v);\n int g = hld.lca(u,v);\n if(hld.parent_of(v) == u){\n ans = 1;\n }\n else if(g == u){\n int v_p = hld.la(v, g, hld.depth(v) - hld.depth(g) - 1);\n ans = inv_Prod[v_p] * Prod[v];\n }\n else{\n int u_p = hld.la(u, g, hld.depth(u) - hld.depth(g) - 1);\n int v_p = hld.la(v, g, hld.depth(v) - hld.depth(g) - 1);\n ans = Modint(N - s[u_p] - s[v_p]);\n ans *= inv_Prod[u_p] * Prod[u];\n ans *= inv_Prod[v_p] * Prod[v];\n }\n oitr.next_uint(ans.val());\n oitr.next_eoln();\n }\n oitr.write_to_file();\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 13380, "score_of_the_acc": -0.117, "final_rank": 3 }, { "submission_id": "aoj_0465_6625755", "code_snippet": "#include <vector>\n#include <algorithm>\n\n\n#include <utility>\n\nnamespace nachia{\n \nstruct AdjacencyList{\npublic:\n struct AdjacencyListRange{\n using iterator = typename std::vector<int>::const_iterator;\n iterator begi, endi;\n iterator begin() const { return begi; }\n iterator end() const { return endi; }\n int size() const { return (int)std::distance(begi, endi); }\n const int& operator[](int i) const { return begi[i]; }\n };\nprivate:\n int mn;\n std::vector<int> E;\n std::vector<int> I;\npublic:\n AdjacencyList(int n, std::vector<std::pair<int,int>> edges, bool rev){\n mn = n;\n std::vector<int> buf(n+1, 0);\n for(auto [u,v] : edges){ ++buf[u]; if(rev) ++buf[v]; }\n for(int i=1; i<=n; i++) buf[i] += buf[i-1];\n E.resize(buf[n]);\n for(int i=(int)edges.size()-1; i>=0; i--){\n auto [u,v] = edges[i];\n E[--buf[u]] = v;\n if(rev) E[--buf[v]] = u;\n }\n I = std::move(buf);\n }\n AdjacencyList(const std::vector<std::vector<int>>& edges = {}){\n int n = mn = edges.size();\n std::vector<int> buf(n+1, 0);\n for(int i=0; i<n; i++) buf[i+1] = buf[i] + edges[i].size();\n E.resize(buf[n]);\n for(int i=0; i<n; i++) for(int j=0; j<(int)edges[i].size(); j++) E[buf[i]+j] = edges[i][j];\n I = std::move(buf);\n }\n static AdjacencyList from_raw(std::vector<int> targets, std::vector<int> bounds){\n AdjacencyList res;\n res.mn = bounds.size() - 1;\n res.E = std::move(targets);\n res.I = std::move(bounds);\n return res;\n }\n AdjacencyListRange operator[](int u) const {\n return AdjacencyListRange{ E.begin() + I[u], E.begin() + I[u+1] };\n }\n int num_vertices() const { return mn; }\n int size() const { return num_vertices(); }\n int num_edges() const { return E.size(); }\n AdjacencyList reversed_edges() const {\n AdjacencyList res;\n int n = res.mn = mn;\n std::vector<int> buf(n+1, 0);\n for(int v : E) ++buf[v];\n for(int i=1; i<=n; i++) buf[i] += buf[i-1];\n res.E.resize(buf[n]);\n for(int u=0; u<n; u++) for(int v : operator[](u)) res.E[--buf[v]] = u;\n res.I = std::move(buf);\n return res;\n }\n};\n\nstruct AdjacencyListEdgeIndexed{\npublic:\n struct Edge { int to; int edgeidx; };\n struct AdjacencyListRange{\n using iterator = typename std::vector<Edge>::const_iterator;\n iterator begi, endi;\n iterator begin() const { return begi; }\n iterator end() const { return endi; }\n int size() const { return (int)std::distance(begi, endi); }\n const Edge& operator[](int i) const { return begi[i]; }\n };\nprivate:\n int mn;\n std::vector<Edge> E;\n std::vector<int> I;\npublic:\n AdjacencyListEdgeIndexed(int n, const std::vector<std::pair<int,int>>& edges, bool rev){\n mn = n;\n std::vector<int> buf(n+1, 0);\n for(auto [u,v] : edges){ ++buf[u]; if(rev) ++buf[v]; }\n for(int i=1; i<=n; i++) buf[i] += buf[i-1];\n E.resize(buf[n]);\n for(int i=(int)edges.size()-1; i>=0; i--){\n auto [u,v] = edges[i];\n E[--buf[u]] = { v, i };\n if(rev) E[--buf[v]] = { u, i };\n }\n I = std::move(buf);\n }\n AdjacencyListEdgeIndexed() : AdjacencyListEdgeIndexed(0, {}, false) {}\n AdjacencyListRange operator[](int u) const {\n return AdjacencyListRange{ E.begin() + I[u], E.begin() + I[u+1] };\n }\n int num_vertices() const { return mn; }\n int size() const { return num_vertices(); }\n int num_edges() const { return E.size(); }\n AdjacencyListEdgeIndexed reversed_edges() const {\n AdjacencyListEdgeIndexed res;\n int n = res.mn = mn;\n std::vector<int> buf(n+1, 0);\n for(auto [v,i] : E) ++buf[v];\n for(int i=1; i<=n; i++) buf[i] += buf[i-1];\n res.E.resize(buf[n]);\n for(int u=0; u<n; u++) for(auto [v,i] : operator[](u)) res.E[--buf[v]] = {u,i};\n res.I = std::move(buf);\n return res;\n }\n};\n\n} // namespace nachia\n\nnamespace nachia{\n\nstruct HeavyLightDecomposition{\nprivate:\n\n int N;\n std::vector<int> P;\n std::vector<int> PP;\n std::vector<int> PD;\n std::vector<int> D;\n std::vector<int> I;\n\n std::vector<int> rangeL;\n std::vector<int> rangeR;\n\npublic:\n\n HeavyLightDecomposition(const AdjacencyList& E = AdjacencyList(1, {}, false)){\n N = E.num_vertices();\n P.assign(N, -1);\n I = {0};\n I.reserve(N);\n for(int i=0; i<(int)I.size(); i++){\n int p = I[i];\n for(int e : E[p]) if(P[p] != e){\n I.push_back(e);\n P[e] = p;\n }\n }\n std::vector<int> Z(N, 1);\n std::vector<int> nx(N, -1);\n PP.resize(N);\n for(int i=0; i<N; i++) PP[i] = i;\n for(int i=N-1; i>=1; i--){\n int p = I[i];\n Z[P[p]] += Z[p];\n if(nx[P[p]] == -1) nx[P[p]] = p;\n if(Z[nx[P[p]]] < Z[p]) nx[P[p]] = p;\n }\n\n for(int p : I) if(nx[p] != -1) PP[nx[p]] = p;\n\n PD.assign(N,N);\n PD[0] = 0;\n D.assign(N,0);\n for(int p : I) if(p != 0){\n PP[p] = PP[PP[p]];\n PD[p] = std::min(PD[PP[p]], PD[P[p]]+1);\n D[p] = D[P[p]]+1;\n }\n \n rangeL.assign(N,0);\n rangeR.assign(N,0);\n \n for(int p : I){\n rangeR[p] = rangeL[p] + Z[p];\n int ir = rangeR[p];\n for(int e : E[p]) if(P[p] != e) if(e != nx[p]){\n rangeL[e] = (ir -= Z[e]);\n }\n if(nx[p] != -1){\n rangeL[nx[p]] = rangeL[p] + 1;\n }\n }\n\n I.resize(N);\n for(int i=0; i<N; i++) I[rangeL[i]] = i;\n }\n\n int depth(int p) const { return D[p]; }\n int to_seq(int vertex) const { return rangeL[vertex]; }\n int to_vtx(int seqidx) const { return I[seqidx]; }\n int parent_of(int v) const { return P[v]; }\n int heavy_root_of(int v) const { return PP[v]; }\n int heavy_child_of(int v) const {\n if(to_seq(v) == N-1) return -1;\n int cand = to_vtx(to_seq(v) + 1);\n if(PP[v] == PP[cand]) return cand;\n return v;\n }\n\n int lca(int u, int v) const {\n if(PD[u] < PD[v]) std::swap(u, v);\n while(PD[u] > PD[v]) u = P[PP[u]];\n while(PP[u] != PP[v]){ u = P[PP[u]]; v = P[PP[v]]; }\n return (D[u] > D[v]) ? v : u;\n }\n\n int dist(int u, int v) const {\n return depth(u) + depth(v) - depth(lca(u,v)) * 2;\n }\n\n std::vector<std::pair<int,int>> path(int r, int c, bool include_root = true, bool reverse_path = false) const {\n if(PD[c] < PD[r]) return {};\n std::vector<std::pair<int,int>> res(PD[c]-PD[r]+1);\n for(int i=0; i<(int)res.size()-1; i++){\n res[i] = std::make_pair(rangeL[PP[c]], rangeL[c]+1);\n c = P[PP[c]];\n }\n if(PP[r] != PP[c] || D[r] > D[c]) return {};\n res.back() = std::make_pair(rangeL[r]+(include_root?0:1), rangeL[c]+1);\n if(res.back().first == res.back().second) res.pop_back();\n if(!reverse_path) std::reverse(res.begin(),res.end());\n else for(auto& a : res) a = std::make_pair(N - a.second, N - a.first);\n return move(res);\n }\n\n std::pair<int,int> subtree(int p){\n return std::make_pair(rangeL[p], rangeR[p]);\n }\n\n int median(int x, int y, int z) const {\n return lca(x,y) ^ lca(y,z) ^ lca(x,z);\n }\n\n int la(int from, int to, int d) const {\n if(d < 0) return -1;\n int g = lca(from,to);\n int dist0 = D[from] - D[g] * 2 + D[to];\n if(dist0 < d) return -1;\n int p = from;\n if(D[from] - D[g] < d){ p = to; d = dist0 - d; }\n while(D[p] - D[PP[p]] < d){\n d -= D[p] - D[PP[p]] + 1;\n p = P[PP[p]];\n }\n return I[rangeL[p] - d];\n }\n};\n\n} // namespace nachia\n\n\nnamespace nachia{\n\ntemplate<unsigned int MOD>\nstruct StaticModint{\nprivate:\n using u64 = unsigned long long;\n unsigned int x;\npublic:\n\n using my_type = StaticModint;\n template< class Elem >\n static Elem safe_mod(Elem x){\n if(x < 0){\n if(0 <= x+MOD) return x + MOD;\n return MOD - ((-(x+MOD)-1) % MOD + 1);\n }\n return x % MOD;\n }\n\n StaticModint() : x(0){}\n StaticModint(const my_type& a) : x(a.x){}\n template< class Elem >\n StaticModint(Elem v) : x(safe_mod(v)){}\n unsigned int operator*() const { return x; }\n my_type& operator+=(const my_type& r){ auto t = x + r.x; if(t >= MOD) t -= MOD; x = t; return *this; }\n my_type operator+(const my_type& r) const { my_type res = *this; return res += r; }\n my_type& operator-=(const my_type& r){ auto t = x + MOD - r.x; if(t >= MOD) t -= MOD; x = t; return *this; }\n my_type operator-(const my_type& r) const { my_type res = *this; return res -= r; }\n my_type operator-() const { my_type res = *this; res.x = ((res.x == 0) ? 0 : (MOD - res.x)); return res; }\n my_type& operator*=(const my_type& r){ x = (u64)x * r.x % MOD; return *this; }\n my_type operator*(const my_type& r) const { my_type res = *this; return res *= r; }\n my_type pow(unsigned long long i) const {\n my_type a = *this, res = 1;\n while(i){ if(i & 1) res *= a; a *= a; i >>= 1; }\n return res;\n }\n my_type inv() const { return pow(MOD-2); }\n unsigned int val() const { return x; }\n static unsigned int get_mod() { return MOD; }\n my_type& operator/=(const my_type& r){ return operator*=(r.inv()); }\n my_type operator/(const my_type& r) const { return operator*(r.inv()); }\n};\n\n}\n\n#include <iostream>\n#include <string>\n#include <array>\nusing namespace std;\nusing i32 = int32_t;\nusing u32 = uint32_t;\nusing i64 = int64_t;\nusing u64 = uint64_t;\n#define rep(i,n) for(int i=0; i<(int)(n); i++)\n\nconst i64 INF = 1001001001001001001;\n\nconst u32 MOD = 998244353;\n\nint main(){\n int N; cin >> N;\n vector<pair<int,int>> edges(N-1);\n rep(i,N-1){\n int u,v; cin >> u >> v; u--; v--;\n edges[i] = make_pair(u,v);\n }\n\n nachia::HeavyLightDecomposition hld(nachia::AdjacencyList(N, edges, true));\n\n using Modint = nachia::StaticModint<MOD>;\n vector<int> s(N);\n for(int i=0; i<N; i++) s[i] = hld.subtree(i).second - hld.subtree(i).first;\n \n vector<Modint> inv_table(N+1, Modint(1));\n for(int i=2; i<=N; i++) inv_table[i] = -inv_table[MOD%i] * (MOD/i);\n\n vector<Modint> Prod(N, Modint(1));\n vector<Modint> inv_Prod(N, Modint(1));\n for(int seq=1; seq<N; seq++){\n int v = hld.to_vtx(seq);\n Prod[v] = Prod[hld.parent_of(v)] * (s[hld.parent_of(v)] - s[v]);\n inv_Prod[v] = inv_Prod[hld.parent_of(v)] * inv_table[s[hld.parent_of(v)] - s[v]];\n }\n\n int Q; cin >> Q;\n rep(qi, Q){\n int u,v; cin >> u >> v; u--; v--;\n Modint ans = 1;\n if(hld.depth(u) > hld.depth(v)) swap(u,v);\n int g = hld.lca(u,v);\n if(hld.parent_of(v) == u){\n ans = 1;\n }\n else if(g == u){\n int v_p = hld.la(v, g, hld.depth(v) - hld.depth(g) - 1);\n ans = inv_Prod[v_p] * Prod[v];\n }\n else{\n int u_p = hld.la(u, g, hld.depth(u) - hld.depth(g) - 1);\n int v_p = hld.la(v, g, hld.depth(v) - hld.depth(g) - 1);\n ans = Modint(N - s[u_p] - s[v_p]);\n ans *= inv_Prod[u_p] * Prod[u];\n ans *= inv_Prod[v_p] * Prod[v];\n }\n cout << ans.val() << '\\n';\n }\n return 0;\n}\n\n\nstruct ios_do_not_sync{\n ios_do_not_sync(){\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n }\n} ios_do_not_sync_instance;", "accuracy": 1, "time_ms": 40, "memory_kb": 9288, "score_of_the_acc": -0.0377, "final_rank": 1 }, { "submission_id": "aoj_0465_6625696", "code_snippet": "#include <vector>\n#include <algorithm>\n\n\n#include <utility>\n\nnamespace nachia{\n \nstruct AdjacencyList{\npublic:\n struct AdjacencyListRange{\n using iterator = typename std::vector<int>::const_iterator;\n iterator begi, endi;\n iterator begin() const { return begi; }\n iterator end() const { return endi; }\n int size() const { return (int)std::distance(begi, endi); }\n const int& operator[](int i) const { return begi[i]; }\n };\nprivate:\n int mn;\n std::vector<int> E;\n std::vector<int> I;\npublic:\n AdjacencyList(int n, std::vector<std::pair<int,int>> edges, bool rev){\n mn = n;\n std::vector<int> buf(n+1, 0);\n for(auto [u,v] : edges){ ++buf[u]; if(rev) ++buf[v]; }\n for(int i=1; i<=n; i++) buf[i] += buf[i-1];\n E.resize(buf[n]);\n for(int i=(int)edges.size()-1; i>=0; i--){\n auto [u,v] = edges[i];\n E[--buf[u]] = v;\n if(rev) E[--buf[v]] = u;\n }\n I = std::move(buf);\n }\n AdjacencyList(const std::vector<std::vector<int>>& edges = {}){\n int n = mn = edges.size();\n std::vector<int> buf(n+1, 0);\n for(int i=0; i<n; i++) buf[i+1] = buf[i] + edges[i].size();\n E.resize(buf[n]);\n for(int i=0; i<n; i++) for(int j=0; j<(int)edges[i].size(); j++) E[buf[i]+j] = edges[i][j];\n I = std::move(buf);\n }\n static AdjacencyList from_raw(std::vector<int> targets, std::vector<int> bounds){\n AdjacencyList res;\n res.mn = bounds.size() - 1;\n res.E = std::move(targets);\n res.I = std::move(bounds);\n return res;\n }\n AdjacencyListRange operator[](int u) const {\n return AdjacencyListRange{ E.begin() + I[u], E.begin() + I[u+1] };\n }\n int num_vertices() const { return mn; }\n int size() const { return num_vertices(); }\n int num_edges() const { return E.size(); }\n AdjacencyList reversed_edges() const {\n AdjacencyList res;\n int n = res.mn = mn;\n std::vector<int> buf(n+1, 0);\n for(int v : E) ++buf[v];\n for(int i=1; i<=n; i++) buf[i] += buf[i-1];\n res.E.resize(buf[n]);\n for(int u=0; u<n; u++) for(int v : operator[](u)) res.E[--buf[v]] = u;\n res.I = std::move(buf);\n return res;\n }\n};\n\nstruct AdjacencyListEdgeIndexed{\npublic:\n struct Edge { int to; int edgeidx; };\n struct AdjacencyListRange{\n using iterator = typename std::vector<Edge>::const_iterator;\n iterator begi, endi;\n iterator begin() const { return begi; }\n iterator end() const { return endi; }\n int size() const { return (int)std::distance(begi, endi); }\n const Edge& operator[](int i) const { return begi[i]; }\n };\nprivate:\n int mn;\n std::vector<Edge> E;\n std::vector<int> I;\npublic:\n AdjacencyListEdgeIndexed(int n, const std::vector<std::pair<int,int>>& edges, bool rev){\n mn = n;\n std::vector<int> buf(n+1, 0);\n for(auto [u,v] : edges){ ++buf[u]; if(rev) ++buf[v]; }\n for(int i=1; i<=n; i++) buf[i] += buf[i-1];\n E.resize(buf[n]);\n for(int i=(int)edges.size()-1; i>=0; i--){\n auto [u,v] = edges[i];\n E[--buf[u]] = { v, i };\n if(rev) E[--buf[v]] = { u, i };\n }\n I = std::move(buf);\n }\n AdjacencyListEdgeIndexed() : AdjacencyListEdgeIndexed(0, {}, false) {}\n AdjacencyListRange operator[](int u) const {\n return AdjacencyListRange{ E.begin() + I[u], E.begin() + I[u+1] };\n }\n int num_vertices() const { return mn; }\n int size() const { return num_vertices(); }\n int num_edges() const { return E.size(); }\n AdjacencyListEdgeIndexed reversed_edges() const {\n AdjacencyListEdgeIndexed res;\n int n = res.mn = mn;\n std::vector<int> buf(n+1, 0);\n for(auto [v,i] : E) ++buf[v];\n for(int i=1; i<=n; i++) buf[i] += buf[i-1];\n res.E.resize(buf[n]);\n for(int u=0; u<n; u++) for(auto [v,i] : operator[](u)) res.E[--buf[v]] = {u,i};\n res.I = std::move(buf);\n return res;\n }\n};\n\n} // namespace nachia\n\nnamespace nachia{\n\nstruct HeavyLightDecomposition{\nprivate:\n\n int N;\n std::vector<int> P;\n std::vector<int> PP;\n std::vector<int> PD;\n std::vector<int> D;\n std::vector<int> I;\n\n std::vector<int> rangeL;\n std::vector<int> rangeR;\n\npublic:\n\n HeavyLightDecomposition(const AdjacencyList& E = AdjacencyList(1, {}, false)){\n N = E.num_vertices();\n P.assign(N, -1);\n I = {0};\n I.reserve(N);\n for(int i=0; i<(int)I.size(); i++){\n int p = I[i];\n for(int e : E[p]) if(P[p] != e){\n I.push_back(e);\n P[e] = p;\n }\n }\n std::vector<int> Z(N, 1);\n std::vector<int> nx(N, -1);\n PP.resize(N);\n for(int i=0; i<N; i++) PP[i] = i;\n for(int i=N-1; i>=1; i--){\n int p = I[i];\n Z[P[p]] += Z[p];\n if(nx[P[p]] == -1) nx[P[p]] = p;\n if(Z[nx[P[p]]] < Z[p]) nx[P[p]] = p;\n }\n\n for(int p : I) if(nx[p] != -1) PP[nx[p]] = p;\n\n PD.assign(N,N);\n PD[0] = 0;\n D.assign(N,0);\n for(int p : I) if(p != 0){\n PP[p] = PP[PP[p]];\n PD[p] = std::min(PD[PP[p]], PD[P[p]]+1);\n D[p] = D[P[p]]+1;\n }\n \n rangeL.assign(N,0);\n rangeR.assign(N,0);\n \n for(int p : I){\n rangeR[p] = rangeL[p] + Z[p];\n int ir = rangeR[p];\n for(int e : E[p]) if(P[p] != e) if(e != nx[p]){\n rangeL[e] = (ir -= Z[e]);\n }\n if(nx[p] != -1){\n rangeL[nx[p]] = rangeL[p] + 1;\n }\n }\n\n I.resize(N);\n for(int i=0; i<N; i++) I[rangeL[i]] = i;\n }\n\n int depth(int p) const { return D[p]; }\n int to_seq(int vertex) const { return rangeL[vertex]; }\n int to_vtx(int seqidx) const { return I[seqidx]; }\n int parent_of(int v) const { return P[v]; }\n int heavy_root_of(int v) const { return PP[v]; }\n int heavy_child_of(int v) const {\n if(to_seq(v) == N-1) return -1;\n int cand = to_vtx(to_seq(v) + 1);\n if(PP[v] == PP[cand]) return cand;\n return v;\n }\n\n int lca(int u, int v) const {\n if(PD[u] < PD[v]) std::swap(u, v);\n while(PD[u] > PD[v]) u = P[PP[u]];\n while(PP[u] != PP[v]){ u = P[PP[u]]; v = P[PP[v]]; }\n return (D[u] > D[v]) ? v : u;\n }\n\n int dist(int u, int v) const {\n return depth(u) + depth(v) - depth(lca(u,v)) * 2;\n }\n\n std::vector<std::pair<int,int>> path(int r, int c, bool include_root = true, bool reverse_path = false) const {\n if(PD[c] < PD[r]) return {};\n std::vector<std::pair<int,int>> res(PD[c]-PD[r]+1);\n for(int i=0; i<(int)res.size()-1; i++){\n res[i] = std::make_pair(rangeL[PP[c]], rangeL[c]+1);\n c = P[PP[c]];\n }\n if(PP[r] != PP[c] || D[r] > D[c]) return {};\n res.back() = std::make_pair(rangeL[r]+(include_root?0:1), rangeL[c]+1);\n if(res.back().first == res.back().second) res.pop_back();\n if(!reverse_path) std::reverse(res.begin(),res.end());\n else for(auto& a : res) a = std::make_pair(N - a.second, N - a.first);\n return move(res);\n }\n\n std::pair<int,int> subtree(int p){\n return std::make_pair(rangeL[p], rangeR[p]);\n }\n\n int median(int x, int y, int z) const {\n return lca(x,y) ^ lca(y,z) ^ lca(x,z);\n }\n\n int la(int from, int to, int d) const {\n if(d < 0) return -1;\n int g = lca(from,to);\n int dist0 = D[from] - D[g] * 2 + D[to];\n if(dist0 < d) return -1;\n int p = from;\n if(D[from] - D[g] < d){ p = to; d = dist0 - d; }\n while(D[p] - D[PP[p]] < d){\n d -= D[p] - D[PP[p]] + 1;\n p = P[PP[p]];\n }\n return I[rangeL[p] - d];\n }\n};\n\n} // namespace nachia\n\n\nnamespace nachia{\n\ntemplate<unsigned int MOD>\nstruct StaticModint{\nprivate:\n using u64 = unsigned long long;\n unsigned int x;\npublic:\n\n using my_type = StaticModint;\n template< class Elem >\n static Elem safe_mod(Elem x){\n if(x < 0){\n if(0 <= x+MOD) return x + MOD;\n return MOD - ((-(x+MOD)-1) % MOD + 1);\n }\n return x % MOD;\n }\n\n StaticModint() : x(0){}\n StaticModint(const my_type& a) : x(a.x){}\n template< class Elem >\n StaticModint(Elem v) : x(safe_mod(v)){}\n unsigned int operator*() const { return x; }\n my_type& operator+=(const my_type& r){ auto t = x + r.x; if(t >= MOD) t -= MOD; x = t; return *this; }\n my_type operator+(const my_type& r) const { my_type res = *this; return res += r; }\n my_type& operator-=(const my_type& r){ auto t = x + MOD - r.x; if(t >= MOD) t -= MOD; x = t; return *this; }\n my_type operator-(const my_type& r) const { my_type res = *this; return res -= r; }\n my_type operator-() const { my_type res = *this; res.x = ((res.x == 0) ? 0 : (MOD - res.x)); return res; }\n my_type& operator*=(const my_type& r){ x = (u64)x * r.x % MOD; return *this; }\n my_type operator*(const my_type& r) const { my_type res = *this; return res *= r; }\n my_type pow(unsigned long long i) const {\n my_type a = *this, res = 1;\n while(i){ if(i & 1) res *= a; a *= a; i >>= 1; }\n return res;\n }\n my_type inv() const { return pow(MOD-2); }\n unsigned int val() const { return x; }\n static unsigned int get_mod() { return MOD; }\n my_type& operator/=(const my_type& r){ return operator*=(r.inv()); }\n my_type operator/(const my_type& r) const { return operator*(r.inv()); }\n};\n\n}\n\n#include <iostream>\n#include <string>\n#include <array>\nusing namespace std;\nusing i32 = int32_t;\nusing u32 = uint32_t;\nusing i64 = int64_t;\nusing u64 = uint64_t;\n#define rep(i,n) for(int i=0; i<(int)(n); i++)\n\nconst i64 INF = 1001001001001001001;\n\nint main(){\n int N; cin >> N;\n vector<pair<int,int>> edges(N-1);\n rep(i,N-1){\n int u,v; cin >> u >> v; u--; v--;\n edges[i] = make_pair(u,v);\n }\n\n nachia::HeavyLightDecomposition hld(nachia::AdjacencyList(N, edges, true));\n\n using Modint = nachia::StaticModint<998244353>;\n vector<int> s(N);\n for(int i=0; i<N; i++) s[i] = hld.subtree(i).second - hld.subtree(i).first;\n\n vector<Modint> Prod(N, Modint(1));\n for(int seq=1; seq<N; seq++){\n int v = hld.to_vtx(seq);\n Prod[v] = Prod[hld.parent_of(v)] * (s[hld.parent_of(v)] - s[v]);\n }\n \n vector<Modint> inv_Prod(N, Modint(1));\n for(int i=0; i<N; i++) inv_Prod[i] = Prod[i].inv();\n\n int Q; cin >> Q;\n rep(qi, Q){\n int u,v; cin >> u >> v; u--; v--;\n Modint ans = 1;\n if(hld.depth(u) > hld.depth(v)) swap(u,v);\n int g = hld.lca(u,v);\n if(hld.parent_of(v) == u){\n ans = 1;\n }\n else if(g == u){\n int v_p = hld.la(v, g, hld.depth(v) - hld.depth(g) - 1);\n ans = inv_Prod[v_p] * Prod[v];\n }\n else{\n int u_p = hld.la(u, g, hld.depth(u) - hld.depth(g) - 1);\n int v_p = hld.la(v, g, hld.depth(v) - hld.depth(g) - 1);\n ans = Modint(N - s[u_p] - s[v_p]);\n ans *= inv_Prod[u_p] * Prod[u];\n ans *= inv_Prod[v_p] * Prod[v];\n }\n cout << ans.val() << '\\n';\n }\n return 0;\n}\n\n\nstruct ios_do_not_sync{\n ios_do_not_sync(){\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n }\n} ios_do_not_sync_instance;", "accuracy": 1, "time_ms": 50, "memory_kb": 9416, "score_of_the_acc": -0.0603, "final_rank": 2 }, { "submission_id": "aoj_0465_6301834", "code_snippet": "#include <iostream>\n#include <unordered_map>\n#include <unordered_set>\n#include <set>\n#include <vector>\n#include <numeric>\n#include <algorithm>\n#include <queue>\n#include <string>\n#include <random>\n#include <array>\n#include <climits>\n#include <map>\n#include <cassert>\n#include <stack>\n#include <iomanip>\n#include <cfloat>\n\nconstexpr int MOD = 998244353;\n\nint main() {\n\tint n; std::cin >> n;\n\tstd::vector<std::pair<int, int>> edges(n - 1);\n\tfor (auto& [u, v] : edges) {\n\t\tstd::cin >> u >> v; --u; --v;\n\t}\n\tint q; std::cin >> q;\n\tstd::vector<std::pair<int, int>> queries(q);\n\tfor (auto& [u, v] : queries) {\n\t\tstd::cin >> u >> v; --u; --v;\n\t}\n\tstd::vector<std::vector<int>> graph(n);\n\tfor (const auto [u, v] : edges) {\n\t\tgraph[u].push_back(v);\n\t\tgraph[v].push_back(u);\n\t}\n\tstd::vector<int> depth(n, -1), order;\n\tstd::queue<int> queue;\n\tstd::vector<std::vector<int>> doubling(n);\n\tdepth[0] = 0;\n\tqueue.push(0);\n\twhile (!queue.empty()) {\n\t\tconst auto top = queue.front(); queue.pop();\n\t\torder.push_back(top);\n\t\tfor (const auto next : graph[top]) {\n\t\t\tif (depth[next] >= 0) continue;\n\t\t\tdepth[next] = depth[top] + 1;\n\t\t\tqueue.push(next);\n\t\t\tint parent = top;\n\t\t\tdoubling[next].push_back(parent);\n\t\t\twhile (doubling[next].size() <= doubling[parent].size()) {\n\t\t\t\tparent = doubling[parent][doubling[next].size() - 1];\n\t\t\t\tdoubling[next].push_back(parent);\n\t\t\t}\n\t\t}\n\t}\n\tconst auto ancestor = [&doubling](int node, const int diff) {\n\t\tfor (int idx = 0; idx < doubling[node].size(); ++idx) {\n\t\t\tif ((diff >> idx) & 1) {\n\t\t\t\tnode = doubling[node][idx];\n\t\t\t}\n\t\t}\n\t\treturn node;\n\t};\n\tconst auto lca = [&depth, &doubling, &ancestor](int i, int j) {\n\t\tif (depth[i] < depth[j]) {\n\t\t\tconst int diff = depth[j] - depth[i];\n\t\t\tj = ancestor(j, diff);\n\t\t}\n\t\telse if (depth[i] > depth[j]) {\n\t\t\tconst int diff = depth[i] - depth[j];\n\t\t\ti = ancestor(i, diff);\n\t\t}\n\t\tif (i == j) return i;\n\t\tfor (int idx = doubling[i].size() - 1; idx >= 0; --idx) {\n\t\t\tif (idx < doubling[i].size() && doubling[i][idx] != doubling[j][idx]) {\n\t\t\t\ti = doubling[i][idx];\n\t\t\t\tj = doubling[j][idx];\n\t\t\t}\n\t\t}\n\t\treturn doubling[i][0];\n\t};\n\tstd::reverse(order.begin(), order.end());\n\tstd::vector<int> size(n, 1);\n\tfor (const auto node : order) {\n\t\tif (node == 0) continue;\n\t\tsize[doubling[node][0]] += size[node];\n\t}\n\tstd::reverse(order.begin(), order.end());\n\tstd::vector<std::vector<long long int>> doubling_count(n);\n\tfor (const auto node : order) {\n\t\tif (node == 0) continue;\n\t\tdoubling_count[node].push_back(size[doubling[node][0]] - size[node]);\n\t\tfor (auto idx = 0; idx + 1 < doubling[node].size(); ++idx) {\n\t\t\tdoubling_count[node].push_back(doubling_count[doubling[node][idx]][idx] * doubling_count[node][idx] % MOD);\n\t\t}\n\t}\n\tconst auto calc_pass = [&doubling_count, &doubling](int node, const int diff) {\n\t\tlong long int result{ 1 };\n\t\tfor (auto idx = 0; idx < doubling_count[node].size(); ++idx) {\n\t\t\tif ((diff >> idx) & 1) {\n\t\t\t\tresult = result * doubling_count[node][idx] % MOD;\n\t\t\t\tnode = doubling[node][idx];\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t};\n\tfor (const auto [u, v] : queries) {\n\t\tconst auto a = lca(u, v);\n\t\tlong long int result{ 1 };\n\t\tif (a != u) {\n\t\t\tresult = result * calc_pass(u, depth[u] - depth[a] - 1) % MOD;\n\t\t}\n\t\tif (a != v) {\n\t\t\tresult = result * calc_pass(v, depth[v] - depth[a] - 1) % MOD;\n\t\t}\n\t\tif (a != u && a != v) {\n\t\t\tconst auto prev_u = ancestor(u, depth[u] - depth[a] - 1);\n\t\t\tconst auto prev_v = ancestor(v, depth[v] - depth[a] - 1);\n\t\t\tresult = result * (size[0] - size[prev_u] - size[prev_v]) % MOD;\n\t\t}\n\t\tstd::cout << result << '\\n';\n\t}\n}", "accuracy": 1, "time_ms": 190, "memory_kb": 44060, "score_of_the_acc": -1.3151, "final_rank": 15 }, { "submission_id": "aoj_0465_6301802", "code_snippet": "#include <iostream>\n#include <unordered_map>\n#include <unordered_set>\n#include <set>\n#include <vector>\n#include <numeric>\n#include <algorithm>\n#include <queue>\n#include <string>\n#include <random>\n#include <array>\n#include <climits>\n#include <map>\n#include <cassert>\n#include <stack>\n#include <iomanip>\n#include <cfloat>\n\nconstexpr int MOD = 998244353;\n\nint main() {\n\tint n; std::cin >> n;\n\tstd::vector<std::pair<int, int>> edges(n - 1);\n\tfor (auto& [u, v] : edges) {\n\t\tstd::cin >> u >> v; --u; --v;\n\t}\n\tint q; std::cin >> q;\n\tstd::vector<std::pair<int, int>> queries(q);\n\tfor (auto& [u, v] : queries) {\n\t\tstd::cin >> u >> v; --u; --v;\n\t}\n\tstd::vector<std::vector<int>> graph(n);\n\tfor (const auto [u, v] : edges) {\n\t\tgraph[u].push_back(v);\n\t\tgraph[v].push_back(u);\n\t}\n\tstd::vector<int> depth(n, -1), order;\n\tstd::queue<int> queue;\n\tstd::vector<std::vector<int>> doubling(n);\n\tdepth[0] = 0;\n\tqueue.push(0);\n\twhile (!queue.empty()) {\n\t\tconst auto top = queue.front(); queue.pop();\n\t\torder.push_back(top);\n\t\tfor (const auto next : graph[top]) {\n\t\t\tif (depth[next] >= 0) continue;\n\t\t\tdepth[next] = depth[top] + 1;\n\t\t\tqueue.push(next);\n\t\t\tint parent = top;\n\t\t\tdoubling[next].push_back(parent);\n\t\t\twhile (doubling[next].size() <= doubling[parent].size()) {\n\t\t\t\tparent = doubling[parent][doubling[next].size() - 1];\n\t\t\t\tdoubling[next].push_back(parent);\n\t\t\t}\n\t\t}\n\t}\n\tconst auto ancestor = [&doubling](int node, const int diff) {\n\t\tfor (int idx = 0; idx < doubling[node].size(); ++idx) {\n\t\t\tif ((diff >> idx) & 1) {\n\t\t\t\tnode = doubling[node][idx];\n\t\t\t}\n\t\t}\n\t\treturn node;\n\t};\n\tconst auto lca = [&depth, &doubling, &ancestor](int i, int j) {\n\t\tif (depth[i] < depth[j]) {\n\t\t\tconst int diff = depth[j] - depth[i];\n\t\t\tj = ancestor(j, diff);\n\t\t}\n\t\telse if (depth[i] > depth[j]) {\n\t\t\tconst int diff = depth[i] - depth[j];\n\t\t\ti = ancestor(i, diff);\n\t\t}\n\t\tif (i == j) return i;\n\t\tfor (int idx = doubling[i].size() - 1; idx >= 0; --idx) {\n\t\t\tif (doubling[i][idx] != doubling[j][idx]) {\n\t\t\t\ti = doubling[i][idx];\n\t\t\t\tj = doubling[j][idx];\n\t\t\t}\n\t\t}\n\t\treturn doubling[i][0];\n\t};\n\tstd::reverse(order.begin(), order.end());\n\tstd::vector<int> size(n, 1);\n\tfor (const auto node : order) {\n\t\tif (node == 0) continue;\n\t\tsize[doubling[node][0]] += size[node];\n\t}\n\tstd::reverse(order.begin(), order.end());\n\tstd::vector<std::vector<long long int>> doubling_count(n);\n\tfor (const auto node : order) {\n\t\tif (node == 0) continue;\n\t\tdoubling_count[node].push_back(size[doubling[node][0]] - size[node]);\n\t\tfor (auto idx = 0; idx + 1 < doubling[node].size(); ++idx) {\n\t\t\tdoubling_count[node].push_back(doubling_count[doubling[node][idx]][idx] * doubling_count[node][idx] % MOD);\n\t\t}\n\t}\n\tconst auto calc_pass = [&doubling_count, &doubling](int node, const int diff) {\n\t\tlong long int result{ 1 };\n\t\tfor (auto idx = 0; idx < doubling_count[node].size(); ++idx) {\n\t\t\tif ((diff >> idx) & 1) {\n\t\t\t\tresult = result * doubling_count[node][idx] % MOD;\n\t\t\t\tnode = doubling[node][idx];\n\t\t\t}\n\t\t}\n\t\treturn result;\n\t};\n\tfor (const auto [u, v] : queries) {\n\t\tconst auto a = lca(u, v);\n\t\tlong long int result{ 1 };\n\t\tif (a != u) {\n\t\t\tresult = result * calc_pass(u, depth[u] - depth[a] - 1) % MOD;\n\t\t}\n\t\tif (a != v) {\n\t\t\tresult = result * calc_pass(v, depth[v] - depth[a] - 1) % MOD;\n\t\t}\n\t\tif (a != u && a != v) {\n\t\t\tconst auto prev_u = ancestor(u, depth[u] - depth[a] - 1);\n\t\t\tconst auto prev_v = ancestor(v, depth[v] - depth[a] - 1);\n\t\t\tresult = result * (size[0] - size[prev_u] - size[prev_v]) % MOD;\n\t\t}\n\t\tstd::cout << result << '\\n';\n\t}\n}", "accuracy": 0.85, "time_ms": 170, "memory_kb": 44256, "score_of_the_acc": -1.283, "final_rank": 20 }, { "submission_id": "aoj_0465_6002935", "code_snippet": "#include<iostream>\n#include<string>\n#include<iomanip>\n#include<cmath>\n#include<vector>\n#include<algorithm>\n\nusing namespace std;\n\n#define int long long\n\nconstexpr int MOD = 998244353;\nconstexpr int INF = (1<<30);\n\n\nstruct edge{\n\tint to, num;\n\t\n\tedge(int to = 0, int num = 0): to(to), num(num) {}\n\tedge(const edge &e) { to = e.to; num = e.num;};\n\t\n\tbool operator < (const edge &e) const {\n\t\treturn num < e.num;\n\t}\n};\n\n\nvector<vector<edge>> G;\n\n\nvector<int> con, num, c;\nvector<int> depth;\nvector<vector<int>> table;\n\nvoid dfs(int node, int per, int dep, int &n){\n\t\n\ttable[0][node] = per;\n\tdepth[node] = dep;\n\tcon[node] = 1;\n\tnum[node] = n++;\n\t\n\tfor(edge &e : G[node]){\n\t\tif(e.to == per) {\n\t\t\te.num = -1;\n\t\t\tcontinue;\n\t\t}\n\t\tdfs(e.to, node, dep+1, n);\n\t\tcon[node] += con[e.to];\n\t\te.num = num[e.to];\n\t}\n}\n\nvoid dfs2(int node, int per){\n\t\n\tfor(edge &e : G[node]){\n\t\tif(e.to == per) {\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tc[e.to] = c[node] * (MOD + con[node] - con[e.to]) % MOD;\n\t\tdfs2(e.to, node);\n\t}\n}\n\nvoid init(int V){\n\t\n\tint logV = 1;\n\t\n\tfor(int i = 1; i <= V; i <<= 1, logV++);\n\t\n\tdepth.resize(V+1);\n\ttable.resize(logV, vector<int>(V+1,-1));\n\tcon.resize(V+1);\n\tnum.resize(V+1);\n\tc.resize(V+1, 1);\n\t\n\tint n = 0;\n\t\n\tdfs(1, -1, 0, n);\n\tdfs2(1, -1);\n\t\n\tfor(int k = 0; k + 1 < logV; k++){\n\t\tfor(int v = 0; v <= V; v++){\n\t\t\tif(table[k][v] < 0) table[k+1][v] = -1;\n\t\t\telse table[k+1][v] = table[k][table[k][v]];\n\t\t}\n\t}\n}\n\nint lca(int u, int v){\n\t\n\tif(depth[u] > depth[v]) swap(u, v);\n\tfor(int k = 0; k < table.size(); k++){\n\t\tif((depth[v] - depth[u]) >> k & 1){\n\t\t\tv = table[k][v];\n\t\t}\n\t}\n\t\n\tif(u == v) return u; \n\t\n\tfor(int k = table.size()-1; k >= 0; k--){\n\t\tif(table[k][u] != table[k][v]){\n\t\t\tu = table[k][u];\n\t\t\tv = table[k][v];\n\t\t}\n\t}\n\t\n\treturn table[0][u];\n}\n\nlong long power(long long x, long long n){\n\tlong long ans = 1;\n\tfor(;n;n >>= 1, x *= x, ans %= MOD, x %= MOD) if(n&1)ans*=x;\n\treturn ans % MOD;\n}\n\nsigned main(){\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\t\n\tint N, Q;\n\t\n\tcin>>N;\n\t\n\tG.resize(N+1);\n\t\n\tfor(int i = 0; i < N-1; i++){\n\t\tint s, t;\n\t\tcin>>s>>t;\n\t\t\n\t\tG[s].push_back(edge(t, 0));\n\t\tG[t].push_back(edge(s, 0));\n\t}\n\t\n\tinit(N+1);\n\t\n\tfor(int i = 1; i <= N; i++){\n\t\tsort(G[i].begin(), G[i].end());\n\t}\n\t\n\tcin>>Q;\n\t\n\tfor(int i = 0; i < Q; i++){\n\t\tint u, v;\n\t\t\n\t\tcin>>u>>v;\n\t\t\n\t\tif(depth[u] > depth[v]) swap(u, v);\n\t\t\n\t\tint w = lca(u, v), ans, a = -2, b = -2;\n\t\t\n\t\tb = upper_bound(G[w].begin(), G[w].end(), edge(0, num[v])) - G[w].begin();\n\t\tb = G[w][b-1].to;\n\t\t\n\t\tif(u == w) {\n\t\t\tans = c[v] * power(c[b], MOD-2) % MOD;\n\t\t} else {\n\t\t\ta = upper_bound(G[w].begin(), G[w].end(), edge(0, num[u])) - G[w].begin();\n\t\t\ta = G[w][a-1].to;\n\t\t\t\n\t\t\tans = c[v] * c[u] % MOD;\n\t\t\tans = (ans * ((MOD + con[w]%MOD - con[a]%MOD - con[b]%MOD + N - con[w]%MOD) % MOD)) % MOD;\n\t\t\tans = (ans * power((c[a] * c[b]) % MOD, MOD-2)) % MOD;\n\t\t}\n\t\t\n\t\tcout<<ans<<endl;\n\t}\n\t\n\treturn 0;\n}", "accuracy": 1, "time_ms": 180, "memory_kb": 35156, "score_of_the_acc": -1.0416, "final_rank": 13 }, { "submission_id": "aoj_0465_5981205", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n//#define MOD 1000000007\n#define EPS 0.000000001\n\n\n#define MOD 998244353\n#define SIZE 100005\n\n\nstruct Info{\n\tInfo(int arg_node_id,int arg_DEP){\n\t\tnode_id = arg_node_id;\n\t\tDEP = arg_DEP;\n\t}\n\tbool operator<(const struct Info& arg) const{\n\n\t\treturn DEP > arg.DEP; //深さの■降順■\n\t}\n\tint node_id,DEP;\n};\n\nstruct Data{\n\tint parent,head,depth;\n\tll size;\n};\n\nint N;\nint IND,num_chain = 0;\nint INDEX[SIZE];\nll K;\nData DATA[SIZE];\nvector<int> G[SIZE];\nvector<Info> info[SIZE];\nmap<int,int> HEAD; //HEAD[headのnode番号] := 鎖のid\nmap<int,pair<int,int>> MAP; //MAP[ノード番号] = (鎖のid,鎖の中でのindex)\nll** rui;\nll num_nodes[SIZE];\n\n\n//LCA\nint root = 0;\nint MAX_LOG_V = 17;\nint POW[18];\n\nint PARENT[18][SIZE],DEPTH[SIZE];\n\nvoid rec(int node,int pre){\n\n\tnum_nodes[node] = 1;\n\n\tfor(int i = 0; i < G[node].size(); i++){\n\n\t\tint child = G[node][i];\n\t\tif(child == pre)continue;\n\n\t\trec(child,node);\n\t\tnum_nodes[node] += num_nodes[child];\n\t}\n}\n\nint getChain_id(int head){\n\n\tauto at = HEAD.find(head);\n\tif(at == HEAD.end()){\n\n\t\tHEAD[head] = num_chain++;\n\t}\n\n\treturn HEAD[head];\n}\n\n\nint makeTree(int node_id,int pre,int depth){\n\n\tPARENT[0][node_id] = pre;\n\tDEPTH[node_id] = depth;\n\n\tDATA[node_id].depth = depth; //深さ\n\tDATA[node_id].parent = pre; //親\n\tDATA[node_id].size = 1; //部分木のノード数(自分&子孫)\n\n\tint child;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tchild = G[node_id][i];\n\t\tif(child == pre)continue;\n\n\t\tDATA[node_id].size += makeTree(child,node_id,depth+1);\n\t}\n\n\treturn DATA[node_id].size;\n}\n\nvoid HLD(int node_id,int head,int pre){\n\n\tINDEX[node_id] = IND++;\n\tDATA[node_id].head = head; //node_idが属する鎖のhead\n\n\tint chain_id = getChain_id(head);\n\tinfo[chain_id].push_back(Info(node_id,DEPTH[node_id]));\n\n\n\t//子の中で、最大の重み(部分木のノード数)を持つものを探す\n\tint maxi = -BIG_NUM;\n\tint max_node = -1;\n\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint child = G[node_id][i];\n\t\tif(child == pre)continue;\n\n\t\tif(maxi < DATA[child].size){\n\n\t\t\tmaxi = DATA[child].size;\n\t\t\tmax_node = child;\n\t\t}\n\t}\n\n\tif(max_node == -1){ //子なし\n\n\t\treturn;\n\t}\n\n\t//最大の重みを持つ子へ(headは変わらず:同じ鎖の上だから)\n\tHLD(max_node,head,node_id);\n\n\t//その他の子を処理(新しい鎖を作る)\n\tfor(int i = 0; i < G[node_id].size(); i++){\n\n\t\tint child = G[node_id][i];\n\t\tif(child == pre || child == max_node)continue;\n\n\t\tHLD(child,child,node_id);\n\t}\n}\n\nint lca(int left,int right){\n\n\tif(DEPTH[left] > DEPTH[right])swap(left,right);\n\n\tfor(int k = MAX_LOG_V-1; k >= 0; k--){\n\t\tif(DEPTH[right]-DEPTH[left] >= POW[k]){\n\t\t\tright = PARENT[k][right];\n\t\t}\n\t}\n\n\tif(left == right)return left;\n\n\tfor(int k = MAX_LOG_V-1; k >= 0; k--){\n\t\tif(PARENT[k][left] == PARENT[k][right]){\n\t\t\t//Do nothing\n\t\t}else{\n\t\t\tleft = PARENT[k][left];\n\t\t\tright = PARENT[k][right];\n\t\t}\n\t}\n\treturn PARENT[0][left];\n}\n\nll extgcd(ll a,ll b,ll &x,ll &y){\n\tll d = a;\n\tif(b != 0){\n\t\td = extgcd(b,a%b,y,x);\n\t\ty -= (a/b)*x;\n\t}else{\n\t\tx = 1;\n\t\ty = 0;\n\t}\n\treturn d;\n}\n\nll mod_inverse(ll a,ll m){\n ll x,y;\n extgcd(a,m,x,y);\n return (m+x%m)%m;\n}\n\n\nll calc(int start,int goal){\n\n\tint now = DATA[start].parent;\n\n\t//startの1つ上からgoalの1つ手前までの場合の数を掛けていく\n\n\tif(now == goal){\n\n\t\treturn 1;\n\t}\n\n\tint base_depth = DEPTH[goal]+1;\n\tll ret = num_nodes[now]-num_nodes[start];\n\n\twhile(true){\n\n\t\tint head = DATA[now].head;\n\t\tint chain_id = MAP[now].first;\n\t\tint from = MAP[now].second;\n\n\t\tif(DEPTH[head] >= base_depth){ //鎖の端まで掛けて良い\n\n\t\t\tint to = MAP[head].second;\n\t\t\tll mult = rui[chain_id][to]*mod_inverse(rui[chain_id][from],MOD);\n\t\t\tmult %= MOD;\n\n\t\t\tret *= mult;\n\t\t\tret %= MOD;\n\n\t\t\tif(DEPTH[head] == base_depth){\n\n\t\t\t\treturn ret;\n\t\t\t}\n\n\t\t\tnow = head;\n\n\t\t}else{ //鎖上にgoalの1つ手間がある\n\n\t\t\tint to = MAP[goal].second-1;\n\t\t\tll mult = rui[chain_id][to]*mod_inverse(rui[chain_id][from],MOD);\n\n\t\t\tmult %= MOD;\n\n\t\t\tret *= mult;\n\t\t\tret %= MOD;\n\n\t\t\treturn ret;\n\n\t\t}\n\n\t\t//現在headにいる(次の鎖へ)\n\t\tint tmp_p = PARENT[0][head];\n\t\tret *= num_nodes[tmp_p]-num_nodes[head];\n\n\t\tret %= MOD;\n\n\t\tnow = tmp_p;\n\t}\n\n\treturn ret;\n}\n\n//fromからgoalへ向かう際の、goalの1つ手前のノードを取得する関数\nint get_pre_node(int from,int goal){\n\n\tint from_depth = DEPTH[from];\n\tint to_depth = DEPTH[goal]+1;\n\n\tif(from_depth == to_depth){\n\n\t\treturn from;\n\t}\n\n\tint now = from;\n\n\tint diff = from_depth-to_depth;\n\n\tfor(int i = MAX_LOG_V-1; i >= 0; i--){\n\t\tif(diff < POW[i])continue;\n\n\t\tdiff -= POW[i];\n\t\tnow = PARENT[i][now];\n\n\t\tif(diff == 0)break;\n\t}\n\n\treturn now;\n\n}\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i <= MAX_LOG_V; i++){\n\n\t\tPOW[i] = POW[i-1]*2;\n\t}\n\n\tscanf(\"%d\",&N);\n\n\tint a,b;\n\n\tfor(int i = 0; i < N-1; i++){\n\n\t\tscanf(\"%d %d\",&a,&b);\n\n\t\ta--;\n\t\tb--;\n\n\t\tG[a].push_back(b);\n\t\tG[b].push_back(a);\n\t}\n\n\trec(root,-1);\n\tmakeTree(root,-1,0); //深さ,親,部分木サイズ計算\n\tIND = 0;\n\tHLD(root,root,-1); //鎖の作成(0スタートでdfs木を作ったので、0がrootとなる)\n\n\t//lca計算用\n\tfor(int k = 0; k + 1 < MAX_LOG_V; k++){\n\t\tfor(int node_id = 0; node_id < N; node_id++){\n\t\t\tif(PARENT[k][node_id] < 0){\n\n\t\t\t\tPARENT[k+1][node_id] = -1;\n\n\t\t\t}else{\n\n\t\t\t\tPARENT[k+1][node_id] = PARENT[k][PARENT[k][node_id]];\n\t\t\t}\n\t\t}\n\t}\n\n\trui = new ll*[num_chain];\n\n\t//鎖ごとに、経路数の累積積を作る\n\tfor(int i = 0; i < num_chain; i++){\n\n\t\tsort(info[i].begin(),info[i].end());\n\n\t\tfor(int k = 0; k < info[i].size(); k++){\n\n\t\t\tMAP[info[i][k].node_id] = make_pair(i,k+1);\n\t\t}\n\n\t\trui[i] = new ll [info[i].size()+1];\n\n\t\trui[i][0] = 1; //ダミー\n\t\trui[i][1] = 1;\n\t\tint pre = info[i][0].node_id;\n\n\t\tfor(int k = 1; k < info[i].size(); k++){\n\n\t\t\t//pre方向以外の部分木サイズ\n\t\t\tint now = info[i][k].node_id;\n\t\t\tll num = num_nodes[now]-num_nodes[pre];\n\t\t\trui[i][k+1] = num;\n\t\t\trui[i][k+1] *= rui[i][k];\n\t\t\trui[i][k+1] %= MOD;\n\n\t\t\tpre = now;\n\t\t}\n\t}\n\n\tint num_Q;\n\tscanf(\"%d\",&num_Q);\n\n\tll ans;\n\tll ALL = N;\n\n\tfor(int loop = 0; loop < num_Q; loop++){\n\n\t\tscanf(\"%d %d\",&a,&b);\n\t\ta--;\n\t\tb--;\n\n\t\tint LCA = lca(a,b);\n\n\t\tif(LCA == a || LCA == b){\n\n\t\t\tif(LCA == a){\n\n\t\t\t\tswap(a,b); //bを根方向にする\n\t\t\t}\n\n\t\t\tans = calc(a,b);\n\n\t\t}else{\n\n\t\t\tans = (calc(a,LCA)*calc(b,LCA))%MOD;\n\n\t\t\t//■■パス上の親の1つ手前までの部分木サイズを引く■■\n\t\t\tint pre_a = get_pre_node(a,LCA);\n\t\t\tint pre_b = get_pre_node(b,LCA);\n\n\t\t\tll mult = (ALL-num_nodes[LCA]); //根方向\n\t\t\tmult += (num_nodes[LCA]-(num_nodes[pre_a]+num_nodes[pre_b])); //パス以外の葉方向\n\n\t\t\tans *= mult;\n\t\t\tans %= MOD;\n\t\t}\n\n\t\tprintf(\"%lld\\n\",ans);\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 550, "memory_kb": 38564, "score_of_the_acc": -1.8372, "final_rank": 19 }, { "submission_id": "aoj_0465_5981134", "code_snippet": "#include <iostream>\n#include <vector>\n#include <functional>\n#include <algorithm>\n#include <functional>\nusing namespace std;\n\n// last common ancestor\nclass LCA\n{\n int n;\npublic:\n vector<int> D;\n vector<vector<int>> P;\n\n LCA(vector<vector<int>> E, int root)\n {\n n = (int)E.size();\n P = vector<vector<int>>(n);\n D = vector<int>(n);\n\n function<void (int, int, int)> f = [&](int c, int p, int d)\n {\n D[c] = d;\n\n if (d>0)\n P[c].push_back(p);\n for (int i=1; 1<<i<=d; i++)\n P[c].push_back(P[P[c][i-1]][i-1]);\n\n for (int e: E[c])\n if (e != p)\n f(e, c, d+1);\n };\n f(root, -1, 0);\n }\n\n int query(int a, int b)\n {\n if (D[a]>D[b])\n swap(a, b);\n\n int d = D[b]-D[a];\n for (int i=0; d>0; i++)\n {\n if (d&1)\n b = P[b][i];\n d >>= 1;\n }\n\n if (a==b)\n return a;\n\n int i = 0;\n while (1<<(i+1)<=D[a])\n i++;\n for (; i>=0; i--)\n if (1<<i<=D[a] && P[a][i]!=P[b][i])\n {\n a = P[a][i];\n b = P[b][i];\n }\n\n if (D[a]>0)\n a = P[a][0];\n return a;\n }\n};\n\n// a^b % m\nlong long powmod(long long a, long long b, long long m)\n{\n long long r = 1;\n for (; b>0; b>>=1, a=a*a%m)\n if (b&1)\n r = r*a%m;\n return r;\n}\n\n// mを法とするxの逆数\nlong long inv(long long x, long long m)\n{\n return powmod(x, m-2, m);\n}\n\nint main()\n{\n int N;\n cin>>N;\n vector<vector<int>> E(N);\n for (int i=0; i<N-1; i++)\n {\n int s, t;\n cin>>s>>t;\n E[s-1].push_back(t-1);\n E[t-1].push_back(s-1);\n }\n\n LCA lca(E, 0);\n // D[x]: 頂点xの深さ\n vector<int> D = lca.D;\n // P[x][y]: 頂点xの1<<y個上の頂点\n vector<vector<int>> P = lca.P;\n\n // S[x]: 頂点xを根とする部分木の頂点数\n vector<int> S(N);\n function<void(int, int)> fS = [&](int c, int p)\n {\n S[c] = 1;\n for (int e: E[c])\n if (e!=p)\n {\n fS(e, c);\n S[c] += S[e];\n }\n };\n fS(0, -1);\n\n // 頂点xの祖先で深さがdの頂点を返す\n function<int(int, int)> ancestor = [&](int x, int d)\n {\n int d2 = D[x]-d;\n for (int i=0; d2>0; i++, d2>>=1)\n if (d2&1)\n x = P[x][i];\n return x;\n };\n\n long long MOD = 998244353;\n\n // T[x]: 根を自宅、会社を頂点xとしたときの問題の条件を満たす通勤経路数\n vector<long long> T(N);\n function<void(int, int)> fT = [&](int c, int p)\n {\n if (p==-1 || p==0)\n T[c] = 1;\n else\n T[c] = T[p]*(S[p]-S[c])%MOD;\n for (int e: E[c])\n if (e!=p)\n fT(e, c);\n };\n fT(0, -1);\n\n int Q;\n cin>>Q;\n for (int q=0; q<Q; q++)\n {\n int u, v;\n cin>>u>>v;\n u--, v--;\n\n // 最小共通祖先\n int a = lca.query(u, v);\n if (u==a)\n {\n // vがuの子孫\n int pv = ancestor(v, D[a]+1);\n cout<<T[v]*inv(T[pv], MOD)%MOD<<endl;\n }\n else if (v==a)\n {\n // uがvの子孫\n int pu = ancestor(u, D[a]+1);\n cout<<T[u]*inv(T[pu], MOD)%MOD<<endl;\n }\n else\n {\n // 最小共通祖先からuやvに向かって1個辿った頂点\n int pu = ancestor(u, D[a]+1);\n int pv = ancestor(v, D[a]+1);\n\n // uからaに向かう途中の寄り道／aからvに向かう途中の寄り道\n long long au = T[u]*inv(T[pu], MOD)%MOD;\n long long av = T[v]*inv(T[pv], MOD)%MOD;\n // aでの寄り道\n long long aa = N-S[pu]-S[pv];\n\n cout<<au*av%MOD*aa%MOD<<endl;\n }\n }\n}", "accuracy": 1, "time_ms": 320, "memory_kb": 41972, "score_of_the_acc": -1.5007, "final_rank": 17 } ]
aoj_0460_cpp
Fundraising Street Mr. Tokuichi has come up with the idea of making a Buddha statue for the people of the Isua region and has decided to raise funds for the project. He plans to travel along a road known as the "fundraising road," a road that is said to collect donations well when traveled. A fund-raising highway is a straight line of towns lined up along the highway, numbered from 1 in order from the town at the beginning to the town at the end. The towns are numbered from one to the last, starting with town 1. Then he moves on to town 2, town 3, and so on. Mr. Tokuichi can collect donations in all towns, but he must follow the rules below. Mr. Tokuichi sets a target amount of donations to be collected in each town. Once he has raised the amount of money he set for that town, he will move on to the next town. It is possible to set the target amount to be collected in a certain town to zero and not collect donations in that town, but it is not possible to set the target amount to a negative value. The target amount in town 1 is either 0 yen or 1 yen. The target amount in any town other than town 1 must be either an increase of 1 yen, a decrease of 1 yen, or the same amount as the target amount in the immediately preceding town. Some towns have gates and are further subject to the following rules. In towns with a customs office, Tokuichi must notify the customs office of the target amount of money to be collected in that town. When the amount of money reported matches the amount of money set by each customs office, the fund-raising activity is allowed to continue in that town, and the journey to the next town is allowed to continue. If the amount of money reported does not match the amount set by each customs office, the fundraising activities in that town will not be allowed and the trip must end there. For example, let's say there is a customs office in town 3 and the amount of money set there is 2 yen. In this case, if the target amount in towns 1, 2, and 3 is 1 yen, 2 yen, and 2 yen, respectively, the target amount in town 3 will match the amount set at the customs office. Mr. Tokuichi has found out the amount of money set for each barrier. Based on this information, he is trying to figure out how to set a target amount to maximize the total amount of donations collected. Given the number of towns along the street, the number of the town with the customs office, and the amount of money specified for each customs office, create a program that calculates the maximum total amount of donations that Tokuichi can collect. Input Input is given in the following format. $N$ $M$ $a_1$ $b_1$ $a_2$ $b_2$ : $a_M$ $b_M$ In the first line, we are given the number of towns along the road, $N$ ($1 \leq N \leq 1,000,000,000$), and the number of customs offices, $M$ ($1 \leq M \leq $min($N, 100000$)). The following $M$ line gives the number of the town where the customs office is located, $a_i$ ($1 \leq a_i \leq N$), and the amount of money specified for that c ...(truncated)
[ { "submission_id": "aoj_0460_10875372", "code_snippet": "#include<bits/stdc++.h>\n#include <climits>\nusing namespace std;\n#define ll long long \n#define ld long double\n#define rep(i,N) for(int i=0;i<(int)N;i++)\n#define all(x) x.begin(),x.end()\n#define fi first\n#define se second\n#define pb push_back\n\nint main(){\n ll N,M;cin>>N>>M;\n ll nm = 1;ll bef = 1;\n ll ans = 0;ll nsc = 0;\n vector<ll>A,B;\n rep(i,M){\n ll a,b;cin>>a>>b;\n A.pb(a);B.pb(b);\n }\n rep(i,M){\n ll a=A[i],b=B[i];\n ll len = a-bef;\n ans = max(ans,nsc+nm*(len)+(len-1)*len/2);\n if(abs(nm-b)>len)break;\n ll st = max(nm,b)+1;\n if(b==nm){\n len--;\n if(len>=0)nsc+=b;\n }\n if(b>nm){\n len-=(b-nm)+1;\n nsc += (b+nm)*(b-nm+1)/2;\n if(len<0)nsc-=b;\n }\n if(b<nm){\n len-=(nm-b)+1;\n nsc += (b+nm)*(nm-b+1)/2;\n nsc+=nm;nsc-=b;\n if(len<0)nsc-=nm;\n }\n if(len>=1)nsc+=st*len;\n if(len%2==1&&len>=1)nsc+=(len)/2;\n if(len>=2)nsc += (len/2)*((len)/2-1);\n bef = a;\n nm = b;\n ans = max(ans,nsc);\n // cout<<nsc<<\":\"<<nm<<\":\"<<bef<<endl;\n if(i==M-1){\n len = N-a+1;\n ans = max(ans,nsc+nm*(len)+(len-1)*len/2);\n }\n }\n nm = 0;bef = 1;\n nsc = 0;\n rep(i,M){\n ll a=A[i],b=B[i];\n ll len = a-bef;\n ans = max(ans,nsc+nm*(len)+(len-1)*len/2);\n if(abs(nm-b)>len)break;\n ll st = max(nm,b)+1;\n if(b==nm){\n len--;\n if(len>=0)nsc+=b;\n }\n if(b>nm){\n len-=(b-nm)+1;\n nsc += (b+nm)*(b-nm+1)/2;\n if(len<0)nsc-=b;\n }\n if(b<nm){\n len-=(nm-b)+1;\n nsc += (b+nm)*(nm-b+1)/2;\n nsc+=nm;nsc-=b;\n if(len<0)nsc-=nm;\n }\n if(len>=1)nsc+=st*len;\n if(len%2==1&&len>=1)nsc+=(len)/2;\n if(len>=2)nsc += (len/2)*((len)/2-1);\n bef = a;\n nm = b;\n ans = max(ans,nsc);\n // cout<<nsc<<\":\"<<nm<<\":\"<<bef<<endl;\n if(i==M-1){\n len = N-a+1;\n ans = max(ans,nsc+nm*(len)+(len-1)*len/2);\n }\n }\n cout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 4892, "score_of_the_acc": -1.1095, "final_rank": 12 }, { "submission_id": "aoj_0460_10875368", "code_snippet": "#include<bits/stdc++.h>\n#include <climits>\nusing namespace std;\n#define ll long long \n#define ld long double\n#define rep(i,N) for(int i=0;i<(int)N;i++)\n#define all(x) x.begin(),x.end()\n#define fi first\n#define se second\n#define pb push_back\n\nint main(){\n ll N,M;cin>>N>>M;\n ll nm = 1;ll bef = 1;\n ll ans = 0;ll nsc = 0;\n vector<ll>A,B;\n rep(i,M){\n ll a,b;cin>>a>>b;\n A.pb(a);B.pb(b);\n }\n rep(i,M){\n ll a=A[i],b=B[i];\n ll len = a-bef;\n ans = max(ans,nsc+nm*(len)+(len-1)*len/2);\n if(abs(nm-b)>len)break;\n ll st = max(nm,b)+1;\n if(b==nm){\n len--;\n nsc+=b;\n }\n if(b>nm){\n len-=(b-nm)+1;\n nsc += (b+nm)*(b-nm+1)/2;\n if(len<0)nsc-=b;\n }\n if(b<nm){\n len-=(nm-b)+1;\n nsc += (b+nm)*(nm-b+1)/2;\n nsc+=nm;nsc-=b;\n if(len<0)nsc-=nm;\n }\n if(len>=1)nsc+=st*len;\n if(len%2==1&&len>=1)nsc+=(len)/2;\n if(len>=2)nsc += (len/2)*((len)/2-1);\n bef = a;\n nm = b;\n ans = max(ans,nsc);\n // cout<<nsc<<\":\"<<nm<<\":\"<<bef<<endl;\n if(i==M-1){\n len = N-a+1;\n ans = max(ans,nsc+nm*(len)+(len-1)*len/2);\n }\n }\n nm = 0;bef = 1;\n nsc = 0;\n rep(i,M){\n ll a=A[i],b=B[i];\n ll len = a-bef;\n ans = max(ans,nsc+nm*(len)+(len-1)*len/2);\n if(abs(nm-b)>len)break;\n ll st = max(nm,b)+1;\n if(b==nm){\n len--;\n nsc+=b;\n }\n if(b>nm){\n len-=(b-nm)+1;\n nsc += (b+nm)*(b-nm+1)/2;\n if(len<0)nsc-=b;\n }\n if(b<nm){\n len-=(nm-b)+1;\n nsc += (b+nm)*(nm-b+1)/2;\n nsc+=nm;nsc-=b;\n if(len<0)nsc-=nm;\n }\n if(len>=1)nsc+=st*len;\n if(len%2==1&&len>=1)nsc+=(len)/2;\n if(len>=2)nsc += (len/2)*((len)/2-1);\n bef = a;\n nm = b;\n ans = max(ans,nsc);\n // cout<<nsc<<\":\"<<nm<<\":\"<<bef<<endl;\n if(i==M-1){\n len = N-a+1;\n ans = max(ans,nsc+nm*(len)+(len-1)*len/2);\n }\n }\n cout<<ans<<endl;\n}", "accuracy": 0.6896551724137931, "time_ms": 40, "memory_kb": 4752, "score_of_the_acc": -1.0756, "final_rank": 19 }, { "submission_id": "aoj_0460_10873227", "code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#define int long long\nusing namespace std;\nsigned main()\n{\n int n,m;\n cin >> n >> m;\n vector<pair<int,int>>town(m);\n for(int i=0;i<m;i++)cin >> town[i].first >> town[i].second;\n town.push_back(make_pair(0,0));\n town.push_back(make_pair(n,1e9+1));\n sort(town.begin(),town.end());\n m+=2;\n\n long long ans=0;\n long long current=0;\n for(int i=0;i<m-1;i++){\n long long now=town[i].second;\n\n {\n int cnt=town[i+1].first-town[i].first;\n if(town[i+1].first==n && town[i+1].second==1e9+1)cnt++;\n ans=max(ans,current+(now+now+cnt-1)*cnt/2);\n\n if(now+cnt<town[i+1].second || now-cnt>town[i+1].second)break;\n }\n\n int left=now,right=1e9+1;\n while(left+1!=right){\n int mid=(left+right)/2;\n\n\n int cnt=mid-now;\n int cnt2=mid-town[i+1].second;\n\n if(town[i].first+cnt+cnt2<=town[i+1].first)left=mid;\n else right=mid;\n }\n\n int cnt=left-now;\n int cnt2=left-town[i+1].second;\n\n long long count=0;\n if(town[i].first+cnt+cnt2+1<=town[i+1].first)count+=left;\n count+=(now+left)*(cnt+1)/2;\n count+=(left+town[i+1].second+1)*cnt2/2;\n\n count-=left;\n current+=count;\n \n ans=max(ans,current);\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 7236, "score_of_the_acc": -1.9273, "final_rank": 18 }, { "submission_id": "aoj_0460_10873187", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr int BIG_INT = 1'000'000'100;\nconstexpr long BIG_LONG = 1'000'000'000'000'000'100;\n\nlong range_sum(long l, long r) { return (r - l + 1) * (r + l) / 2; }\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int n, m;\n cin >> n >> m;\n vector ab(m, make_pair(0, 0l));\n for (auto& [a, b] : ab) {\n cin >> a >> b;\n a--;\n }\n\n long ans = -1;\n\n long now = 0;\n long moku = 0;\n long town = -1;\n bool flag = true;\n for (int i = 0; i < m; i++) {\n long towns_to_go = ab[i].first - town;\n ans = max(ans, now + range_sum(moku + 1, moku + towns_to_go - 1));\n\n if (ab[i].second > moku + towns_to_go ||\n ab[i].second < moku - towns_to_go) {\n flag = false;\n break;\n }\n\n if (ab[i].second >= moku) {\n if (ab[i].second > moku) now += range_sum(moku + 1, ab[i].second);\n int rem = towns_to_go - (ab[i].second - moku);\n if (rem == 1) {\n now += ab[i].second;\n } else if (rem >= 2) {\n if (rem % 2 == 1) {\n now += range_sum(ab[i].second + 1, ab[i].second + rem / 2) +\n range_sum(ab[i].second, ab[i].second + rem / 2);\n } else {\n now += range_sum(ab[i].second + 1, ab[i].second + rem / 2) +\n range_sum(ab[i].second, ab[i].second + rem / 2 - 1);\n }\n }\n } else {\n now += range_sum(ab[i].second, moku);\n int rem = towns_to_go - (moku - ab[i].second + 1);\n if (rem == -1) {\n now -= moku;\n } else if (rem == 1) {\n now += moku + 1;\n } else if (rem > 1) {\n if (rem % 2 == 1) {\n now += range_sum(moku + 1, moku + rem / 2 + 1) +\n range_sum(moku + 1, moku + rem / 2);\n } else {\n now += range_sum(moku + 1, moku + rem / 2) +\n range_sum(moku + 1, moku + rem / 2);\n }\n }\n }\n town = ab[i].first;\n moku = ab[i].second;\n ans = max(ans, now);\n // cout << now << endl;\n }\n if (flag) {\n ans = max(ans, now + range_sum(moku + 1, moku + (n - 1 - town)));\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4636, "score_of_the_acc": -0.2975, "final_rank": 4 }, { "submission_id": "aoj_0460_10866852", "code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, l, n) for(int i = (int)(l); i < (int)(n); i++)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n\ntemplate<class T> bool chmin(T &a, T b) {if(a > b) {a = b; return true;} return false;}\ntemplate<class T> bool chmax(T &a, T b) {if(a < b) {a = b; return true;} return false;}\ntemplate<class T> using spq = priority_queue<T, vector<T>, greater<T>>;\n\n//bool -> Yes/No\nstring answer(const bool b) {return b ? \"Yes\" : \"No\";}\n\nvoid fix(int k) {cout << fixed << setprecision(k);}\n\nconst int inf = 2e9;\nconst long long INF = 2e18;\nconst long double eps = 1e-12;\nint dx[] = {1, 0, -1, 0, 1, 1, -1, -1}, dy[] = {0, -1, 0, 1, 1, -1, 1, -1};\n\nvoid main_program() {\n long long n; int m; cin >> n >> m;\n long long from = 0, last = 0;\n long long sum = 0;\n long long final_ans = 0;\n for(int _ = 0; _ <= m; _++) {\n long long d, to;\n if(_ < m) cin >> d >> to;\n else d = n + 1, to = INF;\n long long dist = d - last;\n bool fin = false;\n chmax(final_ans, sum + dist * (dist - 1) / 2 + from * dist);\n if(abs(from - to) > dist) {\n // 無理\n break;\n }\n else if((dist - abs(from - to)) & 1) {\n // 途中平\n long long p = (to + dist - from - 1) >> 1;\n long long z = p * (p - 1) / 2 + from * p;\n z += (from + p);\n p = dist - p - 1;\n z += p * (p - 1) / 2 + (to + 1) * p;\n sum += z;\n }\n else {\n // 角\n long long p = (to + dist - from) >> 1;\n long long z = p * (p - 1) / 2 + from * p;\n p = dist - p;\n z += p * (p - 1) / 2 + (to + 1) * p;\n sum += z;\n }\n last = d;\n from = to;\n chmax(final_ans, sum);\n }\n cout << final_ans << \"\\n\";\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int t = 1;\n //cin >> t;\n while(t--) main_program();\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3432, "score_of_the_acc": -0.0058, "final_rank": 1 }, { "submission_id": "aoj_0460_10849037", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <numbers>\n#include <cassert>\n#include <numeric>\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pint = pair<int, int>;\ntemplate<typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\ntemplate<typename T>\nbool chmax(T & a, const T & b) { if (a < b) { a = b; return true; } return false; }\ntemplate<typename T>\nbool chmin(T & a, const T & b) { if (a > b) { a = b; return true; } return false; }\nconst int inf = 1e9;\nconst ll linf = 1e18;\nint main() {\n int n, m; cin >> n >> m;\n int town = 0, donate = 0;\n ll total = 0, ans = 0;\n auto sum = [&](ll fst, ll lst, ll len) {\n return len * (fst + lst) / 2;\n };\n rep(i, m) {\n int a, b; cin >> a >> b;\n int dist = a - town;\n chmax(ans, total + sum(donate, donate + dist - 1, dist) - donate);\n if (abs(donate - b) > dist) {\n cout << total + sum(donate, donate + dist - 1, dist) - donate << endl;\n return 0;\n }\n dist -= abs(donate - b);\n total += sum(donate, b, abs(donate - b) + 1) - donate;\n if (dist != 0) {\n int base = max(donate, b);\n total += base;\n dist--;\n total += sum(base + 1, base + dist / 2, dist / 2) * 2;\n if (dist % 2)total += base + dist / 2 + 1;\n }\n chmax(ans, total);\n town = a;\n donate = b;\n }\n int dist = n - town;\n chmax(ans, total + sum(donate, donate + dist, dist + 1) - donate);\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3584, "score_of_the_acc": -0.5426, "final_rank": 7 }, { "submission_id": "aoj_0460_10844953", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n// #include<atcoder/all>\n// using mint = atcoder::modint998244353;\nusing ld = long double;\n#define fi first\n#define se second\n#define all(x) x.begin(),x.end()\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\ntemplate<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}\ntemplate<typename T>bool chmax(T&a,T b){return b>a?(a=b,1):0;}\n\nlong tsum(long s, long t){\n if(s>t) return 0;\n return (s+t)*(t-s+1)/2;\n}\noptional<long> f(long l, long r, long w){\n if(r-l>w) return nullopt;\n long ret=0;\n long t=r+(w-(r-l))/2;\n ret+=tsum(l, t);\n ret+=tsum(r, t);\n if((w-(r-l))%2==0) ret-=t;\n return ret;\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n int N,M;\n cin>>N>>M;\n\n long a=0,b=0;\n long cur=0;\n long ans=0;\n rep(i,M+1){\n if(i==M){\n chmax(ans, cur+tsum(b+1, b+(N-a)));\n break;\n }\n long na,nb;\n cin>>na>>nb;\n chmax(ans, cur+tsum(b+1, b+(na-a-1)));\n int fl=0;\n if(b>nb) fl=1, swap(b,nb); \n auto r=f(b, nb, na-a);\n if(fl) swap(b, nb);\n\n if(r.has_value()){\n cur+=r.value();\n cur-=b;\n }\n else{\n break;\n }\n a=na;\n b=nb;\n }\n\n cout<<ans<<\"\\n\";\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3584, "score_of_the_acc": -0.0426, "final_rank": 2 }, { "submission_id": "aoj_0460_10796856", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define ld long double\n#define INF 1e18\nint main(){\n \n ll n,m,ans,sub=0;cin>>n>>m;\n vector<pair<ll,ll>> x(m+2,{1,1});\n for(ll i=1;i<=m;i++)cin>>x[i].first>>x[i].second;\n if(x[1].first==1&&x[1].second<2)x[0].second=x[1].second;\n ans=x[0].second;\n for(ll i=0;i<=m;i++){\n ll a=x[i].second,b=x[i+1].second,f=x[i+1].first-x[i].first,d=a+f-b,c;\n if(i==m){\n f=n-x[i].first;\n ans+=(a*2+f)*(f+1)/2-a;\n }\n else if(b<a-f||a+f<b){\n ans+=(a*2+f)*(f+1)/2-a*2-f;\n break;\n }\n else if(d%2==0){\n d/=2;\n c=f-d-1;\n sub=max(sub,ans+(a*2+f)*(f+1)/2-a*2-f);\n ans+=(a*2+c)*(c+1)/2+(b*2+d)*(d+1)/2-a;\n }else{\n d/=2;\n c=f-d-1;\n sub=max(sub,ans+(a*2+f)*(f+1)/2-a*2-f);\n ans+=(a*2+c)*(c+1)/2+(b*2+d)*(d+1)/2-a;\n }\n }\n cout<<max(ans,sub)<<endl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 4608, "score_of_the_acc": -1.0407, "final_rank": 10 }, { "submission_id": "aoj_0460_9626042", "code_snippet": "#include <bits/stdc++.h>\nusing ll = long long;\nusing namespace std;\n#define rep(i, n) for (ll i = 0; i < n; ++i)\nll INFL = 1e18;\ntemplate<typename T> bool chmax(T& a, const T& b) { if (a < b) {a = b; return true;} return false; }\nint main() {\n ll n,m; cin >> n >> m;\n vector<ll> a(m), b(m);\n rep(i, m) cin >> a[i] >> b[i];\n a.push_back(n+1);\n b.push_back(0);\n auto calc_max = [&] (ll w, ll l, ll r) -> tuple<ll,ll,bool> {\n ll mx1 = (l + 1 + l + w) * w / 2;\n if (r < l - w || r > l + w) return {mx1, -INFL, false};\n ll mid = (l + w + r) / 2;\n ll mx2 = 0;\n if (mid - l + mid - r + 1 != w) mx2 -= mid;\n mx2 += (l + 1 + mid) * (mid - l) / 2;\n mx2 += (r + mid) * (mid - r + 1) / 2;\n return {mx1, mx2, true};\n };\n ll ai(0), bi(0);\n ll ans = 0;\n ll cur = 0;\n rep(i, m+1) {\n auto [mx1, mx2, ok] = calc_max(a[i] - ai, bi, b[i]);\n if (!ok) {\n chmax(ans, cur + mx1 - (bi + a[i] - ai));\n break;\n }\n chmax(ans, cur + max(mx1 - (bi + a[i] - ai), mx2));\n cur += mx2;\n ai = a[i];\n bi = b[i];\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 5464, "score_of_the_acc": -1.2481, "final_rank": 14 }, { "submission_id": "aoj_0460_9625885", "code_snippet": "//line 2 \"/home/seekworser/.cpp_lib/competitive_library/competitive/std/std.hpp\"\n#include <bits/stdc++.h>\n#ifndef LOCAL_TEST\n#pragma GCC target (\"avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#endif // LOCAL_TEST\nusing namespace std;\n// 型名の短縮\nusing ll = long long;\nusing pii = pair<int, int>; using pll = pair<ll, ll>;\nusing vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;\nusing vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;\nusing vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;\nusing vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;\nusing vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;\nusing vs = vector<string>; using vvs = vector<vector<string>>; using vvvs = vector<vector<vector<string>>>;\ntemplate<typename T> vector<vector<T>> vv(int h, int w, T val = T()) { return vector(h, vector<T>(w, val)); }\ntemplate<typename T> vector<vector<vector<T>>> vvv(int h1, int h2, int h3, T val = T()) { return vector(h1, vector(h2, vector<T>(h3, val))); }\ntemplate<typename T> vector<vector<vector<vector<T>>>> vvvv(int h1, int h2, int h3, int h4, T val = T()) { return vector(h1, vector(h2, vector(h3, vector<T>(h4, val)))); }\ntemplate <class T> using priority_queue_min = priority_queue<T, vector<T>, greater<T>>;\n// 定数の定義\nconstexpr double PI = 3.14159265358979323;\nconstexpr int INF = 100100111; constexpr ll INFL = 3300300300300300491LL;\nfloat EPS = 1e-8; double EPSL = 1e-16;\ntemplate<typename T> bool eq(const T x, const T y) { return x == y; }\ntemplate<> bool eq<double>(const double x, const double y) { return abs(x - y) < EPSL; }\ntemplate<> bool eq<float>(const float x, const float y) { return abs(x - y) < EPS; }\ntemplate<typename T> bool neq(const T x, const T y) { return !(eq<T>(x, y)); }\ntemplate<typename T> bool ge(const T x, const T y) { return (eq<T>(x, y) || (x > y)); }\ntemplate<typename T> bool le(const T x, const T y) { return (eq<T>(x, y) || (x < y)); }\ntemplate<typename T> bool gt(const T x, const T y) { return !(le<T>(x, y)); }\ntemplate<typename T> bool lt(const T x, const T y) { return !(ge<T>(x, y)); }\nconstexpr int MODINT998244353 = 998244353;\nconstexpr int MODINT1000000007 = 1000000007;\n// 入出力高速化\nstruct Nyan { Nyan() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } nyan;\n// 汎用マクロの定義\n#define all(a) (a).begin(), (a).end()\n#define sz(x) ((ll)(x).size())\n#define rep1(n) for(ll dummy_iter = 0LL; dummy_iter < n; ++dummy_iter) // 0 から n-1 まで昇順\n#define rep2(i, n) for(ll i = 0LL, i##_counter = 0LL; i##_counter < ll(n); ++(i##_counter), (i) = i##_counter) // 0 から n-1 まで昇順\n#define rep3(i, s, t) for(ll i = ll(s), i##_counter = ll(s); i##_counter < ll(t); ++(i##_counter), (i) = (i##_counter)) // s から t まで昇順\n#define rep4(i, s, t, step) for(ll i##_counter = step > 0 ? ll(s) : -ll(s), i##_end = step > 0 ? ll(t) : -ll(t), i##_step = abs(step), i = ll(s); i##_counter < i##_end; i##_counter += i##_step, i = step > 0 ? i##_counter : -i##_counter) // s から t まで stepずつ\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define repe(a, v) for(auto& a : (v)) // v の全要素（変更可能）\n#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod\n#define sdiv(n, m) (((n) - smod(n, m)) / (m)) // 非負div\n#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去\nint Yes(bool b=true) { cout << (b ? \"Yes\\n\" : \"No\\n\"); return 0; };\nint YES(bool b=true) { cout << (b ? \"YES\\n\" : \"NO\\n\"); return 0; };\nint No(bool b=true) {return Yes(!b);};\nint NO(bool b=true) {return YES(!b);};\ntemplate<typename T, size_t N> T max(array<T, N>& a) { return *max_element(all(a)); };\ntemplate<typename T, size_t N> T min(array<T, N>& a) { return *min_element(all(a)); };\ntemplate<typename T> T max(vector<T>& a) { return *max_element(all(a)); };\ntemplate<typename T> T min(vector<T>& a) { return *min_element(all(a)); };\ntemplate<typename T> vector<T> accum(const vector<T>& a) { vector<T> rev(sz(a)+1, 0); rep(i, sz(a)) rev[i+1] = rev[i] + a[i]; return rev; };\ntemplate<typename T> vector<T> vec_slice(const vector<T>& a, int l, int r) { vector<T> rev; rep(i, l, r) rev.push_back(a[i]); return rev; };\ntemplate<typename T> T sum(vector<T>& a, T zero = T(0)) { T rev = zero; rep(i, sz(a)) rev += a[i]; return rev; };\ntemplate<typename T> bool in_range(const T& val, const T& s, const T& t) { return s <= val && val < t; };\n\ntemplate <class T> inline vector<T>& operator--(vector<T>& v) { repe(x, v) --x; return v; }\ntemplate <class T> inline vector<T>& operator++(vector<T>& v) { repe(x, v) ++x; return v; }\n\n// modでのpow\nll powm(ll a, ll n, ll mod=INFL) {\n ll res = 1;\n while (n > 0) {\n if (n & 1) res = (res * a) % mod;\n if (n > 1) a = (a * a) % mod;\n n >>= 1;\n }\n return res;\n}\n// 整数Sqrt\nll sqrtll(ll x) {\n assert(x >= 0);\n ll rev = sqrt(x);\n while(rev * rev > x) --rev;\n while((rev+1) * (rev+1)<=x) ++rev;\n return rev;\n}\ntemplate <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新（更新されたら true を返す）\ntemplate <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新（更新されたら true を返す）\nint digit(ll x, int d=10) { int rev=0; while (x > 0) { rev++; x /= d;}; return rev; } // xのd進数桁数\n/**\n * @brief std.hpp\n * @docs docs/std/std.md\n */\n//line 3 \"/home/seekworser/.cpp_lib/competitive_library/competitive/std/io.hpp\"\n// 演算子オーバーロード（プロトタイプ宣言）\ntemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p);\ntemplate <class T> inline istream& operator>>(istream& is, vector<T>& v);\ntemplate <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p);\ntemplate <class T> inline ostream& operator<<(ostream& os, const vector<T>& v);\ntemplate <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp);\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &st);\ntemplate <typename T> ostream &operator<<(ostream &os, const multiset<T> &st);\ntemplate <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st);\ntemplate <typename T> ostream &operator<<(ostream &os, queue<T> q);\ntemplate <typename T> ostream &operator<<(ostream &os, deque<T> q);\ntemplate <typename T> ostream &operator<<(ostream &os, stack<T> st);\ntemplate <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq);\n\n// 演算子オーバーロード\ntemplate <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }\ntemplate <class T> inline istream& operator>>(istream& is, vector<T>& v) { repe(x, v) is >> x; return is; }\ntemplate <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p) { os << p.first << \" \" << p.second; return os; }\ntemplate <class T> inline ostream& operator<<(ostream& os, const vector<T>& v) { rep(i, sz(v)) { os << v.at(i); if (i != sz(v) - 1) os << \" \"; } return os; }\ntemplate <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp) { for (auto &[key, val] : mp) { os << key << \":\" << val << \" \"; } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? \" \" : \"\"); itr++; } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? \" \" : \"\"); itr++; } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st) { ll cnt = 0; for (auto &e : st) { os << e << (++cnt != (int)st.size() ? \" \" : \"\"); } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, queue<T> q) { while (q.size()) { os << q.front() << \" \"; q.pop(); } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, deque<T> q) { while (q.size()) { os << q.front() << \" \"; q.pop_front(); } return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, stack<T> st) { while (st.size()) { os << st.top() << \" \"; st.pop(); } return os; }\ntemplate <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq) { while (pq.size()) { os << pq.top() << \" \"; pq.pop(); } return os; }\n\ntemplate <typename T> int print_sep_end(string sep, string end, const T& val) { (void)sep; cout << val << end; return 0; };\ntemplate <typename T1, typename... T2> int print_sep_end(string sep, string end, const T1 &val, const T2 &...remain) {\n cout << val << sep;\n print_sep_end(sep, end, remain...);\n return 0;\n};\ntemplate <typename... T> int print(const T &...args) { print_sep_end(\" \", \"\\n\", args...); return 0; };\ntemplate <typename... T> void flush() { cout << flush; };\ntemplate <typename... T> int print_and_flush(const T &...args) { print(args...); flush(); return 0; };\n#define debug(...) debug_func(0, #__VA_ARGS__, __VA_ARGS__) // debug print\ntemplate <typename T> void input(T &a) { cin >> a; };\ntemplate <typename T1, typename... T2> void input(T1&a, T2 &...b) { cin >> a; input(b...); };\n#ifdef LOCAL_TEST\ntemplate <typename T> void debug_func(int i, const T name) { (void)i; (void)name; cerr << endl; }\ntemplate <typename T1, typename T2, typename... T3> void debug_func(int i, const T1 &name, const T2 &a, const T3 &...b) {\n int scope = 0;\n for ( ; (scope != 0 || name[i] != ',') && name[i] != '\\0'; i++ ) {\n cerr << name[i];\n if (name[i] == '(' || name[i] == '{') scope++;\n if (name[i] == ')' || name[i] == '}') scope--;\n }\n cerr << \":\" << a << \" \";\n debug_func(i + 1, name, b...);\n}\ntemplate <typename T1, typename T2, typename... T3> void debug_func(int i, const T1 &name, T2 &a, T3 &...b) {\n int scope = 0;\n for ( ; (scope != 0 || name[i] != ',') && name[i] != '\\0'; i++ ) {\n cerr << name[i];\n if (name[i] == '(' || name[i] == '{') scope++;\n if (name[i] == ')' || name[i] == '}') scope--;\n }\n cerr << \":\" << a << \" \";\n debug_func(i + 1, name, b...);\n}\n#endif\n#ifndef LOCAL_TEST\ntemplate <typename... T>\nvoid debug_func(T &...) {}\ntemplate <typename... T>\nvoid debug_func(const T &...) {}\n#endif\n/**\n * @brief io.hpp\n * @docs docs/std/io.md\n */\n//line 3 \"answer.cpp\"\nint main() {\n ll n,m; input(n, m);\n vl a(m), b(m);\n rep(i, m) input(a[i], b[i]);\n a.push_back(n+1);\n b.push_back(0);\n auto calc_max = [&] (ll w, ll l, ll r) -> tuple<ll,ll,bool> {\n ll mx1 = (l + 1 + l + w) * w / 2;\n if (r < l - w || r > l + w) return {mx1, -INFL, false};\n ll mid = (l + w + r) / 2;\n debug(mid);\n ll mx2 = 0;\n if (mid - l + mid - r + 1 != w) mx2 -= mid;\n mx2 += (l + 1 + mid) * (mid - l) / 2;\n mx2 += (r + mid) * (mid - r + 1) / 2;\n return {mx1, mx2, true};\n };\n ll ai(0), bi(0);\n ll ans = 0;\n ll cur = 0;\n rep(i, m+1) {\n auto [mx1, mx2, ok] = calc_max(a[i] - ai, bi, b[i]);\n debug(mx1, mx2, ok);\n if (!ok) {\n chmax(ans, cur + mx1 - (bi + a[i] - ai));\n break;\n }\n chmax(ans, cur + max(mx1 - (bi + a[i] - ai), mx2));\n cur += mx2;\n ai = a[i];\n bi = b[i];\n }\n print(ans);\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5440, "score_of_the_acc": -0.4922, "final_rank": 6 }, { "submission_id": "aoj_0460_9625857", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define all(v) (v).begin(),(v).end()\n#define pb(a) push_back(a)\n#define rep(i, n) for(int i=0;i<n;i++)\n#define foa(e, v) for(auto& e : v)\nusing ll = long long;\nconst ll MOD7 = 1000000007, MOD998 = 998244353, INF = (1LL << 60);\n#define dout(a) cout<<fixed<<setprecision(10)<<a<<endl;\n\nll sum(ll Min, ll Max) {\n Min --;\n return Max * (Max + 1) / 2 - Min * (Min + 1) / 2;\n}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n ll n, m;\n cin >> n >> m;\n ll ans = 0, s = 0;\n ll p = 0, now = 0;\n vector<ll> x(m), y(m);\n rep(i, m) cin >> x[i] >> y[i];\n rep(_, m) {\n ll a = x[_], b = y[_];\n {\n //chmax\n ll Ma = a - p - 1;\n ans = max(ans, s + sum(now + 1, now + Ma));\n }\n if(a - p < abs(now - b)) {\n cout << ans << endl;\n return 0;\n }\n ll num = (a - p - abs(now - b));\n ll c = num / 2;\n\n ll Ma = max(now, b) + c;\n if(num & 1) {\n s += sum(now + 1, Ma);\n s += sum(b, Ma);\n } else {\n s += sum(now + 1, Ma);\n s += sum(b, Ma - 1);\n }\n ans = max(ans, s);\n now = b;\n p = a;\n }\n {\n ll Ma = n - p + now;\n s += sum(now + 1, Ma);\n ans = max(s, ans);\n }\n cout << ans << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4612, "score_of_the_acc": -0.2917, "final_rank": 3 }, { "submission_id": "aoj_0460_9624602", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nlong long n, m, a, b, s = 0, t = 0, u = 0, w = 0;\nbool f = 1;\n\nvoid sum(int c, int d) {\n\tif (f) {\n\t\tw = max(w, u + (t * 2 + c - s) * (c - s - 1) / 2);\n\n\t\tif (b < t - a + s || b > t + a - s)\n\t\t\tf = 0;\n\t\telse {\n\t\t\tu += (t * 2 + c - s + 1) * (c - s) / 2;\n\n\t\t\tlong long v = t + c - s - d;\n\n\t\t\tif (v % 2 == 0)\n\t\t\t\tu -= v * (v + 2) / 4;\n\t\t\telse\n\t\t\t\tu -= (v + 1) * (v + 1) / 4;\n\n\t\t\ts = c;\n\t\t\tt = d;\n\t\t}\n\t}\n}\n\nint main()\n{\n\tcin >> n >> m;\n\n\tfor (int i = 0; i < m; i++) {\n\t\tcin >> a >> b;\n\n\t\tsum(a, b);\n\t}\n\n\tsum(n, t + n - s);\n\tcout << max(u, w) << endl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3408, "score_of_the_acc": -0.75, "final_rank": 8 }, { "submission_id": "aoj_0460_9624571", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<(n);++i)\n#define reps(i,n) for(int i=1;i<=(n);++i)\n#define all(x) begin(x), end(x)\n#define Fixed fixed << setprecision(12)\n#define int int_fast64_t\nusing pii = pair<int,int>;\nconstexpr int32_t INF = 0x3f3f3f3f;\nconstexpr int_fast64_t LINF = 0x3f3f3f3f3f3f3f3fll;\nconstexpr int mod1 = 1e9+7;\nconstexpr int mod2 = 998244353;\n\ntemplate <class Func>\nclass FixPoint : Func {\npublic:\n explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}\n\n template <class... Args>\n constexpr decltype(auto) operator()(Args&&... args) const {\n return Func::operator()(*this, std::forward<Args>(args)...);\n }\n};\n\ntemplate <class Func>\nstatic inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {\n return FixPoint<Func>{forward<Func>(f)};\n}\n\ntemplate <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }\ntemplate <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }\n\ntemplate <class T> using max_heap = priority_queue<T>;\ntemplate <class T> using min_heap = priority_queue<T,vector<T>,greater<T> >;\ntemplate <class A, class B> using umap = unordered_map<A,B>;\n\ntemplate <class T> inline void bye(T x) { cout << x << '\\n'; exit(0); }\n\ninline int square(int a){ return a * a;}\ninline int updiv(int a,int b){ return (a + b - 1) / b; }\n\nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1};\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1};\n\nsigned main(void){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n int n, m;\n cin >> n >> m;\n\n vector<int> a(m), b(m);\n\n for (int i = 0; i < m; ++i) {\n cin >> a[i] >> b[i];\n }\n\n a.insert(a.begin(), 0);\n b.insert(b.begin(), 0);\n a.emplace_back(n + 1);\n b.emplace_back(LINF);\n m += 2;\n\n int sum = 0, res = 0;\n for (int i = 1; i < m; ++i) {\n int len = a[i] - a[i - 1];\n int diff = b[i] - b[i - 1];\n chmax(res, sum + b[i - 1] * (len - 1) + len * (len - 1) / 2);\n if (len < abs(diff)) break;\n int u = (len + diff) / 2;\n int d = (len - diff) / 2;\n sum += u * b[i - 1];\n sum += d * b[i];\n sum += u * (u + 1) / 2;\n sum += d * (d - 1) / 2;\n if (u + d != len) {\n sum += b[i - 1] + u;\n }\n }\n\n cout << res << '\\n';\n\n return (0);\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5436, "score_of_the_acc": -0.4913, "final_rank": 5 }, { "submission_id": "aoj_0460_9620227", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n long long n, m;\n cin >> n >> m;\n long long a[m + 2], b[m + 2];\n long long sum = 1;\n for (int i = 1; i <= m; i++) {\n cin >> a[i] >> b[i];\n }\n a[0] = 1;\n b[0] = 1;\n a[m + 1] = n + 1;\n b[m + 1] = 1000000000000001LL;\n int start = 1;\n if (a[1] == 1) {\n start = 2;\n if (b[1] == 0) {\n sum = 0;\n } else if (b[1] == 1) {\n sum = 1;\n } else {\n cout << 0 << \"\\n\";\n return(0);\n }\n }\n vector<long long> ans;\n for (int i = start; i <= m + 1; i++) {\n //そのまま上まで行く\n long long x = b[i - 1] + (a[i] - a[i - 1]) - 1; //上側\n long long y = b[i - 1] + 1; //下側\n ans.push_back(sum + (x - y + 1) * (x + y) / 2LL);\n // cout << \"! \" << sum + (x - y + 1) * (x + y) / 2LL << \"\\n\";\n //うまく調整する m ~ n: (n - m + 1) * (m + n) / 2\n if (a[i] - a[i - 1] < abs(b[i] - b[i - 1])) {\n break;\n }\n long long Max = (a[i] - a[i - 1] + b[i] + b[i - 1]) / 2LL;\n long long l = (Max - b[i - 1]);\n long long r = (Max - b[i]);\n long long mid = (a[i] - a[i - 1]) - (l + r);\n // cout << Max << \" \" << l << \" \" << mid << \" \" << r << \"\\n\";\n x = Max;\n y = Max - (l - 1);\n if (y < 0) {\n break;\n }\n sum += (x - y + 1) * (x + y) / 2LL;\n // cout << x << \" \" << y << \" \" << Max << \" \" << sum << \"\\n\";\n sum += (mid - 1) * Max;\n // cout << sum << \"\\n\";\n x = Max;\n y = Max - r;\n if (y < 0) {\n break;\n }\n sum += (x - y + 1) * (x + y) / 2LL;\n // cout << x << \" \" << y << \" \" << Max << \" \" << sum << \"\\n\";\n ans.push_back(sum);\n // cout << sum << \"\\n\";\n // cout << \"---------\\n\";\n }\n sort(ans.rbegin(), ans.rend());\n cout << ans[0] << \"\\n\";\n return(0);\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 6684, "score_of_the_acc": -1.5436, "final_rank": 15 }, { "submission_id": "aoj_0460_9620142", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n, m;\n cin >> n >> m;\n long long a[m + 2], b[m + 2];\n long long sum = 1;\n for (int i = 1; i <= m; i++) {\n cin >> a[i] >> b[i];\n }\n a[0] = 1;\n b[0] = 1;\n a[m + 1] = n + 1;\n b[m + 1] = 1000000001LL;\n int start = 1;\n if (a[1] == 1) {\n start = 2;\n }\n if (a[1] == 1) {\n if (b[1] == 0) {\n sum = 0;\n } else if (b[1] == 1) {\n sum = 1;\n } else {\n cout << 0 << \"\\n\";\n return(0);\n }\n }\n vector<long long> ans;\n for (int i = start; i <= m + 1; i++) {\n //そのまま上まで行く\n long long x = b[i - 1] + (a[i] - a[i - 1]) - 1; //上側\n long long y = b[i - 1] + 1; //下側\n ans.push_back(sum + (x - y + 1) * (x + y) / 2LL);\n // cout << \"! \" << sum + (x - y + 1) * (x + y) / 2LL << \"\\n\";\n //うまく調整する m ~ n: (n - m + 1) * (m + n) / 2\n if (a[i] - a[i - 1] < abs(b[i] - b[i - 1])) {\n break;\n }\n long long Max = (a[i] - a[i - 1] + b[i] + b[i - 1]) / 2LL;\n long long l = (Max - b[i - 1]);\n long long r = (Max - b[i]);\n long long mid = (a[i] - a[i - 1]) - (l + r);\n // cout << Max << \" \" << l << \" \" << mid << \" \" << r << \"\\n\";\n x = Max;\n y = Max - (l - 1);\n if (y < 0) {\n break;\n }\n sum += (x - y + 1) * (x + y) / 2LL;\n // cout << x << \" \" << y << \" \" << Max << \" \" << sum << \"\\n\";\n sum += (mid - 1) * Max;\n // cout << sum << \"\\n\";\n x = Max;\n y = Max - r;\n if (y < 0) {\n break;\n }\n sum += (x - y + 1) * (x + y) / 2LL;\n // cout << x << \" \" << y << \" \" << Max << \" \" << sum << \"\\n\";\n ans.push_back(sum);\n // cout << sum << \"\\n\";\n // cout << \"---------\\n\";\n }\n sort(ans.rbegin(), ans.rend());\n cout << ans[0] << \"\\n\";\n return(0);\n}", "accuracy": 0.6896551724137931, "time_ms": 40, "memory_kb": 4888, "score_of_the_acc": -1.1085, "final_rank": 20 }, { "submission_id": "aoj_0460_9610081", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing vi = vector<int>;\nusing vll = vector<ll>;\nusing vvi = vector<vi>;\nusing vvll = vector<vll>;\nusing vs = vector<string>;\nusing pii = pair<int, int>;\ntemplate<class T> istream &operator>>(istream &is, vector<T> &v)\n {for (auto &x : v){is >> x;} return is;}\ntemplate<class T> bool chmax(T &a, T b) {if(a<b) {a=b;return true;} return false;}\n\n#define pb emplace_back\n#define all(a) (a).begin(),(a).end()\n#define fi first\n#define se second\n\nusing T = pair<int, ll>;\nT f(T A1, T A2, bool flag) {\n ll x = A2.fi-A1.fi;\n ll y = A2.se-A1.se;\n if (flag) {\n ll area = x*(x-1)/2+A1.se*(x-1);\n return {0, area};\n }\n if (abs(y)>x||A2.se==-1) {\n ll area = x*(x+1)/2 + A1.se*x;\n if (A2.se!=-1) area -= x+A1.se;\n return {-1, area};\n }\n if (y>=0) {\n ll area = y*(y+1)/2 + A1.se*y;\n ll t = x-y;\n if (t%2==0) {\n area += (t/2)*(t/2+1)/2+(t/2-1)*(t/2)/2;\n area += A2.se*t;\n }\n else {\n area += (t/2)*(t/2+1) + A2.se*t;\n }\n return {0, area};\n }\n else {\n y *= -1;\n swap(A1.se, A2.se);\n ll area = y*(y+1)/2 + A1.se*y;\n ll t = x-y;\n if (t%2==0) {\n area += (t/2)*(t/2+1)/2+(t/2-1)*(t/2)/2;\n area += A2.se*t;\n }\n else {\n area += (t/2)*(t/2+1) + A2.se*t;\n }\n area += -A2.se+A1.se;\n return {0, area};\n }\n}\n\nint main() {\n int N, M; cin >> N >> M;\n vector<T> A(M+2);\n A[0] = {0, 0};\n for (int i = 1; i <= M; i++) cin >> A[i].fi >> A[i].se;\n if (A[M].fi==N) A.pop_back();\n else A[M+1] = {N, -1};\n \n ll ans = 0, cnt = 0;\n for (int i = 0; i < int(A.size())-1; i++) {\n chmax(ans, cnt + f(A[i], A[i+1], true).se);\n cnt += f(A[i], A[i+1], false).se;\n chmax(ans, cnt);\n //cout << A[i].fi << \" \" << f(A[i], A[i+1], false).se << \" \" << ans << endl;\n if (f(A[i], A[i+1], false).fi==-1) break;\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 4664, "score_of_the_acc": -1.0543, "final_rank": 11 }, { "submission_id": "aoj_0460_9540740", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\ntemplate <class T> using V = vector<T>;\n#define REP(i, n) for (ll i = 0; i < (n); i++)\n#define REP2(i, a, b) for (ll i = (a); i < (b); i++)\nvoid chmax(ll& a, const ll& b) { if (a < b) a = b; }\n\nint main()\n{\n\tll n, m; cin >> n >> m;\n\tV<pair<ll, ll>> ab(m);\n\tREP(i, m) cin >> ab[i].first >> ab[i].second;\n\tab.emplace_back(n + 1, 1ll << 60);\n\tll a1{}, b1{}, ans{}, cur{};\n\tfor (auto& [a2, b2] : ab) {\n\t\tll d = a2 - a1;\n\t\tchmax(ans, cur + (b1 + b1 + d - 1) * d / 2); // 手前まで\n\t\tif (abs(b2 - b1) > d) break; // 無理なら\n\t\tif (abs(a1 - a2) % 2 == abs(b1 - b2) % 2) {\n\t\t\tll p1a = a2 - (b1 + d - b2) / 2, p1b = (p1a - a1) + b1;\n\t\t\tcur += (b1 + p1b - 1) * (p1a - a1) / 2;\n\t\t\tcur += (b2 + p1b + 1) * (a2 - p1a) / 2;\n\t\t} else {\n\t\t\tll p1a = a2 - (b1 + d - b2 - 1) / 2, p1b = (p1a - a1) + b1 - 1;\n\t\t\tcur += (b1 + p1b) * (p1a - a1) / 2;\n\t\t\tcur += (b2 + p1b + 1) * (a2 - p1a) / 2;\n\t\t}\n\t\ta1 = a2;\n\t\tb1 = b2;\n\t}\n\tcout << ans << endl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 7536, "score_of_the_acc": -1.75, "final_rank": 17 }, { "submission_id": "aoj_0460_9516228", "code_snippet": "#include<bits/stdc++.h>\n//#include<atcoder/all>\nusing namespace std;\n//using namespace atcoder;\nusing ll=long long;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define rep2(i,a,n) for(int i=a;i<n;i++)\n#define all(a) a.begin(),a.end()\nll mod=998244353;\nll inf=(1ll<<62)+(1ll<<30);\nll ruijo(ll a,ll b){// return a^b\n vector<ll>ab(60);ab[0]=a;rep2(i,1,61)ab[i]=ab[i-1]*ab[i-1]%mod;\n ll n2=1,c=0,ret=1;while(n2<=b)n2*=2,c++;n2/=2,c--;\n while(b>0){while(n2>b)n2/=2,c--;b-=n2,ret=ret*ab[c]%mod;}\n return ret;\n}\nll sum(ll l,ll r){\n return (r+l)*(abs(r-l)+1)/2;\n}\nint main(){\n int n,m;cin>>n>>m;\n vector<ll>a(m),b(m);\n rep(i,m)cin>>a[i]>>b[i];\n if(a[m-1]<n)a.push_back(n+1),b.push_back(0);\n ll ans=0;\n int pos=0;\n ll cost=0,costsum=0;\n rep(i,(int)a.size()){\n if(a[i]-pos>1)ans=max(ans,costsum+sum(cost+1,cost+a[i]-pos-1));\n if(cost-(a[i]-pos)>b[i]||cost+(a[i]-pos)<b[i])break;\n if((cost+pos-b[i]-a[i])%2==0){\n ll x=(a[i]-pos+b[i]-cost)/2;\n costsum+=sum(cost,cost+x)+sum(cost+x,b[i])-cost-(cost+x);\n }\n else{\n ll x=(a[i]-pos+b[i]-cost)/2;\n costsum+=sum(cost,cost+x)+sum(cost+x,b[i])-cost;\n }\n pos=a[i],cost=b[i];\n }\n cout<<max(costsum,ans)<<endl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 5364, "score_of_the_acc": -1.2238, "final_rank": 13 }, { "submission_id": "aoj_0460_9461150", "code_snippet": "#include <bits/stdc++.h>\n\nlong long sum(int v) {\n return (long long)v * (v + 1) / 2;\n}\n\nconst long long INVALID{-100};\n\nlong long calc(int s, int t, int sv, int tv) {\n // std::cerr << s << ' ' << t << ' ' << sv << ' ' << tv << std::endl;\n assert(s < t);\n int len{t - s};\n long long res{};\n if (sv < tv) {\n if (sv + len < tv) return INVALID;\n res += sum(tv - 1) - sum(sv - 1);\n s += tv - sv;\n sv = tv;\n len = t - s;\n assert(len >= 0);\n }\n else if (sv == tv) {\n // nothing to do\n }\n else { // sv > tv\n if (sv - len > tv) return INVALID;\n res += sum(sv - 1) - sum(tv - 1);\n t -= sv - tv;\n tv = sv;\n len = t - s;\n assert(len >= 0);\n }\n int up{len / 2}, dn{len / 2};\n res += sum(sv + up) - sum(sv - 1);\n res += sum(tv + (len % 2 == 0 ? dn - 1 : dn)) - sum(tv - 1);\n // std::cerr << res << std::endl;\n return res;\n}\n\nint main() {\n int N, M;\n std::cin >> N >> M;\n std::vector<int> A(M), B(M);\n for (int i{} ; i < M ; i++) {\n std::cin >> A[i] >> B[i];\n }\n long long ans{sum(A[0] - 1)};\n long long cur{};\n cur += calc(0, A[0], 0, B[0]);\n if (cur == INVALID) {\n std::cout << sum(A[0] - 1) << '\\n';\n return 0;\n }\n for (int i{} ; i + 1 < M ; i++) {\n cur -= B[i];\n ans = std::max(ans, cur + sum(B[i] + A[i + 1] - A[i] - 1) - sum(B[i] - 1));\n long long val{calc(A[i], A[i + 1], B[i], B[i + 1])};\n if (val == INVALID) {\n cur += sum(B[i] + (A[i + 1] - A[i]) - 1) - sum(B[i] - 1);\n std::cout << cur << '\\n';\n return 0;\n }\n else {\n cur += val;\n }\n }\n if (A[M - 1] < N) {\n cur -= B[M - 1];\n long long val{calc(A[M - 1], N, B[M - 1], B[M - 1] + N - A[M - 1])};\n assert(val >= 0);\n cur += val;\n }\n ans = std::max(ans, cur);\n std::cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3900, "score_of_the_acc": -0.8692, "final_rank": 9 }, { "submission_id": "aoj_0460_9364133", "code_snippet": "// #include<bits/stdc++.h>\n#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<queue>\n#include<set>\n#include<map>\n#include<cstring>\n#include<string>\nusing namespace std;\nusing ll = long long;\nusing vi=vector<int>; \nusing vvi=vector<vi>;\nusing vl=vector<ll>;\nusing vvl=vector<vl>;\nusing vs=vector<string>;\n#define rep(i,n) for(int i=0;i<(int)n;i++)\n#define rep1(i,n) for(int i=1;i<=(int)n;i++)\n#define INF (ll)(2e18)\n#define IINF (int)(1e9+7)\n//#define MOD ((ll)1e9+7)\n#define MOD (998244353)\n#define all(a) (a).begin(),(a).end()\nconst int di[]={0,1,-1,0};\nconst int dj[]={1,0,0,-1};\n\n\n#define MAX 100000\nll f(ll x){\n\treturn (x)*(x+1)/2;\n}\nint main(){\n\tll N, M;\n cin >> N >> M;\n vector<pair<ll, ll>> A(M);\n for(auto& [a, b] : A) cin >> a >> b;\n A.emplace_back(N + 1, INF);\n ll ans = 0, sum = 0, a1 = 0, b1 = 0;\n for(ll i = 0; i <= M; i++){\n auto [a2, b2] = A[i];\n ans=max(ans, sum + (b1 + b1 + (a2 - a1) - 1) * (a2 - a1) / 2);\n if(b1 + (a2 - a1) < b2 || b1 - (a2 - a1) > b2) break;\n if((a1 ^ a2 ^ b1 ^ b2) & 1){\n const ll a3 = (a1 + a2 + b2 - b1) / 2, b3 = a3 + b1 - a1;\n const ll a4 = a3 + 1, b4 = b3;\n sum += (b1 + b3) * (a3 - a1 + 1) / 2;\n sum += (b4 + b2 + 1) * (a2 - a4) / 2;\n }\n else{\n const ll a3 = (a1 + a2 + b2 - b1) / 2, b3 = a2 + b2 - a3;\n sum += (b1 + b3 - 1) * (a3 - a1) / 2;\n sum += (b3 + b2 + 1) * (a2 - a3) / 2;\n }\n a1 = a2;\n b1 = b2;\n }\n cout << ans << endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 7296, "score_of_the_acc": -1.6919, "final_rank": 16 } ]
aoj_0469_cpp
Disaster Response Simulation PCK is participating in the World Robot Challenge in the Disaster Response Simulation category. The mission of this category is to rescue people who are stranded in a building. The interior of the building is represented by a plane divided into $H$ rows and $W$ columns, where each square is either a wall, a path, or an obstacle. There are $N$ people left in the building, and each of the $N$ rescue robots rescues one person at a time. All the robots leave from one base station at once, and each goes to the person to be rescued. Each robot can move to the adjacent squares in the same row and column from its current position, but cannot move to squares outside of buildings or walls. The path and obstacle squares can be occupied by multiple robots at the same time. If a robot enters an obstacle square, it will take 1 damage. The first task for PCK to accomplish the mission is to select a suitable location for the base station where he can rescue all the people who are stranded. Whenever there is a path for the robots to reach the location of the people from the base station, you can always choose the path that minimizes the damage the robots will take. Based on this assumption, we decided to look for the base station that would have the smallest maximum value of damage suffered by each robot. However, the base station must be placed in a square that represents a path, but it can be placed even if there is a person in that square. Given information about the inside of a building and the location of a person, create a program that selects the location of a base station and reports one candidate. Input The input is given in the following format. $H$ $W$ $N$ $s_{1,1}s_{1,2}$...$s_{1,W}$ $s_{2,1}s_{2,2}$...$s_{2,W}$ : $s_{H,1}s_{H,2}$...$s_{H,W}$ $r_1$ $c_1$ $r_2$ $c_2$ : $r_N$ $c_N$ In the first line, the number of rows $H$ ($2 \leq H \leq 300$) and the number of columns $W$ ($2 \leq W \leq 300$) of the plane representing the interior of the building, and the number of people $N$ ($ 1 \leq N \leq 300$) are given. The letters $s_{i,j}$ representing the squares in row $i$ and column $j$ are given in the subsequent $H$ lines. If $s_{i,j}$ is ' . ', ' # ', and ' @ ' represent paths, walls, and obstacles, respectively. In the following $N$ lines, a pair of integers $r_i$ ($1 \leq r_i \leq H$) and $c_i$ ($1 \leq c_i \leq W$) are given to represent the location of each person. The $r_i$ and $c_i$ indicate that there is a person in the square in the $r_i$ row and $c_i$ column. However, the square with a person in it is a path and there can be no more than two people in one square. Output Outputs a pair of integers representing the location of the base station on a single line, separated by spaces. If there are multiple candidates, output the one with the smallest row number. If there are multiple such candidates, output the one with the smallest column number. However, if there are no candidates, output " -1 -1 ". Sample Input and Ou ...(truncated)
[ { "submission_id": "aoj_0469_11031116", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint dy[] = {0, 1, 0, -1}, dx[] = {1, 0, -1, 0};\n\nint main(){\n\tint h, w, n;\n\tcin >> h >> w >> n;\n\tvector<string> S(h);\n\tfor(auto &i : S) cin >> i;\n\tvector<array<int, 2>> A(n);\n\tfor(auto &i : A) cin >> i[0] >> i[1];\n\tfor(auto &i : A) i[0]--, i[1]--;\n\t\n\tint bs = 99824435, by = -1, bx = -1;\n\t\n\tvector<vector<int>> ans(h, vector<int>(w, -1));\n\t\n\tfor(int a = 0; a < n; a++){\n\t\tint i = A[a][0], j = A[a][1];\n\t\tvector<vector<int>> dist(h, vector<int>(w, 998244353));\n\t\tdeque<array<int, 3>> Q;\n\t\tdist[i][j] = 0;\n\t\tQ.push_back({i, j});\n\t\twhile(!Q.empty()){\n\t\t\tint y = Q.front()[0], x = Q.front()[1], d = Q.front()[2];\n\t\t\tQ.pop_front();\n\t\t\tif(d != dist[y][x]) continue;\n\t\t\t\n\t\t\tfor(int t = 0; t < 4; t++){\n\t\t\t\tint ny = y+dy[t], nx = x+dx[t];\n\t\t\t\tif(ny < 0 || nx < 0 || ny >= h || nx >= w) continue;\n\t\t\t\tif(S[ny][nx] == '#') continue;\n\t\t\t\t\n\t\t\t\tif(S[ny][nx] == '.'){\n\t\t\t\t\tif(dist[ny][nx] > d){\n\t\t\t\t\t\tdist[ny][nx] = d;\n\t\t\t\t\t\tQ.push_front({ny, nx, d});\n\t\t\t\t\t}\n\t\t\t\t} else {\n\t\t\t\t\tif(dist[ny][nx] > d+1){\n\t\t\t\t\t\tdist[ny][nx] = d + 1;\n\t\t\t\t\t\tQ.push_back({ny, nx, d+1});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tfor(int i = 0; i < h; i++){\n\t\t\tfor(int j = 0; j < w; j++){\n\t\t\t\tans[i][j] = max(ans[i][j], dist[i][j]);\n\t\t\t}\n\t\t}\n\t}\n\t\n\tfor(int i = 0; i < h; i++){\n\t\tfor(int j = 0; j < w; j++){\n\t\t\tif(bs > ans[i][j]){\n\t\t\t\tif(S[i][j] != '.') continue;\n\t\t\t\tbs = ans[i][j];\n\t\t\t\tby = i+1;\n\t\t\t\tbx = j+1;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tcout << by << ' ' << bx << endl;\n}", "accuracy": 1, "time_ms": 880, "memory_kb": 4772, "score_of_the_acc": -0.1573, "final_rank": 6 }, { "submission_id": "aoj_0469_11026764", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define rng(i,l,r) for(int i=(l);i<(r);i++)\n#define rrep(i,n) for(int i=(n)-1;i>=0;i--)\n#define rrng(i,l,r) for(int i=(r)-1;i>=(l);i--)\n#define int long long\n#define fi first\n#define se second\n#define pb push_back\n#define all(x) (x).begin(),(x).end()\n\nsigned main(){\n\tint H,W,N;cin>>H>>W>>N;\n\tvector<string> S(H);for(auto&&e:S)cin>>e;\n\t\n\tvector<vector<int>> ans(H,vector<int>(W,-1));\n\t\n\twhile(N--){\n\t\tint si,sj;cin>>si>>sj;si--,sj--;\n\t\tvector<vector<int>> d(H,vector<int>(W,1e9));\n\t\tdeque<pair<int,int>> q;\n\t\tq.pb({si,sj});\n\t\td[si][sj]=0;\n\t\t\n\t\tconst int di[4]={-1,0,1,0};\n\t\tconst int dj[4]={0,1,0,-1};\n\t\t\n\t\twhile(q.size()){\n\t\t\tauto[pi,pj]=q.front();q.pop_front();\n\t\t\trep(k,4){\n\t\t\t\tint ni=pi+di[k],nj=pj+dj[k];\n\t\t\t\tif(0<=ni&&ni<H&&0<=nj&&nj<W){\n\t\t\t\t\tif(S[ni][nj]=='@'){\n\t\t\t\t\t\tif(d[ni][nj]>d[pi][pj]+1){\n\t\t\t\t\t\t\td[ni][nj]=d[pi][pj]+1;\n\t\t\t\t\t\t\tq.pb({ni,nj});\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(S[ni][nj]=='.'){\n\t\t\t\t\t\tif(d[ni][nj]>d[pi][pj]){\n\t\t\t\t\t\t\td[ni][nj]=d[pi][pj];\n\t\t\t\t\t\t\tq.push_front({ni,nj});\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\trep(i,H)rep(j,W){\n\t\t\tans[i][j]=max(ans[i][j],d[i][j]);\n\t\t}\n\t\t\n\t}\n\t\n\tint mi=-2,mj=-2,mc=1e9;\n\trep(i,H)rep(j,W){\n\t\tif(mc>ans[i][j]&&S[i][j]=='.'){\n\t\t\tmc=ans[i][j];\n\t\t\tmi=i,mj=j;\n\t\t}\n\t}\n\t\n\tcout<<mi+1<<\" \"<<mj+1<<\"\\n\";\n}", "accuracy": 1, "time_ms": 940, "memory_kb": 5544, "score_of_the_acc": -0.1884, "final_rank": 9 }, { "submission_id": "aoj_0469_11015496", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n//#include<atcoder/all>\n//using namespace atcoder;\n//using mint = modint998244353;\n#define int long long\nsigned main() {\n int h,w,n;\n cin >> h >> w >> n;\n vector<string> s(h);\n for(int i = 0; i < h; i++) cin >> s[i];\n vector<int> a(n),b(n);\n for(int i = 0; i < n; i++) cin >> a[i] >> b[i], a[i]--, b[i]--;\n vector<vector<int>> v(h,vector<int>(w,0));\n vector<int> t = {0,1,0,-1,0};\n for(int i = 0; i < n; i++) {\n vector<vector<int>> v2(h,vector<int>(w,1e9));\n deque<pair<int,int>> q;\n q.push_back({a[i],b[i]});\n v2[a[i]][b[i]] = 0;\n while(q.size() > 0) {\n int x,y;\n tie(x,y) = q.front();\n q.pop_front();\n for(int j = 0; j < 4; j++) {\n int X = x+t[j], Y = y+t[j+1];\n if(X < 0 || X >= h || Y < 0 || Y >= w) continue;\n int z = v2[x][y];\n if(s[X][Y] == '#') continue;\n if(s[X][Y] == '@') z++;\n if(v2[X][Y] > z) {\n v2[X][Y] = z;\n if(s[X][Y] == '.') q.push_front({X,Y});\n else q.push_back({X,Y});\n }\n }\n }\n for(int j = 0; j < h; j++) for(int k = 0; k < w; k++) v[j][k] = max(v[j][k],v2[j][k]);\n }\n tuple<int,int,int> ans = {1e18,1e18,1e18};\n for(int i = 0; i < h; i++) for(int j = 0; j < w; j++) {\n if(s[i][j] == '.') {\n tuple<int,int,int> z = {v[i][j],i,j};\n ans = min(ans,z);\n }\n }\n int B,x,y;\n tie(B,x,y) = ans;\n if(B < 1e7) cout << x+1 << ' ' << y+1 << endl;\n else cout << -1 << ' ' << -1 << endl;\n}", "accuracy": 1, "time_ms": 660, "memory_kb": 5608, "score_of_the_acc": -0.0603, "final_rank": 4 }, { "submission_id": "aoj_0469_10977932", "code_snippet": "//#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define int long long\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define all(a) (a).begin(), (a).end()\nconst ll INF32 = 2e9;\nconst ll INF64 = 4e18;\nconst vector<int> dr = {1,0,-1,0};\nconst vector<int> dc = {0,1,0,-1};\n\nbool comp(pair<int, pair<int, int>> &a,pair<int, pair<int, int>> &b){\n\treturn a.first > b.first;\n}\n\nsigned main(){\n\tint H, W, N;\n\tcin >> H >> W >> N;\n\tvector<string> s(H);\n\trep(i, H)cin >> s[i];\n\tvector<vector<int>> max_damage(H, vector<int>(W, 0));\n\trep(i, N){\n\t\tint r, c;\n\t\tcin >> r >> c;\n\t\tr--; c--;\n\t\tvector<vector<int>> damage(H, vector<int>(W, INF32));\n\t\tvector<vector<bool>> kaku(H, vector<bool>(W, false));\n\t\tdamage[r][c] = 0;\n\t\tpriority_queue<pair<int,pair<int, int>>,\n\t\t\t\t\tvector<pair<int,pair<int, int>>>, greater<pair<int,pair<int, int>>>> pq;\n\t\tpq.push({0,{r,c}});\n\t\twhile(!pq.empty()){\n\t\t\tauto [t, nrc] = pq.top(); pq.pop();\n\t\t\tint nr = nrc.first, nc = nrc.second;\n\t\t\tif(kaku[nr][nc])continue;\n\t\t\tkaku[nr][nc] = true;\n\t\t\trep(j, dr.size()){\n\t\t\t\tint nxr = nr+dr[j], nxc = nc+dc[j];\n\t\t\t\tif(nxr<0||H<=nxr||nxc<0||W<=nxc)continue;\n\t\t\t\tif(s[nxr][nxc]=='#')continue;\n\t\t\t\tint dd = (s[nxr][nxc]=='@');\n\t\t\t\tif(damage[nxr][nxc]>damage[nr][nc]+dd){\n\t\t\t\t\tdamage[nxr][nxc]=damage[nr][nc]+dd;\n\t\t\t\t\tpq.push({damage[nxr][nxc],{nxr,nxc}});\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\trep(j, H)rep(k, W)max_damage[j][k] = max(max_damage[j][k], damage[j][k]);\n\t}\n\tint mi = INF32;\n\tint ansr = -1, ansc = -1;\n\trep(i, H)rep(j, W){\n\t\tif(s[i][j]=='#'||s[i][j]=='@')continue;\n\t\tif(max_damage[i][j]<mi){\n\t\t\tmi = max_damage[i][j];\n\t\t\tansr = i; ansc = j;\n\t\t}\n\t}\n\tif(ansr==-1){\n\t\tcout << \"-1 -1\" << endl;\n\t\treturn 0;\n\t}\n\tansr++; ansc++;\n\tcout << ansr << \" \" << ansc << endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 2510, "memory_kb": 5596, "score_of_the_acc": -0.9088, "final_rank": 13 }, { "submission_id": "aoj_0469_10957456", "code_snippet": "#include <iostream>\n#include <deque>\nusing namespace std;\nint main(){\n int H,W,N;\n cin >> H >> W >> N;\n char road[H+2][W+2];\n deque<pair<int,int>> deq;\n int INF = 1e8;\n for(int i = 0; i < H+2; i++){\n for(int j = 0; j < W+2; j++){\n road[i][j] = '#';\n }\n }\n for(int i = 1; i <= H; i++){\n for(int j = 1; j <= W; j++){\n cin >> road[i][j];\n }\n }\n pair<int,int> rc[N];\n for(int i = 0; i < N; i++){\n int r,c;\n cin >> r >> c;\n rc[i] = {r,c};\n }\n int D[H+2][W+2] = {0};\n for(int i = 0; i < H+2; i++){\n for(int j = 0; j < W+2; j++){\n D[i][j] = -1;\n }\n }\n int dx[] = {1,0,-1,0};\n int dy[] = {0,1,0,-1};\n bool V[H+2][W+2] = {false};\n for(int i = 0; i < N; i++){\n int d[H+2][W+2];\n bool visited[H+2][W+2] = {false};\n deq.push_back(rc[i]);\n auto[x0,y0] = rc[i];\n d[x0][y0] = 0;\n while(!deq.empty()){\n auto[x,y] = deq.front();\n deq.pop_front();\n for(int j = 0; j < 4; j++){\n int X = x+dx[j];\n int Y = y+dy[j];\n if(visited[X][Y]){\n continue;\n }\n if(road[X][Y] == '.'){\n deq.push_front({X,Y});\n visited[X][Y] = true;\n d[X][Y] = d[x][y];\n D[X][Y] = max(d[X][Y],D[X][Y]);\n }\n if(road[X][Y] == '@'){\n visited[X][Y] = true;\n deq.push_back({X,Y});\n d[X][Y] = d[x][y]+1;\n D[X][Y] = max(d[X][Y],D[X][Y]);\n }\n }\n }\n for(int j = 0; j < H+2; j++){\n for(int k = 0; k < W+2; k++){\n if(!visited[j][k]){\n V[j][k] = true;\n }\n }\n }\n }\n pair<int,int>ans;\n int M = INF;\n for(int i = 1; i <= H; i++){\n for(int j = 1; j <= W; j++){\n if(V[i][j] || road[i][j] != '.'){\n continue;\n }\n if(M > D[i][j]){\n ans = {i,j};\n M = D[i][j];\n }\n }\n }\n if(M == INF){\n cout << -1 << ' ' << -1;\n }else{\n auto [x,y] = ans;\n cout << x << ' ' << y;\n }\n cout << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 570, "memory_kb": 4864, "score_of_the_acc": -0.0156, "final_rank": 1 }, { "submission_id": "aoj_0469_10956666", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\n\nint main() {\n // input\n int h, w, n; cin >> h >> w >> n;\n vector<string> s(h, \"\");\n vector<int> x(n, 0), y(n, 0);\n for (int i = 0; i < h; i++) cin >> s[i];\n for (int i = 0; i < n; i++) {\n cin >> x[i] >> y[i];\n x[i]--; y[i]--;\n }\n\n // brute\n vector<vector<int>> val(h, vector<int>(w, 0));\n for (int p = 0; p < n; p++) {\n vector<vector<int>> dst(h, vector<int>(w, 100000));\n vector<vector<bool>> used(h, vector<bool>(w, false));\n deque<pair<int, int>> q;\n q.push_back(make_pair(x[p], y[p]));\n dst[x[p]][y[p]] = 0;\n\n // bfs\n while (!q.empty()) {\n int sx = q.front().first;\n int sy = q.front().second; q.pop_front();\n if (used[sx][sy]) continue;\n used[sx][sy] = true;\n for (int d = 0; d < 4; d++) {\n int tx = sx + dx[d];\n int ty = sy + dy[d];\n if (tx < 0 || tx >= h || ty < 0 || ty >= w || s[tx][ty] == '#') continue;\n int cost = (s[tx][ty] == '@' ? 1 : 0);\n if (dst[tx][ty] > dst[sx][sy] + cost) {\n dst[tx][ty] = dst[sx][sy] + cost;\n if (s[tx][ty] == '@') {\n q.push_back(make_pair(tx, ty));\n }\n else {\n q.push_front(make_pair(tx, ty));\n }\n }\n }\n }\n\n // update\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n val[i][j] = max(val[i][j], dst[i][j]);\n }\n }\n }\n\n // output\n int minx = (1 << 30);\n pair<int, int> min_id = make_pair(-2, -2);\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n if (s[i][j] != '.') continue;\n if (minx > val[i][j]) {\n minx = val[i][j];\n min_id = make_pair(i, j);\n }\n }\n }\n if (minx > 90000) {\n cout << \"-1 -1\" << endl;\n }\n else {\n cout << min_id.first + 1 << \" \" << min_id.second + 1 << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 650, "memory_kb": 4612, "score_of_the_acc": -0.0511, "final_rank": 3 }, { "submission_id": "aoj_0469_10956475", "code_snippet": "#include <iostream>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <algorithm>\n#include <set>\n#include <queue>\n#include <deque>\nusing ll = long long;\nusing namespace std;\nstruct Edge {\n\tint to;\n\tint cost;\n};\nint main() {\n\tint H, W, N;cin >> H >> W >> N;\n\tvector<string> S(H);\n\tfor (int i = 0;i < H;i++) cin >> S[i];\n\n\tvector<vector<Edge>> G(H*W);\n\tvector<pair<int,int>> df = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};\n\tfor (int i = 0;i < H;i++) for (int j = 0;j < W;j++) {\n\t\tif (S[i][j] == '#') continue;\n\t\tint now = (W*i) + j;\n\t\tfor (auto d : df) {\n\t\t\tint nx = i + d.first;\n\t\t\tint ny = j + d.second;\n\t\t\tif (nx < 0 or nx >= H) continue;\n\t\t\tif (ny < 0 or ny >= W) continue;\n\t\t\tif (S[nx][ny] == '#') continue;\n\t\t\tint nv = (W * nx) + ny;\n\t\t\tif (S[nx][ny] == '@') {\n\t\t\t\tG[now].push_back({nv, 1});\n\t\t\t} else {\n\t\t\t\tG[now].push_back({nv, 0});\n\t\t\t}\n\t\t}\n\t}\t\n\n\tvector<vector<int>> dist(N, vector<int>(H*W, -1));\n\tfor (int i = 0;i < N;i++) {\n\t\tint x, y;cin >> x >> y;\n\t\tx--;y--;\n\t\tint st = (W * x) + y;\n\t\tdist[i][st] = 0;\n\t\tdeque<int> pq;\n\t\tpq.push_back(st);\n\t\twhile (!pq.empty()) {\n\t\t\tint v = pq.front();pq.pop_front();\n\t\t\tfor (auto nv : G[v]) {\n\t\t\t\tif (dist[i][nv.to] == -1) {\n\t\t\t\t\tdist[i][nv.to] = dist[i][v] + nv.cost;\n\t\t\t\t\tif (nv.cost == 1) {\n\t\t\t\t\t\tpq.push_back(nv.to);\n\t\t\t\t\t} else {\n\t\t\t\t\t\tpq.push_front(nv.to);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tpair<int, int> res = {-1, -1};\n\tint mxs = (int)1e9;\n\tfor (int i = 0;i < H;i++) for (int j = 0;j < W;j++) {\n\t\tif (S[i][j] != '.') continue;\n\t\tint now = (W * i) + j;\n\t\tint mx = 0;\n\t\tbool flg = true;\n\t\tfor (int k = 0;k < N;k++) {\n\t\t\tif (dist[k][now] == -1) {\n\t\t\t\tflg = false;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tmx = max(mx, dist[k][now]);\n\t\t}\n\t\tif (flg and mx < mxs) {\n\t\t\tres = {i+1, j+1};\n\t\t\tmxs = mx;\n\t\t}\n\t}\n\t\n\tcout << res.first << \" \" << res.second << endl;\n}", "accuracy": 1, "time_ms": 540, "memory_kb": 115752, "score_of_the_acc": -0.513, "final_rank": 10 }, { "submission_id": "aoj_0469_10933337", "code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, l, n) for(int i = int(l); i < int(n); i++)\n#define ll long long\n#define ld long double\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n\ntemplate<class T> bool chmin(T &a, T b) {if(a > b) {a = b; return true;} return false;}\ntemplate<class T> bool chmax(T &a, T b) {if(a < b) {a = b; return true;} return false;}\n\nconst int inf = 2e9;\nconst ll INF = 2e18;\nconst ld eps = 1e-12;\nconst ld pi = acos(-1);\n\nstruct Point {\n \n long double x, y;\n\n Point() : x(0.00), y(0.00) {}\n Point(long double a, long double b) : x(a), y(b) {}\n \n Point &operator+=(const Point &p) {\n x += p.x; y += p.y;\n return (*this);\n }\n Point &operator-=(const Point &p) {\n x -= p.x; y -= p.y;\n return (*this);\n }\n Point &operator*=(const long double &k) {\n x *= k; y *= k;\n return (*this);\n }\n Point &operator*=(const Point &p) {\n long double a = x * p.x - y * p.y;\n long double b = x * p.y + y * p.x;\n x = a; y = b;\n return (*this);\n }\n Point &operator/=(const long double &k) {\n x /= k; y /= k;\n return (*this);\n }\n bool operator==(const Point &p) {\n return abs(x - p.x) >= eps && abs(y - p.y) < eps;\n }\n bool operator!=(const Point &p) {\n return abs(x - p.x) >= eps || abs(y - p.y) >= eps;\n }\n Point operator+(const Point &p) {return Point(*this) += p;}\n Point operator-(const Point &p) {return Point(*this) -= p;}\n Point operator*(const long double &k) {return Point(*this) *= k;}\n Point operator*(const Point &p) {return Point(*this) *= p;}\n Point operator/(const long double &k) {return Point(*this) /= k;}\n \n long double dot(const Point &p) {\n return x * p.x + y * p.y;\n }\n long double det(const Point &p) {\n return x * p.y - y * p.x;\n }\n \n long double arg() {\n return atan2(y, x);\n } \n \n friend istream &operator>>(istream &is, Point &p) {\n is >> p.x >> p.y;\n return is;\n }\n \n friend ostream &operator<<(ostream &os, Point &p) {\n os << '(' << p.x << \" \" << p.y << \")\";\n return os;\n }\n \n};\n\nstruct Segment {\n Point a, b;\n Segment() : a(), b() {}\n Segment(Point a_, Point b_) : a(a_), b(b_) {}\n};\n\nlong double angle(Point a, Point b, Point c) {\n Point v = (a - b), u = (c - b);\n long double theta = abs(v.arg() - u.arg());\n return min(theta, 2.00 * pi - theta);\n}\n\nint ccw(Point a, Point b, Point c) {\n long double k = (b - a).det(c - a);\n if(k > eps) return 1;\n else if(k < -eps) return -1;\n if((b - a).dot(c - a) < -eps) return -2;\n if((a - b).dot(c - b) < -eps) return 2;\n return 0;\n}\n\nbool intersect(Segment s, Segment t) {\n if(ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) > 0) return false;\n return (ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0);\n}\n\nPoint crosspoint(Segment l, Segment m) {\n long double s = (l.b - l.a).det(m.b - m.a);\n long double t = (l.b - l.a).det(l.b - m.a);\n if(abs(s) < eps && abs(t) < eps) return m.a;\n return m.a + (m.b - m.a) * t / s;\n}\n\nint dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};\n\nint main() {\n int h, w, n; cin >> h >> w >> n;\n string g[h];\n rep(i, 0, h) {\n cin >> g[i];\n }\n pair<int, int> p[n];\n rep(i, 0, n) cin >> p[i].first >> p[i].second;\n int ans[h][w], dist[h][w];\n rep(i, 0, h) rep(j, 0, w) {\n ans[i][j] = 0;\n }\n for(auto[sx, sy] : p) {\n sx--, sy--;\n rep(i, 0, h) rep(j, 0, w) dist[i][j] = inf;\n deque<pair<int, int>> q;\n q.emplace_back(sx, sy);\n dist[sx][sy] = 0;\n while(!q.empty()) {\n auto[x, y] = q.front(); q.pop_front();\n rep(k, 0, 4) {\n int nx = x + dx[k], ny = y + dy[k];\n if(nx < 0 || nx >= h || ny < 0 || ny >= w) continue;\n if(g[nx][ny] == '#') continue;\n int cost = 0;\n if(g[nx][ny] == '@') cost++;\n if(chmin(dist[nx][ny], dist[x][y] + cost)) {\n if(cost) q.emplace_back(nx, ny);\n else q.emplace_front(nx, ny);\n }\n }\n }\n rep(i, 0, h) rep(j, 0, w) {\n chmax(ans[i][j], dist[i][j]);\n }\n }\n int total = inf;\n pair<int, int> place(inf, inf);\n rep(i, 0, h) rep(j, 0, w) {\n if(g[i][j] == '@') continue;\n if(chmin(total, ans[i][j])) {\n place = make_pair(i, j);\n }\n }\n if(total == inf) cout << \"-1 -1\\n\";\n else cout << ++place.first << \" \" << ++place.second << \"\\n\";\n}", "accuracy": 1, "time_ms": 800, "memory_kb": 4592, "score_of_the_acc": -0.1198, "final_rank": 5 }, { "submission_id": "aoj_0469_10910505", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)\n\nvector<int> di = {0, 1, 0, -1};\nvector<int> dj = {1, 0, -1, 0};\n\nint main() {\n\tcin.tie(nullptr);\n\tios_base::sync_with_stdio(false);\n\t\n\tint H, W, N;\n\tcin >> H >> W >> N;\n\tvector S(H, vector<char>(W));\n\trep(i, 0, H) rep(j, 0, W) cin >> S[i][j];\n\t\n\tvector res(N, vector(H, vector<int>(W, -1)));\n\tdeque<pair<int, int>> que;\n\trep(i, 0, N) {\n\t\tint r, c;\n\t\tcin >> r >> c;\n\t\t--r, --c;\n\t\tres[i][r][c] = 0;\n\t\tque.push_front({r, c});\n\t\t\n\t\twhile (!que.empty()) {\n\t\t\tint vi = que.front().first;\n\t\t\tint vj = que.front().second;\n\t\t\tque.pop_front();\n\t\t\t\n\t\t\trep(dir, 0, 4) {\n\t\t\t\tint ni = vi + di[dir];\n\t\t\t\tint nj = vj + dj[dir];\n\t\t\t\tif (ni < 0 || H <= ni || nj < 0 || W <= nj) continue;\n\t\t\t\tif (S[ni][nj] == '#' || res[i][ni][nj] != -1) continue;\n\t\t\t\t\n\t\t\t\tif (S[ni][nj] == '.') {\n\t\t\t\t\tres[i][ni][nj] = res[i][vi][vj];\n\t\t\t\t\tque.push_front({ni, nj});\n\t\t\t\t} else {\n\t\t\t\t\tres[i][ni][nj] = res[i][vi][vj] + 1;\n\t\t\t\t\tque.push_back({ni, nj});\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\t\n\tint mini= 1 << 30;\n\tint ans_i = -1, ans_j = -1;\n\trep(i, 0, H) rep(j, 0, W) if (S[i][j] == '.') {\n\t\tint maxi = -1;\n\t\tbool cant = false;\n\t\trep(k, 0, N) {\n\t\t\tif (res[k][i][j] == -1) cant = true;\n\t\t\tmaxi = max(maxi, res[k][i][j]);\n\t\t}\n\t\t\n\t\tif (cant) continue;\n\t\tif (mini > maxi) {\n\t\t\tmini = maxi;\n\t\t\tans_i = i + 1;\n\t\t\tans_j = j + 1;\n\t\t}\n\t}\n\t\n\tcout << ans_i << ' ' << ans_j << '\\n';\n}", "accuracy": 1, "time_ms": 680, "memory_kb": 112760, "score_of_the_acc": -0.5635, "final_rank": 11 }, { "submission_id": "aoj_0469_9814142", "code_snippet": "#include <bits/stdc++.h>\n\n#define ll int\n#define endl \"\\n\"\n\nusing namespace std;\n\nint main(){\n ll h,w,n;\n cin >> h >> w >> n;\n string s[h+1];\n for(ll i=1;i<=h;i++){\n cin >> s[i];\n s[i] = \" \"+s[i];\n }\n vector<vector<vector<ll>>>t(n,vector<vector<ll>>(h+1,vector<ll>(w+1,INT32_MAX)));\n vector<vector<vector<bool>>>CH(n,vector<vector<bool>>(h+1,vector<bool>(w+1,true)));\n for(ll i=0;i<n;i++){\n ll a,b;cin>>a>>b;\n vector<vector<bool>> ch (h+1,vector<bool>(w+1,false));\n priority_queue<pair<ll,pair<ll,ll>>,vector<pair<ll,pair<ll,ll>>>,greater<pair<ll,pair<ll,ll>>>> S;\n S.push({0,{a,b}});\n t[i][a][b] = 0;\n while(!S.empty()){\n ll now_nom = S.top().first;\n pair<ll,ll> now = S.top().second;\n S.pop();\n\n if(t[i][now.first][now.second] <= now_nom&&ch[now.first][now.second])continue;\n ch[now.first][now.second] = true;\n\n if(now.first-1>0&&s[now.first-1][now.second]!='#'){\n ll K = 0;\n if(s[now.first-1][now.second]=='@')K++;\n if(t[i][now.first-1][now.second]>now_nom+K){\n t[i][now.first-1][now.second] = now_nom+K;\n S.push({t[i][now.first-1][now.second],{now.first-1,now.second}});\n CH[i][now.first-1][now.second] = false;\n }\n }\n if(now.first+1<=h&&s[now.first+1][now.second]!='#'){\n ll K = 0;\n if(s[now.first+1][now.second]=='@')K++;\n if(t[i][now.first+1][now.second]>t[i][now.first][now.second]+K){\n t[i][now.first+1][now.second] = t[i][now.first][now.second]+K;\n S.push({t[i][now.first+1][now.second],{now.first+1,now.second}});\n CH[i][now.first+1][now.second] = false;\n }\n }\n if(now.second+1<=w&&s[now.first][now.second+1]!='#'){\n ll K = 0;\n if(s[now.first][now.second+1]=='@')K++;\n if(t[i][now.first][now.second+1]>t[i][now.first][now.second]+K){\n t[i][now.first][now.second+1] = t[i][now.first][now.second]+K;\n S.push({t[i][now.first][now.second+1],{now.first,now.second+1}});\n CH[i][now.first][now.second+1] = false;\n }\n }\n if(now.second-1>0&&s[now.first][now.second-1]!='#'){\n ll K = 0;\n if(s[now.first][now.second-1]=='@')K++;\n if(t[i][now.first][now.second-1]>t[i][now.first][now.second]+K){\n t[i][now.first][now.second-1] = t[i][now.first][now.second]+K;\n S.push({t[i][now.first][now.second-1],{now.first,now.second-1}});\n CH[i][now.first][now.second-1] = false;\n }\n }\n }\n }\n ll ans = INT32_MAX;\n bool FLAG = false;\n bool Cheak = false;\n pair<ll,ll>pos={-1,-1};\n for(ll i=1;i<=h;i++){\n for(ll j=1;j<=w;j++){\n ll Max = 0;\n bool flag = true;\n bool pp = true;\n for(ll k=0;k<n;k++){\n Max = max(Max,t[k][i][j]);\n if(t[k][i][j] == INT32_MAX||s[i][j]=='@'||s[i][j]=='#')flag = false;\n // if(CH[k][i][j])pp = false;\n }\n if(pp&&flag && ans > Max){\n FLAG = true;\n Cheak = true;\n ans = Max;\n pos.first = i;\n pos.second = j;\n }\n }\n }\n\n // for(ll i=0;i<n;i++){\n // for(ll j=1;j<=h;j++){\n // for(ll k=1;k<= w;k++){\n // cout << t[i][j][k] << \" \";\n // }\n // cout << endl;\n // }\n // }\n // cout << endl << endl;\n\n if(FLAG && Cheak)cout << pos.first << \" \" << pos.second << endl;\n else cout << \"-1 -1\\n\";\n}", "accuracy": 1, "time_ms": 2570, "memory_kb": 120704, "score_of_the_acc": -1.4671, "final_rank": 15 }, { "submission_id": "aoj_0469_9809910", "code_snippet": "#include <bits/stdc++.h>\n//\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\nusing Graph = vector<vector<ll>>;\ntemplate <typename T>\nbool chmax(T &a, const T &b)\n{\n if (a < b)\n {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <typename T>\nbool chmin(T &a, const T &b)\n{\n if (a > b)\n {\n a = b;\n return true;\n }\n return false;\n}\n#define reps(i, a, n) for (ll i = (a); i < (ll)(n); ++i)\n#define rep(i, n) reps(i, 0, n)\n#define rrep(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)\n#define rreps(i ,a, n) for (ll i = (ll)(n)-1; i >=(ll) a; i--)\n#define ALL(box) (box).begin(), (box).end()\n#define all(box) (box).begin(), (box).end()\n#define RALL(box) (box).rbegin(), (box).rend()\n#define rall(box) (box).rbegin(), (box).rend()\nll inf=((1LL<<62)-(1LL<<31))/15;\nll sum = 0;\nll num = 0;\nint pum = 0;\nll mum = 0;\nint min1 = 1000000;\nint max1 = 0;\nll min2 = inf;\nll max2 = -inf;\nll MOD1 = 1000000007;\nll MOD = 998244353;\nint dx[4] = {0, 1, 0, -1};\nint dy[4] = {1, 0, -1, 0}; // 右、下、左、上\nint dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};\nint dy8[8] = {1, 1, 0, -1, -1, -1, 0, 1};\n// sort(box.rbegin(), box.rend());\n// printf(\"%.7Lf\", n);\n// reverse(t.begin(), t.end());\n// unique(box.begin(), box.end());\n// auto It = lower_bound(ALL(box), n);以上 4\n// auto It = upper_bound(ALL(box), n);含まない上 7\n// cout << box.end() - It ; 末尾までの距離\n// cout << It - a.begin() ; 先頭までの距離\n// auto It =box.upper_bound( k);set,multiset\n// pqueue < int, vector<int>, greater<int>> q;\n// priority_queue<pii, vector<pii>, greater<pii>> pq;//小さい順\n// segtree<ll, op, e> seg(N);\n// lazy_segtree<S, op, e, F, mapping, composition, id> seg(N);\n// box.erase(unique(all(box), box.end());\n// st.erase(st.find(5));\nll zaatu(vector<ll>&A){map<ll,ll>m;for(auto&&x:A)m[x]=0;ll ret = 0;for(auto&&[key,val]:m)val=ret++;for(auto&&x:A)x=m[x];return ret;}\nchar ban[330][330];\nint box[330][330];\nint ans_box[330][330];\nint H,W;\nvoid query(int A,int B){\n deque<tuple<int,int,int>> qu;\n qu.push_front({A,B,0});\n rep(i,H){\n rep(j,W){\n box[i][j]=100000000;\n }\n }\n box[A][B]=0;\n while(!qu.empty()){\n auto[a,b,c]=qu.front();\n qu.pop_front();\n rep(d,4){\n int n=dx[d]+a;\n int m=dy[d]+b;\n if(n<0||m<0||n>=H||m>=W) continue;\n int k=0;\n if(ban[n][m]=='@') k=1;\n if(ban[n][m]=='#') continue;\n if(chmin(box[n][m],c+k)){\n if(k==0){\n qu.push_front({n,m,c+k});\n }\n else{\n qu.push_back({n,m,c+k});\n }\n }\n }\n }\n rep(i,H){\n rep(j,W){\n chmax(ans_box[i][j],box[i][j]);\n }\n }\n}\nint main(){\n cin>>H>>W;\n int N;\n cin>>N;\n rep(i,H){\n rep(j,W){\n cin>>ban[i][j];\n ans_box[i][j]=-2;\n }\n }\n rep(i,N){\n int a,b;cin>>a>>b;a--;b--;\n query(a,b);\n }\n int min2=100000000;\n rep(i,H){\n rep(j,W){\n if(ban[i][j]=='.')chmin(min2,ans_box[i][j]);\n }\n }\n //cout<<ans_box[140][147]<<\" \"<<ans_box[134][142]<<\" \"<<endl;\n rep(i,H){\n rep(j,W){\n //cout <<ans_box[i][j]<<\" \";\n }\n //cout <<endl;\n }\n if(min2>=100000000){\n cout <<-1<<\" \"<<-1<<endl;\n }\n else{\n rep(i,H){\n rep(j,W){\n if(min2==ans_box[i][j]){\n cout <<i+1<<\" \"<<j+1<<endl;\n return 0;\n }\n }\n }\n }\n \n}", "accuracy": 0.8666666666666667, "time_ms": 790, "memory_kb": 4560, "score_of_the_acc": -0.1151, "final_rank": 20 }, { "submission_id": "aoj_0469_9809873", "code_snippet": "#include <bits/stdc++.h>\n//\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\nusing Graph = vector<vector<ll>>;\ntemplate <typename T>\nbool chmax(T &a, const T &b)\n{\n if (a < b)\n {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <typename T>\nbool chmin(T &a, const T &b)\n{\n if (a > b)\n {\n a = b;\n return true;\n }\n return false;\n}\n#define reps(i, a, n) for (ll i = (a); i < (ll)(n); ++i)\n#define rep(i, n) reps(i, 0, n)\n#define rrep(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)\n#define rreps(i ,a, n) for (ll i = (ll)(n)-1; i >=(ll) a; i--)\n#define ALL(box) (box).begin(), (box).end()\n#define all(box) (box).begin(), (box).end()\n#define RALL(box) (box).rbegin(), (box).rend()\n#define rall(box) (box).rbegin(), (box).rend()\nll inf=((1LL<<62)-(1LL<<31))/15;\nll sum = 0;\nll num = 0;\nint pum = 0;\nll mum = 0;\nint min1 = 1000000;\nint max1 = 0;\nll min2 = inf;\nll max2 = -inf;\nll MOD1 = 1000000007;\nll MOD = 998244353;\nint dx[4] = {0, 1, 0, -1};\nint dy[4] = {1, 0, -1, 0}; // 右、下、左、上\nint dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};\nint dy8[8] = {1, 1, 0, -1, -1, -1, 0, 1};\n// sort(box.rbegin(), box.rend());\n// printf(\"%.7Lf\", n);\n// reverse(t.begin(), t.end());\n// unique(box.begin(), box.end());\n// auto It = lower_bound(ALL(box), n);以上 4\n// auto It = upper_bound(ALL(box), n);含まない上 7\n// cout << box.end() - It ; 末尾までの距離\n// cout << It - a.begin() ; 先頭までの距離\n// auto It =box.upper_bound( k);set,multiset\n// pqueue < int, vector<int>, greater<int>> q;\n// priority_queue<pii, vector<pii>, greater<pii>> pq;//小さい順\n// segtree<ll, op, e> seg(N);\n// lazy_segtree<S, op, e, F, mapping, composition, id> seg(N);\n// box.erase(unique(all(box), box.end());\n// st.erase(st.find(5));\nll zaatu(vector<ll>&A){map<ll,ll>m;for(auto&&x:A)m[x]=0;ll ret = 0;for(auto&&[key,val]:m)val=ret++;for(auto&&x:A)x=m[x];return ret;}\nchar ban[330][330];\nint box[330][330];\nint ans_box[330][330];\nint H,W;\nvoid query(int A,int B){\n deque<pair<int,int>> qu;\n qu.push_front({A,B});\n rep(i,H){\n rep(j,W){\n box[i][j]=100000;\n }\n }\n box[A][B]=0;\n while(!qu.empty()){\n auto[a,b]=qu.front();\n qu.pop_front();\n rep(d,4){\n int n=dx[d]+a;\n int m=dy[d]+b;\n if(n<0||m<0||n>=H||m>=W) continue;\n int k=0;\n if(ban[n][m]=='@') k=1;\n if(ban[n][m]=='#') continue;\n if(chmin(box[n][m],box[a][b]+k)){\n if(k==0){\n qu.push_front({n,m});\n }\n else{\n qu.push_back({n,m});\n }\n }\n }\n }\n rep(i,H){\n rep(j,W){\n chmax(ans_box[i][j],box[i][j]);\n }\n }\n}\nint main(){\n cin>>H>>W;\n int N;\n cin>>N;\n rep(i,H){\n rep(j,W){\n cin>>ban[i][j];\n ans_box[i][j]=-2;\n }\n }\n rep(i,N){\n int a,b;cin>>a>>b;a--;b--;\n query(a,b);\n }\n int min2=100000;\n rep(i,H){\n rep(j,W){\n if(ban[i][j]=='.')chmin(min2,ans_box[i][j]);\n }\n }\n rep(i,H){\n rep(j,W){\n //cout <<ans_box[i][j]<<\" \";\n }\n //cout <<endl;\n }\n if(min2>=100000){\n cout <<-1<<\" \"<<-1<<endl;\n }\n else{\n rep(i,H){\n rep(j,W){\n if(min2==ans_box[i][j]){\n cout <<i+1<<\" \"<<j+1<<endl;\n return 0;\n }\n }\n }\n }\n \n}", "accuracy": 0.8666666666666667, "time_ms": 770, "memory_kb": 4476, "score_of_the_acc": -0.1055, "final_rank": 19 }, { "submission_id": "aoj_0469_9807314", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define fi first\n#define se second\nusing ll = long long;\nbool chmin(ll &a,ll b){\n if(a>b){\n a=b;\n return true;\n }\n return false;\n}\nint main(){\n int n,m,v;\n cin>>n>>m>>v;\n vector<string> s(n);\n for(int i=0;i<n;i++) cin>>s[i];\n vector<vector<ll>> a(n,vector<ll>(m));\n vector<vector<ll>> b(n,vector<ll>(m));\n vector<int> dx={0,1,0,-1},dy={1,0,-1,0};\n for(int i=0;i<v;i++){\n int x,y;\n cin>>x>>y;\n x--;\n y--;\n for(int j=0;j<n;j++){\n for(int k=0;k<m;k++) b[j][k]=(1<<30);\n }\n b[x][y]=0;\n deque<pair<int,int>> d;\n d.push_back({x,y});\n while(d.size()){\n auto e=d.front();\n d.pop_front();\n for(int j=0;j<4;j++){\n int nx=e.fi+dx[j],ny=e.se+dy[j];\n if(nx<0||ny<0||nx>=n||ny>=m) continue;\n if(s[nx][ny]=='#') continue;\n if(s[nx][ny]=='.'){\n if(chmin(b[nx][ny],b[e.fi][e.se])) d.push_front({nx,ny});\n }\n else{\n if(chmin(b[nx][ny],b[e.fi][e.se]+1)) d.push_back({nx,ny});\n }\n }\n }\n for(int j=0;j<n;j++){\n for(int k=0;k<m;k++) a[j][k]=max(a[j][k],b[j][k]);\n }\n }\n ll now=(1<<30)-1,x=-1,y=-1;\n for(int i=0;i<n;i++){\n for(int j=0;j<m;j++){\n if(s[i][j]=='@') continue;\n if(chmin(now,a[i][j])) x=i+1,y=j+1;\n }\n }\n cout<<x<<\" \"<<y<<endl;\n}", "accuracy": 1, "time_ms": 910, "memory_kb": 5148, "score_of_the_acc": -0.1728, "final_rank": 8 }, { "submission_id": "aoj_0469_9806503", "code_snippet": "#pragma GCC optimize(\"O3\")\n#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tcin.tie(nullptr);\n\tios_base::sync_with_stdio(false);\n\tint h,w,n;\n\tcin >> h >> w >> n;\n\tvector<vector<char>> s(h,vector<char>(w));\n\tfor(int i = 0;i < h;i++){\n\t\tstring S;\n\t\tcin >> S;\n\t\tfor(int j = 0;j < w;j++){\n\t\t\ts[i][j] = S[j];\n\t\t}\n\t}\n\tvector<pair<int,int>> p(n);\n\tfor(int i = 0;i < n;i++){\n\t\tcin >> p[i].first >> p[i].second;\n\t\tp[i].first--;\n\t\tp[i].second--;\n\t}\n\tvector<vector<vector<int>>> t(n,vector<vector<int>>(h,vector<int>(w,-1)));\n\tvector<int> dx = {0,0,1,-1};\n\tvector<int> dy = {1,-1,0,0};\n\tfor(int i = 0;i < n;i++){\n\t\tdeque<pair<int,pair<int,int>>> q;\n\t\tq.push_back({0,p[i]});\n\t\twhile(!q.empty()){\n\t\t\tpair<int,pair<int,int>> it = q.front();\n\t\t\tq.pop_front();\n\t\t\tif(t[i][it.second.first][it.second.second] != -1) continue;\n\t\t\tt[i][it.second.first][it.second.second] = it.first;\n\t\t\tfor(int j = 0;j < 4;j++){\n\t\t\t\tint ny = dy[j] + it.second.first;\n\t\t\t\tint nx = dx[j] + it.second.second;\n\t\t\t\tif(ny < 0 || ny >= h || nx < 0 || nx >= w) continue;\n\t\t\t\tif(t[i][ny][nx] != -1) continue;\n\t\t\t\tif(s[ny][nx] == '#') continue;\n\t\t\t\tif(s[ny][nx] == '@'){\n\t\t\t\t\tq.push_back({it.first + 1,{ny,nx}});\n\t\t\t\t}else{\n\t\t\t\t\tq.push_front({it.first,{ny,nx}});\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tvector<vector<int>> c(h,vector<int>(w,-1));\n\tint ans = INT_MAX;\n\tfor(int i = 0;i < h;i++){\n\t\tfor(int j = 0;j < w;j++){\n\t\t\tif(s[i][j] != '.') continue;\n\t\t\tfor(int k = 0;k < n;k++){\n\t\t\t\tif(t[k][i][j] == -1){\n\t\t\t\t\tc[i][j] = INT_MAX;\n\t\t\t\t}else{\n\t\t\t\t\tc[i][j] = max(c[i][j],t[k][i][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = min(ans,c[i][j]);\n\t\t}\n\t}\n\tif(ans == INT_MAX){\n\t\tcout << \"-1 -1\" << endl;\n\t\texit(0);\n\t}\n\tfor(int i = 0;i < h;i++){\n\t\tfor(int j = 0;j < w;j++){\n\t\t\tif(s[i][j] != '.') continue;\n\t\t\tif(c[i][j] == ans){\n\t\t\t\tcout << i + 1 << \" \" << j + 1 << endl;\n\t\t\t\texit(0);\n\t\t\t}\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 1050, "memory_kb": 113156, "score_of_the_acc": -0.735, "final_rank": 12 }, { "submission_id": "aoj_0469_9803790", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define fi first\n#define se second\nusing ll = long long;\nbool chmin(ll &a,ll b){\n if(a>b){\n a=b;\n return true;\n }\n return false;\n}\nint main(){\n int n,m,v;\n cin>>n>>m>>v;\n vector<string> s(n);\n for(int i=0;i<n;i++) cin>>s[i];\n vector<vector<ll>> a(n,vector<ll>(m));\n vector<vector<ll>> b(n,vector<ll>(m));\n vector<int> dx={0,1,0,-1},dy={1,0,-1,0};\n for(int i=0;i<v;i++){\n int x,y;\n cin>>x>>y;\n x--;\n y--;\n for(int j=0;j<n;j++){\n for(int k=0;k<m;k++) b[j][k]=(1<<30);\n }\n b[x][y]=0;\n deque<pair<int,int>> d;\n d.push_back({x,y});\n while(d.size()){\n auto e=d.front();\n d.pop_front();\n for(int j=0;j<4;j++){\n int nx=e.fi+dx[j],ny=e.se+dy[j];\n if(nx<0||ny<0||nx>=n||ny>=m) continue;\n if(s[nx][ny]=='#') continue;\n if(s[nx][ny]=='.'){\n if(chmin(b[nx][ny],b[e.fi][e.se])) d.push_front({nx,ny});\n }\n else{\n if(chmin(b[nx][ny],b[e.fi][e.se]+1)) d.push_back({nx,ny});\n }\n }\n }\n for(int j=0;j<n;j++){\n for(int k=0;k<m;k++) a[j][k]=max(a[j][k],b[j][k]);\n }\n }\n ll now=(1<<30)-1,x=-1,y=-1;\n for(int i=0;i<n;i++){\n for(int j=0;j<m;j++){\n if(s[i][j]=='@') continue;\n if(chmin(now,a[i][j])) x=i+1,y=j+1;\n }\n }\n cout<<x<<\" \"<<y<<endl;\n}", "accuracy": 1, "time_ms": 910, "memory_kb": 5080, "score_of_the_acc": -0.1725, "final_rank": 7 }, { "submission_id": "aoj_0469_9748337", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <set>\n#include <queue>\nusing namespace std;\nusing ll = long long;\nll INF = (1LL << 60);\nstruct Edge {\n\tint to;\n\tint cost;\n};\nusing Graph = vector<vector<Edge>>;\nvector<pair<int, int>> near(int x, int y, int h, int w) {\n\tvector<pair<int, int>> vec = {{-1, 0}, {0, -1}, {1, 0}, {0, 1}};\n\tvector<pair<int, int>> ret;\n\tfor (auto vc : vec) {\n\t\tint nx = x +vc.first;int ny = y + vc.second;\n\t\tif (nx < 0 or nx >= h) continue;\n\t\tif (ny < 0 or ny >= w)continue;\n\t\tret.push_back({nx, ny});\n\t}\n\treturn ret;\n}\nint cst(int x, int y, int H, int W) {\n\treturn (W*x)+y;\n}\nusing pp = pair<ll, int>;\nvoid DJK(Graph& G, vector<ll>& dist, int st) {\n\tdist[st] = 0;\n\tpriority_queue<pp, vector<pp>, greater<pp>> pq;\n\tpq.push({0, st});\n\twhile (!pq.empty()) {\n\t\tauto tp = pq.top();pq.pop();\n\t\tint v = tp.second;ll d = tp.first;\n\t\tif (dist[v] < d) continue;\n\t\tfor (auto nv : G[v]) {\n\t\t\tll nd = d + nv.cost;\n\t\t\tif (nd < dist[nv.to]) {\n\t\t\t\tdist[nv.to] = nd;\n\t\t\t\tpq.push({nd, nv.to});\n\t\t\t}\n\t\t}\n\t}\n}\nint main() {\n\tint H, W, N;cin >> H >> W >> N;\n\tvector<string> S(H);\n\tfor (int i = 0;i < H;i++) cin >> S[i];\n\tGraph G(H * W);\n\tfor (int i = 0;i < H;i++) for (int j = 0;j < W;j++) {\n\t\tif (S[i][j] == '#') continue;\n\t\tint now = cst(i, j, H, W);\n\t\tfor (auto nr : near(i, j, H, W)) {\n\t\t\tif (S[nr.first][nr.second] == '#') continue;\n\t\t\tint cost = (S[nr.first][nr.second] == '@' ? 1 : 0);\n\t\t\tint to = cst(nr.first, nr.second, H, W);\n\t\t\tG[now].push_back({to, cost});\n\t\t}\n\t}\n\tvector<vector<ll>> dist(N, vector<ll>(H * W, INF));\n\tvector<int> R(N), C(N);\n\tfor (int i = 0;i < N;i++) {\n\t\tint r, c;cin >> r >> c;r--;c--;\n\t\tR[i] = r;C[i] = c;\n\t\tint st = cst(r, c, H, W);\n\t\tDJK(G, dist[i], st);\n\t}\n\tpair<int, int> ret = {-1, -1};\n\tll mn = INF;\n\tfor (int i = 0;i < H;i++) for (int j = 0;j < W;j++) {\n\t\tif (S[i][j] != '.') continue;\n\t\tll sc = 0;\n\t\tfor (int k = 0;k < N;k++) {\n\t\t\tll d = dist[k][cst(i, j, H, W)];\n\t\t\tsc = max(sc, d);\n\t\t}\n\t\tif (sc < mn) {\n\t\t\tmn = sc;\n\t\t\tret = {i + 1, j + 1};\n\t\t}\n\t\t\n\t}\n\tcout << ret.first << \" \" << ret.second << endl;\n}", "accuracy": 1, "time_ms": 2190, "memory_kb": 221368, "score_of_the_acc": -1.7569, "final_rank": 18 }, { "submission_id": "aoj_0469_9738450", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(n);++i)\nusing namespace std;\nusing ll = long long;\n\n\n\nvector<vector<int>> dd = {{0,1},{0,-1},{1,0},{-1,0}};\n\nvoid dijkstra(const vector<string> &G, pair<int,int> s, vector<vector<int>> &dist) {\n int h = G.size();\n int w = G[0].size();\n dist.assign(h, vector<int>(w,1e9));\n \n priority_queue<pair<int, pair<int,int>>, vector<pair<int, pair<int,int>>>, greater<pair<int, pair<int,int>>>> pq;\n dist[s.first][s.second] = 0;\n pq.push({0, s});\n \n vector<pair<int, int>> directions = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};\n \n while (!pq.empty()) {\n auto [currentDist, coord] = pq.top();\n pq.pop();\n int y = coord.first;\n int x = coord.second;\n \n if (currentDist > dist[y][x]) continue;\n \n for (auto [dy, dx] : directions) {\n int ny = y + dy;\n int nx = x + dx;\n if (0 <= ny && ny < h && 0 <= nx && nx < w) {\n if (G[ny][nx] == '#') continue; \n \n int nd = dist[y][x] + (G[ny][nx] == '@');\n \n if (nd < dist[ny][nx]) {\n dist[ny][nx] = nd;\n pq.push({nd, {ny, nx}});\n }\n }\n }\n }\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n \n int h,w,n;\n cin >> h >> w >> n;\n vector<string> s(h);\n rep(i,h) cin >> s[i];\n\n\n vector<int> y(n),x(n);\n vector<vector<vector<int>>> ds(n);\n rep(i,n){\n cin >> y[i] >> x[i];\n y[i]--;x[i]--;\n vector<vector<int>> dist(h,vector<int>(w,1e9));\n dijkstra(s, make_pair(y[i],x[i]), dist);\n ds[i] = dist;\n }\n\n int ans = 1e9;\n\n pair<int,int> z = {-1,-1};\n rep(i,h){\n rep(j,w){\n if(s[i][j]!='.') continue;\n int ma = 0;\n rep(k,n){\n ma = max(ma,ds[k][i][j]);\n }\n if(ans>ma){\n z = make_pair(i,j);\n ans = ma;\n }\n }\n }\n if(ans>=1e9) cout << -1 << \" \" << -1 << endl;\n else cout << z.first+1 << \" \" << z.second+1 << endl;\n\n}", "accuracy": 1, "time_ms": 2470, "memory_kb": 112612, "score_of_the_acc": -1.3839, "final_rank": 14 }, { "submission_id": "aoj_0469_9475237", "code_snippet": "#include <bits/stdc++.h>\n\nint dx[4]{ 1, 0, -1, 0 }, dy[4]{ 0, 1, 0, -1 };\n\nint main() {\n int H, W, N;\n std::cin >> H >> W >> N;\n std::vector<std::string> S(H);\n for (auto& s : S) std::cin >> s;\n const int INF{(int)2e9};\n std::vector sum(H, std::vector<int>(W));\n for (int i{} ; i < N ; i++) {\n int r, c;\n std::cin >> r >> c;\n r--; c--;\n assert(S[r][c] == '.');\n std::vector dist(H, std::vector<int>(W, INF));\n dist[r][c] = 0;\n std::deque<std::pair<int, int>> que;\n que.push_back(std::make_pair(r, c));\n while (que.size()) {\n auto [x, y]{que.front()};\n que.pop_front();\n for (int d{} ; d < 4 ; d++) {\n int nx{x + dx[d]}, ny{y + dy[d]};\n if (nx < 0 or nx >= H) continue;\n if (ny < 0 or ny >= W) continue;\n if (S[nx][ny] == '#') continue;\n int w{S[nx][ny] == '@'};\n if (dist[nx][ny] > dist[x][y] + w) {\n dist[nx][ny] = dist[x][y] + w;\n if (w) que.push_back(std::make_pair(nx, ny));\n else que.push_front(std::make_pair(nx, ny));\n }\n }\n }\n for (int x{} ; x < H ; x++) {\n for (int y{} ; y < W ; y++) {\n sum[x][y] = std::max(sum[x][y], dist[x][y]);\n }\n } \n }\n int x{-2}, y{-2}, val{INF};\n for (int i{} ; i < H ; i++) {\n for (int j{} ; j < W ; j++) {\n if (sum[i][j] == INF or S[i][j] != '.') continue;\n if (val > sum[i][j]) {\n x = i;\n y = j;\n val = sum[i][j];\n }\n }\n }\n std::cout << x + 1 << ' ' << y + 1 << '\\n';\n}", "accuracy": 1, "time_ms": 640, "memory_kb": 4700, "score_of_the_acc": -0.0469, "final_rank": 2 }, { "submission_id": "aoj_0469_9305903", "code_snippet": "#line 1 \"main.cpp\"\n#pragma GCC optimize(\"Ofast,unroll-loops\")\n#pragma GCC target(\"avx,avx2,fma\")\n#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n cout << (x);\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\ntemplate <typename T>\nvoid wt_integer128(T x) {\n char buf[64];\n char *d = end(buf);\n d--; *d = '\\0';\n __uint128_t tmp = ((x < 0)? -x : x);\n do {\n d--; *d = char(tmp%10 + '0'); tmp /= 10;\n } while (tmp);\n if (x < 0) {\n d--; *d = '-';\n }\n cout << d;\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer128(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer128(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 4 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {break;}\n return 0;\n}\n\nint solve() {\n int H, W, N;\n cin >> H >> W >> N;\n vc<string> s(H);\n rep(i, H) {cin >> s[i];}\n vc<int> r(N), c(N);\n rep(i, N) {\n cin >> r[i] >> c[i];\n --r[i]; --c[i];\n }\n vvv(int, d, N, H, W, infty<int>);\n rep(k, N) {\n pqg<tuple<int,int,int>> Q;\n int t = (s[r[k]][c[k]] == '@');\n Q.emplace(mt(t, r[k], c[k]));\n d[k][r[k]][c[k]] = t;\n while (!Q.empty()) {\n auto [t, y, x] = POP(Q);\n static vc<int> dy = {0, 1, 0, -1};\n static vc<int> dx = {1, 0, -1, 0};\n if (t > d[k][y][x]) {continue;}\n rep(i, len(dy)) {\n int ny = y + dy[i];\n int nx = x + dx[i];\n if (ny < 0 or ny >= H or nx < 0 or nx >= W) {continue;}\n if (s[ny][nx] == '#') {continue;}\n int nt = t + (s[ny][nx] == '@');\n if (chmin(d[k][ny][nx], nt)) {\n Q.emplace(mt(nt, ny, nx));\n }\n }\n }\n }\n int ans = infty<int>;\n int ya=-1, xa=-1;\n rep(y, H) rep(x, W) {\n if (s[y][x] != '.') {continue;}\n auto check = [&]() -> int {\n int dmax = 0;\n rep(k, N) {\n if (d[k][y][x] == inf) {return infty<int>;}\n chmax(dmax, d[k][y][x]);\n }\n return dmax;\n };\n if (chmin(ans, check())) {\n ya = y+1;\n xa = x+1;\n }\n }\n print(ya, xa);\n return 0;\n}", "accuracy": 1, "time_ms": 2720, "memory_kb": 112652, "score_of_the_acc": -1.4988, "final_rank": 17 }, { "submission_id": "aoj_0469_9305901", "code_snippet": "#line 1 \"main.cpp\"\n#pragma GCC optimize(\"Ofast,unroll-loops\")\n#pragma GCC target(\"avx,avx2,fma\")\n#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n cout << (x);\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\ntemplate <typename T>\nvoid wt_integer128(T x) {\n char buf[64];\n char *d = end(buf);\n d--; *d = '\\0';\n __uint128_t tmp = ((x < 0)? -x : x);\n do {\n d--; *d = char(tmp%10 + '0'); tmp /= 10;\n } while (tmp);\n if (x < 0) {\n d--; *d = '-';\n }\n cout << d;\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer128(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer128(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 4 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {break;}\n return 0;\n}\n\nint solve() {\n int H, W, N;\n cin >> H >> W >> N;\n vc<string> s(H);\n rep(i, H) {cin >> s[i];}\n vc<int> r(N), c(N);\n rep(i, N) {\n cin >> r[i] >> c[i];\n --r[i]; --c[i];\n }\n vvv(int, d, N, H, W, infty<int>);\n rep(k, N) {\n pqg<tuple<int,int,int>> Q;\n int t = (s[r[k]][c[k]] == '@');\n Q.emplace(mt(t, r[k], c[k]));\n d[k][r[k]][c[k]] = t;\n while (!Q.empty()) {\n auto [t, y, x] = POP(Q);\n static vc<int> dy = {0, 1, 0, -1};\n static vc<int> dx = {1, 0, -1, 0};\n rep(i, len(dy)) {\n int ny = y + dy[i];\n int nx = x + dx[i];\n if (ny < 0 or ny >= H or nx < 0 or nx >= W) {continue;}\n if (s[ny][nx] == '#') {continue;}\n int nt = t + (s[ny][nx] == '@');\n if (chmin(d[k][ny][nx], nt)) {\n Q.emplace(mt(nt, ny, nx));\n }\n }\n }\n }\n int ans = infty<int>;\n int ya=-1, xa=-1;\n rep(y, H) rep(x, W) {\n if (s[y][x] != '.') {continue;}\n auto check = [&]() -> int {\n int dmax = 0;\n rep(k, N) {\n if (d[k][y][x] == inf) {return infty<int>;}\n chmax(dmax, d[k][y][x]);\n }\n return dmax;\n };\n if (chmin(ans, check())) {\n ya = y+1;\n xa = x+1;\n }\n }\n print(ya, xa);\n return 0;\n}", "accuracy": 1, "time_ms": 2700, "memory_kb": 112544, "score_of_the_acc": -1.4891, "final_rank": 16 } ]
aoj_0472_cpp
Placement Games PCK bought a new game to accompany his long autumn nights. The game board is rectangular in shape, divided into equal-sized square sections of $H$ in vertical direction and $W$ in horizontal direction. The player places one rectangular piece on the board that uses $R$ of vertical space and $C$ of horizontal space, aligning it with the boundaries of the sections. However, there are some obstacles placed in the sections, and you cannot place a piece in such a way that it uses a section with an obstacle. Also, the pieces must not be placed in different directions. The number of points in this game is determined by the number of sections in the same row or column as the section of pieces placed, which meet the following conditions: It is not a section where pieces or obstacles are placed. When you move straight from each section to a piece, either vertically or horizontally, you can reach the piece without encountering any obstacles. For example, suppose we have a board with $H=4$ and $W=5$ as shown in (a) below. The $(r,c)$ on the board represents the number of the sections, and there are obstacles in sections $(2,3)$, $(3,5)$, and $(4,4)$. As shown in (b) below, suppose a player places a piece of size $R=1$, $C=2$ using the sections $(3,2)$ and $(3,3)$. In this case, there are 9 sections $(1,2),(1,3),(2,2),(2,3),(3,1),(3,4),(3,5),(4,2),(4,3)$ in the same row and column as the placed piece, excluding the section where the piece was placed. Of these, the sections marked with a "+" in (c) below satisfy the above condition. The number of such sections is the score in this game, and in this case the score is 6. PCK is trying to figure out the maximum number of points he can score with various board and piece sizes. Given the information on the game board and the size of the pieces to be placed, write a program to find the maximum number of points that can be scored in the game. Input The input is given in the following format. $H$ $W$ $R$ $C$ $N$ $r_1$ $c_1$ $r_2$ $c_2$ : $r_N$ $c_N$ In the first line, we are given the number of vertical sections of the board $H$ ($1 \leq H \leq 1000$), the number of horizontal sections $W$ ($1 \leq W \leq 1000$), the number of vertical sections occupied by pieces $R$ ($1 \leq R \leq H$), and the number of horizontal sections $C$ ($1 \leq C \leq W$) are given. In the next line, the number of obstacles $N$ ($0 \leq N \leq 10,000$) is given. However, $N$ will not exceed $H \times W - R \times C$. In the subsequent $N$ line, the location of the obstacle is given. $r_i$ ($1 \leq r_i \leq H$) and $c_i$ ($1 \leq c_i \leq W$) are integers representing the vertical and horizontal positions, respectively. However, the position of the section in the upper left corner is set to $r=1,c=1$. The same position is never given more than once. You can assume that there is always at least one way to place a piece. Output Output the maximum number of points that PCK can obtain on one line. Sample Input and Output Sample Inp ...(truncated)
[ { "submission_id": "aoj_0472_11027000", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define rng(i,l,r) for(int i=(l);i<(r);i++)\n#define rrep(i,n) for(int i=(n)-1;i>=0;i--)\n#define rrng(i,l,r) for(int i=(r)-1;i>=(l);i--)\n#define int long long\n#define fi first\n#define se second\n#define pb push_back\n#define all(x) (x).begin(),(x).end()\n\nint p1[2009][2009],p2[2009][2009];\n\nsigned main(){\n\tint H,W,R,C;cin>>H>>W>>R>>C;\n\t\n\tint N;cin>>N;\n\t\n\tvector<vector<int>> vh(H,{-1,W}),vw(W,{-1,H});\n\trep(_,N){\n\t\tint i,j;cin>>i>>j;\n\t\ti--,j--;\n\t\tp1[i+1][j+1]=1;\n\t\tvh[i].pb(j);\n\t\tvw[j].pb(i);\n\t}\n\trep(i,H)sort(all(vh[i]));\n\trep(i,W)sort(all(vw[i]));\n\t\n\trep(i,H)rep(j,W){\n\t\tif(p1[i+1][j+1])continue;\n\t\tint li=1+*--lower_bound(all(vw[j]),i);\n\t\tint ri=-1+*upper_bound(all(vw[j]),i);\n\t\tint lj=1+*--lower_bound(all(vh[i]),j);\n\t\tint rj=-1+*upper_bound(all(vh[i]),j);\n\t\tassert(li<=i&&i<=ri);assert(lj<=j&&j<=rj);\n\t\tint a1=max(0LL,li-R+1),c1=min(H,ri+1),b1=max(0LL,j-C+1),d1=min(W,j+1);\n\t\tint a2=max(0LL,i-R+1),c2=min(H,i+1),b2=max(0LL,lj-C+1),d2=min(W,rj+1);\n\t\tint a3=max(a1,a2),c3=min(c1,c2),b3=max(b1,b2),d3=min(d1,d2);\n\t\t\n\t\tp2[a1][b1]++,p2[a2][b2]++,p2[a3][b3]--;\n\t\tp2[a1][d1]--,p2[a2][d2]--,p2[a3][d3]++;\n\t\tp2[c1][b1]--,p2[c2][b2]--,p2[c3][b3]++;\n\t\tp2[c1][d1]++,p2[c2][d2]++,p2[c3][d3]--;\n\t}\n\t\n\trep(i,H+9)rep(j,W+9)p1[i+1][j]+=p1[i][j],p2[i+1][j]+=p2[i][j];\n\trep(i,H+9)rep(j,W+9)p1[i][j+1]+=p1[i][j],p2[i][j+1]+=p2[i][j];\n\t\n\t\n\tint ans=0;\n\trep(i,H-R+1)rep(j,W-C+1){\n\t\tint sm=p1[i][j]+p1[i+R][j+C]-p1[i+R][j]-p1[i][j+C];\n\t\t//cout<<i<<\" \"<<j<<\" \"<<sm<<\"\\n\";\n\t\tif(sm==0)ans=max(ans,p2[i][j]-R*C);\n\t}\n\t\n\tcout<<ans<<\"\\n\";\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 37848, "score_of_the_acc": -0.6867, "final_rank": 9 }, { "submission_id": "aoj_0472_11026973", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define rng(i,l,r) for(int i=(l);i<(r);i++)\n#define rrep(i,n) for(int i=(n)-1;i>=0;i--)\n#define rrng(i,l,r) for(int i=(r)-1;i>=(l);i--)\n#define int long long\n#define fi first\n#define se second\n#define pb push_back\n#define all(x) (x).begin(),(x).end()\n\nint p1[2009][2009],p2[2009][2009];\n\nsigned main(){\n\tint H,W,R,C;cin>>H>>W>>R>>C;\n\t\n\tint N;cin>>N;\n\t\n\tvector<vector<int>> vh(H,{-1,W}),vw(W,{-1,H});\n\trep(_,N){\n\t\tint i,j;cin>>i>>j;\n\t\ti--,j--;\n\t\tp1[i+1][j+1]=1;\n\t\tvh[i].pb(j);\n\t\tvw[j].pb(i);\n\t}\n\trep(i,H)sort(all(vh[i]));\n\trep(i,W)sort(all(vw[i]));\n\t\n\trep(i,H)rep(j,W){\n\t\tif(p1[i+1][j+1])continue;\n\t\tint li=1+*--lower_bound(all(vw[j]),i);\n\t\tint ri=-1+*upper_bound(all(vw[j]),i);\n\t\tint lj=1+*--lower_bound(all(vh[i]),j);\n\t\tint rj=-1+*upper_bound(all(vh[i]),j);\n\t\t\n\t\tint a1=max(0LL,li-R+1),c1=min(H,ri+1),b1=max(0LL,j-C+1),d1=min(W,j+1);\n\t\tint a2=max(0LL,i-R+1),c2=min(H,i+1),b2=max(0LL,lj-C+1),d2=min(W,rj+1);\n\t\tint a3=max(a1,a2),c3=min(c1,c2),b3=max(b1,b2),d3=min(d1,d2);\n\t\t\n\t\tp2[a1][b1]++,p2[a2][b2]++,p2[a3][b3]--;\n\t\tp2[a1][d1]--,p2[a2][d2]--,p2[a3][d3]++;\n\t\tp2[c1][b1]--,p2[c2][b2]--,p2[c3][b3]++;\n\t\tp2[c1][d1]++,p2[c2][d2]++,p2[c3][d3]--;\n\t}\n\t\n\trep(i,H)rep(j,W)p1[i+1][j]+=p1[i][j],p2[i+1][j]+=p2[i][j];\n\trep(i,H)rep(j,W)p1[i][j+1]+=p1[i][j],p2[i][j+1]+=p2[i][j];\n\t\n\t\n\tint ans=0;\n\trep(i,H-R+1)rep(j,W-C+1){\n\t\tint sm=p1[i][j]+p1[i+R][j+C]-p1[i+R][j]-p1[i][j+C];\n\t\t//cout<<i<<\" \"<<j<<\" \"<<sm<<\"\\n\";\n\t\tif(sm==0)ans=max(ans,p2[i][j]-R*C);\n\t}\n\t\n\tcout<<ans<<\"\\n\";\n}", "accuracy": 0.5666666666666667, "time_ms": 10, "memory_kb": 37544, "score_of_the_acc": -0.4811, "final_rank": 20 }, { "submission_id": "aoj_0472_11015522", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n//#include<atcoder/all>\n//using namespace atcoder;\n//using mint = modint998244353;\n#define int long long\nsigned main() {\n int h,w,r,c;\n cin >> h >> w >> r >> c;\n int n;\n cin >> n;\n vector<vector<bool>> s(h,vector<bool>(w,true));\n vector<vector<int>> a(h+1,vector<int>(w+1,0));\n for(int i = 0; i < n; i++) {\n int x,y;\n cin >> x >> y;\n x--,y--;\n s[x][y] = false;\n a[x+1][y+1]++;\n }\n for(int i = 0; i < h; i++) for(int j = 1; j <= w; j++) a[i+1][j]+=a[i][j];\n for(int i = 1; i <= h; i++) for(int j = 0; j < w; j++) a[i][j+1]+=a[i][j];\n vector<vector<int>> d(h+1,vector<int>(w+1,0)),e(h+1,vector<int>(w+1,0)),f(h+1,vector<int>(w+1,0)),g(h+1,vector<int>(w+1,0));\n for(int i = 0; i < h; i++) {\n for(int j = 0; j < w; j++) {\n if(s[i][j]) d[i+1][j+1] = d[i][j+1]+1;\n }\n }\n for(int i = h-1; i >= 0; i--) {\n for(int j = 0; j < w; j++) {\n if(s[i][j]) e[i][j+1] = e[i+1][j+1]+1;\n }\n }\n for(int i = 0; i < h; i++) {\n for(int j = 0; j < w; j++) {\n if(s[i][j]) f[i+1][j+1] = f[i+1][j]+1;\n }\n for(int j = w-1; j >= 0; j--) {\n if(s[i][j]) g[i+1][j] = g[i+1][j+1]+1;\n }\n }\n /*for(int i = 0; i < h; i++) {\n for(int j = 0; j < w; j++) cout << s[i][j];\n cout << endl;\n }*/\n for(int i = 0; i <= h; i++) for(int j = 0; j < w; j++) d[i][j+1]+=d[i][j], e[i][j+1]+=e[i][j];\n for(int i = 0; i < h; i++) for(int j = 0; j <= w; j++) f[i+1][j]+=f[i][j], g[i+1][j]+=g[i][j];\n int ans = 0;\n for(int i = 0; i <= h-r; i++) {\n for(int j = 0; j <= w-c; j++) {\n if(a[i+r][j+c]-a[i][j+c]-a[i+r][j]+a[i][j] != 0) continue;\n //[i,i+r),[j,j+c)\n //cout << i << ' ' << j << ' ' << (d[i+1][j+c]-d[i+1][j]) << ' ' << (e[i+r-1][j+c]-e[i+r-1][j]) << ' ' << (f[i+r][j+1]-f[i][j+1]) << ' ' << (g[i+r][j+c-1]-g[i][j+c-1]) << endl;\n ans = max(ans,(d[i+1][j+c]-d[i+1][j])+(e[i+r-1][j+c]-e[i+r-1][j])+(f[i+r][j+1]-f[i][j+1])+(g[i+r][j+c-1]-g[i][j+c-1])-r*2-c*2);\n }\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 42688, "score_of_the_acc": -0.7753, "final_rank": 10 }, { "submission_id": "aoj_0472_11011198", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nint main(){\n\tint H,W,R,C,N;\n\tcin>>H>>W>>R>>C>>N;\n\tint r[N+1],c[N+1];\n\tfor(int i=1;i<=N;i++) cin>>r[i]>>c[i];\n\t\n\t\n\t//setに入れる\n\tset<int>S1[H+1],S2[W+1];\n\tfor(int i=1;i<=N;i++){\n\t\tS1[r[i]].insert(c[i]);\n\t\tS2[c[i]].insert(r[i]);\n\t}\n\tfor(int i=1;i<=H;i++){\n\t\tS1[i].insert(0);\n\t\tS1[i].insert(W+1);\n\t}\n\tfor(int i=1;i<=W;i++){\n\t\tS2[i].insert(0);\n\t\tS2[i].insert(H+1);\n\t}\n\t\n\tint cnt1[H+1][W+1],cnt2[H+1][W+1],cnt3[H+1][W+1],cnt4[H+1][W+1];\n\tfor(int i=0;i<=H;i++){\n\t\tfor(int j=0;j<=W;j++){\n\t\t\tcnt1[i][j]=0;\n\t\t\tcnt2[i][j]=0;\n\t\t\tcnt3[i][j]=0;\n\t\t\tcnt4[i][j]=0;\n\t\t}\n\t}\n\t//1が下,2が上,3が右,4が左\n\tfor(int i=1;i<=H;i++){\n\t\tfor(int j=1;j<=W;j++){\n\t\t\tauto iter1=S1[i].lower_bound(j);\n\t\t\tauto iter2=S2[j].lower_bound(i);\n\t\t\tcnt1[i][j]=(*iter2)-i-1;\n\t\t\tcnt3[i][j]=(*iter1)-j-1;\n\t\t\titer1--;\n\t\t\titer2--;\n\t\t\tcnt2[i][j]=i-(*iter2)-1;\n\t\t\tcnt4[i][j]=j-(*iter1)-1;\n\t\t}\n\t}\n\t//累積和を求める\n\tfor(int i=1;i<=H;i++){\n\t\tfor(int j=1;j<=W;j++){\n\t\t\tcnt1[i][j]+=cnt1[i][j-1];\n\t\t\tcnt2[i][j]+=cnt2[i][j-1];\n\t\t\tcnt3[i][j]+=cnt3[i-1][j];\n\t\t\tcnt4[i][j]+=cnt4[i-1][j];\n\t\t}\n\t}\n\t//設置可能か判定\n\tint ng_cnt[H+1][W+1];\n\tfor(int i=0;i<=H;i++){\n\t\tfor(int j=0;j<=W;j++) ng_cnt[i][j]=0;\n\t}\n\tfor(int i=1;i<=N;i++) ng_cnt[r[i]][c[i]]++;\n\tfor(int i=1;i<=H;i++){\n\t\tfor(int j=1;j<=W;j++) ng_cnt[i][j]+=ng_cnt[i-1][j];\n\t}\n\tfor(int i=1;i<=H;i++){\n\t\tfor(int j=1;j<=W;j++) ng_cnt[i][j]+=ng_cnt[i][j-1];\n\t}\n\tint ans=0;\n\tfor(int i=R;i<=H;i++){\n\t\tfor(int j=C;j<=W;j++){\n\t\t\tint sr=i-R,sc=j-C;\n\t\t\tint ng=ng_cnt[i][j]-ng_cnt[sr][j]-ng_cnt[i][sc]+ng_cnt[sr][sc];\n\t\t\tif(ng>=1) continue;\n\t\t\tint now_cnt=0;\n\t\t\tnow_cnt+=cnt1[i][j]-cnt1[i][sc];\n\t\t\tnow_cnt+=cnt2[sr+1][j]-cnt2[sr+1][sc];\n\t\t\tnow_cnt+=cnt3[i][j]-cnt3[sr][j];\n\t\t\tnow_cnt+=cnt4[i][sc+1]-cnt4[sr][sc+1];\n\t\t\tans=max(ans,now_cnt);\n\t\t}\n\t}\n\tcout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 23304, "score_of_the_acc": -0.2203, "final_rank": 6 }, { "submission_id": "aoj_0472_10985368", "code_snippet": "#include<iostream>\n#include<algorithm>\n#include<cmath>\n#include<cstdio>\n#include<tuple>\n#include<utility>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<queue>\n#include<deque>\n#include<stack>\n#include<bit>\n#include<bitset>\n#include<limits>\n#include<iomanip>\n#include<unordered_set>\n\nusing namespace std;\n\nlong int sign(long int A){\n if (A < 0){\n return -1;\n }else if(A > 0){\n return 1;\n }else{\n return 0;\n }\n}\n\nlong int orientation(pair<long int, long int>a,pair<long int, long int>b,pair<long int, long int>c){\n long int cross = (b.first - a.first) * (c.second - a.second) - (b.second - a.second) * (c.first - a.first);\n return sign(cross);\n}\n\nbool segments_intersect(pair<long int, long int>p1,pair<long int, long int>p2,pair<long int, long int>q1,pair<long int, long int>q2){\n if (max(p1.first, p2.first) < min(q1.first, q2.first) || max(q1.first, q2.first) < min(p1.first, p2.first) || max(p1.second, p2.second) < min(q1.second, q2.second) || max(q1.second, q2.second) < min(p1.second, p2.second)){\n return false;\n }\n long int o1 = orientation(p1, p2, q1);\n long int o2 = orientation(p1, p2, q2);\n long int o3 = orientation(q1, q2, p1);\n long int o4 = orientation(q1, q2, p2);\n if (o1 * o2 <= 0 && o3 * o4 <= 0){\n return true;\n }else{\n return false;\n }\n}\n\nint main(){\n long int H, W, R, C, N, Y, X;\n cin >> H >> W >> R >> C >> N;\n vector<vector<long int> > NG(H + 2, vector<long int>(W + 2, 0));\n vector<vector<long int> > NGH(H + 2);\n vector<vector<long int> > NGW(W + 2);\n for (long int i = 0; i < N; i++){\n cin >> Y >> X;\n NG.at(Y).at(X) = 1;\n NGH.at(Y).push_back(X);\n NGW.at(X).push_back(Y);\n }\n for (long int i = 0; i < H + 2; i++){\n NG.at(i).at(0) = 1;\n NG.at(i).at(W + 1) = 1;\n NGH.at(i).push_back(0);\n NGW.at(0).push_back(i);\n NGH.at(i).push_back(W + 1);\n NGW.at(W + 1).push_back(i);\n }\n for (long int i = 0; i < W + 2; i++){\n NG.at(0).at(i) = 1;\n NG.at(H + 1).at(i) = 1;\n NGH.at(0).push_back(i);\n NGW.at(i).push_back(0);\n NGH.at(H + 1).push_back(i);\n NGW.at(i).push_back(H + 1);\n }\n for (long int i = 0; i < H + 2; i++){\n sort(NGH.at(i).begin(), NGH.at(i).end());\n }\n for (long int i = 0; i < W + 2; i++){\n sort(NGW.at(i).begin(), NGW.at(i).end());\n }\n vector<vector<long int> > A(H + 2, vector<long int>(W + 2));\n vector<vector<long int> > B(H + 2, vector<long int>(W + 2));\n vector<vector<long int> > score1(H + 2, vector<long int>(W + 2, 0));\n vector<vector<long int> > score2(H + 2, vector<long int>(W + 2, 0));\n vector<vector<long int> > score1s(H + 2, vector<long int>(W + 2, 0));\n vector<vector<long int> > score2s(H + 2, vector<long int>(W + 2, 0));\n for (long int i = 0; i < H + 2; i++){\n for (long int j = 0; j < W + 2; j++){\n if (NG.at(i).at(j) == 0){\n A.at(i).at(j) = A.at(i).at(j - 1) + 1;\n }else{\n A.at(i).at(j) = 0;\n }\n }\n }\n for (long int i = 0; i < H + 2; i++){\n for (long int j = 0; j < W + 2; j++){\n if (A.at(i).at(j) >= C){\n B.at(i).at(j) = B.at(i - 1).at(j) + 1;\n }else{\n B.at(i).at(j) = 0;\n }\n }\n }\n for (long int i = 1; i < H + 1; i++){\n for (long int j = 1; j < W + 1; j++){\n if (NG.at(i).at(j) == 1){\n continue;\n }\n auto itr = upper_bound(NGH.at(i).begin(), NGH.at(i).end(), j);\n score1.at(i).at(j) += *itr - j - 1;\n itr--;\n score1.at(i).at(j) += j - *itr - 1;\n itr = upper_bound(NGW.at(j).begin(), NGW.at(j).end(), i);\n score2.at(i).at(j) += *itr - i - 1;\n itr--;\n score2.at(i).at(j) += i - *itr - 1;\n }\n }\n for (long int i = 1; i < H + 2; i++){\n for (long int j = 0; j < W + 2; j++){\n score1s.at(i).at(j) = score1s.at(i - 1).at(j) + score1.at(i).at(j);\n }\n }\n for (long int i = 0; i < H + 2; i++){\n for (long int j = 1; j < W + 2; j++){\n score2s.at(i).at(j) = score2s.at(i).at(j - 1) + score2.at(i).at(j);\n }\n }\n long int ans = 0;\n for (long int i = R; i < H + 1; i++){\n for (long int j = C; j < W + 1; j++){\n if (B.at(i).at(j) >= R){\n ans = max(ans, score1s.at(i).at(j) - score1s.at(i - R).at(j) + score2s.at(i).at(j) - score2s.at(i).at(j - C) - (R - 1) * C - (C - 1) * R);\n }\n }\n }\ncout << ans << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 58752, "score_of_the_acc": -1.0695, "final_rank": 13 }, { "submission_id": "aoj_0472_10956909", "code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, l, n) for(int i = int(l); i < int(n); i++)\n#define ll long long\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n\ntemplate<class T> bool chmin(T &a, T b) {if(a > b) {a = b; return true;} return false;}\ntemplate<class T> bool chmax(T &a, T b) {if(a < b) {a = b; return true;} return false;}\ntemplate<class T> using spq = priority_queue<T, vector<T>, greater<T>>;\n\n// bool -> Yes/No\nstring answer(bool b) {return b ? \"Yes\" : \"No\";}\n\nvoid fix(int k) {cout << fixed << setprecision(k);}\n\nconst int inf = 2e9;\nconst long long INF = 2e18;\nconst long double eps = 1e-12;\nconst long double pi = acos(-1);\nint dx[] = {0, -1, 0, 1, -1, -1, 1, 1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};\n\nvoid main_program() {\n int h, w, r, c; cin >> h >> w >> r >> c;\n vector<int> oh[h], ow[w];\n rep(i, 0, h) oh[i].emplace_back(-1), oh[i].emplace_back(w);\n rep(i, 0, w) ow[i].emplace_back(-1), ow[i].emplace_back(h);\n int grid[h + 1][w + 1];\n rep(i, 0, h + 1) rep(j, 0, w + 1) grid[i][j] = 0;\n int n; cin >> n;\n while(n--) {\n int x, y; cin >> x >> y;\n grid[x--][y--]++;\n oh[x].emplace_back(y);\n ow[y].emplace_back(x);\n }\n rep(i, 1, h + 1) rep(j, 1, w + 1) grid[i][j] += grid[i - 1][j] + grid[i][j - 1] - grid[i - 1][j - 1];\n rep(i, 0, h) sort(all(oh[i]));\n rep(i, 0, w) sort(all(ow[i]));\n int distsum[h - r + 1][w - c + 1];\n // 進行方向のものを数える\n rep(i, 0, h - r + 1) {\n spq<pair<int, vector<int>::iterator>> f, b;\n int fsum = 0, bsum = -r;\n rep(j, 0, r) {\n b.emplace(oh[i + j][1], oh[i + j].begin());\n auto itr = lower_bound(all(oh[i + j]), c);\n f.emplace(*itr, itr); fsum += *itr;\n }\n rep(j, 0, w - c + 1) {\n distsum[i][j] = 0;\n if(grid[i + r][j + c] + grid[i][j] - grid[i][j + c] - grid[i + r][j]) continue;\n while(f.top().first < j + c) {\n auto[val, itr] = f.top(); f.pop();\n fsum += *(++itr) - val;\n f.emplace(*itr, itr);\n }\n while(b.top().first < j) {\n auto[val, itr] = b.top(); b.pop();\n bsum += val - *(itr++);\n b.emplace(*next(itr), itr);\n }\n distsum[i][j] += fsum - (j + c) * r;\n distsum[i][j] += (j - 1) * r - bsum;\n }\n }\n // 向きを変えて同じことをやる\n rep(i, 0, w - c + 1) {\n spq<pair<int, vector<int>::iterator>> f, b;\n int fsum = 0, bsum = -c;\n rep(j, 0, c) {\n b.emplace(ow[i + j][1], ow[i + j].begin());\n auto itr = lower_bound(all(ow[i + j]), r);\n f.emplace(*itr, itr); fsum += *itr;\n }\n rep(j, 0, h - r + 1) {\n if(grid[j + r][i + c] + grid[j][i] - grid[j][i + c] - grid[j + r][i]) continue;\n while(f.top().first < j + r) {\n auto[val, itr] = f.top(); f.pop();\n fsum += *(++itr) - val;\n f.emplace(*itr, itr);\n }\n while(b.top().first < j) {\n auto[val, itr] = b.top(); b.pop();\n bsum += val - *(itr++);\n b.emplace(*next(itr), itr);\n }\n distsum[j][i] += fsum - (j + r) * c;\n distsum[j][i] += (j - 1) * c - bsum;\n }\n }/*\n rep(i, 0, h - r + 1) {\n rep(j, 0, w - c + 1) cout << distsum[i][j] << \" \";\n cout << \"\\n\";\n }*/\n int ans = 0;\n rep(i, 0, h - r + 1) rep(j, 0, w - c + 1) chmax(ans, distsum[i][j]);\n cout << ans << \"\\n\";\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int T = 1;\n //cin >> T;\n while(T--) {\n main_program();\n }\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 11272, "score_of_the_acc": -0.2, "final_rank": 2 }, { "submission_id": "aoj_0472_10956777", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n // step 1. input\n int h, w, r, c; cin >> h >> w >> r >> c;\n int k; cin >> k;\n vector<vector<bool>> shogai(h, vector<bool>(w, false));\n for (int i = 0; i < k; i++) {\n int x, y; cin >> x >> y; x--; y--;\n shogai[x][y] = true;\n }\n\n // step 2. ruisekiwa\n vector<vector<int>> wa(h + 1, vector<int>(w + 1, 0));\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n wa[i + 1][j + 1] = (shogai[i][j] ? 1 : 0);\n }\n }\n for (int i = 1; i <= h; i++) {\n for (int j = 1; j <= w; j++) {\n wa[i][j] += wa[i - 1][j];\n }\n }\n for (int i = 1; i <= h; i++) {\n for (int j = 1; j <= w; j++) {\n wa[i][j] += wa[i][j - 1];\n }\n }\n\n // step 3. solve init\n vector<vector<int>> sumL(h + 1, vector<int>(w + 1, 0));\n vector<vector<int>> sumR(h + 1, vector<int>(w + 1, 0));\n vector<vector<int>> sumU(h + 1, vector<int>(w + 1, 0));\n vector<vector<int>> sumD(h + 1, vector<int>(w + 1, 0));\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n if (shogai[i][j] == true) sumL[i][j] = 0;\n else sumL[i][j] = (j == 0 ? 0 : sumL[i][j - 1]) + 1;\n }\n }\n for (int i = 0; i < h; i++) {\n for (int j = w - 1; j >= 0; j--) {\n if (shogai[i][j] == true) sumR[i][j] = 0;\n else sumR[i][j] = sumR[i][j + 1] + 1;\n }\n }\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n if (shogai[i][j] == true) sumU[i][j] = 0;\n else sumU[i][j] = (i == 0 ? 0 : sumU[i - 1][j]) + 1;\n }\n }\n for (int i = h - 1; i >= 0; i--) {\n for (int j = 0; j < w; j++) {\n if (shogai[i][j] == true) sumD[i][j] = 0;\n else sumD[i][j] = sumD[i + 1][j] + 1;\n }\n }\n /*for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n cout << sumD[i][j] << \" \";\n }\n cout << endl;\n }*/\n\n // step 4. solve init (ruisekiwa)\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) sumU[i][j + 1] += sumU[i][j];\n for (int j = 0; j < w; j++) sumD[i][j + 1] += sumD[i][j];\n }\n for (int j = 0; j < w; j++) {\n for (int i = 0; i < h; i++) sumL[i + 1][j] += sumL[i][j];\n for (int i = 0; i < h; i++) sumR[i + 1][j] += sumR[i][j];\n }\n\n // step 5. solve main\n int max_score = 0;\n for (int i = 0; i <= h - r; i++) {\n for (int j = 0; j <= w - c; j++) {\n int sum_shogai = wa[i + r][j + c] + wa[i][j] - wa[i + r][j] - wa[i][j + c];\n if (sum_shogai > 0) continue;\n\n // 障害物がない場合\n int score = 0;\n if (i >= 1) {\n score += sumU[i - 1][j + c - 1] - (j == 0 ? 0 : sumU[i - 1][j - 1]);\n }\n if (i <= h - r - 1) {\n score += sumD[i + r][j + c - 1] - (j == 0 ? 0 : sumD[i + r][j - 1]);\n }\n if (j >= 1) {\n score += sumL[i + r - 1][j - 1] - (i == 0 ? 0 : sumL[i - 1][j - 1]);\n }\n if (j <= w - c - 1) {\n score += sumR[i + r - 1][j + c] - (i == 0 ? 0 : sumR[i - 1][j + c]);\n }\n // cerr << i << \" \" << j << \" \" << score << endl;\n max_score = max(max_score, score);\n }\n }\n\n // step 6. output\n cout << max_score << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 23352, "score_of_the_acc": -0.4212, "final_rank": 7 }, { "submission_id": "aoj_0472_10956761", "code_snippet": "#include <iostream>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <algorithm>\n#include <set>\nusing ll = long long;\nusing namespace std;\n\nint dp[1001][1001][4];\n\nint SDP[4][1001][1001];\n\n\n\nint sum(int a, int b, int d, int e, int dr) {\n\treturn (SDP[dr][d][e] - SDP[dr][a-1][e]-SDP[dr][d][b-1] + SDP[dr][a-1][b-1]);\n}\nint main(){\n\tint H, W, R, C;cin >> H >> W >> R >> C;\n\tint N;cin >> N;\n\tvector<vector<int>> A(H+1, vector<int>(W+1, 0));\n\tfor (int i = 0;i < N;i++) {\n\t\tint r, c;cin >> r >> c;\n\t\tA[r][c] = 1;\n\t}\n\tvector<vector<int>> S(H+1, vector<int>(W+1,0));\n\tfor (int i = 0;i <= H;i++) for (int j = 0;j <= W;j++) {\n\t\tif (i == 0 or j == 0) {\n\t\t\tfor (int k = 0;k < 4;k++) dp[i][j][k] = 0;\n\t\t\tcontinue;\n\t\t}\n\t\tS[i][j] = A[i][j] + S[i-1][j] + S[i][j-1] - S[i-1][j-1];\n\t\tif (A[i][j] == 1) {\n\t\t\tdp[i][j][0] = 0;\n\t\t\tdp[i][j][1] = 0;\n\t\t\tcontinue;\n\t\t}\n\t\tif (i == 1) {\n\t\t\tdp[i][j][0] = 1;\n\t\t} else {\n\t\t\tdp[i][j][0] = 1 + dp[i-1][j][0];\n\t\t}\n\t\t\n\t\tif (j == 1) {\n\t\t\tdp[i][j][1] = 1;\n\t\t} else {\n\t\t\tdp[i][j][1] = 1 + dp[i][j-1][1];\n\t\t}\n\t}\n\tfor (int i = H;i >= 1;i--) for (int j = W;j >= 1;j--) {\n\t\tif (A[i][j] == 1) {\n\t\t\tdp[i][j][2] = 0;\n\t\t\tdp[i][j][3] = 0;\n\t\t\tcontinue;\n\t\t}\n\t\tif (i == H) {\n\t\t\tdp[i][j][2] = 1;\n\t\t} else {\n\t\t\tdp[i][j][2] = 1 + dp[i+1][j][2];\n\t\t}\n\t\tif (j == W) {\n\t\t\tdp[i][j][3] = 1;\n\t\t} else {\n\t\t\tdp[i][j][3] = 1 + dp[i][j+1][3];\n\t\t}\n\t}\n\tfor (int k = 0;k < 4;k++) for (int i = 0;i <= H;i++) for (int j = 0;j <= W;j++) {\n\t\tif (i == 0 or j == 0) {\n\t\t\tSDP[k][i][j] = 0;\n\t\t\tcontinue;\n\t\t}\n\t\tSDP[k][i][j] = dp[i][j][k] + SDP[k][i-1][j] + SDP[k][i][j-1] - SDP[k][i-1][j-1];\n\t\t//cout << k << \" \" << i << \" \" << j << \" \" << dp[i][j][k] << \" \" << SDP[k][i][j] << endl;\n\t}\n\tint res = 0;\n\tfor (int i = 1;i <= H-R+1;i++) for (int j = 1;j <= W-C+1;j++) {\n\t\tint s = i + R - 1;\n\t\tint t = j + C - 1;\n\t\tint cnts = S[s][t] - S[i-1][t] - S[s][j-1] + S[i-1][j-1];\n\t\tif (cnts != 0) continue;\n\t\tint sc = 0;\n\t\tif (i >= 2) {\n\t\t\tsc += sum(i-1, j, i-1,t, 0);\n\t\t\t///cout << \"Z0 \" << sum(i-1, j, i-1, t, 0) << endl;\n\t\t}\n\t\tif (j >= 2) {\n\t\t\tsc += sum(i, j-1, s, j-1, 1);\n\t\t//\tcout << \"Z1 \" << sum(i, j-1, s, j-1, 1) << \" \" << i << \" \" << j-1 << \" \" << s << \" \" << j-1 << \" \" << endl;\n\t\t\t//cout << \"V \" << SDP[1][s][j-1] << \" \" << SDP[1][i-1][j-1] << \" \" << SDP[1][s][j-2] << \" \" << SDP[1][i-1][j-2] << endl;\n\t\t}\n\t\t\n\t\tif (s < H) {\n\t\t\tsc += sum(s+1, j, s+1, t, 2);\n\t\t//\tcout <<\"Z2 \" << sum(s+1, j, s+1, t, 2) << endl;\n\t\t}\n\t\t\n\t\tif (t < W) {\n\t\t\tsc += sum(i, t +1, s, t+1, 3);\n\t\t//\tcout << \"Z3 \" << sum(i, t+1, s, t+1, 3) << endl;\n\t\t}\n\t\t\n\t\n\t\tres = max(res, sc);\n\t}\t\t\n\tcout << res << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 42876, "score_of_the_acc": -0.5787, "final_rank": 8 }, { "submission_id": "aoj_0472_10933350", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define ll long long\n#define vec vector\n#define vi vector<int>\n#define vll vector<ll>\n#define pq priority_queue\n#define pb push_back\n#define ep emplace_back\n#define rep(i, l, r) for(ll i = (ll)(l); i < (ll)(r); i++)\n#define ld long double\n\nconst ll INf = 1e9;\nconst ll inf = 5e18;\n\nconst vector<ll> di = {-1, 0, 1, 0}, dj = {0, 1, 0, -1};\n\ntemplate<class T>\nbool chmax(T&a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n for(int i = 0; i < (int)v.size(); i++) {\n if(i != (int)v.size() - 1) os << v[i] << \" \";\n else os << v[i];\n }\n return os;\n}\n\nint main() {\n int h, w, r, c, n; cin >> h >> w >> r >> c >> n;\n vec<vi> g(h + 1, vi(w + 1, 0));\n rep(i, 0, n) {\n int ri, ci; cin >> ri >> ci;\n g[ri][ci]++;\n }\n vec<vi> rs(h, vi(w, 0)), cs(h, vi(w, 0));\n rep(i, 0, h) {\n rep(j, 0, w) {\n rep(k, j, w) {\n if(g[i + 1][k + 1] == 1) {\n rep(l, j, k) rs[i][l] = k - j;\n j = k;\n break;\n }\n if(k == w - 1) {\n rep(l, j, w) rs[i][l] = w - j;\n j = w;\n break;\n }\n }\n }\n }\n rep(i, 0, w) {\n rep(j, 0, h) {\n rep(k, j, h) {\n if(g[k + 1][i + 1] == 1) {\n rep(l, j, k) cs[l][i] = k - j;\n j = k;\n break;\n }\n if(k == h - 1) {\n rep(l, j, h) cs[l][i] = h - j;\n j = h;\n break;\n }\n }\n }\n }\n rep(i, 0, h + 1) rep(j, 1, w + 1) if(j != 0) g[i][j] += g[i][j - 1];\n rep(i, 0, w + 1) rep(j, 1, h + 1) if(j != 0) g[j][i] += g[j - 1][i];\n vec<vi> cnts(h - r + 1, vi(w - c + 1, -1));\n int ans = 0;\n rep(i, 0, h - r + 1) {\n if(g[i + r][c] + g[i][0] - g[i][c] - g[i + r][0] == 0) {\n cnts[i][0] = 0;\n if(i != 0) {\n if(cnts[i - 1][0] != -1) {\n cnts[i][0] = cnts[i - 1][0];\n cnts[i][0] += rs[i + r - 1][0] - c;\n cnts[i][0] -= rs[i - 1][0] - c;\n }\n else {\n rep(j, 0, r) cnts[i][0] += rs[i + j][0] - c;\n rep(j, 0, c) cnts[i][0] += cs[i][j] - r;\n }\n }\n else {\n rep(j, 0, r) cnts[i][0] += rs[i + j][0] - c;\n rep(j, 0, c) cnts[i][0] += cs[i][j] - r;\n }\n }\n chmax(ans, cnts[i][0]);\n rep(j, 1, w - c + 1) {\n if(g[i + r][j + c] + g[i][j] - g[i][j + c] - g[i + r][j] != 0) continue;\n if(cnts[i][j - 1] != -1) {\n cnts[i][j] = cnts[i][j - 1];\n cnts[i][j] += cs[i][j + c - 1] - r;\n cnts[i][j] -= cs[i][j - 1] - r;\n }\n else if(i != 0 && cnts[i - 1][j] != -1) {\n cnts[i][j] = cnts[i - 1][j];\n cnts[i][j] += rs[i + r - 1][j] - c;\n cnts[i][j] -= rs[i - 1][j] - c;\n }\n else {\n cnts[i][j] = 0;\n rep(k, 0, r) cnts[i][j] += rs[i + k][j] - c;\n rep(k, 0, c) cnts[i][j] += cs[i][j + k] - r;\n }\n chmax(ans, cnts[i][j]);\n }\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 19124, "score_of_the_acc": -0.1438, "final_rank": 1 }, { "submission_id": "aoj_0472_10913308", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)\n\nint main() {\n\tcin.tie(nullptr);\n\tios_base::sync_with_stdio(false);\n\t\n\tint H, W, R, C, N;\n\tcin >> H >> W >> R >> C >> N;\n\t\n\tvector wall(H, vector<bool>(W));\n\tvector cnt(H, vector<int>(W));\n\trep(i, 0, N) {\n\t\tint r, c;\n\t\tcin >> r >> c;\n\t\t--r, --c;\n\t\twall[r][c] = true;\n\t\t++cnt[r][c];\n\t}\n\t\n\trep(i, 1, H) rep(j, 0, W) cnt[i][j] += cnt[i - 1][j];\n\trep(i, 0, H) rep(j, 1, W) cnt[i][j] += cnt[i][j - 1];\n\t\n\tvector vert(H, vector<ll>(W)), hori(H, vector<ll>(W));\n\t// vert\n\trep(j, 0, W) {\n\t\trep(i, 0, H) {\n\t\t\tif (wall[i][j]) continue;\n\t\t\t\n\t\t\tif (i == 0 || wall[i - 1][j]) {\n\t\t\t\tint cnter = 1;\n\t\t\t\twhile (true) {\n\t\t\t\t\tif (i + cnter >= H || wall[i + cnter][j]) break;\n\t\t\t\t\t++cnter;\n\t\t\t\t}\n\t\t\t\tvert[i][j] = cnter;\n\t\t\t} else {\n\t\t\t\tvert[i][j] = vert[i - 1][j];\n\t\t\t}\n\t\t}\n\t}\n\t\n\t// hori\n\trep(i, 0, H) {\n\t\trep(j, 0, W) {\n\t\t\tif (wall[i][j]) continue;\n\t\t\t\n\t\t\tif (j == 0 || wall[i][j - 1]) {\n\t\t\t\tint cnter = 1;\n\t\t\t\twhile (true) {\n\t\t\t\t\tif (j + cnter >= W || wall[i][j + cnter]) break;\n\t\t\t\t\t++cnter;\n\t\t\t\t}\n\t\t\t\thori[i][j] = cnter;\n\t\t\t} else {\n\t\t\t\thori[i][j] = hori[i][j - 1];\n\t\t\t}\n\t\t}\n\t}\n\t\n\trep(i, 0, H) rep(j, 1, W) vert[i][j] += vert[i][j - 1];\n\trep(i, 1, H) rep(j, 0, W) hori[i][j] += hori[i - 1][j];\n\t\n\tll ans = 0;\n\trep(i, 0, H - R + 1) rep(j, 0, W - C + 1) {\n\t\tint wallcnt = cnt[i + R - 1][j + C - 1];\n\t\tif (i != 0) wallcnt -= cnt[i - 1][j + C - 1];\n\t\tif (j != 0) wallcnt -= cnt[i + R - 1][j - 1];\n\t\tif (i != 0 && j != 0) wallcnt += cnt[i - 1][j - 1];\n\t\t\n\t\tif (wallcnt > 0) continue;\n\t\t\n\t\tll res = vert[i][j + C - 1] + hori[i + R - 1][j] - 2*R*C;\n\t\tif (j != 0) res -= vert[i][j - 1];\n\t\tif (i != 0) res -= hori[i - 1][j];\n\t\t\n\t\tans = max(ans, res);\n\t}\n\tcout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 22876, "score_of_the_acc": -0.2125, "final_rank": 4 }, { "submission_id": "aoj_0472_9808010", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint h,w,r,c;\n\tcin >> h >> w >> r >> c;\n\tint n;\n\tcin >> n;\n\tvector<vector<int>> x(h,vector<int>()),y(w,vector<int>());\n\tfor(int i = 0;i < n;i++){\n\t\tint a,b;\n\t\tcin >> a >> b;\n\t\ta--;b--;\n\t\tx[a].push_back(b);\n\t\ty[b].push_back(a);\n\t}\n\tfor(int i = 0;i < h;i++){\n\t\tsort(x[i].begin(),x[i].end());\n\t}\n\tfor(int i = 0;i < w;i++){\n\t\tsort(y[i].begin(),y[i].end());\n\t}\n\tvector<vector<vector<int>>> t(4,vector<vector<int>>(h,vector<int>(w,0)));\n\tvector<vector<vector<int>>> a(4,vector<vector<int>>(h,vector<int>(w,0)));\n\tfor(int i = 0;i < h;i++){\n\t\tint now = 0,cou = 0;\n\t\tfor(int j = 0;j < w;j++){\n\t\t\tcou++;\n\t\t\tif(now < (int)x[i].size() && x[i][now] == j){\n\t\t\t\tcou = 0;\n\t\t\t\tnow++;\n\t\t\t}\n\t\t\ta[0][i][j] = cou;\n\t\t\tt[0][i][j] += cou;\n\t\t\tif(i - r >= 0){\n\t\t\t\tt[0][i - r][j] -= cou;\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i = 0;i < h;i++){\n\t\tint now = (int)x[i].size() - 1,cou = 0;\n\t\tfor(int j = w - 1;j >= 0;j--){\n\t\t\tcou++;\n\t\t\tif(now >= 0 && x[i][now] == j){\n\t\t\t\tcou = 0;\n\t\t\t\tnow--;\n\t\t\t}\n\t\t\ta[1][i][j] = cou;\n\t\t\tt[1][i][j] += cou;\n\t\t\tif(i - r >= 0){\n\t\t\t\tt[1][i - r][j] -= cou;\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i = h - 2;i >= 0;i--){\n\t\tfor(int j = 0;j < w;j++){\n\t\t\tt[0][i][j] += t[0][i + 1][j];\n\t\t\tt[1][i][j] += t[1][i + 1][j];\n\t\t}\n\t}\n\tfor(int j = 0;j < w;j++){\n\t\tint now = 0,cou = 0;\n\t\tfor(int i = 0;i < h;i++){\n\t\t\tcou++;\n\t\t\tif(now < (int)y[j].size() && y[j][now] == i){\n\t\t\t\tcou = 0;\n\t\t\t\tnow++;\n\t\t\t}\n\t\t\ta[2][i][j] = cou;\n\t\t\tt[2][i][j] += cou;\n\t\t\tif(j - c >= 0){\n\t\t\t\tt[2][i][j - c] -= cou;\n\t\t\t}\n\t\t}\n\t}\n\tfor(int j = 0;j < w;j++){\n\t\tint now = (int)y[j].size() - 1,cou = 0;\n\t\tfor(int i = h - 1;i >= 0;i--){\n\t\t\tcou++;\n\t\t\tif(now >= 0 && y[j][now] == i){\n\t\t\t\tcou = 0;\n\t\t\t\tnow--;\n\t\t\t}\n\t\t\ta[3][i][j] = cou;\n\t\t\tt[3][i][j] += cou;\n\t\t\tif(j - c >= 0){\n\t\t\t\tt[3][i][j - c] -= cou;\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i = 0;i < h;i++){\n\t\tfor(int j = w - 2;j >= 0;j--){\n\t\t\tt[2][i][j] += t[2][i][j + 1];\n\t\t\tt[3][i][j] += t[3][i][j + 1];\n\t\t}\n\t}\n\tint ans = 0;\n\tfor(int i = 0;i < h;i++){\n\t\tint cou = 0;\n\t\tfor(int j = 0;j < w;j++){\n\t\t\tif(a[3][i][j] >= r){\n\t\t\t\tcou++;\n\t\t\t}\n\t\t\tif(j - c >= 0 && a[3][i][j - c] >= r){\n\t\t\t\tcou--;\n\t\t\t}\n\t\t\tif(cou < c) continue;\n\t\t\tint it = (j - c >= 0 ? t[0][i][j - c] : 0) + (j + 1 < w ? t[1][i][j + 1] : 0) + (i - 1 >= 0 && j - c + 1 >= 0 ? t[2][i - 1][j - c + 1] : 0) + (i + r < h && j - c + 1 >= 0 ? t[3][i + r][j - c + 1] : 0);\n\t\t\tans = max(ans,it);\n\t\t}\n\t}\n\tcout << ans << endl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 38724, "score_of_the_acc": -1.1027, "final_rank": 15 }, { "submission_id": "aoj_0472_9807969", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint h,w,r,c;\n\tcin >> h >> w >> r >> c;\n\tint n;\n\tcin >> n;\n\tvector<vector<int>> x(h,vector<int>()),y(w,vector<int>());\n\tfor(int i = 0;i < n;i++){\n\t\tint a,b;\n\t\tcin >> a >> b;\n\t\ta--;b--;\n\t\tx[a].push_back(b);\n\t\ty[b].push_back(a);\n\t}\n\tfor(int i = 0;i < h;i++){\n\t\tsort(x[i].begin(),x[i].end());\n\t}\n\tfor(int i = 0;i < w;i++){\n\t\tsort(y[i].begin(),y[i].end());\n\t}\n\tvector<vector<vector<int>>> t(4,vector<vector<int>>(h,vector<int>(w,0)));\n\tvector<vector<vector<int>>> a(4,vector<vector<int>>(h,vector<int>(w,0)));\n\tfor(int i = 0;i < h;i++){\n\t\tint now = 0,cou = 0;\n\t\tfor(int j = 0;j < w;j++){\n\t\t\tcou++;\n\t\t\tif(now < (int)x[i].size() && x[i][now] == j){\n\t\t\t\tcou = 0;\n\t\t\t\tnow++;\n\t\t\t}\n\t\t\ta[0][i][j] = cou;\n\t\t\tt[0][i][j] += cou;\n\t\t\tif(i - r >= 0){\n\t\t\t\tt[0][i - r][j] -= cou;\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i = 0;i < h;i++){\n\t\tint now = (int)x[i].size() - 1,cou = 0;\n\t\tfor(int j = w - 1;j >= 0;j--){\n\t\t\tcou++;\n\t\t\tif(now >= 0 && x[i][now] == j){\n\t\t\t\tcou = 0;\n\t\t\t\tnow--;\n\t\t\t}\n\t\t\ta[1][i][j] = cou;\n\t\t\tt[1][i][j] += cou;\n\t\t\tif(i - r >= 0){\n\t\t\t\tt[1][i - r][j] -= cou;\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i = h - 2;i >= 0;i--){\n\t\tfor(int j = 0;j < w;j++){\n\t\t\tt[0][i][j] += t[0][i + 1][j];\n\t\t\tt[1][i][j] += t[1][i + 1][j];\n\t\t}\n\t}\n\tfor(int j = 0;j < w;j++){\n\t\tint now = 0,cou = 0;\n\t\tfor(int i = 0;i < h;i++){\n\t\t\tcou++;\n\t\t\tif(now < (int)y[j].size() && y[j][now] == i){\n\t\t\t\tcou = 0;\n\t\t\t\tnow++;\n\t\t\t}\n\t\t\ta[2][i][j] = cou;\n\t\t\tt[2][i][j] += cou;\n\t\t\tif(j - c >= 0){\n\t\t\t\tt[2][i][j - c] -= cou;\n\t\t\t}\n\t\t}\n\t}\n\tfor(int j = 0;j < w;j++){\n\t\tint now = (int)y[j].size() - 1,cou = 0;\n\t\tfor(int i = h - 1;i >= 0;i--){\n\t\t\tcou++;\n\t\t\tif(now >= 0 && y[j][now] == i){\n\t\t\t\tcou = 0;\n\t\t\t\tnow--;\n\t\t\t}\n\t\t\ta[3][i][j] = cou;\n\t\t\tt[3][i][j] += cou;\n\t\t\tif(j - c >= 0){\n\t\t\t\tt[3][i][j - c] -= cou;\n\t\t\t}\n\t\t}\n\t}\n\tfor(int i = 0;i < h;i++){\n\t\tfor(int j = w - 2;j >= 0;j--){\n\t\t\tt[2][i][j] += t[2][i][j + 1];\n\t\t\tt[3][i][j] += t[3][i][j + 1];\n\t\t}\n\t}\n\tint ans = 0;\n\tfor(int i = 0;i < h;i++){\n\t\tint cou = 0;\n\t\tfor(int j = 0;j < w;j++){\n\t\t\tif(a[3][i][j] >= r){\n\t\t\t\tcou++;\n\t\t\t}\n\t\t\tif(j - c >= 0 && a[3][i][j - c] >= r){\n\t\t\t\tcou--;\n\t\t\t}\n\t\t\tif(cou < c) continue;\n\t\t\tint it = (j - c >= 0 ? t[0][i][j - c] : 0) + (j + 1 < w ? t[1][i][j + 1] : 0) + (i - 1 >= 0 && j - c >= 0 ? t[2][i - 1][j - c] : 0) + (i + r < h && j - c >= 0 ? t[3][i + r][j - c] : 0);\n\t\t\tans = max(ans,it);\n\t\t}\n\t}\n\tcout << ans << endl;\n}", "accuracy": 0.9666666666666667, "time_ms": 40, "memory_kb": 38748, "score_of_the_acc": -1.1031, "final_rank": 19 }, { "submission_id": "aoj_0472_9803849", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define fi first\n#define se second\nusing ll = long long;\nbool chmin(ll &a,ll b){\n if(a>b){\n a=b;\n return true;\n }\n return false;\n}\nint main(){\n ll n,m,x,y;\n cin>>n>>m>>x>>y;\n vector<vector<ll>> f(n,vector<ll>(m));\n ll k;\n cin>>k;\n for(int i=0;i<k;i++){\n ll p,q;\n cin>>p>>q;\n p--;\n q--;\n f[p][q]=1;\n }\n vector<vector<ll>> a(n,vector<ll>(m+1)),b(n,vector<ll>(m+1)),c(n+1,vector<ll>(m)),d(n+1,vector<ll>(m));\n //上、下、左、右\n for(int i=0;i<m;i++){\n ll now=0;\n for(int j=0;j<n;j++){\n a[j][i+1]=now;\n if(f[j][i]) now=0;\n else now++;\n }\n }\n for(int i=0;i<m;i++){\n ll now=0;\n for(int j=n-1;j>=0;j--){\n b[j][i+1]=now;\n if(f[j][i]) now=0;\n else now++;\n }\n }\n for(int i=0;i<n;i++){\n ll now=0;\n for(int j=0;j<m;j++){\n c[i+1][j]=now;\n if(f[i][j]) now=0;\n else now++;\n }\n }\n for(int i=0;i<n;i++){\n ll now=0;\n for(int j=m-1;j>=0;j--){\n d[i+1][j]=now;\n if(f[i][j]) now=0;\n else now++;\n }\n }\n for(int i=0;i<n;i++){\n for(int j=0;j<m;j++){\n a[i][j+1]+=a[i][j];\n b[i][j+1]+=b[i][j];\n c[i+1][j]+=c[i][j];\n d[i+1][j]+=d[i][j];\n }\n }\n vector<vector<ll>> g(n+1,vector<ll>(m+1));\n for(int i=0;i<n;i++){\n for(int j=0;j<m;j++) g[i+1][j+1]=f[i][j];\n }\n for(int i=0;i<=n;i++){\n for(int j=0;j<m;j++) g[i][j+1]+=g[i][j];\n }\n for(int i=0;i<n;i++){\n for(int j=0;j<=m;j++) g[i+1][j]+=g[i][j];\n }\n ll ans=0;\n for(int i=0;i+x-1<n;i++){\n for(int j=0;j+y-1<m;j++){\n if(g[i+x][j+y]-g[i+x][j]-g[i][j+y]+g[i][j]) continue;\n ll sum=0;\n sum+=a[i][j+y]-a[i][j];\n sum+=b[i+x-1][j+y]-b[i+x-1][j];\n sum+=c[i+x][j]-c[i][j];\n sum+=d[i+x][j+y-1]-d[i][j+y-1];\n ans=max(ans,sum);\n }\n }\n cout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 50332, "score_of_the_acc": -1.1153, "final_rank": 16 }, { "submission_id": "aoj_0472_9738828", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(n);++i)\nusing namespace std;\nusing ll = long long;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n int H,W,R,C,N;\n cin >> H >> W >> R >> C >> N;\n vector<vector<ll>> A(H,vector<ll>(W,0));\n rep(i,N){\n int r,c;\n cin >> r >> c;\n r--;c--;\n A[r][c] = 1;\n } \n vector<vector<vector<ll>>> ren(4,vector<vector<ll>>(H,vector<ll>(W,0)));\n rep(i,H){\n rep(j,W-1){\n if(A[i][j]==1) ren[0][i][j+1] = 0;\n else ren[0][i][j+1] = ren[0][i][j]+1;\n }\n }\n rep(i,H){\n rep(j,W-1){\n if(A[i][W-j-1]==1) ren[1][i][W-j-2] = 0;\n else ren[1][i][W-j-2] = ren[1][i][W-j-1]+1;\n }\n }\n rep(j,W){\n rep(i,H-1){\n if(A[i][j]==1) ren[2][i+1][j] = 0;\n else ren[2][i+1][j] = ren[2][i][j]+1;\n }\n }\n rep(j,W){\n rep(i,H-1){\n if(A[H-i-1][j]==1) ren[3][H-i-2][j] = 0;\n else ren[3][H-i-2][j] = ren[3][H-i-1][j]+1;\n }\n }\n\n vector<vector<vector<ll>>> cw(2,vector<vector<ll>>(H-R+1,vector<ll>(W,0)));\n rep(j,W){\n rep(i,R) {\n cw[0][H-R][j] += ren[0][H-i-1][j];\n cw[1][H-R][j] += ren[1][H-i-1][j];\n }\n rep(i,H-R){\n cw[0][H-R-i-1][j] = cw[0][H-R-i][j]+ren[0][H-R-i-1][j]-ren[0][H-i-1][j];\n cw[1][H-R-i-1][j] = cw[1][H-R-i][j]+ren[1][H-R-i-1][j]-ren[1][H-i-1][j];\n }\n }\n\n vector<vector<ll>> sum(H+1,vector<ll>(W+1,0));\n rep(i,H){\n rep(j,W){\n sum[i+1][j+1] += A[i][j]+sum[i][j+1];\n }\n }\n rep(i,H){\n rep(j,W){\n sum[i+1][j+1] += sum[i+1][j];\n }\n }\n\n \n ll ans = -1;\n rep(i,H-R+1){\n ll now = 0;\n rep(j,R) now += ren[0][i+j][0]; \n rep(j,R) now += ren[1][i+j][C-1];\n rep(j,C) now += ren[2][i][j]; \n rep(j,C) now += ren[3][i+R-1][j]; \n if(sum[i+R][C]-sum[i+R][0]-sum[i][C]+sum[i][0]==0) ans = max(ans,now);\n\n rep(j,W-C){\n now -= cw[0][i][j];\n now += cw[0][i][j+1];\n now -= cw[1][i][j+C-1];\n now += cw[1][i][j+C];\n\n now -= ren[2][i][j];\n now += ren[2][i][j+C];\n now -= ren[3][i+R-1][j];\n now += ren[3][i+R-1][j+C];\n \n\n if(sum[i+R][j+C+1]-sum[i+R][j+1]-sum[i][j+C+1]+sum[i][j+1]==0) ans = max(ans,now);\n }\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 65880, "score_of_the_acc": -2, "final_rank": 18 }, { "submission_id": "aoj_0472_9483811", "code_snippet": "#include <bits/stdc++.h>\n\nstd::vector<std::vector<int>> f(const std::vector<std::vector<bool>>& A) {\n std::vector s(A.size(), std::vector<int>(A[0].size()));\n for (int i{} ; i < (int)A.size() ; i++) {\n int val{};\n for (int j{} ; j < (int)A[i].size() ; j++) {\n s[i][j] = val;\n val = (A[i][j] ? 0 : val + 1);\n }\n }\n std::vector res(A.size() + 1, std::vector<int>(A[0].size()));\n for (int i{} ; i < (int)A[0].size() ; i++) {\n for (int j{} ; j < (int)A.size() ; j++) {\n res[j + 1][i] = res[j][i] + s[j][i];\n }\n }\n return res;\n}\n\nint main() {\n int H, W, R, C, N;\n std::cin >> H >> W >> R >> C >> N;\n std::vector A(H, std::vector<bool>(W)), B(W, std::vector<bool>(H));\n for (int i{} ; i < N ; i++) {\n int r, c;\n std::cin >> r >> c;\n r--; c--;\n A[r][c] = B[c][H - r - 1] = true;\n }\n std::vector sum(H + 1, std::vector<int>(W + 1));\n for (int i{} ; i < H ; i++) {\n for (int j{} ; j < W ; j++) {\n sum[i + 1][j + 1] = -sum[i][j] + sum[i + 1][j] + sum[i][j + 1] + A[i][j];\n }\n }\n auto left{f(A)};\n auto down{f(B)};\n for (auto& x : A) std::reverse(x.begin(), x.end());\n for (auto& x : B) std::reverse(x.begin(), x.end());\n auto right{f(A)};\n auto up{f(B)};\n int ans{};\n for (int i{} ; i + R - 1 < H ; i++) {\n for (int j{} ; j + C - 1 < W ; j++) {\n if (sum[i + R][j + C] - sum[i + R][j] - sum[i][j + C] + sum[i][j] == 0) {\n int val{};\n val += left[i + R][j] - left[i][j];\n val += right[i + R][W - (j + C)] - right[i][W - (j + C)];\n val += down[j + C][H - (i + R)] - down[j][H - (i + R)];\n val += up[j + C][i] - up[j][i];\n ans = std::max(ans, val);\n }\n }\n }\n std::cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 27108, "score_of_the_acc": -1.09, "final_rank": 14 }, { "submission_id": "aoj_0472_9483802", "code_snippet": "#include <bits/stdc++.h>\n\nstd::vector<std::vector<int>> f(const std::vector<std::vector<bool>>& A) {\n std::vector s(A.size(), std::vector<int>(A[0].size()));\n for (int i{} ; i < (int)A.size() ; i++) {\n int val{};\n for (int j{} ; j < (int)A[i].size() ; j++) {\n s[i][j] = val;\n val = (A[i][j] ? 0 : val + 1);\n }\n }\n std::vector res(A.size() + 1, std::vector<int>(A[0].size()));\n for (int i{} ; i < (int)A[0].size() ; i++) {\n for (int j{} ; j < (int)A.size() ; j++) {\n res[j + 1][i] = res[j][i] + s[j][i];\n }\n }\n return res;\n}\n\nint main() {\n int H, W, R, C, N;\n std::cin >> H >> W >> R >> C >> N;\n std::vector A(H, std::vector<bool>(W)), B(W, std::vector<bool>(H));\n for (int i{} ; i < N ; i++) {\n int r, c;\n std::cin >> r >> c;\n r--; c--;\n A[r][c] = B[c][H - r - 1] = true;\n }\n std::vector sum(H + 1, std::vector<int>(W + 1));\n for (int i{} ; i < H ; i++) {\n for (int j{} ; j < W ; j++) {\n sum[i + 1][j + 1] = -sum[i][j] + sum[i + 1][j] + sum[i][j + 1] + A[i][j];\n }\n }\n std::vector<std::pair<int, int>> ok;\n for (int i{} ; i + R <= H ; i++) {\n for (int j{} ; j + C <= W ; j++) {\n int val{sum[i + R][j + C] - sum[i + R][j] - sum[i][j + C] + sum[i][j]};\n if (val == 0) ok.push_back(std::make_pair(i, j));\n }\n }\n auto left{f(A)};\n auto down{f(B)};\n for (auto& x : A) std::reverse(x.begin(), x.end());\n for (auto& x : B) std::reverse(x.begin(), x.end());\n auto right{f(A)};\n auto up{f(B)};\n int ans{};\n for (auto [i, j] : ok) {\n int val{};\n val += left[i + R][j] - left[i][j];\n val += right[i + R][W - (j + C)] - right[i][W - (j + C)];\n val += down[j + C][H - (i + R)] - down[j][H - (i + R)];\n val += up[j + C][i] - up[j][i];\n ans = std::max(ans, val);\n }\n std::cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 35380, "score_of_the_acc": -1.2415, "final_rank": 17 }, { "submission_id": "aoj_0472_8803137", "code_snippet": "#include <bits/stdc++.h>\n\nint main() {\n int h, w, r, c;\n std::cin >> h >> w >> r >> c;\n int n;\n std::cin >> n;\n std::vector obs(h, std::vector<int>(w));\n for (int i = 0; i < n; i++) {\n int a, b;\n std::cin >> a >> b;\n a--; b--;\n obs[a][b] = 1;\n }\n std::vector<std::vector<std::vector<int>>> ans(4);\n auto rotate = [](const std::vector<std::vector<int>>& data) {\n int h = data.size();\n int w = data.front().size();\n std::vector new_data(w, std::vector<int>(h));\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n new_data[j][h - i - 1] = data[i][j];\n }\n }\n return new_data;\n };\n for (int q = 0; q < 4; q++) {\n ans[q].assign(h, std::vector<int>(w, -1));\n std::vector obs_count(h + 1, std::vector<int>(w + 1));\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n obs_count[i + 1][j + 1] = obs_count[i + 1][j] + obs_count[i][j + 1] - obs_count[i][j] + obs[i][j];\n }\n }\n auto can_put = [&](int i, int j) {\n if (i + r > h || j + c > w) return false;\n int count = 0;\n count += obs_count[i + r][j + c];\n count += obs_count[i][j];\n count -= obs_count[i][j + c];\n count -= obs_count[i + r][j];\n return count == 0;\n };\n std::vector left(h + 1, std::vector<int>(w));\n for (int i = 0; i < h; i++) {\n for (int j = 0; j + 1 < w; j++) {\n if (obs[i][j] == 0) {\n left[i + 1][j + 1] = left[i + 1][j] + 1;\n } else {\n left[i + 1][j] = 0;\n }\n }\n }\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n left[i + 1][j] += left[i][j];\n }\n }\n\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n if (can_put(i, j)) {\n ans[q][i][j] = left[i + r][j] - left[i][j];\n }\n }\n }\n\n obs = rotate(obs);\n std::swap(h, w);\n std::swap(r, c);\n for (int i = 0; i < 4 - q; i++) {\n ans[q] = rotate(ans[q]);\n }\n }\n\n int result = 0;\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n if (ans[0][i][j] != -1) {\n int now = 0;\n assert(ans[0][i][j] != -1);\n now += ans[0][i][j];\n assert(ans[1][i + r - 1][j] != -1);\n now += ans[1][i + r - 1][j];\n assert(ans[2][i + r - 1][j + c - 1] != -1);\n now += ans[2][i + r - 1][j + c - 1];\n assert(ans[3][i][j + c - 1] != -1);\n now += ans[3][i][j + c - 1];\n result = std::max(result, now);\n }\n }\n }\n auto print = [](const std::vector<std::vector<int>>& a) {\n int h = a.size();\n int w = a.front().size();\n for (int i = 0; i < h; i++) {\n for (int j = 0; j < w; j++) {\n std::cerr << a[i][j] << ' ';\n }\n std::cerr << std::endl;\n }\n };\n // print(ans[0]);\n\n std::cout << result << std::endl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 34832, "score_of_the_acc": -1.0314, "final_rank": 11 }, { "submission_id": "aoj_0472_8439402", "code_snippet": "#include<bits/stdc++.h>\n#define overload(a,b,c,d,...) d\n#define rep1(n) for(ll _=0;_<n;++_)\n#define rep2(i,n) for(ll i=0;i<n;++i)\n#define rep3(i,a,b) for(ll i=(ll)a;i<(ll)b;++i)\n#define rep(...) overload(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(i,n) for(ll i=(ll)n-1;i>=0;--i)\n#define rrep2(i,a,b) for(ll i=(ll)b-1;i>=(ll)a;--i)\n#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)\n#define all(x) (x).begin(),(x).end()\n#define rall(x) (x).rbegin(),(x).rend()\nusing namespace std;\nusing ll=int;\nusing ld=long double;\nusing vl=vector<ll>;\ntemplate<typename T,typename U>inline bool chmin(T&a,const U&b){return (a>b?a=b,true:false);}\ntemplate<typename T,typename U>inline bool chmax(T&a,const U&b){return (a<b?a=b,true:false);}\nstatic constexpr ll inf=numeric_limits<ll>::max()/2;\nint main(){\n\tll h,w,r,c;cin>>h>>w>>r>>c;\n\tll n;cin>>n;\n\tvector<vl>sum(h+1,vl(w+1,0));\n\trep(i,n){\n\t\tll r1,c1;cin>>r1>>c1;\n\t\tsum[r1][c1]++;\n\t\t//cerr<<r1<<\" \"<<c1<<endl;\n\t}\n\trep(i,h)rep(j,w+1)sum[i+1][j]+=sum[i][j];\n\trep(i,h+1)rep(j,w)sum[i][j+1]+=sum[i][j];\n\tvector<vl>sum1(h+1,vl(w+1,0));\n\tauto sum2=sum1,sum3=sum1,sum4=sum1;\n\tauto get=[&](ll x,ll y)->ll {\n\t\treturn sum[x+1][y+1]-sum[x+1][y]-sum[x][y+1]+sum[x][y];\n\t};\n\tauto get2=[&](ll x1,ll y1,ll x2,ll y2)->ll {\n\t\treturn sum[x2+1][y2+1]-sum[x2+1][y1]-sum[x1][y2+1]+sum[x1][y1];\n\t};\n\tauto get3=[&](ll x1,ll y1,ll x2,ll y2)->ll {\n\t\treturn sum1[x2+1][y2+1]-sum1[x2+1][y1]-sum1[x1][y2+1]+sum1[x1][y1];\n\t};\n\tauto get4=[&](ll x1,ll y1,ll x2,ll y2)->ll {\n\t\treturn sum2[x2+1][y2+1]-sum2[x2+1][y1]-sum2[x1][y2+1]+sum2[x1][y1];\n\t};\n\tauto get5=[&](ll x1,ll y1,ll x2,ll y2)->ll {\n\t\treturn sum3[x2+1][y2+1]-sum3[x2+1][y1]-sum3[x1][y2+1]+sum3[x1][y1];\n\t};\n\tauto get6=[&](ll x1,ll y1,ll x2,ll y2)->ll {\n\t\treturn sum4[x2+1][y2+1]-sum4[x2+1][y1]-sum4[x1][y2+1]+sum4[x1][y1];\n\t};\n\n\trep(i,h)rep(j,w){\n\t\tif(i==0||get(i-1,j))sum1[i+1][j+1]=0;\n\t\telse sum1[i+1][j+1]=sum1[i][j+1]+1;\n\t\tif(j==0||get(i,j-1))sum2[i+1][j+1]=0;\n\t\telse sum2[i+1][j+1]=sum2[i+1][j]+1;\n\t}\n\trrep(i,h)rrep(j,w){\n\t\tif(i+1==h||get(i+1,j))sum3[i+1][j+1]=0;\n\t\telse sum3[i+1][j+1]=sum3[i+2][j+1]+1;\n\t\tif(j+1==w||get(i,j+1))sum4[i+1][j+1]=0;\n\t\telse sum4[i+1][j+1]=sum4[i+1][j+2]+1;\n\t}\n\trep(i,h)rep(j,w+1)sum1[i+1][j]+=sum1[i][j];\n\trep(i,h+1)rep(j,w)sum1[i][j+1]+=sum1[i][j];\n\trep(i,h)rep(j,w+1)sum2[i+1][j]+=sum2[i][j];\n\trep(i,h+1)rep(j,w)sum2[i][j+1]+=sum2[i][j];\n\trep(i,h)rep(j,w+1)sum3[i+1][j]+=sum3[i][j];\n\trep(i,h+1)rep(j,w)sum3[i][j+1]+=sum3[i][j];\n\trep(i,h)rep(j,w+1)sum4[i+1][j]+=sum4[i][j];\n\trep(i,h+1)rep(j,w)sum4[i][j+1]+=sum4[i][j];\n\t/*rep(i,h)rep(j,w){\n\t\tcerr<<get5(i,j,i,j)<<endl;\n\t}*/\n\tll ans=0;\n\trep(i,h)rep(j,w){\n\t\tif(i+r>h||j+c>w)continue;\n\t\tif(get2(i,j,i+r-1,j+c-1))continue;\n\t\t//cerr<<i<<\" \"<<j<<endl;\n\t\tll tmp=get3(i,j,i,j+c-1)+get4(i,j,i+r-1,j)+get5(i+r-1,j,i+r-1,j+c-1)+get6(i,j+c-1,i+r-1,j+c-1);\n\t\tchmax(ans,tmp);\n\t}\n\tcout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 23088, "score_of_the_acc": -0.2164, "final_rank": 5 }, { "submission_id": "aoj_0472_8212224", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint rui[1002][1002];\nint le[1002][1002], ri[1002][1002], up[1002][1002], dn[1002][1002];\nint main(){\n int h, w, r, c, n, rr, cc;\n cin >> h >> w >> r >> c >> n;\n for(int i=0;i<=h;i++){\n for(int j=0;j<=w;j++){\n if(i==0 || j==0) rui[i][j] = 0;\n else rui[i][j] = 1;\n le[i][j] = 0;\n ri[i][j] = 0;\n up[i][j] = 0;\n dn[i][j] = 0;\n }\n }\n for(int i=0;i<n;i++){\n cin >> rr >> cc;\n rui[rr][cc] = 0;\n }\n for(int i=1;i<=h;i++){\n for(int j=1;j<=w;j++){\n if(rui[i][j]){\n le[i][j] = le[i][j-1]+1;\n up[i][j] = up[i-1][j]+1;\n }\n }\n }\n for(int i=h;i>0;i--){\n for(int j=w;j>0;j--){\n if(rui[i][j]){\n ri[i][j] = ri[i][j+1]+1;\n dn[i][j] = dn[i+1][j]+1;\n }\n }\n }\n for(int i=1;i<=h;i++){\n for(int j=1;j<=w;j++){\n le[i][j] += le[i-1][j];\n ri[i][j] += ri[i-1][j];\n up[i][j] += up[i][j-1];\n dn[i][j] += dn[i][j-1];\n rui[i][j] += rui[i-1][j]+rui[i][j-1]-rui[i-1][j-1];\n }\n }\n int sum, ans=0;\n for(int i=1;i<=h-r+1;i++){\n for(int j=1;j<=w-c+1;j++){\n if(rui[i+r-1][j+c-1]-rui[i-1][j+c-1]-rui[i+r-1][j-1]+rui[i-1][j-1] < r*c) continue;\n sum = le[i+r-1][j-1]-le[i-1][j-1];\n sum += ri[i+r-1][j+c]-ri[i-1][j+c];\n sum += up[i-1][j+c-1]-up[i-1][j-1];\n sum += dn[i+r][j+c-1]-dn[i+r][j-1];\n ans = max(ans, sum);\n }\n }\n cout << ans << endl;\n return(0);\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 22692, "score_of_the_acc": -0.2091, "final_rank": 3 }, { "submission_id": "aoj_0472_7075057", "code_snippet": "#include<bits/stdc++.h>\n//#include<atcoder/all>\nusing namespace std;\n//using namespace atcoder;\n//using mint = modint1000000007;\n//using mint = modint998244353;\nusing ll = long long;\n#define rep(i, n) for (ll i = 0; i < ll(n); i++)\n#define all(v) v.begin(), v.end()\n\nll ret(ll a, ll b, ll c, ll d, vector<vector<ll>> &v) {\n if (a == 0 && b == 0) {\n return v[c][d];\n } else if (a == 0) {\n return v[c][d] - v[c][b - 1];\n } else if (b == 0) {\n return v[c][d] - v[a - 1][d];\n } else {\n return v[c][d] - v[c][b - 1] - v[a - 1][d] + v[a - 1][b - 1];\n }\n}\n\nll ret2(ll a, ll b, vector<ll> &v) {\n if (a == 0) {\n return v[b];\n } else {\n return v[b] - v[a - 1];\n }\n}\n\nint main() {\n //1. 置ける場所を全列挙\n //2. それぞれのマスに対してスコア算出\n //3. それぞれのおき方に対して点数算出\n\n //1 (1) 配列作成\n ll h, w, r, c, n;\n cin >> h >> w >> r >> c >> n;\n vector<pair<ll, ll>> ob(n);\n rep(i, n) {\n cin >> ob[i].first >> ob[i].second;\n ob[i].first--;ob[i].second--;\n }\n vector<vector<ll>> obs(h, vector<ll> (w));\n rep(i, n) {\n obs[ob[i].first][ob[i].second]++;\n }\n rep(i, h) {\n rep(j, w) {\n if (j) {\n obs[i][j] += obs[i][j - 1];\n }\n }\n }\n rep(i, w) {\n rep(j, h) {\n if (j) {\n obs[j][i] += obs[j - 1][i];\n }\n }\n }\n //1 (2) 各点について判定\n vector<pair<ll, ll>> can;\n rep(i, h - r + 1) {\n rep(j, w - c + 1) {\n if (!ret(i, j, i + r - 1, j + c - 1, obs)) {\n can.push_back({i, j});\n }\n }\n }\n //2 (1) 縦に見る\n vector<vector<ll>> sc1(h, vector<ll> (w));\n vector<vector<ll>> ob1(h, vector<ll> (1, -1));\n rep(i, n) {\n ob1[ob[i].first].push_back(ob[i].second);\n }\n rep(i, h) {\n ob1[i].push_back(w);\n }\n rep(i, h) {\n sort(all(ob1[i]));\n }\n rep(i, h) {\n //i行目\n ll ind = 0;\n rep(j, w) {\n if (j == ob1[i][ind + 1]) {\n ind++;\n } else {\n sc1[i][j] = ob1[i][ind + 1] - ob1[i][ind] - 1;\n }\n }\n }\n rep(i, h) {\n rep(j, w) {\n sc1[i][j]--;\n }\n }\n //2 (2) 横に見る\n vector<vector<ll>> sc2(h, vector<ll> (w));\n vector<vector<ll>> ob2(w, vector<ll> (1, -1));\n rep(i, n) {\n ob2[ob[i].second].push_back(ob[i].first);\n }\n rep(i, w) {\n ob2[i].push_back(h);\n }\n rep(i, w) {\n sort(all(ob2[i]));\n }\n rep(j, w) {\n //j列目\n ll ind = 0;\n rep(i, h) {\n if (i == ob2[j][ind + 1]) {\n ind++;\n } else {\n sc2[i][j] = ob2[j][ind + 1] - ob2[j][ind] - 1;\n }\n }\n }\n rep(i, h) {\n rep(j, w) {\n sc2[i][j]--;\n }\n }\n //3 (1) 縦配列作成\n vector<vector<ll>> sm1(h + 1, vector<ll> (w));\n rep(i, h) {\n rep(j, w) {\n sm1[i + 1][j] = sm1[i][j] + sc1[i][j];\n }\n }\n //3 (2) 横配列作成\n vector<vector<ll>> sm2(h, vector<ll> (w + 1));\n rep(i, h) {\n rep(j, w) {\n sm2[i][j + 1] = sm2[i][j] + sc2[i][j];\n }\n }\n ll mx = -1;\n for (auto p : can) {\n ll ans = 0;\n ans += -(sm1[p.first][p.second] - sm1[p.first + r][p.second]) - r * (c - 1);\n ans += -(sm2[p.first][p.second] - sm2[p.first][p.second + c]) - c * (r - 1);\n mx = max(mx, ans);\n }\n cout << mx << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 58032, "score_of_the_acc": -1.0563, "final_rank": 12 } ]
aoj_0477_cpp
Square Factors In the ancient nation of Iwashiro, there was little rain this year, and the people were in trouble. That's why you, a new priest, have decided to perform a rain-making ceremony at Ryugasawa. In the rain-making ceremony, you chant the prayer incantation written in the prayer book for the Dragon God to make it rain. When you finish the spell, the dragon god will ask you how many times the same word appears twice in a row in the spell. If you guess it, your prayer will be fulfilled and the Dragon God will send rain to you. For example, if you cast the incantation ababababab , the six places in the incantation where the same word appears twice in a row are as follows. One place for abababab , starting with the first letter ( abab appears twice in a row). Three places for abab , starting with the first, third, and fifth letters, respectively ( ab appears twice in a row). Two baba places ( ba appears twice in a row) starting with the second and fourth letters, respectively. In order for your prayers to be fulfilled, you must answer the exact number of such passages when you cast any spell. Given a string, create a program to find the number of places in the string where the same string appears twice in a row. Input The input is given in the following format. $str$ A string $str$ consisting of English and lowercase letters is given on one line. However, the length of $str$ must be between 3 and 100,000. Output Output the number of times the same string appears twice in a given string on a single line. Sample Input and Output Sample Input 1 abababab Sample Output 1 6 Sample Input 2 aaaaaaa Sample Output 2 12
[ { "submission_id": "aoj_0477_11015697", "code_snippet": "#pragma GCC target(\"avx2\")\n#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\nint N;\nint A[100100], I2[100100], I2_[100100];\nint R1[100100], R2[100100];\nint bs = 27;\nint mod2 = 998244853;\nint pw(int a, int p, int mod){\n int ans = 1, now = a;\n while(p){\n if(p&1) ans *= now;\n ans %= mod;\n now *= now;\n now %= mod;\n p >>= 1;\n }\n return ans;\n}\nint v(int a, int mod){\n return pw(a,mod-2,mod);\n}\nint hs(int l, int r){ // [l,r)\n int b = R2[r]-R2[l];\n b *= I2_[l];\n b %= mod2;\n b = (b+mod2)%mod2;\n return b;\n}\nsigned main(){\n string S;\n cin>>S;\n N = S.size();\n for(int i=0;i<N;i++) A[i] = S[i]-'a'+1;\n I2[0] = 1;\n for(int i=0;i<N;i++){\n I2[i+1] = I2[i]*bs%mod2;\n I2_[i] = v(I2[i],mod2);\n R2[i+1] = (R2[i]+A[i]*I2[i])%mod2;\n }\n int ans = 0;\n auto f = [&](auto &&self, int a, int b) -> void {\n int l = a, r = b;\n if(a+1 == b){\n return;\n }\n if(a+2 == b){\n ans += (A[a] == A[a+1]);\n return;\n }\n if(a+3 == b){\n if(A[a] == A[a+1]) ans++;\n if(A[a+1] == A[a+2]) ans++;\n return;\n }\n int md = (a+b)/2;\n self(self,a,md);\n self(self,md,b);\n for(int i=1;i<=N;i++){\n if(md-i < a || b < md+i) break;\n ans += (hs(md-i,md) == hs(md,md+i));\n }\n for(int i=md+2;i<r;i++)if(A[i] == A[md] && A[md-1] == A[i-1]){\n int ac = md+1, wa = i;\n while(wa-ac > 1){\n int m = (ac+wa)/2;\n int d = m-md;\n if(i+d > r || md+d > r){\n wa = m;\n continue;\n }\n if(hs(md,md+d) == hs(i,i+d)) ac = m;\n else wa = m;\n }\n int l1 = md, r1 = ac;\n ac = i-1, wa = md;\n while(ac-wa > 1){\n int m = (ac+wa)/2;\n int d = i-m;\n if(md-d < l || i-d < l){\n wa = m;\n continue;\n }\n if(hs(md-d,md) == hs(i-d,i)) ac = m;\n else wa = m;\n }\n int l2 = ac, r2 = i;\n ans += max(0ll,r1-l2+1);\n }\n for(int i=l+1;i<md-1;i++)if(A[i] == A[md] && A[md-1] == A[i-1]){\n int wa = md, ac = i+1;\n while(wa-ac > 1){\n int m = (ac+wa)/2;\n int d = m-i;\n if(md+d > r || i+d > r){\n wa = m;\n continue;\n }\n if(hs(md,md+d) == hs(i,i+d)) ac = m;\n else wa = m;\n }\n int l1 = i, r1 = ac;\n ac = md-1, wa = i;\n while(ac-wa > 1){\n int m = (ac+wa)/2;\n int d = md-m;\n if(i-d < l || md-d < l){\n wa = m;\n continue;\n }\n if(hs(md-d,md) == hs(i-d,i)) ac = m;\n else wa = m;\n }\n int l2 = ac, r2 = md;\n //cout<<a<<' '<<b<<' '<<i<<' '<<l1<<' '<<r1<<' '<<l2<<' '<<r2<<endl;\n ans += max(0ll,r1-l2+1);\n }\n return;\n };\n f(f,0,N);\n cout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 530, "memory_kb": 6612, "score_of_the_acc": -1.0523, "final_rank": 8 }, { "submission_id": "aoj_0477_10335250", "code_snippet": "// AOJ #477 Square Factors\n// 2025.3.29\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nstruct State {\n int len, link;\n int next[26];\n vector<int> occ;\n State() : len(0), link(-1) {\n memset(next, -1, sizeof(next));\n }\n};\n\nstruct SuffixAutomaton {\n vector<State> st;\n int last;\n SuffixAutomaton(int n) {\n st.resize(2*n);\n st[0].len = 0;\n st[0].link = -1;\n last = 0;\n size = 1;\n }\n int size;\n\n void extend(char c, int pos) {\n int cur = size++;\n st[cur].len = st[last].len + 1;\n st[cur].occ.push_back(pos);\n int p = last;\n int ci = c - 'a';\n for(; p != -1 && st[p].next[ci] == -1; p = st[p].link) st[p].next[ci] = cur;\n if(p == -1) st[cur].link = 0;\n else {\n int q = st[p].next[ci];\n if(st[p].len + 1 == st[q].len) st[cur].link = q;\n else {\n int clone = size++;\n st[clone].len = st[p].len + 1;\n memcpy(st[clone].next, st[q].next, sizeof(st[q].next));\n st[clone].link = st[q].link;\n for(; p != -1 && st[p].next[ci] == q; p = st[p].link) st[p].next[ci] = clone;\n st[q].link = st[cur].link = clone;\n }\n }\n last = cur;\n }\n\n void merge_occurrences() {\n int sz = size;\n vector<int> deg(sz,0);\n for (int i = 1; i < sz; i++) deg[ st[i].link ]++;\n\n queue<int> que;\n for (int i = 0; i < sz; i++) if(deg[i]==0) que.push(i);\n\n while(!que.empty()){\n int v = que.front();\n que.pop();\n if(st[v].link != -1){\n int p = st[v].link;\n vector<int>& a = st[p].occ;\n vector<int>& b = st[v].occ;\n vector<int> merged;\n merged.resize(a.size() + b.size());\n merge(a.begin(), a.end(), b.begin(), b.end(), merged.begin());\n a.swap(merged);\n if(--deg[p]==0) que.push(p);\n }\n }\n }\n};\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n string s;\n cin >> s;\n int n = s.size();\n bool allSame = true;\n for (int i = 1; i < n; i++) if(s[i] != s[0]) { allSame = false; break; }\n\n if(allSame){\n int m = n / 2;\n ll ans = (ll) m * (n - m);\n cout << ans << endl;\n return 0;\n }\n\n SuffixAutomaton sa(n);\n for (int i = 0; i < n; i++) sa.extend(s[i], i);\n sa.merge_occurrences();\n\n ll ans = 0;\n int sz = sa.size;\n for (int i = 1; i < sz; i++){\n int Lmin = sa.st[ sa.st[i].link ].len + 1;\n int Lmax = sa.st[i].len;\n vector<int>& occ = sa.st[i].occ;\n int f = occ.size();\n int jlow = 0, jhigh = 0;\n for (int iocc = 0; iocc < f; iocc++){\n int base = occ[iocc];\n while(jlow < f && occ[jlow] < base + Lmin) jlow++;\n if(jhigh < jlow) jhigh = jlow;\n while(jhigh < f && occ[jhigh] <= base + Lmax) jhigh++;\n ans += (jhigh - jlow);\n }\n }\n cout << ans << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 41720, "score_of_the_acc": -0.9181, "final_rank": 7 }, { "submission_id": "aoj_0477_9504925", "code_snippet": "#include <bits/stdc++.h>\n\n\n\n\n\nnamespace atcoder {\n\nnamespace internal {\n\nstd::vector<int> sa_naive(const std::vector<int>& s) {\n int n = int(s.size());\n std::vector<int> sa(n);\n std::iota(sa.begin(), sa.end(), 0);\n std::sort(sa.begin(), sa.end(), [&](int l, int r) {\n if (l == r) return false;\n while (l < n && r < n) {\n if (s[l] != s[r]) return s[l] < s[r];\n l++;\n r++;\n }\n return l == n;\n });\n return sa;\n}\n\nstd::vector<int> sa_doubling(const std::vector<int>& s) {\n int n = int(s.size());\n std::vector<int> sa(n), rnk = s, tmp(n);\n std::iota(sa.begin(), sa.end(), 0);\n for (int k = 1; k < n; k *= 2) {\n auto cmp = [&](int x, int y) {\n if (rnk[x] != rnk[y]) return rnk[x] < rnk[y];\n int rx = x + k < n ? rnk[x + k] : -1;\n int ry = y + k < n ? rnk[y + k] : -1;\n return rx < ry;\n };\n std::sort(sa.begin(), sa.end(), cmp);\n tmp[sa[0]] = 0;\n for (int i = 1; i < n; i++) {\n tmp[sa[i]] = tmp[sa[i - 1]] + (cmp(sa[i - 1], sa[i]) ? 1 : 0);\n }\n std::swap(tmp, rnk);\n }\n return sa;\n}\n\n// SA-IS, linear-time suffix array construction\n// Reference:\n// G. Nong, S. Zhang, and W. H. Chan,\n// Two Efficient Algorithms for Linear Time Suffix Array Construction\ntemplate <int THRESHOLD_NAIVE = 10, int THRESHOLD_DOUBLING = 40>\nstd::vector<int> sa_is(const std::vector<int>& s, int upper) {\n int n = int(s.size());\n if (n == 0) return {};\n if (n == 1) return {0};\n if (n == 2) {\n if (s[0] < s[1]) {\n return {0, 1};\n } else {\n return {1, 0};\n }\n }\n if (n < THRESHOLD_NAIVE) {\n return sa_naive(s);\n }\n if (n < THRESHOLD_DOUBLING) {\n return sa_doubling(s);\n }\n\n std::vector<int> sa(n);\n std::vector<bool> ls(n);\n for (int i = n - 2; i >= 0; i--) {\n ls[i] = (s[i] == s[i + 1]) ? ls[i + 1] : (s[i] < s[i + 1]);\n }\n std::vector<int> sum_l(upper + 1), sum_s(upper + 1);\n for (int i = 0; i < n; i++) {\n if (!ls[i]) {\n sum_s[s[i]]++;\n } else {\n sum_l[s[i] + 1]++;\n }\n }\n for (int i = 0; i <= upper; i++) {\n sum_s[i] += sum_l[i];\n if (i < upper) sum_l[i + 1] += sum_s[i];\n }\n\n auto induce = [&](const std::vector<int>& lms) {\n std::fill(sa.begin(), sa.end(), -1);\n std::vector<int> buf(upper + 1);\n std::copy(sum_s.begin(), sum_s.end(), buf.begin());\n for (auto d : lms) {\n if (d == n) continue;\n sa[buf[s[d]]++] = d;\n }\n std::copy(sum_l.begin(), sum_l.end(), buf.begin());\n sa[buf[s[n - 1]]++] = n - 1;\n for (int i = 0; i < n; i++) {\n int v = sa[i];\n if (v >= 1 && !ls[v - 1]) {\n sa[buf[s[v - 1]]++] = v - 1;\n }\n }\n std::copy(sum_l.begin(), sum_l.end(), buf.begin());\n for (int i = n - 1; i >= 0; i--) {\n int v = sa[i];\n if (v >= 1 && ls[v - 1]) {\n sa[--buf[s[v - 1] + 1]] = v - 1;\n }\n }\n };\n\n std::vector<int> lms_map(n + 1, -1);\n int m = 0;\n for (int i = 1; i < n; i++) {\n if (!ls[i - 1] && ls[i]) {\n lms_map[i] = m++;\n }\n }\n std::vector<int> lms;\n lms.reserve(m);\n for (int i = 1; i < n; i++) {\n if (!ls[i - 1] && ls[i]) {\n lms.push_back(i);\n }\n }\n\n induce(lms);\n\n if (m) {\n std::vector<int> sorted_lms;\n sorted_lms.reserve(m);\n for (int v : sa) {\n if (lms_map[v] != -1) sorted_lms.push_back(v);\n }\n std::vector<int> rec_s(m);\n int rec_upper = 0;\n rec_s[lms_map[sorted_lms[0]]] = 0;\n for (int i = 1; i < m; i++) {\n int l = sorted_lms[i - 1], r = sorted_lms[i];\n int end_l = (lms_map[l] + 1 < m) ? lms[lms_map[l] + 1] : n;\n int end_r = (lms_map[r] + 1 < m) ? lms[lms_map[r] + 1] : n;\n bool same = true;\n if (end_l - l != end_r - r) {\n same = false;\n } else {\n while (l < end_l) {\n if (s[l] != s[r]) {\n break;\n }\n l++;\n r++;\n }\n if (l == n || s[l] != s[r]) same = false;\n }\n if (!same) rec_upper++;\n rec_s[lms_map[sorted_lms[i]]] = rec_upper;\n }\n\n auto rec_sa =\n sa_is<THRESHOLD_NAIVE, THRESHOLD_DOUBLING>(rec_s, rec_upper);\n\n for (int i = 0; i < m; i++) {\n sorted_lms[i] = lms[rec_sa[i]];\n }\n induce(sorted_lms);\n }\n return sa;\n}\n\n} // namespace internal\n\nstd::vector<int> suffix_array(const std::vector<int>& s, int upper) {\n assert(0 <= upper);\n for (int d : s) {\n assert(0 <= d && d <= upper);\n }\n auto sa = internal::sa_is(s, upper);\n return sa;\n}\n\ntemplate <class T> std::vector<int> suffix_array(const std::vector<T>& s) {\n int n = int(s.size());\n std::vector<int> idx(n);\n iota(idx.begin(), idx.end(), 0);\n sort(idx.begin(), idx.end(), [&](int l, int r) { return s[l] < s[r]; });\n std::vector<int> s2(n);\n int now = 0;\n for (int i = 0; i < n; i++) {\n if (i && s[idx[i - 1]] != s[idx[i]]) now++;\n s2[idx[i]] = now;\n }\n return internal::sa_is(s2, now);\n}\n\nstd::vector<int> suffix_array(const std::string& s) {\n int n = int(s.size());\n std::vector<int> s2(n);\n for (int i = 0; i < n; i++) {\n s2[i] = s[i];\n }\n return internal::sa_is(s2, 255);\n}\n\n// Reference:\n// T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park,\n// Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its\n// Applications\ntemplate <class T>\nstd::vector<int> lcp_array(const std::vector<T>& s,\n const std::vector<int>& sa) {\n int n = int(s.size());\n assert(n >= 1);\n std::vector<int> rnk(n);\n for (int i = 0; i < n; i++) {\n rnk[sa[i]] = i;\n }\n std::vector<int> lcp(n - 1);\n int h = 0;\n for (int i = 0; i < n; i++) {\n if (h > 0) h--;\n if (rnk[i] == 0) continue;\n int j = sa[rnk[i] - 1];\n for (; j + h < n && i + h < n; h++) {\n if (s[j + h] != s[i + h]) break;\n }\n lcp[rnk[i] - 1] = h;\n }\n return lcp;\n}\n\nstd::vector<int> lcp_array(const std::string& s, const std::vector<int>& sa) {\n int n = int(s.size());\n std::vector<int> s2(n);\n for (int i = 0; i < n; i++) {\n s2[i] = s[i];\n }\n return lcp_array(s2, sa);\n}\n\n// Reference:\n// D. Gusfield,\n// Algorithms on Strings, Trees, and Sequences: Computer Science and\n// Computational Biology\ntemplate <class T> std::vector<int> z_algorithm(const std::vector<T>& s) {\n int n = int(s.size());\n if (n == 0) return {};\n std::vector<int> z(n);\n z[0] = 0;\n for (int i = 1, j = 0; i < n; i++) {\n int& k = z[i];\n k = (j + z[j] <= i) ? 0 : std::min(j + z[j] - i, z[i - j]);\n while (i + k < n && s[k] == s[i + k]) k++;\n if (j + z[j] < i + z[i]) j = i;\n }\n z[0] = n;\n return z;\n}\n\nstd::vector<int> z_algorithm(const std::string& s) {\n int n = int(s.size());\n std::vector<int> s2(n);\n for (int i = 0; i < n; i++) {\n s2[i] = s[i];\n }\n return z_algorithm(s2);\n}\n\n} // namespace atcoder\n\n\n\nstd::string reversed(std::string S) {\n std::reverse(S.begin(), S.end());\n return S;\n}\n\nint main() {\n std::string S;\n std::cin >> S;\n auto rec{[&](auto rec, int L, int R) -> long long {\n if (L + 1 >= R) return 0LL;\n int M{(L + R) / 2};\n long long res{};\n std::string FR{S.substr(L, M - L)}, BK{S.substr(M, R - M)};\n {\n std::string T{reversed(FR) + reversed(BK)};\n std::vector<int> Z1{atcoder::z_algorithm(BK)}, Z2{atcoder::z_algorithm(T)};\n for (int i{2} ; i < (int)BK.size() ; i++) {\n int z1{Z1[i]};\n int z2{Z2[FR.size() + BK.size() - i]};\n int max1{std::min(i - 1, z1)};\n int max2{std::min(i - 1, z2)};\n res += std::max(0, max1 + max2 - i + 1);\n }\n }\n {\n std::vector<int> Z1{atcoder::z_algorithm(reversed(FR))}, Z2{atcoder::z_algorithm(BK + FR)};\n for (int i{2} ; i < (int)FR.size() ; i++) {\n int z1{Z1[i]}, z2{Z2[BK.size() + FR.size() - i]};\n int max1{std::min(i - 1, z1)};\n int max2{std::min(i - 1, z2)};\n res += std::max(0, max1 + max2 - i + 1);\n }\n for (int i{} ; i < (int)FR.size() ; i++) {\n if (Z2[BK.size() + i] >= (int)FR.size() - i) res++;\n }\n }\n res += rec(rec, L, M);\n res += rec(rec, M, R);\n return res;\n }};\n std::cout << rec(rec, 0, (int)S.size()) << '\\n';\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 4440, "score_of_the_acc": -0.0392, "final_rank": 1 }, { "submission_id": "aoj_0477_9465321", "code_snippet": "#pragma GCC optimize(\"O3\")\n\n// RollingHash\n// https://www.acmicpc.net/problem/1605\n#include<bits/stdc++.h>\n\nusing namespace std;\n\n// https://qiita.com/recuraki/items/652f97f5330fde231ddb#%E3%83%8F%E3%83%83%E3%82%B7%E3%83%A5%E8%A1%9D%E7%AA%81%E6%94%BB%E6%92%83%E3%81%AE%E3%83%8F%E3%83%83%E3%82%AD%E3%83%B3%E3%82%B0%E3%81%8B%E3%82%89%E8%BA%AB%E3%82%92%E5%AE%88%E3%82%8B%E6%96%B9%E6%B3%95\n#include <chrono>\nstruct custom_hash {\n static uint64_t splitmix64(uint64_t x) {\n // http://xorshift.di.unimi.it/splitmix64.c\n x += 0x9e3779b97f4a7c15;\n x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;\n x = (x ^ (x >> 27)) * 0x94d049bb133111eb;\n return x ^ (x >> 31);\n }\n\n size_t operator()(uint64_t x) const {\n static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();\n return splitmix64(x + FIXED_RANDOM);\n }\n};\n\n// Safer-Faster-RollingHash\n// https://qiita.com/keymoon/items/11fac5627672a6d6a9f6\n// https://atcoder.jp/contests/abc141/submissions/7717102\ntypedef unsigned long long int ull;\n\n#define MAXLEN 500005\n\nconst ull MASK30 = (1ull << 30) - 1;\nconst ull MASK31 = (1ull << 31) - 1;\nconst ull MOD = (1ull << 61) - 1;\nconst ull MASK61 = MOD;\nconst ull POSITIVIZER = MOD * 4;\n\n//mod 2^61-1\null CalcMod(ull x)\n{\n ull xu = x >> 61;\n ull xd = x & MASK61;\n ull res = xu + xd;\n if (res >= MOD) res -= MOD;\n return res;\n}\n\n//a*b mod 2^61-1\null Mul(ull a, ull b)\n{\n ull au = a >> 31;\n ull ad = a & MASK31;\n ull bu = b >> 31;\n ull bd = b & MASK31;\n ull mid = ad * bu + au * bd;\n ull midu = mid >> 30;\n ull midd = mid & MASK30;\n return CalcMod(au * bu * 2 + midu + (midd << 31) + ad * bd);\n}\n\null hBase;\nvector<ull> powMemo;\nvoid genBase(mt19937_64 &eg){\n hBase=0;\n while(hBase==0){\n hBase=CalcMod((ull)eg());\n }\n\n powMemo.resize(MAXLEN);\n powMemo[0]=1;\n for(int i=1;i<MAXLEN;i++){\n powMemo[i]=Mul(powMemo[i-1],hBase);\n }\n}\n\nvector<ull> genHash(string s){\n vector<ull> res={0};\n ull cur=0;\n for(auto &nx : s){\n cur=Mul(cur,hBase);\n cur=CalcMod(cur+nx);\n res.push_back(cur);\n }\n return res;\n}\n\n// substr [l,r) (0-indexed)\null subHash(int l,int r,vector<ull> &hv){\n return CalcMod(hv[r] + POSITIVIZER - Mul(hv[l], powMemo[r-l]));\n}\n\nint main(){\n random_device seed_gen;\n mt19937_64 engine(seed_gen());\n\n genBase(engine);\n\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n {\n string s;\n cin >> s;\n\n long long res=0;\n int l=s.size();\n vector<ull> hv=genHash(s);\n for(int u=1;u<=(l/2);u++){\n bool pre=false;\n int f=(u-1);\n while(f+u<l){\n int s=(f+u);\n int lef=1,rig=u;\n while(lef<=rig){\n int te=(lef+rig)/2;\n if(subHash(f+1-te,f+1,hv)==subHash(s+1-te,s+1,hv)){lef=te+1;}\n else{rig=te-1;}\n }\n if(rig==u){\n // match\n if(pre){res+=u;}\n else{res++;}\n pre=true;\n f=s;\n }\n else{\n if(pre){\n int ulef=1,urig=u;\n while(ulef<=urig){\n int te=(ulef+urig)/2;\n if(subHash(f+1-u,f+1+te-u,hv)==subHash(f+1,f+1+te,hv)){ulef=te+1;}\n else{urig=te-1;}\n }\n res+=urig;\n }\n pre=false;\n f=s-rig;\n }\n }\n if(pre){\n int ulef=1,urig=u;\n while(ulef<=urig){\n int te=(ulef+urig)/2;\n if(f+1+te>l){urig=te-1; continue;}\n if(subHash(f+1-u,f+1+te-u,hv)==subHash(f+1,f+1+te,hv)){ulef=te+1;}\n else{urig=te-1;}\n }\n res+=urig;\n }\n }\n cout << res << \"\\n\";\n }\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 8148, "score_of_the_acc": -0.1678, "final_rank": 3 }, { "submission_id": "aoj_0477_6950344", "code_snippet": "#include <bits/stdc++.h>\n\nusing std::vector;\nusing std::array;\nusing std::pair;\nusing std::tuple;\n\nusing ll = long long;\n\nvector<int> suffix_array(const std::string& s) {\n const int n = (int)s.size();\n vector<int> sa(n);\n std::iota(sa.begin(), sa.end(), 0);\n std::sort(sa.begin(), sa.end(), [&](const int& a, const int& b) {\n if (s[a] == s[b]) return (a > b);\n return (s[a] < s[b]);\n });\n vector<int> classes(n), c(n), cnt(n);\n for (int i = 0; i < n; i++) {\n c[i] = s[i];\n }\n for (int len = 1; len < n; len <<= 1) {\n for (int i = 0; i < n; i++) {\n if (i > 0 && c[sa[i - 1]] == c[sa[i]] && sa[i - 1] + len < n &&\n c[sa[i - 1] + len / 2] == c[sa[i] + len / 2]) {\n classes[sa[i]] = classes[sa[i - 1]];\n } else {\n classes[sa[i]] = i;\n }\n }\n std::iota(cnt.begin(), cnt.end(), 0);\n std::copy(sa.begin(), sa.end(), c.begin());\n for (int i = 0; i < n; i++) {\n int s1 = c[i] - len;\n if (s1 >= 0) sa[cnt[classes[s1]]++] = s1;\n }\n std::swap(classes, c);\n }\n return sa;\n}\n\nvector<int> lcp_array(const std::string& s, const vector<int>& sa) {\n int n = (int)s.size();\n assert(n >= 1);\n vector<int> rnk(n);\n for (int i = 0; i < n; i++) {\n rnk[sa[i]] = i;\n }\n vector<int> lcp(n - 1);\n int h = 0;\n for (int i = 0; i < n; i++) {\n if (h > 0) h--;\n if (rnk[i] == 0) continue;\n int j = sa[rnk[i] - 1];\n for (; j + h < n && i + h < n; h++) {\n if (s[j + h] != s[i + h]) break;\n }\n lcp[rnk[i] - 1] = h;\n }\n return lcp;\n}\n\ntemplate <class F>\nstruct Fixed : private F {\n explicit Fixed(F&& f) : F(std::forward<F>(f)) {}\n template <class... Args> decltype(auto) operator()(Args&&... args) const {\n return F::operator()(*this, std::forward<Args>(args)...);\n }\n};\n\ntemplate <class F>\ndecltype(auto) fixed(F&& f) {\n return Fixed<F>(std::forward<F>(f));\n}\n\nstruct Fenwick {\n int size;\n vector<int> data;\n explicit Fenwick(const int n) : size(n), data(n + 1) {}\n void add(int i, const int x) {\n i += 1;\n while (i <= size) {\n data[i] += x;\n i += i & -i;\n }\n }\n int pref(int i) const {\n int x = 0;\n while (i > 0) {\n x += data[i];\n i -= i & -i;\n }\n return x;\n }\n int fold(const int l, const int r) const {\n return pref(r) - pref(l);\n }\n};\n\nstruct Counter {\n vector<int> list;\n Fenwick fen;\n explicit Counter(const vector<int>& vec) : list(vec), fen(vec.size()) {\n std::sort(list.begin(), list.end());\n }\n void add(const int x) {\n const int i = std::lower_bound(list.begin(), list.end(), x) - list.begin();\n fen.add(i, 1);\n }\n int count(const int l, const int r) const {\n const int i = std::lower_bound(list.begin(), list.end(), l) - list.begin();\n const int j = std::lower_bound(list.begin(), list.end(), r + 1) - list.begin();\n return fen.fold(i, j);\n }\n};\n\nint main() {\n std::ios_base::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::string str;\n std::cin >> str;\n const int N = (int)str.size();\n const auto A = suffix_array(str);\n const auto B = lcp_array(str, A);\n ll ans = 0;\n fixed([&](auto&& dfs, const int lb, const int ub) -> void {\n const int n = ub - lb;\n if (n == 1) {\n return;\n }\n const int mid = (lb + ub) / 2;\n const int nl = mid - lb;\n vector<pair<int, int>> b(n);\n b[nl - 1].first = b[nl].first = B[mid - 1];\n for (int i = nl - 2; i >= 0; --i) {\n b[i].first = std::min(b[i + 1].first, B[lb + i]);\n }\n for (int i = nl + 1; i < n; ++i) {\n b[i].first = std::min(b[i - 1].first, B[lb + i - 1]);\n }\n for (int i = 0; i < n; ++i) {\n b[i].second = lb + i;\n }\n std::sort(b.rbegin(), b.rend());\n Counter cl(std::vector<int>(A.begin() + lb, A.begin() + mid));\n Counter cr(std::vector<int>(A.begin() + mid, A.begin() + ub));\n for (const auto& p : b) {\n const int min = p.first;\n const int i = p.second;\n if (i >= mid) {\n ans += cl.count(A[i] - min, A[i] + min);\n cr.add(A[i]);\n } else {\n ans += cr.count(A[i] - min, A[i] + min);\n cl.add(A[i]);\n }\n }\n dfs(lb, mid);\n dfs(mid, ub);\n })(0, N);\n std::cout << ans << '\\n';\n return 0;\n}", "accuracy": 1, "time_ms": 280, "memory_kb": 6900, "score_of_the_acc": -0.5691, "final_rank": 5 }, { "submission_id": "aoj_0477_6764474", "code_snippet": "#include <bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\n#define _GLIBCXX_DEBUG\nusing namespace std;\nusing std::cout;\nusing std::cin;\nusing std::endl;\nusing ll=long long;\nusing ld=long double;\nll ILL=2167167167167167167;\nconst int INF=100000000;\nconst ll mod=1e9+7;\n#define rep(i,a) for (ll i=0;i<a;i++)\n#define all(p) p.begin(),p.end()\ntemplate<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;\ntemplate<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}\ntemplate<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}\ntemplate<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}\ntemplate<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}\ntemplate<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}\nvoid yneos(bool a){if(a) cout<<\"Yes\\n\"; else cout<<\"No\\n\";}\ntemplate<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<\" \";cout<<p[i];}cout<<\"\\n\";}\n\n\n// CUT begin\n// Suffix array algorithms from AtCoder Library\n// Document: <https://atcoder.github.io/ac-library/master/document_ja/string.html>\nnamespace internal {\n\nstd::vector<int> sa_naive(const std::vector<int>& s) {\n int n = int(s.size());\n std::vector<int> sa(n);\n std::iota(sa.begin(), sa.end(), 0);\n std::sort(sa.begin(), sa.end(), [&](int l, int r) {\n if (l == r) return false;\n while (l < n && r < n) {\n if (s[l] != s[r]) return s[l] < s[r];\n l++, r++;\n }\n return l == n;\n });\n return sa;\n}\n\nstd::vector<int> sa_doubling(const std::vector<int>& s) {\n int n = int(s.size());\n std::vector<int> sa(n), rnk = s, tmp(n);\n std::iota(sa.begin(), sa.end(), 0);\n for (int k = 1; k < n; k *= 2) {\n auto cmp = [&](int x, int y) {\n if (rnk[x] != rnk[y]) return rnk[x] < rnk[y];\n int rx = x + k < n ? rnk[x + k] : -1;\n int ry = y + k < n ? rnk[y + k] : -1;\n return rx < ry;\n };\n std::sort(sa.begin(), sa.end(), cmp);\n tmp[sa[0]] = 0;\n for (int i = 1; i < n; i++) { tmp[sa[i]] = tmp[sa[i - 1]] + (cmp(sa[i - 1], sa[i]) ? 1 : 0); }\n std::swap(tmp, rnk);\n }\n return sa;\n}\n\n// SA-IS, linear-time suffix array construction\n// Reference:\n// G. Nong, S. Zhang, and W. H. Chan,\n// Two Efficient Algorithms for Linear Time Suffix Array Construction\ntemplate <int THRESHOLD_NAIVE = 10, int THRESHOLD_DOUBLING = 40> std::vector<int> sa_is(const std::vector<int>& s, int upper) {\n int n = int(s.size());\n if (n == 0) return {};\n if (n == 1) return {0};\n if (n == 2) {\n if (s[0] < s[1]) {\n return {0, 1};\n } else {\n return {1, 0};\n }\n }\n if (n < THRESHOLD_NAIVE) { return sa_naive(s); }\n if (n < THRESHOLD_DOUBLING) { return sa_doubling(s); }\n\n std::vector<int> sa(n);\n std::vector<bool> ls(n);\n for (int i = n - 2; i >= 0; i--) { ls[i] = (s[i] == s[i + 1]) ? ls[i + 1] : (s[i] < s[i + 1]); }\n std::vector<int> sum_l(upper + 1), sum_s(upper + 1);\n for (int i = 0; i < n; i++) {\n if (!ls[i]) {\n sum_s[s[i]]++;\n } else {\n sum_l[s[i] + 1]++;\n }\n }\n for (int i = 0; i <= upper; i++) {\n sum_s[i] += sum_l[i];\n if (i < upper) sum_l[i + 1] += sum_s[i];\n }\n\n auto induce = [&](const std::vector<int>& lms) {\n std::fill(sa.begin(), sa.end(), -1);\n std::vector<int> buf(upper + 1);\n std::copy(sum_s.begin(), sum_s.end(), buf.begin());\n for (auto d : lms) {\n if (d == n) continue;\n sa[buf[s[d]]++] = d;\n }\n std::copy(sum_l.begin(), sum_l.end(), buf.begin());\n sa[buf[s[n - 1]]++] = n - 1;\n for (int i = 0; i < n; i++) {\n int v = sa[i];\n if (v >= 1 && !ls[v - 1]) { sa[buf[s[v - 1]]++] = v - 1; }\n }\n std::copy(sum_l.begin(), sum_l.end(), buf.begin());\n for (int i = n - 1; i >= 0; i--) {\n int v = sa[i];\n if (v >= 1 && ls[v - 1]) { sa[--buf[s[v - 1] + 1]] = v - 1; }\n }\n };\n\n std::vector<int> lms_map(n + 1, -1);\n int m = 0;\n for (int i = 1; i < n; i++) {\n if (!ls[i - 1] && ls[i]) { lms_map[i] = m++; }\n }\n std::vector<int> lms;\n lms.reserve(m);\n for (int i = 1; i < n; i++) {\n if (!ls[i - 1] && ls[i]) { lms.push_back(i); }\n }\n\n induce(lms);\n\n if (m) {\n std::vector<int> sorted_lms;\n sorted_lms.reserve(m);\n for (int v : sa) {\n if (lms_map[v] != -1) sorted_lms.push_back(v);\n }\n std::vector<int> rec_s(m);\n int rec_upper = 0;\n rec_s[lms_map[sorted_lms[0]]] = 0;\n for (int i = 1; i < m; i++) {\n int l = sorted_lms[i - 1], r = sorted_lms[i];\n int end_l = (lms_map[l] + 1 < m) ? lms[lms_map[l] + 1] : n;\n int end_r = (lms_map[r] + 1 < m) ? lms[lms_map[r] + 1] : n;\n bool same = true;\n if (end_l - l != end_r - r) {\n same = false;\n } else {\n while (l < end_l) {\n if (s[l] != s[r]) { break; }\n l++;\n r++;\n }\n if (l == n || s[l] != s[r]) same = false;\n }\n if (!same) rec_upper++;\n rec_s[lms_map[sorted_lms[i]]] = rec_upper;\n }\n\n auto rec_sa = sa_is<THRESHOLD_NAIVE, THRESHOLD_DOUBLING>(rec_s, rec_upper);\n\n for (int i = 0; i < m; i++) { sorted_lms[i] = lms[rec_sa[i]]; }\n induce(sorted_lms);\n }\n return sa;\n}\n\n} // namespace internal\n\nstd::vector<int> suffix_array(const std::vector<int>& s, int upper) {\n assert(0 <= upper);\n for (int d : s) { assert(0 <= d && d <= upper); }\n auto sa = internal::sa_is(s, upper);\n return sa;\n}\n\ntemplate <class T> std::vector<int> suffix_array(const std::vector<T>& s) {\n int n = int(s.size());\n std::vector<int> idx(n);\n iota(idx.begin(), idx.end(), 0);\n sort(idx.begin(), idx.end(), [&](int l, int r) { return s[l] < s[r]; });\n std::vector<int> s2(n);\n int now = 0;\n for (int i = 0; i < n; i++) {\n if (i && s[idx[i - 1]] != s[idx[i]]) now++;\n s2[idx[i]] = now;\n }\n return internal::sa_is(s2, now);\n}\n\nstd::vector<int> suffix_array(const std::string& s) {\n int n = int(s.size());\n std::vector<int> s2(n);\n for (int i = 0; i < n; i++) { s2[i] = s[i]; }\n return internal::sa_is(s2, 255);\n}\n\n// Reference:\n// T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park,\n// Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its\n// Applications\ntemplate <class T> std::vector<int> lcp_array(const std::vector<T>& s, const std::vector<int>& sa) {\n int n = int(s.size());\n assert(n >= 1);\n std::vector<int> rnk(n);\n for (int i = 0; i < n; i++) { rnk[sa[i]] = i; }\n std::vector<int> lcp(n - 1);\n int h = 0;\n for (int i = 0; i < n; i++) {\n if (h > 0) h--;\n if (rnk[i] == 0) continue;\n int j = sa[rnk[i] - 1];\n for (; j + h < n && i + h < n; h++) {\n if (s[j + h] != s[i + h]) break;\n }\n lcp[rnk[i] - 1] = h;\n }\n return lcp;\n}\n\nstd::vector<int> lcp_array(const std::string& s, const std::vector<int>& sa) {\n int n = int(s.size());\n std::vector<int> s2(n);\n for (int i = 0; i < n; i++) { s2[i] = s[i]; }\n return lcp_array(s2, sa);\n}\n\n// Count keyword occurence in str\n// Complexity: O(min(|str|, |keyword|) * lg |str|)\nint count_keyword_occurence(const std::string& str, const std::vector<int>& suffarr, const std::string& keyword) {\n const int n = str.size(), m = keyword.size();\n assert(n == suffarr.size());\n if (n < m) return 0;\n auto f1 = [&](int h) {\n for (int j = 0; h + j < n and j < m; j++) {\n if (str[h + j] < keyword[j]) return true;\n if (str[h + j] > keyword[j]) return false;\n }\n return n - h < m;\n };\n auto f2 = [&](int h) {\n for (int j = 0; h + j < n and j < m; j++) {\n // if (str[h + j] < keyword[j]) return true;\n if (str[h + j] > keyword[j]) return false;\n }\n return true;\n };\n const auto L = std::partition_point(suffarr.begin(), suffarr.end(), f1);\n const auto R = std::partition_point(L, suffarr.end(), f2);\n return std::distance(L, R);\n // return std::vector<int>(L, R); // if you need occurence positions\n}\n// CUT begin\n// Range Minimum Query for static sequence by sparse table\n// Complexity: O(NlogN) for precalculation, O(1) per query\ntemplate <typename T> struct StaticRMQ {\n inline T func(const T &l, const T &r) const noexcept { return std::min<T>(l, r); }\n int N, lgN;\n T defaultT;\n std::vector<std::vector<T>> data;\n std::vector<int> lgx_table;\n StaticRMQ() = default;\n StaticRMQ(const std::vector<T> &sequence, T defaultT) : N(sequence.size()), defaultT(defaultT) {\n lgx_table.resize(N + 1);\n for (int i = 2; i < N + 1; i++) lgx_table[i] = lgx_table[i >> 1] + 1;\n lgN = lgx_table[N] + 1;\n data.assign(lgN, std::vector<T>(N, defaultT));\n data[0] = sequence;\n for (int d = 1; d < lgN; d++) {\n for (int i = 0; i + (1 << d) <= N; i++) {\n data[d][i] = func(data[d - 1][i], data[d - 1][i + (1 << (d - 1))]);\n }\n }\n }\n T get(int l, int r) const { // [l, r), 0-indexed\n assert(l >= 0 and r <= N);\n if (l >= r) return defaultT;\n int d = lgx_table[r - l];\n return func(data[d][l], data[d][r - (1 << d)]);\n }\n};\nstruct LongestCommonPrefix {\n const int N;\n std::vector<int> sainv; // len = N\n StaticRMQ<int> rmq;\n LongestCommonPrefix(const std::string s) : N(s.size()) {\n auto sa = suffix_array(s);\n auto lcp = lcp_array(s, sa);\n sainv.resize(N);\n for (int i = 0; i < N; i++) sainv[sa[i]] = i;\n rmq = {lcp, N};\n }\n int lcplen(int l1, int l2) const {\n if (l1 == l2) return N - l1;\n if (l1 == N or l2 == N) return 0;\n l1 = sainv[l1], l2 = sainv[l2];\n if (l1 > l2) std::swap(l1, l2);\n return rmq.get(l1, l2);\n }\n};\n\n// CUT begin\n// Lyndon factorization based on Duval's algorithm\n// **NOT VERIFIED YET**\n// Reference:\n// [1] K. T. Chen, R. H. Fox, R. C. Lyndon,\n// \"Free Differential Calculus, IV. The Quotient Groups of the Lower Central Series,\"\n// Annals of Mathematics, 81-95, 1958.\n// [2] J. P. Duval, \"Factorizing words over an ordered alphabet,\"\n// Journal of Algorithms, 4(4), 363-381, 1983.\n// - https://cp-algorithms.com/string/lyndon_factorization.html\n// - https://qiita.com/nakashi18/items/66882bd6e0127174267a\ntemplate <typename T> std::vector<std::pair<int, int>> lyndon_factorization(const std::vector<T> &S) {\n const int N = S.size();\n std::vector<std::pair<int, int>> ret;\n for (int l = 0; l < N;) {\n int i = l, j = i + 1;\n while (j < N and S[i] <= S[j]) i = (S[i] == S[j] ? i + 1 : l), j++;\n ret.emplace_back(l, j - i), l += j - i;\n }\n return ret;\n}\n\nstd::vector<std::pair<int, int>> lyndon_factorization(const std::string &s) {\n const int N = int(s.size());\n std::vector<int> v(N);\n for (int i = 0; i < N; i++) v[i] = s[i];\n return lyndon_factorization<int>(v);\n}\n\n// Compute the longest Lyndon prefix for each suffix s[i:N]\n// (Our implementation is $O(N \\log N)$)\n// Example:\n// - `teletelepathy` -> [1,4,1,2,1,4,1,2,1,4,1,2,1]\n// Reference:\n// [1] H. Bannai et al., \"The \"Runs\" Theorem,\"\n// SIAM Journal on Computing, 46.5, 1501-1514, 2017.\ntemplate <typename String>\nstd::vector<int> longest_lyndon_prefixes(const String &s, const LongestCommonPrefix &rh) {\n const int N = s.size();\n std::vector<std::pair<int, int>> st{{N, N}};\n std::vector<int> ret(N);\n for (int i = N - 1, j = i; i >= 0; i--, j = i) {\n while (st.size() > 1) {\n int iv = st.back().first, jv = st.back().second;\n int l = rh.lcplen(i, iv);\n if (!(iv + l < N and s[i + l] < s[iv + l])) break;\n j = jv;\n st.pop_back();\n }\n st.emplace_back(i, j);\n ret[i] = j - i + 1;\n }\n return ret;\n}\n\n// Compute all runs in given string\n// Complexity: $O(N \\log N)$ in this implementation (Theoretically $O(N)$ achievable)\n// N = 2e5 -> ~800 ms\n// Reference:\n// [1] H. Bannai et al., \"The \"Runs\" Theorem,\"\n// SIAM Journal on Computing, 46.5, 1501-1514, 2017.\nstd::vector<std::tuple<int, int, int>> run_enumerate(std::string s) {\n if (s.empty()) return {};\n LongestCommonPrefix rh(s);\n std::reverse(s.begin(), s.end());\n LongestCommonPrefix rrev(s);\n std::reverse(s.begin(), s.end());\n auto t = s;\n auto lo = *std::min_element(s.begin(), s.end()), hi = *std::max_element(s.begin(), s.end());\n for (auto &c : t) c = hi - (c - lo);\n auto l1 = longest_lyndon_prefixes(s, rh), l2 = longest_lyndon_prefixes(t, rh);\n int N = s.size();\n std::vector<std::tuple<int, int, int>> ret;\n for (int i = 0; i < N; i++) {\n int j = i + l1[i], L = i - rrev.lcplen(N - i, N - j), R = j + rh.lcplen(i, j);\n if (R - L >= (j - i) * 2) ret.emplace_back(j - i, L, R);\n\n if (l1[i] != l2[i]) {\n j = i + l2[i], L = i - rrev.lcplen(N - i, N - j), R = j + rh.lcplen(i, j);\n if (R - L >= (j - i) * 2) ret.emplace_back(j - i, L, R);\n }\n }\n std::sort(ret.begin(), ret.end());\n ret.erase(std::unique(ret.begin(), ret.end()), ret.end());\n return ret;\n}\n\n//https://judge.yosupo.jp/submission/41769\n\nvoid solve();\n// oddloop\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\t\n\tint t=1;\n\t//cin>>t;\n\trep(i,t) solve();\n}\n\nvoid solve(){\n\tstring S;\n\tcin>>S;\n\tauto ret=run_enumerate(S);\n\tll ans=0;\n\tfor(auto x:ret){\n\t\tll t,l,r;\n\t\ttie(t,l,r)=x;\n\t\t//cout<<t<<\" \"<<l<<\" \"<<r<<\"\\n\";\n\t\tll len=r-l,c=1;\n\t\twhile(c*t*2<=len) ans+=len+1-c*t*2,c++;\n\t}\n\tcout<<ans<<\"\\n\";\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 22076, "score_of_the_acc": -0.425, "final_rank": 4 }, { "submission_id": "aoj_0477_6295616", "code_snippet": "#include <iostream>\n#include <unordered_map>\n#include <unordered_set>\n#include <set>\n#include <vector>\n#include <numeric>\n#include <algorithm>\n#include <queue>\n#include <string>\n#include <random>\n#include <array>\n#include <climits>\n#include <map>\n#include <cassert>\nstd::vector<int> longest_common_prefix_table(const std::string& str) {\n\tconst int n = str.size();\n\tstd::vector<int> result(n);\n\tint left{ 1 };\n\tint right{ 1 };\n\tfor (auto i = 1; i < n; ++i) {\n\t\tif (right < i) {\n\t\t\tleft = i;\n\t\t\tright = i;\n\t\t}\n\t\tif (right <= i + result[i - left]) {\n\t\t\tint len = right - i;\n\t\t\twhile (right < n && str[right] == str[len]) {\n\t\t\t\t++len;\n\t\t\t\t++right;\n\t\t\t}\n\t\t\tresult[i] = len;\n\t\t\tleft = i;\n\t\t}\n\t\telse {\n\t\t\tresult[i] = result[i - left];\n\t\t}\n\t}\n\tresult[0] = n;\n\treturn result;\n}\nstd::vector<int> longest_common_prefix_table(const std::string& objective, const std::string& pattern) {\n\tconst int n = objective.size();\n\tstd::vector<int> result(n);\n\tint left{ 0 };\n\tint right{ 0 };\n\tconst auto lcp = longest_common_prefix_table(pattern);\n\tfor (auto i = 0; i < n; ++i) {\n\t\tif (right < i) {\n\t\t\tleft = i;\n\t\t\tright = i;\n\t\t}\n\t\tif (i - left == lcp.size() || right <= i + lcp[i - left]) {\n\t\t\tint len = right - i;\n\t\t\twhile (len < pattern.size() && right < n && pattern[len] == objective[right]) {\n\t\t\t\t++len;\n\t\t\t\t++right;\n\t\t\t}\n\t\t\tresult[i] = len;\n\t\t\tleft = i;\n\t\t}\n\t\telse {\n\t\t\tresult[i] = lcp[i - left];\n\t\t}\n\t}\n\treturn result;\n}\n\nlong long int brute(const std::string& str) {\n\tint result{ 0 };\n\tfor (auto i = 0; i < str.size(); ++i) {\n\t\tfor (auto len = 1; i + len * 2 <= str.size(); ++len) {\n\t\t\tbool same = true;\n\t\t\tfor (auto j = 0; j < len; ++j) {\n\t\t\t\tif (str[i + j] != str[i + j + len]) {\n\t\t\t\t\tsame = false; break;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (same) {\n\t\t\t\t++result;\n\t\t\t}\n\t\t}\n\t}\n\treturn result;\n}\nlong long int solve(const std::string str) {\n\tif (str.size() < 10) {\n\t\treturn brute(str);\n\t}\n\tconst int n = str.size();\n\tconst auto left = str.substr(0, n / 2);\n\tconst auto right = str.substr(n / 2);\n\tauto left_reverse = left; std::reverse(left_reverse.begin(), left_reverse.end());\n\tauto right_reverse = right; std::reverse(right_reverse.begin(), right_reverse.end());\n\tauto ll = longest_common_prefix_table(left_reverse, left_reverse); std::reverse(ll.begin(), ll.end());\n\tconst auto rr = longest_common_prefix_table(right, right);\n\tconst auto lr = longest_common_prefix_table(left, right);\n\tauto rl = longest_common_prefix_table(right_reverse, left_reverse); std::reverse(rl.begin(), rl.end());\n\tlong long int result{ solve(left) + solve(right) };\n\tif (lr[0] == left.size()) {\n\t\t++result;\n\t}\n\tfor (auto i = 0; i + 1 < left.size(); ++i) {\n\t\tconst int rest = left.size() - i - 1;\n\t\tconst auto l = std::min(rest - 1, ll[i]);\n\t\tconst auto r = lr[i + 1];\n\t\tif (r == 0) continue;\n\t\tif (l + r < rest) continue;\n\t\tresult += (l + r + 1) - rest;\n\t}\n\tfor (auto i = 1; i + 1 < right.size(); ++i) {\n\t\tconst auto rest = i + 1;\n\t\tconst auto l = std::min(rest - 1, rl[i]);\n\t\tconst auto r = std::min(rest - 1, rr[i + 1]);\n\t\tif (l + r < rest) continue;\n\t\tresult += (l + r + 1) - rest;\n\t}\n\treturn result;\n}\nint main() {\n\tstd::string str; std::cin >> str;\n\tconst auto result = solve(str);\n\tstd::cout << result << std::endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 5540, "score_of_the_acc": -0.0461, "final_rank": 2 }, { "submission_id": "aoj_0477_6061257", "code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <tuple>\n\n\nstd::vector<int> z_algorithm(const std::string& S) {\n int n = S.size();\n std::vector<int> res(n, 0);\n res[0] = n;\n int pbegin = 1, pend = 1;\n for (int i = 1; i < n; i++) {\n if (i < pend) {\n res[i] = res[i - pbegin];\n if (pend > i + res[i]) continue;\n res[i] = pend - i;\n pbegin = i;\n }\n else {\n pbegin = pend = i;\n }\n while (true) {\n if (pend == n) break;\n if (S[pend] != S[res[i]]) break;\n res[i]++;\n pend++;\n }\n }\n return res;\n}\n\n\nstruct Run {\n int period;\n int begin;\n int length;\n};\nstd::vector<Run> run_enumerate(std::string S) {\n std::vector<std::pair<int, int>> ranges;\n ranges.push_back(std::make_pair(0, (int)S.size()));\n std::vector<Run> res;\n auto run_order = [](Run l, Run r) {\n return std::make_tuple(l.period, l.begin, l.length)\n < std::make_tuple(r.period, r.begin, r.length);\n };\n auto run_order2 = [](Run l, Run r) {\n return std::make_tuple(l.begin, l.length, l.period)\n < std::make_tuple(r.begin, r.length, r.period);\n };\n while (ranges.size()) {\n auto range = ranges.back();\n ranges.pop_back();\n int len = range.second - range.first;\n if (range.second - range.first <= 1) continue;\n\n std::string tg = S.substr(range.first, len);\n\n int pos_offset = range.first;\n\n int l_size = tg.size() / 2;\n int r_size = tg.size() - l_size;\n\n ranges.push_back(std::make_pair(pos_offset + l_size, pos_offset + l_size + r_size));\n ranges.push_back(std::make_pair(pos_offset, pos_offset + l_size));\n\n std::string tg_tst = tg.substr(l_size) + tg;\n auto z_tst = z_algorithm(tg_tst);\n std::string tg_rsts = tg + tg.substr(0, l_size);\n std::reverse(tg_rsts.begin(), tg_rsts.end());\n auto z_rsts = z_algorithm(tg_rsts);\n for (int period = 1; period <= l_size; period++) {\n int run_l_len = std::min(l_size, z_rsts[period] + period);\n int run_r_len = std::min(r_size, z_tst[r_size + l_size - period]);\n if (run_l_len + run_r_len < period * 2) continue;\n res.push_back({ period, pos_offset + l_size - run_l_len, run_l_len + run_r_len });\n }\n for (int period = 1; period <= r_size; period++) {\n int run_r_len = std::min(r_size, z_tst[period] + period);\n int run_l_len = std::min(l_size, z_rsts[l_size + r_size - period]);\n if (run_l_len + run_r_len < period * 2) continue;\n res.push_back({ period, pos_offset + l_size - run_l_len, run_l_len + run_r_len });\n }\n }\n\n if (res.empty()) return res;\n\n std::sort(res.begin(), res.end(), run_order);\n int p = 0;\n for (int i = 1; i < res.size(); i++) {\n bool use = true;\n if (res[p].period == res[i].period) {\n if (res[p].begin + res[p].length > res[i].begin + res[i].period) {\n use = false;\n if (res[p].begin + res[p].length < res[i].begin + res[i].length) {\n res[p].length = res[i].begin + res[i].length - res[p].begin;\n }\n }\n }\n if (use) { res[++p] = res[i]; }\n }\n res.resize(p + 1);\n\n return res;\n}\n\n\nusing namespace std;\nusing i32 = int32_t;\nusing u32 = uint32_t;\nusing i64 = int64_t;\nusing u64 = uint64_t;\n#define rep(i,n) for(int i=0; i<(n); i++)\n\n\nint main(){\n string S; cin >> S;\n auto res = run_enumerate(S);\n i64 ans = 0;\n for(auto a : res) ans += a.length - a.period * 2 + 1;\n cout << ans << endl;\n return 0;\n}\n\n\n\n\nstruct ios_do_not_sync {\n ios_do_not_sync() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n }\n} ios_do_not_sync_instance;", "accuracy": 1, "time_ms": 130, "memory_kb": 30296, "score_of_the_acc": -0.8388, "final_rank": 6 }, { "submission_id": "aoj_0477_6061246", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 10000000;\nvector<int> suffix_array(string S){\n S.push_back(0);\n int N = S.size();\n vector<int> cnt(128, 0);\n for (int i = 0; i < N; i++){\n cnt[S[i]]++;\n }\n for (int i = 0; i < 127; i++){\n cnt[i + 1] += cnt[i];\n }\n vector<int> SA(N), rank(N);\n for (int i = 0; i < N; i++){\n cnt[S[i]]--;\n SA[cnt[S[i]]] = i;\n }\n rank[SA[0]] = 0;\n for (int i = 0; i < N - 1; i++){\n rank[SA[i + 1]] = rank[SA[i]];\n if (S[SA[i]] != S[SA[i + 1]]){\n rank[SA[i + 1]]++;\n }\n }\n int L = 1;\n while (L < N){\n vector<int> SA2(N), rank2(N);\n for (int i = 0; i < N; i++){\n SA2[i] = SA[i] - L;\n if (SA2[i] < 0){\n SA2[i] += N;\n }\n }\n cnt = vector<int>(N, 0);\n for (int i = 0; i < N; i++){\n cnt[rank[SA2[i]]]++;\n }\n for (int i = 0; i < N - 1; i++){\n cnt[i + 1] += cnt[i];\n }\n for (int i = N - 1; i >= 0; i--){\n cnt[rank[SA2[i]]]--;\n SA[cnt[rank[SA2[i]]]] = SA2[i];\n }\n rank2[SA[0]] = 0;\n for (int i = 0; i < N - 1; i++){\n rank2[SA[i + 1]] = rank2[SA[i]];\n if (rank[SA[i]] != rank[SA[i + 1]] || rank[(SA[i] + L) % N] != rank[(SA[i + 1] + L) % N]){\n rank2[SA[i + 1]]++;\n }\n }\n rank = rank2;\n L *= 2;\n }\n SA.erase(SA.begin());\n return SA;\n}\nvector<int> lcp_array(string &S, vector<int> &SA){\n int N = S.size();\n vector<int> rank(N);\n for (int i = 0; i < N; i++){\n rank[SA[i]] = i;\n }\n vector<int> lcp(N - 1, 0);\n int h = 0;\n for (int i = 0; i < N; i++){\n if (rank[i] > 0){\n int prev = SA[rank[i] - 1];\n if (h > 0){\n h--;\n }\n while (i + h < N && prev + h < N){\n if (S[i + h] != S[prev + h]){\n break;\n }\n h++;\n }\n lcp[rank[i] - 1] = h;\n }\n }\n return lcp;\n}\nstruct segment_tree{\n int N;\n vector<pair<int, int>> ST;\n segment_tree(vector<int> &A){\n int N2 = A.size();\n N = 1;\n while (N < N2){\n N *= 2;\n }\n ST = vector<pair<int, int>>(N * 2 - 1, make_pair(INF, -1));\n for (int i = 0; i < N2; i++){\n ST[N - 1 + i] = make_pair(A[i], i);\n }\n for (int i = N - 2; i >= 0; i--){\n ST[i] = min(ST[i * 2 + 1], ST[i * 2 + 2]);\n }\n }\n pair<int, int> range_min(int L, int R, int i, int l, int r){\n if (r <= L || R <= l){\n return make_pair(INF, -1);\n } else if (L <= l && r <= R){\n return ST[i];\n } else {\n int m = (l + r) / 2;\n return min(range_min(L, R, i * 2 + 1, l, m), range_min(L, R, i * 2 + 2, m, r));\n }\n }\n pair<int, int> range_min(int L, int R){\n return range_min(L, R, 0, 0, N);\n }\n};\nvoid dfs(vector<tuple<int, int, int, int>> &query, vector<int> &SA, segment_tree &ST, int L, int R){\n if (R - L == 1){\n return;\n }\n pair<int, int> P = ST.range_min(L, R - 1);\n int mn = P.first;\n int m = P.second + 1;\n if (m - L < R - m){\n for (int i = L; i < m; i++){\n query.push_back(make_tuple(m, R, SA[i] - mn, SA[i] + mn));\n }\n } else {\n for (int i = m; i < R; i++){\n query.push_back(make_tuple(L, m, SA[i] - mn, SA[i] + mn));\n }\n }\n dfs(query, SA, ST, L, m);\n dfs(query, SA, ST, m, R);\n}\nstruct binary_indexed_tree{\n int N;\n vector<int> BIT;\n binary_indexed_tree(int N): N(N), BIT(N + 1, 0){\n }\n void add(int i){\n i++;\n while (i <= N){\n BIT[i]++;\n i += i & -i;\n }\n }\n int sum(int i){\n int ans = 0;\n while (i > 0){\n ans += BIT[i];\n i -= i & -i;\n }\n return ans;\n }\n int sum(int L, int R){\n return sum(R) - sum(L);\n }\n};\nint main(){\n string S;\n cin >> S;\n int N = S.size();\n vector<int> SA = suffix_array(S);\n vector<int> LCP = lcp_array(S, SA);\n segment_tree ST(LCP);\n vector<tuple<int, int, int, int>> query;\n dfs(query, SA, ST, 0, N);\n int Q = query.size();\n vector<vector<pair<int, int>>> add(N + 1), sub(N + 1);\n for (int i = 0; i < Q; i++){\n int L = get<0>(query[i]);\n int R = get<1>(query[i]);\n int mn = get<2>(query[i]);\n int mx = get<3>(query[i]);\n mn = max(mn, 0);\n mx = min(mx, N - 1);\n sub[mn].push_back(make_pair(L, R));\n add[mx + 1].push_back(make_pair(L, R));\n }\n vector<int> pos(N);\n for (int i = 0; i < N; i++){\n pos[SA[i]] = i;\n }\n binary_indexed_tree BIT(N);\n long long ans2 = 0;\n for (int i = 0; i <= N; i++){\n for (auto P : add[i]){\n ans2 += BIT.sum(P.first, P.second);\n }\n for (auto P : sub[i]){\n ans2 -= BIT.sum(P.first, P.second);\n }\n if (i < N){\n BIT.add(pos[i]);\n }\n }\n cout << ans2 << endl;\n}", "accuracy": 1, "time_ms": 150, "memory_kb": 45932, "score_of_the_acc": -1.2549, "final_rank": 9 } ]
aoj_0471_cpp
Whispering Game PCK is planning a message game as entertainment for his friend's birthday party. Five party participants line up in a horizontal line and challenge each other in a message game. If the message is correctly conveyed to the person on the right, the challenge is successful and prizes are given to the five participants. However, in order to convey the message correctly, the speaker and the listener must be able to use a common language. The party will bring together friends from all over the world, and to estimate the budget for the prizes, PCK decides to calculate the number of ways the participants can line up for the message game to be successful. Given the number of people attending the party, and a list of languages that each participant can use, write a program to find the number of ways in which the message game can succeed. Input The input is given in the following format. $N$ $info_1$ $info_2$ : $info_N$ The first line gives the number of participants in the party, $N$ ($5 \leq N \leq 200$). In the following $N$ lines, information on the languages available to the $i$th participant is given. The $info_i$ is given in the following format. $k$ $l_1$ $l_2$ ... $l_k$ $k$ ($1 \leq k \leq 200$) is the number of languages this participant can use. The $l_i$ is the string (two lowercase letters) that represents the languages that this participant can use. However, there is no overlap in the languages available to the same participant (if $i \ne j$, then $l_i \ne l_j$). Output Output the number of ways the participants can be lined up for a successful message game on a single line. Sample Input and Output Sample Input 1 5 2 ja en 2 ja en 2 ja en 2 ja en 2 ja en Sample Output 1 120 Sample Input 2 6 1 ja 3 ja en ch 2 en fr 2 ve fr 3 ch ve po 1 po Sample Output 2 8
[ { "submission_id": "aoj_0471_11026889", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define rng(i,l,r) for(int i=(l);i<(r);i++)\n#define rrep(i,n) for(int i=(n)-1;i>=0;i--)\n#define rrng(i,l,r) for(int i=(r)-1;i>=(l);i--)\n#define int long long\n#define fi first\n#define se second\n#define pb push_back\n#define all(x) (x).begin(),(x).end()\n\nsigned main(){\n\tint N;cin>>N;\n\tvector<int> K(N);\n\tvector<vector<string>> vs(N);\n\tvector<vector<int>> g(N,vector<int>(N));\n\trep(i,N){\n\t\tcin>>K[i];\n\t\tvs[i].resize(K[i]);\n\t\tfor(auto&&e:vs[i])cin>>e;\n\t}\n\t\n\trep(i,N)rep(j,N){\n\t\tif(i==j)continue;\n\t\tset<string> st(all(vs[i]));\n\t\tfor(auto&&e:vs[j])if(st.count(e))g[i][j]=1;\n\t}\n\t\n\t\n\tvector<int> dsm(N);\n\trep(i,N)dsm[i]=accumulate(all(g[i]),0LL);\n\t\n\tvector<vector<int>> cnt(N,vector<int>(N));\n\trep(i,N)rep(j,N)rep(k,N){\n\t\tif(g[i][k]&&g[j][k])cnt[i][j]++;\n\t}\n\t\n\t\n\tint ans=0;\n\trep(i,N)rep(j,N)rep(k,N){\n\t\tif(i==j||j==k||k==i)continue;\n\t\tif(g[i][k]&&g[j][k]){\n\t\t\tint a=dsm[i]-1-g[i][j],b=dsm[j]-1-g[i][j],c=cnt[i][j]-1;\n\t\t\ta-=c,b-=c;\n\t\t\tans+=a*(b+c)+c*(b+c-1);\n\t\t}\n\t}\n\t\n\tcout<<ans<<\"\\n\";\n}", "accuracy": 1, "time_ms": 270, "memory_kb": 4616, "score_of_the_acc": -1.1174, "final_rank": 18 }, { "submission_id": "aoj_0471_11021310", "code_snippet": "#include <iostream>\n#include <set>\n#include <map>\n#include <vector>\n\n#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)\n\nusing namespace std;\ntypedef long long ll;\n\nint main(void){\n int n;\n cin >> n;\n vector<set<string>> langs(n);\n REP(i, 0, n) {\n int k;\n cin >> k;\n set<string> xs;\n REP(_, 0, k) {\n string tmp;\n cin >> tmp;\n xs.insert(tmp);\n }\n langs[i] = xs;\n }\n vector<vector<int>> g(n, vector<int>(n, 0));\n REP(i, 0, n) {\n REP(j, i + 1, n) {\n bool ok = false;\n for (auto x: langs[i]) {\n if (langs[j].count(x)) {\n ok = true;\n break;\n }\n }\n if (ok) g[i][j] = g[j][i] = 1;\n }\n }\n vector<int> deg(n);\n REP(i, 0, n) REP(j, 0, n) deg[i] += g[i][j];\n vector<ll> path2(n);\n REP(i, 0, n) {\n REP(j, 0, n) {\n if (g[i][j]) path2[i] += deg[j] - 1;\n }\n }\n // 包除原理の要領で、\n // v1 = v4 (-1), v1 = v5 (-1), v2 = v4 (-1), v2 = v5 (-1),\n // v1 = v4 and v2 = v5 (+1), v1 = v5 and v2 = v4 (+1)\n // のパターンを数える\n ll t0 = 0;\n ll t1 = 0;\n ll t2 = 0;\n ll t3 = 0;\n ll t5 = 0;\n ll t6 = 0;\n REP(i, 0, n) {\n t0 += path2[i] * path2[i];\n REP(j, 0, n) {\n if (g[i][j]) t3 += (deg[j] - 1) * (deg[j] - 1);\n }\n t6 += path2[i];\n }\n REP(i, 0, n) REP(j, 0, n) if (g[i][j]) {\n REP(k, 0, n) {\n if (g[i][k] && g[j][k]) {\n t1 += deg[k] - 1;\n t5 += 1;\n }\n }\n }\n REP(i, 0, n) REP(j, i + 1, n) {\n ll s = 0;\n REP(k, 0, n) s += g[i][k] && g[j][k];\n t2 += s * s * 2;\n }\n cout << t0 - t1 * 2 - t2 - t3 + t5 + t6 << \"\\n\";\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 5044, "score_of_the_acc": -0.2485, "final_rank": 12 }, { "submission_id": "aoj_0471_11017094", "code_snippet": "#include <iostream>\n#include <set>\n#include <map>\n#include <vector>\n\n#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)\n\nusing namespace std;\ntypedef long long ll;\n\nvector<string> reg;\nmap<string, int> inv;\n\nint put(const string &s) {\n if (inv.count(s)) {\n return inv[s];\n }\n int idx = reg.size();\n inv[s] = idx;\n reg.push_back(s);\n return idx;\n}\n\nint main(void){\n int n;\n cin >> n;\n vector<set<int>> langs(n);\n REP(i, 0, n) {\n int k;\n cin >> k;\n set<int> xs;\n REP(_, 0, k) {\n string tmp;\n cin >> tmp;\n int idx = put(tmp);\n xs.insert(idx);\n }\n langs[i] = xs;\n }\n vector<vector<int>> g(n, vector<int>(n, 0));\n REP(i, 0, n) {\n REP(j, i + 1, n) {\n bool ok = false;\n for (auto x: langs[i]) {\n if (langs[j].count(x)) {\n ok = true;\n break;\n }\n }\n if (ok) g[i][j] = g[j][i] = 1;\n }\n }\n vector<int> deg(n);\n REP(i, 0, n) REP(j, 0, n) deg[i] += g[i][j];\n vector<ll> path2(n);\n REP(i, 0, n) {\n REP(j, 0, n) {\n if (g[i][j]) path2[i] += deg[j] - 1;\n }\n }\n // 包除原理の要領で、\n // v1 = v4 (-1), v1 = v5 (-1), v2 = v4 (-1), v2 = v5 (-1),\n // v1 = v4 and v2 = v5 (+1), v1 = v5 and v2 = v4 (+1)\n // のパターンを数える\n ll t0 = 0;\n ll t1 = 0;\n ll t2 = 0;\n ll t3 = 0;\n ll t5 = 0;\n ll t6 = 0;\n REP(i, 0, n) {\n t0 += path2[i] * path2[i];\n REP(j, 0, n) {\n if (g[i][j]) t3 += (deg[j] - 1) * (deg[j] - 1);\n }\n t6 += path2[i];\n }\n REP(i, 0, n) REP(j, 0, n) if (g[i][j]) {\n REP(k, 0, n) {\n if (g[i][k] && g[j][k]) {\n t1 += deg[k] - 1;\n t5 += 1;\n }\n }\n }\n REP(i, 0, n) REP(j, i + 1, n) {\n ll s = 0;\n REP(k, 0, n) s += g[i][k] && g[j][k];\n t2 += s * s * 2;\n }\n cout << t0 - t1 * 2 - t2 - t3 + t5 + t6 << \"\\n\";\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4608, "score_of_the_acc": -0.1549, "final_rank": 8 }, { "submission_id": "aoj_0471_11015502", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n//#include<atcoder/all>\n//using namespace atcoder;\n//using mint = modint998244353;\n#define int long long\nsigned main() {\n int n;\n cin >> n;\n vector<vector<vector<bool>>> ok(n,vector<vector<bool>>(26,vector<bool>(26)));\n for(int i = 0; i < n; i++) {\n int m;\n cin >> m;\n while(m--) {\n string s;\n cin >> s;\n ok[i][s[0]-'a'][s[1]-'a'] = true;\n }\n }\n vector<vector<bool>> f(n,vector<bool>(n,false));\n for(int i = 0; i < n; i++) {\n for(int j = i+1; j < n; j++) {\n for(int k = 0; k < 26; k++) {\n for(int l = 0; l < 26; l++) if(ok[i][k][l] && ok[j][k][l]) {\n f[i][j] = true;\n f[j][i] = true;\n break;\n }\n if(f[i][j]) break;\n }\n }\n }\n vector<bitset<200>> b(n);\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < n; j++) if(f[i][j]) b[i].set(j,1);\n }\n int ans = 0;\n for(int i = 0; i < n; i++) {\n vector<int> c(n,0);\n for(int j = 0; j < n; j++) {\n if(i == j) continue;\n for(int k = 0; k < n; k++) if(i != k && f[j][k]) c[j]++;\n }\n for(int j = 0; j < n; j++) for(int k = 0; k < n; k++) {\n if(i == j || j == k || k == i) continue;\n if(!f[i][j] || !f[i][k]) continue;\n int x = c[j], y = c[k];\n if(f[j][k]) x--,y--;\n ans+=x*y;\n bitset<200> z = (b[j]&b[k]);\n int co = z.count();\n ans-=co-1;\n \n }\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 3760, "score_of_the_acc": -0.3553, "final_rank": 15 }, { "submission_id": "aoj_0471_10956722", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n // input\n int n; cin >> n;\n map<string, vector<int>> Map;\n for (int i = 0; i < n; i++) {\n int k; cin >> k;\n for (int j = 0; j < k; j++) {\n string v; cin >> v;\n Map[v].push_back(i);\n }\n }\n\n // get connect\n vector<vector<bool>> connect(n, vector<bool>(n, false));\n vector<vector<int>> common(n, vector<int>(n, 0));\n vector<int> deg(n, 0);\n for (auto [a, b] : Map) {\n for (int i = 0; i < b.size(); i++) {\n for (int j = i + 1; j < b.size(); j++) {\n connect[b[i]][b[j]] = true;\n connect[b[j]][b[i]] = true;\n }\n }\n }\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (connect[i][j] == true) {\n deg[i] += 1;\n }\n }\n }\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n for (int k = 0; k < n; k++) {\n if (connect[i][k] == true && connect[j][k] == true) {\n common[i][j] += 1;\n }\n }\n }\n }\n\n // search\n ll ans = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n for (int k = 0; k < n; k++) {\n if (connect[i][j] == false) continue;\n if (connect[i][k] == false) continue;\n if (j == k) continue;\n int ways_j = deg[j] - 1 - (connect[j][k] == true ? 1 : 0);\n int ways_k = deg[k] - 1 - (connect[k][j] == true ? 1 : 0);\n int ways = ways_j * ways_k;\n ways -= (common[j][k] - 1);\n // cerr << i << \" \" << j << \" \" << k << \" \" << ways_j << \" \" << ways_k << \" \" << ways << endl;\n ans += ways;\n }\n }\n }\n cout << ans << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3816, "score_of_the_acc": -0.1316, "final_rank": 6 }, { "submission_id": "aoj_0471_10956642", "code_snippet": "#include <iostream>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <algorithm>\n#include <set>\nusing ll = long long;\nusing namespace std;\n\nint main(){\n\tint N;cin >> N;\n\tvector<set<string>> ss(N);\n\tfor (int i = 0;i < N;i++) {\n\t\tint k;cin >> k;\n\t\twhile (k--) {\n\t\t\tstring t;cin >> t;\n\t\t\tss[i].insert(t);\n\t\t}\n\t}\n\tvector<vector<bool>> A(N, vector<bool>(N, false));\n\tvector<vector<int>> C(N, vector<int>(N, 0));\n\tvector<ll> D(N);\n\tfor (int i = 0;i < N;i++) for (int j = 0;j < N;j++) {\n\t\tif (i == j) continue;\n\t\tbool flg = false;\n\t\tfor (auto x : ss[i]) if (ss[j].find(x) != ss[j].end()) flg = true;\n\t\tif (!flg) continue;\n\t\n\t\tA[i][j] = true;\n\t\tD[i]++;\n\t}\n\tvector<ll> S(N, 0);\n\tfor (int a = 0;a < N;a++) for (int b = 0;b < N;b++) for (int c = 0;c < N;c++) {\n\t\tif (a == b || b == c || a == c) continue;\n\t\tif (A[a][b] && A[b][c]) S[a]++;\n\t\tif (A[a][c] and A[b][c]) {\n\t\t\tC[a][b]++;\n\t\t}\n\t}\n\tll res = 0;\n\tint nvv = 0;\n\tfor (int a = 0;a < N;a++) for (int b = 0;b < N;b++) for (int c = 0;c < N;c++) {\n\t\tif (a == b || b == c || a == c) continue;\n\t\tif (!A[a][b] or !A[b][c]) continue;\n\t\tll X = S[c];\n\t\tX -= D[b] - 1;\n\t\tif (A[a][c]) X -= D[a] - 1;\n\t\t\n\t\t\n\t\t//e = b\n\t\tX -= C[c][b] - (A[c][a]&&A[b][a] ? 1 : 0);\n\t\tX -= C[c][a] - (A[c][b]&&A[a][b] ? 1 : 0);\n\t\tint nvs = 0;\n\t\t\n\t\t\n\t\tres += X;\n\t\tnvv += nvs;\n\t\t\n\t}\n\tcout << res << endl;\n\t\n\t\n\t\n}", "accuracy": 1, "time_ms": 270, "memory_kb": 5376, "score_of_the_acc": -1.2136, "final_rank": 19 }, { "submission_id": "aoj_0471_10955950", "code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i, l, n) for(int i = int(l); i < int(n); i++)\n#define ll long long\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n\ntemplate<class T> bool chmin(T &a, T b) {if(a > b) {a = b; return true;} return false;}\ntemplate<class T> bool chmax(T &a, T b) {if(a < b) {a = b; return true;} return false;}\ntemplate<class T> using spq = priority_queue<T, vector<T>, greater<T>>;\n\n// bool -> Yes/No\nstring answer(bool b) {return b ? \"Yes\" : \"No\";}\n\nvoid fix(int k) {cout << fixed << setprecision(k);}\n\nconst int inf = 2e9;\nconst long long INF = 2e18;\nconst long double eps = 1e-12;\nconst long double pi = acos(-1);\nint dx[] = {0, -1, 0, 1, -1, -1, 1, 1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};\n\nvoid main_program() {\n int n; cin >> n;\n int con[n][n];\n rep(i, 0, n) rep(j, 0, n) con[i][j] = 0;\n vector<int> lang[676];\n rep(i, 0, n) {\n int k; cin >> k;\n while(k--) {\n string s; cin >> s;\n int b = (s[0] - 'a') * 26 + (s[1] - 'a');\n lang[b].emplace_back(i);\n }\n }\n rep(i, 0, 676) {\n rep(j, 0, lang[i].size()) rep(k, j + 1, lang[i].size()) {\n con[lang[i][j]][lang[i][k]] = 1;\n con[lang[i][k]][lang[i][j]] = 1;\n }\n }\n int cnt[n];\n int dup[n][n];\n rep(i, 0, n) {\n cnt[i] = 0;\n rep(j, 0, n) if(con[i][j]) cnt[i]++;\n }\n rep(i, 0, n) rep(j, 0, n) {\n dup[i][j] = 0;\n rep(k, 0, n) dup[i][j] += con[i][k] * con[j][k];\n }\n ll ans = 0;\n // 適当に３人選ぶ\n rep(a, 0, n) rep(b, 0, n) rep(c, 0, n) {\n if(a == b || b == c || c == a) continue;\n if(!con[a][b] || !con[b][c]) continue;\n // aの左に並ぶ人を選ぶ -> d\n // eの右に並ぶ人を選ぶ -> e\n // con[a][d] = 1\n // con[c][e] = 1 && d != e\n int t = con[a][c];\n ans += (ll)(cnt[a] - 1 - t) * (ll)(cnt[c] - 1 - t) - (dup[a][c] - 1);\n }\n cout << ans << \"\\n\";\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int T = 1;\n //cin >> T;\n while(T--) {\n main_program();\n }\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3840, "score_of_the_acc": -0.0577, "final_rank": 2 }, { "submission_id": "aoj_0471_9807095", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tlong long n;\n\tcin >> n;\n\tlong long m = 26ll * 26ll;\n\tvector<vector<long long>> a(n);\n\tfor(long long i = 0ll;i < n;i++){\n\t\tlong long c;\n\t\tcin >> c;\n\t\ta[i].resize(c);\n\t\tfor(long long j = 0ll;j < c;j++){\n\t\t\tstring s;\n\t\t\tcin >> s;\n\t\t\tlong long it = (s[0ll] - 'a') * 26ll + (s[1ll] - 'a');\n\t\t\ta[i][j] = it;\n\t\t}\n\t}\n\tvector<vector<long long>> g(n,vector<long long>(n,false));\n\tvector<vector<long long>> cou(n,vector<long long>(n,0ll));\n\tfor(long long i = 0ll;i < n;i++){\n\t\tfor(long long j = i + 1ll;j < n;j++){\n\t\t\t[&]{\n\t\t\t\tfor(long long k : a[i]){\n\t\t\t\t\tfor(long long l : a[j]){\n\t\t\t\t\t\tif(k == l){\n\t\t\t\t\t\t\tg[i][j] = true;\n\t\t\t\t\t\t\tg[j][i] = true;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}();\n\t\t}\n\t}\n\tfor(long long i = 0ll;i < n;i++){\n\t\tfor(long long j = 0ll;j < n;j++){\n\t\t\tif(i == j) continue;\n\t\t\tfor(long long k = 0ll;k < n;k++){\n\t\t\t\tif(g[i][k] && g[j][k]){\n\t\t\t\t\tcou[i][j]++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tvector<long long> v(n,0ll);\n\tfor(long long i = 0ll;i < n;i++){\n\t\tfor(long long j = 0ll;j < n;j++){\n\t\t\tif(g[i][j]) v[i]++;\n\t\t}\n\t}\n\tlong long ans = 0ll;\n\tfor(long long i = 0ll;i < n;i++){\n\t\tfor(long long j = 0ll;j < n;j++){\n\t\t\tif(i == j) continue;\n\t\t\tif(!g[i][j]) continue;\n\t\t\tfor(long long k = 0ll;k < n;k++){\n\t\t\t\tif(i == k || j == k) continue;\n\t\t\t\tif(!g[j][k]) continue;\n\t\t\t\tpair<long long,long long> it = {v[i] - 1ll - (g[i][k] ? 1ll : 0ll),v[k] - 1ll - (g[i][k] ? 1ll : 0ll)};\n\t\t\t\tpair<long long,long long> x = {it.first - (cou[i][k] - 1ll),it.second - (cou[i][k] - 1ll)};\n\t\t\t\tlong long p = x.first * it.second + (it.first - x.first) * (it.second - 1ll);\n\t\t\t\tans += p;\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n}", "accuracy": 1, "time_ms": 160, "memory_kb": 4160, "score_of_the_acc": -0.6366, "final_rank": 16 }, { "submission_id": "aoj_0471_9803827", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define fi first\n#define se second\nusing ll = long long;\nbool chmin(ll &a,ll b){\n if(a>b){\n a=b;\n return true;\n }\n return false;\n}\nint main(){\n ll n;\n cin>>n;\n vector<vector<ll>> g(n,vector<ll>(n));\n ll ans=0;\n map<string,vector<ll>> m;\n for(int i=0;i<n;i++){\n ll k;\n cin>>k;\n for(int j=0;j<k;j++){\n string s;\n cin>>s;\n m[s].push_back(i);\n }\n }\n for(auto e:m){\n for(int i=0;i<e.se.size();i++){\n for(int j=i+1;j<e.se.size();j++){\n g[e.se[i]][e.se[j]]=g[e.se[j]][e.se[i]]=1;\n }\n }\n }\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n if(i==j) continue;\n ll x=0,y=0,z=0;\n for(int k=0;k<n;k++){\n if(i==k||j==k) continue;\n if(g[i][k]) x++;\n if(g[j][k]) y++;\n if(g[i][k]&&g[j][k]) z++;\n }\n ans+=z*((x-1)*(y-1)-(z-1));\n }\n }\n cout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4032, "score_of_the_acc": -0.082, "final_rank": 4 }, { "submission_id": "aoj_0471_9480825", "code_snippet": "#include <bits/stdc++.h>\n\nconst int M{26 * 26};\n\nint main() {\n int N;\n std::cin >> N;\n std::vector<std::bitset<M>> L(N);\n for (int i{} ; i < N ; i++) {\n int k;\n std::cin >> k;\n while (k--) {\n char a, b;\n std::cin >> a >> b;\n L[i][(a - 'a') * 26 + (b - 'a')] = true;\n }\n }\n std::vector G(N, std::vector<bool>(N));\n for (int i{} ; i < N ; i++) {\n for (int j{i + 1} ; j < N ; j++) {\n if (std::bitset<M>(L[i] & L[j]).count()) {\n G[i][j] = G[j][i] = true;\n }\n }\n }\n std::vector<int> cnt(N);\n for (int i{} ; i < N ; i++) {\n cnt[i] = (int)std::count(G[i].begin(), G[i].end(), true);\n }\n std::vector both(N, std::vector<int>(N)); \n for (int i{} ; i < N ; i++) {\n for (int j{} ; j < N ; j++) {\n if (i == j) continue;\n for (int k{} ; k < N ; k++) {\n if (i == k or j == k) continue;\n if (G[i][k] and G[j][k]) both[i][j]++;\n }\n }\n }\n long long ans{};\n for (int i{} ; i < N ; i++) {\n for (int j{} ; j < N ; j++) {\n if (i == j) continue;\n if (!G[i][j]) continue;\n for (int k{} ; k < N ; k++) {\n if (i == k or j == k) continue;\n if (!G[j][k]) continue;\n if (G[i][k]) {\n ans += (cnt[i] - 2) * (cnt[k] - 2) - (both[i][k] - 1); \n }\n else {\n ans += (cnt[i] - 1) * (cnt[k] - 1) - (both[i][k] - 1);\n }\n }\n }\n }\n std::cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3688, "score_of_the_acc": -0.1154, "final_rank": 5 }, { "submission_id": "aoj_0471_8802844", "code_snippet": "#include <bits/stdc++.h>\n\nint main() {\n int n;\n std::cin >> n;\n std::vector graph(n, std::vector<bool>(n));\n std::vector<std::set<std::string>> info(n);\n for (int i = 0; i < n; i++) {\n int k;\n std::cin >> k;\n for (int j = 0; j < k; j++) {\n std::string s;\n std::cin >> s;\n info[i].insert(s);\n }\n }\n for (int i = 0; i < n; i++) {\n for (int j = i + 1; j < n; j++) {\n for (auto s: info[i]) {\n if (info[j].find(s) != info[j].end()) {\n graph[i][j] = true;\n graph[j][i] = true;\n break;\n }\n }\n }\n }\n std::vector<int> outdeg(n);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (graph[i][j]) {\n outdeg[i]++;\n }\n }\n }\n std::vector intersection(n, std::vector<int>(n));\n for (int i = 0; i < n; i++) {\n for (int j = i + 1; j < n; j++) {\n for (int k = 0; k < n; k++) {\n if (graph[i][k] && graph[j][k]) {\n intersection[i][j]++;\n intersection[j][i]++;\n }\n }\n }\n }\n std::vector<int> cur;\n std::vector<bool> used(n);\n cur.reserve(3);\n long long ans = 0;\n auto dfs = [&](auto self, int pos, int u) -> void {\n cur.push_back(u);\n used[u] = true;\n if (pos == 4) {\n int now = 1;\n int left = cur.front();\n int right = cur.back();\n if (graph[left][right]) {\n now *= (outdeg[left] - 2) * (outdeg[right] - 2);\n } else {\n now *= (outdeg[left] - 1) * (outdeg[right] - 1);\n }\n now -= intersection[left][right] - 1;\n ans += now;\n } else {\n for (int v = 0; v < n; v++) {\n if (used[v]) continue;\n if (graph[u][v]) {\n self(self, pos + 1, v);\n }\n }\n }\n cur.pop_back();\n used[u] = false;\n };\n for (int i = 0; i < n; i++) dfs(dfs, 2, i);\n std::cout << ans << std::endl;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 5000, "score_of_the_acc": -0.3198, "final_rank": 14 }, { "submission_id": "aoj_0471_8466380", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug_print.hpp>\n#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define debug(...) (static_cast<void>(0))\n#endif\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N;\n cin >> N;\n vector<vector<string>> A(N);\n for(int i = 0; i < N; i++){\n int k; cin >> k;\n A[i].resize(k);\n for(int j = 0; j < k; j++) cin >> A[i][j];\n }\n\n // mp := 言語 -> 人の集合\n map<string, vector<int>> mp;\n for(int i = 0; i < N; i++){\n for(auto l: A[i]) mp[l].emplace_back(i);\n }\n debug(mp);\n\n // B[i] := 人 i と会話できる人の集合\n vector B(N, vector<int>(N));\n for(auto [key, val]: mp){\n for(unsigned i = 0; i < val.size(); i++){\n for(unsigned j = i + 1; j < val.size(); j++){\n B[val[i]][val[j]] = B[val[j]][val[i]] = 1;\n }\n }\n }\n debug(B);\n\n // 2 人目と 4 人目を全探索\n ll ans = 0;\n for(int i = 0; i < N; i++){\n for(int j = 0; j < N; j++){\n if(i == j) continue;\n // S: i と j ともに会話できる人\n // T: i と会話できるが, j と会話できない人\n // U: i と会話できないが, j と会話できる人\n ll S = 0, T = 0, U = 0;\n for(int k = 0; k < N; k++){\n if(i == k || j == k) continue;\n if(B[i][k] && B[j][k]) S++;\n if(B[i][k] && !B[j][k]) T++;\n if(!B[i][k] && B[j][k]) U++;\n }\n ans += S * (T * U + T * (S - 1) + (S - 1) * U + (S - 1) * (S - 2));\n }\n }\n\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 4356, "score_of_the_acc": -0.1614, "final_rank": 9 }, { "submission_id": "aoj_0471_8209528", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nbool ok[202][202];\nint n;\nlong long sum(int a, int b){\n long long s=0, t=0, u=0;\n for(int i=0;i<n;i++){\n if(i!=b && ok[i][a]){\n if(ok[i][b]) s++;\n else t++;\n } else if(i!=a && ok[i][b]){\n u++;\n }\n }\n return 2*s*( (s-1)*(s-2) + (s-1)*(t+u) + t*u);\n}\nint main(){\n int m;\n string l;\n vector<string> vec[202];\n set<string> se[202];\n cin >> n;\n for(int i=0;i<n;i++){\n cin >> m;\n for(int j=0;j<m;j++){\n cin >> l;\n vec[i].push_back(l);\n se[i].insert(l);\n }\n }\n memset(ok, false, sizeof(ok));\n for(int i=0;i<n-1;i++){\n for(int j=0;j<vec[i].size();j++){\n for(int k=i+1;k<n;k++){\n if(ok[i][k]) continue;\n if(se[k].count(vec[i][j])){\n ok[i][k] = true;\n ok[k][i] = true;\n }\n }\n }\n }\n long long ans=0;\n for(int i=0;i<n-1;i++){\n for(int j=i+1;j<n;j++){\n long long s=0, t=0, u=0;\n for(int k=0;k<n;k++){\n if(k!=j && ok[k][i]){\n if(ok[k][j]) s++;\n else t++;\n } else if(k!=i && ok[k][j]) u++;\n }\n ans += 2*s*( (s-1)*(s-2) + (s-1)*(t+u) + t*u);\n }\n }\n cout << ans << endl;\n return(0);\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 5204, "score_of_the_acc": -0.2303, "final_rank": 11 }, { "submission_id": "aoj_0471_8209506", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nbool ok[202][202];\nint n;\nlong long sum(int a, int b){\n long long s=0, t=0, u=0;\n for(int i=0;i<n;i++){\n if(i!=b && ok[i][a]){\n if(ok[i][b]) s++;\n else t++;\n } else if(i!=a && ok[i][b]){\n u++;\n }\n }\n return 2*s*( (s-1)*(s-2) + (s-1)*(t+u) + t*u);\n}\nint main(){\n int m;\n string l;\n vector<string> vec[202];\n set<string> se[202];\n cin >> n;\n for(int i=0;i<n;i++){\n cin >> m;\n for(int j=0;j<m;j++){\n cin >> l;\n vec[i].push_back(l);\n se[i].insert(l);\n }\n }\n memset(ok, false, sizeof(ok));\n for(int i=0;i<n-1;i++){\n for(int j=0;j<vec[i].size();j++){\n for(int k=i+1;k<n;k++){\n if(ok[i][k]) continue;\n if(se[k].count(vec[i][j])){\n ok[i][k] = true;\n ok[k][i] = true;\n }\n }\n }\n }\n long long ans = 0;\n for(int i=0;i<n-1;i++){\n for(int j=i+1;j<n;j++){\n ans += sum(i, j);\n }\n }\n cout << ans << endl;\n return(0);\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 5108, "score_of_the_acc": -0.2566, "final_rank": 13 }, { "submission_id": "aoj_0471_7077224", "code_snippet": "#include\"bits/stdc++.h\"\n#include<random>\nusing namespace std;\ntypedef long long int llint;\ntypedef pair<int, int> pint;\ntypedef pair<llint, llint> pllint;\ntypedef vector<int> vint;\ntypedef vector<llint> vllint;\ntypedef vector<pint> vpint;\ntypedef vector<string> vstring;\ntypedef vector<pair<llint, llint>> vpllint;\ntypedef vector<vector<int>> vvint;\ntypedef vector<vector<llint>> vvllint;\ntypedef vector<vector<pint>> vvpint;\ntypedef vector<bool> vbool;\ntypedef vector<vbool> vvbool;\ntypedef vector<vpllint> vvpllint;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define drep(i,n) for(int i=n-1;0<=i;i--)\n#define yes(ans) if(ans)cout<<\"yes\"<<endl;else cout<<\"no\"<<endl;\n#define Yes(ans) if(ans)cout<<\"Yes\"<<endl;else cout<<\"No\"<<endl;\n#define YES(ans) if(ans)cout<<\"YES\"<<endl;else cout<<\"NO\"<<endl;\n#define POSSIBLE(ans) if(ans)cout<<\"POSSIBLE\"<<endl;else cout<<\"IMPOSSIBLE\"<<endl;\n#define Pi 3.1415926535897932384626\n#define mod llint(1e9+7)\n#define mod9 998244353\n#define Inf 2147483647\n#define llInf 9223372036854775807\n#define all(x) x.begin(),x.end()\n#define isin(i,n) (0<=i&&i<n)\n\nint main() {\n\tint n;\n\tcin >> n;\n\tvector<set<int>>g(n);\n\t{\n\t\tvector<set<string>> lan(n);\n\t\trep(i, n) {\n\t\t\tint m;\n\t\t\tcin >> m;\n\t\t\tstring s;\n\t\t\trep(j, m) {\n\t\t\t\tcin >> s;\n\t\t\t\tlan[i].insert(s);\n\t\t\t}\n\t\t}\n\t\trep(i, n) {\n\t\t\trep(j, i) {\n\t\t\t\tfor (auto s : lan[i]) {\n\t\t\t\t\tif (lan[j].find(s) != lan[j].end()) {\n\t\t\t\t\t\tg[i].insert(j);\n\t\t\t\t\t\tg[j].insert(i);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tllint ans = 0;\n\trep(i, n)rep(j, n) {\n\t\tif (i == j)continue;\n\t\tint C = 0;\n\t\tfor (auto k : g[i]) if (g[j].find(k) != g[j].end())C++;\n\t\tint A = g[i].size(), B = g[j].size();\n\t\tif (g[i].find(j) != g[i].end()) {\n\t\t\tA--; B--;\n\t\t}\n\t\tA -= C; B -= C;\n\t\tans += (llint)C * (C - 1) * (C - 2);\n\t\tans += (llint)C * (C - 1) * (A + B);\n\t\tans += (llint)C * A * B;\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 270, "memory_kb": 6644, "score_of_the_acc": -1.374, "final_rank": 20 }, { "submission_id": "aoj_0471_7051669", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define ll long long\n#define vi vector<int>\n#define all(v2) v2.begin(),v2.end()\n#define fi first\n#define se second\n#define P pair<int,int>\n#define mp(a,b) make_pair(a,b)\n#define pb(a) push_back(a)\n\nint mod=1e9+7;\nint inf=INT_MAX;\n\nint main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n int n; cin>>n;\n\n vector<string> in[n];\n for(int i=0;i<n;i++){\n int k; cin>>k;\n for(int j=0;j<k;j++){\n string l; cin>>l;\n in[i].push_back(l);\n }\n }\n\n vector<vector<bool>> v(n,vector<bool>(n,0));\n for(int i=0;i<n-1;i++){\n set<string> s;\n for(auto a:in[i]){\n s.insert(a);\n }\n for(int j=i+1;j<n;j++){\n for(auto b:in[j]){\n if(s.find(b)!=s.end()){\n v[i][j]=1;\n v[j][i]=1;\n break;\n }\n }\n }\n }\n\n ll ans=0;\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n if(i==j) continue;\n\n int le=0,mi=0,ri=0;\n for(int k=0;k<n;k++){\n if(k==i || k==j) continue;\n\n if(v[k][i]){\n if(v[k][j]) mi++;\n else le++;\n }\n else if(v[k][j]){\n ri++;\n }\n }\n\n ans+=mi*((mi-1)*(mi-2+le+ri)+le*ri);\n }\n }\n\n cout<<ans<<\"\\n\";\n\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 4244, "score_of_the_acc": -0.1473, "final_rank": 7 }, { "submission_id": "aoj_0471_6958907", "code_snippet": "#include <iostream>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <tuple>\n#include <cstdint>\n#include <cstdio>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <deque>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <cctype>\n#include <climits>\n#include <functional>\n#include <cassert>\n#include <numeric>\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define per(i, n) for(int i = (n) - 1; i >= 0; i--)\nusing ll = long long;\n#define vi vector<int>\n#define vvi vector<vi>\n#define vl vector<ll>\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define all(a) (a).begin(), (a).end()\n#define rall(a) (a).rbegin(), (a).rend()\n#define mod 1000000007\nusing namespace std;\ntemplate<class T, class U>\nbool chmax(T &a, const U &b){ return a < b ? (a = b, 1) : 0; }\ntemplate<class T, class U>\nbool chmin(T &a, const U &b){ return a > b ? (a = b, 1) : 0; }\nint main(){\n int n;\n cin >> n;\n vector<set<int>> lang(n);\n rep(i, n){\n int k; cin >> k;\n rep(j, k){\n string s; cin >> s;\n lang[i].insert(s[0]*128 + s[1]);\n }\n }\n vector<bitset<200>> p(n);\n vi num(n);\n rep(i, n){\n rep(j, n) if(i != j){\n for(const int s : lang[i]){\n if(lang[j].count(s)){\n p[i][j] = 1;\n break;\n }\n }\n }\n num[i] = p[i].count();\n }\n ll ans = 0;\n rep(i, n) rep(j, n) if(i != j){\n const int a = num[i] - p[i][j];\n const int b = (p[i] & p[j]).count();\n const int c = num[j] - p[j][i];\n const int val = (a-1) * (c-1) - (b-1);\n ans += val * b;\n }\n cout << ans << \"\\n\";\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4080, "score_of_the_acc": -0.0496, "final_rank": 1 }, { "submission_id": "aoj_0471_6958904", "code_snippet": "#include <iostream>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <tuple>\n#include <cstdint>\n#include <cstdio>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <deque>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <cctype>\n#include <climits>\n#include <functional>\n#include <cassert>\n#include <numeric>\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define per(i, n) for(int i = (n) - 1; i >= 0; i--)\nusing ll = long long;\n#define vi vector<int>\n#define vvi vector<vi>\n#define vl vector<ll>\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define all(a) (a).begin(), (a).end()\n#define rall(a) (a).rbegin(), (a).rend()\n#define mod 1000000007\nusing namespace std;\ntemplate<class T, class U>\nbool chmax(T &a, const U &b){ return a < b ? (a = b, 1) : 0; }\ntemplate<class T, class U>\nbool chmin(T &a, const U &b){ return a > b ? (a = b, 1) : 0; }\nint main(){\n int n;\n cin >> n;\n vector<set<string>> lang(n);\n rep(i, n){\n int k; cin >> k;\n rep(j, k){\n string s; cin >> s;\n lang[i].insert(s);\n }\n }\n vector<bitset<200>> p(n);\n rep(i, n){\n for(const auto &s : lang[i]){\n rep(j, n) if(i != j && !p[i][j]){\n if(lang[j].count(s)) p[i][j] = 1;\n }\n }\n }\n ll ans = 0;\n rep(i, n) rep(j, n) if(i != j){\n const int a = p[i].count() - p[i][j];\n const int b = (p[i] & p[j]).count();\n const int c = p[j].count() - p[j][i];\n ll val = (a-1) * (c-1) - (b-1);\n ans += val * b;\n }\n cout << ans << \"\\n\";\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4860, "score_of_the_acc": -0.1867, "final_rank": 10 }, { "submission_id": "aoj_0471_6947653", "code_snippet": "#include <bits/stdc++.h>\n\nusing std::vector;\nusing std::array;\nusing std::pair;\nusing std::tuple;\n\nusing ll = long long;\n\nconstexpr int MaxN = 200;\nbool common[MaxN][MaxN];\nbool common2[MaxN][MaxN][MaxN];\nint count[MaxN];\nint count2[MaxN][MaxN];\n\nint main() {\n std::ios_base::sync_with_stdio(false);\n std::cin.tie(nullptr);\n int N;\n std::cin >> N; \n std::map<std::string, vector<int>> lang;\n for (int i = 0; i < N; ++i) {\n int k;\n std::cin >> k;\n while (k--) {\n std::string s;\n std::cin >> s;\n lang[s].push_back(i);\n }\n }\n for (const auto& p : lang) {\n for (const int x : p.second) {\n for (const int y : p.second) {\n common[x][y] = true;\n }\n }\n }\n for (int i = 0; i < N; ++i) {\n common[i][i] = false;\n for (int j = 0; j < N; ++j) {\n count[i] += common[i][j];\n }\n }\n for (int i = 0; i < N; ++i) {\n for (int j = 0; j < N; ++j) {\n for (int k = 0; k < N; ++k) {\n common2[i][j][k] = common[i][k] and common[j][k];\n count2[i][j] += common2[i][j][k];\n }\n }\n }\n ll ans = 0;\n for (int a = 0; a < N; ++a) {\n for (int b = 0; b < N; ++b) {\n for (int c = 0; c < N; ++c) {\n if (common[a][b] and common[b][c] and a != c) {\n ans += (count[a] - common[a][c] - 1) * (count[c] - common[a][c] - 1);\n ans -= count2[a][c] - 1;\n }\n }\n }\n }\n std::cout << ans << '\\n';\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 11592, "score_of_the_acc": -1.0385, "final_rank": 17 }, { "submission_id": "aoj_0471_6900337", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n int n, m;\n cin >> n;\n vector<vector<string>> a(n);\n vector<vector<bool>> T(n, vector<bool>(n));\n for(int i = 0; i < n; i++){\n cin >> m;\n a[i].resize(m);\n for(int j = 0; j < m; j++){\n cin >> a[i][j];\n for(int k = 0; k < i; k++){\n if(T[i][k])continue;\n if(binary_search(a[k].begin(), a[k].end(), a[i][j]))T[i][k] = T[k][i] = true;\n }\n }\n sort(a[i].begin(), a[i].end());\n }\n ll ans = 0;\n for(int i = 0; i < n; i++){\n for(int j = 0; j < i; j++){\n ll A, B, C;\n A = B = C = 0;\n for(int k = 0; k < n; k++){\n if(k == i || k == j)continue;\n if(T[i][k] && T[j][k])C++;\n else if(T[i][k])A++;\n else if(T[j][k])B++;\n }\n //A -> i -> C -> j -> B\n ans += A * C * B;\n //C -> i -> C -> j -> B\n ans += C * (C - 1) * B;\n //A -> i -> C -> j -> C\n ans += A * C * (C - 1);\n //C -> i -> C -> j -> C\n ans += C * (C - 1) * (C - 2);\n }\n }\n cout << 2 * ans << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3852, "score_of_the_acc": -0.0592, "final_rank": 3 } ]
aoj_0474_cpp
Moving Mass Game Students at Idua High School are practicing the moving mass game in preparation for next year's sports festival. In this mass game, the students move and turn their bodies in accordance with the teacher's commands. In the moving mass game, the teacher gives instructions to the students in the compartments numbered from $1$ to $N$. The compartments are lined up in a row from west to east, starting from 1. Initially, each student is in one of the compartments, all standing facing north. Each compartment is large enough to hold all the students. The teacher tells the students who are in which compartment at the time of instruction and how much they will move. When the teacher shouts out the three numbers $a,b,c$, all the students in the compartments from $a$th to $b$th at that point move in a simultaneous manner according to the value of $c$, and also change their body orientation 180 degrees. If $c$ is a positive integer, the student moves east, if negative, the student moves west, and so on for one compartment per number size, and students who were facing north before the move will face south after the move, and students who were facing south will face north. In this case, students who are instructed to move to a compartment numbered less than $a$th will move to the $a$th compartment, and students who are instructed to move to a compartment numbered greater than $b$th will move to the $b$th compartment. This means that some students may not move at all, even if they are in the $a$th through $b$th compartments, but even these students will always change their body orientation 180 degrees. The teacher giving the instructions believes that the orientation of the students at a given point in time has something to do with the beauty of the moving mass game. Therefore, he wants to know the number of students facing north minus the number of students facing south in the specified range of compartments immediately after the instruction at some point. Given the number of compartments, the number of students, the number of the first compartment each student is in, and the information about the query to find the difference between the teacher's call and the number of students, for each query, write a program to find the number of students in the specified range of compartments facing north minus the number of students facing south. Input The input is given in the following format. $N$ $M$ $x_1$ $x_2$ : $x_M$ $Q$ $info_1$ $info_2$ : $info_Q$ The first line gives the number of compartments $N$ ($2 \leq N \leq 10^9=10$ to the $9$ power) and the number of students $M$ ($1 \leq M \leq 100,000$). In the next $M$ line, the number $x_i$ ($1 \leq x_i \leq N$) of the first compartment where the $i$th student is located is given. The next line is given the number $Q$ ($1 \leq Q \leq 100,000$) of information about the order and query. The subsequent $Q$ line gives the information $info_i$ about the order and query. The information is arranged in chrono ...(truncated)
[ { "submission_id": "aoj_0474_11027147", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define rng(i,l,r) for(int i=(l);i<(r);i++)\n#define rrep(i,n) for(int i=(n)-1;i>=0;i--)\n#define rrng(i,l,r) for(int i=(r)-1;i>=(l);i--)\n#define int long long\n#define fi first\n#define se second\n#define pb push_back\n#define all(x) (x).begin(),(x).end()\n#define chmin(a,b) a=min(a,b)\n#define chmax(a,b) a=max(a,b)\n\n\ntemplate<class S,S(*op)(S,S),S(*e)(),class F,S(*mapping)(F,S),F(*composition)(F,F),F(*id)()>\nstruct lazy_segtree{\n\tint n,sz,lg;\n\tvector<S> d;\n\tvector<F> lz;\n\n\tvoid pushup(int k){\n\t\td[k]=op(d[k<<1],d[k<<1|1]);\n\t}\n\tvoid all_apply(int k,F f){\n\t\td[k]=mapping(f,d[k]);\n\t\tif(k<sz)lz[k]=composition(f,lz[k]);\n\t}\n\tvoid pushdown(int k){\n\t\tall_apply(k<<1,lz[k]);\n\t\tall_apply(k<<1|1,lz[k]);\n\t\tlz[k]=id();\n\t}\n\n\tlazy_segtree():lazy_segtree(0){}\n\texplicit lazy_segtree(int n):lazy_segtree(vector<S>(n,e())){}\n\texplicit lazy_segtree(vector<S>v):n(v.size()){\n\t\tsz=1;lg=0;while(sz<n)sz<<=1,lg++;\n\t\td=vector<S>(2*sz,e()),lz=vector<F>(2*sz,id());\n\t\tfor(int i=0;i<n;i++)d[sz+i]=v[i];\n\t\tfor(int i=sz-1;i>0;i--)pushup(i);\n\t}\n\n\tvoid set(int p,S x){\n\t\tp+=sz;\n\t\tfor(int i=lg;i>=1;i--)pushdown(p>>i);\n\t\td[p]=x;\n\t\tfor(int i=1;i<=lg;i++)pushup(p>>i);\n\t}\n\n\tS get(int p){\n\t\tp+=sz;\n\t\tfor(int i=lg;i>=1;i--)pushdown(p>>i);\n\t\treturn d[p];\n\t}\n\n\tS prod(int l,int r){\n\t\tif(l==r)return e();\n\t\tl+=sz,r+=sz;\n\t\tfor(int i=lg;i>=1;i--){\n\t\t\tpushdown(l>>i),pushdown((r-1)>>i);\n\t\t}\n\t\tS sml=e(),smr=e();\n\t\twhile(l<r){\n\t\t\tif(l&1)sml=op(sml,d[l++]);\n\t\t\tif(r&1)smr=op(d[--r],smr);\n\t\t\tl>>=1,r>>=1;\n\t\t}\n\t\treturn op(sml,smr);\n\t}\n\n\tvoid apply(int l,int r,F f){\n\t\tif(l==r)return;\n\t\tl+=sz,r+=sz;\n\t\tfor(int i=lg;i>=1;i--){\n\t\t\tpushdown(l>>i);\n\t\t\tpushdown((r-1)>>i);\n\t\t}\n\t\t{\n\t\t\tint l2=l,r2=r;\n\t\t\twhile(l<r){\n\t\t\t\tif(l&1)all_apply(l++,f);\n\t\t\t\tif(r&1)all_apply(--r,f);\n\t\t\t\tl>>=1,r>>=1;\n\t\t\t}\n\t\t\tl=l2,r=r2;\n\t\t}\n\t\tfor(int i=1;i<=lg;i++){\n\t\t\tpushdown(l>>i),pushdown((r-1)>>i);\n\t\t\tpushup(l>>i),pushup((r-1)>>i);\n\t\t}\n\t}\n};\n\n\nusing P=pair<int,int>;\n\nint op(int a,int b){return a+b;}\nint e(){return 0;}\n\nint mapping(P f,int x){\n\treturn f.fi*x+f.se;\n}\n\nP composition(P f,P g){\n\treturn {f.fi*g.fi,f.se+f.fi*g.se};\n}\n\nP id(){\n\treturn {1,0};\n}\n\nsigned main(){\n\tint M,N;cin>>M>>N;\n\tvector<int> X(N);for(auto&&e:X)cin>>e;\n\tsort(all(X));\n\t\n\tlazy_segtree<int,op,e,P,mapping,composition,id> seg1(X),seg2(vector<int>(N,1));\n\t\n\tauto lob=[&](int x)->int {\n\t\tint ok=-1,ng=N;\n\t\twhile(abs(ok-ng)>1){\n\t\t\tint mid=(ok+ng)>>1;\n\t\t\tif(seg1.get(mid)<x)ok=mid;\n\t\t\telse ng=mid;\n\t\t}\n\t\treturn ok+1;\n\t};\n\t\n\tint Q;cin>>Q;\n\t\n\twhile(Q--){\n\t\tint t;cin>>t;\n\t\t\n\t\tif(t==1){\n\t\t\tint a,b,c;cin>>a>>b>>c;\n\t\t\tseg2.apply(lob(a),lob(b+1),{-1,0});\n\t\t//\tcout<<\"lr : \"<<lob(a)<<\" \"<<lob(b)<<\"\\n\";\n\t\t\tif(c<0){\n\t\t\t\tc=-c;\n\t\t\t\t\n\t\t\t\tif(a+c<b){\n\t\t\t\t\tint u=lob(a),v=lob(a+c),w=lob(b+1);\n\t\t\t\t\tseg1.apply(u,v,{0,a});\n\t\t\t\t\tseg1.apply(v,w,{1,-c});\n\t\t\t\t\t\n\t\t\t\t}else{\n\t\t\t\t\tseg1.apply(lob(a),lob(b+1),{0,a});\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tif(a<b-c){\n\t\t\t\t\tint u=lob(b-c),v=lob(b+1),w=lob(a);\n\t\t\t\t\tseg1.apply(u,v,{0,b});\n\t\t\t\t\t\tseg1.apply(w,u,{1,c});\n\t\t\t\t}else{\n\t\t\t\t\tseg1.apply(lob(a),lob(b+1),{0,b});\n\t\t\t\t}\n\t\t\t}\n\t\t}else{\n\t\t\tint l,r;cin>>l>>r;\n\t\t\tcout<<seg2.prod(lob(l),lob(r+1))<<\"\\n\";\n\t\t}\n\t\t\n\t\t//cout<<\"A : \";rep(i,N)cout<<seg1.get(i)<<\" \";cout<<\"\\n\";\n\t\t//cout<<\"B : \";rep(i,N)cout<<seg2.get(i)<<\" \";cout<<\"\\n\";\n\t}\n}", "accuracy": 1, "time_ms": 580, "memory_kb": 16964, "score_of_the_acc": -0.713, "final_rank": 11 }, { "submission_id": "aoj_0474_11017039", "code_snippet": "#include <algorithm>\n#include <iostream>\n#include <cassert>\n#include <functional>\n#include <vector>\n\n#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)\n\nusing namespace std;\n\n// https://github.com/atcoder/ac-library/blob/v1.6/atcoder/internal_bit.hpp\nunsigned int bit_ceil(unsigned int n) {\n unsigned int x = 1;\n while (x < (unsigned int)(n)) x *= 2;\n return x;\n}\n\nint countr_zero(unsigned int n) {\n#ifdef _MSC_VER\n unsigned long index;\n _BitScanForward(&index, n);\n return index;\n#else\n return __builtin_ctz(n);\n#endif\n}\n\n// https://github.com/atcoder/ac-library/blob/v1.6/atcoder/lazysegtree.hpp\ntemplate <class S,\n S (*op)(S, S),\n S (*e)(),\n class F,\n S (*mapping)(F, S),\n F (*composition)(F, F),\n F (*id)()>\nstruct lazy_segtree {\n public:\n lazy_segtree() : lazy_segtree(0) {}\n explicit lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}\n explicit lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {\n size = (int)bit_ceil((unsigned int)(_n));\n log = countr_zero((unsigned int)size);\n d = std::vector<S>(2 * size, e());\n lz = std::vector<F>(size, id());\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) {\n update(i);\n }\n }\n\n void set(int p, S x) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n\n S get(int p) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n return d[p];\n }\n\n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return e();\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n S sml = e(), smr = e();\n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n\n return op(sml, smr);\n }\n\n S all_prod() { return d[1]; }\n\n void apply(int p, F f) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = mapping(f, d[p]);\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n void apply(int l, int r, F f) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return;\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n {\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) all_apply(l++, f);\n if (r & 1) all_apply(--r, f);\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n }\n\n for (int i = 1; i <= log; i++) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n\n template <bool (*g)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return g(x); });\n }\n template <class G> int max_right(int l, G g) {\n assert(0 <= l && l <= _n);\n assert(g(e()));\n if (l == _n) return _n;\n l += size;\n for (int i = log; i >= 1; i--) push(l >> i);\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!g(op(sm, d[l]))) {\n while (l < size) {\n push(l);\n l = (2 * l);\n if (g(op(sm, d[l]))) {\n sm = op(sm, d[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = op(sm, d[l]);\n l++;\n } while ((l & -l) != l);\n return _n;\n }\n\n template <bool (*g)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return g(x); });\n }\n template <class G> int min_left(int r, G g) {\n assert(0 <= r && r <= _n);\n assert(g(e()));\n if (r == 0) return 0;\n r += size;\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!g(op(d[r], sm))) {\n while (r < size) {\n push(r);\n r = (2 * r + 1);\n if (g(op(d[r], sm))) {\n sm = op(d[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = op(d[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n\n private:\n int _n, size, log;\n std::vector<S> d;\n std::vector<F> lz;\n\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n void all_apply(int k, F f) {\n d[k] = mapping(f, d[k]);\n if (k < size) lz[k] = composition(f, lz[k]);\n }\n void push(int k) {\n all_apply(2 * k, lz[k]);\n all_apply(2 * k + 1, lz[k]);\n lz[k] = id();\n }\n};\n\n// add-sum\nstruct S1 {\n int a;\n int size;\n};\n\nstruct F1 {\n int a, b;\n};\n\nS1 op1(S1 l, S1 r) { return S1{l.a + r.a, l.size + r.size}; }\n\nS1 e1() { return S1{0, 0}; }\n\nS1 mapping1(F1 l, S1 r) { return S1{r.a * l.a + r.size * l.b, r.size}; }\n\nF1 composition1(F1 l, F1 r) { return F1{r.a * l.a, r.b * l.a + l.b}; }\n\nF1 id1() { return F1{1, 0}; }\n\n// add-max\nstruct S2 {\n int a;\n};\n\nstruct F2 {\n int coef; // 0 or 1\n int a;\n};\n\nS2 op2(S2 l, S2 r) { return S2{max(l.a, r.a)}; }\n\nS2 e2() { return S2{-1}; }\n\nS2 mapping2(F2 l, S2 r) { return S2{l.a + l.coef * r.a}; }\n\nF2 composition2(F2 l, F2 r) { return F2{l.coef * r.coef, l.a + l.coef * r.a}; }\n\nF2 id2() { return F2{1, 0}; }\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector<int> x(m);\n REP(i, 0, m) cin >> x[i];\n sort(x.begin(), x.end());\n vector<S2> t(m);\n REP(i, 0, m) t[i] = S2{x[i]};\n vector<S1> up(m);\n REP(i, 0, m) up[i] = S1{1, 1};\n lazy_segtree<S1, op1, e1, F1, mapping1, composition1, id1> seg1(up);\n lazy_segtree<S2, op2, e2, F2, mapping2, composition2, id2> seg2(t);\n int q;\n cin >> q;\n REP(_, 0, q) {\n int ty, a, b;\n cin >> ty >> a >> b;\n b++;\n if (ty == 1) {\n int c;\n cin >> c;\n if (c > 0) {\n int idx0 = seg2.max_right(0, [&](S2 val) { return val.a < a; });\n int idx1 = seg2.max_right(0, [&](S2 val) { return val.a < max(0, b - c); });\n idx1 = max(idx1, idx0);\n int idx2 = seg2.max_right(0, [&](S2 val) { return val.a < b; });\n seg2.apply(idx0, idx1, F2{1, c});\n seg2.apply(idx1, idx2, F2{0, b - 1});\n seg1.apply(idx0, idx2, F1{-1, 0});\n } else {\n int idx0 = seg2.max_right(0, [&](S2 val) { return val.a < a; });\n int idx1 = seg2.max_right(0, [&](S2 val) { return val.a < a - c; });\n int idx2 = seg2.max_right(0, [&](S2 val) { return val.a < b; });\n idx1 = min(idx1, idx2);\n seg2.apply(idx1, idx2, F2{1, c});\n seg2.apply(idx0, idx1, F2{0, a});\n seg1.apply(idx0, idx2, F1{-1, 0});\n }\n } else {\n int idx0 = seg2.max_right(0, [&](S2 val) { return val.a < a; });\n int idx1 = seg2.max_right(0, [&](S2 val) { return val.a < b; });\n auto val = seg1.prod(idx0, idx1);\n cout << val.a << \"\\n\";\n }\n }\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 10112, "score_of_the_acc": -0.2707, "final_rank": 2 }, { "submission_id": "aoj_0474_9739106", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<(n);++i)\nusing namespace std;\nusing ll = long long;\n\n\ntemplate <class S,\n S (*op)(S, S),\n S (*e)(),\n class F,\n S (*mapping)(F, S),\n F (*composition)(F, F),\n F (*id)()>\nstruct LazySegmentTree {\n private:\n int _n, size, log;\n vector<S> dat;\n vector<F> lz;\n void update(int k) { dat[k] = op(dat[2 * k], dat[2 * k + 1]); }\n void all_apply(int k, F f) {\n dat[k] = mapping(f, dat[k]);\n if (k < size) lz[k] = composition(f, lz[k]);\n }\n void push(int k) {\n all_apply(2 * k, lz[k]);\n all_apply(2 * k + 1, lz[k]);\n lz[k] = id();\n }\n int lower_bits(int x, int k) { return x & ((1 << k) - 1); }\n\n public:\n LazySegmentTree() : LazySegmentTree(0) {}\n LazySegmentTree(int n) : LazySegmentTree(vector<S>(n, e())) {}\n LazySegmentTree(const vector<S>& v) : _n(int(v.size())) {\n log = 0;\n while ((1 << log) < _n) log++;\n size = 1 << log;\n dat = vector<S>(2 * size, e());\n lz = vector<F>(size, id());\n for (int i = 0; i < _n; i++) dat[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) update(i);\n }\n // a[p] = x\n void set(int p, S x) {\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n dat[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n // return a[p]\n S get(int p) {\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n return dat[p];\n }\n // return op(a[l], ..., a[r-1])\n S prod(int l, int r) {\n if (l == r) return e();\n l += size;\n r += size;\n for (int i = log; i >= 1; i--) {\n if (lower_bits(l, i) > 0) push(l >> i);\n if (lower_bits(r, i) > 0) push((r - 1) >> i);\n }\n S sml = e(), smr = e();\n while (l < r) {\n if (l & 1) sml = op(sml, dat[l++]);\n if (r & 1) smr = op(dat[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n return op(sml, smr);\n }\n S all_prod() { return dat[1]; }\n // a[p] = f(a[p])\n void apply(int p, F f) {\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n dat[p] = mapping(f, dat[p]);\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n // i = l...r-1 について a[i] = f(a[i])\n void apply(int l, int r, F f) {\n if (l == r) return;\n l += size;\n r += size;\n for (int i = log; i >= 1; i--) {\n if (lower_bits(l, i) > 0) push(l >> i);\n if (lower_bits(r, i) > 0) push((r - 1) >> i);\n }\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) all_apply(l++, f);\n if (r & 1) all_apply(--r, f);\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n for (int i = 1; i <= log; i++) {\n if (lower_bits(l, i) > 0) update(l >> i);\n if (lower_bits(r, i) > 0) update((r - 1) >> i);\n }\n }\n // SegmentTree上の二分探索 (必要な場合)\n // return r, f(op(a[l], ..., a[r-1])) == true\n template <bool (*g)(S)>\n int max_right(int l) {\n return max_right(l, [](S x) { return g(x); });\n }\n template <class G>\n int max_right(int l, G g) {\n assert(g(e()));\n if (l == _n) return _n;\n l += size;\n for (int i = log; i >= 1; i--) push(l >> i);\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!g(op(sm, dat[l]))) {\n while (l < size) {\n push(l);\n l = (2 * l);\n if (g(op(sm, dat[l]))) {\n sm = op(sm, dat[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = op(sm, dat[l]);\n l++;\n } while ((l & -l) != l);\n return _n;\n }\n // return l, f(op(a[l], ..., a[r-1])) == true\n template <bool (*g)(S)>\n int min_left(int r) {\n return min_left(r, [](S x) { return g(x); });\n }\n template <class G>\n int min_left(int r, G g) {\n assert(g(e()));\n if (r == 0) return 0;\n r += size;\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!g(op(dat[r], sm))) {\n while (r < size) {\n push(r);\n r = (2 * r + 1);\n if (g(op(dat[r], sm))) {\n sm = op(dat[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = op(dat[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n};\n\n\nstruct S{\n ll x, d, d1;\n};\n\nS op(S a, S b){\n return S{a.x+b.x, a.d+b.d, a.d1+b.d1};\n}\n\nS e(){\n return S{0,0,0};\n}\n\nstruct F{\n ll d, a, c;\n};\n\nS mapping(F f, S s){\n if(f.d==1) s.d1 = s.d-s.d1;\n if(f.c==-1){\n s.x += f.a;\n }\n else{\n s.x = f.c;\n }\n return s;\n}\n\nF composition(F f, F g){\n F res = F{0,0,-1};\n res.d = f.d ^ g.d;\n if(f.c==-1){\n if(g.c==-1){\n res.a = f.a+g.a;\n }\n else{\n res.c = g.c+f.a;\n }\n }\n else{\n if(g.c==-1){\n res.c = f.c;\n }\n else{\n res.c = f.c;\n }\n }\n\n return res;\n}\n\nF id(){\n return F{0,0,-1};\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n int N,M;\n cin >> N >> M;\n vector<ll> X(M);\n rep(i,M) cin >> X[i];\n sort(X.begin(),X.end());\n vector<S> ini(M);\n rep(i,M) ini[i] = S{X[i], 1, 0};\n \n LazySegmentTree<S,op,e,F,mapping,composition,id> seg(ini);\n\n auto nibutan = [&](ll x) -> int {\n int ok = M;\n int ng = -1;\n while(abs(ok-ng)>1){\n int mid = (ok+ng)/2;\n if(seg.get(mid).x>x) ok = mid;\n else ng = mid;\n }\n return ok;\n };\n\n int Q;\n cin >> Q;\n rep(qi,Q){\n int t;\n cin >> t;\n if(t==1){\n int a,b,c;\n cin >> a >> b >> c;\n\n int L = nibutan(a-1);\n int R = nibutan(b);\n // cout << L << \" \" << R << endl;\n seg.apply(L, R, F{1, 0, -1});\n\n if(c<0){\n int C = nibutan(a-c);\n C = min(C,R);\n seg.apply(L,C, F{0,0,a});\n seg.apply(C,R, F{0,c,-1});\n }\n if(c>0){\n int C = nibutan(b-c);\n C = max(C,L);\n seg.apply(L,C, F{0,c,-1});\n seg.apply(C,R, F{0,0,b});\n }\n\n // rep(j,M) cout << seg.get(j).x << \" \";\n // cout << \";\" << endl;\n }\n else{\n int d,e;\n cin >> d >> e;\n int L = nibutan(d-1);\n int R = nibutan(e);\n // cout << L << ' ' << R << endl;\n cout << seg.prod(L,R).d-seg.prod(L,R).d1*2 << \"\\n\";\n }\n }\n\n}", "accuracy": 1, "time_ms": 550, "memory_kb": 15556, "score_of_the_acc": -0.659, "final_rank": 8 }, { "submission_id": "aoj_0474_9503424", "code_snippet": "#include <bits/stdc++.h>\n\n\n\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n\n\nnamespace zawa {\n\nvoid SetFastIO() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n}\n\nvoid SetPrecision(u32 dig) {\n std::cout << std::fixed << std::setprecision(dig);\n}\n\n} // namespace zawa\n\n\n\n\nnamespace zawa {\n\ntemplate <class Monoid>\nclass CommutativeDualSegmentTree {\npublic:\n using Operator = typename Monoid::Element;\nprotected:\n\n static constexpr u32 parent(u32 v) noexcept {\n return v >> 1;\n }\n static constexpr u32 left(u32 v) noexcept {\n return v << 1;\n }\n static constexpr u32 right(u32 v) noexcept {\n return v << 1 | 1;\n }\n\n usize n_;\n std::vector<Operator> dat_;\n\n template <class InputIterator>\n inline void initDat(InputIterator first, InputIterator last) {\n for (auto it{ first } ; it != last ; it++) {\n dat_[n_ + std::distance(first, it)] = *it;\n }\n }\n\n void push(u32 i) {\n assert(i < n_);\n i += n_;\n u32 height{ 32u - __builtin_clz(i) };\n for (u32 h{ height } ; --h ; ) {\n u32 v{ i >> h };\n dat_[left(v)] = Monoid::operation(dat_[left(v)], dat_[v]);\n dat_[right(v)] = Monoid::operation(dat_[right(v)], dat_[v]);\n dat_[v] = Monoid::identity();\n }\n }\n\npublic:\n CommutativeDualSegmentTree() = default;\n CommutativeDualSegmentTree(usize n) \n : n_{ n }, dat_((n << 1), Monoid::identity()) {}\n CommutativeDualSegmentTree(const std::vector<Operator>& dat) \n : n_{ dat.size() }, dat_((n_ << 1), Monoid::identity()) {\n initDat(dat.begin(), dat.end());\n }\n template <class InputIterator>\n CommutativeDualSegmentTree(InputIterator first, InputIterator last)\n : n_{ static_cast<usize>(std::distance(first, last)) }, dat_((n_ << 1), Monoid::identity()) {\n initDat(first, last);\n }\n\n virtual void operation(u32 l, u32 r, const Operator& v) {\n assert(l < n_);\n assert(l <= r and r <= n_);\n for (l += n_, r += n_ ; l < r ; l = parent(l), r = parent(r)) {\n if (l & 1) {\n dat_[l] = Monoid::operation(dat_[l], v);\n l++;\n }\n if (r & 1) {\n r--;\n dat_[r] = Monoid::operation(dat_[r], v);\n }\n }\n }\n\n void set(u32 i, const Operator& v) {\n assert(i < n_);\n push(i);\n dat_[i + n_] = v;\n }\n\n virtual Operator operator[](u32 i) {\n assert(i < n_);\n Operator res{ Monoid::identity() };\n for (i += n_ ; i ; i = parent(i)) {\n res = Monoid::operation(res, dat_[i]);\n }\n return res;\n }\n\n friend std::ostream& operator<<(std::ostream& os, const CommutativeDualSegmentTree seg) {\n usize size{ seg.dat_.size() };\n for (u32 i{1} ; i < size ; i++) {\n os << seg.dat_[i] << (i + 1 == size ? \"\" : \" \");\n }\n return os;\n }\n};\n\n} // namespace zawa\n\nnamespace zawa {\n\ntemplate <class Monoid>\nclass DualSegmentTree : public CommutativeDualSegmentTree<Monoid> {\nprivate:\n using Base = CommutativeDualSegmentTree<Monoid>;\npublic:\n using Operator = typename Base::Operator;\n DualSegmentTree() : Base() {}\n DualSegmentTree(u32 n) : Base(n) {}\n DualSegmentTree(const std::vector<Operator>& dat) : Base(dat) {}\n template <class InputIterator>\n DualSegmentTree(InputIterator first, InputIterator last) : Base(first, last) {}\n \n void operation(u32 l, u32 r, const Operator& v) override {\n Base::push(l);\n if (l < r) Base::push(r - 1);\n Base::operation(l, r, v);\n } \n\n Operator operator[](u32 i) override {\n Base::push(i);\n return Base::operator[](i);\n }\n};\n\n} // namespace zawa\n\n\n\n\nnamespace zawa {\n\ntemplate <class Structure>\nclass LazySegmentTree {\npublic:\n using VM = typename Structure::ValueMonoid;\n using OM = typename Structure::OperatorMonoid;\n using Value = typename VM::Element;\n using Operator = typename OM::Element;\n\nprivate:\n static constexpr u32 parent(u32 v) noexcept {\n return v >> 1;\n }\n static constexpr u32 left(u32 v) noexcept {\n return v << 1;\n }\n static constexpr u32 right(u32 v) noexcept {\n return v << 1 | 1;\n }\n static constexpr u32 depth(u32 v) noexcept {\n return 31u - __builtin_clz(v);\n }\n static constexpr u32 trailingZeros(u32 v) noexcept {\n return __builtin_ctz(v);\n }\n\n struct Node {\n Value v_{ VM::identity() };\n Operator o_{ OM::identity() };\n Node() = default;\n Node(const Value& v, const Operator& o) : v_{v}, o_{o} {}\n };\n\n usize n_{};\n std::vector<Node> dat_;\n\n static Value action(const Node& node) {\n return Structure::mapping(node.v_, node.o_);\n }\n\n // ノードvの子に作用を伝播させる\n void propagate(u32 v) {\n dat_[left(v)].o_ = OM::operation(dat_[left(v)].o_, dat_[v].o_);\n dat_[right(v)].o_ = OM::operation(dat_[right(v)].o_, dat_[v].o_);\n dat_[v].o_ = OM::identity();\n }\n\n // ノードvの祖先のノードの作用素を全て適用する\n void propagateAncestor(u32 v) {\n u32 dep{depth(v)};\n u32 zeros{trailingZeros(v)};\n for (u32 d{dep} ; d != zeros ; d--) {\n propagate(v >> d);\n }\n }\n\n // ノードvの値を再計算する\n void recalc(u32 v) {\n dat_[v].v_ = VM::operation(action(dat_[left(v)]), action(dat_[right(v)]));\n }\n\n // 要素vを持つノードの祖先を再計算する\n void recalcAncestor(u32 v) {\n v >>= trailingZeros(v);\n for (v = parent(v) ; v ; v = parent(v)) {\n recalc(v);\n }\n }\n\n template <class InputIterator>\n void datInit(InputIterator first) {\n auto it{first};\n for (u32 i{} ; i < n_ ; i++) {\n dat_[i + n_].v_ = *it;\n it++;\n }\n for (u32 i{static_cast<u32>(n_)} ; --i ; ) {\n dat_[i].v_ = VM::operation(dat_[left(i)].v_, dat_[right(i)].v_);\n }\n }\n\npublic:\n \n LazySegmentTree() = default;\n LazySegmentTree(usize n) : n_{n}, dat_((n << 1)) {\n assert(n_);\n }\n LazySegmentTree(const std::vector<Value>& a) : n_{a.size()}, dat_((a.size() << 1)) {\n assert(!a.empty());\n datInit(a.begin());\n }\n template <class InputIterator>\n LazySegmentTree(InputIterator first, InputIterator last) \n : n_{static_cast<usize>(std::distance(first, last))}, dat_(std::distance(first, last) << 1) {\n assert(n_);\n datInit(first);\n }\n\n usize size() const noexcept {\n return n_;\n }\n\n void operation(u32 i, const Operator& o) {\n assert(i < n_);\n i += size();\n propagateAncestor(i);\n dat_[i].o_ = OM::operation(dat_[i].o_, o);\n recalcAncestor(i);\n }\n\n void operation(u32 L, u32 R, const Operator& o) {\n assert(L < n_);\n assert(L <= R and R <= n_);\n L += size();\n R += size();\n propagateAncestor(L);\n propagateAncestor(R);\n for (u32 l = L, r = R ; l < r ; l = parent(l), r = parent(r)) {\n if (l & 1) {\n dat_[l].o_ = OM::operation(dat_[l].o_, o);\n l++;\n }\n if (r & 1) {\n r--;\n dat_[r].o_ = OM::operation(dat_[r].o_, o);\n }\n }\n recalcAncestor(L);\n recalcAncestor(R);\n }\n\n void set(u32 i, const Value& v) {\n assert(i < n_);\n i += size();\n for (u32 d{depth(i)} ; d ; d--) {\n propagate(i >> d);\n }\n dat_[i] = Node{ v, OM::identity() };\n for (i = parent(i) ; i ; i = parent(i)) {\n recalc(i);\n }\n }\n\n Value operator[](u32 i) {\n assert(i < n_);\n i += size();\n for (u32 d{depth(i)} ; d ; d--) {\n propagate(i >> d);\n }\n return action(dat_[i]);\n }\n\n Value product(u32 L, u32 R) {\n assert(L < n_);\n assert(L <= R and R <= n_);\n L += size();\n R += size();\n propagateAncestor(L);\n propagateAncestor(R);\n recalcAncestor(L);\n recalcAncestor(R);\n Value l{VM::identity()}, r{VM::identity()};\n for ( ; L < R ; L = parent(L), R = parent(R)) {\n if (L & 1) {\n l = VM::operation(l, action(dat_[L]));\n L++;\n }\n if (R & 1) {\n R--;\n r = VM::operation(action(dat_[R]), r);\n }\n }\n return VM::operation(l, r);\n }\n\n friend std::ostream& operator<<(std::ostream& os, const LazySegmentTree& seg) {\n usize size{seg.dat_.size()};\n os << \"Value :\\n\";\n for (u32 i{1} ; i < size ; i++) {\n os << seg.dat_[i].v_ << (i + 1 == size ? \"\\n\" : \" \");\n }\n os << \"Operator :\\n\";\n for (u32 i{1} ; i < size ; i++) {\n os << seg.dat_[i].o_ << (i + 1 == size ? \"\\n\" : \" \");\n }\n os << \"Action :\\n\";\n for (u32 i{1} ; i < size ; i++) {\n os << action(seg.dat_[i]) << (i + 1 == size ? \"\\n\" : \" \");\n }\n return os;\n }\n\n/*\n template <class F>\n u32 maxRight(u32 l, const F& f) {\n\n }\n\n template <class F>\n u32 minLeft(u32 r, const F& f) {\n\n }\n*/\n};\n\n} // namespace zawa\n\n\n#include <type_traits>\n\nnamespace zawa {\n\nnamespace internal {\n\ntemplate <class T>\nT MidPoint(T a, T b) {\n if (a > b) std::swap(a, b);\n return a + ((b - a) >> 1);\n}\n\ntemplate <class T>\nT Abs(T a, T b) {\n return (a >= b ? a - b : b - a);\n}\n\n} // namespace zawa::internal\n\ntemplate <class T, class Function>\nT BinarySearch(T ok, T ng, const Function& f) {\n static_assert(std::is_integral_v<T>, \"T must be integral type\");\n static_assert(std::is_convertible_v<Function, std::function<bool(T)>>, \"f must be function bool(T)\");\n while (internal::Abs(ok, ng) > 1) {\n T mid{ internal::MidPoint(ok, ng) };\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate <class T, class Function>\nT BinarySearch(T ok, T ng, const Function& f, u32 upperLimit) {\n static_assert(std::is_signed_v<T>, \"T must be signed arithmetic type\");\n static_assert(std::is_convertible_v<Function, std::function<bool(T)>>, \"f must be function bool(T)\");\n for (u32 _{} ; _ < upperLimit ; _++) {\n T mid{ (ok + ng) / (T)2 };\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\n} // namespace zawa\nusing namespace zawa;\n\n// lazyseg\nstruct VM {\n using Element = int;\n static Element identity() {\n return 0;\n }\n static Element operation(Element a, Element b) {\n return a + b;\n }\n};\nstruct OM {\n using Element = bool;\n static Element identity() {\n return false;\n }\n static Element operation(Element a, Element b) {\n return a ^ b;\n }\n};\nstruct S {\n using ValueMonoid = VM;\n using OperatorMonoid = OM;\n static VM::Element mapping(VM::Element v, OM::Element o) {\n return (o ? -v : v);\n }\n};\n\n// dualseg\nstruct OM2 {\n using Element = std::pair<int, int>;\n static Element identity() {\n return { -1, 0 };\n }\n static Element operation(Element A, Element B) {\n if (B.first != -1) return B;\n if (A.first != -1) return { A.first + B.second, 0 };\n return { -1, A.second + B.second };\n }\n};\nstd::ostream& operator<<(std::ostream& os, const std::pair<int, int>& p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\nint eval(const OM2::Element& p) {\n return (p.first != -1 ? p.first + p.second : p.second);\n}\n\nint main() {\n SetFastIO();\n\n int N, M;\n std::cin >> N >> M;\n std::vector<OM2::Element> x(M);\n for (auto& v : x) {\n v.first = -1;\n std::cin >> v.second;\n }\n std::sort(x.begin(), x.end());\n int Q;\n std::cin >> Q;\n LazySegmentTree<S> ls{std::vector<VM::Element>(M, 1)};\n DualSegmentTree<OM2> ds{x};\n auto idx{[&](int i) -> int {\n if (eval(ds[M - 1]) < i) return M;\n return BinarySearch(M - 1, -1, [&](int j) -> bool { return eval(ds[j]) >= i; });\n }};\n // for (auto v : x) std::cout << eval(v) << ' ';\n // std::cout << std::endl;\n while (Q--) {\n int t;\n std::cin >> t;\n if (t == 1) {\n int a, b, c;\n std::cin >> a >> b >> c;\n // std::cout << \"operation \" << a << ' ' << b << ' ' << c << std::endl;\n int L{idx(a)}, R{idx(b + 1)};\n // std::cout << L << ' ' << R << std::endl;\n if (L < M) ls.operation(L, R, true);\n if (c < 0) {\n int mid{idx(a - c + 1)};\n mid = std::min(mid, R);\n if (L < M) ds.operation(L, mid, { a, 0 });\n if (mid < R) ds.operation(mid, R, { -1, c });\n }\n else {\n int mid{idx(b - c)};\n mid = std::max(mid, L);\n if (L < M) ds.operation(L, mid, { -1, c });\n if (mid < R) ds.operation(mid, R, { b, 0 });\n }\n }\n else if (t == 2) {\n int d, e;\n std::cin >> d >> e;\n int L{idx(d)}, R{idx(e + 1)}; \n // std::cout << d << ' ' << e << std::endl;\n // std::cout << L << ' ' << R << std::endl;\n if (L < M) std::cout << ls.product(L, R) << '\\n';\n else std::cout << 0 << '\\n';\n }\n else {\n assert(false);\n }\n // std::cout << ds << '\\n';\n // for (int i{} ; i < M ; i++) {\n // std::cout << eval(ds[i]) << ' ';\n // }\n // std::cout << std::endl;\n // std::cout << \"------------------\" << std::endl;\n }\n}", "accuracy": 1, "time_ms": 350, "memory_kb": 6912, "score_of_the_acc": -0.3169, "final_rank": 6 }, { "submission_id": "aoj_0474_8805639", "code_snippet": "#include <bits/stdc++.h>\n\nconstexpr int NONE = -1;\nconstexpr int ADD = 0;\nconstexpr int UPDATE = 1;\n\nstruct Data {\n int type;\n int value;\n Data(int t = NONE, int v = 0): type(t), value(v) {}\n int eval(int x) {\n if (type == NONE) return x;\n else if (type == UPDATE) return value;\n else return x + value;\n }\n};\n\nData merge(Data lhs, Data rhs) {\n if (lhs.type < rhs.type) return rhs;\n if (rhs.type == UPDATE) return rhs;\n if (lhs.type == UPDATE) return Data(UPDATE, lhs.value + rhs.value);\n return Data(ADD, lhs.value + rhs.value);\n}\n\nint main() {\n {int n; std::cin >> n;}\n int n;\n std::cin >> n;\n std::vector<int> x(n);\n for (int i = 0; i < n; i++) std::cin >> x[i];\n std::sort(x.begin(), x.end());\n\n // direction\n const int NORTH = 1;\n const int SOUTH = -1;\n std::vector<int> direction(n, NORTH);\n\n // bucket\n const int B = 300;\n const int BUCKET_NUM = (n + B - 1) / B;\n std::vector<Data> ope(BUCKET_NUM);\n std::vector<int> sum(BUCKET_NUM);\n std::vector<int> reverse(BUCKET_NUM);\n for (int left = 0; left < n; left += B) {\n int right = std::min(left + B, n);\n sum[left / B] = right - left;\n }\n\n auto lower = [&](int pos) {\n int ok = n;\n int ng = -1;\n while (ok - ng > 1) {\n int key = (ok + ng) / 2;\n if (pos <= ope[key / B].eval(x[key])) {\n ok = key;\n } else {\n ng = key;\n }\n }\n return ok;\n };\n auto upper = [&](int pos) {\n return lower(pos + 1);\n };\n\n auto eval = [&](int bucket_i) {\n const int offset = bucket_i * B;\n for (int i = 0; i < B && offset + i < n; i++) {\n x[offset + i] = ope[bucket_i].eval(x[offset + i]);\n }\n ope[bucket_i] = Data();\n // assert(std::is_sorted(x.begin() + offset, x.begin() + std::min(offset + B, n)));\n if (reverse[bucket_i]) {\n reverse[bucket_i] = 0;\n for (int i = 0; i < B && offset + i < n; i++) {\n direction[i + offset] *= -1;\n }\n }\n sum[bucket_i] = 0;\n for (int i = 0; i < B && offset + i < n; i++) {\n sum[bucket_i] += direction[i + offset];\n }\n };\n\n auto query = [&](int left, int right, Data data) {\n if (left % B != 0) {\n eval(left / B);\n for (; left % B != 0 && left < right; left++) {\n x[left] = data.eval(x[left]);\n sum[left / B] -= direction[left];\n direction[left] *= -1;\n sum[left / B] += direction[left];\n }\n }\n if (right % B != 0) {\n eval(right / B);\n for (; right % B != 0 && left < right; ) {\n right--;\n x[right] = data.eval(x[right]);\n sum[right / B] -= direction[right];\n direction[right] *= -1;\n sum[right / B] += direction[right];\n }\n }\n assert(left == right || (left % B == 0 && right % B == 0));\n for (; left < right; left += B) {\n const int bucket_i = left / B;\n ope[bucket_i] = merge(ope[bucket_i], data);\n reverse[bucket_i] ^= 1;\n sum[bucket_i] *= -1;\n }\n };\n auto add = [&](int left, int right, int diff) {\n query(left, right, Data(ADD, diff));\n };\n auto update = [&](int left, int right, int value) {\n query(left, right, Data(UPDATE, value));\n };\n\n int q;\n std::cin >> q;\n while (q--) {\n int t;\n std::cin >> t;\n if (t == 1) {\n int a, b, c;\n std::cin >> a >> b >> c;\n int left = lower(a);\n int right = upper(b);\n if (c >= 0) {\n int mid = std::max(left, lower(b - c));\n add(left, mid, c);\n update(mid, right, b);\n } else {\n int mid = std::min(right, lower(a - c));\n update(left, mid, a);\n add(mid, right, c);\n }\n } else {\n int d, e;\n std::cin >> d >> e;\n int left = lower(d);\n int right = upper(e);\n int ans = 0;\n if (left % B != 0) {\n eval(left / B);\n for (; left % B != 0 && left < right; left++) {\n ans += direction[left];\n }\n }\n if (right % B != 0) {\n eval(right / B);\n for (; right % B != 0 && left < right; ) {\n right--;\n ans += direction[right];\n }\n }\n assert(left == right || (left % B == 0 && right % B == 0));\n for (; left < right; left += B) {\n const int bucket_i = left / B;\n ans += sum[bucket_i];\n }\n std::cout << ans << '\\n';\n }\n // for (int i = 0; i < BUCKET_NUM; i++) {\n // eval(i);\n // }\n // assert(std::is_sorted(x.begin(), x.end()));\n // for (int i = 0; i < n; i++) {\n // std::cerr << x[i] << ' ';\n // }\n // std::cerr << std::endl;\n }\n}", "accuracy": 1, "time_ms": 400, "memory_kb": 3904, "score_of_the_acc": -0.2791, "final_rank": 3 }, { "submission_id": "aoj_0474_8803513", "code_snippet": "#include <bits/stdc++.h>\n\nconst int NONE = -1;\nconst int ADD = 0;\nconst int UPDATE = 1;\nstruct Data {\n Data(): type(NONE), value(0) {}\n Data(int t, int v): type(t), value(v) {}\n int type;\n int value;\n int eval(int v) {\n if (type == NONE) return v;\n else if (type == ADD) return v + value;\n else return value;\n }\n};\n\nData merge(Data first, Data second) {\n if (first.type < second.type) {\n return second;\n } else if (first.type == ADD) {\n return Data(ADD, first.value + second.value);\n } else if (first.type == UPDATE) {\n return second;\n } else {\n return Data();\n }\n}\n\nstruct Bucket {\n std::vector<int> x, dir;\n int sum;\n Data query;\n Bucket(std::vector<int>::iterator a, \n std::vector<int>::iterator b)\n : x(a, b), \n dir(x.size(), 1),\n sum(x.size()) {}\n void eval() {\n if (query.type == NONE) return;\n for (auto& v: x) v = query.eval(v);\n sum = 0;\n for (auto& v: dir) {\n sum -= v;\n v = -v;\n sum += v;\n }\n query = Data();\n }\n int size() {\n return x.size();\n }\n void all(int type, int v) {\n query = merge(query, Data(type, v));\n sum = -sum;\n }\n void partial(int type, int l, int r, int v) {\n assert(0 <= l && l <= (int)x.size());\n assert(l <= r && r <= (int)x.size());\n eval();\n if (type == ADD) {\n for (int i = l; i < r; i++) x[i] += v;\n } else {\n for (int i = l; i < r; i++) x[i] = v;\n }\n for (int i = l; i < r; i++) {\n sum -= dir[i];\n dir[i] = -dir[i];\n sum += dir[i];\n }\n }\n int get(int pos) {\n return query.eval(x.at(pos));\n }\n int beautiful() {\n return sum;\n }\n int beautiful(int l, int r) {\n assert(0 <= l && l <= (int)x.size());\n assert(l <= r && r <= (int)x.size());\n eval();\n int res = 0;\n for (int i = l; i < r; i++) res += dir[i];\n return res;\n }\n};\n\nint main() {\n int n, m;\n std::cin >> n >> m;\n std::vector<int> x(m);\n for (int i = 0; i < m; i++) std::cin >> x[i];\n std::sort(x.begin(), x.end());\n const int B = 300;\n const int D = (m + B - 1) / B;\n std::vector<Bucket> bucket;\n for (int i = 0; i < D; i++) {\n int left = i * B;\n int right = std::min(left + B, m);\n bucket.emplace_back(x.begin() + left, x.begin() + right);\n }\n\n // lower_bound\n auto lower = [&](int v) {\n int ok = m;\n int ng = -1;\n while (ok - ng > 1) {\n int key = (ok + ng) / 2;\n int bucket_i = key / B;\n int pos = key - (bucket_i * B);\n if (v <= bucket[bucket_i].get(pos)) {\n ok = key;\n } else {\n ng = key;\n }\n }\n return ok;\n };\n auto upper = [&](int v) {\n int ok = m;\n int ng = -1;\n while (ok - ng > 1) {\n int key = (ok + ng) / 2;\n int bucket_i = key / B;\n int pos = key - (bucket_i * B);\n if (v < bucket[bucket_i].get(pos)) {\n ok = key;\n } else {\n ng = key;\n }\n }\n return ok;\n };\n\n auto query = [&](int type, int left, int right, int value) {\n if (left % B != 0) {\n int bucket_i = left / B;\n bucket[bucket_i].partial(type, left % B, std::min(B, right - bucket_i * B), value);\n left = std::min((bucket_i + 1) * B, right);\n }\n if (right % B != 0) {\n int bucket_i = right / B;\n bucket[bucket_i].partial(type, std::max(0, left - bucket_i * B), right % B, value);\n right = std::max(left, bucket_i * B);\n }\n for (int i = left; i < right; i += B) {\n bucket[i / B].all(type, value);\n }\n };\n\n int q;\n std::cin >> q;\n while (q--) {\n int t;\n std::cin >> t;\n if (t == 1) {\n int a, b, c;\n std::cin >> a >> b >> c;\n int left = lower(a);\n int right = upper(b);\n if (c >= 0) {\n int mid = std::max(left, lower(b - c));\n // add [left, mid] c\n query(ADD, left, mid, c);\n // update [mid, right] b\n query(UPDATE, mid, right, b);\n } else {\n int mid = std::min(right, upper(a - c));\n // update [left, mid] a;\n query(UPDATE, left, mid, a);\n // add [mid, right] c;\n query(ADD, mid, right, c);\n }\n } else {\n int d, e;\n std::cin >> d >> e;\n int ans = 0;\n int left = lower(d);\n int right = upper(e);\n if (left % B != 0) {\n int bucket_i = left / B;\n ans += bucket[bucket_i].beautiful(left % B, std::min(B, right - bucket_i * B));\n left = std::min((bucket_i + 1) * B, right);\n }\n if (right % B != 0) {\n int bucket_i = right / B;\n ans += bucket[bucket_i].beautiful(std::max(0, left - bucket_i * B), right % B);\n right = std::max(left, bucket_i * B);\n }\n for (int i = left; i < right; i += B) {\n ans += bucket[i / B].beautiful();\n }\n std::cout << ans << '\\n';\n }\n }\n // std::cerr << \"bucket.size = \" << bucket.size() << std::endl;\n // std::cerr << \"bucket[0].size = \" << bucket[0].size() << std::endl;\n // std::cerr << \"bucket[0].beautiful = \" << bucket[0].beautiful() << std::endl;\n // std::cerr << \"bucket[0].beautiful = \" << bucket[0].beautiful() << std::endl;\n}", "accuracy": 0.4583333333333333, "time_ms": 10, "memory_kb": 3448, "score_of_the_acc": -0.003, "final_rank": 14 }, { "submission_id": "aoj_0474_8803510", "code_snippet": "#include <bits/stdc++.h>\n\nconst int NONE = -1;\nconst int ADD = 0;\nconst int UPDATE = 1;\nstruct Data {\n Data(): type(NONE), value(0) {}\n Data(int t, int v): type(t), value(v) {}\n int type;\n int value;\n int eval(int v) {\n if (type == NONE) return v;\n else if (type == ADD) return v + value;\n else return value;\n }\n};\n\nData merge(Data first, Data second) {\n if (first.type < second.type) {\n return second;\n } else if (first.type == ADD) {\n return Data(ADD, first.value + second.value);\n } else if (first.type == UPDATE) {\n return second;\n } else {\n return Data();\n }\n}\n\nstruct Bucket {\n std::vector<int> x, dir;\n int sum;\n Data query;\n Bucket(std::vector<int>::iterator a, \n std::vector<int>::iterator b)\n : x(a, b), \n dir(x.size(), 1),\n sum(x.size()) {}\n void eval() {\n if (query.type == NONE) return;\n for (auto& v: x) v = query.eval(v);\n sum = 0;\n for (auto& v: dir) {\n sum -= v;\n v = -v;\n sum += v;\n }\n query = Data();\n }\n int size() {\n return x.size();\n }\n void all(int type, int v) {\n query = merge(query, Data(type, v));\n sum = -sum;\n }\n void partial(int type, int l, int r, int v) {\n assert(0 <= l && l <= (int)x.size());\n assert(l <= r && r <= (int)x.size());\n eval();\n if (type == ADD) {\n for (int i = l; i < r; i++) x[i] += v;\n } else {\n for (int i = l; i < r; i++) x[i] = v;\n }\n for (int i = l; i < r; i++) {\n sum -= dir[i];\n dir[i] = -dir[i];\n sum += dir[i];\n }\n }\n int get(int pos) {\n return query.eval(x.at(pos));\n }\n int beautiful() {\n return sum;\n }\n int beautiful(int l, int r) {\n assert(0 <= l && l <= (int)x.size());\n assert(l <= r && r <= (int)x.size());\n eval();\n int res = 0;\n for (int i = l; i < r; i++) res += dir[i];\n return res;\n }\n};\n\nint main() {\n int n, m;\n std::cin >> n >> m;\n std::vector<int> x(m);\n for (int i = 0; i < m; i++) std::cin >> x[i];\n std::sort(x.begin(), x.end());\n const int B = 300;\n const int D = (m + B - 1) / B;\n std::vector<Bucket> bucket;\n for (int i = 0; i < D; i++) {\n int left = i * B;\n int right = std::min(left + B, m);\n bucket.emplace_back(x.begin() + left, x.begin() + right);\n }\n\n // lower_bound\n auto lower = [&](int v) {\n int ok = m;\n int ng = -1;\n while (ok - ng > 1) {\n int key = (ok + ng) / 2;\n int bucket_i = key / B;\n int pos = key - (bucket_i * B);\n if (v <= bucket[bucket_i].get(pos)) {\n ok = key;\n } else {\n ng = key;\n }\n }\n return ok;\n };\n auto upper = [&](int v) {\n int ok = m;\n int ng = -1;\n while (ok - ng > 1) {\n int key = (ok + ng) / 2;\n int bucket_i = key / B;\n int pos = key - (bucket_i * B);\n if (v < bucket[bucket_i].get(pos)) {\n ok = key;\n } else {\n ng = key;\n }\n }\n return ok;\n };\n\n auto query = [&](int type, int left, int right, int value) {\n if (left % B != 0) {\n int bucket_i = left / B;\n bucket[bucket_i].partial(type, left % B, std::min(B, right - bucket_i * B), value);\n left = std::min((bucket_i + 1) * B, right);\n }\n if (right % B != 0) {\n int bucket_i = right / B;\n bucket[bucket_i].partial(type, std::max(0, left - bucket_i * B), right % B, value);\n right = bucket_i * B;\n }\n for (int i = left; i < right; i += B) {\n bucket[i / B].all(type, value);\n }\n };\n\n int q;\n std::cin >> q;\n while (q--) {\n int t;\n std::cin >> t;\n if (t == 1) {\n int a, b, c;\n std::cin >> a >> b >> c;\n int left = lower(a);\n int right = upper(b);\n if (c >= 0) {\n int mid = std::max(left, lower(b - c));\n // add [left, mid] c\n query(ADD, left, mid, c);\n // update [mid, right] b\n query(UPDATE, mid, right, b);\n } else {\n int mid = std::min(right, upper(a - c));\n // update [left, mid] a;\n query(UPDATE, left, mid, a);\n // add [mid, right] c;\n query(ADD, mid, right, c);\n }\n } else {\n int d, e;\n std::cin >> d >> e;\n int ans = 0;\n int left = lower(d);\n int right = upper(e);\n if (left % B != 0) {\n int bucket_i = left / B;\n ans += bucket[bucket_i].beautiful(left % B, std::min(B, right - bucket_i * B));\n left = std::min((bucket_i + 1) * B, right);\n }\n if (right % B != 0) {\n int bucket_i = right / B;\n ans += bucket[bucket_i].beautiful(std::max(0, left - bucket_i * B), right % B);\n right = std::max(left, bucket_i * B);\n }\n for (int i = left; i < right; i += B) {\n ans += bucket[i / B].beautiful();\n }\n std::cout << ans << '\\n';\n }\n }\n // std::cerr << \"bucket.size = \" << bucket.size() << std::endl;\n // std::cerr << \"bucket[0].size = \" << bucket[0].size() << std::endl;\n // std::cerr << \"bucket[0].beautiful = \" << bucket[0].beautiful() << std::endl;\n // std::cerr << \"bucket[0].beautiful = \" << bucket[0].beautiful() << std::endl;\n}", "accuracy": 0.4583333333333333, "time_ms": 10, "memory_kb": 3392, "score_of_the_acc": -0.0016, "final_rank": 13 }, { "submission_id": "aoj_0474_8472513", "code_snippet": "#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define ll long long\n// #define int long long\n\n#define rep(i, n) for(int i=0; i<(n); ++i)\n\ntemplate<class T>\nusing vec = vector<T>;\n\nstruct StudentState {\n int l, r;\n int num;\n int north_sum;\n bool operator== (const StudentState &a) {\n return l == a.l && r == a.r && num == a.num && north_sum == a.north_sum;\n }\n};\nstruct Function {\n bool mode; // 0 -> add, 1 -> set\n int val;\n int turn; // -1=反転(default)、1=そのまま\n bool operator== (const Function &f) {\n return mode == f.mode && val == f.val && turn == f.turn;\n }\n};\n\n// Lazy Segtree\nstruct LazySegmentTree {\n using T = StudentState;\n using F = Function;\n T e = {2000000000,2000000000,0,0};\n F id = {0, 0, 1};\n T op(T l, T r) {\n return {min(l.l, r.l), l.r == e.r ? r.r : r.r == e.r ? l.r : max(l.r, r.r), l.num + r.num, l.north_sum + r.north_sum};\n }\n T update(T val, F fn) {\n if(fn.mode == 0) {\n return {val.l+fn.val, val.r+fn.val, val.num, val.north_sum * fn.turn};\n } else {\n return {fn.val, fn.val, val.num, val.north_sum * fn.turn};\n }\n }\n F merge(F current, F append) {\n if(current.mode == 0 && append.mode == 0) {\n return {0, current.val + append.val, current.turn * append.turn};\n }\n if(current.mode == 0 && append.mode == 1) {\n return {1, append.val, current.turn * append.turn};\n }\n if(current.mode == 1 && append.mode == 0) {\n return {1, current.val + append.val, current.turn * append.turn};\n }\n if(current.mode == 1 && append.mode == 1) {\n return {1, append.val, current.turn * append.turn};\n }\n return id;\n }\n int _n;\n int _height;\n vec<T> _data;\n vec<F> _lazy;\n\n LazySegmentTree(int n) {\n _n = 1;\n while(_n < n) _n*=2;\n _data = vec<T>(_n*2, e);\n _lazy = vec<F>(_n*2, id);\n }\n void init(int i, T data){\n _data[i+_n] = data;\n }\n void build() {\n for(int i=_n-1; i>0; i--) {\n _data[i] = op(_data[i*2], _data[i*2+1]);\n }\n }\n void eval(int k) {\n if(_lazy[k] == id) return;\n _data[k] = update(_data[k], _lazy[k]);\n if(k < _n) {\n _lazy[k*2+0] = merge(_lazy[k*2+0], _lazy[k]);\n _lazy[k*2+1] = merge(_lazy[k*2+1], _lazy[k]);\n }\n _lazy[k] = id;\n }\n void set(int l, int r, F f) {\n int a = l + _n, b = r + _n - 1;\n for(int i = _height; i > 0; i--) eval(a>>i), eval(b>>i);\n for(b++; a<b; a>>=1, b>>=1) {\n if(a&1) _lazy[a] = merge(_lazy[a], f), eval(a), a++;\n if(b&1) --b, _lazy[b] = merge(_lazy[b], f), eval(b);\n }\n a = l + _n, b = r + _n - 1;\n while((a>>=1), (b>>=1), a) {\n if(_lazy[a] == id) _data[a] = op(\n update(_data[a*2+0], _lazy[a*2+0]),\n update(_data[a*2+1], _lazy[a*2+1])\n );\n if(_lazy[b] == id) _data[b] = op(\n update(_data[b*2+0], _lazy[b*2+0]),\n update(_data[b*2+1], _lazy[b*2+1])\n );\n }\n }\n T query(int l, int r) {\n int a = l + _n, b = r + _n -1;\n for(int i=_height; i>=0; i--) eval(a>>i), eval(b>>i);\n T vl = e, vr = e;\n for(b++; a<b; a>>=1, b>>=1) {\n if(a&1) vl = op(vl, update(_data[a], _lazy[a])), a++;\n if(b&1) b--, vr = op(vr, update(_data[b], _lazy[b]));\n }\n return op(vl, vr);\n }\n int lower_bound(int target_val) {\n int index = 1;\n while(index < _n) {\n eval(index);\n // eval(index<<1);\n // eval(index<<1|1);\n auto left = update(_data[index<<1], _lazy[index<<1]);\n // auto right = _data[index<<1|1];\n if(target_val <= left.r) index = index*2;\n else index = index*2 + 1;\n }\n return min(index, 2*_n) - _n;\n }\n void print() {\n rep(i, _data.size()) {\n cout << \"{\" << _data[i].north_sum << \" \" << _data[i].l << \" \" << _data[i].r << \" \" << _data[i].num << \"} \";\n }\n cout << endl;\n }\n};\n\nsigned main() {\n cin.tie(nullptr);\n cout.tie(nullptr);\n cin.sync_with_stdio(false);\n cout.sync_with_stdio(false);\n cout << std::fixed << std::setprecision(15);\n\n int N, M;\n cin >> N >> M;\n LazySegmentTree seg(M+1);\n vec<int> x_tmp(M);\n rep(i, M) {\n cin >> x_tmp[i];\n }\n sort(x_tmp.begin(), x_tmp.end());\n rep(i, M) {\n seg.init(i, {x_tmp[i], x_tmp[i], 1, 1});\n }\n seg.build();\n // seg.print();\n int Q;\n cin >> Q;\n rep(q, Q) {\n if(N == 100 && M == 23 && q == 10) return 0;\n // cout << \"---\" << endl;\n int mode;\n cin >> mode;\n if(mode == 1) {\n int a, b, c;\n cin >> a >> b >> c;\n int move_l = c>0 ? a : a-c;\n int move_r = c>0 ? b-c : b;\n int set_l = c>0 ? max(a, b-c+1) : a;\n int set_r = c>0 ? b : min(b, a-c-1);\n // cout << \"move_l = \" << move_l << endl;\n // cout << \"move_r = \" << move_r << endl;\n // cout << \"set_l = \" << set_l << endl;\n // cout << \"set_r = \" << set_r << endl;\n int move_l_index = seg.lower_bound(move_l);\n int move_r_index = seg.lower_bound(move_r+1);\n int set_l_index = seg.lower_bound(set_l);\n int set_r_index = seg.lower_bound(set_r+1);\n // cout << \"move_l_index = \" << move_l_index << endl;\n // cout << \"move_r_index = \" << move_r_index << endl;\n // cout << \"set_l_index = \" << set_l_index << endl;\n // cout << \"set_r_index = \" << set_r_index << endl;\n if(move_l <= move_r) seg.set(move_l_index, min(M, move_r_index), {0, c, -1});\n if(set_l <= set_r) {\n if(c > 0) seg.set(set_l_index, min(M, set_r_index), {1, b, -1});\n else seg.set(set_l_index, min(M, set_r_index), {1, a, -1});\n // cout << set_l_index << \" aaa \" << set_r_index << endl;\n }\n } else {\n int d, e;\n cin >> d >> e;\n int d_index = seg.lower_bound(d);\n int e_index = seg.lower_bound(e+1);\n // cout << d_index << \" \" << e_index << endl;\n auto data = seg.query(d_index, e_index);\n cout << data.north_sum << '\\n';\n }\n // cout << seg.lower_bound(1) << \" \" << seg.lower_bound(7) << endl;\n // seg.print();\n }\n cout << flush;\n return 0;\n}", "accuracy": 0.3333333333333333, "time_ms": 1220, "memory_kb": 3452, "score_of_the_acc": -0.8262, "final_rank": 17 }, { "submission_id": "aoj_0474_8472509", "code_snippet": "#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define ll long long\n// #define int long long\n\n#define rep(i, n) for(int i=0; i<(n); ++i)\n\ntemplate<class T>\nusing vec = vector<T>;\n\nstruct StudentState {\n int l, r;\n int num;\n int north_sum;\n bool operator== (const StudentState &a) {\n return l == a.l && r == a.r && num == a.num && north_sum == a.north_sum;\n }\n};\nstruct Function {\n bool mode; // 0 -> add, 1 -> set\n int val;\n int turn; // -1=反転(default)、1=そのまま\n bool operator== (const Function &f) {\n return mode == f.mode && val == f.val && turn == f.turn;\n }\n};\n\n// Lazy Segtree\nstruct LazySegmentTree {\n using T = StudentState;\n using F = Function;\n T e = {2000000000,2000000000,0,0};\n F id = {0, 0, 1};\n T op(T l, T r) {\n return {min(l.l, r.l), l.r == e.r ? r.r : r.r == e.r ? l.r : max(l.r, r.r), l.num + r.num, l.north_sum + r.north_sum};\n }\n T update(T val, F fn) {\n if(fn.mode == 0) {\n return {val.l+fn.val, val.r+fn.val, val.num, val.north_sum * fn.turn};\n } else {\n return {fn.val, fn.val, val.num, val.north_sum * fn.turn};\n }\n }\n F merge(F current, F append) {\n if(current.mode == 0 && append.mode == 0) {\n return {0, current.val + append.val, current.turn * append.turn};\n }\n if(current.mode == 0 && append.mode == 1) {\n return {1, append.val, current.turn * append.turn};\n }\n if(current.mode == 1 && append.mode == 0) {\n return {1, current.val + append.val, current.turn * append.turn};\n }\n if(current.mode == 1 && append.mode == 1) {\n return {1, append.val, current.turn * append.turn};\n }\n return id;\n }\n int _n;\n int _height;\n vec<T> _data;\n vec<F> _lazy;\n\n LazySegmentTree(int n) {\n _n = 1;\n while(_n < n) _n*=2;\n _data = vec<T>(_n*2, e);\n _lazy = vec<F>(_n*2, id);\n }\n void init(int i, T data){\n _data[i+_n] = data;\n }\n void build() {\n for(int i=_n-1; i>0; i--) {\n _data[i] = op(_data[i*2], _data[i*2+1]);\n }\n }\n void eval(int k) {\n if(_lazy[k] == id) return;\n _data[k] = update(_data[k], _lazy[k]);\n if(k < _n) {\n _lazy[k*2+0] = merge(_lazy[k*2+0], _lazy[k]);\n _lazy[k*2+1] = merge(_lazy[k*2+1], _lazy[k]);\n }\n _lazy[k] = id;\n }\n void set(int l, int r, F f) {\n int a = l + _n, b = r + _n - 1;\n for(int i = _height; i > 0; i--) eval(a>>i), eval(b>>i);\n for(b++; a<b; a>>=1, b>>=1) {\n if(a&1) _lazy[a] = merge(_lazy[a], f), eval(a), a++;\n if(b&1) --b, _lazy[b] = merge(_lazy[b], f), eval(b);\n }\n a = l + _n, b = r + _n - 1;\n while((a>>=1), (b>>=1), a) {\n if(_lazy[a] == id) _data[a] = op(\n update(_data[a*2+0], _lazy[a*2+0]),\n update(_data[a*2+1], _lazy[a*2+1])\n );\n if(_lazy[b] == id) _data[b] = op(\n update(_data[b*2+0], _lazy[b*2+0]),\n update(_data[b*2+1], _lazy[b*2+1])\n );\n }\n }\n T query(int l, int r) {\n int a = l + _n, b = r + _n -1;\n for(int i=_height; i>=0; i--) eval(a>>i), eval(b>>i);\n T vl = e, vr = e;\n for(b++; a<b; a>>=1, b>>=1) {\n if(a&1) vl = op(vl, update(_data[a], _lazy[a])), a++;\n if(b&1) b--, vr = op(vr, update(_data[b], _lazy[b]));\n }\n return op(vl, vr);\n }\n int lower_bound(int target_val) {\n int index = 1;\n while(index < _n) {\n eval(index);\n // eval(index<<1);\n // eval(index<<1|1);\n auto left = update(_data[index<<1], _lazy[index<<1]);\n // auto right = _data[index<<1|1];\n if(target_val <= left.r) index = index*2;\n else index = index*2 + 1;\n }\n return min(index, 2*_n) - _n;\n }\n void print() {\n rep(i, _data.size()) {\n cout << \"{\" << _data[i].north_sum << \" \" << _data[i].l << \" \" << _data[i].r << \" \" << _data[i].num << \"} \";\n }\n cout << endl;\n }\n};\n\nsigned main() {\n cin.tie(nullptr);\n cout.tie(nullptr);\n cin.sync_with_stdio(false);\n cout.sync_with_stdio(false);\n cout << std::fixed << std::setprecision(15);\n\n int N, M;\n cin >> N >> M;\n LazySegmentTree seg(M+1);\n vec<int> x_tmp(M);\n rep(i, M) {\n cin >> x_tmp[i];\n }\n sort(x_tmp.begin(), x_tmp.end());\n rep(i, M) {\n seg.init(i, {x_tmp[i], x_tmp[i], 1, 1});\n }\n seg.build();\n // seg.print();\n if(N == 100 && M == 23) return 0;\n int Q;\n cin >> Q;\n rep(q, Q) {\n // cout << \"---\" << endl;\n int mode;\n cin >> mode;\n if(mode == 1) {\n int a, b, c;\n cin >> a >> b >> c;\n int move_l = c>0 ? a : a-c;\n int move_r = c>0 ? b-c : b;\n int set_l = c>0 ? max(a, b-c+1) : a;\n int set_r = c>0 ? b : min(b, a-c-1);\n // cout << \"move_l = \" << move_l << endl;\n // cout << \"move_r = \" << move_r << endl;\n // cout << \"set_l = \" << set_l << endl;\n // cout << \"set_r = \" << set_r << endl;\n int move_l_index = seg.lower_bound(move_l);\n int move_r_index = seg.lower_bound(move_r+1);\n int set_l_index = seg.lower_bound(set_l);\n int set_r_index = seg.lower_bound(set_r+1);\n // cout << \"move_l_index = \" << move_l_index << endl;\n // cout << \"move_r_index = \" << move_r_index << endl;\n // cout << \"set_l_index = \" << set_l_index << endl;\n // cout << \"set_r_index = \" << set_r_index << endl;\n if(move_l <= move_r) seg.set(move_l_index, min(M, move_r_index), {0, c, -1});\n if(set_l <= set_r) {\n if(c > 0) seg.set(set_l_index, min(M, set_r_index), {1, b, -1});\n else seg.set(set_l_index, min(M, set_r_index), {1, a, -1});\n // cout << set_l_index << \" aaa \" << set_r_index << endl;\n }\n } else {\n int d, e;\n cin >> d >> e;\n int d_index = seg.lower_bound(d);\n int e_index = seg.lower_bound(e+1);\n // cout << d_index << \" \" << e_index << endl;\n auto data = seg.query(d_index, e_index);\n cout << data.north_sum << '\\n';\n }\n // cout << seg.lower_bound(1) << \" \" << seg.lower_bound(7) << endl;\n // seg.print();\n }\n cout << flush;\n return 0;\n}", "accuracy": 0.3333333333333333, "time_ms": 1480, "memory_kb": 3384, "score_of_the_acc": -1.0014, "final_rank": 18 }, { "submission_id": "aoj_0474_8467201", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define ll long long\n#define int long long\n\n#define rep(i, n) for(int i=0; i<(n); ++i)\n\ntemplate<class T>\nusing vec = vector<T>;\n\nstruct StudentState {\n int l, r;\n int num;\n int north_sum;\n bool operator== (const StudentState &a) {\n return l == a.l && r == a.r && num == a.num && north_sum == a.north_sum;\n }\n};\nstruct Function {\n bool mode; // 0 -> add, 1 -> set\n int val;\n int turn; // -1=反転(default)、1=そのまま\n bool operator== (const Function &f) {\n return mode == f.mode && val == f.val && turn == f.turn;\n }\n};\n\n// Lazy Segtree\nstruct LazySegmentTree {\n using T = StudentState;\n using F = Function;\n T e = {2000000000,2000000000,0,0};\n F id = {0, 0, 1};\n T op(T l, T r) {\n return {min(l.l, r.l), l.r == e.r ? r.r : r.r == e.r ? l.r : max(l.r, r.r), l.num + r.num, l.north_sum + r.north_sum};\n }\n T update(T val, F fn) {\n if(fn.mode == 0) {\n return {val.l+fn.val, val.r+fn.val, val.num, val.north_sum * fn.turn};\n } else {\n return {fn.val, fn.val, val.num, val.north_sum * fn.turn};\n }\n }\n F merge(F current, F append) {\n if(current.mode == 0 && append.mode == 0) {\n return {0, current.val + append.val, current.turn * append.turn};\n }\n if(current.mode == 0 && append.mode == 1) {\n return {1, append.val, current.turn * append.turn};\n }\n if(current.mode == 1 && append.mode == 0) {\n return {1, current.val + append.val, current.turn * append.turn};\n }\n if(current.mode == 1 && append.mode == 1) {\n return {1, append.val, current.turn * append.turn};\n }\n return id;\n }\n int _n;\n int _height;\n vec<T> _data;\n vec<F> _lazy;\n\n LazySegmentTree(int n) {\n _n = 1;\n while(_n < n) _n*=2;\n _data = vec<T>(_n*2, e);\n _lazy = vec<F>(_n*2, id);\n }\n void init(int i, T data){\n _data[i+_n] = data;\n }\n void build() {\n for(int i=_n-1; i>0; i--) {\n _data[i] = op(_data[i*2], _data[i*2+1]);\n }\n }\n void eval(int k) {\n if(_lazy[k] == id) return;\n _data[k] = update(_data[k], _lazy[k]);\n if(k < _n) {\n _lazy[k*2+0] = merge(_lazy[k*2+0], _lazy[k]);\n _lazy[k*2+1] = merge(_lazy[k*2+1], _lazy[k]);\n }\n _lazy[k] = id;\n }\n void set(int l, int r, F f) {\n int a = l + _n, b = r + _n - 1;\n for(int i = _height; i > 0; i--) eval(a>>i), eval(b>>i);\n for(b++; a<b; a>>=1, b>>=1) {\n if(a&1) _lazy[a] = merge(_lazy[a], f), eval(a), a++;\n if(b&1) --b, _lazy[b] = merge(_lazy[b], f), eval(b);\n }\n a = l + _n, b = r + _n - 1;\n while((a>>=1), (b>>=1), a) {\n if(_lazy[a] == id) _data[a] = op(\n update(_data[a*2+0], _lazy[a*2+0]),\n update(_data[a*2+1], _lazy[a*2+1])\n );\n if(_lazy[b] == id) _data[b] = op(\n update(_data[b*2+0], _lazy[b*2+0]),\n update(_data[b*2+1], _lazy[b*2+1])\n );\n }\n }\n T query(int l, int r) {\n int a = l + _n, b = r + _n -1;\n for(int i=_height; i>=0; i--) eval(a>>i), eval(b>>i);\n T vl = e, vr = e;\n for(b++; a<b; a>>=1, b>>=1) {\n if(a&1) vl = op(vl, update(_data[a], _lazy[a])), a++;\n if(b&1) b--, vr = op(vr, update(_data[b], _lazy[b]));\n }\n return op(vl, vr);\n }\n int lower_bound(int target_val) {\n int index = 1;\n while(index < _n) {\n eval(index);\n eval(index<<1);\n eval(index<<1|1);\n auto left = _data[index<<1];\n auto right = _data[index<<1|1];\n if(target_val <= left.r) index = index*2;\n else index = index*2 + 1;\n }\n return min(index, 2*_n) - _n;\n }\n void print() {\n rep(i, _data.size()) {\n cout << \"{\" << _data[i].north_sum << \" \" << _data[i].l << \" \" << _data[i].r << \" \" << _data[i].num << \"} \";\n }\n cout << endl;\n }\n};\n\nsigned main() {\n int N, M;\n cin >> N >> M;\n LazySegmentTree seg(M+1);\n vec<int> x_tmp(M);\n rep(i, M) {\n cin >> x_tmp[i];\n }\n sort(x_tmp.begin(), x_tmp.end());\n rep(i, M) {\n seg.init(i, {x_tmp[i], x_tmp[i], 1, 1});\n }\n seg.build();\n // seg.print();\n int Q;\n cin >> Q;\n rep(q, Q) {\n // cout << \"---\" << endl;\n int mode;\n cin >> mode;\n if(mode == 1) {\n int a, b, c;\n cin >> a >> b >> c;\n int move_l = c>0 ? a : a-c;\n int move_r = c>0 ? b-c : b;\n int set_l = c>0 ? b-c+1 : a;\n int set_r = c>0 ? b : a-c-1;\n // cout << \"move_l = \" << move_l << endl;\n // cout << \"move_r = \" << move_r << endl;\n // cout << \"set_l = \" << set_l << endl;\n // cout << \"set_r = \" << set_r << endl;\n int move_l_index = seg.lower_bound(move_l);\n int move_r_index = seg.lower_bound(move_r+1);\n int set_l_index = seg.lower_bound(set_l);\n int set_r_index = seg.lower_bound(set_r+1);\n if(move_l <= move_r) seg.set(move_l_index, min(M, move_r_index), {0, c, -1});\n if(set_l <= set_r) {\n if(c > 0) seg.set(set_l_index, min(M, set_r_index), {1, b, -1});\n else seg.set(set_l_index, min(M, set_r_index), {1, a, -1});\n // cout << set_l_index << \" aaa \" << set_r_index << endl;\n }\n } else {\n int d, e;\n cin >> d >> e;\n int d_index = seg.lower_bound(d);\n int e_index = seg.lower_bound(e+1);\n // cout << d_index << \" \" << e_index << endl;\n auto data = seg.query(d_index, e_index);\n cout << data.north_sum << endl;\n }\n // cout << seg.lower_bound(1) << \" \" << seg.lower_bound(7) << endl;\n // seg.print();\n }\n}", "accuracy": 0.08333333333333333, "time_ms": 130, "memory_kb": 3324, "score_of_the_acc": -0.0816, "final_rank": 19 }, { "submission_id": "aoj_0474_8467197", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define ll long long\n#define int long long\n\n#define rep(i, n) for(int i=0; i<(n); ++i)\n\ntemplate<class T>\nusing vec = vector<T>;\n\nstruct StudentState {\n int l, r;\n int num;\n int north_sum;\n bool operator== (const StudentState &a) {\n return l == a.l && r == a.r && num == a.num && north_sum == a.north_sum;\n }\n};\nstruct Function {\n bool mode; // 0 -> add, 1 -> set\n int val;\n int turn; // -1=反転(default)、1=そのまま\n bool operator== (const Function &f) {\n return mode == f.mode && val == f.val && turn == f.turn;\n }\n};\n\n// Lazy Segtree\nstruct LazySegmentTree {\n using T = StudentState;\n using F = Function;\n T e = {2000000000,2000000000,0,0};\n F id = {0, 0, 1};\n T op(T l, T r) {\n return {min(l.l, r.l), l.r == e.r ? r.r : r.r == e.r ? l.r : max(l.r, r.r), l.num + r.num, l.north_sum + r.north_sum};\n }\n T update(T val, F fn) {\n if(fn.mode == 0) {\n return {val.l+fn.val, val.r+fn.val, val.num, val.north_sum * fn.turn};\n } else {\n return {fn.val, fn.val, val.num, val.north_sum * fn.turn};\n }\n }\n F merge(F current, F append) {\n if(current.mode == 0 && append.mode == 0) {\n return {0, current.val + append.val, current.turn * append.turn};\n }\n if(current.mode == 0 && append.mode == 1) {\n return {1, append.val, current.turn * append.turn};\n }\n if(current.mode == 1 && append.mode == 0) {\n return {1, current.val + append.val, current.turn * append.turn};\n }\n if(current.mode == 1 && append.mode == 1) {\n return {1, append.val, current.turn * append.turn};\n }\n return id;\n }\n int _n;\n int _height;\n vec<T> _data;\n vec<F> _lazy;\n\n LazySegmentTree(int n) {\n _n = 1;\n while(_n < n) _n*=2;\n _data = vec<T>(_n*2, e);\n _lazy = vec<F>(_n*2, id);\n }\n void init(int i, T data){\n _data[i+_n] = data;\n }\n void build() {\n for(int i=_n-1; i>0; i--) {\n _data[i] = op(_data[i*2], _data[i*2+1]);\n }\n }\n void eval(int k) {\n if(_lazy[k] == id) return;\n _data[k] = update(_data[k], _lazy[k]);\n if(k < _n) {\n _lazy[k*2+0] = merge(_lazy[k*2+0], _lazy[k]);\n _lazy[k*2+1] = merge(_lazy[k*2+1], _lazy[k]);\n }\n _lazy[k] = id;\n }\n void set(int l, int r, F f) {\n int a = l + _n, b = r + _n - 1;\n for(int i = _height; i > 0; i--) eval(a>>i), eval(b>>i);\n for(b++; a<b; a>>=1, b>>=1) {\n if(a&1) _lazy[a] = merge(_lazy[a], f), eval(a), a++;\n if(b&1) --b, _lazy[b] = merge(_lazy[b], f), eval(b);\n }\n a = l + _n, b = r + _n - 1;\n while((a>>=1), (b>>=1), a) {\n if(_lazy[a] == id) _data[a] = op(\n update(_data[a*2+0], _lazy[a*2+0]),\n update(_data[a*2+1], _lazy[a*2+1])\n );\n if(_lazy[b] == id) _data[b] = op(\n update(_data[b*2+0], _lazy[b*2+0]),\n update(_data[b*2+1], _lazy[b*2+1])\n );\n }\n }\n T query(int l, int r) {\n int a = l + _n, b = r + _n -1;\n for(int i=_height; i>=0; i--) eval(a>>i), eval(b>>i);\n T vl = e, vr = e;\n for(b++; a<b; a>>=1, b>>=1) {\n if(a&1) vl = op(vl, update(_data[a], _lazy[a])), a++;\n if(b&1) b--, vr = op(vr, update(_data[b], _lazy[b]));\n }\n return op(vl, vr);\n }\n int lower_bound(int target_val) {\n int index = 1;\n while(index < _n) {\n eval(index);\n eval(index<<1);\n eval(index<<1|1);\n auto left = _data[index<<1];\n auto right = _data[index<<1|1];\n if(target_val <= left.r) index = index*2;\n else index = index*2 + 1;\n }\n return min(index, 2*_n) - _n;\n }\n void print() {\n rep(i, _data.size()) {\n cout << \"{\" << _data[i].north_sum << \" \" << _data[i].l << \" \" << _data[i].r << \" \" << _data[i].num << \"} \";\n }\n cout << endl;\n }\n};\n\nsigned main() {\n int N, M;\n cin >> N >> M;\n LazySegmentTree seg(M);\n vec<int> x_tmp(M);\n rep(i, M) {\n cin >> x_tmp[i];\n }\n sort(x_tmp.begin(), x_tmp.end());\n rep(i, M) {\n seg.init(i, {x_tmp[i], x_tmp[i], 1, 1});\n }\n seg.build();\n // seg.print();\n int Q;\n cin >> Q;\n rep(q, Q) {\n // cout << \"---\" << endl;\n int mode;\n cin >> mode;\n if(mode == 1) {\n int a, b, c;\n cin >> a >> b >> c;\n int move_l = c>0 ? a : a-c;\n int move_r = c>0 ? b-c : b;\n int set_l = c>0 ? b-c+1 : a;\n int set_r = c>0 ? b : a-c-1;\n // cout << \"move_l = \" << move_l << endl;\n // cout << \"move_r = \" << move_r << endl;\n // cout << \"set_l = \" << set_l << endl;\n // cout << \"set_r = \" << set_r << endl;\n int move_l_index = seg.lower_bound(move_l);\n int move_r_index = seg.lower_bound(move_r+1);\n int set_l_index = seg.lower_bound(set_l);\n int set_r_index = seg.lower_bound(set_r+1);\n if(move_l <= move_r) seg.set(move_l_index, min(M, move_r_index), {0, c, -1});\n if(set_l <= set_r) {\n if(c > 0) seg.set(set_l_index, min(M, set_r_index), {1, b, -1});\n else seg.set(set_l_index, min(M, set_r_index), {1, a, -1});\n // cout << set_l_index << \" aaa \" << set_r_index << endl;\n }\n } else {\n int d, e;\n cin >> d >> e;\n int d_index = seg.lower_bound(d);\n int e_index = seg.lower_bound(e+1);\n // cout << d_index << \" \" << e_index << endl;\n auto data = seg.query(d_index, e_index);\n cout << data.north_sum << endl;\n }\n // cout << seg.lower_bound(1) << \" \" << seg.lower_bound(7) << endl;\n // seg.print();\n }\n}", "accuracy": 0.041666666666666664, "time_ms": 130, "memory_kb": 3440, "score_of_the_acc": -0.0844, "final_rank": 20 }, { "submission_id": "aoj_0474_8439597", "code_snippet": "#include<bits/stdc++.h>\n#define overload(a,b,c,d,...) d\n#define rep1(n) for(ll _=0;_<n;++_)\n#define rep2(i,n) for(ll i=0;i<n;++i)\n#define rep3(i,a,b) for(ll i=(ll)a;i<(ll)b;++i)\n#define rep(...) overload(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(i,n) for(ll i=(ll)n-1;i>=0;--i)\n#define rrep2(i,a,b) for(ll i=(ll)b-1;i>=(ll)a;--i)\n#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)\n#define all(x) (x).begin(),(x).end()\n#define rall(x) (x).rbegin(),(x).rend()\n#define eb emplace_back\n#define pb push_back\nusing namespace std;\nusing ll=int;\nusing ld=long double;\nusing vl=vector<ll>;\ntemplate<typename T,typename U>inline bool chmin(T&a,const U&b){return (a>b?a=b,true:false);}\ntemplate<typename T,typename U>inline bool chmax(T&a,const U&b){return (a<b?a=b,true:false);}\nstatic constexpr ll inf=numeric_limits<ll>::max()/2;\nstruct Segtree{\n\tll lg,n,size;\n\tvector<ll>data;\n\tvector<pair<ll,ll>>lazy;\n\tvector<bool>lazy_flag;\n\tinline static ll op1(ll x,pair<ll,ll>y){\n\t\tif(y.first==0){\n\t\t\treturn y.second;\n\t\t}\n\t\treturn x+y.second;\n\t}\n\tinline static pair<ll,ll>op2(pair<ll,ll>x,pair<ll,ll>y){\n\t\tif(y.first==0){\n\t\t\treturn y;\n\t\t}\n\t\tx.second+=y.second;\n\t\treturn x;\n\t}\n\tvoid all_apply(ll k,pair<ll,ll>x,ll sz){\n\t\tif(k<size){\n\t\t\tif(lazy_flag[k])lazy[k]=op2(lazy[k],x);\n\t\t\telse lazy[k]=x,lazy_flag[k]=true;\n\t\t}\n\t\telse{\n\t\t\tdata[k-size]=op1(data[k-size],x);\n\t\t}\n\t}\n\tvoid eval(ll k,ll sz){\n\t\tif(lazy_flag[k]){\n\t\t\tall_apply(k<<1,lazy[k],sz>>1);\n\t\t\tall_apply(k<<1^1,lazy[k],sz>>1);\n\t\t\tlazy_flag[k]=false;\n\t\t}\n\t}\n\tpublic:\n\tSegtree(const vector<ll>&x){\n\t\tn=x.size();\n\t\tlg=0;while((1<<lg)<n)lg++;\n\t\tsize=1<<lg;\n\t\tdata=x;\n\t\tlazy.resize(size);\n\t\tlazy_flag.assign(size,false);\n\t}\n\tvoid apply(ll l,ll r,pair<ll,ll>x){\n\t\tif(l==r)return;\n\t\tl+=size,r+=size;\n\t\trrep(i,1,lg+1){\n\t\t\tif(((l>>i)<<i)!=l)eval(l>>i,1<<i);\n\t\t\tif(((r>>i)<<i)!=r)eval((r-1)>>i,1<<i);\n\t\t}\n\t\tfor(ll l2=l,r2=r,sz=1;l2!=r2;l2>>=1,r2>>=1,sz<<=1){\n\t\t\tif(l2&1)all_apply(l2++,x,sz);\n\t\t\tif(r2&1)all_apply(--r2,x,sz);\n\t\t}\n\t}\n\tll operator[](ll k){\n\t\tk+=size;\n\t\trrep(i,1,lg+1)eval(k>>i,1<<i);\n\t\treturn data[k-size];\n\t}\n};\nstruct Segtree2{\n\tll lg,n,size;\n\tvector<ll>data;\n\tvector<ll>lazy;\n\tvector<bool>lazy_flag;\n\tinline static ll op1(ll x,ll y){\n\t\tif(y)return -x;\n\t\treturn x;\n\t}\n\tinline static ll op2(ll x,ll y){\n\t\treturn x^y;\n\t}\n\tinline void update(ll k){\n\t\tdata[k]=data[k<<1]+data[k<<1|1];\n\t}\t\n\tvoid all_apply(ll k,ll x,ll sz){\n\t\tdata[k]=op1(data[k],x);\n\t\tif(k<size){\n\t\t\tif(lazy_flag[k])lazy[k]=op2(lazy[k],x);\n\t\t\telse lazy[k]=x,lazy_flag[k]=true;\n\t\t}\n\t}\n\tvoid eval(ll k,ll sz){\n\t\tif(lazy_flag[k]){\n\t\t\tall_apply(k<<1,lazy[k],sz>>1);\n\t\t\tall_apply(k<<1^1,lazy[k],sz>>1);\n\t\t\tlazy_flag[k]=false;\n\t\t}\n\t}\n\tpublic:\n\tSegtree2(const vector<ll>&x){\n\t\tn=x.size();\n\t\tlg=0;while((1<<lg)<n)lg++;\n\t\tsize=1<<lg;\n\t\tdata.resize(size<<1,0);\n\t\tlazy.resize(size);\n\t\tlazy_flag.assign(size,false);\n\t\trep(i,n)data[i+size]=x[i];\n\t\trrep(i,1,size)update(i);\n\t}\n\tvoid apply(ll l,ll r,ll x){\n\t\tif(l==r)return;\n\t\tl+=size,r+=size;\n\t\tll lst=lg+1;\n\t\trrep(i,1,lg+1){\n\t\t\tif(((l>>i)<<i)!=l)eval(l>>i,1<<i),lst=i;\n\t\t\tif(((r>>i)<<i)!=r)eval((r-1)>>i,1<<i),lst=i;\n\t\t\tif(lst!=i)break;\n\t\t}\n\t\tfor(ll l2=l,r2=r,sz=1;l2!=r2;l2>>=1,r2>>=1,sz<<=1){\n\t\t\tif(l2&1)all_apply(l2++,x,sz);\n\t\t\tif(r2&1)all_apply(--r2,x,sz);\n\t\t}\n\t\trep(i,lst,lg+1){\n\t\t\tif(((l>>i)<<i)!=l)update(l>>i);\n\t\t\tif(((r>>i)<<i)!=r)update((r-1)>>i);\n\t\t}\n\t}\n\tll prod(ll l,ll r){\n\t\tif(l==r)return 0;\n\t\tl+=size,r+=size;\n\t\trrep(i,1,lg+1){\n\t\t\tbool f=false;\n\t\t\tif(((l>>i)<<i)!=l)eval(l>>i,1<<i),f=true;\n\t\t\tif(((r>>i)<<i)!=r)eval((r-1)>>i,1<<i),f=true;\n\t\t\tif(!f)break;\n\t\t}\n\t\tll sum=0;\n\t\twhile(l!=r){\n\t\t\tif(l&1)sum+=data[l++];\n\t\t\tif(r&1)sum+=data[--r];\n\t\t\tl>>=1,r>>=1;\n\t\t}\n\t\treturn sum;\n\t}\n\tll operator[](ll k){\n\t\tk+=size;\n\t\trrep(i,1,lg+1)eval(k>>i,1<<i);\n\t\treturn data[k-size];\n\t}\n};\nint main(){\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tll n,m;cin>>n>>m;\n\tvl x(m);for(auto&e:x)cin>>e;\n\tsort(all(x));\n\tSegtree seg(x);\n\tSegtree2 seg2(vector<ll>(m,1));\n\tll q;cin>>q;\n\tauto get_idx=[&](ll x){\n\t\t//x�ȏ�ƂȂ�ŏ���i\n\t\tll l=-1,r=m;\n\t\twhile(r-l>1){\n\t\t\tll mid=(l+r)/2;\n\t\t\tif(seg[mid]>=x)r=mid;\n\t\t\telse l=mid;\n\t\t}\n\t\treturn r;\n\t};\n\twhile(q--){\n\t\tll t;cin>>t;\n\t\tif(t==1){\n\t\t\tll a,b,c;cin>>a>>b>>c;\n\t\t\tll l=get_idx(a),r=get_idx(b+1);\n\t\t\tseg2.apply(l,r,1);\n\t\t\tif(c>0){\n\t\t\t\tll mid=get_idx(b-c);\n\t\t\t\tchmax(mid,l);\n\t\t\t\tseg.apply(mid,r,{0,b});\n\t\t\t\tseg.apply(l,mid,{1,c});\n\t\t\t}\n\t\t\telse{\n\t\t\t\tll mid=get_idx(a-c+1);\n\t\t\t\tchmin(mid,r);\n\t\t\t\tseg.apply(l,mid,{0,a});\n\t\t\t\tseg.apply(mid,r,{1,c});\n\t\t\t}\n\t\t}\n\t\telse{\n\t\t\tll d,e;cin>>d>>e;\n\t\t\tll idl=get_idx(d),idr=get_idx(e+1);\n\t\t\tcout<<seg2.prod(idl,idr)<<endl;\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 340, "memory_kb": 6780, "score_of_the_acc": -0.3069, "final_rank": 5 }, { "submission_id": "aoj_0474_7072169", "code_snippet": "#ifdef _DEBUG\n#ifdef _SORAIE\n#define _GLIBCXX_DEBUG\n#endif\n#endif\n\n#include <bits/stdc++.h>\n\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\nusing namespace std;\n//--------------------------------------------------------------------\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\n#define overload4(_1,_2,_3,_4,name,...) name\n#define rep1(n) for(ll _ThiS_WoNt_Be_usEd=0;_ThiS_WoNt_Be_usEd<(ll)n;++_ThiS_WoNt_Be_usEd)\n#define rep2(i,n) for(ll i=0;i<(ll)n;++i)\n#define rep3(i,a,b) for(ll i=(ll)a;i<(ll)b;++i)\n#define rep4(i,a,b,c) for(ll i=(ll)a;i<(ll)b;i+=(ll)c)\n#define rep(...) overload4(__VA_ARGS__,rep4,rep3,rep2,rep1)(__VA_ARGS__)\n\n#if defined(_SORAIE) && defined(_DEBUG)\n\n#include <debug.hpp>\n\n#else\n\n#define debug(...) void(0);\n#define koko void(0);\n#define pass(...) void(0);\n\n#endif\n\n#define mp make_pair\n#define mt make_tuple\n#define ten(d) int64_t(1e##d)\nvoid doset(int n){cout << fixed << setprecision(n);cerr << fixed << setprecision(n);}\nstruct asdfghjkl{asdfghjkl(){ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);doset(20);}} qwertyuiop;\nusing ll = long long;\nusing ld = long double;\nusing dou = double;\nconstexpr int inf = 1 << 30;\nconstexpr ll INF = 1LL << 61;\nconstexpr ld pi = 3.14159265358;\nconstexpr ll mod1 = 1000000007LL;\nconstexpr ll mod2 = 998244353LL;\nusing pll = pair<ll,ll>;\nusing pli = pair<ll,int>;\nusing pii = pair<int,int>;\ntemplate<class T, class U> inline bool chmin(T& a, const U& b){ if(a > b){ a = b; return 1; } return 0; }\ntemplate<class T, class U> inline bool chmax(T& a, const U& b){ if(a < b){ a = b; return 1; } return 0; }\nll modpow(ll n,ll m,ll MOD){\n if(m == 0)return 1;\n if(m < 0)return 0;\n ll res = 1;\n n %= MOD;\n while(m){\n if(m & 1)res = (res * n) % MOD;\n m >>= 1;\n n *= n;\n n %= MOD;\n }\n return res;\n}\nll mypow(ll n,ll m){\n if(m == 0)return 1;\n if(m < 0)return -1;\n ll res = 1;\n while(m){\n if(m & 1)res = (res * n);\n m >>= 1;\n n *= n;\n }\n return res;\n}\n\ninline bool isp(ll n){\n bool res = true;\n if(n == 1 || n == 0)return false;\n else{\n for(ll i = 2;i * i <= n;i++){\n if(n % i == 0){\n res = false;\n break;\n }\n }\n return res;\n }\n}\ninline bool Yes(bool b = 1){cout << (b ? \"Yes\\n\":\"No\\n\");return b;}\ninline bool YES(bool b = 1){cout << (b ? \"YES\\n\":\"NO\\n\");return b;}\nmap<ll,ll> primefactor(ll n){\n map<ll,ll> ma;\n if(n <= 1)return ma;\n ll m = n;\n for(ll i = 2;i * i <= n;i++){\n while(m % i == 0){\n ma[i]++;\n m /= i;\n }\n }\n if(m != 1)ma[m]++;\n return ma;\n}\nvector<ll> divisor(ll n,bool sorted = true,bool samein = false){\n vector<ll> res;\n for(ll i = 1;i * i <= n;i++){\n if(n % i == 0){\n res.push_back(i);\n if(i * i != n || samein)res.push_back(n / i);\n }\n }\n if(sorted)sort(all(res));\n return res;\n}\n\ntemplate<class T> inline void operator--(vector<T>& v) { for(int i = 0;i < int(v.size());i++)v[i]--; }\ntemplate<class T> inline void operator--(vector<T>& v,int) { for(int i = 0;i < int(v.size());i++)v[i]--; }\n\ntemplate<class T>\ninline void pv(const vector<T>& v,const string& sep = \" \",const string& end = \"\\n\") {\n for(int i = 0;i < int(v.size());i++) cout << v[i] << (i == int(v.size()) - 1 ? end : sep);\n}\n\n\n// #include <boost/multiprecision/cpp_dec_float.hpp>\n// using lld = boost::multiprecision::number<boost::multiprecision::cpp_dec_float<20>>;\n\n// #include <boost/multiprecision/cpp_int.hpp>\n// using lll = boost::multiprecision::cpp_int;\n\n\n\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param n `0 <= n`\n// @return minimum non-negative `x` s.t. `n <= 2**x`\nint ceil_pow2(int n) {\n int x = 0;\n while ((1U << x) < (unsigned int)(n)) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nint bsf(unsigned int n) {\n#ifdef _MSC_VER\n unsigned long index;\n _BitScanForward(&index, n);\n return index;\n#else\n return __builtin_ctz(n);\n#endif\n}\n\n} // namespace internal\n\n} // namespace atcoder\n\n\n\nnamespace atcoder {\n\ntemplate <class S,\n S (*op)(S, S),\n S (*e)(),\n class F,\n S (*mapping)(F, S),\n F (*composition)(F, F),\n F (*id)()>\nstruct lazy_segtree {\n public:\n lazy_segtree() : lazy_segtree(0) {}\n explicit lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}\n explicit lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {\n log = internal::ceil_pow2(_n);\n size = 1 << log;\n d = std::vector<S>(2 * size, e());\n lz = std::vector<F>(size, id());\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) {\n update(i);\n }\n }\n\n void set(int p, S x) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n\n S get(int p) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n return d[p];\n }\n\n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return e();\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n S sml = e(), smr = e();\n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n\n return op(sml, smr);\n }\n\n S all_prod() { return d[1]; }\n\n void apply(int p, F f) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = mapping(f, d[p]);\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n void apply(int l, int r, F f) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return;\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n {\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) all_apply(l++, f);\n if (r & 1) all_apply(--r, f);\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n }\n\n for (int i = 1; i <= log; i++) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n\n template <bool (*g)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return g(x); });\n }\n template <class G> int max_right(int l, G g) {\n assert(0 <= l && l <= _n);\n assert(g(e()));\n if (l == _n) return _n;\n l += size;\n for (int i = log; i >= 1; i--) push(l >> i);\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!g(op(sm, d[l]))) {\n while (l < size) {\n push(l);\n l = (2 * l);\n if (g(op(sm, d[l]))) {\n sm = op(sm, d[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = op(sm, d[l]);\n l++;\n } while ((l & -l) != l);\n return _n;\n }\n\n template <bool (*g)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return g(x); });\n }\n template <class G> int min_left(int r, G g) {\n assert(0 <= r && r <= _n);\n assert(g(e()));\n if (r == 0) return 0;\n r += size;\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!g(op(d[r], sm))) {\n while (r < size) {\n push(r);\n r = (2 * r + 1);\n if (g(op(d[r], sm))) {\n sm = op(d[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = op(d[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n\n private:\n int _n, size, log;\n std::vector<S> d;\n std::vector<F> lz;\n\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n void all_apply(int k, F f) {\n d[k] = mapping(f, d[k]);\n if (k < size) lz[k] = composition(f, lz[k]);\n }\n void push(int k) {\n all_apply(2 * k, lz[k]);\n all_apply(2 * k + 1, lz[k]);\n lz[k] = id();\n }\n};\n\n} // namespace atcoder\n\n\n\n\n//--------------------------------------------------------------------\n\n\ntemplate<class T>\nstruct DualSegmentTree{\n virtual void c(T&, const T&) = 0;\n ll size = 1, rank = 0;\n vector<T> lazy;\n const T def_lazy;\n DualSegmentTree(ll n, const T& def_value, const T& def_lazy): def_lazy(def_lazy){\n while(size < n){\n size *= 2;\n rank++;\n }\n lazy.assign(size * 2, def_lazy);\n for(ll i = size; i < size * 2; i++) lazy[i] = def_value;\n }\n DualSegmentTree(const vector<T>& v, const T& def_lazy): def_lazy(def_lazy){\n while(size < v.size()){\n size *= 2;\n rank++;\n }\n lazy.assign(size * 2, def_lazy);\n for(ll i = 0; i < v.size(); i++) lazy[size + i] = v[i];\n }\n void push(ll at){\n if(!at) return;\n ll r = 31 - __builtin_clz(at);\n for(ll i = r; i > 0; i--){\n ll a = at >> i;\n if(lazy[a] != def_lazy){\n c(lazy[a * 2], lazy[a]);\n c(lazy[a * 2 + 1], lazy[a]);\n lazy[a] = def_lazy;\n }\n }\n }\n T operator[](ll at){\n at += size;\n push(at);\n return lazy[at];\n }\n void set(ll at, const T& val){\n at += size;\n push(at);\n lazy[at] = val;\n }\n void query(ll l, ll r, const T& val){\n if(l >= r) return;\n l += size;\n r += size;\n push(l >> __builtin_ctz(l));\n push((r >> __builtin_ctz(r)) - 1);\n for(; l < r; l /= 2, r /= 2){\n if(l & 1) c(lazy[l++], val);\n if(r & 1) c(lazy[--r], val);\n }\n }\n};\n\n// F(x) = clamp(x + add,mn,mx)\nstruct F{\n ll add,mn,mx;\n bool operator==(const F& rhs){return mn == rhs.mn && mx == rhs.mx && add == rhs.add;}\n bool operator!=(const F& rhs){return !((*this) == rhs);}\n};\n\ntemplate<class T>\nstruct RQ : DualSegmentTree<T>{\n using Base = DualSegmentTree<T>;\n void c(T& a, const T& b){\n // debug(a.add,a.mn,a.mx,b.add,b.mn,b.mx);\n a.add += b.add;\n a.mn += b.add;\n a.mx += b.add;\n if(b.mx <= a.mn){a.mn = b.mx;a.mx = b.mx;}\n else if(a.mx <= b.mn){a.mn = b.mn;a.mx = b.mn;}\n else{a.mn = max(a.mn,b.mn);a.mx = min(a.mx,b.mx);}\n // debug(a.add,a.mn,a.mx);\n }\n RQ(ll n, const T& def_value, const T& def_lazy = F{0,-INF,INF}) : Base(n, def_value, def_lazy){}\n RQ(const vector<T>& v, const T& def_lazy = F{0,-INF,INF}) : Base(v, def_lazy){}\n};\n\nbool composition(bool a,bool b){return a ^ b;}\nbool id(){return false;}\nint mapping(bool f,int x){return f ? -x : x;}\nint op(int a,int b){return a + b;}\nint e(){return 0;}\n\nint main(){\n int N;int M;\n cin >> N >> M;\n vector<ll> pl(M);\n RQ<F> seg(M,F{0,-INF,INF});\n rep(i,M){\n cin >> pl[i];\n }\n sort(all(pl));\n \n // RSQ_RUQ<int> ans(M);\n\n atcoder::lazy_segtree<int,op,e,bool,mapping,composition,id> ans(M);\n ans.apply(0,M,true);\n rep(i,M)ans.set(i,1);\n int Q;\n cin >> Q;\n auto lb = [&](int x){\n int l = -1,r = M;\n while(r - l > 1){\n int m = (l + r) / 2;\n auto g = seg[m];\n int p = clamp(pl[m] + g.add,g.mn,g.mx);\n if(p < x)l = m;\n else r = m;\n }\n return r;\n };\n debug(lb(1));\n debug(lb(2));\n while(Q--){\n int t;\n cin >> t;\n if(t == 1){\n int a,b,c;\n cin >> a >> b >> c;\n // a--;b--;\n int al = lb(a),bu = lb(b + 1);\n debug(al,bu);\n seg.query(al,bu,F{c,a,b});\n ans.apply(al,bu,true);\n rep(i,M)debug(seg[i].add,seg[i].mn,seg[i].mx);\n }\n else{\n int d,e;\n cin >> d >> e;\n // d--;e--;\n int dl = lb(d),eu = lb(e + 1);\n debug(dl,eu);\n cout << ans.prod(dl,eu) << \"\\n\";\n }\n }\n}", "accuracy": 1, "time_ms": 270, "memory_kb": 11404, "score_of_the_acc": -0.3695, "final_rank": 7 }, { "submission_id": "aoj_0474_6947967", "code_snippet": "#include <bits/stdc++.h>\n\nusing std::vector;\nusing std::array;\nusing std::pair;\nusing std::tuple;\n\nusing ll = long long;\n\nconstexpr int inf = std::numeric_limits<int>::max() / 2;\n\nstruct Ef {\n int left, right, add;\n bool flip;\n static Ef id() { return Ef{-inf, inf, 0, false}; }\n Ef operator+(const Ef& t) const {\n const int l = left + t.add;\n const int r = right + t.add;\n if (r <= t.left) {\n return Ef{t.left, t.left, add + t.add, (bool)(flip ^ t.flip)};\n } else if (t.right <= l) {\n return Ef{t.right, t.right, add + t.add, (bool)(flip ^ t.flip)};\n } else {\n return Ef{std::max(l, t.left), std::min(r, t.right), add + t.add, (bool)(flip ^ t.flip)};\n }\n }\n};\n\nstruct Mn {\n int max, val;\n static Mn id() { return Mn{-inf, 0}; }\n Mn operator+(const Mn& t) const {\n return Mn{std::max(max, t.max), val + t.val};\n }\n Mn operator*(const Ef& e) const {\n return Mn{std::min(std::max(max + e.add, e.left), e.right), e.flip ? -val : val};\n }\n};\n\nstruct LazySegtree {\n int size, logn;\n vector<Mn> data;\n vector<Ef> lazy;\n\n void apply(const int k, const Ef& e) {\n data[k] = data[k] * e;\n if (k < size) lazy[k] = lazy[k] + e;\n }\n void flush(const int k) {\n apply(2 * k, lazy[k]);\n apply(2 * k + 1, lazy[k]);\n lazy[k] = Ef::id();\n }\n void fetch(const int k) {\n data[k] = data[2 * k] + data[2 * k + 1];\n }\n\n void push(const int k) {\n const int lsb = __builtin_ctz(k);\n for (int d = logn; d > lsb; --d) flush(k >> d);\n }\n void pull(int k) {\n k >>= __builtin_ctz(k);\n while (k > 1) fetch(k >>= 1);\n }\n\n LazySegtree(const vector<int>& vec) {\n const int n = (int)vec.size();\n logn = 0;\n while ((1 << logn) < n) logn += 1;\n size = 1 << logn;\n data.resize(2 * size, Mn::id());\n lazy.resize(size, Ef::id());\n for (int i = 0; i < n; ++i) data[size + i] = Mn{vec[i], 1};\n for (int i = size - 1; i > 0; --i) fetch(i);\n }\n\n void operate(const int a, const int b, const int c) {\n int l = lower_bound(a) + size;\n int r = lower_bound(b + 1) + size;\n push(l), push(r);\n const int lc = l, rc = r;\n while (l < r) {\n if (l & 1) apply(l++, Ef{a, b, c, true});\n if (r & 1) apply(--r, Ef{a, b, c, true});\n l >>= 1, r >>= 1;\n }\n pull(lc), pull(rc);\n }\n\n int calculate(const int a, const int b) {\n int l = lower_bound(a) + size;\n int r = lower_bound(b + 1) + size;\n push(l), push(r);\n int ret = 0;\n while (l < r) {\n if (l & 1) ret += data[l++].val;\n if (r & 1) ret += data[--r].val;\n l >>= 1, r >>= 1;\n }\n return ret;\n }\n\n int lower_bound(const int x) {\n if (data[1].max < x) return size;\n int k = 1;\n while (k < size) {\n flush(k);\n k = 2 * k + (data[2 * k].max < x);\n }\n return k - size;\n }\n};\n\nint main() {\n std::ios_base::sync_with_stdio(false);\n std::cin.tie(nullptr);\n int N, M;\n std::cin >> N >> M;\n vector<int> X(M);\n for (auto& x : X) {\n std::cin >> x;\n }\n std::sort(X.begin(), X.end());\n LazySegtree seg(X);\n int Q;\n std::cin >> Q;\n while (Q--) {\n int t, a, b;\n std::cin >> t >> a >> b;\n if (t == 1) {\n int c;\n std::cin >> c;\n seg.operate(a, b, c);\n } else {\n std::cout << seg.calculate(a, b) << '\\n';\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 120, "memory_kb": 7520, "score_of_the_acc": -0.1749, "final_rank": 1 }, { "submission_id": "aoj_0474_6764573", "code_snippet": "#if 1\n#include <iostream>\n#include <fstream>\n#include <string>\n#include <vector>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <queue>\n#include <stack>\n#include <array>\n#include <deque>\n#include <algorithm>\n#include <utility>\n#include <cstdint>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <assert.h>\n#include <bitset>\n#include <list>\n#include <cmath>\n\nauto& in = std::cin;\nauto& out = std::cout;\n#define all_range(C) std::begin(C), std::end(C)\nconst double PI = 3.141592653589793238462643383279502884197169399375105820974944;\n\nstd::vector<int> point2index;\nvoid assyuku() {\n\tstd::sort(all_range(point2index));\n\tpoint2index.erase(std::unique(all_range(point2index)), point2index.end());\n}\n\ninline constexpr uint32_t get_min2pow(uint32_t value, uint32_t work = 1) {\n\treturn ((value <= work) ? (work) : (get_min2pow(value, work * 2)));\n}\n\nint32_t W_max, M, Q;\nint64_t X_in[110000];\n\n//class segment_tree\n//{\n//public:\n//\tusing value_type = int;\n//\tstatic constexpr uint32_t N_MAX = get_min2pow(100000);\n//private:\n//\tstd::vector< std::pair < std::pair<int, int>, int> > query[N_MAX * 2 - 1];\n//\tint value[N_MAX * 2 - 1] = {};\n//\tstatic inline constexpr int32_t getchild(int i) {\n//\t\treturn i * 2 + 1;\n//\t}\n//\tstatic inline constexpr int32_t getparent(int i) {\n//\t\treturn (i - 1) / 2;\n//\t}\n//\tvoid Init_impl(int k = 0)\n//\t{\n//\t\tif (k < N_MAX - 1) {\n//\t\t\t//ノード\n//\t\t\tauto c1 = getchild(k), c2 = c1 + 1;\n//\t\t\tInit_impl(c1);\n//\t\t\tInit_impl(c2);\n//\t\t\tvalue[k] = merge(value[c1], value[c2]);\n//\t\t}\n//\t\telse {\n//\t\t\t//葉\n//\t\t\tvalue[k] = 0;\n//\t\t}\n//\t}\n//\t//value_type query_impl(int32_t a, int32_t b, int32_t k = 0, int32_t l = 0, int32_t r = N_MAX)const\n//\t//{\n//\t//\tif (r <= a || b <= l)return default_value;\n//\t//\tif (a <= l && r <= b)return value[k];\n//\t//\tint m = (l + r) / 2;\n//\t//\treturn merge(query_impl(a, b, getchild(k), l, m), query_impl(a, b, getchild(k) + 1, m, r));\n//\t//}\n//\n//public:\n//\t//-----------------------------変更するコードここから-----------------------------//\n//\ttemplate<typename T>\n//\tvoid change(int32_t i, T&& v)\n//\t{\n//\t\ti += N_MAX - 1;\n//\t\t//葉\n//\t\tここを書く\n//\t\tvalue[i] += std::forward<T>(v);\n//\t\t//value[i] = std::forward<T>(v);\n//\t\ti = getparent(i);\n//\t\t//ノード\n//\t\tfor (;;) {\n//\t\t\tauto c1 = getchild(i), c2 = c1 + 1;\n//\t\t\tvalue[i] = merge(value[c1], value[c2]);\n//\t\t\tif (i == 0) { break; }\n//\t\t\ti = getparent(i);\n//\t\t}\n//\t}\n//\n//private:\n//\tstatic inline value_type merge(const value_type& l, const value_type& r)\n//\t{\n//\t\tここを書く;\n//\t\t//RMQ\n//\t\treturn std::min(l, r);\n//\t\t//RSQ\n//\t\treturn l + r;\n//\t}\n//public:\n//\tinline segment_tree() { init(); }\n//\tinline void init()\n//\t{\n//\t\tInit_impl();\n//\t}\n//\tinline int get_pos(int32_t i)const\n//\t{\n//\t\tint32_t k = 0, l = 0, r = N_MAX;\n//\n//\t\twhile (l == i && r == i+1) {\n//\n//\t\t\tauto c1 = getchild(i), c2 = c1 + 1;\n//\t\t\tif (!query[k].empty()) {\n//\t\t\t\tquery[c1].insert();\n//\t\t\t}\n//\t\t\tint m = (l + r) / 2;\n//\t\t\tif (i < m) {\n//\t\t\t\tk = c1;\n//\t\t\t\tl = l;\n//\t\t\t\tr = m;\n//\t\t\t}\n//\n//\t\t\tmerge(query_impl(a, b, getchild(k), l, m), query_impl(a, b, getchild(k) + 1, m, r));\n//\n//\t\t}\n//\n//\t\ti += N_MAX - 1;\n//\t\t//葉\n//\t\tここを書く\n//\t\tvalue[i] += std::forward<T>(v);\n//\t\t//value[i] = std::forward<T>(v);\n//\t\ti = getparent(i);\n//\t\t//ノード\n//\t\tfor (;;) {\n//\t\t\tauto c1 = getchild(i), c2 = c1 + 1;\n//\t\t\tvalue[i] = merge(value[c1], value[c2]);\n//\t\t\tif (i == 0) { break; }\n//\t\t\ti = getparent(i);\n//\t\t}\n//\t}\n//};\n\nusing namespace std;\nusing ll = int64_t;\nclass SegmentTree {\npublic:\n static constexpr int32_t N = get_min2pow(100000);\nprivate:\n const ll inf = 1e18;\n int n, n0;\n ll max_v[4 * N], smax_v[4 * N], max_c[4 * N];\n ll min_v[4 * N], smin_v[4 * N], min_c[4 * N];\n ll sum[4 * N];\n ll len[4 * N], ladd[4 * N], lval[4 * N];\n\n void update_node_max(int k, ll x) {\n sum[k] += (x - max_v[k]) * max_c[k];\n\n if (max_v[k] == min_v[k]) {\n max_v[k] = min_v[k] = x;\n }\n else if (max_v[k] == smin_v[k]) {\n max_v[k] = smin_v[k] = x;\n }\n else {\n max_v[k] = x;\n }\n\n if (lval[k] != inf && x < lval[k]) {\n lval[k] = x;\n }\n }\n void update_node_min(int k, ll x) {\n sum[k] += (x - min_v[k]) * min_c[k];\n\n if (max_v[k] == min_v[k]) {\n max_v[k] = min_v[k] = x;\n }\n else if (smax_v[k] == min_v[k]) {\n min_v[k] = smax_v[k] = x;\n }\n else {\n min_v[k] = x;\n }\n\n if (lval[k] != inf && lval[k] < x) {\n lval[k] = x;\n }\n }\n\n void push(int k) {\n\n if (n0 - 1 <= k) return;\n\n if (lval[k] != inf) {\n updateall(2 * k + 1, lval[k]);\n updateall(2 * k + 2, lval[k]);\n lval[k] = inf;\n return;\n }\n\n if (ladd[k] != 0) {\n addall(2 * k + 1, ladd[k]);\n addall(2 * k + 2, ladd[k]);\n ladd[k] = 0;\n }\n\n if (max_v[k] < max_v[2 * k + 1]) {\n update_node_max(2 * k + 1, max_v[k]);\n }\n if (min_v[2 * k + 1] < min_v[k]) {\n update_node_min(2 * k + 1, min_v[k]);\n }\n\n if (max_v[k] < max_v[2 * k + 2]) {\n update_node_max(2 * k + 2, max_v[k]);\n }\n if (min_v[2 * k + 2] < min_v[k]) {\n update_node_min(2 * k + 2, min_v[k]);\n }\n }\n\n void update(int k) {\n sum[k] = sum[2 * k + 1] + sum[2 * k + 2];\n\n if (max_v[2 * k + 1] < max_v[2 * k + 2]) {\n max_v[k] = max_v[2 * k + 2];\n max_c[k] = max_c[2 * k + 2];\n smax_v[k] = max(max_v[2 * k + 1], smax_v[2 * k + 2]);\n }\n else if (max_v[2 * k + 1] > max_v[2 * k + 2]) {\n max_v[k] = max_v[2 * k + 1];\n max_c[k] = max_c[2 * k + 1];\n smax_v[k] = max(smax_v[2 * k + 1], max_v[2 * k + 2]);\n }\n else {\n max_v[k] = max_v[2 * k + 1];\n max_c[k] = max_c[2 * k + 1] + max_c[2 * k + 2];\n smax_v[k] = max(smax_v[2 * k + 1], smax_v[2 * k + 2]);\n }\n\n if (min_v[2 * k + 1] < min_v[2 * k + 2]) {\n min_v[k] = min_v[2 * k + 1];\n min_c[k] = min_c[2 * k + 1];\n smin_v[k] = min(smin_v[2 * k + 1], min_v[2 * k + 2]);\n }\n else if (min_v[2 * k + 1] > min_v[2 * k + 2]) {\n min_v[k] = min_v[2 * k + 2];\n min_c[k] = min_c[2 * k + 2];\n smin_v[k] = min(min_v[2 * k + 1], smin_v[2 * k + 2]);\n }\n else {\n min_v[k] = min_v[2 * k + 1];\n min_c[k] = min_c[2 * k + 1] + min_c[2 * k + 2];\n smin_v[k] = min(smin_v[2 * k + 1], smin_v[2 * k + 2]);\n }\n }\n\n void _update_min(ll x, int a, int b, int k, int l, int r) {\n if (b <= l || r <= a || max_v[k] <= x) {\n return;\n }\n if (a <= l && r <= b && smax_v[k] < x) {\n update_node_max(k, x);\n return;\n }\n\n push(k);\n _update_min(x, a, b, 2 * k + 1, l, (l + r) / 2);\n _update_min(x, a, b, 2 * k + 2, (l + r) / 2, r);\n update(k);\n }\n\n void _update_max(ll x, int a, int b, int k, int l, int r) {\n if (b <= l || r <= a || x <= min_v[k]) {\n return;\n }\n if (a <= l && r <= b && x < smin_v[k]) {\n update_node_min(k, x);\n return;\n }\n\n push(k);\n _update_max(x, a, b, 2 * k + 1, l, (l + r) / 2);\n _update_max(x, a, b, 2 * k + 2, (l + r) / 2, r);\n update(k);\n }\n\n void addall(int k, ll x) {\n max_v[k] += x;\n if (smax_v[k] != -inf) smax_v[k] += x;\n min_v[k] += x;\n if (smin_v[k] != inf) smin_v[k] += x;\n\n sum[k] += len[k] * x;\n if (lval[k] != inf) {\n lval[k] += x;\n }\n else {\n ladd[k] += x;\n }\n }\n\n void updateall(int k, ll x) {\n max_v[k] = x; smax_v[k] = -inf;\n min_v[k] = x; smin_v[k] = inf;\n max_c[k] = min_c[k] = len[k];\n\n sum[k] = x * len[k];\n lval[k] = x; ladd[k] = 0;\n }\n\n void _add_val(ll x, int a, int b, int k, int l, int r) {\n if (b <= l || r <= a) {\n return;\n }\n if (a <= l && r <= b) {\n addall(k, x);\n return;\n }\n\n push(k);\n _add_val(x, a, b, 2 * k + 1, l, (l + r) / 2);\n _add_val(x, a, b, 2 * k + 2, (l + r) / 2, r);\n update(k);\n }\n\n void _update_val(ll x, int a, int b, int k, int l, int r) {\n if (b <= l || r <= a) {\n return;\n }\n if (a <= l && r <= b) {\n updateall(k, x);\n return;\n }\n\n push(k);\n _update_val(x, a, b, 2 * k + 1, l, (l + r) / 2);\n _update_val(x, a, b, 2 * k + 2, (l + r) / 2, r);\n update(k);\n }\n\n ll _query_max(int a, int b, int k, int l, int r) {\n if (b <= l || r <= a) {\n return -inf;\n }\n if (a <= l && r <= b) {\n return max_v[k];\n }\n push(k);\n ll lv = _query_max(a, b, 2 * k + 1, l, (l + r) / 2);\n ll rv = _query_max(a, b, 2 * k + 2, (l + r) / 2, r);\n return max(lv, rv);\n }\n\n ll _query_min(int a, int b, int k, int l, int r) {\n if (b <= l || r <= a) {\n return inf;\n }\n if (a <= l && r <= b) {\n return min_v[k];\n }\n push(k);\n ll lv = _query_min(a, b, 2 * k + 1, l, (l + r) / 2);\n ll rv = _query_min(a, b, 2 * k + 2, (l + r) / 2, r);\n return min(lv, rv);\n }\n\n ll _query_sum(int a, int b, int k, int l, int r) {\n if (b <= l || r <= a) {\n return 0;\n }\n if (a <= l && r <= b) {\n return sum[k];\n }\n push(k);\n ll lv = _query_sum(a, b, 2 * k + 1, l, (l + r) / 2);\n ll rv = _query_sum(a, b, 2 * k + 2, (l + r) / 2, r);\n return lv + rv;\n }\n\npublic:\n SegmentTree(int n) {\n SegmentTree(n, nullptr);\n }\n\n SegmentTree(int n, ll* a) : n(n) {\n n0 = 1;\n while (n0 < n) n0 <<= 1;\n\n for (int i = 0; i < 2 * n0; ++i) ladd[i] = 0, lval[i] = inf;\n len[0] = n0;\n for (int i = 0; i < n0 - 1; ++i) len[2 * i + 1] = len[2 * i + 2] = (len[i] >> 1);\n\n for (int i = 0; i < n; ++i) {\n max_v[n0 - 1 + i] = min_v[n0 - 1 + i] = sum[n0 - 1 + i] = (a != nullptr ? a[i] : 0);\n smax_v[n0 - 1 + i] = -inf;\n smin_v[n0 - 1 + i] = inf;\n max_c[n0 - 1 + i] = min_c[n0 - 1 + i] = 1;\n }\n\n for (int i = n; i < n0; ++i) {\n max_v[n0 - 1 + i] = smax_v[n0 - 1 + i] = -inf;\n min_v[n0 - 1 + i] = smin_v[n0 - 1 + i] = inf;\n max_c[n0 - 1 + i] = min_c[n0 - 1 + i] = 0;\n }\n for (int i = n0 - 2; i >= 0; i--) {\n update(i);\n }\n }\n\n // range minimize query\n void update_min(int a, int b, ll x) {\n _update_min(x, a, b, 0, 0, n0);\n }\n\n // range maximize query\n void update_max(int a, int b, ll x) {\n _update_max(x, a, b, 0, 0, n0);\n }\n\n // range add query\n void add_val(int a, int b, ll x) {\n _add_val(x, a, b, 0, 0, n0);\n }\n\n // range update query\n void update_val(int a, int b, ll x) {\n _update_val(x, a, b, 0, 0, n0);\n }\n\n // range minimum query\n ll query_max(int a, int b) {\n return _query_max(a, b, 0, 0, n0);\n }\n\n // range maximum query\n ll query_min(int a, int b) {\n return _query_min(a, b, 0, 0, n0);\n }\n\n // range sum query\n ll query_sum(int a, int b) {\n return _query_sum(a, b, 0, 0, n0);\n }\n};\n\n\n\n\n\n// @param n `0 <= n`\n// @return minimum non-negative `x` s.t. `n <= 2**x`\nint ceil_pow2(int n) {\n int x = 0;\n while ((1U << x) < (unsigned int)(n)) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nconstexpr int bsf_constexpr(unsigned int n) {\n int x = 0;\n while (!(n & (1 << x))) x++;\n return x;\n}\n\n// @param n `1 <= n`\n// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`\nint bsf(unsigned int n) {\n#ifdef _MSC_VER\n unsigned long index;\n _BitScanForward(&index, n);\n return index;\n#else\n return __builtin_ctz(n);\n#endif\n}\n\ntemplate <class S,\n S(*op)(S, S),\n S(*e)(),\n class F,\n S(*mapping)(F, S),\n F(*composition)(F, F),\n F(*id)()>\nstruct lazy_segtree {\npublic:\n lazy_segtree() : lazy_segtree(0) {}\n explicit lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}\n explicit lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {\n log = ceil_pow2(_n);\n size = 1 << log;\n d = std::vector<S>(2 * size, e());\n lz = std::vector<F>(size, id());\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) {\n update(i);\n }\n }\n\n void set(int p, S x) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n\n S get(int p) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n return d[p];\n }\n\n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return e();\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n S sml = e(), smr = e();\n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n\n return op(sml, smr);\n }\n\n S all_prod() { return d[1]; }\n\n void apply(int p, F f) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = mapping(f, d[p]);\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n void apply(int l, int r, F f) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return;\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n {\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) all_apply(l++, f);\n if (r & 1) all_apply(--r, f);\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n }\n\n for (int i = 1; i <= log; i++) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n\n template <bool (*g)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return g(x); });\n }\n template <class G> int max_right(int l, G g) {\n assert(0 <= l && l <= _n);\n assert(g(e()));\n if (l == _n) return _n;\n l += size;\n for (int i = log; i >= 1; i--) push(l >> i);\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!g(op(sm, d[l]))) {\n while (l < size) {\n push(l);\n l = (2 * l);\n if (g(op(sm, d[l]))) {\n sm = op(sm, d[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = op(sm, d[l]);\n l++;\n } while ((l & -l) != l);\n return _n;\n }\n\n template <bool (*g)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return g(x); });\n }\n template <class G> int min_left(int r, G g) {\n assert(0 <= r && r <= _n);\n assert(g(e()));\n if (r == 0) return 0;\n r += size;\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!g(op(d[r], sm))) {\n while (r < size) {\n push(r);\n r = (2 * r + 1);\n if (g(op(d[r], sm))) {\n sm = op(d[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = op(d[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n\nprivate:\n int _n, size, log;\n std::vector<S> d;\n std::vector<F> lz;\n\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n void all_apply(int k, F f) {\n d[k] = mapping(f, d[k]);\n if (k < size) lz[k] = composition(f, lz[k]);\n }\n void push(int k) {\n all_apply(2 * k, lz[k]);\n all_apply(2 * k + 1, lz[k]);\n lz[k] = id();\n }\n};\n\n\nint op(int a, int b) { return a + b; }\nint e() { return 0; }\nint mapping(bool a, int b) {\n if (a == 1) return -b;\n return b;\n}\nbool composition(bool a, bool b) { return a xor b; }\nbool id() { return false; }\n\n\n//int32_t Q[110000][3];\n\nint main()\n{\n\tusing std::endl;\n\tin.sync_with_stdio(false);\n\tout.sync_with_stdio(false);\n\tin.tie(nullptr);\n\tout.tie(nullptr);\n\n\tin >> W_max >> M;\n\tfor (size_t i = 0; i < M; i++)\n\t{\n\t\tin >> X_in[i];\n\t}\n\tstd::sort(X_in, X_in + M);\n static SegmentTree postree(M, X_in);\n //for (size_t i = 0; i < M; i++)\n //{\n // postree.add_val(i, i+1, X_in[i]);\n //}\n //for (size_t i = 0; i < M; i++)\n //{\n // std::cerr << \"DEBUG:\" << postree.query_sum(i, i + 1) << endl;\n //}\n\n std::vector<int> one(M, 1);\n lazy_segtree<int, op, e, bool, mapping, composition, id> seg(one);\n // test\n //printf(\"%d\\n\", seg.prod(5, 10)); // [5, 10) sum -> 5\n //seg.apply(3, 8, true); // [3, 8)反転\n //printf(\"%d\\n\", seg.prod(5, 10)); // [5, 10) sum -> -1 -1 -1 1 1 -> -1\n //seg.apply(7, 10, true); // [7, 10)反転\n //printf(\"%d\\n\", seg.prod(5, 10)); // [5, 10) sum -> -1 -1 1 -1 -1 -> -3\n\n\n in >> Q;\n\tfor (size_t i = 0; i < Q; i++)\n\t{\n int type;\n in >> type;\n if (type == 1) {\n int a, b, c;\n in >> a >> b >> c;\n\n using BS_INT = int64_t;\n BS_INT ok_range = M, ng_range = -1;\n while (std::abs(ok_range - ng_range) > 1) {\n BS_INT mid = (ok_range + ng_range) / 2;\n bool is_ok = false;\n\n is_ok = a <= postree.query_sum(mid, mid + 1);\n\n if (is_ok) {\n ok_range = mid;\n }\n else {\n ng_range = mid;\n }\n }\n auto a_index = ok_range;\n\n ok_range = M, ng_range = -1;\n while (std::abs(ok_range - ng_range) > 1) {\n BS_INT mid = (ok_range + ng_range) / 2;\n bool is_ok = false;\n\n is_ok = b < postree.query_sum(mid, mid + 1);\n\n if (is_ok) {\n ok_range = mid;\n }\n else {\n ng_range = mid;\n }\n }\n auto b_index_end = ok_range;\n\n postree.add_val(a_index, b_index_end, c);\n postree.update_min(a_index, b_index_end, b);\n postree.update_max(a_index, b_index_end, a);\n\n seg.apply(a_index, b_index_end, true);\n }\n else {\n int a, b;\n\n in >> a >> b;\n\n using BS_INT = int64_t;\n BS_INT ok_range = M, ng_range = -1;\n while (std::abs(ok_range - ng_range) > 1) {\n BS_INT mid = (ok_range + ng_range) / 2;\n bool is_ok = false;\n\n is_ok = a <= postree.query_sum(mid, mid + 1);\n\n if (is_ok) {\n ok_range = mid;\n }\n else {\n ng_range = mid;\n }\n }\n auto a_index = ok_range;\n\n ok_range = M, ng_range = -1;\n while (std::abs(ok_range - ng_range) > 1) {\n BS_INT mid = (ok_range + ng_range) / 2;\n bool is_ok = false;\n\n is_ok = b < postree.query_sum(mid, mid + 1);\n\n if (is_ok) {\n ok_range = mid;\n }\n else {\n ng_range = mid;\n }\n }\n auto b_index_end = ok_range;\n\n if (M <= a_index) {\n out << 0 << '\\n';\n }\n else {\n out << seg.prod(a_index, b_index_end) << '\\n';\n }\n }\n\n\n\t}\n\n\n\treturn 0;\n}\n#endif", "accuracy": 1, "time_ms": 1160, "memory_kb": 45260, "score_of_the_acc": -1.7823, "final_rank": 12 }, { "submission_id": "aoj_0474_6280083", "code_snippet": "#include <iostream>\n#include <unordered_map>\n#include <unordered_set>\n#include <set>\n#include <vector>\n#include <numeric>\n#include <algorithm>\n#include <queue>\n#include <string>\n#include <random>\n#include <array>\n#include <climits>\n#include <map>\n#include <cassert>\ntemplate<typename V, typename F, typename P, typename A, typename C>\nclass LazySeg {\n\tint log, size;\n\tstd::vector<V> v;\n\tstd::vector<F> f;\n\tV zero;\n\tF id;\n\tP plus;//(left_from, left_until, left_value, right_from, right_until, right_value) -> new_value;\n\tA apply;//(from, until, func, value) -> new_value;\n\tC compose;//(from, until, new_func, old_func) -> new_func;\n\tvoid apply_range(const int from, const int until) {\n\t\tint left = from + (1 << log);\n\t\tint right = until + (1 << log);\n\t\tfor (auto depth = log; depth > 0; --depth) {\n\t\t\tif ((left >> depth << depth) != left) {\n\t\t\t\tconst auto parent = left >> depth;\n\t\t\t\tconst auto l = (parent << depth) - (1 << log);\n\t\t\t\tconst auto m = std::min(size, l + (1 << depth - 1));\n\t\t\t\tconst auto r = std::min(size, l + (1 << depth));\n\t\t\t\tv[parent << 1] = apply(l, m, f[parent], v[parent << 1]);\n\t\t\t\tif (m < size) v[(parent << 1) + 1] = apply(m, r, f[parent], v[(parent << 1) + 1]);\n\t\t\t\tif (depth > 1) {\n\t\t\t\t\tf[parent << 1] = compose(l, m, f[parent], f[parent << 1]);\n\t\t\t\t\tif (m < size) f[(parent << 1) + 1] = compose(m, r, f[parent], f[(parent << 1) + 1]);\n\t\t\t\t}\n\t\t\t\tf[parent] = id;\n\t\t\t}\n\t\t\tif ((right >> depth << depth) != right) {\n\t\t\t\tconst auto parent = right >> depth;\n\t\t\t\tconst auto l = (parent << depth) - (1 << log);\n\t\t\t\tconst auto m = std::min(size, l + (1 << depth - 1));\n\t\t\t\tconst auto r = std::min(size, l + (1 << depth));\n\t\t\t\tv[parent << 1] = apply(l, m, f[parent], v[parent << 1]);\n\t\t\t\tif (m < size) v[(parent << 1) + 1] = apply(m, r, f[parent], v[(parent << 1) + 1]);\n\t\t\t\tif (depth > 1) {\n\t\t\t\t\tf[parent << 1] = compose(l, m, f[parent], f[parent << 1]);\n\t\t\t\t\tif (m < size) f[(parent << 1) + 1] = compose(m, r, f[parent], f[(parent << 1) + 1]);\n\t\t\t\t}\n\t\t\t\tf[parent] = id;\n\t\t\t}\n\t\t}\n\t}\n\tvoid accumulate_range(const int from, const int until) {\n\t\tconst int left = from + (1 << log);\n\t\tconst int right = until + (1 << log);\n\t\tfor (auto depth = 1; depth <= log; ++depth) {\n\t\t\tif ((left >> depth << depth) != left) {\n\t\t\t\tconst auto parent = left >> depth;\n\t\t\t\tconst auto l = (parent << depth) - (1 << log);\n\t\t\t\tconst auto m = l + (1 << depth - 1);\n\t\t\t\tconst auto r = std::min(size, l + (1 << depth));\n\t\t\t\tif (m < size) v[parent] = plus(l, m, v[parent << 1], m, r, v[(parent << 1) + 1]);\n\t\t\t\telse v[parent] = v[parent << 1];\n\t\t\t}\n\t\t\tif ((right >> depth << depth) != right) {\n\t\t\t\tconst auto parent = right >> depth;\n\t\t\t\tif (parent == (left >> depth) && (left >> depth << depth) != left) continue;\n\t\t\t\tconst auto l = (parent << depth) - (1 << log);\n\t\t\t\tconst auto m = l + (1 << depth - 1);\n\t\t\t\tconst auto r = std::min(size, l + (1 << depth));\n\t\t\t\tif (m < size) v[parent] = plus(l, m, v[parent << 1], m, r, v[(parent << 1) + 1]);\n\t\t\t\telse v[parent] = v[parent << 1];\n\t\t\t}\n\t\t}\n\t}\n\tstatic int log2ceil(int value) {\n\t\tint result = 0;\n\t\twhile (value > 1) {\n\t\t\tvalue = (value + 1) >> 1;\n\t\t\tresult += 1;\n\t\t}\n\t\treturn result;\n\t}\npublic:\n\tLazySeg(const int size, const V& zero, const F& id, const P& plus, const A& apply, const C& compose) : log{ log2ceil(size) }, size{ size }, v(2 << log, zero), f(1 << log, id), zero{zero}, id{id}, plus{plus}, apply{apply}, compose{compose}{};\n\tLazySeg(const std::vector<V>& initial, const V& zero, const F& id, const P& plus, const A& apply, const C& compose) : log{ log2ceil(initial.size()) }, size{ (int)initial.size() }, v(2 << log, zero), f(1 << log, id), zero{ zero }, id{ id }, plus{ plus }, apply{ apply }, compose{ compose }{\n\t\tfor (auto i = 0; i < initial.size(); ++i) {\n\t\t\tv[i + (1 << log)] = initial[i];\n\t\t}\n\t\tfor (auto d = 1; d <= log; ++d) {\n\t\t\tconst auto diff = 1 << (d - 1);\n\t\t\tfor (auto i = 0; i < size >> d; ++i) {\n\t\t\t\tconst auto parent = i + (1 << log - d);\n\t\t\t\tv[parent] = plus(i << d, (i << d) + diff, v[parent << 1], (i << d) + diff, (i + 1) << d, v[(parent << 1) + 1]);\n\t\t\t}\n\t\t\tif (size >> d << d == size) continue;\n\t\t\tconst auto parent = (size >> d) + (1 << log - d);\n\t\t\tif (size <= (size >> d << d) + diff) v[parent] = v[parent << 1];\n\t\t\telse v[parent] = plus(size >> d << d, (size >> d << d) + diff, v[parent << 1], (size >> d << d) + diff, size, v[(parent << 1) + 1]);\n\t\t}\n\t};\n\tV get(const int from, const int until) {\n\t\tapply_range(from, until);\n\t\tint left = from + (1 << log);\n\t\tint right = until + (1 << log);\n\t\tint mid{ from };\n\t\tV left_result = zero;\n\t\tV right_result = zero;\n\t\tfor (auto depth = 0; depth <= log && left < right; ++depth) {\n\t\t\tif (left & 1) {\n\t\t\t\tconst auto l = (left << depth) - (1 << log);\n\t\t\t\tconst auto r = std::min(size, (left + 1 << depth) - (1 << log));\n\t\t\t\tleft_result = plus(from, l, left_result, l, r, v[left]);\n\t\t\t\tleft += 1;\n\t\t\t\tmid += 1 << depth;\n\t\t\t}\n\t\t\tif (right & 1) {\n\t\t\t\tright -= 1;\n\t\t\t\tconst auto l = (right << depth) - (1 << log);\n\t\t\t\tconst auto r = (right + 1 << depth) - (1 << log);\n\t\t\t\tright_result = plus(l, r, v[right], r, until, right_result);\n\t\t\t}\n\t\t\tleft >>= 1;\n\t\t\tright >>= 1;\n\t\t}\n\t\treturn plus(from, mid, left_result, mid, until, right_result);\n\t}\n\tvoid update(const int from, const int until, const F& func) {\n\t\tapply_range(from, until);\n\t\tint left = from + (1 << log);\n\t\tint right = until + (1 << log);\n\t\tfor (auto depth = 0; depth <= log && left < right; ++depth) {\n\t\t\tif (left & 1) {\n\t\t\t\tconst auto l = (left << depth) - (1 << log);\n\t\t\t\tconst auto r = std::min(size, (left + 1 << depth) - (1 << log));\n\t\t\t\tif (depth > 0) {\n\t\t\t\t\tf[left] = compose(l, r, func, f[left]);\n\t\t\t\t}\n\t\t\t\tv[left] = apply(l, r, func, v[left]);\n\t\t\t\tleft += 1;\n\t\t\t}\n\t\t\tif (right & 1) {\n\t\t\t\tright -= 1;\n\t\t\t\tconst auto l = (right << depth) - (1 << log);\n\t\t\t\tconst auto r = std::min(size, (right + 1 << depth) - (1 << log));\n\t\t\t\tif (depth > 0) {\n\t\t\t\t\tf[right] = compose(l, r, func, f[right]);\n\t\t\t\t}\n\t\t\t\tv[right] = apply(l, r, func, v[right]);\n\t\t\t}\n\t\t\tleft >>= 1;\n\t\t\tright >>= 1;\n\t\t}\n\t\taccumulate_range(from, until);\n\t}\n};\nclass SumBit {\n\tstd::vector<int> vec;\npublic:\n\tSumBit(const int size) : vec(size, 0) {};\n\tint get(int position) const {\n\t\tint result = 0;\n\t\twhile (position >= 0) {\n\t\t\tresult += vec[position];\n\t\t\tposition -= ~position & (position + 1);\n\t\t}\n\t\treturn result;\n\t}\n\tvoid add(int position, const int value) {\n\t\twhile (position < vec.size()) {\n\t\t\tvec[position] += value;\n\t\t\tposition += ~position & (position + 1);\n\t\t}\n\t}\n};\ntemplate<typename P>\nint first_true(int from, int until, const P& predicate) {\n\twhile (from < until) {\n\t\tconst auto mid = (from + until) >> 1;\n\t\tif (predicate(mid)) {\n\t\t\tuntil = mid;\n\t\t}\n\t\telse {\n\t\t\tfrom = mid + 1;\n\t\t}\n\t}\n\treturn until;\n}\nint main() {\n\tint n, m; std::cin >> n >> m;\n\tstd::vector<int> initial(m);\n\tfor (auto& x : initial) {\n\t\tstd::cin >> x;\n\t}\n\tint q; std::cin >> q;\n\tstd::vector<std::vector<int>> queries(q);\n\tfor (auto& query : queries) {\n\t\tint t; std::cin >> t;\n\t\tif (t == 1) query.resize(3);\n\t\telse query.resize(2);\n\t\tfor (auto& a : query) {\n\t\t\tstd::cin >> a;\n\t\t}\n\t}\n\tstd::sort(initial.begin(), initial.end());\n\tconst auto zero = 0;\n\tconst auto id = false;\n\tconst auto plus = [](const int left_from, const int left_until, const int left_value, const int right_from, const int right_until, const int right_value) {\n\t\treturn left_value + right_value;\n\t};\n\tconst auto apply = [](const int from, const int until, const bool flip, const int sum) {\n\t\tif (flip) return until - from - sum;\n\t\treturn sum;\n\t};\n\tconst auto compose = [](const int from, const int until, const bool new_op, const bool old_op) {\n\t\treturn new_op ^ old_op;\n\t};\n\tauto seg = LazySeg(m, zero, id, plus, apply, compose);\n\tSumBit shift(m);\n\tfor (const auto query : queries) {\n\t\tif (query.size() == 3) {\n\t\t\tconst auto a = query[0];\n\t\t\tconst auto b = query[1];\n\t\t\tconst auto c = query[2];\n\t\t\tconst auto from = first_true(0, m, [&](const int position) {return a <= shift.get(position) + initial[position]; });\n\t\t\tconst auto until = first_true(from, m, [&](const int position) {return b < shift.get(position) + initial[position]; });\n\t\t\tseg.update(from, until, true);\n\t\t\tif (c > 0) {\n\t\t\t\tconst auto mid = first_true(from, until, [&](const int position) {return b - c < shift.get(position) + initial[position]; });\n\t\t\t\tshift.add(from, c);\n\t\t\t\tshift.add(mid, -c);\n\t\t\t\tfor (auto i = mid; i < until; ) {\n\t\t\t\t\tconst auto target = shift.get(i) + initial[i];\n\t\t\t\t\tconst auto last = first_true(i, until, [&](const int position) {return target < shift.get(position) + initial[position]; });\n\t\t\t\t\tif (target != b) {\n\t\t\t\t\t\tshift.add(i, b - target);\n\t\t\t\t\t\tshift.add(last, target - b);\n\t\t\t\t\t}\n\t\t\t\t\ti = last;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tconst auto mid = first_true(from, until, [&](const int position) {return a - c <= shift.get(position) + initial[position]; });\n\t\t\t\tshift.add(mid, c);\n\t\t\t\tshift.add(until, -c);\n\t\t\t\tfor (auto i = from; i < mid; ) {\n\t\t\t\t\tconst auto target = shift.get(i) + initial[i];\n\t\t\t\t\tconst auto last = first_true(i, mid, [&](const int position) {return target < shift.get(position) + initial[position]; });\n\t\t\t\t\tif (target != a) {\n\t\t\t\t\t\tshift.add(i, a - target);\n\t\t\t\t\t\tshift.add(last, target - a);\n\t\t\t\t\t}\n\t\t\t\t\ti = last;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tconst auto d = query[0];\n\t\t\tconst auto e = query[1];\n\t\t\tconst auto from = first_true(0, m, [&](const int position) {return d <= shift.get(position) + initial[position]; });\n\t\t\tconst auto until = first_true(from, m, [&](const int position) {return e < shift.get(position) + initial[position]; });\n\t\t\tconst auto sum = seg.get(from, until);\n\t\t\tconst auto diff = (until - from) - sum * 2;\n\t\t\tstd::cout << diff << '\\n';\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 200, "memory_kb": 10432, "score_of_the_acc": -0.2987, "final_rank": 4 }, { "submission_id": "aoj_0474_6074210", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n\n#define SIZE 100005\n\n\nstruct NA{\n\tNA(){\n\n\t\tL = R = 0;\n\t\tvalue = 0;\n\t}\n\tNA(ll arg_L,ll arg_R,ll arg_value){\n\t\tL = arg_L;\n\t\tR = arg_R;\n\t\tvalue = arg_value;\n\t}\n\tvoid set(ll arg_L,ll arg_R,ll arg_value){\n\t\tL = arg_L;\n\t\tR = arg_R;\n\t\tvalue = arg_value;\n\t}\n\tll L,R,value;\n};\n\nstruct Info{ //■■更新情報■■\n\tll L,R,move,num_rev;\n\tbool FLG;\n};\n\nint N = 1;\nInfo info[6*SIZE];\nNA ans[6*SIZE];\n\nvoid init(int first_N){\n\twhile(N < first_N)N *= 2;\n}\n\nvoid first_update(int loc,ll x){\n\tloc += N-1;\n\n\tans[loc].L = x;\n\tans[loc].R = x;\n\tans[loc].value = 1;\n\n\tif(N == 1)return;\n\n\tint parent = (loc-1)/2;\n\n\twhile(true){\n\n\t\tint l_ch = 2*parent+1;\n\t\tint r_ch = 2*parent+2;\n\n\t\tans[parent].L = min(ans[l_ch].L,ans[r_ch].L);\n\t\tans[parent].R = max(ans[l_ch].R,ans[r_ch].R);\n\t\tans[parent].value = ans[l_ch].value+ans[r_ch].value;\n\n\t\tif(parent == 0)break;\n\t\telse{\n\t\t\tparent = (parent-1)/2;\n\t\t}\n\t}\n}\n\nvoid update_info(int node_id,int node_left,int node_right){\n\n\tif(!info[node_id].FLG){\n\n\t\treturn;\n\t}\n\n\tif(node_right-node_left+1 >= 2){\n\t\t/*子に更新情報伝達*/\n\n\t\tll move = info[node_id].move;\n\n\t\t//左の子\n\t\t{\n\t\t\tint L_child = 2*node_id+1;\n\n\t\t\tinfo[L_child].L = info[node_id].L;\n\n\t\t\tif(!info[L_child].FLG){ //子に新しく情報を伝える\n\n\t\t\t\tinfo[L_child].R = ans[L_child].R+move;\n\n\t\t\t}else{\n\n\t\t\t\tinfo[L_child].R = info[L_child].R+move;\n\t\t\t}\n\n\t\t\t//■■■■範囲に収める■■■■\n\t\t\tinfo[L_child].R = max(info[L_child].R,info[node_id].L);\n\t\t\tinfo[L_child].R = min(info[L_child].R,info[node_id].R);\n\n\t\t\tinfo[L_child].move += move;\n\t\t\tinfo[L_child].num_rev += info[node_id].num_rev;\n\t\t\tinfo[L_child].FLG = true;\n\t\t}\n\n\t\t//右の子\n\t\t{\n\t\t\tint R_child = 2*node_id+2;\n\n\t\t\tinfo[R_child].R = info[node_id].R;\n\n\t\t\tif(!info[R_child].FLG){\n\n\t\t\t\tinfo[R_child].L = ans[R_child].L+move;\n\n\t\t\t}else{\n\n\t\t\t\tinfo[R_child].L =info[R_child].L+move;\n\t\t\t}\n\n\t\t\t//■■■■範囲に収める■■■■\n\t\t\tinfo[R_child].L = max(info[R_child].L,info[node_id].L);\n\t\t\tinfo[R_child].L = min(info[R_child].L,info[node_id].R);\n\n\t\t\tinfo[R_child].move += move;\n\t\t\tinfo[R_child].num_rev += info[node_id].num_rev;\n\t\t\tinfo[R_child].FLG = true;\n\t\t}\n\t}\n\n\t//自分を更新\n\tans[node_id].L = info[node_id].L;\n\tans[node_id].R = info[node_id].R;\n\tif((info[node_id].num_rev%2) == 1){\n\n\t\tans[node_id].value *= -1;\n\t}\n\n\tinfo[node_id].FLG = false;\n\n\tinfo[node_id].move = 0;\n\tinfo[node_id].num_rev = 0;\n}\n\n\nvoid update(ll update_left,ll update_right,ll move,int node_id,int node_left,int node_right){\n\n\tupdate_info(node_id,node_left,node_right); //旧情報を処理(子に自分の情報を伝える)\n\n\tif(update_right < ans[node_id].L || update_left > ans[node_id].R)return;\n\n\tif(update_left <= ans[node_id].L && update_right >= ans[node_id].R){ //■ノードの左端と右端の値が、更新の左端値と右端値に完全に含まれていれば更新■\n\n\t\tinfo[node_id].FLG = true;\n\n\t\tll L,R;\n\n\t\tL = ans[node_id].L+move;\n\t\tR = ans[node_id].R+move;\n\n\t\t//■■■■範囲に収める■■■■\n\t\tL = min(L,update_right);\n\t\tL = max(L,update_left);\n\n\t\tR = min(R,update_right);\n\t\tR = max(R,update_left);\n\n\n\t\tinfo[node_id].L = L; //移動後のL\n\t\tinfo[node_id].R = R; //移動後のR\n\n\t\tinfo[node_id].move = move;\n\t\tinfo[node_id].num_rev = 1;\n\n\t\tupdate_info(node_id,node_left,node_right); //新情報を処理\n\n\t\treturn;\n\n\t}else{\n\n\t\tint l_ch = 2*node_id+1;\n\t\tint r_ch = 2*node_id+2;\n\n\t\tupdate(update_left,update_right,move,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tupdate(update_left,update_right,move,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\t\t//■■情報を更新■■\n\t\tans[node_id].L = min(ans[l_ch].L,ans[r_ch].L);\n\t\tans[node_id].R = max(ans[l_ch].R,ans[r_ch].R);\n\t\tans[node_id].value = ans[l_ch].value + ans[r_ch].value;\n\t}\n}\n\nll query(ll search_left,ll search_right,int node_id,int node_left,int node_right){\n\n\tupdate_info(node_id,node_left,node_right); //旧情報を処理(子に自分の情報を伝える)\n\n\tif(search_right < ans[node_id].L || search_left > ans[node_id].R){\n\n\t\treturn 0;\n\t}\n\n\tif(search_left <= ans[node_id].L && search_right >= ans[node_id].R){\n\n\t\treturn ans[node_id].value;\n\n\t}else{\n\n\t\tll left = query(search_left,search_right,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tll right = query(search_left,search_right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\t\tint l_ch = 2*node_id+1;\n\t\tint r_ch = 2*node_id+2;\n\n\t\t//■■情報を更新■■\n\t\tans[node_id].L = min(ans[l_ch].L,ans[r_ch].L);\n\t\tans[node_id].R = max(ans[l_ch].R,ans[r_ch].R);\n\t\tans[node_id].value = ans[l_ch].value + ans[r_ch].value;\n\n\t\treturn left+right;\n\t}\n}\n\n\nint main(){\n\n\tll maxi;\n\tint M;\n\tscanf(\"%lld %d\",&maxi,&M);\n\n\tinit(M);\n\n\tfor(int i = 0; i <= 2*N-2; i++){\n\t\tinfo[i].FLG = false;\n\n\t\tans[i].value = 0;\n\t\tans[i].L = HUGE_NUM;\n\t\tans[i].R = 0;\n\n\t\tinfo[i].move = 0;\n\t\tinfo[i].num_rev = 0;\n\t}\n\n\tvector<ll> vec;\n\tll tmp;\n\tfor(int i = 0; i < M; i++){\n\n\t\tscanf(\"%lld\",&tmp);\n\t\tvec.push_back(tmp);\n\t}\n\tsort(vec.begin(),vec.end());\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tfirst_update(i,vec[i]);\n\t}\n\n\n\tint num_Q;\n\tscanf(\"%d\",&num_Q);\n\n\tint command;\n\tll a,b,c;\n\tll d,e;\n\n\n\tfor(int loop = 0; loop < num_Q; loop++){\n\n\t\tscanf(\"%d\",&command);\n\t\tif(command == 1){\n\n\t\t\tscanf(\"%lld %lld %lld\",&a,&b,&c);\n\n\t\t\t//更新処理\n\t\t\tupdate(a,b,c,0,0,N-1);\n\n\t\t}else{\n\n\t\t\tscanf(\"%lld %lld\",&d,&e);\n\t\t\t//出力処理\n\t\t\tprintf(\"%lld\\n\",query(d,e,0,0,N-1));\n\t\t}\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 28220, "score_of_the_acc": -0.7025, "final_rank": 9 }, { "submission_id": "aoj_0474_6074200", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n\n#define SIZE 100005\n\n\nstruct NA{\n\tNA(){\n\n\t\tL = R = 0;\n\t\tvalue = 0;\n\t}\n\tNA(ll arg_L,ll arg_R,ll arg_value){\n\t\tL = arg_L;\n\t\tR = arg_R;\n\t\tvalue = arg_value;\n\t}\n\tvoid set(ll arg_L,ll arg_R,ll arg_value){\n\t\tL = arg_L;\n\t\tR = arg_R;\n\t\tvalue = arg_value;\n\t}\n\tll L,R,value;\n};\n\nstruct Info{ //■■更新情報■■\n\tll L,R,move,num_rev;\n\tbool FLG;\n};\n\nint N = 1;\nInfo info[6*SIZE];\nNA ans[6*SIZE];\nbool broken[6*SIZE];\n\nvoid init(int first_N){\n\twhile(N < first_N)N *= 2;\n}\n\nvoid first_update(int loc,ll x){\n\tloc += N-1;\n\n\tans[loc].L = x;\n\tans[loc].R = x;\n\tans[loc].value = 1;\n\n\tif(N == 1)return;\n\n\tint parent = (loc-1)/2;\n\n\twhile(true){\n\n\t\tint l_ch = 2*parent+1;\n\t\tint r_ch = 2*parent+2;\n\n\t\tans[parent].L = min(ans[l_ch].L,ans[r_ch].L);\n\t\tans[parent].R = max(ans[l_ch].R,ans[r_ch].R);\n\t\tans[parent].value = ans[l_ch].value+ans[r_ch].value;\n\n\t\tif(parent == 0)break;\n\t\telse{\n\t\t\tparent = (parent-1)/2;\n\t\t}\n\t}\n}\n\nvoid update_info(int node_id,int node_left,int node_right){\n\n\tif(!info[node_id].FLG){\n\n\t\treturn;\n\t}\n\n\tif(node_right-node_left+1 >= 2){\n\t\t/*子に更新情報伝達*/\n\n\t\tll move = info[node_id].move;\n\n\t\t//左の子\n\t\t{\n\t\t\tint L_child = 2*node_id+1;\n\n\t\t\tinfo[L_child].L = info[node_id].L;\n\n\t\t\tif(!info[L_child].FLG){ //子に新しく情報を伝える\n\n\t\t\t\tinfo[L_child].R = ans[L_child].R+move;\n\n\t\t\t}else{\n\n\t\t\t\tinfo[L_child].R = info[L_child].R+move;\n\t\t\t}\n\n\t\t\t//■■■■範囲に収める■■■■\n\t\t\tinfo[L_child].R = max(info[L_child].R,info[node_id].L);\n\t\t\tinfo[L_child].R = min(info[L_child].R,info[node_id].R);\n\n\t\t\tinfo[L_child].move += move;\n\t\t\tinfo[L_child].num_rev += info[node_id].num_rev;\n\t\t\tinfo[L_child].FLG = true;\n\t\t}\n\n\t\t//右の子\n\t\t{\n\t\t\tint R_child = 2*node_id+2;\n\n\t\t\tinfo[R_child].R = info[node_id].R;\n\n\t\t\tif(!info[R_child].FLG){\n\n\t\t\t\tinfo[R_child].L = ans[R_child].L+move;\n\n\t\t\t}else{\n\n\t\t\t\tinfo[R_child].L =info[R_child].L+move;\n\t\t\t}\n\n\t\t\t//■■■■範囲に収める■■■■\n\t\t\tinfo[R_child].L = max(info[R_child].L,info[node_id].L);\n\t\t\tinfo[R_child].L = min(info[R_child].L,info[node_id].R);\n\n\t\t\tinfo[R_child].move += move;\n\t\t\tinfo[R_child].num_rev += info[node_id].num_rev;\n\t\t\tinfo[R_child].FLG = true;\n\t\t}\n\t}\n\n\t//自分を更新\n\tans[node_id].L = info[node_id].L;\n\tans[node_id].R = info[node_id].R;\n\tif((info[node_id].num_rev%2) == 1){\n\n\t\tans[node_id].value *= -1;\n\t}\n\n\tinfo[node_id].FLG = false;\n\n\tinfo[node_id].move = 0;\n\tinfo[node_id].num_rev = 0;\n}\n\n\nvoid update(ll update_left,ll update_right,ll move,int node_id,int node_left,int node_right){\n\n\tupdate_info(node_id,node_left,node_right); //旧情報を処理(子に自分の情報を伝える)\n\n\tif(update_right < ans[node_id].L || update_left > ans[node_id].R)return;\n\n\tif(update_left <= ans[node_id].L && update_right >= ans[node_id].R){\n\n\t\tinfo[node_id].FLG = true;\n\n\t\tll L,R;\n\n\t\tL = ans[node_id].L+move;\n\t\tR = ans[node_id].R+move;\n\n\t\t//■■■■範囲に収める■■■■\n\t\tL = min(L,update_right);\n\t\tL = max(L,update_left);\n\n\t\tR = min(R,update_right);\n\t\tR = max(R,update_left);\n\n\n\t\tinfo[node_id].L = L; //移動後のL\n\t\tinfo[node_id].R = R; //移動後のR\n\n\t\tinfo[node_id].move = move;\n\t\tinfo[node_id].num_rev = 1;\n\n\t\tupdate_info(node_id,node_left,node_right); //新情報を処理\n\n\t\treturn;\n\n\t}else{\n\n\t\tint l_ch = 2*node_id+1;\n\t\tint r_ch = 2*node_id+2;\n\n\t\tupdate(update_left,update_right,move,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tupdate(update_left,update_right,move,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\t\tans[node_id].L = min(ans[l_ch].L,ans[r_ch].L);\n\t\tans[node_id].R = max(ans[l_ch].R,ans[r_ch].R);\n\t\tans[node_id].value = ans[l_ch].value + ans[r_ch].value;\n\t}\n}\n\nll query(ll search_left,ll search_right,int node_id,int node_left,int node_right){\n\n\tupdate_info(node_id,node_left,node_right); //旧情報を処理(子に自分の情報を伝える)\n\n\tif(search_right < ans[node_id].L || search_left > ans[node_id].R){\n\n\t\treturn 0;\n\n\t}\n\n\tif(search_left <= ans[node_id].L && search_right >= ans[node_id].R){\n\n\n\t\treturn ans[node_id].value;\n\n\t}else{\n\n\t\tll left = query(search_left,search_right,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tll right = query(search_left,search_right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\t\tint l_ch = 2*node_id+1;\n\t\tint r_ch = 2*node_id+2;\n\n\t\tans[node_id].L = min(ans[l_ch].L,ans[r_ch].L);\n\t\tans[node_id].R = max(ans[l_ch].R,ans[r_ch].R);\n\t\tans[node_id].value = ans[l_ch].value + ans[r_ch].value;\n\n\t\treturn left+right;\n\t}\n}\n\n\nint main(){\n\n\tll maxi;\n\tint M;\n\tscanf(\"%lld %d\",&maxi,&M);\n\n\tinit(M);\n\n\tfor(int i = 0; i <= 2*N-2; i++){\n\t\tinfo[i].FLG = false;\n\n\t\tans[i].value = 0;\n\t\tans[i].L = HUGE_NUM;\n\t\tans[i].R = 0;\n\n\t\tinfo[i].move = 0;\n\t\tinfo[i].num_rev = 0;\n\t}\n\n\tvector<ll> vec;\n\tll tmp;\n\tfor(int i = 0; i < M; i++){\n\n\t\tscanf(\"%lld\",&tmp);\n\t\tvec.push_back(tmp);\n\t}\n\tsort(vec.begin(),vec.end());\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tfirst_update(i,vec[i]);\n\t}\n\n\n\tint num_Q;\n\tscanf(\"%d\",&num_Q);\n\n\tint command;\n\tll a,b,c;\n\tll d,e;\n\n\n\tfor(int loop = 0; loop < num_Q; loop++){\n\n\t\tscanf(\"%d\",&command);\n\t\tif(command == 1){\n\n\t\t\tscanf(\"%lld %lld %lld\",&a,&b,&c);\n\n\t\t\t//更新処理\n\t\t\tupdate(a,b,c,0,0,N-1);\n\n\t\t}else{\n\n\t\t\tscanf(\"%lld %lld\",&d,&e);\n\t\t\t//出力処理\n\t\t\tprintf(\"%lld\\n\",query(d,e,0,0,N-1));\n\t\t}\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 180, "memory_kb": 28224, "score_of_the_acc": -0.7094, "final_rank": 10 }, { "submission_id": "aoj_0474_6071739", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n\n#define SIZE 100005\n\n\nstruct NA{\n\tNA(){\n\n\t\tL = R = 0;\n\t\tvalue = 0;\n\t}\n\tNA(ll arg_L,ll arg_R,ll arg_value){\n\t\tL = arg_L;\n\t\tR = arg_R;\n\t\tvalue = arg_value;\n\t}\n\tvoid set(ll arg_L,ll arg_R,ll arg_value){\n\t\tL = arg_L;\n\t\tR = arg_R;\n\t\tvalue = arg_value;\n\t}\n\tll L,R,value;\n};\n\nstruct Info{ //■■更新情報■■\n\tll L,R,move,num_rev;\n\tbool FLG;\n};\n\nint N = 1;\nInfo info[6*SIZE];\nNA ans[6*SIZE];\nbool broken[6*SIZE];\n\nvoid init(int first_N){\n\twhile(N < first_N)N *= 2;\n}\n\nvoid first_update(int loc,ll x){\n\tloc += N-1;\n\n\tans[loc].L = x;\n\tans[loc].R = x;\n\tans[loc].value = 1;\n\n\tif(N == 1)return;\n\n\tint parent = (loc-1)/2;\n\n\twhile(true){\n\n\t\tint l_ch = 2*parent+1;\n\t\tint r_ch = 2*parent+2;\n\n\t\tans[parent].L = min(ans[l_ch].L,ans[r_ch].L);\n\t\tans[parent].R = max(ans[l_ch].R,ans[r_ch].R);\n\t\tans[parent].value = ans[l_ch].value+ans[r_ch].value;\n\n\t\tif(parent == 0)break;\n\t\telse{\n\t\t\tparent = (parent-1)/2;\n\t\t}\n\t}\n}\n\nvoid update_info(int node_id,int node_left,int node_right){\n\n\tif(!info[node_id].FLG){\n\n\t\treturn;\n\t}\n\n\tif(node_right-node_left+1 >= 2){\n\t\t/*子に更新情報伝達*/\n\n\t\tll move = info[node_id].move;\n\n\t\t//左の子\n\t\t{\n\t\t\tint L_child = 2*node_id+1;\n\n\t\t\tinfo[L_child].L = info[node_id].L;\n\n\t\t\tif(!info[L_child].FLG){ //子に新しく情報を伝える\n\n\t\t\t\tif(move >= 0){\n\n\t\t\t\t\tinfo[L_child].R = min(info[node_id].R,ans[L_child].R+move);\n\t\t\t\t}else{\n\n\t\t\t\t\tinfo[L_child].R = max(info[node_id].L,ans[L_child].R+move);\n\t\t\t\t}\n\n\t\t\t\tinfo[L_child].move = move;\n\t\t\t\tinfo[L_child].num_rev = info[node_id].num_rev;\n\n\t\t\t}else{\n\n\t\t\t\tif(move >= 0){\n\n\t\t\t\t\tinfo[L_child].R = min(info[node_id].R,info[L_child].R+move);\n\t\t\t\t}else{\n\n\t\t\t\t\tinfo[L_child].R = max(info[node_id].L,info[L_child].R+move);\n\t\t\t\t}\n\n\t\t\t\tinfo[L_child].move += move;\n\t\t\t\tinfo[L_child].num_rev += info[node_id].num_rev;\n\t\t\t}\n\n\t\t\tinfo[L_child].FLG = true;\n\t\t}\n\n\t\t//右の子\n\t\t{\n\t\t\tint R_child = 2*node_id+2;\n\n\t\t\tinfo[R_child].R = info[node_id].R;\n\n\t\t\tif(!info[R_child].FLG){\n\n\t\t\t\tif(move >= 0){\n\n\t\t\t\t\tinfo[R_child].L = min(info[node_id].R,ans[R_child].L+move);\n\t\t\t\t}else{\n\n\t\t\t\t\tinfo[R_child].L = max(info[node_id].L,ans[R_child].L+move);\n\t\t\t\t}\n\n\t\t\t\tinfo[R_child].move = move;\n\t\t\t\tinfo[R_child].num_rev = info[node_id].num_rev;\n\n\t\t\t}else{\n\n\t\t\t\tif(move >= 0){\n\n\t\t\t\t\tinfo[R_child].L = min(info[node_id].R,info[R_child].L+move);\n\t\t\t\t}else{\n\n\t\t\t\t\tinfo[R_child].L = max(info[node_id].L,info[R_child].L+move);\n\t\t\t\t}\n\n\t\t\t\tinfo[R_child].move += move;\n\t\t\t\tinfo[R_child].num_rev += info[node_id].num_rev;\n\t\t\t}\n\n\t\t\tinfo[R_child].FLG = true;\n\t\t}\n\t}\n\n\t//自分を更新\n\tans[node_id].L = info[node_id].L;\n\tans[node_id].R = info[node_id].R;\n\tif((info[node_id].num_rev%2) == 1){\n\n\t\tans[node_id].value *= -1;\n\t}\n\n\tinfo[node_id].FLG = false;\n\t//broken[node_id] = false;\n\n\tinfo[node_id].move = 0;\n\tinfo[node_id].num_rev = 0;\n}\n\n\nvoid update(ll update_left,ll update_right,ll move,int node_id,int node_left,int node_right){\n\n\tupdate_info(node_id,node_left,node_right); //旧情報を処理(子に自分の情報を伝える)\n\n\tif(update_right < ans[node_id].L || update_left > ans[node_id].R)return;\n\n\tif(update_left <= ans[node_id].L && update_right >= ans[node_id].R){\n\n\t\tinfo[node_id].FLG = true;\n\n\t\tll L,R;\n\n\t\tL = ans[node_id].L+move;\n\t\tR = ans[node_id].R+move;\n\n\t\t//範囲内に収める\n\t\tL = min(L,update_right);\n\t\tL = max(L,update_left);\n\n\t\tR = min(R,update_right);\n\t\tR = max(R,update_left);\n\n\n\t\tinfo[node_id].L = L; //移動後のL\n\t\tinfo[node_id].R = R; //移動後のR\n\t\tinfo[node_id].move = move;\n\t\tinfo[node_id].num_rev = 1;\n\n\t\tupdate_info(node_id,node_left,node_right); //新情報を処理\n\n\t\treturn;\n\n\t}else{\n\n\t\tbroken[node_id] = true;\n\n\t\tint l_ch = 2*node_id+1;\n\t\tint r_ch = 2*node_id+2;\n\n\t\tans[node_id].L = -HUGE_NUM;\n\t\tans[node_id].R = HUGE_NUM;\n\n\t\tupdate(update_left,update_right,move,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tupdate(update_left,update_right,move,2*node_id+2,(node_left+node_right)/2+1,node_right);\n/*\n\t\tans[node_id].L = min(ans[l_ch].L,ans[r_ch].L);\n\t\tans[node_id].R = max(ans[l_ch].R,ans[r_ch].R);\n\t\tans[node_id].value = ans[l_ch].value + ans[r_ch].value;*/\n\t}\n}\n\nll query(ll search_left,ll search_right,int node_id,int node_left,int node_right){\n\n\tupdate_info(node_id,node_left,node_right); //旧情報を処理(子に自分の情報を伝える)\n\n\tif(search_right < ans[node_id].L || search_left > ans[node_id].R){\n\n\t\treturn 0;\n\n\t}\n\n\tif(search_left <= ans[node_id].L && search_right >= ans[node_id].R){\n\n\n\t\treturn ans[node_id].value;\n\n\t}else{\n\n\t\tll left = query(search_left,search_right,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tll right = query(search_left,search_right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\t\tint l_ch = 2*node_id+1;\n\t\tint r_ch = 2*node_id+2;\n\n\t\t/*ans[node_id].L = min(ans[l_ch].L,ans[r_ch].L);\n\t\tans[node_id].R = max(ans[l_ch].R,ans[r_ch].R);\n\t\tans[node_id].value = ans[l_ch].value + ans[r_ch].value;\n*/\n\t\treturn left+right;\n\t}\n}\n\n\nint main(){\n\n\tll maxi;\n\tint M;\n\tscanf(\"%lld %d\",&maxi,&M);\n\n\tinit(M);\n\n\tfor(int i = 0; i <= 2*N-2; i++){\n\t\tinfo[i].FLG = false;\n\n\t\tans[i].value = 0;\n\t\tans[i].L = HUGE_NUM;\n\t\tans[i].R = 0;\n\n\t\tinfo[i].move = 0;\n\t\tinfo[i].num_rev = 0;\n\t}\n\n\tvector<ll> vec;\n\tll tmp;\n\tfor(int i = 0; i < M; i++){\n\n\t\tscanf(\"%lld\",&tmp);\n\t\tvec.push_back(tmp);\n\t}\n\tsort(vec.begin(),vec.end());\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tfirst_update(i,vec[i]);\n\t}\n\n\n\tint num_Q;\n\tscanf(\"%d\",&num_Q);\n\n\tint command;\n\tll a,b,c;\n\tll d,e;\n\n\tfor(int loop = 0; loop < num_Q; loop++){\n\n\t\tscanf(\"%d\",&command);\n\t\tif(command == 1){\n\n\t\t\tscanf(\"%lld %lld %lld\",&a,&b,&c);\n\n\t\t\t//更新処理\n\t\t\tupdate(a,b,c,0,0,N-1);\n\n\n\t\t}else{\n\n\t\t\tscanf(\"%lld %lld\",&d,&e);\n\t\t\t//出力処理\n\t\t\tprintf(\"%lld\\n\",query(d,e,0,0,N-1));\n\t\t}\n\t}\n\n\treturn 0;\n}", "accuracy": 0.4583333333333333, "time_ms": 70, "memory_kb": 19364, "score_of_the_acc": -0.4233, "final_rank": 16 }, { "submission_id": "aoj_0474_6071596", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n\n#define SIZE 100005\n\n\nstruct NA{\n\tNA(){\n\n\t\tL = R = 0;\n\t\tvalue = 0;\n\t}\n\tNA(ll arg_L,ll arg_R,ll arg_value){\n\t\tL = arg_L;\n\t\tR = arg_R;\n\t\tvalue = arg_value;\n\t}\n\tvoid set(ll arg_L,ll arg_R,ll arg_value){\n\t\tL = arg_L;\n\t\tR = arg_R;\n\t\tvalue = arg_value;\n\t}\n\tll L,R,value;\n};\n\nstruct Info{ //■■更新情報■■\n\tll L,R,move,num_rev;\n\tbool FLG;\n};\n\nint N = 1;\nInfo info[6*SIZE];\nNA ans[6*SIZE];\n\nvoid init(int first_N){\n\twhile(N < first_N)N *= 2;\n}\n\nvoid first_update(int loc,ll x){\n\tloc += N-1;\n\n\tans[loc].L = x;\n\tans[loc].R = x;\n\tans[loc].value = 1;\n\n\tif(N == 1)return;\n\n\tint parent = (loc-1)/2;\n\n\twhile(true){\n\n\t\tint l_ch = 2*parent+1;\n\t\tint r_ch = 2*parent+2;\n\n\t\tans[parent].L = min(ans[l_ch].L,ans[r_ch].L);\n\t\tans[parent].R = max(ans[l_ch].R,ans[r_ch].R);\n\t\tans[parent].value = ans[l_ch].value+ans[r_ch].value;\n\n\t\tif(parent == 0)break;\n\t\telse{\n\t\t\tparent = (parent-1)/2;\n\t\t}\n\t}\n}\n\nvoid update_info(int node_id,int node_left,int node_right){\n\n\tif(!info[node_id].FLG){\n\n\t\treturn;\n\t}\n\n\tif(node_right-node_left+1 >= 2){\n\t\t/*子に更新情報伝達*/\n\n\t\tll move = info[node_id].move;\n\n\t\t//左の子\n\t\t{\n\t\t\tint L_child = 2*node_id+1;\n\n\t\t\tinfo[L_child].L = info[node_id].L;\n\n\t\t\tif(!info[L_child].FLG){ //子に新しく情報を伝える\n\n\t\t\t\tif(move >= 0){\n\n\t\t\t\t\tinfo[L_child].R = min(info[node_id].R,ans[L_child].R+move);\n\t\t\t\t}else{\n\n\t\t\t\t\tinfo[L_child].R = max(info[node_id].L,ans[L_child].R+move);\n\t\t\t\t}\n\n\t\t\t\tinfo[L_child].move = move;\n\t\t\t\tinfo[L_child].num_rev = info[node_id].num_rev;\n\n\t\t\t}else{\n\n\t\t\t\tif(move >= 0){\n\n\t\t\t\t\tinfo[L_child].R = min(info[node_id].R,info[L_child].R+move);\n\t\t\t\t}else{\n\n\t\t\t\t\tinfo[L_child].R = max(info[node_id].L,info[L_child].R+move);\n\t\t\t\t}\n\n\t\t\t\tinfo[L_child].move += move;\n\t\t\t\tinfo[L_child].num_rev += info[node_id].num_rev;\n\t\t\t}\n\n\t\t\tinfo[L_child].FLG = true;\n\t\t}\n\n\t\t//右の子\n\t\t{\n\t\t\tint R_child = 2*node_id+2;\n\n\t\t\tinfo[R_child].R = info[node_id].R;\n\n\t\t\tif(!info[R_child].FLG){\n\n\t\t\t\tif(move >= 0){\n\n\t\t\t\t\tinfo[R_child].L = min(info[node_id].R,ans[R_child].L+move);\n\t\t\t\t}else{\n\n\t\t\t\t\tinfo[R_child].L = max(info[node_id].L,ans[R_child].L+move);\n\t\t\t\t}\n\n\t\t\t\tinfo[R_child].move = move;\n\t\t\t\tinfo[R_child].num_rev = info[node_id].num_rev;\n\n\t\t\t}else{\n\n\t\t\t\tif(move >= 0){\n\n\t\t\t\t\tinfo[R_child].L = min(info[node_id].R,info[R_child].L+move);\n\t\t\t\t}else{\n\n\t\t\t\t\tinfo[R_child].L = max(info[node_id].L,info[R_child].L+move);\n\t\t\t\t}\n\n\t\t\t\tinfo[R_child].move += move;\n\t\t\t\tinfo[R_child].num_rev += info[node_id].num_rev;\n\t\t\t}\n\n\t\t\tinfo[R_child].FLG = true;\n\t\t}\n\t}\n\n\t//自分を更新\n\tans[node_id].L = info[node_id].L;\n\tans[node_id].R = info[node_id].R;\n\tif((info[node_id].num_rev%2) == 1){\n\n\t\tans[node_id].value *= -1;\n\t}\n\n\tinfo[node_id].FLG = false;\n\t//broken[node_id] = false;\n\n\tinfo[node_id].move = 0;\n\tinfo[node_id].num_rev = 0;\n}\n\n\nvoid update(ll update_left,ll update_right,ll move,int node_id,int node_left,int node_right){\n\n\tupdate_info(node_id,node_left,node_right); //旧情報を処理(子に自分の情報を伝える)\n\n\tif(update_right < ans[node_id].L || update_left > ans[node_id].R)return;\n\n\tif(update_left <= ans[node_id].L && update_right >= ans[node_id].R){\n\n\t\tinfo[node_id].FLG = true;\n\n\t\tll L,R;\n\n\t\tif(move >= 0){ //右へ動く\n\n\t\t\tL = min(update_right,ans[node_id].L+move);\n\t\t\tR = min(update_right,ans[node_id].R+move);\n\n\t\t}else{ //左へ動く\n\n\t\t\tL = max(update_left,ans[node_id].L+move);\n\t\t\tR = max(update_left,ans[node_id].R+move);\n\t\t}\n\n\t\tinfo[node_id].L = L; //移動後のL\n\t\tinfo[node_id].R = R; //移動後のR\n\t\tinfo[node_id].move = move;\n\t\tinfo[node_id].num_rev = 1;\n\n\t\tupdate_info(node_id,node_left,node_right); //新情報を処理\n\n\t\treturn;\n\n\t}else{\n\n\t\tans[node_id].L = -HUGE_NUM;\n\t\tans[node_id].R = HUGE_NUM;\n\n\t\tupdate(update_left,update_right,move,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tupdate(update_left,update_right,move,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\t}\n}\n\nll query(ll search_left,ll search_right,int node_id,int node_left,int node_right){\n\n\tupdate_info(node_id,node_left,node_right); //旧情報を処理(子に自分の情報を伝える)\n\n\tif(search_right < ans[node_id].L || search_left > ans[node_id].R){\n\n\t\treturn 0;\n\n\t}\n\n\tif(search_left <= ans[node_id].L && search_right >= ans[node_id].R && ans[node_id].L != -HUGE_NUM){\n\n\n\t\treturn ans[node_id].value;\n\n\t}else{\n\n\t\tll left = query(search_left,search_right,2*node_id+1,node_left,(node_left+node_right)/2);\n\t\tll right = query(search_left,search_right,2*node_id+2,(node_left+node_right)/2+1,node_right);\n\n\t\treturn left+right;\n\t}\n}\n\n\nint main(){\n\n\tll maxi;\n\tint M;\n\tscanf(\"%lld %d\",&maxi,&M);\n\n\tinit(M);\n\n\tfor(int i = 0; i <= 2*N-2; i++){\n\t\tinfo[i].FLG = false;\n\n\t\tans[i].value = 0;\n\t\tans[i].L = HUGE_NUM;\n\t\tans[i].R = 0;\n\n\t\tinfo[i].move = 0;\n\t\tinfo[i].num_rev = 0;\n\t}\n\n\tvector<ll> vec;\n\tll tmp;\n\tfor(int i = 0; i < M; i++){\n\n\t\tscanf(\"%lld\",&tmp);\n\t\tvec.push_back(tmp);\n\t}\n\tsort(vec.begin(),vec.end());\n\n\tfor(int i = 0; i < M; i++){\n\n\t\tfirst_update(i,vec[i]);\n\t}\n\n\n\tint num_Q;\n\tscanf(\"%d\",&num_Q);\n\n\tint command;\n\tll a,b,c;\n\tll d,e;\n\n\tfor(int loop = 0; loop < num_Q; loop++){\n\n\t\tscanf(\"%d\",&command);\n\t\tif(command == 1){\n\n\t\t\tscanf(\"%lld %lld %lld\",&a,&b,&c);\n\n\t\t\t//更新処理\n\t\t\tupdate(a,b,c,0,0,N-1);\n\n\n\t\t}else{\n\n\t\t\tscanf(\"%lld %lld\",&d,&e);\n\t\t\t//出力処理\n\t\t\tprintf(\"%lld\\n\",query(d,e,0,0,N-1));\n\t\t}\n\t}\n\n\treturn 0;\n}", "accuracy": 0.4583333333333333, "time_ms": 60, "memory_kb": 17896, "score_of_the_acc": -0.3815, "final_rank": 15 } ]
aoj_0475_cpp
School Road In the town of Aizu, where PCK lives, there are $N$ points and $M$ roads connecting each point. Each point is numbered from $1$ to $N$, and all roads can be traveled in both directions. You can also reach other points from any point by taking some of the paths. PCK's house is at point 1 and his school is at point $N$. PCK wants to find out the shortest way to school for each of the paths he must take from all the paths in the town of Aizu. However, the route to school must meet the following conditions: The point included in the route to school will be passed exactly once. The distance is the shortest among the school routes that meet the above conditions. You are given a number of points and information about the roads that connect the points directly. Create a program to find the distance of the school route when each path is chosen. Input The input is given in the following format. $N$ $M$ $s_1$ $t_1$ $d_1$ $s_2$ $t_2$ $d_2$ : $s_M$ $t_M$ $d_M$ The first line gives the number of points $N$ ($2 \leq N \leq 20$) and the number of roads $M$ ($1 \leq M \leq N(N-1)/2$). In the following $M$ lines, the information on the roads that directly connect the two points is given. $s_i$ and $t_i$ ($1 \leq s_i < t_i \leq N$) are the numbers of the two points connected by the $i$th path, and $d_i$ ($1 \leq d_i \leq 1000$) is the distance of the path. However, for any two points, no more than one road can connect them directly. Output The output is the $M$ lines. Output the distance of the school route when the route given in the $i$th input is always used, in the $i$th line. However, if there is no school route that uses the $i$th given road, output "-1". Sample Input and Output Sample Input 5 5 1 2 4 1 3 1 1 4 3 2 4 2 4 5 6 Sample Output 12 -1 9 12 9
[ { "submission_id": "aoj_0475_11027034", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define rng(i,l,r) for(int i=(l);i<(r);i++)\n#define rrep(i,n) for(int i=(n)-1;i>=0;i--)\n#define rrng(i,l,r) for(int i=(r)-1;i>=(l);i--)\n//#define int long long\n#define fi first\n#define se second\n#define pb push_back\n#define all(x) (x).begin(),(x).end()\n#define chmin(a,b) a=min(a,b)\n#define chmax(a,b) a=max(a,b)\n\nint dp1[20][1<<20],dp2[20][1<<20];\n\nsigned main(){\n\tint N,M;cin>>N>>M;\n\t\n\tvector<int> S(M),T(M),D(M);\n\tvector<vector<int>> d(N,vector<int>(N,1e9));\n\trep(i,M){\n\t\tcin>>S[i]>>T[i]>>D[i];\n\t\tS[i]--,T[i]--;\n\t\td[S[i]][T[i]]=min(d[S[i]][T[i]],D[i]);\n\t\td[T[i]][S[i]]=min(d[T[i]][S[i]],D[i]);\n\t}\n\t\n\trep(i,N)rep(s,1<<N)dp1[i][s]=1e9,dp2[i][s]=1e9;\n\t\n\tdp1[0][1<<0]=0,dp2[N-1][1<<(N-1)]=0;\n\t\n\trep(_,2){\n\t\trep(s,(1<<N))rep(i,N){\n\t\t\tif(!(s>>i&1))continue;\n\t\t\trep(j,N){\n\t\t\t\tif(s>>j&1)continue;\n\t\t\t\tchmin(dp1[j][s|(1<<j)],dp1[i][s]+d[i][j]);\n\t\t\t}\n\t\t}\n\t\t\n\t\tswap(dp1,dp2);\n\t}\n\t\n\trep(i,N){\n\t\trep(j,N)rrep(s,(1<<N))chmin(dp2[j][s|(1<<i)],dp2[j][s]);\n\t}\n\t\n\tvector<vector<int>> mn(N,vector<int>(N,1e9));\n\trep(i,N)rep(j,N)rep(s,(1<<N)){\n\t\t\tchmin(mn[i][j],dp1[i][s]+dp2[j][((1<<N)-1)^s]);\n\t\t\n\t}\n\t\n\t\n\trep(i,M){\n\t\tint ans=min(mn[S[i]][T[i]],mn[T[i]][S[i]])+D[i];\n\t\tif(ans>=1e9)cout<<-1<<\"\\n\";\n\t\telse cout<<ans<<\"\\n\";\n\t}\n}", "accuracy": 1, "time_ms": 1500, "memory_kb": 167192, "score_of_the_acc": -0.1577, "final_rank": 3 }, { "submission_id": "aoj_0475_11026519", "code_snippet": "#pragma GCC target(\"avx2\")\n#include <bits/stdc++.h>\nusing namespace std;\n\nint dp[1<<20][20];\nint ndp[1<<20][20];\nint main(){\n int N,M;\n cin>>N>>M;\n for(int i=0;i<(1<<N);i++){\n for(int j=0;j<N;j++){\n dp[i][j] = 1e9;\n ndp[i][j] = 1e9;\n }\n }\n vector<int> S(M), T(M), D(M);\n vector<vector<int>> C(N,vector<int>(N,1e9));\n for(int i=0;i<M;i++){\n cin>>S[i]>>T[i]>>D[i];\n S[i]--;\n T[i]--;\n C[S[i]][T[i]] = D[i];\n C[T[i]][S[i]] = D[i];\n }\n dp[1][0] = 0;\n for(int i=1;i<(1<<N);i+=2)for(int j=0;j<N;j++)if(dp[i][j] < 1e9){\n for(int k=0;k<N;k++)if(!(i&(1<<k))) dp[i|(1<<k)][k] = min(dp[i|(1<<k)][k],dp[i][j]+C[j][k]);\n }\n ndp[(1<<N)/2][N-1] = 0;\n for(int i=(1<<N)/2;i<(1<<N);i++)for(int j=0;j<N;j++)if(ndp[i][j] < 1e9){\n for(int k=0;k<N;k++)if(!(i&(1<<k))) ndp[i|(1<<k)][k] = min(ndp[i|(1<<k)][k],ndp[i][j]+C[j][k]);\n }\n for(int i=0;i<N;i++){\n for(int k=0;k<(1<<N);k++)if(dp[k][i] < 1e8){\n for(int j=0;j<N;j++) dp[k|(1<<j)][i] = min(dp[k|(1<<j)][i],dp[k][i]);\n }\n }\n for(int i=0;i<N;i++){\n for(int k=0;k<(1<<N);k++)if(ndp[k][i] < 1e8){\n for(int j=0;j<N;j++) ndp[k|(1<<j)][i] = min(ndp[k|(1<<j)][i],ndp[k][i]);\n }\n }\n for(int i=0;i<M;i++){\n int ans = 1e9+10;\n for(int j=1;j<(1<<N)/2;j+=2)if((j&(1<<S[i]))&&(!(j&(1<<T[i])))) ans = min(ans,C[S[i]][T[i]]+dp[j][S[i]]+ndp[(1<<N)-1-j][T[i]]);\n swap(S[i],T[i]);\n for(int j=1;j<(1<<N)/2;j+=2)if((j&(1<<S[i]))&&(!(j&(1<<T[i])))) ans = min(ans,C[S[i]][T[i]]+dp[j][S[i]]+ndp[(1<<N)-1-j][T[i]]);\n cout<<(ans > 1e9 ? -1 : ans)<<endl;\n }\n}", "accuracy": 1, "time_ms": 1370, "memory_kb": 167284, "score_of_the_acc": -0.1081, "final_rank": 2 }, { "submission_id": "aoj_0475_11015636", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n//#include<atcoder/all>\n//using namespace atcoder;\n//using mint = modint998244353;\n//#define int long long\nsigned main() {\n int n,m;\n cin >> n >> m;\n vector<vector<pair<int,int>>> a(n);\n vector<tuple<int,int,int>> X;\n while(m--) {\n int x,y,w;\n cin >> x >> y >> w;\n x--,y--;\n //x = rand()%n, y = rand()%n, w = rand()%1000;\n X.push_back({x,y,w});\n a[x].push_back({y,w});\n a[y].push_back({x,w});\n }\n vector<int> p(n+1,1);\n for(int i = 0; i < n; i++) p[i+1] = p[i]*2;\n vector<vector<int>> dp(p[n],vector<int>(n,1e9)),dp2 = dp;\n dp[1][0] = 0, dp2[p[n-1]][n-1] = 0;\n for(int i = 0; i < p[n]; i++) {\n for(int j = 0; j < n; j++) {\n int l = a[j].size();\n if(dp[i][j] < 1e8) {\n for(int k = 0; k < l; k++) {\n int x,w;\n tie(x,w) = a[j][k];\n if((i|p[x]) == i+p[x]) {\n dp[i+p[x]][x] = min(dp[i+p[x]][x],dp[i][j]+w);\n }\n }\n }\n if(dp2[i][j] < 1e8) {\n for(int k = 0; k < l; k++) {\n int x,w;\n tie(x,w) = a[j][k];\n if((i|p[x]) == i+p[x]) {\n dp2[i+p[x]][x] = min(dp2[i+p[x]][x],dp2[i][j]+w);\n }\n }\n }\n }\n }\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < p[n]; j++) {\n if((j&p[i]) == 0) {\n for(int k = 0; k < n; k++) {\n dp2[j+p[i]][k] = min(dp2[j+p[i]][k],dp2[j][k]);\n }\n }\n }\n }\n m = X.size();\n for(int i = 0; i < m; i++) {\n int x,y,w;\n tie(x,y,w) = X[i];\n int ans = 2e9;\n for(int j = 1; j < p[n-1]; j+=2) ans = min({ans,dp[j][x]+dp2[p[n]-1-j][y]+w,dp[j][y]+dp2[p[n]-1-j][x]+w});\n if(ans < 1e9) cout << ans << endl;\n else cout << -1 << endl;\n }\n}", "accuracy": 1, "time_ms": 1590, "memory_kb": 248804, "score_of_the_acc": -0.5249, "final_rank": 10 }, { "submission_id": "aoj_0475_10956871", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nvector<vector<int>> get_bitdp(int n, int stt, vector<vector<int>> d) {\n vector<vector<int>> dp((1 << n), vector<int>(n, (1 << 28)));\n dp[(1 << stt)][stt] = 0;\n\n // solve\n for (int mask = 0; mask < (1 << n); mask++) {\n for (int i = 0; i < n; i++) {\n if (dp[mask][i] >= (1 << 28)) continue;\n for (int j = 0; j < n; j++) {\n if ((mask >> j) & 1) continue;\n dp[mask + (1 << j)][j] = min(dp[mask + (1 << j)][j], dp[mask][i] + d[i][j]);\n }\n }\n }\n for (int p = 0; p < n; p++) {\n for (int mask = 0; mask < (1 << n); mask++) {\n if ((mask >> p) & 1) continue;\n for (int i = 0; i < n; i++) {\n dp[mask + (1 << p)][i] = min(dp[mask + (1 << p)][i], dp[mask][i]);\n }\n }\n }\n return dp;\n}\n\nint main() {\n // step 1. input\n int n, m; cin >> n >> m;\n vector<int> a(m), b(m), c(m);\n vector<vector<int>> d(n, vector<int>(n, (1 << 28)));\n for (int i = 0; i < m; i++) {\n cin >> a[i] >> b[i] >> c[i]; a[i]--; b[i]--;\n d[a[i]][b[i]] = min(d[a[i]][b[i]], c[i]);\n d[b[i]][a[i]] = min(d[b[i]][a[i]], c[i]);\n }\n\n // step 2. solve\n vector<vector<int>> dp1 = get_bitdp(n, 0, d);\n vector<vector<int>> dp2 = get_bitdp(n, n - 1, d);\n for (int i = 0; i < m; i++) {\n int minx = (1 << 28);\n for (int j = 0; j < (1 << n); j++) {\n minx = min(minx, dp1[j][a[i]] + dp2[(1 << n) - 1 - j][b[i]] + c[i]);\n minx = min(minx, dp1[j][b[i]] + dp2[(1 << n) - 1 - j][a[i]] + c[i]);\n }\n cout << (minx >= (1 << 28) ? -1 : minx) << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 2600, "memory_kb": 248888, "score_of_the_acc": -0.9137, "final_rank": 14 }, { "submission_id": "aoj_0475_10956833", "code_snippet": "#include <iostream>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <algorithm>\n#include <set>\nusing ll = long long;\nusing namespace std;\nstruct Edge {\n\tint to;\n\tint cost;\n};\nint main(){\n\tint N, M;cin >> N >> M;\n\tvector<vector<Edge>> G(N);\n\tint inf = (int)1e9;\n\n\tvector<int> A(M), B(M), C(M);\n\tfor (int i = 0;i < M;i++) {\n\t\tint a, b, c;cin >> a >> b >> c;\n\t\ta--;b--;\n\t\tG[a].push_back({b, c});\n\t\tG[b].push_back({a, c});\n\t\tA[i] = a;\n\t\tB[i] = b;\n\t\tC[i] = c;\n\t}\n\tvector<vector<int>> dp(1<<N, vector<int>(N, inf)), dp2(1<<N, vector<int>(N, inf));\n\tdp[1][0] = 0;dp2[1 << (N-1)][N-1] = 0;\n\tfor (int bit = 0;bit < (1<<N);bit++) for (int v = 0;v < N;v++) {\n\t\tif (!(bit & (1 << v))) continue;\n\t\t//if (dp[bit][v] == inf) continue;\n\t\t//g++ cout <<\"BIT \" << bit << \" \" << v << \" \" << dp[bit][v] << endl;\n\t\tif (bit == 9) {\n\t\t//\tcout <<\"ON\" << dp[bit][v] << \" \" << v+1 << endl;\n\t\t}\n\t\tfor (auto nv : G[v]) {\n\t\t\tif (bit & (1 << nv.to)) continue;\n\t\t///\tcout << v+1 << \"SENI \" << nv.to << \" \" << bit << \" \" << dp[bit][v] << endl;\n\t\t\tint nbit = bit | (1 << nv.to);\n\t\t\tdp[nbit][nv.to] = min(dp[nbit][nv.to], dp[bit][v] + nv.cost);\n\t\t\t\n\t\t\tdp2[nbit][nv.to] = min(dp2[nbit][nv.to], dp2[bit][v] + nv.cost);\n\t\t}\n\t}\n\tfor (int i = 1;i <= N;i++) {\n\t\tfor (int bit = 0;bit < (1<<N);bit++) for (int v = 0;v < N;v++) {\n\t\t\tif (bit & (1 << i)) {\n\t\t\t\tdp2[bit][v] = min(dp2[bit][v], dp2[bit ^ (1<<i)][v]);\n\t\t\t} \n\t\t}\n\t}\n\tfor (int i = 0;i < M;i++) {\n\t\tint res = inf;\n\t\tint a = A[i];\n\t\tint b = B[i];\n\t\tfor (int bit = 0;bit < (1<<N);bit++) {\n\t\t\tif (!(bit & (1 << 0))) continue;\n\t\t\tif (bit & (1 << a)) {\n\t\t//\tcout << bit << \" \" << a << \" \" << dp[bit][a] << endl;\n\t\t\t\tint nbit = bit ^ ((1<<N) - 1);\n\t\t\t\tif (dp[bit][a] != inf and dp2[nbit][b] != inf) {\n\t\t\t\t\tres = min(res, dp[bit][a] + dp2[nbit][b] + C[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tif (bit & (1 << b)) {\n\t\t\t\tint nbit = bit ^ ((1<<N)-1);\n\t\t\t\tif (dp[bit][b] != inf and dp2[nbit][a] != inf) {\n\t\t\t\t\tres = min(res, dp[bit][b] + dp2[nbit][a] + C[i]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << (res == inf ? -1 : res) << endl;\n\t}\n\t\n}", "accuracy": 1, "time_ms": 2350, "memory_kb": 249092, "score_of_the_acc": -0.8184, "final_rank": 13 }, { "submission_id": "aoj_0475_10913628", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)\n\nconst ll INF = 1ll << 60;\nint N, M;\nvector<vector<pair<int, ll>>> G(25);\n\t\nvoid calc(vector<vector<ll>> &dp, int s) {\n\tdp[1 << s][s] = 0;\n\t\n\trep(S, 0, 1 << N) rep(v, 0, N) {\n\t\tfor (auto e : G[v]) {\n\t\t\tif ((S >> e.first) & 1) continue;\n\t\t\tint T = S | (1 << e.first);\n\t\t\tdp[T][e.first] = min(dp[T][e.first], dp[S][v] + e.second);\n\t\t}\n\t}\n}\n\nint main() {\n\tcin.tie(nullptr);\n\tios_base::sync_with_stdio(false);\n\t\n\tcin >> N >> M;\n\tvector<pair<int, int>> E(M);\n\tvector<ll> W(M);\n\trep(i, 0, M) {\n\t\tcin >> E[i].first >> E[i].second >> W[i];\n\t\t--E[i].first, --E[i].second;\n\t\tG[E[i].first].push_back({E[i].second, W[i]});\n\t\tG[E[i].second].push_back({E[i].first, W[i]});\n\t}\n\t\n\tvector dp1(1 << N, vector<ll>(N, INF));\n\tcalc(dp1, 0);\n\tvector dpN(1 << N, vector<ll>(N, INF));\n\tcalc(dpN, N - 1);\n\t\n\trep(S, 0, 1 << N) rep(v, 0, N) {\n\t\trep(i, 0, N) {\n\t\t\tif (!((S >> i) & 1)) continue;\n\t\t\tdpN[S][v] = min(dpN[S][v], dpN[S ^ (1 << i)][v]);\n\t\t}\n\t}\n\t\n\trep(e, 0, M) {\n\t\tll ans = INF;\n\t\t\n\t\trep(T, 0, 1 << (N - 2)) {\n\t\t\tint S = (T << 1) + 1;\n\t\t\tans = min(ans, dp1[S][E[e].first] + W[e] + dpN[((1 << N) - 1) ^ S][E[e].second]);\n\t\t\tans = min(ans, dp1[S][E[e].second] + W[e] + dpN[((1 << N) - 1) ^ S][E[e].first]);\n\t\t}\n\t\t\n\t\tcout << (ans == INF ? -1 : ans) << '\\n';\n\t}\n}", "accuracy": 1, "time_ms": 3410, "memory_kb": 412580, "score_of_the_acc": -1.8923, "final_rank": 18 }, { "submission_id": "aoj_0475_10205576", "code_snippet": "// AOJ #475\n// School Road 2025.2.9\n\n#include <bits/stdc++.h>\nusing namespace std;\n \nconst int INF = 1000000000;\n \nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n \n int N, M;\n cin >> N >> M;\n vector<vector<pair<int,int>>> graph(N);\n vector<tuple<int,int,int>> forcedEdges;\n for (int i = 0; i < M; i++){\n int s, t, d;\n cin >> s >> t >> d;\n s--; t--;\n forcedEdges.push_back({s, t, d});\n graph[s].push_back({t, d});\n graph[t].push_back({s, d});\n }\n \n int tot = 1 << N;\n vector<int> dpF(tot * N, INF);\n dpF[(1 << 0) * N + 0] = 0;\n \n for (int mask = 0; mask < tot; mask++){\n int m = mask;\n while(m){\n int v = __builtin_ctz(m);\n m -= (1 << v);\n int curD = dpF[mask * N + v];\n if(curD == INF) continue;\n for (auto &edge : graph[v]){\n int w = edge.first, cost = edge.second;\n if(mask & (1 << w)) continue;\n int nmask = mask | (1 << w);\n int &nd = dpF[nmask * N + w];\n int cand = curD + cost;\n if(cand < nd) nd = cand;\n }\n }\n }\n \n vector<int> dpB(tot * N, INF);\n dpB[(1 << (N-1)) * N + (N-1)] = 0;\n for (int mask = 0; mask < tot; mask++){\n int m = mask;\n while(m){\n int v = __builtin_ctz(m);\n m -= (1 << v);\n int curD = dpB[mask * N + v];\n if(curD == INF) continue;\n for (auto &edge : graph[v]){\n int w = edge.first, cost = edge.second;\n if(mask & (1 << w)) continue;\n int nmask = mask | (1 << w);\n int &nd = dpB[nmask * N + w];\n int cand = curD + cost;\n if(cand < nd) nd = cand;\n }\n }\n }\n \n vector<vector<int>> fback(N, vector<int>(tot, INF));\n for (int mask = 0; mask < tot; mask++){\n for (int v = 0; v < N; v++){\n int d = dpB[mask * N + v];\n if(d < fback[v][mask]) fback[v][mask] = d;\n }\n }\n for (int v = 0; v < N; v++){\n for (int i = 0; i < N; i++){\n for (int mask = 0; mask < tot; mask++){\n if(mask & (1 << i)){\n fback[v][mask] = min(fback[v][mask], fback[v][mask ^ (1 << i)]);\n }\n }\n }\n }\n \n vector<vector<pair<int,int>>> fstates(N);\n for (int mask = 0; mask < tot; mask++){\n for (int v = 0; v < N; v++){\n int d = dpF[mask * N + v];\n if(d < INF) fstates[v].push_back({mask, d});\n }\n }\n \n int full_mask = tot - 1;\n for (int i = 0; i < M; i++){\n int s, t, d;\n tie(s, t, d) = forcedEdges[i];\n int best = INF;\n \n int excludeB = 1 << s;\n int allowedB = full_mask & ~excludeB;\n for(auto &st : fstates[s]){\n int maskF = st.first, costF = st.second;\n if(maskF & (1 << t)) continue;\n int queryMask = allowedB & ~maskF;\n int costB = fback[t][queryMask];\n if(costB < INF){\n best = min(best, costF + d + costB);\n }\n }\n \n int excludeB2 = 1 << t;\n int allowedB2 = full_mask & ~excludeB2;\n for(auto &st : fstates[t]){\n int maskF = st.first, costF = st.second;\n if(maskF & (1 << s)) continue;\n int queryMask = allowedB2 & ~maskF;\n int costB = fback[s][queryMask];\n if(costB < INF){\n best = min(best, costF + d + costB);\n }\n }\n \n if(best >= INF) cout << -1 << endl;\n else cout << best << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 1150, "memory_kb": 290260, "score_of_the_acc": -0.5246, "final_rank": 9 }, { "submission_id": "aoj_0475_9807220", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<(n);++i)\nstruct Edge{\n int to, cost;\n};\nint main(){\n int n,m;\n cin>>n>>m;\n vector<vector<Edge>> g(n);\n vector<vector<int>> es(m);\n rep(i,m){\n int s,t,d;cin>>s>>t>>d;\n s--;t--;\n g[s].push_back(Edge{t,d});\n g[t].push_back(Edge{s,d});\n \n es[i]={s,t,d};\n }\n \n \n \n vector<vector<int>> sdp(1<<n, vector<int>(n,1e9));\n vector<vector<int>> tdp(1<<n, vector<int>(n,1e9));\n \n auto bitdp = [&](vector<vector<int>> &dp) -> void {\n rep(bit,1<<n){\n rep(i,n){\n for(Edge e: g[i]){\n dp[bit|(1<<e.to)][e.to] = min(dp[bit|(1<<e.to)][e.to], dp[bit][i]+e.cost);\n }\n }\n } \n };\n sdp[1<<0][0]=0;\n tdp[1<<(n-1)][n-1]=0;\n bitdp(sdp);\n bitdp(tdp);\n if(n==20 && m==190) return 0;\n rep(k,n){\n for(int j = 0; j < n; j++){\n for(int i = 0; i < (1 << n); i++){\n if(i & (1 << j)){\n tdp[i][k] = min(tdp[i][k], tdp[i & ~(1 << j)][k]);\n }\n }\n }\n }\n \n vector<int> ans(m,1e9);\n\n rep(j,1<<n){\n int bi = ((1<<n)-1)^j;\n rep(i,m){\n ans[i] = min(ans[i], sdp[j][es[i][0]]+(tdp[bi][es[i][1]])+es[i][2]);\n ans[i] = min(ans[i], sdp[j][es[i][1]]+(tdp[bi][es[i][0]])+es[i][2]);\n }\n }\n rep(i,m){\n if(ans[i]==1e9) ans[i]=-1;\n cout<<ans[i]<<endl;\n }\n}", "accuracy": 0.9166666666666666, "time_ms": 1640, "memory_kb": 248908, "score_of_the_acc": -0.5446, "final_rank": 19 }, { "submission_id": "aoj_0475_9807194", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int i=0;i<(n);++i)\nstruct Edge{\n int to, cost;\n};\nint main(){\n int n,m;\n cin>>n>>m;\n vector<vector<Edge>> g(n);\n vector<vector<int>> es(m);\n rep(i,m){\n int s,t,d;cin>>s>>t>>d;\n s--;t--;\n g[s].push_back(Edge{t,d});\n g[t].push_back(Edge{s,d});\n \n es[i]={s,t,d};\n }\n \n vector<vector<int>> sdp(1<<n, vector<int>(n,1e9));\n vector<vector<int>> tdp(1<<n, vector<int>(n,1e9));\n \n auto bitdp = [&](vector<vector<int>> &dp) -> void {\n rep(bit,1<<n){\n rep(i,n){\n for(Edge e: g[i]){\n dp[bit|(1<<e.to)][e.to] = min(dp[bit|(1<<e.to)][e.to], dp[bit][i]+e.cost);\n }\n }\n } \n };\n sdp[1<<0][0]=0;\n tdp[1<<(n-1)][n-1]=0;\n bitdp(sdp);\n bitdp(tdp);\n \n rep(k,n){\n for(int j = 0; j < n; j++){\n for(int i = 0; i < (1 << n); i++){\n if(i & (1 << j)){\n tdp[i][k] = min(tdp[i][k], tdp[i & ~(1 << j)][k]);\n }\n }\n }\n }\n \n if(n==20 && m==190) return 0;\n\n rep(i,m){\n int mi = 1e9;\n rep(j,1<<n){\n int bi = ((1<<n)-1)^j;\n mi = min(mi, sdp[j][es[i][0]]+(tdp[bi][es[i][1]])+es[i][2]);\n mi = min(mi, sdp[j][es[i][1]]+(tdp[bi][es[i][0]])+es[i][2]);\n }\n if(mi==1e9) mi=-1;\n cout<<mi<<endl;\n }\n \n}", "accuracy": 0.9166666666666666, "time_ms": 3420, "memory_kb": 248748, "score_of_the_acc": -1.2285, "final_rank": 20 }, { "submission_id": "aoj_0475_9803990", "code_snippet": "//#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll inf = 999999999999999999LL;\n#define double long double\nusing vl = vector<ll>;\nusing vvl = vector<vl>;\nusing vvvl = vector<vvl>;\nstruct po{\n double x, y;\n};\nbool f(po &a, po &b, po &c, po &d) {\n\tdouble s, t;\n\ts = (a.x - b.x) * (c.y - a.y) - (a.y - b.y) * (c.x - a.x);\n\tt = (a.x - b.x) * (d.y - a.y) - (a.y - b.y) * (d.x - a.x);\n\tif (s * t > 0)\n\t\treturn false;\n\ts = (c.x - d.x) * (a.y - c.y) - (c.y - d.y) * (a.x - c.x);\n\tt = (c.x - d.x) * (b.y - c.y) - (c.y - d.y) * (b.x - c.x);\n\tif (s * t > 0)\n\t\treturn false;\n\treturn true;\n}\ntemplate <typename T>\nbool chmax(T &a, const T& b){\n if(a < b){\n a = b;\n return true;\n }\n return false;\n}\ntemplate <typename T>\nbool chmin(T &a, const T& b){\n if(a > b){\n a = b;\n return true;\n }\n return false;\n}\nint main(){\n ll N, M;\n cin >> N >> M;\n vvl X(M, vl(3));\n for(int i = 0;i < M;i++){\n cin >> X[i][0] >> X[i][1] >> X[i][2];\n X[i][0]--;\n X[i][1]--;\n }\n vector<vector<ll>> G(N, vl(N, inf));\n for(int i = 0;i < M;i++){\n chmin(G[X[i][0]][X[i][1]], X[i][2]);\n chmin(G[X[i][1]][X[i][0]], X[i][2]);\n }\n vvl dp1(N, vl(1<<N, inf));\n dp1[0][1] = 0;\n for(int i = 0;i < (1<<N);i++){\n for(int j = 0;j < N;j++){\n if(i & (1<<j)){\n for(int k = 0;k < N;k++){\n if(i & (1<<k)){\n\n }\n else{\n chmin(dp1[k][i|(1<<k)], dp1[j][i] + G[j][k]);\n }\n }\n }\n }\n }\n for(int i = 0;i < N;i++){\n for(int j = 0;j < (1<<N);j++){\n for(int k = 0;k < N;k++){\n if(j & (1<<k)){\n\n }\n else{\n chmin(dp1[i][j | (1<<k)], dp1[i][j]);\n }\n }\n }\n }\n vvl dp2(N, vl(1<<N, inf));\n dp2[N - 1][(1<<(N - 1))] = 0;\n for(int i = 0;i < (1<<N);i++){\n for(int j = 0;j < N;j++){\n if(i & (1<<j)){\n for(int k = 0;k < N;k++){\n if(i & (1<<k)){\n\n }\n else{\n chmin(dp2[k][i|(1<<k)], dp2[j][i] + G[j][k]);\n }\n }\n }\n }\n }\n for(int i = 0;i < N;i++){\n for(int j = 0;j < (1<<N);j++){\n for(int k = 0;k < N;k++){\n if(j & (1<<k)){\n\n }\n else{\n chmin(dp2[i][j | (1<<k)], dp2[i][j]);\n }\n }\n }\n }\n ll p = (1<<N) - 1;\n for(int i = 0;i < M;i++){\n ll ans = inf;\n for(int j = 0;j < (1<<N);j++){\n chmin(ans, X[i][2] + dp1[X[i][0]][j] + dp2[X[i][1]][p ^ j]);\n chmin(ans, X[i][2] + dp1[X[i][1]][j] + dp2[X[i][0]][p ^ j]);\n }\n if(ans == inf){\n ans = -1;\n }\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 3170, "memory_kb": 338808, "score_of_the_acc": -1.4994, "final_rank": 17 }, { "submission_id": "aoj_0475_9491211", "code_snippet": "#include <bits/stdc++.h>\n\nint main() {\n int N, M;\n std::cin >> N >> M;\n std::vector<std::vector<std::pair<int, int>>> g(N);\n std::vector<std::tuple<int, int, int>> E(M);\n for (int i{} ; i < M ; i++) {\n int s, t, d;\n std::cin >> s >> t >> d;\n s--; t--;\n E[i] = std::make_tuple(s, t, d);\n g[s].push_back(std::make_pair(t, d));\n g[t].push_back(std::make_pair(s, d));\n }\n const int INF{(int)1e9};\n std::vector fr(N, std::vector<int>(1 << N, INF)), bk{fr};\n fr[0][(1 << 0)] = 0;\n bk[N - 1][(1 << (N - 1))] = 0;\n std::vector<std::vector<int>> pcnt(N + 1);\n for (int bit{} ; bit < (1 << N) ; bit++) {\n pcnt[__builtin_popcount(bit)].push_back(bit);\n }\n for (int p{} ; p < N + 1 ; p++) {\n for (int bit : pcnt[p]) {\n for (int i{} ; i < N ; i++) {\n if (fr[i][bit] != INF) {\n for (auto [x, w] : g[i]) if (!(bit & (1 << x))) {\n int next{bit | (1 << x)};\n fr[x][next] = std::min(fr[x][next], fr[i][bit] + w);\n }\n }\n if (bk[i][bit] != INF) {\n for (auto [x, w] : g[i]) if (!(bit & (1 << x))) {\n int next{bit | (1 << x)};\n bk[x][next] = std::min(bk[x][next], bk[i][bit] + w);\n }\n }\n }\n }\n }\n for (int i{} ; i < N ; i++) {\n for (int bit{} ; bit < (1 << N) ; bit++) {\n if (bit & (1 << i)) {\n for (int j{} ; j < N ; j++) {\n bk[j][bit] = std::min(bk[j][bit], bk[j][bit ^ (1 << i)]);\n }\n }\n }\n }\n int all{(1 << N) - 1};\n for (auto [u, v, w] : E) {\n int ans{INF};\n for (int bit{} ; bit < (1 << N) ; bit++) {\n int uok{bit & (1 << u)}, vok{bit & (1 << v)};\n if (uok and !vok) {\n ans = std::min(ans, fr[u][bit] + bk[v][all ^ bit] + w);\n }\n if (!uok and vok) {\n ans = std::min(ans, fr[v][bit] + bk[u][all ^ bit] + w);\n }\n }\n std::cout << (ans == INF ? -1 : ans) << '\\n';\n }\n}", "accuracy": 1, "time_ms": 1090, "memory_kb": 172972, "score_of_the_acc": -0.0236, "final_rank": 1 }, { "submission_id": "aoj_0475_8805847", "code_snippet": "#include <bits/stdc++.h>\n\nint main() {\n const int INF = 1e9;\n int n, m;\n std::cin >> n >> m;\n std::vector graph(n, std::vector<int>(n, INF));\n std::vector<std::tuple<int, int, int>> edges;\n for (int i = 0; i < m; i++) {\n int u, v, d;\n std::cin >> u >> v >> d;\n u--;\n v--;\n graph[u][v] = d;\n graph[v][u] = d;\n edges.emplace_back(u, v, d);\n }\n auto enumerate = [&](int start) {\n std::vector dp(1 << n, std::vector<int>(n, INF));\n dp[1 << (start)][start] = 0;\n for (int state = 0; state < (1 << n); state++) {\n for (int u = 0; u < n; u++) {\n if (dp[state][u] == INF) continue;\n for (int v = 0; v < n; v++) {\n if (graph[u][v] == INF) continue;\n if (state & (1 << v)) continue;\n dp[state | (1 << v)][v] = std::min(dp[state | (1 << v)][v], dp[state][u] + graph[u][v]);\n }\n }\n }\n for (int state = 0; state < (1 << n); state++) {\n for (int u = 0; u < n; u++) {\n for (int v = 0; v < n; v++) {\n if (state & (1 << v)) {\n dp[state][u] = std::min(dp[state][u], dp[state ^ (1 << v)][u]);\n }\n }\n }\n }\n return dp;\n };\n auto dp1 = enumerate(0);\n auto dp2 = enumerate(n - 1);\n for (auto [u, v, d]: edges) {\n int ans = INF;\n for (int state = 0; state < (1 << n); state++) {\n int substate = ((1 << n) - 1) ^ state;\n ans = std::min(ans, dp1[state][u] + dp2[substate][v] + d);\n ans = std::min(ans, dp1[state][v] + dp2[substate][u] + d);\n }\n if (ans >= INF) ans = -1;\n std::cout << ans << '\\n';\n }\n}", "accuracy": 1, "time_ms": 3510, "memory_kb": 248792, "score_of_the_acc": -1.2633, "final_rank": 16 }, { "submission_id": "aoj_0475_8439479", "code_snippet": "#include<bits/stdc++.h>\n#define overload(a,b,c,d,...) d\n#define rep1(n) for(ll _=0;_<n;++_)\n#define rep2(i,n) for(ll i=0;i<n;++i)\n#define rep3(i,a,b) for(ll i=(ll)a;i<(ll)b;++i)\n#define rep(...) overload(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(i,n) for(ll i=(ll)n-1;i>=0;--i)\n#define rrep2(i,a,b) for(ll i=(ll)b-1;i>=(ll)a;--i)\n#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)\n#define all(x) (x).begin(),(x).end()\n#define rall(x) (x).rbegin(),(x).rend()\n#define eb emplace_back\n#define pb push_back\nusing namespace std;\nusing ll=int;\nusing ld=long double;\nusing vl=vector<ll>;\ntemplate<typename T,typename U>inline bool chmin(T&a,const U&b){return (a>b?a=b,true:false);}\ntemplate<typename T,typename U>inline bool chmax(T&a,const U&b){return (a<b?a=b,true:false);}\nstatic constexpr ll inf=numeric_limits<ll>::max()/2;\nint main(){\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tll n,m;cin>>n>>m;\n\tvector<vector<pair<ll,ll>>>g(n);\n\tvector<array<ll,3>>edges(m);\n\trep(i,m){\n\t\tll s,t,d;cin>>s>>t>>d;\n\t\ts--,t--;\n\t\tedges[i]=array<ll,3>{s,t,d};\n\t\tg[s].eb(t,d);\n\t\tg[t].eb(s,d);\n\t}\n\tvector<vl>dp1(n,vl(1<<n,inf)),dp2(n,vl(1<<n,inf));\n\tdp1[0][1]=0,dp2[n-1][1<<(n-1)]=0;\n\trep(i,1<<n)rep(j,n)if(dp1[j][i]!=inf){\n\t\tfor(auto [k,d]:g[j])if(!(i&(1<<k))){\n\t\t\tchmin(dp1[k][i|(1<<k)],dp1[j][i]+d);\n\t\t}\n\t}\n\trep(i,1<<n)rep(j,n)if(dp2[j][i]!=inf){\n\t\tfor(auto [k,d]:g[j])if(!(i&(1<<k))){\n\t\t\tchmin(dp2[k][i|(1<<k)],dp2[j][i]+d);\n\t\t}\n\t}\n\trep(i,n){\n\t\trep(bit,1<<n){\n\t\t\trep(j,n)if(bit<(bit^(1<<j))){\n\t\t\t\tchmin(dp2[i][bit^(1<<j)],dp2[i][bit]);\n\t\t\t}\n\t\t}\n\t}\n\tconst ll mask=(1<<n)-1;\n\trep(i,m){\n\t\tll ans=inf;\n\t\trep(bit,1<<n){\n\t\t\tif(dp1[edges[i][0]][bit]!=inf)chmin(ans,dp1[edges[i][0]][bit]+dp2[edges[i][1]][mask^bit]+edges[i][2]);\n\t\t\tif(dp1[edges[i][1]][bit]!=inf)chmin(ans,dp1[edges[i][1]][bit]+dp2[edges[i][0]][mask^bit]+edges[i][2]);\n\t\t}\n\t\tcout<<(ans==inf?-1:ans)<<endl;\n\t}\n\t\n}", "accuracy": 1, "time_ms": 1830, "memory_kb": 171188, "score_of_the_acc": -0.3009, "final_rank": 8 }, { "submission_id": "aoj_0475_6959621", "code_snippet": "#include <iostream>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <tuple>\n#include <cstdint>\n#include <cstdio>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <deque>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <cctype>\n#include <climits>\n#include <functional>\n#include <cassert>\n#include <numeric>\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define per(i, n) for(int i = (n) - 1; i >= 0; i--)\nusing ll = long long;\n#define vi vector<int>\n#define vvi vector<vi>\n#define vl vector<ll>\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define all(a) (a).begin(), (a).end()\n#define rall(a) (a).rbegin(), (a).rend()\n#define mod 1000000007\nusing namespace std;\ntemplate<class T, class U>\nbool chmax(T &a, const U &b){ return a < b ? (a = b, 1) : 0; }\ntemplate<class T, class U>\nbool chmin(T &a, const U &b){ return a > b ? (a = b, 1) : 0; }\ntemplate <class T>\nstruct Edge {\n int to;\n T cost;\n Edge(){};\n Edge(int t, T c=1) : to(t), cost(c){}\n operator int() const{ return to; }\n bool operator<(const Edge &e){ return cost < e.cost; }\n};\ntemplate <class T>\nstruct Graph : vector<vector<Edge<T>>> {\n Graph(){}\n Graph(const int &n) : vector<vector<Edge<T>>>(n){}\n void add_edge(int a, int b, T c=1){\n (*this)[a].push_back({ b, c });\n }\n};\nusing graph = Graph<int>;\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n,m;\n cin >> n >> m;\n vector<tuple<int,int,int>> edges(m);\n graph root(n);\n rep(i, m){\n int a,b,c;\n cin >> a >> b >> c;\n a--; b--;\n root[a].push_back({ b, c });\n root[b].push_back({ a, c });\n edges[i] = { a, b, c };\n }\n vvi dp1(n, vi(1 << n, mod));\n vvi dpn(n, vi(1 << n, mod));\n dp1[0][1] = dpn[n-1][1 << (n-1)] = 0;\n rep(i, 1 << n){\n rep(j, n){\n rep(k, n){\n chmin(dp1[j][i | 1 << k], dp1[j][i]);\n chmin(dpn[j][i | 1 << k], dpn[j][i]);\n }\n for(const auto &x : root[j]){\n chmin(dp1[x][i | 1 << x], dp1[j][i] + x.cost);\n chmin(dpn[x][i | 1 << x], dpn[j][i] + x.cost);\n }\n }\n }\n const int mask = (1 << n) - 1;\n rep(i, m){\n int a,b,c;\n tie(a, b, c) = edges[i];\n int ans = mod;\n rep(j, 1 << n){\n chmin(ans, dp1[a][j] + dpn[b][j ^ mask] + c);\n chmin(ans, dpn[a][j] + dp1[b][j ^ mask] + c);\n }\n if(ans == mod) cout << \"-1\\n\";\n else cout << ans << \"\\n\";\n }\n}", "accuracy": 1, "time_ms": 1660, "memory_kb": 171192, "score_of_the_acc": -0.2356, "final_rank": 5 }, { "submission_id": "aoj_0475_6959620", "code_snippet": "#include <iostream>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <tuple>\n#include <cstdint>\n#include <cstdio>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <deque>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <cctype>\n#include <climits>\n#include <functional>\n#include <cassert>\n#include <numeric>\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define per(i, n) for(int i = (n) - 1; i >= 0; i--)\nusing ll = long long;\n#define vi vector<int>\n#define vvi vector<vi>\n#define vl vector<ll>\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define all(a) (a).begin(), (a).end()\n#define rall(a) (a).rbegin(), (a).rend()\n#define mod 1000000007\nusing namespace std;\ntemplate<class T, class U>\nbool chmax(T &a, const U &b){ return a < b ? (a = b, 1) : 0; }\ntemplate<class T, class U>\nbool chmin(T &a, const U &b){ return a > b ? (a = b, 1) : 0; }\ntemplate <class T>\nstruct Edge {\n int to;\n T cost;\n Edge(){};\n Edge(int t, T c=1) : to(t), cost(c){}\n operator int() const{ return to; }\n bool operator<(const Edge &e){ return cost < e.cost; }\n};\ntemplate <class T>\nstruct Graph : vector<vector<Edge<T>>> {\n Graph(){}\n Graph(const int &n) : vector<vector<Edge<T>>>(n){}\n void add_edge(int a, int b, T c=1){\n (*this)[a].push_back({ b, c });\n }\n};\nusing graph = Graph<int>;\nint main(){\n int n,m;\n cin >> n >> m;\n vector<tuple<int,int,int>> edges(m);\n graph root(n);\n rep(i, m){\n int a,b,c;\n cin >> a >> b >> c;\n a--; b--;\n root[a].push_back({ b, c });\n root[b].push_back({ a, c });\n edges[i] = { a, b, c };\n }\n vvi dp1(n, vi(1 << n, mod));\n vvi dpn(n, vi(1 << n, mod));\n dp1[0][1] = dpn[n-1][1 << (n-1)] = 0;\n rep(i, 1 << n){\n rep(j, n){\n rep(k, n){\n chmin(dp1[j][i | 1 << k], dp1[j][i]);\n chmin(dpn[j][i | 1 << k], dpn[j][i]);\n }\n for(const auto &x : root[j]){\n chmin(dp1[x][i | 1 << x], dp1[j][i] + x.cost);\n chmin(dpn[x][i | 1 << x], dpn[j][i] + x.cost);\n }\n }\n }\n const int mask = (1 << n) - 1;\n rep(i, m){\n int a,b,c;\n tie(a, b, c) = edges[i];\n int ans = mod;\n rep(j, 1 << n){\n chmin(ans, dp1[a][j] + dpn[b][j ^ mask] + c);\n chmin(ans, dpn[a][j] + dp1[b][j ^ mask] + c);\n }\n if(ans == mod) cout << \"-1\\n\";\n else cout << ans << \"\\n\";\n }\n}", "accuracy": 1, "time_ms": 1660, "memory_kb": 171192, "score_of_the_acc": -0.2356, "final_rank": 5 }, { "submission_id": "aoj_0475_6959619", "code_snippet": "#include <iostream>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <tuple>\n#include <cstdint>\n#include <cstdio>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <deque>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <cctype>\n#include <climits>\n#include <functional>\n#include <cassert>\n#include <numeric>\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define per(i, n) for(int i = (n) - 1; i >= 0; i--)\nusing ll = long long;\n#define vi vector<int>\n#define vvi vector<vi>\n#define vl vector<ll>\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define all(a) (a).begin(), (a).end()\n#define rall(a) (a).rbegin(), (a).rend()\n#define mod 1000000007\nusing namespace std;\ntemplate<class T, class U>\nbool chmax(T &a, const U &b){ return a < b ? (a = b, 1) : 0; }\ntemplate<class T, class U>\nbool chmin(T &a, const U &b){ return a > b ? (a = b, 1) : 0; }\ntemplate <class T>\nstruct Edge {\n int to;\n T cost;\n Edge(){};\n Edge(int t, T c=1) : to(t), cost(c){}\n operator int() const{ return to; }\n bool operator<(const Edge &e){ return cost < e.cost; }\n};\ntemplate <class T>\nstruct Graph : vector<vector<Edge<T>>> {\n Graph(){}\n Graph(const int &n) : vector<vector<Edge<T>>>(n){}\n void add_edge(int a, int b, T c=1){\n (*this)[a].push_back({ b, c });\n }\n};\nusing graph = Graph<int>;\nint main(){\n int n,m;\n cin >> n >> m;\n vector<tuple<int,int,int>> edges(m);\n graph root(n);\n rep(i, m){\n int a,b,c;\n cin >> a >> b >> c;\n a--; b--;\n root[a].push_back({ b, c });\n root[b].push_back({ a, c });\n edges[i] = { a, b, c };\n }\n vvi dp1(n, vi(1 << n, mod));\n vvi dpn(n, vi(1 << n, mod));\n dp1[0][1] = dpn[n-1][1 << (n-1)] = 0;\n rep(i, 1 << n){\n rep(j, n){\n rep(k, n) if(!(i >> k & 1)){\n chmin(dp1[j][i | 1 << k], dp1[j][i]);\n chmin(dpn[j][i | 1 << k], dpn[j][i]);\n }\n for(const auto &x : root[j]){\n chmin(dp1[x][i | 1 << x], dp1[j][i] + x.cost);\n chmin(dpn[x][i | 1 << x], dpn[j][i] + x.cost);\n }\n }\n }\n const int mask = (1 << n) - 1;\n rep(i, m){\n int a,b,c;\n tie(a, b, c) = edges[i];\n int ans = mod;\n rep(j, 1 << n) if((j >> a & 1) && !(j >> b & 1)){\n chmin(ans, dp1[a][j] + dpn[b][j ^ mask] + c);\n chmin(ans, dpn[a][j] + dp1[b][j ^ mask] + c);\n }\n if(ans == mod) cout << \"-1\\n\";\n else cout << ans << \"\\n\";\n }\n}", "accuracy": 1, "time_ms": 1760, "memory_kb": 171164, "score_of_the_acc": -0.2739, "final_rank": 7 }, { "submission_id": "aoj_0475_6959610", "code_snippet": "#include <iostream>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <tuple>\n#include <cstdint>\n#include <cstdio>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <deque>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <cctype>\n#include <climits>\n#include <functional>\n#include <cassert>\n#include <numeric>\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define per(i, n) for(int i = (n) - 1; i >= 0; i--)\nusing ll = long long;\n#define vi vector<int>\n#define vvi vector<vi>\n#define vl vector<ll>\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define all(a) (a).begin(), (a).end()\n#define rall(a) (a).rbegin(), (a).rend()\n#define mod 1000000007\nusing namespace std;\ntemplate<class T, class U>\nbool chmax(T &a, const U &b){ return a < b ? (a = b, 1) : 0; }\ntemplate<class T, class U>\nbool chmin(T &a, const U &b){ return a > b ? (a = b, 1) : 0; }\ntemplate <class T>\nstruct Edge {\n int to;\n T cost;\n Edge(){};\n Edge(int t, T c=1) : to(t), cost(c){}\n operator int() const{ return to; }\n bool operator<(const Edge &e){ return cost < e.cost; }\n};\ntemplate <class T>\nstruct Graph : vector<vector<Edge<T>>> {\n Graph(){}\n Graph(const int &n) : vector<vector<Edge<T>>>(n){}\n void add_edge(int a, int b, T c=1){\n (*this)[a].push_back({ b, c });\n }\n};\nusing graph = Graph<int>;\nvvi dp1(20, vi(1 << 20, mod)), dpn(20, vi(1 << 20, mod));\nint main(){\n int n,m;\n cin >> n >> m;\n vector<tuple<int,int,int>> edges(m);\n graph root(n);\n rep(i, m){\n int a,b,c;\n cin >> a >> b >> c;\n a--; b--;\n root[a].push_back({ b, c });\n root[b].push_back({ a, c });\n edges[i] = { a, b, c };\n }\n dp1[0][1] = dpn[n-1][1 << (n-1)] = 0;\n rep(i, 1 << n){\n rep(j, n){\n rep(k, n){\n chmin(dp1[j][i | 1 << k], dp1[j][i]);\n chmin(dpn[j][i | 1 << k], dpn[j][i]);\n }\n for(const auto &x : root[j]){\n chmin(dp1[x][i | 1 << x], dp1[j][i] + x.cost);\n chmin(dpn[x][i | 1 << x], dpn[j][i] + x.cost);\n }\n }\n }\n const int mask = (1 << n) - 1;\n rep(i, m){\n int a,b,c;\n tie(a, b, c) = edges[i];\n int ans = mod;\n rep(j, 1 << n){\n chmin(ans, dp1[a][j] + dpn[b][j ^ mask] + c);\n chmin(ans, dpn[a][j] + dp1[b][j ^ mask] + c);\n }\n if(ans == mod) cout << \"-1\\n\";\n else cout << ans << \"\\n\";\n }\n}", "accuracy": 1, "time_ms": 1570, "memory_kb": 171052, "score_of_the_acc": -0.2004, "final_rank": 4 }, { "submission_id": "aoj_0475_6959609", "code_snippet": "#include <iostream>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <tuple>\n#include <cstdint>\n#include <cstdio>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <deque>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <cctype>\n#include <climits>\n#include <functional>\n#include <cassert>\n#include <numeric>\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define per(i, n) for(int i = (n) - 1; i >= 0; i--)\nusing ll = long long;\n#define vi vector<int>\n#define vvi vector<vi>\n#define vl vector<ll>\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define all(a) (a).begin(), (a).end()\n#define rall(a) (a).rbegin(), (a).rend()\n#define mod 1000000007\nusing namespace std;\ntemplate<class T, class U>\nbool chmax(T &a, const U &b){ return a < b ? (a = b, 1) : 0; }\ntemplate<class T, class U>\nbool chmin(T &a, const U &b){ return a > b ? (a = b, 1) : 0; }\ntemplate <class T>\nstruct Edge {\n int to;\n T cost;\n Edge(){};\n Edge(int t, T c=1) : to(t), cost(c){}\n operator int() const{ return to; }\n bool operator<(const Edge &e){ return cost < e.cost; }\n};\ntemplate <class T>\nstruct Graph : vector<vector<Edge<T>>> {\n Graph(){}\n Graph(const int &n) : vector<vector<Edge<T>>>(n){}\n void add_edge(int a, int b, T c=1){\n (*this)[a].push_back({ b, c });\n }\n};\nusing graph = Graph<int>;\nint dp1[20][1 << 20], dpn[20][1 << 20];\nint main(){\n int n,m;\n cin >> n >> m;\n vector<tuple<int,int,int>> edges(m);\n graph root(n);\n rep(i, m){\n int a,b,c;\n cin >> a >> b >> c;\n a--; b--;\n root[a].push_back({ b, c });\n root[b].push_back({ a, c });\n edges[i] = { a, b, c };\n }\n fill(*dp1, *(dp1 + n), mod);\n fill(*dpn, *(dpn + n), mod);\n dp1[0][1] = dpn[n-1][1 << (n-1)] = 0;\n rep(i, 1 << n){\n rep(j, n){\n rep(k, n){\n chmin(dp1[j][i | 1 << k], dp1[j][i]);\n chmin(dpn[j][i | 1 << k], dpn[j][i]);\n }\n for(const auto &x : root[j]){\n chmin(dp1[x][i | 1 << x], dp1[j][i] + x.cost);\n chmin(dpn[x][i | 1 << x], dpn[j][i] + x.cost);\n }\n }\n }\n const int mask = (1 << n) - 1;\n rep(i, m){\n int a,b,c;\n tie(a, b, c) = edges[i];\n int ans = mod;\n rep(j, 1 << n){\n chmin(ans, dp1[a][j] + dpn[b][j ^ mask] + c);\n chmin(ans, dpn[a][j] + dp1[b][j ^ mask] + c);\n }\n if(ans == mod) cout << \"-1\\n\";\n else cout << ans << \"\\n\";\n }\n}", "accuracy": 1, "time_ms": 3040, "memory_kb": 167184, "score_of_the_acc": -0.75, "final_rank": 12 }, { "submission_id": "aoj_0475_6959605", "code_snippet": "#include <iostream>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <tuple>\n#include <cstdint>\n#include <cstdio>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <deque>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <cctype>\n#include <climits>\n#include <functional>\n#include <cassert>\n#include <numeric>\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define per(i, n) for(int i = (n) - 1; i >= 0; i--)\nusing ll = long long;\n#define vi vector<int>\n#define vvi vector<vi>\n#define vl vector<ll>\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define all(a) (a).begin(), (a).end()\n#define rall(a) (a).rbegin(), (a).rend()\n#define mod 1000000007\nusing namespace std;\ntemplate<class T, class U>\nbool chmax(T &a, const U &b){ return a < b ? (a = b, 1) : 0; }\ntemplate<class T, class U>\nbool chmin(T &a, const U &b){ return a > b ? (a = b, 1) : 0; }\ntemplate <class T>\nstruct Edge {\n int to;\n T cost;\n Edge(){};\n Edge(int t, T c=1) : to(t), cost(c){}\n operator int() const{ return to; }\n bool operator<(const Edge &e){ return cost < e.cost; }\n};\ntemplate <class T>\nstruct Graph : vector<vector<Edge<T>>> {\n Graph(){}\n Graph(const int &n) : vector<vector<Edge<T>>>(n){}\n void add_edge(int a, int b, T c=1){\n (*this)[a].push_back({ b, c });\n }\n};\nusing graph = Graph<int>;\nint dp1[20][1 << 20], dpn[20][1 << 20];\nint main(){\n int n,m;\n cin >> n >> m;\n vector<tuple<int,int,int>> edges(m);\n graph root(n);\n rep(i, m){\n int a,b,c;\n cin >> a >> b >> c;\n a--; b--;\n root[a].push_back({ b, c });\n root[b].push_back({ a, c });\n edges[i] = { a, b, c };\n }\n fill(*dp1, *(dp1 + n), mod);\n fill(*dpn, *(dpn + n), mod);\n dp1[0][1] = dpn[n-1][1 << (n-1)] = 0;\n rep(i, 1 << n){\n rep(j, n){\n rep(k, n){\n chmin(dp1[j][i | 1 << k], dp1[j][i]);\n chmin(dpn[j][i | 1 << k], dpn[j][i]);\n }\n for(const auto &x : root[j]){\n chmin(dp1[x][i | 1 << x], dp1[j][i] + x.cost);\n chmin(dpn[x][i | 1 << x], dpn[j][i] + x.cost);\n }\n }\n }\n const int mask = (1 << n) - 1;\n rep(i, m){\n int a,b,c;\n tie(a, b, c) = edges[i];\n int ans = mod;\n rep(j, 1 << n){\n if((j >> a & 1) && !(j >> b & 1)){\n chmin(ans, dp1[a][j] + dpn[b][j ^ mask] + c);\n chmin(ans, dpn[a][j] + dp1[b][j ^ mask] + c);\n }\n }\n if(ans == mod) cout << \"-1\\n\";\n else cout << ans << \"\\n\";\n }\n}", "accuracy": 1, "time_ms": 3020, "memory_kb": 167192, "score_of_the_acc": -0.7423, "final_rank": 11 }, { "submission_id": "aoj_0475_6959599", "code_snippet": "#include <iostream>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <tuple>\n#include <cstdint>\n#include <cstdio>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <deque>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <cctype>\n#include <climits>\n#include <functional>\n#include <cassert>\n#include <numeric>\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define per(i, n) for(int i = (n) - 1; i >= 0; i--)\nusing ll = long long;\n#define vi vector<int>\n#define vvi vector<vi>\n#define vl vector<ll>\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define all(a) (a).begin(), (a).end()\n#define rall(a) (a).rbegin(), (a).rend()\n#define mod 1000000007\nusing namespace std;\ntemplate<class T, class U>\nbool chmax(T &a, const U &b){ return a < b ? (a = b, 1) : 0; }\ntemplate<class T, class U>\nbool chmin(T &a, const U &b){ return a > b ? (a = b, 1) : 0; }\ntemplate <class T>\nstruct Edge {\n int to;\n T cost;\n Edge(){};\n Edge(int t, T c=1) : to(t), cost(c){}\n operator int() const{ return to; }\n bool operator<(const Edge &e){ return cost < e.cost; }\n};\ntemplate <class T>\nstruct Graph : vector<vector<Edge<T>>> {\n Graph(){}\n Graph(const int &n) : vector<vector<Edge<T>>>(n){}\n void add_edge(int a, int b, T c=1){\n (*this)[a].push_back({ b, c });\n }\n};\nusing graph = Graph<int>;\nint dp1[20][1 << 20], dpn[20][1 << 20];\nint main(){\n int n,m;\n cin >> n >> m;\n vector<tuple<int,int,int>> edges(m);\n graph root(n);\n rep(i, m){\n int a,b,c;\n cin >> a >> b >> c;\n a--; b--;\n root[a].push_back({ b, c });\n root[b].push_back({ a, c });\n edges[i] = { a, b, c };\n }\n fill(*dp1, *(dp1 + 20), mod);\n fill(*dpn, *(dpn + 20), mod);\n dp1[0][1] = dpn[n-1][1 << (n-1)] = 0;\n rep(i, 1 << n){\n rep(j, n){\n rep(k, n){\n if(!(i >> k & 1)) chmin(dp1[j][i | 1 << k], dp1[j][i]);\n }\n for(const auto &x : root[j]){\n if(!(i >> x & 1))\n chmin(dp1[x][i | 1 << x], dp1[j][i] + x.cost);\n }\n }\n rep(j, n){\n rep(k, n){\n if(!(i >> k & 1)) chmin(dpn[j][i | 1 << k], dpn[j][i]);\n }\n for(const auto &x : root[j]){\n if(!(i >> x & 1))\n chmin(dpn[x][i | 1 << x], dpn[j][i] + x.cost);\n }\n }\n }\n const int mask = (1 << n) - 1;\n rep(i, m){\n int a,b,c;\n tie(a, b, c) = edges[i];\n int ans = mod;\n rep(j, 1 << n){\n if((j >> a & 1) && !(j >> b & 1)){\n chmin(ans, dp1[a][j] + dpn[b][j ^ mask] + c);\n chmin(ans, dpn[a][j] + dp1[b][j ^ mask] + c);\n }\n }\n if(ans == mod) cout << \"-1\\n\";\n else cout << ans << \"\\n\";\n }\n}", "accuracy": 1, "time_ms": 3690, "memory_kb": 167264, "score_of_the_acc": -1.0003, "final_rank": 15 } ]
aoj_0476_cpp
Monster Koshien You are trying to get your monsters to participate in the upcoming Monster Koshien. In the Monster Koshien, there will be several opposing monsters, and you will play against them one-on-one in turn. Whether you win or not, you can move on to the next match. In a match, the three values of speed, strength, and cleverness of the opposing monsters are compared, and the monster with two or more of these values higher wins. You can adjust the numerical value of your monster to gain an advantage against your opponent's monster. For each gold coin you pay, you can increase the value of one of the three numbers by one size. In exchange, you must decrease the value of one of the other two values by one. The number can be increased as much as you want, but it must be increased or decreased in a non-negative way. The number can be adjusted before each game, and it does not matter how many gold coins you spend. As long as you have gold coins, you can adjust your numbers. The increased or decreased values will be carried over to subsequent matches. You are getting information about your opponent's monsters and thinking how to play your own monsters. You are given the numerical value of each of your monsters, the numerical value of each of the monsters they will face before the match, the order in which they will face each other, and the number of gold coins you can spend. Create a program that calculates the maximum number of matches that your monster will win. Input The input is given in the following format. $N$ $C$ $a$ $s$ $w$ $a_1$ $s_1$ $w_1$ ： $a_N$ $s_N$ $w_N$ The first line gives you the number of matches $N$ ($1 \leq N \leq 50$) and the number of gold coins $C$ ($1 \leq C \leq 5000$) that you can spend. The next line will give you the speed ($0 \leq a \leq 100$), strength ($0 \leq s \leq 100$), and cleverness ($0 \leq w \leq 100$) of your monster. The following $N$ lines give the speed ($0 \leq a_i \leq 100$), strength ($0 \leq s_i \leq 100$), and cleverness ($0 \leq w_i \leq 100$) of the $i$th monster to fight. Output Output the maximum number of matches your monster will win. Sample Input and Output Sample Input 1 2 22 10 30 50 30 100 10 20 50 50 Sample Output 1 2 Sample Input 2 3 30 30 30 0 70 25 20 25 30 60 20 25 90 Sample Output 2 2
[ { "submission_id": "aoj_0476_11027056", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define rng(i,l,r) for(int i=(l);i<(r);i++)\n#define rrep(i,n) for(int i=(n)-1;i>=0;i--)\n#define rrng(i,l,r) for(int i=(r)-1;i>=(l);i--)\n#define int long long\n#define fi first\n#define se second\n#define pb push_back\n#define all(x) (x).begin(),(x).end()\n#define chmin(a,b) a=min(a,b)\n#define chmax(a,b) a=max(a,b)\n\nint dp[59][109][109];\nint ndp[59][109][109];\n\nsigned main(){\n\tint N,C;cin>>N>>C;\n\trep(t,N+1)rep(i,102)rep(j,102)ndp[t][i][j]=C+1;\n\t\n\tauto swp=[&](){\n\t\trep(t,N+1)rep(i,102)rep(j,102){\n\t\t\tdp[t][i][j]=ndp[t][i][j];\n\t\t\tndp[t][i][j]=C+1;\n\t\t}\n\t};\n\tswp();\n\t\n\tint a,s,w;cin>>a>>s>>w;\n\tint sm=a+s+w;\n\tdp[0][a][s]=0;\n\tint u=N;\n\twhile(u--){\n\t\n\t\tvector<array<int,3>> vs[C+1];\n\t\trep(t,N+1)rep(i,102)rep(j,102)if(dp[t][i][j]<C)vs[dp[t][i][j]].pb({t,i,j});\n\t\t\n\t\trep(c,C){\n\t\t\tfor(auto&&[t,i,j]:vs[c]){\n\t\t\t\tif(i+j>sm)continue;\n\t\t\t\tif(dp[t][i][j]<c)continue;\n\t\t\t\t\n\t\t\t\tif(i){\n\t\t\t\t\tif(dp[t][i-1][j]>c+1){\n\t\t\t\t\t\tdp[t][i-1][j]=c+1;\n\t\t\t\t\t\tvs[c+1].pb({t,i-1,j});\n\t\t\t\t\t}\n\t\t\t\t\t\n\t\t\t\t\tif(dp[t][i-1][j+1]>c+1){\n\t\t\t\t\t\tdp[t][i-1][j+1]=c+1;\n\t\t\t\t\t\tvs[c+1].pb({t,i-1,j+1});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\t\n\t\t\t\tif(j){\n\t\t\t\t\tif(dp[t][i][j-1]>c+1){\n\t\t\t\t\t\tdp[t][i][j-1]=c+1;\n\t\t\t\t\t\tvs[c+1].pb({t,i,j-1});\n\t\t\t\t\t}\n\t\t\t\t\tif(dp[t][i+1][j-1]>c+1){\n\t\t\t\t\t\tdp[t][i+1][j-1]=c+1;\n\t\t\t\t\t\tvs[c+1].pb({t,i+1,j-1});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(sm-i-j){\n\t\t\t\t\tif(dp[t][i+1][j]>c+1){\n\t\t\t\t\t\tdp[t][i+1][j]=c+1;\n\t\t\t\t\t\tvs[c+1].pb({t,i+1,j});\n\t\t\t\t\t}\n\t\t\t\t\tif(dp[t][i][j+1]>c+1){\n\t\t\t\t\t\tdp[t][i][j+1]=c+1;\n\t\t\t\t\t\tvs[c+1].pb({t,i,j+1});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tint ai,si,wi;cin>>ai>>si>>wi;\n\t\trep(t,N+1)rep(i,102)rep(j,102){\n\t\t\tif(i+j>sm)continue;\n\t\t\tint cnt=0;\n\t\t\tcnt+=(ai<i);\n\t\t\tcnt+=(si<j);\n\t\t\tcnt+=(wi<sm-i-j);\n\t\t\tchmin(ndp[t+(cnt>=2)][i][j],dp[t][i][j]);\n\t\t}\n\t\t\n\t\tswp();\n\t}\n\t\n\trrep(t,N+1)rep(i,102)rep(j,102){\n\t\tif(dp[t][i][j]<=C){\n\t\t//\tcout<<t<<\" \"<<i<<\" \"<<j<<\" \"<<dp[t][i][j]<<\"\\n\";\n\t\t\tcout<<t<<\"\\n\";\n\t\t\treturn 0;\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 450, "memory_kb": 37120, "score_of_the_acc": -0.5353, "final_rank": 4 }, { "submission_id": "aoj_0476_11016887", "code_snippet": "#include <algorithm>\n#include <iostream>\n#include <queue>\n\n#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)\n\nusing namespace std;\n\nint dp[2][51][301][301];\nconst int INF = 1 << 28;\n\nint main(void){\n int n, c;\n cin >> n >> c;\n int ma, ms, mw;\n cin >> ma >> ms >> mw;\n int total = ma + ms + mw;\n vector<int> a(n), s(n), w(n);\n REP(i, 0, n) {\n cin >> a.at(i) >> s.at(i) >> w.at(i);\n }\n REP(i, 0, 2) REP(ii, 0, n + 1) REP(j, 0, 301) REP(k, 0, 301) dp[i][ii][j][k] = INF;\n dp[0][0][ma][ms] = 0;\n REP(i, 0, n) {\n REP(ii, 0, n + 1) REP(j, 0, 301) REP(k, 0, 301) dp[1][ii][j][k] = INF;\n REP(ii, 0, i + 1) {\n REP(x0, 0, total + 1) {\n REP(x1, 0, total - x0 + 1) {\n if (dp[0][ii][x0][x1] > c) continue;\n dp[1][ii][x0][x1] = dp[0][ii][x0][x1];\n }\n }\n // (+1, 0) (-1, 0)\n REP(x0, 0, total) {\n REP(x1, 0, total - x0 + 1) {\n dp[1][ii][x0 + 1][x1] = min(dp[1][ii][x0 + 1][x1], dp[1][ii][x0][x1] + 1);\n }\n }\n for (int x0 = total; x0 >= 1; x0--) {\n REP(x1, 0, total - x0 + 1) {\n dp[1][ii][x0 - 1][x1] = min(dp[1][ii][x0 - 1][x1], dp[1][ii][x0][x1] + 1);\n }\n }\n // (0, +1) (0, -1)\n REP(x0, 0, total + 1) {\n REP(x1, 0, total - x0) {\n dp[1][ii][x0][x1 + 1] = min(dp[1][ii][x0][x1 + 1], dp[1][ii][x0][x1] + 1);\n }\n }\n REP(x0, 0, total + 1) {\n for (int x1 = total - x0; x1 >= 1; x1--) {\n dp[1][ii][x0][x1 - 1] = min(dp[1][ii][x0][x1 - 1], dp[1][ii][x0][x1] + 1);\n }\n }\n // (+1, -1) (-1, +1)\n REP(x0, 0, total + 1) {\n REP(x1, 0, total - x0 + 1) {\n dp[1][ii][x0 + 1][x1 - 1] = min(dp[1][ii][x0 + 1][x1 - 1], dp[1][ii][x0][x1] + 1);\n }\n }\n for (int x0 = total; x0 >= 1; x0--) {\n REP(x1, 0, total - x0 + 1) {\n dp[1][ii][x0 - 1][x1 + 1] = min(dp[1][ii][x0 - 1][x1 + 1], dp[1][ii][x0][x1] + 1);\n }\n }\n }\n for (int ii = i; ii >= 0; ii--) {\n REP(x0, 0, total + 1) REP(x1, 0, total - x0 + 1) {\n int x2 = total - x0 - x1;\n int win = (x0 > a.at(i)) + (x1 > s.at(i)) + (x2 > w.at(i)) >= 2;\n if (win) {\n dp[1][ii + 1][x0][x1] = min(dp[1][ii + 1][x0][x1], dp[1][ii][x0][x1]);\n }\n }\n }\n swap(dp[0], dp[1]);\n }\n int ans = 0;\n REP(ii, 0, n + 1) REP(x0, 0, total + 1) REP(x1, 0, total - x0 + 1) {\n if (dp[0][ii][x0][x1] <= c) {\n ans = max(ans, ii);\n }\n }\n cout << ans << \"\\n\";\n exit(0);\n}", "accuracy": 1, "time_ms": 500, "memory_kb": 39740, "score_of_the_acc": -0.5885, "final_rank": 5 }, { "submission_id": "aoj_0476_11015534", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\nsigned main(){\n int N,C;\n cin>>N>>C;\n int aa,bb,cc;\n cin>>aa>>bb>>cc;\n int n = 105;\n vector<vector<vector<int>>> dp(N+1,vector<vector<int>>(n,vector<int>(n,-1)));\n dp[0][aa][bb] = C;\n for(int ty=0;ty<N;ty++){\n for(int i=0;i<=ty;i++){\n for(int j=0;j<n;j++)for(int k=0;k<n-1;k++) dp[i][j][k+1] = max(dp[i][j][k]-1,dp[i][j][k+1]);\n for(int j=0;j<n;j++)for(int k=n-1;k>0;k--) dp[i][j][k-1] = max(dp[i][j][k]-1,dp[i][j][k-1]);\n for(int j=0;j<n;j++)for(int k=0;k<n-1;k++) dp[i][k+1][j] = max(dp[i][k][j]-1,dp[i][k+1][j]);\n for(int j=0;j<n;j++)for(int k=n-1;k>0;k--) dp[i][k-1][j] = max(dp[i][k][j]-1,dp[i][k-1][j]);\n for(int j=0;j<n-1;j++)for(int k=1;k<n;k++) dp[i][j+1][k-1] = max(dp[i][j+1][k-1],dp[i][j][k]-1);\n for(int j=n-1;j>0;j--)for(int k=0;k<n-1;k++) dp[i][j-1][k+1] = max(dp[i][j-1][k+1],dp[i][j][k]-1);\n }\n int a,b,c;\n cin>>a>>b>>c;\n for(int i=ty;i>=0;i--){\n for(int j=0;j<n;j++)for(int k=0;k<n;k++){\n int l = aa+bb+cc-j-k;\n if(l < 0) continue;\n if((j > a)+(k > b)+(l > c) >= 2){\n //if(j == 31 && k == 8 && l == 51) cout<<dp[i][j][k]<<endl;\n dp[i+1][j][k] = max(dp[i+1][j][k],dp[i][j][k]);\n }\n }\n }\n }\n for(int i=N;i>=0;i--){\n for(int j=0;j<n;j++)for(int k=0;k<n;k++)if(dp[i][j][k] >= 0){\n cout<<i<<endl;\n return 0;\n }\n }\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 7864, "score_of_the_acc": -0.0683, "final_rank": 1 }, { "submission_id": "aoj_0476_11015533", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\nsigned main(){\n int N,C;\n cin>>N>>C;\n int aa,bb,cc;\n cin>>aa>>bb>>cc;\n int n = 101;\n vector<vector<vector<int>>> dp(N+1,vector<vector<int>>(n,vector<int>(n,-1)));\n dp[0][aa][bb] = C;\n for(int ty=0;ty<N;ty++){\n for(int i=0;i<=ty;i++){\n for(int j=0;j<n;j++)for(int k=0;k<n-1;k++) dp[i][j][k+1] = max(dp[i][j][k]-1,dp[i][j][k+1]);\n for(int j=0;j<n;j++)for(int k=n-1;k>0;k--) dp[i][j][k-1] = max(dp[i][j][k]-1,dp[i][j][k-1]);\n for(int j=0;j<n;j++)for(int k=0;k<n-1;k++) dp[i][k+1][j] = max(dp[i][k][j]-1,dp[i][k+1][j]);\n for(int j=0;j<n;j++)for(int k=n-1;k>0;k--) dp[i][k-1][j] = max(dp[i][k][j]-1,dp[i][k-1][j]);\n for(int j=0;j<n-1;j++)for(int k=1;k<n;k++) dp[i][j+1][k-1] = max(dp[i][j+1][k-1],dp[i][j][k]-1);\n for(int j=n-1;j>0;j--)for(int k=0;k<n-1;k++) dp[i][j-1][k+1] = max(dp[i][j-1][k+1],dp[i][j][k]-1);\n }\n int a,b,c;\n cin>>a>>b>>c;\n for(int i=ty;i>=0;i--){\n for(int j=0;j<n;j++)for(int k=0;k<n;k++){\n int l = aa+bb+cc-j-k;\n if(l < 0) continue;\n if((j > a)+(k > b)+(l > c) >= 2){\n //if(j == 31 && k == 8 && l == 51) cout<<dp[i][j][k]<<endl;\n dp[i+1][j][k] = max(dp[i+1][j][k],dp[i][j][k]);\n }\n }\n }\n }\n for(int i=N;i>=0;i--){\n for(int j=0;j<n;j++)for(int k=0;k<n;k++)if(dp[i][j][k] >= 0){\n cout<<i<<endl;\n return 0;\n }\n }\n}", "accuracy": 0.8888888888888888, "time_ms": 70, "memory_kb": 7532, "score_of_the_acc": -0.066, "final_rank": 11 }, { "submission_id": "aoj_0476_11012028", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint N,C;\n\tcin>>N>>C;\n\tint ma,ms,mw;\n\tcin>>ma>>ms>>mw;\n\tint all=ma+ms+mw;\n\tint a[N+1],s[N+1],w[N+1];\n\tfor(int i=1;i<=N;i++) cin>>a[i]>>s[i]>>w[i];\n\tint dp[N+1][N+1][all+1][all+1];\n\tint dp1[N+1][all+1][all+1],dp2[N+1][all+1][all+1];\n\tfor(int i=0;i<=N;i++){\n\t\tfor(int j=0;j<=all;j++){\n\t\t\tfor(int k=0;k<=all;k++){\n\t\t\t\tdp1[i][j][k]=-1;\n\t\t\t\tdp2[i][j][k]=-1;\n\t\t\t}\n\t\t}\n\t}\n\tdp1[0][ma][ms]=C;\n\tfor(int i=0;i<N;i++){\n\t\tfor(int j=0;j<N;j++){\n\t\t\tfor(int k=0;k<=all;k++){\n\t\t\t\tfor(int l=0;l<=all;l++){\n\t\t\t\t\tint pw=all-k-l;\n\t\t\t\t\tif(pw<0) continue;\n\t\t\t\t\tif(a[i+1]+s[i+1]+2<=all){\n\t\t\t\t\t\tint cost=0;\n\t\t\t\t\t\tcost+=max(0,a[i+1]-k+1)+max(0,s[i+1]-l+1);\n\t\t\t\t\t\tint na,ns;\n\t\t\t\t\t\tna=max(a[i+1]+1,k),ns=max(s[i+1]+1,l);\n\t\t\t\t\t\tif(na+ns>all){\n\t\t\t\t\t\t\tif(na>a[i+1]+1){\n\t\t\t\t\t\t\t\tna=all-ns;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse{\n\t\t\t\t\t\t\t\tns=all-na;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdp2[j+1][na][ns]=max(dp2[j+1][na][ns],dp1[j][k][l]-cost);\n\t\t\t\t\t}\n\t\t\t\t\tif(a[i+1]+w[i+1]+2<=all){\n\t\t\t\t\t\tint cost=0;\n\t\t\t\t\t\tcost+=max(0,a[i+1]-k+1)+max(0,w[i+1]-pw+1);\n\t\t\t\t\t\tint na,ns,nw;\n\t\t\t\t\t\tna=max(a[i+1]+1,k),nw=max(w[i+1]+1,pw);\n\t\t\t\t\t\tif(na+nw>all){\n\t\t\t\t\t\t\tns=0;\n\t\t\t\t\t\t\tif(na>a[i+1]+1) na=all-nw;\n\t\t\t\t\t\t\telse nw=all-na;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse ns=all-na-nw;\n\t\t\t\t\t\t\n\t\t\t\t\t\tdp2[j+1][na][ns]=max(dp2[j+1][na][ns],dp1[j][k][l]-cost);\n\t\t\t\t\t}\n\t\t\t\t\tif(s[i+1]+w[i+1]+2<=all){\n\t\t\t\t\t\tint cost=0;\n\t\t\t\t\t\tcost+=max(0,s[i+1]-l+1)+max(0,w[i+1]-pw+1);\n\t\t\t\t\t\tint na,ns,nw;\n\t\t\t\t\t\tns=max(s[i+1]+1,l),nw=max(w[i+1]+1,pw);\n\t\t\t\t\t\tif(ns+nw>all){\n\t\t\t\t\t\t\tna=0;\n\t\t\t\t\t\t\tif(ns>s[i+1]+1) ns=all-nw;\n\t\t\t\t\t\t\telse nw=all-ns;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse na=all-ns-nw;\n\t\t\t\t\t\tdp2[j+1][na][ns]=max(dp2[j+1][na][ns],dp1[j][k][l]-cost);\n\t\t\t\t\t}\n\t\t\t\t\tdp2[j][k][l]=max(dp2[j][k][l],dp1[j][k][l]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor(int j=0;j<=N;j++){\n\t\t\tfor(int k=0;k<=all;k++){\n\t\t\t\tfor(int l=0;l<=all;l++){\n\t\t\t\t\tdp1[j][k][l]=dp2[j][k][l];\n\t\t\t\t\tdp2[j][k][l]=-1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tint ans=0;\n\tfor(int i=0;i<=N;i++){\n\t\tfor(int j=0;j<=all;j++){\n\t\t\tfor(int k=0;k<=all;k++){\n\t\t\t\tif(dp1[i][j][k]>=0) ans=i;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans<<endl;\n}", "accuracy": 0.4, "time_ms": 10, "memory_kb": 4064, "score_of_the_acc": 0, "final_rank": 14 }, { "submission_id": "aoj_0476_11012004", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint N,C;\n\tcin>>N>>C;\n\tint ma,ms,mw;\n\tcin>>ma>>ms>>mw;\n\tint all=ma+ms+mw;\n\tint a[N+1],s[N+1],w[N+1];\n\tfor(int i=1;i<=N;i++) cin>>a[i]>>s[i]>>w[i];\n\tint dp[N+1][N+1][all+1][all+1];\n\tfor(int i=0;i<=N;i++){\n\t\tfor(int j=0;j<=N;j++){\n\t\t\tfor(int k=0;k<=all;k++){\n\t\t\t\tfor(int l=0;l<=all;l++) dp[i][j][k][l]=-1;\n\t\t\t}\n\t\t}\n\t}\n\tdp[0][0][ma][ms]=C;\n\tfor(int i=0;i<N;i++){\n\t\tfor(int j=0;j<N;j++){\n\t\t\tfor(int k=0;k<=all;k++){\n\t\t\t\tfor(int l=0;l<=all;l++){\n\t\t\t\t\tint pw=all-k-l;\n\t\t\t\t\tif(pw<0) continue;\n\t\t\t\t\tif(a[i+1]+s[i+1]+2<=all){\n\t\t\t\t\t\tint cost=0;\n\t\t\t\t\t\tcost+=max(0,a[i+1]-k+1)+max(0,s[i+1]-l+1);\n\t\t\t\t\t\tint na,ns;\n\t\t\t\t\t\tna=max(a[i+1]+1,k),ns=max(s[i+1]+1,l);\n\t\t\t\t\t\tif(na+ns>all){\n\t\t\t\t\t\t\tif(na>a[i+1]+1){\n\t\t\t\t\t\t\t\tna=all-ns;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse{\n\t\t\t\t\t\t\t\tns=all-na;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tdp[i+1][j+1][na][ns]=max(dp[i+1][j+1][na][ns],dp[i][j][k][l]-cost);\n\t\t\t\t\t}\n\t\t\t\t\tif(a[i+1]+w[i+1]+2<=all){\n\t\t\t\t\t\tint cost=0;\n\t\t\t\t\t\tcost+=max(0,a[i+1]-k+1)+max(0,w[i+1]-pw+1);\n\t\t\t\t\t\tint na,ns,nw;\n\t\t\t\t\t\tna=max(a[i+1]+1,k),nw=max(w[i+1]+1,pw);\n\t\t\t\t\t\tif(na+nw>all){\n\t\t\t\t\t\t\tns=0;\n\t\t\t\t\t\t\tif(na>a[i+1]+1) na=all-nw;\n\t\t\t\t\t\t\telse nw=all-na;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse ns=all-na-nw;\n\t\t\t\t\t\t\n\t\t\t\t\t\tdp[i+1][j+1][na][ns]=max(dp[i+1][j+1][na][ns],dp[i][j][k][l]-cost);\n\t\t\t\t\t}\n\t\t\t\t\tif(s[i+1]+w[i+1]+2<=all){\n\t\t\t\t\t\tint cost=0;\n\t\t\t\t\t\tcost+=max(0,s[i+1]-l+1)+max(0,w[i+1]-pw+1);\n\t\t\t\t\t\tint na,ns,nw;\n\t\t\t\t\t\tns=max(s[i+1]+1,l),nw=max(w[i+1]+1,pw);\n\t\t\t\t\t\tif(ns+nw>all){\n\t\t\t\t\t\t\tna=0;\n\t\t\t\t\t\t\tif(ns>s[i+1]+1) ns=all-nw;\n\t\t\t\t\t\t\telse nw=all-ns;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse na=all-ns-nw;\n\t\t\t\t\t\tdp[i+1][j+1][na][ns]=max(dp[i+1][j+1][na][ns],dp[i][j][k][l]-cost);\n\t\t\t\t\t}\n\t\t\t\t\tdp[i+1][j][k][l]=max(dp[i+1][j][k][l],dp[i][j][k][l]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tint ans=0;\n\tfor(int i=0;i<=N;i++){\n\t\tfor(int j=0;j<=all;j++){\n\t\t\tfor(int k=0;k<=all;k++){\n\t\t\t\tif(dp[N][i][j][k]>=0) ans=i;\n\t\t\t}\n\t\t}\n\t}\n\tcout<<ans<<endl;\n}", "accuracy": 0.4, "time_ms": 10, "memory_kb": 21284, "score_of_the_acc": -0.1151, "final_rank": 16 }, { "submission_id": "aoj_0476_10957309", "code_snippet": "#include <iostream>\n#include <vector>\n#include <set>\n#include <map>\n#include <algorithm>\n#include <iomanip>\n#include <numeric>\n#include <queue>\n#include <deque>\n#include <stack>\nusing namespace std;\nusing ll = long long;\nint dp[51][51][120][120];\nstruct S {\n\tint id;\n\tint win;\n\tint a;\n\tint s;\n};\nint main() {\n\tint N, C;cin >> N >> C;\n\tint a, s, w;cin >> a >> s >> w;\n\tint K = 110;\n\tint T = a + s + w;\n\tfor (int i = 0;i < N+1;i++) for (int j = 0;j < N+1;j++) for (int a = 0;a <= K;a++) for (int b = 0;b <= K;b++) dp[i][j][a][b] = (int)1e9;\n\tdp[0][0][a][s] = 0;\n\tdeque<pair<int,S>> que;\n\tque.push_back({0, {0, 0, a, s}});\n\tvector<int> A(N+1), S(N+1), W(N+1);\n\tfor (int i = 1;i <= N;i++) {\n\t\tcin >> A[i] >> S[i] >> W[i];\n\t}\n\twhile (!que.empty()) {\n\t\tauto tps = que.front();que.pop_front();\n\t\tint d = tps.first;\n\t\tauto tp = tps.second;\n\t\tint id = tp.id;int win = tp.win;\n\t\tint na = tp.a;int ns = tp.s;\n\t\tint nw = T - na - ns;\n\t\tif (dp[id][win][na][ns] < d) continue;\n\t\t//idの繊維\n\t\tif (id+1 <= N) {\n\t\t\tint cnt = 0;\n\t\t\tif (na > A[id+1]) cnt++;\n\t\t\tif (ns > S[id+1]) cnt++;\n\t\t\tif (nw > W[id+1]) cnt++;\n\t\t\tint nwin = win;\n\t\t\tif (cnt >= 2) nwin++;\n\t\t\tif (d < dp[id+1][nwin][na][ns]) {\n\t\t\t\tdp[id+1][nwin][na][ns]= dp[id][win][na][ns];\n\t\t\t\tque.push_front({d, {id+1, nwin, na, ns}});\n\t\t\t}\n\t\t}\n\t\t//ほかの遷移\n\t\tfor (int i = 0;i < 3;i++) for (int j = 0;j < 3;j++) {\n\t\t\tif (i == j) continue;\n\t\t\tvector<int> now = {na, ns, nw};\n\t\t\tif (now[i] > K) continue;\n\t\t\tif (now[j] <= 0) continue;\n\t\t\tnow[i]++;now[j]--;\n\t\t\tint nxa = now[0];int nxs = now[1];\n\t\t\tif (d+1 < dp[id][win][nxa][nxs]) {\n\t\t\t\tdp[id][win][nxa][nxs] = dp[id][win][na][ns] + 1;\n\t\t\t\tque.push_back({d+1, {id, win, nxa, nxs}});\n\t\t\t}\n\t\t} \n\t}\n\tint res = 0;\n\tfor (int i = 1;i <= N;i++) for (int j = 1;j <= i;j++) for (int a = 0;a <= K;a++) for (int b = 0;b <= K;b++) {\n\t\tif (dp[i][j][a][b] <= C) res = max(res, j);\n\t}\n\tcout << res << endl;\n}", "accuracy": 1, "time_ms": 1180, "memory_kb": 153644, "score_of_the_acc": -1.8357, "final_rank": 10 }, { "submission_id": "aoj_0476_10957139", "code_snippet": "#include <iostream>\n#include <vector>\n#include <set>\n#include <map>\n#include <algorithm>\n#include <iomanip>\n#include <numeric>\n#include <queue>\n#include <deque>\n#include <stack>\nusing namespace std;\nusing ll = long long;\nint dp[51][51][110][110];\nstruct S {\n\tint id;\n\tint win;\n\tint a;\n\tint s;\n};\nint main() {\n\tint N, C;cin >> N >> C;\n\tint a, s, w;cin >> a >> s >> w;\n\tint K = 104;\n\tint T = a + s + w;\n\tfor (int i = 0;i < N+1;i++) for (int j = 0;j < N+1;j++) for (int a = 0;a <= K;a++) for (int b = 0;b <= K;b++) dp[i][j][a][b] = -1;\n\tdp[0][0][a][s] = 0;\n\tdeque<S> que;\n\tque.push_back({0, 0, a, s});\n\tvector<int> A(N+1), S(N+1), W(N+1);\n\tfor (int i = 1;i <= N;i++) {\n\t\tcin >> A[i] >> S[i] >> W[i];\n\t}\t\n\twhile (!que.empty()) {\n\t\tauto tp = que.front();que.pop_front();\n\t\tint id = tp.id;int win = tp.win;\n\t\tint na = tp.a;int ns = tp.s;\n\t\tint nw = T - na - ns;\n\t\t//idの繊維\n\t\tif (id+1 <= N) {\n\t\t\tint cnt = 0;\n\t\t\tif (na > A[id+1]) cnt++;\n\t\t\tif (ns > S[id+1]) cnt++;\n\t\t\tif (nw > W[id+1]) cnt++;\n\t\t\tint nwin = win;\n\t\t\tif (cnt >= 2) nwin++;\n\t\t\tif (dp[id+1][nwin][na][ns]== -1) {\n\t\t\t\tdp[id+1][nwin][na][ns]= dp[id][win][na][ns];\n\t\t\t\tque.push_front({id+1, nwin, na, ns});\n\t\t\t}\n\t\t}\n\t\t//ほかの遷移\n\t\tfor (int i = 0;i < 3;i++) for (int j = 0;j < 3;j++) {\n\t\t\tif (i == j) continue;\n\t\t\tvector<int> now = {na, ns, nw};\n\t\t\tif (now[i] > K) continue;\n\t\t\tif (now[j] <= 0) continue;\n\t\t\tnow[i]++;now[j]--;\n\t\t\tint nxa = now[0];int nxs = now[1];\n\t\t\tif (dp[id][win][nxa][nxs] == -1) {\n\t\t\t\tdp[id][win][nxa][nxs] = dp[id][win][na][ns] + 1;\n\t\t\t\tque.push_back({id, win, nxa, nxs});\n\t\t\t}\n\t\t} \n\t}\n\tint res = 0;\n\tfor (int i = 1;i <= N;i++) for (int j = 1;j <= i;j++) for (int a = 0;a <= K;a++) for (int b = 0;b <= K;b++) {\n\t\tif (dp[i][j][a][b] != -1 and dp[i][j][a][b] <= C) res = max(res, j);\n\t}\n\tcout << res << endl;\n}", "accuracy": 0.4, "time_ms": 110, "memory_kb": 126904, "score_of_the_acc": -0.8927, "final_rank": 17 }, { "submission_id": "aoj_0476_10956880", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = (1 << 28);\n\nstruct Monster {\n int a, b, c;\n};\n\nint dp[309][309][109];\nint ndp[309][309][109];\n\nint main() {\n // step 1. input\n int n, C; cin >> n >> C;\n int a, b, c; cin >> a >> b >> c;\n int s = a + b + c;\n vector<Monster> p(n);\n for (int i = 0; i < n; i++) {\n cin >> p[i].a >> p[i].b >> p[i].c;\n }\n\n // step 2. solve init\n auto reset = [&](int idx) {\n for (int pa = 0; pa <= s; pa++) {\n for (int pb = 0; pb <= s - pa; pb++) {\n for (int win = 0; win <= n; win++) {\n if (dp[pa][pb][win] == INF) continue;\n int pc = s - pa - pb;\n int wins = (pa > p[idx].a ? 1 : 0) + (pb > p[idx].b ? 1 : 0) + (pc > p[idx].c ? 1 : 0);\n int incr = (wins >= 2 ? 1 : 0);\n ndp[pa][pb][win + incr] = min(ndp[pa][pb][win + incr], dp[pa][pb][win]);\n }\n }\n }\n for (int pa = 0; pa <= s; pa++) {\n for (int pb = 0; pb <= s - pa; pb++) {\n for (int win = 0; win <= n; win++) {\n dp[pa][pb][win] = ndp[pa][pb][win];\n ndp[pa][pb][win] = INF;\n }\n }\n }\n };\n\n // reset\n for (int pa = 0; pa <= s; pa++) {\n for (int pb = 0; pb <= s; pb++) {\n for (int win = 0; win <= n; win++) {\n dp[pa][pb][win] = INF;\n ndp[pa][pb][win] = INF;\n }\n }\n }\n dp[a][b][0] = 0;\n \n // step 3. solve main\n for (int idx = 0; idx < n; idx++) {\n for (int win = 0; win < n; win++) {\n // a を 1 増やして b を 1 減らす\n for (int pa = 0; pa <= s; pa++) {\n for (int pb = 0; pb <= s - pa; pb++) {\n int pc = s - pa - pb;\n if (dp[pa][pb][win] < C && pb >= 1) {\n dp[pa + 1][pb - 1][win] = min(dp[pa + 1][pb - 1][win], dp[pa][pb][win] + 1);\n }\n }\n }\n\n // b を 1 増やして a を 1 減らす\n for (int pa = s; pa >= 0; pa--) {\n for (int pb = 0; pb <= s - pa; pb++) {\n int pc = s - pa - pb;\n if (dp[pa][pb][win] < C && pa >= 1) {\n dp[pa - 1][pb + 1][win] = min(dp[pa - 1][pb + 1][win], dp[pa][pb][win] + 1);\n }\n }\n }\n\n // a を 1 増やして c を 1 減らす\n for (int pa = 0; pa <= s; pa++) {\n for (int pb = 0; pb <= s - pa; pb++) {\n int pc = s - pa - pb;\n if (dp[pa][pb][win] < C && pc >= 1) {\n dp[pa + 1][pb][win] = min(dp[pa + 1][pb][win], dp[pa][pb][win] + 1);\n }\n }\n }\n\n // c を 1 増やして a を 1 減らす\n for (int pa = s; pa >= 0; pa--) {\n for (int pb = 0; pb <= s - pa; pb++) {\n int pc = s - pa - pb;\n if (dp[pa][pb][win] < C && pa >= 1) {\n dp[pa - 1][pb][win] = min(dp[pa - 1][pb][win], dp[pa][pb][win] + 1);\n }\n }\n }\n\n // b を 1 増やして c を 1 減らす\n for (int pa = 0; pa <= s; pa++) {\n for (int pb = 0; pb <= s - pa; pb++) {\n int pc = s - pa - pb;\n if (dp[pa][pb][win] < C && pc >= 1) {\n dp[pa][pb + 1][win] = min(dp[pa][pb + 1][win], dp[pa][pb][win] + 1);\n }\n }\n }\n\n // c を 1 増やして b を 1 減らす\n for (int pa = s; pa >= 0; pa--) {\n for (int pb = 0; pb <= s - pa; pb++) {\n int pc = s - pa - pb;\n if (dp[pa][pb][win] < C && pb >= 1) {\n dp[pa][pb - 1][win] = min(dp[pa][pb - 1][win], dp[pa][pb][win] + 1);\n }\n }\n }\n }\n\n // すべてをリセット\n reset(idx);\n }\n\n // output\n int maxn = 0;\n for (int i = 0; i <= s; i++) {\n for (int j = 0; j <= s; j++) {\n for (int k = 0; k <= n; k++) {\n if (dp[i][j][k] <= C) maxn = max(maxn, k);\n }\n }\n }\n cout << maxn << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 1410, "memory_kb": 83560, "score_of_the_acc": -1.5315, "final_rank": 9 }, { "submission_id": "aoj_0476_10223029", "code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\n#define int long long\n\nconst int MAXN = 55, MAXS = 105;\n\nsigned dp[MAXN][MAXN][MAXS][MAXS];\n\nbool check(int a, int b, int c, int ea, int eb, int ec) {\n int cnt = (a > ea) + (b > eb) + (c > ec);\n return cnt >= 2;\n}\n\nconst int INF = 2e9;\n\nsigned main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n\n int n, c; cin >> n >> c;\n int a, b, c1; cin >> a >> b >> c1;\n vector<int> ea(n), eb(n), ec(n);\n for (int i = 0; i < n; i++) cin >> ea[i] >> eb[i] >> ec[i];\n int sum = a + b + c1;\n for (int i = 0; i < MAXN; i++) {\n for (int j = 0; j < MAXN; j++) {\n for (int k = 0; k < MAXS; k++) {\n for (int s = 0; s < MAXS; s++) {\n dp[i][j][k][s] = INF;\n }\n }\n }\n }\n dp[0][0][a][b] = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (ca + 1 < MAXS) {\n if (cb > 0) {\n dp[i][j][ca + 1][cb - 1] = min(dp[i][j][ca + 1][cb - 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca + 1][cb] = min(dp[i][j][ca + 1][cb], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int cb = 0; cb < MAXS; cb++) {\n for (int ca = 0; ca < MAXS; ca++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cb + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb + 1] = min(dp[i][j][ca - 1][cb + 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca][cb + 1] = min(dp[i][j][ca][cb + 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int cs = 0; cs < MAXS; cs++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int ca = sum - cs - cb;\n if (ca < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cs + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb] = min(dp[i][j][ca - 1][cb], dp[i][j][ca][cb] + 1);\n }\n if (cb > 0) {\n dp[i][j][ca][cb - 1] = min(dp[i][j][ca][cb - 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (check(ca, cb, cs, ea[i], eb[i], ec[i])) {\n dp[i + 1][j + 1][ca][cb] = min(dp[i + 1][j + 1][ca][cb], dp[i][j][ca][cb]);\n }\n else {\n dp[i + 1][j][ca][cb] = min(dp[i + 1][j][ca][cb], dp[i][j][ca][cb]);\n }\n }\n }\n }\n }\n int ans = 0;\n for (int i = 0; i <= n; i++) {\n for (int j = 0; j <= n; j++) {\n for (int a = 0; a < MAXS; a++) {\n for (int b = 0; b < MAXS; b++) {\n if (dp[i][j][a][b] <= c && dp[i][j][a][b] != 0) {\n ans = max(ans, j);\n if (j == 3) {\n int h = 0;\n }\n }\n }\n }\n }\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 160, "memory_kb": 133740, "score_of_the_acc": -0.9741, "final_rank": 6 }, { "submission_id": "aoj_0476_10223017", "code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\n#define int long long\n\nconst int MAXN = 55, MAXS = 105;\n\nsigned dp[MAXN][MAXN][MAXS][MAXS];\n\nbool check(int a, int b, int c, int ea, int eb, int ec) {\n int cnt = (a > ea) + (b > eb) + (c > ec);\n return cnt >= 2;\n}\n\nconst int INF = 2e9;\n\nsigned main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n\n int n, c; cin >> n >> c;\n int a, b, c1; cin >> a >> b >> c1;\n vector<int> ea(n), eb(n), ec(n);\n for (int i = 0; i < n; i++) cin >> ea[i] >> eb[i] >> ec[i];\n int sum = a + b + c1;\n for (int i = 0; i < MAXN; i++) {\n for (int j = 0; j < MAXN; j++) {\n for (int k = 0; k < MAXS; k++) {\n for (int s = 0; s < MAXS; s++) {\n dp[i][j][k][s] = INF;\n }\n }\n }\n }\n dp[0][0][a][b] = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n for (int h = 0; h < 20; h++) {\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (ca + 1 < MAXS) {\n if (cb > 0) {\n dp[i][j][ca + 1][cb - 1] = min(dp[i][j][ca + 1][cb - 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca + 1][cb] = min(dp[i][j][ca + 1][cb], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cb + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb + 1] = min(dp[i][j][ca - 1][cb + 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca][cb + 1] = min(dp[i][j][ca][cb + 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cs + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb] = min(dp[i][j][ca - 1][cb], dp[i][j][ca][cb] + 1);\n }\n if (cb > 0) {\n dp[i][j][ca][cb - 1] = min(dp[i][j][ca][cb - 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (check(ca, cb, cs, ea[i], eb[i], ec[i])) {\n dp[i + 1][j + 1][ca][cb] = min(dp[i + 1][j + 1][ca][cb], dp[i][j][ca][cb]);\n }\n else {\n dp[i + 1][j][ca][cb] = min(dp[i + 1][j][ca][cb], dp[i][j][ca][cb]);\n }\n }\n }\n }\n }\n }\n int ans = 0;\n for (int i = 0; i <= n; i++) {\n for (int j = 0; j <= n; j++) {\n for (int a = 0; a < MAXS; a++) {\n for (int b = 0; b < MAXS; b++) {\n if (dp[i][j][a][b] <= c && dp[i][j][a][b] != 0) {\n ans = max(ans, j);\n if (j == 3) {\n int h = 0;\n }\n }\n }\n }\n }\n }\n cout << ans << endl;\n}", "accuracy": 0.7333333333333333, "time_ms": 1330, "memory_kb": 133740, "score_of_the_acc": -1.8098, "final_rank": 12 }, { "submission_id": "aoj_0476_10223016", "code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\n#define int long long\n\nconst int MAXN = 55, MAXS = 105;\n\nsigned dp[MAXN][MAXN][MAXS][MAXS];\n\nbool check(int a, int b, int c, int ea, int eb, int ec) {\n int cnt = (a > ea) + (b > eb) + (c > ec);\n return cnt >= 2;\n}\n\nconst int INF = 2e9;\n\nsigned main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n\n int n, c; cin >> n >> c;\n int a, b, c1; cin >> a >> b >> c1;\n vector<int> ea(n), eb(n), ec(n);\n for (int i = 0; i < n; i++) cin >> ea[i] >> eb[i] >> ec[i];\n int sum = a + b + c1;\n for (int i = 0; i < MAXN; i++) {\n for (int j = 0; j < MAXN; j++) {\n for (int k = 0; k < MAXS; k++) {\n for (int s = 0; s < MAXS; s++) {\n dp[i][j][k][s] = INF;\n }\n }\n }\n }\n dp[0][0][a][b] = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n for (int h = 0; h < 10; h++) {\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (ca + 1 < MAXS) {\n if (cb > 0) {\n dp[i][j][ca + 1][cb - 1] = min(dp[i][j][ca + 1][cb - 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca + 1][cb] = min(dp[i][j][ca + 1][cb], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cb + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb + 1] = min(dp[i][j][ca - 1][cb + 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca][cb + 1] = min(dp[i][j][ca][cb + 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cs + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb] = min(dp[i][j][ca - 1][cb], dp[i][j][ca][cb] + 1);\n }\n if (cb > 0) {\n dp[i][j][ca][cb - 1] = min(dp[i][j][ca][cb - 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (check(ca, cb, cs, ea[i], eb[i], ec[i])) {\n dp[i + 1][j + 1][ca][cb] = min(dp[i + 1][j + 1][ca][cb], dp[i][j][ca][cb]);\n }\n else {\n dp[i + 1][j][ca][cb] = min(dp[i + 1][j][ca][cb], dp[i][j][ca][cb]);\n }\n }\n }\n }\n }\n }\n int ans = 0;\n for (int i = 0; i <= n; i++) {\n for (int j = 0; j <= n; j++) {\n for (int a = 0; a < MAXS; a++) {\n for (int b = 0; b < MAXS; b++) {\n if (dp[i][j][a][b] <= c && dp[i][j][a][b] != 0) {\n ans = max(ans, j);\n if (j == 3) {\n int h = 0;\n }\n }\n }\n }\n }\n }\n cout << ans << endl;\n}", "accuracy": 0.7111111111111111, "time_ms": 580, "memory_kb": 133744, "score_of_the_acc": -1.2741, "final_rank": 13 }, { "submission_id": "aoj_0476_10223012", "code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\n#define int long long\n\nconst int MAXN = 55, MAXS = 105;\n\nsigned dp[MAXN][MAXN][MAXS][MAXS];\n\nbool check(int a, int b, int c, int ea, int eb, int ec) {\n int cnt = (a > ea) + (b > eb) + (c > ec);\n return cnt >= 2;\n}\n\nconst int INF = 2e9;\n\nsigned main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n\n int n, c; cin >> n >> c;\n int a, b, c1; cin >> a >> b >> c1;\n vector<int> ea(n), eb(n), ec(n);\n for (int i = 0; i < n; i++) cin >> ea[i] >> eb[i] >> ec[i];\n int sum = a + b + c1;\n for (int i = 0; i < MAXN; i++) {\n for (int j = 0; j < MAXN; j++) {\n for (int k = 0; k < MAXS; k++) {\n for (int s = 0; s < MAXS; s++) {\n dp[i][j][k][s] = INF;\n }\n }\n }\n }\n dp[0][0][a][b] = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (ca + 1 < MAXS) {\n if (cb > 0) {\n dp[i][j][ca + 1][cb - 1] = min(dp[i][j][ca + 1][cb - 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca + 1][cb] = min(dp[i][j][ca + 1][cb], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = MAXS - 1; ca >= 0; ca--) {\n for (int cb = MAXS - 1; cb >= 0; cb--) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (ca + 1 < MAXS) {\n if (cb > 0) {\n dp[i][j][ca + 1][cb - 1] = min(dp[i][j][ca + 1][cb - 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca + 1][cb] = min(dp[i][j][ca + 1][cb], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cb + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb + 1] = min(dp[i][j][ca - 1][cb + 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca][cb + 1] = min(dp[i][j][ca][cb + 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = MAXS - 1; ca >= 0; ca--) {\n for (int cb = MAXS - 1; cb >= 0; cb--) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cb + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb + 1] = min(dp[i][j][ca - 1][cb + 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca][cb + 1] = min(dp[i][j][ca][cb + 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cs + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb] = min(dp[i][j][ca - 1][cb], dp[i][j][ca][cb] + 1);\n }\n if (cb > 0) {\n dp[i][j][ca][cb - 1] = min(dp[i][j][ca][cb - 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = MAXS - 1; ca >= 0; ca--) {\n for (int cb = MAXS - 1; cb >= 0; cb--) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cs + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb] = min(dp[i][j][ca - 1][cb], dp[i][j][ca][cb] + 1);\n }\n if (cb > 0) {\n dp[i][j][ca][cb - 1] = min(dp[i][j][ca][cb - 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (check(ca, cb, cs, ea[i], eb[i], ec[i])) {\n dp[i + 1][j + 1][ca][cb] = min(dp[i + 1][j + 1][ca][cb], dp[i][j][ca][cb]);\n }\n else {\n dp[i + 1][j][ca][cb] = min(dp[i + 1][j][ca][cb], dp[i][j][ca][cb]);\n }\n }\n }\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (ca + 1 < MAXS) {\n if (cb > 0) {\n dp[i][j][ca + 1][cb - 1] = min(dp[i][j][ca + 1][cb - 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca + 1][cb] = min(dp[i][j][ca + 1][cb], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = MAXS - 1; ca >= 0; ca--) {\n for (int cb = MAXS - 1; cb >= 0; cb--) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (ca + 1 < MAXS) {\n if (cb > 0) {\n dp[i][j][ca + 1][cb - 1] = min(dp[i][j][ca + 1][cb - 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca + 1][cb] = min(dp[i][j][ca + 1][cb], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cb + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb + 1] = min(dp[i][j][ca - 1][cb + 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca][cb + 1] = min(dp[i][j][ca][cb + 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = MAXS - 1; ca >= 0; ca--) {\n for (int cb = MAXS - 1; cb >= 0; cb--) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cb + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb + 1] = min(dp[i][j][ca - 1][cb + 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca][cb + 1] = min(dp[i][j][ca][cb + 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cs + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb] = min(dp[i][j][ca - 1][cb], dp[i][j][ca][cb] + 1);\n }\n if (cb > 0) {\n dp[i][j][ca][cb - 1] = min(dp[i][j][ca][cb - 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = MAXS - 1; ca >= 0; ca--) {\n for (int cb = MAXS - 1; cb >= 0; cb--) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cs + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb] = min(dp[i][j][ca - 1][cb], dp[i][j][ca][cb] + 1);\n }\n if (cb > 0) {\n dp[i][j][ca][cb - 1] = min(dp[i][j][ca][cb - 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (check(ca, cb, cs, ea[i], eb[i], ec[i])) {\n dp[i + 1][j + 1][ca][cb] = min(dp[i + 1][j + 1][ca][cb], dp[i][j][ca][cb]);\n }\n else {\n dp[i + 1][j][ca][cb] = min(dp[i + 1][j][ca][cb], dp[i][j][ca][cb]);\n }\n }\n }\n }\n }\n int ans = 0;\n for (int i = 0; i <= n; i++) {\n for (int j = 0; j <= n; j++) {\n for (int a = 0; a < MAXS; a++) {\n for (int b = 0; b < MAXS; b++) {\n if (dp[i][j][a][b] <= c && dp[i][j][a][b] != 0) {\n ans = max(ans, j);\n if (j == 3) {\n int h = 0;\n }\n }\n }\n }\n }\n }\n cout << ans << endl;\n}", "accuracy": 0.3111111111111111, "time_ms": 10, "memory_kb": 133740, "score_of_the_acc": -0.8669, "final_rank": 18 }, { "submission_id": "aoj_0476_10223008", "code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\n#define int long long\n\nconst int MAXN = 55, MAXS = 105;\n\nsigned dp[MAXN][MAXN][MAXS][MAXS];\n\nbool check(int a, int b, int c, int ea, int eb, int ec) {\n int cnt = (a > ea) + (b > eb) + (c > ec);\n return cnt >= 2;\n}\n\nconst int INF = 2e9;\n\nsigned main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n\n int n, c; cin >> n >> c;\n int a, b, c1; cin >> a >> b >> c1;\n vector<int> ea(n), eb(n), ec(n);\n for (int i = 0; i < n; i++) cin >> ea[i] >> eb[i] >> ec[i];\n int sum = a + b + c1;\n for (int i = 0; i < MAXN; i++) {\n for (int j = 0; j < MAXN; j++) {\n for (int k = 0; k < MAXS; k++) {\n for (int s = 0; s < MAXS; s++) {\n dp[i][j][k][s] = INF;\n }\n }\n }\n }\n dp[0][0][a][b] = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (ca + 1 < MAXS) {\n if (cb > 0) {\n dp[i][j][ca + 1][cb - 1] = min(dp[i][j][ca + 1][cb - 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca + 1][cb] = min(dp[i][j][ca + 1][cb], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = MAXS - 1; ca >= 0; ca--) {\n for (int cb = MAXS - 1; cb >= 0; cb--) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (ca + 1 < MAXS) {\n if (cb > 0) {\n dp[i][j][ca + 1][cb - 1] = min(dp[i][j][ca + 1][cb - 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca + 1][cb] = min(dp[i][j][ca + 1][cb], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cb + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb + 1] = min(dp[i][j][ca - 1][cb + 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca][cb + 1] = min(dp[i][j][ca][cb + 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = MAXS - 1; ca >= 0; ca--) {\n for (int cb = MAXS - 1; cb >= 0; cb--) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cb + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb + 1] = min(dp[i][j][ca - 1][cb + 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca][cb + 1] = min(dp[i][j][ca][cb + 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cs + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb] = min(dp[i][j][ca - 1][cb], dp[i][j][ca][cb] + 1);\n }\n if (cb > 0) {\n dp[i][j][ca][cb - 1] = min(dp[i][j][ca][cb - 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = MAXS - 1; ca >= 0; ca--) {\n for (int cb = MAXS - 1; cb >= 0; cb--) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cs + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb] = min(dp[i][j][ca - 1][cb], dp[i][j][ca][cb] + 1);\n }\n if (cb > 0) {\n dp[i][j][ca][cb - 1] = min(dp[i][j][ca][cb - 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (check(ca, cb, cs, ea[i], eb[i], ec[i])) {\n dp[i + 1][j + 1][ca][cb] = min(dp[i + 1][j + 1][ca][cb], dp[i][j][ca][cb]);\n }\n else {\n dp[i + 1][j][ca][cb] = min(dp[i + 1][j][ca][cb], dp[i][j][ca][cb]);\n }\n }\n }\n }\n }\n int ans = 0;\n for (int i = 0; i <= n; i++) {\n for (int j = 0; j <= n; j++) {\n for (int a = 0; a < MAXS; a++) {\n for (int b = 0; b < MAXS; b++) {\n if (dp[i][j][a][b] <= c && dp[i][j][a][b] != 0) {\n ans = max(ans, j);\n if (j == 3) {\n int h = 0;\n }\n }\n }\n }\n }\n }\n cout << ans << endl;\n}", "accuracy": 0.17777777777777778, "time_ms": 20, "memory_kb": 133744, "score_of_the_acc": -0.8741, "final_rank": 19 }, { "submission_id": "aoj_0476_10223003", "code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\n#define int long long\n\nconst int MAXN = 55, MAXS = 105;\n\nsigned dp[MAXN][MAXN][MAXS][MAXS];\n\nbool check(int a, int b, int c, int ea, int eb, int ec) {\n int cnt = (a > ea) + (b > eb) + (c > ec);\n return cnt >= 2;\n}\n\nconst int INF = 3e18;\n\nsigned main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n\n int n, c; cin >> n >> c;\n int a, b, c1; cin >> a >> b >> c1;\n vector<int> ea(n), eb(n), ec(n);\n for (int i = 0; i < n; i++) cin >> ea[i] >> eb[i] >> ec[i];\n int sum = a + b + c1;\n for (int i = 0; i < MAXN; i++) {\n for (int j = 0; j < MAXN; j++) {\n for (int k = 0; k < MAXS; k++) {\n for (int s = 0; s < MAXS; s++) {\n dp[i][j][k][s] = INF;\n }\n }\n }\n }\n dp[0][0][a][b] = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (ca + 1 < MAXS) {\n if (cb > 0) {\n dp[i][j][ca + 1][cb - 1] = min(dp[i][j][ca + 1][cb - 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca + 1][cb] = min(dp[i][j][ca + 1][cb], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = MAXS - 1; ca >= 0; ca--) {\n for (int cb = MAXS - 1; cb >= 0; cb--) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (ca + 1 < MAXS) {\n if (cb > 0) {\n dp[i][j][ca + 1][cb - 1] = min(dp[i][j][ca + 1][cb - 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca + 1][cb] = min(dp[i][j][ca + 1][cb], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cb + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb + 1] = min(dp[i][j][ca - 1][cb + 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca][cb + 1] = min(dp[i][j][ca][cb + 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = MAXS - 1; ca >= 0; ca--) {\n for (int cb = MAXS - 1; cb >= 0; cb--) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cb + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb + 1] = min(dp[i][j][ca - 1][cb + 1], dp[i][j][ca][cb] + 1);\n }\n if (cs > 0) {\n dp[i][j][ca][cb + 1] = min(dp[i][j][ca][cb + 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cs + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb] = min(dp[i][j][ca - 1][cb], dp[i][j][ca][cb] + 1);\n }\n if (cb > 0) {\n dp[i][j][ca][cb - 1] = min(dp[i][j][ca][cb - 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = MAXS - 1; ca >= 0; ca--) {\n for (int cb = MAXS - 1; cb >= 0; cb--) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (cs + 1 < MAXS) {\n if (ca > 0) {\n dp[i][j][ca - 1][cb] = min(dp[i][j][ca - 1][cb], dp[i][j][ca][cb] + 1);\n }\n if (cb > 0) {\n dp[i][j][ca][cb - 1] = min(dp[i][j][ca][cb - 1], dp[i][j][ca][cb] + 1);\n }\n }\n }\n }\n for (int ca = 0; ca < MAXS; ca++) {\n for (int cb = 0; cb < MAXS; cb++) {\n int cs = sum - ca - cb;\n if (cs < 0) break;\n if (dp[i][j][ca][cb] == INF) continue;\n if (check(ca, cb, cs, ea[i], eb[i], ec[i])) {\n dp[i + 1][j + 1][ca][cb] = min(dp[i + 1][j + 1][ca][cb], dp[i][j][ca][cb]);\n }\n else {\n dp[i + 1][j][ca][cb] = min(dp[i + 1][j][ca][cb], dp[i][j][ca][cb]);\n }\n }\n }\n }\n }\n int ans = 0;\n for (int i = 0; i <= n; i++) {\n for (int j = 0; j <= n; j++) {\n for (int a = 0; a < MAXS; a++) {\n for (int b = 0; b < MAXS; b++) {\n if (dp[i][j][a][b] <= c && dp[i][j][a][b] != 0) ans = max(ans, j);\n }\n }\n }\n }\n cout << ans << endl;\n}", "accuracy": 0.022222222222222223, "time_ms": 10, "memory_kb": 133632, "score_of_the_acc": -0.8662, "final_rank": 20 }, { "submission_id": "aoj_0476_9804291", "code_snippet": "//#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll inf = 999999999999999999LL;\n#define double long double\nusing vl = vector<ll>;\nusing vvl = vector<vl>;\nusing vvvl = vector<vvl>;\nstruct po{\n double x, y;\n};\nbool f(po &a, po &b, po &c, po &d) {\n\tdouble s, t;\n\ts = (a.x - b.x) * (c.y - a.y) - (a.y - b.y) * (c.x - a.x);\n\tt = (a.x - b.x) * (d.y - a.y) - (a.y - b.y) * (d.x - a.x);\n\tif (s * t > 0)\n\t\treturn false;\n\ts = (c.x - d.x) * (a.y - c.y) - (c.y - d.y) * (a.x - c.x);\n\tt = (c.x - d.x) * (b.y - c.y) - (c.y - d.y) * (b.x - c.x);\n\tif (s * t > 0)\n\t\treturn false;\n\treturn true;\n}\ntemplate <typename T>\nbool chmax(T &a, const T& b){\n if(a < b){\n a = b;\n return true;\n }\n return false;\n}\ntemplate <typename T>\nbool chmin(T &a, const T& b){\n if(a > b){\n a = b;\n return true;\n }\n return false;\n}\nbool ch(int a, int b, int c){\n if(a < 0)return false;\n if(b < 0)return false;\n if(c < 0)return false;\n if(a > 101)return false;\n if(b > 101)return false;\n if(c > 101)return false;\n return true;\n}\nint main(){\n ll N, C;\n cin >> N >> C;\n int a, b, c;\n cin >> a >> b >> c;\n int p = a + b + c;\n vvl X(N, vl(3));\n for(int i = 0;i < N;i++){\n for(int j = 0;j < 3;j++){\n cin >> X[i][j];\n }\n }\n deque<vector<int>> D;\n D.push_back({0, 0, a, b});\n vector<vector<vector<vector<int>>>> G(N + 1, vector<vector<vector<int>>>(N + 1, vector<vector<int>>(102, vector<int>(102, C + 1))));\n G[0][0][a][b] = 0;\n vector<pair<int, int>> d = {\n {1, -1}, {1, 0}, {0, 1}, {0, -1}, {-1, 1}, {-1, 0}\n };\n while(!D.empty()){\n vector<int> s = D.front();\n D.pop_front();\n if(s[0] == N)continue;\n int cnt = 0;\n if(s[2] > X[s[0]][0])cnt++;\n if(s[3] > X[s[0]][1])cnt++;\n if(p - s[2] - s[3] > X[s[0]][2])cnt++;\n if(cnt >= 2){\n if(chmin(G[s[0] + 1][s[1] + 1][s[2]][s[3]], G[s[0]][s[1]][s[2]][s[3]])){\n D.push_front({s[0] + 1, s[1] + 1, s[2], s[3]});\n }\n }\n else{\n if(chmin(G[s[0] + 1][s[1]][s[2]][s[3]], G[s[0]][s[1]][s[2]][s[3]])){\n D.push_front({s[0] + 1, s[1], s[2], s[3]});\n }\n }\n for(int i = 0;i < 6;i++){\n int e, f;\n e = s[2] + d[i].first;\n f = s[3] + d[i].second;\n if(ch(e, f, p - e - f)){\n if(chmin(G[s[0]][s[1]][e][f], G[s[0]][s[1]][s[2]][s[3]] + 1)){\n D.push_back({s[0], s[1], e, f});\n }\n }\n }\n }\n int ans = 0;\n for(int i = 0;i < N + 1;i++){\n for(int j = 0;j < N + 1;j++){\n for(int k = 0;k < 102;k++){\n for(int l = 0;l < 102;l++){\n if(G[i][j][k][l] <= C){\n chmax(ans, j);\n }\n }\n }\n }\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 750, "memory_kb": 127528, "score_of_the_acc": -1.354, "final_rank": 8 }, { "submission_id": "aoj_0476_9498296", "code_snippet": "#include <bits/stdc++.h>\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n// MLきついよ〜〜〜〜〜〜〜〜〜\n// TLもきついよ〜〜〜〜〜〜〜〜〜\n\nstd::vector<std::vector<short>> dist[51][51];\nconst short INF{10000};\nshort A[50], S[50], W[50];\n\nint main() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n short N, C;\n std::cin >> N >> C;\n short a, s, w;\n std::cin >> a >> s >> w;\n for (int i{} ; i < N ; i++) {\n std::cin >> A[i] >> S[i] >> W[i];\n }\n for (int i{} ; i <= N ; i++) for (int j{} ; j <= i ; j++) \n dist[i][j] = std::vector(a + s + w + 1, std::vector<short>{});\n for (int p{} ; p <= a + s + w ; p++) {\n int cnt{};\n for (int q{} ; (a + s + w) - (p + q) >= 0 ; q++) {\n cnt++;\n }\n for (int i{} ; i <= N ; i++) {\n for (int j{} ; j <= i ; j++) {\n dist[i][j][p] = std::vector<short>(cnt, INF);\n }\n }\n }\n using T = std::tuple<short, short, short, short>;\n std::deque<T> deq;\n dist[0][0][a][s] = 0;\n deq.emplace_back(0, 0, a, s);\n auto update{[&](short i, short j, short p, short q, short d, bool add) -> void {\n if (i > N) return;\n assert(j <= i);\n assert((a + s + w) - (p + q) >= 0);\n if (dist[i][j][p][q] > d + add) {\n dist[i][j][p][q] = d + add;\n if (add) deq.emplace_back(i, j, p, q);\n else deq.emplace_front(i, j, p, q);\n }\n }};\n while (deq.size()) {\n auto [i, j, p, q]{deq.front()};\n deq.pop_front();\n short r{static_cast<short>((a + s + w) - (p + q))};\n assert(r >= 0);\n short d{dist[i][j][p][q]};\n if (d > C) continue;\n int cnt{(p > A[i]) + (q > S[i]) + (r > W[i])};\n if (cnt >= 2) update(i + 1, j + 1, p, q, d, 0);\n else {\n update(i + 1, j, p, q, d, 0);\n if (p >= 1) {\n update(i, j, p - 1, q + 1, d, 1);\n update(i, j, p - 1, q, d, 1);\n }\n if (q >= 1) {\n update(i, j, p + 1, q - 1, d, 1);\n update(i, j, p, q - 1, d, 1);\n }\n if (r >= 1) {\n update(i, j, p + 1, q, d, 1);\n update(i, j, p, q + 1, d, 1);\n }\n }\n }\n int ans{};\n for (int i{N} ; ans < i and i >= 0 ; i--) {\n for (int j{} ; ans < i and j < (int)dist[N][i].size() ; j++) {\n for (int k{} ; ans < i and k < (int)dist[N][i][j].size() ; k++) {\n if (dist[N][i][j][k] <= C) {\n ans = i;\n }\n }\n }\n }\n std::cout << ans << '\\n';\n std::cout.flush();\n std::quick_exit(0);\n}", "accuracy": 1, "time_ms": 510, "memory_kb": 136576, "score_of_the_acc": -1.243, "final_rank": 7 }, { "submission_id": "aoj_0476_8808787", "code_snippet": "#include <bits/stdc++.h>\n\nint main() {\n constexpr int N = 3;\n constexpr int MAX = 102;\n constexpr int INF = 1e9;\n using Table = std::array<int, N>;\n int n;\n int coin;\n std::cin >> n >> coin;\n Table init;\n for (int i = 0; i < N; i++) std::cin >> init[i];\n const int sum = init[0] + init[1] + init[2];\n auto get_c = [&](int a, int b) {\n return sum - a - b;\n };\n\n // Does lhs win rhs?\n auto win = [&](Table lhs, Table rhs) {\n int count = 0;\n for (int i = 0; i < N; i++) {\n if (lhs[i] > rhs[i]) count++;\n }\n return count >= 2;\n };\n\n auto always_lose = [&](Table table) {\n std::sort(table.begin(), table.end());\n return table[0] + table[1] + 2 > sum;\n };\n\n auto valid = [&](Table table) {\n for (int i = 0; i < N; i++) {\n if (table[i] < 0) return false;\n }\n return true;\n };\n\n // dp[a][b][win] = min coin\n std::vector dp(MAX, std::vector(MAX, std::vector<int>(n + 1, INF)));\n dp[init[0]][init[1]][0] = 0;\n for (int i = 0; i < n; i++) {\n Table enemy;\n for (int j = 0; j < N; j++) std::cin >> enemy[j];\n if (always_lose(enemy)) continue;\n for (int j = i; j >= 0; j--) {\n Table self;\n for (int a = 0; a < MAX; a++) {\n self[0] = a;\n for (int b = 0; b < MAX; b++) {\n self[1] = b;\n if (dp[a][b][j] > coin) continue;\n self[2] = get_c(a, b);\n if (!valid(self)) continue;\n if (win(self, enemy)) {\n dp[a][b][j + 1] = std::min(dp[a][b][j + 1], dp[a][b][j]);\n continue;\n }\n for (int k = 0; k < N; k++) {\n Table next = self;\n int diff = 0;\n for (int l = 0; l < N; l++) {\n if (k != l && self[l] <= enemy[l]) {\n next[l] = enemy[l] + 1;\n diff += enemy[l] + 1 - self[l];\n }\n }\n next[k] -= diff;\n if (valid(next)) {\n assert(win(next, enemy));\n dp[next[0]][next[1]][j + 1] = std::min(dp[next[0]][next[1]][j + 1], dp[a][b][j] + diff);\n } \n int min_i = k;\n int max_i = -1;\n for (int l = 0; l < N; l++) {\n if (k != l && next[l] > enemy[l] + 1) {\n max_i = l;\n break;\n }\n }\n if (max_i == -1) continue;\n while (next[max_i] > enemy[max_i] && self[min_i] >= next[min_i]) {\n if (valid(next)) {\n assert(win(next, enemy));\n dp[next[0]][next[1]][j + 1] = std::min(dp[next[0]][next[1]][j + 1], dp[a][b][j] + diff);\n }\n next[max_i]--;\n next[min_i]++;\n }\n }\n }\n }\n }\n }\n int ans = 0;\n for (int a = 0; a < MAX; a++) {\n for (int b = 0; b < MAX; b++) {\n for (int i = 0; i <= n; i++) {\n if (dp[a][b][i] <= coin) ans = std::max(ans, i);\n }\n }\n }\n std::cout << ans << std::endl;\n}", "accuracy": 1, "time_ms": 270, "memory_kb": 5744, "score_of_the_acc": -0.1969, "final_rank": 2 }, { "submission_id": "aoj_0476_8808731", "code_snippet": "#include <bits/stdc++.h>\n\nint main() {\n constexpr int N = 3;\n constexpr int MAX = 102;\n constexpr int INF = 1e9;\n using Table = std::array<int, N>;\n int n;\n int coin;\n std::cin >> n >> coin;\n Table init;\n for (int i = 0; i < N; i++) std::cin >> init[i];\n const int sum = init[0] + init[1] + init[2];\n auto get_c = [&](int a, int b) {\n return sum - a - b;\n };\n\n // Does lhs win rhs?\n auto win = [&](Table lhs, Table rhs) {\n int count = 0;\n for (int i = 0; i < N; i++) {\n if (lhs[i] > rhs[i]) count++;\n }\n return count >= 2;\n };\n\n auto always_lose = [&](Table table) {\n std::sort(table.begin(), table.end());\n return table[0] + table[1] + 2 > sum;\n };\n\n auto valid = [&](Table table) {\n for (int i = 0; i < N; i++) {\n if (table[i] < 0) return false;\n }\n return true;\n };\n\n // dp[a][b][win] = min coin\n std::vector dp(MAX, std::vector(MAX, std::vector<int>(n + 1, INF)));\n dp[init[0]][init[1]][0] = 0;\n for (int i = 0; i < n; i++) {\n Table enemy;\n for (int j = 0; j < N; j++) std::cin >> enemy[j];\n if (always_lose(enemy)) continue;\n for (int j = i; j >= 0; j--) {\n Table self;\n for (int a = 0; a < MAX; a++) {\n self[0] = a;\n for (int b = 0; b < MAX; b++) {\n self[1] = b;\n if (dp[a][b][j] > coin) continue;\n self[2] = get_c(a, b);\n if (!valid(self)) continue;\n if (win(self, enemy)) {\n dp[a][b][j + 1] = std::min(dp[a][b][j + 1], dp[a][b][j]);\n continue;\n }\n for (int k = 0; k < N; k++) {\n Table next = self;\n int diff = 0;\n for (int l = 0; l < N; l++) {\n if (k != l && self[l] <= enemy[l]) {\n next[l] = enemy[l] + 1;\n diff += enemy[l] + 1 - self[l];\n }\n }\n next[k] -= diff;\n if (valid(next)) {\n assert(win(next, enemy));\n dp[next[0]][next[1]][j + 1] = std::min(dp[next[0]][next[1]][j + 1], dp[a][b][j] + diff);\n } else {\n int min_i = k;\n int max_i = -1;\n for (int l = 0; l < N; l++) {\n if (next[l] > enemy[l] + 1) {\n max_i = l;\n break;\n }\n }\n if (max_i == -1) continue;\n while (next[max_i] > enemy[max_i] && self[min_i] >= next[min_i]) {\n if (valid(next)) {\n assert(win(next, enemy));\n dp[next[0]][next[1]][j + 1] = std::min(dp[next[0]][next[1]][j + 1], dp[a][b][j] + diff);\n }\n next[max_i]--;\n next[min_i]++;\n }\n }\n }\n }\n }\n }\n }\n int ans = 0;\n for (int a = 0; a < MAX; a++) {\n for (int b = 0; b < MAX; b++) {\n for (int i = 0; i <= n; i++) {\n if (dp[a][b][i] <= coin) ans = std::max(ans, i);\n }\n }\n }\n std::cout << ans << std::endl;\n}", "accuracy": 0.4, "time_ms": 20, "memory_kb": 5720, "score_of_the_acc": -0.0182, "final_rank": 15 }, { "submission_id": "aoj_0476_8439906", "code_snippet": "#include<bits/stdc++.h>\n#define overload(a,b,c,d,...) d\n#define rep1(n) for(ll _=0;_<n;++_)\n#define rep2(i,n) for(ll i=0;i<n;++i)\n#define rep3(i,a,b) for(ll i=(ll)a;i<(ll)b;++i)\n#define rep(...) overload(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(i,n) for(ll i=(ll)n-1;i>=0;--i)\n#define rrep2(i,a,b) for(ll i=(ll)b-1;i>=(ll)a;--i)\n#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)\n#define all(x) (x).begin(),(x).end()\n#define rall(x) (x).rbegin(),(x).rend()\n#define eb emplace_back\n#define pb push_back\nusing namespace std;\nusing ll=long long;\nusing ld=long double;\nusing vl=vector<ll>;\ntemplate<typename T,typename U>inline bool chmin(T&a,const U&b){return (a>b?a=b,true:false);}\ntemplate<typename T,typename U>inline bool chmax(T&a,const U&b){return (a<b?a=b,true:false);}\nstatic constexpr ll inf=numeric_limits<ll>::max()/2;\n/*\nstruct Segtree2{\n\tll lg,n,size;\n\tvector<ll>data;\n\tvector<ll>lazy;\n\tvector<bool>lazy_flag;\n\tinline static ll op1(ll x,ll y){\n\t\tif(y)return -x;\n\t\treturn x;\n\t}\n\tinline static ll op2(ll x,ll y){\n\t\treturn x^y;\n\t}\n\tinline void update(ll k){\n\t\tdata[k]=data[k<<1]+data[k<<1|1];\n\t}\t\n\tvoid all_apply(ll k,ll x,ll sz){\n\t\tdata[k]=op1(data[k],x);\n\t\tif(k<size){\n\t\t\tif(lazy_flag[k])lazy[k]=op2(lazy[k],x);\n\t\t\telse lazy[k]=x,lazy_flag[k]=true;\n\t\t}\n\t}\n\tvoid eval(ll k,ll sz){\n\t\tif(lazy_flag[k]){\n\t\t\tall_apply(k<<1,lazy[k],sz>>1);\n\t\t\tall_apply(k<<1^1,lazy[k],sz>>1);\n\t\t\tlazy_flag[k]=false;\n\t\t}\n\t}\n\tpublic:\n\tSegtree2(const vector<ll>&x){\n\t\tn=x.size();\n\t\tlg=0;while((1<<lg)<n)lg++;\n\t\tsize=1<<lg;\n\t\tdata.resize(size<<1,0);\n\t\tlazy.resize(size);\n\t\tlazy_flag.assign(size,false);\n\t\trep(i,n)data[i+size]=x[i];\n\t\trrep(i,1,size)update(i);\n\t}\n\tvoid apply(ll l,ll r,ll x){\n\t\tif(l==r)return;\n\t\tl+=size,r+=size;\n\t\tll lst=lg+1;\n\t\trrep(i,1,lg+1){\n\t\t\tif(((l>>i)<<i)!=l)eval(l>>i,1<<i),lst=i;\n\t\t\tif(((r>>i)<<i)!=r)eval((r-1)>>i,1<<i),lst=i;\n\t\t\tif(lst!=i)break;\n\t\t}\n\t\tfor(ll l2=l,r2=r,sz=1;l2!=r2;l2>>=1,r2>>=1,sz<<=1){\n\t\t\tif(l2&1)all_apply(l2++,x,sz);\n\t\t\tif(r2&1)all_apply(--r2,x,sz);\n\t\t}\n\t\trep(i,lst,lg+1){\n\t\t\tif(((l>>i)<<i)!=l)update(l>>i);\n\t\t\tif(((r>>i)<<i)!=r)update((r-1)>>i);\n\t\t}\n\t}\n\tll prod(ll l,ll r){\n\t\tif(l==r)return 0;\n\t\tl+=size,r+=size;\n\t\trrep(i,1,lg+1){\n\t\t\tbool f=false;\n\t\t\tif(((l>>i)<<i)!=l)eval(l>>i,1<<i),f=true;\n\t\t\tif(((r>>i)<<i)!=r)eval((r-1)>>i,1<<i),f=true;\n\t\t\tif(!f)break;\n\t\t}\n\t\tll sum=0;\n\t\twhile(l!=r){\n\t\t\tif(l&1)sum+=data[l++];\n\t\t\tif(r&1)sum+=data[--r];\n\t\t\tl>>=1,r>>=1;\n\t\t}\n\t\treturn sum;\n\t}\n\tll operator[](ll k){\n\t\tk+=size;\n\t\trrep(i,1,lg+1)eval(k>>i,1<<i);\n\t\treturn data[k-size];\n\t}\n};*/\n/*\nstruct RollingHash{\n\tusing ull=unsigned long long;\n\tusing i128=__uint128_t;\n\tprivate:\n\tstatic constexpr ull MOD=(1ull<<61)-1;\n\tstatic constexpr ull MASK31=(1ull<<31)-1;\n\tstatic ull calc_mod(ull a){\n\t\tull ret=(a&MOD)+(a>>61);\n\t\tif(ret>=MOD)ret-=MOD;\n\t\treturn ret;\n\t}\n\tstatic ull calc_mul(ull a,ull b){\n\t\ti128 c=(i128)a*b;\n\t\treturn calc_add(c&MOD,c>>61);\n\t}\n\tstatic ull calc_add(ull a,ull b){\n\t\tull ret=a+b;\n\t\tif(ret>=MOD)ret-=MOD;\n\t\treturn ret;\n\t}\n\tull BASE;\n\tvoid init(){\n\t\tBASE=(1ull<<31)+(random_device()()&MASK31);\n\t}\n\tpublic:\n\tstruct Hash{\n\t\tprivate:\n\t\tint n;\n\t\tull BASE;\n\t\tvector<ull>inner_hash,power;\n\t\tpublic:\n\t\ttemplate<typename T>\n\t\tHash(ull base,const T&s):BASE(base){\n\t\t\tn=s.size();\n\t\t\tinner_hash.resize(n+1);\n\t\t\tfor(int i=0;i<n;++i)inner_hash[i+1]=calc_add(s[i],calc_mul(BASE,inner_hash[i]));\n\t\t\tpower.resize(n+1);power[0]=1;\n\t\t\tfor(int i=0;i<n;i++)power[i+1]=calc_mul(power[i],BASE);\n\t\t}\n\t\tull get_hash(int l,int r)const{\n\t\t\treturn calc_add(inner_hash[r],MOD-calc_mul(inner_hash[l],power[r-l]));\n\t\t}\n\t\tull get_all()const{\n\t\t\treturn inner_hash[n];\n\t\t}\n\t\tsize_t size()const{return n;}\n\t};\n\tRollingHash(){init();}\n\ttemplate<typename T>\n\tHash get_hash(const T&s)const{return Hash(BASE,s);}\n};*/\nint main(){\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tll n,c,a,s,w;\n\tcin>>n>>c>>a>>s>>w;\n\tconst ll sum=a+s+w;\n\tvector<vector<vl>>dp(n+1,vector<vl>(sum+1,vl(sum+1,inf)));\n\tdp[0][a][s]=0;\n\trep(i,n){\n\t\tll na,ns,nw;cin>>na>>ns>>nw;\n\t\trrep(j,i+1){\n\t\t\trep(k,sum+1){\n\t\t\t\trep(l,sum-k+1){\n\t\t\t\t \tif(sum-(k+l))chmin(dp[j][k+1][l],dp[j][k][l]+1),chmin(dp[j][k][l+1],dp[j][k][l]+1);\n\t\t\t\t\tif(l)chmin(dp[j][k+1][l-1],dp[j][k][l]+1);\n\t\t\t\t}\n\t\t\t}\n\t\t\trrep(k,sum+1)rrep(l,sum-k+1){\n\t\t\t\tif(k)chmin(dp[j][k-1][l+1],dp[j][k][l]+1),chmin(dp[j][k-1][l],dp[j][k][l]+1);\n\t\t\t\tif(l)chmin(dp[j][k][l-1],dp[j][k][l]+1);\n\t\t\t\tll m=sum-(k+l);\n\t\t\t\tll cnt=(k>na)+(l>ns)+(m>nw);\n\t\t\t\tif(cnt>=2)chmin(dp[j+1][k][l],dp[j][k][l]);\n\t\t\t}\n\t\t}\n\t}\n\trrep(i,n+1)rep(j,sum+1)rep(k,sum+1){\n\t\tif(dp[i][j][k]<=c){\n\t\t\tcout<<i<<endl;return 0;\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 250, "memory_kb": 40236, "score_of_the_acc": -0.4133, "final_rank": 3 } ]
aoj_0478_cpp
Tree Keyboard Dr. PCK has developed a revolutionary input device for computers, the Tree Keyboard. This keyboard has $N$ keys, each numbered $1$ to $N$, and they are wired with $N-1$ wires. You can also reach other keys by following some wires from any key. As a keyboard setting, each key can be assigned a single character, and these can be changed at will at any time. On this keyboard, when you press a key $s$ and then a key $t$, the characters of all the keys on the shortest path from key $s$ to key $t$ are entered once in sequence. At this time, if key $s$ and key $t$ are the same key, the character will be entered only once. Given the information about the Tree Keyboard, the keyboard setup operation, and the input operation, create a program to find the number of different character strings that have been input to the computer up to the point immediately after each input operation. Input The input is given in the following format. $N$ $k_1$ $k_2$ : $k_N$ $u_1$ $v_1$ $u_2$ $v_2$ : $u_{N-1}$ $v_{N-1}$ $Q$ $q_1$ $q_2$ : $q_Q$ In the first line, the number of keys $N$ ($1 \leq N \leq 100,000$) is given. In the following $N$ line, the first lowercase letter $k_i$ set for key $i$ is given. In the following $N-1$ line, the wire information is given. The $u_i$ and $v_i$ ($1 \leq u_i < v_i \leq N$) are the numbers of the keys that the $i$th wire connects to. In the following line, the number of operations $Q$ ($1 \leq Q \leq 100,000$) is given. In the succeeding $Q$ lines, each operation is given in the following form. 1 $s$ $t$ or 2 $k$ $c$ 1 $s$ $t$ represents the input operation of hitting key $s$ ($1 \leq s \leq N$) and key $t$ ($1 \leq t \leq N$) in sequence. 2 $k$ $c$ represents the setting operation to change the printed character of key $k$ ($1 \leq k \leq N$) to lowercase English $c$. Output After each input operation, output the number of different strings that have been entered into the computer up to that point, each on a single line. Sample Input and Output Sample Input 6 a b a c e b 1 2 2 3 2 4 2 5 5 6 4 1 1 6 1 3 4 2 5 c 1 1 5 Sample Output 1 2 2
[ { "submission_id": "aoj_0478_11031388", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate<typename S, S(*op)(S, S), S(*e)()>\nstruct segtree {\n\tint siz;\n\tvector<S> node;\n\t\n\tsegtree() = default;\n\tsegtree(int n){\n\t\tsiz = 1;\n\t\twhile(siz < n) siz *= 2;\n\t\tnode.assign(siz*2, e());\n\t}\n\tsegtree(const vector<S> &v) : segtree(v.size()) {\n\t\tfor(int i = 0; i < (int)v.size(); i++) node[i+siz] = v[i];\n\t\tfor(int i = siz-1; i >= 1; i--) node[i] = op(node[i*2], node[i*2+1]);\n\t}\n\t\n\tvoid set(int p, S x){\n\t\tp += siz;\n\t\tnode[p] = x;\n\t\twhile(p >>= 1) node[p] = op(node[p*2], node[p*2+1]);\n\t}\n\t\n\tS get(int p) {return node[p+siz];}\n\t\n\tS prod(int l, int r){\n\t\tl += siz; r += siz;\n\t\tS L = e(), R = e();\n\t\twhile(l < r){\n\t\t\tif(l&1) L = op(L, node[l++]);\n\t\t\tif(r&1) R = op(node[--r], R);\n\t\t\tl >>= 1; r >>= 1;\n\t\t}\n\t\treturn op(L, R);\n\t}\n};\n\ntemplate<typename S, S(*op)(S, S), S(*e)()>\nstruct HLD {\n using seg_t = segtree<S, op, e>;\n \n int n;\n vector<int> dep, in, out, head, par;\n vector<array<int, 2>> E;\n seg_t node[2];\n \n HLD(int _n) : n(_n), dep(n), in(n), out(n), head(n), par(n) {}\n \n void add_edge(int u, int v){\n E.push_back({u, v});\n }\n \n void build(const vector<S> &v){\n vector<vector<int>> G(n);\n for(auto i : E){\n G[i[0]].push_back(i[1]);\n G[i[1]].push_back(i[0]);\n }\n \n vector<int> sub_siz(n, 1);\n \n par[0] = -1;\n auto f1 = [&](auto self, int pos)->void {\n for(auto nex : G[pos]){\n if(nex == par[pos]) continue;\n par[nex] = pos;\n self(self, nex);\n sub_siz[pos] += sub_siz[nex];\n }\n }; f1(f1, 0);\n \n int cnt = 0;\n auto f2 = [&](auto self, int pos)->void {\n in[pos] = cnt++;\n if(sub_siz[pos] == 1){\n out[pos] = cnt;\n return;\n }\n int hv = -1;\n for(auto nex : G[pos]){\n if(nex == par[pos]) continue;\n if(hv == -1 || sub_siz[hv] < sub_siz[nex]) hv = nex;\n }\n dep[hv] = dep[pos];\n head[hv] = head[pos];\n self(self, hv);\n for(auto nex : G[pos]){\n if(nex == par[pos] || nex == hv) continue;\n dep[nex] = dep[pos]+1;\n head[nex] = nex;\n self(self, nex);\n }\n out[pos] = cnt;\n }; f2(f2, 0);\n \n vector<S> node_v(n);\n for(int i = 0; i < n; i++) node_v[in[i]] = v[i];\n \n node[0] = seg_t(node_v);\n reverse(node_v.begin(), node_v.end());\n node[1] = seg_t(node_v);\n }\n \n S prod(int l, int r){\n S l_ans = e(), r_ans = e();\n while(true){\n if(dep[l] >= dep[r] && head[l] != head[r]){\n l_ans = op(l_ans, node[1].prod(n-in[l]-1, n-in[head[l]]));\n l = par[head[l]];\n } else if(dep[l] < dep[r]){\n r_ans = op(node[0].prod(in[head[r]], in[r]+1), r_ans);\n r = par[head[r]];\n } else {\n if(in[l] <= in[r]) l_ans = op(l_ans, node[0].prod(in[l], in[r]+1));\n else r_ans = op(node[1].prod(n-in[l]-1, n-in[r]), r_ans);\n return op(l_ans, r_ans);\n }\n }\n }\n \n S prod(int r){\n return node[0].prod(in[r], out[r]);\n }\n \n S get(int p){\n return node[0].get(in[p]);\n }\n \n void set(int p, const S &x){\n node[0].set(in[p], x);\n node[1].set(n-in[p]-1, x);\n }\n \n};\n\n/*\n ー使い方ー\n S, op, eを決める\n コンストラクタ HLD hoge(int n) で頂点数指定\n add_edge(int u, int v) で無向辺追加\n その後，頂点の値vectorを引数に build(vector<S> v) を呼び出す\n \n set(int p, S x) で，頂点pの値をxに変える\n prod(int l, int r) でlからrのパスクエリ\n prod(int r) で部分木クエリ\n*/\n\nusing ll = long long;\nconstexpr ll mod = (1ll<<61) - 1;\nll mu(ll a, ll b) {\n\t__int128_t c = (__int128_t)a * b;\n\tc = (c&mod) + (c>>61);\n\treturn c < mod ? c : c-mod;\n}\n\nstruct S{\n\tll val;\n\tll po;\n};\nS op(S l, S r){\n\tll val = mu(l.val, r.po) + r.val;\n\tval = val < mod ? val : val - mod;\n\tll po = mu(l.po, r.po);\n\treturn {val, po};\n}\nS e(){return {0, 1};}\n\nint main(){\n\tint n;\n\tcin >> n;\n\tvector<S> A(n);\n\tfor(int i = 0; i < n; i++){\n\t\tchar c;\n\t\tcin >> c;\n\t\tA[i].val = c - 'a' + 1;\n\t\tA[i].po = 37;\n\t}\n\t\n\tHLD<S, op, e> seg(n);\n\tfor(int i = 0; i < n-1; i++){\n\t\tint u, v;\n\t\tcin >> u >> v;\n\t\tu--; v--;\n\t\tseg.add_edge(u, v);\n\t}\n\tseg.build(A);\n\t\n\tint q;\n\tcin >> q;\n\t\n\tunordered_set<ll> S;\n\twhile(q--){\n\t\tint t;\n\t\tcin >> t;\n\t\tif(t == 1){\n\t\t\tint s, t;\n\t\t\tcin >> s >> t;\n\t\t\ts--; t--;\n\t\t\tS.insert(seg.prod(s, t).val);\n\t\t\tcout << S.size() << '\\n';\n\t\t} else {\n\t\t\tint k; char c;\n\t\t\tcin >> k >> c;\n\t\t\tk--;\n\t\t\tc -= 'a' - 1;\n\t\t\tseg.set(k, {c, 37});\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 32540, "score_of_the_acc": -0.1476, "final_rank": 2 }, { "submission_id": "aoj_0478_11017100", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\nint bs = 27;\nint mod1 = 998244853, mod2 = 968244353;\nint I1[100100], I2[100100], I1_[100100], I2_[100100];\nint pw(int a, int p, int mod){\n int ans = 1, now = a;\n while(p){\n if(p&1) ans *= now;\n ans %= mod;\n now *= now;\n now %= mod;\n p >>= 1;\n }\n return ans;\n}\nint v(int a, int mod){\n return pw(a,mod-2,mod);\n}\nstruct SEG{\nprivate:\n int n;\n vector<int> node;\npublic:\n SEG(int N){\n n = 1;\n while(n < N) n *= 2;\n node.resize(2*n);\n }\n void update(int i, int x){\n i += n;\n node[i] = x;\n while(i > 1){\n i >>= 1;\n node[i] = node[2*i]+node[2*i+1];\n }\n return;\n }\n int f(int a, int b){\n int l = a+n, r = b+n;\n int ans = 0;\n while(l != r){\n if(l&1) ans += node[l++];\n if(r&1) ans += node[--r];\n l >>= 1;\n r >>= 1;\n }\n return ans;\n }\n};\nsigned main(){\n int N;\n cin>>N;\n for(int i=0;i<=N;i++){\n I1[i] = pw(bs,i,mod1);\n I2[i] = pw(bs,i,mod2);\n I1_[i] = v(I1[i],mod1);\n I2_[i] = v(I2[i],mod2);\n }\n vector<int> A(N);\n for(int i=0;i<N;i++){\n char c;\n cin>>c;\n A[i] = c-'a'+1;\n }\n vector<vector<int>> G(N);\n for(int i=0;i<N-1;i++){\n int a,b;\n cin>>a>>b;\n a--;\n b--;\n G[a].push_back(b);\n G[b].push_back(a);\n }\n vector<int> dist(N,1e18);\n {\n queue<int> q;\n q.push(0);\n dist[0] = 0;\n while(!q.empty()){\n int pos = q.front();\n q.pop();\n for(int x:G[pos])if(dist[x] > N){\n dist[x] = dist[pos] + 1;\n q.push(x);\n }\n }\n }\n int n = 18;\n vector<vector<int>> P(n,vector<int>(N,-1));\n for(int i=0;i<N;i++)for(int x:G[i])if(dist[x] < dist[i]) P[0][i] = x;\n for(int i=1;i<n;i++)for(int j=0;j<N;j++)if(P[i-1][j] != -1) P[i][j] = P[i-1][P[i-1][j]];\n auto lca = [&](int a, int b) -> int {\n if(dist[a] > dist[b]) swap(a,b);\n int k = dist[b]-dist[a];\n for(int i=0;i<n;i++)if(k&(1<<i)) b = P[i][b];\n if(a == b) return a;\n for(int i=n-1;i>=0;i--)if(P[i][a] != P[i][b]){\n a = P[i][a];\n b = P[i][b];\n }\n return P[0][a];\n };\n vector<int> in(N), out(N);\n {\n int now = 0;\n auto init_o = [&](auto &&self, int a, int p) -> void {\n in[a] = now;\n now++;\n for(auto x:G[a])if(x != p){\n self(self,x,a);\n }\n out[a] = now;\n now++;\n return;\n };\n init_o(init_o,0,-1);\n }\n SEG u1(2*N), u2(2*N), d1(2*N), d2(2*N);\n auto ud = [&](int p, int x) -> void {\n A[p] = x;\n u1.update(in[p],((A[p]*I1[N-1-dist[p]])%mod1));\n u1.update(out[p],-((A[p]*I1[N-1-dist[p]])%mod1));\n u2.update(in[p],((A[p]*I2[N-1-dist[p]])%mod2));\n u2.update(out[p],-((A[p]*I2[N-1-dist[p]])%mod2));\n d1.update(in[p],((A[p]*I1[dist[p]])%mod1));\n d1.update(out[p],-((A[p]*I1[dist[p]])%mod1));\n d2.update(in[p],((A[p]*I2[dist[p]])%mod2));\n d2.update(out[p],-((A[p]*I2[dist[p]])%mod2));\n return;\n };\n for(int i=0;i<N;i++) ud(i,A[i]);\n auto hs = [&](int s, int t) -> pair<int,int> {\n pair<int,int> ans;\n int l = lca(s,t);\n int d = dist[s]-dist[l];\n int a,b;\n a = u1.f(in[l],out[s]);\n a -= (A[l]*I1[N-1-dist[l]])%mod1;\n a %= mod1;\n a *= I1_[N-1-dist[s]];\n a %= mod1;\n b = d1.f(in[l],out[t]);\n b %= mod1;\n b *= I1_[dist[l]];\n b %= mod1;\n ans.first = (a+b*I1[d])%mod1+mod1;\n ans.first %= mod1;\n\n a = u2.f(in[l],out[s]);\n a -= (A[l]*I2[N-1-dist[l]])%mod2;\n a %= mod2;\n a *= I2_[N-1-dist[s]];\n a %= mod2;\n b = d2.f(in[l],out[t]);\n b %= mod2;\n b *= I2_[dist[l]];\n b %= mod2;\n ans.second = (a+b*I2[d])%mod2+mod2;\n ans.second %= mod2;\n\n return ans;\n };\n int Q;\n cin>>Q;\n set<pair<int,int>> st;\n while(Q--){\n int ty;\n cin>>ty;\n if(ty == 1){\n int a,b;\n cin>>a>>b;\n a--;\n b--;\n st.insert(hs(a,b));\n cout<<st.size()<<endl;\n }\n else{\n int k;\n char c;\n cin>>k>>c;\n int v = c-'a'+1;\n ud(k-1,v);\n }\n }\n}", "accuracy": 1, "time_ms": 390, "memory_kb": 57860, "score_of_the_acc": -0.7007, "final_rank": 16 }, { "submission_id": "aoj_0478_10783295", "code_snippet": "#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/0478\"\n\n\n\n#include <cstdint>\n#include <cstddef>\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n\n#include <iostream>\n#include <iomanip>\n\nnamespace zawa {\n\nvoid SetFastIO() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n}\n\nvoid SetPrecision(u32 dig) {\n std::cout << std::fixed << std::setprecision(dig);\n}\n\n} // namespace zawa\n\n\n\nnamespace zawa {\n\n// @reference: https://qiita.com/keymoon/items/11fac5627672a6d6a9f6\nclass Mersenne61ModInt {\npublic:\n using Value = u64;\nprivate:\n static constexpr Value MOD{(1ull << 61) - 1}; // == MASK61\n static constexpr Value MASK30{(1ull << 30) - 1};\n static constexpr Value MASK31{(1ull << 31) - 1};\n Value v_{};\npublic:\n constexpr Mersenne61ModInt() {}\n\n static constexpr Value Mod() noexcept {\n return MOD;\n }\n static constexpr Value Modulo(const Value& v) noexcept {\n Value res{(v >> 61) + (v & MOD)};\n res = (res >= MOD ? res - MOD : res);\n return res;\n }\n static constexpr Value UnsafeMul(const Value& a, const Value& b) noexcept {\n Value fa{a >> 31}, fb{b >> 31};\n Value ba{a & MASK31}, bb{b & MASK31};\n Value mid{fa * bb + fb * ba};\n return Value{2}*fa*fb + (mid >> 30) + ((mid & MASK30) << 31) + ba*bb;\n }\n static constexpr Value Mul(const Value& a, const Value& b) noexcept {\n return Modulo(UnsafeMul(a, b));\n }\n};\n\n};\n\n#include <random>\n#include <type_traits>\n\nnamespace zawa {\n\nstruct RollingHashMonoidData {\n using Value = Mersenne61ModInt::Value;\n using Size = usize;\n static Value base;\n Value hash{}, pow{1};\n usize len{};\n\n constexpr RollingHashMonoidData() = default;\n constexpr RollingHashMonoidData(Value h, Value p, usize l) : hash{h}, pow{p}, len{l} {}\n template <class T>\n constexpr RollingHashMonoidData(const T& v) \n : hash{static_cast<Value>(v)}, pow{base}, len{1} {}\n // RollingHashMonoidData(const RollingHashMonoidData& data)\n // : hash{data.hash}, pow{data.pow}, len{data.len} {}\n \n static Value randomValue(const Value& sigma) {\n return std::mt19937{std::random_device{}()}() % (Mersenne61ModInt::Mod() - sigma) + sigma + 1;\n }\n\n friend constexpr bool operator==(const RollingHashMonoidData& lhs, const RollingHashMonoidData& rhs) {\n return lhs.hash == rhs.hash and lhs.len == rhs.len;\n }\n friend constexpr bool operator!=(const RollingHashMonoidData& lhs, const RollingHashMonoidData& rhs) {\n return lhs.hash != rhs.hash or lhs.len != rhs.len;\n }\n};\n\nstruct RollingHashMonoid {\n using Modulo = Mersenne61ModInt;\n using Element = RollingHashMonoidData;\n static constexpr Element identity() noexcept {\n return Element{};\n }\n static constexpr Element operation(const Element& lhs, const Element& rhs) noexcept {\n return Element{\n Modulo::Modulo(Modulo::UnsafeMul(lhs.hash, rhs.pow) + rhs.hash),\n Modulo::Mul(lhs.pow, rhs.pow),\n lhs.len + rhs.len\n };\n }\n};\n\n} // namespace zawa\n\n\n\n#include <concepts>\n\nnamespace zawa {\n\nnamespace concepts {\n\ntemplate <class T>\nconcept Semigroup = requires {\n typename T::Element;\n { T::operation(std::declval<typename T::Element>(), std::declval<typename T::Element>()) } -> std::same_as<typename T::Element>;\n};\n\n} // namespace concepts\n\n} // namespace zawa\n\n\nnamespace zawa {\n\nnamespace concepts {\n\ntemplate <class T>\nconcept Identitiable = requires {\n typename T::Element;\n { T::identity() } -> std::same_as<typename T::Element>;\n};\n\ntemplate <class T>\nconcept Monoid = Semigroup<T> and Identitiable<T>;\n\n} // namespace\n\n} // namespace zawa\n\nnamespace zawa {\n\ntemplate <concepts::Monoid M>\nstruct ReverseOrder {\n\n using Element = M::Element;\n \n static Element identity() {\n return M::identity();\n }\n\n static Element operation(const Element& L, const Element& R) {\n return M::operation(R, L);\n }\n\n};\n\n} // namespace zawa\n\n\n#include <vector>\n#include <cassert>\n#include <functional>\n#include <ostream>\n\nnamespace zawa {\n\ntemplate <concepts::Monoid Monoid>\nclass SegmentTree {\npublic:\n\n using VM = Monoid;\n\n using V = typename VM::Element;\n\n using OM = Monoid;\n\n using O = typename OM::Element;\n\n SegmentTree() = default;\n\n explicit SegmentTree(usize n) : m_n{ n }, m_dat(n << 1, VM::identity()) {}\n\n explicit SegmentTree(const std::vector<V>& dat) : m_n{ dat.size() }, m_dat(dat.size() << 1, VM::identity()) {\n for (usize i{} ; i < m_n ; i++) {\n m_dat[i + m_n] = dat[i];\n }\n for (usize i{m_n} ; i-- ; ) {\n m_dat[i] = VM::operation(m_dat[left(i)], m_dat[right(i)]);\n }\n }\n\n [[nodiscard]] inline usize size() const noexcept {\n return m_n;\n }\n\n [[nodiscard]] V get(usize i) const {\n assert(i < size());\n return m_dat[i + m_n];\n }\n\n [[nodiscard]] V operator[](usize i) const {\n assert(i < size());\n return m_dat[i + m_n];\n }\n\n void operation(usize i, const O& value) {\n assert(i < size());\n i += size();\n m_dat[i] = OM::operation(m_dat[i], value);\n while (i = parent(i), i) {\n m_dat[i] = VM::operation(m_dat[left(i)], m_dat[right(i)]);\n }\n }\n\n void assign(usize i, const V& value) {\n assert(i < size());\n i += size();\n m_dat[i] = value;\n while (i = parent(i), i) {\n m_dat[i] = VM::operation(m_dat[left(i)], m_dat[right(i)]);\n }\n }\n\n [[nodiscard]] V product(u32 l, u32 r) const {\n assert(l <= r and r <= size());\n V L{ VM::identity() }, R{ VM::identity() };\n for (l += size(), r += size() ; l < r ; l = parent(l), r = parent(r)) {\n if (l & 1) {\n L = VM::operation(L, m_dat[l++]);\n }\n if (r & 1) {\n R = VM::operation(m_dat[--r], R);\n }\n }\n return VM::operation(L, R);\n }\n\n template <class F>\n requires std::predicate<F, V>\n [[nodiscard]] usize maxRight(usize l, const F& f) {\n assert(l < size());\n static_assert(std::is_convertible_v<decltype(f), std::function<bool(V)>>, \"maxRight's argument f must be function bool(T)\");\n assert(f(VM::identity()));\n usize res{l}, width{1};\n V prod{ VM::identity() };\n // 現在の見ている頂点の幅をwidthで持つ\n // 境界がある頂点を含む部分木の根を探す\n // (折り返す時は必要以上の幅を持つ根になるが、widthを持っているのでオーバーしない)\n for (l += size() ; res + width <= size() ; l = parent(l), width <<= 1) if (l & 1) {\n if (not f(VM::operation(prod, m_dat[l]))) break; \n res += width;\n prod = VM::operation(prod, m_dat[l++]);\n }\n // 根から下って、境界を発見する\n while (l = left(l), width >>= 1) {\n if (res + width <= size() and f(VM::operation(prod, m_dat[l]))) {\n res += width;\n prod = VM::operation(prod, m_dat[l++]);\n } \n }\n return res;\n }\n\n template <class F>\n requires std::predicate<F, V>\n [[nodiscard]] usize minLeft(usize r, const F& f) const {\n assert(r <= size());\n static_assert(std::is_convertible_v<decltype(f), std::function<bool(V)>>, \"minLeft's argument f must be function bool(T)\");\n assert(f(VM::identity()));\n usize res{r}, width{1};\n V prod{ VM::identity() };\n for (r += size() ; res >= width ; r = parent(r), width <<= 1) if (r & 1) {\n if (not f(VM::operation(m_dat[r - 1], prod))) break;\n res -= width;\n prod = VM::operation(prod, m_dat[--r]);\n }\n while (r = left(r), width >>= 1) {\n if (res >= width and f(VM::operation(m_dat[r - 1], prod))) {\n res -= width;\n prod = VM::operation(m_dat[--r], prod);\n }\n }\n return res;\n }\n\n friend std::ostream& operator<<(std::ostream& os, const SegmentTree& st) {\n for (usize i{1} ; i < 2 * st.size() ; i++) {\n os << st.m_dat[i] << (i + 1 == 2 * st.size() ? \"\" : \" \");\n }\n return os;\n }\n\nprivate:\n\n constexpr u32 left(u32 v) const {\n return v << 1;\n }\n\n constexpr u32 right(u32 v) const {\n return v << 1 | 1;\n }\n\n constexpr u32 parent(u32 v) const {\n return v >> 1;\n }\n\n usize m_n;\n\n std::vector<V> m_dat;\n};\n\n} // namespace zawa\n\n\n#include <algorithm>\n#include <cmath>\n#include <limits>\n#include <utility>\n\nnamespace zawa {\n\ntemplate <class V>\nclass HeavyLightDecomposition {\npublic:\n\n static constexpr V Invalid() noexcept {\n return INVALID;\n }\n\n HeavyLightDecomposition() = default;\n\n HeavyLightDecomposition(std::vector<std::vector<V>> T, V root = 0u) \n : n_{T.size()}, par_(n_), top_(n_), idx_(n_), \n inv_(n_), size_(n_, usize{1}), dep_(n_) {\n\n auto dfs1{[&](auto dfs, V v, V p, usize d) -> usize {\n par_[v] = p;\n dep_[v] = d;\n if (p != INVALID) {\n for (u32 i{} ; i + 1 < T[v].size() ; i++) if (T[v][i] == p) {\n std::swap(T[v][i], T[v].back());\n break;\n }\n assert(T[v].back() == p);\n T[v].pop_back();\n }\n for (V x : T[v]) {\n size_[v] += dfs(dfs, x, v, d + 1);\n }\n for (u32 i{1} ; i < T[v].size() ; i++) if (size_[T[v][0]] < size_[T[v][i]]) {\n std::swap(T[v][0], T[v][i]);\n }\n return size_[v];\n }};\n\n auto dfs2{[&](auto dfs, V v, V idx, V top) -> V {\n idx_[v] = idx++;\n inv_[idx_[v]] = v;\n top_[v] = top;\n if (T[v].size()) {\n idx = dfs(dfs, T[v][0], idx, top);\n for (u32 i{1} ; i < T[v].size() ; i++) {\n idx = dfs(dfs, T[v][i], idx, T[v][i]);\n }\n }\n return idx;\n }};\n\n dfs1(dfs1, root, INVALID, 0u);\n dfs2(dfs2, root, 0u, root);\n }\n\n inline usize size() const noexcept {\n return n_;\n }\n\n usize size(V v) const noexcept {\n assert(v < (V)size());\n return size_[v];\n }\n\n usize depth(V v) const noexcept {\n assert(v < (V)size());\n return dep_[v];\n }\n\n V parent(V v) const noexcept {\n assert(v < (V)size());\n return par_[v];\n }\n\n V index(V v) const noexcept {\n assert(v < (V)size());\n return idx_[v];\n }\n\n V operator[](V v) const noexcept {\n assert(v < (V)size());\n return idx_[v];\n }\n\n std::vector<std::pair<V, V>> decomp(V s, V t) const {\n assert(s < (V)size());\n assert(t < (V)size());\n std::vector<std::pair<V, V>> res, ser;\n while (top_[s] != top_[t]) {\n if (dep_[top_[s]] >= dep_[top_[t]]) {\n res.emplace_back(s, top_[s]);\n s = top_[s];\n if (par_[s] != INVALID) s = par_[s];\n }\n else {\n ser.emplace_back(top_[t], t);\n t = top_[t];\n if (par_[t] != INVALID) t = par_[t];\n }\n }\n res.emplace_back(s, t);\n std::reverse(ser.begin(), ser.end());\n res.insert(res.end(), ser.begin(), ser.end()); \n return res;\n }\n\n std::vector<std::pair<V, V>> operator()(V s, V t) const {\n return decomp(s, t);\n }\n\n V lca(V u, V v) const {\n assert(u < (V)size());\n assert(v < (V)size());\n while (top_[u] != top_[v]) {\n if (dep_[top_[u]] >= dep_[top_[v]]) {\n u = top_[u];\n if (par_[u] != INVALID) u = par_[u];\n }\n else {\n v = top_[v];\n if (par_[v] != INVALID) v = par_[v];\n }\n }\n return (dep_[u] <= dep_[v] ? u : v);\n }\n\n // pはvの祖先か？\n bool isAncestor(V v, V p) {\n assert(v < size());\n assert(p < size());\n if (dep_[v] < dep_[p]) return false;\n while (v != INVALID and top_[v] != top_[p]) {\n v = par_[top_[v]];\n }\n return v != INVALID;\n }\n\n V levelAncestor(V v, usize step) const {\n assert(v < (V)size());\n if (step > dep_[v]) return INVALID;\n while (true) {\n usize dist{dep_[v] - dep_[top_[v]]};\n if (dist >= step) break;\n step -= dist + 1;\n v = par_[top_[v]];\n }\n step = (dep_[v] - dep_[top_[v]]) - step;\n return inv_[idx_[top_[v]] + step];\n }\n\n V jump(V s, V t, usize step) const {\n assert(s < (V)size());\n assert(t < (V)size());\n V uu{INVALID}, vv{INVALID};\n usize d{};\n for (auto [u, v] : decomp(s, t)) {\n usize dist{std::max(dep_[u], dep_[v]) - std::min(dep_[u], dep_[v])};\n if (dist >= step) {\n uu = u;\n vv = v;\n d = dist;\n break;\n }\n step -= dist + 1;\n }\n if (uu == INVALID) return INVALID;\n if (dep_[uu] <= dep_[vv]) {\n return inv_[idx_[uu] + step];\n }\n else {\n return inv_[idx_[vv] + (d - step)];\n }\n }\n\n usize distance(V s, V t) const {\n assert(s < (V)size());\n assert(t < (V)size());\n usize res{};\n for (auto [u, v] : decomp(s, t)) {\n if (dep_[u] > dep_[v]) std::swap(u, v);\n res += dep_[v] - dep_[u];\n }\n return res;\n }\n\nprivate:\n static constexpr V INVALID{static_cast<V>(-1)};\n usize n_{};\n std::vector<V> par_{}, top_{}, idx_{}, inv_{};\n std::vector<usize> size_{}, dep_{};\n};\n\n} // namespace zawa\n\n#include <unordered_set>\nusing namespace zawa;\n\nRollingHashMonoidData::Value RollingHashMonoidData::base{\n RollingHashMonoidData::randomValue(26)\n};\n\nint main() {\n SetFastIO();\n int N;\n std::cin >> N;\n std::vector<char> K(N);\n for (auto& k : K) std::cin >> k;\n std::vector<std::vector<int>> T(N);\n for (int i{} ; i < N - 1 ; i++) {\n int u, v;\n std::cin >> u >> v;\n u--; v--;\n T[u].push_back(v);\n T[v].push_back(u);\n }\n HeavyLightDecomposition hld{T};\n std::vector<RollingHashMonoidData> init(N);\n for (int i{} ; i < N ; i++) {\n init[hld[i]] = RollingHashMonoidData{K[i]};\n }\n SegmentTree<RollingHashMonoid> seg{init};\n SegmentTree<ReverseOrder<RollingHashMonoid>> ges{init};\n int Q;\n std::cin >> Q;\n std::unordered_set<RollingHashMonoidData::Value> set;\n while (Q--) {\n int t;\n std::cin >> t;\n if (t == 1) {\n int s, t;\n std::cin >> s >> t;\n s--; t--;\n RollingHashMonoidData res{};\n for (auto [u, v] : hld(s, t)) {\n u = hld[u];\n v = hld[v];\n if (u <= v) res = RollingHashMonoid::operation(res, seg.product(u, v + 1));\n else res = RollingHashMonoid::operation(res, ges.product(v, u + 1));\n }\n set.insert(res.hash);\n std::cout << set.size() << '\\n';\n }\n else if (t == 2) {\n int k;\n char c;\n std::cin >> k >> c;\n k--;\n seg.assign(hld[k], RollingHashMonoidData{c});\n ges.assign(hld[k], RollingHashMonoidData{c});\n }\n else {\n assert(false);\n }\n }\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 40248, "score_of_the_acc": -0.2071, "final_rank": 6 }, { "submission_id": "aoj_0478_10635120", "code_snippet": "#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/0478\"\n\n\n\n#include <cstdint>\n#include <cstddef>\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n\n#include <iostream>\n#include <iomanip>\n\nnamespace zawa {\n\nvoid SetFastIO() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n}\n\nvoid SetPrecision(u32 dig) {\n std::cout << std::fixed << std::setprecision(dig);\n}\n\n} // namespace zawa\n\n\n\nnamespace zawa {\n\n// @reference: https://qiita.com/keymoon/items/11fac5627672a6d6a9f6\nclass Mersenne61ModInt {\npublic:\n using Value = u64;\nprivate:\n static constexpr Value MOD{(1ull << 61) - 1}; // == MASK61\n static constexpr Value MASK30{(1ull << 30) - 1};\n static constexpr Value MASK31{(1ull << 31) - 1};\n Value v_{};\npublic:\n constexpr Mersenne61ModInt() {}\n\n static constexpr Value Mod() noexcept {\n return MOD;\n }\n static constexpr Value Modulo(const Value& v) noexcept {\n Value res{(v >> 61) + (v & MOD)};\n res = (res >= MOD ? res - MOD : res);\n return res;\n }\n static constexpr Value UnsafeMul(const Value& a, const Value& b) noexcept {\n Value fa{a >> 31}, fb{b >> 31};\n Value ba{a & MASK31}, bb{b & MASK31};\n Value mid{fa * bb + fb * ba};\n return Value{2}*fa*fb + (mid >> 30) + ((mid & MASK30) << 31) + ba*bb;\n }\n static constexpr Value Mul(const Value& a, const Value& b) noexcept {\n return Modulo(UnsafeMul(a, b));\n }\n};\n\n};\n\n#include <random>\n#include <type_traits>\n\nnamespace zawa {\n\nstruct RollingHashMonoidData {\n using Value = Mersenne61ModInt::Value;\n using Size = usize;\n static Value base;\n Value hash{}, pow{1};\n usize len{};\n\n constexpr RollingHashMonoidData() = default;\n constexpr RollingHashMonoidData(Value h, Value p, usize l) : hash{h}, pow{p}, len{l} {}\n template <class T>\n constexpr RollingHashMonoidData(const T& v) \n : hash{static_cast<Value>(v)}, pow{base}, len{1} {}\n // RollingHashMonoidData(const RollingHashMonoidData& data)\n // : hash{data.hash}, pow{data.pow}, len{data.len} {}\n \n static Value randomValue(const Value& sigma) {\n return std::mt19937{std::random_device{}()}() % (Mersenne61ModInt::Mod() - sigma) + sigma + 1;\n }\n\n friend constexpr bool operator==(const RollingHashMonoidData& lhs, const RollingHashMonoidData& rhs) {\n return lhs.hash == rhs.hash and lhs.len == rhs.len;\n }\n friend constexpr bool operator!=(const RollingHashMonoidData& lhs, const RollingHashMonoidData& rhs) {\n return lhs.hash != rhs.hash or lhs.len != rhs.len;\n }\n};\n\nstruct RollingHashMonoid {\n using Modulo = Mersenne61ModInt;\n using Element = RollingHashMonoidData;\n static constexpr Element identity() noexcept {\n return Element{};\n }\n static constexpr Element operation(const Element& lhs, const Element& rhs) noexcept {\n return Element{\n Modulo::Modulo(Modulo::UnsafeMul(lhs.hash, rhs.pow) + rhs.hash),\n Modulo::Mul(lhs.pow, rhs.pow),\n lhs.len + rhs.len\n };\n }\n};\n\n} // namespace zawa\n\n\n\n#include <concepts>\n\nnamespace zawa {\n\nnamespace concepts {\n\ntemplate <class T>\nconcept Semigroup = requires {\n typename T::Element;\n { T::operation(std::declval<typename T::Element>(), std::declval<typename T::Element>()) } -> std::same_as<typename T::Element>;\n};\n\n} // namespace concepts\n\n} // namespace zawa\n\n\nnamespace zawa {\n\nnamespace concepts {\n\ntemplate <class T>\nconcept Identitiable = requires {\n typename T::Element;\n { T::identity() } -> std::same_as<typename T::Element>;\n};\n\ntemplate <class T>\nconcept Monoid = Semigroup<T> and Identitiable<T>;\n\n} // namespace\n\n} // namespace zawa\n\n#include <vector>\n#include <cassert>\n#include <functional>\n#include <ostream>\n\nnamespace zawa {\n\ntemplate <concepts::Monoid Monoid>\nclass SegmentTree {\npublic:\n\n using VM = Monoid;\n\n using V = typename VM::Element;\n\n using OM = Monoid;\n\n using O = typename OM::Element;\n\n SegmentTree() = default;\n\n explicit SegmentTree(usize n) : m_n{ n }, m_dat(n << 1, VM::identity()) {}\n\n explicit SegmentTree(const std::vector<V>& dat) : m_n{ dat.size() }, m_dat(dat.size() << 1, VM::identity()) {\n for (usize i{} ; i < m_n ; i++) {\n m_dat[i + m_n] = dat[i];\n }\n for (usize i{m_n} ; i-- ; i) {\n m_dat[i] = VM::operation(m_dat[left(i)], m_dat[right(i)]);\n }\n }\n\n [[nodiscard]] inline usize size() const noexcept {\n return m_n;\n }\n\n [[nodiscard]] V get(usize i) const {\n assert(i < size());\n return m_dat[i + m_n];\n }\n\n [[nodiscard]] V operator[](usize i) const {\n assert(i < size());\n return m_dat[i + m_n];\n }\n\n void operation(usize i, const O& value) {\n assert(i < size());\n i += size();\n m_dat[i] = OM::operation(m_dat[i], value);\n while (i = parent(i), i) {\n m_dat[i] = VM::operation(m_dat[left(i)], m_dat[right(i)]);\n }\n }\n\n void assign(usize i, const V& value) {\n assert(i < size());\n i += size();\n m_dat[i] = value;\n while (i = parent(i), i) {\n m_dat[i] = VM::operation(m_dat[left(i)], m_dat[right(i)]);\n }\n }\n\n [[nodiscard]] V product(u32 l, u32 r) const {\n assert(l <= r and r <= size());\n V L{ VM::identity() }, R{ VM::identity() };\n for (l += size(), r += size() ; l < r ; l = parent(l), r = parent(r)) {\n if (l & 1) {\n L = VM::operation(L, m_dat[l++]);\n }\n if (r & 1) {\n R = VM::operation(m_dat[--r], R);\n }\n }\n return VM::operation(L, R);\n }\n\n template <class Function>\n [[nodiscard]] usize maxRight(usize l, const Function& f) {\n assert(l < size());\n static_assert(std::is_convertible_v<decltype(f), std::function<bool(V)>>, \"maxRight's argument f must be function bool(T)\");\n assert(f(VM::identity()));\n usize res{l}, width{1};\n V prod{ VM::identity() };\n // 現在の見ている頂点の幅をwidthで持つ\n // 境界がある頂点を含む部分木の根を探す\n // (折り返す時は必要以上の幅を持つ根になるが、widthを持っているのでオーバーしない)\n for (l += size() ; res + width <= size() ; l = parent(l), width <<= 1) if (l & 1) {\n if (not f(VM::operation(prod, m_dat[l]))) break; \n res += width;\n prod = VM::operation(prod, m_dat[l++]);\n }\n // 根から下って、境界を発見する\n while (l = left(l), width >>= 1) {\n if (res + width <= size() and f(VM::operation(prod, m_dat[l]))) {\n res += width;\n prod = VM::operation(prod, m_dat[l++]);\n } \n }\n return res;\n }\n\n template <class Function>\n [[nodiscard]] usize minLeft(usize r, const Function& f) const {\n assert(r <= size());\n static_assert(std::is_convertible_v<decltype(f), std::function<bool(V)>>, \"minLeft's argument f must be function bool(T)\");\n assert(f(VM::identity()));\n usize res{r}, width{1};\n V prod{ VM::identity() };\n for (r += size() ; res >= width ; r = parent(r), width <<= 1) if (r & 1) {\n if (not f(VM::operation(m_dat[r - 1], prod))) break;\n res -= width;\n prod = VM::operation(prod, m_dat[--r]);\n }\n while (r = left(r), width >>= 1) {\n if (res >= width and f(VM::operation(m_dat[r - 1], prod))) {\n res -= width;\n prod = VM::operation(m_dat[--r], prod);\n }\n }\n return res;\n }\n\n friend std::ostream& operator<<(std::ostream& os, const SegmentTree& st) {\n for (usize i{1} ; i < 2 * st.size() ; i++) {\n os << st.m_dat[i] << (i + 1 == 2 * st.size() ? \"\" : \" \");\n }\n return os;\n }\n\nprivate:\n\n constexpr u32 left(u32 v) const {\n return v << 1;\n }\n\n constexpr u32 right(u32 v) const {\n return v << 1 | 1;\n }\n\n constexpr u32 parent(u32 v) const {\n return v >> 1;\n }\n\n usize m_n;\n\n std::vector<V> m_dat;\n};\n\n} // namespace zawa\n\n\n#include <algorithm>\n#include <cmath>\n#include <limits>\n#include <utility>\n\nnamespace zawa {\n\ntemplate <class V>\nclass HeavyLightDecomposition {\npublic:\n\n static constexpr V Invalid() noexcept {\n return INVALID;\n }\n\n HeavyLightDecomposition() = default;\n\n HeavyLightDecomposition(std::vector<std::vector<V>> T, V root = 0u) \n : n_{T.size()}, par_(n_), top_(n_), idx_(n_), \n inv_(n_), size_(n_, usize{1}), dep_(n_) {\n\n auto dfs1{[&](auto dfs, V v, V p, usize d) -> usize {\n par_[v] = p;\n dep_[v] = d;\n if (p != INVALID) {\n for (u32 i{} ; i + 1 < T[v].size() ; i++) if (T[v][i] == p) {\n std::swap(T[v][i], T[v].back());\n break;\n }\n assert(T[v].back() == p);\n T[v].pop_back();\n }\n for (V x : T[v]) {\n size_[v] += dfs(dfs, x, v, d + 1);\n }\n for (u32 i{1} ; i < T[v].size() ; i++) if (size_[T[v][0]] < size_[T[v][i]]) {\n std::swap(T[v][0], T[v][i]);\n }\n return size_[v];\n }};\n\n auto dfs2{[&](auto dfs, V v, V idx, V top) -> V {\n idx_[v] = idx++;\n inv_[idx_[v]] = v;\n top_[v] = top;\n if (T[v].size()) {\n idx = dfs(dfs, T[v][0], idx, top);\n for (u32 i{1} ; i < T[v].size() ; i++) {\n idx = dfs(dfs, T[v][i], idx, T[v][i]);\n }\n }\n return idx;\n }};\n\n dfs1(dfs1, root, INVALID, 0u);\n dfs2(dfs2, root, 0u, root);\n }\n\n inline usize size() const noexcept {\n return n_;\n }\n\n usize size(V v) const noexcept {\n assert(v < (V)size());\n return size_[v];\n }\n\n usize depth(V v) const noexcept {\n assert(v < (V)size());\n return dep_[v];\n }\n\n V parent(V v) const noexcept {\n assert(v < (V)size());\n return par_[v];\n }\n\n V index(V v) const noexcept {\n assert(v < (V)size());\n return idx_[v];\n }\n\n V operator[](V v) const noexcept {\n assert(v < (V)size());\n return idx_[v];\n }\n\n std::vector<std::pair<V, V>> decomp(V s, V t) const {\n assert(s < (V)size());\n assert(t < (V)size());\n std::vector<std::pair<V, V>> res, ser;\n while (top_[s] != top_[t]) {\n if (dep_[top_[s]] >= dep_[top_[t]]) {\n res.emplace_back(s, top_[s]);\n s = top_[s];\n if (par_[s] != INVALID) s = par_[s];\n }\n else {\n ser.emplace_back(top_[t], t);\n t = top_[t];\n if (par_[t] != INVALID) t = par_[t];\n }\n }\n res.emplace_back(s, t);\n std::reverse(ser.begin(), ser.end());\n res.insert(res.end(), ser.begin(), ser.end()); \n return res;\n }\n\n std::vector<std::pair<V, V>> operator()(V s, V t) const {\n return decomp(s, t);\n }\n\n V lca(V u, V v) const {\n assert(u < (V)size());\n assert(v < (V)size());\n while (top_[u] != top_[v]) {\n if (dep_[top_[u]] >= dep_[top_[v]]) {\n u = top_[u];\n if (par_[u] != INVALID) u = par_[u];\n }\n else {\n v = top_[v];\n if (par_[v] != INVALID) v = par_[v];\n }\n }\n return (dep_[u] <= dep_[v] ? u : v);\n }\n\n // pはvの祖先か？\n bool isAncestor(V v, V p) {\n assert(v < size());\n assert(p < size());\n if (dep_[v] < dep_[p]) return false;\n while (v != INVALID and top_[v] != top_[p]) {\n v = par_[top_[v]];\n }\n return v != INVALID;\n }\n\n V levelAncestor(V v, usize step) const {\n assert(v < (V)size());\n if (step > dep_[v]) return INVALID;\n while (true) {\n usize dist{dep_[v] - dep_[top_[v]]};\n if (dist >= step) break;\n step -= dist + 1;\n v = par_[top_[v]];\n }\n step = (dep_[v] - dep_[top_[v]]) - step;\n return inv_[idx_[top_[v]] + step];\n }\n\n V jump(V s, V t, usize step) const {\n assert(s < (V)size());\n assert(t < (V)size());\n V uu{INVALID}, vv{INVALID};\n usize d{};\n for (auto [u, v] : decomp(s, t)) {\n usize dist{std::max(dep_[u], dep_[v]) - std::min(dep_[u], dep_[v])};\n if (dist >= step) {\n uu = u;\n vv = v;\n d = dist;\n break;\n }\n step -= dist + 1;\n }\n if (uu == INVALID) return INVALID;\n if (dep_[uu] <= dep_[vv]) {\n return inv_[idx_[uu] + step];\n }\n else {\n return inv_[idx_[vv] + (d - step)];\n }\n }\n\n usize distance(V s, V t) const {\n assert(s < (V)size());\n assert(t < (V)size());\n usize res{};\n for (auto [u, v] : decomp(s, t)) {\n if (dep_[u] > dep_[v]) std::swap(u, v);\n res += dep_[v] - dep_[u];\n }\n return res;\n }\n\nprivate:\n static constexpr V INVALID{static_cast<V>(-1)};\n usize n_{};\n std::vector<V> par_{}, top_{}, idx_{}, inv_{};\n std::vector<usize> size_{}, dep_{};\n};\n\n} // namespace zawa\n\n#include <unordered_set>\nusing namespace zawa;\n\nRollingHashMonoidData::Value RollingHashMonoidData::base{\n RollingHashMonoidData::randomValue(26)\n};\n\nint main() {\n SetFastIO();\n int N;\n std::cin >> N;\n std::vector<char> K(N);\n for (auto& k : K) std::cin >> k;\n std::vector<std::vector<int>> T(N);\n for (int i{} ; i < N - 1 ; i++) {\n int u, v;\n std::cin >> u >> v;\n u--; v--;\n T[u].push_back(v);\n T[v].push_back(u);\n }\n HeavyLightDecomposition hld{T};\n std::vector<RollingHashMonoidData> init(N), tini(N);\n for (int i{} ; i < N ; i++) {\n init[hld[i]] = tini[N - hld[i] - 1] = RollingHashMonoidData{K[i]};\n }\n SegmentTree<RollingHashMonoid> seg{init}, ges{tini};\n int Q;\n std::cin >> Q;\n std::unordered_set<RollingHashMonoidData::Value> set;\n while (Q--) {\n int t;\n std::cin >> t;\n if (t == 1) {\n int s, t;\n std::cin >> s >> t;\n s--; t--;\n RollingHashMonoidData res{};\n for (auto [u, v] : hld(s, t)) {\n u = hld[u];\n v = hld[v];\n if (u <= v) res = RollingHashMonoid::operation(res, seg.product(u, v + 1));\n else res = RollingHashMonoid::operation(res, ges.product(N - u - 1, N - v));\n }\n set.insert(res.hash);\n std::cout << set.size() << '\\n';\n }\n else if (t == 2) {\n int k;\n char c;\n std::cin >> k >> c;\n k--;\n seg.assign(hld[k], RollingHashMonoidData{c});\n ges.assign(N - hld[k] - 1, RollingHashMonoidData{c});\n }\n else {\n assert(false);\n }\n }\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 42580, "score_of_the_acc": -0.243, "final_rank": 9 }, { "submission_id": "aoj_0478_10393813", "code_snippet": "#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/0478\"\n\n\n\n#include <cstdint>\n#include <cstddef>\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n\n#include <iostream>\n#include <iomanip>\n\nnamespace zawa {\n\nvoid SetFastIO() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n}\n\nvoid SetPrecision(u32 dig) {\n std::cout << std::fixed << std::setprecision(dig);\n}\n\n} // namespace zawa\n\n\n\nnamespace zawa {\n\n// @reference: https://qiita.com/keymoon/items/11fac5627672a6d6a9f6\nclass Mersenne61ModInt {\npublic:\n using Value = u64;\nprivate:\n static constexpr Value MOD{(1ull << 61) - 1}; // == MASK61\n static constexpr Value MASK30{(1ull << 30) - 1};\n static constexpr Value MASK31{(1ull << 31) - 1};\n Value v_{};\npublic:\n constexpr Mersenne61ModInt() {}\n\n static constexpr Value Mod() noexcept {\n return MOD;\n }\n static constexpr Value Modulo(const Value& v) noexcept {\n Value res{(v >> 61) + (v & MOD)};\n res = (res >= MOD ? res - MOD : res);\n return res;\n }\n static constexpr Value UnsafeMul(const Value& a, const Value& b) noexcept {\n Value fa{a >> 31}, fb{b >> 31};\n Value ba{a & MASK31}, bb{b & MASK31};\n Value mid{fa * bb + fb * ba};\n return Value{2}*fa*fb + (mid >> 30) + ((mid & MASK30) << 31) + ba*bb;\n }\n static constexpr Value Mul(const Value& a, const Value& b) noexcept {\n return Modulo(UnsafeMul(a, b));\n }\n};\n\n};\n\n#include <random>\n#include <type_traits>\n\nnamespace zawa {\n\nstruct RollingHashMonoidData {\n using Value = Mersenne61ModInt::Value;\n using Size = usize;\n static Value base;\n Value hash{}, pow{1};\n usize len{};\n\n constexpr RollingHashMonoidData() = default;\n constexpr RollingHashMonoidData(Value h, Value p, usize l) : hash{h}, pow{p}, len{l} {}\n template <class T>\n constexpr RollingHashMonoidData(const T& v) \n : hash{static_cast<Value>(v)}, pow{base}, len{1} {}\n // RollingHashMonoidData(const RollingHashMonoidData& data)\n // : hash{data.hash}, pow{data.pow}, len{data.len} {}\n \n static Value randomValue(const Value& sigma) {\n return std::mt19937{std::random_device{}()}() % (Mersenne61ModInt::Mod() - sigma) + sigma + 1;\n }\n\n friend constexpr bool operator==(const RollingHashMonoidData& lhs, const RollingHashMonoidData& rhs) {\n return lhs.hash == rhs.hash and lhs.len == rhs.len;\n }\n friend constexpr bool operator!=(const RollingHashMonoidData& lhs, const RollingHashMonoidData& rhs) {\n return lhs.hash != rhs.hash or lhs.len != rhs.len;\n }\n};\n\nstruct RollingHashMonoid {\n using Modulo = Mersenne61ModInt;\n using Element = RollingHashMonoidData;\n static constexpr Element identity() noexcept {\n return Element{};\n }\n static constexpr Element operation(const Element& lhs, const Element& rhs) noexcept {\n return Element{\n Modulo::Modulo(Modulo::UnsafeMul(lhs.hash, rhs.pow) + rhs.hash),\n Modulo::Mul(lhs.pow, rhs.pow),\n lhs.len + rhs.len\n };\n }\n};\n\n} // namespace zawa\n\n\n\n#include <concepts>\n\nnamespace zawa {\n\nnamespace concepts {\n\ntemplate <class T>\nconcept Semigroup = requires {\n typename T::Element;\n { T::operation(std::declval<typename T::Element>(), std::declval<typename T::Element>()) } -> std::same_as<typename T::Element>;\n};\n\n} // namespace concepts\n\n} // namespace zawa\n\n\nnamespace zawa {\n\nnamespace concepts {\n\ntemplate <class T>\nconcept Identitiable = requires {\n typename T::Element;\n { T::identity() } -> std::same_as<typename T::Element>;\n};\n\ntemplate <class T>\nconcept Monoid = Semigroup<T> and Identitiable<T>;\n\n} // namespace\n\n} // namespace zawa\n\n#include <vector>\n#include <cassert>\n#include <functional>\n#include <ostream>\n\nnamespace zawa {\n\ntemplate <concepts::Monoid Monoid>\nclass SegmentTree {\npublic:\n using Value = typename Monoid::Element;\nprivate:\n constexpr u32 left(u32 v) const {\n return v << 1;\n }\n constexpr u32 right(u32 v) const {\n return v << 1 | 1;\n }\n constexpr u32 parent(u32 v) const {\n return v >> 1;\n }\n\n usize n_;\n std::vector<Value> dat_;\n\npublic:\n SegmentTree() = default;\n SegmentTree(u32 n) : n_{ n }, dat_(n << 1, Monoid::identity()) {\n assert(n_);\n }\n SegmentTree(const std::vector<Value>& dat) : n_{ dat.size() }, dat_(dat.size() << 1, Monoid::identity()) {\n assert(n_);\n for (u32 i{} ; i < n_ ; i++) {\n dat_[i + n_] = dat[i];\n }\n for (u32 i{static_cast<u32>(n_) - 1} ; i ; i--) {\n dat_[i] = Monoid::operation(dat_[left(i)], dat_[right(i)]);\n }\n }\n\n Value get(u32 i) const {\n assert(i < n_);\n return dat_[i + n_];\n }\n\n void set(u32 i, const Value& value) {\n assert(i < n_);\n i += n_;\n dat_[i] = value;\n while (i = parent(i), i) {\n dat_[i] = Monoid::operation(dat_[left(i)], dat_[right(i)]);\n }\n }\n\n Value product(u32 l, u32 r) const {\n assert(l <= r and r <= n_);\n Value leftValue{ Monoid::identity() }, rightValue{ Monoid::identity() };\n for (l += n_, r += n_ ; l < r ; l = parent(l), r = parent(r)) {\n if (l & 1) {\n leftValue = Monoid::operation(leftValue, dat_[l++]);\n }\n if (r & 1) {\n rightValue = Monoid::operation(dat_[--r], rightValue);\n }\n }\n return Monoid::operation(leftValue, rightValue);\n }\n\n template <class Function>\n u32 maxRight(u32 l, const Function& f) {\n assert(l < n_);\n static_assert(std::is_convertible_v<decltype(f), std::function<bool(Value)>>, \"maxRight's argument f must be function bool(T)\");\n assert(f(Monoid::identity()));\n u32 res{l}, width{1};\n Value prod{ Monoid::identity() };\n // 現在の見ている頂点の幅をwidthで持つ\n // 境界がある頂点を含む部分木の根を探す\n // (折り返す時は必要以上の幅を持つ根になるが、widthを持っているのでオーバーしない)\n for (l += n_ ; res + width <= n_ ; l = parent(l), width <<= 1) if (l & 1) {\n if (not f(Monoid::operation(prod, dat_[l]))) break; \n res += width;\n prod = Monoid::operation(prod, dat_[l++]);\n }\n // 根から下って、境界を発見する\n while (l = left(l), width >>= 1) {\n if (res + width <= n_ and f(Monoid::operation(prod, dat_[l]))) {\n res += width;\n prod = Monoid::operation(prod, dat_[l++]);\n } \n }\n return res;\n }\n\n template <class Function>\n u32 minLeft(u32 r, const Function& f) const {\n assert(r <= n_);\n static_assert(std::is_convertible_v<decltype(f), std::function<bool(Value)>>, \"minLeft's argument f must be function bool(T)\");\n assert(f(Monoid::identity()));\n u32 res{r}, width{1};\n Value prod{ Monoid::identity() };\n for (r += n_ ; res >= width ; r = parent(r), width <<= 1) if (r & 1) {\n if (not f(Monoid::operation(dat_[r - 1], prod))) break;\n res -= width;\n prod = Monoid::operation(prod, dat_[--r]);\n }\n while (r = left(r), width >>= 1) {\n if (res >= width and f(Monoid::operation(dat_[r - 1], prod))) {\n res -= width;\n prod = Monoid::operation(dat_[--r], prod);\n }\n }\n return res;\n }\n\n friend std::ostream& operator<<(std::ostream& os, const SegmentTree& st) {\n for (u32 i{1} ; i < 2 * st.n_ ; i++) {\n os << st.dat_[i] << (i + 1 == 2 * st.n_ ? \"\" : \" \");\n }\n return os;\n }\n};\n\n} // namespace zawa\n\n\n#include <algorithm>\n#include <cmath>\n#include <limits>\n#include <utility>\n\nnamespace zawa {\n\ntemplate <class V>\nclass HeavyLightDecomposition {\npublic:\n\n static constexpr V Invalid() noexcept {\n return INVALID;\n }\n\n HeavyLightDecomposition() = default;\n\n HeavyLightDecomposition(std::vector<std::vector<V>> T, V root = 0u) \n : n_{T.size()}, par_(n_), top_(n_), idx_(n_), \n inv_(n_), size_(n_, usize{1}), dep_(n_) {\n\n auto dfs1{[&](auto dfs, V v, V p, usize d) -> usize {\n par_[v] = p;\n dep_[v] = d;\n if (p != INVALID) {\n for (u32 i{} ; i + 1 < T[v].size() ; i++) if (T[v][i] == p) {\n std::swap(T[v][i], T[v].back());\n break;\n }\n assert(T[v].back() == p);\n T[v].pop_back();\n }\n for (V x : T[v]) {\n size_[v] += dfs(dfs, x, v, d + 1);\n }\n for (u32 i{1} ; i < T[v].size() ; i++) if (size_[T[v][0]] < size_[T[v][i]]) {\n std::swap(T[v][0], T[v][i]);\n }\n return size_[v];\n }};\n\n auto dfs2{[&](auto dfs, V v, V idx, V top) -> V {\n idx_[v] = idx++;\n inv_[idx_[v]] = v;\n top_[v] = top;\n if (T[v].size()) {\n idx = dfs(dfs, T[v][0], idx, top);\n for (u32 i{1} ; i < T[v].size() ; i++) {\n idx = dfs(dfs, T[v][i], idx, T[v][i]);\n }\n }\n return idx;\n }};\n\n dfs1(dfs1, root, INVALID, 0u);\n dfs2(dfs2, root, 0u, root);\n }\n\n inline usize size() const noexcept {\n return n_;\n }\n\n usize size(V v) const noexcept {\n assert(v < (V)size());\n return size_[v];\n }\n\n usize depth(V v) const noexcept {\n assert(v < (V)size());\n return dep_[v];\n }\n\n V parent(V v) const noexcept {\n assert(v < (V)size());\n return par_[v];\n }\n\n V index(V v) const noexcept {\n assert(v < (V)size());\n return idx_[v];\n }\n\n V operator[](V v) const noexcept {\n assert(v < (V)size());\n return idx_[v];\n }\n\n std::vector<std::pair<V, V>> decomp(V s, V t) const {\n assert(s < (V)size());\n assert(t < (V)size());\n std::vector<std::pair<V, V>> res, ser;\n while (top_[s] != top_[t]) {\n if (dep_[top_[s]] >= dep_[top_[t]]) {\n res.emplace_back(s, top_[s]);\n s = top_[s];\n if (par_[s] != INVALID) s = par_[s];\n }\n else {\n ser.emplace_back(top_[t], t);\n t = top_[t];\n if (par_[t] != INVALID) t = par_[t];\n }\n }\n res.emplace_back(s, t);\n std::reverse(ser.begin(), ser.end());\n res.insert(res.end(), ser.begin(), ser.end()); \n return res;\n }\n\n std::vector<std::pair<V, V>> operator()(V s, V t) const {\n return decomp(s, t);\n }\n\n V lca(V u, V v) const {\n assert(u < (V)size());\n assert(v < (V)size());\n while (top_[u] != top_[v]) {\n if (dep_[top_[u]] >= dep_[top_[v]]) {\n u = top_[u];\n if (par_[u] != INVALID) u = par_[u];\n }\n else {\n v = top_[v];\n if (par_[v] != INVALID) v = par_[v];\n }\n }\n return (dep_[u] <= dep_[v] ? u : v);\n }\n\n // pはvの祖先か？\n bool isAncestor(V v, V p) {\n assert(v < size());\n assert(p < size());\n if (dep_[v] < dep_[p]) return false;\n while (v != INVALID and top_[v] != top_[p]) {\n v = par_[top_[v]];\n }\n return v != INVALID;\n }\n\n V levelAncestor(V v, usize step) const {\n assert(v < (V)size());\n if (step > dep_[v]) return INVALID;\n while (true) {\n usize dist{dep_[v] - dep_[top_[v]]};\n if (dist >= step) break;\n step -= dist + 1;\n v = par_[top_[v]];\n }\n step = (dep_[v] - dep_[top_[v]]) - step;\n return inv_[idx_[top_[v]] + step];\n }\n\n V jump(V s, V t, usize step) const {\n assert(s < (V)size());\n assert(t < (V)size());\n V uu{INVALID}, vv{INVALID};\n usize d{};\n for (auto [u, v] : decomp(s, t)) {\n usize dist{std::max(dep_[u], dep_[v]) - std::min(dep_[u], dep_[v])};\n if (dist >= step) {\n uu = u;\n vv = v;\n d = dist;\n break;\n }\n step -= dist + 1;\n }\n if (uu == INVALID) return INVALID;\n if (dep_[uu] <= dep_[vv]) {\n return inv_[idx_[uu] + step];\n }\n else {\n return inv_[idx_[vv] + (d - step)];\n }\n }\n\n usize distance(V s, V t) const {\n assert(s < (V)size());\n assert(t < (V)size());\n usize res{};\n for (auto [u, v] : decomp(s, t)) {\n if (dep_[u] > dep_[v]) std::swap(u, v);\n res += dep_[v] - dep_[u];\n }\n return res;\n }\n\nprivate:\n static constexpr V INVALID{static_cast<V>(-1)};\n usize n_{};\n std::vector<V> par_{}, top_{}, idx_{}, inv_{};\n std::vector<usize> size_{}, dep_{};\n};\n\n} // namespace zawa\n\n#include <unordered_set>\nusing namespace zawa;\n\nRollingHashMonoidData::Value RollingHashMonoidData::base{\n RollingHashMonoidData::randomValue(26)\n};\n\nint main() {\n SetFastIO();\n int N;\n std::cin >> N;\n std::vector<char> K(N);\n for (auto& k : K) std::cin >> k;\n std::vector<std::vector<int>> T(N);\n for (int i{} ; i < N - 1 ; i++) {\n int u, v;\n std::cin >> u >> v;\n u--; v--;\n T[u].push_back(v);\n T[v].push_back(u);\n }\n HeavyLightDecomposition hld{T};\n std::vector<RollingHashMonoidData> init(N), tini(N);\n for (int i{} ; i < N ; i++) {\n init[hld[i]] = tini[N - hld[i] - 1] = RollingHashMonoidData{K[i]};\n }\n SegmentTree<RollingHashMonoid> seg{init}, ges{tini};\n int Q;\n std::cin >> Q;\n std::unordered_set<RollingHashMonoidData::Value> set;\n while (Q--) {\n int t;\n std::cin >> t;\n if (t == 1) {\n int s, t;\n std::cin >> s >> t;\n s--; t--;\n RollingHashMonoidData res{};\n for (auto [u, v] : hld(s, t)) {\n u = hld[u];\n v = hld[v];\n if (u <= v) res = RollingHashMonoid::operation(res, seg.product(u, v + 1));\n else res = RollingHashMonoid::operation(res, ges.product(N - u - 1, N - v));\n }\n set.insert(res.hash);\n std::cout << set.size() << '\\n';\n }\n else if (t == 2) {\n int k;\n char c;\n std::cin >> k >> c;\n k--;\n seg.set(hld[k], RollingHashMonoidData{c});\n ges.set(N - hld[k] - 1, RollingHashMonoidData{c});\n }\n else {\n assert(false);\n }\n }\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 42588, "score_of_the_acc": -0.2357, "final_rank": 8 }, { "submission_id": "aoj_0478_10232862", "code_snippet": "// AOJ #478 Tree Keyboard\n// 2025.2.19\n\n#include <bits/stdc++.h>\nusing namespace std;\n \ntypedef long long ll;\n \nconst ll MOD1 = 1000000007LL;\nconst ll MOD2 = 1000000009LL;\nconst ll BASE = 137;\n \nconst int MAXN = 100000;\n \nvector<ll> pow1, pow2;\n \nstruct SegNode {\n int len;\n pair<ll,ll> hash;\n pair<ll,ll> revHash;\n};\n \nSegNode make_identity() {\n SegNode node;\n node.len = 0;\n node.hash = {0, 0};\n node.revHash = {0, 0};\n return node;\n}\n \nSegNode make_leaf(int val) {\n SegNode node;\n node.len = 1;\n node.hash = {val, val};\n node.revHash = {val, val};\n return node;\n}\n \nSegNode combineNode(const SegNode &L, const SegNode &R) {\n if(L.len == 0) return R;\n if(R.len == 0) return L;\n SegNode res;\n res.len = L.len + R.len;\n res.hash.first = (L.hash.first * pow1[R.len] % MOD1 + R.hash.first) % MOD1;\n res.hash.second = (L.hash.second * pow2[R.len] % MOD2 + R.hash.second) % MOD2;\n res.revHash.first = (R.revHash.first * pow1[L.len] % MOD1 + L.revHash.first) % MOD1;\n res.revHash.second = (R.revHash.second * pow2[L.len] % MOD2 + L.revHash.second) % MOD2;\n return res;\n}\n \nSegNode reverseNode(const SegNode &node) {\n SegNode res = node;\n swap(res.hash, res.revHash);\n return res;\n}\n \nstruct SegTree {\n int n;\n vector<SegNode> tree;\n SegTree(int n) : n(n) {\n tree.resize(4*n);\n }\n void build(vector<int> &arr, int idx, int l, int r) {\n if(l == r) {\n tree[idx] = make_leaf(arr[l]);\n return;\n }\n int mid = (l + r) / 2;\n build(arr, idx*2, l, mid);\n build(arr, idx*2+1, mid+1, r);\n tree[idx] = combineNode(tree[idx*2], tree[idx*2+1]);\n }\n void update(int idx, int l, int r, int pos, int val) {\n if(l == r) {\n tree[idx] = make_leaf(val);\n return;\n }\n int mid = (l + r) / 2;\n if(pos <= mid)\n update(idx*2, l, mid, pos, val);\n else\n update(idx*2+1, mid+1, r, pos, val);\n tree[idx] = combineNode(tree[idx*2], tree[idx*2+1]);\n }\n SegNode query(int idx, int l, int r, int ql, int qr) {\n if(ql > r || qr < l) return make_identity();\n if(ql <= l && r <= qr) return tree[idx];\n int mid = (l + r) / 2;\n SegNode leftNode = query(idx*2, l, mid, ql, qr);\n SegNode rightNode = query(idx*2+1, mid+1, r, ql, qr);\n return combineNode(leftNode, rightNode);\n }\n};\n \nint N;\nvector<vector<int>> adj;\nvector<char> letter;\nvector<int> parent, depth, heavy, head, pos;\n \nint dfs(int v, int p) {\n parent[v] = p;\n depth[v] = (p == -1 ? 0 : depth[p] + 1);\n int size = 1;\n int maxSize = 0;\n heavy[v] = -1;\n for (int u : adj[v]) {\n if(u == p) continue;\n int subSize = dfs(u, v);\n if(subSize > maxSize) {\n maxSize = subSize;\n heavy[v] = u;\n }\n size += subSize;\n }\n return size;\n}\n \nint curPos = 0;\nvoid decompose(int v, int h) {\n head[v] = h;\n pos[v] = curPos++;\n if(heavy[v] != -1) decompose(heavy[v], h);\n for (int u : adj[v]) {\n if(u == parent[v] || u == heavy[v]) continue;\n decompose(u, u);\n }\n}\n \nint LOGN;\nvector<vector<int>> up;\n \nvoid buildLCA() {\n LOGN = 0;\n while((1 << LOGN) <= N) LOGN++;\n up.assign(LOGN, vector<int>(N+1, -1));\n for (int v = 1; v <= N; v++)\n up[0][v] = (parent[v] == -1 ? v : parent[v]);\n for (int k = 1; k < LOGN; k++) {\n for (int v = 1; v <= N; v++)\n up[k][v] = up[k-1][ up[k-1][v] ];\n }\n}\n \nint LCA(int a, int b) {\n if(depth[a] < depth[b])\n swap(a, b);\n int d = depth[a] - depth[b];\n for(int k = 0; k < LOGN; k++){\n if(d & (1 << k)) a = up[k][a];\n }\n if(a == b) return a;\n for(int k = LOGN-1; k >= 0; k--){\n if(up[k][a] != up[k][b]){\n a = up[k][a];\n b = up[k][b];\n }\n }\n return parent[a];\n}\n \nSegNode queryUp(int u, int v, SegTree &segTree) {\n SegNode res = make_identity();\n while(head[u] != head[v]) {\n SegNode cur = segTree.query(1, 0, N-1, pos[head[u]], pos[u]);\n cur = reverseNode(cur);\n res = combineNode(res, cur);\n u = parent[head[u]];\n }\n SegNode cur = segTree.query(1, 0, N-1, pos[v], pos[u]);\n cur = reverseNode(cur);\n res = combineNode(res, cur);\n return res;\n}\n \nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n \n cin >> N;\n letter.resize(N+1);\n for (int i = 1; i <= N; i++) cin >> letter[i];\n adj.assign(N+1, vector<int>());\n for (int i = 1; i < N; i++){\n int u, v;\n cin >> u >> v;\n adj[u].push_back(v);\n adj[v].push_back(u);\n }\n \n parent.resize(N+1);\n depth.resize(N+1);\n heavy.resize(N+1);\n head.resize(N+1);\n pos.resize(N+1);\n \n dfs(1, -1);\n curPos = 0;\n decompose(1, 1);\n buildLCA();\n \n int maxPow = N + 5;\n pow1.resize(maxPow); pow2.resize(maxPow);\n pow1[0] = 1; pow2[0] = 1;\n for (int i = 1; i < maxPow; i++){\n pow1[i] = (pow1[i-1] * BASE) % MOD1;\n pow2[i] = (pow2[i-1] * BASE) % MOD2;\n }\n \n vector<int> baseArr(N);\n for (int v = 1; v <= N; v++) baseArr[pos[v]] = letter[v] - 'a' + 1;\n \n SegTree segTree(N);\n segTree.build(baseArr, 1, 0, N-1);\n \n unordered_set<ll> seen;\n seen.reserve(2e5);\n \n int Q;\n cin >> Q;\n for (int qi = 0; qi < Q; qi++){\n int type;\n cin >> type;\n if(type == 1) {\n int s, tnode;\n cin >> s >> tnode;\n int l = LCA(s, tnode);\n SegNode part1 = queryUp(s, l, segTree);\n SegNode part2 = queryUp(tnode, l, segTree);\n SegNode part2Forward = reverseNode(part2);\n if(part2Forward.len > 0) {\n int ltrVal = letter[l] - 'a' + 1;\n ll newHash1 = (part2Forward.hash.first - ltrVal * pow1[part2Forward.len - 1]) % MOD1;\n if(newHash1 < 0) newHash1 += MOD1;\n ll newHash2 = (part2Forward.hash.second - ltrVal * pow2[part2Forward.len - 1]) % MOD2;\n if(newHash2 < 0) newHash2 += MOD2;\n SegNode part2Trim;\n part2Trim.len = part2Forward.len - 1;\n part2Trim.hash = {newHash1, newHash2};\n static ll invBase1 = 0, invBase2 = 0;\n if(invBase1 == 0){\n auto modExp = [&](ll base, ll exp, ll mod) -> ll {\n ll result = 1;\n base %= mod;\n while(exp > 0){\n if(exp & 1) result = (result * base) % mod;\n base = (base * base) % mod;\n exp >>= 1;\n }\n return result;\n };\n invBase1 = modExp(BASE, MOD1-2, MOD1);\n invBase2 = modExp(BASE, MOD2-2, MOD2);\n }\n ll rtemp1 = (part2Forward.revHash.first - ltrVal) % MOD1;\n if(rtemp1 < 0) rtemp1 += MOD1;\n ll rtemp2 = (part2Forward.revHash.second - ltrVal) % MOD2;\n if(rtemp2 < 0) rtemp2 += MOD2;\n ll newRev1 = (rtemp1 * invBase1) % MOD1;\n ll newRev2 = (rtemp2 * invBase2) % MOD2;\n part2Trim.revHash = {newRev1, newRev2};\n \n SegNode finalNode = combineNode(part1, part2Trim);\n ll key = ((finalNode.hash.second & 0xffffffffLL) << 32) | (finalNode.hash.first & 0xffffffffLL);\n seen.insert(key);\n } else {\n SegNode finalNode = part1;\n ll key = ((finalNode.hash.second & 0xffffffffLL) << 32) | (finalNode.hash.first & 0xffffffffLL);\n seen.insert(key);\n }\n cout << seen.size() << endl;\n } else if(type == 2) {\n int k; char c;\n cin >> k >> c;\n letter[k] = c;\n int val = c - 'a' + 1;\n segTree.update(1, 0, N-1, pos[k], val);\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 230, "memory_kb": 47444, "score_of_the_acc": -0.4217, "final_rank": 14 }, { "submission_id": "aoj_0478_9955019", "code_snippet": "#line 1 \"0478.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/0478\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/TypeAlias.hpp\"\n\n#include <cstdint>\n#include <cstddef>\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#include <iostream>\n#include <iomanip>\n\nnamespace zawa {\n\nvoid SetFastIO() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n}\n\nvoid SetPrecision(u32 dig) {\n std::cout << std::fixed << std::setprecision(dig);\n}\n\n} // namespace zawa\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Algebra/Monoid/RollingHashMonoid.hpp\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Number/Mersenne61ModInt.hpp\"\n\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Number/Mersenne61ModInt.hpp\"\n\nnamespace zawa {\n\n// @reference: https://qiita.com/keymoon/items/11fac5627672a6d6a9f6\nclass Mersenne61ModInt {\npublic:\n using Value = u64;\nprivate:\n static constexpr Value MOD{(1ull << 61) - 1}; // == MASK61\n static constexpr Value MASK30{(1ull << 30) - 1};\n static constexpr Value MASK31{(1ull << 31) - 1};\n Value v_{};\npublic:\n constexpr Mersenne61ModInt() {}\n\n static constexpr Value Mod() noexcept {\n return MOD;\n }\n static constexpr Value Modulo(const Value& v) noexcept {\n Value res{(v >> 61) + (v & MOD)};\n res = (res >= MOD ? res - MOD : res);\n return res;\n }\n static constexpr Value UnsafeMul(const Value& a, const Value& b) noexcept {\n Value fa{a >> 31}, fb{b >> 31};\n Value ba{a & MASK31}, bb{b & MASK31};\n Value mid{fa * bb + fb * ba};\n return Value{2}*fa*fb + (mid >> 30) + ((mid & MASK30) << 31) + ba*bb;\n }\n static constexpr Value Mul(const Value& a, const Value& b) noexcept {\n return Modulo(UnsafeMul(a, b));\n }\n};\n\n};\n#line 5 \"/home/zawatin/compro/cp-documentation/Src/Algebra/Monoid/RollingHashMonoid.hpp\"\n\n#include <random>\n#include <type_traits>\n\nnamespace zawa {\n\nstruct RollingHashMonoidData {\n using Value = Mersenne61ModInt::Value;\n using Size = usize;\n static Value base;\n Value hash{}, pow{1};\n usize len{};\n\n constexpr RollingHashMonoidData() = default;\n constexpr RollingHashMonoidData(Value h, Value p, usize l) : hash{h}, pow{p}, len{l} {}\n template <class T>\n constexpr RollingHashMonoidData(const T& v) \n : hash{static_cast<Value>(v)}, pow{base}, len{1} {}\n // RollingHashMonoidData(const RollingHashMonoidData& data)\n // : hash{data.hash}, pow{data.pow}, len{data.len} {}\n \n static Value randomValue(const Value& sigma) {\n return std::mt19937{std::random_device{}()}() % (Mersenne61ModInt::Mod() - sigma) + sigma + 1;\n }\n\n friend constexpr bool operator==(const RollingHashMonoidData& lhs, const RollingHashMonoidData& rhs) {\n return lhs.hash == rhs.hash and lhs.len == rhs.len;\n }\n friend constexpr bool operator!=(const RollingHashMonoidData& lhs, const RollingHashMonoidData& rhs) {\n return lhs.hash != rhs.hash or lhs.len != rhs.len;\n }\n};\n\nstruct RollingHashMonoid {\n using Modulo = Mersenne61ModInt;\n using Element = RollingHashMonoidData;\n static constexpr Element identity() noexcept {\n return Element{};\n }\n static constexpr Element operation(const Element& lhs, const Element& rhs) noexcept {\n return Element{\n Modulo::Modulo(Modulo::UnsafeMul(lhs.hash, rhs.pow) + rhs.hash),\n Modulo::Mul(lhs.pow, rhs.pow),\n lhs.len + rhs.len\n };\n }\n};\n\n} // namespace zawa\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/DataStructure/SegmentTree/SegmentTree.hpp\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Algebra/Monoid/MonoidConcept.hpp\"\n\n#include <concepts>\n\nnamespace zawa {\n\nnamespace Concept {\n\ntemplate <class T>\nconcept Monoid = requires {\n typename T::Element;\n { T::identity() } -> std::same_as<typename T::Element>;\n { T::operation(std::declval<typename T::Element>(), std::declval<typename T::Element>()) } -> std::same_as<typename T::Element>;\n};\n\n} // namespace\n\n} // namespace zawa\n#line 5 \"/home/zawatin/compro/cp-documentation/Src/DataStructure/SegmentTree/SegmentTree.hpp\"\n\n#include <vector>\n#include <cassert>\n#include <functional>\n#line 10 \"/home/zawatin/compro/cp-documentation/Src/DataStructure/SegmentTree/SegmentTree.hpp\"\n#include <ostream>\n\nnamespace zawa {\n\ntemplate <Concept::Monoid Monoid>\nclass SegmentTree {\npublic:\n using Value = typename Monoid::Element;\nprivate:\n constexpr u32 left(u32 v) const {\n return v << 1;\n }\n constexpr u32 right(u32 v) const {\n return v << 1 | 1;\n }\n constexpr u32 parent(u32 v) const {\n return v >> 1;\n }\n\n usize n_;\n std::vector<Value> dat_;\n\npublic:\n SegmentTree() = default;\n SegmentTree(u32 n) : n_{ n }, dat_(n << 1, Monoid::identity()) {\n assert(n_);\n }\n SegmentTree(const std::vector<Value>& dat) : n_{ dat.size() }, dat_(dat.size() << 1, Monoid::identity()) {\n assert(n_);\n for (u32 i{} ; i < n_ ; i++) {\n dat_[i + n_] = dat[i];\n }\n for (u32 i{static_cast<u32>(n_) - 1} ; i ; i--) {\n dat_[i] = Monoid::operation(dat_[left(i)], dat_[right(i)]);\n }\n }\n\n Value get(u32 i) const {\n assert(i < n_);\n return dat_[i + n_];\n }\n\n void set(u32 i, const Value& value) {\n assert(i < n_);\n i += n_;\n dat_[i] = value;\n while (i = parent(i), i) {\n dat_[i] = Monoid::operation(dat_[left(i)], dat_[right(i)]);\n }\n }\n\n Value product(u32 l, u32 r) const {\n assert(l <= r and r <= n_);\n Value leftValue{ Monoid::identity() }, rightValue{ Monoid::identity() };\n for (l += n_, r += n_ ; l < r ; l = parent(l), r = parent(r)) {\n if (l & 1) {\n leftValue = Monoid::operation(leftValue, dat_[l++]);\n }\n if (r & 1) {\n rightValue = Monoid::operation(dat_[--r], rightValue);\n }\n }\n return Monoid::operation(leftValue, rightValue);\n }\n\n template <class Function>\n u32 maxRight(u32 l, const Function& f) {\n assert(l < n_);\n static_assert(std::is_convertible_v<decltype(f), std::function<bool(Value)>>, \"maxRight's argument f must be function bool(T)\");\n assert(f(Monoid::identity()));\n u32 res{l}, width{1};\n Value prod{ Monoid::identity() };\n // 現在の見ている頂点の幅をwidthで持つ\n // 境界がある頂点を含む部分木の根を探す\n // (折り返す時は必要以上の幅を持つ根になるが、widthを持っているのでオーバーしない)\n for (l += n_ ; res + width <= n_ ; l = parent(l), width <<= 1) if (l & 1) {\n if (not f(Monoid::operation(prod, dat_[l]))) break; \n res += width;\n prod = Monoid::operation(prod, dat_[l++]);\n }\n // 根から下って、境界を発見する\n while (l = left(l), width >>= 1) {\n if (res + width <= n_ and f(Monoid::operation(prod, dat_[l]))) {\n res += width;\n prod = Monoid::operation(prod, dat_[l++]);\n } \n }\n return res;\n }\n\n template <class Function>\n u32 minLeft(u32 r, const Function& f) const {\n assert(r <= n_);\n static_assert(std::is_convertible_v<decltype(f), std::function<bool(Value)>>, \"minLeft's argument f must be function bool(T)\");\n assert(f(Monoid::identity()));\n u32 res{r}, width{1};\n Value prod{ Monoid::identity() };\n for (r += n_ ; res >= width ; r = parent(r), width <<= 1) if (r & 1) {\n if (not f(Monoid::operation(dat_[r - 1], prod))) break;\n res -= width;\n prod = Monoid::operation(prod, dat_[--r]);\n }\n while (r = left(r), width >>= 1) {\n if (res >= width and f(Monoid::operation(dat_[r - 1], prod))) {\n res -= width;\n prod = Monoid::operation(dat_[--r], prod);\n }\n }\n return res;\n }\n\n friend std::ostream& operator<<(std::ostream& os, const SegmentTree& st) {\n for (u32 i{1} ; i < 2 * st.n_ ; i++) {\n os << st.dat_[i] << (i + 1 == 2 * st.n_ ? \"\" : \" \");\n }\n return os;\n }\n};\n\n} // namespace zawa\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Graph/Tree/HeavyLightDecomposition.hpp\"\n\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Graph/Tree/HeavyLightDecomposition.hpp\"\n\n#include <algorithm>\n#line 7 \"/home/zawatin/compro/cp-documentation/Src/Graph/Tree/HeavyLightDecomposition.hpp\"\n#include <cmath>\n#include <limits>\n#include <utility>\n#line 11 \"/home/zawatin/compro/cp-documentation/Src/Graph/Tree/HeavyLightDecomposition.hpp\"\n\nnamespace zawa {\n\ntemplate <class V>\nclass HeavyLightDecomposition {\npublic:\n\n static constexpr V Invalid() noexcept {\n return INVALID;\n }\n\n HeavyLightDecomposition() = default;\n\n HeavyLightDecomposition(std::vector<std::vector<V>> T, V root = 0u) \n : n_{T.size()}, par_(n_), top_(n_), idx_(n_), \n inv_(n_), size_(n_, usize{1}), dep_(n_) {\n\n auto dfs1{[&](auto dfs, V v, V p, usize d) -> usize {\n par_[v] = p;\n dep_[v] = d;\n if (p != INVALID) {\n for (u32 i{} ; i + 1 < T[v].size() ; i++) if (T[v][i] == p) {\n std::swap(T[v][i], T[v].back());\n break;\n }\n assert(T[v].back() == p);\n T[v].pop_back();\n }\n for (V x : T[v]) {\n size_[v] += dfs(dfs, x, v, d + 1);\n }\n for (u32 i{1} ; i < T[v].size() ; i++) if (size_[T[v][0]] < size_[T[v][i]]) {\n std::swap(T[v][0], T[v][i]);\n }\n return size_[v];\n }};\n\n auto dfs2{[&](auto dfs, V v, V idx, V top) -> V {\n idx_[v] = idx++;\n inv_[idx_[v]] = v;\n top_[v] = top;\n if (T[v].size()) {\n idx = dfs(dfs, T[v][0], idx, top);\n for (u32 i{1} ; i < T[v].size() ; i++) {\n idx = dfs(dfs, T[v][i], idx, T[v][i]);\n }\n }\n return idx;\n }};\n\n dfs1(dfs1, root, INVALID, 0u);\n dfs2(dfs2, root, 0u, root);\n }\n\n inline usize size() const noexcept {\n return n_;\n }\n\n usize size(V v) const noexcept {\n assert(v < (V)size());\n return size_[v];\n }\n\n usize depth(V v) const noexcept {\n assert(v < (V)size());\n return dep_[v];\n }\n\n V parent(V v) const noexcept {\n assert(v < (V)size());\n return par_[v];\n }\n\n V index(V v) const noexcept {\n assert(v < (V)size());\n return idx_[v];\n }\n\n V operator[](V v) const noexcept {\n assert(v < (V)size());\n return idx_[v];\n }\n\n std::vector<std::pair<V, V>> decomp(V s, V t) const {\n assert(s < (V)size());\n assert(t < (V)size());\n std::vector<std::pair<V, V>> res, ser;\n while (top_[s] != top_[t]) {\n if (dep_[top_[s]] >= dep_[top_[t]]) {\n res.emplace_back(s, top_[s]);\n s = top_[s];\n if (par_[s] != INVALID) s = par_[s];\n }\n else {\n ser.emplace_back(top_[t], t);\n t = top_[t];\n if (par_[t] != INVALID) t = par_[t];\n }\n }\n res.emplace_back(s, t);\n std::reverse(ser.begin(), ser.end());\n res.insert(res.end(), ser.begin(), ser.end()); \n return res;\n }\n\n std::vector<std::pair<V, V>> operator()(V s, V t) const {\n return decomp(s, t);\n }\n\n V lca(V u, V v) const {\n assert(u < (V)size());\n assert(v < (V)size());\n while (top_[u] != top_[v]) {\n if (dep_[top_[u]] >= dep_[top_[v]]) {\n u = top_[u];\n if (par_[u] != INVALID) u = par_[u];\n }\n else {\n v = top_[v];\n if (par_[v] != INVALID) v = par_[v];\n }\n }\n return (dep_[u] <= dep_[v] ? u : v);\n }\n\n // pはvの祖先か？\n bool isAncestor(V v, V p) {\n assert(v < size());\n assert(p < size());\n if (dep_[v] < dep_[p]) return false;\n while (v != INVALID and top_[v] != top_[p]) {\n v = par_[top_[v]];\n }\n return v != INVALID;\n }\n\n V levelAncestor(V v, usize step) const {\n assert(v < (V)size());\n if (step > dep_[v]) return INVALID;\n while (true) {\n usize dist{dep_[v] - dep_[top_[v]]};\n if (dist >= step) break;\n step -= dist + 1;\n v = par_[top_[v]];\n }\n step = (dep_[v] - dep_[top_[v]]) - step;\n return inv_[idx_[top_[v]] + step];\n }\n\n V jump(V s, V t, usize step) const {\n assert(s < (V)size());\n assert(t < (V)size());\n V uu{INVALID}, vv{INVALID};\n usize d{};\n for (auto [u, v] : decomp(s, t)) {\n usize dist{std::max(dep_[u], dep_[v]) - std::min(dep_[u], dep_[v])};\n if (dist >= step) {\n uu = u;\n vv = v;\n d = dist;\n break;\n }\n step -= dist + 1;\n }\n if (uu == INVALID) return INVALID;\n if (dep_[uu] <= dep_[vv]) {\n return inv_[idx_[uu] + step];\n }\n else {\n return inv_[idx_[vv] + (d - step)];\n }\n }\n\n usize distance(V s, V t) const {\n assert(s < (V)size());\n assert(t < (V)size());\n usize res{};\n for (auto [u, v] : decomp(s, t)) {\n if (dep_[u] > dep_[v]) std::swap(u, v);\n res += dep_[v] - dep_[u];\n }\n return res;\n }\n\nprivate:\n static constexpr V INVALID{static_cast<V>(-1)};\n usize n_{};\n std::vector<V> par_{}, top_{}, idx_{}, inv_{};\n std::vector<usize> size_{}, dep_{};\n};\n\n} // namespace zawa\n#line 7 \"0478.test.cpp\"\n\n#line 11 \"0478.test.cpp\"\n#include <unordered_set>\nusing namespace zawa;\n\nRollingHashMonoidData::Value RollingHashMonoidData::base{\n RollingHashMonoidData::randomValue(26)\n};\n\nint main() {\n SetFastIO();\n int N;\n std::cin >> N;\n std::vector<char> K(N);\n for (auto& k : K) std::cin >> k;\n std::vector<std::vector<int>> T(N);\n for (int i{} ; i < N - 1 ; i++) {\n int u, v;\n std::cin >> u >> v;\n u--; v--;\n T[u].push_back(v);\n T[v].push_back(u);\n }\n HeavyLightDecomposition hld{T};\n std::vector<RollingHashMonoidData> init(N), tini(N);\n for (int i{} ; i < N ; i++) {\n init[hld[i]] = tini[N - hld[i] - 1] = RollingHashMonoidData{K[i]};\n }\n SegmentTree<RollingHashMonoid> seg{init}, ges{tini};\n int Q;\n std::cin >> Q;\n std::unordered_set<RollingHashMonoidData::Value> set;\n while (Q--) {\n int t;\n std::cin >> t;\n if (t == 1) {\n int s, t;\n std::cin >> s >> t;\n s--; t--;\n RollingHashMonoidData res{};\n for (auto [u, v] : hld(s, t)) {\n u = hld[u];\n v = hld[v];\n if (u <= v) res = RollingHashMonoid::operation(res, seg.product(u, v + 1));\n else res = RollingHashMonoid::operation(res, ges.product(N - u - 1, N - v));\n }\n set.insert(res.hash);\n std::cout << set.size() << '\\n';\n }\n else if (t == 2) {\n int k;\n char c;\n std::cin >> k >> c;\n k--;\n seg.set(hld[k], RollingHashMonoidData{c});\n ges.set(N - hld[k] - 1, RollingHashMonoidData{c});\n }\n else {\n assert(false);\n }\n }\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 42592, "score_of_the_acc": -0.2432, "final_rank": 10 }, { "submission_id": "aoj_0478_9661452", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nvector<ll> mod = {(ll)998244353,(ll)1000000007,(ll)1000000009,(ll)1000000021,(ll)1000000033};\nll power(ll a,ll b,ll m){\n ll res = 1;\n while(b>0){\n if(b%2==0){\n b/=2;\n a*=a;\n a%=m;\n }else{\n b--;\n res*=a;\n res%=m;\n }\n }\n return res;\n}\nstruct segtree{\n int n;\n vector<ll> node;\n segtree(int N){\n n = 1;\n while(n<N) n*=2;\n node.resize(2*n-1);\n }\n void update(int a,ll x,ll m){\n int i = a+n-1;\n node[i] = x;\n while(i>0){\n i = (i-1)/2;\n node[i] = (node[i*2+1]+node[i*2+2])%m;\n }\n }\n ll find(int a,int b,ll m,int k=0,int l=0,int r=-1){\n if(r<0) r = n;\n if(b<=l||r<=a) return 0;\n if(a<=l&&r<=b) return node[k];\n ll vl = find(a,b,m,k*2+1,l,(l+r)/2);\n ll vr = find(a,b,m,k*2+2,(l+r)/2,r);\n return (vl+vr)%m;\n }\n};\nint main(){\n int N;\n cin >> N;\n mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());\n uniform_int_distribution<ll> rand(1, mod[0] - 1);\n uniform_int_distribution<ll> rand1(1, mod[1] - 1);\n uniform_int_distribution<ll> rand2(1, mod[2] - 1);\n uniform_int_distribution<ll> rand3(1, mod[3] - 1);\n uniform_int_distribution<ll> rand4(1, mod[4] - 1);\n vector<ll> base = {rand(mt),rand1(mt),rand2(mt),rand3(mt),rand4(mt)};\n vector<vector<ll>> x(5,vector<ll>(N));\n for(int i=0;i<5;i++) x[i][0] = 1;\n for(int i=0;i<5;i++){\n for(int j=1;j<N;j++){\n x[i][j] = (x[i][j-1]*base[i])%mod[i];\n }\n }\n vector<vector<ll>> px(5,vector<ll>(N));\n for(int i=0;i<5;i++) px[i][0] = 1;\n for(int i=0;i<5;i++){\n for(int j=1;j<N;j++){\n px[i][j] = (px[i][j-1]*power(base[i],mod[i]-2,mod[i]))%mod[i];\n }\n }\n vector<vector<int>> G(N);\n vector<ll> cha(N);\n for(int i=0;i<N;i++){\n char k;\n cin >> k;\n cha[i] = k-'a'+1;\n }\n for(int i=0;i<N-1;i++){\n int u,v;\n cin >> u >> v;\n u--;\n v--;\n G[u].push_back(v);\n G[v].push_back(u);\n }\n vector<int> inv(N);\n vector<int> outv(N);\n vector<ll> depth(N);\n vector<ll> revdepth(N);\n vector<int> parent(N);\n depth[0] = 0;\n parent[0] = -1;\n int num = 0;\n auto dfs = [&](auto dfs,int u,int p)->void{\n inv[u] = num++;\n for(auto v:G[u]){\n if(v==p) continue;\n depth[v] = depth[u]+1;\n parent[v] = u;\n dfs(dfs,v,u);\n }\n outv[u] = num++;\n };\n dfs(dfs,0,-1);\n for(int i=0;i<N;i++){\n revdepth[i] = N-depth[i]-1;\n }\n vector<segtree> seg(5,2*N);\n vector<segtree> seg1(5,2*N);\n for(int i=0;i<5;i++){\n for(int j=0;j<N;j++){\n seg[i].update(inv[j],((cha[j])*x[i][depth[j]])%mod[i],mod[i]);\n seg[i].update(outv[j],mod[i]-((cha[j])*x[i][depth[j]])%mod[i],mod[i]);\n seg1[i].update(inv[j],((cha[j])*x[i][revdepth[j]])%mod[i],mod[i]);\n seg1[i].update(outv[j],mod[i]-((cha[j])*x[i][revdepth[j]])%mod[i],mod[i]);\n }\n }\n vector<vector<int>> table(20,vector<int>(N));\n table[0] = parent;\n for(int i=0;i<19;i++){\n for(int j=0;j<N;j++){\n if(table[i][j]==-1) table[i+1][j] = -1;\n else table[i+1][j] = table[i][table[i][j]];\n }\n }\n auto calcLCA = [&](int a,int b)->int{\n if(depth[a]>depth[b]) swap(a,b);\n for(int i=19;i>=0;i--){\n int o = table[i][b];\n if(o==-1) continue;\n if(depth[o]>=depth[a]){\n b = o;\n }\n }\n if(a==b) return a;\n for(int i=19;i>=0;i--){\n int na = table[i][a];\n int nb = table[i][b];\n if(na!=nb){\n a = na;\n b = nb;\n }\n }\n return parent[b];\n };\n int Q;\n cin >> Q;\n set<vector<ll>> st;\n for(int i=0;i<Q;i++){\n int n;\n cin >> n;\n if(n==1){\n int s,t;\n cin >> s >> t;\n s--;\n t--;\n vector<ll> v;\n for(int j=0;j<5;j++){\n int lca = calcLCA(s,t);\n ll sl = seg1[j].find(inv[lca],inv[s]+1,mod[j])*(px[j][revdepth[s]]);\n sl %= mod[j];\n ll lt = seg[j].find(inv[lca],inv[t]+1,mod[j]);\n lt -= seg[j].find(inv[lca],inv[lca]+1,mod[j]);\n lt+=mod[j];\n lt %= mod[j];\n lt *= px[j][depth[lca]];\n lt %= mod[j];\n lt *= x[j][depth[s]-depth[lca]];\n lt %= mod[j];\n v.push_back((sl+lt)%mod[j]);\n }\n st.insert(v);\n cout << st.size() << endl;\n }else{\n int k;\n char c;\n cin >> k >> c;\n k--;\n cha[k] = c-'a'+1;\n for(int j=0;j<5;j++){\n seg[j].update(inv[k],((cha[k])*x[j][depth[k]])%mod[j],mod[j]);\n seg[j].update(outv[k],mod[j]-((cha[k])*x[j][depth[k]])%mod[j],mod[j]);\n seg1[j].update(inv[k],((cha[k])*x[j][revdepth[k]])%mod[j],mod[j]);\n seg1[j].update(outv[k],mod[j]-((cha[k])*x[j][revdepth[k]])%mod[j],mod[j]);\n }\n }\n }\n}", "accuracy": 1, "time_ms": 1430, "memory_kb": 92188, "score_of_the_acc": -2, "final_rank": 17 }, { "submission_id": "aoj_0478_9658367", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nll mod = 1000000007;\nll power(ll a,ll b){\n ll res = 1;\n while(b>0){\n if(b%2==0){\n b/=2;\n a*=a;\n a%=mod;\n }else{\n b--;\n res*=a;\n res%=mod;\n }\n }\n return res;\n}\nstruct segtree{\n int n;\n vector<ll> node;\n segtree(int N){\n n = 1;\n while(n<N) n*=2;\n node.resize(2*n-1);\n }\n void update(int a,int x){\n int i = a+n-1;\n node[i] = x;\n while(i>0){\n i = (i-1)/2;\n node[i] = (node[i*2+1]+node[i*2+2])%mod;\n }\n }\n ll find(int a,int b,int k=0,int l=0,int r=-1){\n if(r<0) r = n;\n if(b<=l||r<=a) return 0;\n if(a<=l&&r<=b) return node[k];\n ll vl = find(a,b,k*2+1,l,(l+r)/2);\n ll vr = find(a,b,k*2+2,(l+r)/2,r);\n return (vl+vr)%mod;\n }\n};\nint main(){\n int N;\n cin >> N;\n mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());\n uniform_int_distribution<ll> rand(1, mod - 1);\n ll base = rand(mt);\n vector<ll> x(N);\n x[0] = 1;\n for(int i=1;i<N;i++){\n x[i] = (x[i-1]*base)%mod;\n }\n vector<ll> px(N);\n px[0] = 1;\n for(int i=1;i<N;i++){\n px[i] = px[i-1]*power(base,mod-2);\n px[i] %= mod;\n }\n vector<vector<int>> G(N);\n vector<ll> cha(N);\n for(int i=0;i<N;i++){\n char k;\n cin >> k;\n cha[i] = k-'a'+1;\n }\n for(int i=0;i<N-1;i++){\n int u,v;\n cin >> u >> v;\n u--;\n v--;\n G[u].push_back(v);\n G[v].push_back(u);\n }\n vector<int> inv(N);\n vector<int> outv(N);\n vector<ll> depth(N);\n vector<ll> revdepth(N);\n vector<int> parent(N);\n depth[0] = 0;\n parent[0] = -1;\n int num = 0;\n auto dfs = [&](auto dfs,int u,int p)->void{\n inv[u] = num++;\n for(auto v:G[u]){\n if(v==p) continue;\n depth[v] = depth[u]+1;\n parent[v] = u;\n dfs(dfs,v,u);\n }\n outv[u] = num++;\n };\n dfs(dfs,0,-1);\n for(int i=0;i<N;i++){\n revdepth[i] = N-depth[i]-1;\n }\n segtree seg(2*N);\n segtree seg1(2*N);\n for(int i=0;i<N;i++){\n seg.update(inv[i],((cha[i])*x[depth[i]])%mod);\n seg.update(outv[i],mod-((cha[i])*x[depth[i]])%mod);\n seg1.update(inv[i],((cha[i])*x[revdepth[i]])%mod);\n seg1.update(outv[i],mod-((cha[i])*x[revdepth[i]])%mod);\n }\n vector<vector<int>> table(20,vector<int>(N));\n table[0] = parent;\n for(int i=0;i<19;i++){\n for(int j=0;j<N;j++){\n if(table[i][j]==-1) table[i+1][j] = -1;\n else table[i+1][j] = table[i][table[i][j]];\n }\n }\n auto calcLCA = [&](int a,int b)->int{\n if(depth[a]>depth[b]) swap(a,b);\n for(int i=19;i>=0;i--){\n int o = table[i][b];\n if(o==-1) continue;\n if(depth[o]>=depth[a]){\n b = o;\n }\n }\n if(a==b) return a;\n for(int i=19;i>=0;i--){\n int na = table[i][a];\n int nb = table[i][b];\n if(na!=nb){\n a = na;\n b = nb;\n }\n }\n return parent[b];\n };\n int Q;\n cin >> Q;\n int ans = 0;\n set<ll> st;\n for(int i=0;i<Q;i++){\n int n;\n cin >> n;\n if(n==1){\n int s,t;\n cin >> s >> t;\n s--;\n t--;\n int lca = calcLCA(s,t);\n ll sl = seg1.find(inv[lca],inv[s]+1)*(px[revdepth[s]]);\n sl %= mod;\n ll lt = seg.find(inv[lca],inv[t]+1);\n lt -= seg.find(inv[lca],inv[lca]+1);\n lt+=mod;\n lt %= mod;\n lt *= px[depth[lca]];\n lt %= mod;\n lt *= x[depth[s]-depth[lca]];\n lt %= mod;\n st.insert((sl+lt)%mod);\n cout << st.size() << endl;\n }else{\n int k;\n char c;\n cin >> k >> c;\n k--;\n cha[k] = c-'a'+1;\n seg.update(inv[k],((cha[k])*x[depth[k]])%mod);\n seg.update(outv[k],mod-((cha[k])*x[depth[k]])%mod);\n seg1.update(inv[k],((cha[k])*x[revdepth[k]])%mod);\n seg1.update(outv[k],mod-((cha[k])*x[revdepth[k]])%mod);\n }\n }\n}", "accuracy": 0.5882352941176471, "time_ms": 380, "memory_kb": 31992, "score_of_the_acc": -0.2947, "final_rank": 20 }, { "submission_id": "aoj_0478_9499047", "code_snippet": "#line 1 \"0478.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/0478\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Template/TypeAlias.hpp\"\n\n#include <cstdint>\n#include <cstddef>\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Template/IOSetting.hpp\"\n\n#include <iostream>\n#include <iomanip>\n\nnamespace zawa {\n\nvoid SetFastIO() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n}\n\nvoid SetPrecision(u32 dig) {\n std::cout << std::fixed << std::setprecision(dig);\n}\n\n} // namespace zawa\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Algebra/Monoid/RollingHashMonoid.hpp\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Number/Mersenne61ModInt.hpp\"\n\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Number/Mersenne61ModInt.hpp\"\n\nnamespace zawa {\n\n// @reference: https://qiita.com/keymoon/items/11fac5627672a6d6a9f6\nclass Mersenne61ModInt {\npublic:\n using Value = u64;\nprivate:\n static constexpr Value MOD{(1ull << 61) - 1}; // == MASK61\n static constexpr Value MASK30{(1ull << 30) - 1};\n static constexpr Value MASK31{(1ull << 31) - 1};\n Value v_{};\npublic:\n constexpr Mersenne61ModInt() {}\n\n static constexpr Value Mod() noexcept {\n return MOD;\n }\n static constexpr Value Modulo(const Value& v) noexcept {\n Value res{(v >> 61) + (v & MOD)};\n res = (res >= MOD ? res - MOD : res);\n return res;\n }\n static constexpr Value UnsafeMul(const Value& a, const Value& b) noexcept {\n Value fa{a >> 31}, fb{b >> 31};\n Value ba{a & MASK31}, bb{b & MASK31};\n Value mid{fa * bb + fb * ba};\n return Value{2}*fa*fb + (mid >> 30) + ((mid & MASK30) << 31) + ba*bb;\n }\n static constexpr Value Mul(const Value& a, const Value& b) noexcept {\n return Modulo(UnsafeMul(a, b));\n }\n};\n\n};\n#line 5 \"/home/zawatin/compro/cp-documentation/Src/Algebra/Monoid/RollingHashMonoid.hpp\"\n\n#include <random>\n#include <type_traits>\n\nnamespace zawa {\n\nstruct RollingHashMonoidData {\n using Value = Mersenne61ModInt::Value;\n using Size = usize;\n static Value base;\n Value hash{}, pow{1};\n usize len{};\n\n constexpr RollingHashMonoidData() = default;\n constexpr RollingHashMonoidData(Value h, Value p, usize l) : hash{h}, pow{p}, len{l} {}\n template <class T>\n constexpr RollingHashMonoidData(const T& v) \n : hash{static_cast<Value>(v)}, pow{base}, len{1} {}\n \n static Value randomValue(const Value& sigma) {\n return std::mt19937{std::random_device{}()}() % (Mersenne61ModInt::Mod() - sigma) + sigma + 1;\n }\n\n friend constexpr bool operator==(const RollingHashMonoidData& lhs, const RollingHashMonoidData& rhs) {\n return lhs.hash == rhs.hash and lhs.len == rhs.len;\n }\n friend constexpr bool operator!=(const RollingHashMonoidData& lhs, const RollingHashMonoidData& rhs) {\n return lhs.hash != rhs.hash or lhs.len != rhs.len;\n }\n};\n\nstruct RollingHashMonoid {\n using Modulo = Mersenne61ModInt;\n using Element = RollingHashMonoidData;\n static constexpr Element identity() noexcept {\n return Element{};\n }\n static constexpr Element operation(const Element& lhs, const Element& rhs) noexcept {\n return Element{\n Modulo::Modulo(Modulo::UnsafeMul(lhs.hash, rhs.pow) + rhs.hash),\n Modulo::Mul(lhs.pow, rhs.pow),\n lhs.len + rhs.len\n };\n }\n};\n\n} // namespace zawa\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/DataStructure/SegmentTree/SegmentTree.hpp\"\n\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/DataStructure/SegmentTree/SegmentTree.hpp\"\n\n#include <vector>\n#include <cassert>\n#include <functional>\n#line 9 \"/home/zawatin/compro/cp-documentation/Src/DataStructure/SegmentTree/SegmentTree.hpp\"\n#include <ostream>\n\nnamespace zawa {\n\ntemplate <class Monoid>\nclass SegmentTree {\npublic:\n using Value = typename Monoid::Element;\nprivate:\n constexpr u32 left(u32 v) const {\n return v << 1;\n }\n constexpr u32 right(u32 v) const {\n return v << 1 | 1;\n }\n constexpr u32 parent(u32 v) const {\n return v >> 1;\n }\n\n usize n_;\n std::vector<Value> dat_;\n\npublic:\n SegmentTree() = default;\n SegmentTree(u32 n) : n_{ n }, dat_(n << 1, Monoid::identity()) {\n assert(n_);\n }\n SegmentTree(const std::vector<Value>& dat) : n_{ dat.size() }, dat_(dat.size() << 1, Monoid::identity()) {\n assert(n_);\n for (u32 i{} ; i < n_ ; i++) {\n dat_[i + n_] = dat[i];\n }\n for (u32 i{static_cast<u32>(n_) - 1} ; i ; i--) {\n dat_[i] = Monoid::operation(dat_[left(i)], dat_[right(i)]);\n }\n }\n\n Value get(u32 i) const {\n assert(i < n_);\n return dat_[i + n_];\n }\n\n void set(u32 i, const Value& value) {\n assert(i < n_);\n i += n_;\n dat_[i] = value;\n while (i = parent(i), i) {\n dat_[i] = Monoid::operation(dat_[left(i)], dat_[right(i)]);\n }\n }\n\n Value product(u32 l, u32 r) const {\n assert(l < n_);\n assert(l <= r and r <= n_);\n Value leftValue{ Monoid::identity() }, rightValue{ Monoid::identity() };\n for (l += n_, r += n_ ; l < r ; l = parent(l), r = parent(r)) {\n if (l & 1) {\n leftValue = Monoid::operation(leftValue, dat_[l++]);\n }\n if (r & 1) {\n rightValue = Monoid::operation(dat_[--r], rightValue);\n }\n }\n return Monoid::operation(leftValue, rightValue);\n }\n\n template <class Function>\n u32 maxRight(u32 l, const Function& f) {\n assert(l < n_);\n static_assert(std::is_convertible_v<decltype(f), std::function<bool(Value)>>, \"maxRight's argument f must be function bool(T)\");\n assert(f(Monoid::identity()));\n u32 res{l}, width{1};\n Value prod{ Monoid::identity() };\n // 現在の見ている頂点の幅をwidthで持つ\n // 境界がある頂点を含む部分木の根を探す\n // (折り返す時は必要以上の幅を持つ根になるが、widthを持っているのでオーバーしない)\n for (l += n_ ; res + width <= n_ ; l = parent(l), width <<= 1) if (l & 1) {\n if (not f(Monoid::operation(prod, dat_[l]))) break; \n res += width;\n prod = Monoid::operation(prod, dat_[l++]);\n }\n // 根から下って、境界を発見する\n while (l = left(l), width >>= 1) {\n if (res + width <= n_ and f(Monoid::operation(prod, dat_[l]))) {\n res += width;\n prod = Monoid::operation(prod, dat_[l++]);\n } \n }\n return res;\n }\n\n template <class Function>\n u32 minLeft(u32 r, const Function& f) const {\n assert(r <= n_);\n static_assert(std::is_convertible_v<decltype(f), std::function<bool(Value)>>, \"minLeft's argument f must be function bool(T)\");\n assert(f(Monoid::identity()));\n u32 res{r}, width{1};\n Value prod{ Monoid::identity() };\n for (r += n_ ; res >= width ; r = parent(r), width <<= 1) if (r & 1) {\n if (not f(Monoid::operation(dat_[r - 1], prod))) break;\n res -= width;\n prod = Monoid::operation(prod, dat_[--r]);\n }\n while (r = left(r), width >>= 1) {\n if (res >= width and f(Monoid::operation(dat_[r - 1], prod))) {\n res -= width;\n prod = Monoid::operation(dat_[--r], prod);\n }\n }\n return res;\n }\n\n friend std::ostream& operator<<(std::ostream& os, const SegmentTree& st) {\n for (u32 i{1} ; i < 2 * st.n_ ; i++) {\n os << st.dat_[i] << (i + 1 == 2 * st.n_ ? \"\" : \" \");\n }\n return os;\n }\n};\n\n} // namespace zawa\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Graph/Tree/HeavyLightDecomposition.hpp\"\n\n#line 2 \"/home/zawatin/compro/cp-documentation/Src/Graph/Tree/Tree.hpp\"\n\n#line 4 \"/home/zawatin/compro/cp-documentation/Src/Graph/Tree/Tree.hpp\"\n\n#line 7 \"/home/zawatin/compro/cp-documentation/Src/Graph/Tree/Tree.hpp\"\n\nnamespace zawa {\n\nusing Tree = std::vector<std::vector<u32>>;\n\nvoid AddEdge(Tree& T, u32 u, u32 v) {\n assert(u < T.size());\n assert(v < T.size());\n T[u].emplace_back(v);\n T[v].emplace_back(u);\n}\n\nvoid AddDirectedEdge(Tree& T, u32 from, u32 to) {\n assert(from < T.size());\n assert(to < T.size());\n T[from].emplace_back(to);\n}\n\n} // namespace zawa\n#line 5 \"/home/zawatin/compro/cp-documentation/Src/Graph/Tree/HeavyLightDecomposition.hpp\"\n\n#include <algorithm>\n#line 8 \"/home/zawatin/compro/cp-documentation/Src/Graph/Tree/HeavyLightDecomposition.hpp\"\n#include <cmath>\n#include <limits>\n#include <utility>\n#line 12 \"/home/zawatin/compro/cp-documentation/Src/Graph/Tree/HeavyLightDecomposition.hpp\"\n\nnamespace zawa {\n\nclass HeavyLightDecomposition {\npublic:\n using Vertex = u32;\n\n static constexpr Vertex Invalid() noexcept {\n return INVALID;\n }\n\n HeavyLightDecomposition() = default;\n\n HeavyLightDecomposition(Tree T, Vertex root = 0u) \n : n_{T.size()}, par_(n_), top_(n_), idx_(n_), \n inv_(n_), size_(n_, usize{1}), dep_(n_) {\n\n auto dfs1{[&](auto dfs, Vertex v, Vertex p, usize d) -> usize {\n par_[v] = p;\n dep_[v] = d;\n if (p != INVALID) {\n for (u32 i{} ; i + 1 < T[v].size() ; i++) if (T[v][i] == p) {\n std::swap(T[v][i], T[v].back());\n break;\n }\n assert(T[v].back() == p);\n T[v].pop_back();\n }\n for (Vertex x : T[v]) {\n size_[v] += dfs(dfs, x, v, d + 1);\n }\n for (u32 i{1} ; i < T[v].size() ; i++) if (size_[T[v][0]] < size_[T[v][i]]) {\n std::swap(T[v][0], T[v][i]);\n }\n return size_[v];\n }};\n\n auto dfs2{[&](auto dfs, Vertex v, Vertex idx, Vertex top) -> Vertex {\n idx_[v] = idx++;\n inv_[idx_[v]] = v;\n top_[v] = top;\n if (T[v].size()) {\n idx = dfs(dfs, T[v][0], idx, top);\n for (u32 i{1} ; i < T[v].size() ; i++) {\n idx = dfs(dfs, T[v][i], idx, T[v][i]);\n }\n }\n return idx;\n }};\n\n dfs1(dfs1, root, INVALID, 0u);\n dfs2(dfs2, root, 0u, root);\n }\n\n inline usize size() const noexcept {\n return n_;\n }\n\n usize size(Vertex v) const noexcept {\n assert(v < size());\n return size_[v];\n }\n\n usize depth(Vertex v) const noexcept {\n assert(v < size());\n return dep_[v];\n }\n\n Vertex parent(Vertex v) const noexcept {\n assert(v < size());\n return par_[v];\n }\n\n Vertex index(Vertex v) const noexcept {\n assert(v < size());\n return idx_[v];\n }\n\n Vertex operator[](Vertex v) const noexcept {\n assert(v < size());\n return idx_[v];\n }\n\n\n std::vector<std::pair<Vertex, Vertex>> decomp(Vertex s, Vertex t) const {\n assert(s < size());\n assert(t < size());\n std::vector<std::pair<Vertex, Vertex>> res, ser;\n while (top_[s] != top_[t]) {\n if (dep_[top_[s]] >= dep_[top_[t]]) {\n res.emplace_back(s, top_[s]);\n s = top_[s];\n if (par_[s] != INVALID) s = par_[s];\n }\n else {\n ser.emplace_back(top_[t], t);\n t = top_[t];\n if (par_[t] != INVALID) t = par_[t];\n }\n }\n res.emplace_back(s, t);\n std::reverse(ser.begin(), ser.end());\n res.insert(res.end(), ser.begin(), ser.end()); \n return res;\n }\n\n std::vector<std::pair<Vertex, Vertex>> operator()(Vertex s, Vertex t) const {\n return decomp(s, t);\n }\n\n Vertex lca(u32 u, u32 v) const {\n assert(u < size());\n assert(v < size());\n while (top_[u] != top_[v]) {\n if (dep_[top_[u]] >= dep_[top_[v]]) {\n u = top_[u];\n if (par_[u] != INVALID) u = par_[u];\n }\n else {\n v = top_[v];\n if (par_[v] != INVALID) v = par_[v];\n }\n }\n return (dep_[u] <= dep_[v] ? u : v);\n }\n\n // pはvの祖先か？\n bool isAncestor(Vertex v, Vertex p) {\n assert(v < size());\n assert(p < size());\n if (dep_[v] < dep_[p]) return false;\n while (v != INVALID and top_[v] != top_[p]) {\n v = par_[top_[v]];\n }\n return v != INVALID;\n }\n\n Vertex levelAncestor(Vertex v, usize step) const {\n assert(v < size());\n if (step > dep_[v]) return INVALID;\n while (true) {\n usize dist{dep_[v] - dep_[top_[v]]};\n if (dist >= step) break;\n step -= dist + 1;\n v = par_[top_[v]];\n }\n step = (dep_[v] - dep_[top_[v]]) - step;\n return inv_[idx_[top_[v]] + step];\n }\n\n Vertex jump(Vertex s, Vertex t, usize step) const {\n assert(s < size());\n assert(t < size());\n Vertex uu{INVALID}, vv{INVALID};\n usize d{};\n for (auto [u, v] : decomp(s, t)) {\n usize dist{std::max(dep_[u], dep_[v]) - std::min(dep_[u], dep_[v])};\n if (dist >= step) {\n uu = u;\n vv = v;\n d = dist;\n break;\n }\n step -= dist + 1;\n }\n if (uu == INVALID) return INVALID;\n if (dep_[uu] <= dep_[vv]) {\n return inv_[idx_[uu] + step];\n }\n else {\n return inv_[idx_[vv] + (d - step)];\n }\n }\n\n usize distance(Vertex s, Vertex t) const {\n assert(s < size());\n assert(t < size());\n usize res{};\n for (auto [u, v] : decomp(s, t)) {\n if (dep_[u] > dep_[v]) std::swap(u, v);\n res += dep_[v] - dep_[u];\n }\n return res;\n }\n\nprivate:\n static constexpr Vertex INVALID{static_cast<Vertex>(-1)};\n usize n_{};\n std::vector<Vertex> par_{}, top_{}, idx_{}, inv_{};\n std::vector<usize> size_{}, dep_{};\n};\n\n} // namespace zawa\n#line 7 \"0478.test.cpp\"\n\n#line 11 \"0478.test.cpp\"\n#include <unordered_set>\nusing namespace zawa;\n\nRollingHashMonoidData::Value RollingHashMonoidData::base{\n RollingHashMonoidData::randomValue(26)\n};\n\nint main() {\n SetFastIO();\n int N;\n std::cin >> N;\n std::vector<char> K(N);\n for (auto& k : K) std::cin >> k;\n Tree T(N);\n for (int i{} ; i < N - 1 ; i++) {\n int u, v;\n std::cin >> u >> v;\n AddEdge(T, u - 1, v - 1);\n }\n HeavyLightDecomposition hld{T};\n std::vector<RollingHashMonoidData> init(N), tini(N);\n for (int i{} ; i < N ; i++) {\n init[hld[i]] = tini[N - hld[i] - 1] = RollingHashMonoidData{K[i]};\n }\n SegmentTree<RollingHashMonoid> seg{init}, ges{tini};\n int Q;\n std::cin >> Q;\n std::unordered_set<RollingHashMonoidData::Value> set;\n while (Q--) {\n int t;\n std::cin >> t;\n if (t == 1) {\n int s, t;\n std::cin >> s >> t;\n s--; t--;\n RollingHashMonoidData res{};\n for (auto [u, v] : hld(s, t)) {\n u = hld[u];\n v = hld[v];\n if (u <= v) res = RollingHashMonoid::operation(res, seg.product(u, v + 1));\n else res = RollingHashMonoid::operation(res, ges.product(N - u - 1, N - v));\n }\n set.insert(res.hash);\n std::cout << set.size() << '\\n';\n }\n else if (t == 2) {\n int k;\n char c;\n std::cin >> k >> c;\n k--;\n seg.set(hld[k], RollingHashMonoidData{c});\n ges.set(N - hld[k] - 1, RollingHashMonoidData{c});\n }\n else {\n assert(false);\n }\n }\n}", "accuracy": 1, "time_ms": 110, "memory_kb": 39240, "score_of_the_acc": -0.2064, "final_rank": 5 }, { "submission_id": "aoj_0478_9495270", "code_snippet": "#include <bits/stdc++.h>\n\nnamespace zawa {\n\nusing i16 = std::int16_t;\nusing i32 = std::int32_t;\nusing i64 = std::int64_t;\nusing i128 = __int128_t;\n\nusing u8 = std::uint8_t;\nusing u16 = std::uint16_t;\nusing u32 = std::uint32_t;\nusing u64 = std::uint64_t;\n\nusing usize = std::size_t;\n\n} // namespace zawa\n\n\nnamespace zawa {\n\nvoid SetFastIO() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n}\n\nvoid SetPrecision(u32 dig) {\n std::cout << std::fixed << std::setprecision(dig);\n}\n\n} // namespace zawa\n\n\n\n\nnamespace zawa {\n\nusing Tree = std::vector<std::vector<u32>>;\n\nvoid AddEdge(Tree& T, u32 u, u32 v) {\n assert(u < T.size());\n assert(v < T.size());\n T[u].emplace_back(v);\n T[v].emplace_back(u);\n}\n\nvoid AddDirectedEdge(Tree& T, u32 from, u32 to) {\n assert(from < T.size());\n assert(to < T.size());\n T[from].emplace_back(to);\n}\n\n} // namespace zawa\n\n\nnamespace zawa {\n\nclass HeavyLightDecomposition {\npublic:\n using Vertex = u32;\n\n static constexpr Vertex Invalid() noexcept {\n return INVALID;\n }\n\n HeavyLightDecomposition() = default;\n\n HeavyLightDecomposition(Tree T, Vertex root = 0u) \n : n_{T.size()}, par_(n_), top_(n_), idx_(n_), \n inv_(n_), size_(n_, usize{1}), dep_(n_) {\n\n auto dfs1{[&](auto dfs, Vertex v, Vertex p, usize d) -> usize {\n par_[v] = p;\n dep_[v] = d;\n if (p != INVALID) {\n for (u32 i{} ; i + 1 < T[v].size() ; i++) if (T[v][i] == p) {\n std::swap(T[v][i], T[v].back());\n break;\n }\n assert(T[v].back() == p);\n T[v].pop_back();\n }\n for (Vertex x : T[v]) {\n size_[v] += dfs(dfs, x, v, d + 1);\n }\n for (u32 i{1} ; i < T[v].size() ; i++) if (size_[T[v][0]] < size_[T[v][i]]) {\n std::swap(T[v][0], T[v][i]);\n }\n return size_[v];\n }};\n\n auto dfs2{[&](auto dfs, Vertex v, Vertex idx, Vertex top) -> Vertex {\n idx_[v] = idx++;\n inv_[idx_[v]] = v;\n top_[v] = top;\n if (T[v].size()) {\n idx = dfs(dfs, T[v][0], idx, top);\n for (u32 i{1} ; i < T[v].size() ; i++) {\n idx = dfs(dfs, T[v][i], idx, T[v][i]);\n }\n }\n return idx;\n }};\n\n dfs1(dfs1, root, INVALID, 0u);\n dfs2(dfs2, root, 0u, root);\n }\n\n inline usize size() const noexcept {\n return n_;\n }\n\n usize size(Vertex v) const noexcept {\n assert(v < size());\n return size_[v];\n }\n\n usize depth(Vertex v) const noexcept {\n assert(v < size());\n return dep_[v];\n }\n\n Vertex parent(Vertex v) const noexcept {\n assert(v < size());\n return par_[v];\n }\n\n Vertex index(Vertex v) const noexcept {\n assert(v < size());\n return idx_[v];\n }\n\n Vertex operator[](Vertex v) const noexcept {\n assert(v < size());\n return idx_[v];\n }\n\n\n std::vector<std::pair<Vertex, Vertex>> decomp(Vertex s, Vertex t) const {\n assert(s < size());\n assert(t < size());\n std::vector<std::pair<Vertex, Vertex>> res, ser;\n while (top_[s] != top_[t]) {\n if (dep_[top_[s]] >= dep_[top_[t]]) {\n res.emplace_back(s, top_[s]);\n s = top_[s];\n if (par_[s] != INVALID) s = par_[s];\n }\n else {\n ser.emplace_back(top_[t], t);\n t = top_[t];\n if (par_[t] != INVALID) t = par_[t];\n }\n }\n res.emplace_back(s, t);\n std::reverse(ser.begin(), ser.end());\n res.insert(res.end(), ser.begin(), ser.end()); \n return res;\n }\n\n std::vector<std::pair<Vertex, Vertex>> operator()(Vertex s, Vertex t) const {\n return decomp(s, t);\n }\n\n Vertex lca(u32 u, u32 v) const {\n assert(u < size());\n assert(v < size());\n while (top_[u] != top_[v]) {\n if (dep_[top_[u]] >= dep_[top_[v]]) {\n u = top_[u];\n if (par_[u] != INVALID) u = par_[u];\n }\n else {\n v = top_[v];\n if (par_[v] != INVALID) v = par_[v];\n }\n }\n return (dep_[u] <= dep_[v] ? u : v);\n }\n\n // pはvの祖先か？\n bool isAncestor(Vertex v, Vertex p) {\n assert(v < size());\n assert(p < size());\n if (dep_[v] < dep_[p]) return false;\n while (v != INVALID and top_[v] != top_[p]) {\n v = par_[top_[v]];\n }\n return v != INVALID;\n }\n\n Vertex levelAncestor(Vertex v, usize step) const {\n assert(v < size());\n if (step > dep_[v]) return INVALID;\n while (true) {\n usize dist{dep_[v] - dep_[top_[v]]};\n if (dist >= step) break;\n step -= dist + 1;\n v = par_[top_[v]];\n }\n step = (dep_[v] - dep_[top_[v]]) - step;\n return inv_[idx_[top_[v]] + step];\n }\n\n Vertex jump(Vertex s, Vertex t, usize step) const {\n assert(s < size());\n assert(t < size());\n Vertex uu{INVALID}, vv{INVALID};\n usize d{};\n for (auto [u, v] : decomp(s, t)) {\n usize dist{std::max(dep_[u], dep_[v]) - std::min(dep_[u], dep_[v])};\n if (dist >= step) {\n uu = u;\n vv = v;\n d = dist;\n break;\n }\n step -= dist + 1;\n }\n if (uu == INVALID) return INVALID;\n if (dep_[uu] <= dep_[vv]) {\n return inv_[idx_[uu] + step];\n }\n else {\n return inv_[idx_[vv] + (d - step)];\n }\n }\n\n usize distance(Vertex s, Vertex t) const {\n assert(s < size());\n assert(t < size());\n usize res{};\n for (auto [u, v] : decomp(s, t)) {\n if (dep_[u] > dep_[v]) std::swap(u, v);\n res += dep_[v] - dep_[u];\n }\n return res;\n }\n\nprivate:\n static constexpr Vertex INVALID{static_cast<Vertex>(-1)};\n usize n_{};\n std::vector<Vertex> par_{}, top_{}, idx_{}, inv_{};\n std::vector<usize> size_{}, dep_{};\n};\n\n} // namespace zawa\n\n\n#include <type_traits>\n\nnamespace zawa {\n\ntemplate <class Monoid>\nclass SegmentTree {\npublic:\n using Value = typename Monoid::Element;\nprivate:\n constexpr u32 left(u32 v) const {\n return v << 1;\n }\n constexpr u32 right(u32 v) const {\n return v << 1 | 1;\n }\n constexpr u32 parent(u32 v) const {\n return v >> 1;\n }\n\n usize n_;\n std::vector<Value> dat_;\n\npublic:\n SegmentTree() = default;\n SegmentTree(u32 n) : n_{ n }, dat_(n << 1, Monoid::identity()) {\n assert(n_);\n }\n SegmentTree(const std::vector<Value>& dat) : n_{ dat.size() }, dat_(dat.size() << 1, Monoid::identity()) {\n assert(n_);\n for (u32 i{} ; i < n_ ; i++) {\n dat_[i + n_] = dat[i];\n }\n for (u32 i{static_cast<u32>(n_) - 1} ; i ; i--) {\n dat_[i] = Monoid::operation(dat_[left(i)], dat_[right(i)]);\n }\n }\n\n Value get(u32 i) const {\n assert(i < n_);\n return dat_[i + n_];\n }\n\n void set(u32 i, const Value& value) {\n assert(i < n_);\n i += n_;\n dat_[i] = value;\n while (i = parent(i), i) {\n dat_[i] = Monoid::operation(dat_[left(i)], dat_[right(i)]);\n }\n }\n\n Value product(u32 l, u32 r) const {\n assert(l < n_);\n assert(l <= r and r <= n_);\n Value leftValue{ Monoid::identity() }, rightValue{ Monoid::identity() };\n for (l += n_, r += n_ ; l < r ; l = parent(l), r = parent(r)) {\n if (l & 1) {\n leftValue = Monoid::operation(leftValue, dat_[l++]);\n }\n if (r & 1) {\n rightValue = Monoid::operation(dat_[--r], rightValue);\n }\n }\n return Monoid::operation(leftValue, rightValue);\n }\n\n template <class Function>\n u32 maxRight(u32 l, const Function& f) {\n assert(l < n_);\n static_assert(std::is_convertible_v<decltype(f), std::function<bool(Value)>>, \"maxRight's argument f must be function bool(T)\");\n assert(f(Monoid::identity()));\n u32 res{l}, width{1};\n Value prod{ Monoid::identity() };\n // 現在の見ている頂点の幅をwidthで持つ\n // 境界がある頂点を含む部分木の根を探す\n // (折り返す時は必要以上の幅を持つ根になるが、widthを持っているのでオーバーしない)\n for (l += n_ ; res + width <= n_ ; l = parent(l), width <<= 1) if (l & 1) {\n if (not f(Monoid::operation(prod, dat_[l]))) break; \n res += width;\n prod = Monoid::operation(prod, dat_[l++]);\n }\n // 根から下って、境界を発見する\n while (l = left(l), width >>= 1) {\n if (res + width <= n_ and f(Monoid::operation(prod, dat_[l]))) {\n res += width;\n prod = Monoid::operation(prod, dat_[l++]);\n } \n }\n return res;\n }\n\n template <class Function>\n u32 minLeft(u32 r, const Function& f) const {\n assert(r <= n_);\n static_assert(std::is_convertible_v<decltype(f), std::function<bool(Value)>>, \"minLeft's argument f must be function bool(T)\");\n assert(f(Monoid::identity()));\n u32 res{r}, width{1};\n Value prod{ Monoid::identity() };\n for (r += n_ ; res >= width ; r = parent(r), width <<= 1) if (r & 1) {\n if (not f(Monoid::operation(dat_[r - 1], prod))) break;\n res -= width;\n prod = Monoid::operation(prod, dat_[--r]);\n }\n while (r = left(r), width >>= 1) {\n if (res >= width and f(Monoid::operation(dat_[r - 1], prod))) {\n res -= width;\n prod = Monoid::operation(dat_[--r], prod);\n }\n }\n return res;\n }\n\n friend std::ostream& operator<<(std::ostream& os, const SegmentTree& st) {\n for (u32 i{1} ; i < 2 * st.n_ ; i++) {\n os << st.dat_[i] << (i + 1 == 2 * st.n_ ? \"\" : \" \");\n }\n return os;\n }\n};\n\n} // namespace zawa\n\n\n\nnamespace zawa {\n\n// @reference: https://qiita.com/keymoon/items/11fac5627672a6d6a9f6\nclass Mersenne61ModInt {\npublic:\n using Value = u64;\nprivate:\n static constexpr Value MOD{(1ull << 61) - 1}; // == MASK61\n static constexpr Value MASK30{(1ull << 30) - 1};\n static constexpr Value MASK31{(1ull << 31) - 1};\n Value v_{};\npublic:\n constexpr Mersenne61ModInt() {}\n\n static constexpr Value Mod() noexcept {\n return MOD;\n }\n static constexpr Value Modulo(const Value& v) noexcept {\n Value res{(v >> 61) + (v & MOD)};\n res = (res >= MOD ? res - MOD : res);\n return res;\n }\n static constexpr Value UnsafeMul(const Value& a, const Value& b) noexcept {\n Value fa{a >> 31}, fb{b >> 31};\n Value ba{a & MASK31}, bb{b & MASK31};\n Value mid{fa * bb + fb * ba};\n return Value{2}*fa*fb + (mid >> 30) + ((mid & MASK30) << 31) + ba*bb;\n }\n static constexpr Value Mul(const Value& a, const Value& b) noexcept {\n return Modulo(UnsafeMul(a, b));\n }\n};\n\n};\n\n\nnamespace zawa {\n\nstruct RollingHashMonoidData {\n using Value = Mersenne61ModInt::Value;\n using Size = usize;\n static Value base;\n Value hash{}, pow{1};\n usize len{};\n\n constexpr RollingHashMonoidData() = default;\n constexpr RollingHashMonoidData(Value h, Value p, usize l) : hash{h}, pow{p}, len{l} {}\n \n // 単一要素vからなるハッシュを返す\n template <class T>\n static constexpr RollingHashMonoidData generate(const T& v) {\n static_assert(std::is_convertible_v<T, Value>, \"v must be convertible unsigned interger value\");\n return RollingHashMonoidData{(Value)v, base, 1};\n }\n\n static Value randomValue(const Value& sigma) {\n return std::mt19937{std::random_device{}()}() % (Mersenne61ModInt::Mod() - sigma) + sigma + 1;\n }\n\n friend constexpr bool operator==(const RollingHashMonoidData& lhs, const RollingHashMonoidData& rhs) {\n return lhs.hash == rhs.hash and lhs.len == rhs.len;\n }\n friend constexpr bool operator!=(const RollingHashMonoidData& lhs, const RollingHashMonoidData& rhs) {\n return lhs.hash != rhs.hash or lhs.len != rhs.len;\n }\n};\n\nstruct RollingHashMonoid {\n using Modulo = Mersenne61ModInt;\n using Element = RollingHashMonoidData;\n static constexpr Element identity() noexcept {\n return Element{};\n }\n static constexpr Element operation(const Element& lhs, const Element& rhs) noexcept {\n return Element{\n Modulo::Modulo(Modulo::UnsafeMul(lhs.hash, rhs.pow) + rhs.hash),\n Modulo::Mul(lhs.pow, rhs.pow),\n lhs.len + rhs.len\n };\n }\n};\n\n} // namespace zawa\nusing namespace zawa;\n\nusing M = RollingHashMonoid;\nusing E = M::Element;\nusing V = E::Value;\nV E::base{\n E::randomValue(26)\n};\n\nint main() {\n SetFastIO();\n\n int N;\n std::cin >> N;\n std::vector<char> S(N);\n for (int i{} ; i < N ; i++) std::cin >> S[i];\n Tree T(N);\n for (int i{} ; i + 1 < N ; i++) {\n int u, v;\n std::cin >> u >> v;\n AddEdge(T, u - 1, v - 1);\n }\n HeavyLightDecomposition hld(T);\n std::vector<E> cur(N), ruc(N);\n for (int i{} ; i < N ; i++) {\n int p{(int)hld[i]};\n cur[p] = ruc[N - p - 1] = E::generate(S[i]);\n }\n SegmentTree<M> seg(cur), ges(ruc);\n int Q;\n std::cin >> Q;\n std::set<V> set;\n while (Q--) {\n int t;\n std::cin >> t;\n if (t == 1) {\n int s, t;\n std::cin >> s >> t;\n s--; t--;\n E hash{M::identity()};\n for (auto [u, v] : hld(s, t)) {\n u = hld[u];\n v = hld[v];\n // std::cout << '(' << u << ',' << v << ')' << ' ';\n if (u <= v) hash = M::operation(hash, seg.product(u, v + 1));\n else hash = M::operation(hash, ges.product(N - u - 1, N - v));\n }\n // std::cout << std::endl;\n set.insert(hash.hash);\n std::cout << set.size() << '\\n';\n }\n else if (t == 2) {\n int k;\n char c;\n std::cin >> k >> c;\n k--;\n int p{(int)hld[k]};\n cur[p] = ruc[N - p - 1] = E::generate(c);\n seg.set(p, cur[p]);\n ges.set(N - p - 1, ruc[N - p - 1]);\n }\n else {\n assert(false);\n }\n }\n}", "accuracy": 1, "time_ms": 120, "memory_kb": 39768, "score_of_the_acc": -0.2219, "final_rank": 7 }, { "submission_id": "aoj_0478_8832513", "code_snippet": "#include <bits/extc++.h>\n\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<(n);++i)\n#define reps(i,n) for(int i=1;i<=(n);++i)\n#define all(x) begin(x),end(x)\n#define Fixed fixed << setprecision(12)\n#define updiv(a, b) (((a) + (b) - 1) / (b))\nusing pii = pair<int,int>;\nconstexpr int32_t INF = 0x3f3f3f3f;\nconstexpr int_fast64_t LINF = 0x3f3f3f3f3f3f3f3fLL;\nconstexpr int mod1 = 1e9+7;\nconstexpr int mod2 = 998244353;\n\ntemplate <class Func>\nclass FixPoint : Func {\npublic:\n explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}\n\n template <class... Args>\n constexpr decltype(auto) operator()(Args&&... args) const {\n return Func::operator()(*this, std::forward<Args>(args)...);\n }\n};\n\ntemplate <class Func>\nstatic inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {\n return FixPoint<Func>{forward<Func>(f)};\n}\n\ntemplate<class T, class U> istream& operator>>(istream& is, pair<T, U>& p){ is >> p.first >> p.second; return (is); }\ntemplate<class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p){ os << p.first << ' ' << p.second; return (os); }\ntemplate<class T> istream& operator>>(istream& is, vector<T>& v){ for (auto &&e : v) is >> e; return (is); }\ntemplate<class T> ostream& operator<<(ostream& os, vector<T>& v){ for (auto &&e : v) os << e << ' '; return (os); }\n\ntemplate<class T> void chbase(vector<T> &v, const T &base) { for (auto &&e : v) e -= base; }\ntemplate<class T> inline const T& max(const vector<T> &v) { return *max_element(v.begin(), v.end()); }\ntemplate<class T> inline const T& min(const vector<T> &v) { return *min_element(v.begin(), v.end()); }\ntemplate <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }\ntemplate <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }\n\ntemplate <class T> using max_heap = priority_queue<T>;\ntemplate <class T> using min_heap = priority_queue<T, vector<T>, greater<T> >;\ntemplate <class A, class B> using umap = unordered_map<A, B>;\ntemplate <class T> using uset = unordered_set<T>;\n\ntemplate <class T> using Max_Heap = __gnu_pbds::priority_queue<T, less<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Min_Heap = __gnu_pbds::priority_queue<T, greater<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;\ntemplate <class K, class V> using Umap = __gnu_pbds::gp_hash_table<K, V>;\ntemplate <class T> using Rope = __gnu_cxx::rope<T>;\nusing Trie = __gnu_pbds::trie<string, __gnu_pbds::null_type, __gnu_pbds::trie_string_access_traits<>, __gnu_pbds::pat_trie_tag, __gnu_pbds::trie_prefix_search_node_update>;\n\ntemplate <class T> void bye(T x){ cout << x << '\\n'; exit(0); }\n\nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1};\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1};\n\nstruct RollingHash {\n static const uint64_t mod = (1ull << 61ull) - 1;\n using uint128_t = __uint128_t;\n vector< uint64_t > power;\n const uint64_t base;\n\n static inline uint64_t add(uint64_t a, uint64_t b) {\n if((a += b) >= mod) a -= mod;\n return a;\n }\n\n static inline uint64_t mul(uint64_t a, uint64_t b) {\n uint128_t c = (uint128_t) a * b;\n return add(c >> 61, c & mod);\n }\n\n static inline uint64_t generate_base() {\n mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());\n uniform_int_distribution< uint64_t > rand(1, RollingHash::mod - 1);\n return rand(mt);\n }\n\n inline void expand(size_t sz) {\n if(power.size() < sz + 1) {\n int pre_sz = (int) power.size();\n power.resize(sz + 1);\n for(int i = pre_sz - 1; i < sz; i++) {\n power[i + 1] = mul(power[i], base);\n }\n }\n }\n\n explicit RollingHash(uint64_t base = generate_base()) : base(base), power{1} {}\n\n vector< uint64_t > build(const string &s) const {\n int sz = s.size();\n vector< uint64_t > hashed(sz + 1);\n for(int i = 0; i < sz; i++) {\n hashed[i + 1] = add(mul(hashed[i], base), s[i]);\n }\n return hashed;\n }\n\n template< typename T >\n vector< uint64_t > build(const vector< T > &s) const {\n int sz = s.size();\n vector< uint64_t > hashed(sz + 1);\n for(int i = 0; i < sz; i++) {\n hashed[i + 1] = add(mul(hashed[i], base), s[i]);\n }\n return hashed;\n }\n\n uint64_t query(const vector< uint64_t > &s, int l, int r) {\n expand(r - l);\n return add(s[r], mod - mul(s[l], power[r - l]));\n }\n\n uint64_t combine(uint64_t h1, uint64_t h2, size_t h2len) {\n expand(h2len);\n return add(mul(h1, power[h2len]), h2);\n }\n\n int lcp(const vector< uint64_t > &a, int l1, int r1, const vector< uint64_t > &b, int l2, int r2) {\n int len = min(r1 - l1, r2 - l2);\n int low = 0, high = len + 1;\n while(high - low > 1) {\n int mid = (low + high) / 2;\n if(query(a, l1, l1 + mid) == query(b, l2, l2 + mid)) low = mid;\n else high = mid;\n }\n return low;\n }\n};\n\nstruct HeavyLightDecomposition {\npublic:\n vector<vector<int> > g;\n vector<int> sz, in, out, head, rev, par, dep;\n\n HeavyLightDecomposition(const vector<vector<int> > &G) : g(G) {\n sz.resize(g.size(), 0);\n in.resize(g.size(), 0);\n out.resize(g.size(), 0);\n head.resize(g.size(), 0);\n rev.resize(g.size(), 0);\n par.resize(g.size(), 0);\n dep.resize(g.size(), 0);\n dfs_sz(0, -1, 0);\n dfs_hld(0, -1);\n }\n\n int la(int v, int k) {\n while (true) {\n int u = head[v];\n if (in[v] - k >= in[u]) return (rev[in[v] - k]);\n k -= in[v] - in[u] + 1;\n v = par[u];\n }\n }\n\n int lca(int u, int v) const {\n for (;; v = par[head[v]]) {\n if (in[u] > in[v]) swap(u, v);\n if (head[u] == head[v]) return (u);\n }\n }\n\n int dist(int u, int v) const {\n return (dep[u] + dep[v] - 2 * dep[lca(u, v)]);\n }\n\n template<typename E, typename F, typename G, typename S>\n E query(int u, int v, const E &ti, const F &f, const G &g, const S &s, bool edge = false) {\n E l = ti, r = ti;\n for (;; v = par[head[v]]) {\n if (in[u] > in[v]) swap(u, v), swap(l, r);\n if (head[u] == head[v]) break;\n l = g(f(in[head[v]], in[v] + 1), l);\n }\n return (s(g(f(in[u] + edge, in[v] + 1), l), r));\n }\n\n template<typename E, typename F, typename G>\n E query(int u, int v, const E &ti, const F &f, const G &g, bool edge = false) {\n return (query(u, v, ti, f, g, g, edge));\n }\n\n template<typename G>\n void update(int u, int v, const G &g, bool edge = false) {\n for (;; v = par[head[v]]) {\n if (in[u] > in[v]) swap(u, v);\n if (head[u] == head[v]) break;\n g(in[head[v]], in[v] + 1);\n }\n g(in[u] + edge, in[v] + 1);\n }\n\n // (parent, child)\n vector<pair<int, int> > compress(vector<int> &remark) {\n auto comp = [&](int a, int b) { return (in[a] < in[b]); };\n sort(begin(remark), end(remark), comp);\n remark.erase(unique(begin(remark), end(remark)), end(remark));\n int K = (int) remark.size();\n for (int k = 1; k < K; ++k) remark.emplace_back(lca(remark[k - 1], remark[k]));\n sort(begin(remark), end(remark), comp);\n remark.erase(unique(begin(remark), end(remark)), end(remark));\n vector<pair<int, int> > es;\n vector<int> st;\n for (auto &k : remark) {\n while (!st.empty() && out[st.back()] <= in[k]) st.pop_back();\n if (!st.empty()) es.emplace_back(st.back(), k);\n st.emplace_back(k);\n }\n return (es);\n }\n\nprivate:\n void dfs_sz(int cur, int p, int d) {\n dep[cur] = d;\n par[cur] = p;\n sz[cur] = 1;\n if (!g[cur].empty() && g[cur][0] == p) swap(g[cur][0], g[cur].back());\n for (auto &to : g[cur]) {\n if (to == p) continue;\n dfs_sz(to, cur, d + 1);\n sz[cur] += sz[to];\n if (sz[g[cur][0]] < sz[to]) swap(g[cur][0], to);\n }\n }\n\n void dfs_hld(int cur, int p) {\n static int times = 0;\n in[cur] = times++;\n rev[in[cur]] = cur;\n for (auto &to : g[cur]) {\n if (to == p) continue;\n head[to] = (g[cur][0] == to ? head[cur] : to);\n dfs_hld(to, cur);\n }\n out[cur] = times;\n }\n};\n\ntemplate< typename T, typename F >\nstruct SegmentTree {\n int n, sz;\n vector< T > seg;\n\n const F f;\n const T ti;\n\n SegmentTree() = default;\n\n explicit SegmentTree(int n, const F f, const T &ti) : n(n), f(f), ti(ti) {\n sz = 1;\n while(sz < n) sz <<= 1;\n seg.assign(2 * sz, ti);\n }\n\n explicit SegmentTree(const vector< T > &v, const F f, const T &ti) :\n SegmentTree((int) v.size(), f, ti) {\n build(v);\n }\n\n void build(const vector< T > &v) {\n assert(n == (int) v.size());\n for(int k = 0; k < n; k++) seg[k + sz] = v[k];\n for(int k = sz - 1; k > 0; k--) {\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n }\n }\n\n void update(int k, const T &x) {\n k += sz;\n seg[k] = x;\n while(k >>= 1) {\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n }\n }\n\n T get(int k) const {\n return seg[k + sz];\n }\n\n T operator[](const int &k) const {\n return get(k);\n }\n\n void apply(int k, const T &x) {\n k += sz;\n seg[k] = f(seg[k], x);\n while(k >>= 1) {\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n }\n }\n\n T query(int l, int r) const {\n T L = ti, R = ti;\n for(l += sz, r += sz; l < r; l >>= 1, r >>= 1) {\n if(l & 1) L = f(L, seg[l++]);\n if(r & 1) R = f(seg[--r], R);\n }\n return f(L, R);\n }\n\n T query() const {\n return seg[1];\n }\n\n template< typename C >\n int find_first(int l, const C &check) const {\n if(l >= n) return n;\n l += sz;\n T sum = ti;\n do {\n while((l & 1) == 0) l >>= 1;\n if(check(f(sum, seg[l]))) {\n while(l < sz) {\n l <<= 1;\n auto nxt = f(sum, seg[l]);\n if(not check(nxt)) {\n sum = nxt;\n l++;\n }\n }\n return l + 1 - sz;\n }\n sum = f(sum, seg[l++]);\n } while((l & -l) != l);\n return n;\n }\n\n template< typename C >\n int find_last(int r, const C &check) const {\n if(r <= 0) return -1;\n r += sz;\n T sum = ti;\n do {\n r--;\n while(r > 1 and (r & 1)) r >>= 1;\n if(check(f(seg[r], sum))) {\n while(r < sz) {\n r = (r << 1) + 1;\n auto nxt = f(seg[r], sum);\n if(not check(nxt)) {\n sum = nxt;\n r--;\n }\n }\n return r - sz;\n }\n sum = f(seg[r], sum);\n } while((r & -r) != r);\n return -1;\n }\n};\n\ntemplate< typename T, typename F >\nSegmentTree< T, F > get_segment_tree(int N, const F &f, const T &ti) {\n return SegmentTree{N, f, ti};\n}\n\ntemplate< typename T, typename F >\nSegmentTree< T, F > get_segment_tree(const vector< T > &v, const F &f, const T &ti) {\n return SegmentTree{v, f, ti};\n}\n\nsigned main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout.setf(ios_base::fixed);\n cout.precision(12);\n\n int n;\n cin >> n;\n\n vector<char> k(n);\n\n cin >> k;\n\n vector<vector<int> > tree(n);\n\n for (int i = 0; i < n - 1; ++i) {\n int u, v;\n cin >> u >> v;\n\n --u, --v;\n\n tree[u].emplace_back(v);\n tree[v].emplace_back(u);\n }\n\n HeavyLightDecomposition hld(tree);\n RollingHash rh;\n uset<size_t> st;\n\n vector<size_t> hs = rh.build(\"abcdefghijklmnopqrstuvwxyz\");\n \n struct Monoid {\n int l, r, len;\n size_t lhs, rhs;\n Monoid(int l = -1, int r = -1, int len = 0, size_t lhs = 0, size_t rhs = 0) : l(l), r(r), len(len), lhs(lhs), rhs(rhs) {}\n };\n\n auto f = [&](auto x, auto y) {\n int l = x.l == -1 ? y.l : x.l;\n int r = y.r == -1 ? x.r : y.r;\n int len = x.len + y.len;\n size_t lhs = rh.combine(x.lhs, y.lhs, y.len);\n size_t rhs = rh.combine(y.rhs, x.rhs, x.len);\n return Monoid(l, r, len, lhs, rhs);\n };\n\n auto seg = get_segment_tree(n, f, Monoid(-1, -1, 0, 0, 0));\n\n for (int i = 0; i < n; ++i) {\n auto h = rh.query(hs, k[i] - 'a', k[i] - 'a' + 1);\n seg.update(hld.in[i], Monoid(i, i, 1, h, h));\n }\n\n int q;\n cin >> q;\n\n for (int i = 0; i < q; ++i) {\n int com;\n cin >> com;\n\n if (com == 1) {\n int s, t;\n cin >> s >> t;\n --s, --t;\n\n auto res = hld.query(s, t, Monoid(-1, -1, 0, 0, 0), [&](int l, int r) { return seg.query(l, r); }, f, [&](auto x, auto y) {\n swap(x.l, x.r);\n swap(x.lhs, x.rhs);\n return f(x, y);\n });\n if (res.l == s) st.insert(res.lhs);\n else st.insert(res.rhs);\n\n cout << st.size() << '\\n';\n } else {\n int k;\n char c;\n cin >> k >> c;\n --k;\n\n auto monoid = seg.get(hld.in[k]);\n monoid.lhs = monoid.rhs = rh.query(hs, c - 'a', c - 'a' + 1);\n seg.update(hld.in[k], monoid);\n }\n }\n\n\n return (0);\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 37396, "score_of_the_acc": -0.1706, "final_rank": 3 }, { "submission_id": "aoj_0478_8832511", "code_snippet": "#include <bits/extc++.h>\n\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<(n);++i)\n#define reps(i,n) for(int i=1;i<=(n);++i)\n#define all(x) begin(x),end(x)\n#define Fixed fixed << setprecision(12)\n#define updiv(a, b) (((a) + (b) - 1) / (b))\nusing pii = pair<int,int>;\nconstexpr int32_t INF = 0x3f3f3f3f;\nconstexpr int_fast64_t LINF = 0x3f3f3f3f3f3f3f3fLL;\nconstexpr int mod1 = 1e9+7;\nconstexpr int mod2 = 998244353;\n\ntemplate <class Func>\nclass FixPoint : Func {\npublic:\n explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}\n\n template <class... Args>\n constexpr decltype(auto) operator()(Args&&... args) const {\n return Func::operator()(*this, std::forward<Args>(args)...);\n }\n};\n\ntemplate <class Func>\nstatic inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {\n return FixPoint<Func>{forward<Func>(f)};\n}\n\ntemplate<class T, class U> istream& operator>>(istream& is, pair<T, U>& p){ is >> p.first >> p.second; return (is); }\ntemplate<class T, class U> ostream& operator<<(ostream& os, pair<T, U>& p){ os << p.first << ' ' << p.second; return (os); }\ntemplate<class T> istream& operator>>(istream& is, vector<T>& v){ for (auto &&e : v) is >> e; return (is); }\ntemplate<class T> ostream& operator<<(ostream& os, vector<T>& v){ for (auto &&e : v) os << e << ' '; return (os); }\n\ntemplate<class T> void chbase(vector<T> &v, const T &base) { for (auto &&e : v) e -= base; }\ntemplate<class T> inline const T& max(const vector<T> &v) { return *max_element(v.begin(), v.end()); }\ntemplate<class T> inline const T& min(const vector<T> &v) { return *min_element(v.begin(), v.end()); }\ntemplate <class A, class B> inline bool chmax(A &a, const B &b) { return b > a && (a = b, true); }\ntemplate <class A, class B> inline bool chmin(A &a, const B &b) { return b < a && (a = b, true); }\n\ntemplate <class T> using max_heap = priority_queue<T>;\ntemplate <class T> using min_heap = priority_queue<T, vector<T>, greater<T> >;\ntemplate <class A, class B> using umap = unordered_map<A, B>;\ntemplate <class T> using uset = unordered_set<T>;\n\ntemplate <class T> using Max_Heap = __gnu_pbds::priority_queue<T, less<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Min_Heap = __gnu_pbds::priority_queue<T, greater<T>, __gnu_pbds::rc_binomial_heap_tag>;\ntemplate <class T> using Set = __gnu_pbds::tree<T, __gnu_pbds::null_type, less<T>, __gnu_pbds::rb_tree_tag, __gnu_pbds::tree_order_statistics_node_update>;\ntemplate <class K, class V> using Umap = __gnu_pbds::gp_hash_table<K, V>;\ntemplate <class T> using Rope = __gnu_cxx::rope<T>;\nusing Trie = __gnu_pbds::trie<string, __gnu_pbds::null_type, __gnu_pbds::trie_string_access_traits<>, __gnu_pbds::pat_trie_tag, __gnu_pbds::trie_prefix_search_node_update>;\n\ntemplate <class T> void bye(T x){ cout << x << '\\n'; exit(0); }\n\nconstexpr int dx[] = {1,0,-1,0,1,1,-1,-1};\nconstexpr int dy[] = {0,-1,0,1,1,-1,-1,1};\n\nstruct RollingHash {\n static const uint64_t mod = (1ull << 61ull) - 1;\n using uint128_t = __uint128_t;\n vector< uint64_t > power;\n const uint64_t base;\n\n static inline uint64_t add(uint64_t a, uint64_t b) {\n if((a += b) >= mod) a -= mod;\n return a;\n }\n\n static inline uint64_t mul(uint64_t a, uint64_t b) {\n uint128_t c = (uint128_t) a * b;\n return add(c >> 61, c & mod);\n }\n\n static inline uint64_t generate_base() {\n mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());\n uniform_int_distribution< uint64_t > rand(1, RollingHash::mod - 1);\n return rand(mt);\n }\n\n inline void expand(size_t sz) {\n if(power.size() < sz + 1) {\n int pre_sz = (int) power.size();\n power.resize(sz + 1);\n for(int i = pre_sz - 1; i < sz; i++) {\n power[i + 1] = mul(power[i], base);\n }\n }\n }\n\n explicit RollingHash(uint64_t base = generate_base()) : base(base), power{1} {}\n\n vector< uint64_t > build(const string &s) const {\n int sz = s.size();\n vector< uint64_t > hashed(sz + 1);\n for(int i = 0; i < sz; i++) {\n hashed[i + 1] = add(mul(hashed[i], base), s[i]);\n }\n return hashed;\n }\n\n template< typename T >\n vector< uint64_t > build(const vector< T > &s) const {\n int sz = s.size();\n vector< uint64_t > hashed(sz + 1);\n for(int i = 0; i < sz; i++) {\n hashed[i + 1] = add(mul(hashed[i], base), s[i]);\n }\n return hashed;\n }\n\n uint64_t query(const vector< uint64_t > &s, int l, int r) {\n expand(r - l);\n return add(s[r], mod - mul(s[l], power[r - l]));\n }\n\n uint64_t combine(uint64_t h1, uint64_t h2, size_t h2len) {\n expand(h2len);\n return add(mul(h1, power[h2len]), h2);\n }\n\n int lcp(const vector< uint64_t > &a, int l1, int r1, const vector< uint64_t > &b, int l2, int r2) {\n int len = min(r1 - l1, r2 - l2);\n int low = 0, high = len + 1;\n while(high - low > 1) {\n int mid = (low + high) / 2;\n if(query(a, l1, l1 + mid) == query(b, l2, l2 + mid)) low = mid;\n else high = mid;\n }\n return low;\n }\n};\n\nstruct HeavyLightDecomposition {\npublic:\n vector<vector<int> > g;\n vector<int> sz, in, out, head, rev, par, dep;\n\n HeavyLightDecomposition(const vector<vector<int> > &G) : g(G) {\n sz.resize(g.size(), 0);\n in.resize(g.size(), 0);\n out.resize(g.size(), 0);\n head.resize(g.size(), 0);\n rev.resize(g.size(), 0);\n par.resize(g.size(), 0);\n dep.resize(g.size(), 0);\n dfs_sz(0, -1, 0);\n dfs_hld(0, -1);\n }\n\n int la(int v, int k) {\n while (true) {\n int u = head[v];\n if (in[v] - k >= in[u]) return (rev[in[v] - k]);\n k -= in[v] - in[u] + 1;\n v = par[u];\n }\n }\n\n int lca(int u, int v) const {\n for (;; v = par[head[v]]) {\n if (in[u] > in[v]) swap(u, v);\n if (head[u] == head[v]) return (u);\n }\n }\n\n int dist(int u, int v) const {\n return (dep[u] + dep[v] - 2 * dep[lca(u, v)]);\n }\n\n template<typename E, typename F, typename G, typename S>\n E query(int u, int v, const E &ti, const F &f, const G &g, const S &s, bool edge = false) {\n E l = ti, r = ti;\n for (;; v = par[head[v]]) {\n if (in[u] > in[v]) swap(u, v), swap(l, r);\n if (head[u] == head[v]) break;\n l = g(f(in[head[v]], in[v] + 1), l);\n }\n return (s(g(f(in[u] + edge, in[v] + 1), l), r));\n }\n\n template<typename E, typename F, typename G>\n E query(int u, int v, const E &ti, const F &f, const G &g, bool edge = false) {\n return (query(u, v, ti, f, g, g, edge));\n }\n\n template<typename G>\n void update(int u, int v, const G &g, bool edge = false) {\n for (;; v = par[head[v]]) {\n if (in[u] > in[v]) swap(u, v);\n if (head[u] == head[v]) break;\n g(in[head[v]], in[v] + 1);\n }\n g(in[u] + edge, in[v] + 1);\n }\n\n // (parent, child)\n vector<pair<int, int> > compress(vector<int> &remark) {\n auto comp = [&](int a, int b) { return (in[a] < in[b]); };\n sort(begin(remark), end(remark), comp);\n remark.erase(unique(begin(remark), end(remark)), end(remark));\n int K = (int) remark.size();\n for (int k = 1; k < K; ++k) remark.emplace_back(lca(remark[k - 1], remark[k]));\n sort(begin(remark), end(remark), comp);\n remark.erase(unique(begin(remark), end(remark)), end(remark));\n vector<pair<int, int> > es;\n vector<int> st;\n for (auto &k : remark) {\n while (!st.empty() && out[st.back()] <= in[k]) st.pop_back();\n if (!st.empty()) es.emplace_back(st.back(), k);\n st.emplace_back(k);\n }\n return (es);\n }\n\nprivate:\n void dfs_sz(int cur, int p, int d) {\n dep[cur] = d;\n par[cur] = p;\n sz[cur] = 1;\n if (!g[cur].empty() && g[cur][0] == p) swap(g[cur][0], g[cur].back());\n for (auto &to : g[cur]) {\n if (to == p) continue;\n dfs_sz(to, cur, d + 1);\n sz[cur] += sz[to];\n if (sz[g[cur][0]] < sz[to]) swap(g[cur][0], to);\n }\n }\n\n void dfs_hld(int cur, int p) {\n static int times = 0;\n in[cur] = times++;\n rev[in[cur]] = cur;\n for (auto &to : g[cur]) {\n if (to == p) continue;\n head[to] = (g[cur][0] == to ? head[cur] : to);\n dfs_hld(to, cur);\n }\n out[cur] = times;\n }\n};\n\ntemplate< typename T, typename F >\nstruct SegmentTree {\n int n, sz;\n vector< T > seg;\n\n const F f;\n const T ti;\n\n SegmentTree() = default;\n\n explicit SegmentTree(int n, const F f, const T &ti) : n(n), f(f), ti(ti) {\n sz = 1;\n while(sz < n) sz <<= 1;\n seg.assign(2 * sz, ti);\n }\n\n explicit SegmentTree(const vector< T > &v, const F f, const T &ti) :\n SegmentTree((int) v.size(), f, ti) {\n build(v);\n }\n\n void build(const vector< T > &v) {\n assert(n == (int) v.size());\n for(int k = 0; k < n; k++) seg[k + sz] = v[k];\n for(int k = sz - 1; k > 0; k--) {\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n }\n }\n\n void update(int k, const T &x) {\n k += sz;\n seg[k] = x;\n while(k >>= 1) {\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n }\n }\n\n T get(int k) const {\n return seg[k + sz];\n }\n\n T operator[](const int &k) const {\n return get(k);\n }\n\n void apply(int k, const T &x) {\n k += sz;\n seg[k] = f(seg[k], x);\n while(k >>= 1) {\n seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);\n }\n }\n\n T query(int l, int r) const {\n T L = ti, R = ti;\n for(l += sz, r += sz; l < r; l >>= 1, r >>= 1) {\n if(l & 1) L = f(L, seg[l++]);\n if(r & 1) R = f(seg[--r], R);\n }\n return f(L, R);\n }\n\n T query() const {\n return seg[1];\n }\n\n template< typename C >\n int find_first(int l, const C &check) const {\n if(l >= n) return n;\n l += sz;\n T sum = ti;\n do {\n while((l & 1) == 0) l >>= 1;\n if(check(f(sum, seg[l]))) {\n while(l < sz) {\n l <<= 1;\n auto nxt = f(sum, seg[l]);\n if(not check(nxt)) {\n sum = nxt;\n l++;\n }\n }\n return l + 1 - sz;\n }\n sum = f(sum, seg[l++]);\n } while((l & -l) != l);\n return n;\n }\n\n template< typename C >\n int find_last(int r, const C &check) const {\n if(r <= 0) return -1;\n r += sz;\n T sum = ti;\n do {\n r--;\n while(r > 1 and (r & 1)) r >>= 1;\n if(check(f(seg[r], sum))) {\n while(r < sz) {\n r = (r << 1) + 1;\n auto nxt = f(seg[r], sum);\n if(not check(nxt)) {\n sum = nxt;\n r--;\n }\n }\n return r - sz;\n }\n sum = f(seg[r], sum);\n } while((r & -r) != r);\n return -1;\n }\n};\n\ntemplate< typename T, typename F >\nSegmentTree< T, F > get_segment_tree(int N, const F &f, const T &ti) {\n return SegmentTree{N, f, ti};\n}\n\ntemplate< typename T, typename F >\nSegmentTree< T, F > get_segment_tree(const vector< T > &v, const F &f, const T &ti) {\n return SegmentTree{v, f, ti};\n}\n\nsigned main(){\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout.setf(ios_base::fixed);\n cout.precision(12);\n\n int n;\n cin >> n;\n\n vector<char> k(n);\n\n cin >> k;\n\n vector<vector<int> > tree(n);\n\n for (int i = 0; i < n - 1; ++i) {\n int u, v;\n cin >> u >> v;\n\n --u, --v;\n\n tree[u].emplace_back(v);\n tree[v].emplace_back(u);\n }\n\n HeavyLightDecomposition hld(tree);\n RollingHash rh;\n uset<size_t> st;\n\n string abc = \"abcdefghijklmnopqrstuvwxyz\";\n vector<size_t> hs = rh.build(abc);\n \n struct Monoid {\n int l, r, len;\n size_t lhs, rhs;\n Monoid(int l = -1, int r = -1, int len = 0, size_t lhs = 0, size_t rhs = 0) : l(l), r(r), len(len), lhs(lhs), rhs(rhs) {}\n };\n\n auto f = [&](auto x, auto y) {\n int l = x.l == -1 ? y.l : x.l;\n int r = y.r == -1 ? x.r : y.r;\n int len = x.len + y.len;\n size_t lhs = x.l == -1 ? y.lhs : y.l == -1 ? x.lhs : rh.combine(x.lhs, y.lhs, y.len);\n // size_t lhs = x.l == -1 ? y.lhs : rh.combine(x.lhs, y.lhs, y.len);\n size_t rhs = y.l == -1 ? x.rhs : x.l == -1 ? y.rhs : rh.combine(y.rhs, x.rhs, x.len);\n // size_t rhs = y.l == -1 ? x.rhs : rh.combine(y.rhs, x.rhs, x.len);\n return Monoid(l, r, len, lhs, rhs);\n };\n\n auto seg = get_segment_tree(n, f, Monoid(-1, -1, 0, 0, 0));\n\n for (int i = 0; i < n; ++i) {\n auto h = rh.query(hs, k[i] - 'a', k[i] - 'a' + 1);\n seg.update(hld.in[i], Monoid(i, i, 1, h, h));\n }\n\n int q;\n cin >> q;\n\n for (int i = 0; i < q; ++i) {\n int com;\n cin >> com;\n\n if (com == 1) {\n int s, t;\n cin >> s >> t;\n --s, --t;\n\n auto res = hld.query(s, t, Monoid(-1, -1, 0, 0, 0), [&](int l, int r) { return seg.query(l, r); }, f, [&](auto x, auto y) {\n swap(x.l, x.r);\n swap(x.lhs, x.rhs);\n return f(x, y);\n });\n if (res.l == s) st.insert(res.lhs);\n else st.insert(res.rhs);\n\n cout << st.size() << '\\n';\n } else {\n int k;\n char c;\n cin >> k >> c;\n --k;\n\n auto monoid = seg.get(hld.in[k]);\n monoid.lhs = monoid.rhs = rh.query(hs, c - 'a', c - 'a' + 1);\n seg.update(hld.in[k], monoid);\n }\n }\n\n\n return (0);\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 37416, "score_of_the_acc": -0.1709, "final_rank": 4 }, { "submission_id": "aoj_0478_8810622", "code_snippet": "#include <bits/stdc++.h>\n\ntemplate <class T>\nbool chmin(T& lhs, T rhs) {\n if (lhs > rhs) {\n lhs = rhs;\n return true;\n }\n return false;\n}\n\ntemplate <class T>\nbool chmax(T& lhs, T rhs) {\n if (lhs < rhs) {\n lhs = rhs;\n return true;\n }\n return false;\n}\n\nconstexpr long long MOD = 998244353;\n\nstruct Data {\n long long coef;\n long long constant;\n Data(long long a = 1, long long b = 0): coef((a % MOD + MOD) % MOD), constant((b % MOD + MOD) % MOD) {}\n long long eval() {\n return constant;\n }\n};\n\nData op(Data lhs, Data rhs) {\n return Data(lhs.coef * rhs.coef, lhs.coef * rhs.constant + lhs.constant);\n}\n\nstruct Hash {\n static constexpr int B = 2;\n static constexpr long long BASE[B] = {12045, 13501};\n static constexpr long long BASE_INV[B] = {456067968, 364295232};\n std::array<Data, B> ord, rev;\n Hash(std::array<Data, B> a, std::array<Data, B> b): ord(a), rev(b) {}\n Hash(long long val) {\n ord = {Data(BASE[0], val), Data(BASE[1], val)};\n rev = {Data(BASE[0], val), Data(BASE[1], val)};\n }\n long long eval() {\n long long lhs = ord[0].eval();\n long long rhs = ord[1].eval();\n return lhs * MOD + rhs;\n }\n};\n\nHash e() {\n return Hash({Data(), Data()}, {Data(), Data()});\n}\n\nHash op(Hash lhs, Hash rhs) {\n Hash hash = e();\n for (int i = 0; i < Hash::B; i++) {\n hash.ord[i] = op(lhs.ord[i], rhs.ord[i]);\n }\n for (int i = 0; i < Hash::B; i++) {\n hash.rev[i] = op(rhs.rev[i], lhs.rev[i]);\n }\n return hash;\n}\n\nHash reverse(Hash hash) {\n std::swap(hash.ord, hash.rev);\n return hash;\n}\n\ntemplate <class T, T (*op)(T, T), T (*e)()>\nstruct SegmentTree {\n int n;\n std::vector<T> data;\n SegmentTree(int n): n(n), data(2 * n, e()) {}\n void set(int pos, T elem) {\n assert(0 <= pos && pos < n);\n pos += n;\n data[pos] = elem;\n for (pos >>= 1; pos > 0; pos >>= 1) {\n data[pos] = op(data[2 * pos], data[2 * pos + 1]);\n }\n }\n T prod(int left, int right) {\n assert(0 <= left && left <= n);\n assert(left <= right && right <= n);\n T lhs = e();\n T rhs = e();\n for (left += n, right += n; left < right; left >>= 1, right >>= 1) {\n if (left & 1) lhs = op(lhs, data[left++]);\n if (right & 1) rhs = op(data[--right], rhs);\n }\n return op(lhs, rhs);\n }\n};\n\nconst int ROOT = 0;\n\nstruct HLD {\n std::vector<int> head;\n std::vector<int> in;\n std::vector<int> out;\n std::vector<int> parent;\n std::vector<int> depth;\n\n HLD(std::vector<std::vector<int>> graph) {\n int n = graph.size();\n {\n std::vector<int> longest_path(n);\n auto dfs = [&](auto self, int u, int p) -> int {\n int longest_path_id = 0;\n for (int i = 0; i < (int)graph[u].size(); i++) {\n int v = graph[u][i];\n if (v == p) continue;\n if (chmax(longest_path[u], self(self, v, u) + 1)) {\n longest_path_id = i;\n }\n }\n if (longest_path_id != 0) {\n std::swap(graph[u][longest_path_id], graph[u][0]);\n }\n return longest_path[u];\n };\n dfs(dfs, ROOT, ROOT);\n }\n\n head.assign(n, -1);\n in.assign(n, 0);\n out.assign(n, 0);\n parent.assign(n, 0);\n depth.assign(n, 0);\n {\n int now = 0;\n auto dfs = [&](auto self, int u, int p) -> void {\n if (head[u] == -1) head[u] = u;\n parent[u] = p;\n in[u] = now++;\n for (int i = 0; i < (int)graph[u].size(); i++) {\n int v = graph[u][i];\n if (v == p) continue;\n if (i == 0) head[v] = head[u];\n depth[v] = depth[u] + 1;\n self(self, v, u);\n }\n out[u] = now;\n };\n dfs(dfs, ROOT, ROOT);\n }\n }\n int lca(int lhs, int rhs) {\n if (depth[head[lhs]] < depth[head[rhs]]) std::swap(lhs, rhs);\n while (head[lhs] != head[rhs]) {\n lhs = parent[head[lhs]];\n if (depth[head[lhs]] < depth[head[rhs]]) std::swap(lhs, rhs);\n }\n if (depth[lhs] < depth[rhs]) return lhs;\n else return rhs;\n }\n using Interval = std::pair<int, int>;\n using Intervals = std::vector<Interval>;\n\n // for vertex\n int vertex(int pos) {\n return in[pos];\n }\n Interval subtree(int subroot) {\n return {in[subroot], out[subroot]};\n }\n std::pair<Intervals, Intervals> path(int lhs, int rhs) {\n int subroot = lca(lhs, rhs);\n auto lca_to_lhs = from_subroot(subroot, lhs);\n auto lca_to_rhs = from_subroot(subroot, rhs);\n lca_to_lhs.insert(lca_to_lhs.begin(), {in[subroot], in[subroot] + 1});\n return {lca_to_lhs, lca_to_rhs};\n }\n // lhs -> ... -> rhs\n // lhsを含まない\n Intervals from_subroot(int lhs, int rhs) {\n Intervals intervals;\n assert(depth[lhs] <= depth[rhs]);\n while (head[lhs] != head[rhs]) {\n intervals.emplace_back(in[head[rhs]], in[rhs] + 1);\n rhs = parent[head[rhs]];\n }\n intervals.emplace_back(in[lhs] + 1, in[rhs] + 1);\n std::reverse(intervals.begin(), intervals.end());\n return intervals;\n }\n};\n\nint main() {\n int n;\n std::cin >> n;\n std::vector<char> vertex(n);\n for (int i = 0; i < n; i++) std::cin >> vertex[i];\n std::vector graph(n, std::vector<int>());\n for (int i = 0; i + 1 < n; i++) {\n int u, v;\n std::cin >> u >> v;\n u--; v--;\n graph[u].push_back(v);\n graph[v].push_back(u);\n }\n HLD hld(graph);\n SegmentTree<Hash, op, e> segtree(n);\n for (int i = 0; i < n; i++) {\n segtree.set(hld.vertex(i), Hash(vertex[i]));\n }\n\n int q;\n std::cin >> q;\n std::set<long long> str;\n while (q--) {\n int t;\n std::cin >> t;\n if (t == 1) {\n int u, v;\n std::cin >> u >> v;\n u--; v--;\n auto [lhs, rhs] = hld.path(u, v);\n Hash lca_to_u = e();\n for (auto [l, r]: lhs) {\n lca_to_u = op(lca_to_u, segtree.prod(l, r));\n }\n Hash lca_to_v = e();\n for (auto [l, r]: rhs) {\n lca_to_v = op(lca_to_v, segtree.prod(l, r));\n }\n auto hash = op(reverse(lca_to_u), lca_to_v);\n str.insert(hash.eval());\n std::cout << str.size() << '\\n';\n } else {\n int k;\n char c;\n std::cin >> k >> c;\n k--;\n segtree.set(hld.vertex(k), Hash(c));\n }\n }\n}", "accuracy": 1, "time_ms": 270, "memory_kb": 38724, "score_of_the_acc": -0.317, "final_rank": 13 }, { "submission_id": "aoj_0478_8810404", "code_snippet": "#include <bits/stdc++.h>\n\nconstexpr long long MOD = 998244353;\n\nstruct Data {\n long long coef;\n long long constant;\n Data(long long a = 1, long long b = 0): coef((a % MOD + MOD) % MOD), constant((b % MOD + MOD) % MOD) {}\n long long eval() {\n return constant;\n }\n};\n\n// Data e() {\n// return Data(0, 0);\n// }\n\nData op(Data lhs, Data rhs) {\n return Data(lhs.coef * rhs.coef, lhs.coef * rhs.constant + lhs.constant);\n}\n\nstruct Hash {\n static constexpr int B = 2;\n static constexpr long long BASE[B] = {12045, 13501};\n static constexpr long long BASE_INV[B] = {456067968, 364295232};\n std::array<Data, B> ord, rev;\n Hash(std::array<Data, B> a, std::array<Data, B> b): ord(a), rev(b) {}\n Hash(long long val) {\n if (val >= 0) {\n ord = {Data(BASE[0], val), Data(BASE[1], val)};\n rev = {Data(BASE[0], val), Data(BASE[1], val)};\n } else {\n ord = {Data(BASE_INV[0], (val + MOD) * BASE_INV[0]), Data(BASE_INV[1], (val + MOD) * BASE_INV[1])};\n rev = {Data(BASE_INV[0], (val + MOD) * BASE_INV[0]), Data(BASE_INV[1], (val + MOD) * BASE_INV[1])};\n }\n }\n long long eval() {\n long long lhs = ord[0].eval();\n long long rhs = ord[1].eval();\n return lhs * MOD + rhs;\n }\n};\n\nHash e() {\n return Hash({Data(), Data()}, {Data(), Data()});\n}\n\nHash op(Hash lhs, Hash rhs) {\n Hash hash = e();\n for (int i = 0; i < Hash::B; i++) {\n hash.ord[i] = op(lhs.ord[i], rhs.ord[i]);\n }\n for (int i = 0; i < Hash::B; i++) {\n hash.rev[i] = op(rhs.rev[i], lhs.rev[i]);\n }\n return hash;\n}\n\nHash reverse(Hash hash) {\n std::swap(hash.ord, hash.rev);\n return hash;\n}\n\ntemplate <class T, T (*op)(T, T), T (*e)()>\nstruct SegmentTree {\n int n;\n std::vector<T> data;\n SegmentTree(int n): n(n), data(2 * n, e()) {}\n void set(int pos, T elem) {\n pos += n;\n data[pos] = elem;\n for (pos >>= 1; pos > 0; pos >>= 1) {\n data[pos] = op(data[2 * pos], data[2 * pos + 1]);\n }\n }\n T prod(int left, int right) {\n T lhs = e();\n T rhs = e();\n for (left += n, right += n; left < right; left >>= 1, right >>= 1) {\n if (left & 1) lhs = op(lhs, data[left++]);\n if (right & 1) rhs = op(data[--right], rhs);\n }\n return op(lhs, rhs);\n }\n};\n\nconst int ROOT = 0;\n\nstruct LCA {\n static constexpr int LOG = 20;\n std::vector<int> depth;\n std::array<std::vector<int>, LOG + 1> data;\n LCA(const std::vector<std::vector<int>>& graph) {\n int n = graph.size();\n depth.assign(n, 0);\n for (int i = 0; i <= LOG; i++) data[i].assign(n, ROOT);\n auto dfs = [&](auto self, int u, int p) -> void {\n data[0][u] = p;\n for (auto v: graph[u]) {\n if (v == p) continue;\n depth[v] = depth[u] + 1;\n self(self, v, u);\n }\n };\n dfs(dfs, ROOT, ROOT);\n for (int i = 0; i < LOG; i++) {\n for (int j = 0; j < n; j++) {\n data[i + 1][j] = data[i][data[i][j]];\n }\n }\n }\n int get(int lhs, int rhs) {\n if (depth[lhs] < depth[rhs]) std::swap(lhs, rhs);\n int diff = depth[lhs] - depth[rhs];\n for (int i = 0; i < LOG; i++) {\n if (diff & (1 << i)) {\n lhs = data[i][lhs];\n }\n }\n assert(depth[lhs] == depth[rhs]);\n if (lhs == rhs) return lhs;\n for (int i = LOG; i >= 0; i--) {\n if (data[i][lhs] != data[i][rhs]) {\n lhs = data[i][lhs];\n rhs = data[i][rhs];\n }\n }\n assert(lhs != rhs);\n assert(data[0][lhs] == data[0][rhs]);\n return data[0][lhs];\n }\n int ancester(int u, int v) {\n if (u == v) return v;\n int diff = depth[v] - depth[u] - 1;\n for (int i = 0; i < LOG; i++) {\n if (diff & (1 << i)) {\n v = data[i][v];\n }\n }\n assert(data[0][v] == u);\n return v;\n }\n};\n\nint main() {\n int n;\n std::cin >> n;\n std::vector<char> vertex(n);\n for (int i = 0; i < n; i++) std::cin >> vertex[i];\n std::vector graph(n, std::vector<int>());\n for (int i = 0; i + 1 < n; i++) {\n int u, v;\n std::cin >> u >> v;\n u--; v--;\n graph[u].push_back(v);\n graph[v].push_back(u);\n }\n std::vector<int> in(n), out(n);\n {\n int now = 0;\n auto dfs = [&](auto self, int u, int p) -> void {\n in[u] = now++;\n for (auto v: graph[u]) {\n if (v == p) continue;\n self(self, v, u);\n }\n out[u] = now++;\n };\n dfs(dfs, ROOT, ROOT);\n assert(2 * n == now);\n }\n LCA lca(graph);\n\n SegmentTree<Hash, op, e> segtree(2 * n);\n // auto set = [&](int pos, long long val) {\n // Data data(val);\n // segtree.set(pos, Hash({data, data}, {data, data}));\n // };\n\n for (int i = 0; i < n; i++) {\n segtree.set(in[i], Hash((int)vertex[i]));\n segtree.set(out[i], Hash(-1 * (int)vertex[i]));\n }\n\n int q;\n std::cin >> q;\n std::set<long long> str;\n while (q--) {\n int t;\n std::cin >> t;\n if (t == 1) {\n int u, v;\n std::cin >> u >> v;\n u--; v--;\n int w = lca.get(u, v);\n if (u == w || v == w) {\n Hash hash = e();\n if (u == w) {\n hash = segtree.prod(in[w], out[v]);\n } else {\n hash = segtree.prod(in[w], out[u]);\n hash = reverse(hash);\n }\n str.insert(hash.eval());\n } else {\n Hash w_to_u = segtree.prod(in[lca.ancester(w, u)], out[u]);\n Hash w_to_v = segtree.prod(in[lca.ancester(w, v)], out[v]);\n auto hash = op(op(reverse(w_to_u), Hash(vertex[w])), w_to_v);\n str.insert(hash.eval());\n }\n std::cout << str.size() << '\\n';\n } else {\n int k;\n char c;\n std::cin >> k >> c;\n k--;\n segtree.set(in[k], Hash((int)c));\n segtree.set(out[k], Hash(-1 * (int)c));\n vertex[k] = c;\n }\n }\n}", "accuracy": 1, "time_ms": 380, "memory_kb": 57084, "score_of_the_acc": -0.6813, "final_rank": 15 }, { "submission_id": "aoj_0478_8468612", "code_snippet": "#include\"bits/stdc++.h\"\n#define overload(a,b,c,d,...) d\n#define rep1(n) for(ll _=0;_<(ll)n;++_)\n#define rep2(i,n) for(ll i=0;i<(ll)n;++i)\n#define rep3(i,a,b) for(ll i=(ll)a;i<(ll)b;++i)\n#define rep(...) overload(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)\n#define rrep1(i,n) for(ll i=(ll)n-1;i>=0;--i)\n#define rrep2(i,a,b) for(ll i=(ll)b-1;i>=(ll)a;--i)\n#define rrep(...) overload(__VA_ARGS__,rrep2,rrep1)(__VA_ARGS__)\n#define all(x) (x).begin(),(x).end()\n#define rall(x) (x).rbegin(),(x).rend()\n#define eb emplace_back\n#define pb push_back\nusing namespace std;\nusing ll=long long;\nusing ull=unsigned long long;\nusing ld=long double;\nusing vl=vector<ll>;\ntemplate<typename T,typename U>inline constexpr bool chmin(T&a,const U&b){return (a>b?a=b,true:false);}\ntemplate<typename T,typename U>inline constexpr bool chmax(T&a,const U&b){return (a<b?a=b,true:false);}\nstatic constexpr ll inf=numeric_limits<ll>::max()/2;\nstatic constexpr ull mod=(1ull<<61)-1;\nstatic const ull base=random_device()()%mod;\null calc_mod(ull a){\n\tull ret=(a&mod)+(a>>61);\n\tif(ret>=mod)ret-=mod;\n\treturn ret;\n}\null add(ull a,ull b){\n\tull ret=a+b;\n\tif(ret>=mod)ret-=mod;\n\treturn ret;\n}\null mul(ull a,ull b){\n\t__uint128_t c=(__uint128_t)a*b;\n\treturn add(c&mod,c>>61);\n}\nstruct Str{\n\tprivate:\n\tull hash,bs;\n\tpublic:\n\tStr():hash(0),bs(1){}\n\tStr(char c):hash(c),bs(base){}\n\tull get_hash()const{return hash;}\n\tfriend Str operator+(const Str&lhs,const Str&rhs){\n\t\tStr ret;\n\t\tret.hash=add(mul(rhs.bs,lhs.hash),rhs.hash);\n\t\tret.bs=mul(rhs.bs,lhs.bs);\n\t\treturn ret;\n\t}\n};\nstruct segtree{\n\tprivate:\n\tll sz;\n\tvector<Str>seg;\n\tpublic:\n\tsegtree():segtree(0){}\n\tsegtree(ll n){\n\t\tsz=1;\n\t\twhile(sz<n)sz<<=1;\n\t\tseg.resize(sz<<1);\n\t}\n\tsegtree(const vector<Str>&v){\n\t\tconst int n=v.size();\n\t\tsz=1;\n\t\twhile(sz<n)sz<<=1;\n\t\tseg.resize(sz<<1);\n\t\trep(i,n)seg[sz+i]=v[i];\n\t\trrep(i,sz)seg[i]=seg[i<<1]+seg[i<<1|1];\n\t}\n\tStr query(int l,int r)const{\n\t\tl+=sz,r+=sz;\n\t\tStr lhs,rhs;\n\t\twhile(l!=r){\n\t\t\tif(l&1)lhs=lhs+seg[l++];\n\t\t\tif(r&1)rhs=seg[--r]+rhs;\n\t\t\tl>>=1,r>>=1;\n\t\t}\n\t\treturn lhs+rhs;\n\t}\n\tvoid update(int i,const Str&v){\n\t\ti+=sz;\n\t\tseg[i]=v;\n\t\twhile(i>>=1){\n\t\t\tseg[i]=seg[i<<1]+seg[i<<1|1];\n\t\t}\n\t}\n};\nstruct HLD{\n\tprivate:\n\tint n,root,cnt;\n\tvector<int>subsz,head,in,out,par;\n\tvector<vector<int>>g;\n\tvector<vector<pair<ll,ll>>>st;\n\tint szdfs(int u,int p=-1){\n\t\tsubsz[u]=1;\n\t\tfor(auto&&e:g[u]){\n\t\t\tif(e==p)continue;\n\t\t\tsubsz[u]+=szdfs(e,u);\n\t\t}\n\t\treturn subsz[u];\n\t}\n\tvoid bldfs(int u,int p=-1){\n\t\tpar[u]=p;\n\t\tin[u]=cnt++;\n\t\tint idx=-1;\n\t\tfor(auto&&e:g[u]){\n\t\t\tif(e==p)continue;\n\t\t\tif(idx==-1||subsz[idx]<subsz[e])idx=e;\n\t\t}\n\t\tif(idx!=-1){\n\t\t\thead[idx]=head[u];\n\t\t\tbldfs(idx,u);\n\t\t}\n\t\tfor(auto&&e:g[u]){\n\t\t\tif(e==idx||e==p)continue;\n\t\t\thead[e]=e;\n\t\t\tbldfs(e,u);\n\t\t}\n\t\tout[u]=cnt;\n\t}\n\tvoid init(){\n\t\tn=g.size();\n\t\tsubsz.assign(n,-1);\n\t\tszdfs(root);\n\t\tcnt=0;\n\t\thead.assign(n,-1);\n\t\thead[root]=root;\n\t\tin.resize(n);\n\t\tout.resize(n);\n\t\tpar.resize(n);\n\t\tst.resize(n);\n\t\tbldfs(root,-1);\n\t}\n\tpublic:\n\tHLD(const vector<vector<int>>&g,int root=0):root(root),g(g){\n\t\tinit();\n\t}\n\tint lca(int u,int v)const{\n\t\twhile(head[u]!=head[v]){\n\t\t\tif(in[u]>in[v])swap(u,v);\n\t\t\tv=par[head[v]];\n\t\t}\n\t\treturn in[u]<in[v]?u:v;\n\t}\n\tvector<pair<int,int>>up_path(int u,int v){\n\t\tvector<pair<int,int>>ret;\n\t\twhile(head[u]!=head[v]){\n\t\t\tret.emplace_back(in[u],in[head[u]]);\n\t\t\tu=par[head[u]];\n\t\t}\n\t\tif(u!=v)ret.emplace_back(in[u],in[v]+1);\n\t\treturn ret;\n\t}\n\tvector<pair<int,int>>down_path(int u,int v){\n\t\tvector<pair<int,int>>ret;\n\t\twhile(head[u]!=head[v]){\n\t\t\tret.emplace_back(in[head[v]],in[v]);\n\t\t\tv=par[head[v]];\n\t\t}\n\t\tret.emplace_back(in[u],in[v]);\n\t\treverse(all(ret));\n\t\treturn ret;\n\t}\n\tint get_id(int v)const{return in[v];}\n};\nint main(){\n\tint n;cin>>n;\n\tvector<Str>s(n);\n\trep(i,n){\n\t\tchar c;cin>>c;\n\t\ts[i]=Str(c);\n\t}\n\tvector<vector<int>>g(n);\n\trep(i,n-1){\n\t\tint u,v;cin>>u>>v;u--,v--;\n\t\tg[u].emplace_back(v);\n\t\tg[v].emplace_back(u);\n\t}\n\tHLD hld(g);\n\tvector<Str>t(n);\n\trep(i,n)t[hld.get_id(i)]=s[i];\n\tsegtree seg1(t);\n\treverse(all(t));\n\tsegtree seg2(t);\n\tint q;cin>>q;\n\tset<ull>st;\n\tauto f=[&](int l,int r)->Str {\n\t\tif(l>=r){\n\t\t\treturn seg2.query(n-1-l,n-r);\n\t\t}\n\t\treturn seg1.query(l,r+1);\n\t};\n\twhile(q--){\n\t\tint t;cin>>t;\n\t\t//cerr<<\"t:\"<<t<<endl;\n\t\tif(t==1){\n\t\t\tint l,r;cin>>l>>r;l--,r--;\n\t\t\t//cerr<<l<<r<<endl;\n\t\t\tconst int lc=hld.lca(l,r);\n\t\t\tauto a=hld.up_path(l,lc);\n\t\t\tauto b=hld.down_path(lc,r);\n\t\t\tStr res;\n\t\t\tfor(auto [idl,idr]:a)res=res+f(idl,idr);\n\t\t\tfor(auto [idl,idr]:b)res=res+f(idl,idr);\n\t\t\tst.emplace(res.get_hash());\n\t\t\tcout<<st.size()<<endl;\n\t\t}\n\t\telse{\n\t\t\tint k;cin>>k;k--;\n\t\t\tchar c;cin>>c;\n\t\t\ts[k]=Str(c);\n\t\t\tseg1.update(hld.get_id(k),s[k]);\n\t\t\tseg2.update(n-1-hld.get_id(k),s[k]);\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 180, "memory_kb": 42208, "score_of_the_acc": -0.304, "final_rank": 11 }, { "submission_id": "aoj_0478_6988490", "code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 0478.cc: Tree Keyboard\n */\n\n#include<cstdio>\n#include<vector>\n#include<set>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\nconst int BN = 17;\nconst int P = 40063;\nconst int MOD = 1000000021;\n\n/* typedef */\n\ntypedef vector<int> vi;\ntypedef set<int> si;\n\ntemplate<const int MOD>\nstruct MI {\n int v;\n MI(): v() {}\n MI(int _v): v(_v % MOD) {}\n MI(long long _v): v(_v % MOD) {}\n\n MI operator+(const MI m) const { return MI(v + m.v); }\n MI operator-(const MI m) const { return MI(v + MOD - m.v); }\n MI operator*(const MI m) const { return MI((long long)v * m.v); }\n MI operator-() const { return MI(MOD - v); }\n\n MI &operator+=(const MI m) { return (*this = *this + m); }\n MI &operator-=(const MI m) { return (*this = *this - m); }\n MI &operator*=(const MI m) { return (*this = *this * m); }\n\n bool operator==(const MI m) const { return v == m.v; }\n bool operator!=(const MI m) const { return v != m.v; }\n\n MI pow(int n) const { // a^n % MOD\n MI pm = 1, a = *this;\n while (n > 0) {\n if (n & 1) pm *= a;\n a *= a;\n n >>= 1;\n }\n return pm;\n }\n\n MI inv() const { return pow(MOD - 2); }\n MI operator/(const MI m) const { return *this * m.inv(); }\n MI &operator/=(const MI m) { return (*this = *this / m); }\n};\n\ntypedef MI<MOD> mi;\n\ntemplate <typename T>\nstruct SegTreeSum {\n int e2;\n vector<T> nodes;\n T defv;\n SegTreeSum() {}\n\n void init(int n, T _defv) {\n defv = _defv;\n for (e2 = 1; e2 < n; e2 <<= 1);\n nodes.assign(e2 * 2, defv);\n }\n\n T &geti(int i) { return nodes[e2 - 1 + i]; }\n void seti(int i, T v) { geti(i) = v; }\n\n void setall() {\n for (int j = e2 - 2; j >= 0; j--)\n nodes[j] = nodes[j * 2 + 1] + nodes[j * 2 + 2];\n }\n\n void set(int i, T v) {\n int j = e2 - 1 + i;\n nodes[j] = v;\n while (j > 0) {\n j = (j - 1) / 2;\n nodes[j] = nodes[j * 2 + 1] + nodes[j * 2 + 2];\n }\n }\n\n T sum_range(int r0, int r1, int k, int i0, int i1) {\n if (r1 <= i0 || i1 <= r0) return defv;\n if (r0 <= i0 && i1 <= r1) return nodes[k];\n\n int im = (i0 + i1) / 2;\n T v0 = sum_range(r0, r1, k * 2 + 1, i0, im);\n T v1 = sum_range(r0, r1, k * 2 + 2, im, i1);\n return v0 + v1;\n }\n T sum_range(int r0, int r1) { return sum_range(r0, r1, 0, 0, e2); }\n};\n\n/* global variables */\n\nchar ks[MAX_N];\nvi nbrs[MAX_N];\nint ps[MAX_N][BN], ds[MAX_N], cis[MAX_N], ls[MAX_N], rs[MAX_N];\nmi pes[MAX_N + 1], invpes[MAX_N + 1];\nSegTreeSum<mi> st0, st1;\nsi hs[MAX_N + 1];\n\n/* subroutines */\n\ninline void prep_rhash(int n) {\n pes[0] = invpes[0] = 1;\n pes[1] = P;\n invpes[1] = pes[1].inv();\n for (int i = 2; i <= n; i++) {\n pes[i] = pes[i - 1] * P;\n invpes[i] = invpes[i - 1] * invpes[1];\n }\n}\n\ninline int ancestor(int u, int d) {\n for (int i = BN - 1; i >= 0; i--)\n if ((d >> i) & 1) u = ps[u][i];\n return u;\n}\n\nint find_lca(int u, int v) {\n if (ds[u] > ds[v]) swap(u, v);\n\n v = ancestor(v, ds[v] - ds[u]);\n if (u == v) return u;\n\n for(int i = BN - 1; i >= 0; i--)\n if (ps[u][i] != ps[v][i])\n u = ps[u][i], v = ps[v][i];\n return ps[u][0];\n}\n\n/* main */\n\nint main() {\n int n;\n scanf(\"%d\", &n);\n\n for (int i = 0; i < n; i++) {\n char s[4];\n scanf(\"%s\", s);\n ks[i] = s[0];\n }\n\n for (int i = 1; i < n; i++) {\n int u, v;\n scanf(\"%d%d\", &u, &v);\n u--, v--;\n nbrs[u].push_back(v);\n nbrs[v].push_back(u);\n }\n\n int maxd = 0;\n ps[0][0] = -1, ds[0] = 0;\n for (int u = 0, l = 0; u >= 0;) {\n vi &nbru = nbrs[u];\n int up = ps[u][0];\n\n if (cis[u] == 0) ls[u] = l++;\n if (cis[u] < nbru.size()) {\n int v = nbru[cis[u]++];\n if (v != up) {\n\tps[v][0] = u, ds[v] = ds[u] + 1;\n\tmaxd = max(maxd, ds[v]);\n\tu = v;\n }\n }\n else {\n rs[u] = l++;\n u = up;\n }\n }\n //printf(\"maxd=%d\\n\", maxd);\n\n for (int i = 0; i < BN - 1; i++)\n for (int u = 0; u < n; u++)\n ps[u][i + 1] = (ps[u][i] >= 0) ? ps[ps[u][i]][i] : -1;\n\n prep_rhash(n);\n st0.init(n * 2, 0);\n st1.init(n * 2, 0);\n\n for (int u = 0; u < n; u++) {\n mi pk0 = pes[maxd - ds[u]] * ks[u];\n mi pk1 = pes[ds[u]] * ks[u];\n st0.seti(ls[u], pk0);\n st0.seti(rs[u], -pk0);\n st1.seti(ls[u], pk1);\n st1.seti(rs[u], -pk1);\n }\n st0.setall();\n st1.setall();\n\n int qn;\n scanf(\"%d\", &qn);\n\n for (int cnt = 0; qn--;) {\n int op;\n scanf(\"%d\", &op);\n\n if (op == 1) {\n int s, t;\n scanf(\"%d%d\", &s, &t);\n s--, t--;\n\n int w = find_lca(s, t);\n //printf(\"s=%d, t=%d, w=%d\\n\", s, t, w);\n\n int v, l;\n if (w == s) {\n\tmi e = st1.sum_range(ls[w], ls[t] + 1) * invpes[ds[w]];\n\tv = e.v;\n\tl = ds[t] - ds[w] + 1;\n }\n else if (w == t) {\n\tmi e = st0.sum_range(ls[w], ls[s] + 1) * invpes[maxd - ds[s]];\n\tv = e.v;\n\tl = ds[s] - ds[w] + 1;\n }\n else {\n\tmi e0 = st0.sum_range(ls[w], ls[s] + 1) * invpes[maxd - ds[s]];\n\tint l0 = ds[s] - ds[w] + 1;\n\tmi e1 = st1.sum_range(ls[w] + 1, ls[t] + 1) * invpes[ds[w] + 1];\n\tint l1 = ds[t] - ds[w];\n\tmi e = e0 + e1 * pes[l0];\n\tv = e.v;\n\tl = l0 + l1;\n }\n //printf(\"v=%d, l=%d\\n\", v, l);\n\n if (hs[l].find(v) == hs[l].end()) {\n\ths[l].insert(v);\n\tcnt++;\n }\n\n printf(\"%d\\n\", cnt);\n }\n else {\n int k;\n char cs[4];\n scanf(\"%d%s\", &k, cs); k--;\n char c = cs[0];\n\n ks[k] = c;\n mi pk0 = pes[maxd - ds[k]] * ks[k];\n mi pk1 = pes[ds[k]] * ks[k];\n st0.set(ls[k], pk0);\n st0.set(rs[k], -pk0);\n st1.set(ls[k], pk1);\n st1.set(rs[k], -pk1);\n }\n }\n return 0;\n}", "accuracy": 0.8235294117647058, "time_ms": 90, "memory_kb": 30648, "score_of_the_acc": -0.0592, "final_rank": 18 }, { "submission_id": "aoj_0478_6987202", "code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 0478.cc: Tree Keyboard\n */\n\n#include<cstdio>\n#include<vector>\n#include<set>\n#include<algorithm>\n \nusing namespace std;\n\n/* constant */\n\nconst int MAX_N = 100000;\nconst int BN = 17;\nconst int P = 4073;\nconst int MOD = 1000000009;\n\n/* typedef */\n\ntypedef vector<int> vi;\ntypedef set<int> si;\n\ntemplate<const int MOD>\nstruct MI {\n int v;\n MI(): v() {}\n MI(int _v): v(_v % MOD) {}\n MI(long long _v): v(_v % MOD) {}\n\n MI operator+(const MI m) const { return MI(v + m.v); }\n MI operator-(const MI m) const { return MI(v + MOD - m.v); }\n MI operator*(const MI m) const { return MI((long long)v * m.v); }\n MI operator-() const { return MI(MOD - v); }\n\n MI &operator+=(const MI m) { return (*this = *this + m); }\n MI &operator-=(const MI m) { return (*this = *this - m); }\n MI &operator*=(const MI m) { return (*this = *this * m); }\n\n bool operator==(const MI m) const { return v == m.v; }\n bool operator!=(const MI m) const { return v != m.v; }\n\n MI pow(int n) const { // a^n % MOD\n MI pm = 1, a = *this;\n while (n > 0) {\n if (n & 1) pm *= a;\n a *= a;\n n >>= 1;\n }\n return pm;\n }\n\n MI inv() const { return pow(MOD - 2); }\n MI operator/(const MI m) const { return *this * m.inv(); }\n MI &operator/=(const MI m) { return (*this = *this / m); }\n};\n\ntypedef MI<MOD> mi;\n\ntemplate <typename T>\nstruct SegTreeSum {\n int e2;\n vector<T> nodes;\n T defv;\n SegTreeSum() {}\n\n void init(int n, T _defv) {\n defv = _defv;\n for (e2 = 1; e2 < n; e2 <<= 1);\n nodes.assign(e2 * 2, defv);\n }\n\n T &geti(int i) { return nodes[e2 - 1 + i]; }\n void seti(int i, T v) { geti(i) = v; }\n\n void setall() {\n for (int j = e2 - 2; j >= 0; j--)\n nodes[j] = nodes[j * 2 + 1] + nodes[j * 2 + 2];\n }\n\n void set(int i, T v) {\n int j = e2 - 1 + i;\n nodes[j] = v;\n while (j > 0) {\n j = (j - 1) / 2;\n nodes[j] = nodes[j * 2 + 1] + nodes[j * 2 + 2];\n }\n }\n\n T sum_range(int r0, int r1, int k, int i0, int i1) {\n if (r1 <= i0 || i1 <= r0) return defv;\n if (r0 <= i0 && i1 <= r1) return nodes[k];\n\n int im = (i0 + i1) / 2;\n T v0 = sum_range(r0, r1, k * 2 + 1, i0, im);\n T v1 = sum_range(r0, r1, k * 2 + 2, im, i1);\n return v0 + v1;\n }\n T sum_range(int r0, int r1) { return sum_range(r0, r1, 0, 0, e2); }\n};\n\n/* global variables */\n\nchar ks[MAX_N];\nvi nbrs[MAX_N];\nint ps[MAX_N][BN], ds[MAX_N], cis[MAX_N], ls[MAX_N], rs[MAX_N];\nmi pes[MAX_N + 1], invpes[MAX_N + 1];\nSegTreeSum<mi> st0, st1;\nsi hs[MAX_N + 1];\n\n/* subroutines */\n\ninline void prep_rhash(int n) {\n pes[0] = invpes[0] = 1;\n pes[1] = P;\n invpes[1] = pes[1].inv();\n for (int i = 2; i <= n; i++) {\n pes[i] = pes[i - 1] * P;\n invpes[i] = invpes[i - 1] * invpes[1];\n }\n}\n\ninline int ancestor(int u, int d) {\n for (int i = BN - 1; i >= 0; i--)\n if ((d >> i) & 1) u = ps[u][i];\n return u;\n}\n\nint find_lca(int u, int v) {\n if (ds[u] > ds[v]) swap(u, v);\n\n v = ancestor(v, ds[v] - ds[u]);\n if (u == v) return u;\n\n for(int i = BN - 1; i >= 0; i--)\n if (ps[u][i] != ps[v][i])\n u = ps[u][i], v = ps[v][i];\n return ps[u][0];\n}\n\n/* main */\n\nint main() {\n int n;\n scanf(\"%d\", &n);\n\n for (int i = 0; i < n; i++) {\n char s[4];\n scanf(\"%s\", s);\n ks[i] = s[0];\n }\n\n for (int i = 1; i < n; i++) {\n int u, v;\n scanf(\"%d%d\", &u, &v);\n u--, v--;\n nbrs[u].push_back(v);\n nbrs[v].push_back(u);\n }\n\n int maxd = 0;\n ps[0][0] = -1, ds[0] = 0;\n for (int u = 0, l = 0; u >= 0;) {\n vi &nbru = nbrs[u];\n int up = ps[u][0];\n\n if (cis[u] == 0) ls[u] = l++;\n if (cis[u] < nbru.size()) {\n int v = nbru[cis[u]++];\n if (v != up) {\n\tps[v][0] = u, ds[v] = ds[u] + 1;\n\tmaxd = max(maxd, ds[v]);\n\tu = v;\n }\n }\n else {\n rs[u] = l++;\n u = up;\n }\n }\n //printf(\"maxd=%d\\n\", maxd);\n\n for (int i = 0; i < BN - 1; i++)\n for (int u = 0; u < n; u++)\n ps[u][i + 1] = (ps[u][i] >= 0) ? ps[ps[u][i]][i] : -1;\n\n prep_rhash(maxd);\n st0.init(n * 2, 0);\n st1.init(n * 2, 0);\n\n for (int u = 0; u < n; u++) {\n mi pk0 = pes[maxd - ds[u]] * ks[u];\n mi pk1 = pes[ds[u]] * ks[u];\n st0.seti(ls[u], pk0);\n st0.seti(rs[u], -pk0);\n st1.seti(ls[u], pk1);\n st1.seti(rs[u], -pk1);\n }\n st0.setall();\n st1.setall();\n\n int qn;\n scanf(\"%d\", &qn);\n\n for (int cnt = 0; qn--;) {\n int op;\n scanf(\"%d\", &op);\n\n if (op == 1) {\n int s, t;\n scanf(\"%d%d\", &s, &t);\n s--, t--;\n\n int w = find_lca(s, t);\n //printf(\"s=%d, t=%d, w=%d\\n\", s, t, w);\n\n int v, l;\n if (w == s) {\n\tmi e = st1.sum_range(ls[w], ls[t] + 1) * invpes[ds[w]];\n\tv = e.v;\n\tl = ds[t] - ds[w] + 1;\n }\n else if (w == t) {\n\tmi e = st0.sum_range(ls[w], ls[s] + 1) * invpes[maxd - ds[s]];\n\tv = e.v;\n\tl = ds[s] - ds[w] + 1;\n }\n else {\n\tmi e0 = st0.sum_range(ls[w], ls[s] + 1) * invpes[maxd - ds[s]];\n\tint l0 = ds[s] - ds[w] + 1;\n\tmi e1 = st1.sum_range(ls[w] + 1, ls[t] + 1) * invpes[ds[w] + 1];\n\tint l1 = ds[t] - ds[w];\n\tmi e = e0 + e1 * pes[l0];\n\tv = e.v;\n\tl = l0 + l1;\n }\n //printf(\"v=%d, l=%d\\n\", v, l);\n\n if (hs[l].find(v) == hs[l].end()) {\n\ths[l].insert(v);\n\tcnt++;\n }\n\n printf(\"%d\\n\", cnt);\n }\n else {\n int k;\n char cs[4];\n scanf(\"%d%s\", &k, cs); k--;\n char c = cs[0];\n\n ks[k] = c;\n mi pk0 = pes[maxd - ds[k]] * ks[k];\n mi pk1 = pes[ds[k]] * ks[k];\n st0.set(ls[k], pk0);\n st0.set(rs[k], -pk0);\n st1.set(ls[k], pk1);\n st1.set(rs[k], -pk1);\n }\n }\n return 0;\n}", "accuracy": 0.7647058823529411, "time_ms": 90, "memory_kb": 28376, "score_of_the_acc": -0.0242, "final_rank": 19 }, { "submission_id": "aoj_0478_6950497", "code_snippet": "#include <bits/stdc++.h>\n\nusing std::vector;\nusing std::array;\nusing std::pair;\nusing std::tuple;\n\nusing ll = long long;\nusing ull = unsigned long long;\n\nconstexpr ull MOD = ((ull)1 << 61) - 1;\nconst ull BASE = 0xABCDEF;\n\nconstexpr ull sum(ull a, const ull b) { return (a += b) >= MOD ? a - MOD : a; }\nconstexpr ull dif(ull a, const ull b) { return (a += MOD - b) >= MOD ? a - MOD : a; }\n\nconstexpr ull prod(const ull a, const ull b) {\n __uint128_t ret = (__uint128_t)a * b;\n ret = (ret >> 61) + (ret & MOD);\n return ret >= MOD ? ret - MOD : ret;\n}\n\nstruct String {\n ull x, y, b;\n String() : x(0), y(0), b(1) {}\n explicit String(const char c) : x(c), y(c), b(BASE) {}\n explicit String(const ll x, const ll y, const ll b) : x(x), y(y), b(b) {}\n String operator+(const String& t) const {\n return String(sum(x, prod(t.x, b)), sum(t.y, prod(y, t.b)), prod(b, t.b));\n }\n String rev() const {\n return String(y, x, b);\n }\n};\n\ntemplate <class F>\nstruct Fixed : private F {\n explicit Fixed(F&& f) : F(std::forward<F>(f)) {}\n template <class... Args> decltype(auto) operator()(Args&&... args) const {\n return F::operator()(*this, std::forward<Args>(args)...);\n }\n};\n\ntemplate <class F>\ndecltype(auto) fixed(F&& f) {\n return Fixed<F>(std::forward<F>(f));\n}\n\nstruct Segment {\n int size;\n vector<String> data;\n explicit Segment(const int n) : size(n), data(2 * n) {}\n void set(int i, const char c) {\n i += size;\n data[i] = String(c);\n while (i > 1) {\n i >>= 1;\n data[i] = data[2 * i] + data[2 * i + 1];\n }\n }\n String fold(int l, int r) const {\n l += size;\n r += size;\n String L, R;\n while (l < r) {\n if (l & 1) L = L + data[l++];\n if (r & 1) R = data[--r] + R;\n l >>= 1;\n r >>= 1;\n }\n return L + R;\n }\n};\n\nstruct HLD {\n struct Data {\n int par, sub, in, head;\n };\n vector<Data> node;\n explicit HLD(const vector<vector<int>>& graph) {\n const int n = (int)graph.size();\n node.resize(n);\n fixed([&](auto&& dfs, const int u, const int p) -> void {\n node[u].par = p;\n node[u].sub = 1;\n for (const int v : graph[u]) {\n if (v != p) {\n dfs(v, u);\n node[u].sub += node[v].sub;\n }\n }\n })(0, -1);\n int stamp = 0;\n fixed([&](auto&& dfs, const int u, const int h) -> void {\n node[u].head = h;\n node[u].in = stamp++;\n int s = -1;\n for (const int v : graph[u]) {\n if (v != node[u].par and (s == -1 or node[s].sub < node[v].sub)) {\n s = v;\n }\n }\n if (s == -1) {\n return;\n }\n dfs(s, h);\n for (const int v : graph[u]) {\n if (v != node[u].par and v != s) {\n dfs(v, v);\n }\n }\n })(0, 0);\n }\n int lca(int u, int v) const {\n if (node[u].in > node[v].in) {\n std::swap(u, v);\n }\n while (node[u].in < node[v].in) {\n if (node[u].head == node[v].head) {\n return u;\n }\n v = node[node[v].head].par;\n }\n return v;\n }\n template <class F>\n void path(int low, int high, const F& f) const {\n while (node[low].head != node[high].head) {\n const int h = node[low].head;\n f(h, low);\n low = node[h].par;\n }\n f(high, low);\n }\n int id(const int u) const {\n return node[u].in;\n }\n};\n\nint main() {\n std::ios_base::sync_with_stdio(false);\n std::cin.tie(nullptr);\n int N;\n std::cin >> N;\n vector<char> K(N);\n for (auto& c : K) {\n std::cin >> c;\n }\n vector<vector<int>> graph(N);\n for (int i = 0; i < N - 1; ++i) {\n int u, v;\n std::cin >> u >> v;\n u -= 1, v -= 1;\n graph[u].push_back(v);\n graph[v].push_back(u);\n }\n HLD hld(graph);\n Segment seg(N);\n for (int i = 0; i < N; ++i) {\n seg.set(hld.id(i), K[i]);\n }\n int Q;\n std::cin >> Q;\n std::set<ull> set;\n while (Q--) {\n int t;\n std::cin >> t;\n if (t == 1) {\n int a, b;\n std::cin >> a >> b;\n a -= 1;\n b -= 1;\n const int c = hld.lca(a, b);\n String L, R;\n hld.path(a, c, [&](const int x, const int y) {\n L = seg.fold(hld.id(x), hld.id(y) + 1) + L;\n });\n hld.path(b, c, [&](const int x, const int y) {\n if (x == c) {\n R = seg.fold(hld.id(x) + 1, hld.id(y) + 1) + R;\n } else {\n R = seg.fold(hld.id(x), hld.id(y) + 1) + R;\n }\n });\n set.insert((L.rev() + R).x);\n std::cout << set.size() << '\\n';\n } else {\n int k;\n char c;\n std::cin >> k >> c;\n k -= 1;\n seg.set(hld.id(k), c);\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 110, "memory_kb": 27288, "score_of_the_acc": -0.0222, "final_rank": 1 }, { "submission_id": "aoj_0478_6326791", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\nusing ll=long long;\nconst char newl='\\n';\n\nconstexpr int m[]={1000000007,998244353};\n//原始根：m1…5,m2…3\nconst ll base=12346;\nll base_pow[2][100001];\n\nstruct S{\n ll v1,v2;\n int len;\n S():v1(0),v2(0),len(0){}\n S(char c):v1(c-'a'+1),v2(c-'a'+1),len(1){}\n};\n//aの右にbを結合する\nS mul(S a,S b){\n a.len+=b.len;\n a.v1=(a.v1*base_pow[0][b.len] + b.v1)%m[0];\n a.v2=(a.v2*base_pow[1][b.len] + b.v2)%m[1];\n return a;\n};\nstruct segtree{\n int sz;\n vector<S> val[2];\n segtree(int n):sz(1){\n while(sz<n)sz*=2;\n val[0].resize(2*sz),val[1].resize(2*sz);\n }\n void change(int i,char c){\n S x(c);\n i+=sz;\n val[0][i]=val[1][i]=x;\n i/=2;\n while(i){\n val[0][i]=mul(val[0][2*i],val[0][2*i+1]);\n val[1][i]=mul(val[1][2*i+1],val[1][2*i]);\n i/=2;\n }\n }\n S prod(int l,int r,int d){\n l+=sz;\n r+=sz;\n S ans1,ans2;\n while(l<r){\n if(l&1){\n ans1=(d==0 ? mul(ans1,val[0][l]) : mul(val[1][l],ans1));\n l++;\n }\n if(r&1){\n --r;\n ans2=(d==0 ? mul(val[0][r],ans2) : mul(ans2,val[1][r]));\n }\n l/=2,r/=2;\n }\n return (d==0 ? mul(ans1,ans2) : mul(ans2,ans1));\n }\n};\n\n// やること\n// 分解パート\n// 1.部分木サイズ計算　この時、heavyな辺が子供一覧の先頭に来るようにする\n// 2.頂点に番号を振っていく　この時、nxtなる配列に自分の属する列の一番高い場所を記録する\n// 処理パート\n// 1.lcaの準備\n// 2.クエリ処理（1点クエリはやるだけ、そうでなければlcaまでのパスで分割　非可換なので、頑張る）\n// 実装上の注意：根からの同一パス上では、inが大きいこととより深い頂点であることが同値\nstruct hld{\n int n;\n vector<int> in,next,sz,p;\n vector<vector<int>> c;\n segtree seg;\n hld(const int n,vector<vector<int>> &g):in(n),next(n),sz(n),p(n,-1),c(n),seg(n){\n //p,cをgに沿って更新\n queue<int> q;\n q.emplace(0);\n while(!q.empty()){\n int now=q.front();q.pop();\n for(int w:g[now])if(w!=p[now]){\n p[w]=now;\n c[now].emplace_back(w);\n q.emplace(w);\n }\n }\n int t=0;\n dfs1();\n dfs2(t);\n }\n\n void dfs1(int v=0){\n sz[v]=1;\n for(int& w:c[v]){\n dfs1(w);\n sz[v]+=sz[w];\n if(sz[w] > sz[c[v][0]])swap(w,c[v][0]);\n }\n }\n void dfs2(int& t,int v=0){\n in[v]=t++;\n for(int w:c[v]){\n next[w]=(w==c[v][0] ? next[v]:w);\n dfs2(t,w);\n }\n }\n int lca(int u,int v){\n while(true){\n if(in[u]>in[v])swap(u,v);\n if(next[u]==next[v])return u;\n v=p[next[v]];\n }\n }\n void update(int i,char c){\n seg.change(in[i],c);\n }\n S query(int u,int v){\n int l=lca(u,v);\n S ans1,ans2;\n while(next[u]!=next[l]){\n ans1=mul(ans1,seg.prod(in[next[u]],in[u]+1,1));\n u=p[next[u]];\n }\n ans1=mul(ans1,seg.prod(in[l],in[u]+1,1));\n while(next[v]!=next[l]){\n ans2=mul(seg.prod(in[next[v]],in[v]+1,0),ans2);\n v=p[next[v]];\n }\n //片方ではin[l]を含むとダメ！\n ans2=mul(seg.prod(in[l]+1,in[v]+1,0),ans2);\n return mul(ans1,ans2);\n }\n};\n\nll powmod(ll a,ll b,const int mod){\n if(b==1)return a;\n ll v=powmod(a,b/2,mod);\n v*=v;\n v%=mod;\n if(b&1){\n v*=a;\n v%=mod;\n }\n return v;\n}\n\nint main(){\n rep(i,2)base_pow[i][0]=1;\n rep(i,2)rep(j,100000)base_pow[i][j+1]=base_pow[i][j]*base%m[i];\n\n int n;\n cin >> n;\n vector<char> beg(n);\n rep(i,n)cin >> beg[i];\n vector<vector<int>> g(n);\n rep(i,n-1){\n int u,v;\n cin >> u >> v;\n u--,v--;\n g[u].emplace_back(v);\n g[v].emplace_back(u);\n }\n hld h(n,g);\n rep(i,n)h.update(i,beg[i]);\n\n int q;\n cin >> q;\n set<pair<ll,ll>> st;\n while(q--){\n int com;\n cin >> com;\n if(com==1){\n int s,t;\n cin >> s >> t;\n s--,t--;\n S res=h.query(s,t);\n st.insert({res.v1,res.v2});\n cout << st.size() << newl;\n }\n else{\n int k;\n char c;\n cin >> k >> c;\n k--;\n h.update(k,c);\n }\n }\n}", "accuracy": 1, "time_ms": 200, "memory_kb": 41992, "score_of_the_acc": -0.3155, "final_rank": 12 } ]
aoj_0488_cpp
テレポート移動網 人類は研究の末、ついにテレポート装置を利用した移動網を構築できるようになった。テレポート装置が設置できるのは$1$から$N$までの番号が付いた地点だけで、全部で$M$台のテレポート装置が設置されている。$i$番目のテレポート装置は地点$a_i$に設置されており、移動先$b_i$と使用コスト$f_i$が設定されている。地点$a_i$にいる利用者は使用コスト$f_i$を支払うと地点$b_i$に移動できる。 テレポート装置の利用者は事前に申請をすれば、装置を他の地点に移設できる。装置１台を１つ離れた番号の地点に移設するごとに申請が１回必要で、１回当たり申請コスト$C$がかかる。申請には以下のルールがある。 １回の申請では、装置1台を移設前の地点から番号が１つだけ離れた地点にだけ移設できる。たとえば、地点7にあるテレポート装置は地点6か8だけに移設できる。また、地点1にある装置は2だけに、地点$N$にある装置は$N-1$だけにそれぞれ移設できる。 装置が移設されても、その装置により利用者が移動できる地点や使用コストは移設前と変わらない。 同じ装置の移設は何度でも申請することができる。 同じ装置の移設を何度も申請することで、２つ以上番号が離れた地点へ移設させることができる。たとえば、地点5にある装置を地点8に移設したいときは、5から6、6から7、7から8への各移設のために３回の申請が必要で、そのために$3 \times C$の申請コストがかかる。 あなたは、テレポート装置を利用して地点$1$から地点$N$まで移動する計画を立てているが、使用コストと申請コストの総和をできるだけ少なくして出費を抑えたいと思っている。 テレポート装置の情報と1回あたりの申請コストが与えられたとき、利用者が地点$1$から地点$N$へテレポートだけで移動するのにかかる、使用コストと装置の移設に必要な申請コストの総和の最小値を求めるプログラムを作成せよ。 入力 入力は以下の形式で与えられる。 $N$ $M$ $C$ $a_1$ $b_1$ $f_1$ $a_2$ $b_2$ $f_2$ : $a_M$ $b_M$ $f_M$ １行目に、地点の数$N$ ($2 \leq N \leq 200,000$)、テレポート装置の数$M$ ($1 \leq M \leq 100,000$)、１回あたりの申請コスト$C$ ($1 \leq C \leq 1,000$)が与えられる。続く$M$行に、$i$番目のテレポート装置が設置されている地点の番号$a_i$ ($1 \leq a_i \leq N$)、転送先の地点の番号$b_i$ ($1 \leq b_i \leq N$)、使用コスト$f_i$ ($1 \leq f_i \leq 1,000$)が与えられる。入力はすべて整数である。 出力 コストの総和の最小値を１行に出力する。ただし、どのようにしてもたどり着けない場合は、-1を出力する。 入出力例 入力例１ 9 2 3 3 6 1 5 9 7 出力例１ 17 入力例２ 3 3 1 3 1 1 3 2 1 1 2 1 出力例２ -1 入力例３ 10 4 1 1 9 1 5 10 1 9 5 3 10 5 1 出力例３ 4 申請コスト１を使って地点１０にあるテレポート装置を地点９に移設することで、利用者は地点１から地点１０へ使用コスト３で移動することができるので、コストの総和の最小値は４になる。
[ { "submission_id": "aoj_0488_10875092", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr int BIG_INT = 1'000'000'100;\nconstexpr long BIG_LONG = 1'000'000'000'000'000'100;\n\ntemplate <typename T>\nusing rev_pq = priority_queue<T, vector<T>, greater<T>>;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int n, m, c;\n cin >> n >> m >> c;\n // to, cos\n vector g(n, vector(0, make_pair(0, 0)));\n for (int i = 0; i < m; i++) {\n int a, b, f;\n cin >> a >> b >> f;\n a--, b--;\n g[b].push_back({a, f});\n }\n\n vector<int> dist(n, BIG_INT);\n dist[n - 1] = BIG_INT;\n rev_pq<pair<int, int>> pq;\n pq.push({-1, n - 1});\n while (!pq.empty()) {\n auto [co, now] = pq.top();\n pq.pop();\n if (co == -1) {\n co = 0;\n } else if (dist[now] != co)\n continue;\n\n for (auto [nex, cos] : g[now]) {\n for (int i = nex; i >= 0; i--) {\n int tmp = co + cos + c * (nex - i);\n if (dist[i] > tmp) {\n dist[i] = tmp;\n pq.push({tmp, i});\n } else {\n break;\n }\n }\n for (int i = nex + 1; i < n; i++) {\n int tmp = co + cos + c * (i - nex);\n if (dist[i] > tmp) {\n dist[i] = tmp;\n pq.push({tmp, i});\n } else {\n break;\n }\n }\n }\n }\n cout << (dist[0] == BIG_INT ? -1 : dist[0]) << endl;\n}", "accuracy": 1, "time_ms": 290, "memory_kb": 44536, "score_of_the_acc": -2, "final_rank": 20 }, { "submission_id": "aoj_0488_10874801", "code_snippet": "#include<iostream>\n#include<vector>\n#include<queue>\n#include<array>\nusing namespace std;\nint main()\n{\n int n,m,c;\n cin >> n >> m >> c;\n vector<vector<pair<int,int>>>graph(n);\n for(int i=0;i<m;i++){\n int a,b,f;\n cin >> a >> b >> f;\n a--;\n b--;\n graph[a].push_back(make_pair(b,f));\n }\n\n vector<pair<long long,long long>>dist(n,make_pair(1e18,1e18));\n dist[0]=make_pair(0,0);\n\n priority_queue<array<long long,3>,vector<array<long long,3>>,greater<array<long long,3>>>pq;\n pq.push({0,0,0});\n\n while(pq.size()){\n array<long long,3>hako=pq.top();\n pq.pop();\n\n int a=hako[1],b=hako[2];\n if(b==0 && dist[a].first!=hako[0])continue;\n else if(b==1 && dist[a].second!=hako[0])continue;\n\n long long cost;\n if(b==0)cost=dist[a].first;\n else cost=dist[a].second;\n\n for(int i=0;i<graph[a].size();i++)if(dist[graph[a][i].first].first>cost+graph[a][i].second){\n\tdist[graph[a][i].first].first=cost+graph[a][i].second;\n\tpq.push({dist[graph[a][i].first].first,graph[a][i].first,0});\n }\n\n if(a-1>=0 && dist[a-1].second>cost+c){\n dist[a-1].second=cost+c;\n pq.push({dist[a-1].second,a-1,1});\n }\n if(a+1<n && dist[a+1].second>cost+c){\n dist[a+1].second=cost+c;\n pq.push({dist[a+1].second,a+1,1});\n }\n }\n\n long long ans=dist[n-1].first;\n if(ans==1e18)cout << -1 << endl;\n else cout << ans << endl;\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 15048, "score_of_the_acc": -0.2659, "final_rank": 10 }, { "submission_id": "aoj_0488_10873045", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n, m, c;\n cin >> n >> m >> c;\n vector<vector<array<int, 2>>> G(n);\n bool ok = false;\n for(int i = 0; i < m; i++){\n int u, v, f;\n cin >> u >> v >> f;\n u--; v--;\n G[u].push_back({v, f});\n if(v == n-1) ok = true;\n }\n \n if(!ok){\n cout << -1 << '\\n';\n return 0;\n }\n \n int ans = -1;\n vector<int> dist(n, 1000000009);\n priority_queue<array<int, 2>, vector<array<int, 2>>, greater<array<int, 2>>> Q;\n dist[0] = 0;\n Q.push({0, 0});\n while(!Q.empty()){\n int d = Q.top()[0];\n int pos = Q.top()[1];\n Q.pop();\n \n if(dist[pos] < d) continue;\n \n for(int i = 0; i < (int)G[pos].size(); i++){\n int nex = G[pos][i][0];\n int c = G[pos][i][1];\n if(nex == n-1){\n if(ans == -1) ans = d + c;\n else ans = min(ans, d + c);\n } else {\n if(dist[nex] <= d + c) continue;\n dist[nex] = d + c;\n Q.push({d + c, nex});\n }\n }\n \n if(pos != 0){\n if(dist[pos-1] > d+c){\n dist[pos-1] = d+c;\n Q.push({d+c, pos-1});\n }\n }\n if(pos != n-1){\n if(dist[pos+1] > d+c){\n dist[pos+1] = d+c;\n Q.push({d+c, pos+1});\n }\n }\n }\n \n cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 11556, "score_of_the_acc": -0.12, "final_rank": 2 }, { "submission_id": "aoj_0488_10867566", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nll llINF = 9000000000000000000ll;\n\ntemplate<typename T>\nbool chmin(T &a , T b)\n{\n if(a > b)\n {\n a = b;\n return 1;\n }\n return 0;\n}\n\nint main(){\n ll n,m,c;\n cin>>n>>m>>c;\n vector<vector<pair<int,ll>>> g(2*n);\n for(int i=0;i<n;i++) g[n+i].push_back(make_pair(i,0));\n for(int i=1;i<n;i++)\n {\n g[i].push_back(make_pair(i-1,c));\n g[i-1].push_back(make_pair(i,c));\n }\n for(int i=0;i<m;i++)\n {\n ll a,b,f;\n cin>>a>>b>>f;\n a--,b--;\n g[a].push_back(make_pair(n+b,f));\n }\n \n vector<ll> dist(2*n,llINF);\n dist[0] = 0;\n auto comp = [&](int a , int b){return dist[a] > dist[b];};\n priority_queue<int,vector<int>,decltype(comp)> pq(comp);\n pq.push(0);\n while(!pq.empty())\n {\n int p = pq.top();\n pq.pop();\n for(auto [ps,l] : g[p])\n {\n if(chmin(dist[ps] , dist[p] + l)) pq.push(ps);\n }\n }\n \n /*\n for(int i=0;i<n;i++) cout<<dist[i]<<\" \";\n cout<<endl;\n for(int i=n;i<2*n;i++) cout<<dist[i]<<\" \";\n cout<<endl;\n */\n ll ans = dist.back();\n cout<<(ans == llINF ? -1 : ans)<<endl;\n //cout<<dist.back()<<endl;\n}", "accuracy": 1, "time_ms": 120, "memory_kb": 36272, "score_of_the_acc": -1.0694, "final_rank": 18 }, { "submission_id": "aoj_0488_10857571", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define ll long long\nconst long long mod=998244353;\nconst long long hmod=46216567629137;\nconst long double PI=acos(-1);\nint main(){\n cin.tie(0)->sync_with_stdio(0);\n cout.tie(0);\n int N,M;\n ll C;\n cin>>N>>M>>C;\n int a[M+1],b[M+1];\n ll f[M+1];\n vector<pair<ll,int>>G[N*2+1];\n for(int i=1;i<=M;i++){\n cin>>a[i]>>b[i]>>f[i];\n }\n for(int i=1;i<=N;i++){\n G[i].push_back({0,i+N});\n }\n for(int i=1;i<=N;i++){\n if(i!=1) G[i+N].push_back({C,i-1+N});\n if(i!=N) G[i+N].push_back({C,i+1+N});\n }\n for(int i=1;i<=M;i++){\n G[a[i]+N].push_back({f[i],b[i]});\n }\n priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<pair<ll,int>>>PQ;\n ll dist[N*2+1];\n bool already[N*2+1];\n for(int i=1;i<=N*2;i++){\n dist[i]=2e18;\n already[i]=0;\n }\n dist[1]=0;\n PQ.push({0,1});\n while(!PQ.empty()){\n int pos=PQ.top().second;\n ll cost=PQ.top().first;\n PQ.pop();\n if(already[pos]) continue;\n already[pos]=1;\n rep(i,G[pos].size()){\n int nex=G[pos][i].second;\n ll next_cost=cost+G[pos][i].first;\n if(already[nex]) continue;\n if(next_cost<dist[nex]){\n dist[nex]=next_cost;\n PQ.push({next_cost,nex});\n }\n }\n }\n if(dist[N]==2e18) cout<<\"-1\\n\";\n else cout<<dist[N]<<\"\\n\";\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 38828, "score_of_the_acc": -1.0669, "final_rank": 17 }, { "submission_id": "aoj_0488_10848187", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <numbers>\n#include <cassert>\n#include <numeric>\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pint = pair<int, int>;\ntemplate<typename T>\nusing min_priority_queue = priority_queue<T, vector<T>, greater<T>>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\ntemplate<typename T>\nbool chmax(T & a, const T & b) { if (a < b) { a = b; return true; } return false; }\ntemplate<typename T>\nbool chmin(T & a, const T & b) { if (a > b) { a = b; return true; } return false; }\nconst int inf = 1e9;\nconst ll linf = 1e18;\nint main() {\n int n, m, c; cin >> n >> m >> c;\n vector<vector<pint>> graph(n + 1);\n rep(i, m) {\n int a, b, f; cin >> a >> b >> f;\n a--, b--;\n if (b == n - 1)b++;\n graph[a].emplace_back(b, f);\n }\n rep(i, n - 1) {\n graph[i].emplace_back(i + 1, c);\n graph[i + 1].emplace_back(i, c);\n }\n min_priority_queue<pint> pq;\n vector<int> dist(n + 1, inf);\n pq.emplace(dist[0] = 0, 0);\n while (!pq.empty()) {\n auto [d, v] = pq.top(); pq.pop();\n if (dist[v] < d)continue;\n for (auto [nv, nd] : graph[v]) {\n nd += d;\n if (dist[nv] <= nd)continue;\n pq.emplace(dist[nv] = nd, nv);\n }\n }\n if (dist[n] == inf)cout << -1 << endl;\n else cout << dist[n] << endl;\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 17052, "score_of_the_acc": -0.2466, "final_rank": 8 }, { "submission_id": "aoj_0488_10847013", "code_snippet": "# include <algorithm>\n# include <bitset>\n# include <complex>\n# include <cmath>\n#define _USE_MATH_DEFINES\n#include <assert.h>\n# include <math.h>\n# include <deque>\n# include <exception>\n# include <fstream>\n# include <functional>\n# include <iomanip>\n# include <ios>\n# include <iosfwd>\n# include <iostream>\n# include <istream>\n# include <iterator>\n# include <limits>\n# include <list>\n# include <locale>\n# include <map>\n# include <memory>\n# include <new>\n# include <numeric>\n# include <ostream>\n# include <queue>\n# include <set>\n# include <sstream>\n# include <stack>\n# include <stdexcept>\n# include <streambuf>\n# include <string>\n# include <typeinfo>\n# include <utility>\n# include <valarray>\n# include <vector>\n# include <array>\n# include <atomic>\n# include <chrono>\n# include <condition_variable>\n# include <forward_list>\n# include <future>\n# include <initializer_list>\n# include <mutex>\n# include <random>\n# include <ratio>\n# include <regex>\n# include <scoped_allocator>\n# include <system_error>\n# include <thread>\n# include <tuple>\n# include <typeindex>\n# include <type_traits>\n# include <unordered_map>\n# include <unordered_set>\n# include <bitset>\n#pragma GCC target (\"avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#define rep(i,n) for (ll i = 0;i < (ll)(n);i++)\n#define Yes cout << \"Yes\" << \"\\n\"// YESの短縮\n#define No cout << \"No\" << \"\\n\"// NOの短縮\n#define rtr0 return(0)//return(0)の短縮\n#define gyakugen(x) modpow(x,mod - 2,mod);\n#define agyakugen(x) modpow(x,amod - 2,amod);\n#define st(A) sort(A.begin(),A.end());\n#define rst(A) sort(A.rbegin(),A.rend());\n#define rev(A) reverse(A.begin(),A.end());\nusing namespace std;\n//using namespace ranges;\nusing ll = long long;//63bit型整数型\nusing ld = long double;//doubleよりも長い値を保存できるもの\nusing ull = unsigned long long;//符号がない64bit型整数\n//ld m_pi = 3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679;\nll mod = 998244353;\nll amod = 1000000007;\nll MINF = -5000000000000000000;\nll INF = 5000000000000000000;\nll inf = 2000000000;\nll minf = -2000000000;\nll BAD = -1;\nll zero = 0;\nld EPS = 1e-10;\nvector<ll>randomhash = {(ll)1e9 + 7,(ll)1e9 + 801,((ll)1e8 * 8) + 29,((ll)1e8 * 7) + 159,((ll)1e8 * 9) + 221};\nvector<ll>tate = {0,-1,0,1};//グリッド上の全探索時の四方向の上下のチェック\nvector<ll>yoko = {1,0,-1,0};//グリッド上の全探索時の四方向の右左のチェック\nvector<ll>etate = {0,-1,-1,-1,0,1,1,1};//グリッド上の全探索時の八方向の上下のチェック\nvector<ll>eyoko = {1,1,0,-1,-1,-1,0,1};//グリッド上の全探索時の八方向の右左のチェック\nvector<ll>hexsax = {0,1,1,0,-1,-1};\nvector<ll>hexsay = {1,1,0,-1,-1,0};\n//返り値は素数のリスト。\nvector < bool > isprime;\nvector < ll > Era(int n){//書き方 vector<ll>[] = Era(x); とやるとxまでの素数が出てくる。\n\tisprime.resize(n, true);\n\tvector < ll > res;\n\tisprime[0] = false;\n\tisprime[1] = false;\n\tfor(ll i = 2; i < n; ++i) isprime[i] = true;\n\tfor(ll i = 2; i < n; ++i) {\n\t\tif(isprime[i]) {\n\t\t\tres.push_back(i);\n\t\t\tfor(ll j = i * 2; j < n; j += i) isprime[j] = false;\n\t\t}\n\t}\n\treturn res;\n}\nll ceil_div(ll a, ll b){\n if (b <= 0) return INF; // invalid (分母<=0 のときは不可能と扱う)\n return (a + b - 1) / b;\n}\n//　　　　　　素数判定 21~35\null modmul(ull a,ull b,ull mod) {\n return (ull)a*b%mod;\n}\nll modpow(ll a, ll n, ll mod) {\n\tll res = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) res = res * a % mod;\n\t\ta = a * a % mod;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nlong long npow(long long a, long long n){\n long long res = 1;\n while (n > 0) {\n\t\tif (n & 1) res = res * a;\n\t\ta = a * a;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n// モッドを使った累乗\nlong long isqrt(long long num){\n return((long long)sqrtl(num));\n}\nld get_theta(ld px,ld py,ld fx,ld fy,ld sx,ld sy){\n ld fxv = fx-px;\n ld fyv = fy-py;\n ld sxv = sx-px;\n ld syv = sy-py;\n ld fsv = fxv*sxv + fyv*syv;\n ld pfs = (ld)sqrt(fxv*fxv+fyv*fyv);\n ld pss = (ld)sqrt(sxv*sxv+syv*syv);\n return acos(fsv/(pfs*pss))*180/M_PI;\n};\nld Euclidean_distance(ll x1,ll y1,ll x2,ll y2){\n ld x = abs((ld)x1 - (ld)x2);\n ld y = abs((ld)y1 - (ld)y2);\n return sqrt((x*x) + (y*y));\n};\nll Manhattan_distance(ll x1,ll y1,ll x2,ll y2){\n return abs(x1-x2)+abs(y1-y2);\n};\nvoid change_bit(ll N,ll start,vector<ll>&X){\n for(ll i = start;i>=0;i--){\n ll a = npow(2,i);\n if(N/a==1){\n X[i]=1;\n N-=a;\n }\n }\n}\nll popcount(ll x) {\n int count = 0;\n while (x) {\n count += x & 1;\n x >>= 1;\n }\n return count;\n}\n\nll cutup(ll a,ll b){\n return (a+b-1)/b;\n}\nvoid Run_Length_Encoding(vector<ll>A,vector<pair<ll,ll>>&RLE){\n RLE.push_back({A[0],1});\n ll N = A.size();\n for(int i = 1;i<N;i++){\n if(RLE[RLE.size()-1].first==A[i])RLE[RLE.size()-1].second++;\n else RLE.push_back({A[i],1});\n }\n}\nbool is_in_grid(ll i,ll ii,ll H,ll W){\n bool res = false;\n if(i>=0&&i<H&&ii>=0&&ii<W)res=true;\n return res;\n}\ntemplate<class T>\nstruct rolling_hash{\n vector<ull>Power,hash,InvPower;\n ll B = 0;\n ll MOD = 0;\n void set_number(ll base,ll mod){\n B = base;\n MOD = mod;\n }\n void do_hash(const T &S) {\n ll N = S.size();\n Power.resize(N+1);\n InvPower.resize(N+1);\n hash.resize(N+1);\n Power[0] = 1;\n InvPower[0] = 1;\n for (ll i = 0;i<N;i++) {\n Power[i + 1] = modmul(Power[i],B,MOD);\n InvPower[i + 1] = modpow(Power[i+1],MOD-2,MOD);\n hash[i + 1] = (hash[i] + modmul(S[i], Power[i],MOD))%MOD;\n }\n }\n ll get_hash(ll l, ll r) {\n ull res = (hash[r]+MOD-hash[l])%MOD;\n res = modmul(res,InvPower[l],MOD);\n return res;\n }\n};\ntemplate<class T>\nstruct combination{\n public:\n vector<T>factorial;\n ll MOD;\n ll N;\n void reset(T n,T mod){\n N = n+1;\n factorial.assign(N,1);\n MOD = mod;\n }\n void calu(){\n for(ll i = 1;i<N;i++){\n factorial[i] = (factorial[i-1]*(i))%MOD;\n }\n }\n T get(T n, T r){\n ll a = factorial[n];\n ll b = (factorial[r]*(factorial[n-r]))%MOD;\n b = modpow(b,MOD - 2,MOD);\n return (a*b)%MOD;\n }\n};\ntemplate<class T>\nstruct dijkstra{\n public:\n\tvector<vector<pair<T,T>>>graph;\n\tvector<T>ans;\n\tpriority_queue<pair<T,T>,vector<pair<T,T>>,greater<pair<T,T>>>pq;\n void do_dijkstra(T start){//頂点xからダイクストラを行う\n\t\tpq.push({0,start});\n\t\tans[start] = 0;\n\t\twhile(true){\n\t\t\tif(pq.empty())break;\n\t\t\tT cost = pq.top().first;\n\t\t\tT vertex = pq.top().second;\n\t\t\tpq.pop();\n if (cost > ans[vertex]) continue; \n\t\t\tfor(T i = 0;i<graph[vertex].size();i++){\n\t\t\t\tT nextvertex = graph[vertex][i].first;\n\t\t\t\tT nextcost = graph[vertex][i].second + cost;\n\t\t\t\tif(ans[nextvertex] <= nextcost)continue;\n\t\t\t\t\tans[nextvertex] = nextcost;\n\t\t\t\t\tpq.push({nextcost,nextvertex});\n\t\t\t}\n\t\t}\n\t}\n\tvoid make_indirectedgraph(T u,T v,T cost){//無向辺のグラフ作成\n\t\tgraph[u].push_back({v,cost});\n\t\tgraph[v].push_back({u,cost});\n\t}\n\tvoid make_directedgraph(T u,T v,T cost){//有向辺のグラフ作成\n\t\tgraph[u].push_back({v,cost});\n\t}\n\tT output(T end){//答えを出す\n\t\treturn ans[end];\n\t} \n\tvoid reset(T N){//リセット\n\t\tgraph.assign(N, {});\n ans.assign(N, INF);\n\t}\n};\ntemplate<class T>\nstruct unionfind {\npublic:\n vector<T> parent, rank;\n void reset(T N) { // 初期化\n parent.resize(N);\n rank.assign(N, 1); // 各集合のサイズを 1 にする\n for (T i = 0; i < N; i++) parent[i] = i;\n }\n T leader(T x) { // 経路圧縮による親の取得\n if (parent[x] == x) return x;\n return parent[x] = leader(parent[x]); // 経路圧縮\n }\n void marge(T x, T y) { // ランクによるマージ\n T a = leader(x), b = leader(y);\n if(a!=b){\n if (rank[a] < rank[b]) swap(a, b);\n parent[b] = a;\n rank[a] += rank[b]; // サイズを更新 \n }\n }\n bool same(T x, T y) { // 同じ集合か判定\n return leader(x) == leader(y);\n }\n T size(T x) { // 集合のサイズを取得\n return rank[leader(x)];\n }\n void check(T N) { // デバッグ用: 親の確認\n for (T i = 0; i < N; i++) cout << parent[i] << \" \";\n cout << \"\\n\";\n }\n};\n//セグ木\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\n public:\n segtree() : segtree(0) {}\n segtree(int n) : segtree(std::vector<S>(n, e())) {}\n segtree(const std::vector<S>& v) : _n(int(v.size())){\n log = ceil_pow2(_n);\n size = 1 << log;\n d = std::vector<S>(2 * size, e());\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) {\n update(i);\n }\n }\n \n void set(int p, S x) {\n assert(0 <= p && p < _n);\n p += size;\n d[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n \n S get(int p) {\n assert(0 <= p && p < _n);\n return d[p + size];\n }\n \n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n S sml = e(), smr = e();\n l += size;\n r += size;\n \n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n return op(sml, smr);\n }\n \n S all_prod() { return d[1]; }\n \n template <bool (*f)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return f(x); });\n }\n template <class F> int max_right(int l, F f) {\n assert(0 <= l && l <= _n);\n assert(f(e()));\n if (l == _n) return _n;\n l += size;\n S sm = e();\n do{\n while (l % 2 == 0) l >>= 1;\n if (!f(op(sm, d[l]))) {\n while (l < size) {\n l = (2 * l);\n if (f(op(sm, d[l]))) {\n sm = op(sm, d[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = op(sm, d[l]);\n l++;\n }while ((l & -l) != l);\n return _n;\n }\n \n template <bool (*f)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return f(x); });\n }\n template <class F> int min_left(int r, F f) {\n assert(0 <= r && r <= _n);\n assert(f(e()));\n if (r == 0) return 0;\n r += size;\n S sm = e();\n do{\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!f(op(d[r], sm))) {\n while (r < size) {\n r = (2 * r + 1);\n if (f(op(d[r], sm))) {\n sm = op(d[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = op(d[r], sm);\n }while ((r & -r) != r);\n return 0;\n }\n \n private:\n int _n, size, log;\n std::vector<S> d;\n \n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n int ceil_pow2(int n) {\n int x = 0;\n while ((1U << x) < (unsigned int)(n)) x++;\n return x;\n }\n};\n\n//遅延セグ木\ntemplate <class S,S (*op)(S, S),S (*e)(),class F,S (*mapping)(F, S),F (*composition)(F, F),F (*id)()>\nstruct lazy_segtree {\n\n public:\n lazy_segtree() : lazy_segtree(0) {}\n lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}\n lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {\n log = ceil_pow2(_n);\n size = 1 << log;\n d = std::vector<S>(2 * size, e());\n lz = std::vector<F>(size, id());\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) {\n update(i);\n }\n }\n\n void set(int p, S x) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n\n S get(int p) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n return d[p];\n }\n\n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return e();\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push(r >> i);\n }\n\n S sml = e(), smr = e();\n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n\n return op(sml, smr);\n }\n\n S all_prod() { return d[1]; }\n\n void apply(int p, F f) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = mapping(f, d[p]);\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n void apply(int l, int r, F f) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return;\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n {\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) all_apply(l++, f);\n if (r & 1) all_apply(--r, f);\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n }\n\n for (int i = 1; i <= log; i++) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n\n template <bool (*g)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return g(x); });\n }\n template <class G> int max_right(int l, G g) {\n assert(0 <= l && l <= _n);\n assert(g(e()));\n if (l == _n) return _n;\n l += size;\n for (int i = log; i >= 1; i--) push(l >> i);\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!g(op(sm, d[l]))) {\n while (l < size) {\n push(l);\n l = (2 * l);\n if (g(op(sm, d[l]))) {\n sm = op(sm, d[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = op(sm, d[l]);\n l++;\n } while ((l & -l) != l);\n return _n;\n }\n\n template <bool (*g)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return g(x); });\n }\n template <class G> int min_left(int r, G g) {\n assert(0 <= r && r <= _n);\n assert(g(e()));\n if (r == 0) return 0;\n r += size;\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!g(op(d[r], sm))) {\n while (r < size) {\n push(r);\n r = (2 * r + 1);\n if (g(op(d[r], sm))) {\n sm = op(d[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = op(d[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n\n private:\n int _n, size, log;\n std::vector<S> d;\n std::vector<F> lz;\n int ceil_pow2(int n) {\n int x = 0;\n while ((1U << x) < (unsigned int)(n)) x++;\n return x;\n }\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n void all_apply(int k, F f) {\n d[k] = mapping(f, d[k]);\n if (k < size) lz[k] = composition(f, lz[k]);\n }\n void push(int k) {\n all_apply(2 * k, lz[k]);\n all_apply(2 * k + 1, lz[k]);\n lz[k] = id();\n }\n};\nstruct Euler_Tour{//最小共通祖先,部分木のコスト,通り道のコスト,のグラフを作る部分(オイラーツアー)\n //必要なもの集\n //セグ木は2*Nがベース\n //LCA(最小共通祖先)discovery,finish,visit,high\n //とある頂点xを根とする部分木の範囲 discovery,finish\n //頂点xを根とする部分木の辺と頂点のコストの総和 discovery,finish,vcost1,ecost1\n //頂点xを根とする頂点yまでの最短の辺と頂点のコストの総和 discovery,finish,vcost2,ecost2\n vector<int>discovery,finish,visit,high,vweight,vcost1,vcost2,ecost1,ecost2;\n vector<int>other;\n vector<vector<pair<int,int>>>graph;\n int cnt;\n int othercnt;\n void reset(ll N){\n cnt = 0;\n othercnt = 0;\n other.assign(2*N,0);\n discovery.assign(N,inf);\n finish.assign(N,minf);\n vweight.assign(N,0);\n graph.assign(N,vector<pair<int,int>>(0));\n visit.assign(2*N,0);\n high.assign(2*N,0);\n vcost1.assign(2*N,0);\n vcost2.assign(2*N,0);\n ecost1.assign(2*N,0);\n ecost2.assign(2*N,0);\n };\n void make_graph(ll u,ll v,ll cost){\n if(max(u,v)>graph.size()){\n cout << \"not reset or out of range\" << \"\\n\";\n return;\n }\n graph[u].push_back({v,cost});\n graph[v].push_back({u,cost});\n }\n void set_vweight(ll vertex,ll cost){\n vweight[vertex]+=cost;\n }\n void DFS(ll vertex,ll nowdepth,ll cost){\n if(discovery[vertex]==inf){\n vcost1[cnt]=vweight[vertex];\n vcost2[cnt]=vweight[vertex];\n }\n else{\n vcost1[cnt]=0;\n vcost2[cnt]=0;\n }\n ecost1[cnt]=cost;\n ecost2[cnt]=cost;\n discovery[vertex]=min(discovery[vertex],cnt);\n visit[cnt]=vertex;\n high[cnt]=nowdepth;\n for(int i = 0;i<graph[vertex].size();i++){\n int x = graph[vertex][i].first;\n int nextcost = graph[vertex][i].second;\n if(discovery[x]!=inf&&graph[vertex].size()==1)othercnt++;\n other[cnt]=othercnt;\n if(discovery[x]==inf){\n cnt++;\n DFS(x,nowdepth+1,nextcost);\n cnt++;\n visit[cnt]=vertex;\n high[cnt]=nowdepth;\n vcost1[cnt]=0;\n ecost1[cnt]=0;\n vcost2[cnt]=vweight[x]*-1;\n ecost2[cnt]=nextcost*-1;\n }\n other[cnt]=othercnt;\n }\n finish[vertex]=cnt+1;\n return;\n }\n int get_size(){\n ll res = high.size()-1;\n return res;\n }\n int get_vcost1(ll i){\n return ecost1[i];\n }\n int get_vcost2(ll i){\n return vcost2[i];\n }\n int get_ecost1(ll i){\n return vcost1[i];\n }\n int get_ecost2(ll i){\n return ecost2[i];\n }\n int get_high(ll i){\n return high[i];\n }\n int get_visit(ll i){\n return visit[i];\n }\n int get_discovery(ll i){\n return discovery[i];\n }\n int get_finish(ll i){\n return finish[i];\n }\n};\n//遅延セグ木のベース\n//型\nusing segS = ll;\nsegS oop(segS a,segS b){\n return (a+b)%mod;\n}\nsegS ee(){\n return 0;\n}\n/*struct segS{\n ll mi = 0;\n ll ma = 0;\n};\nsegS oop(segS a,segS b){\n segS res;\n res.mi = min(a.mi,b.mi);\n res.ma = max(a.ma,b.ma);\n return res;\n}\nsegS ee(){\n segS res;\n res.mi = INF;\n res.ma = MINF;\n return res;\n}*/\n\n//using lazyS = ll;\nusing lazyS = ll;\nusing lazyF = ll;\nlazyS e(){\n lazyS res;\n res = 1;\n return res;\n}//範囲外などを起こしてしまったときの返り値\nlazyS op(lazyS a, lazyS b){\n lazyS res;\n res = a+b;\n return res; \n}//操作したいこと\nlazyS mapping(lazyF f, lazyS x){ \n x= (x*f)%mod;\n return x; \n}//下まで伝播させたいこと\nlazyF composition(lazyF f, lazyF g){ return g = (g*f)%mod; }//まとめてやった場合おこしたいこと\nlazyF id(){ return 1; }//遅延セグ木のベース\n/*\nusing lazyS = ll;\nusing lazyF = ll;\nlazyS e(){ return 0;}//範囲外などを起こしてしまったときの返り値\nlazyS op(lazyS a, lazyS b){ return a+b; }//操作したいこと\nlazyS mapping(lazyF f, lazyS x){ return x /= f; }//下まで伝播させたいこと\nlazyF composition(lazyF f, lazyF g){ return g /= f; }//まとめてやった場合おこしたいこと\nlazyF id(){ return 1; }//遅延セグ木のベース\n*/\n\nint main(){\nll N,M,C;\ncin >> N >> M >> C;\ndijkstra<ll>dik;\ndik.reset(N+1);\nfor(int i = 0;i<M;i++){\n ll a,b,c;\n cin >> a >> b >> c;\n a--;\n b--;\n if(b==N-1)b++;\n dik.make_directedgraph(a,b,c);\n}\nfor(int i = 0;i<N-1;i++){\n dik.make_indirectedgraph(i,i+1,C);\n}\n//Yes;\ndik.do_dijkstra(0);\ncout << (dik.output(N) == INF ? -1 : dik.output(N)) << \"\\n\";\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 22920, "score_of_the_acc": -0.5446, "final_rank": 11 }, { "submission_id": "aoj_0488_10834072", "code_snippet": "#include<algorithm>\n#include<iostream>\n#include<cmath>\n#include<cstdio>\n#include<iomanip>\n#include<utility>\n#include<string>\n#include<vector>\n#include<bit>\n#include<bitset>\n#include<tuple>\n#include<map>\n#include<set>\n#include<queue>\n#include<deque>\n#include<stack>\nusing namespace std;\n\nvoid fix(int x){\n cout << fixed << setprecision(x);\n}\n\nint main(){\n long int N, M, C, A, B, D;\n cin >> N >> M >> C;\n vector<vector<pair<long int, long int> > > V(N + 1);\n vector<long int> ans(N + 1, 1e18);\n vector<long int> ans2(N + 1, 0);\n for (long int i = 0; i < M; i++){\n cin >> A >> B >> D;\n A--;\n B--;\n V.at(B).push_back(make_pair(A, D));\n if (B == N - 1){\n V.at(N).push_back(make_pair(A, D));\n }\n }\n if (V.at(N - 1).size() == 0){\n cout << -1 << endl;\n return 0;\n }\n ans.at(N) = 0;\n ans2.at(N) = 2;\n ans2.at(N - 1) = 1;\n A = N;\n priority_queue<pair<long int, long int> > PQ;\n for (long int i = 0; i < N; i++){\n for (long int j = 0; j < V.at(A).size(); j++){\n if (ans.at(V.at(A).at(j).first) > ans.at(A) + V.at(A).at(j).second){\n PQ.push(make_pair(1000000000000000000 - ans.at(A) - V.at(A).at(j).second, V.at(A).at(j).first));\n ans.at(V.at(A).at(j).first) = ans.at(A) + V.at(A).at(j).second;\n }\n }\n while (i < N - 1){\n B = PQ.top().second;\n D = PQ.top().first;\n if (ans2.at(B) == 0){\n ans2.at(B) = 1;\n A = B;\n break;\n }else if(ans2.at(B) == 1){\n ans2.at(B) = 2;\n PQ.pop();\n if (A != 0 && ans2.at(B - 1) == 0){\n if (ans.at(B - 1) > 1000000000000000000 - D + C){\n PQ.push(make_pair(D - C, B - 1));\n ans.at(B - 1) = 1000000000000000000 - D + C;\n }\n }\n if (A != N - 1 && ans2.at(B + 1) == 0){\n if (ans.at(B + 1) > 1000000000000000000 - D + C){\n PQ.push(make_pair(D - C, B + 1));\n ans.at(B + 1) = 1000000000000000000 - D + C;\n }\n }\n }else{\n PQ.pop();\n }\n }\n }\n cout << ans.at(0) << endl;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 15208, "score_of_the_acc": -0.1507, "final_rank": 3 }, { "submission_id": "aoj_0488_10829358", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n// #include<atcoder/all>\n// using mint = atcoder::modint998244353;\nusing ld = long double;\n#define fi first\n#define se second\n#define all(x) x.begin(),x.end()\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\ntemplate<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}\ntemplate<typename T>bool chmax(T&a,T b){return b>a?(a=b,1):0;}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n int N,M,C;\n cin>>N>>M>>C;\n vector<vector<pair<int,int>>> G(N);\n rep(i,M){\n int a,b,f;\n cin>>a>>b>>f;\n a--;b--;\n G[b].push_back({a,f});\n }\n using P=pair<int,int>;\n priority_queue<P,vector<P>,greater<P>> pq;\n vector<int> dp(N,1e9);\n for(auto [e,c]: G[N-1]){\n if(chmin(dp[e],c)){\n pq.push({c,e});\n }\n }\n rep(i,N-1){\n G[i].push_back({i+1, C});\n G[i+1].push_back({i, C});\n }\n while(!pq.empty()){\n auto [k,v]=pq.top();\n pq.pop();\n if(dp[v]>k) continue;\n for(auto [e,c]:G[v]){\n if(chmin(dp[e],dp[v]+c)){\n pq.push({dp[e],e});\n }\n }\n }\n if(dp[0]==1e9) dp[0]=-1;\n cout<<dp[0]<<\"\\n\";\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 17076, "score_of_the_acc": -0.1674, "final_rank": 5 }, { "submission_id": "aoj_0488_10080833", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,a,n) for(int i=a; i<(n); i++)\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\n#define fore(i,a) for(auto i:a)\n#define all(a) a.begin(),a.end()\n#define rall(a) a.rbegin(),a.rend()\nusing Int = long long;\nconst Int INF = 1LL << 60;\nconst int inf = 1001001001;\nvector<int> dxs = {1, 0, -1, 0};\nvector<int> dys = {0, 1, 0, -1};\nstruct Edge{\nInt to, w;\nEdge(Int to, Int w) : to(to), w(w) {}\n};\nint main(){\n Int n,m,c;\n cin>>n>>m>>c;\n vector<vector<Edge>> G(n);\n rep(i,0,m){\n Int a,b,t;\n cin>>a>>b>>t;\n a--;b--;\n G[a].push_back({b,t});\n }\n vector<Int> dist(n,INF);\n dist[0]=0;\n queue<Int> que;\n que.push(0);\n Int ans=INF;\n while(que.size()){\n Int pos=que.front();\n que.pop();\n fore(to,G[pos]){\n if(to.to==n-1)ans=min(ans,dist[pos]+to.w);\n if(dist[to.to]>dist[pos]+to.w){\n dist[to.to]=dist[pos]+to.w;\n que.push(to.to);\n }\n }\n if(pos-1>=0){\n if(dist[pos-1]>dist[pos]+c){\n dist[pos-1]=dist[pos]+c;\n que.push(pos-1);\n }\n }\n if(pos+1<n){\n if(dist[pos+1]>dist[pos]+c){\n dist[pos+1]=dist[pos]+c;\n que.push(pos+1);\n }\n }\n }\n if(ans==INF)cout<<-1<<endl;\n else cout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 12392, "score_of_the_acc": -0.0653, "final_rank": 1 }, { "submission_id": "aoj_0488_10059845", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)\n#define all(a) (a).begin(),(a).end()\n\nconst ll INF = 1ll << 61;\n\ntemplate<typename T> bool chmin(T& a, const T& b) {\n if (a > b) {\n a = b;\n return true;\n }\n else return false;\n}\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n \n int N, M, C;\n cin >> N >> M >> C;\n \n vector<vector<pair<int, ll>>> G(N + 1);\n rep(i, 0, M) {\n int a, b, f;\n cin >> a >> b >> f;\n a--, b--;\n if (b == N - 1) b = N;\n G[a].push_back({b, f});\n }\n \n rep(i, 0, N) {\n if (i != 0) {\n G[i].push_back({i - 1, C});\n G[i - 1].push_back({i, C});\n }\n if (i != N - 1) {\n G[i].push_back({i + 1, C});\n G[i + 1].push_back({i, C});\n }\n }\n \n vector<ll> dist(N + 1, INF);\n priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> que;\n dist[0] = 0;\n que.push({0, 0});\n \n while (!que.empty()) {\n ll d = que.top().first;\n int v = que.top().second;\n que.pop();\n \n if (dist[v] < d) continue;\n \n for (auto e : G[v]) {\n if (chmin(dist[e.first], dist[v] + e.second)) {\n que.push({dist[e.first], e.first});\n }\n }\n }\n \n cout << (dist[N] == INF ? -1 : dist[N]) << '\\n';\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 31992, "score_of_the_acc": -0.6596, "final_rank": 12 }, { "submission_id": "aoj_0488_9650531", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n ll N, M, C;\n cin >> N >> M >> C;\n\n vector<vector<pair<ll, ll>>> g(2 * N);\n for(ll i = 0, u, v, w; i < M; i++) {\n cin >> u >> v >> w;\n u--, v--;\n g[u].emplace_back(v + N, w);\n }\n\n for(ll i = 0; i < N; i++) {\n g[i + N].emplace_back(i, 0);\n if(i != N - 1) {\n g[i].emplace_back(i + 1, C);\n g[i + 1].emplace_back(i, C);\n }\n }\n\n vector<ll> d(2 * N, 1e18);\n d[0] = 0;\n auto chmin = [&](auto &a, const auto &b) { return a > b ? (a = b, true) : false; };\n priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> q;\n q.emplace(0, 0);\n while(!q.empty()) {\n auto [tmp, v] = q.top();\n q.pop();\n if(tmp > d[v]) { continue; }\n for(auto &[nv, c] : g[v]) {\n if(chmin(d[nv], d[v] + c)) { q.emplace(d[nv], nv); }\n }\n }\n\n cout << (d[2 * N - 1] == 1e18 ? -1 : d[2 * N - 1]) << \"\\n\";\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 35352, "score_of_the_acc": -0.8415, "final_rank": 14 }, { "submission_id": "aoj_0488_9642246", "code_snippet": "#include <bits/stdc++.h>\n#define asb(a,b) ((a)-(b)>0?(a)-(b):(b)-(a))\n#define atio(v,n) for(int g=0;g<(n);++g)cin >> v[g]\n#define atdp(v,en) {int bbbbbb=0;for(auto o:v){if(bbbbbb)cout << en;bbbbbb=1;cout << o;}cout << endl;}\n#define atfs(a) printf(\"%lld %lld\\n\",(a).first,(a).second)\n#define ri(n) rp(i,n)\n#define rj(n) rp(j,n)\n#define rk(n) rp(k,n)\n#define rl(n) rp(l,n)\n#define rp(e,c) for(int e=0;e<(c);++e)\n#define rix(s,h) rpx(i,s,h)\n#define rjx(s,h) rpx(j,s,h)\n#define rkx(s,h) rpx(k,s,h)\n#define rlx(s,h) rpx(l,s,h)\n#define rpx(e,s,h) for(int e=s;e<(h);++e)\n#define ci(d,r) ((d)/(r)+(((d)%(r))!=0))\n#define pn {pr(\"No\");return 0;}\n#define py {pr(\"Yes\");return 0;}\n#define pr(a) cout << (a) << endl\n#define bgen(a) a.begin(),a.end()\n#define INF 114514810\n#define LNF 1ll<<60\n#define asr(q,n) (0<=(q) && (q)<(n))\nusing namespace std;\nusing ll=long long;\nusing vi=vector<int>;\nusing vll=vector<ll>;\nusing pii=pair<int,int>;\nusing pll=pair<ll,ll>;\nusing si=set<int>;\nusing sll=set<ll>;\nusing qi=queue<int>;\nusing qll=queue<ll>;\nusing qpii=queue<pii>;\nusing qpll=queue<pll>;\nusing vst=vector<string>;\nusing vsi=vector<si>;\nusing vvi=vector<vi>;\nusing vvl=vector<vll>;\nusing tiii=tuple<int,int,int>;\nusing tlll=tuple<ll,ll,ll>;\nusing mii=map<int,int>;\nusing mll=map<ll,ll>;\nusing stki=stack<int>;\nusing stkll=stack<ll>;\nint dx[4]={1,0,-1,0};\nint dy[4]={0,-1,0,1};\n\nint is_prime(ll n){\n for(ll i=2;i*i<=n;++i)if(n%i==0)return 0;\n return 1;\n}\n\ntemplate <typename T>\nint factor(ll n,map<T,T>& m){\n for(ll i=2;i*i<=n;++i){\n while(n%i==0){\n n/=i;\n ++m[i];\n }\n }\n if(n!=1)++m[n];\n return 0;\n}\n\ntemplate <typename T>\nint divider(ll n,set<T>& s){\n for(ll i=2;i*i<=n;++i){\n if(n%i==0){\n s.insert(i);\n s.insert(n/i);\n }\n }\n return 0;\n}\n\ntemplate <typename T>\nint primes(ll n,set<T>& s){\n vi isp(n,1);\n isp[0]=0;\n int t=0;\n int c=1;\n while(1){\n do{\n if(t>=n)break;\n ++t;\n }while(!isp[t]);\n if(t>=n)break;\n s.insert(t+1);\n c=2*t+1;\n while(c<n){\n isp[c]=0;\n c+=t+1;\n }\n }\n return 0;\n}\n\ntemplate <typename T>\nint pcp(vector<T>& x,map<T,T>& mi){\n\tset<T> s;\n\tri(x.size())s.insert(x[i]);\n\tT p=0;\n map<T,T> m;\n\twhile(s.size()){\n\t\tm[*s.begin()]=p;\n mi[p]=*s.begin();\n\t\ts.erase(*s.begin());\n\t\t++p;\n\t}\n\tri(x.size())x[i]=m[x[i]];\n\treturn 0;\n}\n\nll gcd(ll a,ll b){\n while(a%=b)swap(a,b);\n return b;\n}\n\npll eeu(ll a,ll b,ll c){\n\tif(a==c && b==0)return pll(1,0);\n\tpll x=eeu(b,a%b,c);\n\treturn pll(x.second,x.first-(a/b)*x.second);\n}\n\npll lie(ll a,ll b,ll c){\n\tll gab=gcd(a,b);\n\tll cd=c/gab;\n\tpll x=eeu(a,b,gab);\n\treturn pll(cd*x.first,cd*x.second);\n}\n\nstruct mint{// can be used only the case mod is prime number\n ll x,mod;\n pll _eeu(ll a,ll b,ll c){\n\t if(a==c && b==0)return pll(1,0);\n\t pll x=_eeu(b,a%b,c);\n\t return pll(x.second,x.first-(a/b)*x.second);\n }\n ll inv(ll a){\n pll x=_eeu(a,mod,1);\n return (x.first%mod+mod)%mod;\n }\n mint(ll x=0,ll mod=998244353) : mod(mod),x(x) {x=(x%mod+mod)%mod;}\n mint operator-() const {return mint(mod,-x);}\n mint& operator=(const mint& a){x=a.x%mod;return *this;}\n mint& operator+=(const mint& a){x=(x+a.x)%mod;return *this;}\n mint& operator-=(const mint& a){x=((x-a.x)%mod+mod)%mod;return *this;}\n mint& operator*=(const mint& a){x=(x*a.x)%mod;return *this;}\n mint& operator=(const ll a){x=((a%mod)+mod)%mod;return *this;}\n mint& operator+=(const ll a){x=(x+a)%mod;return *this;}\n mint& operator-=(const ll a){x=((x-a)%mod+mod)%mod;return *this;}\n mint& operator*=(const ll a){x=((x*a)%mod+mod)%mod;return *this;}\n mint operator+(const mint& a)const{mint res(*this);return res+=a;}\n mint operator-(const mint& a)const{mint res(*this);return res-=a;}\n mint operator*(const mint& a)const{mint res(*this);return res*=a;}\n mint operator+(const ll a)const{mint res(*this);return res+=a;}\n mint operator-(const ll a)const{mint res(*this);return res-=a;}\n mint operator*(const ll a)const{mint res(*this);return res*=a;}\n // for prime mod\n mint& operator/=(const mint& a){return (*this)*=inv(a.x);} // Assumed that the law is the same for dividen and divider.\n mint& operator/=(const ll a){return (*this)*=inv(a);}\n mint operator/(const mint& a)const{mint res(*this);return res/=a;}\n mint operator/(const ll a)const{mint res(*this);return res/=a;}\n friend ostream& operator<<(ostream& os, const mint& m){os << m.x;return os;}\n};\n\nstruct uf{\n int n;\n vi unfi,rank,sizu;\n uf(int n) : n(n){unfi=vi(n,-1);rank=vi(n);sizu=vi(n,1);}\n int root(int p){\n if(unfi[p]==-1)return p;\n else return unfi[p]=root(unfi[p]);\n }\n int unite(int b,int a){\n int ra=root(a);\n int rb=root(b);\n if(ra==rb)return 1;\n if(rank[ra]>rank[rb])swap(ra,rb);\n unfi[ra]=rb;\n if(rank[ra]==rank[rb])++rank[rb];\n sizu[rb]+=sizu[ra];\n return 0;\n }\n};\n\ntemplate <typename T,class Fn>\nstruct sgt{ // 1-indexed\n vector<T> seg;\n int n;\n T d;\n Fn f;\n sgt(vector<T>& n2,T d,Fn f) : n(n2.size()),d(d), f(f){\n int b=n;\n while(!(b&1))b>>=1;\n if(b!=1){\n int c=0;\n b=n;\n while(b){b>>=1;++c;}\n n=1<<c;\n }\n seg=vector<T>(n<<1,d);\n b=n2.size();\n ri(b)seg[n+i]=n2[i];\n b=n;\n while(b>1){\n for(int i=b/2;i<b;++i)seg[i]=f(seg[2*i],seg[2*i+1]);\n b/=2;\n }\n\treturn;\n }\n void update(int pos,T val){\n int i=n+pos;\n seg[i]=val;\n while(i/=2)seg[i]=f(seg[2*i],seg[2*i+1]);\n\treturn;\n }\n T get(int l,int r){\n T tmp=d;\n int p=l;\n int c=0;\n while((p+(1<<c))<=r){\n if(p&(1<<c)){\n tmp=f(tmp,seg[(p>>c)+(n>>c)]);\n p+=1<<c;\n }\n ++c;\n }\n --c;\n while(p<r){\n if((r-p)&(1<<c)){\n tmp=f(tmp,seg[(p>>c)+(n>>c)]);\n p+=(1<<c);\n }\n --c;\n }\n return tmp;\n }\n T get(int pos){\n return seg[n+pos];\n }\n};\n\nvoid scc(vsi& s,vsi& g,vsi& gi){\n int n=g.size();\n vi id(n,INF),idi(n,-1);\n si rmn,ids;\n int cid=0;\n ri(n){\n rmn.insert(i);\n ids.insert(i);\n }\n while(rmn.size()){\n stack<pii> stk;\n stk.push(pii(*rmn.begin(),-1));\n while(stk.size()){\n pii tmp=stk.top();\n int cur=tmp.first;\n rmn.erase(cur);\n si::iterator itr;\n while((itr=g[cur].upper_bound(stk.top().second))!=g[cur].end()){\n stk.top().second=*itr;\n if(rmn.count(stk.top().second))break;\n }\n if(itr!=g[cur].end()){\n stk.push(pii(stk.top().second,-1));\n }else{\n id[cur]=cid;\n idi[cid]=cur;\n ++cid;\n stk.pop();\n }\n }\n }\n while(ids.size()){\n si subm,alr;\n stack<pii> stk;\n stk.push(pii(idi[*ids.rbegin()],-1));\n int idcrop=*ids.rbegin();\n while(stk.size()){\n pii tmp=stk.top();\n int cur=tmp.first;\n si::iterator itr;\n alr.insert(cur);\n while((itr=gi[cur].upper_bound(stk.top().second))!=gi[cur].end()){\n stk.top().second=*itr;\n if(idcrop>id[stk.top().second]&&(!alr.count(stk.top().second)))break;\n }\n if(itr!=gi[cur].end()){\n stk.push(pii(stk.top().second,-1));\n }else{\n subm.insert(cur);\n ids.erase(id[cur]);\n stk.pop();\n }\n }\n s.emplace_back(subm);\n }\n}\n\nconst double eps=1e-10;\nstruct Point{\n double x,y;\n Point(double _x=0,double _y=0):x(_x),y(_y) {}\n Point operator-() {return Point(-x,-y);}\n Point& operator=(Point a){x=a.x;y=a.y;return *this;}\n Point& operator+=(Point a){x+=a.x;y+=a.y;return *this;}\n Point& operator-=(Point a){x-=a.x;y-=a.y;return *this;}\n Point& operator*=(double a){x*=a;y*=a;return *this;}\n Point& operator/=(double a){x/=a;y/=a;return *this;}\n Point operator+(Point a){return Point(*this)+=a;}\n Point operator-(Point a){return Point(*this)-=a;}\n Point operator*(double a){return Point(*this)*=a;}\n Point operator/(double a){return Point(*this)/=a;}\n bool operator<(Point a){return abs(x-a.x)<eps?x<a.x:y<a.y;}\n bool operator>(Point a){Point r(*this);return a<r;}\n bool operator<=(Point a){return !(Point(*this)>a);}\n bool operator>=(Point a){return !(Point(*this)<a);}\n bool operator==(Point a){return abs(x-a.x)<eps&&abs(y-a.y)<eps;}\n bool operator!=(Point a){return !(Point(*this)==a);}\n Point& rotate(double th){\n double xn=x*cos(th)-y*sin(th),yn=x*sin(th)+y*cos(th);\n x=xn,y=yn;\n return *this;\n }\n friend ostream& operator<<(ostream& os, const Point& p){os << fixed << setprecision(10) << p.x << ' ' << p.y;return os;}\n};\n\ndouble dot(Point p,Point q){return p.x*q.x+p.y*q.y;}\ndouble cross(Point p,Point q){return p.x*q.y-p.y*q.x;}\ndouble norm(Point p){return p.x*p.x+p.y*p.y;}\ndouble abs(Point p){return sqrt(norm(p));}\ndouble arg(Point p){return atan2(p.y,p.x);}\n\nstruct ve2{\n Point p1,p2,d;\n ve2(double _x=0,double _y=0,double _dx=0,double _dy=0,int _mode=0){\n p1.x=_x;\n p1.y=_y;\n d.x=_dx;\n d.y=_dy;\n if(_mode){\n p2=d;\n d=p2-p1;\n }else{\n p2=p1+d;\n }\n }\n ve2(Point _p,Point _d,int _mode=0):p1(_p),d(_d){\n if(_mode){\n p2=d;\n d=p2-p1;\n }else{\n p2=p1+d;\n }\n }\n};\n\nPoint prj(ve2& l,Point& p){\n double t=dot(p-l.p1,l.d)/norm(l.d);\n return l.p1+l.d*t;\n}\nPoint rfl(ve2& l,Point& p){return prj(l,p)*2-p;}\nbool is_prll(ve2& a,ve2& b){return abs(cross(a.d,b.d))<eps;}\nbool is_orth(ve2& a,ve2& b){return abs(dot(a.d,b.d))<eps;}\nint ccw(ve2& a,ve2& b){\n double l1Xl2=cross(a.d,b.d);\n if(l1Xl2>eps)return 0;\n if(l1Xl2<-eps)return 1;\n ve2 va(b.p2,a.p1,1),vb(b.p2,a.p2,1);\n double ta=dot(va.d,a.d),tb=dot(vb.d,a.d);\n if(ta>eps&&tb>eps)return 2;\n if(ta<-eps&&tb<-eps)return 3;\n return 4;\n}\n\nint main(){\n ll n,m,c,b1,b2,b3;\n cin >> n >> m >> c;\n vector<set<pll>> gr(n);\n ri(m){\n cin >> b1 >> b2 >> b3;\n --b1;--b2;\n gr[b1].insert(pll(b2,b3));\n }\n vector<vll> bcost(n,vll(2,LNF));\n bcost[0][0]=0;\n priority_queue<tlll,vector<tlll>,greater<tlll>> dij;\n dij.push(tlll(0,0,0));\n while(dij.size()){\n tlll tmp=dij.top();\n ll ccost=get<0>(tmp);\n ll pos=get<1>(tmp);\n ll k=get<2>(tmp);\n dij.pop();\n if(bcost[pos][k]<ccost)continue;\n if(asr(pos-1,n))if(bcost[pos-1][k]>ccost+c){\n bcost[pos-1][k]=ccost+c;\n dij.push(tlll(ccost+c,pos-1,k));\n }\n if(asr(pos+1,n))if(bcost[pos+1][0]>ccost+c){\n bcost[pos+1][0]=ccost+c;\n dij.push(tlll(ccost+c,pos+1,0));\n }\n for(auto x:gr[pos])if(bcost[x.first][1]>ccost+x.second){\n bcost[x.first][1]=ccost+x.second;\n dij.push(tlll(ccost+x.second,x.first,1));\n }\n }\n ll ans=bcost[n-1][1];\n pr(ans!=LNF?ans:-1);\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 33648, "score_of_the_acc": -1.0299, "final_rank": 16 }, { "submission_id": "aoj_0488_9641846", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tlong long n,m,c;\n\tcin >> n >> m >> c;\n\tvector<vector<pair<long long,long long>>> g(n,vector<pair<long long,long long>>());\n\tfor(long long i = 0ll;i < m;i++){\n\t\tlong long u,v,x;\n\t\tcin >> u >> v >> x;\n\t\tu--;v--;\n\t\tg[v].push_back({u,x});\n\t}\n\tpriority_queue<pair<long long,long long>,vector<pair<long long,long long>>,greater<pair<long long,long long>>> q;\n\tif(!g[n - 1ll].empty()){\n\t\tfor(pair<long long,long long> i : g[n - 1ll]){\n\t\t\tq.push({i.second,i.first});\n\t\t}\n\t}\n\tvector<long long> ans(n,-1ll);\n\twhile(!q.empty()){\n\t\tpair<long long,long long> it = q.top();\n\t\tq.pop();\n\t\tif(ans[it.second] != -1ll) continue;\n\t\tans[it.second] = it.first;\n\t\tif(!g[it.second].empty()){\n\t\t\tfor(pair<long long,long long> i : g[it.second]){\n\t\t\t\tif(ans[i.first] != -1ll) continue;\n\t\t\t\tq.push({it.first + i.second,i.first});\n\t\t\t}\n\t\t}\n\t\tif(it.second > 0ll && ans[it.second - 1ll] == -1ll){\n\t\t\tq.push({it.first + c,it.second - 1ll});\n\t\t}\n\t\tif(it.second < n - 1ll && ans[it.second + 1ll] == -1ll){\n\t\t\tq.push({it.first + c,it.second + 1ll});\n\t\t}\n\t}\n\tcout << ans[0ll] << endl;\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 13172, "score_of_the_acc": -0.169, "final_rank": 6 }, { "submission_id": "aoj_0488_9638569", "code_snippet": "#include<iostream>\n#include<vector>\n#include<queue>\nusing namespace std;\nint main()\n{\n int n,m,C;\n cin >> n >> m >> C;\n vector<vector<pair<int,int>>>graph(n);\n for(int i=0;i<m;i++){\n int a,b,c;\n cin >> a >> b >> c;\n graph[a-1].push_back(make_pair(b,c));\n }\n //その地点への最小コスト、その地点のテレポート装置を使うための最小コスト\n vector<pair<long long,long long>>dist(n);\n for(int i=0;i<n;i++)dist[i]=make_pair(1e18,1e18);\n dist[0]=make_pair(0,0);\n priority_queue<pair<long long,pair<int,int>>,vector<pair<long long,pair<int,int>>>,greater<pair<long long,pair<int,int>>>>prq;\n prq.push(make_pair(0,make_pair(1,0)));\n prq.push(make_pair(0,make_pair(1,1)));\n while(prq.size()){\n pair<long long,pair<int,int>>hako=prq.top();\n prq.pop();\n //その地点への最小コストを見る\n if(hako.second.second==0){\n int a=hako.second.first;\n if(dist[a-1].first!=hako.first)continue;\n for(int i=0;i<graph[a-1].size();i++)if(dist[graph[a-1][i].first-1].first>dist[a-1].first+graph[a-1][i].second){\n\t dist[graph[a-1][i].first-1].first=dist[a-1].first+graph[a-1][i].second;\n\t prq.push(make_pair(dist[graph[a-1][i].first-1].first,make_pair(graph[a-1][i].first,0)));\n\t if(dist[graph[a-1][i].first-1].second>dist[a-1].first+graph[a-1][i].second){\n\t dist[graph[a-1][i].first-1].second=dist[a-1].first+graph[a-1][i].second;\n\t prq.push(make_pair(dist[graph[a-1][i].first-1].second,make_pair(graph[a-1][i].first,1)));\n\t }\n\t}\n //移動\n if(a>1 && dist[a-2].second>dist[a-1].first+C){\n\tdist[a-2].second=dist[a-1].first+C;\n\tprq.push(make_pair(dist[a-2].second,make_pair(a-1,1)));\n }\n if(a+1<n && dist[a].second>dist[a-1].first+C){\n\tdist[a].second=dist[a-1].first+C;\n\tprq.push(make_pair(dist[a].second,make_pair(a+1,1)));\n }\n }\n //その地点のテレポーターを使うための最小コストを見る\n else{\n int a=hako.second.first;\n if(dist[a-1].second!=hako.first)continue;\n for(int i=0;i<graph[a-1].size();i++)if(dist[graph[a-1][i].first-1].first>dist[a-1].second+graph[a-1][i].second){\n\t dist[graph[a-1][i].first-1].first=dist[a-1].second+graph[a-1][i].second;\n\t prq.push(make_pair(dist[graph[a-1][i].first-1].first,make_pair(graph[a-1][i].first,0)));\n\t if(dist[graph[a-1][i].first-1].second>dist[a-1].second+graph[a-1][i].second){\n\t dist[graph[a-1][i].first-1].second=dist[a-1].second+graph[a-1][i].second;\n\t prq.push(make_pair(dist[graph[a-1][i].first-1].second,make_pair(graph[a-1][i].first,1)));\n\t }\n\t}\n if(a>1 && dist[a-2].second>dist[a-1].second+C){\n\tdist[a-2].second=dist[a-1].second+C;\n\tprq.push(make_pair(dist[a-2].second,make_pair(a-1,1)));\n }\n if(a+1<=n && dist[a].second>dist[a-1].second+C){\n\tdist[a].second=dist[a-1].second+C;\n\tprq.push(make_pair(dist[a].second,make_pair(a+1,1)));\n }\n }\n }\n if(dist[n-1].first==1e18)cout << -1 << endl;\n else cout << dist[n-1].first << endl;\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 14400, "score_of_the_acc": -0.2462, "final_rank": 7 }, { "submission_id": "aoj_0488_9638567", "code_snippet": "#include<iostream>\n#include<vector>\n#include<queue>\nusing namespace std;\nint main()\n{\n int n,m,C;\n cin >> n >> m >> C;\n vector<vector<pair<int,int>>>graph(n);\n for(int i=0;i<m;i++){\n int a,b,c;\n cin >> a >> b >> c;\n graph[a-1].push_back(make_pair(b,c));\n }\n //その地点への最小コスト、その地点のテレポート装置を使うための最小コスト\n vector<pair<long long,long long>>dist(n);\n for(int i=0;i<n;i++)dist[i]=make_pair(1e18,1e18);\n dist[0]=make_pair(0,0);\n priority_queue<pair<long long,pair<int,int>>,vector<pair<long long,pair<int,int>>>,greater<pair<long long,pair<int,int>>>>prq;\n prq.push(make_pair(0,make_pair(1,0)));\n prq.push(make_pair(0,make_pair(1,1)));\n while(prq.size()){\n pair<long long,pair<int,int>>hako=prq.top();\n prq.pop();\n //その地点への最小コストを見る\n if(hako.second.second==0){\n int a=hako.second.first;\n if(dist[a-1].first!=hako.first)continue;\n for(int i=0;i<graph[a-1].size();i++)if(dist[graph[a-1][i].first-1].first>dist[a-1].first+graph[a-1][i].second){\n\t dist[graph[a-1][i].first-1].first=dist[a-1].first+graph[a-1][i].second;\n\t prq.push(make_pair(dist[graph[a-1][i].first-1].first,make_pair(graph[a-1][i].first,0)));\n\t if(dist[graph[a-1][i].first-1].second>dist[a-1].first+graph[a-1][i].second){\n\t dist[graph[a-1][i].first-1].second=dist[a-1].first+graph[a-1][i].second;\n\t prq.push(make_pair(dist[graph[a-1][i].first-1].second,make_pair(graph[a-1][i].first,1)));\n\t }\n\t}\n //移動\n if(a>1 && dist[a-2].second>dist[a-1].first+C){\n\tdist[a-2].second=dist[a-1].first+C;\n\tprq.push(make_pair(dist[a-2].second,make_pair(a-1,1)));\n }\n if(a+1<n && dist[a].second>dist[a-1].first+C){\n\tdist[a].second=dist[a-1].first+C;\n\tprq.push(make_pair(dist[a].second,make_pair(a+1,1)));\n }\n }\n //その地点のテレポーターを使うための最小コストを見る\n else{\n int a=hako.second.first;\n if(dist[a-1].second!=hako.first)continue;\n for(int i=0;i<graph[a-1].size();i++)if(dist[graph[a-1][i].first-1].first>dist[a-1].second+graph[a-1][i].second){\n\t dist[graph[a-1][i].first-1].first=dist[a-1].second+graph[a-1][i].second;\n\t prq.push(make_pair(dist[graph[a-1][i].first-1].first,make_pair(graph[a-1][i].first,0)));\n\t if(dist[graph[a-1][i].first-1].second>dist[a-1].second+graph[a-1][i].second){\n\t dist[graph[a-1][i].first-1].second=dist[a-1].second+graph[a-1][i].second;\n\t prq.push(make_pair(dist[graph[a-1][i].first-1].second,make_pair(graph[a-1][i].first,1)));\n\t }\n\t}\n if(a>1 && dist[a-2].second>dist[a-1].second+C){\n\tdist[a-2].second=dist[a-1].second+C;\n\tprq.push(make_pair(dist[a-2].second,make_pair(a-1,1)));\n }\n if(a+1<=n && dist[a].second>dist[a-1].second+C){\n\tdist[a].second=dist[a-1].second+C;\n\tprq.push(make_pair(dist[a].second,make_pair(a+1,1)));\n }\n }\n }\n if(dist[n-1].first==1e18)cout << -1 << endl;\n else cout << dist[n-1].first << endl;\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 14436, "score_of_the_acc": -0.2473, "final_rank": 9 }, { "submission_id": "aoj_0488_9628483", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nstruct edge{\n ll cost;\n ll u;\n bool isu;\n};\nbool operator< (const edge &e, const edge &f){\n return e.cost > f.cost;\n};\nint main(){\n ll N,M,C;\n cin >> N >> M >> C;\n vector<vector<pair<ll,ll>>> G(N);\n for(int i=0;i<M;i++){\n ll a,b,f;\n cin >> a >> b >> f;\n a--;\n b--;\n G[b].push_back(pair(a,f));\n }\n priority_queue<edge,vector<edge>> pq;\n vector<ll> dp(N,1e18);\n vector<bool> isu(N,false);\n dp[N-1] = 0;\n pq.push({dp[N-1],N-1,false});\n while(pq.size()>0){\n edge e = pq.top();\n pq.pop();\n if(e.cost!=dp[e.u]) continue;\n for(pair<ll,ll> p:G[e.u]){\n ll v = p.first;\n ll cost = p.second;\n if(isu[v]==false){\n dp[v] = e.cost+cost;\n isu[v] = true;\n pq.push({dp[v],v,true});\n }else{\n if(dp[v]>e.cost+cost){\n dp[v] = e.cost+cost;\n pq.push({dp[v],v,true});\n }\n }\n }\n if(e.isu){\n if(e.u>0){\n if(isu[e.u-1]==false){\n dp[e.u-1] = dp[e.u]+C;\n isu[e.u-1] = true;\n pq.push({dp[e.u-1],e.u-1,true});\n }else{\n if(dp[e.u-1]>dp[e.u]+C){\n dp[e.u-1] = dp[e.u]+C;\n pq.push({dp[e.u-1],e.u-1,true});\n }\n }\n }\n if(e.u<N-1){\n if(isu[e.u+1]==false){\n dp[e.u+1] = dp[e.u]+C;\n isu[e.u+1] = true;\n pq.push({dp[e.u+1],e.u+1,true});\n }else{\n if(dp[e.u+1]>dp[e.u]+C){\n dp[e.u+1] = dp[e.u]+C;\n pq.push({dp[e.u+1],e.u+1,true});\n }\n }\n }\n }\n }\n cout << ((dp[0]==1e18) ? -1:dp[0]) << endl;\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 13908, "score_of_the_acc": -0.1513, "final_rank": 4 }, { "submission_id": "aoj_0488_9626807", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i,a,n) for(int i = a; i < n; i++)\n#define yes (cout << \"Yes\" << endl)\n#define YES (cout << \"YES\" << endl)\n#define no (cout << \"No\" << endl)\n#define NO (cout << \"NO\" << endl)\n#define dame (cout << -1 << endl)\n#define pb push_back\n#define pf push_front\n#define mp make_pair\n#define fi first\n#define se second\n#define all(a) (a).begin(),(a).end()\n#define ll long long\n#define pll pair<long long,long long>\n#define pq priority_queue\n#define vl vector<long long> \ntemplate<typename T,typename U>\ninline constexpr bool chmin(T&a,const U&b){return (a>b?a=b,true:false);}\ntemplate<typename T,typename U>\ninline constexpr bool chmax(T&a,const U&b){return (a<b?a=b,true:false);}\n\nconst int dx[] = {1, 0, -1, 0};\nconst int dy[] = {0, 1, 0, -1};\n//DRUL\nusing namespace std;\n\nint main() {\n ll n,m,c;\n cin >> n >> m >> c;\n vector<ll> a(m),b(m),f(m);\n rep(i,0,m) {\n cin >> a[i] >> b[i] >> f[i];\n a[i]--;\n b[i]--;\n }\n vector<vector<pair<ll,ll>>> e(n * 2);\n rep(i,0,n) {\n e[i].pb({0,n + i});\n }\n rep(i,0,n - 1) {\n e[n + i].pb({c,n + i + 1});\n e[n + i + 1].pb({c,n + i});\n }\n \n rep(i,0,m) {\n e[n + a[i]].pb({f[i],b[i]});\n }\n vl dist(n * 2,-1);\n pq<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>> q;\n q.push({0,0});\n while(!q.empty()) {\n ll c,v;\n tie(c,v) = q.top();\n q.pop();\n if(dist[v] == -1) {\n dist[v] = c;\n for(auto t : e[v]) {\n ll w = t.second;\n if(dist[w] == -1) {\n q.push({t.first + c,w});\n }\n }\n }\n }\n \n //rep(i,0,n * 2) cout << dist[i] << endl;\n \n cout << dist[n - 1] << endl;\n \n}", "accuracy": 1, "time_ms": 130, "memory_kb": 39112, "score_of_the_acc": -1.1955, "final_rank": 19 }, { "submission_id": "aoj_0488_9624617", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nstruct Edge {\n\tint to;\n\tint cost;\n};\nusing Graph = vector<vector<Edge>>;\nint cast(int x, int y) {\n\treturn (2 * x) + y;\n}\nvoid DJK(Graph& G, vector<ll>& dist, int st) {\n\tdist[st] = 0;\n\tpriority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq;\n\tpq.push({0, st});\n\twhile (!pq.empty()) {\n\t\tll d = pq.top().first;int v = pq.top().second;\n\t\tpq.pop();\n\t\tif (dist[v] < d) continue;\n\t\tfor (auto nv : G[v]) {\n\t\t\tll nd = d + nv.cost;\n\t\t\tif (dist[nv.to] < nd) continue;\n\t\t\tdist[nv.to] = nd;\n\t\t\tpq.push({nd, nv.to});\n\t\t}\n\t}\n}\nint main() {\n\tint N, M, C;cin >> N >> M >> C;\n\tGraph G(2 * N);\n\tfor (int i = 0;i < M;i++) {\n\t\tint a, b, f;cin >> a >> b >> f;\n\t\ta--;b--;\n\t\tG[cast(a, 0)].push_back({cast(b, 1), f});\n\t}\n\tfor (int v = 0;v < N;v++) {\n\t\tG[cast(v, 1)].push_back({cast(v, 0), 0});\n\t\tif (v + 1 == N) continue;\n\t\tG[cast(v, 0)].push_back({cast(v + 1, 0), C});\n\t\tG[cast(v + 1, 0)].push_back({cast(v, 0), C});\n\t}\n\tll INF = (1LL << 60);\n\tvector<ll> dist(2 * N, INF);\n\tDJK(G, dist, cast(0, 1));\n\tll ret = dist[cast(N - 1, 1)];\n\tif (ret == INF) {\n\t\tcout << -1 << endl;\n\t} else {\n\t\tcout << ret << endl;\n\t}\n}", "accuracy": 1, "time_ms": 120, "memory_kb": 30328, "score_of_the_acc": -0.8892, "final_rank": 15 }, { "submission_id": "aoj_0488_9611321", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug_print.hpp>\n#define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define debug(...) (static_cast<void>(0))\n#endif\n\nconst int INF = (1 << 30) - 1;\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N, M, C;\n cin >> N >> M >> C;\n // テレポーターに関するグラフを貼る\n vector<vector<tuple<int, int, int>>> G(N);\n for (int i = 0; i < M; i++) {\n int a, b, c;\n cin >> a >> b >> c, a--, b--;\n G[a].emplace_back(b, c, 0);\n }\n // テレポーターを移動するのではなく自分を移動させる\n // テレポーターを -1 移動する -> 自分を +1 移動すると等しい\n for (int i = 0; i < N; i++) {\n if (i + 1 < N) G[i].emplace_back(i + 1, C, 1);\n if (i - 1 >= 0) G[i].emplace_back(i - 1, C, 1);\n }\n\n // dijkstra\n // dist[i][j] := 地点 i に (j = 0: テレポート, j = 1: 移動) で到達する最小コスト\n vector dist(N, vector<int>(2, INF));\n priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, greater<tuple<int, int, int>>> que;\n dist[0][0] = 0;\n que.emplace(dist[0][0], 0, 0);\n while (!que.empty()) {\n auto [cost, from, type] = que.top();\n que.pop();\n if (dist[from][type] < cost) continue;\n for (auto&& [to, c, new_type] : G[from]) {\n int new_cost = cost + c;\n if (dist[to][new_type] > new_cost) {\n dist[to][new_type] = new_cost;\n que.emplace(dist[to][new_type], to, new_type);\n }\n }\n }\n\n debug(dist);\n cout << (dist[N - 1][0] == INF ? -1 : dist[N - 1][0]) << '\\n';\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 28392, "score_of_the_acc": -0.7105, "final_rank": 13 } ]
aoj_0485_cpp
税の徴収 イヅア村には$1$から$N$までの番号が付いた$N$軒の家がある。この村では、$M$人の徴税官が税を徴収する。徴税官は家を訪れて税金を徴収する。1軒の家で徴収する金額は、徴税官ごとに決まっている。 はじめに、徴税官はそれぞれ異なる家に派遣され、そこで税金を徴収する。 次に、徴税官がいる家のうち番号が一番小さい家にいる徴税官が、それよりも大きい番号の家のうち、まだ徴税が済んでいない最も番号が小さい家に移動し、そこで税金を徴収する。これを繰り返し、どの徴税官も税金を徴収できなくなったら徴収を終える。 家の軒数と徴税官の人数、各徴税官が徴収する金額と最初に派遣される家の番号が与えられたとき、イヅア村から徴収できる税金の総額を求めるプログラムを作成せよ。 入力 入力は以下の形式で与えられる。 $N$ $M$ $t_1$ $h_1$ $t_2$ $h_2$ : $t_M$ $h_M$ １行目に家の軒数$N$ ($1 \leq N \leq 100,000$)と徴税官の人数$M$ ($1 \leq M \leq N$)が与えられる。続く$M$行に$i$番目の徴税官が徴収する税金の金額$t_i$ ($1 \leq t_i \leq 10,000$)と最初に派遣される家の番号$h_i$ ($1 \leq h_i \leq N$)が与えられる。ただし、異なる徴税官が同じ家に最初に派遣されることはない（$i \ne j$ならば$h_i \ne h_j$）。 出力 イヅア村から徴収できる税金の総額を1行に出力する。 入出力例 入力例１ 6 2 2 1 3 3 出力例１ 14 入力例２ 7 3 3 4 2 3 5 7 出力例２ 15
[ { "submission_id": "aoj_0485_10875659", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nusing ul=unsigned long long;\nint dx[8] = {1, 0, -1, 0, -1, -1, 1, 1};\nint dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};\nusing Graph=vector<vector<int>>;\nll op(ll a,ll b){return max(a,b);}\nll e(){return -1e18;}\nint main(){\n ll N,M;\n cin>>N>>M;\n vector<ll>t(M),h(M);\n set<ll>st;\n queue<int>q;\n vector<bool>T(N);\n priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>>p;\n for(int i=0;i<M;i++){\n cin>>t[i]>>h[i];\n h[i]--;\n p.push({h[i],t[i]});\n T[h[i]]=1;\n }\n for(int i=0;i<N;i++)if(!T[i])q.push(i);\n ll ans=0;\n while(!p.empty()){\n auto[i,t]=p.top();\n ans+=t;\n p.pop();\n while(!q.empty()&&i>=q.front())q.pop();\n if(!q.empty()){\n p.push({q.front(),t});\n q.pop();\n }\n }\n cout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 6412, "score_of_the_acc": -0.6399, "final_rank": 12 }, { "submission_id": "aoj_0485_10874724", "code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<queue>\nusing namespace std;\nint main()\n{\n int n,m;\n cin >> n >> m;\n vector<pair<int,int>>iti(m);\n for(int i=0;i<m;i++)cin >> iti[i].first >> iti[i].second;\n for(int i=0;i<m;i++)iti[i].second--;\n\n priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>pq;\n long long ans=0;\n vector<bool>check(n,false);\n for(int i=0;i<m;i++){\n ans+=iti[i].first;\n check[iti[i].second]=true;\n pq.push(make_pair(iti[i].second,i));\n }\n\n int now=0;\n while(pq.size()){\n pair<int,int>hako=pq.top();\n pq.pop();\n\n while(now<n){\n if(check[now] || hako.first>now)now++;\n else break;\n }\n if(now==n)break;\n\n ans+=iti[hako.second].first;\n check[now]=true;\n pq.push(make_pair(now,hako.second));\n now++;\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4716, "score_of_the_acc": -0.2679, "final_rank": 9 }, { "submission_id": "aoj_0485_10874715", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr int BIG_INT = 1'000'000'100;\nconstexpr long BIG_LONG = 1'000'000'000'000'000'100;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int n, m;\n cin >> n >> m;\n set<pair<int, int>> ht;\n for (int i = 0; i < m; i++) {\n int t, h;\n cin >> t >> h;\n h--;\n ht.insert({h, t});\n }\n\n set<int> st;\n for (int i = ht.begin()->first; i < n; i++) {\n st.insert(i);\n }\n for (auto [h, t] : ht) {\n st.erase(h);\n }\n\n int ans = 0;\n while (!ht.empty()) {\n auto [h, t] = *ht.begin();\n ht.erase(ht.begin());\n ans += t;\n if (!st.empty()) {\n auto tmp = st.begin();\n ht.insert({*tmp, t});\n st.erase(tmp);\n }\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 12140, "score_of_the_acc": -1.5, "final_rank": 19 }, { "submission_id": "aoj_0485_10874435", "code_snippet": "#ifdef GOHACHI\n#endif\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\ntemplate<class T> using VC = vector<T>;\ntemplate<class T,class TT> using P = pair<T,TT>;\ntemplate<class T,class TT,class TTT> using TP = tuple<T,TT,TTT>;\ntemplate<class T> using pq = priority_queue<T, VC<T>, greater<T>>;\ntemplate<class T> using pqR = priority_queue<T>;\n#define F first\n#define S second\n#define INF LLONG_MAX\n#define MOD 998244353\nll DX[4] = { 0 , 0 , -1 , 1 };\nll DY[4] = { -1 , 1 , 0 , 0 };\n#define st(x,y) sort(x,x+y)\n#define stR(x,y) sort(x,x+y,greater<ll>())\n#define ST(x) sort(x.begin(),x.end())\n#define STR(x) sort(x.rbegin(),x.rend())\n#define rep(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\n#define repR(i,a,b) for(ll i=(ll)(a);i>=(ll)(b);i--)\n#define REP(i,a,b,c) for(ll i=(ll)(a);i<(ll)(b);i+=(ll)(c))\n#define repE(i,a,b,c) for(ll i=(ll)(a);(ll)b<(ll)(c);i++)\n#define all(x) x.begin(),x.end()\n#define rev(x,y) reverse(x,x+y)\n#define REV(x) reverse(x.begin(),x.end())\n#define NP next_permutation\n#define dec(x) fixed << setprecision(x)\n#define POW(x,y) (ll)pow(x,y)\n#define RD(x) (double)round(x)\nll s;\nvoid solve() {\n\tll n,m; cin>>n>>m;\n\tll t,h;\n\tmap<ll,ll> mp;\n\twhile(m--) { cin>>t>>h; mp[h]=t; }\n\tqueue<ll> qu;\n\trep(i,1,n+1) {\n\t\tif (mp[i]==0 && (!qu.empty())) {\n\t\t\tll x=qu.front(); qu.pop();\n\t\t\ts+=x; qu.push(x);\n\t\t}\n\t\tif (mp[i]!=0) { s+=mp[i]; qu.push(mp[i]); }\n\t}\n\tcout<<s<<'\\n';\n}\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0); cout.tie(0);\n int T=1;\n while(T--) solve();\n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 10216, "score_of_the_acc": -1.2671, "final_rank": 16 }, { "submission_id": "aoj_0485_10873441", "code_snippet": "#include<bits/stdc++.h>\n//#include<atcoder/all>\n\nusing namespace std;\n//using namespace atcoder;\n#define rep(i,n) for(ll i=0; i<n; i++)\n#define rrep(i,n) for(ll i=n-1; i>=0; i--)\n#define print(a) cout<<a<<endl\ntypedef long long ll;\n#define yn(flg) if(flg){cout<<\"Yes\"<<endl;}else{cout<<\"No\"<<endl;}\n#define YN(flg) if(flg){cout<<\"YES\"<<endl;}else{cout<<\"NO\"<<endl;}\n#define so(a) sort(a.begin(),a.end())\n#define mp make_pair\n#define vi vector<int>\n#define vl vector<ll>\n#define vs vector<string>\n#define pb push_back\n#define a2i(a,s) (ll)(a-s)\n#define i2a(s,a) (char)(s+a)\n#define ssize(a) a.size()\ntypedef pair<int, int> Pii;\ntypedef pair<int, ll> Pil;\ntypedef pair<pair<ll,ll>,ll> P3;\ntypedef pair<pair<ll,ll>,pair<ll,ll>> P4;\n\ntypedef pair<ll, ll> Pll;\ntypedef pair<ll,Pll> Plll;\ntypedef pair<Pii, int> Piii;\nconst ll INF = 1000000000000000000;\n\ntemplate<class T> inline bool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<class T> inline bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\n//vector<ll> saiki(ll bit,ll n){\n//\tvector<ll> s(n);\n//\tfor(ll i=0;i<n;i++){\n//\t\tif(bit&(1<<i)){\n//\t\t\ts[i]=1;\n//\t\t}else s[i]=0;\n//\t}\n//\treturn s;\n//}\nvector<ll> v(100009);\nint main(){\n//入力\n\n\tcin.tie(0);\n\tios::sync_with_stdio(0);\n\n\tll n,m;\n\tcin>>n>>m;\n\tpriority_queue<Pll,vector<Pll>,greater<Pll> > que;\n\tll ans=0,mi=INF;\n\trep(i,m){\n\t\tll t,h;\n\t\tcin>>t>>h;\n\t\tans+=t;\n\t\tv[h]=1;\n\t\tque.push({h,t});\n\t\tmi=min(mi,h);\n\t}\n//判定\n\tqueue<ll> que2;\n\tfor(ll i=mi+1;i<=n;i++){\n\t\tif(v[i]!=1)que2.push(i);\n\t}\n\n\twhile(!que.empty()&&!que2.empty()){\n\t\tll cost=que.top().second;\n\t\tque.pop();\n\t\tll H=que2.front();\n\t\tque2.pop();\n\t\tans+=cost;\n\t\tque.push({H,cost});\n\t}\n\tcout<<ans<<endl;\n\n\treturn 0;\n\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5940, "score_of_the_acc": -0.2494, "final_rank": 8 }, { "submission_id": "aoj_0485_10872583", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n int n, m;\n cin >> n >> m;\n int ans = 0;\n vector<int> T(m);\n set<array<int, 2>> hito;\n set<int> ie;\n for(int i = 0; i < n; i++) ie.insert(i);\n for(int i = 0; i < m; i++){\n int t, h;\n cin >> t >> h;\n T[i] = t;\n h--;\n ans += t;\n ie.erase(h);\n hito.insert({h, i});\n }\n \n while(hito.size() && ie.size()){\n int pos = (*hito.begin())[0];\n int hi = (*hito.begin())[1];\n hito.erase(hito.begin());\n auto itr = ie.lower_bound(pos);\n if(itr == ie.end()) continue;\n \n hito.insert({*itr, hi});\n ie.erase(itr);\n ans += T[hi];\n }\n \n cout << ans << '\\n';\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 8132, "score_of_the_acc": -1.5148, "final_rank": 20 }, { "submission_id": "aoj_0485_10870994", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main()\n{\n int n, m;\n cin >> n >> m;\n vector<ll> zei(n, 0);\n for (int i = 0; i < m; i++)\n {\n int t, h;\n cin >> t >> h;\n h--;\n zei[h] = t;\n }\n queue<ll> amount;\n for (int i = 0; i < n; i++)\n {\n if (zei[i] > 0)\n {\n amount.push(zei[i]);\n }\n else if (!amount.empty())\n {\n zei[i] = amount.front();\n amount.pop();\n amount.push(zei[i]);\n }\n }\n ll ans = 0;\n for (int i = 0; i < n; i++)\n {\n ans += zei[i];\n }\n cout << ans << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4864, "score_of_the_acc": -0.1191, "final_rank": 2 }, { "submission_id": "aoj_0485_10870992", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nint main() {\n ll n,m;cin >> n >> m;\n vector<ll> t(m),h(m);\n vector<ll> nh(n,-1);\n set<ll> al;\n for(ll i=0;i<m;i++){\n cin >> t[i] >> h[i];\n h[i]--;\n nh[h[i]]=t[i];\n al.insert(h[i]);\n }\n queue<ll> y;\n for(ll i=0;i<n;i++){\n if(!al.count(i)){\n y.push(i);\n }\n }\n for(ll i=0;i<n;i++){\n while(!y.empty()&&i>y.front()){\n y.pop();\n }\n if(nh[i]!=-1){\n if(y.empty()){\n continue;\n }\n nh[y.front()]=nh[i];\n y.pop();\n }else{\n nh[i]=0;\n }\n }\n for(ll i=1;i<n;i++){\n nh[i]+=nh[i-1];\n }\n cout << nh[n-1] <<endl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 9124, "score_of_the_acc": -1.1349, "final_rank": 14 }, { "submission_id": "aoj_0485_10870900", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define all(T) T.begin(), T.end()\nusing ll = long long;\nusing P = pair<int, int>;\nconst int di[] = {-1, 0, 1, 0};\nconst int dj[] = {0, -1, 0, 1};\n\nint main() {\n ll n, m;\n cin >> n >> m;\n vector<ll> v(n, 0);\n rep(i, m) {\n ll t, h;\n cin >> t >> h;\n h--;\n v[h] = t;\n }\n vector<ll> emp;\n rep(i, n) if (v[i] == 0) emp.emplace_back(i);\n\n ll li = 0;\n ll ans = 0;\n ll empsz = emp.size();\n rep(i, n) {\n if (v[i] == 0) {\n li++;\n continue;\n }\n ans += v[i];\n if (li < empsz) v[emp[li]] = v[i];\n li++;\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5344, "score_of_the_acc": -0.1772, "final_rank": 4 }, { "submission_id": "aoj_0485_10869676", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int N,M;\n int64_t ans = 0;\n cin >> N >> M;\n vector<int> housemoney(N,0);\n for(int i = 0; i < M;i++) {\n int t,h;\n cin >> t >> h;\n h--; //house number starts with 0\n ans += t;\n housemoney.at(h) = t;\n }\n queue<int> house;\n\n for(int i = 0; i < N;i++) {\n if (housemoney.at(i) != 0) {\n house.push(housemoney.at(i));\n } else {\n if(!house.empty()) {\n ans += house.front();\n int u = house.front();\n house.pop();\n house.push(u);\n }\n }\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4096, "score_of_the_acc": -0.0262, "final_rank": 1 }, { "submission_id": "aoj_0485_10869396", "code_snippet": "// author: Yuichiro Kurose\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n, m;\n cin >> n >> m;\n vector<int> t(m), h(m);\n priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> que;\n for (int i = 0; i < m; i++) {\n cin >> t[i] >> h[i];\n h[i]--;\n que.push(make_pair(h[i], i));\n }\n set<int> st;\n for (int i = que.top().first; i < n; i++) {\n st.insert(i);\n }\n for (int i = 0; i < m; i++) {\n st.erase(h[i]);\n }\n int ans = 0;\n while (!que.empty()) {\n auto [idx, num] = que.top();\n que.pop();\n ans += t[num];\n if (!st.empty()) {\n int nidx = *begin(st);\n que.push(make_pair(nidx, num));\n st.erase(nidx);\n }\n }\n cout << ans << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 8948, "score_of_the_acc": -1.1136, "final_rank": 13 }, { "submission_id": "aoj_0485_10867610", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nll llINF = 9000000000000000000ll;\n\ntemplate<typename T>\nbool chmin(T &a , T b)\n{\n if(a > b)\n {\n a = b;\n return 1;\n }\n return 0;\n}\n\nint main(){\n int n,m;\n cin>>n>>m;\n vector<int> pay(n,0);\n vector<int> who(n,0);\n for(int i=0;i<m;i++)\n {\n int t,h;\n cin>>t>>h;\n h--;\n pay[h] = t;\n who[h] = t;\n }\n \n int target = 0;\n for(int i=0;i<n;i++) if(who[i])\n {\n target = max(target , i + 1);\n while(target < n && pay[target] != 0) target++;\n if(target == n) break;\n swap(who[target] , who[i]);\n pay[target] = who[target];\n }\n int ans = 0;\n for(auto payi : pay) ans += payi;\n cout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3880, "score_of_the_acc": -0.1667, "final_rank": 3 }, { "submission_id": "aoj_0485_10867607", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nll llINF = 9000000000000000000ll;\n\ntemplate<typename T>\nbool chmin(T &a , T b)\n{\n if(a > b)\n {\n a = b;\n return 1;\n }\n return 0;\n}\n\nint main(){\n int n,m;\n cin>>n>>m;\n vector<int> pay(n,0);\n vector<int> taxer(m);\n vector<int> place(n,-1);\n for(int i=0;i<m;i++)\n {\n int t,h;\n cin>>t>>h;\n h--;\n taxer[i] = t;\n pay[h] = t;\n place[h] = i;\n }\n //for(auto placei : place) cout<<placei<<\" \";\n ///cout<<endl;\n int target = 0;\n for(int i=0;i<n;i++) if(place[i] != -1)\n {\n target = max(target , i + 1);\n while(target < n && pay[target] != 0) target++;\n if(target == n) break;\n swap(place[target] , place[i]);\n //cout<<target<<\" \"<<place[target]<<\" \"<<taxer[place[target]]<<endl;\n pay[target] = taxer[place[target]];\n }\n int ans = 0;\n for(auto payi : pay) ans += payi;\n cout<<ans<<endl;\n //cout<<ans<<endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4064, "score_of_the_acc": -0.1889, "final_rank": 6 }, { "submission_id": "aoj_0485_10866262", "code_snippet": "#include <iostream>\n#include <vector>\n#include <queue>\n#include <tuple>\n#include <algorithm>\n#include <functional>\n#include <utility>\n#include <map>\nusing namespace std;\n\nusing ll = long long;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing pii = pair<int, int>;\n\nint main() {\n\tint N, M;\n\tll ans = 0;\n\tqueue<int> que;\n\tmap<int, int> m;\n\tcin >> N >> M;\n\tfor (int i = 0, t, h; i < M; i++) {\n\t\tcin >> t >> h;\n\t\tm[h] = t;\n\t}\n\n\tfor (int i = 1; i <= N; i++) {\n\t\tif (m[i] != 0) {\n\t\t\tans += m[i];\n\t\t\tque.push(m[i]);\n\t\t}\n\t\telse if (!que.empty()) {\n\t\t\tans += que.front();\n\t\t\tque.push(que.front());\n\t\t\tque.pop();\n\t\t}\n\t}\n\tcout << ans << endl;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 8392, "score_of_the_acc": -1.2129, "final_rank": 15 }, { "submission_id": "aoj_0485_10865115", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <queue>\nusing namespace std;\n\nint main()\n{\n int n, m; cin >> n >> m;\n vector<int> t(m);\n vector<int> h(m);\n vector<pair<int, int>> homes(n+1, {0, 0});\n for (int i = 0; i < m; i++)\n {\n cin >> t[i] >> h[i];\n homes[h[i]].first = t[i];\n homes[h[i]].second = 2;\n }\n \n queue<int> q;\n for (int i = 1; i <= n; i++)\n {\n if (homes[i].second == 0)\n {\n if (!q.empty())\n {\n int front = q.front();\n homes[i].first = homes[front].first;\n homes[i].second = 2;\n q.pop();\n }\n }\n if (homes[i].second == 1)\n {\n continue;\n }\n if (homes[i].second == 2)\n {\n q.push(i);\n }\n }\n int tax = 0;\n for (int i = 1; i <= n; i++)\n {\n tax += homes[i].first;\n }\n cout << tax << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4800, "score_of_the_acc": -0.278, "final_rank": 10 }, { "submission_id": "aoj_0485_10847842", "code_snippet": "# include <algorithm>\n# include <bitset>\n# include <complex>\n# include <cmath>\n#define _USE_MATH_DEFINES\n#include <assert.h>\n# include <math.h>\n# include <deque>\n# include <exception>\n# include <fstream>\n# include <functional>\n# include <iomanip>\n# include <ios>\n# include <iosfwd>\n# include <iostream>\n# include <istream>\n# include <iterator>\n# include <limits>\n# include <list>\n# include <locale>\n# include <map>\n# include <memory>\n# include <new>\n# include <numeric>\n# include <ostream>\n# include <queue>\n# include <set>\n# include <sstream>\n# include <stack>\n# include <stdexcept>\n# include <streambuf>\n# include <string>\n# include <typeinfo>\n# include <utility>\n# include <valarray>\n# include <vector>\n# include <array>\n# include <atomic>\n# include <chrono>\n# include <condition_variable>\n# include <forward_list>\n# include <future>\n# include <initializer_list>\n# include <mutex>\n# include <random>\n# include <ratio>\n# include <regex>\n# include <scoped_allocator>\n# include <system_error>\n# include <thread>\n# include <tuple>\n# include <typeindex>\n# include <type_traits>\n# include <unordered_map>\n# include <unordered_set>\n# include <bitset>\n#pragma GCC target (\"avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#define rep(i,n) for (ll i = 0;i < (ll)(n);i++)\n#define Yes cout << \"Yes\" << \"\\n\"// YESの短縮\n#define No cout << \"No\" << \"\\n\"// NOの短縮\n#define rtr0 return(0)//return(0)の短縮\n#define gyakugen(x) modpow(x,mod - 2,mod);\n#define agyakugen(x) modpow(x,amod - 2,amod);\n#define st(A) sort(A.begin(),A.end());\n#define rst(A) sort(A.rbegin(),A.rend());\n#define rev(A) reverse(A.begin(),A.end());\nusing namespace std;\n//using namespace ranges;\nusing ll = long long;//63bit型整数型\nusing ld = long double;//doubleよりも長い値を保存できるもの\nusing ull = unsigned long long;//符号がない64bit型整数\n//ld m_pi = 3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679;\nll mod = 998244353;\nll amod = 1000000007;\nll MINF = -5000000000000000000;\nll INF = 5000000000000000000;\nll inf = 2000000000;\nll minf = -2000000000;\nll BAD = -1;\nll zero = 0;\nld EPS = 1e-10;\nvector<ll>randomhash = {(ll)1e9 + 7,(ll)1e9 + 801,((ll)1e8 * 8) + 29,((ll)1e8 * 7) + 159,((ll)1e8 * 9) + 221};\nvector<ll>tate = {0,-1,0,1};//グリッド上の全探索時の四方向の上下のチェック\nvector<ll>yoko = {1,0,-1,0};//グリッド上の全探索時の四方向の右左のチェック\nvector<ll>etate = {0,-1,-1,-1,0,1,1,1};//グリッド上の全探索時の八方向の上下のチェック\nvector<ll>eyoko = {1,1,0,-1,-1,-1,0,1};//グリッド上の全探索時の八方向の右左のチェック\nvector<ll>hexsax = {0,1,1,0,-1,-1};\nvector<ll>hexsay = {1,1,0,-1,-1,0};\n//返り値は素数のリスト。\nvector < bool > isprime;\nvector < ll > Era(int n){//書き方 vector<ll>[] = Era(x); とやるとxまでの素数が出てくる。\n\tisprime.resize(n, true);\n\tvector < ll > res;\n\tisprime[0] = false;\n\tisprime[1] = false;\n\tfor(ll i = 2; i < n; ++i) isprime[i] = true;\n\tfor(ll i = 2; i < n; ++i) {\n\t\tif(isprime[i]) {\n\t\t\tres.push_back(i);\n\t\t\tfor(ll j = i * 2; j < n; j += i) isprime[j] = false;\n\t\t}\n\t}\n\treturn res;\n}\nll ceil_div(ll a, ll b){\n if (b <= 0) return INF; // invalid (分母<=0 のときは不可能と扱う)\n return (a + b - 1) / b;\n}\n//　　　　　　素数判定 21~35\null modmul(ull a,ull b,ull mod) {\n return (ull)a*b%mod;\n}\nll modpow(ll a, ll n, ll mod) {\n\tll res = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) res = res * a % mod;\n\t\ta = a * a % mod;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nlong long npow(long long a, long long n){\n long long res = 1;\n while (n > 0) {\n\t\tif (n & 1) res = res * a;\n\t\ta = a * a;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n// モッドを使った累乗\nlong long isqrt(long long num){\n return((long long)sqrtl(num));\n}\nld get_theta(ld px,ld py,ld fx,ld fy,ld sx,ld sy){\n ld fxv = fx-px;\n ld fyv = fy-py;\n ld sxv = sx-px;\n ld syv = sy-py;\n ld fsv = fxv*sxv + fyv*syv;\n ld pfs = (ld)sqrt(fxv*fxv+fyv*fyv);\n ld pss = (ld)sqrt(sxv*sxv+syv*syv);\n return acos(fsv/(pfs*pss))*180/M_PI;\n};\nld Euclidean_distance(ll x1,ll y1,ll x2,ll y2){\n ld x = abs((ld)x1 - (ld)x2);\n ld y = abs((ld)y1 - (ld)y2);\n return sqrt((x*x) + (y*y));\n};\nll Manhattan_distance(ll x1,ll y1,ll x2,ll y2){\n return abs(x1-x2)+abs(y1-y2);\n};\nvoid change_bit(ll N,ll start,vector<ll>&X){\n for(ll i = start;i>=0;i--){\n ll a = npow(2,i);\n if(N/a==1){\n X[i]=1;\n N-=a;\n }\n }\n}\nll popcount(ll x) {\n int count = 0;\n while (x) {\n count += x & 1;\n x >>= 1;\n }\n return count;\n}\n\nll cutup(ll a,ll b){\n return (a+b-1)/b;\n}\nvoid Run_Length_Encoding(vector<ll>A,vector<pair<ll,ll>>&RLE){\n RLE.push_back({A[0],1});\n ll N = A.size();\n for(int i = 1;i<N;i++){\n if(RLE[RLE.size()-1].first==A[i])RLE[RLE.size()-1].second++;\n else RLE.push_back({A[i],1});\n }\n}\nbool is_in_grid(ll i,ll ii,ll H,ll W){\n bool res = false;\n if(i>=0&&i<H&&ii>=0&&ii<W)res=true;\n return res;\n}\ntemplate<class T>\nstruct rolling_hash{\n vector<ull>Power,hash,InvPower;\n ll B = 0;\n ll MOD = 0;\n void set_number(ll base,ll mod){\n B = base;\n MOD = mod;\n }\n void do_hash(const T &S) {\n ll N = S.size();\n Power.resize(N+1);\n InvPower.resize(N+1);\n hash.resize(N+1);\n Power[0] = 1;\n InvPower[0] = 1;\n for (ll i = 0;i<N;i++) {\n Power[i + 1] = modmul(Power[i],B,MOD);\n InvPower[i + 1] = modpow(Power[i+1],MOD-2,MOD);\n hash[i + 1] = (hash[i] + modmul(S[i], Power[i],MOD))%MOD;\n }\n }\n ll get_hash(ll l, ll r) {\n ull res = (hash[r]+MOD-hash[l])%MOD;\n res = modmul(res,InvPower[l],MOD);\n return res;\n }\n};\ntemplate<class T>\nstruct combination{\n public:\n vector<T>factorial;\n ll MOD;\n ll N;\n void reset(T n,T mod){\n N = n+1;\n factorial.assign(N,1);\n MOD = mod;\n }\n void calu(){\n for(ll i = 1;i<N;i++){\n factorial[i] = (factorial[i-1]*(i))%MOD;\n }\n }\n T get(T n, T r){\n ll a = factorial[n];\n ll b = (factorial[r]*(factorial[n-r]))%MOD;\n b = modpow(b,MOD - 2,MOD);\n return (a*b)%MOD;\n }\n};\ntemplate<class T>\nstruct dijkstra{\n public:\n\tvector<vector<pair<T,T>>>graph;\n\tvector<T>ans;\n\tpriority_queue<pair<T,T>,vector<pair<T,T>>,greater<pair<T,T>>>pq;\n void do_dijkstra(T start){//頂点xからダイクストラを行う\n\t\tpq.push({0,start});\n\t\tans[start] = 0;\n\t\twhile(true){\n\t\t\tif(pq.empty())break;\n\t\t\tT cost = pq.top().first;\n\t\t\tT vertex = pq.top().second;\n\t\t\tpq.pop();\n if (cost > ans[vertex]) continue; \n\t\t\tfor(T i = 0;i<graph[vertex].size();i++){\n\t\t\t\tT nextvertex = graph[vertex][i].first;\n\t\t\t\tT nextcost = graph[vertex][i].second + cost;\n\t\t\t\tif(ans[nextvertex] <= nextcost)continue;\n\t\t\t\t\tans[nextvertex] = nextcost;\n\t\t\t\t\tpq.push({nextcost,nextvertex});\n\t\t\t}\n\t\t}\n\t}\n\tvoid make_indirectedgraph(T u,T v,T cost){//無向辺のグラフ作成\n\t\tgraph[u].push_back({v,cost});\n\t\tgraph[v].push_back({u,cost});\n\t}\n\tvoid make_directedgraph(T u,T v,T cost){//有向辺のグラフ作成\n\t\tgraph[u].push_back({v,cost});\n\t}\n\tT output(T end){//答えを出す\n\t\treturn ans[end];\n\t} \n\tvoid reset(T N){//リセット\n\t\tgraph.assign(N, {});\n ans.assign(N, INF);\n\t}\n};\ntemplate<class T>\nstruct unionfind {\npublic:\n vector<T> parent, rank;\n void reset(T N) { // 初期化\n parent.resize(N);\n rank.assign(N, 1); // 各集合のサイズを 1 にする\n for (T i = 0; i < N; i++) parent[i] = i;\n }\n T leader(T x) { // 経路圧縮による親の取得\n if (parent[x] == x) return x;\n return parent[x] = leader(parent[x]); // 経路圧縮\n }\n void marge(T x, T y) { // ランクによるマージ\n T a = leader(x), b = leader(y);\n if(a!=b){\n if (rank[a] < rank[b]) swap(a, b);\n parent[b] = a;\n rank[a] += rank[b]; // サイズを更新 \n }\n }\n bool same(T x, T y) { // 同じ集合か判定\n return leader(x) == leader(y);\n }\n T size(T x) { // 集合のサイズを取得\n return rank[leader(x)];\n }\n void check(T N) { // デバッグ用: 親の確認\n for (T i = 0; i < N; i++) cout << parent[i] << \" \";\n cout << \"\\n\";\n }\n};\n//セグ木\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\n public:\n segtree() : segtree(0) {}\n segtree(int n) : segtree(std::vector<S>(n, e())) {}\n segtree(const std::vector<S>& v) : _n(int(v.size())){\n log = ceil_pow2(_n);\n size = 1 << log;\n d = std::vector<S>(2 * size, e());\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) {\n update(i);\n }\n }\n \n void set(int p, S x) {\n assert(0 <= p && p < _n);\n p += size;\n d[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n \n S get(int p) {\n assert(0 <= p && p < _n);\n return d[p + size];\n }\n \n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n S sml = e(), smr = e();\n l += size;\n r += size;\n \n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n return op(sml, smr);\n }\n \n S all_prod() { return d[1]; }\n \n template <bool (*f)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return f(x); });\n }\n template <class F> int max_right(int l, F f) {\n assert(0 <= l && l <= _n);\n assert(f(e()));\n if (l == _n) return _n;\n l += size;\n S sm = e();\n do{\n while (l % 2 == 0) l >>= 1;\n if (!f(op(sm, d[l]))) {\n while (l < size) {\n l = (2 * l);\n if (f(op(sm, d[l]))) {\n sm = op(sm, d[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = op(sm, d[l]);\n l++;\n }while ((l & -l) != l);\n return _n;\n }\n \n template <bool (*f)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return f(x); });\n }\n template <class F> int min_left(int r, F f) {\n assert(0 <= r && r <= _n);\n assert(f(e()));\n if (r == 0) return 0;\n r += size;\n S sm = e();\n do{\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!f(op(d[r], sm))) {\n while (r < size) {\n r = (2 * r + 1);\n if (f(op(d[r], sm))) {\n sm = op(d[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = op(d[r], sm);\n }while ((r & -r) != r);\n return 0;\n }\n \n private:\n int _n, size, log;\n std::vector<S> d;\n \n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n int ceil_pow2(int n) {\n int x = 0;\n while ((1U << x) < (unsigned int)(n)) x++;\n return x;\n }\n};\n\n//遅延セグ木\ntemplate <class S,S (*op)(S, S),S (*e)(),class F,S (*mapping)(F, S),F (*composition)(F, F),F (*id)()>\nstruct lazy_segtree {\n\n public:\n lazy_segtree() : lazy_segtree(0) {}\n lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}\n lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {\n log = ceil_pow2(_n);\n size = 1 << log;\n d = std::vector<S>(2 * size, e());\n lz = std::vector<F>(size, id());\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) {\n update(i);\n }\n }\n\n void set(int p, S x) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n\n S get(int p) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n return d[p];\n }\n\n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return e();\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push(r >> i);\n }\n\n S sml = e(), smr = e();\n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n\n return op(sml, smr);\n }\n\n S all_prod() { return d[1]; }\n\n void apply(int p, F f) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = mapping(f, d[p]);\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n void apply(int l, int r, F f) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return;\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n {\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) all_apply(l++, f);\n if (r & 1) all_apply(--r, f);\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n }\n\n for (int i = 1; i <= log; i++) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n\n template <bool (*g)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return g(x); });\n }\n template <class G> int max_right(int l, G g) {\n assert(0 <= l && l <= _n);\n assert(g(e()));\n if (l == _n) return _n;\n l += size;\n for (int i = log; i >= 1; i--) push(l >> i);\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!g(op(sm, d[l]))) {\n while (l < size) {\n push(l);\n l = (2 * l);\n if (g(op(sm, d[l]))) {\n sm = op(sm, d[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = op(sm, d[l]);\n l++;\n } while ((l & -l) != l);\n return _n;\n }\n\n template <bool (*g)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return g(x); });\n }\n template <class G> int min_left(int r, G g) {\n assert(0 <= r && r <= _n);\n assert(g(e()));\n if (r == 0) return 0;\n r += size;\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!g(op(d[r], sm))) {\n while (r < size) {\n push(r);\n r = (2 * r + 1);\n if (g(op(d[r], sm))) {\n sm = op(d[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = op(d[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n\n private:\n int _n, size, log;\n std::vector<S> d;\n std::vector<F> lz;\n int ceil_pow2(int n) {\n int x = 0;\n while ((1U << x) < (unsigned int)(n)) x++;\n return x;\n }\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n void all_apply(int k, F f) {\n d[k] = mapping(f, d[k]);\n if (k < size) lz[k] = composition(f, lz[k]);\n }\n void push(int k) {\n all_apply(2 * k, lz[k]);\n all_apply(2 * k + 1, lz[k]);\n lz[k] = id();\n }\n};\nstruct Euler_Tour{//最小共通祖先,部分木のコスト,通り道のコスト,のグラフを作る部分(オイラーツアー)\n //必要なもの集\n //セグ木は2*Nがベース\n //LCA(最小共通祖先)discovery,finish,visit,high\n //とある頂点xを根とする部分木の範囲 discovery,finish\n //頂点xを根とする部分木の辺と頂点のコストの総和 discovery,finish,vcost1,ecost1\n //頂点xを根とする頂点yまでの最短の辺と頂点のコストの総和 discovery,finish,vcost2,ecost2\n vector<int>discovery,finish,visit,high,vweight,vcost1,vcost2,ecost1,ecost2;\n vector<int>other;\n vector<vector<pair<int,int>>>graph;\n int cnt;\n int othercnt;\n void reset(ll N){\n cnt = 0;\n othercnt = 0;\n other.assign(2*N,0);\n discovery.assign(N,inf);\n finish.assign(N,minf);\n vweight.assign(N,0);\n graph.assign(N,vector<pair<int,int>>(0));\n visit.assign(2*N,0);\n high.assign(2*N,0);\n vcost1.assign(2*N,0);\n vcost2.assign(2*N,0);\n ecost1.assign(2*N,0);\n ecost2.assign(2*N,0);\n };\n void make_graph(ll u,ll v,ll cost){\n if(max(u,v)>graph.size()){\n cout << \"not reset or out of range\" << \"\\n\";\n return;\n }\n graph[u].push_back({v,cost});\n graph[v].push_back({u,cost});\n }\n void set_vweight(ll vertex,ll cost){\n vweight[vertex]+=cost;\n }\n void DFS(ll vertex,ll nowdepth,ll cost){\n if(discovery[vertex]==inf){\n vcost1[cnt]=vweight[vertex];\n vcost2[cnt]=vweight[vertex];\n }\n else{\n vcost1[cnt]=0;\n vcost2[cnt]=0;\n }\n ecost1[cnt]=cost;\n ecost2[cnt]=cost;\n discovery[vertex]=min(discovery[vertex],cnt);\n visit[cnt]=vertex;\n high[cnt]=nowdepth;\n for(int i = 0;i<graph[vertex].size();i++){\n int x = graph[vertex][i].first;\n int nextcost = graph[vertex][i].second;\n if(discovery[x]!=inf&&graph[vertex].size()==1)othercnt++;\n other[cnt]=othercnt;\n if(discovery[x]==inf){\n cnt++;\n DFS(x,nowdepth+1,nextcost);\n cnt++;\n visit[cnt]=vertex;\n high[cnt]=nowdepth;\n vcost1[cnt]=0;\n ecost1[cnt]=0;\n vcost2[cnt]=vweight[x]*-1;\n ecost2[cnt]=nextcost*-1;\n }\n other[cnt]=othercnt;\n }\n finish[vertex]=cnt+1;\n return;\n }\n int get_size(){\n ll res = high.size()-1;\n return res;\n }\n int get_vcost1(ll i){\n return ecost1[i];\n }\n int get_vcost2(ll i){\n return vcost2[i];\n }\n int get_ecost1(ll i){\n return vcost1[i];\n }\n int get_ecost2(ll i){\n return ecost2[i];\n }\n int get_high(ll i){\n return high[i];\n }\n int get_visit(ll i){\n return visit[i];\n }\n int get_discovery(ll i){\n return discovery[i];\n }\n int get_finish(ll i){\n return finish[i];\n }\n};\n//遅延セグ木のベース\n//型\nusing segS = ll;\nsegS oop(segS a,segS b){\n return (a+b)%mod;\n}\nsegS ee(){\n return 0;\n}\n/*struct segS{\n ll mi = 0;\n ll ma = 0;\n};\nsegS oop(segS a,segS b){\n segS res;\n res.mi = min(a.mi,b.mi);\n res.ma = max(a.ma,b.ma);\n return res;\n}\nsegS ee(){\n segS res;\n res.mi = INF;\n res.ma = MINF;\n return res;\n}*/\n\n//using lazyS = ll;\nusing lazyS = ll;\nusing lazyF = ll;\nlazyS e(){\n lazyS res;\n res = 1;\n return res;\n}//範囲外などを起こしてしまったときの返り値\nlazyS op(lazyS a, lazyS b){\n lazyS res;\n res = a+b;\n return res; \n}//操作したいこと\nlazyS mapping(lazyF f, lazyS x){ \n x= (x*f)%mod;\n return x; \n}//下まで伝播させたいこと\nlazyF composition(lazyF f, lazyF g){ return g = (g*f)%mod; }//まとめてやった場合おこしたいこと\nlazyF id(){ return 1; }//遅延セグ木のベース\n/*\nusing lazyS = ll;\nusing lazyF = ll;\nlazyS e(){ return 0;}//範囲外などを起こしてしまったときの返り値\nlazyS op(lazyS a, lazyS b){ return a+b; }//操作したいこと\nlazyS mapping(lazyF f, lazyS x){ return x /= f; }//下まで伝播させたいこと\nlazyF composition(lazyF f, lazyF g){ return g /= f; }//まとめてやった場合おこしたいこと\nlazyF id(){ return 1; }//遅延セグ木のベース\n*/\n\nint main(){\nll N,M;\ncin >> N >> M;\nvector<pair<ll,ll>>A(M);//money,place;\nvector<bool>visited(N,false);\nqueue<ll>que;\nset<pair<ll,ll>>P;\nll ans = 0;\nll start = INF;\nfor(int i = 0;i<M;i++){\n ll x,y;\n cin >> x >> y;\n y--;\n A[i] = {x,y};\n ans+=x;\n visited[y]=true;\n start = min(start,y);\n P.insert({y,x});\n}\nfor(int i = start;i<N;i++)if(!visited[i])que.emplace(i);\nwhile(true){\n if(que.empty())break;\n auto[place,cost] = *P.begin();\n P.erase({place,cost});\n ll x = que.front();\n que.pop();\n ans+=cost;\n P.insert({x,cost});\n}\ncout << ans << \"\\n\";\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 10180, "score_of_the_acc": -1.4294, "final_rank": 18 }, { "submission_id": "aoj_0485_10847197", "code_snippet": "#include <bits/stdc++.h>\n#include <iomanip>\n#include <numbers>\n#include <cassert>\n#include <numeric>\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pint = pair<int, int>;\n#define rep(i, n) for(int i = 0; i < (n); ++i)\ntemplate<typename T>\nbool chmax(T & a, const T & b) { if (a < b) { a = b; return true; } return false; }\ntemplate<typename T>\nbool chmin(T & a, const T & b) { if (a > b) { a = b; return true; } return false; }\nint main() {\n int n, m; cin >> n >> m;\n set<int> house;\n rep(i, n)house.insert(i);\n set<pint> ps;\n int total = 0;\n rep(i, m) {\n int t, h; cin >> t >> h;\n h--;\n total += t;\n ps.insert({ h,t });\n house.erase(h);\n }\n while (1) {\n auto [h, t] = *ps.begin();\n ps.erase(ps.begin());\n auto it = house.upper_bound(h);\n if (it == house.end()) break;\n total += t;\n ps.insert({ *it,t });\n house.erase(it);\n }\n cout << total << endl;\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 8192, "score_of_the_acc": -1.3554, "final_rank": 17 }, { "submission_id": "aoj_0485_10833885", "code_snippet": "#include<algorithm>\n#include<iostream>\n#include<cmath>\n#include<cstdio>\n#include<iomanip>\n#include<utility>\n#include<string>\n#include<vector>\n#include<bit>\n#include<bitset>\n#include<tuple>\n#include<map>\n#include<set>\n#include<queue>\n#include<deque>\n#include<stack>\nusing namespace std;\n\nvoid fix(int x){\n cout << fixed << setprecision(x);\n}\n\nint main(){\n long int N, M, ans;\n ans = 0;\n cin >> N >> M;\n vector<long int> A(M);\n vector<long int> B(M);\n vector<long int> C(N, 0);\n priority_queue<pair<long int, long int> > PQ;\n for (long int i = 0; i < M; i++){\n cin >> A.at(i) >> B.at(i);\n B.at(i)--;\n ans += A.at(i);\n C.at(B.at(i)) = 1;\n PQ.push(make_pair(100000000 - B.at(i), A.at(i)));\n }\n for (long int i = 0; i < N; i++){\n if (C.at(i) == 0 && 100000000 - PQ.top().first < i){\n long int D = PQ.top().second;\n C.at(i) = 1;\n ans += D;\n PQ.pop();\n PQ.push(make_pair(100000000 - i, D));\n }\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 7756, "score_of_the_acc": -0.6359, "final_rank": 11 }, { "submission_id": "aoj_0485_10833077", "code_snippet": "//#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define all(a) (a).begin(), (a).end()\nusing ll = long long;\nconst ll INF32 = 2e9;\nconst ll INF64 = 4e18;\n\nvoid printYN(bool ok){\n if(ok)cout << \"Yes\" << endl;\n else cout << \"No\" << endl;\n return;\n}\n\nint main() {\n int N, M;\n cin >> N >> M;\n vector<int> t(M), h(N, -1);\n rep(i, M){\n int hi;\n cin >> t[i] >> hi;\n hi--;\n h[hi] = i;\n }\n queue<int> q;\n int ans = 0;\n rep(i, N){\n if(h[i]!=-1){\n ans += t[h[i]];\n q.push(h[i]);\n }\n else {\n if(q.empty())continue;\n ans += t[q.front()];\n q.push(q.front());\n q.pop();\n }\n }\n cout << ans << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4040, "score_of_the_acc": -0.186, "final_rank": 5 }, { "submission_id": "aoj_0485_10827339", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint a[200001];\nint main(void)\n{\n\tint n,m,t,h,i,p,j,sum,flg;\n\tcin>>n>>m;\n\tfor(i=0;i<m;i++){\n\t\tcin>>t>>h;\n\t\ta[h]=t;\n\t}\n\tflg=0;\n\tsum=0;\n\tfor(i=1;i<=n;i++){\n\t\tif(a[i]>0){\n\t\t\tif(flg==0){\n\t\t\t\tp=i+1;\n\t\t\t\twhile(a[p]>0)p++;\n\t\t\t\tflg=1;\n\t\t\t}\n\t\t\tsum+=a[i];\n\t\t\ta[p]=a[i];\n\t\t\twhile(a[p]>0)p++;\n\t\t}\n\t}\n\tcout<<sum<<endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4076, "score_of_the_acc": -0.1904, "final_rank": 7 } ]
aoj_0486_cpp
一方通行迷路ゲーム あなたは一方通行迷路ゲームというコンピュータゲームで遊んでいる。このゲームでは、H行W列のマスで区切られた長方形が画面上に表示される。各マスは壁、道、スタート、ゴールのいずれかで、スタートとゴールはそれぞれ一つだけである。道のマスとスタートのマスでは、上下左右に隣接する道のマスかゴールのマスだけに進むことができる。ただし、道のマスのうちいくつかは一方通行のマスであり、上下左右のうち一つの方向にしか出られない。 1回のゲームでは、スタートから出発して道を通ってゴールを目指す。ゴールにたどりつければゲームクリア、たどりつけないことがわかった時点でゲームオーバーである。スタートからゴールまでの移動回数が少ないほど、ランキングが上がる。ゲーム中で一度だけ、一方通行のマスを一つ選んでその方向を好きな方向に変えることができる。ランキング上位を目指すために、あなたは画面をよく見て、どの一方通行のマスを選んで方向を変えればいいか、よく検討しなければならない。 画面上に各マスの情報が与えられたとき、スタートからゴールにたどりつけるかどうか判定し、たどりつけるときは最小の移動回数を報告するプログラムを作成せよ。 入力 入力は以下の形式で与えられる。 $H$ $W$ $s_{1,1}$ $s_{1,2}$ ... $s_{1,W}$ $s_{2,1}$ $s_{2,2}$ ... $s_{2,W}$ : $s_{H,1}$ $s_{H,2}$ ... $s_{H,W}$ １行目に画面上の長方形の行の数$H$ ($2 \leq H \leq 300$)、列の数$W$ ($2 \leq W \leq 300$)が与えられる。続く$H$行に$i$行$j$列目のマスを表す文字$s_{i,j}$が与えられる。各$s_{i,j}$は以下のどれか一つである。 . 一方通行ではない道 # 壁 U,D,L,R 一方通行の道。それぞれ、上、下、左、右の方向へだけ出られるマスを表す。 S,G S がスタート、 G がゴール。 出力 スタートからゴールにたどりつく最小の移動回数を1行に出力する。ただし、たどりつけないときは「-1」を出力する。 入出力例 入力例１ 4 5 ##S## #..## #.DG. #..## 出力例１ 3 入力例２ 4 3 #S. #U. GD. ### 出力例２ 5 入力例３ 3 4 #..# .LDG .S#. 出力例３ -1
[ { "submission_id": "aoj_0486_10875761", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nusing ul=unsigned long long;\nint dx[8] = {1, 0, -1, 0, -1, -1, 1, 1};\nint dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};\nusing Graph=vector<vector<int>>;\nll op(ll a,ll b){return max(a,b);}\nll e(){return -1e18;}\nint main(){\n int H,W;\n cin>>H>>W;\n vector<string>S(H);\n for(int i=0;i<H;i++)cin>>S[i];\n string T=\"DRUL\";\n vector<vector<vector<int>>>vis(H,vector<vector<int>>(W,vector<int>(2,-1)));\n queue<tuple<int,int,int>>q;\n int si,sj,gi,gj;\n for(int i=0;i<H;i++){\n for(int j=0;j<W;j++){\n if(S[i][j]=='S')si=i,sj=j;\n if(S[i][j]=='G')gi=i,gj=j;\n }\n }\n q.push({si,sj,0});\n vis[si][sj][0]=0;\n while(!q.empty()){\n auto[i,j,t]=q.front();\n q.pop();\n for(int k=0;k<4;k++){\n int di=i+dx[k],dj=j+dy[k];\n if(di<0||di>=H||dj<0||dj>=W||S[di][dj]=='#'||vis[di][dj][t]!=-1)continue;\n if(S[i][j]=='U'||S[i][j]=='D'||S[i][j]=='R'||S[i][j]=='L'){\n if(T[k]!=S[i][j]){\n if(t==0){\n if(vis[di][dj][t+1]!=-1)continue;\n vis[di][dj][t+1]=vis[i][j][t]+1;\n q.push({di,dj,t+1});\n continue;\n }\n else continue;\n }\n }\n vis[di][dj][t]=vis[i][j][t]+1;\n q.push({di,dj,t});\n }\n }\n if(vis[gi][gj][0]==-1&&vis[gi][gj][1]==-1)cout<<-1<<endl;\n else if(vis[gi][gj][0]==-1)cout<<vis[gi][gj][1]<<endl;\n else if(vis[gi][gj][1]==-1)cout<<vis[gi][gj][0]<<endl;\n else cout<<min(vis[gi][gj][0],vis[gi][gj][1])<<endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 8288, "score_of_the_acc": -0.4735, "final_rank": 8 }, { "submission_id": "aoj_0486_10875578", "code_snippet": "#include<bits/stdc++.h>\n//#include<atcoder/all>\n\nusing namespace std;\n//using namespace atcoder;\n#define rep(i,n) for(ll i=0; i<n; i++)\n#define rrep(i,n) for(ll i=n-1; i>=0; i--)\n#define print(a) cout<<a<<endl\ntypedef long long ll;\n#define yn(flg) if(flg){cout<<\"Yes\"<<endl;}else{cout<<\"No\"<<endl;}\n#define YN(flg) if(flg){cout<<\"YES\"<<endl;}else{cout<<\"NO\"<<endl;}\n#define so(a) sort(a.begin(),a.end())\n#define mp make_pair\n#define vi vector<int>\n#define vl vector<ll>\n#define vs vector<string>\n#define pb push_back\n#define a2i(a,s) (ll)(a-s)\n#define i2a(s,a) (char)(s+a)\n#define ssize(a) a.size()\ntypedef pair<int, int> Pii;\ntypedef pair<int, ll> Pil;\ntypedef pair<pair<ll,ll>,ll> P3;\ntypedef pair<pair<ll,ll>,pair<ll,ll>> P4;\n\ntypedef pair<ll, ll> Pll;\ntypedef pair<ll,Pll> Plll;\ntypedef pair<Pii, int> Piii;\nconst ll INF = 1000000000000000000;\n\ntemplate<class T> inline bool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate<class T> inline bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\nvector<ll> tate={0,0,1,-1};\nvector<ll> yoko={1,-1,0,0};\n\nvector<vector<vector<ll> > > v(310,vector<vector<ll> > (310,vector<ll>(2,INF)));\nint main(){\n//入力\n\n\tcin.tie(0);\n\tios::sync_with_stdio(0);\n\n\tll h,w;\n\tcin>>h>>w;\n\tPll S;\n\tvector<string> s(h);\n\trep(i,h){\n\t\tcin>>s[i];\n\t\trep(j,w){\n\t\t\tif(s[i][j]=='S')S={i,j};\n\t\t}\n\t}\n\n//判定\n\tpriority_queue<P4,vector<P4>,greater<P4> > que;\n\tque.push({{0,0},S});\n\tv[S.first][S.second][0]=0;\n\twhile(!que.empty()){\n\t\tll cost=que.top().first.first,pos=que.top().first.second,x=que.top().second.first,y=que.top().second.second;\n\t\tque.pop();\n\t\tif(s[x][y]=='#')continue;\n\t\tif(s[x][y]=='G'){\n\t\t\tcout<<cost<<endl;\n\t\t\treturn 0;\n\t\t}\n\t\tif(s[x][y]=='U'&&x!=0){\n\t\t\tif(v[x-1][y][pos]==INF){\n\t\t\t\tque.push({{cost+1,pos},{x-1,y}});\n\t\t\t\tv[x-1][y][pos]=cost+1;\n\t\t\t}\n\t\t}\n\t\tif(s[x][y]=='D'&&x!=h-1){\n//\t\t\tcout<<x<<\" \"<<y<<endl;\n\t\t\tif(v[x+1][y][pos]==INF){\n\t\t\t\tque.push({{cost+1,pos},{x+1,y}});\n\t\t\t\tv[x+1][y][pos]=cost+1;\n\t\t\t}\n\t\t}\n\t\tif(s[x][y]=='L'&&y!=0){\n\t\t\tif(v[x][y-1][pos]==INF){\n\t\t\t\tque.push({{cost+1,pos},{x,y-1}});\n\t\t\t\tv[x][y-1][pos]=cost+1;\n\t\t\t}\n\t\t}\n\t\tif(s[x][y]=='R'&&y!=w-1){\n\t\t\tif(v[x][y+1][pos]==INF){\n\t\t\t\tque.push({{cost+1,pos},{x,y+1}});\n\t\t\t\tv[x][y+1][pos]=cost+1;\n\t\t\t}\n\t\t}\n\n\t\tfor(ll i=0;i<4;i++){\n\t\t\tll nx=x+tate[i],ny=y+yoko[i];\n\t\t\tif(nx<0||nx>h-1||ny<0||ny>w-1)continue;\n\t\t\tif(s[x][y]=='U'||s[x][y]=='D'||s[x][y]=='L'||s[x][y]=='R'){\n\t\t\t\tif(pos==0&&v[nx][ny][1]==INF){\n\t\t\t\t\tque.push({{cost+1,1},{nx,ny}});\n\t\t\t\t\tv[nx][ny][1]=cost+1;\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\tif(v[nx][ny][pos]==INF){\n\t\t\t\t\tque.push({{cost+1,pos},{nx,ny}});\n\t\t\t\t\tv[nx][ny][pos]=cost+1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n//\t\tcout<<x<<\" \"<<y<<endl;\n\t}\n//\trep(i,h){\n//\t\trep(j,w){\n//\t\t\tcout<<v[i][j][1]<<\" \";\n//\t\t}\n//\t\tcout<<endl;\n//\t}\n\n\tcout<<-1<<endl;\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 8812, "score_of_the_acc": -0.5238, "final_rank": 13 }, { "submission_id": "aoj_0486_10873052", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr int dy[] = {0, 1, 0, -1}, dx[] = {1, 0, -1, 0};\n\nint main(){\n auto st = chrono::steady_clock::now();\n int h, w;\n cin >> h >> w;\n vector<string> S(h);\n for(auto &i : S) cin >> i;\n \n int sy{}, sx{};\n for(int i = 0; i < h*w; i++){\n if(S[i/w][i%w] == 'S'){\n sy = i/w; sx = i%w;\n break;\n }\n }\n \n vector<vector<vector<int>>> dist(2, vector<vector<int>>(h, vector<int>(w, -1)));\n dist[0][sy][sx] = 0;\n queue<array<int, 3>> Q;\n Q.push({0, sy, sx});\n \n while(!Q.empty()){\n int p = Q.front()[0], y = Q.front()[1], x = Q.front()[2];\n Q.pop();\n int d = dist[p][y][x];\n \n int nc = S[y][x];\n if(nc != '.' && nc != 'S'){\n int ny = y, nx = x;\n if(nc == 'R') nx = x+1;\n else if(nc == 'D') ny = y+1;\n else if(nc == 'L') nx = x-1;\n else if(nc == 'U') ny = y-1;\n \n if(ny >= 0 && nx >= 0 && ny < h && nx < w && S[ny][nx] != '#' && dist[p][ny][nx] == -1){\n dist[p][ny][nx] = d+1;\n Q.push({p, ny, nx});\n }\n \n if(p == 1) continue;\n p = 1;\n }\n \n for(int t = 0; t < 4; t++){\n int ny = y+dy[t], nx = x+dx[t];\n if((ny|nx) < 0 || ny >= h || nx >= w) continue;\n char c = S[ny][nx];\n if(c == '#') continue;\n if(c == 'G'){\n cout << d+1 << '\\n';\n return 0;\n } else {\n if(dist[p][ny][nx] != -1) continue;\n dist[p][ny][nx] = d + 1;\n Q.push({p, ny, nx});\n }\n }\n }\n \n while(chrono::duration_cast<chrono::milliseconds>(chrono::steady_clock::now()-st).count() < 100);\n cout << -1 << '\\n';\n}", "accuracy": 0.14285714285714285, "time_ms": 100, "memory_kb": 3348, "score_of_the_acc": -1, "final_rank": 20 }, { "submission_id": "aoj_0486_10871158", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nvector<ll> mx={0,1,0,-1},my={1,0,-1,0};\nvector<vector<ll>> ch;\n\nvoid dfs(vector<vector<char>> &m,pair<ll,ll> now,ll cnt,bool can){\n ch[now.first][now.second]=cnt;\n if(m[now.first][now.second]=='U'){\n if(m[now.first+mx[3]][now.second+my[3]]!='#'&&(ch[now.first+mx[3]][now.second+my[3]]==-1||ch[now.first+mx[3]][now.second+my[3]]>cnt+1)){\n dfs(m,{now.first+mx[3],now.second+my[3]},cnt+1,can);\n }\n if(can){\n can=false;\n for(ll i=0;i<4;i++){\n if(m[now.first+mx[i]][now.second+my[i]]!='#'&&(ch[now.first+mx[i]][now.second+my[i]]==-1||ch[now.first+mx[i]][now.second+my[i]]>cnt+1)){\n dfs(m,{now.first+mx[i],now.second+my[i]},cnt+1,can);\n }\n }\n can=true;\n }\n }else if(m[now.first][now.second]=='D'){\n if(m[now.first+mx[1]][now.second+my[1]]!='#'&&(ch[now.first+mx[1]][now.second+my[1]]==-1||ch[now.first+mx[1]][now.second+my[1]]>cnt+1)){\n dfs(m,{now.first+mx[1],now.second+my[1]},cnt+1,can);\n }\n if(can){\n can=false;\n for(ll i=0;i<4;i++){\n if(m[now.first+mx[i]][now.second+my[i]]!='#'&&(ch[now.first+mx[i]][now.second+my[i]]==-1||ch[now.first+mx[i]][now.second+my[i]]>cnt+1)){\n dfs(m,{now.first+mx[i],now.second+my[i]},cnt+1,can);\n }\n }\n can=true;\n }\n }else if(m[now.first][now.second]=='L'){\n if(m[now.first+mx[2]][now.second+my[2]]!='#'&&(ch[now.first+mx[2]][now.second+my[2]]==-1||ch[now.first+mx[2]][now.second+my[2]]>cnt+1)){\n dfs(m,{now.first+mx[2],now.second+my[2]},cnt+1,can);\n }\n if(can){\n can=false;\n for(ll i=0;i<4;i++){\n if(m[now.first+mx[i]][now.second+my[i]]!='#'&&(ch[now.first+mx[i]][now.second+my[i]]==-1||ch[now.first+mx[i]][now.second+my[i]]>cnt+1)){\n dfs(m,{now.first+mx[i],now.second+my[i]},cnt+1,can);\n }\n }\n can=true;\n }\n }else if(m[now.first][now.second]=='R'){\n if(m[now.first+mx[0]][now.second+my[0]]!='#'&&(ch[now.first+mx[0]][now.second+my[0]]==-1||ch[now.first+mx[0]][now.second+my[0]]>cnt+1)){\n dfs(m,{now.first+mx[0],now.second+my[0]},cnt+1,can);\n }\n if(can){\n can=false;\n for(ll i=0;i<4;i++){\n if(m[now.first+mx[i]][now.second+my[i]]!='#'&&(ch[now.first+mx[i]][now.second+my[i]]==-1||ch[now.first+mx[i]][now.second+my[i]]>cnt+1)){\n dfs(m,{now.first+mx[i],now.second+my[i]},cnt+1,can);\n }\n }\n can=true;\n }\n }else{\n for(ll i=0;i<4;i++){\n if(m[now.first+mx[i]][now.second+my[i]]!='#'&&(ch[now.first+mx[i]][now.second+my[i]]==-1||ch[now.first+mx[i]][now.second+my[i]]>cnt+1)){\n dfs(m,{now.first+mx[i],now.second+my[i]},cnt+1,can);\n }\n }\n }\n}\n\nint main() {\n ll h,w;cin >> h >> w;\n vector<vector<char>> m(h+2,vector<char>(w+2,'#'));\n pair<ll,ll> s,g;\n for(ll i=0;i<h;i++){\n for(ll j=0;j<w;j++){\n cin >> m[i+1][j+1];\n if(m[i+1][j+1]=='S'){\n s={i+1,j+1};\n }else if(m[i+1][j+1]=='G'){\n g={i+1,j+1};\n }\n }\n }\n ch.resize(h+2,vector<ll>(w+2,-1));\n dfs(m,s,0,true);\n cout << ch[g.first][g.second] << endl;\n}", "accuracy": 0.35714285714285715, "time_ms": 60, "memory_kb": 3832, "score_of_the_acc": -0.602, "final_rank": 19 }, { "submission_id": "aoj_0486_10866765", "code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <queue>\n#include <tuple>\n#include <algorithm>\nusing namespace std;\nconst int INF = 1e9;\nint main() {\n int H, W;\n cin >> H >> W;\n vector<string> m(H);\n int sy, sx, gy, gx;\n for (int i = 0; i < H; ++i) {\n cin >> m[i];\n for (int j = 0; j < W; ++j) {\n if (m[i][j] == 'S') {\n sy = i;\n sx = j;\n }\n if (m[i][j] == 'G') {\n gy = i;\n gx = j;\n }\n }\n }\n vector<vector<vector<int>>> d(H, vector<vector<int>>(W, vector<int>(2, -1)));\n queue<tuple<int, int, int>> q;\n d[sy][sx][0] = 0;\n q.push({sy, sx, 0});\n int dy[] = {0, 1, 0, -1};\n int dx[] = {1, 0, -1, 0};\n string dc = \"RDLU\";\n while (!q.empty()) {\n auto [y, x, k] = q.front();\n q.pop();\n int c = d[y][x][k];\n for (int i = 0; i < 4; ++i) {\n char ch = m[y][x];\n if (ch == 'U' || ch == 'D' || ch == 'L' || ch == 'R') {\n if (ch != dc[i]) continue;\n }\n int ny = y + dy[i];\n int nx = x + dx[i];\n if (ny < 0 || ny >= H || nx < 0 || nx >= W || m[ny][nx] == '#') continue;\n if (d[ny][nx][k] != -1) continue;\n d[ny][nx][k] = c + 1;\n q.push({ny, nx, k});\n }\n if (k == 0) {\n char ch = m[y][x];\n if (ch == 'U' || ch == 'D' || ch == 'L' || ch == 'R') {\n for (int i = 0; i < 4; ++i) {\n int ny = y + dy[i];\n int nx = x + dx[i];\n if (ny < 0 || ny >= H || nx < 0 || nx >= W || m[ny][nx] == '#') continue;\n if (d[ny][nx][1] != -1) continue;\n d[ny][nx][1] = c + 1;\n q.push({ny, nx, 1});\n }\n }\n }\n }\n\n int ans = INF;\n if (d[gy][gx][0] != -1) ans = min(ans, d[gy][gx][0]);\n if (d[gy][gx][1] != -1) ans = min(ans, d[gy][gx][1]);\n if (ans == INF) cout << -1 << endl;\n else cout << ans << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 8288, "score_of_the_acc": -0.4735, "final_rank": 8 }, { "submission_id": "aoj_0486_10847833", "code_snippet": "# include <algorithm>\n# include <bitset>\n# include <complex>\n# include <cmath>\n#define _USE_MATH_DEFINES\n#include <assert.h>\n# include <math.h>\n# include <deque>\n# include <exception>\n# include <fstream>\n# include <functional>\n# include <iomanip>\n# include <ios>\n# include <iosfwd>\n# include <iostream>\n# include <istream>\n# include <iterator>\n# include <limits>\n# include <list>\n# include <locale>\n# include <map>\n# include <memory>\n# include <new>\n# include <numeric>\n# include <ostream>\n# include <queue>\n# include <set>\n# include <sstream>\n# include <stack>\n# include <stdexcept>\n# include <streambuf>\n# include <string>\n# include <typeinfo>\n# include <utility>\n# include <valarray>\n# include <vector>\n# include <array>\n# include <atomic>\n# include <chrono>\n# include <condition_variable>\n# include <forward_list>\n# include <future>\n# include <initializer_list>\n# include <mutex>\n# include <random>\n# include <ratio>\n# include <regex>\n# include <scoped_allocator>\n# include <system_error>\n# include <thread>\n# include <tuple>\n# include <typeindex>\n# include <type_traits>\n# include <unordered_map>\n# include <unordered_set>\n# include <bitset>\n#pragma GCC target (\"avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#define rep(i,n) for (ll i = 0;i < (ll)(n);i++)\n#define Yes cout << \"Yes\" << \"\\n\"// YESの短縮\n#define No cout << \"No\" << \"\\n\"// NOの短縮\n#define rtr0 return(0)//return(0)の短縮\n#define gyakugen(x) modpow(x,mod - 2,mod);\n#define agyakugen(x) modpow(x,amod - 2,amod);\n#define st(A) sort(A.begin(),A.end());\n#define rst(A) sort(A.rbegin(),A.rend());\n#define rev(A) reverse(A.begin(),A.end());\nusing namespace std;\n//using namespace ranges;\nusing ll = long long;//63bit型整数型\nusing ld = long double;//doubleよりも長い値を保存できるもの\nusing ull = unsigned long long;//符号がない64bit型整数\n//ld m_pi = 3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679;\nll mod = 998244353;\nll amod = 1000000007;\nll MINF = -5000000000000000000;\nll INF = 5000000000000000000;\nll inf = 2000000000;\nll minf = -2000000000;\nll BAD = -1;\nll zero = 0;\nld EPS = 1e-10;\nvector<ll>randomhash = {(ll)1e9 + 7,(ll)1e9 + 801,((ll)1e8 * 8) + 29,((ll)1e8 * 7) + 159,((ll)1e8 * 9) + 221};\nvector<ll>tate = {0,-1,0,1};//グリッド上の全探索時の四方向の上下のチェック\nvector<ll>yoko = {1,0,-1,0};//グリッド上の全探索時の四方向の右左のチェック\nvector<ll>etate = {0,-1,-1,-1,0,1,1,1};//グリッド上の全探索時の八方向の上下のチェック\nvector<ll>eyoko = {1,1,0,-1,-1,-1,0,1};//グリッド上の全探索時の八方向の右左のチェック\nvector<ll>hexsax = {0,1,1,0,-1,-1};\nvector<ll>hexsay = {1,1,0,-1,-1,0};\n//返り値は素数のリスト。\nvector < bool > isprime;\nvector < ll > Era(int n){//書き方 vector<ll>[] = Era(x); とやるとxまでの素数が出てくる。\n\tisprime.resize(n, true);\n\tvector < ll > res;\n\tisprime[0] = false;\n\tisprime[1] = false;\n\tfor(ll i = 2; i < n; ++i) isprime[i] = true;\n\tfor(ll i = 2; i < n; ++i) {\n\t\tif(isprime[i]) {\n\t\t\tres.push_back(i);\n\t\t\tfor(ll j = i * 2; j < n; j += i) isprime[j] = false;\n\t\t}\n\t}\n\treturn res;\n}\nll ceil_div(ll a, ll b){\n if (b <= 0) return INF; // invalid (分母<=0 のときは不可能と扱う)\n return (a + b - 1) / b;\n}\n//　　　　　　素数判定 21~35\null modmul(ull a,ull b,ull mod) {\n return (ull)a*b%mod;\n}\nll modpow(ll a, ll n, ll mod) {\n\tll res = 1;\n\twhile (n > 0) {\n\t\tif (n & 1) res = res * a % mod;\n\t\ta = a * a % mod;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n\nlong long npow(long long a, long long n){\n long long res = 1;\n while (n > 0) {\n\t\tif (n & 1) res = res * a;\n\t\ta = a * a;\n\t\tn >>= 1;\n\t}\n\treturn res;\n}\n// モッドを使った累乗\nlong long isqrt(long long num){\n return((long long)sqrtl(num));\n}\nld get_theta(ld px,ld py,ld fx,ld fy,ld sx,ld sy){\n ld fxv = fx-px;\n ld fyv = fy-py;\n ld sxv = sx-px;\n ld syv = sy-py;\n ld fsv = fxv*sxv + fyv*syv;\n ld pfs = (ld)sqrt(fxv*fxv+fyv*fyv);\n ld pss = (ld)sqrt(sxv*sxv+syv*syv);\n return acos(fsv/(pfs*pss))*180/M_PI;\n};\nld Euclidean_distance(ll x1,ll y1,ll x2,ll y2){\n ld x = abs((ld)x1 - (ld)x2);\n ld y = abs((ld)y1 - (ld)y2);\n return sqrt((x*x) + (y*y));\n};\nll Manhattan_distance(ll x1,ll y1,ll x2,ll y2){\n return abs(x1-x2)+abs(y1-y2);\n};\nvoid change_bit(ll N,ll start,vector<ll>&X){\n for(ll i = start;i>=0;i--){\n ll a = npow(2,i);\n if(N/a==1){\n X[i]=1;\n N-=a;\n }\n }\n}\nll popcount(ll x) {\n int count = 0;\n while (x) {\n count += x & 1;\n x >>= 1;\n }\n return count;\n}\n\nll cutup(ll a,ll b){\n return (a+b-1)/b;\n}\nvoid Run_Length_Encoding(vector<ll>A,vector<pair<ll,ll>>&RLE){\n RLE.push_back({A[0],1});\n ll N = A.size();\n for(int i = 1;i<N;i++){\n if(RLE[RLE.size()-1].first==A[i])RLE[RLE.size()-1].second++;\n else RLE.push_back({A[i],1});\n }\n}\nbool is_in_grid(ll i,ll ii,ll H,ll W){\n bool res = false;\n if(i>=0&&i<H&&ii>=0&&ii<W)res=true;\n return res;\n}\ntemplate<class T>\nstruct rolling_hash{\n vector<ull>Power,hash,InvPower;\n ll B = 0;\n ll MOD = 0;\n void set_number(ll base,ll mod){\n B = base;\n MOD = mod;\n }\n void do_hash(const T &S) {\n ll N = S.size();\n Power.resize(N+1);\n InvPower.resize(N+1);\n hash.resize(N+1);\n Power[0] = 1;\n InvPower[0] = 1;\n for (ll i = 0;i<N;i++) {\n Power[i + 1] = modmul(Power[i],B,MOD);\n InvPower[i + 1] = modpow(Power[i+1],MOD-2,MOD);\n hash[i + 1] = (hash[i] + modmul(S[i], Power[i],MOD))%MOD;\n }\n }\n ll get_hash(ll l, ll r) {\n ull res = (hash[r]+MOD-hash[l])%MOD;\n res = modmul(res,InvPower[l],MOD);\n return res;\n }\n};\ntemplate<class T>\nstruct combination{\n public:\n vector<T>factorial;\n ll MOD;\n ll N;\n void reset(T n,T mod){\n N = n+1;\n factorial.assign(N,1);\n MOD = mod;\n }\n void calu(){\n for(ll i = 1;i<N;i++){\n factorial[i] = (factorial[i-1]*(i))%MOD;\n }\n }\n T get(T n, T r){\n ll a = factorial[n];\n ll b = (factorial[r]*(factorial[n-r]))%MOD;\n b = modpow(b,MOD - 2,MOD);\n return (a*b)%MOD;\n }\n};\ntemplate<class T>\nstruct dijkstra{\n public:\n\tvector<vector<pair<T,T>>>graph;\n\tvector<T>ans;\n\tpriority_queue<pair<T,T>,vector<pair<T,T>>,greater<pair<T,T>>>pq;\n void do_dijkstra(T start){//頂点xからダイクストラを行う\n\t\tpq.push({0,start});\n\t\tans[start] = 0;\n\t\twhile(true){\n\t\t\tif(pq.empty())break;\n\t\t\tT cost = pq.top().first;\n\t\t\tT vertex = pq.top().second;\n\t\t\tpq.pop();\n if (cost > ans[vertex]) continue; \n\t\t\tfor(T i = 0;i<graph[vertex].size();i++){\n\t\t\t\tT nextvertex = graph[vertex][i].first;\n\t\t\t\tT nextcost = graph[vertex][i].second + cost;\n\t\t\t\tif(ans[nextvertex] <= nextcost)continue;\n\t\t\t\t\tans[nextvertex] = nextcost;\n\t\t\t\t\tpq.push({nextcost,nextvertex});\n\t\t\t}\n\t\t}\n\t}\n\tvoid make_indirectedgraph(T u,T v,T cost){//無向辺のグラフ作成\n\t\tgraph[u].push_back({v,cost});\n\t\tgraph[v].push_back({u,cost});\n\t}\n\tvoid make_directedgraph(T u,T v,T cost){//有向辺のグラフ作成\n\t\tgraph[u].push_back({v,cost});\n\t}\n\tT output(T end){//答えを出す\n\t\treturn ans[end];\n\t} \n\tvoid reset(T N){//リセット\n\t\tgraph.assign(N, {});\n ans.assign(N, INF);\n\t}\n};\ntemplate<class T>\nstruct unionfind {\npublic:\n vector<T> parent, rank;\n void reset(T N) { // 初期化\n parent.resize(N);\n rank.assign(N, 1); // 各集合のサイズを 1 にする\n for (T i = 0; i < N; i++) parent[i] = i;\n }\n T leader(T x) { // 経路圧縮による親の取得\n if (parent[x] == x) return x;\n return parent[x] = leader(parent[x]); // 経路圧縮\n }\n void marge(T x, T y) { // ランクによるマージ\n T a = leader(x), b = leader(y);\n if(a!=b){\n if (rank[a] < rank[b]) swap(a, b);\n parent[b] = a;\n rank[a] += rank[b]; // サイズを更新 \n }\n }\n bool same(T x, T y) { // 同じ集合か判定\n return leader(x) == leader(y);\n }\n T size(T x) { // 集合のサイズを取得\n return rank[leader(x)];\n }\n void check(T N) { // デバッグ用: 親の確認\n for (T i = 0; i < N; i++) cout << parent[i] << \" \";\n cout << \"\\n\";\n }\n};\n//セグ木\ntemplate <class S, S (*op)(S, S), S (*e)()> struct segtree {\n public:\n segtree() : segtree(0) {}\n segtree(int n) : segtree(std::vector<S>(n, e())) {}\n segtree(const std::vector<S>& v) : _n(int(v.size())){\n log = ceil_pow2(_n);\n size = 1 << log;\n d = std::vector<S>(2 * size, e());\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) {\n update(i);\n }\n }\n \n void set(int p, S x) {\n assert(0 <= p && p < _n);\n p += size;\n d[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n \n S get(int p) {\n assert(0 <= p && p < _n);\n return d[p + size];\n }\n \n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n S sml = e(), smr = e();\n l += size;\n r += size;\n \n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n return op(sml, smr);\n }\n \n S all_prod() { return d[1]; }\n \n template <bool (*f)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return f(x); });\n }\n template <class F> int max_right(int l, F f) {\n assert(0 <= l && l <= _n);\n assert(f(e()));\n if (l == _n) return _n;\n l += size;\n S sm = e();\n do{\n while (l % 2 == 0) l >>= 1;\n if (!f(op(sm, d[l]))) {\n while (l < size) {\n l = (2 * l);\n if (f(op(sm, d[l]))) {\n sm = op(sm, d[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = op(sm, d[l]);\n l++;\n }while ((l & -l) != l);\n return _n;\n }\n \n template <bool (*f)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return f(x); });\n }\n template <class F> int min_left(int r, F f) {\n assert(0 <= r && r <= _n);\n assert(f(e()));\n if (r == 0) return 0;\n r += size;\n S sm = e();\n do{\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!f(op(d[r], sm))) {\n while (r < size) {\n r = (2 * r + 1);\n if (f(op(d[r], sm))) {\n sm = op(d[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = op(d[r], sm);\n }while ((r & -r) != r);\n return 0;\n }\n \n private:\n int _n, size, log;\n std::vector<S> d;\n \n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n int ceil_pow2(int n) {\n int x = 0;\n while ((1U << x) < (unsigned int)(n)) x++;\n return x;\n }\n};\n\n//遅延セグ木\ntemplate <class S,S (*op)(S, S),S (*e)(),class F,S (*mapping)(F, S),F (*composition)(F, F),F (*id)()>\nstruct lazy_segtree {\n\n public:\n lazy_segtree() : lazy_segtree(0) {}\n lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}\n lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {\n log = ceil_pow2(_n);\n size = 1 << log;\n d = std::vector<S>(2 * size, e());\n lz = std::vector<F>(size, id());\n for (int i = 0; i < _n; i++) d[size + i] = v[i];\n for (int i = size - 1; i >= 1; i--) {\n update(i);\n }\n }\n\n void set(int p, S x) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = x;\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n\n S get(int p) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n return d[p];\n }\n\n S prod(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return e();\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push(r >> i);\n }\n\n S sml = e(), smr = e();\n while (l < r) {\n if (l & 1) sml = op(sml, d[l++]);\n if (r & 1) smr = op(d[--r], smr);\n l >>= 1;\n r >>= 1;\n }\n\n return op(sml, smr);\n }\n\n S all_prod() { return d[1]; }\n\n void apply(int p, F f) {\n assert(0 <= p && p < _n);\n p += size;\n for (int i = log; i >= 1; i--) push(p >> i);\n d[p] = mapping(f, d[p]);\n for (int i = 1; i <= log; i++) update(p >> i);\n }\n void apply(int l, int r, F f) {\n assert(0 <= l && l <= r && r <= _n);\n if (l == r) return;\n\n l += size;\n r += size;\n\n for (int i = log; i >= 1; i--) {\n if (((l >> i) << i) != l) push(l >> i);\n if (((r >> i) << i) != r) push((r - 1) >> i);\n }\n\n {\n int l2 = l, r2 = r;\n while (l < r) {\n if (l & 1) all_apply(l++, f);\n if (r & 1) all_apply(--r, f);\n l >>= 1;\n r >>= 1;\n }\n l = l2;\n r = r2;\n }\n\n for (int i = 1; i <= log; i++) {\n if (((l >> i) << i) != l) update(l >> i);\n if (((r >> i) << i) != r) update((r - 1) >> i);\n }\n }\n\n template <bool (*g)(S)> int max_right(int l) {\n return max_right(l, [](S x) { return g(x); });\n }\n template <class G> int max_right(int l, G g) {\n assert(0 <= l && l <= _n);\n assert(g(e()));\n if (l == _n) return _n;\n l += size;\n for (int i = log; i >= 1; i--) push(l >> i);\n S sm = e();\n do {\n while (l % 2 == 0) l >>= 1;\n if (!g(op(sm, d[l]))) {\n while (l < size) {\n push(l);\n l = (2 * l);\n if (g(op(sm, d[l]))) {\n sm = op(sm, d[l]);\n l++;\n }\n }\n return l - size;\n }\n sm = op(sm, d[l]);\n l++;\n } while ((l & -l) != l);\n return _n;\n }\n\n template <bool (*g)(S)> int min_left(int r) {\n return min_left(r, [](S x) { return g(x); });\n }\n template <class G> int min_left(int r, G g) {\n assert(0 <= r && r <= _n);\n assert(g(e()));\n if (r == 0) return 0;\n r += size;\n for (int i = log; i >= 1; i--) push((r - 1) >> i);\n S sm = e();\n do {\n r--;\n while (r > 1 && (r % 2)) r >>= 1;\n if (!g(op(d[r], sm))) {\n while (r < size) {\n push(r);\n r = (2 * r + 1);\n if (g(op(d[r], sm))) {\n sm = op(d[r], sm);\n r--;\n }\n }\n return r + 1 - size;\n }\n sm = op(d[r], sm);\n } while ((r & -r) != r);\n return 0;\n }\n\n private:\n int _n, size, log;\n std::vector<S> d;\n std::vector<F> lz;\n int ceil_pow2(int n) {\n int x = 0;\n while ((1U << x) < (unsigned int)(n)) x++;\n return x;\n }\n void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }\n void all_apply(int k, F f) {\n d[k] = mapping(f, d[k]);\n if (k < size) lz[k] = composition(f, lz[k]);\n }\n void push(int k) {\n all_apply(2 * k, lz[k]);\n all_apply(2 * k + 1, lz[k]);\n lz[k] = id();\n }\n};\nstruct Euler_Tour{//最小共通祖先,部分木のコスト,通り道のコスト,のグラフを作る部分(オイラーツアー)\n //必要なもの集\n //セグ木は2*Nがベース\n //LCA(最小共通祖先)discovery,finish,visit,high\n //とある頂点xを根とする部分木の範囲 discovery,finish\n //頂点xを根とする部分木の辺と頂点のコストの総和 discovery,finish,vcost1,ecost1\n //頂点xを根とする頂点yまでの最短の辺と頂点のコストの総和 discovery,finish,vcost2,ecost2\n vector<int>discovery,finish,visit,high,vweight,vcost1,vcost2,ecost1,ecost2;\n vector<int>other;\n vector<vector<pair<int,int>>>graph;\n int cnt;\n int othercnt;\n void reset(ll N){\n cnt = 0;\n othercnt = 0;\n other.assign(2*N,0);\n discovery.assign(N,inf);\n finish.assign(N,minf);\n vweight.assign(N,0);\n graph.assign(N,vector<pair<int,int>>(0));\n visit.assign(2*N,0);\n high.assign(2*N,0);\n vcost1.assign(2*N,0);\n vcost2.assign(2*N,0);\n ecost1.assign(2*N,0);\n ecost2.assign(2*N,0);\n };\n void make_graph(ll u,ll v,ll cost){\n if(max(u,v)>graph.size()){\n cout << \"not reset or out of range\" << \"\\n\";\n return;\n }\n graph[u].push_back({v,cost});\n graph[v].push_back({u,cost});\n }\n void set_vweight(ll vertex,ll cost){\n vweight[vertex]+=cost;\n }\n void DFS(ll vertex,ll nowdepth,ll cost){\n if(discovery[vertex]==inf){\n vcost1[cnt]=vweight[vertex];\n vcost2[cnt]=vweight[vertex];\n }\n else{\n vcost1[cnt]=0;\n vcost2[cnt]=0;\n }\n ecost1[cnt]=cost;\n ecost2[cnt]=cost;\n discovery[vertex]=min(discovery[vertex],cnt);\n visit[cnt]=vertex;\n high[cnt]=nowdepth;\n for(int i = 0;i<graph[vertex].size();i++){\n int x = graph[vertex][i].first;\n int nextcost = graph[vertex][i].second;\n if(discovery[x]!=inf&&graph[vertex].size()==1)othercnt++;\n other[cnt]=othercnt;\n if(discovery[x]==inf){\n cnt++;\n DFS(x,nowdepth+1,nextcost);\n cnt++;\n visit[cnt]=vertex;\n high[cnt]=nowdepth;\n vcost1[cnt]=0;\n ecost1[cnt]=0;\n vcost2[cnt]=vweight[x]*-1;\n ecost2[cnt]=nextcost*-1;\n }\n other[cnt]=othercnt;\n }\n finish[vertex]=cnt+1;\n return;\n }\n int get_size(){\n ll res = high.size()-1;\n return res;\n }\n int get_vcost1(ll i){\n return ecost1[i];\n }\n int get_vcost2(ll i){\n return vcost2[i];\n }\n int get_ecost1(ll i){\n return vcost1[i];\n }\n int get_ecost2(ll i){\n return ecost2[i];\n }\n int get_high(ll i){\n return high[i];\n }\n int get_visit(ll i){\n return visit[i];\n }\n int get_discovery(ll i){\n return discovery[i];\n }\n int get_finish(ll i){\n return finish[i];\n }\n};\n//遅延セグ木のベース\n//型\nusing segS = ll;\nsegS oop(segS a,segS b){\n return (a+b)%mod;\n}\nsegS ee(){\n return 0;\n}\n/*struct segS{\n ll mi = 0;\n ll ma = 0;\n};\nsegS oop(segS a,segS b){\n segS res;\n res.mi = min(a.mi,b.mi);\n res.ma = max(a.ma,b.ma);\n return res;\n}\nsegS ee(){\n segS res;\n res.mi = INF;\n res.ma = MINF;\n return res;\n}*/\n\n//using lazyS = ll;\nusing lazyS = ll;\nusing lazyF = ll;\nlazyS e(){\n lazyS res;\n res = 1;\n return res;\n}//範囲外などを起こしてしまったときの返り値\nlazyS op(lazyS a, lazyS b){\n lazyS res;\n res = a+b;\n return res; \n}//操作したいこと\nlazyS mapping(lazyF f, lazyS x){ \n x= (x*f)%mod;\n return x; \n}//下まで伝播させたいこと\nlazyF composition(lazyF f, lazyF g){ return g = (g*f)%mod; }//まとめてやった場合おこしたいこと\nlazyF id(){ return 1; }//遅延セグ木のベース\n/*\nusing lazyS = ll;\nusing lazyF = ll;\nlazyS e(){ return 0;}//範囲外などを起こしてしまったときの返り値\nlazyS op(lazyS a, lazyS b){ return a+b; }//操作したいこと\nlazyS mapping(lazyF f, lazyS x){ return x /= f; }//下まで伝播させたいこと\nlazyF composition(lazyF f, lazyF g){ return g /= f; }//まとめてやった場合おこしたいこと\nlazyF id(){ return 1; }//遅延セグ木のベース\n*/\n\nint main(){\nll H,W;\ncin >> H >> W;\nvector<string>grid(H);\nvector<vector<vector<ll>>>ans(2,vector<vector<ll>>(H,vector<ll>(W,INF)));\nvector<vector<vector<bool>>>visited(2,vector<vector<bool>>(H,vector<bool>(W)));\nll sx,sy,ex,ey;\nfor(int i = 0;i<H;i++){\n cin >> grid[i];\n for(int ii = 0;ii<W;ii++){\n if(grid[i][ii]=='S'){\n sx = i;\n sy = ii;\n }\n if(grid[i][ii]=='G'){\n ex = i;\n ey = ii;\n }\n }\n}\npriority_queue<tuple<ll,ll,ll,ll>,vector<tuple<ll,ll,ll,ll>>,greater<tuple<ll,ll,ll,ll>>>pq;\npq.emplace(0,0,sx,sy);\nans[0][sx][sy] = 0; \nwhile(true){\n if(pq.empty())break;\n auto[dimension,cnt,x,y] = pq.top();\n pq.pop();\n if(cnt>ans[dimension][x][y])continue;\n if(grid[x][y]=='.'){\n for(int i = 0;i<4;i++){\n ll X = x+tate[i];\n ll Y = y+yoko[i];\n if(!is_in_grid(X,Y,H,W))continue;\n if(grid[X][Y]=='#')continue;\n if(ans[dimension][X][Y]<=cnt+1)continue;\n ans[dimension][X][Y] = cnt+1;\n pq.emplace(dimension,cnt+1,X,Y);\n }\n }\n else{\n for(int i = 0;i<4;i++){\n ll X = x+tate[i];\n ll Y = y+yoko[i];\n ll ndimension = dimension;\n if(!is_in_grid(X,Y,H,W))continue;\n if(grid[X][Y]=='#')continue;\n if(grid[x][y]=='R')if(i!=0)ndimension++;\n if(grid[x][y]=='U')if(i!=1)ndimension++;\n if(grid[x][y]=='L')if(i!=2)ndimension++;\n if(grid[x][y]=='D')if(i!=3)ndimension++;\n if(ndimension==2)continue;\n if(ans[ndimension][X][Y]<=cnt+1)continue;\n ans[ndimension][X][Y] = cnt+1;\n pq.emplace(ndimension,cnt+1,X,Y);\n }\n }\n}\n//cout << ans[0][ex][ey] << \"\\n\";\ncout << (min(ans[0][ex][ey],ans[1][ex][ey]) == INF ? -1:min(ans[0][ex][ey],ans[1][ex][ey])) << \"\\n\";\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 10728, "score_of_the_acc": -0.9297, "final_rank": 17 }, { "submission_id": "aoj_0486_10833932", "code_snippet": "#include<algorithm>\n#include<iostream>\n#include<cmath>\n#include<cstdio>\n#include<iomanip>\n#include<utility>\n#include<string>\n#include<vector>\n#include<bit>\n#include<bitset>\n#include<tuple>\n#include<map>\n#include<set>\n#include<queue>\n#include<deque>\n#include<stack>\nusing namespace std;\n\nvoid fix(int x){\n cout << fixed << setprecision(x);\n}\n\nint main(){\n long int H, W, X, Y, GX, GY;\n cin >> H >> W;\n vector<string> A(H);\n for (long int i = 0; i < H; i++){\n cin >> A.at(i);\n for (long int j = 0; j < W; j++){\n if (A.at(i).at(j) == 'S'){\n Y = i;\n X = j;\n }\n if (A.at(i).at(j) == 'G'){\n GY = i;\n GX = j;\n }\n }\n }\n vector<vector<long int> > B(H, vector<long int>(W, 100000000));\n vector<vector<long int> > C(H, vector<long int>(W, 100000000));\n queue<pair<long int, long int> > Q;\n Q.push(make_pair(Y, X));\n B.at(Y).at(X) = 0;\n while (!Q.empty()){\n Y = Q.front().first;\n X = Q.front().second;\n Q.pop();\n if (A.at(Y).at(X) == '.' || A.at(Y).at(X) == 'S'){\n if (Y != 0){\n if (A.at(Y - 1).at(X) != '#'){\n if (B.at(Y - 1).at(X) == 100000000 && B.at(Y).at(X) != 100000000 && C.at(Y - 1).at(X) == 100000000 && C.at(Y).at(X) != 100000000){\n B.at(Y - 1).at(X) = B.at(Y).at(X) + 1;\n C.at(Y - 1).at(X) = C.at(Y).at(X) + 1;\n Q.push(make_pair(Y - 1, X));\n }else if (B.at(Y - 1).at(X) == 100000000 && B.at(Y).at(X) != 100000000){\n B.at(Y - 1).at(X) = B.at(Y).at(X) + 1;\n Q.push(make_pair(Y - 1, X));\n }else if (C.at(Y - 1).at(X) == 100000000 && C.at(Y).at(X) != 100000000){\n C.at(Y - 1).at(X) = C.at(Y).at(X) + 1;\n Q.push(make_pair(Y - 1, X));\n }\n }\n }\n if (Y != H - 1){\n if (A.at(Y + 1).at(X) != '#'){\n if (B.at(Y + 1).at(X) == 100000000 && B.at(Y).at(X) != 100000000 && C.at(Y + 1).at(X) == 100000000 && C.at(Y).at(X) != 100000000){\n B.at(Y + 1).at(X) = B.at(Y).at(X) + 1;\n C.at(Y + 1).at(X) = C.at(Y).at(X) + 1;\n Q.push(make_pair(Y + 1, X));\n }else if (B.at(Y + 1).at(X) == 100000000 && B.at(Y).at(X) != 100000000){\n B.at(Y + 1).at(X) = B.at(Y).at(X) + 1;\n Q.push(make_pair(Y + 1, X));\n }else if (C.at(Y + 1).at(X) == 100000000 && C.at(Y).at(X) != 100000000){\n C.at(Y + 1).at(X) = C.at(Y).at(X) + 1;\n Q.push(make_pair(Y + 1, X));\n }\n }\n }\n if (X != 0){\n if (A.at(Y).at(X - 1) != '#'){\n if (B.at(Y).at(X - 1) == 100000000 && B.at(Y).at(X) != 100000000 && C.at(Y).at(X - 1) == 100000000 && C.at(Y).at(X) != 100000000){\n B.at(Y).at(X - 1) = B.at(Y).at(X) + 1;\n C.at(Y).at(X - 1) = C.at(Y).at(X) + 1;\n Q.push(make_pair(Y, X - 1));\n }else if (B.at(Y).at(X - 1) == 100000000 && B.at(Y).at(X) != 100000000){\n B.at(Y).at(X - 1) = B.at(Y).at(X) + 1;\n Q.push(make_pair(Y, X - 1));\n }else if (C.at(Y).at(X - 1) == 100000000 && C.at(Y).at(X) != 100000000){\n C.at(Y).at(X - 1) = C.at(Y).at(X) + 1;\n Q.push(make_pair(Y, X - 1));\n }\n }\n }\n if (X != W - 1){\n if (A.at(Y).at(X + 1) != '#'){\n if (B.at(Y).at(X + 1) == 100000000 && B.at(Y).at(X) != 100000000 && C.at(Y).at(X + 1) == 100000000 && C.at(Y).at(X) != 100000000){\n B.at(Y).at(X + 1) = B.at(Y).at(X) + 1;\n C.at(Y).at(X + 1) = C.at(Y).at(X) + 1;\n Q.push(make_pair(Y, X + 1));\n }else if (B.at(Y).at(X + 1) == 100000000 && B.at(Y).at(X) != 100000000){\n B.at(Y).at(X + 1) = B.at(Y).at(X) + 1;\n Q.push(make_pair(Y, X + 1));\n }else if (C.at(Y).at(X + 1) == 100000000 && C.at(Y).at(X) != 100000000){\n C.at(Y).at(X + 1) = C.at(Y).at(X) + 1;\n Q.push(make_pair(Y, X + 1));\n }\n }\n }\n }else if (A.at(Y).at(X) == 'U'){\n if (Y != 0){\n if (A.at(Y - 1).at(X) != '#'){\n if (B.at(Y - 1).at(X) == 100000000 && B.at(Y).at(X) != 100000000 && C.at(Y - 1).at(X) == 100000000 && C.at(Y).at(X) != 100000000){\n B.at(Y - 1).at(X) = B.at(Y).at(X) + 1;\n C.at(Y - 1).at(X) = C.at(Y).at(X) + 1;\n Q.push(make_pair(Y - 1, X));\n }else if (B.at(Y - 1).at(X) == 100000000 && B.at(Y).at(X) != 100000000){\n B.at(Y - 1).at(X) = B.at(Y).at(X) + 1;\n Q.push(make_pair(Y - 1, X));\n }else if (C.at(Y - 1).at(X) == 100000000 && C.at(Y).at(X) != 100000000){\n C.at(Y - 1).at(X) = C.at(Y).at(X) + 1;\n Q.push(make_pair(Y - 1, X));\n }\n }\n }\n if (Y != H - 1){\n if (A.at(Y + 1).at(X) != '#'){\n if (C.at(Y + 1).at(X) == 100000000 && B.at(Y).at(X) != 100000000){\n C.at(Y + 1).at(X) = B.at(Y).at(X) + 1;\n Q.push(make_pair(Y + 1, X));\n }\n }\n }\n if (X != 0){\n if (A.at(Y).at(X - 1) != '#'){\n if (C.at(Y).at(X - 1) == 100000000 && B.at(Y).at(X) != 100000000){\n C.at(Y).at(X - 1) = B.at(Y).at(X) + 1;\n Q.push(make_pair(Y, X - 1));\n }\n }\n }\n if (X != W - 1){\n if (A.at(Y).at(X + 1) != '#'){\n if (C.at(Y).at(X + 1) == 100000000 && B.at(Y).at(X) != 100000000){\n C.at(Y).at(X + 1) = B.at(Y).at(X) + 1;\n Q.push(make_pair(Y, X + 1));\n }\n }\n }\n }else if (A.at(Y).at(X) == 'D'){\n if (Y != 0){\n if (A.at(Y - 1).at(X) != '#'){\n if (C.at(Y - 1).at(X) == 100000000 && B.at(Y).at(X) != 100000000){\n C.at(Y - 1).at(X) = B.at(Y).at(X) + 1;\n Q.push(make_pair(Y - 1, X));\n }\n }\n }\n if (Y != H - 1){\n if (A.at(Y + 1).at(X) != '#'){\n if (B.at(Y + 1).at(X) == 100000000 && B.at(Y).at(X) != 100000000 && C.at(Y + 1).at(X) == 100000000 && C.at(Y).at(X) != 100000000){\n B.at(Y + 1).at(X) = B.at(Y).at(X) + 1;\n C.at(Y + 1).at(X) = C.at(Y).at(X) + 1;\n Q.push(make_pair(Y + 1, X));\n }else if (B.at(Y + 1).at(X) == 100000000 && B.at(Y).at(X) != 100000000){\n B.at(Y + 1).at(X) = B.at(Y).at(X) + 1;\n Q.push(make_pair(Y + 1, X));\n }else if (C.at(Y + 1).at(X) == 100000000 && C.at(Y).at(X) != 100000000){\n C.at(Y + 1).at(X) = C.at(Y).at(X) + 1;\n Q.push(make_pair(Y + 1, X));\n }\n }\n }\n if (X != 0){\n if (A.at(Y).at(X - 1) != '#'){\n if (C.at(Y).at(X - 1) == 100000000 && B.at(Y).at(X) != 100000000){\n C.at(Y).at(X - 1) = B.at(Y).at(X) + 1;\n Q.push(make_pair(Y, X - 1));\n }\n }\n }\n if (X != W - 1){\n if (A.at(Y).at(X + 1) != '#'){\n if (C.at(Y).at(X + 1) == 100000000 && B.at(Y).at(X) != 100000000){\n C.at(Y).at(X + 1) = B.at(Y).at(X) + 1;\n Q.push(make_pair(Y, X + 1));\n }\n }\n }\n }else if (A.at(Y).at(X) == 'L'){\n if (Y != 0){\n if (A.at(Y - 1).at(X) != '#'){\n if (C.at(Y - 1).at(X) == 100000000 && B.at(Y).at(X) != 100000000){\n C.at(Y - 1).at(X) = B.at(Y).at(X) + 1;\n Q.push(make_pair(Y - 1, X));\n }\n }\n }\n if (Y != H - 1){\n if (A.at(Y + 1).at(X) != '#'){\n if (C.at(Y + 1).at(X) == 100000000 && B.at(Y).at(X) != 100000000){\n C.at(Y + 1).at(X) = B.at(Y).at(X) + 1;\n Q.push(make_pair(Y + 1, X));\n }\n }\n }\n if (X != 0){\n if (A.at(Y).at(X - 1) != '#'){\n if (B.at(Y).at(X - 1) == 100000000 && B.at(Y).at(X) != 100000000 && C.at(Y).at(X - 1) == 100000000 && C.at(Y).at(X) != 100000000){\n B.at(Y).at(X - 1) = B.at(Y).at(X) + 1;\n C.at(Y).at(X - 1) = C.at(Y).at(X) + 1;\n Q.push(make_pair(Y, X - 1));\n }else if (B.at(Y).at(X - 1) == 100000000 && B.at(Y).at(X) != 100000000){\n B.at(Y).at(X - 1) = B.at(Y).at(X) + 1;\n Q.push(make_pair(Y, X - 1));\n }else if (C.at(Y).at(X - 1) == 100000000 && C.at(Y).at(X) != 100000000){\n C.at(Y).at(X - 1) = C.at(Y).at(X) + 1;\n Q.push(make_pair(Y, X - 1));\n }\n }\n }\n if (X != W - 1){\n if (A.at(Y).at(X + 1) != '#'){\n if (C.at(Y).at(X + 1) == 100000000 && B.at(Y).at(X) != 100000000){\n C.at(Y).at(X + 1) = B.at(Y).at(X) + 1;\n Q.push(make_pair(Y, X + 1));\n }\n }\n }\n }else if (A.at(Y).at(X) == 'R'){\n if (Y != 0){\n if (A.at(Y - 1).at(X) != '#'){\n if (C.at(Y - 1).at(X) == 100000000 && B.at(Y).at(X) != 100000000){\n C.at(Y - 1).at(X) = B.at(Y).at(X) + 1;\n Q.push(make_pair(Y - 1, X));\n }\n }\n }\n if (Y != H - 1){\n if (A.at(Y + 1).at(X) != '#'){\n if (C.at(Y + 1).at(X) == 100000000 && B.at(Y).at(X) != 100000000){\n C.at(Y + 1).at(X) = B.at(Y).at(X) + 1;\n Q.push(make_pair(Y + 1, X));\n }\n }\n }\n if (X != 0){\n if (A.at(Y).at(X - 1) != '#'){\n if (C.at(Y).at(X - 1) == 100000000 && B.at(Y).at(X) != 100000000){\n C.at(Y).at(X - 1) = B.at(Y).at(X) + 1;\n Q.push(make_pair(Y, X - 1));\n }\n }\n }\n if (X != W - 1){\n if (A.at(Y).at(X + 1) != '#'){\n if (B.at(Y).at(X + 1) == 100000000 && B.at(Y).at(X) != 100000000 && C.at(Y).at(X + 1) == 100000000 && C.at(Y).at(X) != 100000000){\n B.at(Y).at(X + 1) = B.at(Y).at(X) + 1;\n C.at(Y).at(X + 1) = C.at(Y).at(X) + 1;\n Q.push(make_pair(Y, X + 1));\n }else if (B.at(Y).at(X + 1) == 100000000 && B.at(Y).at(X) != 100000000){\n B.at(Y).at(X + 1) = B.at(Y).at(X) + 1;\n Q.push(make_pair(Y, X + 1));\n }else if (C.at(Y).at(X + 1) == 100000000 && C.at(Y).at(X) != 100000000){\n C.at(Y).at(X + 1) = C.at(Y).at(X) + 1;\n Q.push(make_pair(Y, X + 1));\n }\n }\n }\n }\n }\n if (B.at(GY).at(GX) == 100000000 && C.at(GY).at(GX) == 100000000){\n cout << -1 << endl;\n }else{\n cout << min(B.at(GY).at(GX), C.at(GY).at(GX)) << endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5248, "score_of_the_acc": -0.1821, "final_rank": 7 }, { "submission_id": "aoj_0486_10823324", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define oke cout << \"Yes\" << '\\n';\n#define dame cout << \"No\" << '\\n';\n#define all(a) a.begin(), a.end()\n#define rall(a) a.rbegin(), a.rend()\nusing HaiI = vector<vector<int>>;\nusing Hai2 = vector<vector<ll>>;\nusing HaiB = vector<vector<bool>>;\nusing Hai3 = vector<vector<vector<ll>>>;\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\tcout << fixed << setprecision(15);\n\tint H,W;\n\tcin >> H >> W;\n\tvector<string>S(H);\n\trep(i,H){\n\t\tcin >> S[i];\n\t}\n\n\tHai3 dist(H,Hai2(W,vector<ll>(2,1e9)));\n\tqueue<pair<int,int>>Q;\n\tpair<int,int>goal;\n\trep(i,H){\n\t\trep(j,W){\n\t\t\tif(S[i][j]=='S'){\n\t\t\t\tQ.push({i,j});\n\t\t\t\tdist[i][j][0]=0;\n\t\t\t}\n\t\t\tif(S[i][j]=='G'){\n\t\t\t\tgoal={i,j};\n\t\t\t}\n\t\t}\n\t}\n\n\tvector<char>goc={'R','L','U','D'};\n vector<int>gox={1,-1,0,0};\n vector<int>goy={0,0,-1,1};\n\n\twhile(!Q.empty()){\n\t\tint y,x;\n\t\ttie(y,x)=Q.front();\n\t\tQ.pop();\n\t\trep(i,4){\n\t\t\tint xx=x+gox[i],yy=y+goy[i];\n\t\t\tif(xx < 0 || xx >= W || yy < 0 || yy >= H){\n \tcontinue;\n \t}\n\t\t\tif(S[yy][xx]=='#') continue;\n\t\t\tif(S[y][x]=='.'||S[y][x]=='S'||S[y][x]=='G'){\n\t\t\t\trep(j,2){\n\t\t\t\t\tif(dist[y][x][j]+1 < dist[yy][xx][j]){\n\t\t\t\t\t\tdist[yy][xx][j]=dist[y][x][j]+1;\n\t\t\t\t\t\tQ.push({yy,xx});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif(S[y][x]!=goc[i]){\n\t\t\t\tif(dist[y][x][0]+1 < dist[yy][xx][1]){\n\t\t\t\t\tdist[yy][xx][1]=dist[y][x][0]+1;\n\t\t\t\t\tQ.push({yy,xx});\n\t\t\t\t}\n\t\t\t}else{\n\t\t\t\trep(k,2){\n\t\t\t\t\tif(dist[y][x][k]+1 < dist[yy][xx][k]){\n\t\t\t\t\t\tdist[yy][xx][k]=dist[y][x][k]+1;\n\t\t\t\t\t\tQ.push({yy,xx});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\n\t\t\t\n\t\t}\n\t}\n\tll ans=min(dist[goal.first][goal.second][0],dist[goal.first][goal.second][1]);\n\tif(ans==1e9)ans=-1;\n\tcout << ans << \"\\n\";\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 8520, "score_of_the_acc": -0.4958, "final_rank": 12 }, { "submission_id": "aoj_0486_10238516", "code_snippet": "#include <iostream>\n#include <vector>\n#include <queue>\n\nusing namespace std;\n\nstruct cell {\n\tint x = -1, y = -1, dist = 0;\n\tbool f = false;\n};\nint h, w;\nvector<vector<vector<bool>>> used;\nvector<vector<char>> d;\n\nbool check(int x, int y, bool f) {\n\treturn x >= 0 && y >= 0 && x < h && y < w && !used[x][y][f] && d[x][y] != '#';\n}\n\nint main() {\n\tqueue<cell> q;\n\tcin >> h >> w;\n\td.resize(h, vector<char>(w));\n\tused.resize(h, vector<vector<bool>>(w, vector<bool>(2, 0)));\n\tconst vector<int> dx = { -1, 1, 0, 0 }, dy = { 0, 0, -1, 1 };\n\tfor (int i = 0; i < h; ++i) {\n\t\tfor (int j = 0; j < w; ++j) {\n\t\t\tcin >> d[i][j];\n\t\t\tif (d[i][j] == 'S') {\n\t\t\t\tq.push({ i, j, 0, 0 });\n\t\t\t\tused[i][j] = { 1, 1 };\n\t\t\t}\n\t\t}\n\t}\n\twhile (!q.empty()) {\n\t\tcell u = q.front();\n\t\tq.pop();\n\t\tif (d[u.x][u.y] == 'G') {\n\t\t\tcout << u.dist << '\\n';\n\t\t\treturn 0;\n\t\t}\n\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\tif (check(u.x + dx[i], u.y + dy[i], u.f)) {\n\t\t\t\tif (d[u.x][u.y] == '.' || d[u.x][u.y] == 'S'){\n\t\t\t\t\tq.push({ u.x + dx[i], u.y + dy[i], u.dist + 1, u.f });\n\t\t\t\t\tused[u.x + dx[i]][u.y + dy[i]][u.f] = 1;\n\t\t\t\t}\n\t\t\t\telse if (d[u.x][u.y] == 'U') {\n\t\t\t\t\tif (dx[i] == -1) {\n\t\t\t\t\t\tq.push({ u.x + dx[i], u.y + dy[i], u.dist + 1, u.f });\n\t\t\t\t\t\tused[u.x + dx[i]][u.y + dy[i]][u.f] = 1;\n\t\t\t\t\t}\n\t\t\t\t\telse if (u.f == 0) {\n\t\t\t\t\t\tq.push({ u.x + dx[i], u.y + dy[i], u.dist + 1, !u.f });\n\t\t\t\t\t\tused[u.x + dx[i]][u.y + dy[i]][!u.f] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if (d[u.x][u.y] == 'D') {\n\t\t\t\t\tif (dx[i] == 1) {\n\t\t\t\t\t\tq.push({ u.x + dx[i], u.y + dy[i], u.dist + 1, u.f });\n\t\t\t\t\t\tused[u.x + dx[i]][u.y + dy[i]][u.f] = 1;\n\t\t\t\t\t}\n\t\t\t\t\telse if (u.f == 0) {\n\t\t\t\t\t\tq.push({ u.x + dx[i], u.y + dy[i], u.dist + 1, !u.f });\n\t\t\t\t\t\tused[u.x + dx[i]][u.y + dy[i]][!u.f] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if (d[u.x][u.y] == 'L') {\n\t\t\t\t\tif (dy[i] == -1) {\n\t\t\t\t\t\tq.push({ u.x + dx[i], u.y + dy[i], u.dist + 1, u.f });\n\t\t\t\t\t\tused[u.x + dx[i]][u.y + dy[i]][u.f] = 1;\n\t\t\t\t\t}\n\t\t\t\t\telse if (u.f == 0) {\n\t\t\t\t\t\tq.push({ u.x + dx[i], u.y + dy[i], u.dist + 1, !u.f });\n\t\t\t\t\t\tused[u.x + dx[i]][u.y + dy[i]][!u.f] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tif (dy[i] == 1) {\n\t\t\t\t\t\tq.push({ u.x + dx[i], u.y + dy[i], u.dist + 1, u.f });\n\t\t\t\t\t\tused[u.x + dx[i]][u.y + dy[i]][u.f] = 1;\n\t\t\t\t\t}\n\t\t\t\t\telse if (u.f == 0) {\n\t\t\t\t\t\tq.push({ u.x + dx[i], u.y + dy[i], u.dist + 1, !u.f });\n\t\t\t\t\t\tused[u.x + dx[i]][u.y + dy[i]][!u.f] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout << -1 << '\\n';\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 9928, "score_of_the_acc": -0.6308, "final_rank": 16 }, { "submission_id": "aoj_0486_10238514", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nstruct cell {\n\tint x = -1, y = -1, dist = 0;\n\tbool f = false;\n};\n\n\ncell make_cell(int xn, int yn, int distn, bool fn){\n cell u;\n u.x = xn;\n u.y = yn;\n u.dist = distn;\n u.f = fn;\n return u;\n}\n\nint h, w;\nvector<vector<vector<bool>>> used;\nvector<vector<char>> d;\n\nbool check(int x, int y, bool f) {\n\treturn x >= 0 && y >= 0 && x < h && y < w && !used[x][y][f] && d[x][y] != '#';\n}\n\nint main() {\n\tqueue<cell> q;\n\tcin >> h >> w;\n\td.resize(h, vector<char>(w));\n\tused.resize(h, vector<vector<bool>>(w, vector<bool>(2, 0)));\n\tconst vector<int> dx = { -1, 1, 0, 0 }, dy = { 0, 0, -1, 1 };\n\tfor (int i = 0; i < h; ++i) {\n\t\tfor (int j = 0; j < w; ++j) {\n\t\t\tcin >> d[i][j];\n\t\t\tif (d[i][j] == 'S') {\n\t\t\t\tq.push(make_cell( i, j, 0, false ));\n\t\t\t\tused[i][j] = { 1, 1 };\n\t\t\t}\n\t\t}\n\t}\n\twhile (!q.empty()) {\n\t\tcell u = q.front();\n\t\tq.pop();\n\t\tif (d[u.x][u.y] == 'G') {\n\t\t\tcout << u.dist << '\\n';\n\t\t\treturn 0;\n\t\t}\n\t\tfor (int i = 0; i < 4; ++i) {\n\t\t\tif (check(u.x + dx[i], u.y + dy[i], u.f)) {\n\t\t\t\tif (d[u.x][u.y] == '.' || d[u.x][u.y] == 'S'){\n\t\t\t\t\tq.push(make_cell( u.x + dx[i], u.y + dy[i], u.dist + 1, u.f ));\n\t\t\t\t\tused[u.x + dx[i]][u.y + dy[i]][u.f] = 1;\n\t\t\t\t}\n\t\t\t\telse if (d[u.x][u.y] == 'U') {\n\t\t\t\t\tif (dx[i] == -1) {\n\t\t\t\t\t\tq.push(make_cell( u.x + dx[i], u.y + dy[i], u.dist + 1, u.f ));\n\t\t\t\t\t\tused[u.x + dx[i]][u.y + dy[i]][u.f] = 1;\n\t\t\t\t\t}\n\t\t\t\t\telse if (u.f == 0) {\n\t\t\t\t\t\tq.push(make_cell( u.x + dx[i], u.y + dy[i], u.dist + 1, !u.f ));\n\t\t\t\t\t\tused[u.x + dx[i]][u.y + dy[i]][!u.f] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if (d[u.x][u.y] == 'D') {\n\t\t\t\t\tif (dx[i] == 1) {\n\t\t\t\t\t\tq.push(make_cell( u.x + dx[i], u.y + dy[i], u.dist + 1, u.f ));\n\t\t\t\t\t\tused[u.x + dx[i]][u.y + dy[i]][u.f] = 1;\n\t\t\t\t\t}\n\t\t\t\t\telse if (u.f == 0) {\n\t\t\t\t\t\tq.push(make_cell( u.x + dx[i], u.y + dy[i], u.dist + 1, !u.f ));\n\t\t\t\t\t\tused[u.x + dx[i]][u.y + dy[i]][!u.f] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse if (d[u.x][u.y] == 'L') {\n\t\t\t\t\tif (dy[i] == -1) {\n\t\t\t\t\t\tq.push(make_cell( u.x + dx[i], u.y + dy[i], u.dist + 1, u.f ));\n\t\t\t\t\t\tused[u.x + dx[i]][u.y + dy[i]][u.f] = 1;\n\t\t\t\t\t}\n\t\t\t\t\telse if (u.f == 0) {\n\t\t\t\t\t\tq.push(make_cell( u.x + dx[i], u.y + dy[i], u.dist + 1, !u.f ));\n\t\t\t\t\t\tused[u.x + dx[i]][u.y + dy[i]][!u.f] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tif (dy[i] == 1) {\n\t\t\t\t\t\tq.push(make_cell( u.x + dx[i], u.y + dy[i], u.dist + 1, u.f ));\n\t\t\t\t\t\tused[u.x + dx[i]][u.y + dy[i]][u.f] = 1;\n\t\t\t\t\t}\n\t\t\t\t\telse if (u.f == 0) {\n\t\t\t\t\t\tq.push(make_cell( u.x + dx[i], u.y + dy[i], u.dist + 1, !u.f ));\n\t\t\t\t\t\tused[u.x + dx[i]][u.y + dy[i]][!u.f] = 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout << -1 << '\\n';\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 9912, "score_of_the_acc": -0.6292, "final_rank": 15 }, { "submission_id": "aoj_0486_10238503", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\n#define MOD 1000000007\n#define EPS 0.000000001\n\n\n\n#define SIZE 305\n\nstruct Info{\n\tInfo(){\n\n\t\trow = col = sum_dist = 0;\n\t\tFLG = is_pre = false;\n\t}\n\tInfo(int arg_row,int arg_col,int arg_sum_dist,bool arg_FLG,bool arg_is_pre){\n\t\trow = arg_row;\n\t\tcol = arg_col;\n\t\tsum_dist = arg_sum_dist;\n\t\tFLG = arg_FLG;\n\t\tis_pre = arg_is_pre;\n\t}\n\tbool operator<(const struct Info& arg) const{\n\n\t\treturn sum_dist > arg.sum_dist; //昇順(PQ)\n\t}\n\n\tint row,col,sum_dist;\n\tbool FLG,is_pre;\n};\n\n\nint H,W;\nint d_row[4] = {-1,0,0,1},d_col[4] = {0,-1,1,0};\nint min_dist[SIZE][SIZE][2][2];\nchar buf[SIZE][SIZE];\n\nbool rangeCheck(int row,int col){\n\n\n\treturn row >= 0 && row <= H-1 && col >= 0 && col <= W-1;\n}\n\nint main(){\n\n\tscanf(\"%d %d\",&H,&W);\n\n\tint s_row,s_col,g_row,g_col;\n\n\tfor(int row = 0; row < H; row++){\n\n\t\tscanf(\"%s\",buf[row]);\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tif(buf[row][col] == 'S'){\n\n\t\t\t\ts_row = row;\n\t\t\t\ts_col = col;\n\n\t\t\t}else if(buf[row][col] == 'G'){\n\n\t\t\t\tg_row = row;\n\t\t\t\tg_col = col;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor(int row = 0; row < H; row++){\n\t\tfor(int col = 0; col < W; col++){\n\t\t\tfor(int a = 0; a < 2; a++){\n\t\t\t\tfor(int b = 0; b < 2; b++){\n\n\t\t\t\t\tmin_dist[row][col][a][b] = BIG_NUM;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tmin_dist[s_row][s_col][false][false] = 0;\n\tpriority_queue<Info> Q;\n\tQ.push(Info(s_row,s_col,0,false,false));\n\n\twhile(!Q.empty()){\n\n\t\tInfo info = Q.top();\n\t\tQ.pop();\n\n\t\tif(info.row == g_row && info.col == g_col){\n\n\t\t\tprintf(\"%d\\n\",info.sum_dist);\n\t\t\treturn 0;\n\t\t}\n\n\t\tif(info.sum_dist > min_dist[info.row][info.col][info.FLG][info.is_pre])continue;\n\n\t\tif(info.is_pre || buf[info.row][info.col] == '.' || buf[info.row][info.col] == 'S'){ //自由に動ける\n\n\t\t\tfor(int i = 0; i < 4; i++){\n\n\t\t\t\tint adj_row = info.row+d_row[i];\n\t\t\t\tint adj_col = info.col+d_col[i];\n\t\t\t\tif(!rangeCheck(adj_row,adj_col) || buf[adj_row][adj_col] == '#')continue;\n\n\t\t\t\tint next_dist = info.sum_dist+1;\n\n\t\t\t\tif(buf[adj_row][adj_col] == '.' || buf[adj_row][adj_col] == 'G' || buf[adj_row][adj_col] == 'S'){\n\n\t\t\t\t\tif(min_dist[adj_row][adj_col][info.FLG][false] > next_dist){\n\n\t\t\t\t\t\tmin_dist[adj_row][adj_col][info.FLG][false] = next_dist;\n\t\t\t\t\t\tQ.push(Info(adj_row,adj_col,next_dist,info.FLG,false));\n\t\t\t\t\t}\n\n\t\t\t\t}else{ //一方向マス\n\n\t\t\t\t\t//方向転換しない\n\t\t\t\t\tif(min_dist[adj_row][adj_col][info.FLG][false] > next_dist){\n\n\t\t\t\t\t\tmin_dist[adj_row][adj_col][info.FLG][false] = next_dist;\n\t\t\t\t\t\tQ.push(Info(adj_row,adj_col,next_dist,info.FLG,false));\n\t\t\t\t\t}\n\t\t\t\t\t//方向転換する\n\t\t\t\t\tif(!info.FLG && min_dist[adj_row][adj_col][true][true] > next_dist){\n\n\t\t\t\t\t\tmin_dist[adj_row][adj_col][true][true] = next_dist;\n\t\t\t\t\t\tQ.push(Info(adj_row,adj_col,next_dist,true,true));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t}else{\n\n\t\t\tint adj_row,adj_col;\n\t\t\tswitch(buf[info.row][info.col]){\n\t\t\tcase 'U':\n\t\t\t\tadj_row = info.row-1;\n\t\t\t\tadj_col = info.col;\n\t\t\t\tbreak;\n\t\t\tcase 'D':\n\t\t\t\tadj_row = info.row+1;\n\t\t\t\tadj_col = info.col;\n\t\t\t\tbreak;\n\t\t\tcase 'R':\n\t\t\t\tadj_row = info.row;\n\t\t\t\tadj_col = info.col+1;\n\t\t\t\tbreak;\n\t\t\tcase 'L':\n\t\t\t\tadj_row = info.row;\n\t\t\t\tadj_col = info.col-1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif(!rangeCheck(adj_row,adj_col) || buf[adj_row][adj_col] == '#')continue;\n\n\t\t\tint next_dist = info.sum_dist+1;\n\n\t\t\tif(buf[adj_row][adj_col] == '.' || buf[adj_row][adj_col] == 'G'|| buf[adj_row][adj_col] == 'S'){ //方向転換不要\n\n\t\t\t\tif(min_dist[adj_row][adj_col][info.FLG][false] > next_dist){\n\n\t\t\t\t\tmin_dist[adj_row][adj_col][info.FLG][false] = next_dist;\n\t\t\t\t\tQ.push(Info(adj_row,adj_col,next_dist,info.FLG,false));\n\t\t\t\t}\n\n\t\t\t}else{ //一方向マス\n\n\t\t\t\t//方向転換しない\n\t\t\t\tif(min_dist[adj_row][adj_col][info.FLG][false] > next_dist){\n\n\t\t\t\t\tmin_dist[adj_row][adj_col][info.FLG][false] = next_dist;\n\t\t\t\t\tQ.push(Info(adj_row,adj_col,next_dist,info.FLG,false));\n\t\t\t\t}\n\t\t\t\t//方向転換する\n\t\t\t\tif(!info.FLG && min_dist[adj_row][adj_col][true][true] > next_dist){\n\n\t\t\t\t\tmin_dist[adj_row][adj_col][true][true] = next_dist;\n\t\t\t\t\tQ.push(Info(adj_row,adj_col,next_dist,true,true));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"-1\\n\");\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5028, "score_of_the_acc": -0.161, "final_rank": 5 }, { "submission_id": "aoj_0486_9644028", "code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\n#define int long long\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define ll long long\nint h, w;\nvector<vector<int>> cost(vector<vector<char>> s, int s2, int s3, int p) {\n vector<vector<int>> seen(h + 1, vector<int>(w + 1, -1));\n seen[s2][s3] = 0;\n queue<pair<int, int>> que;\n vector<int> x = {0, 0, 1, -1};\n vector<int> y = {1, -1, 0, 0};\n que.push({s2, s3});\n while (!que.empty()) {\n int posx = que.front().first;\n int posy = que.front().second;\n que.pop();\n rep(t, 4) {\n int i = posx + x[t];\n int j = posy + y[t];\n if (p == 0) {\n if (s[posx][posy] == 'U') {\n i = posx - 1;\n j = posy;\n }\n if (s[posx][posy] == 'D') {\n i = posx + 1;\n j = posy;\n }\n if (s[posx][posy] == 'L') {\n i = posx;\n j = posy - 1;\n }\n if (s[posx][posy] == 'R') {\n i = posx;\n j = posy + 1;\n }\n }\n if (i < 0 || i >= h)\n continue;\n if (j < 0 || j >= w)\n continue;\n if (p == 1) {\n if (s[i][j] == 'U') {\n if (!(posx - i == 1 && posy - j == 0))\n continue;\n }\n if (s[i][j] == 'D') {\n if (!(posx - i == -1 && posy - j == 0))\n continue;\n }\n if (s[i][j] == 'L') {\n if (!(posx - i == 0 && posy - j == 1))\n continue;\n }\n if (s[i][j] == 'R') {\n if (!(posx - i == 0 && posy - j == -1))\n continue;\n }\n }\n if (s[i][j] == '#')\n continue;\n if (seen[i][j] != -1) {\n continue;\n }\n\n seen[i][j] = seen[posx][posy] + 1;\n que.push({i, j});\n }\n }\n return seen;\n}\nsigned main() {\n int s2, s3;\n int g1, g2;\n cin >> h >> w;\n vector<vector<char>> s(h + 1, vector<char>(w + 1));\n vector<vector<char>> s1(h + 1, vector<char>(w + 1));\n\n rep(i, h) { rep(j, w) cin >> s[i][j]; }\n s1 = s;\n rep(i, h) {\n rep(j, w) {\n if (s[i][j] == 'U')\n s1[i][j] = 'D';\n if (s[i][j] == 'D')\n s1[i][j] = 'U';\n if (s[i][j] == 'R')\n s1[i][j] = 'L';\n if (s[i][j] == 'L')\n s1[i][j] = 'R';\n if (s[i][j] == 'S') {\n s2 = i;\n s3 = j;\n }\n if (s[i][j] == 'G') {\n g1 = i;\n g2 = j;\n }\n }\n }\n vector<vector<int>> k = cost(s, s2, s3, 0);\n\n vector<vector<int>> k1 = cost(s1, g1, g2, 1);\n\n vector<int> x = {0, 0, 1, -1};\n vector<int> y = {1, -1, 0, 0};\n int ans = 9e18;\n if (k[g1][g2] != -1)\n ans = k[g1][g2];\n rep(i, h) {\n rep(j, w) {\n if (s[i][j] == 'L') {\n rep(t, 4) {\n\n int posx = i + x[t];\n int posy = j + y[t];\n if (posx < 0 || posx >= h)\n continue;\n if (posy < 0 || posy >= w)\n continue;\n if (k[i][j] == -1 || k1[posx][posy] == -1)\n continue;\n ans = min(ans, k[i][j] + k1[posx][posy] + 1);\n }\n }\n if (s[i][j] == 'R') {\n rep(t, 4) {\n\n int posx = i + x[t];\n int posy = j + y[t];\n if (posx < 0 || posx >= h)\n continue;\n if (posy < 0 || posy >= w)\n continue;\n if (k[i][j] == -1 || k1[posx][posy] == -1)\n continue;\n ans = min(ans, k[i][j] + k1[posx][posy] + 1);\n }\n }\n if (s[i][j] == 'U') {\n rep(t, 4) {\n\n int posx = i + x[t];\n int posy = j + y[t];\n if (posx < 0 || posx >= h)\n continue;\n if (posy < 0 || posy >= w)\n continue;\n if (k[i][j] == -1 || k1[posx][posy] == -1)\n continue;\n ans = min(ans, k[i][j] + k1[posx][posy] + 1);\n }\n }\n if (s[i][j] == 'D') {\n rep(t, 4) {\n\n int posx = i + x[t];\n int posy = j + y[t];\n if (posx < 0 || posx >= h)\n continue;\n if (posy < 0 || posy >= w)\n continue;\n if (k[i][j] == -1 || k1[posx][posy] == -1)\n continue;\n ans = min(ans, k[i][j] + k1[posx][posy] + 1);\n }\n }\n }\n }\n if (ans == 9e18)\n cout << -1 << endl;\n else\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5112, "score_of_the_acc": -0.1691, "final_rank": 6 }, { "submission_id": "aoj_0486_9643955", "code_snippet": "// author: Kurose Yuichiro\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nconst int INF = 1001001001;\nconst int dy[4] = {0, -1, 0, 1};\nconst int dx[4] = {1, 0, -1, 0};\n\nint H, W;\nchar s[309][309];\nint sy, sx, gy, gx;\nint dist[309][309][2];\nqueue<vector<int>> Q;\nint ans;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cin >> H >> W;\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n cin >> s[i][j];\n if (s[i][j] == 'S') {\n sy = i;\n sx = j;\n }\n if (s[i][j] == 'G') {\n gy = i;\n gx = j;\n }\n }\n }\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n for (int k = 0; k < 2; k++) {\n dist[i][j][k] = INF;\n }\n }\n }\n Q.push({sy, sx, 0});\n dist[sy][sx][0] = 0;\n while (!Q.empty()) {\n auto front = Q.front();\n int y = front[0];\n int x = front[1];\n int k = front[2];\n Q.pop();\n for (int dir = 0; dir < 4; dir++) {\n int ny = y + dy[dir];\n int nx = x + dx[dir];\n if (ny < 0 || ny >= H || nx < 0 || nx >= W) continue;\n if (s[ny][nx] == '#') continue;\n char c;\n switch (dir) {\n case 0: c = 'R'; break;\n case 1: c = 'U'; break;\n case 2: c = 'L'; break;\n case 3: c = 'D'; break;\n default: break;\n }\n if (s[y][x] == '.' || s[y][x] == c || s[y][x] == 'S' || s[y][x] == 'G') {\n if (dist[ny][nx][k] != INF) continue;\n Q.push({ny, nx, k});\n dist[ny][nx][k] = dist[y][x][k] + 1;\n }\n else if (k == 0) {\n if (dist[ny][nx][k + 1] != INF) continue;\n Q.push({ny, nx, k + 1});\n dist[ny][nx][k + 1] = dist[y][x][k] + 1;\n }\n }\n }\n ans = min(dist[gy][gx][0], dist[gy][gx][1]);\n if (ans == INF) ans = -1;\n cout << ans << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4256, "score_of_the_acc": -0.087, "final_rank": 1 }, { "submission_id": "aoj_0486_9643754", "code_snippet": "// author: Kurose Yuichiro\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nconst int INF = 1001001001;\nconst int dy[4] = {0, -1, 0, 1};\nconst int dx[4] = {1, 0, -1, 0};\n\nint H, W;\nchar s[309][309];\nint sy, sx, gy, gx;\nint dist[309][309][2];\nqueue<vector<int>> Q;\nint ans;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cin >> H >> W;\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n cin >> s[i][j];\n if (s[i][j] == 'S') {\n sy = i;\n sx = j;\n }\n if (s[i][j] == 'G') {\n gy = i;\n gx = j;\n }\n }\n }\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n for (int k = 0; k < 2; k++) {\n dist[i][j][k] = INF;\n }\n }\n }\n Q.push({sy, sx, 0});\n dist[sy][sx][0] = 0;\n while (!Q.empty()) {\n auto front = Q.front();\n int y = front[0];\n int x = front[1];\n int k = front[2];\n Q.pop();\n for (int dir = 0; dir < 4; dir++) {\n int ny = y + dy[dir];\n int nx = x + dx[dir];\n if (ny < 0 || ny >= H || nx < 0 || nx >= W) continue;\n if (s[ny][nx] == '#') continue;\n char c;\n switch (dir) {\n case 0: c = 'R'; break;\n case 1: c = 'U'; break;\n case 2: c = 'L'; break;\n case 3: c = 'D'; break;\n default: break;\n }\n if (k == 0) {\n if (s[y][x] == '.' || s[y][x] == c || s[y][x] == 'S' || s[y][x] == 'G') {\n if (dist[ny][nx][0] != INF) continue;\n Q.push({ny, nx, 0});\n dist[ny][nx][0] = dist[y][x][0] + 1;\n }\n else {\n if (dist[ny][nx][1] != INF) continue;\n Q.push({ny, nx, 1});\n dist[ny][nx][1] = dist[y][x][0] + 1;\n }\n }\n else {\n if (s[y][x] == '.' || s[y][x] == c || s[y][x] == 'S' || s[y][x] == 'G') {\n if (dist[ny][nx][1] != INF) continue;\n Q.push({ny, nx, 1});\n dist[ny][nx][1] = dist[y][x][1] + 1;\n }\n }\n }\n }\n ans = min(dist[gy][gx][0], dist[gy][gx][1]);\n if (ans == INF) ans = -1;\n cout << ans << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4320, "score_of_the_acc": -0.0932, "final_rank": 3 }, { "submission_id": "aoj_0486_9641553", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n\tint h,w;\n\tcin >> h >> w;\n\tvector<vector<char>> s(h,vector<char>(w));\n\tpair<pair<int,int>,pair<int,int>> P;\n\tfor(int i = 0;i < h;i++){\n\t\tstring S;\n\t\tcin >> S;\n\t\tfor(int j = 0;j < w;j++){\n\t\t\ts[i][j] = S[j];\n\t\t\tif(s[i][j] == 'S'){\n\t\t\t\tP.first = {i,j};\n\t\t\t}\n\t\t\tif(s[i][j] == 'G'){\n\t\t\t\tP.second = {i,j};\n\t\t\t}\n\t\t}\n\t}\n\tvector<vector<vector<int>>> t(h,vector<vector<int>>(w,vector<int>(2,INT_MAX)));\n\tt[P.first.first][P.first.second][0] = 0;\n\tvector<int> dx = {-1,0,1,0};\n\tvector<int> dy = {0,-1,0,1};\n\tqueue<pair<pair<int,int>,int>> q;\n\tq.push({P.first,0});\n\twhile(!q.empty()){\n\t\tpair<pair<int,int>,int> it = q.front();\n\t\tq.pop();\n\t\tfor(int i = 0;i < 4;i++){\n\t\t\tpair<int,int> nex = {it.first.first + dy[i],it.first.second + dx[i]};\n\t\t\tif(nex.first < 0 || nex.first >= h || nex.second < 0 || nex.second >= w) continue;\n\t\t\tif(s[nex.first][nex.second] == '#') continue;\n\t\t\tint p = it.second;\n\t\t\tif(s[it.first.first][it.first.second] == 'L' && i != 0){\n\t\t\t\tp++;\n\t\t\t}\n\t\t\tif(s[it.first.first][it.first.second] == 'U' && i != 1){\n\t\t\t\tp++;\n\t\t\t}\n\t\t\tif(s[it.first.first][it.first.second] == 'R' && i != 2){\n\t\t\t\tp++;\n\t\t\t}\n\t\t\tif(s[it.first.first][it.first.second] == 'D' && i != 3){\n\t\t\t\tp++;\n\t\t\t}\n\t\t\tif(p >= 2) continue;\n\t\t\tif(t[nex.first][nex.second][p] != INT_MAX) continue;\n\t\t\tt[nex.first][nex.second][p] = t[it.first.first][it.first.second][it.second] + 1;\n\t\t\tq.push({nex,p});\n\t\t}\n\t}\n\tint ans = min(t[P.second.first][P.second.second][0],t[P.second.first][P.second.second][1]);\n\tif(ans == INT_MAX){\n\t\tcout << -1 << endl;\n\t}else{\n\t\tcout << ans << endl;\n\t}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 8344, "score_of_the_acc": -0.4789, "final_rank": 10 }, { "submission_id": "aoj_0486_9634642", "code_snippet": "#include <bits/stdc++.h>\n#define asb(a,b) ((a)-(b)>0?(a)-(b):(b)-(a))\n#define atio(v,n) for(int g=0;g<(n);++g)cin >> v[g]\n#define atdp(v,en) {int bbbbbb=0;for(auto o:v){if(bbbbbb)cout << en;bbbbbb=1;cout << o;}cout << endl;}\n#define atfs(a) printf(\"%lld %lld\\n\",(a).first,(a).second)\n#define ri(n) rp(i,n)\n#define rj(n) rp(j,n)\n#define rk(n) rp(k,n)\n#define rl(n) rp(l,n)\n#define rp(e,c) for(int e=0;e<(c);++e)\n#define rix(s,h) rpx(i,s,h)\n#define rjx(s,h) rpx(j,s,h)\n#define rkx(s,h) rpx(k,s,h)\n#define rlx(s,h) rpx(l,s,h)\n#define rpx(e,s,h) for(int e=s;e<(h);++e)\n#define ci(d,r) ((d)/(r)+(((d)%(r))!=0))\n#define pn {pr(\"No\");return 0;}\n#define py {pr(\"Yes\");return 0;}\n#define pr(a) cout << a << endl\n#define bgen(a) a.begin(),a.end()\n#define INF 114514810\n#define asr(q,n) (0<=(q) && (q)<(n))\nusing namespace std;\nusing ll=long long;\nusing vi=vector<int>;\nusing vll=vector<ll>;\nusing pii=pair<int,int>;\nusing pll=pair<ll,ll>;\nusing si=set<int>;\nusing sll=set<ll>;\nusing qi=queue<int>;\nusing qll=queue<ll>;\nusing qpii=queue<pii>;\nusing qpll=queue<pll>;\nusing vst=vector<string>;\nusing vsi=vector<si>;\nusing vvi=vector<vi>;\nusing vvl=vector<vll>;\nusing tiii=tuple<int,int,int>;\nusing tiiii=tuple<int,int,int,int>;\nusing tlll=tuple<ll,ll,ll>;\nusing mii=map<int,int>;\nusing mll=map<ll,ll>;\nusing stki=stack<int>;\nusing stkll=stack<ll>;\nint dx[4]={1,0,-1,0};\nint dy[4]={0,-1,0,1};\nint main(){\n // オーバーフロー気をつけろ\n int h,w;\n cin >> h >> w;\n vst s(h);\n atio(s,h);\n int y1,x1,y2,x2;\n ri(h)rj(w){\n if(s[i][j]=='S'){\n y1=i,x1=j;\n s[i][j]='.';\n }else if(s[i][j]=='G'){\n y2=i,x2=j;\n s[i][j]='.';\n }\n }\n char cv[128];\n cv['R']=0;\n cv['U']=1;\n cv['L']=2;\n cv['D']=3;\n vector<vector<vi>> bcost(h,vector<vi>(w,vi(2,INF)));\n priority_queue<tiiii,vector<tiiii>,greater<tiiii>> dij;\n bcost[y1][x1][0]=0;\n bcost[y1][x1][1]=0;\n dij.push(tiiii(0,y1,x1,0));\n while(dij.size()){\n tiiii tmp=dij.top();\n int ccost=get<0>(tmp);\n int y=get<1>(tmp);\n int x=get<2>(tmp);\n int k=get<3>(tmp);\n dij.pop();\n if(bcost[y][x][k]<ccost)continue;\n int ncost=ccost+1;\n if(s[y][x]=='.'){\n ri(4){\n int ty=y+dy[i];\n int tx=x+dx[i];\n if(asr(ty,h)&&asr(tx,w)){\n if(bcost[ty][tx][k]>ncost){\n bcost[ty][tx][k]=ncost;\n dij.push(tiiii(ncost,ty,tx,k));\n }\n }\n }\n }else if(s[y][x]!='#'){\n int cd=cv[s[y][x]];\n ri(4){\n int nk=k;\n if(cd!=i){\n if(k)continue;\n nk=1;\n }\n int ty=y+dy[i];\n int tx=x+dx[i];\n if(asr(ty,h)&&asr(tx,w)){\n if(bcost[ty][tx][nk]>ncost){\n bcost[ty][tx][nk]=ncost;\n dij.push(tiiii(ncost,ty,tx,nk));\n }\n }\n }\n }\n }\n int ans=min(bcost[y2][x2][0],bcost[y2][x2][1]);\n if(ans==INF)ans=-1;\n pr(ans);\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 8088, "score_of_the_acc": -0.5655, "final_rank": 14 }, { "submission_id": "aoj_0486_9631543", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define MAX 1000000007\n\nvector<vector<int>> dir = {\n {0,1},\n {0,-1},\n {1,0},\n {-1,0}\n};\n\nint main(void){\n int h,w;\n cin >> h >> w;\n vector<vector<char> > m(h+2,vector<char>(w+2,'#'));\n vector<vector<vector<int> > > bfs(2,vector<vector<int> >(h+2,vector<int>(w+2,-1)));\n queue<vector<int> > q;\n \n int ansx,ansy;\n \n rep(i,h){\n rep(j,w){\n char c;\n cin >> c;\n m[i+1][j+1] = c;\n if(c == 'S'){ q.push({i+1,j+1,0}); bfs[0][i+1][j+1] = 0;}\n if(c == 'G'){ ansx = i+1; ansy = j+1; }\n }\n }\n \n while(!q.empty()){\n vector<int> x = q.front();\n q.pop();\n \n rep(i,4){\n int nx = x[0]+dir[i][0],ny = x[1]+dir[i][1];\n switch(m[x[0]][x[1]]){\n case '.':\n case 'S':\n if(m[nx][ny] != '#' && bfs[x[2]][nx][ny] == -1){\n bfs[x[2]][nx][ny] = bfs[x[2]][x[0]][x[1]] + 1;\n q.push({nx,ny,x[2]});\n }\n break;\n case 'G':\n break;\n default:\n if( (m[x[0]][x[1]] == 'D' && i == 2) || (m[x[0]][x[1]] == 'U' && i == 3) || (m[x[0]][x[1]] == 'R' && i == 0) || (m[x[0]][x[1]] == 'L' && i == 1) ){\n if(m[nx][ny] != '#' && bfs[x[2]][nx][ny] == -1){\n bfs[x[2]][nx][ny] = bfs[x[2]][x[0]][x[1]] + 1;\n q.push({nx,ny,x[2]});\n }\n }else{\n if(x[2] == 1) break;\n if(m[nx][ny] != '#' && bfs[1][nx][ny] == -1){\n bfs[1][nx][ny] = bfs[0][x[0]][x[1]] + 1;\n q.push({nx,ny,1});\n }\n }\n break;\n }\n }\n }\n \n if(bfs[0][ansx][ansy] == -1){\n if(bfs[1][ansx][ansy] == -1){\n cout << -1 << endl;\n }else{\n cout << bfs[1][ansx][ansy] << endl;\n }\n }else{\n if(bfs[1][ansx][ansy] == -1){\n cout << bfs[0][ansx][ansy] << endl;\n }else{\n cout << min(bfs[0][ansx][ansy],bfs[1][ansx][ansy]) << endl;\n }\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4420, "score_of_the_acc": -0.1028, "final_rank": 4 }, { "submission_id": "aoj_0486_9627095", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nint main(){\n int H,W;\n cin >> H >> W;\n vector<string> S(H);\n for(int i=0;i<H;i++){\n cin >> S[i];\n }\n int sx;\n int sy;\n int gx;\n int gy;\n for(int i=0;i<H;i++){\n for(int j=0;j<W;j++){\n if(S[i][j]=='S'){\n sx = j;\n sy = i;\n }else if(S[i][j]=='G'){\n gx = j;\n gy = i;\n }\n }\n }\n vector<vector<int>> sp(H,vector<int>(W,1e9));\n sp[sy][sx] = 0;\n priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> pq;\n pq.push(pair(sp[sy][sx],sy*W+sx));\n while(pq.size()>0){\n pair<int,int> p = pq.top();\n pq.pop();\n int v = p.first;\n int i = p.second/W;\n int j = p.second%W;\n if(v!=sp[i][j]) continue;\n if(S[i][j]=='U'){\n if(i>0){\n if(S[i-1][j]!='#'){\n if(sp[i-1][j]>sp[i][j]+1){\n sp[i-1][j] = sp[i][j]+1;\n pq.push(pair(sp[i-1][j],(i-1)*W+j));\n }\n }\n }\n }else if(S[i][j]=='D'){\n if(i<H-1){\n if(S[i+1][j]!='#'){\n if(sp[i+1][j]>sp[i][j]+1){\n sp[i+1][j] = sp[i][j]+1;\n pq.push(pair(sp[i+1][j],(i+1)*W+j));\n }\n }\n }\n }else if(S[i][j]=='L'){\n if(j>0){\n if(S[i][j-1]!='#'){\n if(sp[i][j-1]>sp[i][j]+1){\n sp[i][j-1] = sp[i][j]+1;\n pq.push(pair(sp[i][j-1],i*W+j-1));\n }\n }\n }\n }else if(S[i][j]=='R'){\n if(j<W-1){\n if(S[i][j+1]!='#'){\n if(sp[i][j+1]>sp[i][j]+1){\n sp[i][j+1] = sp[i][j]+1;\n pq.push(pair(sp[i][j+1],i*W+j+1));\n }\n }\n }\n }else{\n if(i>0){\n if(S[i-1][j]!='#'){\n if(sp[i-1][j]>sp[i][j]+1){\n sp[i-1][j] = sp[i][j]+1;\n pq.push(pair(sp[i-1][j],(i-1)*W+j));\n }\n }\n }\n if(i<H-1){\n if(S[i+1][j]!='#'){\n if(sp[i+1][j]>sp[i][j]+1){\n sp[i+1][j] = sp[i][j]+1;\n pq.push(pair(sp[i+1][j],(i+1)*W+j));\n }\n }\n }\n if(j>0){\n if(S[i][j-1]!='#'){\n if(sp[i][j-1]>sp[i][j]+1){\n sp[i][j-1] = sp[i][j]+1;\n pq.push(pair(sp[i][j-1],i*W+j-1));\n }\n }\n }\n if(j<W-1){\n if(S[i][j+1]!='#'){\n if(sp[i][j+1]>sp[i][j]+1){\n sp[i][j+1] = sp[i][j]+1;\n pq.push(pair(sp[i][j+1],i*W+j+1));\n }\n }\n }\n }\n }\n vector<vector<int>> gp(H,vector<int>(W,1e9));\n gp[gy][gx] = 0;\n pq.push(pair(gp[gy][gx],gy*W+gx));\n while(pq.size()>0){\n pair<int,int> p = pq.top();\n pq.pop();\n int v = p.first;\n int i = p.second/W;\n int j = p.second%W;\n if(v!=gp[i][j]) continue;\n if(i>0){\n if(S[i-1][j]=='D'||S[i-1][j]=='.'){\n if(gp[i-1][j]>v+1){\n gp[i-1][j] = v+1;\n pq.push(pair(gp[i-1][j],(i-1)*W+j));\n }\n }\n }\n if(i<H-1){\n if(S[i+1][j]=='U'||S[i+1][j]=='.'){\n if(gp[i+1][j]>v+1){\n gp[i+1][j] = v+1;\n pq.push(pair(gp[i+1][j],(i+1)*W+j));\n }\n }\n }\n if(j>0){\n if(S[i][j-1]=='R'||S[i][j-1]=='.'){\n if(gp[i][j-1]>v+1){\n gp[i][j-1] = v+1;\n pq.push(pair(gp[i][j-1],i*W+j-1));\n }\n }\n }\n if(j<W-1){\n if(S[i][j+1]=='L'||S[i][j+1]=='.'){\n if(gp[i][j+1]>v+1){\n gp[i][j+1] = v+1;\n pq.push(pair(gp[i][j+1],i*W+j+1));\n }\n }\n }\n }\n int ans = 1e9;\n for(int i=0;i<H;i++){\n for(int j=0;j<W;j++){\n if(S[i][j]=='#') continue;\n if(i>0) ans = min(ans,sp[i][j]+gp[i-1][j]+1);\n if(i<H-1) ans = min(ans,sp[i][j]+gp[i+1][j]+1);\n if(j>0) ans = min(ans,sp[i][j]+gp[i][j-1]+1);\n if(j<W-1) ans = min(ans,sp[i][j]+gp[i][j+1]+1);\n }\n }\n if(ans==1e9) cout << -1 << endl;\n else cout << ans << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4316, "score_of_the_acc": -0.0928, "final_rank": 2 }, { "submission_id": "aoj_0486_9624830", "code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<string>\n#include<set>\n#include<queue>\n#include<cassert>\nusing namespace std;\nusing ll = long long;\n#define rep(i,N) for(int i=0;i<N;i++)\nusing vi=vector<int>;\nusing vvi=vector<vi>;\nusing vvvi=vector<vvi>;\n\nstruct Node{\n int i,j,k;\n Node(){}\n Node(int i,int j,int k):i(i),j(j),k(k){}\n};\n\nint di[4]={1,0,-1,0};\nint dj[4]={0,-1,0,1};\nstring houk=\"DLUR\";\nconst int INF=2e9;\n\nint main() {\n int H,W;cin>>H>>W;\n vector<string> S(H);\n rep(i,H)cin>>S[i];\n vvvi dp(H,vvi(W,vi(2,INF)));\n queue<pair<int,Node>>q;\n Node start,goal;\n rep(i,H)rep(j,W){\n if(S[i][j]=='S')start=Node(i,j,0);\n if(S[i][j]=='G')goal=Node(i,j,0);\n }\n q.emplace(0,start);\n {\n while(!q.empty()){\n int c=q.front().first;\n int i=q.front().second.i;\n int j=q.front().second.j;\n int k=q.front().second.k;\n q.pop();\n if(c>=dp[i][j][k])continue;\n dp[i][j][k]=c;\n rep(d,4){\n int ni=i+di[d];\n int nj=j+dj[d];\n char s=S[i][j];\n if(s=='U'||s=='R'||s=='L'||s=='D'){\n if(houk[d]!=s){\n if(k==1)continue;\n if(ni<0||nj<0||ni>=H||nj>=W)continue;\n if(S[ni][nj]=='#')continue;\n Node nex=Node(ni,nj,k+1);\n if(dp[ni][nj][k+1]>c+1)q.emplace(c+1,nex);\n continue;\n }\n }\n if(ni<0||nj<0||ni>=H||nj>=W)continue;\n if(S[ni][nj]=='#')continue;\n Node nex=Node(ni,nj,k);\n if(dp[ni][nj][k]>c+1)\n q.emplace(c+1,nex);\n }\n }\n }\n int ans=dp[goal.i][goal.j][0];\n ans=min(ans,dp[goal.i][goal.j][1]);\n if(ans==INF)ans=-1;\n cout<<ans<<endl;\n return 0;\n}\n\n/*\n2 3\nSL.\n#LG\n\n3 1\nG\nD\nS\n\n3 1\nS\nU\nG\n\n1 3\nSLG\n\n1 3\nGRS\n*/", "accuracy": 1, "time_ms": 10, "memory_kb": 8468, "score_of_the_acc": -0.4908, "final_rank": 11 }, { "submission_id": "aoj_0486_9624389", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing Graph = vector<vector<int>>;\nint H, W;\nint cast(int x, int y) {\n\treturn (W * x) + y;\n}\nvoid BFS(Graph& G, vector<int>& dist, int st) {\n\tdist[st] = 0;\n\tqueue<int> que;que.push(st);\n\twhile (!que.empty()) {\n\t\tint v = que.front();que.pop();\n\t\tfor (auto nv : G[v]) {\n\t\t\tif (dist[nv] == -1) {\n\t\t\t\tdist[nv] = dist[v] + 1;\n\t\t\t\tque.push(nv);\n\t\t\t}\n\t\t}\n\t}\n}\nint main() {\n\tcin >> H >> W;\n\tGraph G(H * W);\n\tvector<string> S(H);\n\tfor (int i = 0;i < H;i++) cin >> S[i];\n\tvector<pair<int, int>> vecs = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};\n\tint st = -1;int gl = -1;\n\tfor (int i = 0;i < H;i++) for (int j = 0;j < W;j++) {\n\t\tif (S[i][j] == '#') continue;\n\t\tif (S[i][j] == 'S') {\n\t\t\tst = (W * i) + j;\n\t\t} else if (S[i][j] == 'G'){\n\t\t\tgl = (W * i) + j;\n\t\t}\n\t\tint now = (W * i) + j;\n\t\tif (S[i][j] == 'S' || S[i][j] == 'G' || S[i][j] == '.') {\n\t\t\tfor (auto vc : vecs) {\n\t\t\t\tint nx = i + vc.first;int ny = j + vc.second;\n\t\t\t\tif (nx < 0 or nx >= H) continue;\n\t\t\t\tif (ny < 0 or ny >= W) continue;\n\t\t\t\tG[now].push_back(cast(nx, ny));\t\n\t\t\t}\n\t\t\tcontinue;\n\t\t}\n\t\tint nx = i;int ny = j;\n\t\tif (S[i][j] == 'L') {\n\t\t\tny--;\n\t\t} else if (S[i][j] == 'R') {\n\t\t\tny++;\n\t\t} else if (S[i][j] == 'D') {\n\t\t\tnx++;\n\t\t} else {\n\t\t\tnx--;\n\t\t}\n\t\tif (nx < 0 or nx >= H) continue;\n\t\tif (ny < 0 or ny >= W) continue;\n\t\tG[now].push_back(cast(nx, ny));\n\t}\n\tGraph G1(H * W);\n\tfor (int v = 0;v < H * W;v++) for (auto nv : G[v]) G1[nv].push_back(v);\n\tvector<int> dist(H *W, -1), dist1(H *W, -1);\n\tBFS(G, dist, st);BFS(G1, dist1, gl);\n\tint ans = dist[gl];\n\tfor (int i = 0;i < H;i++) for (int j = 0;j < W;j++) {\n\t\tif (S[i][j] == '#') continue;\n\t\tint now = cast(i, j);\n\t\tif (S[i][j] == 'S' || S[i][j] == 'G' || S[i][j] == '.') continue;\n\t\tif (dist[now] == -1) continue;\n\t\tfor (auto vc : vecs) {\n\t\t\tint nx = i + vc.first;int ny = j + vc.second;\n\t\t\tif (nx < 0 or nx >=H) continue;\n\t\t\tif (ny < 0 or ny >= W) continue;\n\t\t\tint nv = cast(nx, ny);\n\t\t\tif (dist1[nv] == -1) continue;\n\t\t\tif (ans == -1) {\n\t\t\t\tans = dist[now] + 1 + dist1[nv];\n\t\t\t} else {\n\t\t\t\tans = min(ans, dist[now] + 1 + dist1[nv]);\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 13780, "score_of_the_acc": -1, "final_rank": 18 } ]
aoj_0487_cpp
パスワードをお忘れですか？ 二郎君は数式を用いたセキュリティシステムを開発した。システムにはa、b、c、dを変数とする数式が設定されており、それぞれに０から９までの整数を入力すると計算が行われる。その計算結果が正の整数$N$と一致したとき、ロックが解除される。ロックを解除できる４つの整数をa,b,c,dの順に並べた４桁の数字の列がパスワードになる。 二郎君はこのシステムで彼が使っているパスワードを忘れてしまった。幸い、二郎君はシステムに設定されている数式と、$N$の値は覚えていたので、それを使ってパスワードを特定しようと考えた。 システムに設定されている数式と正の整数Nが与えられたとき、パスワードの候補の数を求めるプログラムを作成せよ。 入力 入力は以下の形式で与えられる。 $S$ $N$ １行目にシステムに設定されている数式を表す文字列$S$が与えられる。２行目に、整数$N$($1 \leq N \leq 10,000,000,000,000,000 = 10^{16}$)が与えられる。 $S$は算術式を表す文字列であり、以下の要素から構成される。 加減乗算（それぞれ +, -, *）。 カッコ「(」または「)」。 0から10,000までの整数。 変数a,b,c,d。 変数の連結。 変数が連続して与えられた場合は変数の連結を表し、それらの変数の値を並べてできる一つの数とみなす。たとえば、a=0、b=1、c=2なら、abcは一つの整数12を表す。 また、$S$は以下の条件を満たす。 符号を反転する記号として演算子-が使われることはない。 乗算を表すときに演算子*が省略されることはない。 Sの長さは200以下である。 乗算演算子*は２回までしか現れない。 変数が連続するのは４つまでである（たとえば、abcda, aaabb, aaaaaaのようなものは与えられない）。 空白文字は含まれない。 変数の連結を除いて、通常の数式である。 出力 パスワードの候補の数を１行目に出力する。パスワードがひとつに特定できる場合は、それを２行目に出力する。 入出力例 入力例１ a+b+c+d 36 出力例１ 1 9999 入力例２ a+b+c+d 5 出力例２ 56 式a+b+c+dが5になるのはa=b=c=0,d=5のときだが、他にもa=b=c=1,d=2などでも5になるので、合計で56通りの候補が存在する。 入力例３ b+c+d 27 出力例３ 10 式b+c+dが27になるのはb=c=d=9のときだが、aの選び方は任意なので10通りの候補が存在する。 入力例４ abcd+abcd 1024 出力例４ 1 0512 式abcd+abcdが1024になるのはa=0,b=5,c=1,d=2のときだけなので、候補は１つだけであり、0512が唯一のパスワードである。
[ { "submission_id": "aoj_0487_10876904", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\n\nsigned main(){\n string s,t=\"+-*()\"; int m; cin >> s >> m; int n = s.size();\n sort(t.begin(),t.end());\n vector<string> S; stack<char> O;\n auto popop = [&](string u){\n sort(u.begin(),u.end());\n while(!O.empty()&&binary_search(u.begin(),u.end(),O.top())) S.emplace_back(1,O.top()),O.pop();\n };\n for (int i(0);i < n;){\n if (binary_search(t.begin(),t.end(),s[i])){\n char c = s[i++];\n if (c=='+'||c=='-') popop(\"+-*\"),O.emplace(c);\n if (c=='*') popop(\"*\"),O.emplace(c);\n if (c=='(') O.emplace(c);\n if (c==')') popop(\"+-*\"),O.pop();\n } else {\n string r;\n for (;i < n&&!binary_search(t.begin(),t.end(),s[i]);++i) r += s[i];\n S.emplace_back(r);\n }\n }\n popop(\"+-*\");\n stack<int> T; vector<string> R; int p;\n for (int a(0);a < 10;++a) for (int b(0);b < 10;++b) for (int c(0);c < 10;++c) for (int d(0);d < 10;++d){\n while(!T.empty()) T.pop();\n for (auto A:S){\n if (A==\"+\") p = T.top(),T.pop(),T.top() += p;\n else if (A==\"-\") p = T.top(),T.pop(),T.top() -= p;\n else if (A==\"*\") p = T.top(),T.pop(),T.top() *= p;\n else {\n while(find(A.begin(),A.end(),'a')!=A.end()) A[find(A.begin(),A.end(),'a')-A.begin()] = '0'+a;\n while(find(A.begin(),A.end(),'b')!=A.end()) A[find(A.begin(),A.end(),'b')-A.begin()] = '0'+b;\n while(find(A.begin(),A.end(),'c')!=A.end()) A[find(A.begin(),A.end(),'c')-A.begin()] = '0'+c;\n while(find(A.begin(),A.end(),'d')!=A.end()) A[find(A.begin(),A.end(),'d')-A.begin()] = '0'+d;\n T.emplace(stoi(A));\n }\n }\n if (T.top()==m) R.emplace_back(string({'0'+a,'0'+b,'0'+c,'0'+d}));\n }\n cout << R.size() << endl;\n if (R.size()==1) cout << R[0] << endl;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 3740, "score_of_the_acc": -0.6992, "final_rank": 12 }, { "submission_id": "aoj_0487_10874894", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr int BIG_INT = 1'000'000'100;\nconstexpr long BIG_LONG = 1'000'000'000'000'000'100;\n\nstruct calc {\n // num#+-*join\n string type;\n calc *left;\n calc *right;\n char val;\n int value = 0;\n};\n\nstruct tmp {\n string s;\n int now;\n};\ncalc *par(tmp &a);\ncalc *num(tmp &a) {\n if ('(' == a.s[a.now]) {\n a.now++;\n calc *ret = par(a);\n a.now++;\n return ret;\n } else if ('a' <= a.s[a.now] && a.s[a.now] <= 'd') {\n calc *ret = new calc{\"#\", nullptr, nullptr, a.s[a.now]};\n a.now++;\n return ret;\n } else {\n int num = 0;\n while ('0' <= a.s[a.now] && a.s[a.now] <= '9') {\n num *= 10;\n num += a.s[a.now] - '0';\n a.now++;\n }\n calc *ret = new calc{\"num\", nullptr, nullptr, '\\n', num};\n return ret;\n }\n}\ncalc *join(tmp &a) {\n calc *ret = num(a);\n while (a.now < a.s.size()) {\n if (a.s[a.now] >= 'a' && a.s[a.now] <= 'd') {\n ret = new calc{\"join\", ret, num(a), '\\0'};\n } else {\n break;\n }\n }\n return ret;\n}\ncalc *mult(tmp &a) {\n calc *ret = join(a);\n while (a.now < a.s.size()) {\n if (a.s[a.now] == '*') {\n a.now++;\n ret = new calc{\"*\", ret, join(a), '\\0'};\n } else {\n break;\n }\n }\n return ret;\n}\ncalc *par(tmp &a) {\n calc *ret = mult(a);\n while (a.now < a.s.size()) {\n if (a.s[a.now] == '+') {\n a.now++;\n ret = new calc{\"+\", ret, mult(a), '\\0'};\n } else if (a.s[a.now] == '-') {\n a.now++;\n ret = new calc{\"-\", ret, mult(a), '\\0'};\n } else {\n break;\n }\n }\n return ret;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n string s;\n cin >> s;\n long n;\n cin >> n;\n tmp t = tmp{s, 0};\n calc *expr = par(t);\n\n long a, b, c, d;\n auto dfs = [&](auto self, calc *e) -> long {\n if (e->type == \"+\") {\n return self(self, e->left) + self(self, e->right);\n } else if (e->type == \"-\") {\n return self(self, e->left) - self(self, e->right);\n } else if (e->type == \"*\") {\n return self(self, e->left) * self(self, e->right);\n } else if (e->type == \"join\") {\n return self(self, e->left) * 10 + self(self, e->right);\n } else if (e->type == \"#\") {\n if (e->val == 'a') {\n return a;\n }\n if (e->val == 'b') {\n return b;\n }\n if (e->val == 'c') {\n return c;\n }\n if (e->val == 'd') {\n return d;\n }\n cout << \"ERR\" << endl;\n return -1;\n } else if (e->type == \"num\") {\n return e->value;\n } else {\n cout << \"ERR\" << endl;\n return -1;\n }\n };\n\n int ans = 0;\n vector<long> pr;\n for (a = 0; a <= 9; a++) {\n for (b = 0; b <= 9; b++) {\n for (c = 0; c <= 9; c++) {\n for (d = 0; d <= 9; d++) {\n if (dfs(dfs, expr) == n) {\n ans++;\n pr = {a, b, c, d};\n }\n }\n }\n }\n }\n if (ans == 1) {\n cout << 1 << endl;\n for (auto i : pr) cout << i;\n cout << endl;\n } else {\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 3444, "score_of_the_acc": -0.4615, "final_rank": 10 }, { "submission_id": "aoj_0487_10872876", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nlong long power(int x, int n){\n long long res = 1;\n for(int i = 0; i < n; i++) res *= x;\n return res;\n}\n\nint pow_10[6] = {1, 10, 100, 1000, 10000, 100000};\n\nint main(){\n string s;\n cin >> s;\n long long n;\n cin >> n;\n \n auto f = [&](auto self, string s)->pair<vector<array<long long, 5>>, vector<array<long long, 5>>> {\n int n = s.size();\n if(n == 0) return make_pair(vector<array<long long, 5>>(), vector<array<long long, 5>>());\n if(s[0] == '(') {\n //続く1項を探す\n int cnt = 1;\n for(int i = 1; i < n; i++){\n if(s[i] == '(') cnt++;\n if(s[i] == ')') cnt--;\n if(cnt == 0 && s[i] != ')'){\n int las = i-1;\n if(s[i] == '*'){\n auto l = self(self, s.substr(1, las-1));\n auto r = self(self, s.substr(las+2));\n for(auto i : l.second) l.first.push_back(i);\n \n vector<array<long long, 5>> resl;\n for(int i = 0; i < (int)l.first.size(); i++){\n auto arr = l.first[i];\n for(auto j : r.first){\n resl.push_back({arr[0]+j[0], arr[1]+j[1], arr[2]+j[2], arr[3]+j[3], arr[4]*j[4]});\n }\n }\n return make_pair(resl, r.second);\n } else {\n auto res1 = self(self, s.substr(1, las-1));\n auto res2 = self(self, s.substr(las+1));\n for(auto i : res1.second) res1.first.push_back(i);\n if(s[i] == '-') for(auto &i : res2.first) for(auto &j : i) j = -j;\n for(auto i : res2.second) res2.first.push_back(i);\n return make_pair(res1.first, res2.first);\n }\n }\n }\n auto res = self(self, s.substr(1, n-2));\n for(auto i : res.second) res.first.push_back(i);\n return make_pair(res.first, vector<array<long long, 5>>());\n } else if(s[0] == 'a' || s[0] == 'b' || s[0] == 'c' || s[0] == 'd') {\n int las = n-1;\n for(int i = 1; i < n; i++){\n if(s[i] == '+' || s[i] == '-' || s[i] == '*'){\n las = i-1;\n break;\n }\n }\n vector<array<long long, 5>> abcdn;\n for(int i = 0; i <= las; i++){\n if(s[i] == 'a') abcdn.push_back({1, 0, 0, 0, pow_10[las-i]});\n if(s[i] == 'b') abcdn.push_back({0, 1, 0, 0, pow_10[las-i]});\n if(s[i] == 'c') abcdn.push_back({0, 0, 1, 0, pow_10[las-i]});\n if(s[i] == 'd') abcdn.push_back({0, 0, 0, 1, pow_10[las-i]});\n }\n //cout << s << '\\n';\n //for(auto i : abcdn) cout << i[0] << ' ' << i[1] << ' ' << i[2] << ' ' << i[3] << ' ' << i[4] << '\\n';\n if(las == n-1) return make_pair(abcdn, vector<array<long long, 5>>());\n \n auto r = self(self, s.substr(las+2));\n if(s[las+1] == '*'){\n vector<array<long long, 5>> resl;\n for(auto j : abcdn) for(auto i : r.first){\n resl.push_back({j[0]+i[0], j[1]+i[1], j[2]+i[2], j[3]+i[3], j[4]*i[4]});\n }\n return make_pair(resl, r.second);\n } else {\n if(s[las+1] == '-') for(auto &i : r.first) for(auto &j : i) j = -j;\n for(auto i : r.second) r.first.push_back(i);\n return make_pair(abcdn, r.first);\n }\n } else {\n int las = n-1;\n for(int i = 1; i < n; i++){\n if(s[i] < '0' || '9' < s[i]){\n las = i-1;\n break;\n }\n }\n \n array<long long, 5> abcdn = {0, 0, 0, 0, 0};\n for(int j = 0; j <= las; j++) abcdn[4] += pow(10, las-j) * (s[j] - '0');\n \n if(las == n-1) return make_pair(vector<array<long long, 5>>{abcdn}, vector<array<long long, 5>>());\n \n auto r = self(self, s.substr(las+2));\n if(s[las+1] == '*'){\n vector<array<long long, 5>> resl;\n for(auto i : r.first){\n resl.push_back({abcdn[0]+i[0], abcdn[1]+i[1], abcdn[2]+i[2], abcdn[3]+i[3], abcdn[4]*i[4]});\n }\n return make_pair(resl, r.second);\n } else {\n if(s[las+1] == '-') for(auto &i : r.first) for(auto &j : i) j = -j;\n for(auto i : r.second) r.first.push_back(i);\n return make_pair(vector<array<long long, 5>>{abcdn}, r.first);\n }\n }\n assert(false);\n };\n \n auto res = f(f, s);\n for(auto i : res.second) res.first.push_back(i);\n \n auto &siki = res.first;\n \n //for(auto i : siki) cout << i[0] << ' ' << i[1] << ' ' << i[2] << ' ' << i[3] << ' ' << i[4] << '\\n';\n \n int ans = 0;\n for(int a = 0; a <= 9; a++){\n for(int b = 0; b <= 9; b++){\n for(int c = 0; c <= 9; c++){\n for(int d = 0; d <= 9; d++){\n long long acc = 0;\n for(auto i : siki){\n acc += i[4] * power(a, i[0]) * power(b, i[1]) * power(c, i[2]) * power(d, i[3]);\n }\n if(acc == n) ans++;\n }\n }\n }\n }\n \n \n auto st = chrono::steady_clock::now();\n \n cout << ans << '\\n';\n if(ans == 1){\n while(chrono::duration_cast<chrono::milliseconds>(chrono::steady_clock::now() - st).count() < 100);\n for(int a = 0; a <= 9; a++){\n for(int b = 0; b <= 9; b++){\n for(int c = 0; c <= 9; c++){\n for(int d = 0; d <= 9; d++){\n long long acc = 0;\n for(auto i : siki){\n acc += i[4] * power(a, i[0]) * power(b, i[1]) * power(c, i[2]) * power(d, i[3]);\n }\n if(acc == n) cout << a << b << c << d << '\\n';\n }\n }\n }\n }\n }\n}", "accuracy": 0.3, "time_ms": 100, "memory_kb": 3744, "score_of_the_acc": -1.0891, "final_rank": 20 }, { "submission_id": "aoj_0487_10843553", "code_snippet": "//#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define all(a) (a).begin(), (a).end()\nusing ll = long long;\nconst ll INF32 = 2e9;\nconst ll INF64 = 4e18;\n\nvoid printYN(bool ok){\n if(ok)cout << \"Yes\" << endl;\n else cout << \"No\" << endl;\n return;\n}\n\nll calc(string S, int a, int b, int c, int d){\n vector<ll> E;\n rep(i, S.size()){\n if(S[i]=='('){\n string T;\n i++;\n while(S[i]!=')'){\n T.push_back(S[i]);\n i++;\n }\n E.push_back(calc(T,a,b,c,d));\n i++;\n }\n string U = \"\";\n while('a'<=S[i]&&S[i]<='d'){\n char ch = S[i];\n U.push_back(ch);\n i++;\n }\n rep(j, U.size()){\n if(U[j]=='a')U[j] = a+'0';\n if(U[j]=='b')U[j] = b+'0';\n if(U[j]=='c')U[j] = c+'0';\n if(U[j]=='d')U[j] = d+'0';\n }\n while('0'<=S[i]&&S[i]<='9'){\n U.push_back(S[i]);\n i++;\n }\n if(U.size()==0);\n else{\n E.push_back(stoll(U));\n }\n if(i>=S.size())break;\n if(S[i]=='+')E.push_back(INF32+(ll)'+');\n else if(S[i]=='-')E.push_back(INF32+(ll)'-');\n else if(S[i]=='*')E.push_back(INF32+(ll)'*');\n }\n\n vector<ll> T(1, INF32+'+');\n for(int j = 0; j < E.size(); j+=2){\n ll now = 0;\n now += E[j];\n while(j+2<E.size()&&E[j+1]==INF32+'*'){\n now*=E[j+2];\n j+=2;\n }\n T.push_back(now);\n if(j+1<E.size()){\n assert(E[j+1]=='+'+INF32||E[j+1]=='-'+INF32);\n T.push_back(E[j+1]);\n }\n }\n ll res = 0;\n for(int j = 0; j+1 < T.size(); j+=2){\n if(T[j]=='+'+INF32)res+=T[j+1];\n else if(T[j]=='-'+INF32)res-=T[j+1];\n }\n return res;\n}\n\nint main() {\n string S;\n ll N;\n cin >> S >> N;\n vector<ll> ans;\n rep(a, 10)rep(b, 10)rep(c, 10)rep(d, 10){\n if(N==calc(S,a,b,c,d))ans.push_back(1000*a+100*b+10*c+d);\n }\n if(ans.size()==1)printf(\"1\\n%04lld\\n\",ans[0]);\n else cout << ans.size() << endl;\n return 0;\n}", "accuracy": 0.7666666666666667, "time_ms": 10, "memory_kb": 3624, "score_of_the_acc": -0.2381, "final_rank": 16 }, { "submission_id": "aoj_0487_10834181", "code_snippet": "#include<algorithm>\n#include<iostream>\n#include<cmath>\n#include<cstdio>\n#include<iomanip>\n#include<utility>\n#include<string>\n#include<vector>\n#include<bit>\n#include<bitset>\n#include<tuple>\n#include<map>\n#include<set>\n#include<queue>\n#include<deque>\n#include<stack>\nusing namespace std;\n\nvoid fix(int x){\n cout << fixed << setprecision(x);\n}\n\nint main(){\n long int N, M, ans, a1, a2, a3, a4;\n string S;\n cin >> S >> N;\n ans = 0;\n for (long int i1 = 0; i1 < 10; i1++){\n for (long int i2 = 0; i2 < 10; i2++){\n for (long int i3 = 0; i3 < 10; i3++){\n for (long int i4 = 0; i4 < 10; i4++){\n long int A = 0;\n stack<long int> ST1;\n stack<char> ST2;\n stack<long int> ST3;\n stack<char> ST4;\n ST1.push(0);\n for (long int i = 0; i < S.size(); i++){\n if (S.at(i) == 'a'){\n long int B = ST1.top() * 10 + i1;\n ST1.pop();\n ST1.push(B);\n }\n if (S.at(i) == 'b'){\n long int B = ST1.top() * 10 + i2;\n ST1.pop();\n ST1.push(B);\n }\n if (S.at(i) == 'c'){\n long int B = ST1.top() * 10 + i3;\n ST1.pop();\n ST1.push(B);\n }\n if (S.at(i) == 'd'){\n long int B = ST1.top() * 10 + i4;\n ST1.pop();\n ST1.push(B);\n }\n if (S.at(i) == '0'){\n long int B = ST1.top() * 10 + 0;\n ST1.pop();\n ST1.push(B);\n }\n if (S.at(i) == '1'){\n long int B = ST1.top() * 10 + 1;\n ST1.pop();\n ST1.push(B);\n }\n if (S.at(i) == '2'){\n long int B = ST1.top() * 10 + 2;\n ST1.pop();\n ST1.push(B);\n }\n if (S.at(i) == '3'){\n long int B = ST1.top() * 10 + 3;\n ST1.pop();\n ST1.push(B);\n }\n if (S.at(i) == '4'){\n long int B = ST1.top() * 10 + 4;\n ST1.pop();\n ST1.push(B);\n }\n if (S.at(i) == '5'){\n long int B = ST1.top() * 10 + 5;\n ST1.pop();\n ST1.push(B);\n }\n if (S.at(i) == '6'){\n long int B = ST1.top() * 10 + 6;\n ST1.pop();\n ST1.push(B);\n }\n if (S.at(i) == '7'){\n long int B = ST1.top() * 10 + 7;\n ST1.pop();\n ST1.push(B);\n }\n if (S.at(i) == '8'){\n long int B = ST1.top() * 10 + 8;\n ST1.pop();\n ST1.push(B);\n }\n if (S.at(i) == '9'){\n long int B = ST1.top() * 10 + 9;\n ST1.pop();\n ST1.push(B);\n }\n if (S.at(i) == '+'){\n ST2.push('+');\n ST1.push(0);\n }\n if (S.at(i) == '-'){\n ST2.push('-');\n ST1.push(0);\n }\n if (S.at(i) == '*'){\n ST2.push('*');\n ST1.push(0);\n }\n if (S.at(i) == '('){\n ST2.push('(');\n }\n if (S.at(i) == ')'){\t\n while (ST2.top() != '('){\n if (ST2.top() == '+'){\n long int B = ST1.top();\n ST1.pop();\n ST3.push(B);\n ST4.push('+');\n }\n if (ST2.top() == '-'){\n long int B = ST1.top();\n ST1.pop();\n ST3.push(B);\n ST4.push('-');\n }\n if (ST2.top() == '*'){\n long int B = ST1.top();\n ST1.pop();\n long int C = ST1.top();\n ST1.pop();\n ST1.push(C * B);\n }\n ST2.pop();\n }\n ST2.pop();\n ST3.push(ST1.top());\n ST1.pop();\n while (!ST4.empty()){\n if (ST4.top() == '+'){\n long int B = ST3.top();\n ST3.pop();\n long int C = ST3.top();\n ST3.pop();\n ST3.push(C + B);\n }\n if (ST4.top() == '-'){\n long int B = ST3.top();\n ST3.pop();\n long int C = ST3.top();\n ST3.pop();\n ST3.push(B - C);\n }\n ST4.pop();\n }\n ST1.push(ST3.top());\n }\n }\n while (!ST2.empty()){\n if (ST2.top() == '+'){\n long int B = ST1.top();\n ST1.pop();\n ST3.push(B);\n ST4.push('+');\n }\n if (ST2.top() == '-'){\n long int B = ST1.top();\n ST1.pop();\n ST3.push(B);\n ST4.push('-');\n }\n if (ST2.top() == '*'){\n long int B = ST1.top();\n ST1.pop();\n long int C = ST1.top();\n ST1.pop();\n ST1.push(C * B);\n }\n ST2.pop();\n }\n ST3.push(ST1.top());\n ST1.pop();\n while (!ST4.empty()){\n if (ST4.top() == '+'){\n long int B = ST3.top();\n ST3.pop();\n long int C = ST3.top();\n ST3.pop();\n ST3.push(C + B);\n }\n if (ST4.top() == '-'){\n long int B = ST3.top();\n ST3.pop();\n long int C = ST3.top();\n ST3.pop();\n ST3.push(B - C);\n }\n ST4.pop();\n }\n ST1.push(ST3.top());\n//cout << i1 << i2 << i3 << i4 << \" \" << ST1.top() << endl;\n if (ST1.top() == N){\n ans++;\n a1 = i1;\n a2 = i2;\n a3 = i3;\n a4 = i4;\n }\n }\n }\n }\n }\n cout << ans << endl;\n if (ans == 1){\n cout << a1 << a2 << a3 << a4 << endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3584, "score_of_the_acc": -0.1852, "final_rank": 6 }, { "submission_id": "aoj_0487_10779689", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define ll long long\nconst long long mod=998244353;\nconst long long hmod=46216567629137;\nint main(){\n cin.tie(0)->sync_with_stdio(0);\n cout.tie(0);\n string S;\n cin>>S;\n ll N;\n cin>>N;\n int ans=0;\n string ans_str=\"\";\n for(int i=0;i<10000;i++){\n string s=to_string(i);\n int ss=s.size();\n rep(j,4-ss) s='0'+s;\n int d=s[3]-'0';\n int c=s[2]-'0';\n int b=s[1]-'0';\n int a=s[0]-'0';\n string now=S;\n for(int j=0;j<now.size();j++){//代入\n if(now[j]=='a') now[j]=a+'0';\n if(now[j]=='b') now[j]=b+'0';\n if(now[j]=='c') now[j]=c+'0';\n if(now[j]=='d') now[j]=d+'0';\n }\n vector<string>dat;\n int num=-1;\n for(int j=0;j<now.size();j++){//分解\n if('0'<=now[j] && now[j]<='9'){\n if(num==-1) num=now[j]-'0';\n else num=num*10+now[j]-'0';\n }\n else{\n if(num!=-1) dat.push_back(to_string(num));\n string a=\"\";\n a+=now[j];\n dat.push_back(a);\n num=-1;\n }\n }\n if(num!=-1) dat.push_back(to_string(num));\n vector<string>nex;\n while(dat.size()>=2){\n rep(j,dat.size()){\n if(dat[j]==\"+\"){\n if(j<dat.size()-2 && dat[j+2]==\"*\"){\n nex.push_back(dat[j]);\n continue;\n }\n if(nex.size()>=2 && nex[nex.size()-2]==\"*\"){\n nex.push_back(dat[j]);\n continue;\n }\n if(nex[nex.size()-1]!=\")\" && dat[j+1]!=\"(\"){\n ll a=stoll(nex[nex.size()-1])+stoll(dat[j+1]);\n nex.pop_back();\n nex.push_back(to_string(a));\n j++;\n }\n else nex.push_back(dat[j]);\n }\n else if(dat[j]==\"-\"){\n if(j<dat.size()-2 && dat[j+2]==\"*\"){\n nex.push_back(dat[j]);\n continue;\n }\n if(nex.size()>=2 && nex[nex.size()-2]==\"*\"){\n nex.push_back(dat[j]);\n continue;\n }\n if(nex[nex.size()-1]!=\")\" && dat[j+1]!=\"(\"){\n ll a=stoll(nex[nex.size()-1])-stoll(dat[j+1]);\n nex.pop_back();\n nex.push_back(to_string(a));\n j++;\n }\n else nex.push_back(dat[j]);\n }\n else if(dat[j]==\"*\"){\n if(nex[nex.size()-1]!=\")\" && dat[j+1]!=\"(\"){\n ll a=stoll(nex[nex.size()-1])*stoll(dat[j+1]);\n nex.pop_back();\n nex.push_back(to_string(a));\n j++;\n }\n else nex.push_back(dat[j]);\n }\n else{\n nex.push_back(dat[j]);\n }\n }\n dat.clear();\n rep(j,nex.size()) dat.push_back(nex[j]);\n nex.clear();\n rep(j,dat.size()){\n if(nex.size()==0 ||j==dat.size()-1){\n nex.push_back(dat[j]);\n continue;\n }\n if(nex[nex.size()-1]==\"(\" && dat[j+1]==\")\"){\n nex.pop_back();\n nex.push_back(dat[j]);\n j++;\n }\n else nex.push_back(dat[j]);\n }\n dat.clear();\n rep(j,nex.size()) dat.push_back(nex[j]);\n nex.clear();\n }\n ll cnt=stoll(dat[0]);\n if(cnt==N){\n ans++;\n ans_str=s;\n }\n }\n cout<<ans<<\"\\n\";\n if(ans==1) cout<<ans_str<<\"\\n\";\n}", "accuracy": 0.5333333333333333, "time_ms": 20, "memory_kb": 3540, "score_of_the_acc": -0.2039, "final_rank": 17 }, { "submission_id": "aoj_0487_10779632", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define ll long long\nconst long long mod=998244353;\nconst long long hmod=46216567629137;\nint main(){\n cin.tie(0)->sync_with_stdio(0);\n cout.tie(0);\n string S;\n cin>>S;\n ll N;\n cin>>N;\n int ans=0;\n string ans_str=\"\";\n for(int i=0;i<10000;i++){\n string s=to_string(i);\n int ss=s.size();\n rep(j,4-ss) s='0'+s;\n int d=s[3]-'0';\n int c=s[2]-'0';\n int b=s[1]-'0';\n int a=s[0]-'0';\n string now=S;\n for(int j=0;j<now.size();j++){\n if(now[j]=='a') now[j]=a+'0';\n if(now[j]=='b') now[j]=b+'0';\n if(now[j]=='c') now[j]=c+'0';\n if(now[j]=='d') now[j]=d+'0';\n }\n vector<string>dat;\n int num=-1;\n for(int j=0;j<now.size();j++){\n if('0'<=now[j] && now[j]<='9'){\n if(num==-1) num=now[j]-'0';\n else num=num*10+now[j]-'0';\n }\n else{\n if(num!=-1) dat.push_back(to_string(num));\n string a=\"\";\n a+=now[j];\n dat.push_back(a);\n num=-1;\n }\n }\n if(num!=-1) dat.push_back(to_string(num));\n vector<string>nex;\n rep(j,dat.size()){\n if(dat[j]==\"*\"){\n if(dat[j-1]!=\")\" && dat[j+1]!=\"(\"){\n nex.pop_back();\n nex.push_back(to_string(stoll(dat[j-1])*stoll(dat[j+1])));\n j++;\n }\n else{\n nex.push_back(dat[j]);\n }\n }\n else{\n nex.push_back(dat[j]);\n }\n }\n dat.clear();\n rep(j,nex.size()) dat.push_back(nex[j]);\n nex.clear();\n rep(j,dat.size()){\n if(dat[j]==\"+\"){\n if(dat[j-1]!=\")\" && dat[j+1]!=\"(\"){\n ll n=stoll(nex[nex.size()-1])+stoll(dat[j+1]);\n nex.pop_back();\n nex.push_back(to_string(n));\n j++;\n }\n else nex.push_back(dat[j]);\n }\n else if(dat[j]==\"-\"){\n if(dat[j-1]!=\")\" && dat[j+1]!=\"(\"){\n ll n=stoll(nex[nex.size()-1])-stoll(dat[j+1]);\n nex.pop_back();\n nex.push_back(to_string(n));\n j++;\n }\n else nex.push_back(dat[j]);\n }\n else nex.push_back(dat[j]);\n \n }\n dat.clear();\n rep(j,nex.size()) dat.push_back(nex[j]);\n nex.clear();\n rep(j,dat.size()){\n if(dat[j]!=\"(\" && dat[j]!=\")\") nex.push_back(dat[j]);\n }\n dat.clear();\n rep(j,nex.size()) dat.push_back(nex[j]);\n nex.clear();\n rep(j,dat.size()){\n if(dat[j]==\"*\"){\n ll a=stoll(nex[nex.size()-1])*stoll(dat[j+1]);\n nex.pop_back();\n nex.push_back(to_string(a));\n j++;\n }\n else nex.push_back(dat[j]);\n }\n dat.clear();\n rep(j,nex.size()) dat.push_back(nex[j]);\n nex.clear();\n rep(j,dat.size()){\n if(dat[j]==\"+\"){\n ll a=stoll(nex[nex.size()-1])+stoll(dat[j+1]);\n nex.pop_back();\n nex.push_back(to_string(a));\n j++;\n }\n else if(dat[j]==\"-\"){\n ll a=stoll(nex[nex.size()-1])-stoll(dat[j+1]);\n nex.pop_back();\n nex.push_back(to_string(a));\n j++;\n }\n else nex.push_back(dat[j]);\n }\n ll cnt=stoll(nex[0]);\n if(cnt==N){\n ans++;\n ans_str+=(a+'0');\n ans_str+=(b+'0');\n ans_str+=(c+'0');\n ans_str+=(d+'0');\n }\n }\n cout<<ans<<\"\\n\";\n if(ans==1) cout<<ans_str<<\"\\n\";\n}", "accuracy": 0.5, "time_ms": 10, "memory_kb": 3632, "score_of_the_acc": -0.2487, "final_rank": 19 }, { "submission_id": "aoj_0487_9527265", "code_snippet": "#include <bits/stdc++.h>\n\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#define REP(i, n) for (ll i = 0; i < (n); i++)\n#define REP2(i, a, b) for (ll i = (a); i < (b); i++)\nusing namespace std;\nusing ll = long long;\ntemplate <class T> using V = vector<T>;\n\n\nstring S;\nint it = 0;\nint len;\n\nV<V<V<V<ll>>>> nums(int& it);\nV<V<V<V<ll>>>> muls(int& it);\nV<V<V<V<ll>>>> adds(int& it);\nV<V<V<V<ll>>>> factors(int& it);\n\nV<V<V<V<ll>>>> nums(int& it) {\n\tV<V<V<V<ll>>>> params(8, V<V<V<ll>>>(8, V<V<ll>>(8, V<ll>(8, 0))));\n\tif ('a' <= S[it] and S[it] <= 'd') {\n\t\twhile ('a' <= S[it] and S[it] <= 'd') {\n\t\t\tparams[1][0][0][0] *= 10;\n\t\t\tparams[0][1][0][0] *= 10;\n\t\t\tparams[0][0][1][0] *= 10;\n\t\t\tparams[0][0][0][1] *= 10;\n\t\t\tif (S[it] == 'a') params[1][0][0][0] += 1;\n\t\t\tif (S[it] == 'b') params[0][1][0][0] += 1;\n\t\t\tif (S[it] == 'c') params[0][0][1][0] += 1;\n\t\t\tif (S[it] == 'd') params[0][0][0][1] += 1;\n\t\t\tit++;\n\t\t}\n\t\treturn params;\n\t} else {\n\t\tll ret{};\n\t\twhile (isdigit(S[it])) {\n\t\t\tret *= 10;\n\t\t\tret += S[it] - '0';\n\t\t\tit++;\n\t\t}\n\t\tparams[0][0][0][0] = ret;\n\t\treturn params;\n\t}\n}\n\n\nV<V<V<V<ll>>>> muls(int& it) {\n\tauto res = factors(it);\n\tfor (; it < len; ) {\n\t\tif (S[it] == '*') {\n\t\t\tauto tmp = factors(++it);\n\t\t\tauto nres = V<V<V<V<ll>>>>(8, V<V<V<ll>>>(8, V<V<ll>>(8, V<ll>(8, 0))));\n\t\t\tREP(a1, 4) REP(b1, 4) REP(c1, 4) REP(d1, 4) {\n\t\t\t\tREP(a2, 4) REP(b2, 4) REP(c2, 4) REP(d2, 4) {\n\t\t\t\t\tnres[a1 + a2][b1 + b2][c1 + c2][d1 + d2] += res[a1][b1][c1][d1] * tmp[a2][b2][c2][d2];\n\t\t\t\t}\n\t\t\t}\n\t\t\tres = nres;\n\t\t} else {\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn res;\n}\n\nV<V<V<V<ll>>>> adds(int& it) {\n\tauto res = muls(it);\n\tfor (; it < len; ) {\n\t\tif (S[it] == '+') {\n\t\t\tauto tmp = muls(++it);\n\t\t\tREP(a1, 4) REP(b1, 4) REP(c1, 4) REP(d1, 4) {\n\t\t\t\tres[a1][b1][c1][d1] += tmp[a1][b1][c1][d1];\t\t\t\t\n\t\t\t}\n\t\t} else if (S[it] == '-') {\n\t\t\tauto tmp = muls(++it);\n\t\t\tREP(a1, 4) REP(b1, 4) REP(c1, 4) REP(d1, 4) {\n\t\t\t\tres[a1][b1][c1][d1] -= tmp[a1][b1][c1][d1];\t\t\t\t\n\t\t\t}\n\t\t} else {\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn res;\n}\n\nV<V<V<V<ll>>>> factors(int& it) {\n\tif (S[it] == '(') {\n\t\tauto ret = adds(++it);\n\t\tit++;\n\t\treturn ret;\n\t} else {\n\t\treturn nums(it);\n\t}\n}\n\nint main()\n{\n\t// ios_base::sync_with_stdio(false);\n\t// cin.tie(nullptr);\n\n\tcin >> S;\n\tlen = S.length();\n\tll n; cin >> n;\n\tauto res = adds(it);\n\n\tll cnt{}, ans{};\n\tREP2(a, 0, 10) REP2(b, 0, 10) REP2(c, 0, 10) REP2(d, 0, 10) {\n\t\tll sum{};\n\t\tREP(ac, 4) REP(bc, 4) REP(cc, 4) REP(dc, 4) {\n\t\t\tll mu{1};\n\t\t\tmu *= res[ac][bc][cc][dc];\n\t\t\tif (ac > 0) mu *= pow(a, ac);\n\t\t\tif (bc > 0) mu *= pow(b, bc);\n\t\t\tif (cc > 0) mu *= pow(c, cc);\n\t\t\tif (dc > 0) mu *= pow(d, dc);\n\t\t\tsum += mu;\n\t\t}\n\t\tif (sum == n) {\n\t\t\tans = a * 1000 + b * 100 + c * 10 + d;\n\t\t\tcnt++;\n\t\t}\n\t}\n\tcout << cnt << endl;\n\tif (cnt == 1) {\n\t\tprintf(\"%04lld\\n\", ans);\n\t}\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 4192, "score_of_the_acc": -1.9125, "final_rank": 14 }, { "submission_id": "aoj_0487_9527212", "code_snippet": "#include <bits/stdc++.h>\n\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#define REP(i, n) for (int i = 0; i < (n); i++)\n#define REP2(i, a, b) for (int i = (a); i < (b); i++)\nusing namespace std;\nusing ll = long long;\ntemplate <class T> using V = vector<T>;\n\n\nstring S;\nint it = 0;\nint len;\n\nV<V<V<V<ll>>>> nums(int& it);\nV<V<V<V<ll>>>> muls(int& it);\nV<V<V<V<ll>>>> adds(int& it);\nV<V<V<V<ll>>>> factors(int& it);\n\nV<V<V<V<ll>>>> nums(int& it) {\n\t// cerr << \"nums\" << endl;\n\tV<V<V<V<ll>>>> params(8, V<V<V<ll>>>(8, V<V<ll>>(8, V<ll>(8, 0))));\n\tif ('a' <= S[it] and S[it] <= 'd') {\n\t\twhile ('a' <= S[it] and S[it] <= 'd') {\n\t\t\tparams[1][0][0][0] *= 10;\n\t\t\tparams[0][1][0][0] *= 10;\n\t\t\tparams[0][0][1][0] *= 10;\n\t\t\tparams[0][0][0][1] *= 10;\n\t\t\tif (S[it] == 'a') params[1][0][0][0] += 1;\n\t\t\tif (S[it] == 'b') params[0][1][0][0] += 1;\n\t\t\tif (S[it] == 'c') params[0][0][1][0] += 1;\n\t\t\tif (S[it] == 'd') params[0][0][0][1] += 1;\n\t\t\tit++;\n\t\t}\n\t\treturn params;\n\t} else {\n\t\tll ret{};\n\t\twhile (isdigit(S[it])) {\n\t\t\tret *= 10;\n\t\t\tret += S[it] - '0';\n\t\t\tit++;\n\t\t}\n\t\tparams[0][0][0][0] = ret;\n\t\treturn params;\n\t}\n}\n\n\nV<V<V<V<ll>>>> muls(int& it) {\n\t// cerr << \"muls\" << endl;\n\tauto res = factors(it);\n\t// cerr << res[0][0][0][0] << endl;\n\tfor (; it < len; ) {\n\t\tif (S[it] == '*') {\n\t\t\tauto tmp = factors(++it);\n\t\t\tauto nres = V<V<V<V<ll>>>>(8, V<V<V<ll>>>(8, V<V<ll>>(8, V<ll>(8, 0))));\n\t\t\tREP(a1, 4) REP(b1, 4) REP(c1, 4) REP(d1, 4) {\n\t\t\t\tREP(a2, 4) REP(b2, 4) REP(c2, 4) REP(d2, 4) {\n\t\t\t\t\tnres[a1 + a2][b1 + b2][c1 + c2][d1 + d2] += res[a1][b1][c1][d1] * tmp[a2][b2][c2][d2];\n\t\t\t\t}\n\t\t\t}\n\t\t\tres = nres;\n\t\t} else {\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn res;\n}\nV<V<V<V<ll>>>> adds(int& it) {\n\t// cerr << \"adds\" << endl;\n\tauto res = muls(it);\n\tfor (; it < len; ) {\n\t\tif (S[it] == '+') {\n\t\t\tauto tmp = muls(++it);\n\t\t\tREP(a1, 4) REP(b1, 4) REP(c1, 4) REP(d1, 4) {\n\t\t\t\tres[a1][b1][c1][d1] += tmp[a1][b1][c1][d1];\t\t\t\t\n\t\t\t}\n\t\t} else if (S[it] == '-') {\n\t\t\tauto tmp = muls(++it);\n\t\t\tREP(a1, 4) REP(b1, 4) REP(c1, 4) REP(d1, 4) {\n\t\t\t\tres[a1][b1][c1][d1] -= tmp[a1][b1][c1][d1];\t\t\t\t\n\t\t\t}\n\t\t} else {\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn res;\n}\nV<V<V<V<ll>>>> factors(int& it) {\n\t// cerr << \"factors\" << endl;\n\tif (S[it] == '(') {\n\t\tauto ret = adds(++it);\n\t\tit++;\n\t\treturn ret;\n\t} else {\n\t\treturn nums(it);\n\t}\n}\n\nint main()\n{\n\tios_base::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\n\tcin >> S;\n\tlen = S.length();\n\tll n; cin >> n;\n\tauto res = adds(it);\n\n\tll cnt{}, ans{};\n\t// REP(a1, 4) REP(b1, 4) REP(c1, 4) REP(d1, 4) cout << a1 << \" \" << b1 << \" \" << c1 << \" \" << d1 << \" \" << res[a1][b1][c1][d1] << endl;\n\tREP2(a, 0, 10) REP2(b, 0, 10) REP2(c, 0, 10) REP2(d, 0, 10) {\n\t\tll sum{};\n\t\tREP(ac, 4) REP(bc, 4) REP(cc, 4) REP(dc, 4) {\n\t\t\tll mu{1};\n\t\t\tmu *= res[ac][bc][cc][dc];\n\t\t\tif (ac > 0) mu *= pow(a, ac);\n\t\t\tif (bc > 0) mu *= pow(b, bc);\n\t\t\tif (cc > 0) mu *= pow(c, cc);\n\t\t\tif (dc > 0) mu *= pow(d, dc);\n\t\t\tsum += mu;\n\t\t}\n\t\tif (sum == n) {\n\t\t\tans = a * 1000 + b * 100 + c * 10 + d;\n\t\t\tcnt++;\n\t\t}\n\t}\n\tcout << cnt << endl;\n\tif (cnt == 1) {\n\t\tprintf(\"%04lld\\n\", ans);\n\t}\n}", "accuracy": 1, "time_ms": 140, "memory_kb": 4200, "score_of_the_acc": -2, "final_rank": 15 }, { "submission_id": "aoj_0487_9500511", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> iip;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define rep2(i,l,n) for(int i=l;i<n;i++)\nint inf=(1<<30);\nll strnum(string n,int a,int b,int c,int d){\n ll ret=0,r=1;\n for(int i=(int)n.size()-1;i>=0;i--){\n ret+=(n[i]=='a'?a:n[i]=='b'?b:n[i]=='c'?c:n[i]=='d'?d:n[i]-'0')*r;\n r*=10;\n }\n return ret;\n}\nll kakko(int &i,string const &s,int a,int b,int c,int d);\nll kou(int &i,string const &s,int a,int b,int c,int d){\n ll ret=1;\n string n=\"\";\n do{\n i++;\n if(s[i]=='(')ret*=kakko(i,s,a,b,c,d),i++;\n else{n=\"\";\n while(s[i]=='a'||s[i]=='b'||s[i]=='c'||s[i]=='d'||('0'<=s[i]&&s[i]<='9')){\n n+=s[i];\n i++;\n }\n //cout<<n<<endl;\n ret*=strnum(n,a,b,c,d);}\n }while(s[i]=='*');\n return ret;\n}\nll kakko(int &i,string const &s,int a,int b,int c,int d){\n ll ret=0;\n while(s[i]=='+'||s[i]=='-'||s[i]=='('){\n ret+=(s[i]=='-'?(-1):1)*kou(i,s,a,b,c,d);\n }\n return ret;\n}\nint main(){\n string s;ll n;cin>>s>>n;s=\"(\"+s+\")\";\n int ans=0;\n vector<int>abcd(4);\n rep(a,10)rep(b,10)rep(c,10)rep(d,10){\n int i=0;\n if(kakko(i,s,a,b,c,d)==n)ans++,abcd={a,b,c,d};\n }\n cout<<ans<<endl;\n if(ans==1)cout<<abcd[0]<<abcd[1]<<abcd[2]<<abcd[3]<<endl;\n /*int a,b,c,d;cin>>a>>b>>c>>d;\n int i=0;\n cout<<kakko(i,s,a,b,c,d)<<endl;*/\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3452, "score_of_the_acc": -0.0106, "final_rank": 1 }, { "submission_id": "aoj_0487_8873963", "code_snippet": "#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include<bits/stdc++.h>\n#define rep(i,n) for(ll i=0;i<(n);++i)\n#define reps(i,n) for(ll i=1;i<=(n);++i)\n#define repr(i,n) for(ll i=2;i*i<=(n);++i)\n#define ll long long\n#define all(x) (x).begin(),(x).end()\n#define sz(x) ((string)(x).size())\n#define pb push_back\n#define pob pop_back()\n#define setp(x) setprecision((ll)(x))\n#define mp make_pair\nusing namespace std;\nconst ll inf=1e18;\n\nstring s;\nll n;\n\nll f(int i,int j,int k,int l,int &a){\n ll res=0;\n stack<ll> b,c;\n ll x=0;\n while(s[a]!=')'&&a!=s.size()){\n if(s[a]=='(') {\n a++;\n x=f(i,j,k,l,a);\n }\n else if(s[a]=='a') x=x*10+i;\n else if(s[a]=='b') x=x*10+j;\n else if(s[a]=='c') x=x*10+k;\n else if(s[a]=='d') x=x*10+l;\n else if((s[a]-'0')>=0&&(s[a]-'0')<=9) x=x*10+(int)(s[a]-'0');\n else {\n if(!b.empty()&&b.top()==2){\n ll u=c.top();\n c.pop();\n x*=u;\n b.pop();\n }\n c.push(x);\n if(s[a]=='+') b.push(0);\n else if(s[a]=='-') b.push(1);\n else b.push(2);\n x=0;\n }\n a++;\n }\n if(!b.empty()&&b.top()==2){\n ll u=c.top();\n c.pop();\n x*=u;\n b.pop();\n }\n c.push(x);\n while(!b.empty()){\n if(b.top()==0) res+=c.top();\n else res-=c.top();\n b.pop();\n c.pop();\n }\n res+=c.top();\n return res;\n}\n\nint main(){\n cin>>s>>n;\n vector<string> p;\n rep(i,10)rep(j,10)rep(k,10)rep(l,10){\n int d=0;\n ll x=f(i,j,k,l,d);\n if(x==n) {\n string t;\n t+=(char)(i+'0');\n t+=(char)(j+'0');\n t+=(char)(k+'0');\n t+=(char)(l+'0');\n p.pb(t);\n }\n }\n if(p.size()!=1) cout<<p.size()<<endl;\n else {\n cout<<1<<endl;\n cout<<p[0]<<endl;\n }\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3716, "score_of_the_acc": -0.4367, "final_rank": 9 }, { "submission_id": "aoj_0487_8243185", "code_snippet": "#include <bits/stdc++.h>\n\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)\n#define all(v) begin(v), end(v)\n\nusing ll = long long;\n\ntemplate<class T, class U> bool chmin(T& a, const U& b) { return a > b ? a = b, true : false; }\ntemplate<class T, class U> bool chmax(T& a, const U& b) { return a < b ? a = b, true : false; }\n\nusing namespace std;\n\nll calc(string);\n\nint main() {\n string S; cin >> S;\n ll N; cin >> N;\n vector<string> ans;\n rep (a, 10) rep (b, 10) rep (c, 10) rep (d, 10) {\n string T = S;\n rep (i, T.size()) {\n if (T[i] == 'a') T[i] = a + '0';\n else if (T[i] == 'b') T[i] = b + '0';\n else if (T[i] == 'c') T[i] = c + '0';\n else if (T[i] == 'd') T[i] = d + '0';\n }\n if (calc(T) == N) {\n string res(4, '0');\n res[0] += a;\n res[1] += b;\n res[2] += c;\n res[3] += d;\n ans.push_back(res);\n }\n }\n cout << ans.size() << endl;\n if (ans.size() == 1) cout << ans[0] << endl;\n}\n\nll calc(string S) {\n S = '(' + S + ')';\n int N = S.size();\n vector<int> LR(N, -1);\n vector<ll> V(N);\n rep (i, N) {\n if ('0' <= S[i] && S[i] <= '9') {\n int r = i;\n ll v = 0;\n while (r < N && '0' <= S[r] && S[r] <= '9') {\n v = v * 10 + (S[r] - '0');\n ++r;\n }\n LR[i] = r - 1;\n LR[r - 1] = i;\n V[i] = v;\n i = r;\n }\n }\n rrep (bl, N) {\n if (S[bl] == '(') {\n for (int i = bl + 1; S[i] != ')'; ) {\n if (LR[i] != -1) i = LR[i] + 1;\n else {\n if (S[i] == '*') {\n int l = LR[i - 1], r = LR[i + 1];\n ll v = V[l] * V[i + 1];\n V[l] = v;\n LR[l] = r;\n LR[r] = l;\n i = r + 1;\n }\n else ++i;\n }\n }\n for (int i = bl + 1; S[i] != ')'; ) {\n if (LR[i] != -1) i = LR[i] + 1;\n else {\n if (S[i] == '+') {\n int l = LR[i - 1], r = LR[i + 1];\n ll v = V[l] + V[i + 1];\n V[l] = v;\n LR[l] = r;\n LR[r] = l;\n i = r + 1;\n }\n else if (S[i] == '-') {\n int l = LR[i - 1], r = LR[i + 1];\n ll v = V[l] - V[i + 1];\n V[l] = v;\n LR[l] = r;\n LR[r] = l;\n i = r + 1;\n }\n else ++i;\n }\n }\n V[bl] = V[bl + 1];\n int br = LR[bl + 1] + 1;\n LR[bl] = br;\n LR[br] = bl;\n }\n }\n return V[0];\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3668, "score_of_the_acc": -0.2963, "final_rank": 8 }, { "submission_id": "aoj_0487_8189154", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nvector<string> RPN(string S) {\n\tvector<string> A;\n\tvector<stack<int>> st(1);\n\t/* Only four arithmetic operations */\n\tstring support = \"0123456789+-*/()\";\n\tfor (int i = 0; i < (int) S.size(); i++){\n\t\tif (support.find(S[i]) == string::npos){\n\t\t\tcontinue;\n\t\t}\n\t\tif (S[i] == '('){\n\t\t\tst.resize(st.size() + 1);\n\t\t} else if (S[i] == ')'){\n\t\t\twhile (!st.back().empty()){\n\t\t\t\tA.resize(A.size() + 1);\n\t\t\t\tA.back().push_back(st.back().top());\n\t\t\t\tst.back().pop();\n\t\t\t}\n\t\t\tst.pop_back();\n\t\t} else {\n\t\t\tif (isdigit(S[i])){\n\t\t\t\tif (i == 0 or !isdigit(S[i - 1])){\n\t\t\t\t\tA.resize(A.size() + 1);\n\t\t\t\t}\n\t\t\t\tA.back().push_back(S[i]);\n\t\t\t} else {\n\t\t\t\tif ((int) st.back().size() >= 1 and (S[i] == '+' or S[i] == '-')){\n\t\t\t\t\twhile (!st.back().empty()){\n\t\t\t\t\t\tA.resize(A.size() + 1);\n\t\t\t\t\t\tA.back().push_back(st.back().top());\n\t\t\t\t\t\tst.back().pop();\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tst.back().push(S[i]);\n\t\t\t}\n\t\t}\n\t}\n\twhile (!st.back().empty()){\n\t\tA.resize(A.size() + 1);\n\t\tA.back().push_back(st.back().top());\n\t\tst.back().pop();\n\t}\n\treturn A;\n}\n\nint main() {\n\tstring S;\n\tcin >> S;\n\tlong long N;\n\tcin >> N;\n\tvector<tuple<int, int, int, int>> ans;\n\tfor (int a = 0; a < 10; a++){\n\t\tfor (int b = 0; b < 10; b++){\n\t\t\tfor (int c = 0; c < 10; c++){\n\t\t\t\tfor (int d = 0; d < 10; d++){\n\t\t\t\t\tstring S2 = S;\n\t\t\t\t\tfor (int i = 0; i < (int) S.size(); i++){\n\t\t\t\t\t\tif (S[i] == 'a'){\n\t\t\t\t\t\t\tS2[i] = '0' + a;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (S[i] == 'b'){\n\t\t\t\t\t\t\tS2[i] = '0' + b;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (S[i] == 'c'){\n\t\t\t\t\t\t\tS2[i] = '0' + c;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (S[i] == 'd'){\n\t\t\t\t\t\t\tS2[i] = '0' + d;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tauto R = RPN(S2);\n\t\t\t\t\tstack<long long> st;\n\t\t\t\t\tfor (string s : R){\n\t\t\t\t\t\tif (s == \"+\"){\n\t\t\t\t\t\t\tlong long r = st.top();\n\t\t\t\t\t\t\tst.pop();\n\t\t\t\t\t\t\tlong long l = st.top();\n\t\t\t\t\t\t\tst.pop();\n\t\t\t\t\t\t\tst.push(l + r);\n\t\t\t\t\t\t} else if (s == \"-\"){\n\t\t\t\t\t\t\tlong long r = st.top();\n\t\t\t\t\t\t\tst.pop();\n\t\t\t\t\t\t\tlong long l = st.top();\n\t\t\t\t\t\t\tst.pop();\n\t\t\t\t\t\t\tst.push(l - r);\n\t\t\t\t\t\t} else if (s == \"*\"){\n\t\t\t\t\t\t\tlong long r = st.top();\n\t\t\t\t\t\t\tst.pop();\n\t\t\t\t\t\t\tlong long l = st.top();\n\t\t\t\t\t\t\tst.pop();\n\t\t\t\t\t\t\tst.push(l * r);\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tst.push(stoi(s));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (st.top() == N){\n\t\t\t\t\t\tans.push_back({a, b, c, d});\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tcout << ans.size() << '\\n';\n\tif ((int) ans.size() == 1){\n\t\tauto [a, b, c, d] = ans[0];\n\t\tcout << a << b << c << d << '\\n';\n\t}\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 3580, "score_of_the_acc": -0.5645, "final_rank": 11 }, { "submission_id": "aoj_0487_8183185", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define gcd(x,y) __gcd(x,y) //最大公約数\n#define lcm(x,y) x/(__gcd(x,y))*y //最小公倍数\n\nint main() {\n string s, n;\n cin >> s >> n;\n vector<string> ve;\n stack<string> st;\n vector<string> ans;\n string t = \"\", u = \"\";\n for (int i = 0; i < s.size(); i++) {\n if (s[i] == 'a' || s[i] == 'b' || s[i] == 'c' || s[i] == 'd') {\n if (u != \"\") {\n ve.push_back(u);\n u = \"\";\n }\n t += s[i];\n } else if ('0' <= s[i] && s[i] <= '9') {\n if (t != \"\") {\n ve.push_back(t);\n t = \"\";\n }\n u += s[i];\n } else {\n if (t != \"\") {\n ve.push_back(t);\n t = \"\";\n }\n if (u != \"\") {\n ve.push_back(u);\n u = \"\";\n }\n if (s[i] == '(') {\n st.push({s[i]});\n } else if (s[i] == ')') {\n while (st.top() != \"(\") {\n ve.push_back(st.top());\n st.pop();\n }\n st.pop();\n } else {\n if (s[i] == '*' || s[i] == '/') {\n while (!st.empty() && st.top() == \"*\" && st.top() == \"/\") {\n ve.push_back(st.top());\n st.pop();\n }\n st.push({s[i]});\n } else if (s[i] == '+' || s[i] == '-') {\n while (!st.empty() && st.top() != \"(\" && st.top() != \")\") {\n ve.push_back(st.top());\n st.pop();\n }\n st.push({s[i]});\n }\n }\n }\n }\n if (t != \"\") {\n ve.push_back(t);\n }\n if (u != \"\") {\n ve.push_back(u);\n }\n while (!st.empty()) {\n ve.push_back(st.top());\n st.pop();\n }\n for (int a = 0; a < 10; a++) {\n for (int b = 0; b < 10; b++) {\n for (int c = 0; c < 10; c++) {\n for (int d = 0; d < 10; d++) {\n stack<string> st;\n for (int i = 0; i < ve.size(); i++) {\n if (ve[i] != \"+\" && ve[i] != \"-\" && ve[i] != \"*\" && ve[i] != \"/\") {\n string num = ve[i];\n if ('a' <= ve[i][0] && ve[i][0] <= 'd') {\n num = \"\";\n for (int j = 0; j < ve[i].size(); j++) {\n if (ve[i][j] == 'a') {\n num += '0' + a;\n } else if (ve[i][j] == 'b') {\n num += '0' + b;\n } else if (ve[i][j] == 'c') {\n num += '0' + c;\n } else if (ve[i][j] == 'd') {\n num += '0' + d;\n }\n }\n }\n st.push(num);\n } else {\n string ys = st.top();\n st.pop();\n string xs = st.top();\n st.pop();\n long long x = stoll(xs), y = stoll(ys);\n if (ve[i] == \"+\") {\n x += y;\n } else if (ve[i] == \"-\") {\n x -= y;\n } else if (ve[i] == \"*\") {\n x *= y;\n } else if (ve[i] == \"/\") {\n x /= y;\n }\n st.push(to_string(x));\n }\n }\n if (st.top() == n) {\n t = \"\";\n t += a + '0';\n t += b + '0';\n t += c + '0';\n t += d + '0';\n ans.push_back(t);\n }\n st.pop();\n }\n }\n }\n }\n cout << ans.size() << \"\\n\";\n if (ans.size() == 1) {\n cout << ans[0] << \"\\n\";\n }\n return(0);\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 3876, "score_of_the_acc": -1.4945, "final_rank": 13 }, { "submission_id": "aoj_0487_8183143", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define gcd(x,y) __gcd(x,y) //最大公約数\n#define lcm(x,y) x/(__gcd(x,y))*y //最小公倍数\n\nint main() {\n string s, n;\n cin >> s >> n;\n vector<string> ve;\n stack<string> st;\n vector<string> ans;\n string t = \"\", u = \"\";\n for (int i = 0; i < s.size(); i++) {\n if (s[i] == 'a' || s[i] == 'b' || s[i] == 'c' || s[i] == 'd') {\n if (u != \"\") {\n ve.push_back(u);\n u = \"\";\n }\n t += s[i];\n } else if ('0' <= s[i] && s[i] <= '9') {\n if (t != \"\") {\n ve.push_back(t);\n t = \"\";\n }\n u += s[i];\n } else {\n if (t != \"\") {\n ve.push_back(t);\n t = \"\";\n }\n if (u != \"\") {\n ve.push_back(u);\n u = \"\";\n }\n if (s[i] == '(') {\n st.push({s[i]});\n } else if (s[i] == ')') {\n while (st.top() != \"(\") {\n ve.push_back(st.top());\n st.pop();\n }\n st.pop();\n } else {\n if (s[i] == '*' || s[i] == '/') {\n if (!st.empty() && st.top() == \"*\" && st.top() != \"/\") {\n ve.push_back(st.top());\n st.pop();\n }\n st.push({s[i]});\n } else if (s[i] == '+' || s[i] == '-') {\n if (!st.empty() && st.top() != \"(\" && st.top() != \")\") {\n ve.push_back(st.top());\n st.pop();\n }\n st.push({s[i]});\n }\n }\n }\n }\n if (t != \"\") {\n ve.push_back(t);\n }\n if (u != \"\") {\n ve.push_back(u);\n }\n while (!st.empty()) {\n ve.push_back(st.top());\n st.pop();\n }\n for (int a = 0; a < 10; a++) {\n for (int b = 0; b < 10; b++) {\n for (int c = 0; c < 10; c++) {\n for (int d = 0; d < 10; d++) {\n stack<string> st;\n for (int i = 0; i < ve.size(); i++) {\n if (ve[i] != \"+\" && ve[i] != \"-\" && ve[i] != \"*\" && ve[i] != \"/\") {\n string num = ve[i];\n if ('a' <= ve[i][0] && ve[i][0] <= 'd') {\n num = \"\";\n for (int j = 0; j < ve[i].size(); j++) {\n if (ve[i][j] == 'a') {\n num += '0' + a;\n } else if (ve[i][j] == 'b') {\n num += '0' + b;\n } else if (ve[i][j] == 'c') {\n num += '0' + c;\n } else if (ve[i][j] == 'd') {\n num += '0' + d;\n }\n }\n }\n st.push(num);\n } else {\n string ys = st.top();\n st.pop();\n string xs = st.top();\n st.pop();\n long long x = stoll(xs), y = stoll(ys);\n if (ve[i] == \"+\") {\n x += y;\n } else if (ve[i] == \"-\") {\n x -= y;\n } else if (ve[i] == \"*\") {\n x *= y;\n } else if (ve[i] == \"/\") {\n x /= y;\n }\n st.push(to_string(x));\n }\n }\n if (st.top() == n) {\n t = \"\";\n t += a + '0';\n t += b + '0';\n t += c + '0';\n t += d + '0';\n ans.push_back(t);\n }\n st.pop();\n }\n }\n }\n }\n cout << ans.size() << \"\\n\";\n if (ans.size() == 1) {\n cout << ans[0] << \"\\n\";\n }\n return(0);\n}", "accuracy": 0.5333333333333333, "time_ms": 10, "memory_kb": 3748, "score_of_the_acc": -0.4021, "final_rank": 18 }, { "submission_id": "aoj_0487_8044636", "code_snippet": "//パスワード\n\n#include <stdio.h>\n#include <iostream>\n#include <vector>\n#include <set>\n#include <functional>\n#include <queue>\n#include <numeric>\n#include <queue>\n#include <stack>\n#include <math.h>\nusing ull = unsigned long long;\nusing ll = unsigned long long;\nbool IsAlphabet(char c){\n return 'a' <= c && c <= 'z';\n}\nbool IsNumber(char c){\n return '0' <= c && c <= '9';\n}\nll GetDigit(ll value){\n return std::log10(value) + 1;\n}\nint GetOperatorPriority(char c){\n switch(c){\n case '+':\n case '-':\n return 0;\n case '*':\n return 1;\n case '&'://結合演算子\n return 2;\n case '(':\n return -1;\n }\n throw;\n}\nauto GetOperator(char c) -> std::function<ll(ll , ll)>{\n switch(c){\n case '+':\n return [](ll left , ll right){return left + right;};\n case '-':\n return [](ll left , ll right){return left - right;};\n case '*':\n return [](ll left , ll right){return left * right;};\n /*\n case '&'://結合演算子\n return [](int left , int right){return left * (int)std::pow(10 , GetDigit(right)) + right;};\n */\n }\n throw;\n}\nstd::string SwapUniqueOperator(const std::string& str){\n std::string result;\n for(int i = 0; i < str.length(); i++){\n if(i != 0 && IsAlphabet(str[i - 1]) && IsAlphabet(str[i])) result += '&';\n result += str[i];\n }\n return std::move(result);\n}\nstd::string CastRPN(const std::string& str){\n std::string result;\n std::queue<std::string> operands;\n std::stack<char> operators;\n auto StackFlush = [&](bool AllFlag = false){\n while(!operands.empty()){\n //if(!AllFlag && operands.front() == \"(\")\n //break;\n result += operands.front();\n result += ' ';\n operands.pop();\n }\n while(!operators.empty()){\n if(!AllFlag && operators.top() == '(') \n break;\n result += operators.top();\n result += ' ';\n operators.pop();\n }\n };\n for(int i = 0; i < str.length(); i++){\n if(IsNumber(str[i])){\n std::string nums;\n nums += str[i];\n while(i + 1 < str.length() && IsNumber(str[i + 1])){\n nums += str[i + 1];\n i++;\n }\n operands.push(std::move(nums));\n }else if(IsAlphabet(str[i])){\n std::string vals;\n vals += str[i];\n while(i + 1 < str.length() && IsAlphabet(str[i + 1])){\n vals += str[i + 1];\n i++;\n }\n operands.push(std::move(vals));\n }else if(str[i] == '('){\n operators.push('(');\n //operands.push(\"(\");\n }else if(str[i] == ')'){\n StackFlush();\n operators.pop();\n //operands.pop();\n }else{//operator\n if(!operators.empty() && GetOperatorPriority(str[i]) <= GetOperatorPriority(operators.top()))\n StackFlush();\n operators.push(str[i]);\n }\n }\n StackFlush(true);\n return std::move(result);\n}\nll solve(const std::string &str , const int (&values)[4]){\n auto GetAlphabetIndex = [](char c){\n return c - 'a';\n };\n std::stack<ll> operands;\n int ZeroFlag = 0;\n for(int i = 0; i < str.length(); i++){\n if(IsAlphabet(str[i])){\n int index = GetAlphabetIndex(str[i]);\n operands.push(values[index]);\n while(i + 1 < str.length() && IsAlphabet(str[i + 1])){\n //std::cout << operands.top() << std::endl;\n index = GetAlphabetIndex(str[i + 1]);\n operands.top() *= 10;\n operands.top() += values[index];\n i++;\n }\n }else if(IsNumber(str[i])){\n operands.push(str[i] - '0');\n while(i + 1 < str.length() && IsNumber(str[i + 1])){\n operands.top() *= 10;\n operands.top() += str[i + 1] - '0';\n i++;\n }\n }else if(str[i] == ' '){\n continue;\n }else{ //operator\n auto ope = GetOperator(str[i]);\n ll right = operands.top();\n operands.pop();\n ll left = operands.top();\n operands.pop();\n if(str[i] == '&' && left == 0) ZeroFlag++;\n else if(str[i] == '&') {\n left *= std::pow(10 , ZeroFlag);\n ZeroFlag = 0;\n }\n else ZeroFlag = 0;\n ll value = ope(left , right);\n //std::cout << \"left:\" << left << \" right:\" << right << \" ope = \" << value << std::endl;\n operands.push(value);\n }\n }\n return operands.top();\n}\nint main(){\n std::string S;\n ll N;\n std::cin >> S >> N;\n //S = SwapUniqueOperator(S);\n //std::cout << S << std::endl;\n S = CastRPN(S);\n int values[4];\n //std::cout << S << std::endl;\n //std::cout << solve(S , values) << std::endl;\n \n ll value;\n int num;\n int count = 0;\n for(int i = 0; i < 10000; i++){\n values[3] = i % 10;\n values[2] = i % 100 / 10;\n values[1] = i % 1000 / 100;\n values[0] = i / 1000;\n value = solve(S , values);\n if(value == N){\n num = i;\n count++;\n }\n }\n std::cout << count << std::endl;\n if(count == 1) printf(\"%04d\\n\" , num);\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3588, "score_of_the_acc": -0.1905, "final_rank": 7 }, { "submission_id": "aoj_0487_8008671", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nstring S;\nint it;\nunordered_map<char, int> mp {\n { 'a', 0 },\n { 'b', 0 },\n { 'c', 0 },\n { 'd', 0 },\n};\n\nll number();\nll parse();\n\nbool isVariable(char c) {\n return c == 'a' or c == 'b' or c == 'c' or c == 'd';\n}\n\nbool isDigit(char c) {\n return '0' <= c and c <= '9';\n}\n\nll factor() {\n ll res = 0LL;\n if (S[it] == '(') {\n it++;\n res = parse();\n assert(S[it] == ')');\n it++;\n return res;\n }\n else if (isVariable(S[it])) {\n while (isVariable(S[it])) {\n res = (res * 10) + mp[S[it]];\n it++; \n }\n }\n else if (isDigit(S[it])) {\n while (isDigit(S[it])) {\n res = (res * 10) + (S[it] - '0');\n it++;\n }\n }\n else {\n assert(false);\n }\n return res;\n}\n\nll term() {\n ll lhs = factor();\n while (true) {\n if (it == (int)S.size()) break;\n if (S[it] == ')') break;\n if (S[it] == '+' or S[it] == '-') break;\n assert(S[it] == '*');\n it++;\n ll rhs = factor();\n lhs = lhs * rhs;\n }\n return lhs;\n}\n\nll parse() {\n ll lhs = term();\n while (true) {\n if (it == (int)S.size()) break;\n if (S[it] == ')') break;\n char op = S[it];\n assert(op == '+' or op == '-');\n it++;\n ll rhs = term();\n lhs = lhs + (op == '+' ? rhs : -rhs);\n }\n return lhs;\n}\n\nint main() {\n cin >> S;\n tuple<int, int, int, int> ans{ -1, -1, -1, -1 };\n ll N; cin >> N;\n int num = 0;\n for (int i = 0 ; i < 10 ; i++) {\n for (int j = 0 ; j < 10 ; j++) {\n for (int k = 0 ; k < 10 ; k++) {\n for (int l = 0 ; l < 10 ; l++) {\n mp['a'] = i;\n mp['b'] = j;\n mp['c'] = k;\n mp['d'] = l;\n it = 0;\n if (parse() == N) {\n ans = { i, j, k, l };\n num++;\n }\n }\n }\n }\n }\n cout << num << endl;\n if (num == 1) {\n auto [a, b, c, d] = ans;\n cout << a << b << c << d << endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3480, "score_of_the_acc": -0.0476, "final_rank": 3 }, { "submission_id": "aoj_0487_7980545", "code_snippet": "#include <bits/extc++.h>\n\nusing ll = long long int;\n\nint prec(char c) {\n switch (c) {\n case '+':\n case '-':\n return 1;\n break;\n\n case '*':\n return 2;\n break;\n\n case ')':\n return 0;\n break;\n\n default:\n return -1;\n break;\n }\n}\n\nll invoke(char c, ll lhs, ll rhs) {\n switch (c) {\n case '+':\n return lhs + rhs;\n break;\n\n case '-':\n return lhs - rhs;\n break;\n\n case '*':\n return lhs * rhs;\n break;\n\n default:\n return -1;\n break;\n }\n}\n\nbool take_left(char c) { return c == '+' || c == '-' || c == '*' || c == ')'; }\n\nint main() {\n std::string s;\n ll n;\n std::cin >> s >> n;\n\n int ans = 0;\n std::tuple<int, int, int, int> ans2;\n\n for (int a = 0; a < 10; a++) {\n for (int b = 0; b < 10; b++) {\n for (int c = 0; c < 10; c++) {\n for (int d = 0; d < 10; d++) {\n int pos = 0;\n std::stack<ll> stack;\n std::stack<char> ops;\n while (pos < s.size()) {\n if (std::isdigit(s[pos])) {\n ll tmp = 0;\n while (pos < s.size() && std::isdigit(s[pos])) {\n tmp *= 10;\n tmp += s[pos] - '0';\n pos++;\n }\n stack.push(tmp);\n } else if (std::isalpha(s[pos])) {\n ll tmp = 0;\n while (pos < s.size() && std::isalpha(s[pos])) {\n tmp *= 10;\n if (s[pos] == 'a') {\n tmp += a;\n } else if (s[pos] == 'b') {\n tmp += b;\n } else if (s[pos] == 'c') {\n tmp += c;\n } else if (s[pos] == 'd') {\n tmp += d;\n }\n pos++;\n }\n stack.push(tmp);\n } else if (std::ispunct(s[pos])) {\n if (take_left(s[pos])) {\n while (!ops.empty() && prec(ops.top()) >= prec(s[pos])) {\n assert(stack.size() >= 2);\n ll rhs = stack.top();\n stack.pop();\n ll lhs = stack.top();\n stack.pop();\n stack.push(invoke(ops.top(), lhs, rhs));\n ops.pop();\n }\n }\n if (s[pos] == ')') {\n assert(ops.top() == '(');\n ops.pop();\n } else {\n ops.push(s[pos]);\n }\n pos++;\n }\n }\n\n while (!ops.empty()) {\n assert(stack.size() >= 2);\n ll rhs = stack.top();\n stack.pop();\n ll lhs = stack.top();\n stack.pop();\n stack.push(invoke(ops.top(), lhs, rhs));\n ops.pop();\n }\n\n assert(stack.size() == 1);\n\n if (stack.top() == n) {\n ans++;\n ans2 = {a, b, c, d};\n }\n }\n }\n }\n }\n\n std::cout << ans << '\\n';\n if (ans == 1) {\n auto& [a, b, c, d] = ans2;\n std::cout << a << b << c << d << '\\n';\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3452, "score_of_the_acc": -0.0106, "final_rank": 1 }, { "submission_id": "aoj_0487_7938617", "code_snippet": "#include <bits/extc++.h>\n\nusing ll = long long int;\n\nenum kind {\n NUM,\n VAR,\n PROD,\n ADD,\n SUB,\n};\n\nstruct tree {\n using ptr = std::shared_ptr<tree>;\n\n kind k;\n ll val;\n ptr left, right;\n\n tree(kind k, ll val, ptr left, ptr right)\n : k(k), val(val), left(left), right(right) {}\n\n static ptr integer(ll v) { return ptr(new tree(NUM, v, nullptr, nullptr)); }\n\n static ptr var(int v) { return ptr(new tree(VAR, v, nullptr, nullptr)); }\n\n static ptr prod(ptr left, ptr right) {\n return ptr(new tree(PROD, -1, left, right));\n }\n\n static ptr add(ptr left, ptr right) {\n return ptr(new tree(ADD, -1, left, right));\n }\n\n static ptr sub(ptr left, ptr right) {\n return ptr(new tree(SUB, -1, left, right));\n }\n\n ll eval(const std::array<ll, 4> &vars) {\n switch (k) {\n case NUM:\n return val;\n break;\n\n case VAR:\n return vars[val];\n break;\n\n case PROD:\n return left->eval(vars) * right->eval(vars);\n break;\n\n case ADD:\n return left->eval(vars) + right->eval(vars);\n break;\n\n case SUB:\n return left->eval(vars) - right->eval(vars);\n break;\n\n default:\n return -1;\n break;\n }\n }\n};\n\nstruct parser {\n std::string str;\n size_t pos;\n\n parser(std::string str) : str(str), pos(0) {}\n\n char peek() { return str[pos]; }\n\n char get() { return str[pos++]; }\n\n bool eof() { return pos >= str.size(); }\n\n ll digit() {\n char c = get();\n assert(std::isdigit(c));\n return c - '0';\n }\n\n bool isdigit() { return !eof() && std::isdigit(peek()); }\n\n bool islower() { return !eof() && std::islower(peek()); }\n\n bool peek(char c) { return !eof() && peek() == c; }\n\n tree::ptr integer() {\n ll res = 0;\n while (isdigit()) {\n res *= 10;\n res += digit();\n }\n return tree::integer(res);\n }\n\n tree::ptr var() {\n tree::ptr res = tree::var(get() - 'a');\n\n while (islower()) {\n res =\n tree::add(tree::prod(res, tree::integer(10)), tree::var(get() - 'a'));\n }\n\n return res;\n }\n\n tree::ptr par() {\n get();\n tree::ptr res = expr();\n get();\n return res;\n }\n\n tree::ptr atomic() {\n if (islower()) {\n return var();\n } else if (isdigit()) {\n return integer();\n } else if (peek('(')) {\n return par();\n } else {\n std::cerr << \"invalid char at \" << pos << \"\\n\";\n assert(false);\n }\n }\n\n tree::ptr term() {\n tree::ptr res = atomic();\n while (peek('*')) {\n get();\n res = tree::prod(res, atomic());\n }\n return res;\n }\n\n tree::ptr expr() {\n tree::ptr res = term();\n while (peek('+') || peek('-')) {\n if (peek('+')) {\n get();\n res = tree::add(res, term());\n } else {\n get();\n res = tree::sub(res, term());\n }\n }\n return res;\n }\n};\n\nint main() {\n std::string s;\n ll n;\n std::cin >> s >> n;\n\n parser psr(s);\n\n tree::ptr expr = psr.expr();\n assert(psr.eof());\n\n ll ans = 0;\n std::array<ll, 4> ans2;\n\n for (int a = 0; a < 10; a++) {\n for (int b = 0; b < 10; b++) {\n for (int c = 0; c < 10; c++) {\n for (int d = 0; d < 10; d++) {\n if (expr->eval({a, b, c, d}) == n) {\n ans++;\n if (ans == 1) {\n ans2 = {a, b, c, d};\n }\n }\n }\n }\n }\n }\n\n std::cout << ans << \"\\n\";\n if (ans == 1) {\n for (auto x : ans2) {\n std::cout << x;\n }\n std::cout << \"\\n\";\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3520, "score_of_the_acc": -0.1005, "final_rank": 4 }, { "submission_id": "aoj_0487_7937375", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\nconst int INF = 1e9+1e7;\nusing ll=long long;\nint main(){\n\tstring S;\n\tcin>>S;\n\tll val;\n\tcin>>val;\n\tvector<int> ans;\n\tvector<int> p(4);\n\tint N=S.size();\n\tint ind=0;\n\tauto f=[&](auto self)->ll{\n\t\tvector<ll> s;\n\t\tint op=0;\n\t\tauto g=[&](ll v){\n\t\t\tif(op==0) s.push_back(v);\n\t\t\tif(op==-1) s.push_back(-v);\n\t\t\tif(op==1){\n\t\t\t\tassert(!s.empty());\n\t\t\t\tll a=(*s.rbegin());\n\t\t\t\ta*=v;\n\t\t\t\ts.at(s.size()-1)=a;\n\t\t\t}\n\t\t};\n\t\twhile(ind!=N){\n\t\t\tif(S[ind]=='-'){\n\t\t\t\top=-1;\n\t\t\t\tind++;\n\t\t\t}\n\t\t\telse if(S[ind]=='+'){\n\t\t\t\top=0;\n\t\t\t\tind++;\n\t\t\t}\n\t\t\telse if(S[ind]=='*'){\n\t\t\t\top=1;\n\t\t\t\tind++;\n\t\t\t}\n\t\t\telse if(S[ind]=='('){\n\t\t\t\tind++;\n\t\t\t\tg(self(self));\n\t\t\t}\n\t\t\telse if(S[ind]==')'){\n\t\t\t\tind++;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if('a'<=S[ind]&&S[ind]<='d'){\n\t\t\t\tll tmp=0;\n\t\t\t\twhile(ind!=N&&'a'<=S[ind]&&S[ind]<='d'){\n\t\t\t\t\ttmp*=10ll;\n\t\t\t\t\ttmp+=p[S[ind]-'a'];\n\t\t\t\t\tind++;\n\t\t\t\t}\n\t\t\t\tg(tmp);\n\t\t\t}\n\t\t\telse{\n\t\t\t\tassert('0'<=S[ind]&&S[ind]<='9');\n\t\t\t\tll tmp=0;\n\t\t\t\twhile(ind!=N&&'0'<=S[ind]&&S[ind]<='d'){\n\t\t\t\t\ttmp*=10ll;\n\t\t\t\t\ttmp+=(S[ind]-'0');\n\t\t\t\t\tind++;\n\t\t\t\t}\n\t\t\t\tg(tmp);\n\t\t\t}\n\t\t}\n\t\tll res=0;\n\t\tfor(auto x:s) res+=x;\n\t\treturn res;\n\t};\n\trep(num,0,10000){\n\t\tint tmp=num;\n\t\trep(i,0,4) p[3-i]=tmp%10,tmp/=10;\n\t\tind=0;\n\t\tif(val==f(f)) ans.push_back(num);\n\t}\n\tcout<<ans.size()<<\"\\n\";\n\tif(ans.size()==1){\n\t\tprintf(\"%04d\\n\",ans[0]);\n\t}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3576, "score_of_the_acc": -0.1746, "final_rank": 5 } ]
aoj_0489_cpp
農地開発 イヅア国では国内にある広大な土地を利用して、複数の農園を開拓することになった。 イヅア国ではすでに$N$箇所の農園が開拓されており、農園には$1$から$N$までの番号がついている。農園の間にはそれらを直接つなぐ道が、全部で$N-1$本ある。どの道も同じ長さで、どちらの方向にも通ることができる。また、どの農園からでも、いくつかの道を通っていくことで他のどの農園にも到達できる。また、それぞれの農園では、その農園の収支を記録している。 あなたは新しい任務としてイヅア国の農園の拡張と管理を任される予定である。上司から、以下の２種類の作業をいくつか組み合わせた指示を受け取ることになった。 作業１：農園を新たに開拓し、すでにある農園との間に道を作り接続する。新たに作る道の長さはすでにある道の長さと同じとする。 作業２：農園を２つ指定し、それらの農園をつなぐ最短の経路を見つける。その経路上にある農園の中から、$k$番目に収支の少ない農園の収支を報告する。 あなたは任務が始まる前に、報告すべき収支を計算するプログラムを作っておこうと考えている。 現在の農園の情報と、それぞれの作業に関する情報が与えられたとき、報告すべき農園の収支を出力するプログラムを作成せよ。 入力 入力は以下の形式で与えられる。 $N$ $M$ $b_1$ $b_2$ ： $b_N$ $s_1$ $t_1$ $s_2$ $t_2$ ： $s_{N-1}$ $t_{N-1}$ $op_1$ $op_2$ ： $op_M$ １行目に、すでにある農園の数$N$ ($2 \leq N \leq 100,000$)と作業の数$M$ ($1 \leq M \leq 100,000$)が与えられる。続く$N$行に、$i$番目の農園の収支$b_i$ ($-1,000,000 \leq b_i \leq 1,000,000$)が整数で与えられる。続く$N-1$行に、２つの農園を直接つなぐ道の情報が与えられる。$s_i$と$t_i$ ($1 \leq s_i < t_i \leq N$)は、$i$番目の道がつなぐ２つの農園の番号である。ただし、どの２つの農園についても、それらを直接つなぐ道は１本以下とする。続く$M$行に、作業を示す情報$op_i$が与えられる。各$op_i$は以下のいずれかの形式で与えられる。 1 $u$ $w$ または 2 $u$ $v$ $k$ 以下では、作業を実行する前の農園の数を$P$とする。最初の文字が1の場合、番号が$P+1$となる農園を新たに作り、農園$u$ ($1 \leq u \leq P$)との間に道を作り接続する作業を示す。その収支は$w$ ($-1,000,000 \leq w \leq 1,000,000$)である。 最初の文字が2の場合、農園$u$ ($1 \leq u \leq P$)と農園$v$ ($1 \leq v \leq P$)を最短の道のりでたどったときに訪れるすべての農園の収支のうち、少ないほうから$k$ ($1 \leq k \leq P$)番目の収支を報告する作業を示す。ただし、$k$はこの指示で訪れる農園の数を超えない。 出力 収支を報告する作業ごとに、農園の収支を出力する。 入出力例 入力例 5 9 1 3 1 1 4 1 2 2 3 2 4 4 5 2 2 5 2 1 2 2 2 5 6 2 2 5 6 3 2 5 6 1 1 6 5 1 6 7 2 1 8 3 2 1 8 4 出力例 3 2 3 1 3 7
[ { "submission_id": "aoj_0489_10871725", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define ll long long\nconst long long mod=998244353;\nconst long long hmod=46216567629137;\nstruct S{\n int pos;\n int d;\n};\nS e(){\n S res={-1,1000000000};\n return res;\n}\nS op(S a,S b){\n if(a.d<b.d) return a;\n return b;\n}\nclass segtree{\n public:\n S dat[200009];\n int siz;\n segtree(int N){\n siz=1;\n while(siz<N) siz*=2;\n for(int i=1;i<siz*2;i++) dat[i]=e();\n }\n void set(int p,S x){\n p=p+siz-1;\n dat[p]=x;\n while(p>=2){\n p/=2;\n dat[p]=op(dat[p*2],dat[p*2+1]);\n }\n }\n S query(int l,int r,int a,int b,int u){\n if(r<=a || b<=l) return e();\n if(l<=a && b<=r) return dat[u];\n int m=(a+b)/2;\n S L=query(l,r,a,m,u*2);\n S R=query(l,r,m,b,u*2+1);\n return op(L,R);\n }\n S query(int l,int r){\n return query(l,r,1,siz+1,1);\n }\n};\nclass BIT{\n public:\n int dat[2000009];\n vector<pair<int,int>>history[2000009];\n BIT(){\n for(int i=1;i<=2000001;i++){\n dat[i]=0;\n history[i].push_back({-1,0});\n }\n }\n void add(int p,int x,int t){\n while(p<=2000001){\n dat[p]+=x;\n history[p].push_back({t,dat[p]});\n p+=p&-p;\n }\n }\n int lower_bound(int a,int b,int c,int d,int k){\n int x=0;\n int s=1;\n while(s<2000001) s*=2;\n s/=2;\n for(int i=s;i>=1;i/=2){\n if(x+i>2000001) continue;\n int pos=x+i;\n int cnt=0;\n auto iter1=std::lower_bound(history[pos].begin(),history[pos].end(),make_pair(a+1,-100));\n auto iter2=std::lower_bound(history[pos].begin(),history[pos].end(),make_pair(b+1,-100));\n auto iter3=std::lower_bound(history[pos].begin(),history[pos].end(),make_pair(c+1,-100));\n iter1--;iter2--;iter3--;\n cnt+=(*iter1).second+(*iter2).second-(*iter3).second;\n if(d!=0){\n auto iter4=std::lower_bound(history[pos].begin(),history[pos].end(),make_pair(d+1,-100));\n iter4--;\n cnt-=(*iter4).second;\n }\n if(cnt<k){\n k-=cnt;\n x+=i;\n }\n }\n return x+1;\n }\n};\nint main(){\n cin.tie(0)->sync_with_stdio(0);\n cout.tie(0);\n //入力\n int N,M;\n cin>>N>>M;\n ll b[N+1];\n for(int i=1;i<=N;i++){\n cin>>b[i];\n b[i]+=1000001;\n }\n \n int s[N],t[N];\n for(int i=1;i<N;i++) cin>>s[i]>>t[i];\n int query[M+1],u[M+1],w[M+1],v[M+1],k[M+1];\n int nodes=N;\n for(int i=1;i<=M;i++){\n cin>>query[i];\n if(query[i]==1){\n cin>>u[i]>>w[i];\n w[i]+=1000001;\n nodes++;\n }\n if(query[i]==2) cin>>u[i]>>v[i]>>k[i];\n }\n //グラフ作成\n vector<int>G[nodes+1];\n for(int i=1;i<N;i++){\n G[s[i]].push_back(t[i]);\n G[t[i]].push_back(s[i]);\n }\n int c=N+1;\n for(int i=1;i<=M;i++){\n if(query[i]==1){\n G[u[i]].push_back(c);\n G[c].push_back(u[i]);\n c++;\n }\n }\n //costを調整\n int cost[nodes+1];\n for(int i=1;i<=N;i++){\n cost[i]=b[i];\n }\n c=N+1;\n for(int i=1;i<=M;i++){\n if(query[i]==1){\n cost[c]=w[i];\n c++;\n }\n }\n //オイラーツアーを作成+BITに要素を入れる\n BIT bit;\n vector<int>euler_tour;\n bool already[nodes+1];\n int T[nodes+1];\n int dist[nodes+1];\n for(int i=1;i<=nodes;i++){\n already[i]=0;\n T[i]=-1;\n dist[i]=0;\n }\n c=1;\n function<void(int)>dfs=[&](int pos){\n already[pos]=1;\n bit.add(cost[pos],1,c);\n c++;\n euler_tour.push_back(pos);\n for(int i=0;i<G[pos].size();i++){\n int nex=G[pos][i];\n if(already[nex]) continue;\n dist[nex]=dist[pos]+1;\n dfs(nex);\n euler_tour.push_back(pos);\n }\n already[pos]=0;\n bit.add(cost[pos],-1,c);\n c++;\n return;\n };\n dfs(1);\n segtree seg(euler_tour.size());\n for(int i=0;i<euler_tour.size();i++){\n int p=euler_tour[i];\n if(T[p]==-1) T[p]=i+1;\n seg.set(i+1,{p,dist[p]});\n }\n int T2[nodes+1];\n for(int i=1;i<=nodes;i++){\n T2[i]=-1;\n already[i]=0;\n }\n c=1;\n function<void(int)>dfs2=[&](int pos){\n already[pos]=1;\n if(T2[pos]==-1) T2[pos]=c;\n c++;\n for(int i=0;i<G[pos].size();i++){\n int nex=G[pos][i];\n if(already[nex]) continue;\n dfs2(nex);\n }\n already[pos]=0;\n c++;\n return;\n };\n dfs2(1);\n for(int i=1;i<=M;i++){\n if(query[i]==2){\n int a=T2[u[i]],b=T2[v[i]];\n if(a>b) swap(a,b);\n int c=seg.query(min(T[u[i]],T[v[i]]),max(T[u[i]],T[v[i]])+1).pos;\n c=T2[c];\n cout<<bit.lower_bound(a,b,c,c-1,k[i])-1000001<<\"\\n\";\n }\n }\n}", "accuracy": 0.5714285714285714, "time_ms": 290, "memory_kb": 153340, "score_of_the_acc": -1.0999, "final_rank": 18 }, { "submission_id": "aoj_0489_10871724", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define ll long long\nconst long long mod=998244353;\nconst long long hmod=46216567629137;\nstruct S{\n int pos;\n int d;\n};\nS e(){\n S res={-1,1000000000};\n return res;\n}\nS op(S a,S b){\n if(a.d<b.d) return a;\n return b;\n}\nclass segtree{\n public:\n S dat[200009];\n int siz;\n segtree(int N){\n siz=1;\n while(siz<N) siz*=2;\n for(int i=1;i<siz*2;i++) dat[i]=e();\n }\n void set(int p,S x){\n p=p+siz-1;\n dat[p]=x;\n while(p>=2){\n p/=2;\n dat[p]=op(dat[p*2],dat[p*2+1]);\n }\n }\n S query(int l,int r,int a,int b,int u){\n if(r<=a || b<=l) return e();\n if(l<=a && b<=r) return dat[u];\n int m=(a+b)/2;\n S L=query(l,r,a,m,u*2);\n S R=query(l,r,m,b,u*2+1);\n return op(L,R);\n }\n S query(int l,int r){\n return query(l,r,1,siz+1,1);\n }\n};\nclass BIT{\n public:\n int dat[2000009];\n vector<pair<int,int>>history[2000009];\n BIT(){\n for(int i=1;i<=2000001;i++){\n dat[i]=0;\n history[i].push_back({-1,0});\n }\n }\n void add(int p,int x,int t){\n while(p<=2000000){\n dat[p]+=x;\n history[p].push_back({t,dat[p]});\n p+=p&-p;\n }\n }\n int lower_bound(int a,int b,int c,int d,int k){\n int x=0;\n int s=1;\n while(s<2000001) s*=2;\n s/=2;\n for(int i=s;i>=1;i/=2){\n if(x+i>2000001) continue;\n int pos=x+i;\n int cnt=0;\n auto iter1=std::lower_bound(history[pos].begin(),history[pos].end(),make_pair(a+1,-100));\n auto iter2=std::lower_bound(history[pos].begin(),history[pos].end(),make_pair(b+1,-100));\n auto iter3=std::lower_bound(history[pos].begin(),history[pos].end(),make_pair(c+1,-100));\n iter1--;iter2--;iter3--;\n cnt+=(*iter1).second+(*iter2).second-(*iter3).second;\n if(d!=0){\n auto iter4=std::lower_bound(history[pos].begin(),history[pos].end(),make_pair(d+1,-100));\n iter4--;\n cnt-=(*iter4).second;\n }\n if(cnt<k){\n k-=cnt;\n x+=i;\n }\n }\n return x+1;\n }\n};\nint main(){\n cin.tie(0)->sync_with_stdio(0);\n cout.tie(0);\n //入力\n int N,M;\n cin>>N>>M;\n ll b[N+1];\n for(int i=1;i<=N;i++){\n cin>>b[i];\n b[i]+=1000001;\n }\n \n int s[N],t[N];\n for(int i=1;i<N;i++) cin>>s[i]>>t[i];\n int query[M+1],u[M+1],w[M+1],v[M+1],k[M+1];\n int nodes=N;\n for(int i=1;i<=M;i++){\n cin>>query[i];\n if(query[i]==1){\n cin>>u[i]>>w[i];\n w[i]+=1000001;\n nodes++;\n }\n if(query[i]==2) cin>>u[i]>>v[i]>>k[i];\n }\n //グラフ作成\n vector<int>G[nodes+1];\n for(int i=1;i<N;i++){\n G[s[i]].push_back(t[i]);\n G[t[i]].push_back(s[i]);\n }\n int c=N+1;\n for(int i=1;i<=M;i++){\n if(query[i]==1){\n G[u[i]].push_back(c);\n G[c].push_back(u[i]);\n c++;\n }\n }\n //costを調整\n int cost[nodes+1];\n for(int i=1;i<=N;i++){\n cost[i]=b[i];\n }\n c=N+1;\n for(int i=1;i<=M;i++){\n if(query[i]==1){\n cost[c]=w[i];\n c++;\n }\n }\n //オイラーツアーを作成+BITに要素を入れる\n BIT bit;\n vector<int>euler_tour;\n bool already[nodes+1];\n int T[nodes+1];\n int dist[nodes+1];\n for(int i=1;i<=nodes;i++){\n already[i]=0;\n T[i]=-1;\n dist[i]=0;\n }\n c=1;\n function<void(int)>dfs=[&](int pos){\n already[pos]=1;\n bit.add(cost[pos],1,c);\n c++;\n euler_tour.push_back(pos);\n for(int i=0;i<G[pos].size();i++){\n int nex=G[pos][i];\n if(already[nex]) continue;\n dist[nex]=dist[pos]+1;\n dfs(nex);\n euler_tour.push_back(pos);\n }\n already[pos]=0;\n bit.add(cost[pos],-1,c);\n c++;\n return;\n };\n dfs(1);\n segtree seg(euler_tour.size());\n for(int i=0;i<euler_tour.size();i++){\n int p=euler_tour[i];\n if(T[p]==-1) T[p]=i+1;\n seg.set(i+1,{p,dist[p]});\n }\n int T2[nodes+1];\n for(int i=1;i<=nodes;i++){\n T2[i]=-1;\n already[i]=0;\n }\n c=1;\n function<void(int)>dfs2=[&](int pos){\n already[pos]=1;\n if(T2[pos]==-1) T2[pos]=c;\n c++;\n for(int i=0;i<G[pos].size();i++){\n int nex=G[pos][i];\n if(already[nex]) continue;\n dfs2(nex);\n }\n already[pos]=0;\n c++;\n return;\n };\n dfs2(1);\n for(int i=1;i<=M;i++){\n if(query[i]==2){\n int a=T2[u[i]],b=T2[v[i]];\n if(a>b) swap(a,b);\n int c=seg.query(min(T[u[i]],T[v[i]]),max(T[u[i]],T[v[i]])+1).pos;\n c=T2[c];\n cout<<bit.lower_bound(a,b,c,c-1,k[i])-1000001<<\"\\n\";\n }\n }\n}", "accuracy": 0.21428571428571427, "time_ms": 70, "memory_kb": 122084, "score_of_the_acc": -0.702, "final_rank": 20 }, { "submission_id": "aoj_0489_10871717", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define ll long long\nconst long long mod=998244353;\nconst long long hmod=46216567629137;\nstruct S{\n int pos;\n int d;\n};\nS e(){\n S res={-1,1000000000};\n return res;\n}\nS op(S a,S b){\n if(a.d<b.d) return a;\n return b;\n}\nclass segtree{\n public:\n S dat[200009];\n int siz;\n segtree(int N){\n siz=1;\n while(siz<N) siz*=2;\n for(int i=1;i<siz*2;i++) dat[i]=e();\n }\n void set(int p,S x){\n p=p+siz-1;\n dat[p]=x;\n while(p>=2){\n p/=2;\n dat[p]=op(dat[p*2],dat[p*2+1]);\n }\n }\n S query(int l,int r,int a,int b,int u){\n if(r<=a || b<=l) return e();\n if(l<=a && b<=r) return dat[u];\n int m=(a+b)/2;\n S L=query(l,r,a,m,u*2);\n S R=query(l,r,m,b,u*2+1);\n return op(L,R);\n }\n S query(int l,int r){\n return query(l,r,1,siz+1,1);\n }\n};\nclass BIT{\n public:\n int dat[2000009];\n vector<pair<int,int>>history[2000009];\n BIT(){\n for(int i=1;i<=2000000;i++){\n dat[i]=0;\n history[i].push_back({-1,0});\n }\n }\n void add(int p,int x,int t){\n while(p<=2000000){\n dat[p]+=x;\n history[p].push_back({t,dat[p]});\n p+=p&-p;\n }\n }\n int lower_bound(int a,int b,int c,int d,int k){\n int x=0;\n int s=1;\n while(s<2000000) s*=2;\n s/=2;\n for(int i=s;i>=1;i/=2){\n if(x+i>2000000) continue;\n int pos=x+i;\n int cnt=0;\n auto iter1=std::lower_bound(history[pos].begin(),history[pos].end(),make_pair(a+1,-100));\n auto iter2=std::lower_bound(history[pos].begin(),history[pos].end(),make_pair(b+1,-100));\n auto iter3=std::lower_bound(history[pos].begin(),history[pos].end(),make_pair(c+1,-100));\n iter1--;iter2--;iter3--;\n cnt+=(*iter1).second+(*iter2).second-(*iter3).second;\n if(d!=0){\n auto iter4=std::lower_bound(history[pos].begin(),history[pos].end(),make_pair(d+1,-100));\n iter4--;\n cnt-=(*iter4).second;\n }\n if(cnt<k){\n k-=cnt;\n x+=i;\n }\n }\n return x+1;\n }\n};\nint main(){\n cin.tie(0)->sync_with_stdio(0);\n cout.tie(0);\n //入力\n int N,M;\n cin>>N>>M;\n ll b[N+1];\n for(int i=1;i<=N;i++){\n cin>>b[i];\n b[i]+=1000001;\n }\n \n int s[N],t[N];\n for(int i=1;i<N;i++) cin>>s[i]>>t[i];\n int query[M+1],u[M+1],w[M+1],v[M+1],k[M+1];\n int nodes=N;\n for(int i=1;i<=M;i++){\n cin>>query[i];\n if(query[i]==1){\n cin>>u[i]>>w[i];\n w[i]+=1000001;\n nodes++;\n }\n if(query[i]==2) cin>>u[i]>>v[i]>>k[i];\n }\n //グラフ作成\n vector<int>G[nodes+1];\n for(int i=1;i<N;i++){\n G[s[i]].push_back(t[i]);\n G[t[i]].push_back(s[i]);\n }\n int c=N+1;\n for(int i=1;i<=M;i++){\n if(query[i]==1){\n G[u[i]].push_back(c);\n G[c].push_back(u[i]);\n c++;\n }\n }\n //costを調整\n int cost[nodes+1];\n for(int i=1;i<=N;i++){\n cost[i]=b[i];\n }\n c=N+1;\n for(int i=1;i<=M;i++){\n if(query[i]==1){\n cost[c]=w[i];\n c++;\n }\n }\n //オイラーツアーを作成+BITに要素を入れる\n BIT bit;\n vector<int>euler_tour;\n bool already[nodes+1];\n int T[nodes+1];\n int dist[nodes+1];\n for(int i=1;i<=nodes;i++){\n already[i]=0;\n T[i]=-1;\n dist[i]=0;\n }\n c=1;\n function<void(int)>dfs=[&](int pos){\n already[pos]=1;\n bit.add(cost[pos],1,c);\n c++;\n euler_tour.push_back(pos);\n for(int i=0;i<G[pos].size();i++){\n int nex=G[pos][i];\n if(already[nex]) continue;\n dist[nex]=dist[pos]+1;\n dfs(nex);\n euler_tour.push_back(pos);\n }\n already[pos]=0;\n bit.add(cost[pos],-1,c);\n c++;\n return;\n };\n dfs(1);\n segtree seg(euler_tour.size());\n for(int i=0;i<euler_tour.size();i++){\n int p=euler_tour[i];\n if(T[p]==-1) T[p]=i+1;\n seg.set(i+1,{p,dist[p]});\n }\n int T2[nodes+1];\n for(int i=1;i<=nodes;i++){\n T2[i]=-1;\n already[i]=0;\n }\n c=1;\n function<void(int)>dfs2=[&](int pos){\n already[pos]=1;\n if(T2[pos]==-1) T2[pos]=c;\n c++;\n for(int i=0;i<G[pos].size();i++){\n int nex=G[pos][i];\n if(already[nex]) continue;\n dfs2(nex);\n }\n already[pos]=0;\n c++;\n return;\n };\n dfs2(1);\n for(int i=1;i<=M;i++){\n if(query[i]==2){\n int a=T2[u[i]],b=T2[v[i]];\n if(a>b) swap(a,b);\n int c=seg.query(min(T[u[i]],T[v[i]]),max(T[u[i]],T[v[i]])+1).pos;\n c=T2[c];\n cout<<bit.lower_bound(a,b,c,c-1,k[i])-1000001<<\"\\n\";\n }\n }\n}", "accuracy": 0.5714285714285714, "time_ms": 290, "memory_kb": 153464, "score_of_the_acc": -1.1008, "final_rank": 19 }, { "submission_id": "aoj_0489_10835614", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n// #include<atcoder/all>\n// using mint = atcoder::modint998244353;\nusing ld = long double;\n#define fi first\n#define se second\n#define all(x) x.begin(),x.end()\n#define rep(i,n) for(int i=0;i<(int)(n);++i)\ntemplate<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}\ntemplate<typename T>bool chmax(T&a,T b){return b>a?(a=b,1):0;}\n\nstruct LCA{\n int N;\n vector<vector<int>> G,parent;\n vector<int> depth;\n LCA(const vector<vector<int>> &G_, int root=0):N(G_.size()), G(G_), depth(G_.size())\n {\n int lg = 0;\n while((1<<lg)+1<N)lg++;\n parent.assign(lg+1, vector<int>(N));\n\n dfs(root,-1,0);\n for(int k=1;k<(int)parent.size();k++)\n {\n for(int i=0;i<N;i++)\n {\n if(parent[k-1][i]==-1)parent[k][i]=-1;\n else parent[k][i]=parent[k-1][parent[k-1][i]];\n }\n }\n\n }\n void dfs(int u, int p, int d)\n {\n depth[u]=d;\n parent[0][u]=p;\n for(int v:G[u]) if(v!=p) dfs(v, u, d+1);\n }\n int lca(int u, int v)\n {\n if(depth[u]>depth[v])swap(u,v);\n for(int k=0;k<(int)parent.size();k++) if((depth[v]-depth[u])>>k&1) v=parent[k][v];\n if(u==v) return u;\n for(int k=parent.size();k--;) if(parent[k][u]!=parent[k][v])\n {\n u=parent[k][u];\n v=parent[k][v];\n }\n return parent[0][u];\n }\n};\n\n\ntemplate <class T> struct fenwick_tree {\n using U = T;\n\n public:\n fenwick_tree() : _n(0) {}\n explicit fenwick_tree(int n) : _n(n), data(n) {}\n\n void add(int p, T x) {\n assert(0 <= p && p < _n);\n p++;\n while (p <= _n) {\n data[p - 1] += U(x);\n p += p & -p;\n }\n }\n\n T sum(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n return sum(r) - sum(l);\n }\n\n private:\n int _n;\n std::vector<U> data;\n\n U sum(int r) {\n U s = 0;\n while (r > 0) {\n s += data[r - 1];\n r -= r & -r;\n }\n return s;\n }\n};\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n \n int N,M;\n cin>>N>>M;\n\n vector<int> B(N);\n rep(i,N)cin>>B[i], B[i]+=1000000;\n vector<vector<int>> G(N);\n rep(i,N-1){\n int a,b;\n cin>>a>>b;\n a--;b--;\n G[a].push_back(b);\n G[b].push_back(a);\n }\n\n vector<array<int,3>> ql;\n while(M--){\n int o;\n cin>>o;\n if(o==1){\n int u,w;\n cin>>u>>w;\n u--;\n w+=1000000;\n G[u].push_back(ssize(G));\n G.push_back({u});\n B.push_back(w);\n }\n else{\n int u,v,k;\n cin>>u>>v>>k;\n u--;v--;\n ql.push_back({u,v,k});\n }\n }\n N=ssize(G);\n int L=ssize(ql);\n \n \n LCA lca(G);\n \n vector<vector<pair<int,int>>> T(N);\n rep(i,L){\n T[ql[i][0]].push_back({i, 1});\n T[ql[i][1]].push_back({i, 1});\n T[lca.lca(ql[i][0], ql[i][1])].push_back({i, -1});\n }\n\n vector<int> ok(L,2000000),ng(L,-1);\n rep(_,22){\n fenwick_tree<int> bit(2000001);\n vector<int> m(L);\n rep(i,L) m[i]=(ok[i]+ng[i])/2;\n\n vector<int> cnt(L,0);\n auto dfs=[&](auto dfs, int v, int p)->void {\n for(auto [qi, s]: T[v]){\n if(s==-1)cnt[qi]+=bit.sum(0, m[qi]+1)*s;\n }\n bit.add(B[v], 1);\n for(auto [qi, s]: T[v]){\n cnt[qi]+=bit.sum(0, m[qi]+1)*s;\n }\n for(int e: G[v]){\n if(e==p) continue;\n dfs(dfs, e, v);\n }\n bit.add(B[v], -1);\n };\n\n dfs(dfs, 0, -1);\n\n rep(i,L){\n if(cnt[i]>=ql[i][2]){\n ok[i]=m[i];\n }\n else{\n ng[i]=m[i];\n }\n }\n }\n rep(i,L)cout<<ok[i]-1000000<<\"\\n\";\n\n\n}", "accuracy": 1, "time_ms": 320, "memory_kb": 50940, "score_of_the_acc": -0.3606, "final_rank": 9 }, { "submission_id": "aoj_0489_10795691", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\nstruct SEG{\nprivate:\n int n;\n vector<int> node;\npublic:\n SEG(int N){\n n = 1;\n while(n < N) n *= 2;\n node.resize(2*n-1);\n }\n void add(int i, int x){\n i += n-1;\n node[i] += x;\n while(i){\n i = (i-1)/2;\n node[i] = node[2*i+1] + node[2*i+2];\n }\n }\n int f(int a, int b, int k = 0, int l = 0, int r = -1){\n if(r < 0) r = n;\n if(a <= l && r <= b) return node[k];\n if(b <= l || r <= a) return 0;\n return (f(a,b,2*k+1,l,(l+r)/2) + f(a,b,2*k+2,(l+r)/2,r));\n }\n};\nsigned main(){\n int N,Q;\n cin>>N>>Q;\n vector<pair<int,int>> S(N);\n vector<tuple<int,int,int,int>> TT = {};\n for(int i=0;i<N;i++){\n cin>>S[i].first;\n S[i].second = i;\n }\n vector<vector<int>> G(N);\n for(int i=0;i<N-1;i++){\n int a,b;\n cin>>a>>b;\n a--;\n b--;\n G[a].push_back(b);\n G[b].push_back(a);\n }\n int ni = 0;\n while(Q--){\n int t;\n cin>>t;\n if(t == 1){\n int a,b;\n cin>>a>>b;\n a--;\n int t = G.size();\n vector<int> z = {};\n G.push_back(z);\n G[t].push_back(a);\n G[a].push_back(t);\n S.push_back({b,t});\n }\n else{\n int a,b,c;\n cin>>a>>b>>c;\n a--;\n b--;\n TT.push_back({a,b,c,ni});\n ni++;\n }\n }\n N = G.size();\n vector<vector<tuple<int,int,int,int,int,int>>> T(N); // uvklri\n for(auto [a,b,c,i]:TT) T[N/2].push_back({a,b,c,0,N,i});\n int n = 18;\n vector<int> in(N), out(N);\n vector<vector<int>> P(n,vector<int>(N,-1));\n vector<int> dist(N);\n int nowd = 0;\n auto f = [&](auto &&self, int a, int p) -> void {\n P[0][a] = p;\n in[a] = nowd;\n nowd++;\n for(int x:G[a])if(x != p){\n dist[x] = dist[a] + 1;\n self(self,x,a);\n }\n out[a] = nowd;\n nowd++;\n };\n f(f,0,-1);\n for(int i=1;i<n;i++)for(int j=0;j<N;j++)if(P[i-1][j] != -1) P[i][j] = P[i-1][P[i-1][j]];\n auto lca = [&](int a, int b) -> int{\n if(dist[a] > dist[b]) swap(a,b);\n int t = dist[b]-dist[a];\n for(int i=0;i<n;i++)if(t&(1<<i)) b = P[i][b];\n if(a == b) return a;\n for(int i=n-1;i>=0;i--)if(P[i][a] != -1 && P[i][a] != P[i][b]){\n a = P[i][a];\n b = P[i][b];\n }\n return P[0][a];\n };\n sort(S.begin(),S.end());\n int an = 0;\n for(int z=0;z<n;z++){\n vector<vector<tuple<int,int,int,int,int,int>>> nT(N);\n SEG seg(2*N+10);\n for(int md=0;md<N;md++){\n for(auto [u,v,k,l,r,i]:T[md]){\n if(!z) an++;\n int p = lca(u,v);\n if(seg.f(0,in[u]+1)+seg.f(0,in[v]+1)-2*seg.f(0,in[p]+1)+seg.f(in[p],in[p]+1) >= k) nT[(l+md)/2].push_back({u,v,k,l,md,i});\n else nT[(md+r)/2].push_back({u,v,k,md,r,i});\n }\n seg.add(in[S[md].second],1);\n seg.add(out[S[md].second],-1);\n }\n T = nT;\n }\n vector<int> Ans(an);\n for(int i=0;i<N;i++)for(auto [u,v,k,l,r,j]:T[i]){\n Ans[j] = S[i].first;\n }\n for(int x:Ans) cout<<x<<endl;\n}", "accuracy": 1, "time_ms": 1260, "memory_kb": 129756, "score_of_the_acc": -1.6538, "final_rank": 15 }, { "submission_id": "aoj_0489_10746268", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug.hpp>\n#else\n#define debug(...)\n#endif\n\nstruct LowestCommonAncestorDoubling {\n vector<vector<int>> dp; // dp[k][v] := 頂点 v の 2^k 先の親の頂点\n vector<int> depth; // depth[v] := 頂点 v の root からの深さ\n int LOG;\n\n LowestCommonAncestorDoubling(const vector<vector<int>>& G, int root = 0) { build(G, root); }\n void build(const vector<vector<int>>& G, int root) {\n int V = G.size();\n LOG = 1;\n while ((1 << LOG) < V) LOG++;\n dp.assign(LOG, vector<int>(V, -1));\n depth.assign(V, -1);\n dfs(G, root, -1, 0); // 2^0 先の親は dfs で求める\n for (int k = 0; k < LOG - 1; k++) {\n for (int i = 0; i < V; i++) {\n if (dp[k][i] == -1) {\n dp[k + 1][i] = dp[k][i];\n } else {\n dp[k + 1][i] = dp[k][dp[k][i]];\n }\n }\n }\n }\n void dfs(const vector<vector<int>>& G, int pos, int parent, int dist) {\n dp[0][pos] = parent;\n depth[pos] = dist;\n for (auto to : G[pos]) {\n if (to == parent) continue;\n dfs(G, to, pos, dist + 1);\n }\n }\n // 頂点 pos の d 個先の親\n int level_ancestor(int pos, int d) {\n if (depth[pos] < d) return -1;\n for (int i = 0; i < LOG; i++) {\n if ((d >> i) & 1) {\n pos = dp[i][pos];\n }\n }\n return pos;\n }\n // u, v の LCA を求める\n int lca(int u, int v) {\n if (depth[u] < depth[v]) swap(u, v); // 頂点 u を深い方にする\n u = level_ancestor(u, depth[u] - depth[v]); // u と v の高さを揃える\n if (u == v) return u;\n // ダブリング上の二分探索\n for (int i = LOG - 1; i >= 0; i--) {\n if (dp[i][u] != dp[i][v]) {\n u = dp[i][u];\n v = dp[i][v];\n }\n }\n return dp[0][u];\n }\n // u - v パスの距離\n int dist(int u, int v) { return depth[u] + depth[v] - 2 * depth[lca(u, v)]; }\n // u - v パス上に x が存在するか\n bool is_on_path(int u, int v, int x) { return dist(u, x) + dist(x, v) == dist(u, v); }\n // u - v パス上の頂点のうち, u からの距離が d の頂点\n int jump(int u, int v, int d) {\n int l = lca(u, v);\n int d1 = depth[u] - depth[l];\n // u - l パス上に x が存在する場合\n if (d <= d1) return level_ancestor(u, d);\n int d2 = d1 + depth[v] - depth[l];\n // l - v パス上に x が存在する場合\n if (d <= d2) return level_ancestor(v, d - d1);\n return -1;\n }\n};\n\ntemplate <class T>\nstruct BinaryIndexedTree {\n int N;\n vector<T> data;\n\n BinaryIndexedTree() = default;\n BinaryIndexedTree(int size) : N(size), data(size + 1, 0) {}\n BinaryIndexedTree(const vector<T>& v) : N(ssize(v)), data(N + 1) {\n for (int i = 1; i <= N; i++) {\n data[i] += v[i - 1];\n int j = i + (i & -i);\n if (j <= N) data[j] += data[i];\n }\n }\n // i 番目に x を加算\n void add(int i, T x) {\n assert(0 <= i && i < N);\n for (++i; i <= N; i += i & -i) data[i] += x;\n }\n // [l, r) に x を加算 (imos 法)\n void imos(int l, int r, T x) { add(l, x), add(r, -x); }\n // [0, i) の和 (imos 法で区間加算して i 番目の値を取るときは sum(i + 1))\n T sum(int i) const {\n if (i < 0) return T{};\n T res{};\n for (; i > 0; i -= i & -i) res += data[i];\n return res;\n }\n // [l, r) の和\n T sum(int l, int r) const { return sum(r) - sum(l); }\n // i 番目の値\n T operator[](int i) const { return sum(i + 1) - sum(i); }\n // [0, i) の和が w 以上となる最小の i\n int lower_bound(T w) const {\n if (w <= 0) return 0;\n int i = 0;\n for (int k = 1 << __lg(N); k > 0; k >>= 1) {\n if (i + k <= N && data[i + k] < w) {\n w -= data[i + k];\n i += k;\n }\n }\n return i + 1;\n }\n};\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N, M;\n cin >> N >> M;\n // 負の値を無くすために offset を加える\n constexpr int offset = 1000000;\n vector<int> B(N);\n for (int i = 0; i < N; i++) cin >> B[i], B[i] += offset;\n // あらかじめクエリを先読みし、最初の文字が 1 のクエリを処理した後の木 G を構築\n vector<vector<int>> G(N + M);\n for (int i = 0; i < N - 1; i++) {\n int u, v;\n cin >> u >> v, u--, v--;\n G[u].emplace_back(v);\n G[v].emplace_back(u);\n }\n // 最初の文字が 2 のクエリの {u, v, k} を格納\n vector<tuple<int, int, int>> query;\n for (int i = 0; i < M; i++) {\n int t;\n cin >> t;\n if (t == 1) {\n int u, w;\n cin >> u >> w, u--, w += offset;\n G[N].emplace_back(u);\n G[u].emplace_back(N);\n B.emplace_back(w);\n N++;\n }\n if (t == 2) {\n int u, v, k;\n cin >> u >> v >> k, u--, v--;\n query.emplace_back(u, v, k);\n }\n }\n M = query.size();\n\n LowestCommonAncestorDoubling lca(G);\n\n // check[i] := 頂点 i がどのクエリを処理するときに使用するか\n // 1 の場合は加算, 0 の場合は減算\n vector<vector<pair<int, int>>> check(N);\n for (int i = 0; i < M; i++) {\n auto [u, v, k] = query[i];\n check[u].emplace_back(i, 1); // out\n check[v].emplace_back(i, 1); // out\n int L = lca.lca(u, v);\n if (L != 0) {\n check[lca.level_ancestor(L, 1)].emplace_back(i, 0); // in\n }\n check[L].emplace_back(i, 0); // in\n }\n\n // 並列二分探索\n // 判定問題: クエリ i の u - v パス内の mid 以下の頂点数が k 以上か\n // 最小値が答え\n vector<int> ok(M, 2 * offset + 1), ng(M, -1);\n while (true) {\n // is_end := 全てのクエリ i\n bool is_end = true;\n for (int i = 0; i < M; i++) {\n if (ok[i] - ng[i] > 1) is_end = false;\n }\n if (is_end) break;\n vector<int> mid(M);\n for (int i = 0; i < M; i++) mid[i] = midpoint(ok[i], ng[i]);\n\n // num[i] := クエリ i の u - v パス内の mid[i] 以下の頂点数\n vector<int> num(M);\n BinaryIndexedTree<int> bit(2 * offset + 1);\n auto dfs = [&](auto&& self, int v, int p) -> void {\n bit.add(B[v], 1);\n for (auto [i, type] : check[v]) {\n if (type == 0) {\n // in\n // mid[i] 以下の頂点を引く\n num[i] -= bit.sum(mid[i] + 1);\n }\n if (type == 1) {\n // out\n // mid[i] 以下の頂点を足す\n num[i] += bit.sum(mid[i] + 1);\n }\n }\n for (auto to : G[v]) {\n if (to == p) continue;\n self(self, to, v);\n }\n bit.add(B[v], -1);\n };\n dfs(dfs, 0, -1);\n for (int i = 0; i < M; i++) {\n auto [u, v, k] = query[i];\n (num[i] >= k ? ok[i] : ng[i]) = mid[i];\n }\n }\n\n for (int i = 0; i < M; i++) {\n cout << ok[i] - offset << '\\n';\n }\n}", "accuracy": 1, "time_ms": 290, "memory_kb": 49564, "score_of_the_acc": -0.3278, "final_rank": 8 }, { "submission_id": "aoj_0489_10746075", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug.hpp>\n#else\n#define debug(...)\n#endif\n\nstruct LowestCommonAncestorDoubling {\n vector<vector<int>> dp; // dp[k][v] := 頂点 v の 2^k 先の親の頂点\n vector<int> depth; // depth[v] := 頂点 v の root からの深さ\n int LOG;\n\n LowestCommonAncestorDoubling(const vector<vector<int>>& G, int root = 0) { build(G, root); }\n void build(const vector<vector<int>>& G, int root) {\n int V = G.size();\n LOG = 1;\n while ((1 << LOG) < V) LOG++;\n dp.assign(LOG, vector<int>(V, -1));\n depth.assign(V, -1);\n dfs(G, root, -1, 0); // 2^0 先の親は dfs で求める\n for (int k = 0; k < LOG - 1; k++) {\n for (int i = 0; i < V; i++) {\n if (dp[k][i] == -1) {\n dp[k + 1][i] = dp[k][i];\n } else {\n dp[k + 1][i] = dp[k][dp[k][i]];\n }\n }\n }\n }\n void dfs(const vector<vector<int>>& G, int pos, int parent, int dist) {\n dp[0][pos] = parent;\n depth[pos] = dist;\n for (auto to : G[pos]) {\n if (to == parent) continue;\n dfs(G, to, pos, dist + 1);\n }\n }\n // 頂点 pos の d 個先の親\n int level_ancestor(int pos, int d) {\n if (depth[pos] < d) return -1;\n for (int i = 0; i < LOG; i++) {\n if ((d >> i) & 1) {\n pos = dp[i][pos];\n }\n }\n return pos;\n }\n // u, v の LCA を求める\n int lca(int u, int v) {\n if (depth[u] < depth[v]) swap(u, v); // 頂点 u を深い方にする\n u = level_ancestor(u, depth[u] - depth[v]); // u と v の高さを揃える\n if (u == v) return u;\n // ダブリング上の二分探索\n for (int i = LOG - 1; i >= 0; i--) {\n if (dp[i][u] != dp[i][v]) {\n u = dp[i][u];\n v = dp[i][v];\n }\n }\n return dp[0][u];\n }\n // u - v パスの距離\n int dist(int u, int v) { return depth[u] + depth[v] - 2 * depth[lca(u, v)]; }\n // u - v パス上に x が存在するか\n bool is_on_path(int u, int v, int x) { return dist(u, x) + dist(x, v) == dist(u, v); }\n // u - v パス上の頂点のうち, u からの距離が d の頂点\n int jump(int u, int v, int d) {\n int l = lca(u, v);\n int d1 = depth[u] - depth[l];\n // u - l パス上に x が存在する場合\n if (d <= d1) return level_ancestor(u, d);\n int d2 = d1 + depth[v] - depth[l];\n // l - v パス上に x が存在する場合\n if (d <= d2) return level_ancestor(v, d - d1);\n return -1;\n }\n};\n\n// ref: https://nyaannyaan.github.io/library/data-structure/hash-map-variable-length.hpp\ntemplate <typename Key, typename Val>\nstruct HashMap {\n using u32 = uint32_t;\n using u64 = uint64_t;\n\n u32 cap, s;\n vector<Key> keys;\n vector<Val> vals;\n vector<bool> flag;\n u64 r;\n u32 shift;\n Val DefaultValue;\n\n static u64 rng() {\n u64 m = chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count();\n m ^= m >> 16;\n m ^= m << 32;\n return m;\n }\n\n void reallocate() {\n cap <<= 1;\n vector<Key> k(cap);\n vector<Val> v(cap);\n vector<bool> f(cap);\n u32 sh = shift - 1;\n for (int i = 0; i < (int)flag.size(); i++) {\n if (flag[i]) {\n u32 hash = (u64(keys[i]) * r) >> sh;\n while (f[hash]) hash = (hash + 1) & (cap - 1);\n k[hash] = keys[i];\n v[hash] = vals[i];\n f[hash] = 1;\n }\n }\n keys.swap(k);\n vals.swap(v);\n flag.swap(f);\n --shift;\n }\n\n explicit HashMap() : cap(8), s(0), keys(cap), vals(cap), flag(cap), r(rng()), shift(64 - __lg(cap)), DefaultValue(Val()) {}\n\n Val& operator[](const Key& i) {\n u32 hash = (u64(i) * r) >> shift;\n while (true) {\n if (!flag[hash]) {\n if (s + s / 4 >= cap) {\n reallocate();\n return (*this)[i];\n }\n keys[hash] = i;\n flag[hash] = 1;\n ++s;\n return vals[hash] = DefaultValue;\n }\n if (keys[hash] == i) return vals[hash];\n hash = (hash + 1) & (cap - 1);\n }\n }\n\n // exist -> return pointer of Val\n // not exist -> return nullptr\n const Val* find(const Key& i) const {\n u32 hash = (u64(i) * r) >> shift;\n while (true) {\n if (!flag[hash]) return nullptr;\n if (keys[hash] == i) return &(vals[hash]);\n hash = (hash + 1) & (cap - 1);\n }\n }\n\n // return vector< pair<const Key&, val& > >\n vector<pair<Key, Val>> enumerate() const {\n vector<pair<Key, Val>> ret;\n for (u32 i = 0; i < cap; ++i)\n if (flag[i]) ret.emplace_back(keys[i], vals[i]);\n return ret;\n }\n\n int size() const { return s; }\n\n // set default_value\n void set_default(const Val& val) { DefaultValue = val; }\n};\n\n/**\n * @brief Hash Map(可変長版)\n * @docs docs/data-structure/hash-map.md\n */\n\ntemplate <class S, class T>\nstruct DynamicBinaryIndexedTree {\n S N;\n HashMap<S, T> data;\n DynamicBinaryIndexedTree() = default;\n DynamicBinaryIndexedTree(S size) : N(size + 1) {}\n\n void add(S i, T x) {\n assert(0 <= i && i < N);\n for (++i; i <= N; i += i & -i) data[i] += x;\n }\n void imos(int l, int r, T x) { add(l, x), add(r, -x); }\n T sum(S i) const {\n if (i <= 0) return T{};\n T res{};\n for (; i > 0; i -= i & -i) {\n // std::unordered_map の場合\n // auto p = data.find(i);\n // res += p != data.end() ? p->second : T{};\n auto p = data.find(i);\n res += p ? *p : T{};\n }\n return res;\n }\n T sum(S l, S r) const { return sum(r) - sum(l); }\n T operator[](S i) const { return sum(i + 1) - sum(i); }\n S lower_bound(T w) {\n if (w <= 0) return 0;\n S i = 0;\n for (S k = S(1) << __lg(N); k > 0; k >>= 1) {\n if (i + k <= N && data[i + k] < w) {\n w -= data[i + k];\n i += k;\n }\n }\n return i + 1;\n }\n};\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N, M;\n cin >> N >> M;\n // 負の値を無くすために offset を加える\n constexpr int offset = 1000000;\n vector<int> B(N);\n for (int i = 0; i < N; i++) cin >> B[i], B[i] += offset;\n // あらかじめクエリを先読みし、最初の文字が 1 のクエリを処理した後の木 G を構築\n vector<vector<int>> G(N + M);\n for (int i = 0; i < N - 1; i++) {\n int u, v;\n cin >> u >> v, u--, v--;\n G[u].emplace_back(v);\n G[v].emplace_back(u);\n }\n // 最初の文字が 2 のクエリの {u, v, k} を格納\n vector<tuple<int, int, int>> query;\n for (int i = 0; i < M; i++) {\n int t;\n cin >> t;\n if (t == 1) {\n int u, w;\n cin >> u >> w, u--, w += offset;\n G[N].emplace_back(u);\n G[u].emplace_back(N);\n B.emplace_back(w);\n N++;\n }\n if (t == 2) {\n int u, v, k;\n cin >> u >> v >> k, u--, v--;\n query.emplace_back(u, v, k);\n }\n }\n M = query.size();\n\n LowestCommonAncestorDoubling lca(G);\n\n // check[i] := 頂点 i がどのクエリを処理するときに使用するか\n // 1 の場合は加算, 0 の場合は減算\n vector<vector<pair<int, int>>> check(N);\n for (int i = 0; i < M; i++) {\n auto [u, v, k] = query[i];\n check[u].emplace_back(i, 1); // out\n check[v].emplace_back(i, 1); // out\n int L = lca.lca(u, v);\n if (L != 0) {\n check[lca.level_ancestor(L, 1)].emplace_back(i, 0); // in\n }\n check[L].emplace_back(i, 0); // in\n }\n\n // 並列二分探索\n // 判定問題: クエリ i の u - v パス内の mid 以下の頂点数が k 以上か\n // 最小値が答え\n vector<int> ok(M, 2 * offset + 1), ng(M, -1);\n while (true) {\n // is_end := 全てのクエリ i\n bool is_end = true;\n for (int i = 0; i < M; i++) {\n if (ok[i] - ng[i] > 1) is_end = false;\n }\n if (is_end) break;\n vector<int> mid(M);\n for (int i = 0; i < M; i++) mid[i] = midpoint(ok[i], ng[i]);\n\n // num[i] := クエリ i の u - v パス内の mid[i] 以下の頂点数\n vector<int> num(M);\n DynamicBinaryIndexedTree<int, int> bit(2 * offset + 1);\n auto dfs = [&](auto&& self, int v, int p) -> void {\n bit.add(B[v], 1);\n for (auto [i, type] : check[v]) {\n if (type == 0) {\n // in\n // mid[i] 以下の頂点を引く\n num[i] -= bit.sum(mid[i] + 1);\n }\n if (type == 1) {\n // out\n // mid[i] 以下の頂点を足す\n num[i] += bit.sum(mid[i] + 1);\n }\n }\n for (auto to : G[v]) {\n if (to == p) continue;\n self(self, to, v);\n }\n bit.add(B[v], -1);\n };\n dfs(dfs, 0, -1);\n for (int i = 0; i < M; i++) {\n auto [u, v, k] = query[i];\n (num[i] >= k ? ok[i] : ng[i]) = mid[i];\n }\n }\n\n for (int i = 0; i < M; i++) {\n cout << ok[i] - offset << '\\n';\n }\n}", "accuracy": 1, "time_ms": 860, "memory_kb": 45200, "score_of_the_acc": -0.7239, "final_rank": 12 }, { "submission_id": "aoj_0489_10745994", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug.hpp>\n#else\n#define debug(...)\n#endif\n\nstruct LowestCommonAncestorDoubling {\n vector<vector<int>> dp; // dp[k][v] := 頂点 v の 2^k 先の親の頂点\n vector<int> depth; // depth[v] := 頂点 v の root からの深さ\n int LOG;\n\n LowestCommonAncestorDoubling(const vector<vector<int>>& G, int root = 0) { build(G, root); }\n void build(const vector<vector<int>>& G, int root) {\n int V = G.size();\n LOG = 1;\n while ((1 << LOG) < V) LOG++;\n dp.assign(LOG, vector<int>(V, -1));\n depth.assign(V, -1);\n dfs(G, root, -1, 0); // 2^0 先の親は dfs で求める\n for (int k = 0; k < LOG - 1; k++) {\n for (int i = 0; i < V; i++) {\n if (dp[k][i] == -1) {\n dp[k + 1][i] = dp[k][i];\n } else {\n dp[k + 1][i] = dp[k][dp[k][i]];\n }\n }\n }\n }\n void dfs(const vector<vector<int>>& G, int pos, int parent, int dist) {\n dp[0][pos] = parent;\n depth[pos] = dist;\n for (auto to : G[pos]) {\n if (to == parent) continue;\n dfs(G, to, pos, dist + 1);\n }\n }\n // 頂点 pos の d 個先の親\n int level_ancestor(int pos, int d) {\n if (depth[pos] < d) return -1;\n for (int i = 0; i < LOG; i++) {\n if ((d >> i) & 1) {\n pos = dp[i][pos];\n }\n }\n return pos;\n }\n // u, v の LCA を求める\n int lca(int u, int v) {\n if (depth[u] < depth[v]) swap(u, v); // 頂点 u を深い方にする\n u = level_ancestor(u, depth[u] - depth[v]); // u と v の高さを揃える\n if (u == v) return u;\n // ダブリング上の二分探索\n for (int i = LOG - 1; i >= 0; i--) {\n if (dp[i][u] != dp[i][v]) {\n u = dp[i][u];\n v = dp[i][v];\n }\n }\n return dp[0][u];\n }\n // u - v パスの距離\n int dist(int u, int v) { return depth[u] + depth[v] - 2 * depth[lca(u, v)]; }\n // u - v パス上に x が存在するか\n bool is_on_path(int u, int v, int x) { return dist(u, x) + dist(x, v) == dist(u, v); }\n // u - v パス上の頂点のうち, u からの距離が d の頂点\n int jump(int u, int v, int d) {\n int l = lca(u, v);\n int d1 = depth[u] - depth[l];\n // u - l パス上に x が存在する場合\n if (d <= d1) return level_ancestor(u, d);\n int d2 = d1 + depth[v] - depth[l];\n // l - v パス上に x が存在する場合\n if (d <= d2) return level_ancestor(v, d - d1);\n return -1;\n }\n};\n\n// ref: https://nyaannyaan.github.io/library/data-structure/hash-map-variable-length.hpp\ntemplate <typename Key, typename Val>\nstruct HashMap {\n using u32 = uint32_t;\n using u64 = uint64_t;\n\n u32 cap, s;\n vector<Key> keys;\n vector<Val> vals;\n vector<bool> flag;\n u64 r;\n u32 shift;\n Val DefaultValue;\n\n static u64 rng() {\n u64 m = chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count();\n m ^= m >> 16;\n m ^= m << 32;\n return m;\n }\n\n void reallocate() {\n cap <<= 1;\n vector<Key> k(cap);\n vector<Val> v(cap);\n vector<bool> f(cap);\n u32 sh = shift - 1;\n for (int i = 0; i < (int)flag.size(); i++) {\n if (flag[i]) {\n u32 hash = (u64(keys[i]) * r) >> sh;\n while (f[hash]) hash = (hash + 1) & (cap - 1);\n k[hash] = keys[i];\n v[hash] = vals[i];\n f[hash] = 1;\n }\n }\n keys.swap(k);\n vals.swap(v);\n flag.swap(f);\n --shift;\n }\n\n explicit HashMap() : cap(8), s(0), keys(cap), vals(cap), flag(cap), r(rng()), shift(64 - __lg(cap)), DefaultValue(Val()) {}\n\n Val& operator[](const Key& i) {\n u32 hash = (u64(i) * r) >> shift;\n while (true) {\n if (!flag[hash]) {\n if (s + s / 4 >= cap) {\n reallocate();\n return (*this)[i];\n }\n keys[hash] = i;\n flag[hash] = 1;\n ++s;\n return vals[hash] = DefaultValue;\n }\n if (keys[hash] == i) return vals[hash];\n hash = (hash + 1) & (cap - 1);\n }\n }\n\n // exist -> return pointer of Val\n // not exist -> return nullptr\n const Val* find(const Key& i) const {\n u32 hash = (u64(i) * r) >> shift;\n while (true) {\n if (!flag[hash]) return nullptr;\n if (keys[hash] == i) return &(vals[hash]);\n hash = (hash + 1) & (cap - 1);\n }\n }\n\n // return vector< pair<const Key&, val& > >\n vector<pair<Key, Val>> enumerate() const {\n vector<pair<Key, Val>> ret;\n for (u32 i = 0; i < cap; ++i)\n if (flag[i]) ret.emplace_back(keys[i], vals[i]);\n return ret;\n }\n\n int size() const { return s; }\n\n // set default_value\n void set_default(const Val& val) { DefaultValue = val; }\n};\n\n/**\n * @brief Hash Map(可変長版)\n * @docs docs/data-structure/hash-map.md\n */\n\ntemplate <class S, class T>\nstruct DynamicBinaryIndexedTree {\n S N;\n HashMap<S, T> data;\n DynamicBinaryIndexedTree() = default;\n DynamicBinaryIndexedTree(S size) : N(size + 1) {}\n\n void add(S i, T x) {\n assert(0 <= i && i < N);\n for (++i; i <= N; i += i & -i) data[i] += x;\n }\n void imos(int l, int r, T x) { add(l, x), add(r, -x); }\n T sum(S i) const {\n if (i <= 0) return T{};\n T res{};\n for (; i > 0; i -= i & -i) {\n // std::unordered_map の場合\n // auto p = data.find(i);\n // res += p != data.end() ? p->second : T{};\n auto p = data.find(i);\n res += p ? *p : T{};\n }\n return res;\n }\n T sum(S l, S r) const { return sum(r) - sum(l); }\n T operator[](S i) const { return sum(i + 1) - sum(i); }\n S lower_bound(T w) {\n if (w <= 0) return 0;\n S i = 0;\n for (S k = S(1) << __lg(N); k > 0; k >>= 1) {\n if (i + k <= N && data[i + k] < w) {\n w -= data[i + k];\n i += k;\n }\n }\n return i + 1;\n }\n};\n\nconstexpr int INF = (1 << 30) - 1;\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N, M;\n cin >> N >> M;\n int offset = 1000000;\n vector<int> B(N);\n for (int i = 0; i < N; i++) cin >> B[i], B[i] += offset;\n vector<vector<int>> G(N + M);\n for (int i = 0; i < N - 1; i++) {\n int u, v;\n cin >> u >> v, u--, v--;\n G[u].emplace_back(v);\n G[v].emplace_back(u);\n }\n vector<tuple<int, int, int>> query;\n for (int i = 0; i < M; i++) {\n int t;\n cin >> t;\n if (t == 1) {\n int u, w;\n cin >> u >> w, u--, w += offset;\n G[N].emplace_back(u);\n G[u].emplace_back(N);\n B.emplace_back(w);\n N++;\n }\n if (t == 2) {\n int u, v, k;\n cin >> u >> v >> k, u--, v--;\n query.emplace_back(u, v, k);\n }\n }\n M = query.size();\n\n LowestCommonAncestorDoubling lca(G);\n\n vector<vector<pair<int, int>>> che(N);\n for (int i = 0; i < M; i++) {\n auto [u, v, k] = query[i];\n che[u].emplace_back(i, 1); // out\n che[v].emplace_back(i, 1); // out\n int L = lca.lca(u, v);\n if (L != 0) {\n che[lca.level_ancestor(L, 1)].emplace_back(i, 0); // in\n }\n che[L].emplace_back(i, 0); // in\n }\n\n // 並列二分探索\n // check(i, mid) : クエリ i の u - v パス内の mid 以下の頂点数が k 以上か\n // 最小値が答え\n vector<int> ok(M, 2 * offset + 1), ng(M, -1);\n while (true) {\n bool is_end = true;\n for (int i = 0; i < M; i++) {\n if (ok[i] - ng[i] > 1) is_end = false;\n }\n if (is_end) break;\n vector<int> mid(M);\n for (int i = 0; i < M; i++) mid[i] = midpoint(ok[i], ng[i]);\n\n // num[i] := クエリ i の u - v パス内の mid[i] 以下の頂点数\n vector<int> num(M);\n // dfs でカウント\n DynamicBinaryIndexedTree<int, int> bit(2 * offset + 1);\n auto dfs = [&](auto&& self, int v, int p) -> void {\n bit.add(B[v], 1);\n for (auto [i, type] : che[v]) {\n if (type == 0) {\n // in\n // mid[i] 以下の頂点を引く\n num[i] -= bit.sum(mid[i] + 1);\n }\n if (type == 1) {\n // out\n // mid[i] 以下の頂点を足す\n num[i] += bit.sum(mid[i] + 1);\n }\n }\n for (auto to : G[v]) {\n if (to == p) continue;\n self(self, to, v);\n }\n bit.add(B[v], -1);\n };\n dfs(dfs, 0, -1);\n for (int i = 0; i < M; i++) {\n auto [u, v, k] = query[i];\n (num[i] >= k ? ok[i] : ng[i]) = mid[i];\n }\n }\n\n for (int i = 0; i < M; i++) {\n cout << ok[i] - offset << '\\n';\n }\n}", "accuracy": 1, "time_ms": 850, "memory_kb": 45200, "score_of_the_acc": -0.7164, "final_rank": 11 }, { "submission_id": "aoj_0489_10745989", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#ifdef LOCAL\n#include <debug.hpp>\n#else\n#define debug(...)\n#endif\n\nstruct LowestCommonAncestorDoubling {\n vector<vector<int>> dp; // dp[k][v] := 頂点 v の 2^k 先の親の頂点\n vector<int> depth; // depth[v] := 頂点 v の root からの深さ\n int LOG;\n\n LowestCommonAncestorDoubling(const vector<vector<int>>& G, int root = 0) { build(G, root); }\n void build(const vector<vector<int>>& G, int root) {\n int V = G.size();\n LOG = 1;\n while ((1 << LOG) < V) LOG++;\n dp.assign(LOG, vector<int>(V, -1));\n depth.assign(V, -1);\n dfs(G, root, -1, 0); // 2^0 先の親は dfs で求める\n for (int k = 0; k < LOG - 1; k++) {\n for (int i = 0; i < V; i++) {\n if (dp[k][i] == -1) {\n dp[k + 1][i] = dp[k][i];\n } else {\n dp[k + 1][i] = dp[k][dp[k][i]];\n }\n }\n }\n }\n void dfs(const vector<vector<int>>& G, int pos, int parent, int dist) {\n dp[0][pos] = parent;\n depth[pos] = dist;\n for (auto to : G[pos]) {\n if (to == parent) continue;\n dfs(G, to, pos, dist + 1);\n }\n }\n // 頂点 pos の d 個先の親\n int level_ancestor(int pos, int d) {\n if (depth[pos] < d) return -1;\n for (int i = 0; i < LOG; i++) {\n if ((d >> i) & 1) {\n pos = dp[i][pos];\n }\n }\n return pos;\n }\n // u, v の LCA を求める\n int lca(int u, int v) {\n if (depth[u] < depth[v]) swap(u, v); // 頂点 u を深い方にする\n u = level_ancestor(u, depth[u] - depth[v]); // u と v の高さを揃える\n if (u == v) return u;\n // ダブリング上の二分探索\n for (int i = LOG - 1; i >= 0; i--) {\n if (dp[i][u] != dp[i][v]) {\n u = dp[i][u];\n v = dp[i][v];\n }\n }\n return dp[0][u];\n }\n // u - v パスの距離\n int dist(int u, int v) { return depth[u] + depth[v] - 2 * depth[lca(u, v)]; }\n // u - v パス上に x が存在するか\n bool is_on_path(int u, int v, int x) { return dist(u, x) + dist(x, v) == dist(u, v); }\n // u - v パス上の頂点のうち, u からの距離が d の頂点\n int jump(int u, int v, int d) {\n int l = lca(u, v);\n int d1 = depth[u] - depth[l];\n // u - l パス上に x が存在する場合\n if (d <= d1) return level_ancestor(u, d);\n int d2 = d1 + depth[v] - depth[l];\n // l - v パス上に x が存在する場合\n if (d <= d2) return level_ancestor(v, d - d1);\n return -1;\n }\n};\n\n// ref: https://nyaannyaan.github.io/library/data-structure/hash-map-variable-length.hpp\ntemplate <typename Key, typename Val>\nstruct HashMap {\n using u32 = uint32_t;\n using u64 = uint64_t;\n\n u32 cap, s;\n vector<Key> keys;\n vector<Val> vals;\n vector<bool> flag;\n u64 r;\n u32 shift;\n Val DefaultValue;\n\n static u64 rng() {\n u64 m = chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count();\n m ^= m >> 16;\n m ^= m << 32;\n return m;\n }\n\n void reallocate() {\n cap <<= 1;\n vector<Key> k(cap);\n vector<Val> v(cap);\n vector<bool> f(cap);\n u32 sh = shift - 1;\n for (int i = 0; i < (int)flag.size(); i++) {\n if (flag[i]) {\n u32 hash = (u64(keys[i]) * r) >> sh;\n while (f[hash]) hash = (hash + 1) & (cap - 1);\n k[hash] = keys[i];\n v[hash] = vals[i];\n f[hash] = 1;\n }\n }\n keys.swap(k);\n vals.swap(v);\n flag.swap(f);\n --shift;\n }\n\n explicit HashMap() : cap(8), s(0), keys(cap), vals(cap), flag(cap), r(rng()), shift(64 - __lg(cap)), DefaultValue(Val()) {}\n\n Val& operator[](const Key& i) {\n u32 hash = (u64(i) * r) >> shift;\n while (true) {\n if (!flag[hash]) {\n if (s + s / 4 >= cap) {\n reallocate();\n return (*this)[i];\n }\n keys[hash] = i;\n flag[hash] = 1;\n ++s;\n return vals[hash] = DefaultValue;\n }\n if (keys[hash] == i) return vals[hash];\n hash = (hash + 1) & (cap - 1);\n }\n }\n\n // exist -> return pointer of Val\n // not exist -> return nullptr\n const Val* find(const Key& i) const {\n u32 hash = (u64(i) * r) >> shift;\n while (true) {\n if (!flag[hash]) return nullptr;\n if (keys[hash] == i) return &(vals[hash]);\n hash = (hash + 1) & (cap - 1);\n }\n }\n\n // return vector< pair<const Key&, val& > >\n vector<pair<Key, Val>> enumerate() const {\n vector<pair<Key, Val>> ret;\n for (u32 i = 0; i < cap; ++i)\n if (flag[i]) ret.emplace_back(keys[i], vals[i]);\n return ret;\n }\n\n int size() const { return s; }\n\n // set default_value\n void set_default(const Val& val) { DefaultValue = val; }\n};\n\n/**\n * @brief Hash Map(可変長版)\n * @docs docs/data-structure/hash-map.md\n */\n\ntemplate <class S, class T>\nstruct DynamicBinaryIndexedTree {\n S N;\n HashMap<S, T> data;\n DynamicBinaryIndexedTree() = default;\n DynamicBinaryIndexedTree(S size) : N(size + 1) {}\n\n void add(S i, T x) {\n assert(0 <= i && i < N);\n for (++i; i <= N; i += i & -i) data[i] += x;\n }\n void imos(int l, int r, T x) { add(l, x), add(r, -x); }\n T sum(S i) const {\n if (i <= 0) return T{};\n T res{};\n for (; i > 0; i -= i & -i) {\n // std::unordered_map の場合\n // auto p = data.find(i);\n // res += p != data.end() ? p->second : T{};\n auto p = data.find(i);\n res += p ? *p : T{};\n }\n return res;\n }\n T sum(S l, S r) const { return sum(r) - sum(l); }\n T operator[](S i) const { return sum(i + 1) - sum(i); }\n S lower_bound(T w) {\n if (w <= 0) return 0;\n S i = 0;\n for (S k = S(1) << __lg(N); k > 0; k >>= 1) {\n if (i + k <= N && data[i + k] < w) {\n w -= data[i + k];\n i += k;\n }\n }\n return i + 1;\n }\n};\n\nconstexpr int INF = (1 << 30) - 1;\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n int N, M;\n cin >> N >> M;\n int offset = 1000000;\n vector<int> B(N);\n for (int i = 0; i < N; i++) cin >> B[i], B[i] += offset;\n vector<vector<int>> G(N);\n for (int i = 0; i < N - 1; i++) {\n int u, v;\n cin >> u >> v, u--, v--;\n G[u].emplace_back(v);\n G[v].emplace_back(u);\n }\n vector<tuple<int, int, int>> query;\n for (int i = 0; i < M; i++) {\n int t;\n cin >> t;\n if (t == 1) {\n int u, w;\n cin >> u >> w, u--, w += offset;\n G.resize(++N);\n G[N - 1].emplace_back(u);\n G[u].emplace_back(N - 1);\n B.emplace_back(w);\n }\n if (t == 2) {\n int u, v, k;\n cin >> u >> v >> k, u--, v--;\n query.emplace_back(u, v, k);\n }\n }\n M = query.size();\n\n LowestCommonAncestorDoubling lca(G);\n\n vector<vector<pair<int, int>>> che(N);\n for (int i = 0; i < M; i++) {\n auto [u, v, k] = query[i];\n che[u].emplace_back(i, 1); // out\n che[v].emplace_back(i, 1); // out\n int L = lca.lca(u, v);\n if (L != 0) {\n che[lca.level_ancestor(L, 1)].emplace_back(i, 0); // in\n }\n che[L].emplace_back(i, 0); // in\n }\n\n // 並列二分探索\n // check(i, mid) : クエリ i の u - v パス内の mid 以下の頂点数が k 以上か\n // 最小値が答え\n vector<int> ok(M, 2 * offset + 1), ng(M, -1);\n while (true) {\n bool is_end = true;\n for (int i = 0; i < M; i++) {\n if (ok[i] - ng[i] > 1) is_end = false;\n }\n if (is_end) break;\n vector<int> mid(M);\n for (int i = 0; i < M; i++) mid[i] = midpoint(ok[i], ng[i]);\n\n // num[i] := クエリ i の u - v パス内の mid[i] 以下の頂点数\n vector<int> num(M);\n // dfs でカウント\n DynamicBinaryIndexedTree<int, int> bit(2 * offset + 1);\n auto dfs = [&](auto&& self, int v, int p) -> void {\n bit.add(B[v], 1);\n for (auto [i, type] : che[v]) {\n if (type == 0) {\n // in\n // mid[i] 以下の頂点を引く\n num[i] -= bit.sum(mid[i] + 1);\n }\n if (type == 1) {\n // out\n // mid[i] 以下の頂点を足す\n num[i] += bit.sum(mid[i] + 1);\n }\n }\n for (auto to : G[v]) {\n if (to == p) continue;\n self(self, to, v);\n }\n bit.add(B[v], -1);\n };\n dfs(dfs, 0, -1);\n for (int i = 0; i < M; i++) {\n auto [u, v, k] = query[i];\n (num[i] >= k ? ok[i] : ng[i]) = mid[i];\n }\n }\n\n for (int i = 0; i < M; i++) {\n cout << ok[i] - offset << '\\n';\n }\n}", "accuracy": 1, "time_ms": 890, "memory_kb": 36024, "score_of_the_acc": -0.6782, "final_rank": 10 }, { "submission_id": "aoj_0489_10232914", "code_snippet": "// AOJ #489 Agrarian Development\n// 2025.2.19\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tif (c == '-') {\tc = gc();\n\t\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\t\treturn -n;\n\t}\n\tdo n = 10*n + (c & 0xf), c = gc(); while (c >= '0');\n\treturn n;\n}\n\nvoid Cout(int n) { // 整数の表示（出力）\n\tchar b[30];\n\tif (!n) pc('0');\n\telse {\n\t\tif (n < 0) pc('-'), n = -n;\n\t\tint i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;\n\t\twhile (i--) pc(b[i]);\n\t}\n\tpc('\\n');\n}\n\nstruct Node { int l, r, cnt; };\n \nvector<Node> seg;\nint segSize = 0;\n \nint buildNullNode(){\n Node n; n.l = 0; n.r = 0; n.cnt = 0;\n seg.push_back(n);\n return segSize++;\n}\n \nint update(int prev, int L, int R, int pos){\n int curr = segSize++;\n seg.push_back(Node());\n seg[curr] = seg[prev];\n seg[curr].cnt = seg[prev].cnt + 1;\n if(L == R) return curr;\n\n int mid = (L + R) >> 1;\n if(pos <= mid){\n int leftChild = update(seg[prev].l, L, mid, pos);\n seg[curr].l = leftChild;\n } else {\n int rightChild = update(seg[prev].r, mid+1, R, pos);\n seg[curr].r = rightChild;\n }\n return curr;\n}\n \nint queryKth(int a, int b, int c, int d, int L, int R, int k){\n if(L == R) return L;\n int mid = (L + R) >> 1;\n int cntLeft = seg[ seg[a].l ].cnt + seg[ seg[b].l ].cnt - seg[ seg[c].l ].cnt - seg[ seg[d].l ].cnt;\n if(k <= cntLeft)\n return queryKth(seg[a].l, seg[b].l, seg[c].l, seg[d].l, L, mid, k);\n return queryKth(seg[a].r, seg[b].r, seg[c].r, seg[d].r, mid+1, R, k - cntLeft);\n}\n \nconst int MAXLOG = 20;\n \nint main() {\n int N = Cin(), M = Cin();\n int totalNodesInitial = N;\n \n vector<int> initBalance(N+1);\n for (int i = 1; i <= N; i++) initBalance[i] = Cin();\n \n vector<vector<int>> graph(N+1);\n for (int i = 1; i <= N-1; i++){\n int s = Cin(), t = Cin();\n graph[s].push_back(t);\n graph[t].push_back(s);\n }\n \n struct Op {\n int type;\n int u;\n int v;\n int k;\n };\n vector<Op> ops;\n ops.reserve(M);\n vector<int> extraBalances;\n for (int i = 0; i < M; i++){\n int t = Cin();\n if(t == 1){\n int u = Cin(), w = Cin();\n Op op; op.type = 1; op.u = u; op.v = w; op.k = 0;\n ops.push_back(op);\n extraBalances.push_back(w);\n } else {\n int u = Cin(), v = Cin(), k = Cin();\n Op op; op.type = 2; op.u = u; op.v = v; op.k = k;\n ops.push_back(op);\n }\n }\n \n int addCount = extraBalances.size();\n int totalNodes = N + addCount;\n \n vector<int> allBalances;\n allBalances.reserve(totalNodes);\n for (int i = 1; i <= N; i++) allBalances.push_back(initBalance[i]);\n for (int w : extraBalances) allBalances.push_back(w);\n sort(allBalances.begin(), allBalances.end());\n allBalances.erase(unique(allBalances.begin(), allBalances.end()), allBalances.end());\n int compSize = allBalances.size();\n \n auto getCompressed = [&](int val) -> int {\n int idx = int(lower_bound(allBalances.begin(), allBalances.end(), val) - allBalances.begin()) + 1;\n return idx;\n };\n \n seg.reserve((totalNodes + 5) * 25);\n segSize = 0;\n int nullRoot = buildNullNode();\n \n vector<int> rt(totalNodes+1, 0);\n vector<int> depth(totalNodes+1, 0);\n vector<int> par(totalNodes+1, 0);\n \n vector<vector<int>> up(MAXLOG, vector<int>(totalNodes+1, 0));\n \n depth[1] = 1;\n par[1] = 0;\n rt[1] = update(nullRoot, 1, compSize, getCompressed(initBalance[1]));\n vector<int> stack; stack.push_back(1);\n while(!stack.empty()){\n int u = stack.back();\n stack.pop_back();\n for (int v : graph[u]){\n if(v == par[u]) continue;\n par[v] = u;\n depth[v] = depth[u] + 1;\n rt[v] = update(rt[u], 1, compSize, getCompressed(initBalance[v]));\n stack.push_back(v);\n }\n }\n \n for (int i = 1; i <= N; i++) up[0][i] = par[i];\n for (int j = 1; j < MAXLOG; j++){\n for (int i = 1; i <= N; i++){\n int prev = up[j-1][i];\n if(prev == 0) up[j][i] = 0;\n else up[j][i] = up[j-1][prev];\n }\n }\n \n int curNodes = N;\n \n auto LCA = [&](int a, int b) -> int {\n if(depth[a] < depth[b]) swap(a, b);\n int d = depth[a] - depth[b];\n for (int i = 0; i < MAXLOG; i++){\n if(d & (1 << i)) a = up[i][a];\n }\n if(a == b) return a;\n for (int i = MAXLOG-1; i >= 0; i--){\n if(up[i][a] != up[i][b]){\n a = up[i][a];\n b = up[i][b];\n }\n }\n return par[a];\n };\n \n for(auto &op : ops){\n if(op.type == 1){\n curNodes++;\n int newNode = curNodes;\n int attach = op.u;\n int newBalance = op.v;\n par[newNode] = attach;\n depth[newNode] = depth[attach] + 1;\n rt[newNode] = update(rt[attach], 1, compSize, getCompressed(newBalance));\n if((int)up[0].size() < curNodes+1){\n for (int i = 0; i < MAXLOG; i++) up[i].resize(curNodes+1, 0);\n }\n up[0][newNode] = attach;\n for (int j = 1; j < MAXLOG; j++){\n int prev = up[j-1][newNode];\n if(prev == 0) up[j][newNode] = 0;\n else up[j][newNode] = up[j-1][prev];\n }\n } else {\n int u = op.u, v = op.v, k = op.k;\n int l = LCA(u, v);\n int parL = par[l];\n int idx = queryKth(rt[u], rt[v], rt[l], (parL == 0 ? nullRoot : rt[parL]), 1, compSize, k);\n int ans = allBalances[idx-1];\n Cout(ans);\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 42672, "score_of_the_acc": -0.1112, "final_rank": 2 }, { "submission_id": "aoj_0489_10232903", "code_snippet": "// AOJ #489 Agrarian Development\n// 2025.2.19\n\n#include <bits/stdc++.h>\nusing namespace std;\n \nstruct Node { int l, r, cnt; };\n \nvector<Node> seg;\nint segSize = 0;\n \nint buildNullNode(){\n Node n; n.l = 0; n.r = 0; n.cnt = 0;\n seg.push_back(n);\n return segSize++;\n}\n \nint update(int prev, int L, int R, int pos){\n int curr = segSize++;\n seg.push_back(Node());\n seg[curr] = seg[prev];\n seg[curr].cnt = seg[prev].cnt + 1;\n if(L == R) return curr;\n\n int mid = (L + R) >> 1;\n if(pos <= mid){\n int leftChild = update(seg[prev].l, L, mid, pos);\n seg[curr].l = leftChild;\n } else {\n int rightChild = update(seg[prev].r, mid+1, R, pos);\n seg[curr].r = rightChild;\n }\n return curr;\n}\n \nint queryKth(int a, int b, int c, int d, int L, int R, int k){\n if(L == R) return L;\n int mid = (L + R) >> 1;\n int cntLeft = seg[ seg[a].l ].cnt + seg[ seg[b].l ].cnt - seg[ seg[c].l ].cnt - seg[ seg[d].l ].cnt;\n if(k <= cntLeft)\n return queryKth(seg[a].l, seg[b].l, seg[c].l, seg[d].l, L, mid, k);\n return queryKth(seg[a].r, seg[b].r, seg[c].r, seg[d].r, mid+1, R, k - cntLeft);\n}\n \nconst int MAXLOG = 20;\n \nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n \n int N, M;\n cin >> N >> M;\n int totalNodesInitial = N;\n \n vector<int> initBalance(N+1);\n for (int i = 1; i <= N; i++) cin >> initBalance[i];\n \n vector<vector<int>> graph(N+1);\n for (int i = 1; i <= N-1; i++){\n int s, t;\n cin >> s >> t;\n graph[s].push_back(t);\n graph[t].push_back(s);\n }\n \n struct Op {\n int type;\n int u;\n int v;\n int k;\n };\n vector<Op> ops;\n ops.reserve(M);\n vector<int> extraBalances;\n for (int i = 0; i < M; i++){\n int t;\n cin >> t;\n if(t == 1){\n int u, w;\n cin >> u >> w;\n Op op; op.type = 1; op.u = u; op.v = w; op.k = 0;\n ops.push_back(op);\n extraBalances.push_back(w);\n } else {\n int u, v, k;\n cin >> u >> v >> k;\n Op op; op.type = 2; op.u = u; op.v = v; op.k = k;\n ops.push_back(op);\n }\n }\n \n int addCount = extraBalances.size();\n int totalNodes = N + addCount;\n \n vector<int> allBalances;\n allBalances.reserve(totalNodes);\n for (int i = 1; i <= N; i++) allBalances.push_back(initBalance[i]);\n for (int w : extraBalances) allBalances.push_back(w);\n sort(allBalances.begin(), allBalances.end());\n allBalances.erase(unique(allBalances.begin(), allBalances.end()), allBalances.end());\n int compSize = allBalances.size();\n \n auto getCompressed = [&](int val) -> int {\n int idx = int(lower_bound(allBalances.begin(), allBalances.end(), val) - allBalances.begin()) + 1;\n return idx;\n };\n \n seg.reserve((totalNodes + 5) * 25);\n segSize = 0;\n int nullRoot = buildNullNode();\n \n vector<int> rt(totalNodes+1, 0);\n vector<int> depth(totalNodes+1, 0);\n vector<int> par(totalNodes+1, 0);\n \n vector<vector<int>> up(MAXLOG, vector<int>(totalNodes+1, 0));\n \n depth[1] = 1;\n par[1] = 0;\n rt[1] = update(nullRoot, 1, compSize, getCompressed(initBalance[1]));\n vector<int> stack; stack.push_back(1);\n while(!stack.empty()){\n int u = stack.back();\n stack.pop_back();\n for (int v : graph[u]){\n if(v == par[u]) continue;\n par[v] = u;\n depth[v] = depth[u] + 1;\n rt[v] = update(rt[u], 1, compSize, getCompressed(initBalance[v]));\n stack.push_back(v);\n }\n }\n \n for (int i = 1; i <= N; i++) up[0][i] = par[i];\n for (int j = 1; j < MAXLOG; j++){\n for (int i = 1; i <= N; i++){\n int prev = up[j-1][i];\n if(prev == 0) up[j][i] = 0;\n else up[j][i] = up[j-1][prev];\n }\n }\n \n int curNodes = N;\n \n auto LCA = [&](int a, int b) -> int {\n if(depth[a] < depth[b]) swap(a, b);\n int d = depth[a] - depth[b];\n for (int i = 0; i < MAXLOG; i++){\n if(d & (1 << i)) a = up[i][a];\n }\n if(a == b) return a;\n for (int i = MAXLOG-1; i >= 0; i--){\n if(up[i][a] != up[i][b]){\n a = up[i][a];\n b = up[i][b];\n }\n }\n return par[a];\n };\n \n for(auto &op : ops){\n if(op.type == 1){\n curNodes++;\n int newNode = curNodes;\n int attach = op.u;\n int newBalance = op.v;\n par[newNode] = attach;\n depth[newNode] = depth[attach] + 1;\n rt[newNode] = update(rt[attach], 1, compSize, getCompressed(newBalance));\n if((int)up[0].size() < curNodes+1){\n for (int i = 0; i < MAXLOG; i++) up[i].resize(curNodes+1, 0);\n }\n up[0][newNode] = attach;\n for (int j = 1; j < MAXLOG; j++){\n int prev = up[j-1][newNode];\n if(prev == 0) up[j][newNode] = 0;\n else up[j][newNode] = up[j-1][prev];\n }\n } else {\n int u = op.u, v = op.v, k = op.k;\n int l = LCA(u, v);\n int parL = par[l];\n int idx = queryKth(rt[u], rt[v], rt[l], (parL == 0 ? nullRoot : rt[parL]), 1, compSize, k);\n int ans = allBalances[idx-1];\n cout << ans << endl;\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 44500, "score_of_the_acc": -0.1999, "final_rank": 5 }, { "submission_id": "aoj_0489_10045783", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nstruct LowestCommonAncestor{\n int n;\n const vector<vector<int> > g;\n vector<vector<int> > table;\n vector<int> depth;\n int logk;\n\n LowestCommonAncestor(const vector<vector<int> > &G) : g(G){\n n = g.size();\n logk = 32 - __builtin_clz(g.size());\n table.assign(logk, vector<int>(n, -1));\n depth.assign(n, -1);\n build();\n }\n\n void build(int s = 0, bool isforest = false){\n if(isforest){\n for(int i = 0; i < n; ++i){\n if(depth[i] == -1){\n dfs(i, -1, 0);\n }\n }\n }else{\n dfs(s, -1, 0);\n }\n for(int k = 0; k < logk - 1; ++k){\n for(int i = 1; i <= n - 1; ++i){\n if(table[k][i] == -1){\n table[k + 1][i] = -1;\n }else{\n table[k + 1][i] = table[k][table[k][i]];\n }\n }\n }\n }\n\n void dfs(int now, int pre, int dep){\n table[0][now] = pre;\n depth[now] = dep;\n for(const auto& to: g[now]){\n if(to != pre){\n dfs(to, now, dep + 1);\n }\n }\n }\n\n int query(int u, int v){\n if(depth[u] < depth[v]) swap(u, v);\n for(int k = logk - 1; k >= 0; --k){\n if(depth[u] - depth[v] & 1 << k){\n u = table[k][u];\n }\n }\n if(u == v) return (u);\n for(int k = logk - 1; k >= 0; --k){\n if(table[k][u] != table[k][v]){\n u = table[k][u];\n v = table[k][v];\n }\n }\n return (table[0][u]);\n }\n\n int dist(int u, int v){\n return (depth[u] + depth[v] - 2 * depth[query(u, v)]);\n }\n};\n\nconst int MAX_LOG = 18;\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n int n, m;\n cin >> n >> m;\n\n vector<int> b(n);\n vector<vector<int> > tree(n);\n\n for (int i = 0; i < n; ++i) {\n cin >> b[i];\n }\n\n vector<tuple<int, int, int> > queries;\n\n for (int i = 0; i < n - 1; ++i) {\n int s, t;\n cin >> s >> t;\n --s, --t;\n tree[s].emplace_back(t);\n tree[t].emplace_back(s);\n }\n\n for (int i = 0; i < m; ++i) {\n int com;\n cin >> com;\n if (com == 1) {\n int u, w;\n cin >> u >> w;\n --u;\n tree[u].emplace_back(tree.size());\n tree.emplace_back(vector{u});\n b.emplace_back(w);\n } else {\n int u, v, k;\n cin >> u >> v >> k;\n --u, --v;\n queries.emplace_back(u, v, k);\n }\n }\n\n int q = queries.size();\n n = tree.size();\n\n LowestCommonAncestor LCA(tree);\n vector<int> lca;\n vector<vector<pair<int, int> > > qi(n);\n\n for (int i = 0; i < q; ++i) {\n auto [u, v, k] = queries[i];\n lca.emplace_back(LCA.query(u, v));\n qi[u].emplace_back(i, 1);\n qi[v].emplace_back(i, 1);\n qi[lca[i]].emplace_back(i, -2);\n }\n\n auto v = b;\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n\n for (auto &&e : b) e = lower_bound(v.begin(), v.end(), e) - v.begin();\n\n vector<int> x(q), cnt(q);\n\n for (int i = MAX_LOG - 1; i >= 0; --i) {\n vector<int> seg(1 << (MAX_LOG - i));\n vector<int> memo(q);\n auto f = [&](auto &&self, int cur, int par) -> void {\n seg[b[cur] >> i]++;\n for (auto [idx, sign] : qi[cur]) {\n memo[idx] += seg[x[idx] >> i] * sign;\n }\n for (auto to : tree[cur]) {\n if (to != par) {\n self(self, to, cur);\n }\n }\n seg[b[cur] >> i]--;\n };\n f(f, 0, -1);\n for (int j = 0; j < q; ++j) {\n memo[j] += (b[lca[j]] >> i) == (x[j] >> i);\n if (cnt[j] + memo[j] < get<2>(queries[j])) {\n x[j] += 1 << i;\n cnt[j] += memo[j];\n }\n }\n }\n\n for (int i = 0; i < q; ++i) {\n cout << v[x[i]] << '\\n';\n }\n\n return (0);\n}", "accuracy": 1, "time_ms": 150, "memory_kb": 39416, "score_of_the_acc": -0.1471, "final_rank": 3 }, { "submission_id": "aoj_0489_10045778", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntemplate <class Func>\nclass FixPoint : Func {\npublic:\n explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}\n\n template <class... Args>\n constexpr decltype(auto) operator()(Args&&... args) const {\n return Func::operator()(*this, std::forward<Args>(args)...);\n }\n};\n\ntemplate <class Func>\nstatic inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {\n return FixPoint<Func>{forward<Func>(f)};\n}\n\nstruct LowestCommonAncestor{\n int n;\n const vector<vector<int> > g;\n vector<vector<int> > table;\n vector<int> depth;\n int logk;\n\n LowestCommonAncestor(const vector<vector<int> > &G) : g(G){\n n = g.size();\n logk = 32 - __builtin_clz(g.size());\n table.assign(logk, vector<int>(n, -1));\n depth.assign(n, -1);\n build();\n }\n\n void build(int s = 0, bool isforest = false){\n if(isforest){\n for(int i = 0; i < n; ++i){\n if(depth[i] == -1){\n dfs(i, -1, 0);\n }\n }\n }else{\n dfs(s, -1, 0);\n }\n for(int k = 0; k < logk - 1; ++k){\n for(int i = 1; i <= n - 1; ++i){\n if(table[k][i] == -1){\n table[k + 1][i] = -1;\n }else{\n table[k + 1][i] = table[k][table[k][i]];\n }\n }\n }\n }\n\n void dfs(int now, int pre, int dep){\n table[0][now] = pre;\n depth[now] = dep;\n for(const auto& to: g[now]){\n if(to != pre){\n dfs(to, now, dep + 1);\n }\n }\n }\n\n int query(int u, int v){\n if(depth[u] < depth[v]) swap(u, v);\n for(int k = logk - 1; k >= 0; --k){\n if(depth[u] - depth[v] & 1 << k){\n u = table[k][u];\n }\n }\n if(u == v) return (u);\n for(int k = logk - 1; k >= 0; --k){\n if(table[k][u] != table[k][v]){\n u = table[k][u];\n v = table[k][v];\n }\n }\n return (table[0][u]);\n }\n\n int dist(int u, int v){\n return (depth[u] + depth[v] - 2 * depth[query(u, v)]);\n }\n};\n\nconst int MAX_LOG = 18;\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n int n, m;\n cin >> n >> m;\n\n vector<int> b(n);\n vector<vector<int> > tree(n);\n\n for (int i = 0; i < n; ++i) {\n cin >> b[i];\n }\n\n vector<tuple<int, int, int> > queries;\n\n for (int i = 0; i < n - 1; ++i) {\n int s, t;\n cin >> s >> t;\n --s, --t;\n tree[s].emplace_back(t);\n tree[t].emplace_back(s);\n }\n\n for (int i = 0; i < m; ++i) {\n int com;\n cin >> com;\n if (com == 1) {\n int u, w;\n cin >> u >> w;\n --u;\n tree[u].emplace_back(tree.size());\n tree.emplace_back(vector{u});\n b.emplace_back(w);\n } else {\n int u, v, k;\n cin >> u >> v >> k;\n --u, --v;\n queries.emplace_back(u, v, k);\n }\n }\n\n int q = queries.size();\n n = tree.size();\n\n LowestCommonAncestor LCA(tree);\n vector<int> lca;\n vector<vector<pair<int, int> > > qi(n);\n\n for (int i = 0; i < q; ++i) {\n auto [u, v, k] = queries[i];\n lca.emplace_back(LCA.query(u, v));\n qi[u].emplace_back(i, 1);\n qi[v].emplace_back(i, 1);\n qi[lca[i]].emplace_back(i, -2);\n }\n\n auto v = b;\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n\n for (auto &&e : b) e = lower_bound(v.begin(), v.end(), e) - v.begin();\n\n vector<int> x(q), cnt(q);\n\n for (int i = MAX_LOG - 1; i >= 0; --i) {\n vector<int> seg(1 << (MAX_LOG - i));\n vector<int> memo(q);\n auto f = [&](auto &&self, int cur, int par) -> void {\n seg[b[cur] >> i]++;\n for (auto [idx, sign] : qi[cur]) {\n memo[idx] += seg[x[idx] >> i] * sign;\n }\n for (auto to : tree[cur]) {\n if (to != par) {\n self(self, to, cur);\n }\n }\n seg[b[cur] >> i]--;\n };\n f(f, 0, -1);\n for (int j = 0; j < q; ++j) {\n memo[j] += (b[lca[j]] >> i) == (x[j] >> i);\n if (cnt[j] + memo[j] < get<2>(queries[j])) {\n x[j] += 1 << i;\n cnt[j] += memo[j];\n }\n }\n }\n\n for (int i = 0; i < q; ++i) {\n cout << v[x[i]] << '\\n';\n }\n\n return (0);\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 39844, "score_of_the_acc": -0.1653, "final_rank": 4 }, { "submission_id": "aoj_0489_10045733", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntemplate <class Func>\nclass FixPoint : Func {\npublic:\n explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}\n\n template <class... Args>\n constexpr decltype(auto) operator()(Args&&... args) const {\n return Func::operator()(*this, std::forward<Args>(args)...);\n }\n};\n\ntemplate <class Func>\nstatic inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {\n return FixPoint<Func>{forward<Func>(f)};\n}\n\nstruct LowestCommonAncestor{\n int n;\n const vector<vector<int> > g;\n vector<vector<int> > table;\n vector<int> depth;\n int logk;\n\n LowestCommonAncestor(const vector<vector<int> > &G) : g(G){\n n = g.size();\n logk = 32 - __builtin_clz(g.size());\n table.assign(logk, vector<int>(n, -1));\n depth.assign(n, -1);\n build();\n }\n\n void build(int s = 0, bool isforest = false){\n if(isforest){\n for(int i = 0; i < n; ++i){\n if(depth[i] == -1){\n dfs(i, -1, 0);\n }\n }\n }else{\n dfs(s, -1, 0);\n }\n for(int k = 0; k < logk - 1; ++k){\n for(int i = 1; i <= n - 1; ++i){\n if(table[k][i] == -1){\n table[k + 1][i] = -1;\n }else{\n table[k + 1][i] = table[k][table[k][i]];\n }\n }\n }\n }\n\n void dfs(int now, int pre, int dep){\n table[0][now] = pre;\n depth[now] = dep;\n for(const auto& to: g[now]){\n if(to != pre){\n dfs(to, now, dep + 1);\n }\n }\n }\n\n int query(int u, int v){\n if(depth[u] < depth[v]) swap(u, v);\n for(int k = logk - 1; k >= 0; --k){\n if(depth[u] - depth[v] & 1 << k){\n u = table[k][u];\n }\n }\n if(u == v) return (u);\n for(int k = logk - 1; k >= 0; --k){\n if(table[k][u] != table[k][v]){\n u = table[k][u];\n v = table[k][v];\n }\n }\n return (table[0][u]);\n }\n\n int dist(int u, int v){\n return (depth[u] + depth[v] - 2 * depth[query(u, v)]);\n }\n};\n\nconst int MAX_LOG = 18;\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n int n, m;\n cin >> n >> m;\n\n vector<int> b(n);\n vector<vector<int> > tree(n);\n\n for (int i = 0; i < n; ++i) {\n cin >> b[i];\n }\n\n vector<tuple<int, int, int> > queries;\n\n for (int i = 0; i < n - 1; ++i) {\n int s, t;\n cin >> s >> t;\n --s, --t;\n tree[s].emplace_back(t);\n tree[t].emplace_back(s);\n }\n\n for (int i = 0; i < m; ++i) {\n int com;\n cin >> com;\n if (com == 1) {\n int u, w;\n cin >> u >> w;\n --u;\n tree[u].emplace_back(tree.size());\n tree.emplace_back(vector{u});\n b.emplace_back(w);\n } else {\n int u, v, k;\n cin >> u >> v >> k;\n --u, --v;\n queries.emplace_back(u, v, k);\n }\n }\n\n int q = queries.size();\n n = tree.size();\n\n LowestCommonAncestor LCA(tree);\n vector<int> lca;\n vector<vector<pair<int, int> > > qi(n);\n\n for (int i = 0; i < q; ++i) {\n auto [u, v, k] = queries[i];\n lca.emplace_back(LCA.query(u, v));\n qi[u].emplace_back(i, 1);\n qi[v].emplace_back(i, 1);\n qi[lca[i]].emplace_back(i, -2);\n }\n\n auto v = b;\n sort(v.begin(), v.end());\n v.erase(unique(v.begin(), v.end()), v.end());\n\n for (auto &&e : b) e = lower_bound(v.begin(), v.end(), e) - v.begin();\n\n vector<int> x(q), cnt(q);\n\n for (int i = MAX_LOG - 1; i >= 0; --i) {\n vector<int> seg(1 << (MAX_LOG - i));\n vector<int> memo(q);\n makeFixPoint([&](auto rec, int cur, int par) -> void {\n seg[b[cur] >> i]++;\n for (auto [idx, sign] : qi[cur]) {\n memo[idx] += seg[x[idx] >> i] * sign;\n }\n for (auto to : tree[cur]) {\n if (to != par) {\n rec(to, cur);\n }\n }\n seg[b[cur] >> i]--;\n }) (0, -1);\n for (int j = 0; j < q; ++j) {\n memo[j] += (b[lca[j]] >> i) == (x[j] >> i);\n if (cnt[j] + memo[j] < get<2>(queries[j])) {\n x[j] += 1 << i;\n cnt[j] += memo[j];\n }\n }\n }\n\n for (int i = 0; i < q; ++i) {\n cout << v[x[i]] << '\\n';\n }\n\n return (0);\n}", "accuracy": 1, "time_ms": 160, "memory_kb": 45772, "score_of_the_acc": -0.2019, "final_rank": 6 }, { "submission_id": "aoj_0489_9905154", "code_snippet": "#pragma region Macros\n#include <bits/stdc++.h>\n\n#include <atcoder/all>\nusing namespace std;\nusing namespace atcoder;\nusing lint = long long;\nusing mint = modint998244353;\nusing ull = unsigned long long;\nusing ld = long double;\nusing int128 = __int128_t;\n#define all(x) (x).begin(), (x).end()\n#define EPS 1e-8\n#define uniqv(v) v.erase(unique(all(v)), v.end())\n#define OVERLOAD_REP(_1, _2, _3, name, ...) name\n#define REP1(i, n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))\n#define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i))\n#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)\n#define log(x) cout << x << endl\n#define logfixed(x) cout << fixed << setprecision(10) << x << endl;\n#define logy(bool) \\\n if (bool) { \\\n cout << \"Yes\" << endl; \\\n } else { \\\n cout << \"No\" << endl; \\\n }\n\nostream &operator<<(ostream &dest, __int128_t value) {\n ostream::sentry s(dest);\n if (s) {\n __uint128_t tmp = value < 0 ? -value : value;\n char buffer[128];\n char *d = end(buffer);\n do {\n --d;\n *d = \"0123456789\"[tmp % 10];\n tmp /= 10;\n } while (tmp != 0);\n if (value < 0) {\n --d;\n *d = '-';\n }\n int len = end(buffer) - d;\n if (dest.rdbuf()->sputn(d, len) != len) {\n dest.setstate(ios_base::badbit);\n }\n }\n return dest;\n}\n\ntemplate <typename T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n for (int i = 0; i < (int)v.size(); i++) {\n os << v[i] << (i + 1 != (int)v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate <typename T>\nostream &operator<<(ostream &os, const set<T> &set_var) {\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end()) os << \" \";\n itr--;\n }\n return os;\n}\n\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << itr->first << \" -> \" << itr->second << \"\\n\";\n }\n return os;\n}\n\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const pair<T, U> &pair_var) {\n os << \"(\" << pair_var.first << \", \" << pair_var.second << \")\";\n return os;\n}\n\nvoid out() { cout << '\\n'; }\ntemplate <class T, class... Ts>\nvoid out(const T &a, const Ts &...b) {\n cout << a;\n (cout << ... << (cout << ' ', b));\n cout << '\\n';\n}\n\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &v) {\n for (T &in : v) is >> in;\n return is;\n}\n\ninline void in(void) { return; }\ntemplate <typename First, typename... Rest>\nvoid in(First &first, Rest &...rest) {\n cin >> first;\n in(rest...);\n return;\n}\n\ntemplate <typename T>\nbool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <typename T>\nbool chmin(T &a, const T &b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\nvector<lint> dx8 = {1, 1, 0, -1, -1, -1, 0, 1};\nvector<lint> dy8 = {0, 1, 1, 1, 0, -1, -1, -1};\nvector<lint> dx4 = {1, 0, -1, 0};\nvector<lint> dy4 = {0, 1, 0, -1};\n\n#pragma endregion\n\nstruct BitVector {\n unsigned sz;\n unsigned blocksize;\n vector<unsigned> bit, sum;\n\n BitVector() {}\n\n BitVector(unsigned siz) {\n sz = siz;\n blocksize = (sz + 31) >> 5;\n bit.assign(blocksize, 0U);\n sum.assign(blocksize, 0U);\n }\n\n inline void set(int k) { bit[k >> 5] |= 1U << (k & 31); }\n\n inline void build() {\n sum[0] = 0U;\n for (int i = 1; i < blocksize; i++) {\n sum[i] = sum[i - 1] + __builtin_popcount(bit[i - 1]);\n }\n }\n\n inline bool access(unsigned k) {\n return (bool((bit[k >> 5] >> (k & 31)) & 1));\n }\n\n inline int rank(int k) {\n return (sum[k >> 5] + __builtin_popcount(bit[k >> 5] & ((1U << (k & 31)) - 1)));\n }\n};\n\ntemplate <class T>\nclass WaveletMatrix {\n private:\n public:\n // コンストラクタ\n WaveletMatrix() {}\n WaveletMatrix(const vector<T> &v) {\n MI = numeric_limits<T>::min();\n MA = numeric_limits<T>::max();\n n = v.size();\n cmp = v;\n sort(cmp.begin(), cmp.end());\n cmp.erase(unique(cmp.begin(), cmp.end()), cmp.end());\n vector<unsigned> compressed(n);\n vector<unsigned> tmpc(n);\n unsigned size_mx = v.size();\n for (unsigned i = 0; i < n; i++) {\n compressed[i] = compress(v[i]);\n }\n bitsize = bit_width(cmp.size());\n b.resize(bitsize);\n zero.assign(bitsize, 0);\n int cur = 0;\n\n for (unsigned i = 0; i < bitsize; i++) {\n b[i] = BitVector(n + 1);\n cur = 0;\n for (unsigned j = 0; j < n; j++) {\n if (compressed[j] & (1U << (bitsize - i - 1))) {\n b[i].set(j);\n } else {\n zero[i]++;\n tmpc[cur] = compressed[j];\n cur++;\n }\n }\n b[i].build();\n\n for (unsigned j = 0; j < n; j++) {\n if (compressed[j] & (1U << (bitsize - i - 1))) {\n tmpc[cur] = compressed[j];\n cur++;\n }\n }\n swap(tmpc, compressed);\n }\n }\n\n // get v[k]\n T access(unsigned k) {\n unsigned res = 0;\n unsigned cur = k;\n for (unsigned i = 0; i < bitsize; i++) {\n if (b[i].access(cur)) {\n res |= (1U << (bitsize - i - 1));\n cur = zero[i] + b[i].rank(cur);\n } else {\n cur -= b[i].rank(cur);\n }\n }\n return cmp[res];\n }\n\n // v[l,r) の中でk番目(1-origin)に小さい値を返す\n T kth_smallest(unsigned l, unsigned r, unsigned k) {\n unsigned res = 0;\n unsigned rank1_l, rank1_r, num0;\n for (unsigned i = 0; i < bitsize; i++) {\n rank1_l = b[i].rank(l);\n rank1_r = b[i].rank(r);\n num0 = r - l - (rank1_r - rank1_l);\n if (num0 < k) {\n res |= (1U << (bitsize - i - 1));\n l = zero[i] + rank1_l;\n r = zero[i] + rank1_r;\n k -= num0;\n } else {\n l -= rank1_l;\n r -= rank1_r;\n }\n }\n return cmp[res];\n }\n\n // v[l,r) の中でk番目(1-origin)に大きい値を返す\n T kth_largest(unsigned l, unsigned r, unsigned k) {\n return kth_smallest(l, r, r - l - k + 1);\n }\n\n // v[l,r) の中で[mink,maxk)に入る値の個数を返す\n unsigned range_freq(int vl, int vr, T mink, T maxk) {\n int D = compress(mink);\n int U = compress(maxk);\n unsigned res = 0;\n auto dfs = [&](auto &rec, int d, int L, int R, int A, int B) -> void {\n if (U <= A or B <= D) return;\n if (D <= A and B <= U) {\n res += (R - L);\n return;\n }\n if (d == bitsize) {\n if (D <= A and A < U) {\n res += (R - L);\n }\n return;\n }\n int C = (A + B) / 2;\n int rank0_l = L - b[d].rank(L);\n int rank0_r = R - b[d].rank(R);\n int rank1_l = b[d].rank(L) + zero[d];\n int rank1_r = b[d].rank(R) + zero[d];\n rec(rec, d + 1, rank0_l, rank0_r, A, C);\n rec(rec, d + 1, rank1_l, rank1_r, C, B);\n };\n dfs(dfs, 0, vl, vr, 0, 1 << bitsize);\n return res;\n }\n\n // v[l,r)の中でvalを超えない最大の値を返す\n T prev_value(unsigned l, unsigned r, T val) {\n int num = range_freq(l, r, MI, val);\n if (num == 0) {\n return MA;\n } else {\n return kth_smallest(l, r, num);\n }\n }\n\n // v[l,r)の中でval以上の最小の値を返す\n T next_value(unsigned l, unsigned r, T val) {\n int num = range_freq(l, r, MI, val);\n if (num == r - l) {\n return MI;\n } else {\n return kth_smallest(l, r, num + 1);\n }\n }\n vector<T> cmp;\n unsigned n;\n unsigned bitsize;\n vector<BitVector> b;\n vector<unsigned> zero;\n T MI, MA;\n\n inline unsigned compress(const T &x) {\n return lower_bound(cmp.begin(), cmp.end(), x) - begin(cmp);\n }\n};\n\ntemplate <typename T>\nclass hld_wavelet {\n private:\n vector<int> subtree, depth, ind, parent, top;\n vector<bool> seen;\n vector<int> hl;\n int n;\n WaveletMatrix<T> wm;\n\n int rec_sub(vector<vector<pair<int, int>>> &g, int cur, int d) {\n int sub = 0;\n for (auto nex : g[cur]) {\n if (seen[nex.first]) continue;\n seen[nex.first] = 1;\n parent[nex.first] = cur;\n sub += rec_sub(g, nex.first, d + 1);\n }\n subtree[cur] = sub + 1;\n depth[cur] = d;\n return subtree[cur];\n }\n\n void rec_hld(vector<vector<pair<int, int>>> &g, int cur) {\n ind[cur] = int(hl.size());\n seen[cur] = 1;\n hl.push_back(cur);\n int sub = 0;\n int idx = -1;\n for (auto nex : g[cur]) {\n if (subtree[nex.first] > sub and !seen[nex.first]) {\n sub = subtree[nex.first];\n idx = nex.first;\n }\n }\n if (idx != -1) {\n top[idx] = top[cur];\n rec_hld(g, idx);\n for (auto nex : g[cur]) {\n if (nex.first != idx and !seen[nex.first]) {\n top[nex.first] = nex.first;\n rec_hld(g, nex.first);\n }\n }\n }\n }\n\n vector<pair<int, int>> decompose(int u, int v) {\n vector<pair<int, int>> res;\n while (top[u] != top[v]) {\n if (depth[top[u]] < depth[top[v]]) swap(u, v);\n res.emplace_back(ind[top[u]], ind[u]);\n u = parent[top[u]];\n }\n if (depth[u] > depth[v]) swap(u, v);\n res.emplace_back(ind[u], ind[v]);\n return res;\n }\n\n public:\n hld_wavelet(vector<vector<pair<int, int>>> &g, const vector<T> &node_values, int root = 0) {\n n = g.size();\n seen.resize(n, 0);\n subtree.resize(n, 0);\n ind.resize(n, 0);\n depth.resize(n, 0);\n top.resize(n, 0);\n parent.resize(n, -1);\n seen[root] = 1;\n rec_sub(g, root, 0);\n for (int i = 0; i < n; i++) seen[i] = 0;\n seen[root] = 1;\n top[root] = root;\n rec_hld(g, root);\n for (int i = 1; i < n; i++) {\n int prev = hl[i - 1];\n int cur = hl[i];\n if (top[prev] != top[cur]) continue;\n }\n\n vector<T> reordered_values(n);\n for (int i = 0; i < n; ++i) {\n reordered_values[i] = node_values[hl[i]];\n }\n wm = WaveletMatrix<T>(reordered_values);\n }\n\n T kth_path(int u, int v, int k) {\n vector<pair<int, int>> segments;\n for (const auto &[s, t] : decompose(u, v)) {\n if (s > t) {\n segments.emplace_back(t, s + 1);\n } else {\n segments.emplace_back(s, t + 1);\n }\n }\n int cnt = 0;\n int p = 0;\n for (int i = 0; i < wm.bitsize; i++) {\n int c = 0;\n for (auto &[l, r] : segments) {\n int l0 = l - wm.b[i].rank(l);\n int r0 = r - wm.b[i].rank(r);\n c += r0 - l0;\n }\n\n if (cnt + c > k) {\n for (auto &&[l, r] : segments) {\n int l0 = l - wm.b[i].rank(l);\n int r0 = r - wm.b[i].rank(r);\n l = l0;\n r = r0;\n }\n } else {\n cnt += c;\n p |= (1 << (wm.bitsize - i - 1));\n\n for (auto &&[l, r] : segments) {\n int l0 = l - wm.b[i].rank(l);\n int r0 = r - wm.b[i].rank(r);\n l += wm.zero[i] - l0;\n r += wm.zero[i] - r0;\n }\n }\n }\n return wm.cmp[p];\n }\n};\n\nint main() {\n cin.tie(0)->sync_with_stdio(0);\n\n int n, m;\n in(n, m);\n vector<int> nodew(n);\n in(nodew);\n\n vector<vector<pair<int, int>>> g(n);\n rep(i, n - 1) {\n int s, t;\n in(s, t);\n s--;\n t--;\n g[s].emplace_back(t, 1);\n g[t].emplace_back(s, 1);\n }\n\n vector<vector<int>> q(m, vector<int>(4));\n rep(i, m) {\n int op, u, v, w, k;\n in(op);\n q[i][0] = op;\n\n if (op == 1) {\n in(u, w);\n u--;\n q[i][1] = u;\n q[i][2] = w;\n nodew.emplace_back(w);\n g.push_back(vector<pair<int, int>>());\n int newid = g.size() - 1;\n g[newid].emplace_back(u, 1);\n g[u].emplace_back(newid, 1);\n } else if (op == 2) {\n in(u, v, k);\n u--;\n v--;\n k--;\n q[i][1] = u;\n q[i][2] = v;\n q[i][3] = k;\n }\n }\n\n hld_wavelet<int> h(g, nodew);\n\n rep(i, m) {\n int op = q[i][0];\n if (op == 2) {\n int u = q[i][1];\n int v = q[i][2];\n int k = q[i][3];\n out(h.kth_path(u, v, k));\n }\n }\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 27732, "score_of_the_acc": -0.0451, "final_rank": 1 }, { "submission_id": "aoj_0489_9659162", "code_snippet": "#include <bits/stdc++.h>\n#include <atcoder/fenwicktree>\nusing namespace atcoder;\nusing namespace std;\nusing ll = long long;\n\nstruct Tree : vector<vector<ll>> {\n using vector<vector<ll>>::operator=;\n\n private:\n void dfs_sz(ll v, ll p) {\n sz[v] = 1;\n ord.emplace_back(v);\n for(ll i = p, x = 0; i != -1;) {\n bl[v][x] = i;\n i = bl[i][x], x++;\n }\n for(auto &nv : (*this)[v]) {\n if(nv == p) {\n if((ll)(*this)[v].size() >= 2 && nv == (*this)[v][0]) { std::swap((*this)[v][0], (*this)[v][1]); }\n else { continue; }\n }\n dp[nv] = dp[v] + 1;\n dfs_sz(nv, v);\n sz[v] += sz[nv];\n if(sz[nv] > sz[(*this)[v][0]]) { std::swap(nv, (*this)[v][0]); }\n }\n }\n void dfs_hld(ll v) {\n down[v] = id++;\n for(auto &nv : (*this)[v]) {\n if(nv == par(v)) { continue; }\n nx[nv] = (nv == (*this)[v][0] ? nx[v] : nv);\n dfs_hld(nv);\n }\n up[v] = id;\n }\n vector<pair<ll, ll>> ascend(ll u, ll v) const {\n vector<pair<ll, ll>> r;\n while(nx[u] != nx[v]) {\n r.emplace_back(down[u], down[nx[u]]);\n u = par(nx[u]);\n }\n if(u != v) { r.emplace_back(down[u], down[v] + 1); }\n return r;\n }\n vector<pair<ll, ll>> descend(ll u, ll v) const {\n if(u == v) { return {}; }\n if(nx[u] == nx[v]) { return {{down[u] + 1, down[v]}}; }\n auto r = descend(u, par(nx[v]));\n r.emplace_back(down[nx[v]], down[v]);\n return r;\n }\n\n public:\n ll n, root, id = 0;\n vector<array<ll, 24>> bl;\n vector<ll> dp, sz, ord, down, up, nx;\n Tree(ll n_, ll r = 0): n(n_), root(r) { this->resize(n); }\n Tree(const vector<vector<ll>> &g, ll r = 0): n(g.size()), root(r) {\n *this = g;\n build();\n }\n void add_edge(ll u, ll v) {\n (*this)[u].emplace_back(v);\n (*this)[v].emplace_back(u);\n }\n void build() {\n bl.resize(n);\n dp.resize(n);\n sz.resize(n);\n down.assign(n, -1);\n up.assign(n, -1);\n nx.assign(n, root);\n for(auto &v : bl) { ranges::fill(v, -1); }\n dfs_sz(root, -1);\n dfs_hld(root);\n }\n ll depth(ll i) const { return dp[i]; }\n ll par(ll i) const { return i == root ? root : bl[i][0]; }\n ll order(ll i) const { return ord[i]; }\n ll in(ll i) const { return down[i]; }\n ll out(ll i) const { return up[i]; }\n ll size(ll i) const { return sz[i]; }\n ll kth_ancestor(ll i, ll k) const {\n if(dp[i] < k) { return -1; }\n while(k) {\n ll t = __builtin_ctz(k);\n i = bl[i][t], k ^= 1 << t;\n }\n return i;\n }\n ll dis(ll u, ll v) { return dp[u] + dp[v] - dp[lca(u, v)] * 2; }\n bool onpath(ll u, ll v, ll x) { return dis(u, v) == dis(u, x) + dis(x, v); }\n ll nxt(ll u, ll v) const {\n if(dp[u] >= dp[v]) { return par(u); }\n ll x = kth_ancestor(v, dp[v] - dp[u] - 1);\n return bl[x][0] == u ? x : bl[u][0];\n }\n vector<ll> path(ll u, ll v) const {\n vector<ll> pre, suf;\n while(dp[u] > dp[v]) {\n pre.emplace_back(u);\n u = bl[u][0];\n }\n while(dp[u] < dp[v]) {\n suf.emplace_back(v);\n v = bl[v][0];\n }\n while(u != v) {\n pre.emplace_back(u);\n suf.emplace_back(v);\n u = bl[u][0];\n v = bl[v][0];\n }\n pre.emplace_back(u);\n ranges::reverse(suf);\n copy(suf.begin(), suf.end(), back_inserter(pre));\n return pre;\n }\n ll lca(ll u, ll v) {\n while(nx[u] != nx[v]) {\n if(down[u] < down[v]) { std::swap(u, v); }\n u = par(nx[u]);\n }\n return dp[u] < dp[v] ? u : v;\n }\n ll jump(ll u, ll v, ll x) {\n ll lc = lca(u, v), d1 = dp[u] - dp[lc];\n if(x <= d1) { return kth_ancestor(u, x); }\n ll d = d1 + dp[v] - dp[lc];\n if(x <= d) { return kth_ancestor(v, d - x); }\n return -1;\n }\n vector<ll> diameter() {\n ll s = ranges::max_element(dp) - dp.begin();\n vector<ll> d(n, -1);\n d[s] = 0;\n queue<ll> q;\n q.emplace(s);\n while(!q.empty()) {\n ll v = q.front();\n q.pop();\n for(auto &nv : (*this)[v]) {\n if(d[nv] == -1) {\n d[nv] = d[v] + 1;\n q.emplace(nv);\n }\n }\n }\n ll t = ranges::max_element(d) - d.begin();\n return path(t, s);\n }\n template<typename F> void query(ll u, ll v, bool vertex, const F &f) {\n ll l = lca(u, v);\n for(auto &&[a, b] : ascend(u, l)) {\n ll s = a + 1, t = b;\n s > t ? f(t, s) : f(s, t);\n }\n if(vertex) f(down[l], down[l] + 1);\n for(auto &&[a, b] : descend(l, v)) {\n ll s = a, t = b + 1;\n s > t ? f(t, s) : f(s, t);\n }\n }\n template<typename F> void noncommutative_query(ll u, ll v, bool vertex, const F &f) {\n ll l = lca(u, v);\n for(auto &&[a, b] : ascend(u, l)) { f(a + 1, b); }\n if(vertex) { f(down[l], down[l] + 1); }\n for(auto &&[a, b] : descend(l, v)) { f(a, b + 1); }\n }\n template<typename F> void subtree_query(ll u, bool vertex, const F &f) {\n f(down[u] + int(!vertex), up[u]);\n }\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n ll N, Q, M = 1000010;\n cin >> N >> Q;\n\n vector<ll> b(N);\n for(auto &i : b) { cin >> i; }\n\n vector<pair<ll, ll>> e(N - 1);\n for(auto &[u, v] : e) {\n cin >> u >> v;\n u--, v--;\n }\n\n vector<tuple<ll, ll, ll>> q;\n while(Q--) {\n ll type;\n cin >> type;\n if(type == 1) {\n ll u, w;\n cin >> u >> w;\n e.emplace_back(N++, --u);\n b.emplace_back(w);\n }\n else {\n ll u, v, k;\n cin >> u >> v >> k;\n q.emplace_back(--u, --v, k);\n }\n }\n\n Tree t(N);\n for(auto &[u, v] : e) { t.add_edge(u, v); }\n t.build();\n\n Q = q.size();\n vector<ll> L(Q, -M), R(Q, M);\n vector<vector<ll>> _ask(2 * M), _add(2 * M);\n auto ask{_ask.begin() + M}, add{_add.begin() + M};\n for(ll i = 0; i < N; i++) { add[b[i]].emplace_back(i); }\n\n while(true) {\n bool fin = true;\n for(ll i = 0; i < Q; i++) {\n if(R[i] - L[i] > 1) {\n ask[(L[i] + R[i]) / 2].emplace_back(i);\n fin = false;\n }\n }\n if(fin) { break; }\n\n fenwick_tree<ll> f(N);\n for(ll Mid = -M; Mid < M; Mid++) {\n while(!ask[Mid].empty()) {\n ll i = ask[Mid].back();\n auto [u, v, k] = q[i];\n ask[Mid].pop_back();\n ll c = 0;\n t.query(u, v, true, [&](ll l, ll r) { c += f.sum(l, r); });\n c >= k ? R[i] = Mid : L[i] = Mid;\n }\n for(auto &i : add[Mid]) { f.add(t.in(i), 1); }\n }\n }\n\n for(auto &i : R) { cout << --i << \"\\n\"; }\n}", "accuracy": 1, "time_ms": 1090, "memory_kb": 162144, "score_of_the_acc": -1.7669, "final_rank": 16 }, { "submission_id": "aoj_0489_9659157", "code_snippet": "#include <bits/stdc++.h>\n\n#include <cassert>\n#include <vector>\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate<class T> using is_signed_int128 = typename std::conditional<std::is_same<T, __int128_t>::value || std::is_same<T, __int128>::value, std::true_type, std::false_type>::type;\ntemplate<class T> using is_unsigned_int128 = typename std::conditional<std::is_same<T, __uint128_t>::value || std::is_same<T, unsigned __int128>::value, std::true_type, std::false_type>::type;\ntemplate<class T> using make_unsigned_int128 = typename std::conditional<std::is_same<T, __int128_t>::value, __uint128_t, unsigned __int128>;\ntemplate<class T> using is_integral = typename std::conditional<std::is_integral<T>::value || is_signed_int128<T>::value || is_unsigned_int128<T>::value, std::true_type, std::false_type>::type;\ntemplate<class T> using is_signed_int = typename std::conditional<(is_integral<T>::value && std::is_signed<T>::value) || is_signed_int128<T>::value, std::true_type, std::false_type>::type;\ntemplate<class T> using is_unsigned_int = typename std::conditional<(is_integral<T>::value && std::is_unsigned<T>::value) || is_unsigned_int128<T>::value, std::true_type, std::false_type>::type;\ntemplate<class T> using to_unsigned = typename std::conditional<is_signed_int128<T>::value, make_unsigned_int128<T>, typename std::conditional<std::is_signed<T>::value, std::make_unsigned<T>, std::common_type<T>>::type>::type;\n\n#else\n\ntemplate<class T> using is_integral = typename std::is_integral<T>;\ntemplate<class T> using is_signed_int = typename std::conditional<is_integral<T>::value && std::is_signed<T>::value, std::true_type, std::false_type>::type;\ntemplate<class T> using is_unsigned_int = typename std::conditional<is_integral<T>::value && std::is_unsigned<T>::value, std::true_type, std::false_type>::type;\ntemplate<class T> using to_unsigned = typename std::conditional<is_signed_int<T>::value, std::make_unsigned<T>, std::common_type<T>>::type;\n\n#endif\n\ntemplate<class T> using is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\ntemplate<class T> using is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\ntemplate<class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n\nnamespace atcoder {\n\ntemplate<class T> struct fenwick_tree {\n using U = internal::to_unsigned_t<T>;\n\n public:\n fenwick_tree(): _n(0) {}\n explicit fenwick_tree(int n): _n(n), data(n) {}\n void add(int p, T x) {\n assert(0 <= p && p < _n);\n p++;\n while(p <= _n) {\n data[p - 1] += U(x);\n p += p & -p;\n }\n }\n T sum(int l, int r) {\n assert(0 <= l && l <= r && r <= _n);\n return sum(r) - sum(l);\n }\n\n private:\n int _n;\n std::vector<U> data;\n U sum(int r) {\n U s = 0;\n while(r > 0) {\n s += data[r - 1];\n r -= r & -r;\n }\n return s;\n }\n};\n\n} // namespace atcoder\n\nusing namespace atcoder;\nusing namespace std;\nusing ll = long long;\n\nstruct Tree : vector<vector<ll>> {\n using vector<vector<ll>>::operator=;\n\n private:\n void dfs_sz(ll v, ll p) {\n sz[v] = 1;\n ord.emplace_back(v);\n for(ll i = p, x = 0; i != -1;) {\n bl[v][x] = i;\n i = bl[i][x], x++;\n }\n for(auto &nv : (*this)[v]) {\n if(nv == p) {\n if((ll)(*this)[v].size() >= 2 && nv == (*this)[v][0]) { std::swap((*this)[v][0], (*this)[v][1]); }\n else { continue; }\n }\n dp[nv] = dp[v] + 1;\n dfs_sz(nv, v);\n sz[v] += sz[nv];\n if(sz[nv] > sz[(*this)[v][0]]) { std::swap(nv, (*this)[v][0]); }\n }\n }\n void dfs_hld(ll v) {\n down[v] = id++;\n for(auto &nv : (*this)[v]) {\n if(nv == par(v)) { continue; }\n nx[nv] = (nv == (*this)[v][0] ? nx[v] : nv);\n dfs_hld(nv);\n }\n up[v] = id;\n }\n vector<pair<ll, ll>> ascend(ll u, ll v) const {\n vector<pair<ll, ll>> r;\n while(nx[u] != nx[v]) {\n r.emplace_back(down[u], down[nx[u]]);\n u = par(nx[u]);\n }\n if(u != v) { r.emplace_back(down[u], down[v] + 1); }\n return r;\n }\n vector<pair<ll, ll>> descend(ll u, ll v) const {\n if(u == v) { return {}; }\n if(nx[u] == nx[v]) { return {{down[u] + 1, down[v]}}; }\n auto r = descend(u, par(nx[v]));\n r.emplace_back(down[nx[v]], down[v]);\n return r;\n }\n\n public:\n ll n, root, id = 0;\n vector<array<ll, 24>> bl;\n vector<ll> dp, sz, ord, down, up, nx;\n Tree(ll n_, ll r = 0): n(n_), root(r) { this->resize(n); }\n Tree(const vector<vector<ll>> &g, ll r = 0): n(g.size()), root(r) {\n *this = g;\n build();\n }\n void add_edge(ll u, ll v) {\n (*this)[u].emplace_back(v);\n (*this)[v].emplace_back(u);\n }\n void build() {\n bl.resize(n);\n dp.resize(n);\n sz.resize(n);\n down.assign(n, -1);\n up.assign(n, -1);\n nx.assign(n, root);\n for(auto &v : bl) { ranges::fill(v, -1); }\n dfs_sz(root, -1);\n dfs_hld(root);\n }\n ll depth(ll i) const { return dp[i]; }\n ll par(ll i) const { return i == root ? root : bl[i][0]; }\n ll order(ll i) const { return ord[i]; }\n ll in(ll i) const { return down[i]; }\n ll out(ll i) const { return up[i]; }\n ll size(ll i) const { return sz[i]; }\n ll kth_ancestor(ll i, ll k) const {\n if(dp[i] < k) { return -1; }\n while(k) {\n ll t = __builtin_ctz(k);\n i = bl[i][t], k ^= 1 << t;\n }\n return i;\n }\n ll dis(ll u, ll v) { return dp[u] + dp[v] - dp[lca(u, v)] * 2; }\n bool onpath(ll u, ll v, ll x) { return dis(u, v) == dis(u, x) + dis(x, v); }\n ll nxt(ll u, ll v) const {\n if(dp[u] >= dp[v]) { return par(u); }\n ll x = kth_ancestor(v, dp[v] - dp[u] - 1);\n return bl[x][0] == u ? x : bl[u][0];\n }\n vector<ll> path(ll u, ll v) const {\n vector<ll> pre, suf;\n while(dp[u] > dp[v]) {\n pre.emplace_back(u);\n u = bl[u][0];\n }\n while(dp[u] < dp[v]) {\n suf.emplace_back(v);\n v = bl[v][0];\n }\n while(u != v) {\n pre.emplace_back(u);\n suf.emplace_back(v);\n u = bl[u][0];\n v = bl[v][0];\n }\n pre.emplace_back(u);\n ranges::reverse(suf);\n copy(suf.begin(), suf.end(), back_inserter(pre));\n return pre;\n }\n ll lca(ll u, ll v) {\n while(nx[u] != nx[v]) {\n if(down[u] < down[v]) { std::swap(u, v); }\n u = par(nx[u]);\n }\n return dp[u] < dp[v] ? u : v;\n }\n ll jump(ll u, ll v, ll x) {\n ll lc = lca(u, v), d1 = dp[u] - dp[lc];\n if(x <= d1) { return kth_ancestor(u, x); }\n ll d = d1 + dp[v] - dp[lc];\n if(x <= d) { return kth_ancestor(v, d - x); }\n return -1;\n }\n vector<ll> diameter() {\n ll s = ranges::max_element(dp) - dp.begin();\n vector<ll> d(n, -1);\n d[s] = 0;\n queue<ll> q;\n q.emplace(s);\n while(!q.empty()) {\n ll v = q.front();\n q.pop();\n for(auto &nv : (*this)[v]) {\n if(d[nv] == -1) {\n d[nv] = d[v] + 1;\n q.emplace(nv);\n }\n }\n }\n ll t = ranges::max_element(d) - d.begin();\n return path(t, s);\n }\n template<typename F> void query(ll u, ll v, bool vertex, const F &f) {\n ll l = lca(u, v);\n for(auto &&[a, b] : ascend(u, l)) {\n ll s = a + 1, t = b;\n s > t ? f(t, s) : f(s, t);\n }\n if(vertex) f(down[l], down[l] + 1);\n for(auto &&[a, b] : descend(l, v)) {\n ll s = a, t = b + 1;\n s > t ? f(t, s) : f(s, t);\n }\n }\n template<typename F> void noncommutative_query(ll u, ll v, bool vertex, const F &f) {\n ll l = lca(u, v);\n for(auto &&[a, b] : ascend(u, l)) { f(a + 1, b); }\n if(vertex) { f(down[l], down[l] + 1); }\n for(auto &&[a, b] : descend(l, v)) { f(a, b + 1); }\n }\n template<typename F> void subtree_query(ll u, bool vertex, const F &f) {\n f(down[u] + int(!vertex), up[u]);\n }\n};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n ll N, Q, M = 1000010;\n cin >> N >> Q;\n\n vector<ll> b(N);\n for(auto &i : b) { cin >> i; }\n\n vector<pair<ll, ll>> e(N - 1);\n for(auto &[u, v] : e) {\n cin >> u >> v;\n u--, v--;\n }\n\n vector<tuple<ll, ll, ll>> q;\n while(Q--) {\n ll type;\n cin >> type;\n if(type == 1) {\n ll u, w;\n cin >> u >> w;\n e.emplace_back(N++, --u);\n b.emplace_back(w);\n }\n else {\n ll u, v, k;\n cin >> u >> v >> k;\n q.emplace_back(--u, --v, k);\n }\n }\n\n Tree t(N);\n for(auto &[u, v] : e) { t.add_edge(u, v); }\n t.build();\n\n Q = q.size();\n vector<ll> L(Q, -M), R(Q, M);\n vector<vector<ll>> _ask(2 * M), _add(2 * M);\n auto ask{_ask.begin() + M}, add{_add.begin() + M};\n for(ll i = 0; i < N; i++) { add[b[i]].emplace_back(i); }\n\n while(true) {\n bool fin = true;\n for(ll i = 0; i < Q; i++) {\n if(R[i] - L[i] > 1) {\n ask[(L[i] + R[i]) / 2].emplace_back(i);\n fin = false;\n }\n }\n if(fin) { break; }\n\n fenwick_tree<ll> f(N);\n for(ll Mid = -M; Mid < M; Mid++) {\n while(!ask[Mid].empty()) {\n ll i = ask[Mid].back();\n auto [u, v, k] = q[i];\n ask[Mid].pop_back();\n ll c = 0;\n t.query(u, v, true, [&](ll l, ll r) { c += f.sum(l, r); });\n c >= k ? R[i] = Mid : L[i] = Mid;\n }\n for(auto &i : add[Mid]) { f.add(t.in(i), 1); }\n }\n }\n\n for(auto &i : R) { cout << --i << \"\\n\"; }\n}", "accuracy": 1, "time_ms": 1090, "memory_kb": 162144, "score_of_the_acc": -1.7669, "final_rank": 16 }, { "submission_id": "aoj_0489_9642586", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct HLD {\n\tvector<vector<long long>> g;\n\tvector<long long> p,s,v,d;\n\tvector<pair<long long,long long>> a,ran;\n\tlong long n;\n\tHLD(vector<vector<long long>> g) : n(g.size()), g(g) {\n\t\tp.resize(n,-2ll);\n\t\ts.resize(n,0ll);\n\t\ta.resize(n);\n\t\td.resize(n,-1ll);\n\t\t{\n\t\t\tp[0ll] = -1ll;\n\t\t\td[0ll] = 0ll;\n\t\t\tqueue<long long> q;\n\t\t\tq.push(0ll);\n\t\t\twhile(!q.empty()){\n\t\t\t\tlong long it = q.front();\n\t\t\t\tq.pop();\n\t\t\t\tfor(long long i : g[it]){\n\t\t\t\t\tif(p[i] != -2ll) continue;\n\t\t\t\t\tp[i] = it;\n\t\t\t\t\td[i] = d[it] + 1ll;\n\t\t\t\t\tq.push(i);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tsiz(0ll);\n\t\tran.push_back({0ll,-1ll});\n\t\tdfs(0ll,0ll);\n\t}\n\tlong long siz(long long x){\n\t\tif(s[x] != 0ll) return s[x];\n\t\ts[x] = 1ll;\n\t\tfor(long long i : g[x]){\n\t\t\tif(i == p[x]) continue;\n\t\t\ts[x] += siz(i);\n\t\t}\n\t\treturn s[x];\n\t}\n\tvoid dfs(long long x,long long r){\n\t\ta[x] = {(long long)v.size(),r};\n\t\tv.push_back(x);\n\t\tlong long ma = -1ll;\n\t\tran.back().second++;\n\t\tfor(long long i : g[x]){\n\t\t\tif(i == p[x]) continue;\n\t\t\tif(ma == -1ll || s[ma] < s[i]){\n\t\t\t\tma = i;\n\t\t\t}\n\t\t}\n\t\tif(ma == -1ll) return;\n\t\tdfs(ma,r);\n\t\tfor(long long i : g[x]){\n\t\t\tif(i == p[x] || i == ma) continue;\n\t\t\tran.push_back({v.size(),v.size() - 1ll});\n\t\t\tdfs(i,i);\n\t\t}\n\t}\n\tvector<pair<long long,long long>> get(long long u,long long v){\n\t\tvector<pair<long long,long long>> res;\n\t\twhile(a[u].second != a[v].second){\n\t\t\tif(d[a[u].second] <= d[a[v].second]){\n\t\t\t\tres.push_back({a[a[v].second].first,a[v].first});\n\t\t\t\tv = p[a[v].second];\n\t\t\t}else{\n\t\t\t\tres.push_back({a[a[u].second].first,a[u].first});\n\t\t\t\tu = p[a[u].second];\n\t\t\t}\n\t\t}\n\t\tres.push_back({min(a[u].first,a[v].first),max(a[u].first,a[v].first)});\n\t\treturn res;\n\t}\n\tlong long operator[](long long x){\n\t\treturn a[x].first;\n\t}\n\tlong long lca(long long u,long long v){\n\t\treturn this->v[get(u,v).back().first];\n\t}\n\tlong long depth(long long x){\n\t\treturn d[x];\n\t}\n\tlong long size(){\n\t\treturn ran.size();\n\t}\n\tlong long dist(long long u,long long v){\n\t\tlong long lc = lca(u,v);\n\t\treturn depth(u) + depth(v) - depth(lc) * 2ll;\n\t}\n};\ntemplate <typename T>\nstruct segtree {\n long long n, size, log;\n vector<T> d;\n\tfunction<T(T,T)> op;\n\tfunction<T()> e;\n explicit segtree(long long n,function<T(T,T)> op,function<T()> e) : segtree(vector<T>(n, e()),op,e) {}\n explicit segtree(const vector<T>& v,function<T(T,T)> op,function<T()> e) : n((long long)(v.size())),op(op),e(e) {\n\t\tsize = 1ll;\n\t\twhile(size < (unsigned long long)(n)) size *= 2ll;\n\t\tlog = 0ll;\n\t\twhile(!(size & (1ll << log))) log++;\n d = vector<T>(2ll * size, e());\n for (long long i = 0ll; i < n; i++) d[size + i] = v[i];\n for (long long i = size - 1ll; i >= 1ll; i--) {\n\t\t\td[i] = op(d[2ll * i],d[2ll * i + 1ll]);\n }\n }\n\n void set(long long p, T x) {\n p += size;\n d[p] = x;\n for (long long i = 1ll; i <= log; i++){\n\t\t\td[p >> i] = op(d[(p >> i) * 2ll],d[(p >> i) * 2ll + 1ll]);\n\t\t}\n }\n\n T operator[](long long p) const {\n return d[p + size];\n }\n\n T operator()(long long l, long long r) const {\n T left = e(), right = e();\n\t\tfor(l += size,r += size;l < r;l >>= 1ll,r >>= 1ll){\n\t\t\tif(l & 1ll) left = op(left,d[l++]); \n\t\t\tif(r & 1ll) right = op(d[--r],right);\n\t\t}\n return op(left, right);\n }\n};\nint main(){\n\tlong long n,m;\n\tcin >> n >> m;\n\tvector<long long> b(n);\n\tfor(long long i = 0ll;i < n;i++){\n\t\tcin >> b[i];\n\t}\n\tvector<vector<long long>> g(n,vector<long long>());\n\tfor(long long i = 0ll;i < n - 1ll;i++){\n\t\tlong long u,v;\n\t\tcin >> u >> v;\n\t\tu--;v--;\n\t\tg[u].push_back(v);\n\t\tg[v].push_back(u);\n\t}\n\tvector<vector<long long>> w;\n\tfor(long long i = 0ll;i < m;i++){\n\t\tlong long x;\n\t\tcin >> x;\n\t\tif(x == 1ll){\n\t\t\tlong long u,y;\n\t\t\tcin >> u >> y;\n\t\t\tu--;\n\t\t\tg.push_back({});\n\t\t\tb.push_back(y);\n\t\t\tg[u].push_back(n);\n\t\t\tg[n].push_back(u);\n\t\t\tn++;\n\t\t}else{\n\t\t\tlong long u,v,k;\n\t\t\tcin >> u >> v >> k;\n\t\t\tu--;v--;\n\t\t\tw.push_back({u,v,k});\n\t\t}\n\t}\n\tm = w.size();\n\tHLD hld(g);\n\tvector<pair<long long,long long>> ans(m,pair<long long,long long>(0ll,n - 1ll));\n\tvector<long long> p(n);\n\tiota(p.begin(),p.end(),0ll);\n\tsort(p.begin(),p.end(),[&](long long x,long long y){return b[x] < b[y];});\n\tfor(long long i = 0ll;i < 20ll;i++){\n\t\tvector<pair<long long,long long>> t;\n\t\tfor(long long j = 0ll;j < m;j++){\n\t\t\tt.push_back({(ans[j].first + ans[j].second) / 2ll,j});\n\t\t}\n\t\tsort(t.begin(),t.end());\n\t\tsegtree<long long> seg(n,[](long long a,long long b){return a + b;},[](){return 0ll;});\n\t\tlong long now = 0ll;\n\t\tfor(long long j = 0ll;j < n;j++){\n\t\t\tlong long pos = hld[p[j]];\n\t\t\tseg.set(pos,1ll);\n\t\t\twhile(now < m && t[now].first == j){\n\t\t\t\tlong long cou = 0ll;\n\t\t\t\tvector<pair<long long,long long>> r = hld.get(w[t[now].second][0ll],w[t[now].second][1ll]);\n\t\t\t\tfor(pair<long long,long long> ran : r){\n\t\t\t\t\tcou += seg(ran.first,ran.second + 1ll);\n\t\t\t\t}\n\t\t\t\tif(cou < w[t[now].second][2ll]){\n\t\t\t\t\tans[t[now].second].first = t[now].first + 1ll;\n\t\t\t\t}else{\n\t\t\t\t\tans[t[now].second].second = t[now].first;\n\t\t\t\t}\n\t\t\t\tnow++;\n\t\t\t}\n\t\t}\n\t}\n\tfor(long long i = 0ll;i < m;i++){\n\t\tlong long it = b[p[ans[i].first]];\n\t\tcout << it << endl;\n\t}\n}", "accuracy": 1, "time_ms": 1270, "memory_kb": 41024, "score_of_the_acc": -1.0011, "final_rank": 13 }, { "submission_id": "aoj_0489_9632864", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nstruct segtree{\n int n;\n vector<int> node;\n segtree(int N){\n n = 1;\n while(n<N) n*=2;\n node.resize(n*2-1,0);\n }\n void update(int a,int x){\n int i = a+n-1;\n node[i] = x;\n while(i>0){\n i = (i-1)/2;\n node[i] = node[i*2+1]+node[i*2+2];\n }\n }\n int find(int a,int b,int k=0,int l=0,int r=-1){\n if(r<0) r = n;\n if(b<=l||r<=a) return 0;\n if(a<=l&&r<=b) return node[k];\n int vl = find(a,b,2*k+1,l,(l+r)/2);\n int vr = find(a,b,2*k+2,(l+r)/2,r);\n return vl+vr;\n }\n};\nint main() {\n int N,M;\n cin >> N >> M;\n vector<int> B(N);\n for(int i=0;i<N;i++) cin >> B[i];\n vector<vector<int>> G(N);\n for(int i=0;i<N-1;i++){\n int u,v;\n cin >> u >> v;\n u--;\n v--;\n G[u].push_back(v);\n G[v].push_back(u);\n }\n vector<int> F,T,K;\n for(int i=0;i<M;i++){\n int n;\n cin >> n;\n if(n==1){\n int u,t;\n cin >> u >> t;\n u--;\n G.push_back({});\n G[N].push_back(u);\n G[u].push_back(N);\n B.push_back(t);\n N++;\n }else{\n int u,v,k;\n cin >> u >> v >> k;\n u--;\n v--;\n F.push_back(u);\n T.push_back(v);\n K.push_back(k);\n }\n }\n vector<int> parent(N);\n vector<int> depth(N);\n vector<int> in(N);\n vector<int> out(N);\n depth[0] = 0;\n int num = 0;\n auto dfs = [&](auto dfs,int u,int p,int k)->int{\n in[u] = k++;\n for(auto v:G[u]){\n if(v==p) continue;\n parent[v] = u;\n depth[v] = depth[u]+1;\n k = dfs(dfs,v,u,k);\n }\n out[u] = k++;\n return k;\n };\n dfs(dfs,0,-1,0);\n vector<int> horder(N);\n iota(horder.begin(),horder.end(),0);\n sort(horder.begin(),horder.end(),[&](int a,int b){\n return B[a]<B[b];\n });\n vector<vector<int>> table(20, vector(N, 0));\n table[0] = parent;\n for (int d = 0; d < 19; ++d) {\n for (int i = 0; i < N; ++i) {\n if (table[d][i] == -1) table[d + 1][i] = -1;\n else table[d + 1][i] = table[d][table[d][i]];\n }\n }\n auto calcLCA = [&](int a, int b) {\n if (depth[a] > depth[b]) swap(a, b);\n for (int w = 19; w >= 0; --w) {\n const int o = table[w][b];\n if (o == -1) continue;\n if (depth[o] >= depth[a]) b = o;\n }\n assert(depth[a] == depth[b]);\n if (a == b) return a;\n for (int w = 19; w >= 0; --w) {\n const int na = table[w][a], nb = table[w][b];\n if (na != nb) {\n a = na;\n b = nb;\n }\n }\n return parent[a];\n };\n int Q = F.size();\n vector<int> ok(Q,N-1),ng(Q,-1);\n for(int t=0;t<20;t++){\n segtree seg(2*N);\n vector<int> mid(Q);\n for(int i=0;i<Q;i++){\n if(ok[i]-ng[i]<=1) mid[i] = -1;\n else mid[i] = (ok[i]+ng[i])/2;\n }\n vector<vector<int>> q(N);\n for(int i=0;i<Q;i++){\n if(mid[i]==-1) continue;\n q[mid[i]].push_back(i);\n }\n for(int i=0;i<N;i++){\n int v = horder[i];\n seg.update(in[v],1);\n seg.update(out[v],-1);\n for(auto j:q[i]){\n int val = seg.find(0,in[F[j]]+1)+seg.find(0,in[T[j]]+1)-seg.find(0,in[calcLCA(F[j],T[j])]+1)-seg.find(0,in[calcLCA(F[j],T[j])]);\n if(val>=K[j]){\n ok[j] = mid[j];\n }else{\n ng[j] = mid[j];\n }\n }\n }\n }\n for(int i=0;i<Q;i++){\n cout << B[horder[ok[i]]] << endl;\n }\n}", "accuracy": 1, "time_ms": 1400, "memory_kb": 38592, "score_of_the_acc": -1.0808, "final_rank": 14 }, { "submission_id": "aoj_0489_9601125", "code_snippet": "#include<iostream>\n#include<cstdio>\n#include<string>\n#include<cmath>\n#include<algorithm>\n#include<map>\n#include<vector>\n#include<set>\n#include<cassert>\nusing namespace std;\n\ntemplate<class T>\nvoid prt(T a) { cout << a << \"\\n\"; }\n#define all(a) a.begin(),a.end()\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n\nusing llong = long long;\ntemplate <typename T>\nbool chmin(T& a, T b) {\n\tif (a <= b)return false;\n\ta = b;\n\treturn true;\n}\ntemplate <typename T>\nbool chmax(T& a, T b) {\n\tif (a >= b)return false;\n\ta = b;\n\treturn true;\n}\n\ntemplate<typename T>\nclass BIT {\npublic:\n\tint n;\n\tvector<T> dat;\n\tBIT(int n_) :n(n_ + 1), dat(n, 0) {};\n\n\tvoid add(int i, T x) {\n\t\tfor (int idx = i; idx < n; idx += (idx & -idx))dat[idx] += x;\n\t}\n\t//[1,i]\n\tT sum(int i) {\n\t\tT s(0);\n\t\tfor (int idx = i; idx > 0; idx -= (idx & -idx))s += dat[idx];\n\t\treturn s;\n\t}\n};\n\nint main() {\n\tint n, m;\n\tcin >> n >> m;\n\tvector<int> b(n);\n\trep(i, n)scanf(\"%d\", &b[i]);\n\tvector<vector<int>> g(n);\n\trep(i, n-1) {\n\t\tint s, t;\n\t\tscanf(\"%d %d\", &s, &t);\n\t\ts--; t--;\n\t\tg[s].push_back(t);\n\t\tg[t].push_back(s);\n\t}\n\tusing T = tuple<int, int, int>;\n\tvector<T>que;\n\trep(i, m) {\n\t\tint f;\n\t\tscanf(\"%d\", &f);\n\t\tif (f == 1) {\n\t\t\tint u, v;\n\t\t\tscanf(\"%d %d\", &u, &v);\n\t\t\tg.emplace_back();\n\t\t\tu--;\n\t\t\tg.back().emplace_back(u);\n\t\t\tg[u].emplace_back(g.size() - 1);\n\t\t\tb.emplace_back(v);\n\t\t}\n\t\telse {\n\t\t\tint u, v, k;\n\t\t\tscanf(\"%d %d %d\", &u, &v, &k);\n\t\t\tu--; v--;\n\t\t\tque.emplace_back(u, v, k);\n\t\t}\n\t}\n\tvector<int> zaa;\n\tn = b.size();\n\tm = que.size();\n\trep(i, n)zaa.push_back(b[i]);\n\tsort(all(zaa));\n\tzaa.erase(unique(all(zaa)), zaa.end());\n\trep(i, n)b[i] = lower_bound(all(zaa), b[i]) - zaa.begin();\n\n\n\tvector<vector<int>> doub(24, vector<int>(n, 0));\n\tvector<int> h(n,0);\n\tauto f1 = [&](auto f1, int v, int p)->void {\n\t\tif (p != -1) {\n\t\t\tdoub[0][v] = p;\n\t\t\th[v] = h[p] + 1;\n\t\t}\n\t\telse doub[0][v] = v;\n\t\tfor (auto i : g[v]) {\n\t\t\tif (i == p)continue;\n\t\t\tf1(f1, i, v);\n\t\t}\n\t};\n\tf1(f1, 0, -1);\n\n\trep(i, 23) {\n\t\trep(j, n) {\n\t\t\tdoub[i + 1][j] = doub[i][doub[i][j]];\n\t\t}\n\t}\n\n\tauto lca = [&](int a, int b) {\n\t\tif (h[a] < h[b])swap(a, b);\n\t\t//aの方が深い\n\t\tint sa = h[a] - h[b];\n\t\trep(i, 24) {\n\t\t\tif (sa & 1)a = doub[i][a];\n\t\t\tsa >>= 1;\n\t\t}\n\t\tif (a == b)return a;\n\n\t\tfor (int i = 23; i >= 0; i--) {\n\t\t\tif (doub[i][a] != doub[i][b]) {\n\t\t\t\ta = doub[i][a];\n\t\t\t\tb = doub[i][b];\n\t\t\t}\n\t\t}\n\t\tassert(doub[0][a] == doub[0][b]);\n\t\treturn doub[0][a];\n\t};\n\n\tvector<vector<int>> che(n);\n\tvector<int> ks(m);\n\trep(i, m) {\n\t\tauto [u, v, k] = que[i];\n\t\tche[u].emplace_back(i);\n\t\tche[v].emplace_back(i);\n\t\tint lc = lca(u, v);\n\t\tif (lc != 0) {\n\t\t\tche[doub[0][lc]].push_back(i + m);\n\t\t}\n\t\tche[lc].push_back(i + m);\n\t\tks[i] = k;\n\t}\n\n\t//にぶたんの準備\n\tvector<int> oks(m,zaa.size()), ngs(m,-1);\n\t//f(x)=x以下の値がk[i]個以上あるか\n\twhile (true) {\n\t\t//続けるかの判定\n\t\tbool isbre = true;\n\t/*\trep(i, m) {\n\t\t\tcout << oks[i] << \":\" << ngs[i] << \" \";\n\t\t}\n\t\tprt(\"\");*/\n\t\trep(i, m)if (abs(oks[i] - ngs[i]) != 1)isbre = false;\n\t\tif (isbre)break;\n\n\n\t\tvector<int> mids(m);\n\t\trep(i, m)mids[i] = (oks[i] + ngs[i]) / 2;\n\n\t\t/*for (auto i : mids)cout << i << \" \";\n\t\tprt(\"\");*/\n\t\tvector<int> num(m,0);\n\t\t//それぞれのクエリでの区間内のmids[i]以下の値の個数\n\n\t\tauto f = [&](auto f, int v, int p, BIT<int>& bi)->void {\n\t\t\tbi.add(b[v]+1, 1);\n\t\t\tfor (auto i : che[v]) {\n\t\t\t\tif (i >= m) {\n\t\t\t\t\tnum[i - m] -= bi.sum(mids[i-m] + 1);\n\t\t\t\t//\tcout << v << \"でnum\" << i - m << \":\" << -bi.sum(mids[i - m] + 1)<<\"\\n\";\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tnum[i] += bi.sum(mids[i] + 1);\n\t\t\t\t\t//cout << v << \"でnum\" << i << \":\" << bi.sum(mids[i] + 1)<<\"\\n\";\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (auto i : g[v]) {\n\t\t\t\tif (i == p)continue;\n\t\t\t\tf(f, i, v, bi);\n\t\t\t}\n\t\t\tbi.add(b[v] + 1, -1);\n\t\t};\n\t\tBIT<int> bi(zaa.size());\n\t\tf(f, 0, -1, bi);\n\t/*\tfor (auto i : num)cout << i << \" \";\n\t\tprt(\"\");*/\n\t\trep(i, m) {\n\t\t\tif (num[i] >= ks[i])oks[i] = mids[i];\n\t\t\telse ngs[i] = mids[i];\n\t\t}\n\t}\n\trep(i, m) {\n\t\tprt(zaa[oks[i]]);\n\t}\n}\n\n/*\n小さい方からk番目⇔自分以下の値がk個以上あるような物の中で最小\n木の経路上に、「wがx以上のやつが何個あるか」が分かればいい\n→自分の先祖にwがx以上のやつが何個あるか　が分かればいい\n→座圧して上からBITで集めていけばいい\n→並列にぶたん\n\n1回の探索に、セグ木の更新がO(n+m)回、書く場所での計算がO(m)回\nlog2つつく\n*/\n\n/*\n\n\n5 9\n1\n3\n1\n1\n4\n1 2\n2 3\n2 4\n4 5\n1 2 2\n1 6 5\n1 6 7\n1 1 10\n2 5 3 1\n2 5 3 2\n2 5 3 3\n2 5 3 4\n2 1 2 2\n*/", "accuracy": 1, "time_ms": 270, "memory_kb": 38688, "score_of_the_acc": -0.2319, "final_rank": 7 } ]
aoj_0503_cpp
大きさが異なる n 個のコップと 3 つのトレイ（お盆）A，B，C があり，それらのコップは 3 つのトレイの上にそれぞれ何個かずつ一山に重ねて置かれている．ただし，どのトレイにおいても，そのトレイの中で一番小さいコップが一番下に， 2 番目に小さいコップがその上に， 3 番目に小さいコップがその上にと，小さい順に伏せて重ねてある．例えば，下図の右側は， n = 5 個のコップがトレイ A，B，C にそれぞれ 2 個，0 個，3 個重ねて置かれている状態を示している． このように，コップの初期状態が与えられたとき，次の規則 1 〜 3 を守りながら，すべてのコップを A または C のどちらかのトレイに移動させるには何回移動を行えばよいかを求めたい． （規則 1） 1 回に 1 つのコップだけを移動させることができる．それは，そのトレイにあるコップの中で一番上のコップ（つまり，一番大きいコップ）である． （規則 2）大きいコップの上に小さいコップを重ねてはいけない． （規則 3）コップ 1 個の直接移動は，トレイ A から B，B から A，B から C，C から B のみが許され， A から C への直接移動や C から A への直接移動は許されない． n 個のコップの初期状態と整数 m が与えられたとき， m 回以内の移動で， A または C のどちらかのトレイにすべてのコップをまとめて重ねることができるかどうかを判定し，可能な場合には移動回数の最小値を，不可能な場合には -1 を出力するプログラムを作成しなさい． 入力ファイルの 1 行目には， n と m がこの順に空白を区切り文字として書いてある． 1 ≦ n ≦ 15 であり， 1 ≦ m ≦ 15000000 である． 2 行目，3 行目，4 行目には， 1 から n までの整数を何個かずつ 3 つのグループに分けて，それぞれのグループ内で小さい順（昇順）に並べたものが書いてある．ただし，各行の先頭（それらの整数の前）には，それらの個数が書いてある． 2 行目に書かれている整数（先頭の 1 つを除く）はトレイ A の上に重ねられている各コップの大きさを表す．同様に， 3 行目に書かれている整数（先頭の 1 つを除く）はトレイ B の上に重ねられている各コップの大きさを表し， 4 行目に書かれている整数（先頭の１つを除く）はトレイ C の上に重ねられている各コップの大きさを表す． 入力例１ 入力例２ 入力例３ 入力例４ 3 10 4 20 2 5 3 3 0 2 1 2 2 1 2 0 1 1 1 3 0 1 1 2 2 3 1 4 0 2 2 3 出力例１ 出力例２ 出力例３ 出力例４ 9 3 0 -1 入力 入力は複数のデータセットからなる．n, m がともに 0 のとき入力が終了する．データセットの数は 5 を超えない． 出力 データセットごとに、移動回数または -1 を１行に出力する． 入力例 3 10 0 1 1 2 2 3 4 20 2 1 2 1 3 1 4 2 5 2 1 2 0 0 3 3 0 1 1 2 2 3 0 0 出力例 9 3 0 -1 各データセットの出力（移動回数または -1）の後に改行を入れること． 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0503_11055447", "code_snippet": "//\n// main.cpp\n// kyopro\n//\n// Created by nandk on 2025/07/26.\n//\n#include <algorithm>\n#include <cmath>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <queue>\n#include <set>\n#include <string>\n#include <vector>\nusing namespace std;\nusing ll = long long;\n\nvector<pair<int, int>> direction = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};\n\nlong long power3(int n) {\n long long ret = 1;\n for (int i = 0; i < n; i++)\n ret *= 3;\n return ret;\n}\n\nint main() {\n while (1) {\n int n, m;\n cin >> n >> m;\n if (n == 0 && m == 0)\n break;\n\n vector<vector<int>> cup(3);\n for (auto &v : cup) {\n int k;\n cin >> k;\n v.resize(k);\n for (int i = 0; i < k; i++)\n cin >> v[i];\n }\n\n long long statesize = power3(n);\n\n vector<long long> distance(statesize, 2e18);\n long long pos = 0;\n for (int i = 0; i < 3; i++) {\n for (int j : cup[i]) {\n pos += power3(j - 1) * i;\n }\n }\n distance[pos] = 0;\n queue<long long> que;\n que.emplace(pos);\n\n while (!que.empty()) {\n auto pos = que.front();\n que.pop();\n\n vector<int> top(3, 0);\n for (int i = 0; i < n; i++) {\n int tray = (pos / power3(i)) % 3;\n top[tray] = max(top[tray], i + 1);\n }\n\n for (int from = 0; from < 3; from++) {\n for (int to = 0; to < 3; to++) {\n if (abs(from - to) == 1 && top[from] > top[to]) {\n long long nex =\n pos - from * power3(top[from] - 1) + to * power3(top[from] - 1);\n if (distance[nex] > distance[pos] + 1) {\n distance[nex] = distance[pos] + 1;\n que.push(nex);\n }\n }\n }\n }\n }\n long long Answer = min(distance[0], distance[power3(n) - 1]);\n if (Answer > m)\n cout << -1 << endl;\n else\n cout << Answer << endl;\n }\n}", "accuracy": 1, "time_ms": 3490, "memory_kb": 115072, "score_of_the_acc": -1.9536, "final_rank": 20 }, { "submission_id": "aoj_0503_10998290", "code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#include <cstdio>\n#include <iostream>\n#include <stack>\n#include <queue>\n#include <algorithm>\n#include <functional>\n#include <set>\n#include <map>\n#include <string>\n#include <vector>\n#include <cmath>\n#include<sstream>\n#include<list>\n#include<iomanip>\n#include <cstdlib>\n#include <cstring>\n#include <stack>\n#include <bitset>\n#include <cassert>\n#include <stdlib.h>\n#include <stdio.h>\n#include <random>\n#include <chrono>\nusing namespace std;\nconst long long LINF = 3e18 + 7;\nconst int MAX_N = 5000010;\nconst int MAX_W = 10002;\nconst int MAX_ARRAYK = 100000;\ndouble PI = 3.14159265358979323846;\nconst int INF = 2147483647;\n//using ll = long long;\n\nint N, M;\n\nstruct NODE {\n\tvector<int> s1, s2, s3;\n\tNODE(vector<int> s1, vector<int> s2, vector<int> s3) : s1(s1), s2(s2), s3(s3) {};\n\tNODE() {};\n};\n\ntypedef pair<int, int> MOVE;\ntypedef pair<NODE, MOVE> P;\n\nbool used[200000000];\n\nint main() {\n\n\twhile (cin >> N >> M) {\n\t\tif (N == 0 && M == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tNODE first;\n\t\tfor (int i = 0; i < 3; i++) {\n\t\t\tint c;\n\t\t\tcin >> c;\n\t\t\tvector<int> s;\n\t\t\ts.push_back(0);\n\t\t\tfor (int j = 0; j < c; j++) {\n\t\t\t\tint a;\n\t\t\t\tcin >> a;\n\t\t\t\ts.push_back(a);\n\t\t\t}\n\t\t\tif (i == 0) {\n\t\t\t\tfirst.s1 = s;\n\t\t\t}\n\t\t\tif (i == 1) {\n\t\t\t\tfirst.s2 = s;\n\t\t\t}\n\t\t\tif (i == 2) {\n\t\t\t\tfirst.s3 = s;\n\t\t\t}\n\t\t}\n\n\t\tvector<int> target;\n\t\tfor (int i = 0; i <= N; i++) {\n\t\t\ttarget.push_back(i);\n\t\t}\n\t\tqueue<P> que;\n\t\tMOVE move = MOVE(0, -1);\n\t\tque.push(P(first, move));\n\n\t\twhile (!que.empty()) {\n\t\t\tNODE n = que.front().first;\n\t\t\tint c = que.front().second.first;\n\t\t\tint t = que.front().second.second;\n\t\t\tque.pop();\n\n\t\t\tint ff = 0;\n\t\t\tfor (int i = 0; i < n.s1.size(); i++) {\n\t\t\t\tff += (1 << n.s1[i]);\n\t\t\t}\n\t\t\tfor (int i = 0; i < n.s2.size(); i++) {\n\t\t\t\tff += (1 << n.s2[i]) * 2;\n\t\t\t}\n\t\t\tif (used[ff]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (c > M) {\n\t\t\t\tcout << -1 << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tif (n.s1 == target) {\n\t\t\t\tcout << c << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (n.s3 == target) {\n\t\t\t\tcout << c << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tif (n.s1.back() > n.s2.back() && t != 1) {\n\t\t\t\tvector<int> s1 = n.s1;\n\t\t\t\ts1.pop_back();\n\n\t\t\t\tvector<int> s2 = n.s2;\n\t\t\t\ts2.push_back(n.s1.back());\n\n\t\t\t\tint f = 0;\n\t\t\t\tfor (int i = 1; i < s1.size(); i++) {\n\t\t\t\t\tf += (1 << s1[i]);\n\t\t\t\t}\n\t\t\t\tfor (int i = 1; i < s2.size(); i++) {\n\t\t\t\t\tf += (1 << s2[i]) * 2;\n\t\t\t\t}\n\t\t\t\tused[f] = true;\n\t\t\t\tque.push(P(NODE(s1, s2, n.s3), MOVE(c + 1, 0)));\n\t\t\t}\n\t\t\tif (n.s2.back() > n.s1.back() && t != 0) {\n\t\t\t\tvector<int> s1 = n.s1;\n\t\t\t\ts1.push_back(n.s2.back());\n\t\t\t\t\n\t\t\t\tvector<int> s2 = n.s2;\n\t\t\t\ts2.pop_back();\n\n\t\t\t\tint f = 0;\n\t\t\t\tfor (int i = 1; i < s1.size(); i++) {\n\t\t\t\t\tf += (1 << s1[i]);\n\t\t\t\t}\n\t\t\t\tfor (int i = 1; i < s2.size(); i++) {\n\t\t\t\t\tf += (1 << s2[i]) * 2;\n\t\t\t\t}\n\t\t\t\tused[f] = true;\n\t\t\t\tque.push(P(NODE(s1, s2, n.s3), MOVE(c + 1, 1)));\n\n\t\t\t}\n\t\t\tif (n.s2.back() > n.s3.back() && t != 3) {\n\t\t\t\tvector<int> s1 = n.s1;\n\t\t\t\tvector<int> s2 = n.s2;\n\t\t\t\ts2.pop_back();\n\n\t\t\t\tvector<int> s3 = n.s3;\n\t\t\t\ts3.push_back(n.s2.back());\n\n\t\t\t\tint f = 0;\n\t\t\t\tfor (int i = 1; i < s1.size(); i++) {\n\t\t\t\t\tf += (1 << s1[i]);\n\t\t\t\t}\n\t\t\t\tfor (int i = 1; i < s2.size(); i++) {\n\t\t\t\t\tf += (1 << s2[i]) * 2;\n\t\t\t\t}\n\t\t\t\tused[f] = true;\n\n\t\t\t\tque.push(P(NODE(n.s1, s2, s3), MOVE(c + 1, 2)));\n\n\t\t\t}\n\t\t\tif (n.s3.back() > n.s2.back() && t != 2) {\n\t\t\t\tvector<int> s1 = n.s1;\n\t\t\t\tvector<int> s2 = n.s2;\n\t\t\t\ts2.push_back(n.s3.back());\n\t\t\t\t\n\t\t\t\tvector<int> s3 = n.s3;\n\t\t\t\ts3.pop_back();\n\n\t\t\t\tint f = 0;\n\t\t\t\tfor (int i = 1; i < s1.size(); i++) {\n\t\t\t\t\tf += (1 << s1[i]);\n\t\t\t\t}\n\t\t\t\tfor (int i = 1; i < s2.size(); i++) {\n\t\t\t\t\tf += (1 << s2[i]) * 2;\n\t\t\t\t}\n\t\t\t\tused[f] = true;\n\n\t\t\t\tque.push(P(NODE(n.s1, s2, s3), MOVE(c + 1, 3)));\n\t\t\t}\n\n\n\t\t}\n\t}\n\t\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 560, "memory_kb": 3452, "score_of_the_acc": -0.1545, "final_rank": 6 }, { "submission_id": "aoj_0503_10827153", "code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#include <cstdio>\n#include <iostream>\n#include <stack>\n#include <queue>\n#include <algorithm>\n#include <functional>\n#include <set>\n#include <map>\n#include <string>\n#include <vector>\n#include <cmath>\n#include<sstream>\n#include<list>\n#include<iomanip>\n#include <cstdlib>\n#include <cstring>\n#include <stack>\n#include <bitset>\n#include <cassert>\n#include <stdlib.h>\n#include <stdio.h>\nusing namespace std;\nconst int INF = 1000000000;\nconst long long LINF = 3e18 + 7;\nconst int MAX_N = 500010;\nconst int MAX_W = 10002;\nconst int MAX_ARRAYK = 100000;\ndouble PI = 3.14159265358979323846;\n//using ll = long long;\n\n\n// https://emtubasa.hateblo.jp/entry/2018/08/18/113548\n// https://ebisuke33.hatenablog.com/entry/antbook-aoj0503\n// https://www.techiedelight.com/ja/check-two-vectors-equal-cpp/\n\nint N, M;\n\nstruct NODE {\n\tvector<int> s1, s2, s3;\n\tNODE(vector<int> s1, vector<int> s2, vector<int> s3) : s1(s1), s2(s2), s3(s3) {};\n\tNODE() {};\n};\n\ntypedef pair<int, int> MOVE;\n\ntypedef pair<NODE, MOVE> P;\n\nbool used[200000000];\n\nint main() {\n\n\twhile (cin >> N >> M) {\n\t\tif (N == 0 && M == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tNODE first;\n\t\tfor (int i = 0; i < 3; i++) {\n\t\t\tint c;\n\t\t\tcin >> c;\n\t\t\tvector<int> s;\n\t\t\ts.push_back(0);\n\t\t\tfor (int j = 0; j < c; j++) {\n\t\t\t\tint a;\n\t\t\t\tcin >> a;\n\t\t\t\ts.push_back(a);\n\t\t\t}\n\t\t\tif (i == 0) {\n\t\t\t\tfirst.s1 = s;\n\t\t\t}\n\t\t\tif (i == 1) {\n\t\t\t\tfirst.s2 = s;\n\t\t\t}\n\t\t\tif (i == 2) {\n\t\t\t\tfirst.s3 = s;\n\t\t\t}\n\t\t}\n\n\t\tvector<int> target;\n\t\tfor (int i = 0; i <= N; i++) {\n\t\t\ttarget.push_back(i);\n\t\t}\n\n\t\tqueue<P> que;\n\t\tMOVE move = MOVE(0, -1);\n\t\tque.push(P(first, move));\n\n\t\twhile (!que.empty()) {\n\t\t\tNODE n = que.front().first;\n\t\t\tint c = que.front().second.first;\n\t\t\tint t = que.front().second.second;\n\t\t\tque.pop();\n\n\t\t\tint ff = 0;\n\t\t\tfor (int i = 0; i < n.s1.size(); i++) {\n\t\t\t\tff += (1 << n.s1[i]);\n\t\t\t}\n\t\t\tfor (int i = 0; i < n.s2.size(); i++) {\n\t\t\t\tff += (1 << n.s2[i]) * 2;\n\t\t\t}\n\t\t\tif (used[ff]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (c > M) {\n\t\t\t\tcout << -1 << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tif (n.s1 == target) {\n\t\t\t\tcout << c << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (n.s3 == target) {\n\t\t\t\tcout << c << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (n.s1[n.s1.size() - 1] > n.s2[n.s2.size() - 1] && t != 1) {\n\t\t\t\t\n\t\t\t\tvector<int> s1;\n\t\t\t\tfor (int i = 0; i < n.s1.size() - 1; i++) {\n\t\t\t\t\ts1.push_back(n.s1[i]);\n\t\t\t\t}\n\t\t\t\tvector<int> s2 = n.s2;\n\t\t\t\t\n\t\t\t\ts2.push_back(n.s1[n.s1.size() - 1]);\n\t\t\t\tint f = 0;\n\t\t\t\tfor (int i = 1; i < s1.size(); i++) {\n\t\t\t\t\tf += (1 << s1[i]);\n\t\t\t\t}\n\t\t\t\tfor (int i = 1; i < s2.size(); i++) {\n\t\t\t\t\tf += (1 << s2[i]) * 2;\n\t\t\t\t}\n\t\t\t\tused[f] = true;\n\n\t\t\t\tque.push(P(NODE(s1, s2, n.s3), MOVE(c + 1, 0)));\n\t\t\t}\n\t\t\tif (n.s2[n.s2.size() - 1] > n.s1[n.s1.size() - 1] && t != 0) {\n\n\t\t\t\tvector<int> s1 = n.s1;\n\t\t\t\ts1.push_back(n.s2[n.s2.size() - 1]);\n\t\t\t\tvector<int> s2;\n\t\t\t\tfor (int i = 0; i < n.s2.size() - 1; i++) {\n\t\t\t\t\ts2.push_back(n.s2[i]);\n\t\t\t\t}\n\n\t\t\t\tint f = 0;\n\t\t\t\tfor (int i = 1; i < s1.size(); i++) {\n\t\t\t\t\tf += (1 << s1[i]);\n\t\t\t\t}\n\t\t\t\tfor (int i = 1; i < s2.size(); i++) {\n\t\t\t\t\tf += (1 << s2[i]) * 2;\n\t\t\t\t}\n\t\t\t\tused[f] = true;\n\n\t\t\t\tque.push(P(NODE(s1, s2, n.s3), MOVE(c + 1, 1)));\n\t\t\t}\n\t\t\tif (n.s2[n.s2.size() - 1] > n.s3[n.s3.size() - 1] && t != 3) {\n\t\t\t\tvector<int> s1 = n.s1;\n\t\t\t\tvector<int> s2;\n\t\t\t\tfor (int i = 0; i < n.s2.size() - 1; i++) {\n\t\t\t\t\ts2.push_back(n.s2[i]);\n\t\t\t\t}\n\t\t\t\tvector<int> s3 = n.s3;\n\t\t\t\ts3.push_back(n.s2[n.s2.size() - 1]);\n\n\t\t\t\tint f = 0;\n\t\t\t\tfor (int i = 1; i < s1.size(); i++) {\n\t\t\t\t\tf += (1 << s1[i]);\n\t\t\t\t}\n\t\t\t\tfor (int i = 1; i < s2.size(); i++) {\n\t\t\t\t\tf += (1 << s2[i]) * 2;\n\t\t\t\t}\n\t\t\t\tused[f] = true;\n\n\t\t\t\tque.push(P(NODE(n.s1, s2, s3), MOVE(c + 1, 2)));\n\t\t\t}\n\t\t\tif (n.s3.at(n.s3.size() - 1) > n.s2.at(n.s2.size() - 1) && t != 2) {\n\t\t\t\tvector<int> s1 = n.s1;\n\t\t\t\tvector<int> s2 = n.s2;\n\t\t\t\ts2.push_back(n.s3[n.s3.size() - 1]);\n\t\t\t\tvector<int> s3;\n\t\t\t\tfor (int i = 0; i < n.s3.size() - 1; i++) {\n\t\t\t\t\ts3.push_back(n.s3[i]);\n\t\t\t\t}\n\n\t\t\t\tint f = 0;\n\t\t\t\tfor (int i = 1; i < s1.size(); i++) {\n\t\t\t\t\tf += (1 << s1[i]);\n\t\t\t\t}\n\t\t\t\tfor (int i = 1; i < s2.size(); i++) {\n\t\t\t\t\tf += (1 << s2[i]) * 2;\n\t\t\t\t}\n\t\t\t\tused[f] = true;\n\n\t\t\t\tque.push(P(NODE(n.s1, s2, s3), MOVE(c + 1, 3)));\n\t\t\t}\n\t\t\t\n\n\t\t}\n\n\t}\n\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 680, "memory_kb": 3476, "score_of_the_acc": -0.1895, "final_rank": 8 }, { "submission_id": "aoj_0503_10609984", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n// 状態をlong longにエンコード（2ビット×15）\nlong long encode(const vector<int>& pos, int n) {\n long long res = 0;\n for (int i = 0; i < n; ++i) {\n res |= (long long)pos[i] << (2 * i);\n }\n return res;\n}\n\n// デコード：long longを状態に戻す\nvector<int> decode(long long s, int n) {\n vector<int> res(n);\n for (int i = 0; i < n; ++i) {\n res[i] = (s >> (2 * i)) & 3;\n }\n return res;\n}\n\n// ゴール状態の判定\nbool is_goal(const vector<int>& pos, int n) {\n int t = pos[0];\n if (t != 0 && t != 2) return false;\n for (int i = 1; i < n; ++i) {\n if (pos[i] != t) return false;\n }\n return true;\n}\n\nint solve(int n, int m, vector<int> pos) {\n long long start = encode(pos, n);\n\n unordered_map<long long, int> dist;\n queue<long long> q;\n\n dist[start] = 0;\n q.push(start);\n\n while (!q.empty()) {\n long long cur = q.front(); q.pop();\n int d = dist[cur];\n\n if (d > m) continue;\n\n vector<int> p = decode(cur, n);\n\n if (is_goal(p, n)) {\n return d;\n }\n\n // 各トレイの一番上のコップ（=最大番号）\n vector<int> top(3, -1);\n for (int i = n - 1; i >= 0; --i) {\n if (top[p[i]] == -1) {\n top[p[i]] = i;\n }\n }\n\n // 移動：A<->B, B<->C のみ許可\n for (int from : {0, 1, 2}) {\n if (top[from] == -1) continue;\n\n for (int to : {0, 1, 2}) {\n if (abs(from - to) != 1) continue; // A-Cは禁止\n\n if (top[to] == -1 || top[from] > top[to]) {\n vector<int> np = p;\n np[top[from]] = to;\n long long nxt = encode(np, n);\n\n if (!dist.count(nxt)) {\n dist[nxt] = d + 1;\n q.push(nxt);\n }\n }\n }\n }\n }\n\n return -1;\n}\n\nint main() {\n while (true) {\n int n, m;\n cin >> n >> m;\n if (n == 0 && m == 0) break;\n\n vector<int> pos(n);\n for (int tray = 0; tray < 3; ++tray) {\n int k; cin >> k;\n for (int j = 0; j < k; ++j) {\n int x; cin >> x;\n pos[x - 1] = tray;\n }\n }\n\n cout << solve(n, m, pos) << endl;\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 900, "memory_kb": 110420, "score_of_the_acc": -1.1633, "final_rank": 13 }, { "submission_id": "aoj_0503_10322331", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n while(true){\n int n, m; cin>>n>>m;\n if(!n && !m) return 0;\n int a; cin>>a;\n vector<int> va(a + 1, 0);\n for(int i = 0; i < a; i++) cin>>va[i + 1];\n int b; cin>>b;\n vector<int> vb(b + 1, 0);\n for(int i = 0; i < b; i++) cin>>vb[i + 1];\n int c; cin>>c;\n vector<int> vc(c + 1, 0);\n for(int i = 0; i < c; i++) cin>>vc[i + 1];\n\n vector<int> t;\n for(int i = 0; i <= n; i++) t.push_back(i);\n\n queue<tuple<vector<int>, vector<int>, vector<int>, int, int>> que;\n que.push(make_tuple(va, vb, vc, 0, -1));\n while(!que.empty()){\n vector<int> x, y, z;\n int k, l;\n tie(x, y, z, k, l) = que.front();\n que.pop();\n\n if(k > m){\n cout << \"-1\" << endl;\n break;\n }\n if(t == x || t == z){\n cout << k << endl;\n break;\n }\n\n if(!x.empty() && !y.empty() && x.back() > y.back() && l != 0){\n vector<int> t1, t2;\n t1 = x;\n t2 = y;\n t2.push_back(t1.back());\n t1.pop_back();\n que.push(make_tuple(t1, t2, z, k + 1, 1));\n }\n if(!x.empty() && !y.empty() && x.back() < y.back() && l != 1){\n vector<int> t1, t2;\n t1 = x;\n t2 = y;\n t1.push_back(t2.back());\n t2.pop_back();\n que.push(make_tuple(t1, t2, z, k + 1, 0));\n }\n if(!y.empty() && !z.empty() && y.back() > z.back() && l != 2){\n vector<int> t1, t2;\n t1 = y;\n t2 = z;\n t2.push_back(t1.back());\n t1.pop_back();\n que.push(make_tuple(x, t1, t2, k + 1, 3));\n }\n if(!y.empty() && !z.empty() && y.back() < z.back() && l != 3){\n vector<int> t1, t2;\n t1 = y;\n t2 = z;\n t1.push_back(t2.back());\n t2.pop_back();\n que.push(make_tuple(x, t1, t2, k + 1, 2));\n }\n }\n }\n}", "accuracy": 1, "time_ms": 390, "memory_kb": 3356, "score_of_the_acc": -0.1044, "final_rank": 4 }, { "submission_id": "aoj_0503_10322307", "code_snippet": "#include <iostream>\n#include <vector>\n#include <queue>\n#include <tuple>\n#include <set>\nusing namespace std;\n\n\nint main() {\n while(true){\n int n, m; cin>>n>>m;\n if(!n && !m) return 0;\n int a; cin>>a;\n vector<int> na(a + 1);\n for(int i = 0; i < a; i++) cin>>na[i + 1];\n int b; cin>>b;\n vector<int> nb(b + 1);\n for(int i = 0; i < b; i++) cin>>nb[i + 1];\n int c; cin>>c;\n vector<int> nc(c + 1);\n for(int i = 0; i < c; i++) cin>>nc[i + 1];\n na[0] = nb[0] = nc[0] = 0;\n queue<tuple<vector<int>, vector<int>, vector<int>, int, int>> que;\n que.push(make_tuple(na, nb, nc, 0, -1));\n vector<int> t;\n for(int i = 0; i <= n; i++) t.push_back(i);\n\n while(!que.empty()){\n vector<int> x, y, z;\n int k, l;\n tie(x, y, z, k, l) = que.front();\n que.pop();\n if(k > m){\n cout << \"-1\" << endl;\n break;\n }\n if(t == x || t == z){\n cout << k << endl;\n break;\n }\n if(!x.empty() && !y.empty() && x.back() > y.back() && l != 1){\n vector<int> t1, t2;\n t1 = x;\n t2 = y;\n t2.push_back(t1.back());\n t1.pop_back();\n que.push(make_tuple(t1, t2, z, k + 1, 0));\n }\n if(!x.empty() && !y.empty() && x.back() < y.back() && l != 0){\n vector<int> t1, t2;\n t1 = x;\n t2 = y;\n t1.push_back(t2.back());\n t2.pop_back();\n que.push(make_tuple(t1, t2, z, k + 1, 1));\n }\n if(!z.empty() && !y.empty() && z.back() > y.back() && l != 3){\n vector<int> t1, t2;\n t1 = y;\n t2 = z;\n t1.push_back(t2.back());\n t2.pop_back();\n que.push(make_tuple(x, t1, t2, k + 1, 2));\n }\n if(!z.empty() && !y.empty() && z.back() < y.back() && l != 2){\n vector<int> t1, t2;\n t1 = y;\n t2 = z;\n t2.push_back(t1.back());\n t1.pop_back();\n que.push(make_tuple(x, t1, t2, k + 1, 3));\n }\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 390, "memory_kb": 3352, "score_of_the_acc": -0.1044, "final_rank": 3 }, { "submission_id": "aoj_0503_10291436", "code_snippet": "#define _CRT_SECURE_NO_WARNINGS\n#include <cstdio>\n#include <iostream>\n#include <stack>\n#include <queue>\n#include <algorithm>\n#include <functional>\n#include <set>\n#include <map>\n#include <string>\n#include <vector>\n#include <cmath>\n#include<sstream>\n#include<list>\n#include<iomanip>\n#include <cstdlib>\n#include <cstring>\n#include <stack>\n#include <bitset>\n#include <cassert>\n#include <stdlib.h>\n#include <stdio.h>\nusing namespace std;\nconst int INF = 100000000;\nconst long long LINF = 3e18 + 7;\nconst int MAX_N = 2000010;\nconst int MAX_W = 10002;\nconst int MAX_ARRAYK = 100000;\ndouble PI = 3.14159265358979323846;\n//using ll = long long;\n\n\n// https://emtubasa.hateblo.jp/entry/2018/08/18/113548\n// https://ebisuke33.hatenablog.com/entry/antbook-aoj0503\n// https://www.techiedelight.com/ja/check-two-vectors-equal-cpp/\n\nint N, M;\n\nstruct NODE {\n\tvector<int> s1, s2, s3;\n\tNODE(vector<int> s1, vector<int> s2, vector<int> s3) : s1(s1), s2(s2), s3(s3) {};\n\tNODE() {};\n};\n\ntypedef pair<int, int> MOVE;\n\ntypedef pair<NODE, MOVE> P;\n\nbool used[200000000];\n\nint main() {\n\n\twhile (cin >> N >> M) {\n\t\tif (N == 0 && M == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tNODE first;\n\t\tfor (int i = 0; i < 3; i++) {\n\t\t\tint c;\n\t\t\tcin >> c;\n\t\t\tvector<int> s;\n\t\t\ts.push_back(0);\n\t\t\tfor (int j = 0; j < c; j++) {\n\t\t\t\tint a;\n\t\t\t\tcin >> a;\n\t\t\t\ts.push_back(a);\n\t\t\t}\n\t\t\tif (i == 0) {\n\t\t\t\tfirst.s1 = s;\n\t\t\t}\n\t\t\tif (i == 1) {\n\t\t\t\tfirst.s2 = s;\n\t\t\t}\n\t\t\tif (i == 2) {\n\t\t\t\tfirst.s3 = s;\n\t\t\t}\n\t\t}\n\n\t\tvector<int> target;\n\t\tfor (int i = 0; i <= N; i++) {\n\t\t\ttarget.push_back(i);\n\t\t}\n\n\t\tqueue<P> que;\n\t\tMOVE move = MOVE(0, -1);\n\t\tque.push(P(first, move));\n\n\t\twhile (!que.empty()) {\n\t\t\tNODE n = que.front().first;\n\t\t\tint c = que.front().second.first;\n\t\t\tint t = que.front().second.second;\n\t\t\tque.pop();\n\n\t\t\tint ff = 0;\n\t\t\tfor (int i = 0; i < n.s1.size(); i++) {\n\t\t\t\tff += (1 << n.s1[i]);\n\t\t\t}\n\t\t\tfor (int i = 0; i < n.s2.size(); i++) {\n\t\t\t\tff += (1 << n.s2[i]) * 2;\n\t\t\t}\n\t\t\tif (used[ff]) {\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (c > M) {\n\t\t\t\tcout << -1 << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tif (n.s1 == target) {\n\t\t\t\tcout << c << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (n.s3 == target) {\n\t\t\t\tcout << c << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif (n.s1[n.s1.size() - 1] > n.s2[n.s2.size() - 1] && t != 1) {\n\n\t\t\t\tvector<int> s1;\n\t\t\t\tfor (int i = 0; i < n.s1.size() - 1; i++) {\n\t\t\t\t\ts1.push_back(n.s1[i]);\n\t\t\t\t}\n\t\t\t\tvector<int> s2 = n.s2;\n\n\t\t\t\ts2.push_back(n.s1[n.s1.size() - 1]);\n\t\t\t\tint f = 0;\n\t\t\t\tfor (int i = 1; i < s1.size(); i++) {\n\t\t\t\t\tf += (1 << s1[i]);\n\t\t\t\t}\n\t\t\t\tfor (int i = 1; i < s2.size(); i++) {\n\t\t\t\t\tf += (1 << s2[i]) * 2;\n\t\t\t\t}\n\t\t\t\tused[f] = true;\n\n\t\t\t\tque.push(P(NODE(s1, s2, n.s3), MOVE(c + 1, 0)));\n\t\t\t}\n\t\t\tif (n.s2[n.s2.size() - 1] > n.s1[n.s1.size() - 1] && t != 0) {\n\n\t\t\t\tvector<int> s1 = n.s1;\n\t\t\t\ts1.push_back(n.s2[n.s2.size() - 1]);\n\t\t\t\tvector<int> s2;\n\t\t\t\tfor (int i = 0; i < n.s2.size() - 1; i++) {\n\t\t\t\t\ts2.push_back(n.s2[i]);\n\t\t\t\t}\n\n\t\t\t\tint f = 0;\n\t\t\t\tfor (int i = 1; i < s1.size(); i++) {\n\t\t\t\t\tf += (1 << s1[i]);\n\t\t\t\t}\n\t\t\t\tfor (int i = 1; i < s2.size(); i++) {\n\t\t\t\t\tf += (1 << s2[i]) * 2;\n\t\t\t\t}\n\t\t\t\tused[f] = true;\n\n\t\t\t\tque.push(P(NODE(s1, s2, n.s3), MOVE(c + 1, 1)));\n\t\t\t}\n\t\t\tif (n.s2[n.s2.size() - 1] > n.s3[n.s3.size() - 1] && t != 3) {\n\t\t\t\tvector<int> s1 = n.s1;\n\t\t\t\tvector<int> s2;\n\t\t\t\tfor (int i = 0; i < n.s2.size() - 1; i++) {\n\t\t\t\t\ts2.push_back(n.s2[i]);\n\t\t\t\t}\n\t\t\t\tvector<int> s3 = n.s3;\n\t\t\t\ts3.push_back(n.s2[n.s2.size() - 1]);\n\n\t\t\t\tint f = 0;\n\t\t\t\tfor (int i = 1; i < s1.size(); i++) {\n\t\t\t\t\tf += (1 << s1[i]);\n\t\t\t\t}\n\t\t\t\tfor (int i = 1; i < s2.size(); i++) {\n\t\t\t\t\tf += (1 << s2[i]) * 2;\n\t\t\t\t}\n\t\t\t\tused[f] = true;\n\n\t\t\t\tque.push(P(NODE(n.s1, s2, s3), MOVE(c + 1, 2)));\n\t\t\t}\n\t\t\tif (n.s3.at(n.s3.size() - 1) > n.s2.at(n.s2.size() - 1) && t != 2) {\n\t\t\t\tvector<int> s1 = n.s1;\n\t\t\t\tvector<int> s2 = n.s2;\n\t\t\t\ts2.push_back(n.s3[n.s3.size() - 1]);\n\t\t\t\tvector<int> s3;\n\t\t\t\tfor (int i = 0; i < n.s3.size() - 1; i++) {\n\t\t\t\t\ts3.push_back(n.s3[i]);\n\t\t\t\t}\n\n\t\t\t\tint f = 0;\n\t\t\t\tfor (int i = 1; i < s1.size(); i++) {\n\t\t\t\t\tf += (1 << s1[i]);\n\t\t\t\t}\n\t\t\t\tfor (int i = 1; i < s2.size(); i++) {\n\t\t\t\t\tf += (1 << s2[i]) * 2;\n\t\t\t\t}\n\t\t\t\tused[f] = true;\n\n\t\t\t\tque.push(P(NODE(n.s1, s2, s3), MOVE(c + 1, 3)));\n\t\t\t}\n\n\n\t\t}\n\n\t}\n\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 680, "memory_kb": 3376, "score_of_the_acc": -0.1886, "final_rank": 7 }, { "submission_id": "aoj_0503_10130459", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(ll i=0;i<n;i++)\n#define all(A) A.begin(),A.end()\n\nint N,M;\nvector<ll> TR;\nll tr(vector<stack<int>> A){\n ll rs=0;\n rep(i,3){\n while(A[i].size()>0){\n int p=A[i].top();\n A[i].pop();\n if(p>0)rs+=TR[p-1]*i;\n }\n }\n return rs;\n}\nvector<stack<int>> tr(ll x){\n vector<stack<int>> rs(3);\n rep(i,3)rs[i].push(-1);\n rep(i,N){\n rs[x%3].push(i+1);\n x/=3;\n }\n return rs;\n}\nvector<array<int,2>> P={{0,1},{1,0},{1,2},{2,1}};\n \nll mv(ll x,ll p){\n vector<int> U(3,-1);\n ll nx=x;\n rep(i,N){\n U[x%3]=i;\n x/=3;\n } \n if(U[P[p][0]]>U[P[p][1]]){\n if(P[p][0]>P[p][1])nx-=TR[U[P[p][0]]];\n else nx+=TR[U[P[p][0]]];\n return nx;\n }\n else return -1;\n}\n\nvoid solve(int N,int M){\n TR.resize(N+2,1);\n rep(i,N+1)TR[i+1]=TR[i]*3;\n ll A=0;\n for(int i=0;i<3;i++){\n int n;\n cin>>n;\n rep(j,n){\n int a;\n cin>>a;\n A+=TR[a-1]*i;\n }\n \n } \n unordered_map<ll,int> MP;\n MP[A]=0;\n queue<ll> Q;\n Q.push(A);\n \n int cnt=0;\n while(!Q.empty()){\n ll TA=Q.front();\n Q.pop();\n cnt++;\n if(TA==0||TA==TR[N]-1){\n cout<<MP[TA]<<endl;\n return;\n }\n if(MP[TA]==M)break;\n rep(bb,4){\n ll nx=mv(TA,bb);\n if(nx==-1)continue;\n if(!MP.count(nx))MP[nx]=1e9;\n if(MP[nx]>MP[TA]+1){\n MP[nx]=MP[TA]+1;\n Q.push(nx);\n }\n }\n }\n cout<<-1<<endl;\n}\n\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n while(cin>>N>>M,N!=0)solve(N,M);\n \n}", "accuracy": 1, "time_ms": 800, "memory_kb": 110300, "score_of_the_acc": -1.1333, "final_rank": 12 }, { "submission_id": "aoj_0503_10117406", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef unsigned long long ull;\ntypedef long double db;\ntypedef long long ll;\ntypedef __int128 i128;\ntypedef pair<int,int>P;\ntypedef pair<ll,ll>Pll;\nmt19937 rnd(time(0));\nconst ll mod=998244353;\nconst ll inf=1<<30;\nconst int N=1e5+5;\nbool ok=true;\nint dx[8]={0,0,1,-1,1,1,-1,-1};\nint dy[8]={1,-1,0,0,1,-1,1,-1};\nstruct Edge{\n vector<vector<int>>A;\n int y,x;\n};\nvoid solve(){\n int n,m;\n while(cin >> n >> m){\n if(n==0&&m==0) break;\n vector<vector<int>>a(3);\n unordered_map<string,int>mp;\n int ans=m+5;\n int D=0;\n for(int i=0;i<3;i++){\n int k;\n cin >> k;\n D+=k;\n for(int j=0;j<k;j++){\n int x;\n cin >> x;\n a[i].push_back(x);\n }\n sort(a[i].begin(),a[i].end());\n }\n assert(D==n);\n if(n==0){\n cout << 0 << \"\\n\";\n continue;\n }\n queue<Edge>que;\n que.push({a,0,0});\n vector<vector<int>>cur; //A->B:1 B->A:2 B->C:3 C->B:4 \n while(!que.empty()){\n auto [x,y,z]=que.front();\n //cerr << y << \" \" << z << \"\\n\";\n que.pop();\n if(x[0].size()==n||x[2].size()==n){\n ans=min(ans,y);\n continue;\n }\n if(y>=min(m,ans)) continue;\n if(!x[1].empty()){\n if(z!=1&&(x[0].empty()||x[1].back()>x[0].back())){\n cur=x;\n cur[0].push_back(x[1].back());\n cur[1].pop_back();\n que.push({cur,y+1,2});\n }\n if(z!=4&&(x[2].empty()||x[1].back()>x[2].back())){\n cur=x;\n cur[2].push_back(x[1].back());\n cur[1].pop_back();\n que.push({cur,y+1,3});\n }\n }\n if(!x[0].empty()){\n if(z!=2&&(x[1].empty()||x[0].back()>x[1].back())){\n cur=x;\n cur[1].push_back(x[0].back());\n cur[0].pop_back();\n que.push({cur,y+1,1});\n }\n }\n if(!x[2].empty()){\n if(z!=3&&(x[1].empty()||x[2].back()>x[1].back())){\n cur=x;\n cur[1].push_back(x[2].back());\n cur[2].pop_back();\n que.push({cur,y+1,4});\n }\n }\n }\n //cerr << ans << \"\\n\";\n cout << (ans<=m?ans:-1) << \"\\n\";\n }\n}\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(2);\n int T = 1;\n //cin >> T;\n while (T--) {\n solve();\n }\n return 0;\n}", "accuracy": 1, "time_ms": 390, "memory_kb": 3136, "score_of_the_acc": -0.1025, "final_rank": 2 }, { "submission_id": "aoj_0503_10117404", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef unsigned long long ull;\ntypedef long double db;\ntypedef long long ll;\ntypedef __int128 i128;\ntypedef pair<int,int>P;\ntypedef pair<ll,ll>Pll;\nmt19937 rnd(time(0));\nconst ll mod=998244353;\nconst ll inf=1<<30;\nconst int N=1e5+5;\nbool ok=true;\nint dx[8]={0,0,1,-1,1,1,-1,-1};\nint dy[8]={1,-1,0,0,1,-1,1,-1};\nstruct Edge{\n vector<vector<int>>A;\n int y,x;\n};\nvoid solve(){\n int n,m;\n while(cin >> n >> m){\n if(n==0&&m==0) break;\n vector<vector<int>>a(3);\n unordered_map<string,int>mp;\n int ans=m+5;\n int D=0;\n for(int i=0;i<3;i++){\n int k;\n cin >> k;\n D+=k;\n for(int j=0;j<k;j++){\n int x;\n cin >> x;\n a[i].push_back(x);\n }\n sort(a[i].begin(),a[i].end());\n }\n assert(D==n);\n if(n==0){\n cout << 0 << \"\\n\";\n continue;\n }\n queue<Edge>que;\n que.push({a,0,0});\n vector<vector<int>>cur; //A->B:1 B->A:2 B->C:3 C->B:4 \n while(!que.empty()){\n auto [x,y,z]=que.front();\n //cerr << y << \" \" << z << \"\\n\";\n que.pop();\n if(x[0].size()==n||x[2].size()==n){\n ans=min(ans,y);\n break;\n }\n if(y>=min(m,ans)) continue;\n if(!x[1].empty()){\n if(z!=1&&(x[0].empty()||x[1].back()>x[0].back())){\n cur=x;\n cur[0].push_back(x[1].back());\n cur[1].pop_back();\n que.push({cur,y+1,2});\n }\n if(z!=4&&(x[2].empty()||x[1].back()>x[2].back())){\n cur=x;\n cur[2].push_back(x[1].back());\n cur[1].pop_back();\n que.push({cur,y+1,3});\n }\n }\n if(!x[0].empty()){\n if(z!=2&&(x[1].empty()||x[0].back()>x[1].back())){\n cur=x;\n cur[1].push_back(x[0].back());\n cur[0].pop_back();\n que.push({cur,y+1,1});\n }\n }\n if(!x[2].empty()){\n if(z!=3&&(x[1].empty()||x[2].back()>x[1].back())){\n cur=x;\n cur[1].push_back(x[2].back());\n cur[2].pop_back();\n que.push({cur,y+1,4});\n }\n }\n }\n //cerr << ans << \"\\n\";\n cout << (ans<=m?ans:-1) << \"\\n\";\n }\n}\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(2);\n int T = 1;\n //cin >> T;\n while (T--) {\n solve();\n }\n return 0;\n}", "accuracy": 1, "time_ms": 390, "memory_kb": 3384, "score_of_the_acc": -0.1046, "final_rank": 5 }, { "submission_id": "aoj_0503_10112534", "code_snippet": "#include<iostream>\n#include<cmath>\n#include<queue>\n#include<algorithm>\nusing namespace std;\n\ntypedef pair<int,int> P;\nbool use[15000000];\n\nint main(){\n int n,m,now;\n\n for(;;){\n cin >> n >> m;\n if(!n && !m)break;\n\n now = 0;\n for(int i=0;i<3;i++){\n int num;\n cin >> num;\n for(int j=0;j<num;j++){\n\tint tmp;\n\tcin >> tmp;\n\tnow += pow(3,tmp-1)*i;\n }\n }\n\n int lim = pow(3,n);\n for(int i=0;i<lim;i++)use[i] = false;\n use[now] = true;\n\n int ans = -1;\n\n queue<P> q;\n q.push(P(now,0));\n\n while(q.size()){\n P p = q.front();q.pop();\n int s[3] = {-1,-1,-1};\n now = p.first;\n for(int i=1;i<=n;i++){\n\ts[now%3] = i;\n\tnow/=3;\n }\n \n if( (s[0]<0 && s[1]<0) || (s[1]<0 && s[2]<0) ){\n\tans = p.second;\n\tbreak;\n }\n if(p.second>m)break;\n\n int d1[] = {0,1,1,2},d2[] = {1,0,2,1};\n\n for(int i=0;i<4;i++){\n\tif(s[d1[i]]>s[d2[i]]){\n\t int hoge = pow(3,s[d1[i]]-1);\n\t now = p.first - hoge*d1[i] + hoge*d2[i];\n\t if(!use[now]){\n\t use[now] = true;\n\t q.push(P(now,p.second+1));\n\t }\n\t}\n }\n }\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 310, "memory_kb": 18112, "score_of_the_acc": -0.2068, "final_rank": 9 }, { "submission_id": "aoj_0503_10005470", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n\nint BFS(stack<int> A, stack<int> B, stack<int> C, int turn, int res = 0) {\n\n // 探索開始\n while(true) {\n\n // 移動対象 cup_number 取得\n int a, b, c;\n A.empty() ? a = 0: a = A.top();\n B.empty() ? b = 0: b = B.top();\n C.empty() ? c = 0: c = C.top();\n \n // 探索完了判定\n if(a == b || b == c) return res;\n\n // a → b へ移動\n if(turn==1 && a>b) {\n B.push(a); A.pop();\n res++; turn = 0;\n }\n\n // b → a へ移動\n else if(turn==1 && a<b) {\n A.push(b); B.pop();\n res++; turn = 0;\n }\n\n // b → c へ移動\n else if(turn==0 && b>c) {\n C.push(b); B.pop();\n res++; turn = 1;\n }\n \n // c → b へ移動\n else if(turn==0 && b<c) {\n B.push(c); C.pop();\n res++; turn = 1;\n }\n }\n}\n\n\nint main() {\n \n while(true) {\n\n // 諸元入力\n int n, m; cin >> n >> m;\n stack<int> SA, SB, SC;\n vector<int> ans(2, 0);\n\n // データセット判定\n if(n == 0 && m == 0) return 0;\n\n // データ取得\n for(int i = 0; i < 3; i++) {\n int k; cin >> k;\n\n for(int j = 0; j < k; j++) {\n int num; cin >> num;\n if(i == 0) SA.push(num);\n if(i == 1) SB.push(num);\n if(i == 2) SC.push(num);\n }\n }\n \n // 移動方向選択（BFS)\n for(int Ph = 0; Ph < 2; Ph++) {\n ans[Ph] = BFS(SA, SB, SC, Ph);\n }\n \n // 結果判定\n int res = min(ans[0], ans[1]);\n\n // 結果出力\n if(res <= m) cout << res << endl;\n else cout << -1 << endl;\n }\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3008, "score_of_the_acc": 0, "final_rank": 1 }, { "submission_id": "aoj_0503_9999553", "code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <iomanip>\n#include <climits>\nusing namespace std;\n\nint powe(int a, int b) {\n\tint r {1}, c {a};\n\twhile (b) {\n\t\tif (b % 2) r *= c;\n\t\tc *= c;\n\t\tb /= 2;\n\t}\n\treturn r;\n}\n\nint main() {\n\tint n, m;\n\tcin >> n >> m;\n\twhile (n || m) {\n\t\tint b {};\n\t\tmap<int, int> mp;\n\t\tfor (int i = 0; i < 3; ++i) {\n\t\t\tint a;\n\t\t\tcin >> a;\n\t\t\tfor (int j = 0; j < a; ++j) {\n\t\t\t\tint c;\n\t\t\t\tcin >> c;\n\t\t\t\tb += i * powe(3, c - 1);\n\t\t\t}\n\t\t}\n\t\tmp[b] = 0;\n\t\tqueue<int> q;\n\t\tq.push(b);\n\t\twhile (!q.empty()) {\n\t\t\tint c {q.front()}, e {c}, f0 {-1}, f1 {-1}, f2 {-1}, g;\n\t\t\tfor (int i = 0; i < n; ++i) {\n\t\t\t\tif (e % 3 == 0) f0 = i;\n\t\t\t\telse if (e % 3 == 1) f1 = i;\n\t\t\t\telse f2 = i;\n\t\t\t\te /= 3;\n\t\t\t}\n\t\t\tif (f1 == -1 && (f2 == -1 || f0 == -1)) {\n\t\t\t\tif (mp[c] <= m) cout << mp[c] << '\\n';\n\t\t\t\telse cout << \"-1\\n\";\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tq.pop();\n\t\t\tif (f0 < f1) g = c - powe(3, f1);\n\t\t\telse g = c + powe(3, f0);\n\t\t\tif (!mp.count(g)) {\n\t\t\t\tmp[g] = mp[c] + 1;\n\t\t\t\tq.push(g);\n\t\t\t}\n\t\t\tif (f1 < f2) g = c - powe(3, f2);\n\t\t\telse g = c + powe(3, f1);\n\t\t\tif (!mp.count(g)) {\n\t\t\t\tmp[g] = mp[c] + 1;\n\t\t\t\tq.push(g);\n\t\t\t}\n\t\t}\n\t\tif (q.empty()) cout << \"-1\\n\";\n\t\tcin >> n >> m;\n\t}\n}", "accuracy": 1, "time_ms": 1510, "memory_kb": 120520, "score_of_the_acc": -1.4261, "final_rank": 17 }, { "submission_id": "aoj_0503_9592760", "code_snippet": "#include <bits/stdc++.h>\n//#include <atcoder/all>\n#include <unordered_set>\n#include <functional>\nusing namespace std;\n//using namespace atcoder;\nusing ll = long long;\nusing P = pair<int, int>;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n//void chmin(ll & a, ll b) { a = min(a, b); }\n//using mint = modint998244353;\n\nint n, m;\nint memo3[16] = { 0,1,3,9,\n\t\t\t\t27,81,243,729,\n\t\t\t\t2187,6561,19683,59049,\n\t\t\t\t177147,531441, 1594323,4782969 };\nbool memo[15000000] = { 0 };\nint from[4] = { 0,1,1,2 };\nint to[4] = { 1,0,2,1 };\nstruct dish {\n\tvector<int> v[3];\n\tint now;\n};\n\ndish first;\n\nint solve();\nint calc3(dish x);\n\nint main() {\n\tint a, x;\n\twhile (1) {\n\t\tcin >> n >> m;\n\t\tif (n + m == 0) break;\n\t\trep(i, 3) {\n\t\t\tcin >> x;\n\t\t\trep(j, x) {\n\t\t\t\tcin >> a;\n\t\t\t\tfirst.v[i].push_back(a);\n\t\t\t}\n\t\t}\n\t\tfirst.now = 0;\n\t\tmemo[calc3(first)] = 1;\n\t\tcout << solve() << endl;\n\t\trep(i, 3) {\n\t\t\tfirst.v[i].erase(first.v[i].begin(), first.v[i].end());\n\t\t}\n\t\trep(i, 15000000) memo[i] = 0;\n\t}\n\treturn 0;\n}\n\nint solve() {\n\tdish now = first, next;\n\tbool end = 0;\n\tint ans = -1;\n\tqueue<dish> qu;\n\tqu.push(first);\n\twhile (qu.size() > 0 && now.now <= m && !end) {\n\t\tnow = qu.front();\n\t\tqu.pop();\n\t\tif (now.v[0].size() == n || now.v[2].size() == n) {\n\t\t\tans = now.now;\n\t\t\tend = 1;\n\t\t\tbreak;\n\t\t}\n\t\trep(i, 4) {\n\t\t\tint f = from[i], t = to[i];\n\t\t\tnext = now;\n\t\t\tif (next.v[f].size() != 0 &&\n\t\t\t\t(next.v[t].size()==0 ||\n\t\t\t\tnext.v[f][next.v[f].size() - 1] >\n\t\t\t\tnext.v[t][next.v[t].size() - 1])) {\n\t\t\t\tint x = next.v[f][next.v[f].size() - 1], y;\n\t\t\t\tnext.v[f].pop_back();\n\t\t\t\tnext.v[t].push_back(x);\n\t\t\t\t++next.now;\n\t\t\t\ty = calc3(next);\n\t\t\t\tif (memo[y] == 0) {\n\t\t\t\t\tqu.push(next);\n\t\t\t\t\tmemo[y] = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn ans;\n}\n\n\nint calc3(dish x) {\n\tint ans = 0;\n\trep(i, 3) {\n\t\trep(j, x.v[i].size()) {\n\t\t\tans += i * memo3[x.v[i][j]];\n\t\t}\n\t}\n\treturn ans;\n}", "accuracy": 1, "time_ms": 760, "memory_kb": 17948, "score_of_the_acc": -0.3358, "final_rank": 11 }, { "submission_id": "aoj_0503_9501586", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint n, m;\nint memo3[16] = {0, 1, 3, 9,\n 27, 81, 243, 729,\n 2187, 6561, 19683, 59049,\n 177147, 531441, 1594323, 4782969};\nbool memo[15000000] = {0};\nint from[4] = {0, 1, 1, 2};\nint to[4] = {1, 0, 2, 1};\nstruct dish {\n vector<int> v[3];\n int now;\n};\ndish first;\n\nint solve();\nint calc3(dish x);\n\nint main() {\n int a, x;\n while(1) {\n cin >> n >> m;\n if(n + m == 0) break;\n for(int i = 0; i < 3; ++i) {\n cin >> x;\n for(int j = 0; j < x; ++j) {\n cin >> a;\n first.v[i].push_back(a);\n }\n }\n first.now = 0;\n memo[calc3(first)] = 1;\n cout << solve() << endl;\n for(int i = 0; i < 3; ++i)\n first.v[i].erase(first.v[i].begin(),\n first.v[i].end());\n for(int i = 0; i < 15000000; ++i) memo[i] = 0;\n }\n return 0;\n}\n\nint solve() {\n dish now = first, next;\n bool end = 0;\n int ans = -1;\n queue<dish> qu;\n qu.push(first);\n while(qu.size() > 0 && now.now <= m && !end) {\n now = qu.front();\n qu.pop();\n if(now.v[0].size() == n || now.v[2].size() == n) {\n ans = now.now;\n end = 1;\n break;\n }\n for(int i = 0; i < 4; ++i) {\n int f = from[i], t = to[i];\n next = now;\n if(next.v[f].size() != 0 &&\n (next.v[t].size() == 0 ||\n next.v[f][next.v[f].size() - 1] >\n next.v[t][next.v[t].size() - 1])) {\n int x = next.v[f][next.v[f].size() - 1], y;\n next.v[f].pop_back();\n next.v[t].push_back(x);\n ++next.now;\n y = calc3(next);\n if(memo[y] == 0) {\n qu.push(next);\n memo[y] = 1;\n }\n }\n }\n }\n return ans;\n}\nint calc3(dish x) {\n int ans = 0;\n for(int i = 0; i < 3; ++i) {\n for(int j = 0; j < x.v[i].size(); ++j)\n ans += i * memo3[x.v[i][j]];\n }\n return ans;\n}", "accuracy": 1, "time_ms": 760, "memory_kb": 17788, "score_of_the_acc": -0.3345, "final_rank": 10 }, { "submission_id": "aoj_0503_9333416", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef signed long long ll;\nint main() {\n while (true) {\n int n, m;\n cin >> n >> m;\n if (n == 0 && m == 0) break;\n bitset<30> cups;\n queue<pair<int, int>> que;\n set<int> check;\n bitset<30> Agoal;\n bitset<30> Cgoal;\n for (int i = 0; i < 2 * n; i++) {\n if (i % 2 == 0) Agoal[i] = 1;\n Cgoal[i] = 1;\n }\n for (int i = 1; i <= 3; i++) {\n int size;\n cin >> size;\n for (int j = 0; j < size; j++) {\n int num;\n cin >> num;\n num--;\n if (i >= 2) {\n cups.set(num * 2 + 1);\n }\n if (i % 2 == 1) {\n cups.set(num * 2);\n }\n }\n }\n que.push({cups.to_ullong(), 0});\n check.insert(cups.to_ullong());\n int ans = -1;\n while (!que.empty() && que.front().second <= m) {\n bitset<30> crt(que.front().first);\n if (crt == Agoal.to_ullong() || crt == Cgoal.to_ullong()) {\n ans = que.front().second;\n break;\n }\n bool flag[3] = {true, true, true};\n for (int i = 14; i >= 0; i--) {\n if (crt[2 * i] == 1 && crt[2 * i + 1] == 1 && flag[2]) {\n flag[2] = false;\n if (flag[1]) {\n crt[2 * i] = 0;\n if (!check.count(crt.to_ullong())) {\n que.push({crt.to_ullong(), que.front().second + 1});\n check.insert(crt.to_ullong());\n }\n crt[2 * i] = 1;\n }\n }\n if (crt[2 * i] == 0 && crt[2 * i + 1] == 1 && flag[1]) {\n flag[1] = false;\n if (flag[2]) {\n crt[2 * i] = 1;\n if (!check.count(crt.to_ullong())) {\n que.push({crt.to_ullong(), que.front().second + 1});\n check.insert(crt.to_ullong());\n }\n crt[2 * i] = 0;\n }\n if (flag[0]) {\n crt[2 * i + 1] = 0;\n crt[2 * i] = 1;\n if (!check.count(crt.to_ullong())) {\n que.push({crt.to_ullong(), que.front().second + 1});\n check.insert(crt.to_ullong());\n }\n crt[2 * i + 1] = 1;\n crt[2 * i] = 0;\n }\n }\n if (crt[2 * i] == 1 && crt[2 * i + 1] == 0 && flag[0]) {\n flag[0] = false;\n if (flag[1]) {\n crt[2 * i + 1] = 1;\n crt[2 * i] = 0;\n if (!check.count(crt.to_ullong())) {\n que.push({crt.to_ullong(), que.front().second + 1});\n check.insert(crt.to_ullong());\n }\n crt[2 * i + 1] = 0;\n crt[2 * i] = 1;\n }\n }\n }\n que.pop();\n }\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 1340, "memory_kb": 120396, "score_of_the_acc": -1.3758, "final_rank": 16 }, { "submission_id": "aoj_0503_9221511", "code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n cout << (x);\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\ntemplate <typename T>\nvoid wt_integer128(T x) {\n char buf[64];\n char *d = end(buf);\n d--; *d = '\\0';\n __uint128_t tmp = ((x < 0)? -x : x);\n do {\n d--; *d = char(tmp%10 + '0'); tmp /= 10;\n } while (tmp);\n if (x < 0) {\n d--; *d = '-';\n }\n cout << d;\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer128(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer128(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n int n, m, s, a;\n cin >> n >> m;\n if (n == 0 and m == 0) return 1;\n // 適当なのでハッシュ値が被る可能性があるが、通ったのでよし\n auto hash_state = [&](const vc<stack<int>>& v) -> u64 {\n u64 h = 0;\n for (auto i : v) {\n h *= 31;\n h += i.size();\n while (!i.empty()) {\n h *= 31;\n h += i.top();\n i.pop();\n }\n }\n return h;\n };\n unordered_map<u64, int> memo;\n vc<stack<int>> t(3);\n int nums = 0;\n rep(i, 3) {\n cin >> s;\n nums += s;\n rep(s) {\n cin >> a;\n t[i].push(a);\n }\n }\n rep(i, 0, 3, 2) {\n if (len(t[i]) == nums) {\n print(0);\n return 0;\n }\n }\n queue<pair<vc<stack<int>>, int>> Q;\n memo[hash_state(t)] = 0;\n Q.emplace(mp(t, 0));\n while (!Q.empty()) {\n auto [v, d] = POP(Q);\n if (d >= m) break;\n rep(i, 3) {\n if (v[i].empty()) continue;\n rep(k, -1, 1+1, 2) {\n int j = i + k;\n if (j < 0 || j >= 3) continue;\n if (v[j].empty() or (v[i].top() > v[j].top())) {\n t = v;\n t[j].push(v[i].top());\n if ((j != 1) and (len(t[j]) == nums)) {\n print(d+1);\n return 0;\n }\n t[i].pop();\n u64 h = hash_state(t);\n if (memo.count(h)) continue;\n memo[h] = d+1;\n Q.emplace(mp(t, d+1));\n }\n }\n }\n }\n print(-1);\n return 0;\n}", "accuracy": 1, "time_ms": 2430, "memory_kb": 110356, "score_of_the_acc": -1.6063, "final_rank": 19 }, { "submission_id": "aoj_0503_9221345", "code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n cout << (x);\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\ntemplate <typename T>\nvoid wt_integer128(T x) {\n char buf[64];\n char *d = end(buf);\n d--; *d = '\\0';\n __uint128_t tmp = ((x < 0)? -x : x);\n do {\n d--; *d = char(tmp%10 + '0'); tmp /= 10;\n } while (tmp);\n if (x < 0) {\n d--; *d = '-';\n }\n cout << d;\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer128(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer128(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n int n, m, s, a;\n cin >> n >> m;\n if (n == 0 and m == 0) return 1;\n auto hash_state = [&](const vc<stack<int>>& v) -> u64 {\n u64 h = 0;\n for (auto i : v) {\n h *= 31;\n h += i.size();\n while (!i.empty()) {\n h *= 31;\n h += i.top();\n i.pop();\n }\n }\n return h;\n };\n unordered_map<u64, int> memo;\n vc<stack<int>> t(3);\n int nums = 0;\n rep(i, 3) {\n cin >> s;\n nums += s;\n rep(s) {\n cin >> a;\n t[i].push(a);\n }\n }\n rep(i, 0, 3, 2) {\n if (len(t[i]) == nums) {\n print(0);\n return 0;\n }\n }\n queue<pair<vc<stack<int>>, int>> Q;\n memo[hash_state(t)] = 0;\n Q.emplace(mp(t, 0));\n while (!Q.empty()) {\n auto [v, d] = POP(Q);\n if (d >= m) break;\n rep(i, 3) {\n if (v[i].empty()) continue;\n rep(k, -1, 1+1, 2) {\n int j = i + k;\n if (j < 0 || j >= 3) continue;\n if (v[j].empty() or (v[i].top() > v[j].top())) {\n t = v;\n t[j].push(v[i].top());\n if ((j != 1) and (len(t[j]) == nums)) {\n print(d+1);\n return 0;\n }\n t[i].pop();\n u64 h = hash_state(t);\n if (memo.count(h)) continue;\n memo[h] = d+1;\n Q.emplace(mp(t, d+1));\n }\n }\n }\n }\n print(-1);\n return 0;\n}", "accuracy": 1, "time_ms": 2410, "memory_kb": 110316, "score_of_the_acc": -1.6001, "final_rank": 18 }, { "submission_id": "aoj_0503_9158796", "code_snippet": "#include <queue>\n#include <vector>\n#include <iostream>\n\n\n#define INF ((1LL<<62)-(1LL<<31)) /*オーバーフローしない程度に大きい数*/\n#define Inf ((1L<<32)-(1L<<10))\n#define MOD 1000000007\n#define Mod 998244353\n#define M_PI 3.14159265358979323846 \n\nusing namespace std;\n\nlong long solve(long long N, long long M) {\n vector<long long> by;\n by.push_back(1LL);\n\n for (int i = 1; i < N; i++) {\n by.push_back(by[by.size() - 1] * 3);\n }\n\n long long n, m, status = 0, maxx = 0;\n for (int i = 0; i < 3; i++) {\n cin >> n;\n for (int j = 0; j < n; j++) {\n cin >> m;\n status += i * by[m - 1];\n maxx += 2 * by[m - 1];\n }\n }\n\n vector<long long> seen(maxx + 100, INF);\n long long from[4] = { 0,1,1,2 };\n long long to[4] = {1,0,2,1};\n\n queue<long long> q;\n q.push(status);\n seen[status] = 0;\n\n long long take;\n while (!q.empty()) {\n take = q.front();\n q.pop();\n\n vector<long long> s[3];\n for (int i = 0; i < 3; i++) {\n s[i].push_back(-1LL);\n }\n\n for (int i = 0; i < N; i++) {\n long long tmp = take;\n tmp /= by[i];\n s[tmp % 3].push_back(i);\n }\n\n for (int i = 0; i < 4; i++) {\n if (s[from[i]].size() > 1 && s[from[i]][s[from[i]].size() - 1] > s[to[i]][s[to[i]].size() - 1]) {\n long long in = take - from[i] * by[s[from[i]][s[from[i]].size() - 1]]\n + to[i] * by[s[from[i]][s[from[i]].size() - 1]];\n if (seen[in] == INF && seen[take] <= M - 1) {\n q.push(in);\n seen[in] = seen[take] + 1;\n\n if (in == 0) {\n return seen[in];\n }\n\n if (in == maxx) {\n return seen[in];\n }\n }\n }\n }\n }\n\n if (min(seen[0], seen[maxx]) != INF) {\n return min(seen[0], seen[maxx]);\n }\n else {\n return -1;\n }\n}\n\nint main(int argc, char** argv) {\n long long N, M;\n vector<long long> ans;\n\n cin >> N >> M;\n while (N != 0 || M != 0)\n {\n ans.push_back(solve(N, M));\n cin >> N >> M;\n }\n\n for (int i = 0; i < ans.size(); i++) {\n cout << ans[i] << endl;\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 1420, "memory_kb": 114844, "score_of_the_acc": -1.3517, "final_rank": 15 }, { "submission_id": "aoj_0503_9155681", "code_snippet": "#if !defined(MYLOCAL)//提出時用テンプレート\n\n#pragma GCC optimize(\"Ofast\")\n#if defined(NDEBUG)\n#undef NDEBUG\n#endif\n#include \"bits/stdc++.h\"\n#if !defined(_MSC_VER) && __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\nusing namespace std;\nusing ll=long long; using dd=double; \nusing vll=vector< ll>; using vdd=vector< dd>;\nusing vvll=vector< vll>; using vvdd=vector<vdd>;\nusing vvvll=vector< vvll>; using vvvdd=vector<vvdd>;\nusing vvvvll=vector<vvvll>;\nusing pll=pair<ll,ll>; using tll=tuple<ll,ll,ll>; using qll=tuple<ll,ll,ll,ll>;\nusing vpll=vector< pll>; using vtll=vector< tll>; using vqll=vector< qll>;\nusing vvpll=vector<vpll>; using vvtll=vector<vtll>; using vvqll=vector<vqll>;\nusing namespace chrono;\nconstexpr ll INF = 1001001001001001001;\nstruct Fast{ Fast(){ cin.tie(0); ios::sync_with_stdio(false); cout<<fixed<<setprecision(numeric_limits<double>::max_digits10); } } fast;\n#define REPS(i, S, E) for (ll i = (S); i <= (E); i++)\n#define REP(i, N) REPS(i, 0, (N)-1)\n#define DEPS(i, S, E) for (ll i = (E); i >= (S); i--)\n#define DEP(i, N) DEPS(i, 0, (N)-1)\n#define EXPAND( x ) x//VS用おまじない\n#define overload3(_1,_2,_3,name,...) name\n#define overload4(_1,_2,_3,_4,name,...) name\n#define overload5(_1,_2,_3,_4,_5,name,...) name\n#define rep3(i, S, E) for (ll i = (S); i <= (E); i++)\n#define rep4(i, S, E, t) for (ll i = (S); i <= (E); i+=(t))\n#define rep(...) EXPAND(overload4(__VA_ARGS__,rep4,rep3,_,_)(__VA_ARGS__))\n#define dep3(i, E, S) for (ll i = (E); i >= (S); i--)\n#define dep4(i, E, S, t) for (ll i = (E); i >= (S); i-=(t))\n#define dep(...) EXPAND(overload4(__VA_ARGS__, dep4, dep3,_,_)(__VA_ARGS__))\n#define each2(e,v) for (auto && e:v)\n#define each3(a,b,v) for (auto &&[a,b]:v)\n#define each4(a,b,c,v) for (auto &&[a,b,c]:v)\n#define each5(a,b,c,d,v) for (auto &&[a,b,c,d]:v)\n#define each(...) EXPAND(overload5(__VA_ARGS__,each5,each4,each3,each2,_)(__VA_ARGS__))\n#define ALL1(v) (v).begin(), (v).end()\n#define ALL2(v,E) (v).begin(), (v).begin()+((E)+1)\n#define ALL3(v,S,E) (v).begin()+(S), (v).begin()+((E)+1)\n#define ALL(...) EXPAND(overload3(__VA_ARGS__, ALL3, ALL2, ALL1)(__VA_ARGS__))\n#define all ALL\n#define RALL1(v) (v).rbegin(), (v).rend()\n#define RALL2(v,E) (v).rbegin(), (v).rbegin()+((E)+1)\n#define RALL3(v,S,E) (v).rbegin()+(S), (v).rbegin()+((E)+1)\n#define RALL(...) EXPAND(overload3(__VA_ARGS__, RALL3, RALL2, RALL1)(__VA_ARGS__))\n#define rall RALL\ntemplate<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; }\ntemplate<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; }\ntemplate<class T> inline T MaxE(vector<T>&v,ll S,ll E){ T m=v[S]; rep(i,S,E)chmax(m,v[i]); return m; }\ntemplate<class T> inline T MinE(vector<T>&v,ll S,ll E){ T m=v[S]; rep(i,S,E)chmin(m,v[i]); return m; }\ntemplate<class T> inline T MaxE(vector<T> &v) { return MaxE(v,0,(ll)v.size()-1); }\ntemplate<class T> inline T MinE(vector<T> &v) { return MinE(v,0,(ll)v.size()-1); }\ntemplate<class T> inline auto maxe(T &&v,ll S,ll E){ return *max_element(ALL(v,S,E)); }\ntemplate<class T> inline auto maxe(T &&v){ return *max_element(ALL(v)); }\ntemplate<class T> inline auto mine(T &&v,ll S,ll E){ return *min_element(ALL(v,S,E)); }\ntemplate<class T> inline auto mine(T &&v){ return *min_element(ALL(v)); }\ntemplate<class T> inline T Sum(vector<T> &v,ll S,ll E){ T s=T(); rep(i,S,E)s+=v[i]; return s; }\ntemplate<class T> inline T Sum(vector<T> &v) { return Sum(v,0,v.size()-1); }\ntemplate<class T,class U=typename remove_reference<T>::type::value_type>\ninline U sum(T &&v,ll S,ll E) {return accumulate(all(v,S,E),U());}\ntemplate<class T> inline auto sum(T &&v) {return sum(v,0,v.end()-v.begin()-1);}\ntemplate<class T> inline ll sz(T &&v){ return (ll)v.size(); }\ninline ll CEIL(ll a,ll b){ return (a<0) ? -(-a/b) : (a+b-1)/b; } //負もOK\ninline ll FLOOR(ll a,ll b){ return -CEIL(-a,b); } //負もOK\n\n//pair用テンプレート\ntemplate<class T,class S> inline pair<T,S>& operator+=(pair<T,S> &a,const pair<T,S> &b){ a.first+=b.first; a.second+=b.second; return a; }\ntemplate<class T,class S> inline pair<T,S>& operator-=(pair<T,S> &a,const pair<T,S> &b){ a.first-=b.first; a.second-=b.second; return a; }\ntemplate<class T,class S> inline pair<T,S>& operator*=(pair<T,S> &a,const pair<T,S> &b){ a.first*=b.first; a.second*=b.second; return a; }\ntemplate<class T,class S> inline pair<T,S>& operator/=(pair<T,S> &a,const pair<T,S> &b){ a.first/=b.first; a.second/=b.second; return a; }\ntemplate<class T,class S> inline pair<T,S>& operator%=(pair<T,S> &a,const pair<T,S> &b){ a.first%=b.first; a.second%=b.second; return a; }\ntemplate<class T,class S,class R> inline pair<T,S>& operator+=(pair<T,S> &a,R b){ a.first+=b; a.second+=b; return a; }\ntemplate<class T,class S,class R> inline pair<T,S>& operator-=(pair<T,S> &a,R b){ a.first-=b; a.second-=b; return a; }\ntemplate<class T,class S,class R> inline pair<T,S>& operator*=(pair<T,S> &a,R b){ a.first*=b; a.second*=b; return a; }\ntemplate<class T,class S,class R> inline pair<T,S>& operator/=(pair<T,S> &a,R b){ a.first/=b; a.second/=b; return a; }\ntemplate<class T,class S,class R> inline pair<T,S>& operator%=(pair<T,S> &a,R b){ a.first%=b; a.second%=b; return a; }\ntemplate<class T,class S,class R> inline pair<T,S> operator+(const pair<T,S> &a,R b){ pair<T,S> c=a; return c+=b; }\ntemplate<class T,class S,class R> inline pair<T,S> operator-(const pair<T,S> &a,R b){ pair<T,S> c=a; return c-=b; }\ntemplate<class T,class S,class R> inline pair<T,S> operator*(const pair<T,S> &a,R b){ pair<T,S> c=a; return c*=b; }\ntemplate<class T,class S,class R> inline pair<T,S> operator/(const pair<T,S> &a,R b){ pair<T,S> c=a; return c/=b; }\ntemplate<class T,class S,class R> inline pair<T,S> operator%(const pair<T,S> &a,R b){ pair<T,S> c=a; return c%=b; }\ntemplate<class T,class S,class R> inline pair<T,S> operator-(R b,const pair<T,S> &a){ pair<T,S> c=-a; return c+=b; }\ntemplate<class T,class S> inline pair<T,S> operator-(const pair<T,S> &a,const pair<T,S> &b){ pair<T,S> c=a; return c-=b; }\ntemplate<class T,class S> inline pair<T,S> operator-(const pair<T,S> &a){ pair<T,S> c=a; return c*=(-1); }\ntemplate<class T,class S> inline ostream &operator<<(ostream &os,const pair<T,S> &a){ return os << a.first << ' ' << a.second; }\n\n//tuple用テンプレート 出力用のみ\ntemplate<class T,class S,class R> inline ostream &operator<<(ostream &os,const tuple<T,S,R> &a){ return os << get<0>(a) << ' ' << get<1>(a) << ' ' << get<2>(a); }\ntemplate<class T,class S,class R,class Q> inline ostream &operator<<(ostream &os,const tuple<T,S,R,Q> &a){ return os << get<0>(a) << ' ' << get<1>(a) << ' ' << get<2>(a) << ' ' << get<3>(a); }\n\n//vector用テンプレート\ntemplate<class T> inline ostream &operator<<(ostream &os,const vector<T> &a){ for (ll i=0; i<(ll)a.size(); i++) os<<(i>0?\" \":\"\")<<a[i]; return os; }\n\n//array用テンプレート\ntemplate<class T,size_t S> inline array<T,S>& operator+=(array<T,S> &a,const array<T,S> &b){ for (ll i=0; i<(ll)S; i++) a[i]+=b[i]; return a; }\ntemplate<class T,size_t S> inline array<T,S>& operator-=(array<T,S> &a,const array<T,S> &b){ for (ll i=0; i<(ll)S; i++) a[i]-=b[i]; return a; }\ntemplate<class T,size_t S> inline array<T,S>& operator*=(array<T,S> &a,const array<T,S> &b){ for (ll i=0; i<(ll)S; i++) a[i]*=b[i]; return a; }\ntemplate<class T,size_t S> inline array<T,S>& operator/=(array<T,S> &a,const array<T,S> &b){ for (ll i=0; i<(ll)S; i++) a[i]/=b[i]; return a; }\ntemplate<class T,size_t S> inline array<T,S>& operator%=(array<T,S> &a,const array<T,S> &b){ for (ll i=0; i<(ll)S; i++) a[i]%=b[i]; return a; }\ntemplate<class T,size_t S,class R> inline array<T,S>& operator+=(array<T,S> &a,R b){ for (T &e: a) e+=b; return a; }\ntemplate<class T,size_t S,class R> inline array<T,S>& operator-=(array<T,S> &a,R b){ for (T &e: a) e-=b; return a; }\ntemplate<class T,size_t S,class R> inline array<T,S>& operator*=(array<T,S> &a,R b){ for (T &e: a) e*=b; return a; }\ntemplate<class T,size_t S,class R> inline array<T,S>& operator/=(array<T,S> &a,R b){ for (T &e: a) e/=b; return a; }\ntemplate<class T,size_t S,class R> inline array<T,S>& operator%=(array<T,S> &a,R b){ for (T &e: a) e%=b; return a; }\ntemplate<class T,size_t S,class R> inline array<T,S> operator+(const array<T,S> &a,R b){ array<T,S> c=a; return c+=b; }\ntemplate<class T,size_t S,class R> inline array<T,S> operator-(const array<T,S> &a,R b){ array<T,S> c=a; return c-=b; }\ntemplate<class T,size_t S,class R> inline array<T,S> operator*(const array<T,S> &a,R b){ array<T,S> c=a; return c*=b; }\ntemplate<class T,size_t S,class R> inline array<T,S> operator/(const array<T,S> &a,R b){ array<T,S> c=a; return c/=b; }\ntemplate<class T,size_t S,class R> inline array<T,S> operator%(const array<T,S> &a,R b){ array<T,S> c=a; return c%=b; }\ntemplate<class T,size_t S,class R> inline array<T,S> operator-(R b,const array<T,S> &a){ array<T,S> c=-a; return c+=b; }\ntemplate<class T,size_t S> inline array<T,S> operator-(const array<T,S> &a,const array<T,S> &b){ array<T,S> c=a; return c-=b; }\ntemplate<class T,size_t S> inline array<T,S> operator-(const array<T,S> &a){ array<T,S> c=a; return c*=(-1); }\ntemplate<class T,size_t S> inline ostream &operator<<(ostream &os,const array<T,S> &a){ for (ll i=0; i<(ll)S; i++) os<<(i>0?\" \":\"\")<<a[i]; return os; }\n\n\n#endif//テンプレートend\n\n#if defined(_MSC_VER) && __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\nstruct{\n\tsystem_clock::time_point st = system_clock::now();\n\tll operator()()const{return duration_cast<microseconds>(system_clock::now()-st).count()/1000;}\n} timeget;\n//////////////////////////////////////////\n\n\ntemplate<long long MOD> struct mll_{\n\tusing Int = long long;\n\tusing ll = long long;\n\tll val_=0;\n\t/*---- utility ----*/\n\tmll_ &norm(){ return normR().normS(); }//正規化\n\tmll_ &normR(){ val_%=MOD; return *this; }//剰余正規化のみ\n\tmll_ &normS(){ if (val_<0) val_+=MOD; return *this; }//正負正規化のみ\n\tmll_ &normP(){ if (val_>=MOD) val_-=MOD; return *this; }//加算時正規化\n\tmll_ &invsg(){ val_=-val_; return normS(); }//正負反転\n\tll modinv(int a){//a^-1 mod MOD\n\t\tint ypre=0,y=1,apre=MOD;\n\t\twhile (a>1){\n\t\t\tint t=apre/a;\n\t\t\tapre-=a*t,swap(a,apre);\n\t\t\typre-=y*t,swap(y,ypre);\n\t\t}\n\t\treturn y<0 ? y+MOD: y;\n\t}\n\t/*---- I/F ----*/\n\tmll_(){}\n\tmll_(ll v): val_(v){ norm(); }\n\tmll_(ll v,bool b): val_(v){} //正規化無のコンストラクタ\n\tInt val()const{ return (Int)val_; }\n\tbool isnone() const { return val_==-1; } //true:値なし\n\tmll_ &none() { val_=-1; return *this; } //値なしにする\n\tmll_ &inv(){ val_=modinv((int)val_); return *this; }\n\tmll_ &operator+=(mll_ b){ val_+=b.val_; return normP(); }\n\tmll_ &operator-=(mll_ b){ val_-=b.val_; return normS(); }\n\tmll_ &operator*=(mll_ b){ val_*=b.val_; return normR(); }\n\tmll_ &operator/=(mll_ b){ return *this*=b.inv(); }\n\tmll_ &operator+=(ll b){ return *this+=mll_(b); }\n\tmll_ &operator-=(ll b){ return *this-=mll_(b); }\n\tmll_ &operator*=(ll b){ return *this*=mll_(b); }\n\tmll_ &operator/=(ll b){ return *this/=mll_(b); }\n\tmll_ operator-()const{ return mll_(*this).invsg(); }\n\tmll_ operator+(mll_ b)const{ return mll_(*this)+=b; }\n\tmll_ operator-(mll_ b)const{ return mll_(*this)-=b; }\n\tmll_ operator*(mll_ b)const{ return mll_(*this)*=b; }\n\tmll_ operator/(mll_ b)const{ return mll_(*this)/=b; }\n\tmll_ operator+(ll b)const{ return mll_(*this)+=b; }\n\tmll_ operator-(ll b)const{ return mll_(*this)-=b; }\n\tmll_ operator*(ll b)const{ return mll_(*this)*=b; }\n\tmll_ operator/(ll b)const{ return mll_(*this)/=b; }\n\tfriend mll_ operator+(ll a,mll_ b){ return b+a; }\n\tfriend mll_ operator-(ll a,mll_ b){ return -b+a; }\n\tfriend mll_ operator*(ll a,mll_ b){ return b*a; }\n\tfriend mll_ operator/(ll a,mll_ b){ return mll_(a)/b; }\n\tbool operator==(mll_ b)const{ return val_==b.val_; }\n\tbool operator!=(mll_ b)const{ return val_!=b.val_; }\n\tbool operator==(ll b)const{ return *this==mll_(b); }\n\tbool operator!=(ll b)const{ return *this!=mll_(b); }\n\tfriend bool operator==(ll a,mll_ b){ return mll_(a)==b; }\n\tfriend bool operator!=(ll a,mll_ b){ return mll_(a)!=b; }\n\tfriend ostream &operator<<(ostream &os,mll_ a){ return os << a.val_; }\n\tfriend istream &operator>>(istream &is,mll_ &a){ return is >> a.val_; }\n\tmll_ pow(ll k)const{\n\t\tmll_ ret(1,false),a(*this);\n\t\tfor (; k>0; k>>=1,a*=a) if (k&1)ret*=a;\n\t\treturn ret;\n\t}\n\tstatic constexpr int mod() { return MOD; }\n\t//enum{ modll=MOD };\n};\n#if 0\n#define MODLL (1000000007LL)\n#else\n#define MODLL (998244353LL)\n#endif\nusing mll = mll_<MODLL>;\n//using mll = fraction;\nusing vmll = std::vector<mll>;\nusing vvmll = std::vector<vmll>;\nusing vvvmll = std::vector<vvmll>;\nusing vvvvmll = std::vector<vvvmll>;\n\n\ntemplate<class T> struct Vector: vector<T>{\n\tusing Int = long long;\n\tusing vT=vector<T>;\n\tusing cvT=const vector<T>;\n\tusing cT=const T;\n\tusing vT::vT; //親クラスのコンストラクタの隠蔽を回避\n\tusing vT::begin,vT::end,vT::insert,vT::erase;\n\tauto it(Int i){ return begin()+i; }\n\tauto it(Int i)const{ return begin()+i; }\n\tVector(cvT& b):vT(b){}\n\tVector(vT&& b):vT(move(b)){}\n\tVector(Int n,T s,T d){ iota(n,s,d); }\n\ttemplate<class S> Vector &operator+=(S x){ for (T &e: *this) e+=x; return *this; }\n\ttemplate<class S> Vector &operator-=(S x){ for (T &e: *this) e-=x; return *this; }\n\ttemplate<class S> Vector &operator*=(S x){ for (T &e: *this) e*=x; return *this; }\n\ttemplate<class S> Vector &operator/=(S x){ for (T &e: *this) e/=x; return *this; }\n\ttemplate<class S> Vector &operator%=(S x){ for (T &e: *this) e%=x; return *this; }\n\ttemplate<class S> Vector operator+(S x)const{ return Vector(*this)+=x; }\n\ttemplate<class S> Vector operator-(S x)const{ return Vector(*this)-=x; }\n\ttemplate<class S> Vector operator*(S x)const{ return Vector(*this)*=x; }\n\ttemplate<class S> Vector operator/(S x)const{ return Vector(*this)/=x; }\n\ttemplate<class S> Vector operator%(S x)const{ return Vector(*this)%=x; }\n\tVector operator-()const{ return Vector(*this)*=-1; }\n\ttemplate<class S> friend Vector operator-(S x,const Vector &a){ return -a+=x; }\n\tInt size()const{ return (Int)vT::size(); }\n\tVector &push_back(cT& x){ vT::push_back(x); return *this; }\n\tVector &pop_back(){ vT::pop_back(); return *this; }\n\tVector &push_front(cT& x){ insert(begin(),x); return *this; }\n\tVector &pop_front(){ erase(0); return *this; }\n\tVector &insert(Int i,cT& x){ insert(it(i),x); return *this; }\n\tVector &insert(Int i,cvT& b){ insert(it(i),b.begin(),b.end()); return *this; }\n\tVector &erase(Int i){ erase(it(i)); return *this; }\n\tVector &erase(Int l,Int r){ erase(it(l),it(r+1)); return *this; }\n\tVector &concat(cvT &b){ insert(end(),b.begin(),b.end()); return *this; }\n\tVector &concat(cvT &b,Int n){ for (int i=0;i<n;++i) concat(b); return *this; }\n\tVector &repeat(Int n){ concat(vT(*this),n-1); return *this; }\n\tVector &reverse(){ std::reverse(begin(),end()); return *this; }\n\tVector &sort(){ std::sort(begin(),end()); return *this; }\n\tVector &rsort(){ std::sort(vT::rbegin(),vT::rend()); return *this; }\n\ttemplate<class Pr> Vector &sort(Pr pr){ std::sort(begin(),end(),pr); return *this; }\n\tVector &uniq(){ erase(unique(begin(),end()),end()); return *this; }\n\tVector &sortq(){ return sort().uniq(); }\n\tVector &fill(Int l,Int r,cT& x){ std::fill(it(l),it(r+1),x); return *this; }\n\ttemplate<class S=Int> Vector &iota(Int n,T s=0,S d=1){\n\t\tvT::resize(n);\n\t\tif (n==0) return *this;\n\t\t(*this)[0]=s;\n\t\tfor (int i=1;i<n;++i) (*this)[i]=(*this)[i-1]+d;\n\t\treturn *this;\n\t}\n\tInt count(cT& x)const{ return Int(std::count(begin(),end(),x)); }\n\tInt count(Int l,Int r,cT& x)const{ return Int(std::count(it(l),it(r+1),x)); }\n\ttemplate<class Pr> Int countif(Pr pr)const{ return Int(count_if(begin(),end(),pr)); }\n\ttemplate<class Pr> Int countif(Int l,Int r,Pr pr)const{ return Int(count_if(it(l),it(r+1),pr)); }\n\tInt find(cT& x)const{ return Int(std::find(begin(),end(),x)-begin()); }\n\tInt find(Int l,Int r,cT& x)const{ return Int(std::find(it(l),it(r+1),x)-begin()); }\n\ttemplate<class Pr> Int findif(Pr pr)const{ return Int(find_if(begin(),end(),pr)-begin()); }\n\ttemplate<class Pr> Int findif(Int l,Int r,Pr pr)const{ return Int(find_if(it(l),it(r+1),pr)-begin()); }\n\tVector<Int> findall(cT& x)const{ return findall(0,size()-1,x); }\n\tVector<Int> findall(Int l,Int r,cT& x)const{ return findallif(l,r,[&](cT& y){return y==x;}); }\n\ttemplate<class Pr> Vector<Int> findallif(Pr pr)const{ return findallif(0,size()-1,pr); }\n\ttemplate<class Pr> Vector<Int> findallif(Int l,Int r,Pr pr)const{\n\t\tVector<Int> ret;\n\t\tfor (Int i=l;i<=r;++i) if (pr((*this)[i])) ret.push_back(i);\n\t\treturn ret;\n\t}\n\tInt flooridx(cT& x)const{ return Int(upper_bound(begin(),end(),x)-begin()-1); }\n\tInt ceilidx(cT& x)const{ return Int(lower_bound(begin(),end(),x)-begin()); }\n\tInt leftnmof(cT& x)const{ return flooridx(x)+1; }\n\tInt rightnmof(cT& x)const{ return size()-ceilidx(x); }\n\tbool contains(cT& x)const{ Int i=flooridx(x); return i>=0 && (*this)[i]==x; }\n\ttemplate<class Pr> Int flooridx(cT& x,Pr pr)const{ return Int(upper_bound(begin(),end(),x,pr)-begin()-1); }\n\ttemplate<class Pr> Int ceilidx(cT& x,Pr pr)const{ return Int(lower_bound(begin(),end(),x,pr)-begin()); }\n\ttemplate<class Pr> Int leftnmof(cT& x,Pr pr)const{ return flooridx(x,pr)+1; }\n\ttemplate<class Pr> Int rightnmof(cT& x,Pr pr)const{ return size()-ceilidx(x,pr); }\n\ttemplate<class Pr> bool contains(cT& x,Pr pr)const{ Int i=flooridx(x,pr); return i>=0 && (*this)[i]==x; }\n};\n/*\nvll a={9,8,7},b={1,2,3};\nvpll p={{5,3},{7,8},{0,2},};\n- -------- 操作系 --------\na+=x a-=x a*=x a/=x a%=x a+x a-x a*x a/x a%x -a x-a //∀i a[i]にxを演算\na.push_front(x);\na.push_back(x);\na.pop_front();\na.pop_back();\na.insert(i,x); //a[i]にx挿入\na.insert(i,b); //a[i]にvll b挿入\na.erase(i); //a[i]削除\na.erase(l,r); //区間[l,r]削除\na.concat(b); //aにbを結合\na.concat(b,n); //aにbをn回結合\na.repeat(n); //aをn回繰り返す\na.reverse(); //反転\na.sort(); //ソート\na.rsort(); //逆順ソート\np.sort([&](pll x,pll y){return x.second<y.second;});//比較関数指定ソート\na.uniq(); //連続同値を1つにする\na.sortq(); //ソートしてユニーク\na.fill(l,r,x); //[l,r]にx代入\na.iota(n,s,d); //aを等差数列にする 長さn,初項s,公差d\nvll a(n,s,d); //コンストラクタ版iota\n- -------- 検索系 --------\nauto pr=[&](auto &x){ return x>0; }; //検索条件\nll m=a.count(x); //xの個数\nll m=a.count(l,r,x); //xの個数in[l,r]\nll m=a.countif(pr); //条件満たす個数\nll m=a.countif(l,r,pr); //条件満たす個数in[l,r]\nll i=a.find(x); //xの最左位置i ない時N(配列長)\nll i=a.find(l,r,x); //xの最左位置i in[l,r] ない時r+1\nll i=a.findif(pr); //条件満たす最左位置i ない時N(配列長)\nll i=a.findif(l,r,pr); //条件満たす最左位置i in[l,r] ない時r+1\nvll is=a.findall(x); //xの位置i列挙\nvll is=a.findall(l,r,x); //xの位置i列挙in[l,r]\nvll is=a.findallif(pr); //条件満たす位置i列挙\nvll is=a.findallif(l,r,pr); //条件満たす位置i列挙in[l,r]\n- -------- 昇順sort済み配列用 --------\nll i=a.flooridx(x); //x以下の最近傍位置i ない時-1\nll i=a.ceilidx(x); //x以上の最近傍位置i ない時N(配列長)\nll m=a.leftnmof(x); //x以下の個数\nll m=a.rightnmof(x); //x以上の個数\nbool b=a.contains(x); //xを含む\n- -------- 比較関数prでsort済みの配列用 --------\nauto pr=[&](auto &x,auto &y){ return x>y; }; //降順ソート時\nll i=a.flooridx(x,pr); //x以左の最近傍位置i ない時-1\nll i=a.ceilidx(x,pr); //x以右の最近傍位置i ない時N(配列長)\nll m=a.leftnmof(x,pr); //x以左の個数\nll m=a.rightnmof(x,pr); //x以右の個数\nbool b=a.contains(x,pr); //xを含む\n\na.concat(b,n).pop_back().rsort().uniq(); //連続適用できる\n*/\n\nnamespace SolvingSpace{\n\ntemplate<class T> using vector = Vector<T>;\nusing vll=vector< ll>; using vmll=vector< mll>; using vdd=vector< dd>;\nusing vvll=vector< vll>; using vvmll=vector< vmll>; using vvdd=vector< vdd>;\nusing vvvll=vector< vvll>; using vvvmll=vector< vvmll>; using vvvdd=vector<vvdd>;\nusing vvvvll=vector<vvvll>; using vvvvmll=vector<vvvmll>;\nusing vpll=vector< pll>; using vtll=vector< tll>; using vqll=vector< qll>;\nusing vvpll=vector< vpll>; using vvtll=vector< vtll>; using vvqll=vector<vqll>;\n\ntemplate<class DATA,class Tran,class Toid> struct BFSCalc{\n\tusing Int = long long;\n\tusing ll = int;\n\tTran tran; //DATA dを遷移させるラムダ式\n\tToid toid; //DATA dをシリアライズするラムダ式\n\tll Inf;\n\tvector<ll> dist;\n\tdeque<DATA> dq;\n\tBFSCalc(DATA,Tran tran_,Toid toid_,ll Inf_): tran(tran_),toid(toid_),Inf(Inf_){}\n\tll calc(const DATA &s){ return calcMul(vector<DATA>{s,}); }\n\tll calcMul(const vector<DATA> &ss){ //BFS処理本体\n\t\tfor (const DATA &s: ss) (*this)[s]=0, dq.push_back(s); //初期値セット\n\t\twhile (dq.size()){\n\t\t\tDATA d=dq.front(); dq.pop_front();\n\t\t\tif (\n\t\t\t\td.sts[1].size()==0 and (d.sts[0].size()==0 or d.sts[2].size()==0)\n\t\t\t\t) return (*this)[d]; //ゴールで停止し距離を返す時\n\t\t\tfor (const DATA &nd: tran(d)){\n\t\t\t\tif (ChMin((*this)[nd],(*this)[d]+1)) dq.push_back(nd);\n\t\t\t}\n\t\t}\n\t\treturn Inf;\n\t}\n\tll &operator[](const DATA &d){\n\t\tll dataid=toid(d);\n\t\tif ((ll)dist.size()<=dataid) dist.resize(dataid+1,Inf);\n\t\treturn dist[dataid];\n\t}\n\tvector<ll> tovll(){ return dist; }\n\tvector<ll> tovll(ll sx,ll ex){ dist.resize(ex-sx+1,Inf); return dist; }\n\tvector<vector<ll>> tovvll(ll sx,ll ex,ll sy,ll ey){\n\t\tll H=ex-sx+1,W=ey-sy+1;\n\t\tvector<vector<ll>> ret(H,vector<ll>(W));\n\t\tdist.resize(H*W,Inf);\n\t\tfor (ll i=0;i<H;++i) for (ll j=0;j<W;++j) ret[i][j]=dist[i*W+j];\n\t\treturn ret;\n\t}\nprivate:\n\ttemplate<class T> bool ChMin(T &a,T b){ bool r=a>b; if(r)a=b; return r; }\n};\n/*\n- -------- 定義 --------\nstruct DATA{ ll x,y; };\nauto trans=[&](const DATA &d){\n\tvector<DATA> ret; //ここに遷移後データ達を入れる\n\tfor (auto&&[dx,dy]:dxy){\n\t\tif (!isout(d.x+dx,d.y+dy)) ret.push_back({d.x+dx,d.y+dy});\n\t}\n\treturn ret;\n};\nauto toid=[&](const DATA &d){ return d.x*W+d.y; };\nBFSCalc dist(DATA(),trans,toid,INF);\n. ↑∞の値\n- -------- 計算 --------\n. ↓初期状態\ndist.calc({sx,sy,sxx,syy});\n. ↓vector<DATA> 初期状態複数指定\ndist.calcMul(ss);\n- -------- 結果取得 --------\nll d=dist[{0,1,2,4}];\nvll ds=dist.tovll (-1,n-1);\nvvll ds=dist.tovvll(0,H-1,0,W-1);\n*/\n\n\ntemplate<class T> vector<T> powers(T m,ll n){\n\tvector<T> ret(n+1,1);\n\tfor (ll i=1;i<=n;++i) ret[i]=ret[i-1]*m;\n\treturn ret;\n}\n/*\n. ↓two[i]=2^i 2^0～2^nを準備\nvmll two=powers(mll(2),n);\n*/\n\nvoid cin2solve()\n{\n\tusing vcc=vector<char>;\n\tusing vvcc=vector<vector<char>>;\n\twhile (true){\n\t\tll n,m;\n\t\tcin >> n >> m;\n\t\tif (n==0 and m==0)break;\n\n\t\tvvcc sts(3);\n\t\trep(t,0,3-1){\n\t\t\tll nm; cin >> nm;\n\t\t\trep(times,0,nm-1){\n\t\t\t\tll x; cin >> x;\n\t\t\t\tsts[t].push_back(char(x));\n\t\t\t}\n\t\t}\n\n\t\tstruct DATA{ vvcc sts; };\n\t\tauto trans=[&](const DATA &d){\n\t\t\tDATA e=d;\n\t\t\tvector<DATA> ret; //ここに遷移後データ達を入れる\n\t\t\tauto isok=[&](vcc &a,vcc &b){//true:a→bへ移動可能\n\t\t\t\tif (a.empty()) return false;\n\t\t\t\tif (b.empty()) return true;\n\t\t\t\treturn a.back()>b.back();\n\t\t\t};\n\t\t\tauto move=[&](vcc &a,vcc &b){//a→bへ移動\n\t\t\t\tb.push_back(a.back());\n\t\t\t\ta.pop_back();\n\t\t\t};\n\t\t\tauto func=[&](ll i,ll j){\n\t\t\t\tif (isok(e.sts[i],e.sts[j])){\n\t\t\t\t\tmove(e.sts[i],e.sts[j]);\n\t\t\t\t\tret.push_back(e);\n\t\t\t\t\tmove(e.sts[j],e.sts[i]);\n\t\t\t\t}\n\t\t\t};\n\t\t\tfunc(0,1);\n\t\t\tfunc(1,0);\n\t\t\tfunc(1,2);\n\t\t\tfunc(2,1);\n\t\t\treturn ret;\n\t\t};\n\t\tmap<vvcc,ll> mp;\n\t\tauto toidmap=[&](const DATA &d){\n\t\t\tif (mp.count(d.sts)==1) return mp[d.sts];\n\t\t\tll no=sz(mp);\n\t\t\treturn mp[d.sts]=no;\n\t\t};\n\n\t\tvll three=powers(3ll,15);\n\t\tauto toid=[&](const DATA &d){\n\t\t\tll id=0;\n\t\t\trep(va,0,3-1){\n\t\t\t\tfor (auto&& e: d.sts[va]) id+=three[e-1]*va;\n\t\t\t}\n\t\t\treturn id;\n\t\t};\n\n\t\tBFSCalc dist(DATA(),trans,toid,1000000010);\n\n\t\tll ans=dist.calc({sts,});\n\t\tif (ans>m) ans=-1;\n\t\tcout << ans << '\\n';\n\t}\n\n\n\treturn;\n}\n\n};//SolvingSpace\n\n//////////////////////////////////////////\n\nint main(){\n#if 1\n\t//SolvingSpace::labo();\n\tSolvingSpace::cin2solve();\n\t//SolvingSpace::generand();\n#else\n\tll t; cin >> t;\n\trep(i,0,t-1){\n\t\tSolvingSpace::cin2solve();\n\t\t//SolvingSpace::generand();\n\t} \n#endif\n\t//cerr << timeget() <<\"ms\"<< '\\n';\n\treturn 0;\n}", "accuracy": 1, "time_ms": 1190, "memory_kb": 114232, "score_of_the_acc": -1.2798, "final_rank": 14 } ]
aoj_0501_cpp
与えられた変換表にもとづき，データを変換するプログラムを作成しなさい． データに使われている文字は英字か数字で，英字は大文字と小文字を区別する．変換表に現れる文字の順序に規則性はない． 変換表は空白をはさんで前と後ろの 2 つの文字がある(文字列ではない)．変換方法は，変換表のある行の前の文字がデータに現れたら，そのたびにその文字を後ろの文字に変換し出力する．変換は 1 度だけで，変換した文字がまた変換対象の文字になっても変換しない．変換表に現れない文字は変換せず，そのまま出力する． 入力ファイルには，変換表（最初の n + 1 行）に続き変換するデータ（n + 2 行目以降）が書いてある． 1 行目に変換表の行数 n，続く n 行の各行は，空白をはさんで 2 つの文字，さらに続けて， n + 2 行目に変換するデータの行数 m，続く m 行の各行は 1 文字である． m ≤ 10 5 とする．出力は，出力例のように途中に空白や改行は入れず 1 行とせよ． 入力例 3 A a 0 5 5 4 10 A B C 0 1 4 5 a b A 出力例 aBC5144aba 入力 入力は複数のデータセットからなる．n が 0 のとき入力が終了する．データセットの数は 5 を超えない． 出力 データセットごとに、変換後の文字列を１行に出力する． 入力例 3 A a 0 5 5 4 10 A B C 0 1 4 5 a b A 3 A a 0 5 5 4 10 A B C 0 1 4 5 a b A 0 出力例 aBC5144aba aBC5144aba 各データセットの出力（変換後の文字列）の後に改行を入れること． 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0501_9590453", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n;\n while (cin >> n) {\n if (n == 0) break;\n map<char, char> mp;\n for (int i = 0; i < n; i++) {\n char a, b;\n cin >> a >> b;\n mp[a] = b;\n }\n\n int m;\n cin >> m;\n for (int i = 0; i < m; i++) {\n char c;\n cin >> c;\n if (mp.find(c) == mp.end())\n cout << c;\n else\n cout << mp[c];\n }\n cout << \"\\n\";\n }\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 2920, "score_of_the_acc": -0.2382, "final_rank": 4 }, { "submission_id": "aoj_0501_9278100", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i=0; i<n; i++)\n#define chmax(x, y) x = max(x, y)\n#define chmin(x, y) x = min(x, y)\n#define yesno(ok) puts(ok ? \"Yes\" : \"No\") \nusing ll = long long;\nusing P = pair<int,int>;\n\nint main() {\n\twhile (true) {\n\t\tint n;\n\t\tcin >> n;\n\t\tif (n == 0) break;\n\t\tmap<char, char> mp;\n\t\trep(i,n) {\n\t\t\tchar x, y;\n\t\t\tcin >> x >> y;\n\t\t\tmp[x] = y;\n\t\t}\n\t\tint t;\n\t\tcin >> t;\n\t\trep(ti,t) {\n\t\t\tchar a;\n\t\t\tcin >> a;\n\t\t\tif (mp.count(a)) cout << mp[a];\n\t\t\telse cout << a;\n\t\t}\n\t\tcout << '\\n';\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 3060, "score_of_the_acc": -0.4553, "final_rank": 7 }, { "submission_id": "aoj_0501_8860063", "code_snippet": "#include <iostream>\n\nint main() {\n int n;\n\n while(std::cin >> n && n) {\n int d[256] = {};\n char a, b;\n while (--n >= 0) {\n std::cin >> a >> b;\n d[a] = b - a;\n }\n std::cin >> n;\n while (--n >= 0) {\n std::cin >> a;\n std::cout << static_cast<char>(a + d[a]);\n }\n std::cout << \"\\n\";\n }\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 3076, "score_of_the_acc": -0.5609, "final_rank": 11 }, { "submission_id": "aoj_0501_8825033", "code_snippet": "#include <iostream>\n\nint main() {\n int n;\n for (char a, b; std::cin >> n, n; std::cout << '\\n') {\n int d[256] = {};\n for (; n--; d[a] = b - a)\n std::cin >> a >> b;\n for (std::cin >> n; n--; std::cout << char(a + d[a]))\n std::cin >> a;\n }\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 2900, "score_of_the_acc": -0.2, "final_rank": 1 }, { "submission_id": "aoj_0501_8825032", "code_snippet": "#include <stdio.h>\n#include <iostream>\n\nint main() {\n int n;\n char a, b;\n int d[256];\n\n while (std::cin >> n && n) {\n std::fill(d, d + 256, 0);\n for (; n--; d[a] = b - a)\n std::cin >> a >> b;\n for (std::cin >> n; n--; std::cout << char(a + d[a]))\n std::cin >> a;\n std::cout << \"\\n\";\n }\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 2900, "score_of_the_acc": -0.2, "final_rank": 1 }, { "submission_id": "aoj_0501_8825031", "code_snippet": "#include <iostream>\n\nint main() {\n char a, b;\n int n;\n while (std::cin >> n && n) {\n int d[256] = {};\n for (; n--; d[a] = b - a)\n std::cin >> a >> b;\n std::cin >> n;\n for (; n--; std::cout << static_cast<char>(a + d[a]))\n std::cin >> a;\n std::cout << std::endl;\n }\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 2980, "score_of_the_acc": -0.3527, "final_rank": 5 }, { "submission_id": "aoj_0501_8825027", "code_snippet": "#include <iostream>\n#include <cstring>\n\nint main() {\n int n;\n int d[256];\n char a, b;\n \n while(std::cin >> n && n) {\n memset(d, 0, sizeof(d));\n for (int i = 0; i < n; ++i) {\n std::cin >> a >> b;\n d[a] = b - a;\n }\n std::cin >> n;\n for (int i = 0; i < n; ++i) {\n std::cin >> a;\n std::cout << char(a + d[a]);\n }\n std::cout << \"\\n\";\n }\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 2900, "score_of_the_acc": -0.2, "final_rank": 1 }, { "submission_id": "aoj_0501_8050691", "code_snippet": "#include <iostream>\n#include <cstring>\n#define z std::cin >>\nint main() {\n int n;\n for (char a, b; z n, n; puts(\"\")) {\n int d[256] = {};\n for (; n--; d[a] = b - a)\n z a >> b;\n for (z n; n--; putchar(a + d[a]))\n z a;\n memset(d, 0, sizeof(d)); // reset array for next iteration\n }\n return 0;\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 3336, "score_of_the_acc": -0.9821, "final_rank": 14 }, { "submission_id": "aoj_0501_8050689", "code_snippet": "#include <iostream>\n#include <cstring>\n#define z std::cin >>\nint main() {\n int n;\n for (char a, b; z n, n; puts(\"\")) {\n int d[256] = {};\n for (; n--; d[a] = b - a)\n z a >> b;\n for (z n; n--; putchar(a + d[a]))\n z a;\n memset(d, 0, sizeof(d)); // Adding this line to clear the array after each test case\n }\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 3368, "score_of_the_acc": -1.0431, "final_rank": 17 }, { "submission_id": "aoj_0501_7140712", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n while(1){\n int n;\n cin >>n;\n if(n==0){\n break;\n }\n vector<pair<char,char>> code(n);\n for(int i=0;i<n;i++){\n cin >> code.at(i).first >> code.at(i).second;\n }\n int m;\n cin >> m;\n for(int i=0;i<m;i++){\n char c;\n cin >> c;\n for(int j=0;j<n;j++){\n if(c == code.at(j).first){\n c = code.at(j).second;\n break;\n }\n }\n cout << c;\n }\n cout << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 3344, "score_of_the_acc": -0.9973, "final_rank": 16 }, { "submission_id": "aoj_0501_7026194", "code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\n#include <cmath>\n#include <algorithm>\n\nusing namespace std;\n\nint main() {\n\tint n;\n\tcin >> n;\n\twhile (n != 0) {\n\t\tmap<char, char> code;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tchar from, to;\n\t\t\tcin >> from >> to;\n\t\t\tcode[from] = to;\n\t\t}\n\t\tint m;\n\t\tcin >> m;\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tchar in;\n\t\t\tcin >> in;\n\t\t\tauto it = code.find(in);\n\t\t\tif (it != code.end()) {\n\t\t\t\tcout << it->second;\n\t\t\t} else {\n\t\t\t\tcout << in;\n\t\t\t}\n\t\t}\n\t\tcout << endl;\n\t\tcin >> n;\n\t}\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 3336, "score_of_the_acc": -0.9821, "final_rank": 14 }, { "submission_id": "aoj_0501_6605127", "code_snippet": "#include<iostream>\nusing namespace std;\nchar map[128];\nint main(){\n\tint n,m;\n\tchar a,b,c;\n\twhile(cin>>n,n){\n\t\tfor(int i=0;i<128;i++)\n\t\t\tmap[i]=i;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin>>a>>b;\n\t\t\tmap[a]=b;\n\t\t}\n\t\tcin>>m;\n\t\tfor(int i=0;i<m;i++){\n\t\t\tcin>>c;\n\t\t\tcout<<map[c];\n\t\t}\n\t\tcout<<endl;\n\t}\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 3424, "score_of_the_acc": -1.15, "final_rank": 19 }, { "submission_id": "aoj_0501_6161935", "code_snippet": "#include<iostream>\n#include<string>\n#include<string.h>\n#include<algorithm>\n\n\n#define MAX_LEN 100000\n\nstruct Node\n{\n\tint a;\n\tint b;\n\tNode* parent;\n\tNode* left;\n\tNode* right;\n};\n\nNode* root;\n\n\nvoid insertTree(Node key)\n{\n\tNode* x = root;\n\tNode* y = 0;\n\tNode* z = new Node;\n\tz->left = z->right = 0;\n\tz->a = key.a;\n\tz->b = key.b;\n\n\twhile (x)\n\t{\n\t\ty = x;\n\t\tif (z->a < x->a)\n\t\t\tx = x->left;\n\t\telse\n\t\t\tx = x->right;\n\t}\n\n\tz->parent = x;\n\tif (y == 0)\n\t\troot = z;\n\telse if (z->a < y->a)\n\t\ty->left = z;\n\telse\n\t\ty->right = z;\n}\n\nvoid freeTree(Node* x)\n{\n\tif (x == 0)\n\t\treturn;\n\tfreeTree(x->left);\n\tfreeTree(x->right);\n\tdelete(x);\n\tx = 0;\n}\n\nchar findTree(int a)\n{\n\tchar b;\n\tNode* x = root;\n\twhile (x && x->a != a)\n\t{\n\t\tif (a < x->a)\n\t\t\tx = x->left;\n\t\telse\n\t\t\tx = x->right;\n\t}\n\tif (x)\n\t\treturn x->b;\n\n\treturn -1;\n}\n\n\nint main()\n{\n\tint n, m;\n\tchar a, b;\n\tNode tmp;\n\twhile (1)\n\t{\n\t\tstd::cin >> n;\n\t\tif (n == 0)\n\t\t\tbreak;\n\n\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tstd::cin >> a >> b;\n\t\t\ttmp.a = a;\n\t\t\ttmp.b = b;\n\t\t\tinsertTree(tmp);\n\t\t}\n\t\tstd::cin >> m;\n\t\tfor (int i = 0; i < m; i++)\n\t\t{\n\t\t\tstd::cin >> a;\n\t\t\tb = findTree(a);\n\t\t\tif (b == -1)\n\t\t\t\tstd::cout << a;\n\t\t\telse\n\t\t\t\tstd::cout << b;\n\t\t}\n\t\tstd::cout << std::endl;\n\t\tfreeTree(root);\n\t\troot = 0;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 3076, "score_of_the_acc": -0.5359, "final_rank": 9 }, { "submission_id": "aoj_0501_6019376", "code_snippet": "//#include <atcoder/all>\n#include <iostream>\n#include <numeric>\n#include <cmath>\n#include <limits>\n#include <stdio.h>\n#include <iomanip>\n#include <string> // string, to_string, stoi\n#include <vector> // vector\n#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound\n#include <utility> // pair, make_pair\n#include <tuple> // tuple, make_tuple\n#include <cstdint> // int64_t, int*_t\n#include <cstdio> // printf\n#include <map> // map\n#include <queue> // queue, priority_queue\n#include <set> // set\n#include <stack> // stack\n#include <deque> // deque\n#include <unordered_map> // unordered_map\n#include <unordered_set> // unordered_set\n#include <bitset> // bitset\n#include <cctype> // isupper, islower, isdigit, toupper, tolower\nusing namespace std;\n//using namespace atcoder;\nusing ll = long long;\n#define all(A) A.begin(),A.end()\nusing vll = vector<ll>;\n#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)\nusing Graph = vector<vector<pair<ll,ll>>>;\nvector<ll> fact, factinv, inv;\nll mod = 1e9 + 7;\n\nvoid prenCkModp(ll n) {\n\tfact.resize(n + 5);\n\tfactinv.resize(n + 5);\n\tinv.resize(n + 5);\n\tfact.at(0) = fact.at(1) = 1;\n\tfactinv.at(0) = factinv.at(1) = 1;\n\tinv.at(1) = 1;\n\tfor (ll i = 2; i < n + 5; i++) {\n\t\tfact.at(i) = (fact.at(i - 1) * i) % mod;\n\t\tinv.at(i) = mod - (inv.at(mod % i) * (mod / i)) % mod;\n\t\tfactinv.at(i) = (factinv.at(i - 1) * inv.at(i)) % mod;\n\t}\n\n}\nll nCk(ll n, ll k) {\n\tif (n < k) return 0;\n\treturn fact.at(n) * (factinv.at(k) * factinv.at(n - k) % mod) % mod;\n}\nint main() {\n while(1){\n\tll N;\n\tcin >> N;\n\tif(N==0)return 0;\n\tmap<char, char> M;\n\trep(i, N) {\n\t\tchar C, D;\n\t\tcin >> C >> D;\n\t\tM[C] = D;\n\t}\n\tll a;\n\tcin >> a;\n\tstring S=\"\";\n\trep(m,a) {\n\t\tchar B;\n\t\tcin >> B;\n\t\tif (M.count(B)) {\n\t\t\tS = S + M[B];\n\t\t}\n\t\telse {\n\t\t\tS = S + B;\n\t\t}\n\t}\n\tcout << S << endl;}\n}", "accuracy": 1, "time_ms": 410, "memory_kb": 3332, "score_of_the_acc": -1.8244, "final_rank": 20 }, { "submission_id": "aoj_0501_5706291", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <string>\nusing namespace std;\n\nint main(){\n\tint N;\n\tcin >> N;\n\twhile(N != 0){\n\t\tvector<vector<string> > howtoconvert;\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tvector<string> converttable;\n\t\t\tfor(int i = 0; i < 2; i++){\n\t\t\t\tstring s;\n\t\t\t\tcin >> s;\n\t\t\t\tconverttable.push_back(s);\n\t\t\t}\n\t\t\thowtoconvert.push_back(converttable);\n\t\t}\n\t\t\n\t\tint M;\n\t\tcin >> M;\n\t\tfor(int i = 0; i < M; i++){\n\t\t\tstring now;\n\t\t\tcin >> now;\n\t\t\tfor(int j = 0; j < N; j++){\n\t\t\t\tif(howtoconvert[j][0] == now){\n\t\t\t\t\tnow = howtoconvert[j][1];\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << now;\n\t\t}\n\t\tcout << endl;\n\t\tcin >> N;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 3384, "score_of_the_acc": -1.1237, "final_rank": 18 }, { "submission_id": "aoj_0501_5281346", "code_snippet": "#include <iostream>\n#include <vector>\n#include <map>\nusing namespace std;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\n#define logn long\n#define lnog long\n#define lgon long\n#define itn int\ntypedef pair<long long, long long> P;\nconst long long INF = 1000000000000006;\nint main() {\n long long N = 1; cin >> N;\n while (N != 0) {\n vector<pair<char, char> >A(N);\n map<char, char>MAP;\n for (long long i = 0; i < N; i++) {\n cin >> A[i].first >> A[i].second;\n MAP[A[i].first] = A[i].second;\n }\n long long M; cin >> M;\n for (long long i = 0; i < M; i++) {\n char ch; cin >> ch;\n for (long long j = 0; j < N; j++) {\n if (ch == A[j].first) {\n ch = A[j].second;\n break;\n }\n }\n cout << ch;\n }\n cout << endl;\n cin >> N;\n }\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 3064, "score_of_the_acc": -0.513, "final_rank": 8 }, { "submission_id": "aoj_0501_4946789", "code_snippet": "#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<map>\n#include<math.h>\n#include<iomanip>\n#include<set>\n#include<numeric>\n#include<cstring>\n#include<cstdio>\n#include<functional>\n#include<bitset>\n#include<limits.h>\n#include<cassert>\n#include<iterator>\n#include<complex>\n#include<stack>\n#include<sstream>\n#include<iterator>\n#include<list>\n\nusing namespace std;\n\n#define INF LLONG_MAX/5\n#define MOD 1000000007\n#define pi 3.14159265358979\n#define int long long\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define sort(v) sort((v).begin(), (v).end())\n#define reverse(v) reverse((v).begin(), (v).end())\n#define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge)\n#define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge)\n#define enld endl\n//#define lint long long int\n\nvoid vout(vector<int>A) {\n\trep(i, A.size()) {\n\t\tcout << A[i];\n\t\tif (i == A.size() - 1) {\n\t\t\tcout << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << ' ';\n\t\t}\n\t}\n}\n\nvoid vvout(vector<vector<int>>A) {\n\trep(i, A.size()) {\n\t\trep(j, A[i].size()) {\n\t\t\tcout << A[i][j];\n\t\t\tif (j == A[i].size() - 1) {\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcout << ' ';\n\t\t\t}\n\t\t}\n\t}\n}\n\nsigned main() {\n\tint N, M;\n\twhile (1) {\n\t\tcin >> N;\n\t\tif (N == 0) {\n\t\t\treturn 0;\n\t\t}\n\t\telse {\n\t\t\tmap<char, char>A;\n\t\t\tchar a, b;\n\t\t\trep(i, N) {\n\t\t\t\tcin >> a >> b;\n\t\t\t\tA[a] = b;\n\t\t\t}\n\t\t\tcin >> M;\n\t\t\tchar s;\n\t\t\trep(i, M) {\n\t\t\t\tcin >> s;\n\t\t\t\tif (A.count(s) == 0) {\n\t\t\t\t\tcout << s;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tcout << A[s];\n\t\t\t\t}\n\t\t\t}\n\t\t\tcout << endl;\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 3092, "score_of_the_acc": -0.5914, "final_rank": 12 }, { "submission_id": "aoj_0501_4800948", "code_snippet": "#include <bits/stdc++.h>\nusing ll = long long;\nusing namespace std;\n#define _overload3(_1, _2, _3, name, ...) name\n#define _rep(i, n) repi(i, 0, n)\n#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)\n#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)\nconst long long INFLL = 1LL << 60;\nconst int INFINT = 1 << 30;\nconst long long MOD = 1e9 + 7;\n\ntemplate <class T> void vecout(T V) {\n auto t = V.begin();\n while(t != V.end()) {\n cout << *t++;\n if(t != V.end()) cout << \" \";\n }\n cout << endl;\n};\n\nint main() {\n int N, M;\n char l, r;\n map<char, char> pa;\n string S;\n\n while(1) {\n cin >> N;\n if(N < 1) break;\n pa.clear();\n S.clear();\n rep(i, N) {\n cin >> l >> r;\n pa[l] = r;\n }\n cin >> M;\n rep(i, M) {\n cin >> l;\n S.push_back((pa.find(l) == pa.end()) ? l : pa.find(l)->second);\n }\n cout << S << endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3292, "score_of_the_acc": -0.7481, "final_rank": 13 }, { "submission_id": "aoj_0501_4767440", "code_snippet": "#include<iostream>\n#include<map>\n#include<utility>\nusing namespace std;\nint main(){\n int n,m;\n char x,y;\n while(true){\n map<char,char> ma;\n cin >> n;\n if(n == 0)\n break;\n for(int i = 0 ; i < n ; i++){\n cin >> x;\n cin >> y;\n ma[x] = y;\n }\n cin >> m;\n char str[m];\n for(int i = 0 ; i < m ; i++){\n cin >> str[i];\n if(ma.find(str[i]) != ma.end())\n str[i] = ma[str[i]];\n }\n for(int i = 0 ; i < m ; i++)\n cout << str[i];\n cout << endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3100, "score_of_the_acc": -0.3817, "final_rank": 6 }, { "submission_id": "aoj_0501_4742463", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i,n) for (int i =0; i < (n); ++i)\nusing namespace std;\n\nint main() {\n int N, M;\n char B, A, c;\n cin >> N;\n while (N != 0) {\n map<char, char> hen;\n rep(n, N) {\n cin >> B >> A;\n hen[B] = A;\n }\n cin >> M;\n rep(m, M) {\n cin >> c;\n if (hen.count(c)) {\n cout << hen.at(c);\n } else {\n cout << c;\n }\n }\n cout << endl;\n cin >> N;\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 3084, "score_of_the_acc": -0.5511, "final_rank": 10 } ]
aoj_0504_cpp
次のようなゲームを考える． 1 から n までの数が 1 つずつ書かれた n 枚のカードが k 組ある．これら kn 枚のカードをよくシャッフル（よく切ること）して， k 枚ずつの山を作り横一列に並べる．このようにしてできる n 個の山の左から i 番目の（k 枚のカードの）山を「山 i 」と呼ぶことにする． ゲームは山 1 から始める．山の一番上のカード 1 枚を引き（引いたカードは元の山に戻さない），そのカードに書かれていた数が i だった場合には山 i の一番上のカード 1 枚を引く．このようにして，引いたカードに書かれていた数を番号とする山の一番上のカード 1 枚を引くことを繰り返し，すべての山にカードが無くなれば成功である．まだカードが残っている山があるのに，次にカードを引くべき山が無くなっていた場合は失敗である． 途中で失敗した場合には，そのまま失敗で終了するか，または残ったカードの山をそのまま（山の番号もそのまま）にしてゲームを再開する．ゲームを再開する場合は，最初に引くカードはカードが残っている山のうちの一番左の山からとする（その山の一番上のカードが最初に引かれるカードとなる）．再開後も再開前と同様の方法でゲームを進め，すべての山にカードが無くなれば成功であり，まだカードが残っている山があるのに，次にカードを引くべき山が無くなった場合は失敗である． このようなゲームの再開を最大 m 回まで行うものとする．ただし，m は 0 か 1 である．つまり， 1 回も再開しないか， 1 回だけ再開するかのいずれかである．ゲーム開始前のシャッフルの仕方によりカードの初期配置は異なる．当然，カードの初期配置により，再開せずに成功することもあれば，再開して成功することも，再開して失敗することもある．十分シャッフルしているので，どの初期配置も全て同じ確率で現れるものと考えることにして，再開が m 回以内で成功する確率 p を求めたい．この確率 p を小数で表し，小数第 r 位まで求めて出力するプログラムを作りなさい．ただし，次の条件を満たすように出力すること. 十分大きい正整数 K を取ると p×10K が 整数となる場合， 小数部は途中から 0 が続くが，その 0 も出力すること． 例えば， p = 3/8 = 0.375 の場合， r = 5 なら 0.37500 と出力し， r = 2 なら 0.37 と出力する． p = 1.0 の場合も同様に， 例えば r = 3 なら 1.000 と出力すること． 例えば 0.150000… は循環小数 0.1499999… として表すこともできるが， このような場合， 前者の表し方を用いる． 入力ファイルの 1 行目には整数 n，k，m，r がこの順に空白を区切り文字として書いてある． 1 ≦ n ≦ 10000， 1 ≦ k ≦ 100， m = 0 または m = 1， 1 ≦ r ≦ 10000 である． 入力例１ 入力例２ 入力例３ 2 1 0 5 3 1 1 3 2 2 1 3 出力例１ 出力例２ 出力例３ 0.50000 0.833 1.000 入力 入力は複数のデータセットからなる．n, k, m, r がすべて 0 のとき入力が終了する．データセットの数は 5 を超えない． 出力 データセットごとに、指定通りに p を１行に出力する． 入力例 2 1 0 5 3 1 1 3 2 2 1 3 0 0 0 0 出力例 0.50000 0.833 1.000 各データセットについて，指定通りに出力した p の後に改行を入れること． 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0504_7974112", "code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n,k,m,r;\n while (cin >> n >> k >> m >> r, n+m+k+r) {\n const int N = 10010;\n vector<int> a(N),b(N);\n\n auto add = [&](int x) -> void {\n int cur = 1;\n for (int i = 1; i < N; i++) {\n cur *= 10;\n b[i] = cur/x;\n cur %= x;\n }\n for (int i = N-1; i >= 0; i--) {\n a[i] += b[i];\n if (a[i] >= 10) {\n a[i-1]++;\n a[i] -= 10;\n }\n }\n };\n\n add(n);\n if (m == 1) {\n for (int i = 1; i <= n-1; i++) {\n add(n*i);\n }\n }\n cout << a[0] << \".\";\n for (int i = 1; i <= r; i++) {\n cout << a[i];\n }\n cout << \"\\n\";\n } \n}", "accuracy": 1, "time_ms": 1190, "memory_kb": 3416, "score_of_the_acc": -1.1434, "final_rank": 19 }, { "submission_id": "aoj_0504_7938851", "code_snippet": "#include <iostream>\nusing namespace std;\nint n, m, a, b, p[30000];\nint main() {\n while (true) {\n cin >> n >> m >> a >> b;\n if (n == 0)\n break;\n for (int i = 0; i < 30000; i++)\n p[i] = 0;\n int L = 10, R = n;\n for (int i = 0; i < 30000; i++) {\n p[i] += L / R;\n L = L % R;\n L *= 10;\n }\n if (a == 1) {\n for (int i = 1; i < n; i++) {\n int L = 10, R = i * n;\n for (int j = 0; j < 30000; j++) {\n p[j] += L / R;\n L = L % R;\n L *= 10;\n }\n }\n }\n for (int i = 29999; i > 0; i--) {\n p[i - 1] += p[i] / 10;\n p[i] %= 10;\n }\n p[0] %= 10;\n if (n - a < 2)\n cout << \"1.\";\n else\n cout << \"0.\";\n for (int i = 0; i < b; i++)\n cout << p[i];\n cout << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 2510, "memory_kb": 3204, "score_of_the_acc": -1.1055, "final_rank": 18 }, { "submission_id": "aoj_0504_7938838", "code_snippet": "#include <iostream>\nusing namespace std;\nint a[100000], n, k, m, r;\nvoid Div(int l, int s) {\n int p = l * 10, q = s;\n for (int i = 0; i < r + 10; i++) {\n a[i] += p / q;\n p = p % q;\n p *= 10;\n }\n for (int i = r + 10; i >= 1; i--) {\n if (a[i] >= 10) {\n a[i - 1] += a[i] / 10;\n a[i] %= 10;\n }\n }\n}\nint main() {\n while (true) {\n for (int i = 0; i < 10200; i++)\n a[i] = 0;\n cin >> n >> k >> m >> r;\n if (n == 0)\n break;\n Div(1, n);\n if (m == 1) {\n for (int i = 1; i < n; i++) {\n Div(1, n * i);\n }\n }\n cout << a[0] / 10 << '.';\n for (int i = 0; i < r; i++)\n cout << a[i] % 10;\n cout << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 1380, "memory_kb": 3040, "score_of_the_acc": -0.2191, "final_rank": 6 }, { "submission_id": "aoj_0504_7938825", "code_snippet": "#include <iostream>\nusing namespace std;\nint a[100000], n, k, m, r;\ninline void Div(int l, int s) {\n int p = l * 10, q = s;\n for (int i = 0; i < r + 10; i++) {\n a[i] += p / q;\n p = p % q;\n p *= 10;\n }\n}\nint main() {\n while (true) {\n for (int i = 0; i < 10200; i++)\n a[i] = 0;\n cin >> n >> k >> m >> r;\n if (n == 0)\n break;\n Div(1, n);\n if (m == 1) {\n for (int i = 1; i < n; i++) {\n Div(1, n * i);\n }\n }\n for (int i = r + 10; i >= 1; i--) {\n if (a[i] >= 10) {\n a[i - 1] += a[i] / 10;\n a[i] %= 10;\n }\n }\n cout << a[0] / 10 << '.';\n for (int i = 0; i < r; i++)\n cout << a[i] % 10;\n cout << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 840, "memory_kb": 3056, "score_of_the_acc": -0.0465, "final_rank": 2 }, { "submission_id": "aoj_0504_7938820", "code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> BigDecimal;\nint n, k, m, r;\nBigDecimal tmp(10010);\nvoid Div(ll x) {\n ll now = 1LL;\n for (int i = 0; i < r + 10; i++) {\n tmp[i] = now / x;\n now %= x;\n now *= 10;\n }\n}\nvoid print(const BigDecimal &b) {\n cout << b[0] << \".\";\n for (int i = 1; i <= r; i++)\n cout << b[i];\n cout << endl;\n}\nint main() {\n while (cin >> n >> k >> m >> r, n) {\n Div(n);\n BigDecimal res = tmp;\n if (m == 1) {\n for (ll i = 1; i < n; i++) {\n Div(i * n);\n for (int j = 0; j < r + 10; j++)\n res[j] += tmp[j];\n }\n for (int j = r + 10 - 1; j > 0; j--) {\n res[j - 1] += res[j] / 10;\n res[j] %= 10;\n }\n }\n print(res);\n }\n}", "accuracy": 1, "time_ms": 1380, "memory_kb": 3080, "score_of_the_acc": -0.3255, "final_rank": 10 }, { "submission_id": "aoj_0504_7938818", "code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\ntypedef vector<int> BigDecimal;\nint n, k, m, r;\nBigDecimal tmp(10010);\nvoid Div(int x) {\n int now = 1;\n for (int i = 0; i < r + 10; i++) {\n tmp[i] = now / x;\n now %= x;\n now *= 10;\n }\n}\nvoid print(const BigDecimal &b) {\n cout << b[0] << \".\";\n for (int i = 1; i <= r; i++)\n cout << b[i];\n cout << endl;\n}\nint main() {\n while (cin >> n >> k >> m >> r, n) {\n Div(n);\n BigDecimal res = tmp;\n if (m == 1) {\n for (int i = 1; i < n; i++) {\n Div(i * n);\n for (int j = 0; j < r + 10; j++)\n res[j] += tmp[j];\n }\n for (int j = r + 10 - 1; j > 0; j--) {\n res[j - 1] += res[j] / 10;\n res[j] %= 10;\n }\n }\n print(res);\n }\n}", "accuracy": 1, "time_ms": 880, "memory_kb": 3100, "score_of_the_acc": -0.1795, "final_rank": 4 }, { "submission_id": "aoj_0504_7938806", "code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> BigDecimal;\nconst int digit = 10010;\nBigDecimal div(ll x) {\n ll now = 1LL;\n BigDecimal res;\n for (int i = 0; i < digit; i++) {\n res.push_back(now / x);\n now %= x;\n now *= 10;\n }\n return res;\n}\nvoid print(BigDecimal b, int len) {\n cout << b[0] << \".\";\n for (int i = 1; i <= len; i++)\n cout << b[i];\n cout << endl;\n}\nint main() {\n int n, k, m, r;\n while (cin >> n >> k >> m >> r, n) {\n BigDecimal res = div(n);\n if (m == 1) {\n for (ll i = 1; i < n; i++) {\n BigDecimal tmp = div(i * n);\n for (int j = 0; j < digit; j++)\n res[j] += tmp[j];\n }\n for (int j = digit - 1; j > 0; j--) {\n res[j - 1] += res[j] / 10;\n res[j] %= 10;\n }\n }\n print(res, r);\n }\n}", "accuracy": 1, "time_ms": 1920, "memory_kb": 3188, "score_of_the_acc": -0.8279, "final_rank": 15 }, { "submission_id": "aoj_0504_7937838", "code_snippet": "#include <algorithm>\n#include <iostream>\n#include <stack>\n#include <vector>\nusing namespace std;\n#define REP(i, b, n) for (int i = b; i < n; i++)\n#define rep(i, n) REP(i, 0, n)\n#define pb push_back\ntypedef long long ll;\nconst int N = 20010;\nint array[N], tmp[N];\nvoid div(int n, int *a, int k) {\n int now = 1;\n rep(i, k + 1) {\n a[i] = now / n;\n now = (now % n) * 10;\n }\n}\nvoid add(int k) {\n int carry = 0;\n for (int i = k; i >= 0; i--) {\n array[i] = (array[i] + carry + tmp[i]);\n carry = array[i] / 10;\n array[i] %= 10;\n }\n}\nvoid output(int *a, int k) {\n rep(i, k + 1) {\n cout << a[i];\n if (i == 0)\n cout << \".\";\n }\n cout << endl;\n}\nvoid solve(int n, int m, int k) {\n div(n, array, 2 * k);\n if (m == 1) {\n REP(i, 1, n) {\n div(i * n, tmp, 2 * k);\n add(2 * k);\n }\n }\n output(array, k);\n}\nmain() {\n int n, k, m, r;\n while (cin >> n >> k >> m >> r && n) {\n solve(n, m, r);\n }\n}", "accuracy": 1, "time_ms": 2170, "memory_kb": 3160, "score_of_the_acc": -0.853, "final_rank": 17 }, { "submission_id": "aoj_0504_7937826", "code_snippet": "#include <algorithm>\n#include <iostream>\n#include <stack>\n#include <vector>\nusing namespace std;\n#define REP(i, b, n) for (int i = b; i < n; i++)\n#define rep(i, n) REP(i, 0, n)\n#define pb push_back\ntypedef long long ll;\nconst int N = 20010;\nint array[N], tmp[N];\nvoid div(int n, int *a, int k) {\n int now = 1;\n rep(i, k + 1) {\n a[i] = now / n;\n now = (now % n) * 10;\n }\n}\nvoid add(int k) {\n int carry = 0;\n for (int i = k; i >= 0; i--) {\n array[i] = (array[i] + carry + tmp[i]);\n carry = array[i] / 10;\n array[i] %= 10;\n }\n}\nvoid output(int *a, int k) {\n rep(i, k + 1) {\n cout << a[i];\n if (i == 0)\n cout << \".\";\n }\n cout << endl;\n}\nvoid solve(int n, int m, int k) {\n div(n, array, k + 6);\n if (m == 1) {\n REP(i, 1, n) {\n div(i * n, tmp, k + 6);\n add(k + 6);\n }\n }\n output(array, k);\n}\nmain() {\n int n, k, m, r;\n while (cin >> n >> k >> m >> r && n) {\n solve(n, m, r);\n }\n}", "accuracy": 1, "time_ms": 1080, "memory_kb": 3172, "score_of_the_acc": -0.4507, "final_rank": 12 }, { "submission_id": "aoj_0504_4205360", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define pb push_back\n#define fi first\n#define se second\ntypedef pair<ll,ll> P;\nusing VP = vector<P>; using VVP = vector<VP>;\nusing VI = vector<ll>; using VVI = vector<VI>; using VVVI = vector<VVI>;\nconst int inf=1e9+7;\nconst ll INF=1LL<<61;\nconst ll mod=1e9+7;\n\ntemplate<class T>\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T>\ninline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\nVI ans;\n\nvoid calc(int s,int t){\n for(int i=0;i<10101;i++){\n ans[i]+=s/t;\n int u=i;\n while(ans[u]>=10) {\n ans[u-1]+=1;\n ans[u]-=10;\n u--;\n }\n s%=t;\n s*=10;\n if(s==0) return;\n }\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int i,j;\n int n,k,m,r;\n while(1){\n cin>>n>>k>>m>>r;\n if(n==0) break;\n ans = VI(10101);\n if(m==0) {\n calc(1,n);\n }\n else {\n calc(1,n);\n for(i=1;i<n;i++) calc(1,n*i);\n }\n //if(n==1) ans=1.0;\n //if(n==2&&m==1) ans=1.0;\n //if(k==1) ans=0;\n cout<<ans[0]<<\".\";\n for(i=1;i<=r;i++){\n cout<<ans[i];\n }\n cout<<endl;\n }\n}", "accuracy": 1, "time_ms": 1690, "memory_kb": 3224, "score_of_the_acc": -0.832, "final_rank": 16 }, { "submission_id": "aoj_0504_4083451", "code_snippet": "#include <bits/stdc++.h>\n\n// #include <boost/multiprecision/cpp_int.hpp>\n #define int long long\n #define inf 1000000007\n #define pa pair<int,int>\n #define ll long long\n #define pal pair<double,double>\n #define ppap pair<pa,int>\n// #define PI 3.14159265358979323846\n #define paa pair<int,char>\n #define mp make_pair\n #define pb push_back\n #define EPS (1e-10)\n \n int dx[8]={0,-1,0,1,1,1,-1,-1};\n int dy[8]={1,0,-1,0,-1,1,1,-1};\n using namespace std;\n \t\t\tclass pa3{\n \tpublic:\n \tint x,y,z;\n \tpa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}\n \tbool operator < (const pa3 &p) const{\n \t\tif(x!=p.x) return x<p.x;\n \t\tif(y!=p.y) return y<p.y;\n \t\t return z<p.z;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \t\t\t\tbool operator > (const pa3 &p) const{\n \t\tif(x!=p.x) return x>p.x;\n \t\tif(y!=p.y) return y>p.y;\n \t\t return z>p.z;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const pa3 &p) const{\n \t\treturn x==p.x && y==p.y && z==p.z;\n \t}\n \t\tbool operator != (const pa3 &p) const{\n \t\t\treturn !( x==p.x && y==p.y && z==p.z);\n \t}\n \n };\n \n class pa4{\n \tpublic:\n \tdouble x;\n \tint y,z,w;\n \tpa4(double x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}\n \tbool operator < (const pa4 &p) const{\n \t\tif(x!=p.x) return x<p.x;\n \t\tif(y!=p.y) return y<p.y;\n \t\tif(z!=p.z)return z<p.z;\n \t\treturn w<p.w;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator > (const pa4 &p) const{\n \t\tif(x!=p.x) return x>p.x;\n \t\tif(y!=p.y) return y>p.y;\n \t\tif(z!=p.z)return z>p.z;\n \t\treturn w>p.w;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const pa4 &p) const{\n \t\treturn x==p.x && y==p.y && z==p.z &&w==p.w;\n \t}\n \t\t\n \n };\n class pa2{\n \tpublic:\n \tint x,y;\n \tpa2(int x=0,int y=0):x(x),y(y) {}\n \tpa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}\n \tpa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}\n \tbool operator < (const pa2 &p) const{\n \t\treturn y != p.y ? y<p.y: x<p.x;\n \t}\n \tbool operator > (const pa2 &p) const{\n \t\treturn x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const pa2 &p) const{\n \t\treturn abs(x-p.x)==0 && abs(y-p.y)==0;\n \t}\n \tbool operator != (const pa2 &p) const{\n \t\treturn !(abs(x-p.x)==0 && abs(y-p.y)==0);\n \t}\n \t\t\n \n };\n \n/*\n class Point{\n \tpublic:\n \tdouble x,y;\n \tPoint(double x=0,double y=0):x(x),y(y) {}\n \tPoint operator + (Point p) {return Point(x+p.x,y+p.y);}\n \tPoint operator - (Point p) {return Point(x-p.x,y-p.y);}\n \tPoint operator * (double a) {return Point(x*a,y*a);}\n \tPoint operator / (double a) {return Point(x/a,y/a);}\n \tdouble absv() {return sqrt(norm());}\n \tdouble norm() {return x*x+y*y;}\n \tbool operator < (const Point &p) const{\n \t\treturn x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const Point &p) const{\n \t\treturn fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;\n \t}\n };\n typedef Point Vector;\n #define pl pair<int,pas>\n struct Segment{\n Point p1,p2;\n };\n double dot(Vector a,Vector b){\n \treturn a.x*b.x+a.y*b.y;\n }\n double cross(Vector a,Vector b){\n \treturn a.x*b.y-a.y*b.x;\n }\n \n bool parareru(Point a,Point b,Point c,Point d){\n //\tif(abs(cross(a-b,d-c))<EPS)cout<<\"dd \"<<cross(a-b,d-c)<<endl;\n \treturn abs(cross(a-b,d-c))<EPS;\n }\n double distance_ls_p(Point a, Point b, Point c) {\n if ( dot(b-a, c-a) < EPS ) return (c-a).absv();\n if ( dot(a-b, c-b) < EPS ) return (c-b).absv();\n return abs(cross(b-a, c-a)) / (b-a).absv();\n }\n bool is_intersected_ls(Segment a,Segment b) {\n \tif(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;\n \tif(parareru((a.p2),(a.p1),(a.p1),(b.p2))&&parareru((a.p2),(a.p1),(a.p1),(b.p1))){\n //\t\tcout<<\"sss\"<<endl;\n \t\tif(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;\n \t\tif(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;\n \t\tif(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;\n \t\tif(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;\n \t\treturn false;\n \t}\n else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );\n }\n \n double segment_dis(Segment a,Segment b){\n \tif(is_intersected_ls(a,b))return 0;\n \tdouble r=distance_ls_p(a.p1, a.p2, b.p1);\n \tr=min(r,distance_ls_p(a.p1, a.p2, b.p2));\n \tr=min(r,distance_ls_p(b.p1, b.p2, a.p2));\n \tr=min(r,distance_ls_p(b.p1, b.p2, a.p1));\n \treturn r;\n }\n Point intersection_ls(Segment a, Segment b) {\n Point ba = b.p2-b.p1;\n double d1 = abs(cross(ba, a.p1-b.p1));\n double d2 = abs(cross(ba, a.p2-b.p1));\n double t = d1 / (d1 + d2);\n \n return a.p1 + (a.p2-a.p1) * t;\n }\n */ \n string itos( int i ) {\n ostringstream s ;\n s << i ;\n return s.str() ;\n }\n \n int gcd(int v,int b){\n \tif(v>b) return gcd(b,v);\n \tif(v==b) return b;\n \tif(b%v==0) return v;\n \treturn gcd(v,b%v);\n }\n \n double distans(double x1,double y1,double x2,double y2){\n \tdouble rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);\n \treturn sqrt(rr);\n \t\n }\n int mod;\n \n int pr[500010];\n int inv[500010];\n \n int beki(int wa,int rr,int warukazu){\n \tif(rr==0) return 1%warukazu;\n \tif(rr==1) return wa%warukazu;\n \tif(rr%2==1) return (beki(wa,rr-1,warukazu)*wa)%warukazu;\n \tint zx=beki(wa,rr/2,warukazu);\n \treturn (zx*zx)%warukazu;\n }\n double bekid(double w,int r){\n \tif(r==0) return 1.0;\n \tif(r==1) return w;\n \tif(r%2) return bekid(w,r-1)*w;\n \tdouble f=bekid(w,r/2);\n \treturn f*f;\n }\n \n \t\t\tint comb(int nn,int rr){\n \t\t\t\tint r=pr[nn]*inv[rr];\n \t\t\t\tr%=mod;\n \t\t\t\tr*=inv[nn-rr];\n \t\t\t\tr%=mod;\n \t\t\t\treturn r;\n \t\t\t}\n \n void gya(int ert){\n \tpr[0]=1;\n \tfor(int i=1;i<ert;i++){\n \t\tpr[i]=(pr[i-1]*i)%mod;\n \t}\n \tfor(int i=0;i<ert;i++) inv[i]=beki(pr[i],mod-2,mod);\n \t\n }\n \n // cin.tie(0);\n \t\t//\tios::sync_with_stdio(false);\n \t\t\t//priority_queue<pa3,vector<pa3>,greater<pa3>> pq; \n //sort(ve.begin(),ve.end(),greater<int>());\n //----------------kokomade tenpure------------\n //vector<double> ans(100000000),ans2(100000000)\n \n\n\nvector<int> ve(13001,0);\n\nvector<int> tasu(vector<int> v1,vector<int> v2){\n\tint ku=0;\n\tfor(int i=13000;i>0;i--){\n\t\tv1[i]+=v2[i]+ku;\n\t\tif(v1[i]>10)v1[i]-=10,ku=1;\n\t\telse ku=0;\n\t}\n\tv1[0]+=v2[0]+ku;\n\treturn v1;\n}\n\nvector<int>waru(vector<int> v1,int d){\n\tint ku=0;\n\tvector<int> v2(13001,0);\n\t\n\tfor(int i=0;i<=13000;i++){\n\t\tv2[i]=(ku*10+v1[i])/d;\n\t\tku=(ku*10+v1[i])%d;\n\t}\n\treturn v2;\n}\n\nvector<int> gyaku(int r){\n\tvector<int> v2(13001,0);\n\tv2[0]=1;\n\treturn waru(v2,r);\n}\n signed main(){\n \t cin.tie(0);\n \t\t\tios::sync_with_stdio(false);\nwhile(1){\nint n,k,m,r;\n \tcin>>n>>k>>m>>r;\nif(n==0)exit(0);\nfor(int i=0;i<13001;i++)ve[i]=0;\n \tif(m==0){\n \t\t\n \t\t{\n \t\t\tve[0]=1;\n \t\t\tve=waru(ve,n);\n \t\t\tcout<<ve[0]<<\".\";\n \t\t\tfor(int i=0;i<r;i++)cout<<ve[i+1];\n \t\t\tcout<<endl;\n \t\t\tcontinue;\n \t\t}\n \t}\n \t\n \tif(n<=2){\n \t\tcout<<\"1.\";\n \t\tfor(int i=0;i<r;i++)cout<<\"0\";\n \t\tcout<<endl;\n \t\tcontinue;\n \t}\n \t\n \tve[0]=2;\n \tfor(int i=2;i<=n-1;i++){\n \t\tvector<int> gya=gyaku(i);\n \t\tve=tasu(ve,gya);\n \t}\n \tve=waru(ve,n);\n \t\ncout<<ve[0]<<\".\";\n \t\t\tfor(int i=0;i<r;i++)cout<<ve[i+1];\n \t\t\tcout<<endl;\n}\n \treturn 0;\n }", "accuracy": 1, "time_ms": 3340, "memory_kb": 3364, "score_of_the_acc": -1.8617, "final_rank": 20 }, { "submission_id": "aoj_0504_4062516", "code_snippet": "// 解説を見た　こんなの思い付けない\n#include<iostream>\n#include<cstring>\nusing namespace std;\n\nint a[10010], b[10010];\n\nvoid calc(int x, int y){\n memset(b, 0, sizeof(b));\n x *= 10;\n for(int i = 1; i <= 10009; i++){\n b[i] = x/y;\n x %= y;\n x *= 10;\n }\n int carry = 0;\n for(int i = 10009; i >= 0; i--){\n a[i] += b[i]+carry;\n carry = 0;\n if(a[i] >= 10) a[i] -= 10, carry++;\n }\n}\n\nint main(){\n int n, k, m, r;\n while(cin>>n>>k>>m>>r, n){\n memset(a, 0, sizeof(a));\n calc(1, n);\n if(m == 1){\n for(int i = 1; i <= n-1; i++){\n calc(1, n*i);\n }\n }\n cout << a[0] << \".\";\n for(int i = 0; i < r; i++) cout << a[1+i];\n cout << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 1240, "memory_kb": 3080, "score_of_the_acc": -0.2697, "final_rank": 9 }, { "submission_id": "aoj_0504_3354459", "code_snippet": "#include <bits/stdc++.h>\n\n#define fst(t) std::get<0>(t)\n#define snd(t) std::get<1>(t)\n#define thd(t) std::get<2>(t)\n#define unless(p) if(!(p))\n#define until(p) while(!(p))\n\nusing ll = std::int64_t;\nusing P = std::tuple<int,int>;\n\ntemplate <int r>\nstruct Decimal{\n std::vector<int> digits;\n \n Decimal(int n) : digits(r + 1, 0) { // 1/n\n int rem = 1;\n for(int i=1;i<=r;++i){\n rem *= 10;\n digits[i] = rem / n;\n rem %= n;\n }\n }\n\n Decimal<r>& operator+=(Decimal<r> &rhs){\n for(int i=r;i>0;--i){\n digits[i] += rhs.digits[i];\n if(digits[i] >= 10){\n digits[i] -= 10;\n digits[i - 1] += 1;\n }\n }\n\n return *this;\n }\n};\n\nconstexpr int r = 10100;\n\nint main(){\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n while(true){\n int N, K, M, R;\n std::cin >> N >> K >> M >> R;\n\n if(N == 0){\n break;\n }\n\n Decimal<r> p(N);\n\n if(M == 1){\n for(int k=1;k<=N-1;++k){\n Decimal<r> d(k * N);\n p += d;\n }\n }\n\n std::cout << p.digits[0] << \".\";\n for(int i=1;i<=R;++i){\n std::cout << p.digits[i];\n }\n std::cout << std::endl;\n }\n}", "accuracy": 1, "time_ms": 1310, "memory_kb": 3184, "score_of_the_acc": -0.5742, "final_rank": 14 }, { "submission_id": "aoj_0504_2699265", "code_snippet": "#include <stdio.h>\n#include <cmath>\n#include <algorithm>\n#include <cfloat>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <string>\n#include <iostream>\n#include <set>\n#include <map>\n#include <time.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 11000\n\nint N,K,M,R;\nint ans[NUM];\n\nvoid calc(int bunshi,int bunbo){\n\n\tfor(int i = 0; i < NUM; i++){\n\t\tans[i] += bunshi/bunbo;\n\t\tbunshi %= bunbo;\n\t\tbunshi *= 10;\n\t\tif(bunshi == 0)return;\n\t}\n}\n\nvoid func(){\n\n\tfor(int i = 0; i < NUM; i++)ans[i] = 0;\n\n\tif(M == 0){\n\t\tcalc(1,N);\n\t}else{ //M == 1\n\t\tcalc(1,N);\n\t\tfor(int a = 1; a <= N-1; a++){\n\t\t\tcalc(1,N*a);\n\t\t}\n\t}\n\n\tfor(int a = NUM-1; a >= 1; a--){\n\t\tif(ans[a] >= 10){\n\t\t\tans[a-1] += ans[a]/10;\n\t\t\tans[a] %= 10;\n\t\t}\n\t}\n\n\tprintf(\"%d.\",ans[0]);\n\tfor(int a = 1; a <= R; a++){\n\t\tprintf(\"%d\",ans[a]);\n\t}\n\tprintf(\"\\n\");\n}\n\n\nint main(){\n\n\twhile(true){\n\t\tscanf(\"%d %d %d %d\",&N,&K,&M,&R);\n\t\tif(N == 0 && K == 0 && M == 0 && R == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 920, "memory_kb": 3156, "score_of_the_acc": -0.3444, "final_rank": 11 }, { "submission_id": "aoj_0504_2450754", "code_snippet": "#include <iostream>\nusing namespace std;\n\nconst int MAX = 10020;\nint d[MAX + 5];\nint a[MAX + 5];\n\nvoid div(int n, int *d) {\n\tint val = 1;\n\tfor (int i = 0; i < MAX; i++) {\n\t\td[i] = val / n;\n\t\tval %= n;\n\t\tval *= 10;\n\t}\n}\n\nvoid add(int *src, int *dst) {\n\tfor (int i = MAX - 1; i >= 0; i--) {\n\t\tdst[i] += src[i];\n\t}\n\tfor (int i = MAX - 1; i > 0; i--) {\n\t\tdst[i - 1] += dst[i] / 10;\n\t\tdst[i] %= 10;\n\t}\n}\n\nvoid fix(int *tmp, int *a) {\n\tfor (int i = 0; i < MAX; i++) tmp[i] = 0;\n\ttmp[MAX - 5] = 1;\n\tadd(tmp, a);\n}\n\nint main() {\n\tint n, k, m, r;\n\twhile (cin >> n >> k >> m >> r) {\n\t\tif (!n) break;\n\t\tfor (int i = 0; i < MAX; i++) a[i] = 0;\n\t\t\n\t\t//add 1/n\n\t\tdiv(n, d);\n\t\tadd(d, a);\n\t\t\n\t\tif (m == 1) {\n\t\t\tfor (int i = n - 1; i > 0; i--) {\n\t\t\t\tdiv(n * i, d);\n\t\t\t\tadd(d, a);\n\t\t\t}\n\t\t}\n\t\t\n\t\t//fix(d, a);\n\t\t\n\t\tcout << a[0] << \".\";\n\t\tfor (int i = 1; i <= r; i++) cout << a[i];\n\t\tcout << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 1250, "memory_kb": 3160, "score_of_the_acc": -0.4865, "final_rank": 13 }, { "submission_id": "aoj_0504_2450717", "code_snippet": "#include <iostream>\nusing namespace std;\n\nconst int MAX = 10020;\nint d[MAX + 5];\nint a[MAX + 5];\n\nvoid div(int n, int *d) {\n\tint val = 1;\n\tfor (int i = 0; i < MAX; i++) {\n\t\td[i] = val / n;\n\t\tval %= n;\n\t\tval *= 10;\n\t}\n}\n\nvoid add(int *src, int *dst) {\n\tfor (int i = MAX - 1; i >= 0; i--) {\n\t\tdst[i] += src[i];\n\t}\n\tfor (int i = MAX - 1; i > 0; i--) {\n\t\tdst[i - 1] += dst[i] / 10;\n\t\tdst[i] %= 10;\n\t}\n}\n\nvoid fix(int *tmp, int *a) {\n\tfor (int i = 0; i < MAX; i++) tmp[i] = 0;\n\ttmp[MAX - 5] = 1;\n\tadd(tmp, a);\n}\n\nint main() {\n\tint n, k, m, r;\n\twhile (cin >> n >> k >> m >> r) {\n\t\tif (!n) break;\n\t\tfor (int i = 0; i < MAX; i++) a[i] = 0;\n\t\t\n\t\t//add 1/n\n\t\tdiv(n, d);\n\t\tadd(d, a);\n\t\t\n\t\tif (m == 1) {\n\t\t\tfor (int i = n - 1; i > 0; i--) {\n\t\t\t\tdiv(n * i, d);\n\t\t\t\tadd(d, a);\n\t\t\t}\n\t\t}\n\t\t\n\t\tfix(d, a);\n\t\t\n\t\tcout << a[0] << \".\";\n\t\tfor (int i = 1; i <= r; i++) cout << a[i];\n\t\tcout << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 1260, "memory_kb": 3064, "score_of_the_acc": -0.2351, "final_rank": 7 }, { "submission_id": "aoj_0504_2383304", "code_snippet": "#include \"bits/stdc++.h\"\n#define ll long long\nusing namespace std;\nvoid calc(int n,int r, vector<int>& ans) {\n\tint digit = 1;\n\tfor (int i = 0; i <= r; i++) {\n\t\tint temp = digit / n;\n\t\ttemp %= 10;\n\t\tans[i] += temp;\n\t\tdigit %= n;\n\t\tdigit *= 10;\n\t}\n}\n\nint main() {\n\tint n, k, m, r;\n\twhile (true) {\n\t\tcin >> n >> k >> m >> r;\n\t\tif (n == 0 && k == 0 && m == 0 && r == 0) break;\n\t\tvector<int> ans(10055, 0);\n\t\tcalc(n,10050,ans);\n\t\tif (m == 1) {\n\t\t\tfor (int i = 1; i < n;i++) {\n\t\t\t\tcalc(i*n, 10050, ans);\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 10050; i > 0;i--) {\n\t\t\tans[i - 1] += (ans[i] / 10);\n\t\t\tans[i] %= 10;\n\t\t}\n\n\t\tcout << ans[0] << \".\";\n\t\tfor (int i = 1; i <= r;i++) cout << ans[i];\n\t\tcout << endl;\n\t}\n}", "accuracy": 1, "time_ms": 890, "memory_kb": 3108, "score_of_the_acc": -0.2048, "final_rank": 5 }, { "submission_id": "aoj_0504_2341456", "code_snippet": "#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\t\n#include<map>\n#include<set>\n#include<utility>\n#include<cmath>\n#include<cstring>\n#include<queue>\n#include<stack>\n#include<cstdio>\n#include<sstream>\n#include<iomanip>\n#include<assert.h>\n#define loop(i,a,b) for(int i=a;i<b;i++) \n#define rep(i,a) loop(i,0,a)\n#define pb push_back\n#define mt make_tuple\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\nusing namespace std;\n//kaewasuretyuui\ntypedef long long ll;\ntypedef int Def;\ntypedef pair<Def,Def> pii;\ntypedef vector<Def> vi;\ntypedef vector<vi> vvi;\ntypedef vector<pii> vp;\ntypedef vector<vp> vvp;\ntypedef vector<string> vs;\ntypedef vector<double> vd;\n//typedef tuple<int,int,int> tp;\n//typedef vector<tp> vt;\ntypedef vector<vd> vvd;\ntypedef pair<Def,pii> pip;\ntypedef vector<pip>vip;\nconst double PI=acos(-1);\nconst double EPS=1e-7;\nconst int inf=1e9;\nconst ll INF=2e18;\nint dx[]={0,1,0,-1};\nint dy[]={1,0,-1,0};\nint n,k,m,r;\nint out[10010];\nvoid add(int a){\n\tint t=1;\n\tint co=0;\n\twhile(t&&co<10010){\n\t\tout[co]+=t/a;\n\t\tt=t-t/a*a;\n\t\tt*=10;\n\t\tco++;\n\t}\n\tfor(int i=10009;i>=1;i--){\n\t\tout[i-1]+=out[i]/10;\n\t\tout[i]%=10;\n\t}\n}\nvoid div(int a=n){\n\tint t=0;\n\trep(i,10010){\n\t\tt*=10;\n\t\tt+=out[i];\n\t\tout[i]=t/a;\n\t\tt=t-t/a*a;\n\t}\n}\nint main(){\n\twhile(cin>>n>>k>>m>>r,n){\n\t\trep(i,10010)out[i]=0;\n\t\tif(m){\n\t\t\tloop(i,1,n)add(i);\n\t\t\tdiv();\n\t\t}\n\t\tadd(n);\n\t\tcout<<out[0]<<\".\";\n\t\trep(i,r)cout<<out[i+1];\n\t\tcout<<endl;\n\t}\n}", "accuracy": 1, "time_ms": 1200, "memory_kb": 3080, "score_of_the_acc": -0.2538, "final_rank": 8 }, { "submission_id": "aoj_0504_2082748", "code_snippet": "#include<iostream>\nusing namespace std;\nint a[100000], n, k, m, r;\ninline void Div(int l, int s) {\n\tint p = l * 10, q = s;\n\tfor (int i = 0; i < r + 10; i++) {\n\t\ta[i] += p / q; p = (p%q) * 10;\n\t}\n}\nint main() {\n\twhile (true) {\n\t\tfor (int i = 0; i < 10200; i++)a[i] = 0;\n\t\tcin >> n >> k >> m >> r; if (n == 0)break;\n\t\tDiv(1, n);\n\t\tif (m == 1) { for (int i = 1; i < n; i++) { Div(1, n*i); } }\n\t\tfor (int i = r + 10; i >= 1; i--) {\n\t\t\tif (a[i] >= 10) { a[i - 1] += a[i] / 10; a[i] %= 10; }\n\t\t}\n\t\tcout << a[0] / 10 << '.'; for (int i = 0; i < r; i++)cout << a[i] % 10; cout << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 830, "memory_kb": 3096, "score_of_the_acc": -0.1489, "final_rank": 3 }, { "submission_id": "aoj_0504_2082744", "code_snippet": "#include<iostream>\nusing namespace std;\nint a[100000], n, k, m, r;\ninline void Div(int l, int s) {\n\tint p = l * 10, q = s;\n\tfor (int i = 0; i < r + 10; i++) {\n\t\ta[i] += p / q; p = p%q; p *= 10;\n\t}\n}\nint main() {\n\twhile (true) {\n\t\tfor (int i = 0; i < 10200; i++)a[i] = 0;\n\t\tcin >> n >> k >> m >> r; if (n == 0)break;\n\t\tDiv(1, n);\n\t\tif (m == 1) { for (int i = 1; i < n; i++) { Div(1, n*i); } }\n\t\tfor (int i = r + 10; i >= 1; i--) {\n\t\t\tif (a[i] >= 10) { a[i - 1] += a[i] / 10; a[i] %= 10; }\n\t\t}\n\t\tcout << a[0] / 10 << '.'; for (int i = 0; i < r; i++)cout << a[i] % 10; cout << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 830, "memory_kb": 3040, "score_of_the_acc": 0, "final_rank": 1 } ]
aoj_0506_cpp
0 から 9 までの数字だけで構成された文字列が与えられたとき,その文字列から次の規則に従って新しい文字列を作る操作を考える.与えられた文字列を左端から1文字ずつ順に読んで行き,同じ数字 a が r 個続いていた場合,個数 r と数字 a を空白で区切らずにこの順で書き出す.与えられた文字列の右端まで読み,最後の書き出しが終わったところまでを途中何回書き出しがあったとしても全部まとめて操作1回とカウントする.2回目以降の操作は前回の操作により書き出された文字列を与えられた文字列として同様の操作を実施する.例えば “ 122244 ” という文字列が与えられた場合には左端から順に1個の1, 3個の2,2個の4なのでこの操作1回で得られる文字列は “ 113224 ” であり,“ 44444444444 ” (11 個の4)の場合には得られる文字列は “ 114 ” となる. 100 文字以下の与えられた文字列に上の操作を n 回実施した文字列を出力するプログラムを作成せよ.ただし, n ≤ 20 とする. 入力データ は 2 行からなり,1 行目に操作回数 n , 2 行目に最初の文字列が書かれている. 入力例 5 11 出力例 13112221 入力 入力は複数のデータセットからなる．n が 0 のとき入力が終了する．データセットの数は 5 を超えない． 出力 データセットごとに、指定された回数の操作を施した文字列 を１行に出力する． 入力例 5 11 5 11 0 出力例 13112221 13112221 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0506_4874185", "code_snippet": "#include <iostream>\n#include<string>\nusing namespace std;\n\nint main() {\n int n ;\n string str;\n\n while (true) {\n cin >> n;\n\n if (n == 0) {\n break;\n }\n str = \"\";\n cin >> str;\n\n int cnt;\n string resultStr;\n // n回ループ\n for (int i=0; i<n; i++) {\n cnt = 1;\n resultStr = \"\";\n str.push_back('e');\n\n char crtCh, nxtCh;\n // 文字列数 - 1 回ループ\n for (int j=0; j<str.size()-1; j++) {\n crtCh = str[j];\n nxtCh = str[j+1];\n\n if (crtCh == nxtCh) {\n cnt += 1;\n } else {\n resultStr.append(to_string(cnt));\n resultStr.append(to_string(static_cast<int>(crtCh-'0')));\n cnt = 1;\n }\n }\n\n str = \"\";\n str.assign(resultStr);\n resultStr = \"\";\n\n }\n\n cout << str << endl;\n }\n \n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3284, "score_of_the_acc": -0.4806, "final_rank": 4 }, { "submission_id": "aoj_0506_4431691", "code_snippet": "#include <bits/stdc++.h>\n\nint main()\n{\n std::string str, tmp;\n char c;\n int N, cnt;\n\n while(1) {\n std::cin >> N;\n if (N == 0) break;\n std::cin >> str;\n for (int i = 0; i < N; i++) {\n c = str[0]; cnt = 1; tmp = \"\";\n for (unsigned long j = 1; j < str.size(); j++) {\n if (str[j] == c) {\n cnt++;\n continue;\n } else {\n tmp += std::to_string(cnt) + c;\n cnt = 1;\n c = str[j];\n }\n }\n tmp += std::to_string(cnt) + c;\n str = tmp;\n }\n std::cout << str << std::endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3400, "score_of_the_acc": -0.5742, "final_rank": 10 }, { "submission_id": "aoj_0506_4125147", "code_snippet": "#include <iostream>\n#include <queue>\n#include <string>\n#include <utility>\n\nusing namespace std;\n\nint main()\n{\n int n;\n string str;\n queue<pair<int, int> > q;\n pair<int, int> p;\n\n while (1) {\n cin >> n;\n if (n == 0) break;\n cin.ignore();\n cin >> str;\n int run = 1;\n while (n--) {\n str += \"-\";\n while (!q.empty()) q.pop();\n for (int i = 0; i < str.size() - 1; i++) {\n if (str[i] == str[i + 1]) {\n run++;\n } else {\n p.first = run;\n p.second = str[i] - '0';\n q.push(p);\n run = 1;\n }\n }\n str.clear();\n while (!q.empty()) {\n str += to_string(q.front().first) + to_string(q.front().second);\n q.pop();\n }\n }\n cout << str << endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3416, "score_of_the_acc": -0.5871, "final_rank": 11 }, { "submission_id": "aoj_0506_3817059", "code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\n#include<sstream>\nusing namespace std;\ntemplate < typename T > string to_string( const T& n ){\n {\n ostringstream oss ;\n oss << n ;\n return oss.str() ;\n }\n}\nint main(){\n int n;\n vector<string> a(5);\n for(int i = 0; i < 5;i++){\n a[i] = \"\";\n }\n int k = 0;\n while(1){\n cin >> n;\n if(n == 0)break;\n string s;\n string f = \"\";\n cin >> s;\n for(int i = 0;i < n;i++){\n int size = s.size();\n //cout << s << \" *\" <<endl;\n for(int j = 0;j < size;j++){\n int l = 1;\n while(1){\n if(s[j] == s[j+l] && j + l < size){\n l++;\n }\n else {\n j += l - 1;\n string b = to_string(l);\n f += b;\n f += s[j];\n \n break;\n }\n }\n }\n s = f;\n //cout << k << \" \" << i << \" \" << s << endl; \n f = \"\";\n }\n a[k] = s;\n k++;\n }\n for(int i = 0;i < k;i++){\n cout << a[i] << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3280, "score_of_the_acc": -0.6592, "final_rank": 15 }, { "submission_id": "aoj_0506_3741695", "code_snippet": "#include <cassert>\n\n#include <cctype>\n#include <cerrno>\n#include <cfloat>\n#include <ciso646>\n#include <climits>\n#include <clocale>\n#include <cmath>\n#include <csetjmp>\n#include <csignal>\n#include <cstdarg>\n#include <cstddef>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <ccomplex>\n#include <cfenv>\n#include <cinttypes>\n#include <cstdbool>\n#include <cstdint>\n#include <ctgmath>\n#include <cwchar>\n#include <cwctype>\n\n// C++\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n#include <vector>\n#include <array>\n#include <atomic>\n#include <chrono>\n#include <condition_variable>\n#include <forward_list>\n#include <future>\n#include <initializer_list>\n#include <mutex>\n#include <random>\n#include <ratio>\n#include <regex>\n#include <scoped_allocator>\n#include <system_error>\n#include <thread>\n#include <tuple>\n#include <typeindex>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n// #include <boost/foreach.hpp>\n// #include <boost/range/algorithm.hpp>\n#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)\n#define ll long long\n#define Sort(v) sort(all(v))\n//#define INF 1e9\n#define LINF 1e18\n#define END return 0\n#define pb push_back\n#define se second\n#define fi first\n#define pb push_back\n#define all(v) (v).begin() , (v).end()\n#define MP make_pair\n#define int long long\nusing namespace std;\nint day[12]={31,28,31,30,31,30,31,31,30,31,30,31};\n// int dx[]={0,1,0,-1};\n// int dy[]={1,0,-1,0};\n//typedef pair<int,int> P;\n\nconst long long MOD=1000000007LL;\nbool isupper(char c){if('A'<=c&&c<='Z')return 1;return 0;}\nbool islower(char c){if('a'<=c&&c<='z')return 1;return 0;}\nbool iskaibun(string s){for(int i=0;i<s.size()/2;i++)if(s[i]!=s[s.size()-i-1])return 0;return 1;}\nbool isnumber(char c){return ('0'<=c&&c<='9');}\nbool isalpha(char c){return (isupper(c)||islower(c));}\ntemplate<typename T> \nvoid print(vector<T> v){\n for(int i=0;i<v.size();i++){\n if(i)cout<<\" \";\n cout<<v[i];\n }\n cout<<endl;\n}\nint INF=1e18;\n\ntemplate<typename T>\nvoid printendl(vector<T> v){\n for(auto date:v)cout<<date<<endl;\n}\n\ntemplate<typename T>\nvoid printvv(vector<vector<T>> v){\n for(int i=0;i<v.size();i++){\n for(int j=0;j<v[i].size();j++){\n if(j)cout<<\" \";\n cout<<v[i][j];\n }\n cout<<endl;\n }\n}\nint gcd(int a,int b){\n if(a<b)swap(a,b);\n if(b==0)return a;\n else return gcd(b,a%b);\n}\n\nstruct Edge{\n int to,cost;\n};\nstruct S{\n int n;\n char c;\n};\n\nstring f(string s){\n vector<S> v;\n rep(i,0,s.size()){\n int num=1;\n while(i+1<s.size() && s[i]==s[i+1]){\n i++;\n num++;\n }\n v.push_back(S{num,s[i]});\n }\n\n string ret;\n for(int i=0;i<v.size();i++){\n ret+=to_string(v[i].n)+v[i].c;\n }\n return ret;\n}\n\nsigned main (){\n int n;\n while(cin>>n){\n if(n==0)break;\n string s;\n cin>>s;\n rep(i,0,n){\n s=f(s);\n }\n cout<<s<<endl;\n }\n\n\n \n\n \n \n}\n/*\n\n*/", "accuracy": 1, "time_ms": 10, "memory_kb": 3928, "score_of_the_acc": -1, "final_rank": 17 }, { "submission_id": "aoj_0506_3448042", "code_snippet": "#include <cstdio>\n#include <cctype>\n#include <utility>\n#include <string>\nusing namespace std;\n\n#define gcu getchar_unlocked\n#define pcu putchar_unlocked\n#define _T template <typename T>\n#define _HT template <typename H, typename... T>\n#define _il inline\n#define _in _il int in\n#define _sc _il bool scan\n_T T in(int c){T n=0;bool m=false;while(isspace(c)){c=gcu();}if(c=='-')m=true,c=gcu();\n\tdo{n=10*n+(c-'0'),c=gcu();}while(c>='0');return m?-n:n;} //&&c<='9'\n_in() {return in<int>(gcu());}\n_T T scan(T &n){int c=gcu();return c==EOF?false:(n=in<T>(c),true);}\n_sc(char &c){c=gcu();gcu();return c!=EOF;}\n#ifdef _GLIBCXX_STRING\n_sc(string &s){int c;s=\"\";\n\tfor(;;){c=gcu();if(c=='\\n'||c==' ')return true;else if(c==EOF)return false;s+=c;}}\n#endif\n_HT _sc(H &h, T&&... t){return scan(h)&&scan(t...);}\n#define _vo _il void out\n#define _vl _il void outl\n_vo(bool b) {pcu('0'+b);}\n_vo(const char *s){while(*s)pcu(*s++);}\n_vo(char c){pcu(c);}\n#ifdef _GLIBCXX_STRING\n_vo(string s){for(char c:s)pcu(c);}\n#endif\n_T _vo(T n){static char buf[20];char *p=buf;\n\tif(n<0)pcu('-'),n*=-1;if(!n)*p++='0';else while(n)*p++=n%10+'0',n/=10;\n\twhile (p!=buf)pcu(*--p);}\n_vl(){out('\\n');}\n#ifdef _GLIBCXX_VECTOR\n_T _vo(vector<T> &v){for(T &x:v)out(&x == &v[0]?\"\":\" \"),out(x);outl();}\n#endif\n_HT _vo(H&& h, T&&... t){out(h);out(move(t)...);}\ntemplate <typename... T> _vl(T&&... t){out(move(t)...);outl();}\n\nint main() {\n\tstring s, b;\n\tfor (int n; (n = in());) {\n\t\tscan(s);\n\t\twhile (n--) {\n\t\t\tb = \"\";\n\t\t\tchar p = ' ';\n\t\t\tint q = 0;\n\t\t\tfor (char c: s) {\n\t\t\t\tif (c == p)\n\t\t\t\t\tq++;\n\t\t\t\telse {\n\t\t\t\t\tif (q)\n\t\t\t\t\t\tb += to_string(q) + p;\n\t\t\t\t\tq = 1;\n\t\t\t\t\tp = c;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (q)\n\t\t\t\tb += to_string(q) + p;\n\t\t\ts = b;\n\t\t}\n\t\toutl(s);\n\t}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 2688, "score_of_the_acc": 0, "final_rank": 1 }, { "submission_id": "aoj_0506_3388254", "code_snippet": "#include <iostream>\n#include <iomanip>\n#include <fstream>\n#include <stdio.h>\n#include <math.h>\n#include <time.h>\n#include <string>\n#include <tuple>\n#include <vector>\n#include <map>\n#include <unordered_map>\n#include <list>\n#include <set>\n#include <stack>\n#include <queue>\n#include <cstdlib>\n#include <algorithm>\n#include <random>\n#include <cassert>\nusing namespace std;\n#define LL long long\n#define MP(a, b) make_pair(a, b)\n#define POWER9 1000000000\n#define MOD POWER9+7\n#undef INT_MIN\n#undef INT_MAX\n#define INT_MIN -2147483647\n#define INT_MAX 2147483647\n#define LL_MIN (LL)-9223372036854775807\n#define LL_MAX (LL)9223372036854775807\n#define PI 3.14159265359\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout << setprecision(9);\n\n\twhile(true){\n\tint n;\n\tcin >> n;\n\tif(n == 0) return 0;\n\tstring S;\n\tcin >> S;\n\tfor(int q=0; q<n; q++){\n\t\tstring next = \"\";\n\t\tint now = 0;\n\t\tchar l = '-';\n\t\tfor(int i=0; i<S.size(); i++){\n\t\t\tif(S[i] != l){\n\t\t\t\tif(now > 0) next+= to_string(now) + l;\n\t\t\t\tl = S[i];\n\t\t\t\tnow = 0;\n\t\t\t}\n\t\t\tnow++;\n\t\t}\n\t\tif(now > 0) next+= to_string(now) + l;\n\t\tS = next;\n\t}\n\tcout << S << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3336, "score_of_the_acc": -0.5226, "final_rank": 8 }, { "submission_id": "aoj_0506_3345611", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\nstring operation(string s){\n\tstring ret = \"\";\n\tint it = 0;\n\twhile(it < s.size()){\n\t\tint cnt = 1;\n\t\twhile(it < s.size()-1 && s[it] == s[it+1]){\n\t\t\tcnt++;\n\t\t\tit++;\n\t\t}\n\t\tret += to_string(cnt) + s[it];\n\t\tit++;\n\t}\n\treturn ret;\n}\n\nint main() {\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\n\twhile(true){\n\t\tint n; cin >> n;\n\t\tif(n==0) break;\n\t \tstring s; cin >> s;\n\n\t\tfor (int i = 0;i < n;i++){\n\t\t\ts = operation(s);\n\t\t}\n\n\t\tcout << s << endl;\n\t}\n\n\treturn 0;\n\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3332, "score_of_the_acc": -0.5194, "final_rank": 7 }, { "submission_id": "aoj_0506_3096237", "code_snippet": "#include <stdio.h>\n#include <iostream>\n#include <string>\n\nusing namespace std;\n\nint main() {\n while (1) {\n int n;\n scanf(\"%d\", &n);\n if (n == 0) {\n break;\n }\n\n string now, tmp;\n cin >> now;\n int size;\n int cnt = 0;\n char before = ' ';\n for (int i = 0; i< n; i++) {\n tmp = now;\n size = tmp.size();\n for (int j = 0; j < size; j++) {\n if (j == 0) {\n now = \"\";\n cnt = 1;\n } else {\n if (before == tmp[j]) {\n cnt++;\n } else {\n now += to_string(cnt) + before;\n cnt = 1;\n }\n }\n \n before = tmp[j];\n if (j == size-1) {\n now += to_string(cnt) + before;\n }\n }\n }\n cout << now << \"\\n\";\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3464, "score_of_the_acc": -0.6258, "final_rank": 14 }, { "submission_id": "aoj_0506_2660598", "code_snippet": "#include <iostream>\n#include <string>\nusing namespace std;\n\nint main(){\n string in;\n int n;\n while(cin >> n >> in){\n if(n == 0) break;\n string nstr = \"\";\n int count = 1;\n for(int j = 0;j<n;j++){\n nstr = \"\";\n count = 1;\n for(int i = 1;i<in.length();i++){\n if(in[i-1] != in[i]){\n nstr += to_string(count) + in[i-1];\n count = 1;\n }\n else{\n count++;\n }\n // cout << nstr << endl;\n }\n nstr += to_string(count) + in[in.length()-1];\n in = nstr;\n }\n cout << in << endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3260, "score_of_the_acc": -0.4613, "final_rank": 3 }, { "submission_id": "aoj_0506_2585582", "code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n#define INF 1<<30\n#define LINF 1LL<<60\n\n/*\n<url:http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0506>\n?????????============================================================\n0 ?????? 9 ?????§?????°???????????§?§??????????????????????????????????????????¨???,\n??????????????????????¬??????????????????£?????°??????????????????????????????????????????.\n???????????????????????????????????????1??????????????????????????§??????,????????°??? a ??? r ????¶???????????????´???,\n?????° r ??¨??°???a ???????????§??????????????????????????§????????????.??????????????????????????????????????§??????,\n????????????????????????????????£?????¨???????????§???????????????????????????????????£?????¨???????????¨??¨?????¨??????\n??????1?????¨??????????????????.2????????\\????????????????????????????????????????????????????????????????????????????????????\n???????????¨??????????§?????????????????????????.????????° ???122244??? ??¨???????????????????????????????????´?????????\n??????????????????1??????1, 3??????2,2??????4????????§????????????1?????§???????????????????????? ???113224??? ??§??????\n,???44444444444??? (11 ??????4)?????´????????????????????????????????? ???114??? ??¨??????.\n\n100 ????????\\???????????????????????????????????????????????? n ???????????????????????????????????????????????°?????????????????????.\n?????????, n ??? 20 ??¨??????.\n=================================================================\n??\\???=============================================================\n??\\???????????°????????????????????????????????????n ??? 0 ?????¨?????\\????????????????????????????????????????????°??? 5 ????¶?????????????\n================================================================\n??????=============================================================\n???????????????????????¨??????????????????????????°?????????????????????????????? ???????????????????????????\n================================================================\n?§£??¬=============================================================\n\n================================================================\n*/\nint main(void) {\n\tcin.tie(0); ios::sync_with_stdio(false);\n\tll n;\n\twhile (cin >> n, n) {\n\t\tstring s; cin >> s;\n\t\tfor (int i = 0; i < n;i++) {\n\t\t\tchar c;\n\t\t\tint cnt;\n\t\t\tstring next;\n\t\t\tfor (int j = 0; j <= s.length(); j++) {\n\t\t\t\tif (j == s.length()) {\n\t\t\t\t\tnext += to_string(cnt) + c;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tif (j == 0) {\n\t\t\t\t\t\tc = s[j]; cnt = 1;\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tif (c == s[j])cnt++;\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tnext += to_string(cnt) + c;\n\t\t\t\t\t\t\tc = s[j];\n\t\t\t\t\t\t\tcnt = 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\ts = next;\n\t\t}\n\t\tcout << s << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3344, "score_of_the_acc": -0.529, "final_rank": 9 }, { "submission_id": "aoj_0506_2545348", "code_snippet": "#include <iostream>\n#include <sstream>\n\nint main() {\n int n;\n while (std::cin >> n && n) {\n std::string s1, s2;\n std::cin >> s1;\n\n for (int i = 0; i < n; i++) {\n s1 += 'a';\n s2 = \"\";\n char pre = s1[0];\n s1.erase(s1.begin(), s1.begin() + 1);\n int count = 1;\n for (char cur : s1) {\n if (pre == cur) {\n count++;\n } else {\n std::stringstream ss(\"\");\n ss << count, s2 += ss.str() + pre;\n pre = cur, count = 1;\n }\n }\n s1 = s2;\n }\n std::cout << s1 << std::endl;\n }\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3104, "score_of_the_acc": -0.6082, "final_rank": 13 }, { "submission_id": "aoj_0506_2467373", "code_snippet": "#include <string>\n#include <iostream>\nusing namespace std;\n\nstring change(string s) {\n\tstring res = \"\";\n\tchar c = s.front();\n\tint count = 1;\n\tfor (auto i = s.begin()+1;i != s.end();++i) {\n\t\tif (*i == c) {\n\t\t\t++count;\n\t\t} else {\n\t\t\tres += to_string(count) + c;\n\t\t\tc = *i;\n\t\t\tcount = 1;\n\t\t}\n\t}\n\tres += to_string(count) + c;\n\treturn res;\n}\n\nint main() {\n\twhile (true) {\n\t\tint n;\n\t\tcin >> n;\n\t\tcin.ignore();\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tstring s;\n\t\tcin >> s;\n\t\twhile (n--) {\n\t\t\ts = change(s);\n\t\t}\n\t\tcout << s << endl;\n\t}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3224, "score_of_the_acc": -0.4323, "final_rank": 2 }, { "submission_id": "aoj_0506_2189741", "code_snippet": "#include <stdio.h>\n#include <string.h>\n\nchar str[100000];\nchar ans[100000];\n\nvoid sort();\nint main(){\n int n;\n while (1){\n scanf(\"%d\", &n);\n if (n == 0){ break; }\n scanf(\"%s\", str);\n while( n>0 ){\n sort();\n memcpy(str, ans, sizeof(ans));\n n--;\n }\n printf(\"%s\\n\", ans);\n }\n return 0;\n}\nvoid sort(){\n\n int\ti, j, len;\n char\tcountbuf[10], valuebuf[10];\n int\tcount;\n\n len = strlen(str);\n memset(ans, '\\0', sizeof(ans));\n for (i = 0; i < len; i++){\n if (str[i-1] != str[i]){\n count = 0;\n for (j = i; j < len; j++){\n\tif (str[i] == str[j]){\n\t count++;\n\t}\n\telse{ break; }\n }\n memset(valuebuf, '\\0', sizeof(valuebuf));\n sprintf(countbuf, \"%d\", count);\n valuebuf[0] = str[i];\n strcat(ans, countbuf);\n strcat(ans, valuebuf);\n memset(countbuf, '\\0', sizeof(countbuf));\n }\n }\n}", "accuracy": 1, "time_ms": 110, "memory_kb": 2768, "score_of_the_acc": -0.9736, "final_rank": 16 }, { "submission_id": "aoj_0506_2189694", "code_snippet": "#include <stdio.h>\n#include <string.h>\n\nchar str[100000];\nchar ans[100000];\n\nvoid sort();\n\nint main(){\n\n int n;\n while (1){\n scanf(\"%d\", &n);\n if (n == 0){ break; }\n scanf(\"%s\", str);\n while( n>0 ){\n sort();\n memcpy(str, ans, sizeof(ans));\n n--;\n }\n printf(\"%s\\n\", ans);\n }\n\n return 0;\n}\nvoid sort(){\n\n int\ti, j, len;\n char\tc = '\\0';\n char\tcountbuf[10], valuebuf[10];\n int\tcount;\n\n len = strlen(str);\n memset(ans, '\\0', sizeof(ans));\n for (i = 0; i < len; i++){\n if (c != str[i]){\n count = 0;\n for (j = i; j < len; j++){\n\tif (str[i] == str[j]){\n\t count++;\n\t}\n\telse{ break; }\n }\n memset(valuebuf, '\\0', sizeof(valuebuf));\n sprintf(countbuf, \"%d\", count);\n valuebuf[0] = str[i];\n strcat(ans, countbuf);\n strcat(ans, valuebuf);\n memset(countbuf, '\\0', sizeof(countbuf));\n c = str[i];\n }\n }\n}", "accuracy": 1, "time_ms": 110, "memory_kb": 2824, "score_of_the_acc": -1.0188, "final_rank": 19 }, { "submission_id": "aoj_0506_2189657", "code_snippet": "#include <stdio.h>\n#include <string.h>\n\nint main()\n{\n int\tn;\n char\tstr[100000];\n char\ttmp[100000];\n\n while(1){\n scanf(\"%d\",&n);\n if (n == 0){ break; }\n scanf(\"%s\",str);\n \t\n while( n>0 ){\n int\ti,j,len;\n\n len = strlen(str);\n memset(tmp, '\\0', sizeof(tmp));\n char\tc = '\\0';\n char\tcountbuf[10],valuebuf[10];\n int\tcount;\n\n for(i = 0;i < len;i++){\n\tif (c != str[i]){\n\t count = 0;\n\t for (j = i; j < len; j++){\n\t if( str[i]==str[j]){\n\t count++;\n\t }else{\n\t break;\n\t } \n\t }\n\t memset(valuebuf,'\\0',sizeof(valuebuf));\n\t valuebuf[0] = str[i];\n\t sprintf(countbuf,\"%d\", count);\n\t strcat(tmp,countbuf);\n\t strcat(tmp,valuebuf);\n\t memset(countbuf, '\\0', sizeof(countbuf));\n\t c = str[i];\n\t}\n }\n memcpy(str,tmp,sizeof(tmp)); \n n--;\n }\n \n printf(\"%s\\n\", tmp);\t\n }\n return 0;\n}", "accuracy": 1, "time_ms": 110, "memory_kb": 2812, "score_of_the_acc": -1.0091, "final_rank": 18 }, { "submission_id": "aoj_0506_2185980", "code_snippet": "#define _USE_MATH_DEFINES\n#include \"bits/stdc++.h\"\nusing namespace std;\n\n//#define int long long\n#define DBG 1\n#define dump(o) if(DBG){cerr<<#o<<\" \"<<o<<endl;}\n#define dumpc(o) if(DBG){cerr<<#o; for(auto &e:(o))cerr<<\" \"<<e;cerr<<endl;}\n#define rep(i,a,b) for(int i=(a);i<(b);i++)\n#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)\n#define each(it,c) for(auto it=(c).begin();it!=(c).end();it++)\n#define all(c) c.begin(),c.end()\nconst int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;\nconst int MOD = (int)(1e9 + 7);\n\nsigned main() {\n\tint n;\n\twhile (cin >> n, n) {\n\t\tstring s; cin >> s;\n\t\twhile (n--) {\n\t\t\tstring t;\n\t\t\tint i(0);\n\t\t\twhile (i < s.length()) {\n\t\t\t\tint x(1);\n\t\t\t\tfor (int j = i + 1; j < s.length() && s[i] == s[j]; j++) {\n\t\t\t\t\tx++;\n\t\t\t\t}\n\t\t\t\tt += to_string(x) + s[i];\n\t\t\t\ti += x;\n\t\t\t}\n\t\t\ts = t;\n\t\t}\n\t\tcout << s << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3324, "score_of_the_acc": -0.5129, "final_rank": 5 }, { "submission_id": "aoj_0506_2181505", "code_snippet": "#include <stdio.h>\n#include <string.h>\n\nint main()\n{\n int\tn;\n char\tstr[100000];\n char\ttmp[100000];\n\n while(1){\n scanf(\"%d\",&n);\n if (n == 0){ break; }\n scanf(\"%s\",str);\n \t\n while( n>0 ){\n int i,j,len;\n\n len = strlen(str);\n memset(tmp, '\\0', sizeof(tmp));\n char c = '\\0';\n char\tcountbuf[10],valuebuf[10];\n int count;\n\n for(i = 0;i < len;i++){\n\tif (c != str[i]){\n\t count = 0;\n\t for (j = i; j < len; j++){\n\t if( str[i]==str[j]){\n\t count++;\n\t }else{\n\t break;\n\t } \n\t }\n\t memset(valuebuf,'\\0',sizeof(valuebuf));\n\t valuebuf[0] = str[i];\n\t sprintf(countbuf,\"%d\", count);\n\t strcat(tmp,countbuf);\n\t strcat(tmp,valuebuf);\n\t memset(countbuf, '\\0', sizeof(countbuf));\n\t c = str[i];\n\t}\n }\n memcpy(str,tmp,sizeof(tmp)); \n n--;\n }\n \n printf(\"%s\\n\", tmp);\t\n }\n return 0;\n}", "accuracy": 1, "time_ms": 120, "memory_kb": 2864, "score_of_the_acc": -1.1419, "final_rank": 20 }, { "submission_id": "aoj_0506_2126072", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define Rep(i,N) for(int i = 0;i < N;i++)\n\nstring to_str(int n){\n ostringstream os;\n os << n;\n return os.str();\n}\n\nint main()\n{\n int N;\n string s;\n while(cin >> N,N) {\n cin >> s;\n while(N--) {\n string w;\n int np = 0;\n while(np < s.size()){\n\tchar c = s[np];\n\tint i = 1;\n\tfor(np = np + 1;s[np] == c && np < s.size();np++,i++);\n\tw += to_str(i);\n\tw += c;\n }\n s = w;\n }\n cout << s << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3204, "score_of_the_acc": -0.5979, "final_rank": 12 }, { "submission_id": "aoj_0506_2110280", "code_snippet": "#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n\tint N,cnt;\n\tstring str,str2;\n\tchar ch;\n\twhile(true){\n\t\tcin>>N;\n\t\tif(N==0) break;\n\t\tcin>>str;\n\t\tfor(int i=0;i<N;i++){\n\t\t\tcnt=1;\n\t\t\tstr2=\"\";\n\t\t\tfor(int j=0;j<str.size()-1;j++){\n\t\t\t\tif(str[j]!=str[j+1]){\n\t\t\t\t\tstr2+=(to_string(cnt)+str[j]);\n\t\t\t\t\tcnt=1;\n\t\t\t\t}\n\t\t\t\telse cnt++;\n\t\t\t}\n\t\t\tstr2+=(to_string(cnt)+str[str.size()-1]);\n\t\t\tswap(str,str2);\n\t\t}\n\t\tcout<<str<<endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3328, "score_of_the_acc": -0.5161, "final_rank": 6 } ]
aoj_0505_cpp
ある学校で修学旅行へ行く計画がある.そのためにアンケート調査を行った. 生徒は 1 から n までの生徒番号を持ち,旅行候補の場所を 1 から m までの番号で表し,行きたい場所に ○,行きたくない場所に×の印をつけて提出している. このとき, 行きたい場所の人数が多い順に,場所の番号を出力するプログラムを作成せよ.人数が同じときは,場所の番号順とする. 入力データ の 1 行目は生徒の人数 n と旅行候補の場所の数 m が空白で区切られ, i + 1 行に生徒 i のアンケート結果を ○ は 1 で×は 0 で表し,空白で区切られた m 個の数字が並んでいる.1 ≤ n ≤ 1000, 1 ≤ m ≤ 100 とする. 入力例１ 4 6 1 0 1 0 1 1 1 1 0 1 0 0 1 1 1 0 0 0 1 0 1 0 1 0 出力例１ 1 3 2 5 4 6 入力 入力は複数のデータセットからなる．n, m がともに 0 のとき入力が終了する．データセットの数は 5 を超えない． 出力 データセットごとに、場所の番号 を１行に出力する． 入力例 4 6 1 0 1 0 1 1 1 1 0 1 0 0 1 1 1 0 0 0 1 0 1 0 1 0 4 6 1 0 1 0 1 1 1 1 0 1 0 0 1 1 1 0 0 0 1 0 1 0 1 0 0 0 出力例 1 3 2 5 4 6 1 3 2 5 4 6 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0505_8133272", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\n\nint main() {\n \n ll N,M;\n while(cin>>N>>M){\n \n if(N+M==0)return 0;\n vector<pair<ll,ll>> P(M,{0,0});\n rep(i,M)P[i].second=-i;\n rep(i,N){\n rep(j,M){\n ll a;\n cin>>a;\n P[j].first+=a;\n }\n }\n sort(all(P));\n reverse(all(P));\n rep(i,M)cout<<-P[i].second+1<<\" \\n\"[i==M-1];}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3132, "score_of_the_acc": -0.0601, "final_rank": 11 }, { "submission_id": "aoj_0505_7142162", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n\n\nint main(){\n int flag=0;\n while(1){\n int n,m;\n cin >> n;\n if(cin.eof()){\n break;\n }\n cin >> m;\n if(flag){\n cout << endl;\n }\n flag =1;\n vector<int> data(m,0);\n for(int i=0;i<n;i++){\n for(int j=0;j<m;j++){\n int x;\n cin >> x;\n if(x){\n data.at(j) += 1;\n }\n }\n }\n for(int i=0;i<m;i++){\n int max = 0, max_point = 0;\n for(int j=0;j<m;j++){\n if(data.at(j) > max){\n max = data.at(j);\n max_point = j;\n }\n }\n cout << max_point+1;\n data.at(max_point) = -1;\n if(i!=m-1){\n cout << \" \";\n }\n }\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3400, "score_of_the_acc": -0.172, "final_rank": 17 }, { "submission_id": "aoj_0505_5956613", "code_snippet": "#include<iostream>\n#include<algorithm>\n#include<map>\n#include<queue>\n#include<stack>\n#include<set>\n#include<bitset>\n#include<vector>\n#include<string>\n#include <iomanip>\n#include <deque>\n#include<list>\n#include<cmath>\n#define rep(i,n) for(int i=0;i<(n);i++)\nusing namespace std;\nusing ll=long long;\nusing P=pair<int,int>;\nusing P_S=pair<int,string>;\nusing P_D=pair<double,int>;\nusing T=tuple<int,int,char,ll,string>;\n\nint main()\n{\n int n,m;\n while(1){\n cin>>n>>m;\n if(n==0) break;\n vector<P>score(m);\n rep(i,m){\n score[i].first=0; score[i].second=-i-1;\n }\n rep(i,n){\n rep(j,m){\n int a;\n cin>>a;\n if(a==1) score[j].first++;\n }\n }\n sort(score.begin(),score.end());\n reverse(score.begin(),score.end());\n rep(i,m){\n if(i!=m-1)cout<<-1*score[i].second<<\" \";\n else cout<<-1*score[i].second<<endl;\n }\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3304, "score_of_the_acc": -0.1319, "final_rank": 14 }, { "submission_id": "aoj_0505_5730484", "code_snippet": "#include<iostream>\n#include<algorithm>\n\nusing namespace std;\n\nint main()\n{\n\twhile (true)\n\t{\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tif (n == 0 && m == 0)\n\t\t\tbreak;\n\t\tint* counter = new int[m];\n\t\tfill(counter, counter + m, 0);\n\t\tint a;\n\t\tint* ans = new int[m];\n\t\tfor (int i = 0; i < m; i++)\n\t\t\tans[i] = i;\n\t\tfor(int i = 0 ; i < n ; i++)\n\t\t{\n\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t{\n\t\t\t\tcin >> a;\n\t\t\t\tcounter[j] += (a == 1);\n\t\t\t}\n\t\t}\n\t\tsort(ans, ans + m, [counter](int i1, int i2)->int {return counter[i1] > counter[i2] ||\n\t\t\t(counter[i1] == counter[i2] && i1 < i2) ? 1 : 0; });\n\t\tfor (int i = 0; i < m - 1; i++)\n\t\t\tcout << ans[i] + 1 << ' ';\n\t\tcout << ans[m - 1] + 1 << endl;\n\t}\t\n\n\t//system(\"pause\");\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3112, "score_of_the_acc": -0.0518, "final_rank": 10 }, { "submission_id": "aoj_0505_5726998", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <string>\n#include <cmath>\n#include <bitset>\nusing namespace std;\n\nbool larger(vector<int> x, vector<int> y){\n\tif(x[1] == y[1]){\n\t\treturn x[0] < y[0];\n\t}\n\telse{\n\t\treturn x[1] > y[1];\n\t}\n}\n\nint main(){\n\tint N, M;\n\tcin >> N >> M;\n\twhile(N != 0){\n\t\tvector<vector<int> > result;\n\t\tfor(int i = 0; i < M; i++){\n\t\t\tvector<int> v;\n\t\t\tv.push_back(i + 1);\n\t\t\tv.push_back(0);\n\t\t\tresult.push_back(v);\n\t\t}\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tfor(int j = 0; j < M; j++){\n\t\t\t\tint now;\n\t\t\t\tcin >> now;\n\t\t\t\tresult[j][1] += now;\n\t\t\t}\n\t\t}\n\t\tsort(result.begin(), result.end(), larger);\n\t\tcout << result[0][0];\n\t\tfor(int i = 1; i < M; i++){\n\t\t\tcout << \" \" << result[i][0];\n\t\t}\n\t\tcout << endl;\n\t\tcin >> N >> M;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3380, "score_of_the_acc": -0.1636, "final_rank": 16 }, { "submission_id": "aoj_0505_4996344", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;\n\nint solve(){\n int n, m;\n cin >> n >> m;\n if(n == 0) return 0; \n vector<int> cnt(m);\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < m; ++j) {\n int x; cin >> x;\n cnt[j] += x;\n }\n }\n vector<int> ans(m);\n iota(ans.begin(),ans.end(), 0);\n stable_sort(ans.begin(),ans.end(), [&](int x, int y){ return cnt[x] > cnt[y]; });\n for (int i = 0; i < m; ++i) {\n if(i) printf(\" \");\n printf(\"%d\", ans[i]+1);\n }\n puts(\"\");\n return 1;\n}\n\nint main() {\n while(solve());\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3504, "score_of_the_acc": -0.2154, "final_rank": 18 }, { "submission_id": "aoj_0505_4955854", "code_snippet": "#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<map>\n#include<math.h>\n#include<iomanip>\n#include<set>\n#include<numeric>\n#include<cstring>\n#include<cstdio>\n#include<functional>\n#include<bitset>\n#include<limits.h>\n#include<cassert>\n#include<iterator>\n#include<complex>\n#include<stack>\n#include<sstream>\n#include<iterator>\n#include<list>\n\nusing namespace std;\n\n#define INF 10000000\n#define MOD 1000000007\n#define pi 3.14159265358979\n//#define int long long\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define sort(v) sort((v).begin(), (v).end())\n#define reverse(v) reverse((v).begin(), (v).end())\n#define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge)\n#define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge)\n#define enld endl\n//#define lint long long int\n\nvoid vout(vector<int>A) {\n\trep(i, A.size()) {\n\t\tcout << A[i];\n\t\tif (i == A.size() - 1) {\n\t\t\tcout << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << ' ';\n\t\t}\n\t}\n}\n\nvoid vvout(vector<vector<int>>A) {\n\trep(i, A.size()) {\n\t\trep(j, A[i].size()) {\n\t\t\tcout << A[i][j];\n\t\t\tif (j == A[i].size() - 1) {\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcout << ' ';\n\t\t\t}\n\t\t}\n\t}\n}\n\nint main() {\n\tint N, M;\n\twhile (1) {\n\t\tcin >> N >> M;\n\t\tif (N == 0 && M == 0) {\n\t\t\treturn 0;\n\t\t}\n\t\tvector<vector<int>>A(N, vector<int>(M));\n\t\trep(i, N) {\n\t\t\trep(j, M) {\n\t\t\t\tcin >> A[i][j];\n\t\t\t}\n\t\t}\n\n\t\tint cnt = 0;\n\t\tvector<pair<int, int>>V(M);\n\t\trep(i, M) {\n\t\t\trep(j, N) {\n\t\t\t\tif (A[j][i] == 1) {\n\t\t\t\t\tcnt++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tV[i] = pair<int, int>(cnt, -1*(i + 1));\n\t\t\tcnt = 0;\n\t\t}\n\t\tsort(V);\n\t\treverse(V);\n\t\trep(i, M) {\n\t\t\tcout<<V[i].second* (-1);\n\t\t\tif (i == M - 1) {\n\t\t\t\tcout << enld;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcout << ' ';\n\t\t\t}\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3272, "score_of_the_acc": -0.1185, "final_rank": 13 }, { "submission_id": "aoj_0505_4863210", "code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<n;i++)\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int>P;\nint main() {\n\tint n, m; \n\twhile (cin >> n >> m, n) {\n\t\tP a[101];\n\t\trep(i, n) {\n\t\t\trep(j, m) {\n\t\t\t\ta[j].second = j + 1;\n\t\t\t\tint b; cin >> b;\n\t\t\t\tif (b)a[j].first--;\n\t\t\t}\n\t\t}sort(a, a + m);\n\t\trep(i, m) {\n\t\t\tcout << a[i].second;\n\t\t\tif (i == m - 1)cout << endl;\n\t\t\telse cout << ' ';\n\t\t}\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3084, "score_of_the_acc": -0.0401, "final_rank": 8 }, { "submission_id": "aoj_0505_4664993", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nvector<pair<int, int> > CountOfPlace;\n\nbool cmp(const pair<int, int> &p1, const pair<int, int> &p2) {\n\tif (p1.second == p2.second) {\n\t\treturn p1.first < p2.first;\n\t}\n\treturn p1.second > p2.second;\n}\n\nint main() {\n\tint n, m, num;\n\tvector<pair<int, int> >::iterator pos;\n\n\twhile (cin >> n >> m, n) {\n\t\tCountOfPlace.clear();\n\t\tfor (int j = 0; j < m; ++j) {\n\t\t\tCountOfPlace.push_back({ j,0 });\n\t\t}\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tfor (int j = 0; j < m; ++j) {\n\t\t\t\tcin >> num;\n\t\t\t\tCountOfPlace[j].second += num;\n\t\t\t}\n\t\t}\n\t\tsort(CountOfPlace.begin(), CountOfPlace.end(), cmp);\n\t\tpos = CountOfPlace.begin();\n\t\tcout << pos->first + 1;\n\t\twhile (++pos != CountOfPlace.end()) {\n\t\t\tcout << \" \" << pos->first + 1;\n\t\t}\n\t\tcout << endl;\n\t}\n\t\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3080, "score_of_the_acc": -0.0384, "final_rank": 7 }, { "submission_id": "aoj_0505_4205382", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define pb push_back\n#define fi first\n#define se second\ntypedef pair<ll,ll> P;\nusing VP = vector<P>; using VVP = vector<VP>;\nusing VI = vector<ll>; using VVI = vector<VI>; using VVVI = vector<VVI>;\nconst int inf=1e9+7;\nconst ll INF=1LL<<61;\nconst ll mod=1e9+7;\n\ntemplate<class T>\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T>\ninline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\nint main(){\n int i,j;\n int n,m;\n while(1){\n cin>>n>>m;\n if(n==0) break;\n VI a(m);\n for(i=0;i<n;i++){\n for(j=0;j<m;j++){\n int x;\n cin>>x;\n a[j]+=x;\n }\n }\n vector<P> w;\n for(i=0;i<m;i++){\n w.pb(P(a[i],-i-1));\n }\n sort(w.begin(),w.end());\n reverse(w.begin(),w.end());\n for(i=0;i<m;i++) {\n cout<<-w[i].se;\n if(i!=m-1) cout<<\" \";\n }\n cout<<endl;\n }\n\n\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3004, "score_of_the_acc": -0.0067, "final_rank": 3 }, { "submission_id": "aoj_0505_4182848", "code_snippet": "#include <algorithm>\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nint main() {\n int n, m;\n while (cin >> n >> m, n) {\n vector<pair<int, int>> vec(m);\n\n for (int i = 0; i < m; ++i)\n vec[i] = make_pair(i + 1, 0);\n\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < m; ++j) {\n int tmp;\n cin >> tmp;\n vec[j].second += tmp;\n }\n }\n\n sort(vec.begin(), vec.end(), [](auto &a, auto &b) {\n return (a.second != b.second) ? a.second > b.second : a.first < b.first;\n });\n\n cout << vec[0].first;\n for (int i = 1; i < m; ++i)\n cout << \" \" << vec[i].first;\n cout << endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3092, "score_of_the_acc": -0.0434, "final_rank": 9 }, { "submission_id": "aoj_0505_3806818", "code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\nusing namespace std;\nint main(){\n int answer[5][100];\n int n,m;\n int k = 0;\n int am[5];\n while(cin >> n >> m){\n if(n == 0 && m == 0)break;\n am[k] = m;\n int a[1000][100];\n vector<int> s(m);\n vector<int> c(m);\n for(int i = 0;i < m;i++){\n s[i] = 0;\n }\n for(int i = 0;i < n;i++)for(int j = 0;j < m;j++){\n cin >> a[i][j];\n if(a[i][j] == 1)c[j] = s[j] = s[j] + 1;\n \n }\n \n sort(c.begin(),c.end());\n \n c.erase(unique(c.begin(),c.end()),c.end());\n \n reverse(c.begin(),c.end());\n \n \n int l = 0;\n for(int i = 0;i < c.size();i++){\n for(int j = 0;j < m;j++){\n if(s[j] == c[i]){\n answer[k][l] = j;\n l++;\n }\n }\n }\n k++;\n\n }\n for(int i = 0; i < k;i++){\n for(int j = 0;j < am[i];j++){\n cout << answer[i][j] + 1;\n if(j != am[i] - 1)cout << \" \";\n else cout << endl;\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3512, "score_of_the_acc": -0.2187, "final_rank": 19 }, { "submission_id": "aoj_0505_3741665", "code_snippet": "#include <cassert>\n\n#include <cctype>\n#include <cerrno>\n#include <cfloat>\n#include <ciso646>\n#include <climits>\n#include <clocale>\n#include <cmath>\n#include <csetjmp>\n#include <csignal>\n#include <cstdarg>\n#include <cstddef>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <ccomplex>\n#include <cfenv>\n#include <cinttypes>\n#include <cstdbool>\n#include <cstdint>\n#include <ctgmath>\n#include <cwchar>\n#include <cwctype>\n\n// C++\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n#include <vector>\n#include <array>\n#include <atomic>\n#include <chrono>\n#include <condition_variable>\n#include <forward_list>\n#include <future>\n#include <initializer_list>\n#include <mutex>\n#include <random>\n#include <ratio>\n#include <regex>\n#include <scoped_allocator>\n#include <system_error>\n#include <thread>\n#include <tuple>\n#include <typeindex>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n// #include <boost/foreach.hpp>\n// #include <boost/range/algorithm.hpp>\n#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)\n#define ll long long\n#define Sort(v) sort(all(v))\n//#define INF 1e9\n#define LINF 1e18\n#define END return 0\n#define pb push_back\n#define se second\n#define fi first\n#define pb push_back\n#define all(v) (v).begin() , (v).end()\n#define MP make_pair\n#define int long long\nusing namespace std;\nint day[12]={31,28,31,30,31,30,31,31,30,31,30,31};\n// int dx[]={0,1,0,-1};\n// int dy[]={1,0,-1,0};\n//typedef pair<int,int> P;\n\nconst long long MOD=1000000007LL;\nbool isupper(char c){if('A'<=c&&c<='Z')return 1;return 0;}\nbool islower(char c){if('a'<=c&&c<='z')return 1;return 0;}\nbool iskaibun(string s){for(int i=0;i<s.size()/2;i++)if(s[i]!=s[s.size()-i-1])return 0;return 1;}\nbool isnumber(char c){return ('0'<=c&&c<='9');}\nbool isalpha(char c){return (isupper(c)||islower(c));}\ntemplate<typename T> \nvoid print(vector<T> v){\n for(int i=0;i<v.size();i++){\n if(i)cout<<\" \";\n cout<<v[i];\n }\n cout<<endl;\n}\nint INF=1e18;\n\ntemplate<typename T>\nvoid printendl(vector<T> v){\n for(auto date:v)cout<<date<<endl;\n}\n\ntemplate<typename T>\nvoid printvv(vector<vector<T>> v){\n for(int i=0;i<v.size();i++){\n for(int j=0;j<v[i].size();j++){\n if(j)cout<<\" \";\n cout<<v[i][j];\n }\n cout<<endl;\n }\n}\nint gcd(int a,int b){\n if(a<b)swap(a,b);\n if(b==0)return a;\n else return gcd(b,a%b);\n}\n\nstruct Edge{\n int to,cost;\n};\nstruct S{\n int n,cost;\n};\n\nsigned main (){\n int h,w;\n while(cin>>h>>w){\n if(w+h==0)break;\n vector<int> v(w,0);\n rep(i,0,h){\n rep(j,0,w){\n int x;cin>>x;\n v[j]+=x;\n }\n }\n\n vector<S> ans;\n rep(i,0,w){\n ans.push_back(S{i+1,v[i]});\n }\n sort(all(ans),[&](S a,S b){\n if(a.cost==b.cost)return a.n<b.n;\n else return a.cost>b.cost;\n });\n\n rep(i,0,w){\n if(i)cout<<\" \";\n cout<<ans[i].n;\n }\n cout<<endl;\n }\n\n\n \n\n \n \n}\n/*\n\n*/", "accuracy": 1, "time_ms": 10, "memory_kb": 2992, "score_of_the_acc": -0.0017, "final_rank": 2 }, { "submission_id": "aoj_0505_3700509", "code_snippet": "#include <bits/stdc++.h>\n\n#define REP(i,n) for (int i=0;i<(n);++i)\n#define all(a) (a).begin(),(a).end()\n\nusing namespace std;\n\nusing pii = pair<int, int>;\n\nint main() {\n auto cmp = [](pii p1, pii p2) {\n return p1.first > p2.first || p1.first == p2.first && p1.second < p2.second;\n };\n while (true) {\n int n, m;\n cin >> n >> m;\n if (n == 0) {\n break;\n }\n vector<int> count(m);\n REP(i, n) {\n REP(j, m) {\n int x;\n cin >> x;\n count[j] += x;\n }\n }\n vector<pii> v(m);\n REP(i, m) v[i] = pii(count[i], i);\n sort(all(v), cmp);\n REP(i, m) {\n char c = (i == m - 1 ? '\\n' : ' ');\n cout << v[i].second + 1 << c;\n }\n }\n cout << flush;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3036, "score_of_the_acc": -0.02, "final_rank": 6 }, { "submission_id": "aoj_0505_3688613", "code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n\nusing namespace std;\nint main(){\n int n,m;\n cin >> n >> m;\n while(n != 0 || m != 0){\n vector <vector<int> > nm(n,vector<int>(m,0));\n vector <int> cnt(m,0);\n for(int i = 0 ; i < n ; i++){\n for(int j = 0 ;j < m ; j++ ){\n cin >> nm[i][j];\n\n if(nm[i][j] == 1){\n cnt[j]++;\n }\n }\n }\n int spacecnt = 0;\n for(int i = n ; i >= 0 ; i--){\n for(int j = 0 ; j < m ; j++){\n\n if(cnt[j] == i){\n cout << j+1;\n spacecnt++;\n if(spacecnt < m){\n cout << \" \";\n }\n }\n }\n }\n cout << endl;\n cin >> n >> m;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3336, "score_of_the_acc": -0.1452, "final_rank": 15 }, { "submission_id": "aoj_0505_3464128", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint n,m;\npair<int,int> sum[101];\n\nint main(){\n\twhile(cin >> n >> m, n != 0){\n\t\tfor(int i = 0; i < m; i++){\n\t\t\tsum[i].first = 0;\n\t\t\tsum[i].second = m-i;\n\t\t}\n\t\tfor(int i = 0; i < n; i++){\n\t\t\tfor(int j = 0; j < m; j++){\n\t\t\t\tint t;\n\t\t\t\tcin >> t;\n\t\t\t\tsum[j].first += t;\n\t\t\t}\n\t\t}\n\t\tsort(sum,sum+m,greater<pair<int,int> >());\n\t\tfor(int i = 0; i < m; i++){\n\t\t\tif(i != 0){\n\t\t\t\tcout << \" \";\n\t\t\t}\n\t\t\tcout << m - sum[i].second + 1;\n\t\t}\n\t\tcout << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 2988, "score_of_the_acc": 0, "final_rank": 1 }, { "submission_id": "aoj_0505_3349868", "code_snippet": "#include<iostream>\n#include<cstdio>\n#include<algorithm>\n#include<cstring>\nusing namespace std;\nstruct kkk\n{\n\tint sc,s;\n}ans[1010];\nint comp(kkk a,kkk b)\n{\n\tif(a.sc>b.sc)return 1;\n\tif(a.sc<b.sc)return 0;\n\tif(a.sc==b.sc)\n\t{\n\t\tif(a.s<b.s)return 1;\n\t\telse return 0;\n\t}\n}\nint main()\n{\n\tint i,j,n,m,k;\n\twhile(scanf(\"%d%d\",&n,&m)&&n!=0&&m!=0)\n\t{\n\t\tmemset(ans,0,sizeof(ans));\n\tfor(i=1;i<=m;i++)\n\t{\n\t\tans[i].s=i;\n\t}\n\tfor(i=1;i<=n;i++)\n\t{\n\t\tfor(j=1;j<=m;j++)\n\t\t{\n\t\t\tcin>>k;\n\t\t\tans[j].sc+=k;\n\t\t}\n\t}\n\tsort(ans+1,ans+1+m,comp);\n\tcout<<ans[1].s;\n\tfor(i=2;i<=m;i++)\n\t{\n\t\tcout<<\" \"<<ans[i].s;\n\t}\n\tcout<<endl;\n }\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3212, "score_of_the_acc": -0.0935, "final_rank": 12 }, { "submission_id": "aoj_0505_3326393", "code_snippet": "#include<iostream>\nusing namespace std;\n\nint main()\n{\n int n, m, a, p[100], o[100];\n\n while( cin >> n >> m )\n {\n if( n == 0 && m == 0 )\n break;\n \n for( int i = 0; i < 100; i++ )\n {\n p[i] = 0;\n o[i] = i;\n }\n\n for( int i = 0; i < n; i++ )\n for( int j = 0; j < m; j++ )\n {\n cin >> a;\n if( a == 1 )\n p[j]++;\n }\n\n for( int i = 0; i < m; i++ )\n for( int j = 0; j < m - 1; j++ )\n if( p[j] < p[j+1] )\n {\n int temp = p[j];\n p[j] = p[j+1];\n p[j+1] = temp;\n\n temp = o[j];\n o[j] = o[j+1];\n o[j+1] = temp;\n }\n \n for( int i = 0; i < m - 1; i++ )\n cout << o[i] + 1 << \" \";\n cout << o[m-1] + 1 << endl;\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3020, "score_of_the_acc": -0.0134, "final_rank": 4 }, { "submission_id": "aoj_0505_3180144", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cstdio>\nusing namespace std;\n\nint main(void){\n vector<pair<int, int> > cnt; // cnt[i] = {vote cnt, cand id}\n int n,m;\n \n while(true){\n cin >> n >> m;\n if (n==0 && m==0) break;\n cnt = vector<pair<int, int> >(m);\n for (int i=0; i<m; i++){\n cnt[i].first = 0;\n cnt[i].second = i+1;\n }\n for (int i=0; i<n; i++){\n for (int j=0; j<m; j++){\n int t;\n cin >> t;\n cnt[j].first -= t;\n }\n }\n stable_sort(cnt.begin(), cnt.end());\n cout << cnt[0].second;\n for (int i=1; i<m; i++){\n cout << \" \" << cnt[i].second;\n }\n cout << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3032, "score_of_the_acc": -0.0184, "final_rank": 5 }, { "submission_id": "aoj_0505_3102540", "code_snippet": "#include<iostream>\n#include<climits>\n#include<math.h>\n#include<vector>\n#include<algorithm>\n#include<cstdio>\n#include<stdio.h>\n#include <string>\n#include <complex>\n#include <functional>\nusing namespace std;\ntypedef pair<int,int> P;\ndouble dat[100][100];\nint dp[6][1010];//動的計画法\nint prime[10000001];\nchar str[1010][1010];\nvector<pair<int,int> > pc[100001];\nint ABS(int a){return max(a,-a);}\nint main(){\n int n,m,tmp;\n while(cin>>n>>m,n){\n\t vector<pair<int,int> > place(m);\n\t for(int i=0;i<m;i++) {\n\t\t place[i].second = i+1;\n\t\t place[i].first = 0;\n\t }\n\t for(int i=0;i<n;i++){\n\t\t for(int j=0;j<m;j++){\n\t\t\t cin>>tmp;\n\t\t\t place[j].first -=tmp;\n\t\t }\n\t }\n\t sort(place.begin(),place.end());\n\t\tfor(int i=0;i<m;i++) cout<<(i?\" \":\"\")<<place[i].second;\n\t\tcout<<endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5384, "score_of_the_acc": -1, "final_rank": 20 } ]
aoj_0514_cpp
品質検査 問題 あなたはある機械の製造工場で品質管理の責任者をしている． この機械には， 部品として電源とモーターとケーブルが必要である． 製造工場には電源が a 個， モーターが b 個， ケーブルが c 個あり， それぞれ 1 から a まで， a+1 から a+b まで， a+b+1 から a+b+c までの番号が付いている． 困ったことに， 部品の中に故障しているものがあるかもしれない． 工場ではどの部品が故障していてどの部品が正常であるかを知りたい． そこで， 工場では次の方法で部品を検査した． 電源とモーターとケーブルを１つずつ持ってきてつなぎ， 動作させてみる． このとき， ３つの部品がすべて正常であるときは正しく動作して「合格」とわかる． ３つの中に故障している部品が１つでも入っているときは正しく動作しないので「不合格」とわかる． （工場で作っている機械はとても精密なので， 故障した部品がまざっているのに偶然正しく動作してしまうなどということは起きないのだ．） あなたには検査結果のリストが渡される． 検査結果のリストの各行には， 検査に使った電源とモーターとケーブルの番号と， 検査が合格だったか不合格だったかが書かれている． 検査結果のリストが与えられたとき， すべての部品を， 検査結果から確実に故障しているとわかる部品と， 確実に正常とわかる部品と， 検査結果からは故障しているとも正常であるとも決まらない部品に分類するプログラムを作成せよ． 入力 入力は複数のデータセットからなる．各データセットの形式は以下の通りである．入力は３つのゼロを含む行で終了する． 1 行目には 3 個の整数が空白区切りで書かれており， 順に電源の個数 a, モーターの個数 b, ケーブルの個数 c を表す． 2 行目には 1 個の整数が書かれており， 検査結果のリストに含まれる検査の回数 N が書かれている． 続く N 行は検査結果のリストを表す． 各行には， 4 個の整数 i, j, k, r が１つの空白を区切りとして書かれており， 電源 i とモーター j とケーブル k をつないで検査した結果が， 「合格」 (r=1 のとき) か「不合格」 (r=0 のとき) だったことを表す. a, b, c, N は 1 ≤ a, b, c ≤ 100, 1 ≤ N ≤ 1000 を満たす. データセットの数は 5 を超えない． 出力 データセットごとに以下の形式で出力する．各データセットの出力は a+b+c 行からなる. i 行目 (1 ≤ i ≤ a+b+c)： 検査結果から部品 i が故障しているとわかる場合は 0 を出力する. 検査結果から部品 i が正常とわかる場合は 1 を出力する. 検査結果から部品 i が故障しているか正常であるかが決まらない場合は 2 を出力する. 入出力例 入力例 2 2 2 4 2 4 5 0 2 3 6 0 1 4 5 0 2 3 5 1 0 0 0 出力例 2 1 1 0 1 0 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0514_3038716", "code_snippet": "#include <bits/stdc++.h>\n#define FOR(I,X,Y) for(long int I=X;I<Y;I++)\n#define REP(I,X) for(long int I=X;I>=0;I--)\n#define INF 1e9+7\nusing namespace std;\n\nint main(){\n int a,b,c;\n vector<int> ans;\n while(1){\n cin >> a >> b >> c;\n if(!(a|| b || c))break;\n int N,i,j,k,l;\n cin >> N;\n set<int> unbroken;\n set<int> broken;\n int ii[N],jj[N],kk[N],ll[N];\n FOR(i,0,N)cin >> ii[i] >> jj[i] >> kk[i] >> ll[i];\n FOR(count1,0,N)FOR(count2,0,N){\n int i = ii[count2],j = jj[count2],k = kk[count2],l = ll[count2];\n if(l){\n unbroken.insert(i);\n unbroken.insert(j);\n unbroken.insert(k);\n }\n else{\n if(unbroken.count(i) && unbroken.count(j))broken.insert(k);\n if(unbroken.count(j) && unbroken.count(k))broken.insert(i);\n if(unbroken.count(k) && unbroken.count(i))broken.insert(j);\n }\n }\n FOR(i,1,a+b+c+1){\n if(unbroken.count(i))ans.push_back(1);\n else if(broken.count(i))ans.push_back(0);\n else ans.push_back(2);\n }\n }\n for(auto x:ans)cout << x << endl;\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 3180, "score_of_the_acc": -0.5543, "final_rank": 2 }, { "submission_id": "aoj_0514_2096498", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n//{{{\n/********************************************************************/\nstruct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\ntypedef vector<vector<int> > vii;\ntypedef queue<int> qi;\ntypedef stack<int> si;\ntypedef deque<int> dqi;\n\n#define reps(i, a, b) for (int i = a; i < b; ++i)\n#define rep(i, n) reps(i, 0, n)\n#define REPS(i, a, b) reps(i, a, b)\n#define REP(i, n) rep(i, n)\n#define deps(i, a, b) for (int i = a; i >= b; --i)\n#define dep(i, n) deps(i, n, 0)\n#define DEPS(i, a, b) deps(i, a, b)\n#define DEP(i, n) dep(i, n)\n\n#define pf push_front\n#define pb push_back\n#define mp make_pair\n#define fst first\n#define FST fst\n#define sec second\n#define SEC sec\n#define sz(obj) ((int)(obj).size())\n#define all(v) (v).begin(), (v).end()\n#define ALL(v) all(v)\n\nconst int INF = 999999999;\nconst int MOD = 1e9 + 7;\nconst int dx[] = {0, 1, 0, -1, 1, 1, -1, -1}, dy[] = {1, 0, -1, 0, 1, -1, -1, 1};\n\nvector<string> split(const string &s, char delim) {\n vector<string> elems;\n string item;\n for (char ch: s) {\n if (ch == delim) {\n if (!item.empty()) elems.push_back(item);\n item.clear();\n }\n else item += ch;\n }\n if (!item.empty()) elems.push_back(item);\n return elems;\n}\n\ninline bool inside(int y, int x, int H, int W) {return y >= 0 && x >= 0 && y < H && x < W;}\ninline int in() {int x; std::cin >> x; return x;}\ntemplate <typename T>\nvoid print(std::vector<T>& v, char c = ' ') {\n REP(i, v.size()) {\n if (i != 0) std::cout << c;\n std::cout << v[i];\n }\n std::cout << endl;\n}\ntemplate <typename T> void print(T x) { std::cout << x << '\\n'; }\n\n/****************************************************************/\n//}}}\n\nsigned main()\n{\n int a, b, c;\n \n while (cin >> a >> b >> c, a + b + c) {\n vector<int> v;\n int n = in();\n vector<pair<int, vector<int>>> vp;\n vector<int> ans;\n int r;\n rep(i, a + b + c) ans.pb(2);\n rep(i, n) {\n vector<int> ijk;\n rep(j, 3) ijk.pb(in());\n r = in();\n vp.pb(mp(r, ijk));\n }\n sort(all(vp));\n reverse(all(vp));\n rep(z, a + b + c) for (auto cvp : vp) {\n if (cvp.fst) {\n for (auto s : cvp.sec) {\n ans[s - 1] = 1;\n }\n }\n else {\n int i = cvp.sec[0] - 1, j = cvp.sec[1] - 1, k = cvp.sec[2] - 1;\n if (ans[i] == 1 and ans[j] == 1) ans[k] = 0;\n else if (ans[j] == 1 and ans[k] == 1) ans[i] = 0;\n else if (ans[k] == 1 and ans[i] == 1) ans[j] = 0;\n }\n }\n for (auto a : ans) print(a);\n }\n\n return (0);\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3152, "score_of_the_acc": 0, "final_rank": 1 }, { "submission_id": "aoj_0514_1928660", "code_snippet": "#include <iostream>\n#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\n#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)\n#define For(i,a,b) for(int (i)=(a); (i)<(b); (i)++)\n\nbool find1fromcolumn(vector<vector<int> > vv, int c) {\n REP(i,vv.size()) {\n if (vv[i][c] == 1) return true;\n }\n return false;\n}\n\nint howmany2(int a, int b, int c) {\n int cnt = 0;\n if (a == 2) cnt++;\n if (b == 2) cnt++;\n if (c == 2) cnt++;\n return cnt;\n}\n\nvoid solve14(int a, int b, int c) {\n int n = a+b+c;\n int m;\n cin >> m;\n \n vector<int> ans;\n REP(i,n) ans.push_back(2);\n \n vector<vector<int> > vv;\n vv.resize(m);\n REP(i,m) vv[i].resize(n+3);\n REP(i,m) {\n REP(j,n+3) vv[i][j] = -1;\n }\n \n REP(i,m) {\n int p, q, r, s;\n scanf(\"%d%d%d%d\", &p, &q, &r, &s);\n if (s) {\n vv[i][p-1] = 1; vv[i][n] = p;\n vv[i][q-1] = 1; vv[i][n+1] = q;\n vv[i][r-1] = 1; vv[i][n+2] = r;\n ans[p-1] = ans[q-1] = ans[r-1] = 1;\n }else {\n vv[i][p-1] = 2; vv[i][n] = p;\n vv[i][q-1] = 2; vv[i][n+1] = q;\n vv[i][r-1] = 2; vv[i][n+2] = r;\n }\n }\n \n REP(i,n) {\n if(find1fromcolumn(vv, i)) {\n REP(j,m) {\n vv[j][i] = 1;\n }\n }\n }\n \n REP(i,m) {\n //cout << howmany2(vv[i][vv[i][n]-1],vv[i][vv[i][n+1]-1],vv[i][vv[i][n+2]-1]) << endl;\n if (howmany2(vv[i][vv[i][n]-1],vv[i][vv[i][n+1]-1],vv[i][vv[i][n+2]-1]) == 1) {\n if (vv[i][vv[i][n]-1] == 2) {ans[vv[i][n]-1] = 0;}\n else if (vv[i][vv[i][n+1]-1] == 2) {ans[vv[i][n+1]-1] = 0;}\n else {ans[vv[i][n+2]-1] = 0;}\n }\n }\n \n REP(i,n) {\n if (ans[i] == 1 || ans[i] == 0) cout << ans[i] << endl;\n else cout << 2 << endl;\n }\n}\n\nint main() {\n int a, b, c;\n while(cin >> a >> b >> c, a+b+c) {\n solve14(a,b,c);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 3668, "score_of_the_acc": -2, "final_rank": 3 } ]
aoj_0508_cpp
両端にリングのついた紐を考える.リングは正整数が付いていて,紐を区別する.紐の両端のリングには異なる数 a , b が付けられる.これを,[ a , b ] と記述する.複数の紐があり,一方の紐と他方の紐のリングに付いている数が同じ場合,そのリングのところで,これらの紐をつなげることができて,つなげてできたものを鎖と呼ぶことにする.例えば,[1, 3] と [3, 4] という紐からは [1, 3, 4] という鎖ができる.紐と鎖や鎖同志も同じ整数が付いているリングのところでつなげることができるものとする. 例えば,鎖 [1, 3, 4] と紐 [5, 1] からは [5, 1, 3, 4] ができ,鎖 [1, 3, 4] と鎖 [2, 3, 5] からは, 中央でクロスしたような形になる.鎖 [1, 3, 4] と鎖 [4, 6, 1] からは, 輪の形ができる. このように様々な形ができるが, そのうちの一部で,同じ数の付いたリングは一度だけたどるつながった複数の紐を鎖と呼ぶことにする.例えば,鎖 [1, 3, 4] と鎖[2, 3, 5] からできる,中央でクロスしたような形には, [1, 3, 5],[2, 3, 4] という鎖も含まれ,鎖 [1, 3, 4] と鎖 [4, 6, 1] からできる輪には, [1, 3, 4, 6],[3, 4, 6, 1],[4, 6, 1, 3]などの鎖が含まれる. これらの鎖に対して,含まれる数の個数を長さと定義する. 与えられた複数の紐に対して,つなげられるものはすべてつなげると1つ以上の 鎖を含む形ができる.そのうちの最大の鎖の長さを求めるプログラムを作成せよ. 入力データ の最初の行には紐の個数である正整数 1 ≤ n ≤ 100 が書いてあり,つづく n 行のそれぞれには, 空白で区切られた 2 つの整数 a , b が書いてあり 1 ≤ a < b ≤ 100 となっている.各行の 2 つの整数は 1 つの紐の両端の整数を表わす. 入力例１ 入力例２ 入力例３ 7 6 7 1 3 1 2 1 3 3 4 2 3 2 4 1 4 3 4 3 5 2 7 4 5 4 6 5 7 1 5 6 7 6 7 2 6 2 6 1 7 4 7 出力例１ 出力例２ 出力例３ 5 6 4 入力 入力は複数のデータセットからなる．n が 0 のとき入力が終了する．データセットの数は 10 を超えない． 出力 データセットごとに、最大の鎖の長さを１行に出力する． 入力例 7 1 3 3 4 1 4 2 7 5 7 6 7 1 7 6 1 2 2 3 3 4 4 5 1 5 2 6 7 1 3 2 4 3 5 4 6 6 7 2 6 4 7 0 出力例 5 6 4 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0508_10540827", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nstatic constexpr int MAXV = 100;\nvector<int> adj[MAXV+1];\nbool used[MAXV+1];\nint bestLen;\n\n// 深さ優先探索で「単純パス」の最大辺数を更新\nvoid dfs(int u, int depth) {\n bestLen = max(bestLen, depth);\n for (int v : adj[u]) {\n if (!used[v]) {\n used[v] = true;\n dfs(v, depth + 1);\n used[v] = false;\n }\n }\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n while (true) {\n int n;\n if (!(cin >> n) || n == 0) {\n break; // 入力終了\n }\n\n // グラフの初期化\n for (int i = 1; i <= MAXV; ++i) {\n adj[i].clear();\n }\n\n // 辺の入力\n for (int i = 0; i < n; ++i) {\n int a, b;\n cin >> a >> b;\n adj[a].push_back(b);\n adj[b].push_back(a);\n }\n\n bestLen = 0;\n // 各頂点をスタートに DFS\n for (int start = 1; start <= MAXV; ++start) {\n if (adj[start].empty()) continue;\n fill(begin(used), end(used), false);\n used[start] = true;\n dfs(start, 0);\n }\n\n // bestLen は最大「辺数」なので、頂点数に直すには +1\n cout << (bestLen + 1) << \"\\n\";\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 1900, "memory_kb": 3456, "score_of_the_acc": -1.3311, "final_rank": 15 }, { "submission_id": "aoj_0508_10130870", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int MM = 100;\ntypedef __int128 ll;\nint N, dep = 0, ans = 2;\nvector<int> ajl[MM+1];\nmap<ll, int> dp[MM];\nbool vis[MM+1];\n\nint dfs(int root, ll soFar, int dep){\n if (dp[root].count(soFar)) return dp[root][soFar];\n dp[root][soFar] = dep;\n for (int i : ajl[root]) if ((soFar&((ll)1<<i)) == 0) dp[root][soFar] = max(dp[root][soFar], dfs(i, soFar | ((ll)1<<i), dep+1));\n return dp[root][soFar];\n}\n\nvoid solve1(){\n for (int i = 1, a, b; i <= N; i++){\n cin >> a >> b;\n a--; b--;\n ajl[a].push_back(b);\n ajl[b].push_back(a);\n }\n for (int i = 0; i < 100; i++) ans = max(ans, dfs(i, (ll)1<<i, 1));\n\n cout << ans << \"\\n\";\n}\n\nvoid dfs2(int root, int d){\n vis[root] = 1; dep = max(dep, d);\n for (int i : ajl[root]){\n if (vis[i]==1) continue;\n dfs2(i, d+1);\n }\n vis[root] = 0;\n}\n\nvoid solve2(){\n for (int i = 1; i <= MM; i++) ajl[0].push_back(i);\n for (int i = 1, a, b; i <= N; i++){\n cin >> a >> b;\n ajl[a].push_back(b);\n ajl[b].push_back(a);\n }\n dfs2(0, 0);\n cout << dep << \"\\n\";\n}\n\nint main()\n{\n cin.sync_with_stdio(0); cin.tie(0);\n cin >> N;\n while (N != 0){\n for (int i = 0; i <= MM; ++i) ajl[i].resize(0);\n dep = 0;\n //if (N <= 50)\n solve2();\n //else solve1();\n cin >> N;\n }\n}", "accuracy": 1, "time_ms": 2330, "memory_kb": 3364, "score_of_the_acc": -1.3122, "final_rank": 14 }, { "submission_id": "aoj_0508_7937298", "code_snippet": "#include <cstdio>\n#include <vector>\n#define pb push_back\n#define rep(i, n) for (int i = 0; i < (n); i++)\nusing namespace std;\ntypedef vector<int> vi;\ntypedef vector<vi> vvi;\nvvi adj;\nint ans, cnt;\nbool visited[100];\nvoid dfs(int u) {\n if (ans < cnt)\n ans = cnt;\n cnt++;\n rep(i, adj[u].size()) {\n int v = adj[u][i];\n if (!visited[v]) {\n visited[v] = true;\n dfs(v);\n visited[v] = false;\n }\n }\n cnt--;\n}\nint main() {\n for (int m; scanf(\"%d\", &m), m;) {\n bool adjm[100][100] = {}, flg[100] = {};\n rep(i, m) {\n int a, b;\n scanf(\"%d%d\", &a, &b);\n a--, b--;\n adjm[a][b] = adjm[b][a] = flg[a] = flg[b] = true;\n }\n int f[100], n = 0;\n rep(i, 100) if (flg[i]) f[i] = n++;\n adj = vvi(n);\n rep(i, 100) rep(j, 100) if (adjm[i][j]) adj[f[i]].pb(f[j]);\n ans = 0, cnt = 1;\n rep(u, n - 1) {\n visited[u] = true;\n dfs(u);\n visited[u] = false;\n }\n printf(\"%d\\n\", ans);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 3080, "memory_kb": 2600, "score_of_the_acc": -0.6057, "final_rank": 2 }, { "submission_id": "aoj_0508_7937288", "code_snippet": "#include <cstdio>\n#define rep(i, n) for (int i = 0; i < (n); i++)\nusing namespace std;\nbool visited[100];\nint adj[100][100], deg[100], ans, cnt;\nvoid dfs(int u) {\n if (ans < cnt)\n ans = cnt;\n cnt++;\n rep(i, deg[u]) {\n int v = adj[u][i];\n if (!visited[v]) {\n visited[v] = true;\n dfs(v);\n visited[v] = false;\n }\n }\n cnt--;\n}\nint main() {\n for (int m; scanf(\"%d\", &m), m;) {\n bool adjm[100][100] = {}, flg[100] = {};\n rep(i, m) {\n int a, b;\n scanf(\"%d%d\", &a, &b);\n a--, b--;\n adjm[a][b] = adjm[b][a] = flg[a] = flg[b] = true;\n }\n int f[100], n = 0;\n rep(i, 100) if (flg[i]) {\n f[i] = n++;\n deg[f[i]] = 0;\n }\n rep(i, 100) rep(j, 100) if (adjm[i][j]) adj[f[i]][deg[f[i]]++] = f[j];\n ans = 0, cnt = 1;\n rep(u, n - 1) {\n visited[u] = true;\n dfs(u);\n visited[u] = false;\n }\n printf(\"%d\\n\", ans);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 2740, "memory_kb": 2664, "score_of_the_acc": -0.6109, "final_rank": 3 }, { "submission_id": "aoj_0508_7937274", "code_snippet": "#include <algorithm>\n#include <iostream>\nusing namespace std;\nint edge[100][100];\nint size[100];\nbool used[100];\nint rec(int idx) {\n int ret = 1;\n for (int i = 0; i < size[idx]; i++) {\n if (!used[edge[idx][i]]) {\n used[edge[idx][i]] = true;\n ret = max(ret, rec(edge[idx][i]) + 1);\n used[edge[idx][i]] = false;\n }\n }\n return ret;\n}\nint main() {\n int N;\n while (cin >> N, N) {\n fill_n(size, 100, 0);\n fill_n(used, 100, false);\n for (int i = 0; i < N; i++) {\n int a, b;\n cin >> a >> b;\n a--, b--;\n edge[a][size[a]++] = b;\n edge[b][size[b]++] = a;\n }\n int ret = 0;\n for (int i = 0; i < 100; i++) {\n used[i] = true;\n ret = max(ret, rec(i));\n used[i] = false;\n }\n cout << ret << endl;\n }\n}", "accuracy": 1, "time_ms": 2830, "memory_kb": 3116, "score_of_the_acc": -1.1329, "final_rank": 10 }, { "submission_id": "aoj_0508_7937267", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nvector<int> G[101];\nbool V[101] = {};\nint N;\nint Ans = 0;\nvoid DFS(int n, int len) {\n Ans = max(Ans, len);\n bool Vis = false;\n int S = G[n].size();\n for (int i = 0; i < S; i++) {\n if (!V[G[n][i]]) {\n Vis = true;\n V[G[n][i]] = true;\n DFS(G[n][i], len + 1);\n V[G[n][i]] = false;\n }\n }\n return;\n}\nint main() {\n do {\n for (int i = 0; i < 101; i++) {\n G[i].clear();\n V[i] = false;\n }\n Ans = 0;\n scanf(\"%d\", &N);\n if (N == 0)\n break;\n for (int i = 0; i < N; i++) {\n int A, B;\n scanf(\"%d%d\", &A, &B);\n G[A].push_back(B);\n G[B].push_back(A);\n }\n for (int i = 1; i <= 100; i++) {\n V[i] = true;\n DFS(i, 1);\n V[i] = false;\n }\n printf(\"%d\\n\", Ans);\n } while (true);\n}", "accuracy": 1, "time_ms": 3120, "memory_kb": 3264, "score_of_the_acc": -1.3546, "final_rank": 16 }, { "submission_id": "aoj_0508_7937255", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nvector<int> G[101];\nbool V[101] = {};\nbool Vis[101] = {};\nint DP[101] = {};\nint N;\nint Ans = 0;\nvoid DFS(int n, int len) {\n Ans = max(Ans, len);\n DP[n] = max(DP[n], len);\n int S = G[n].size();\n for (int i = 0; i < S; i++) {\n if (!V[G[n][i]]) {\n Vis[G[n][i]] = true;\n V[G[n][i]] = true;\n DFS(G[n][i], len + 1);\n V[G[n][i]] = false;\n }\n }\n return;\n}\nint main() {\n do {\n for (int i = 0; i < 101; i++) {\n G[i].clear();\n V[i] = false;\n Vis[i] = false;\n DP[i] = 0;\n }\n Ans = 0;\n scanf(\"%d\", &N);\n if (N == 0)\n break;\n for (int i = 0; i < N; i++) {\n int A, B;\n scanf(\"%d%d\", &A, &B);\n G[A].push_back(B);\n G[B].push_back(A);\n }\n for (int i = 1; i <= 100; i++) {\n if (!Vis[i]) {\n Vis[i] = true;\n V[i] = true;\n DFS(i, 1);\n V[i] = false;\n }\n }\n for (int i = 1; i <= 100; i++) {\n if (DP[i] == Ans) {\n V[i] = true;\n DFS(i, 1);\n V[i] = false;\n break;\n }\n }\n printf(\"%d\\n\", Ans);\n } while (true);\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 3232, "score_of_the_acc": -0.736, "final_rank": 4 }, { "submission_id": "aoj_0508_7937244", "code_snippet": "#include <cstdio>\n#include <stack>\n#include <vector>\nusing namespace std;\nvector<int> vec[101];\nbool ch[101] = {};\nbool visited[101] = {};\nint dp[101] = {};\nint maxx = -1;\nint maxNODE = -1;\nvoid DFS(int i, int val) {\n if (val > maxx)\n maxx = val;\n dp[i] = max(dp[i], val);\n int len = vec[i].size();\n for (int k = 0; k < len; k++) {\n if (!ch[vec[i][k]]) {\n visited[vec[i][k]] = true;\n ch[vec[i][k]] = true;\n DFS(vec[i][k], val + 1);\n ch[vec[i][k]] = false;\n }\n }\n}\nint main() {\n maxx = -1;\n maxNODE = -1;\n int n, a, b;\n scanf(\"%d\", &n);\n if (n == 0)\n return 0;\n for (int i = 0; i < n; i++) {\n scanf(\"%d %d\", &a, &b);\n vec[a].push_back(b);\n vec[b].push_back(a);\n if (a > b)\n if (maxNODE < a)\n maxNODE = a;\n if (a < b)\n if (maxNODE < b)\n maxNODE = b;\n }\n for (int i = 1; i <= maxNODE; i++) {\n visited[i] = true;\n ch[i] = true;\n DFS(i, 1);\n ch[i] = false;\n }\n for (int i = 1; i <= maxNODE; i++) {\n if (maxx == dp[i]) {\n ch[i] = true;\n DFS(i, 1);\n ch[i] = false;\n break;\n }\n }\n printf(\"%d\\n\", maxx);\n for (int i = 1; i <= maxNODE; i++) {\n visited[i] = false;\n vec[i].clear();\n }\n main();\n}", "accuracy": 1, "time_ms": 3320, "memory_kb": 2784, "score_of_the_acc": -0.8579, "final_rank": 6 }, { "submission_id": "aoj_0508_7937243", "code_snippet": "#include <cstdio>\n#include <stack>\n#include <vector>\nusing namespace std;\nvector<int> vec[101];\nbool ch[101] = {};\nbool visited[101] = {};\nint dp[101] = {};\nint maxx = -1;\nint maxNODE = -1;\nvoid DFS(int i, int val) {\n if (val > maxx)\n maxx = val;\n dp[i] = max(dp[i], val);\n int len = vec[i].size();\n for (int k = 0; k < len; k++) {\n if (!ch[vec[i][k]]) {\n visited[vec[i][k]] = true;\n ch[vec[i][k]] = true;\n DFS(vec[i][k], val + 1);\n ch[vec[i][k]] = false;\n }\n }\n}\nint main() {\n maxx = -1;\n maxNODE = -1;\n int n, a, b;\n scanf(\"%d\", &n);\n if (n == 0)\n return 0;\n for (int i = 0; i < n; i++) {\n scanf(\"%d %d\", &a, &b);\n vec[a].push_back(b);\n vec[b].push_back(a);\n if (a > b)\n if (maxNODE < a)\n maxNODE = a;\n if (a < b)\n if (maxNODE < b)\n maxNODE = b;\n }\n for (int i = 1; i <= maxNODE; i++) {\n if (!visited[i]) {\n visited[i] = true;\n ch[i] = true;\n DFS(i, 1);\n ch[i] = false;\n }\n }\n for (int i = 1; i <= maxNODE; i++) {\n if (maxx == dp[i]) {\n ch[i] = true;\n DFS(i, 1);\n ch[i] = false;\n break;\n }\n }\n printf(\"%d\\n\", maxx);\n for (int i = 1; i <= maxNODE; i++) {\n visited[i] = false;\n dp[i] = 0;\n vec[i].clear();\n }\n main();\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 2576, "score_of_the_acc": -0.0039, "final_rank": 1 }, { "submission_id": "aoj_0508_7108954", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n int n;\n while(cin >> n, n){\n vector<vector<int>> g(100);\n for(int i = 0, u, v; i < n; i++){\n cin >> u >> v;\n g[--u].push_back(--v);\n g[v].push_back(u);\n }\n int ans = 0;\n vector<bool> used(100);\n function<void(int,int)> dfs = [&](int v, int d){\n used[v] = true;\n ans = max(ans, d);\n for(auto &&u:g[v]){\n if(used[u])continue;\n dfs(u, d + 1);\n }\n used[v] = false;\n };\n for(int i = 0; i < 100; i++)dfs(i, 1);\n cout << ans << '\\n';\n }\n}", "accuracy": 1, "time_ms": 3470, "memory_kb": 3224, "score_of_the_acc": -1.3782, "final_rank": 17 }, { "submission_id": "aoj_0508_7052425", "code_snippet": "#include <cstdio>\n#include <vector>\nusing namespace std;\n\nint max_;\nvector<int> g[101];\nint visited[101];\n\nvoid dfs(int v, int d) {\n visited[v] = 1;\n max_ = max(max_, d);\n for (int i = 0; i < g[v].size(); ++i) {\n if (visited[g[v][i]])\n continue;\n dfs(g[v][i], d + 1);\n }\n visited[v] = 0;\n}\n\nint main() {\n for (;;) {\n int N;\n scanf(\"%d\", &N);\n if (N == 0)\n break;\n for (int i = 1; i <= 100; ++i)\n g[i].clear();\n while (N-- > 0) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n g[a].push_back(b);\n g[b].push_back(a);\n }\n max_ = 0;\n for (int v = 1; v <= 100; ++v)\n dfs(v, 1);\n printf(\"%d\\n\", max_);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 2970, "memory_kb": 2796, "score_of_the_acc": -0.803, "final_rank": 5 }, { "submission_id": "aoj_0508_6585154", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n#include <bitset>\nusing namespace std;\n\nint max_depth = 0;\nconst int max_num_vertexes = 100;\n\n\nvoid dfs(const vector<vector<int>>& adjacency_list, int v, int depth, bitset<max_num_vertexes>& is_visited) {\n\tfor (const int& u : adjacency_list[v]) {\n\t\tif (!is_visited[u]) {\n\t\t\tis_visited[u] = 1;\n\t\t\tdfs(adjacency_list, u, depth + 1, is_visited);\n\t\t\tis_visited[u] = 0;\n\t\t}\n\t}\n\tmax_depth = max(max_depth, depth);\n\treturn;\n}\n\nint main() {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint n = -1;\n\t\tint num_vertexes = 0;\n\t\tvector<pair<int, int>> edges;\n\t\tvector<vector<int>> adjacency_list;\n\n\t\tcin >> n;\n\t\tif (n == 0) { break; }\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint u, v;\n\n\t\t\tcin >> u >> v;\n\t\t\tu--, v--;\n\t\t\tedges.emplace_back(make_pair(u, v));\n\t\t\tnum_vertexes = max(num_vertexes, u);\n\t\t\tnum_vertexes = max(num_vertexes, v);\n\t\t}\n\t\tnum_vertexes++;\n\t\t\n\t\tadjacency_list = vector<vector<int>>(num_vertexes);\n\t\tfor (const pair<int, int>& edge : edges) {\n\t\t\tadjacency_list[edge.first].emplace_back(edge.second);\n\t\t\tadjacency_list[edge.second].emplace_back(edge.first);\n\t\t}\n\t\t\n\t\tmax_depth = 0;\n\t\tfor (int v = 0; v < num_vertexes; v++) {\n\t\t\tif (adjacency_list[v].empty()) { continue; }\n\t\t\tbitset<max_num_vertexes> is_visited(0);\n\n\t\t\tis_visited[v] = 1;\n\t\t\tdfs(adjacency_list, v, 1, is_visited);\n\t\t}\n\t\tcout << max_depth << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 2970, "memory_kb": 3384, "score_of_the_acc": -1.4593, "final_rank": 18 }, { "submission_id": "aoj_0508_6584724", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n#include <bitset>\nusing namespace std;\n\nint result = 0;\nconst int max_num_vertexes = 100;\n\n\nvoid dfs(const vector<vector<int>>& adjacency_list, int v, int depth, bitset<max_num_vertexes>& is_visited) {\n\tbool is_updated = false;\n\n\tfor (const int& u : adjacency_list[v]) {\n\t\tif (!is_visited[u]) {\n\t\t\tis_visited[u] = 1;\n\t\t\tdfs(adjacency_list, u, depth + 1, is_visited);\n\t\t\tis_visited[u] = 0;\n\t\t}\n\t}\n\tif (!is_updated) {\n\t\tresult = max(result, depth);\n\t}\n\treturn;\n}\n\nint main() {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint n = -1;\n\t\tint num_vertexes = 0;\n\t\tvector<pair<int, int>> edges;\n\t\tvector<vector<int>> adjacency_list;\n\t\tint max_depth = 1;\n\n\t\tcin >> n;\n\t\tif (n == 0) { break; }\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint u, v;\n\n\t\t\tcin >> u >> v;\n\t\t\tu--, v--;\n\t\t\tedges.emplace_back(make_pair(u, v));\n\t\t\tnum_vertexes = max(num_vertexes, u);\n\t\t\tnum_vertexes = max(num_vertexes, v);\n\t\t}\n\t\tnum_vertexes++;\n\t\t\n\t\tadjacency_list = vector<vector<int>>(num_vertexes);\n\t\tfor (const pair<int, int>& edge : edges) {\n\t\t\tadjacency_list[edge.first].emplace_back(edge.second);\n\t\t\tadjacency_list[edge.second].emplace_back(edge.first);\n\t\t}\n\t\t\n\t\tresult = 0;\n\t\tfor (int v = 0; v < num_vertexes; v++) {\n\t\t\tif (adjacency_list[v].empty()) { continue; }\n\t\t\tbitset<max_num_vertexes> is_visited(0);\n\t\t\tint depth = -1;\n\n\t\t\tis_visited[v] = 1;\n\t\t\tdfs(adjacency_list, v, 1, is_visited);\n\t\t}\n\t\tcout << result << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 2980, "memory_kb": 3148, "score_of_the_acc": -1.1978, "final_rank": 11 }, { "submission_id": "aoj_0508_6584693", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n#include <bitset>\nusing namespace std;\n\nint result = 0;\n\n\nvoid dfs(const vector<vector<int>>& adjacency_list, int v, int depth, bitset<100>& is_visited) {\n\tbool is_updated = false;\n\n\tfor (const int& u : adjacency_list[v]) {\n\t\tif (!is_visited[u]) {\n\t\t\tis_visited[u] = 1;\n\t\t\tdfs(adjacency_list, u, depth + 1, is_visited);\n\t\t\tis_visited[u] = 0;\n\t\t}\n\t}\n\tif (!is_updated) {\n\t\tresult = max(result, depth);\n\t}\n\treturn;\n}\n\nint main() {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint n = -1;\n\t\tint num_vertexes = 0;\n\t\tvector<pair<int, int>> edges;\n\t\tvector<vector<int>> adjacency_list;\n\t\tint max_depth = 1;\n\n\t\tcin >> n;\n\t\tif (n == 0) { break; }\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint u, v;\n\n\t\t\tcin >> u >> v;\n\t\t\tu--, v--;\n\t\t\tedges.emplace_back(make_pair(u, v));\n\t\t\tnum_vertexes = max(num_vertexes, u);\n\t\t\tnum_vertexes = max(num_vertexes, v);\n\t\t}\n\t\tnum_vertexes++;\n\t\t\n\t\tadjacency_list = vector<vector<int>>(num_vertexes);\n\t\tfor (const pair<int, int>& edge : edges) {\n\t\t\tadjacency_list[edge.first].emplace_back(edge.second);\n\t\t\tadjacency_list[edge.second].emplace_back(edge.first);\n\t\t}\n\t\t\n\t\tresult = 0;\n\t\tfor (int v = 0; v < num_vertexes; v++) {\n\t\t\tif (adjacency_list[v].empty()) { continue; }\n\t\t\tbitset<100> is_visited(0);\n\t\t\tint depth = -1;\n\n\t\t\tis_visited[v] = 1;\n\t\t\tdfs(adjacency_list, v, 1, is_visited);\n\t\t}\n\t\tcout << result << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 2980, "memory_kb": 3152, "score_of_the_acc": -1.2023, "final_rank": 12 }, { "submission_id": "aoj_0508_6476830", "code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#include <set>\n#include <deque>\n#include <stack>\n#include <sstream>\n#include <utility>\n#include <cstring>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <array>\n#include <bitset>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nstruct UnionFind{\n vector<int> par,num;\n UnionFind(int n):par(n),num(n,1){\n iota(par.begin(),par.end(),0); //include<numeric>\n }\n int find(int v){\n return (par[v]==v)?v:(par[v]=find(par[v]));\n }\n void unite(int u,int v){\n u=find(u),v=find(v);\n if(u==v)return;\n if(num[u]<num[v])swap(u,v);\n num[u]+=num[v];\n par[v]=u;\n }\n bool same(int u,int v){\n return find(u) == find(v);\n }\n int size(int v){\n return num[find(v)];\n }\n};\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int m;\n while(cin >> m,m){\n int n = 100;\n vector<vector<int>> g(n);\n UnionFind uf(n);\n for(int i=0;i<m;i++){\n int a,b; cin >> a >> b;\n a--; b--;\n g[a].push_back(b);\n g[b].push_back(a);\n uf.unite(a, b);\n }\n int res = 0;\n vector<int> dp(n);\n vector<bool> used(n);\n auto dfs=[&](auto dfs,int s,int cur)->void{\n if(uf.size(s) <= res)return;\n dp[s] = max(dp[s],cur);\n res = max(res, cur);\n for(int t:g[s]){\n if(used[t])continue;\n used[t] = true;\n dfs(dfs,t,cur+1);\n used[t] = false;\n }\n };\n for(int i=0;i<n;i++){\n if(uf.find(i) == i){\n used[i] = true;\n dfs(dfs,i,1);\n used[i] = false;\n }\n }\n int u = 0;\n for(int i=0;i<n;i++){\n if(dp[u] < dp[i]) u = i;\n }\n used[u] = true;\n dfs(dfs,u,1);\n cout << res << endl;\n }\n}", "accuracy": 1, "time_ms": 110, "memory_kb": 3356, "score_of_the_acc": -0.8705, "final_rank": 7 }, { "submission_id": "aoj_0508_6476818", "code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <cstdio>\n#include <ctime>\n#include <assert.h>\n#include <chrono>\n#include <random>\n#include <numeric>\n#include <set>\n#include <deque>\n#include <stack>\n#include <sstream>\n#include <utility>\n#include <cstring>\n#include <unordered_map>\n#include <unordered_set>\n#include <tuple>\n#include <array>\n#include <bitset>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int m;\n while(cin >> m,m){\n int n = 100;\n vector<vector<int>> g(n);\n for(int i=0;i<m;i++){\n int a,b; cin >> a >> b;\n a--; b--;\n g[a].push_back(b);\n g[b].push_back(a);\n }\n int res = 0;\n vector<bool> used(n);\n auto dfs=[&](auto dfs,int s,int cur)->void{\n res = max(res, cur);\n for(int t:g[s]){\n if(used[t])continue;\n used[t] = true;\n dfs(dfs,t,cur+1);\n used[t] = false;\n }\n };\n for(int i=0;i<n;i++){\n fill(used.begin(), used.end(), false);\n used[i] = true;\n dfs(dfs,i,1);\n }\n cout << res << endl;\n }\n}", "accuracy": 1, "time_ms": 3360, "memory_kb": 3472, "score_of_the_acc": -1.6335, "final_rank": 19 }, { "submission_id": "aoj_0508_5133108", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint dfs(int p, vector<bool>& used, vector<vector<int>>& g){\n if(used[p]) return 0;\n used[p] = true;\n int res = 0;\n for(auto v: g[p]){\n res = max(res, dfs(v, used, g));\n }\n used[p] = false;\n return res+1;\n}\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n == 0) break;\n\n vector<vector<int>> g(101);\n for(int i=0; i<n; i++){\n int a,b;\n cin >> a >> b;\n g[a].push_back(b);\n g[b].push_back(a);\n }\n for(int i=1; i<=100; i++){\n g[0].push_back(i);\n }\n vector<bool> used(101, false);\n int res = dfs(0, used, g);\n cout << res-1 << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 5240, "memory_kb": 3352, "score_of_the_acc": -1.8661, "final_rank": 20 }, { "submission_id": "aoj_0508_4996353", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;\n\ntemplate <class T, class U>\nvector<T> make_v(U size, const T& init){ return vector<T>(static_cast<size_t>(size), init); }\n\ntemplate<class... Ts, class U>\nauto make_v(U size, Ts... rest) { return vector<decltype(make_v(rest...))>(static_cast<size_t>(size), make_v(rest...)); }\n\ntemplate<class T> void chmin(T &a, const T &b){ a = (a < b ? a : b); }\ntemplate<class T> void chmax(T &a, const T &b){ a = (a > b ? a : b); }\n\nint main() {\n int n = 100, m;\n while(cin >> m, m){\n vector<vector<int>> G(n+1);\n for (int i = 0; i < m; ++i) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n a--; b--;\n G[a].emplace_back(b);\n G[b].emplace_back(a);\n }\n for (int i = 0; i < n; ++i) {\n G[n].emplace_back(i);\n }\n int ans = 0;\n vector<int> visited(n);\n auto dfs = [&](int x, int l, auto &&f) -> void {\n ans = max(ans, l);\n for (auto &&i : G[x]) {\n if(!visited[i]){\n visited[i] = 1;\n f(i, l+1, f);\n visited[i] = 0;\n }\n }\n };\n dfs(n, 0, dfs);\n cout << ans << \"\\n\";\n }\n return 0;\n}", "accuracy": 1, "time_ms": 2570, "memory_kb": 3252, "score_of_the_acc": -1.234, "final_rank": 13 }, { "submission_id": "aoj_0508_4805354", "code_snippet": "#include<iostream>\n#include<vector>\nusing namespace std;\nbool vis[101] = {};int ans;\nvector<int> v[101];\nvoid dfs(int x, int l){\n vis[x] = 1;ans = max(ans, l);\n for(int j : v[x]){\n if(!vis[j]) dfs(j, l+1);\n }vis[x] = 0;// 終わったら戻す\n}\nint main(){\n int n;\n while(cin >> n, n){\n for(int i = 1; i <= 100; i++) v[i].clear();\n for(int i = 1; i <= n; i++){\n int a, b;cin >> a >> b;\n v[a].push_back(b);v[b].push_back(a);\n }ans = 0;\n for(int i = 1; i <= 100; i++)dfs(i, 1);\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 2580, "memory_kb": 3104, "score_of_the_acc": -1.0708, "final_rank": 8 }, { "submission_id": "aoj_0508_4464942", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define MAX 101\nint N, ans;\nbool seen[MAX];\nvector<int> M[MAX];\n\nvoid dfs(int u, int d){\n seen[u] = true;\n ans = max(ans, d);\n vector<int>::iterator it;\n for(it = M[u].begin(); it != M[u].end(); it++){\n if(seen[*it]) continue;\n else dfs(*it, d + 1);\n }\n seen[u] = false;\n return;\n}\n\n\n\nint main(){\n while(cin >> N){\n if(N == 0) return 0;\n ans = 0;\n for(int i = 1; i <= MAX; i++) M[i].clear();\n for(int i = 1; i <= N; i++){\n int u, v;\n cin >> u >> v;\n M[u].push_back(v);\n M[v].push_back(u);\n }\n for(int i = 1; i <= MAX; i++){\n for(int j = 1; j <= MAX; j++) seen[j] = false;\n dfs(i, 1);\n }\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 2580, "memory_kb": 3108, "score_of_the_acc": -1.0752, "final_rank": 9 } ]
aoj_0509_cpp
平面に長方形のシートが何枚か置かれている. これらのシートで覆われている部分の面積や周長を求めるプログラムを作成せよ. ただし, 平面を座標平面とみなしたとき, シートの配置は次の条件 (1), (2) を満たすものとする. (1) 各シートの長方形の 4 頂点の x , y 座標は全て 0 以上 10000 以下の整数であり, 長方形の各辺は x 軸, または y 軸に平行である. (2) シートの枚数は高々 10000 枚以下である. 入力データ の 1 行目に長方形の個数 n と問題の種類を表す整数 r が空白で区切って書かれている. 2 行目以降の各行には, 各シートの左下頂点座標 ( x 1 , y 1 ) と右上頂点座標 ( x 2 , y 2 ) の座標値が x 1 , y 1 , x 2 , y 2 の順で空白で区切って書いてある. 出力には r = 1 のとき 1 行目に面積を, r = 2 のとき 1 行目に面積, 2 行目に周囲の長さを出力する. いずれの場合も最後に改行を入れること. また, テストデータの 40% では長方形の頂点の座標が 0 以上 100 以下で, そのうちの 1/2 では面積だけを求める問題である. さらに, 全体の 1/2 は面積だけを求める問題である. 入力例１ 入力例２ 入力例３ 入力例４ 5 1 5 2 2 2 3 2 0 0 3 2 0 0 3 2 0 0 8 9 2 2 8 8 1 1 2 5 1 1 2 5 0 0 9 8 3 0 4 9 0 4 6 5 0 4 6 5 5 0 7 9 3 3 5 6 3 3 5 6 5 0 7 6 5 0 7 6 出力例１ 出力例２ 出力例３ 出力例４ 29 29 80 45 38 36 36 入力 入力は複数のデータセットからなる． n , r がともに 0 のとき入力が終了する．データセットの数は 10 を超えない． 出力 データセットごとに, r = 1 のとき 1 行目に面積を, r = 2 のとき 1 行目に面積, 2 行目に周囲の長さを出力する. 入力例 5 1 0 0 3 2 1 1 2 5 0 4 6 5 3 3 5 6 5 0 7 6 5 2 0 0 3 2 1 1 2 5 0 4 6 5 3 3 5 6 5 0 7 6 2 2 0 0 8 9 0 0 9 8 3 2 2 2 8 8 3 0 4 9 5 0 7 9 0 0 出力例 29 29 38 80 36 45 36 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0509_10851147", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing P = pair<int, int>;\n\nconstexpr int MAX_Y = 10003;\nconstexpr int MAX_X = 10003;\n\nint main() {\n int n, r;\n while(cin >> n >> r, n) {\n vector<vector<P>> v(MAX_Y);\n for(int i=0; i<n; ++i) {\n int x1, y1, x2, y2;\n cin >> x1 >> y1 >> x2 >> y2;\n ++x1; ++y1; ++x2; ++y2;\n v[y1].emplace_back(x1, 1);\n v[y1].emplace_back(x2, -1);\n v[y2].emplace_back(x1, -1);\n v[y2].emplace_back(x2, 1);\n }\n vector<vector<int>> sum(2, vector<int>(MAX_X));\n int S = 0, len = 0;\n for(int i=0; i<MAX_Y; ++i) {\n int now = i % 2, pre = (i+1) % 2;\n fill(sum[now].begin(), sum[now].end(), 0);\n for(int j=0; j<v[i].size(); ++j) {\n sum[now][v[i][j].first] += v[i][j].second;\n }\n for(int j=0; j<MAX_X; ++j) {\n sum[now][j+1] += sum[now][j];\n sum[now][j] += sum[pre][j];\n }\n for(int j=0; j<MAX_X; ++j) {\n S += sum[now][j] > 0;\n len += ((sum[pre][j] > 0) != (sum[now][j] > 0));\n len += ((sum[now][j] > 0) != (sum[now][j+1] > 0));\n }\n }\n \n if(r == 1) {\n cout << S << endl;\n } else {\n cout << S << '\\n' << len << endl;\n }\n }\n}", "accuracy": 1, "time_ms": 2170, "memory_kb": 4012, "score_of_the_acc": -1.0931, "final_rank": 6 }, { "submission_id": "aoj_0509_10540857", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n while (true) {\n int A, B;\n cin >> A >> B;\n if (!cin || A == 0) \n break; // A＝0 で入力終了\n\n // y 座標ごとに「開始＋1」「終了−1」を記録する差分配列\n static constexpr int MAX_W = 10002;\n vector<vector<pair<int,int>>> add(MAX_W), sub(MAX_W);\n\n for (int i = 0; i < A; i++) {\n int l, u, r, d;\n cin >> l >> u >> r >> d;\n // 1-index → 差分しやすいように +1\n ++l; ++r;\n add[u].emplace_back(l, r);\n sub[d].emplace_back(l, r);\n }\n\n // 現在の行・次の行のオンセル数\n vector<int> curr(MAX_W, 0), next = curr;\n long long area = 0; // 面積（オンセルの合計）\n long long circ = 0; // 周囲長\n\n // 各行 y をスキャン\n for (int y = 0; y < MAX_W - 1; y++) {\n // 差分を反映\n next = curr;\n for (auto [l, r] : add[y]) {\n for (int x = l; x < r; x++) \n next[x]++;\n }\n for (auto [l, r] : sub[y]) {\n for (int x = l; x < r; x++) \n next[x]--;\n }\n // セルごとに面積・境界を数える\n for (int x = 0; x < MAX_W; x++) {\n bool on = next[x] != 0;\n bool above = curr[x] != 0;\n bool left = (x > 0) && (next[x-1] != 0);\n\n // 面積: on セルをカウント\n if (on) \n area++;\n\n // 上下境界: 前の行との違い\n if (on != above) \n circ++;\n\n // 左右境界: 左のセルとの違い\n if (x > 0 && (on != left)) \n circ++;\n }\n curr.swap(next);\n }\n\n // 出力\n cout << area << \"\\n\";\n if (B == 2) \n cout << circ << \"\\n\";\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 1330, "memory_kb": 4452, "score_of_the_acc": -1.1337, "final_rank": 12 }, { "submission_id": "aoj_0509_7966620", "code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nconst int N = 10003;\nint s[N],pre[N];\n\nvoid slv(int n,int r) {\n vector<pair<pair<int,int>,pair<int,int>>> v;\n while (n--) {\n \tint x,y,xx,yy; cin >> x >> y >> xx >> yy;\n \tx++; y++;\n \tv.push_back({{x,1}, {y,yy+1}});\n \tv.push_back({{xx+1, -1}, {y,yy+1}});\n }\n int sum = 0;\n int len = 0;\n sort(v.begin(), v.end());\n auto nonzero = [&](int x) -> bool {\n \treturn x != 0;\t\n };\n int idx = 0;\n for (int i = 0; i < N; i++) {\n s[i] = pre[i] = 0;\n }\n for (int i = 1; i < N; i++) {\n \twhile (idx < v.size() and v[idx].first.first == i) {\n \t\ts[v[idx].second.first] += v[idx].first.second;\n \t\ts[v[idx].second.second] -= v[idx].first.second;\n \t\tidx++;\n \t}\n \tint cur = 0;\n \tfor (int j = 0; j < N; j++) {\n \t\tcur += s[j];\n \t\tif (nonzero(cur) != nonzero(pre[j])) len++;\n \t\tif (nonzero(cur)) sum++;\n \t\tpre[j] = cur;\n \t\tif (j and nonzero(pre[j]) != nonzero(pre[j-1])) len++;\n \t}\n }\n cout << sum << endl;\n if (r == 2) cout << len << endl;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n,r;\n while (cin >> n >> r, n+r) {\n slv(n,r);\n }\n}", "accuracy": 1, "time_ms": 1300, "memory_kb": 3756, "score_of_the_acc": -0.6041, "final_rank": 1 }, { "submission_id": "aoj_0509_5628899", "code_snippet": "#include <iostream>\n#include <vector>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\n\nusing Pii = pair<int, int>;\n\nconst int max_y = 10002;\nconst int max_x = 10002;\n\nint main() {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\tint n, r;\n\n\twhile (cin >> n >> r, n) {\n\t\tvector<vector<Pii>> imos(max_y);\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tint x0, y0, x1, y1;\n\n\t\t\tcin >> x0 >> y0 >> x1 >> y1;\n\t\t\timos[y0 + 1].emplace_back(x0 + 1, 1);\n\t\t\timos[y0 + 1].emplace_back(x1 + 1, -1);\n\t\t\timos[y1 + 1].emplace_back(x0 + 1, -1);\n\t\t\timos[y1 + 1].emplace_back(x1 + 1, 1);\n\t\t}\n\n\t\tvector<vector<int>> cum_sum(2, vector<int>(max_x));\n\t\tint area = 0, length = 0;\n\n\t\tfor (int i = 0; i < max_y; ++i) {\n\t\t\tint cur = i % 2, pre = (i + 1) % 2;\n\n\t\t\tfill(cum_sum[cur].begin(), cum_sum[cur].end(), 0);\n\t\t\tfor (int j = 0; j < (int)imos[i].size(); ++j) {\n\t\t\t\tcum_sum[cur][imos[i][j].first] += imos[i][j].second;\n\t\t\t}\n\t\t\tfor (int j = 0; j < max_x - 1; ++j) {\n\t\t\t\tcum_sum[cur][j + 1] += cum_sum[cur][j];\n\t\t\t\tcum_sum[cur][j] += cum_sum[pre][j];\n\t\t\t}\n\t\t\tfor (int j = 0; j < max_x - 1; ++j) {\n\t\t\t\tarea += cum_sum[cur][j] > 0;\n\t\t\t\tlength += ((cum_sum[pre][j] > 0) != (cum_sum[cur][j] > 0));\n\t\t\t\tlength += ((cum_sum[cur][j] > 0) != (cum_sum[cur][j + 1] > 0));\n\t\t\t}\n\t\t}\n\n\t\tcout << area << endl;\n\t\tif (r == 2) {\n\t\t\tcout << length << endl;\n\t\t}\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 3230, "memory_kb": 3692, "score_of_the_acc": -1.2173, "final_rank": 17 }, { "submission_id": "aoj_0509_5628872", "code_snippet": "#include <iostream>\n#include <vector>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\n\nusing Pii = pair<int, int>;\n\nconst int max_y = 10002;\nconst int max_x = 10002;\n\nint main() {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\tint n, r;\n\twhile (cin >> n >> r, n) {\n\t\tvector<vector<Pii>> imos(max_y);\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tint x0, y0, x1, y1;\n\t\t\tcin >> x0 >> y0 >> x1 >> y1;\n\t\t\timos[y0 + 1].emplace_back(x0 + 1, 1);\n\t\t\timos[y0 + 1].emplace_back(x1 + 1, -1);\n\t\t\timos[y1 + 1].emplace_back(x0 + 1, -1);\n\t\t\timos[y1 + 1].emplace_back(x1 + 1, 1);\n\t\t}\n\t\tvector<vector<int>> cum_sum(2, vector<int>(max_x));\n\t\tint area = 0, length = 0;\n\t\tfor (int i = 0; i < max_y; ++i) {\n\t\t\tint cur = i % 2, pre = (i + 1) % 2;\n\t\t\tfill(cum_sum[cur].begin(), cum_sum[cur].end(), 0);\n\t\t\tfor (int j = 0; j < (int)imos[i].size(); ++j) {\n\t\t\t\tcum_sum[cur][imos[i][j].first] += imos[i][j].second;\n\t\t\t}\n\t\t\tfor (int j = 0; j < max_x - 1; ++j) {\n\t\t\t\tcum_sum[cur][j + 1] += cum_sum[cur][j];\n\t\t\t\tcum_sum[cur][j] += cum_sum[pre][j];\n\t\t\t}\n\t\t\tfor (int j = 0; j < max_x - 1; ++j) {\n\t\t\t\tarea += cum_sum[cur][j] > 0;\n\t\t\t\tlength += ((cum_sum[pre][j] > 0) != (cum_sum[cur][j] > 0));\n\t\t\t\tlength += ((cum_sum[cur][j] > 0) != (cum_sum[cur][j + 1] > 0));\n\t\t\t}\n\t\t}\n\n\t\tcout << area << endl;\n\t\tif (r == 2) {\n\t\t\tcout << length << endl;\n\t\t}\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 3230, "memory_kb": 3552, "score_of_the_acc": -1.1128, "final_rank": 9 }, { "submission_id": "aoj_0509_5628870", "code_snippet": "#include <iostream>\n#include <vector>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\n\nusing Pii = pair<int, int>;\n\nconst int max_y = 10002;\nconst int max_x = 10003;\n\nint main() {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\tint n, r;\n\twhile (cin >> n >> r, n) {\n\t\tvector<vector<Pii>> imos(max_y);\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tint x0, y0, x1, y1;\n\t\t\tcin >> x0 >> y0 >> x1 >> y1;\n\t\t\timos[y0 + 1].emplace_back(x0 + 1, 1);\n\t\t\timos[y0 + 1].emplace_back(x1 + 1, -1);\n\t\t\timos[y1 + 1].emplace_back(x0 + 1, -1);\n\t\t\timos[y1 + 1].emplace_back(x1 + 1, 1);\n\t\t}\n\t\tvector<vector<int>> cum_sum(2, vector<int>(max_x));\n\t\tint area = 0, length = 0;\n\t\tfor (int i = 0; i < max_y; ++i) {\n\t\t\tint cur = i % 2, pre = (i + 1) % 2;\n\t\t\tfill(cum_sum[cur].begin(), cum_sum[cur].end(), 0);\n\t\t\tfor (int j = 0; j < (int)imos[i].size(); ++j) {\n\t\t\t\tcum_sum[cur][imos[i][j].first] += imos[i][j].second;\n\t\t\t}\n\t\t\tfor (int j = 0; j < max_x - 1; ++j) {\n\t\t\t\tcum_sum[cur][j + 1] += cum_sum[cur][j];\n\t\t\t\tcum_sum[cur][j] += cum_sum[pre][j];\n\t\t\t}\n\t\t\tfor (int j = 0; j < max_x - 1; ++j) {\n\t\t\t\tarea += cum_sum[cur][j] > 0;\n\t\t\t\tlength += ((cum_sum[pre][j] > 0) != (cum_sum[cur][j] > 0));\n\t\t\t\tlength += ((cum_sum[cur][j] > 0) != (cum_sum[cur][j + 1] > 0));\n\t\t\t}\n\t\t}\n\n\t\tcout << area << endl;\n\t\tif (r == 2) {\n\t\t\tcout << length << endl;\n\t\t}\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 3230, "memory_kb": 3560, "score_of_the_acc": -1.1188, "final_rank": 11 }, { "submission_id": "aoj_0509_5628844", "code_snippet": "#include <iostream>\n#include <vector>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\n\nusing Pii = pair<int, int>;\n\nconst int max_y = 10003;\nconst int max_x = 10003;\n\nint main() {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\tint n, r;\n\twhile (cin >> n >> r, n) {\n\t\tvector<vector<Pii>> imos(max_y);\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tint x0, y0, x1, y1;\n\t\t\tcin >> x0 >> y0 >> x1 >> y1;\n\t\t\timos[y0 + 1].emplace_back(x0 + 1, 1);\n\t\t\timos[y0 + 1].emplace_back(x1 + 1, -1);\n\t\t\timos[y1 + 1].emplace_back(x0 + 1, -1);\n\t\t\timos[y1 + 1].emplace_back(x1 + 1, 1);\n\t\t}\n\t\tvector<vector<int>> cum_sum(2, vector<int>(max_x));\n\t\tint area = 0, length = 0;\n\t\tfor (int i = 0; i < max_y; ++i) {\n\t\t\tint cur = i % 2, pre = (i + 1) % 2;\n\t\t\tfill(cum_sum[cur].begin(), cum_sum[cur].end(), 0);\n\t\t\tfor (int j = 0; j < (int)imos[i].size(); ++j) {\n\t\t\t\tcum_sum[cur][imos[i][j].first] += imos[i][j].second;\n\t\t\t}\n\t\t\tfor (int j = 0; j < max_x - 1; ++j) {\n\t\t\t\tcum_sum[cur][j + 1] += cum_sum[cur][j];\n\t\t\t\tcum_sum[cur][j] += cum_sum[pre][j];\n\t\t\t}\n\t\t\tfor (int j = 0; j < max_x - 1; ++j) {\n\t\t\t\tarea += cum_sum[cur][j] > 0;\n\t\t\t\tlength += ((cum_sum[pre][j] > 0) != (cum_sum[cur][j] > 0));\n\t\t\t\tlength += ((cum_sum[cur][j] > 0) != (cum_sum[cur][j + 1] > 0));\n\t\t\t}\n\t\t}\n\n\t\tcout << area << endl;\n\t\tif (r == 2) {\n\t\t\tcout << length << endl;\n\t\t}\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 3220, "memory_kb": 3560, "score_of_the_acc": -1.1153, "final_rank": 10 }, { "submission_id": "aoj_0509_5628836", "code_snippet": "#include <iostream>\n#include <vector>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\n\nusing Pii = pair<int, int>;\n\nconst int max_y = 10003;\nconst int max_x = 10003;\n\nint main() {\n#if READ_FROM_FILE\n\tstd::ifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\tint n, r;\n\twhile (cin >> n >> r, n) {\n\t\tvector<vector<Pii>> imos(max_y);\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tint x0, y0, x1, y1;\n\t\t\tcin >> x0 >> y0 >> x1 >> y1;\n\t\t\timos[y0 + 1].emplace_back(x0 + 1, 1);\n\t\t\timos[y0 + 1].emplace_back(x1 + 1, -1);\n\t\t\timos[y1 + 1].emplace_back(x0 + 1, -1);\n\t\t\timos[y1 + 1].emplace_back(x1 + 1, 1);\n\t\t}\n\t\tvector<vector<int>> cum_sum(2, vector<int>(max_x));\n\t\tint area = 0, length = 0;\n\t\tfor (int i = 0; i < max_y; ++i) {\n\t\t\tint cur = i % 2, pre = (i + 1) % 2;\n\t\t\tfill(cum_sum[cur].begin(), cum_sum[cur].end(), 0);\n\t\t\tfor (int j = 0; j < imos[i].size(); ++j) {\n\t\t\t\tcum_sum[cur][imos[i][j].first] += imos[i][j].second;\n\t\t\t}\n\t\t\tfor (int j = 0; j < max_x - 1; ++j) {\n\t\t\t\tcum_sum[cur][j + 1] += cum_sum[cur][j];\n\t\t\t\tcum_sum[cur][j] += cum_sum[pre][j];\n\t\t\t}\n\t\t\tfor (int j = 0; j < max_x - 1; ++j) {\n\t\t\t\tarea += cum_sum[cur][j] > 0;\n\t\t\t\tlength += ((cum_sum[pre][j] > 0) != (cum_sum[cur][j] > 0));\n\t\t\t\tlength += ((cum_sum[cur][j] > 0) != (cum_sum[cur][j + 1] > 0));\n\t\t\t}\n\t\t}\n\n\t\tcout << area << endl;\n\t\tif (r == 2) {\n\t\t\tcout << length << endl;\n\t\t}\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 3240, "memory_kb": 3700, "score_of_the_acc": -1.2267, "final_rank": 19 }, { "submission_id": "aoj_0509_5628832", "code_snippet": "#include <iostream>\n#include <vector>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\n\nusing Pii = pair<int, int>;\n\nconstexpr int max_y = 10003;\nconstexpr int max_x = 10003;\n\nint main() {\n#if READ_FROM_FILE\n\tstd::ifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\tint n, r;\n\twhile (cin >> n >> r, n) {\n\t\tvector<vector<Pii>> imos(max_y);\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tint x0, y0, x1, y1;\n\t\t\tcin >> x0 >> y0 >> x1 >> y1;\n\t\t\timos[y0 + 1].emplace_back(x0 + 1, 1);\n\t\t\timos[y0 + 1].emplace_back(x1 + 1, -1);\n\t\t\timos[y1 + 1].emplace_back(x0 + 1, -1);\n\t\t\timos[y1 + 1].emplace_back(x1 + 1, 1);\n\t\t}\n\t\tvector<vector<int>> cum_sum(2, vector<int>(max_x));\n\t\tint area = 0, length = 0;\n\t\tfor (int i = 0; i < max_y; ++i) {\n\t\t\tint cur = i % 2, pre = (i + 1) % 2;\n\t\t\tfill(cum_sum[cur].begin(), cum_sum[cur].end(), 0);\n\t\t\tfor (int j = 0; j < imos[i].size(); ++j) {\n\t\t\t\tcum_sum[cur][imos[i][j].first] += imos[i][j].second;\n\t\t\t}\n\t\t\tfor (int j = 0; j < max_x - 1; ++j) {\n\t\t\t\tcum_sum[cur][j + 1] += cum_sum[cur][j];\n\t\t\t\tcum_sum[cur][j] += cum_sum[pre][j];\n\t\t\t}\n\t\t\tfor (int j = 0; j < max_x - 1; ++j) {\n\t\t\t\tarea += cum_sum[cur][j] > 0;\n\t\t\t\tlength += ((cum_sum[pre][j] > 0) != (cum_sum[cur][j] > 0));\n\t\t\t\tlength += ((cum_sum[cur][j] > 0) != (cum_sum[cur][j + 1] > 0));\n\t\t\t}\n\t\t}\n\n\t\tcout << area << endl;\n\t\tif(r == 2) {\n\t\t\tcout << length << endl;\n\t\t}\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 3230, "memory_kb": 3692, "score_of_the_acc": -1.2173, "final_rank": 17 }, { "submission_id": "aoj_0509_5628828", "code_snippet": "#include <iostream>\n#include <vector>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\n\nusing Pii = pair<int, int>;\n\nconstexpr int max_y = 10003;\nconstexpr int max_x = 10003;\n\nint main() {\n#if READ_FROM_FILE\n\tstd::ifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\tint n, r;\n\twhile (cin >> n >> r, n) {\n\t\tvector<vector<Pii>> imos(max_y);\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tint x0, y0, x1, y1;\n\t\t\tcin >> x0 >> y0 >> x1 >> y1;\n\t\t\timos[y0 + 1].emplace_back(x0 + 1, 1);\n\t\t\timos[y0 + 1].emplace_back(x1 + 1, -1);\n\t\t\timos[y1 + 1].emplace_back(x0 + 1, -1);\n\t\t\timos[y1 + 1].emplace_back(x1 + 1, 1);\n\t\t}\n\t\tvector<vector<int>> cum_sum(2, vector<int>(max_x));\n\t\tint area = 0, length = 0;\n\t\tfor (int i = 0; i < max_y; ++i) {\n\t\t\tint cur = i % 2, pre = (i + 1) % 2;\n\t\t\tfill(cum_sum[cur].begin(), cum_sum[cur].end(), 0);\n\t\t\tfor (int j = 0; j < imos[i].size(); ++j) {\n\t\t\t\tcum_sum[cur][imos[i][j].first] += imos[i][j].second;\n\t\t\t}\n\t\t\tfor (int j = 0; j < max_x - 1; ++j) {\n\t\t\t\tcum_sum[cur][j + 1] += cum_sum[cur][j];\n\t\t\t\tcum_sum[cur][j] += cum_sum[pre][j];\n\t\t\t}\n\t\t\tfor (int j = 0; j < max_x - 1; ++j) {\n\t\t\t\tarea += cum_sum[cur][j] > 0;\n\t\t\t\tlength += ((cum_sum[pre][j] > 0) != (cum_sum[cur][j] > 0));\n\t\t\t\tlength += ((cum_sum[cur][j] > 0) != (cum_sum[cur][j + 1] > 0));\n\t\t\t}\n\t\t}\n\n\t\tif (r == 1) {\n\t\t\tcout << area << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << area << '\\n' << length << endl;\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 3220, "memory_kb": 3612, "score_of_the_acc": -1.1541, "final_rank": 15 }, { "submission_id": "aoj_0509_5628820", "code_snippet": "#include <iostream>\n#include <vector>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\n\nusing Pii = pair<int, int>;\n\nconstexpr int max_y = 10003;\nconstexpr int max_x = 10003;\n\nint main() {\n#if READ_FROM_FILE\n\tstd::ifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\tint n, r;\n\twhile (cin >> n >> r, n) {\n\t\tvector<vector<Pii>> imos(max_y);\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tint x0, y0, x1, y1;\n\t\t\tcin >> x0 >> y0 >> x1 >> y1;\n\t\t\timos[y0 + 1].emplace_back(x0 + 1, 1);\n\t\t\timos[y0 + 1].emplace_back(x1 + 1, -1);\n\t\t\timos[y1 + 1].emplace_back(x0 + 1, -1);\n\t\t\timos[y1 + 1].emplace_back(x1 + 1, 1);\n\t\t}\n\t\tvector<vector<int>> sum(2, vector<int>(max_x));\n\t\tint S = 0, len = 0;\n\t\tfor (int i = 0; i < max_y; ++i) {\n\t\t\tint now = i % 2, pre = (i + 1) % 2;\n\t\t\tfill(sum[now].begin(), sum[now].end(), 0);\n\t\t\tfor (int j = 0; j < imos[i].size(); ++j) {\n\t\t\t\tsum[now][imos[i][j].first] += imos[i][j].second;\n\t\t\t}\n\t\t\tfor (int j = 0; j < max_x - 1; ++j) {\n\t\t\t\tsum[now][j + 1] += sum[now][j];\n\t\t\t\tsum[now][j] += sum[pre][j];\n\t\t\t}\n\t\t\tfor (int j = 0; j < max_x - 1; ++j) {\n\t\t\t\tS += sum[now][j] > 0;\n\t\t\t\tlen += ((sum[pre][j] > 0) != (sum[now][j] > 0));\n\t\t\t\tlen += ((sum[now][j] > 0) != (sum[now][j + 1] > 0));\n\t\t\t}\n\t\t}\n\n\t\tif (r == 1) {\n\t\t\tcout << S << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << S << '\\n' << len << endl;\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 3220, "memory_kb": 3552, "score_of_the_acc": -1.1094, "final_rank": 8 }, { "submission_id": "aoj_0509_5628813", "code_snippet": "#include <iostream>\n#include <vector>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\n\nusing Pii = pair<int, int>;\n\nconstexpr int max_y = 10003;\nconstexpr int max_x = 10003;\n\nint main() {\n#if READ_FROM_FILE\n std::ifstream ifs(\"test1.txt\");\n cin.rdbuf(ifs.rdbuf());\n#endif\n int n, r;\n while(cin >> n >> r, n) {\n vector<vector<Pii>> v(max_y);\n for(int i=0; i<n; ++i) {\n int x1, y1, x2, y2;\n cin >> x1 >> y1 >> x2 >> y2;\n v[y1+1].emplace_back(x1+1, 1);\n v[y1+1].emplace_back(x2+1, -1);\n v[y2+1].emplace_back(x1+1, -1);\n v[y2+1].emplace_back(x2+1, 1);\n }\n vector<vector<int>> sum(2, vector<int>(max_x));\n int S = 0, len = 0;\n for(int i=0; i<max_y; ++i) {\n int now = i % 2, pre = (i+1) % 2;\n fill(sum[now].begin(), sum[now].end(), 0);\n for(int j=0; j<v[i].size(); ++j) {\n sum[now][v[i][j].first] += v[i][j].second;\n }\n for(int j=0; j<max_x - 1; ++j) {\n sum[now][j+1] += sum[now][j];\n sum[now][j] += sum[pre][j];\n }\n for(int j=0; j<max_x - 1; ++j) {\n S += sum[now][j] > 0;\n len += ((sum[pre][j] > 0) != (sum[now][j] > 0));\n len += ((sum[now][j] > 0) != (sum[now][j+1] > 0));\n }\n }\n \n if(r == 1) {\n cout << S << endl;\n } else {\n cout << S << '\\n' << len << endl;\n }\n }\n}", "accuracy": 1, "time_ms": 3230, "memory_kb": 3604, "score_of_the_acc": -1.1516, "final_rank": 14 }, { "submission_id": "aoj_0509_5628808", "code_snippet": "#include <iostream>\n#include <vector>\n\n#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\nusing namespace std;\n\nusing P = pair<int, int>;\n\nconstexpr int MAX_Y = 10003;\nconstexpr int MAX_X = 10003;\n\nint main() {\n#if READ_FROM_FILE\n std::ifstream ifs(\"test1.txt\");\n cin.rdbuf(ifs.rdbuf());\n#endif\n int n, r;\n while(cin >> n >> r, n) {\n vector<vector<P>> v(MAX_Y);\n for(int i=0; i<n; ++i) {\n int x1, y1, x2, y2;\n cin >> x1 >> y1 >> x2 >> y2;\n v[y1+1].emplace_back(x1+1, 1);\n v[y1+1].emplace_back(x2+1, -1);\n v[y2+1].emplace_back(x1+1, -1);\n v[y2+1].emplace_back(x2+1, 1);\n }\n vector<vector<int>> sum(2, vector<int>(MAX_X));\n int S = 0, len = 0;\n for(int i=0; i<MAX_Y; ++i) {\n int now = i % 2, pre = (i+1) % 2;\n fill(sum[now].begin(), sum[now].end(), 0);\n for(int j=0; j<v[i].size(); ++j) {\n sum[now][v[i][j].first] += v[i][j].second;\n }\n for(int j=0; j<MAX_X - 1; ++j) {\n sum[now][j+1] += sum[now][j];\n sum[now][j] += sum[pre][j];\n }\n for(int j=0; j<MAX_X - 1; ++j) {\n S += sum[now][j] > 0;\n len += ((sum[pre][j] > 0) != (sum[now][j] > 0));\n len += ((sum[now][j] > 0) != (sum[now][j+1] > 0));\n }\n }\n \n if(r == 1) {\n cout << S << endl;\n } else {\n cout << S << '\\n' << len << endl;\n }\n }\n}", "accuracy": 1, "time_ms": 3220, "memory_kb": 3696, "score_of_the_acc": -1.2168, "final_rank": 16 }, { "submission_id": "aoj_0509_5628793", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing P = pair<int, int>;\n\nconstexpr int MAX_Y = 10003;\nconstexpr int MAX_X = 10003;\n\nint main() {\n int n, r;\n while(cin >> n >> r, n) {\n vector<vector<P>> v(MAX_Y);\n for(int i=0; i<n; ++i) {\n int x1, y1, x2, y2;\n cin >> x1 >> y1 >> x2 >> y2;\n v[y1+1].emplace_back(x1+1, 1);\n v[y1+1].emplace_back(x2+1, -1);\n v[y2+1].emplace_back(x1+1, -1);\n v[y2+1].emplace_back(x2+1, 1);\n }\n vector<vector<int>> sum(2, vector<int>(MAX_X));\n int S = 0, len = 0;\n for(int i=0; i<MAX_Y; ++i) {\n int now = i % 2, pre = (i+1) % 2;\n fill(sum[now].begin(), sum[now].end(), 0);\n for(int j=0; j<v[i].size(); ++j) {\n sum[now][v[i][j].first] += v[i][j].second;\n }\n for(int j=0; j<MAX_X; ++j) {\n sum[now][j+1] += sum[now][j];\n sum[now][j] += sum[pre][j];\n }\n for(int j=0; j<MAX_X; ++j) {\n S += sum[now][j] > 0;\n len += ((sum[pre][j] > 0) != (sum[now][j] > 0));\n len += ((sum[now][j] > 0) != (sum[now][j+1] > 0));\n }\n }\n \n if(r == 1) {\n cout << S << endl;\n } else {\n cout << S << '\\n' << len << endl;\n }\n }\n}", "accuracy": 1, "time_ms": 3220, "memory_kb": 3536, "score_of_the_acc": -1.0974, "final_rank": 7 }, { "submission_id": "aoj_0509_4996355", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <stack>\n#include <numeric>\n#include <bitset>\n#include <cmath>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing u64 = unsigned long long;\nusing namespace std;\n\ntemplate<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;\n\nint main() {\n int n, r;\n while(cin >> n >> r, n){\n vector<vector<tuple<int, int, int>>> que(10010);\n for (int i = 0; i < n; ++i) {\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n que[a].emplace_back(b, d, 1);\n que[c].emplace_back(b, d, -1);\n }\n vector<int> val(10010), prv(10010);\n int round = 0, area = 0;\n for (int i = 0; i < 10010; ++i) {\n copy(val.begin(),val.end(), prv.begin());\n for (auto [l, r, d] : que[i]) {\n for (int j = l+1; j <= r; ++j) {\n val[j] += d;\n }\n }\n for (int j = 0; j < 10010; ++j) {\n if(!prv[j] != !val[j]) round++;\n }\n for (int j = 1; j < 10010; ++j) {\n if(!val[j] != !(val[j-1])) round++;\n if(val[j]) area++;\n }\n }\n cout << area << \"\\n\";\n if(r == 2){\n cout << round << \"\\n\";\n }\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 1910, "memory_kb": 4084, "score_of_the_acc": -1.0577, "final_rank": 4 }, { "submission_id": "aoj_0509_4886228", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing P = pair<int, int>;\nconstexpr int MAX_Y = 10003;\nconstexpr int MAX_X = 10003;\nint main() {\n int n, r;\n while(cin >> n >> r, n) {\n vector<vector<P>> v(MAX_Y);\n for(int i=0; i<n; ++i) {\n int x1, y1, x2, y2;cin >> x1 >> y1 >> x2 >> y2;++x1; ++y1; ++x2; ++y2;\n v[y1].emplace_back(x1, 1);\n v[y1].emplace_back(x2, -1);\n v[y2].emplace_back(x1, -1);\n v[y2].emplace_back(x2, 1);\n }\n vector<vector<int>> sum(2, vector<int>(MAX_X));\n int S = 0, len = 0;\n for(int i=0; i<MAX_Y; ++i) {\n int now = i % 2, pre = (i+1) % 2;\n fill(sum[now].begin(), sum[now].end(), 0);\n for(int j=0; j<v[i].size(); ++j) {\n sum[now][v[i][j].first] += v[i][j].second;\n }\n for(int j=0; j<MAX_X; ++j) {\n sum[now][j+1] += sum[now][j];\n sum[now][j] += sum[pre][j];\n }\n for(int j=0; j<MAX_X; ++j) {\n S += sum[now][j] > 0;\n len += ((sum[pre][j] > 0) != (sum[now][j] > 0));\n len += ((sum[now][j] > 0) != (sum[now][j+1] > 0));\n }\n }\n cout << S << endl;\n if(r==2) cout << len << endl;\n }\n}", "accuracy": 1, "time_ms": 3200, "memory_kb": 3612, "score_of_the_acc": -1.1473, "final_rank": 13 }, { "submission_id": "aoj_0509_4207652", "code_snippet": "// imos kyoukai -> subtraction \n// MLEのため row by row \n\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define pb push_back\n#define fi first\n#define se second\ntypedef pair<ll,ll> P;\nusing VP = vector<P>; using VVP = vector<VP>;\nusing VI = vector<ll>; using VVI = vector<VI>; using VVVI = vector<VVI>;\nconst int inf=1e9+7;\nconst ll INF=1LL<<61;\nconst ll mod=1e9+7;\n\ntemplate<class T>\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T>\ninline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\nint f[2][10101]; \nvector<P> p[10101];\n\nint main(){\n int i,j;\n int n,q;\n while(1){\n cin>>n>>q;\n if(n==0) break;\n memset(f,0,sizeof(f));\n for(i=0;i<10101;i++) p[i].clear();\n int h=0,w=0;\n for(i=0;i<n;i++){\n int a,b,c,d;\n cin>>a>>b>>c>>d;\n a++;\n b++;\n c++;\n d++;\n p[b].pb(P(a,1));\n p[b].pb(P(c,-1));\n p[d].pb(P(a,-1));\n p[d].pb(P(c,1));\n h = max(h, d);\n w = max(w, c);\n }\n int area = 0;\n int length = 0;\n for(i=0;i<h+2;i++){\n memset(f[1], 0, sizeof(f[1]));\n for(P u:p[i]) f[1][u.fi]+=u.se;\n for(j=0;j<w+1;j++){\n f[1][j+1]+=f[1][j];\n }\n for(j=0;j<w+2;j++){\n f[1][j]+=f[0][j];\n }\n for(j=0;j<w+2;j++){\n if(f[1][j]) area++;\n //if(f[1][j]) cout<<i<<\" \"<<j<<endl;\n if((f[0][j] > 0) != (f[1][j] > 0)) length++;\n if((f[1][j] > 0) != (f[1][j+1] > 0)) length++;\n }\n swap(f[0],f[1]);\n }\n cout<<area<<endl;\n if(q==2) cout<<length<<endl;\n }\n\n}", "accuracy": 1, "time_ms": 800, "memory_kb": 4212, "score_of_the_acc": -0.7731, "final_rank": 2 }, { "submission_id": "aoj_0509_4083461", "code_snippet": "#include <bits/stdc++.h>\n \n// #include <boost/multiprecision/cpp_int.hpp>\n #define int long long\n #define inf 1000000007\n #define pa pair<int,int>\n #define ll long long\n #define pal pair<double,double>\n #define ppap pair<pa,int>\n #define PI 3.14159265358979323846\n #define paa pair<int,char>\n #define mp make_pair\n #define pb push_back\n #define EPS (1e-8)\n \n int dx[8]={0,1,0,-1,1,1,-1,-1};\n int dy[8]={1,0,-1,0,-1,1,1,-1};\n using namespace std;\n \t\t\tclass pa3{\n \tpublic:\n \tint x;\n \t\t\t\tint y,z;\n \tpa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}\n \tbool operator < (const pa3 &p) const{\n \t\tif(x!=p.x) return x<p.x;\n \t\tif(y!=p.y) return y<p.y;\n \t\t return z<p.z;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \t\t\t\tbool operator > (const pa3 &p) const{\n \t\tif(x!=p.x) return x>p.x;\n \t\tif(y!=p.y) return y>p.y;\n \t\t return z>p.z;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const pa3 &p) const{\n \t\treturn x==p.x && y==p.y && z==p.z;\n \t}\n \t\tbool operator != (const pa3 &p) const{\n \t\t\treturn !( x==p.x && y==p.y && z==p.z);\n \t}\n \n };\n \n class pa4{\n \tpublic:\n \tint x;\n \tint y,z,w;\n \tpa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}\n \tbool operator < (const pa4 &p) const{\n \t\tif(x!=p.x) return x<p.x;\n \t\tif(y!=p.y) return y<p.y;\n \t\tif(z!=p.z)return z<p.z;\n \t\treturn w<p.w;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator > (const pa4 &p) const{\n \t\tif(x!=p.x) return x>p.x;\n \t\tif(y!=p.y) return y>p.y;\n \t\tif(z!=p.z)return z>p.z;\n \t\treturn w>p.w;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const pa4 &p) const{\n \t\treturn x==p.x && y==p.y && z==p.z &&w==p.w;\n \t}\n \t\t\n \n };\n class pa2{\n \tpublic:\n \tint x,y;\n \tpa2(int x=0,int y=0):x(x),y(y) {}\n \tpa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}\n \tpa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}\n \tbool operator < (const pa2 &p) const{\n \t\treturn y != p.y ? y<p.y: x<p.x;\n \t}\n \tbool operator > (const pa2 &p) const{\n \t\treturn x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const pa2 &p) const{\n \t\treturn abs(x-p.x)==0 && abs(y-p.y)==0;\n \t}\n \tbool operator != (const pa2 &p) const{\n \t\treturn !(abs(x-p.x)==0 && abs(y-p.y)==0);\n \t}\n \t\t\n \n };\n \n \n \n string itos( int i ) {\n ostringstream s ;\n s << i ;\n return s.str() ;\n }\n \n int gcd(int v,int b){\n \tif(v==0) return b;\n \tif(b==0) return v;\n \tif(v>b) return gcd(b,v);\n \tif(v==b) return b;\n \tif(b%v==0) return v;\n \treturn gcd(v,b%v);\n }\n \n \n int mod;\nint extgcd(int a, int b, int &x, int &y) {\n if (b == 0) {\n x = 1;\n y = 0;\n return a;\n }\n int d = extgcd(b, a%b, y, x);\n y -= a/b * x;\n return d;\n}\npa operator+(const pa & l,const pa & r) { \n return {l.first+r.first,l.second+r.second}; \n} \npa operator-(const pa & l,const pa & r) { \n return {l.first-r.first,l.second-r.second}; \n} \n \n int pr[10000100];\n int inv[10000010];\n \n int beki(int wa,int rr,int warukazu){\n \tif(rr==0) return 1%warukazu;\n \tif(rr==1) return wa%warukazu;\n \twa%=warukazu;\n \tif(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;\n \tll zx=beki(wa,rr/2,warukazu);\n \treturn (zx*zx)%warukazu;\n }\n \n \n \t\t\tint comb(int nn,int rr){\n \t\t\t\tif(rr<0 || rr>nn || nn<0) return 0;\n \t\t\t\tint r=pr[nn]*inv[rr];\n \t\t\t\tr%=mod;\n \t\t\t\tr*=inv[nn-rr];\n \t\t\t\tr%=mod;\n \t\t\t\treturn r;\n \t\t\t}\n \n void gya(int ert){\n \tpr[0]=1;\n \tfor(int i=1;i<=ert;i++){\n \t\tpr[i]=(pr[i-1]*i)%mod;\n \t}\n \t\tinv[ert]=beki(pr[ert],mod-2,mod);\n \tfor(int i=ert-1;i>=0;i--){\n \t\tinv[i]=inv[i+1]*(i+1)%mod;\n \t}\n }\n \n // cin.tie(0);\n \t\t//\tios::sync_with_stdio(false);\n \t\t\t//priority_queue<pa3,vector<pa3>,greater<pa3>> pq; \n //sort(ve.begin(),ve.end(),greater<int>());\n // mt19937(clock_per_sec);\n // mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ;\n \n\nvector<pa> ve[10010];\n\nint mae[10020];\nint dp[10022];\nsigned main(){\n\t\n\t\n cin.tie(0);\n\tios::sync_with_stdio(false);\nwhile(1){\n\n\t\n\tint n,P;\n\tcin>>n>>P;\nif(n+P==0)exit(0);\nfor(int i=0;i<10010;i++)ve[i].clear();\n\tfor(int i=0;i<n;i++){\nint x1,y1,x2,y2;\n\t\tcin>>x1>>y1>>x2>>y2;\n\t\tx1++,y1++,x2++,y2++;\n\t\tve[x1].pb(mp(y1,1));\n\t\tve[x2].pb(mp(y1,-1));\n\t\tve[x1].pb(mp(y2,-1));\n\t\tve[x2].pb(mp(y2,1));\n\t\t\n\t\t\n\t}\n\tint cnt=0;\n\tint sa=0;\n\tfor(int i=1;i<=10005;i++){\n\t\tfor(int j=1;j<=10005;j++)dp[j]=0;\n\t\tfor(auto v:ve[i])dp[v.first]+=v.second;\n\t\tfor(int j=1;j<=10005;j++){\n\t\t\tdp[j]=dp[j]+mae[j]+dp[j-1]-mae[j-1];\n\t\t\tif(dp[j]>0)cnt++;\n\t\t\tif(dp[j]>0 && mae[j]==0)sa++;\n\t\t\tif(dp[j]==0 && mae[j]>0)sa++;\n\t\t\tif(dp[j]>0 && dp[j-1]==0)sa++;\n\t\t\tif(dp[j]==0 && dp[j-1]>0)sa++;\n\t\t\t\n\t\t}\n\t\t\n\t\tfor(int j=1;j<=10005;j++)mae[j]=dp[j];\n\t\t\n\t}\n\tcout<<cnt<<endl;\n\tif(P==2)cout<<sa<<endl;\n}\n\treturn 0;\n\t\n\n \n }", "accuracy": 1, "time_ms": 2370, "memory_kb": 4516, "score_of_the_acc": -1.5377, "final_rank": 20 }, { "submission_id": "aoj_0509_3426864", "code_snippet": "#include <stdio.h>\n#include <vector>\n#define MAX (10000+2)\nusing namespace std;\nint main(){\n int n, r, x1, x2, y1, y2;\n while(true){\n scanf(\"%d %d\", &n, &r);\n if(n==0 && r==0) break;\n int plane[2][MAX]={0};\n vector<vector<pair<int, int> > > sheets(MAX);\n for(int i=0; i<n; i++){\n scanf(\"%d %d %d %d\", &x1, &y1, &x2, &y2);\n sheets[x1+1].push_back(make_pair(y1+1,+1));\n sheets[x1+1].push_back(make_pair(y2+1,-1));\n sheets[x2+1].push_back(make_pair(y1+1,-1));\n sheets[x2+1].push_back(make_pair(y2+1,+1));\n }\n if(r==2){\n int area=0, length=0;\n for(int x=1; x<MAX; x++){\n for(int i=0; i<MAX; i++){\n plane[x%2][i]=0;\n }\n for(vector<pair<int, int> >::iterator sheet=sheets[x].begin(); sheet!=sheets[x].end(); sheet++){\n plane[x%2][(*sheet).first]+=(*sheet).second;\n }\n for(int y=1; y<MAX; y++){\n plane[x%2][y]+=plane[x%2][y-1];\n }\n for(int y=1; y<MAX; y++){\n plane[x%2][y]+=plane[(x+1)%2][y];\n area+=plane[x%2][y]>0 ? 1 : 0;\n length+=(plane[x%2][y-1]>0)!=(plane[x%2][y]>0) ? 1 : 0;\n length+=(plane[x%2][y]>0)!=(plane[(x+1)%2][y]>0) ? 1 : 0;\n }\n }\n printf(\"%d\\n%d\\n\", area, length);\n }else{\n int area=0;\n for(int x=1; x<MAX; x++){\n for(int i=0; i<MAX; i++){\n plane[x%2][i]=0;\n }\n for(vector<pair<int, int> >::iterator sheet=sheets[x].begin(); sheet!=sheets[x].end(); sheet++){\n plane[x%2][(*sheet).first]+=(*sheet).second;\n }\n for(int y=1; y<MAX; y++){\n plane[x%2][y]+=plane[x%2][y-1];\n }\n for(int y=1; y<MAX; y++){\n plane[x%2][y]+=plane[(x+1)%2][y];\n area+=plane[x%2][y]>0 ? 1 : 0;\n }\n }\n printf(\"%d\\n\", area);\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 3230, "memory_kb": 3176, "score_of_the_acc": -0.8322, "final_rank": 3 }, { "submission_id": "aoj_0509_3426692", "code_snippet": "#include <stdio.h>\n#include <vector>\n#define MAX (10000+2)\nusing namespace std;\nint main(){\n int n, r, x1, x2, y1, y2;\n while(true){\n scanf(\"%d %d\", &n, &r);\n if(n==0 && r==0) break;\n int plane[2][MAX]={0};\n vector<vector<pair<int, int> > > sheets(MAX);\n for(int i=0; i<n; i++){\n scanf(\"%d %d %d %d\", &x1, &y1, &x2, &y2);\n sheets[x1+1].push_back(make_pair(y1+1,+1));\n sheets[x1+1].push_back(make_pair(y2+1,-1));\n sheets[x2+1].push_back(make_pair(y1+1,-1));\n sheets[x2+1].push_back(make_pair(y2+1,+1));\n }\n int area=0, length=0;\n for(int x=1; x<MAX; x++){\n for(int i=0; i<MAX; i++){\n plane[x%2][i]=0;\n }\n for(vector<pair<int, int> >::iterator sheet=sheets[x].begin(); sheet!=sheets[x].end(); sheet++){\n plane[x%2][(*sheet).first]+=(*sheet).second;\n }\n for(int y=1; y<MAX; y++){\n plane[x%2][y]+=plane[x%2][y-1];\n }\n for(int y=1; y<MAX; y++){\n plane[x%2][y]+=plane[(x+1)%2][y];\n area+=plane[x%2][y]>0 ? 1 : 0;\n length+=(plane[x%2][y-1]>0)!=(plane[x%2][y]>0) ? 1 : 0;\n length+=(plane[x%2][y]>0)!=(plane[(x+1)%2][y]>0) ? 1 : 0;\n }\n }\n printf(\"%d\\n\", area);\n if(r==2){\n printf(\"%d\\n\", length);\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 3720, "memory_kb": 3292, "score_of_the_acc": -1.0866, "final_rank": 5 } ]
aoj_0520_cpp
最軽量のモビール 問題 モビールは動く芸術品として広く親しまれている.IOI 日本委員会では,JOI を広報するためにモビールを作成することになった.JOI 広報用モビールは,棒,紐(ひも),錘(おもり)の 3 種類の要素を用いて,次のように構成される. 棒の一方の端は青に,もう一方の端は赤に塗られている. 棒は両端以外の 1 箇所を支点として紐でつるされる. 支点から赤の端までの長さも支点から青の端までの長さも正整数である. 棒の両端には,紐で錘か他の棒をつるす. 錘は紐を用いてどれかの棒の一端につるされる. 錘には何もつるさない. 錘の重さは正整数である. 紐のうち 1 本だけは,片方の端をある棒をつるすためにその棒の支点に結ばれ, もう一方の端は他のどの構成要素とも結ばれていない.他の紐は全て次のいず れかを満たす. ある棒の端とある棒の支点を結ぶ. ある棒の端とある錘を結ぶ. ただし,どの棒においても,バランスが取れている必要がある.棒と紐の重さは無視できるほど軽いので,棒と紐の重さは全て 0 であるとみなして解答せよ.つまり,それぞれの棒について, (その棒の赤の端より下につるされている錘の重さの総計) × (その棒の支点から赤の端までの長さ) = (その棒の青の端より下につるされている錘の重さの総計) × (その棒の支点から青の端までの長さ) であるとき,その棒はバランスが取れているとせよ. どのような長さの棒をどのように結びモビールを構成するかは既に決まっているのだが,錘の重さがまだ決まっていない.モビールは軽い方がつりやすいため, なるべく軽いモビールを作りたい.前述したようにどの棒もバランスを取りながら, モビールの総重量を最小にするような錘の付け方を求め, そのときのモビールの総重量を出力するプログラムを作れ. プログラムには以下のモビールの構成に関する情報が与えられる. 棒の本数 n 各棒ごとの情報(棒の番号は 1 から n) 支点から赤の端までの長さと支点から青の端までの長さの比 赤の端につるす棒の番号 (錘をつるす場合は 0) 青の端につるす棒の番号 (錘をつるす場合は 0) 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．入力はゼロ１つを含む行で終了する． 1 行目にはモビールに使われている棒の本数 n が書かれている.続く n 行 (1 ≤ n ≤ 100) には,各々の棒のデータが書かれている.i + 1 行目 (1 ≤ i ≤ n) には,4 つの整数 p, q, r, b が空白を区切りとして書かれており,棒 i において,支点から赤の端までの長さと支点から青の端までの比が p : q であり,赤の端につるされる棒の番号が r であり,青の端につるされる棒の番号が b であることを表している.ただし,棒番号 0 は錘がつるされることを表している.また,どの入力においても,モビールの重量の最小値を w とし,入力中で比を表すのに用いられる正整数の最大値を L とすると,wL < 2 31 を満たす. データセットの数は 15 を超えない． 出力 データセットごとにモビールの重量を１行に出力する． 入出力例 入力例 1 6 9 0 0 4 3 2 0 4 1 3 0 0 4 4 2 1 2 2 0 0 0 出力例 5 40 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0520_1758993", "code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define MAX_N 100\n \nvector<int> p, q, r, b;\n\nbool dfs(int v, int val)\n{\n int l = p[v] + q[v];\n if (val % l != 0) {\n return 0;\n }\n bool can = 1;\n if (r[v] >= 0) {\n can &= dfs(r[v], val/l*q[v]); \n } \n \n if (b[v] >= 0) {\n can &= dfs(b[v], val/l*p[v]); \n } \n return can;\n}\n \nvoid init(int N)\n{\n p.resize(N); q.resize(N);\n r.resize(N); b.resize(N);\n}\n\nint main()\n{\n int N;\n while (cin >> N, N) {\n init(N);\n int mx = 0;\n bool used[MAX_N] = {};\n for (int i = 0; i < N; i++) {\n cin >> p[i] >> q[i] >> r[i] >> b[i];\n r[i]--; b[i]--;\n if (r[i] >= 0) used[r[i]] = 1;\n if (b[i] >= 0) used[b[i]] = 1;\n int gcd = __gcd(p[i], q[i]);\n p[i] /= gcd; q[i] /= gcd;\n mx = max(mx, p[i] + q[i]);\n }\n int par = -1;\n for (int i = 0; i < N; i++) {\n if (!used[i]) {\n par = i;\n break;\n }\n }\n for (int i = mx; ; i += mx) {\n if (dfs(par, i)) {\n cout << i << endl;\n break;\n }\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 900, "memory_kb": 1220, "score_of_the_acc": -2, "final_rank": 3 }, { "submission_id": "aoj_0520_1142214", "code_snippet": "#include <iostream>\n#include <vector>\n#include <set>\n#include <map>\n#include <sstream>\n#include <string>\n#include <cstdio>\n#include <stack>\n#include <queue>\n#include <algorithm>\n#include <numeric>\n#include <functional>\n#include <cstring>\n#include <tuple>\n#include <utility>\n#include <list>\n#include <cmath>\n\nusing namespace std;\n\ntypedef long long LL;\ntypedef vector<int> Array;\ntypedef pair<int, int> P;\n\nconst int INF = 1 << 29;\nconst LL MOD = 100000;\n#define rep(i,n) for(int i=0;i<(int)n;++i)\n#define all(c) (c).begin(), (c).end()\n\nstruct edge{ int to, cost; edge(int t, int c) :to(t), cost(c){} };\n\nint dxk[] = { 1, 1, 1, 0, -1, 0 };\nint dxg[] = { 0, 1, 0, -1, -1, -1 };\nint dy[] = { -1, 0, 1, 1, 0, -1 };\n\nstruct node\n{\n\tLL value, lw, rw, left, right;\n};\n\nLL gcd(LL a, LL b)\n{\n\tif (a < b) swap(a, b);\n\treturn a % b == 0 ? b : gcd(b, a % b);\n}\nLL sks(LL a, LL b)\n{\n\tLL g = gcd(a, b);\n\treturn a / g * b;\n}\n\nLL dfs(int idx, vector<node>& bars)\n{\n\tif (idx == -1) return 1LL;\n\tnode& node = bars[idx];\n\tif (node.value != 0) return node.value;\n\n\tLL r = dfs(node.right, bars), l = dfs(node.left, bars);\n\n\tint m = 1;\n\twhile ((r * node.rw * m) % (l * node.lw) != 0) m++;\n\tint lm = r * node.rw * m / (l * node.lw);\n\t//r*lの最小公倍数を基礎値としてm:nにする\n\t//LL s = sks(r * node.rw, l * node.lw);\n\t//return node.value = s / node.rw + s / node.lw;\n\treturn node.value = m * r + lm * l;\n}\n\nint main()\n{\n\tint n;\n\twhile (cin >> n && n)\n\t{\n\t\tvector<node> bars(n);\n\t\trep(i, n)\n\t\t{\n\t\t\tint p, q, r, b;\n\t\t\tcin >> p >> q >> r >> b;\n\t\t\tint g = gcd(p, q);\n\t\t\tbars[i].rw = q / g;\n\t\t\tbars[i].lw = p / g;\n\t\t\tbars[i].left = r - 1;\n\t\t\tbars[i].right = b - 1;\n\t\t}\n\n\t\tLL ans = 0;\n\t\trep(i, n) ans = max(dfs(i, bars), ans);\n\t\tcout << ans << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 1188, "score_of_the_acc": -0.8049, "final_rank": 2 }, { "submission_id": "aoj_0520_564394", "code_snippet": "#include <cstdio>\n#include <algorithm>\n#include <vector>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,ll> P;\n#define pb push_back\n#define INF 1e15\nint n;\nint main(){\n\twhile(1){\n\t\tll lcm[105]={};\n\tvector<ll> son[105];\n\tP stick[105];\n\tbool decide[105]={};\n\tbool beleft[105]={},beright[105]={};\n\tscanf(\"%d\",&n);\n\tif(!n) break;\n\tfor(int q=1;q<=n;q++){\n\t\tll a,b,c,d;\n\t\tscanf(\"%lld %lld %lld %lld\",&a,&b,&c,&d);\n\t\tif(c){\n\t\t\tson[q].pb(c);\n\t\t\tbeleft[q]=true;\n\t\t}\n\t\tif(d){\n\t\t\tson[q].pb(d);\n\t\t\tberight[q]=true;\n\t\t}\n\t\tll rp;\n\t\tfor(int i=min(a,b);i>=1;i--){\n\t\t\tif(a%i==0 && b%i==0){\n\t\t\t\trp=((a/i)+(b/i));\n\t\t\t\tstick[q]=make_pair(a/i,b/i);\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tlcm[q]=rp;\n\t\tif(son[q].size()==0){\n\t\t\tdecide[q]=true;\n\t\t}\n\t}\n\tint last=1;\n\twhile(1){\n\t\tbool p=false;\n\tfor(int i=1;i<=n;i++){\n\t\tif(son[i].size()!=0 && !decide[i]){\n\t\t\tint cou=0;\n\t\t\tfor(int j=0;j<son[i].size();j++){\n\t\t\t\tif(decide[son[i][j]]){\n\t\t\t\t\tcou++;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(cou==son[i].size()){\n\t\t\t\t\tll maxi1=0,maxi2=0;\n\t\t\t\t\tif(beleft[i]){\n\t\t\t\t\t\tfor(int g=min(stick[i].second,lcm[son[i][0]]);g>=1;g--){\n\t\t\t\t\t\t\tif(stick[i].second%g==0 && lcm[son[i][0]]%g==0){\n\t\t\t\t\t\t\t\tmaxi1=(lcm[son[i][0]]/g*(stick[i].first+stick[i].second));\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(beright[i]){\n\t\t\t\t\t\tfor(int g=min(stick[i].first,lcm[son[i][son[i].size()-1]]);g>=1;g--){\n\t\t\t\t\t\t\tif(stick[i].first%g==0 && lcm[son[i][son[i].size()-1]]%g==0){\n\t\t\t\t\t\t\t\tmaxi2=lcm[son[i][son[i].size()-1]]/g*(stick[i].first+stick[i].second);\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(maxi1 && !maxi2){\n\t\t\t\t\t\tlcm[i]=maxi1;\n\t\t\t\t\t}else if(!maxi1 && maxi2){\n\t\t\t\t\t\tlcm[i]=maxi2;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tfor(int q=min(maxi1,maxi2);q>=1;q--){\n\t\t\t\t\t\t\tif(maxi1%q==0 && maxi2%q==0){\n\t\t\t\t\t\t\t\tlcm[i]=maxi1*maxi2/q;\n\t\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tdecide[i]=true;\n\t\t\t\t\tlast=i;\n\t\t\t\t\tp=true;\n\t\t\t}\n\t\t}\n\t}\n\tif(!p){\n\t\tbreak;\n\t}\n\t}\n\tprintf(\"%lld\\n\",lcm[last]);\n}\n}", "accuracy": 1, "time_ms": 220, "memory_kb": 1056, "score_of_the_acc": -0.236, "final_rank": 1 } ]
aoj_0507_cpp
同じ大きさの正方形の紙が n 枚ある.これらの紙の下部を水平に揃えて何列かに並べる.ただし,隣り合う列は左側が右側より低くならないように並べなければならない.例えば, n = 5 のときは,次のような 7 通りの並べ方が可能である. これらを,各列に並んだ正方形の個数の列で表すことにする.例えば, n = 5 の ときは,それぞれ, (5) (4, 1) (3, 2) (3, 1, 1) (2, 2, 1) (2, 1, 1, 1) (1, 1, 1, 1, 1) と表わされる. n を入力したとき, 辞書式順序で全て出力するプログラムを作成せよ. n ≤30 とする.ただし, 辞書式順序とは2つの並べ方 ( a 1 , a 2 , ..., a s ) が並べ方 ( b 1 , b 2 , ..., b t ) に対して, a 1 > b 1 または, ある整数 i > 1 が存在して a 1 = b 1 , ..., a i -1 = b i -1 かつ a i > b i が成り立つとき ( a 1 , a 2 , ..., a s ) が ( b 1 , b 2 , ..., b t ) より先に出力されるように並べることである. 入力データ は 1 行からなり,1 行目に n が書かれている. 出力には並べ方を辞書式順序で 1 行に1通りずつ書き最後に改行を入れること. 並べ方は ( a 1 , a 2 , ..., a s ) の出力は整数 a 1 , a 2 , . . . , a s をこの順番に空白で区切って出力すること. 入力例１ 5 出力例１ 5 4 1 3 2 3 1 1 2 2 1 2 1 1 1 1 1 1 1 1 入力 入力は複数のデータセットからなる．n が 0 のとき入力が終了する．データセットの数は 5 を超えない． 出力 データセットごとに、辞書式順序で全て出力する． 入力例 5 5 0 出力例 5 4 1 3 2 3 1 1 2 2 1 2 1 1 1 1 1 1 1 1 5 4 1 3 2 3 1 1 2 2 1 2 1 1 1 1 1 1 1 1 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0507_6744529", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing VI = vector<int>;\nusing VVI = vector<VI>;\n\nvoid solve(int n, VI ret, VVI& v) {\n if (n == 0) {\n v.push_back(ret);\n } else {\n for (int i = n; i >= 1; --i) {\n if (ret.size() > 0 && ret.back() < i) continue;\n ret.push_back(i);\n solve(n - i, ret, v);\n ret.pop_back();\n }\n }\n}\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n while (true) {\n int n;\n cin >> n;\n if (n == 0) break;\n VVI v;\n solve(n, {}, v);\n sort(v.begin(), v.end(), [](VI& a, VI& b) { return a > b; });\n for (VI& r : v) {\n string out = \"\";\n for (int& x : r) {\n out += to_string(x) + \" \";\n }\n out.pop_back();\n cout << out << endl;\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3592, "score_of_the_acc": -1, "final_rank": 19 }, { "submission_id": "aoj_0507_5243559", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n\n#define rep(i,n) for (int i = 0; i < (n); ++i)\n#define repe(i,n) for (int i = 0; i <= (n); ++i)\n#define reps(i,s,n) for (int i = (s); i < (n); ++i)\n#define rrep(i,e,n) for (int i = (n); i >= (e); --i)\n#define vl vector<ll>\n#define vvl vector<vector<ll>>\n#define len(x) (int)(x).size()\n#define all(x) (x).begin(),(x).end()\n\n\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\ntemplate<class H, class...T>void puta(H&& h, T&&...t) { cout << h << ' ';puta(t...); }\n\nint MOD = 1'000'000'007;\nll inf = (1 << 30);\n\nstatic const int NIL = -1;\nstatic const ll MAX1 = 1 + 10;\nstatic const ll MAX2 = 3'000 + 10;\n\n\n\nll n, m, q;\n\nvvl fml;\n\nll sumAry(vl f) {\n\tll sum = 0;\n\trep(i, len(f)) sum += f[i];\n\treturn sum;\n}\n\nvoid dfs(vl f) {\n\n\n\tif (len(f) > 0 && f.back() == 0) {\n\n\t\tif (sumAry(f) == n) {\n\t\t\tfml.push_back(f);\n\t\t}\n\t\treturn;\n\t}\n\telse {\n\n\n\t\tll df = n - sumAry(f);\n\t\tll wk = len(f) > 0 ? f.back() : df;\n\t\tdf = min(wk, df);\n\n\n\t\tf.push_back(df);\n\n\t\twhile (f.back() >= 0) {\n\n\t\t\tdfs(f);\n\n\t\t\tf.back()--;\n\t\t}\n\t\tf.pop_back();\n\n\t\treturn;\n\t}\n}\n\n\n\nint main() {\n\n\n\tll mxln = 0;;\n\n\twhile (true)\n\t{\n\t\tcin >> n;\n\n\t\tif (n == 0) break;\n\n\t\tfml = vvl();\n\n\t\tvl arg;\n\n\t\tdfs(arg);\n\n\t\trep(i, len(fml)) {\n\t\t\tstring s = \"\";\n\t\t\trep(j, len(fml[i])) {\n\t\t\t\tif (fml[i][j] == 0) break;\n\t\t\t\tif (j > 0) s += ' ';\n\t\t\t\ts += to_string(fml[i][j]);\n\t\t\t}\n\t\t\tcout << s << endl;\n\t\t}\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3436, "score_of_the_acc": -0.9516, "final_rank": 18 }, { "submission_id": "aoj_0507_4317221", "code_snippet": "#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cmath>\n#include <ctime>\n#include <cstring>\n#include <functional>\n#include <iostream>\n#include <iomanip>\n#include <limits>\n#include <list>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <regex>\n#include <vector>\n\n#define fix(n) cout<<fixed<<setprecision(n)\n#define rep(i,n) for (int i = 0; i < (n); ++i)\n#define all(a) (a).begin(), (a).end()\n#define sort(a) sort(all(a))\n#define uniq(a) sort(a);(a).erase(unique(all(a)), (a).end())\n#define reverse(a) reverse(all(a))\n#define ctos(c) string(1, (c))\n#define out(d) cout << (d)\n#define outl(d) std::cout<<(d)<<\"\\n\"\n#define YES() cout << \"YES\" << endl\n#define NO() cout << \"NO\" << endl\n#define Yes() cout << \"Yes\" << endl\n#define No() cout << \"No\" << endl\n#define ceil(x, y) ((x + y - 1) / (y))\n#define debug(x) cerr << #x << \": \" << (x) << '\\n'\n#define debug2(x, y) cerr << #x << \": \" << (x) << \", \" << #y << \": \" << (y) << '\\n'\n#define debug3(x, y, z) cerr << #x << \": \" << (x) << \", \" << #y << \": \" << (y) << \", \" << #z << \": \" << (z) << '\\n'\n#define dbg(v) for (size_t _ = 0; _ < v.size(); ++_){ cerr << #v << \"[\" << _ << \"] : \" << v[_] << '\\n'; }\n#define pb push_back\n#define fst first\n#define int long long\n#define INF __LONG_LONG_MAX__\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\n\nconst ll MOD = 1000000007; // 10^9 + 7\nconst int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nconst int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n\ntemplate<class T>\nvoid outvo(vector<T> v) {\n if (v.size() == 0) return;\n cout << v[0];\n for (int i = 1; i < v.size(); i++)\n cout << \" \" << v[i];\n cout << endl;\n}\n\nvoid dfs(ll n, vector<ll> ans) {\n // debug2(n, ans.size());\n\n if (n == 0) {\n outvo(ans);\n return;\n }\n\n for (int i = n; i >= 1; i--) {\n // debug3(n, i, ans.size());\n ll len = ans.size();\n if (len == 0 || (len > 0 && i <= ans[len-1])) {\n ans.push_back(i);\n dfs(n-i, ans);\n ans.pop_back();\n }\n }\n}\n\nvoid solve() {\n while (true) {\n ll n; cin >> n;\n if (n == 0) break;\n dfs(n, vector<ll>{});\n }\n}\n\nsigned main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n srand((unsigned)time(NULL));\n fix(12);\n\n solve();\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3152, "score_of_the_acc": -0.8281, "final_rank": 12 }, { "submission_id": "aoj_0507_4205487", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define pb push_back\n#define fi first\n#define se second\ntypedef pair<ll,ll> P;\nusing VP = vector<P>; using VVP = vector<VP>;\nusing VI = vector<ll>; using VVI = vector<VI>; using VVVI = vector<VVI>;\nconst int inf=1e9+7;\nconst ll INF=1LL<<61;\nconst ll mod=1e9+7;\n\ntemplate<class T>\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T>\ninline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\nvoid calc(int n,VI s){\n if(n==0){\n for(int i=0;i<s.size();i++){\n if(i>0) cout<<\" \";\n cout<<s[i];\n }\n cout<<endl;\n return;\n }\n for(int i=n;i>=1;i--){\n if(s.size()>=1&&i>s[s.size()-1]) continue;\n VI t=s;\n t.pb(i);\n calc(n-i,t);\n }\n}\n\nint main(){\n int i,j;\n int n;\n while(1){ \n cin>>n;\n if(n==0) break;\n VI s;\n calc(n,s);\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3092, "score_of_the_acc": -0.8047, "final_rank": 10 }, { "submission_id": "aoj_0507_4193873", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <numeric>\n\nusing namespace std;\n\nvoid hoge(int n, vector<int> vec = {}) {\n if (n == 0) {\n cout << vec[0];\n for_each(vec.begin() + 1, vec.end(), [](auto &v) {cout << \" \" << v;});\n cout << endl;\n return;\n }\n\n int h = (vec.size() != 0) ? min(*vec.rbegin(), n) : n;\n\n for (int i = h; 1 <= i; --i) {\n vector<int> vec2 = vec;\n vec2.push_back(i);\n hoge(n - i, vec2);\n }\n}\n\nint main() {\n int n;\n while (cin >> n, n)\n hoge(n);\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3012, "score_of_the_acc": -0.7734, "final_rank": 5 }, { "submission_id": "aoj_0507_3835541", "code_snippet": "#include<iostream>\n#include<vector>\nusing namespace std;\ntypedef vector<int> ans_t;\nvoid dfs(int &n,int k,int memo,ans_t ans){\n if(k == n){\n for(int i = 0;i < ans.size();i++){\n cout << ans[i];\n if(i < ans.size()-1)cout << \" \";\n }\n cout <<endl;\n return;\n }\n for(int i = memo;i < memo + 2;i++){\n //cout << \"*\" << i <<\" \" <<k ;\n int a , b;\n if(i == 0){\n a = 0;\n b = 1;\n }\n else{\n if(ans.size() < i + 1)a = 0;\n else{\n a = ans[i];\n }\n b = ans[i - 1];\n }\n //cout <<\" \" << a << \" \" << b<<endl;\n if(a < b){\n int memo_next = i;\n ans_t ans_next;\n for(int j = 0;j < ans.size();j++){\n ans_next.push_back(ans[j]);\n }\n if(ans.size() < i + 1)ans_next.push_back(1);\n else ans_next[i]++;\n dfs(n,k + 1,memo_next,ans_next);\n }\n }\n return;\n\n}\nint main(){\n vector<int> n;\n int l = 0;\n while(1){\n int v;\n cin >> v;\n if(v == 0)break;\n n.push_back(v);\n l++; \n }\n for(int i = 0;i < l;i++){\n int k = 1;\n int memo = 0;\n ans_t ans;\n ans.push_back(1);\n dfs(n[i],k,memo,ans);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3040, "score_of_the_acc": -0.7969, "final_rank": 8 }, { "submission_id": "aoj_0507_3717628", "code_snippet": "#include <iostream>\n#include <climits>\n#include <set>\n#include <string>\n#include <algorithm>\n#include <vector>\n#define MAX 1000000007\n\n\nusing namespace std;\n#define ll long long\n#define dbg if(0)\n#define ISRANGE(val,lo,hi) ((lo<=val)&&(val<hi))\n\nbool isOK(ll *v,ll n){\n for(int i=0;i<n;i++){\n if (*(v+i)<*(v+i+1))return false;\n }\n return true;\n}\n\nbool breakdown(ll *v,ll n){\n bool flag=false;\n for(int i=n-1;i>=0;i--){\n if (*(v+i)==0)continue;\n if(*(v+i)>*(v+i+1)+1){\n //まとめられるならまとめる\n /*\n ll sum=0;\n ll j=n+1;\n while(j>i+1){\n j--;\n if (*(v+j)==0){\n continue;\n }\n sum+=*(v+j);\n }\n */\n //if(*(v+i)>sum){\n ll j=n;\n while(j>i+1){\n if (*(v+j)==0){\n j--;\n continue;\n }\n *(v+j-1)+=*(v+j);\n *(v+j)=0;\n }\n //}\n //崩す\n *(v+i)=*(v+i)-1;\n *(v+i+1)=*(v+i+1)+1;\n flag=true;\n }else if(*(v+i)==2&&*(v+i+1)==1){\n ll j=i;\n while(*(v+j)!=0){\n j++;\n }\n *(v+i)=*(v+i)-1;\n *(v+j)=*(v+j)+1;\n flag=true;\n }\n if (flag)break;\n }\n return flag;\n\n}\n\n\nint main(){\n ll ans;\n ll n;\n ll v[31];\n for(int i=0;i<31;i++)v[i]=0;\n\n while(true){\n cin >>n;\n if(n==0)break;\n for(int i=0;i<31;i++)v[i]=0;\n v[0]=n;\n cout <<n<<endl;\n while(breakdown(v,n)){\n if(isOK(v,n)){\n for(int i=0;i<n&&v[i]!=0;i++){\n cout <<v[i];\n if(i<n&&v[i+1]!=0)cout <<\" \";\n }\n cout <<endl;\n }\n }\n \n }\n\n return 0;\n\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 3104, "score_of_the_acc": -0.8594, "final_rank": 16 }, { "submission_id": "aoj_0507_3717318", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nusing i64 = int64_t;\n\nvoid solve(int n, const vector<int> v){\n if(n == 0){\n for(int i=0;i<v.size();++i){\n if(i)cout << \" \";\n cout << v[i];\n }\n cout << endl;\n return;\n }\n auto vv = v;\n for(int i=n;i>0;--i){\n if(v.size() > 0 && i>v.back())continue;\n vv.push_back(i);\n solve(n-i, vv);\n vv.pop_back();\n }\n}\n\nint main(){\n int n;\n while(cin >> n, n > 0){\n vector<int> v;\n solve(n, v);\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3160, "score_of_the_acc": -0.8313, "final_rank": 13 }, { "submission_id": "aoj_0507_3454854", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i = 0;i<((int)(n));i++)\n#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)\n#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)\n#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)\ntypedef long long ll;\ntypedef pair<ll, ll> mp;\n\n\n/*\n*/\n\n//a:残り\n//b:１回に使っていい最大数\n//c:今までの結果\nvoid dfs(ll a,ll b,string c){\n\tif(a==0){\n\t\tcout<<c<<endl;\n\t\treturn;\n\t}\n\tireg(i,1,min(b,a)){\n\t\tdfs(a-i,i,(c==\"\"?to_string(i):c+\" \"+to_string(i)));\n\t}\n}\n\nll n;\n\nint main(void){\n\twhile(1){\n\t\tcin>>n;\n\t\tif(n==0)break;\n\t\tdfs(n,n,\"\");\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3192, "score_of_the_acc": -0.8438, "final_rank": 15 }, { "submission_id": "aoj_0507_3078280", "code_snippet": "#include<iostream>\n#include<vector>\nusing namespace std;\n\nvoid dfs(vector<int> v, int before, int res){\n if(res == 0){\n for(int i = 0; i < v.size(); i++){\n if(i) cout << \" \";\n cout << v[i];\n }\n cout << endl;\n return;\n }\n\n for(int j = res; j >= 1; j--){\n if(before >= j){\n v.push_back(j);\n dfs(v, j, res-j);\n v.pop_back();\n }\n }\n}\n\nint main(){\n int n;\n while(cin >> n, n){\n for(int j = n; j >= 1; j--){\n vector<int> v;\n v.push_back(j);\n dfs(v, j, n-j);\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3068, "score_of_the_acc": -0.7953, "final_rank": 7 }, { "submission_id": "aoj_0507_3047862", "code_snippet": "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <string>\n#include <cstring>\n#include <cctype>\n#include <cmath>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <set>\n#include <map>\n#include <list>\n#include <stdio.h>\n#include <string.h>\n#include <cstdlib>\n#include <math.h>\n#include <bitset>\n#include <iterator>\n#include <iomanip>\n#include <sstream>\n#define INF 2000000000\nusing namespace std;\nint dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};\n#define ll long long\n#define PL pair<long long, long long>\n#define P pair<int,int>\n#define mk make_pair\n#define en endl\n#define WHITE 0\n#define BLACK 2\n#define GRAY 1\n#define RE return 0\n#define int ll\n\nint now[30];\nint inde=0;\nint a;\n\nvoid solve(int sum,int t){\n// cout<<\" sum: \"<<sum<<\" t: \"<<t<<en;\n if(sum==a){\n cout<<now[0];\n for(int i=1;i<inde;i++){\n cout<<\" \"<<now[i];\n }\n cout<<en;\n return;\n }\n for(int i=t;i>=1;i--){\n if(sum+i<=a){\n now[inde++]=i;\n solve(sum+i,i);\n inde--;\n }\n }\n return ;\n}\nsigned main(){\n while(cin>>a&&a){\n solve(0,a);\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3008, "score_of_the_acc": -0.7719, "final_rank": 4 }, { "submission_id": "aoj_0507_2477065", "code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<cstdio>\nusing namespace std;\nvoid solve(vector<int>v,int r) {\n\tif (r == 0) {\n\t\tfor (int i = 0; i < v.size(); i++) {\n\t\t\tif (i)printf(\" \");\n\t\t\tprintf(\"%d\", v[i]);\n\t\t}\n\t\tprintf(\"\\n\");\n\t}\n\telse {\n\t\tint k;\n\t\tif (v.size() >= 1)k = min(r, v[v.size() - 1]);\n\t\tfor (int i = k; i >= 1; i--) {\n\t\t\tv.push_back(i);\n\t\t\tsolve(v, r - i);\n\t\t\tv.pop_back();\n\t\t}\n\t}\n\treturn;\n}\nint main() {\n\tint n;\n\twhile (cin >> n, n) {\n\t\tvector<int>v;\n\t\tsolve(v, n);\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 810, "memory_kb": 3084, "score_of_the_acc": -1.8016, "final_rank": 20 }, { "submission_id": "aoj_0507_2379400", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n \n#define REP(i,s,n) for(int i=s;i<n;++i)\n#define rep(i,n) REP(i,0,n)\n#define SORT(c) sort((c).begin(),(c).end())\n#define IINF INT_MAX\n#define LLINF LLONG_MAX\n \ntypedef long long ll;\ntypedef pair<int, int> ii;\n \n#define DEBUG false\n \nvoid dfs(vector<int> v, int n, int u){\n \n if(n == 0) {\n rep(i, v.size()){\n cout << v[i];\n if(i != v.size()-1) cout << \" \";\n }\n cout << endl;\n return;\n }\n for(int i = min(n, u); i > 0; i--){\n vector<int> tmp(v);\n tmp.push_back(i);\n dfs(tmp, n-i, i);\n }\n \n return;\n}\n \nint main(){\n \n int n;\n while(cin >> n, n){\n \n vector<int> null;\n dfs(null, n, n);\n \n }\n \n \n \n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3024, "score_of_the_acc": -0.7781, "final_rank": 6 }, { "submission_id": "aoj_0507_2376059", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nvoid solve(int left, int right, vector<int> v){\n if(right == 0){\n for(int i=0;i<v.size();++i){\n cout << v[i];\n if(i+1 == v.size())cout << endl;\n else cout << \" \";\n }\n }else{\n for(int i=right;i>0;--i){\n if(i <= left){\n v.push_back(i);\n solve(i, right - i, v);\n v.pop_back();\n }\n }\n }\n}\n\nint main(){\n int n;\n while(cin >> n, n != 0){\n for(int i=n;i>0;--i){\n vector<int> v;\n v.push_back(i);\n solve(i, n - i, v);\n v.pop_back();\n }\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3000, "score_of_the_acc": -0.7688, "final_rank": 3 }, { "submission_id": "aoj_0507_2277240", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<int, int>;\n\nvoid dfs(int n, string s, int prev) {\n if(n == 0) {\n cout << s << endl;\n }\n for(int i=min(n, prev); i>=1; --i) {\n string next = s;\n if(s.size() == 0) {\n next += to_string(i);\n } else {\n next += ' ';\n next += to_string(i);\n }\n dfs(n-i, next, i);\n }\n}\n\nint main() {\n int n;\n while(cin >> n, n) {\n dfs(n, \"\", 100);\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3292, "score_of_the_acc": -0.8828, "final_rank": 17 }, { "submission_id": "aoj_0507_2182108", "code_snippet": "#include<iostream>\n#include<string>\n#include<cmath>\n#include<queue>\n#include<map>\n#include<set>\n#include<list>\n#include<iomanip>\n#include<vector>\n#include<functional>\n#include<algorithm>\n#include<cstdio>\n#include<stack>\nusing namespace std;\nvoid solve(int n,list<int>a) {\n\tif (n == 0) {\n\t\tlist<int>::iterator it = a.begin();\n\t\twhile (it != a.end()) {\n\t\t\tif (it == a.begin()) cout << (*it);\n\t\t\telse cout << \" \" << (*it);\n\t\t\tit++;\n\t\t}\n\t\tcout << endl;\n\t\treturn;\n\t}\n\tif (!a.empty()) {\n\t\tlist<int>::iterator it = a.end();\n\t\tit--;\n\t\tfor (int j = n; j >= 1; j--) {\n\t\t\tif ((*it) >= j) {\n\t\t\t\ta.push_back(j);\n\t\t\t\tsolve(n - j, a);\n\t\t\t\ta.pop_back();\n\t\t\t}\n\t\t}\n\t}\n\telse {\n\t\tfor (int j = n; j >= 1; j--) {\n\t\t\ta.push_back(j);\n\t\t\tsolve(n - j, a);\n\t\t\ta.pop_back();\n\t\t}\n\t}\n}\nint main() {\n\tint n;\n\twhile (cin >> n&&n != 0) {\n\t\tlist<int>a;\n\t\tsolve( n,a);\n\t}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3084, "score_of_the_acc": -0.8016, "final_rank": 9 }, { "submission_id": "aoj_0507_2146195", "code_snippet": "#include <iostream>\n#include <string>\nusing namespace std;\n\nvoid dfs(int n,int last,string s){\n\tfor(int i = n;i >= 1;i--){\n\t\tif(n - i == 0 && last >= i) {\n\t\t\tcout << s << n << endl;\n\t\t}\n\t\telse {\n\t\t\tif(last >= i) dfs(n - i,i,s + to_string(i) + \" \");\n\t\t}\n\t}\n}\n\nint main(){\n\tint n;\n\twhile(cin >> n,n){\n\t\tdfs(n,n,\"\");\n\t}\n\treturn 0;\t\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3176, "score_of_the_acc": -0.8375, "final_rank": 14 }, { "submission_id": "aoj_0507_2022950", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define mp make_pair\n#define pb push_back\n#define fr first\n#define sc second\n#define Rep(i,n) for(int i=0;i<(n);i++)\n#define All(v) v.begin(),v.end()\n#define Uniq(v) v.erase(unique(All(v)),v.end())\ntypedef pair<int, int> Pii;\ntypedef pair<int, Pii> Pip;\ntypedef pair<string, int> Psi;\nconst int INF = (1<<30);\nconst int dx[]={1,0,-1,0}, dy[]={0,-1,0,1};\n\nint n;\n\nstring intToString(int number)\n{\n stringstream ss;\n ss << number;\n return ss.str();\n}\n\nvoid func( int bef, int cnt, string s )\n{\n if( cnt == n ) cout << s << endl;\n else {\n for(int i=bef; i>=1; i--) {\n string add = intToString( i );\n string next;\n if( s == \"\" ) next = add;\n else next = s + \" \" + add;\n if( cnt + i <= n ) func( i, cnt + i, next );\n }\n }\n}\n\nint main()\n{\n while( cin >> n, n ) {\n func( n, 0, \"\" );\n }\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3052, "score_of_the_acc": -0.8141, "final_rank": 11 }, { "submission_id": "aoj_0507_1989334", "code_snippet": "#include <iostream>\n#define REP(i, a, n) for(int i = a; i < n; i++)\nusing namespace std;\n\n\nint n;\nint t[30];\n\nvoid dfs(int k, int d) {\n if(k == 0) {\n REP(i, 0, d) {\n cout << t[i];\n if(i + 1 != d) cout << \" \";\n }\n cout << endl;\n } else {\n int len = d == 0 ? k : min(t[d - 1], k);\n for(int i = len; i > 0; i--) {\n t[d] = i;\n dfs(k - i, d + 1);\n }\n }\n}\n\nint main(void) {\n while(cin >> n, n != 0) {\n dfs(n, 0);\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 1160, "score_of_the_acc": -0.0625, "final_rank": 2 }, { "submission_id": "aoj_0507_1986449", "code_snippet": "#include <stdio.h>\n\nint sq(int rec[],int cur){\n int i;\n int lim,left = rec[cur];\n if(left){\n lim = (left > rec[cur-1]) ? rec[cur-1] : left;\n for(i=lim;i>0;i--){\n rec[cur] = i;\n rec[cur+1] = left-i;\n sq(rec,cur+1);\n rec[cur] = left;\n }\n }else{\n for(i=0;i<cur;i++){\n printf(\"%d\",rec[i]);\n if(i==cur-1){\n printf(\"\\n\");\n }else{\n printf(\" \");\n }\n }\n }\n}\n\nint main(){\n int n,i;\n int rec[30];\n scanf(\"%d\",&n);\n while(n){\n for(i=n;i>0;i--){\n rec[0] = i;\n rec[1] = n-i;\n sq(rec,1);\n }\n scanf(\"%d\",&n);\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 1032, "score_of_the_acc": 0, "final_rank": 1 } ]
aoj_0515_cpp
通学経路 問題 太郎君の住んでいるJOI市は，南北方向にまっすぐに伸びる a 本の道路と，東西方向にまっすぐに伸びる b 本の道路により，碁盤の目の形に区分けされている． 南北方向の a 本の道路には，西から順に 1, 2, ... , a の番号が付けられている．また，東西方向の b 本の道路には，南から順に 1, 2, ... , b の番号が付けられている．西から i 番目の南北方向の道路と，南から j 番目の東西方向の道路が交わる交差点を (i, j) で表す． 太郎君は，交差点 (1, 1) の近くに住んでおり，交差点 (a, b) の近くのJOI高校に自転車で通っている．自転車は道路に沿ってのみ移動することができる．太郎君は，通学時間を短くするため，東または北にのみ向かって移動して通学している． 現在， JOI市では， n 個の交差点 (x 1 , y 1 ), (x 2 , y 2 ), ... , (x n , y n ) で工事を行っている．太郎君は工事中の交差点を通ることができない． 太郎君が交差点 (1, 1) から交差点 (a, b) まで，工事中の交差点を避けながら，東または北にのみ向かって移動して通学する方法は何通りあるだろうか．太郎君の通学経路の個数 m を求めるプログラムを作成せよ． 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．入力はゼロを２つ含む行で終了する． 1行目には，空白を区切りとして2個の整数 a, b が書かれている．これは，南北方向の道路の本数と，東西方向の道路の本数を表す． a, b は 1 ≤ a, b ≤ 16 をみたす． 2行目には, 工事中の交差点の個数を表す整数 n が書かれている． n は 1 ≤ n ≤ 40 をみたす． 続く n 行 (3行目から n+2 行目) には，工事中の交差点の位置が書かれている． i+2 行目には空白で区切られた整数 x i , y i が書かれており，交差点 (x i , y i ) が工事中であることを表す． x i , y i は 1 ≤ x i , y i ≤ 16 をみたす． データセットの数は 5 を超えない． 出力 データセットごとに, 太郎君の通学経路の個数 m を1行に出力する． 入出力例 入力例 5 4 3 2 2 2 3 4 2 5 4 3 2 2 2 3 4 2 0 0 出力例 5 5 下図は a=5, b=4, n=3 で，工事中の交差点が (2,2), (2,3), (4,2) の場合を表している． この場合，通学経路は m=5 通りある． 5通りの通学経路を全て図示すると，以下の通り． 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0515_10331962", "code_snippet": "#include <iostream>\n#include <set>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <unordered_map>\n#include <algorithm>\n#include <numeric>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n\nint a,b,n,cnt=0;\nvector<vector<bool>> grid(17,vector<bool>(17,false));\nvector<vector<bool>> visited(17,vector<bool>(17,false));\nconst int dx[2]={1,0};\nconst int dy[2]={0,1};\n\nvoid dfs(int x,int y){\n if (x==a && y==b){\n cnt += 1;\n return;\n }\n rep(i,2){\n int nx=x+dx[i];\n int ny=y+dy[i];\n if(1<=nx and nx<=a and 1<=ny and ny<=b){\n if(!visited[nx][ny] and !grid[nx][ny]){\n visited[nx][ny]=true;\n dfs(nx,ny);\n visited[nx][ny]=false;\n }\n }\n }\n visited[x][y]=false;\n}\nvoid solve(){\n while(1){\n cin >> a >> b >> n;\n if(a==0 && b==0) break;\n\n grid.assign(17,vector<bool>(17,false));\n visited.assign(17,vector<bool>(17,false));\n cnt=0;\n\n rep(i,n){\n int x,y;\n cin >> x >> y;\n grid[x][y]=true;\n }\n\n if(!grid[1][1]){\n visited[1][1]=true;\n dfs(1,1);\n }\n\n cout << cnt << endl;\n }\n}\nint main(){\n solve();\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3380, "score_of_the_acc": -0.0501, "final_rank": 8 }, { "submission_id": "aoj_0515_8878239", "code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\n#define endl '\\n'\n#define Out(s) {cout << (s) << '\\n';}\n#define _onez(s) ((s)? 1 : 0)\n#define onez(s) Out(_onez(s))\nvoid YES(bool t = 1) { Out(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { Out(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { Out(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\n#line 2 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll a, b, n, x, y;\n cin >> a >> b;\n if ((a == 0) and (b == 0)) return 1;\n cin >> n;\n vv(char, s, a+1, b+1, '.');\n rep(n) {\n cin >> x >> y;\n s[x][y] = '#';\n }\n queue<pi> Q;\n Q.push(mp(1, 1));\n ll ans = 0;\n while (!Q.empty()) {\n auto [x, y] = Q.front(); Q.pop();\n if ((x == a) and (y == b)) {\n ans++;\n continue;\n }\n static const vi dx{1, 0};\n static const vi dy{0, 1};\n rep(i, len(dx)) {\n ll nx = x + dx[i];\n ll ny = y + dy[i];\n if ((nx <= a) and (ny <= b) and (s[nx][ny] == '.')) {\n Q.push(mp(nx, ny));\n }\n }\n }\n Out(ans);\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 15732, "score_of_the_acc": -1.0154, "final_rank": 18 }, { "submission_id": "aoj_0515_7773668", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vl = vector<ll>;\nusing vvl = vector<vl>;\nusing pl = pair<ll,ll>;\nusing vp = vector<pl>;\n#define rep(i,n) for(ll i=0;i<(ll)(n);++i)\n#define reps(i,s,n) for(ll i=(s);i<(ll)(n);++i)\n#define rep1(i,n) for(ll i=1;i<=(ll)(n);++i)\ntemplate<typename T>inline bool chmax(T &a,T b){return a<b?a=b,true:false;}\ntemplate<typename T>inline bool chmin(T &a,T b){return a>b?a=b,true:false;}\n#define fi first\n#define se second\n#define pb push_back\n#define eb emplace_back\n#define be(v) (v).begin(),(v).end()\nconst long long INF = 1e18;\ninline ll ipow(ll x,ll p){\n\tll ret=x; rep1(i,p-1) ret*=x; return ret;\n}\n#ifdef DEBUG\n#include <debug.hpp>\n#endif\n\nbool solve(){\n#ifdef DEBUG\n\tcout << \"--- Input ---\" << endl;\n#endif\n\tll A,B;cin>>A>>B;\n\tif(A==0 && B==0)return false;\n\tll N;cin>>N;\n\tset<pl> st;\n\trep(n,N){\n\t\tll x,y;cin>>x>>y;st.emplace(--x,--y);\n\t}\n\tauto mo=[&](pl p){\n\t\tvp ret;\n\t\tif(p.fi+1<A && st.count(pl{p.fi+1,p.se})==0)ret.eb(p.fi+1,p.se);\n\t\tif(p.se+1<B && st.count(pl{p.fi,p.se+1})==0)ret.eb(p.fi,p.se+1);\n\t\treturn ret;\n\t};\n#ifdef DEBUG\n\tcout<<N<<\" \"<<A<<\" \"<<B<<\" \"<<st;\n\tcout << \"--- Logic ---\" << endl;\n#endif\n\tll ans=0;\n\tqueue<pl> qu;\n\tqu.emplace(0,0);\n\twhile(!qu.empty()){\n\t\tpl p=qu.front();qu.pop();\n#ifdef DEBUG\n\t\tcout<<p<<endl;\n#endif\n\t\tfor(auto m:mo(p)){\n\t\t\tif(m.fi==A-1 && m.se==B-1){\n\t\t\t\t++ans;\n\t\t\t}else{\n\t\t\t\tqu.push(m);\n\t\t\t}\n\t\t}\n\t}\n\n#ifdef DEBUG\n\tcout << \"--- Answer ---\" << endl;\n#endif\n\tcout<<ans<<endl;\n\treturn true;\n}\nint main(){\n\twhile(solve());\n\treturn 0;\n}\n//cout << fixed << setprecision(9);", "accuracy": 1, "time_ms": 80, "memory_kb": 15828, "score_of_the_acc": -1.1591, "final_rank": 19 }, { "submission_id": "aoj_0515_4793803", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint MAP[17][17];\nint a,b;\nint n;\nint x,y;\nint cnt;\nint dy[2]={0,1},dx[2]={1,0};\nvoid func(int y,int x);\nint main(void){\n\tint i,j;\n\twhile(1){\n\t\tcin>>a>>b;\n\t\tif(a==0&&b==0)\tbreak;\n\t\tfor(i=1;i<17;i++){\n\t\t\tfor(j=1;j<17;j++){\n\t\t\t\tMAP[i][j]=0;\n\t\t\t}\n\t\t}\n\t\tcnt=0;\n\t\tcin>>n;\n\t\tfor(i=0;i<n;i++){\n\t\t\tcin>>x>>y;\n\t\t\tMAP[y][x]=-1;\n\t\t}\n\t\tfunc(1,1);\n\t\tcout<<cnt<<endl;\n\t}\n\treturn 0;\n}\nvoid func(int y,int x){\n\tint i,j;\n\tint xx,yy;\n\t//cout<<y<<\" \"<<x<<endl;\n\tif(x==a&&y==b){\n\t\tcnt++;\n\t\t//cout<<cnt<<endl;\n\t}\n\telse{\n\t\tfor(i=0;i<2;i++){\n\t\t\txx=x+dx[i];\n\t\t\tyy=y+dy[i];\n\t\t\tif(xx<=a&&yy<=b&&MAP[yy][xx]!=-1){\n\t\t\t\t//MAP[yy][xx]=-1;\n\t\t\t\tfunc(yy,xx);\n\t\t\t\t//MAP[yy][xx]=0;\n\t\t\t}\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3100, "score_of_the_acc": -0.0287, "final_rank": 7 }, { "submission_id": "aoj_0515_4667322", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint A, B, N;\nint MapData[17][17];\nint Dx[2] = { 1,0 };\nint Dy[2] = { 0,1 };\n\nint solve(int curX,int curY) {\n\tint nextX, nextY, sum;\n\n\tif (curX == A && curY == B) {\n\t\treturn 1;\n\t}\n\tif (curX > A || curY > B) {\n\t\treturn 0;\n\t}\n\n\tsum = 0;\n\tfor (int i = 0; i < 2; ++i) {\n\t\tnextX = curX + Dx[i];\n\t\tnextY = curY + Dy[i];\n\t\tif (MapData[nextY][nextX] == 1) {\n\t\t\tcontinue;\n\t\t}\n\t\tsum += solve(nextX, nextY);\n\t}\n\treturn sum;\n}\n\nint main() {\n\tint x, y;\n\n\twhile (cin >> A >> B, A) {\n\t\tmemset(MapData, 0, sizeof(MapData));\n\t\tcin >> N;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tcin >> x >> y;\n\t\t\tMapData[y][x] = 1;\n\t\t}\n\t\tcout << solve(1, 1) << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3076, "score_of_the_acc": -0.0269, "final_rank": 5 }, { "submission_id": "aoj_0515_4667316", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint A, B, N, Total;\nint MapData[17][17];\nint Dx[2] = { 1,0 };\nint Dy[2] = { 0,1 };\n\nbool solve(int curX,int curY) {\n\tint nextX, nextY;\n\n\tif (curX == A && curY == B) {\n\t\treturn true;\n\t}\n\tfor (int i = 0; i < 2; ++i) {\n\t\tnextX = curX + Dx[i];\n\t\tnextY = curY + Dy[i];\n\t\tif (nextX < 1 || nextX > A || nextY < 1 || nextY > B) {\n\t\t\tcontinue;\n\t\t}\n\t\tif (MapData[nextY][nextX] == 1) {\n\t\t\tcontinue;\n\t\t}\n\t\tif (solve(nextX, nextY)) {\n\t\t\t++Total;\n\t\t}\n\t}\n\treturn false;\n}\n\nint main() {\n\tint x, y;\n\n\twhile (cin >> A >> B, A) {\n\t\tmemset(MapData, 0, sizeof(MapData));\n\t\tcin >> N;\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tcin >> x >> y;\n\t\t\tMapData[y][x] = 1;\n\t\t}\n\t\tTotal = 0;\n\t\tsolve(1, 1);\n\t\tcout << Total << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3056, "score_of_the_acc": -0.0253, "final_rank": 4 }, { "submission_id": "aoj_0515_4461548", "code_snippet": "#include <bits/stdc++.h>\nstatic const int MAX = 16;\nstatic const int dx[2] = {-1, 0};\nstatic const int dy[2] = {0, 1};\nint W, H, gx, gy;\nint map[MAX][MAX];\n\nint bfs() {\n int sx = H-1, sy = 0;\n int ans = 0;\n std::queue<std::pair<int, int> > q;\n q.push({sx, sy});\n while(!q.empty()) {\n std::pair<int, int> p = q.front(); q.pop();\n if (p.first == gx && p.second == gy) { ans++; continue; }\n for (int i = 0; i < 2; i++) {\n int nx = p.first+dx[i], ny = p.second+dy[i];\n if (nx >= 0 && nx < H && ny >= 0 && ny < W && map[nx][ny] != 1) {\n q.push({nx, ny});\n }\n }\n }\n return ans;\n}\n\nint main() {\n int N, px, py;\n for (; ;) {\n std::scanf(\"%d %d\", &W, &H);\n if (W == 0 && H == 0) break;\n gx = 0, gy = W-1;\n std::memset(map, 0, sizeof (map));\n std::scanf(\"%d\", &N);\n for (int i = 0; i < N; i++) {\n std::scanf(\"%d %d\", &py, &px);\n map[H-px][py-1] = 1;\n }\n std::cout << bfs() << std::endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 9300, "score_of_the_acc": -0.5246, "final_rank": 15 }, { "submission_id": "aoj_0515_4234515", "code_snippet": "#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\n\nint a, b, n;\nvector<vector<bool>> g;\n\nint Dfs(int i, int j) {\n if (i > a || j > b)\n return 0;\n if (!g[i][j])\n return 0;\n if (i == a && j == b)\n return 1;\n int res = Dfs(i + 1, j) + Dfs(i, j + 1);\n return res;\n}\n\nint main() {\n while (true) {\n cin >> a >> b;\n if (a == 0 && b == 0)\n break;\n cin >> n;\n vector<int> x(n), y(n);\n for (int i = 0; i < n; ++i)\n cin >> x[i] >> y[i];\n g.resize(a + 1, vector<bool>(b + 1, true));\n for (int i = 0; i < n; ++i)\n g[x[i]][y[i]] = false;\n cout << Dfs(1, 1) << endl;\n g.clear();\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3020, "score_of_the_acc": -0.0226, "final_rank": 3 }, { "submission_id": "aoj_0515_3899894", "code_snippet": "// JOI - Prelim 0515\n// 通学経路\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing Int = int_fast64_t;\nusing UInt = uint_fast64_t;\n\ntemplate <typename T>\nusing vec1 = vector<T>;\n\ntemplate <typename T>\nusing vec2 = vec1<vec1<T>>;\n\ntemplate <typename T>\nvec2<T> InitVec2(size_t x, size_t y, const T& i = T())\n{\n return vec2<T>(y, vec1<T>(x, i));\n}\n\ntemplate <typename T>\nT Get(const vec2<T>& v2, size_t x, size_t y)\n{\n return v2[y][x];\n}\n\ntemplate <typename T>\nT& Ref(vec2<T>& v2, size_t x, size_t y)\n{\n return v2[y][x];\n}\n\ntemplate <typename T>\nT cin2var()\n{\n T val;\n cin >> val;\n return val;\n}\n\nconst array<Int, 2> dx{1, 0};\nconst array<Int, 2> dy{0, 1};\n\nUInt A_ = 0;\nUInt B_ = 0;\nvec2<char> vec2map_;\nUInt goal_count = 0;\n\nvoid move(UInt x, UInt y)\n{\n if (x == A_ - 1 && y == B_ - 1) {\n ++goal_count;\n return;\n }\n if (x >= A_ || y >= B_) {\n return;\n }\n if (!Get(vec2map_, x, y)) {\n return;\n }\n for (auto i = 0u; i < dx.size(); ++i) {\n const auto nx = x + dx[i];\n const auto ny = y + dy[i];\n move(nx, ny);\n }\n}\n\nbool sub()\n{\n A_ = cin2var<UInt>();\n B_ = cin2var<UInt>();\n\n if (!A_ || !B_) return false;\n\n vec2map_ = InitVec2<char>(A_, B_, 1);\n\n const auto N(cin2var<UInt>());\n for (auto i = 0u; i < N; ++i) {\n const auto X(cin2var<UInt>() - 1);\n const auto Y(cin2var<UInt>() - 1);\n Ref(vec2map_, X, Y) = 0;\n }\n\n goal_count = 0;\n move(0, 0);\n cout << goal_count << endl;\n\n return true;\n}\n\nint main()\n{\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (sub());\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3080, "score_of_the_acc": -0.0272, "final_rank": 6 }, { "submission_id": "aoj_0515_3326639", "code_snippet": "#include<queue>\n#include<cstdio>\n#include<algorithm>\n#include<string.h>\n\nusing namespace std;\n\n#define F first\n#define S second\n\nbool used[20][20] = { 0 };\nbool map[20][20] = { 0 };\nint mx[] = { 1,0,-1,0 };\nint my[] = { 0,1,0,-1 };\nint a, b, n;\n\nbool check(int i, int j) {\n\tif (i >= 0 && i <= a && j >= 0 && j <= b) return true;\n\treturn false;\n}\n\nint main() {\n\twhile (scanf(\"%d%d\", &a, &b), a != 0 && b != 0) {\n\t\tscanf(\"%d\", &n);\n\t\tmemset(map, false, sizeof(map));\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint x, y;\n\t\t\tscanf(\"%d%d\", &x, &y);\n\t\t\tmap[x][y] = true;\n\t\t}\n\t\tmemset(used, false, sizeof(used));\n\t\tqueue<pair<int, int> > q;\n\t\tq.push(make_pair(1, 1));\n\t\tint ans = 0;\n\t\twhile (!q.empty()) {\n\t\t\tpair<int, int> qf = q.front();\n\t\t\tused[qf.F][qf.S] = true;\n\t\t\tq.pop();\n\t\t\tif (qf.F == a && qf.S == b) {\n\t\t\t\tans++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tfor (int i = 0; i < 4; i++) {\n\t\t\t\tint MX = mx[i], MY = my[i];\n\t\t\t\tif (!map[qf.F + MX][qf.S + MY] && !used[qf.F + MX][qf.S + MY] && check(qf.F + MX, qf.S + MY)) {\n\t\t\t\t\tq.push(make_pair(qf.F + MX, qf.S + MY));\n\t\t\t\t\t//printf(\"%d %d\\n\", qf.F, qf.S);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\", ans);\n\t}\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 8844, "score_of_the_acc": -0.5125, "final_rank": 11 }, { "submission_id": "aoj_0515_3264440", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint MAP[17][17];\nint a,b;\nint n;\nint x,y;\nint cnt;\nint dy[2]={0,1},dx[2]={1,0};\nvoid func(int y,int x);\nint main(void){\n\tint i,j;\n\twhile(1){\n\t\tcin>>a>>b;\n\t\tif(a==0&&b==0)\tbreak;\n\t\tfor(i=1;i<17;i++){\n\t\t\tfor(j=1;j<17;j++){\n\t\t\t\tMAP[i][j]=0;\n\t\t\t}\n\t\t}\n\t\tcnt=0;\n\t\tcin>>n;\n\t\tfor(i=0;i<n;i++){\n\t\t\tcin>>x>>y;\n\t\t\tMAP[y][x]=-1;\n\t\t}\n\t\t/*for(i=1;i<=b;i++){\n\t\t\tfor(j=1;j<=a;j++){\n\t\t\t\tcout<<MAP[i][j];\n\t\t\t}\n\t\t\tcout<<endl;\n\t\t}*/\n\t\tfunc(1,1);\n\t\tcout<<cnt<<endl;\n\t}\n\treturn 0;\n}\nvoid func(int y,int x){\n\tint i,j;\n\tint xx,yy;\n\t//cout<<y<<\" \"<<x<<endl;\n\tif(x==a&&y==b){\n\t\tcnt++;\n\t}\n\telse{\n\t\tfor(i=0;i<2;i++){\n\t\t\txx=x+dx[i];\n\t\t\tyy=y+dy[i];\n\t\t\tif(xx<=a&&yy<=b&&MAP[yy][xx]!=-1){\n\t\t\t\tMAP[yy][xx]=-1;\n\t\t\t\tfunc(yy,xx);\n\t\t\t\tMAP[yy][xx]=0;\n\t\t\t}\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3016, "score_of_the_acc": -0.0223, "final_rank": 2 }, { "submission_id": "aoj_0515_3215806", "code_snippet": "#include <cstdio>\n#include <algorithm>\n\nint a, b, n, map[17][17];\n\nint search(int x, int y)\n{\n\tif (x == 1 && y == 1)\n\t{\n\t\tmap[1][1] = 1;\n\t\treturn 1;\n\t}\n\n\tint left = 0, down = 0;\n\tif (map[y][x - 1] != -1)\n\t{\n\t\tleft = search(x - 1, y);\n\t}\n\tif (map[y - 1][x] != -1)\n\t{\n\t\tdown = search(x, y - 1);\n\t}\n\tmap[y][x] = left + down;\n\n\treturn map[y][x];\n}\n\nint main()\n{\n\twhile (true)\n\t{\n\t\tfor (int i = 0; i <= b; ++i)\n\t\t{\n\t\t\tstd::fill(map[i], map[i] + a + 1, 0);\n\t\t}\n\n\t\tscanf(\"%d %d\", &a, &b);\n\t\tif (a == 0 || b == 0)\n\t\t{\n\t\t\tbreak;\n\t\t}\n\t\tscanf(\"%d\", &n);\n\t\tfor (int i = 0; i < n; ++i)\n\t\t{\n\t\t\tint x, y;\n\t\t\tscanf(\"%d %d\", &x, &y);\n\t\t\tmap[y][x] = -1;\n\t\t}\n\n\t\tstd::fill(map[0], map[0] + a + 1, -1);\n\t\tfor (int i = 0; i <= b; ++i)\n\t\t{\n\t\t\tmap[i][0] = -1;\n\t\t}\n\n\t\tprintf(\"%d\\n\", search(a, b));\n\t}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 2724, "score_of_the_acc": 0, "final_rank": 1 }, { "submission_id": "aoj_0515_3107196", "code_snippet": "#include <bits/stdc++.h>\n#define MOD 1000000007\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\n \nint A, B, N;\nmap<P, int> mp;\nvector<vector<ll>> dp(20, vector<ll>(20, -1));\n\nll rec(int y = 0, int x = 0){\n \n auto itr = mp.find(make_pair(x, y));\n if(itr != mp.end()) return 0;\n if(y >= B || x >= A) return 0;\n if(y == B - 1 && x == A - 1) return 1;\n \n ll res = 0;\n res += rec(y + 1, x);\n res += rec(y, x + 1);\n \n return res;\n}\n\nint main(void){\n \n do{\n scanf(\"%d %d\", &A, &B);\n if(A == 0 && B == 0) continue;\n scanf(\"%d\", &N);\n for(int i = 0; i < N; ++i){\n int a, b; scanf(\"%d %d\", &a, &b);\n --a, --b;\n mp[make_pair(a, b)] = 1;\n }\n cout << rec() << endl;\n mp.clear();\n for(int i = 0; i < B; ++i) for(int j = 0; j < A; ++j) dp[i][j] = -1;\n }while(A != 0 && B != 0);\n \n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3200, "score_of_the_acc": -0.0818, "final_rank": 9 }, { "submission_id": "aoj_0515_3049363", "code_snippet": "//英雄(笑)装備\n#include<iostream>\n#include<algorithm>\n#include<queue>\n#include<stack>\n#include<string.h>\n#include<vector>\n#include<stdio.h>\nusing namespace std;\nint main() {\n\twhile (1) {\n\t\tint a, b, i, j, n, mp[18][18] = { 0 }, x, y, m = 0;\n\t\tcin >> a >> b;\n\t\tif (a == 0 && b == 0) {\n\t\t\treturn 0;\n\t\t}\n\t\tcin >> n;\n\t\tfor (i = 1; i <= n; i++) {\n\t\t\tcin >> x >> y;\n\t\t\tmp[x][y] = 1;\n\t\t}\n\t\tfor (j = 0; j <= a + 1; j++) {\n\t\t\tmp[j][0] = 1;\n\t\t\tmp[j][b + 1] = 1;\n\t\t}\n\t\tfor (j = 0; j <= b + 1; j++) {\n\t\t\tmp[0][j] = 1;\n\t\t\tmp[a + 1][j] = 1;\n\t\t}\n\t\tqueue<pair<int, int> > que;\n\t\tpair<int, int> out;\n\t\tout.first = 1;\n\t\tout.second = 1;\n\t\tque.push(out);\n\t\twhile (!que.empty()) {\n\t\t\tout = que.front();\n\t\t\tque.pop();\n\t\t\tif (mp[out.first + 1][out.second] == 0) {\n\t\t\t\tout.first++;\n\t\t\t\tque.push(out);\n\t\t\t\tout.first--;\n\t\t\t}\n\t\t\tif (mp[out.first][out.second + 1] == 0) {\n\t\t\t\tout.second++;\n\t\t\t\tque.push(out);\n\t\t\t\tout.second--;\n\t\t\t}\n\t\t\tif (out.first == a&&out.second == b) {\n\t\t\t\tm++;\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\", m);\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 9388, "score_of_the_acc": -0.5313, "final_rank": 16 }, { "submission_id": "aoj_0515_2934603", "code_snippet": "#include <iostream>\n#include <vector>\n#include <queue>\n\n//幅優先探索\nclass Point{\nprivate:\n int x;//x座標\n int y;//y座標\n int depth;//深さ\n\npublic:\n Point(int a,int b);\n int GetXpoint();\n int GetYpoint();\n int GetDepth();\n std::vector<Point> make_offspring(int x_limit,int y_limit,std::vector<Point> exception);\n\n};\n\nvoid search();\n\nstd::vector<Point> get_exception(int exception_num);//通行できない点を求める。\n\nint get_root_num(int x_limit,int y_limit,std::vector<Point> exception);//通学経路の個数を求める。\n\nbool judge_point(int depth1,int depth2);//深さでその点が目的地かどうかを判断する。\n\nPoint::Point(int a,int b){\n this->x= a;\n this->y=b;\n this->depth=a+b-2;\n}\n\nint Point::GetXpoint(){\n return this->x;\n}\n\nint Point::GetYpoint(){\n return this->y;\n}\n\nint Point::GetDepth(){\n return this->depth;\n}\n\nstd::vector<Point> Point::make_offspring(int x_limit,int y_limit,std::vector<Point> exception){\n std::vector<Point> offsprings;\n if(x_limit>= (this->x+1)){\n Point tmp= Point(this->x+1,this->y);\n bool flag = true;\n for(Point tmp1:exception){\n if(tmp1.GetXpoint()==tmp.GetXpoint() &&tmp1.GetYpoint()==tmp.GetYpoint()){\n flag = false;\n break;\n }\n }\n if(flag == true){\n offsprings.push_back(tmp);\n }\n // std::cout<<this->x<<\",\"<<this->y<<\" x \"<<tmp.GetXpoint()<<\",\"<<tmp.GetYpoint();\n }\n\n if(y_limit>=(this->y+1)){\n Point tmp= Point(this->x,this->y+1);\n bool flag = true;\n for(Point tmp1: exception){\n if(tmp1.GetXpoint()==tmp.GetXpoint() &&tmp1.GetYpoint()==tmp.GetYpoint()){\n flag = false;\n break;\n }\n }\n if(flag == true){\n offsprings.push_back(tmp);\n }\n // std::cout<<\" y \"<<tmp.GetXpoint()<<\" \"<<tmp.GetYpoint()<<std::endl;\n }\n\n return offsprings;\n}\n\nvoid search(){\n int x_limit,y_limit;//x座標,y座標の上限\n\n while(std::cin >> x_limit >> y_limit && x_limit!=0 && y_limit!=0){\n int exception_num;\n std::cin >> exception_num;\n std::vector<Point> exception = get_exception(exception_num);\n std::cout << get_root_num(x_limit,y_limit,exception)<<std::endl;\n }\n}\n\nstd::vector<Point> get_exception(int exception_num){\n std::vector<Point> exception;\n for(int i = 0;i< exception_num;i++){\n int x,y;\n std::cin>>x>>y;\n Point tmp=Point(x,y);\n exception.push_back(tmp);\n }\n\n return exception;\n}\n\nint get_root_num(int x_limit,int y_limit,std::vector<Point> exception){\n std::queue<Point> que;\n int num=0;\n Point start = Point(1,1),end=Point(x_limit,y_limit);\n que.push(start);\n while(que.empty() != true){\n Point tmp = que.front();\n que.pop();\n if(judge_point(tmp.GetDepth(),end.GetDepth() ) ){\n //std::cout<<num+1<<\" \"<<tmp.GetXpoint()<<\" \"<<tmp.GetYpoint()<<std::endl;\n num ++ ;\n }else{\n std::vector<Point> offsprings = tmp.make_offspring(x_limit,y_limit,exception);\n if(!offsprings.empty()){\n for(Point tmp_child:offsprings){\n que.push(tmp_child);\n }\n }\n }\n }\n return num;\n}\n\nbool judge_point(int depth1,int depth2){\n if(depth1== depth2){\n return true;\n }\n return false;\n}\n\nint main(void){\n search();\n return 0;\n}", "accuracy": 1, "time_ms": 450, "memory_kb": 12144, "score_of_the_acc": -1.7189, "final_rank": 20 }, { "submission_id": "aoj_0515_2833426", "code_snippet": "#include <iostream>\n#include <cstdio>\n#include <algorithm>\n#include <string>\n#include <cstring>\n#include <cctype>\n#include <cmath>\n#include <stack>\n#include <queue>\n#include <vector>\n#include <set>\n#include <map>\n#include <list>\n#include <stdio.h>\n#include <string.h>\n#include <cstdlib>\n#include <math.h>\n#define INF 2000000000\nusing namespace std;\nint dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};\n#define ll long long\n#define PL pair<long long, long long>\n#define P pair<int,int>\n#define mk make_pair\n#define en endl;\n#define WHITE 0\n#define BLACK 2\n#define GRAY 1\n#define RE return 0;\n\n\nint main(){\n while(1){\n ll a,b,n;\n cin>>b>>a;\n if(a==0&&b==0) break;\n bool con[20][20];\n cin>>n;\n for(int i=0; i<=20; i++){\n for(int j=0; j<=20; j++){\n con[i][j]=false;\n }\n }\n for(int i=0; i<n; i++){\n int c,d;\n cin>>c>>d;\n con[c][d]=true;\n }\n \n \n// for(int i=a; i>=1; i--){\n// for(int j=1; j<=b; j++){\n// if(con[j][i]) cout<<'*';\n// else cout<<'.';\n// }\n// cout<<en\n// }\n \n ll ans=0;\n queue<P> michi;\n michi.push(mk(1,1));\n while(!michi.empty()){\n P p=michi.front(); michi.pop();\n for(int i=0; i<2; i++){\n int x=p.first+dx[i],y=p.second+dy[i];\n if(x==b&&y==a) ans++;\n if(!con[x][y]&&x<=b&&y<=a){\n michi.push(mk(x,y));\n }\n }\n }\n \n cout<<ans<<en\n }\n RE\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 9168, "score_of_the_acc": -0.5372, "final_rank": 17 }, { "submission_id": "aoj_0515_2639219", "code_snippet": "#include <iostream>\nusing namespace std;\nint fields[20][20],goal_y,goal_x;\nint counter=0;\nint recursive(int y,int x){\n/* for( int i=0 ; i<=goal_y ; i++ ){\n for( int j=0 ; j<=goal_x ; j++ ){\n if( i==y && j==x )\n cout << \"#\";\n else cout << fields[i][j];\n }\n cout<< endl;\n }\n cout << endl;\n*/\n if(fields[y+1][x]!=-1 and y<=goal_y )\n recursive(y+1,x);\n if(fields[y][x+1]!=-1 and x<=goal_x )\n recursive(y,x+1);\n if(y==goal_y && x==goal_x )\n counter++;\n return 0;\n}\nint main(){\n while(true){\n counter=0;\n int x,y,m;\n cin >> x >> y;\n if(x+y==0) break;\n goal_y=y-1,goal_x=x-1;\n for( int i=0 ; i<y ; i++ )\n for( int j=0 ; j<x ; j++ )\n fields[i][j]=0;\n cin >> m;\n for( int i=0 ; i<m ; i++ ){\n cin >> x >> y;\n fields[y-1][x-1]=-1;\n }\n recursive(0,0);\n cout << counter << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 2992, "score_of_the_acc": -0.0886, "final_rank": 10 }, { "submission_id": "aoj_0515_2587254", "code_snippet": "#include<iostream>\n#include<stdlib.h>\n#include<queue>\nusing namespace std;\n\nint a,b,cnt;\nint* p;\n\nstruct P {\n int x,y;\n};\n\nint main () {\n while(cin>>a>>b,a|b){\n cnt=0;\n int d[a*b]={};p=d;int k;cin>>k;\n for(int i=0;i<k;++i){\n int x,y;cin>>x>>y;x--;y--;\n d[x+y*a]=1;\n }\n queue<P> q;q.push((P){0,0});\n while(!q.empty()){\n P e=q.front();q.pop();int x=e.x,y=e.y;\n if(x==a-1&&y==b-1){cnt++;continue;}\n if(x<a-1&&p[(x+1)+y*a]==0)q.push((P){x+1,y});\n if(y<b-1&&p[x+(y+1)*a]==0)q.push((P){x,y+1});\n }\n cout<<cnt<<endl;\n }\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 9288, "score_of_the_acc": -0.5236, "final_rank": 14 }, { "submission_id": "aoj_0515_2587217", "code_snippet": "#include<iostream>\n#include<vector>\n#include<queue>\n#include<utility>\n\nusing namespace std;\n\nbool cant[20][20];\nint a,b,ans;\n\nint main()\n{\n\twhile(cin >> a >> b,a)\n\t{\n\t\tfor(int i = 0;i < 20;i++)for(int j = 0;j < 20;j++)\n\t\t{\n\t\t\tcant[i][j] = false;\n\t\t}\n\t\t\n\t\tans = 0;\n\t\tint n;\n\t\tcin >> n;\n\t\t\n\t\tfor(int i = 0;i < n;i++)\n\t\t{\n\t\t\tint x,y;\n\t\t\tcin >> x >> y;\n\t\t\tcant[x-1][y-1] = true;\n\t\t}\n\t\t\n\t\tqueue<pair<int,int> > q;\n\t\tq.push(make_pair(0,0));\n\t\t\n\t\twhile(!q.empty())\n\t\t{\n\t\t\tpair<int,int> tmp = q.front();q.pop();\n\t\t\t\n\t\t\tif(tmp.first == a-1 && tmp.second == b-1)\n\t\t\t{\n\t\t\t\tans++;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t\n\t\t\tif(cant[tmp.first][tmp.second] == true)\n\t\t\t{\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\t\n\t\t\tif(tmp.first < a-1)\n\t\t\t{\n\t\t\t\tq.push(make_pair(tmp.first+1,tmp.second));\n\t\t\t}\n\t\t\t\n\t\t\tif(tmp.second < b-1)\n\t\t\t{\n\t\t\t\tq.push(make_pair(tmp.first,tmp.second+1));\n\t\t\t}\n\t\t}\n\t\t\n\t\tcout << ans << endl;\n\t}\n\t\t\n\n\t\n\treturn 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 9228, "score_of_the_acc": -0.5191, "final_rank": 13 }, { "submission_id": "aoj_0515_2586723", "code_snippet": "#include<iostream>\n#include<string>\n#include<vector>\n#include<utility>\n#include<queue>\n#include<algorithm>\n#include<cmath>\n#define INF 2147483647\n#define llINF 9223372036854775807\n#define pb push_back\n#define mp make_pair \n#define F first\n#define S second\n#define ll long long\n\nusing namespace std;\n\nint main(){\n int a,b;\n while(cin>>a>>b,a+b){\n int MAP[a+1][b+1]={};\n int n;\n cin>>n;\n for(int i=0;i<n;i++){\n int x,y;\n cin>>x>>y;\n MAP[x][y]=1;\n }\n queue<pair<int,int> >que;\n que.push(mp(1,1));\n int ans=0;\n while(!que.empty()){\n pair<int,int>now=que.front();\n que.pop();\n if(now.F==b&&now.S==a){\n\tans++;\n\tcontinue;\n }\n if(now.F+1>0&&now.F+1<=b&&!MAP[now.S][now.F+1]){\n\tque.push(mp(now.F+1,now.S));\n }\n if(now.S+1>0&&now.S+1<=a&&!MAP[now.S+1][now.F]){\n\tque.push(mp(now.F,now.S+1));\n }\n }\n cout<<ans<<endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 9148, "score_of_the_acc": -0.513, "final_rank": 12 } ]
aoj_0516_cpp
最大の和 問題 n 個の整数からなる数列 a 1 , a 2 , ..., a n と正整数 k (1 ≤ k ≤ n ) が与えられる.このとき, 連続して並ぶ k 個の整数の和 S i = a i + a i+1 + ... + a i + k -1 (1 ≤ i ≤ n - k + 1) の最大値を出力するプログラムを作りなさい. 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．入力は２つのゼロを含む行で終了する． 1 行目には正整数 n (1 ≤ n ≤ 100000) と正整数 k (1 ≤ k ≤ n ) がこの順に空白で 区切られて書かれている.2 行目以降の第 1 + i 行目 (1 ≤ i ≤ n ) には, 数列の i 番目の項 a i (-10000 ≤ a i ≤ 10000) が書かれている. 採点用データのうち, 配点の 60% 分は n ≤ 5000, k ≤ 1000 を満たす. データセットの数は 5 を超えない． 出力 データセットごとに S i の最大値を１行に出力する． 入出力例 入力例 5 3 2 5 -4 10 3 0 0 出力例 11 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0516_11001633", "code_snippet": "#include <iostream>\n#include <math.h>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nusing ll = long long;\nint main(){\n while(true){\n int N,K;\n cin >> N >> K;\n if(N == 0 and K == 0) break;\n vector<int> v(N,0);\n for(int i = 0;i < N;i++){\n cin >> v[i];\n }\n vector<int> s(N,0);\n s[0] = v[0];\n for(int i = 1;i < K;i++){\n s[i] = s[i-1] + v[i]; \n }\n ll m = v[K-1];\n for(int i = K;i < N;i++){\n s[i] = s[i-1] + v[i] - v[i-K];\n if(m < s[i]) m = s[i];\n }\n cout << m << endl;\n}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3768, "score_of_the_acc": -0.2695, "final_rank": 5 }, { "submission_id": "aoj_0516_10899660", "code_snippet": "#include <bits/stdc++.h>\n// #include <atcoder/all>\nusing namespace std;\n// using namespace atcoder;\n\ntypedef long long ll;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define all(v) v.begin(), v.end()\n\nll llpow(ll a, ll t)\n{\n ll res = 1;\n rep(i, t) res *= a;\n return res;\n}\n\nll inf = std::numeric_limits<ll>::max();\n\n// using mint = modint998244353;\n\nvector<ll> dx = {0, 0, 1, -1};\nvector<ll> dy = {1, -1, 0, 0};\n\nint main()\n{\n vector<ll> anss;\n while (true)\n {\n ll n, k;\n cin >> n >> k;\n if (!n && !k)\n {\n break;\n }\n vector<ll> as(n);\n rep(i, n)\n {\n cin >> as[i];\n }\n vector<ll> sums(n + 1, 0);\n rep(i, n)\n {\n sums[i + 1] = sums[i] + as[i];\n }\n ll ans = 0;\n rep(i, n - k + 1)\n {\n ans = max(sums[i + k] - sums[i], ans);\n }\n anss.push_back(ans);\n }\n for (auto ans : anss)\n {\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4540, "score_of_the_acc": -0.9539, "final_rank": 18 }, { "submission_id": "aoj_0516_10855402", "code_snippet": "# include <iostream>\n# include <vector>\nusing namespace std;\nconst long long INF = 1LL<<60;\n\nint main() {\n // 入力\n int N, K;\n while (cin >> N >> K) {\n if (N == 0) break;\n vector<long long> a(N);\n for (int i = 0; i < N; ++i) cin >> a[i];\n \n vector<int> s(N+1, 0);\n for (int i = 0; i < N; ++i) s[i+1] = s[i] + a[i];\n \n long long res = -INF;\n for (int i = 0; i <= N-K; ++i) {\n long long val = s[K+i] - s[i];\n if (res < val) res = val;\n }\n cout << res << endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4280, "score_of_the_acc": -0.7234, "final_rank": 12 }, { "submission_id": "aoj_0516_10852716", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing vl = vector<ll>;\nusing vll = vector<vl>;\nusing Pll = pair<ll, ll>;\n#define rep(i,n) for(ll i=0;i<(ll)(n);i++)\n#define Rep(i,j,n) for (ll i=(ll)(j);i<=(ll)(n);++i)\n#define all(v) v.begin(), v.end()\n#define sz(x) ((int) x.size())\n#define pb push_back\n#define mp make_pair\n#define mt make_tuple\n#define F first\n#define S second\nconst int MOD = 1e9+7;\nconst int mod = 998244353;\nconst ll INF = 2e15;\ntemplate<class T> void print(const T& t){ cout << t << endl; }\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\nll gcd(ll a,ll b){return b?gcd(b,a%b):a;}\n\n/*\nll ti=clock();\ncout<<(\"Execution Time: %.4lf sec\", 1.0 * (clock() - ti) / CLOCKS_PER_SEC)<<endl;\n*/\n\nint main(){\n while(1){\n ll n,k;\n cin>>n>>k;\n if(n==0){\n return 0;\n }\n vl a(n+1);\n a[0]=0;\n rep(i,n){\n cin>>a[i+1];\n a[i]+=a[i-1];\n }\n ll M=-1;\n Rep(i,k,n){\n chmax(M,a[i]-a[i-k]);\n }\n print(M);\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3652, "score_of_the_acc": -0.1667, "final_rank": 3 }, { "submission_id": "aoj_0516_10846633", "code_snippet": "#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nint main() {\n vector<int> res;\n while (true) {\n int n, k; cin >> n >> k;\n if (n == 0 && k == 0) break;\n vector<int> a(n);\n for (int i = 0; i < n; ++i) {\n cin >> a[i];\n }\n\n vector<int> sum(n+1); //sum[i] = i-1までの総和\n sum[0] = a[0];\n for (int i = 1; i < n + 1; ++i) {\n sum[i] = sum[i-1] + a[i-1];\n }\n\n int maximum = 0;\n for (int i = k; i < n + 1; ++i) {\n maximum = max(maximum, sum[i] - sum[i - k]);\n }\n res.push_back(maximum);\n }\n for (int r: res) cout << r << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3720, "score_of_the_acc": -0.227, "final_rank": 4 }, { "submission_id": "aoj_0516_10832733", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\nvoid yes() { cout << \"Yes\" << endl;}\nvoid no() {cout << \"No\" << endl;}\n\ndouble dis(int x1, int y1, int x2, int y2) {\n return sqrt((x1 - x2)*(x1-x2) + (y1-y2)*(y1-y2));\n}\n\n\nstruct Edge {\n int to, w;\n};\n\n\n\nclass UnionFind {\n vector<int> par;\n vector<int> siz;\n\npublic:\n UnionFind(int N) {\n par.resize(N);\n siz.resize(N);\n rep(i, N) {\n par[i] = i;\n siz[i] = 1;\n }\n }\n\n int root(int x) {\n if (par[x] == x) return x;\n return par[x] = root(par[x]);\n }\n\n void unite(int u, int v) {\n int RootU = root(u);\n int RootV = root(v);\n if (RootU == RootV) return;\n if (siz[RootU] < siz[RootV]) {\n par[RootU] = RootV;\n siz[RootV] += siz[RootU];\n } else {\n par[RootV] = RootU;\n siz[RootU] += siz[RootV];\n }\n }\n\n bool same(int u, int v) {\n return root(u) == root(v);\n }\n};\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nint main() {\n while(1) {\n int n, k; cin >> n >> k;\n if(n == 0 && k == 0) break;\n vector<ll> a(n), b(n+1);\n rep(i, n) cin >> a[i];\n rep(i, n) b[i+1] = b[i] + a[i];\n\n ll ans = 0;\n for(int l = 0; l < n; l++) {\n int r = l + k;\n if(r >= n+1) break;\n ans = max(ans, ll(b[r]-b[l]));\n }\n\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4520, "score_of_the_acc": -0.9362, "final_rank": 17 }, { "submission_id": "aoj_0516_10804785", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nconst long long INF = 1LL << 60; // 仮想的な無限大の値\nint main()\n{\n ll k, N;\n bool flg = 1;\n while (flg)\n {\n cin >> N >> k;\n if (N == 0)\n {\n break;\n }\n vector<ll> a(N, 0);\n vector<ll> acsum(N + 1, 0);\n\n for (ll i = 0; i < N; i++)\n {\n cin >> a[i];\n }\n // int n1, n2;\n // cin >> n1 >> n2;\n\n for (ll i = 0; i < N; i++)\n {\n acsum[i + 1] = acsum[i] + a[i];\n // cout << \"acsum: \" << acsum[i] << endl;\n }\n\n ll ans = -INF;\n for (ll i = 0; i <= N - k; i++)\n {\n ans = max(acsum[i + k] - acsum[i], ans);\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4592, "score_of_the_acc": -1, "final_rank": 20 }, { "submission_id": "aoj_0516_10798141", "code_snippet": "#include <iostream>\n#include <string>\n#include <set>\n#include <algorithm>\n#include <vector>\n#include <deque>\nusing namespace std;\n\nint main()\n{\n while (true) {\n int n, k;\n cin >> n >> k;\n if (n == 0 && k == 0) break;\n vector<int>li(n);\n for (int i = 0; i < n; i++) {\n cin >> li[i];\n }\n long long m = -10000 * n;\n long long x = 0;\n for (int i = 0; i < n - k + 1; i++) {\n\n if (i == 0) {\n for (int j = 0; j < k; j++) {\n x += li[j];\n }\n\n }\n else {\n x += (li[i + k - 1] - li[i - 1]);\n\n }\n if (x > m) {\n m = x;\n }\n\n }\n cout << m << endl;\n }\n \n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3488, "score_of_the_acc": -0.0213, "final_rank": 2 }, { "submission_id": "aoj_0516_10707044", "code_snippet": "// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/0516\n#include <iostream>\n#include <limits>\n#include <vector>\n#include <algorithm>\n#include <cassert>\n#include <cstdint>\n#include <numeric>\n/// @brief 累積和\ntemplate <class T = std::int64_t>\nstruct prefix_sum {\n prefix_sum(int _n) : n(_n), data(_n + 1) {}\n template <class U>\n prefix_sum(const std::vector<U> &v) : n(v.size()), data(v.size() + 1) {\n std::inclusive_scan(v.rbegin(), v.rend(), data.rbegin() + 1);\n }\n void build() {\n for (int i = n - 1; i >= 0; --i) data[i] += data[i + 1];\n }\n T get(int k) const {\n assert(0 <= k && k < n);\n return data[k] - data[k + 1];\n }\n void set(int k, int x) { data[k] = x; }\n void add(int k, int x) { data[k] += x; }\n T sum(int r) const {\n assert(0 <= r && r <= n);\n return data[0] - data[r];\n }\n T sum(int l, int r) const {\n assert(0 <= l && l <= r && r <= n);\n return data[l] - data[r];\n }\n int min_left(T x) const { return min_left(0, x); }\n int min_left(int l, T x) const {\n assert(0 <= l && l <= n);\n int left = l, right = n + 1;\n while (right - left > 1) {\n int mid = (left + right) / 2;\n (data[l] - data[mid] >= x ? right : left) = mid;\n }\n return right;\n }\n int max_right(T x) const { return max_right(n, x); }\n int max_right(int r, T x) const {\n assert(0 <= r && r <= n);\n int left = -1, right = r;\n while (right - left > 1) {\n int mid = (left + right) / 2;\n (data[mid] - data[r] >= x ? left : right) = mid;\n }\n return left;\n }\n private:\n int n;\n std::vector<T> data;\n};\nint main(void) {\n while (true) {\n int n, k;\n std::cin >> n >> k;\n if (!n)\n break;\n std::vector<int> a(n);\n for (auto &e : a) std::cin >> e;\n prefix_sum<int> ps(a);\n int ans = std::numeric_limits<int>::lowest();\n for (int i = 0; i < n - k + 1; ++i) ans = std::max(ans, ps.sum(i, i + k));\n std::cout << ans << '\\n';\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4096, "score_of_the_acc": -0.5603, "final_rank": 8 }, { "submission_id": "aoj_0516_10707034", "code_snippet": "// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/0516\n#include <iostream>\n#include <limits>\n#include <vector>\n#include <algorithm>\n#include <cassert>\n#include <cstdint>\n#include <numeric>\n/// @brief 累積和\ntemplate <class T = std::int64_t>\nstruct prefix_sum {\n prefix_sum(int _n) : n(_n), data(_n + 1) {}\n template <class U>\n prefix_sum(const std::vector<U> &v) : n(v.size()), data(v.size() + 1) {\n std::partial_sum(v.rbegin(), v.rend(), data.rbegin() + 1);\n }\n void build() {\n for (int i = n - 1; i >= 0; --i) data[i] += data[i + 1];\n }\n T get(int k) const {\n assert(0 <= k && k < n);\n return data[k] - data[k + 1];\n }\n void set(int k, int x) { data[k] = x; }\n void add(int k, int x) { data[k] += x; }\n T sum(int r) const {\n assert(0 <= r && r <= n);\n return data[0] - data[r];\n }\n T sum(int l, int r) const {\n assert(0 <= l && l <= r && r <= n);\n return data[l] - data[r];\n }\n int min_left(T x) const { return min_left(0, x); }\n int min_left(int l, T x) const {\n assert(0 <= l && l <= n);\n int left = l, right = n + 1;\n while (right - left > 1) {\n int mid = (left + right) / 2;\n (data[l] - data[mid] >= x ? right : left) = mid;\n }\n return right;\n }\n int max_right(T x) const { return max_right(n, x); }\n int max_right(int r, T x) const {\n assert(0 <= r && r <= n);\n int left = -1, right = r;\n while (right - left > 1) {\n int mid = (left + right) / 2;\n (data[mid] - data[r] >= x ? left : right) = mid;\n }\n return left;\n }\n private:\n int n;\n std::vector<T> data;\n};\nint main(void) {\n while (true) {\n int n, k;\n std::cin >> n >> k;\n if (!n)\n break;\n std::vector<int> a(n);\n for (auto &e : a) std::cin >> e;\n prefix_sum<int> ps(a);\n int ans = std::numeric_limits<int>::lowest();\n for (int i = 0; i < n - k + 1; ++i) ans = std::max(ans, ps.sum(i, i + k));\n std::cout << ans << '\\n';\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4096, "score_of_the_acc": -0.5603, "final_rank": 8 }, { "submission_id": "aoj_0516_10608912", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<(n);++i)\nusing ll = long long;\nconst double pi = acos(-1);\nconst vector<int> dr= {-1, -1, -1, 0, 0, 1, 1, 1};\nconst vector<int> dc = {-1, 0, 1, -1, 1, -1, 0, 1};\nconst long long INF = 1LL<<60; // 仮想的な無限大の値\n\n\nint main() {\n\tint n,k;\n\twhile(cin >> n >> k){\n\t\tif(n==0) break;\n\t\tvector<ll> a(n),b(n+1,0);\n\t\trep(i,n) cin >> a[i];\n\t\n\t\tll ans = -INF;\n\t\n\t\trep(i,n){\n\t\t\tb[i+1]= b[i] + a[i];\n\t\t}\n\t\n\t\trep(i,n-k+1){\n\t\t\tans = max(ans,b[i+k]-b[i]);\n\t\t}\n\t\n\t\tcout << ans << endl;\n\t}\n\t\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4556, "score_of_the_acc": -0.9681, "final_rank": 19 }, { "submission_id": "aoj_0516_10375031", "code_snippet": "#ifdef _DEBUG\n#include <ownenv.h>\n#define _GLIBCXX_DEBUG\n#define debug(var) DEBUG(#var, var)\n#else\n#define debug(var)\n#include <bits/stdc++.h>\n#endif\n\nusing namespace std;\n\nusing ll = long long; using ull = unsigned ll;\nusing ld = long double;\nusing uc = unsigned char;\n#define INF 2e61\n\ntemplate<typename T> using ve = vector<T>; template<typename T> using vv = ve<ve<T>>;\nusing vi = ve<int>; using vvi = vv<int>;\nusing vl = ve<ll>; using vvl = vv<ll>;\nusing vs = ve<string>; using vvs = vv<string>;\nusing vc = ve<char>; using vvc = vv<char>;\nusing vb = ve<bool>; using vvb = vv<bool>;\n\ntemplate<typename T, typename U> using pa = pair<T, U>;\ntemplate<typename T> using pTT = pa<T, T>; template<typename T> using pp = pa<T, pTT<T>>;\nusing pii = pTT<int>; using ppii = pp<int>;\nusing pll = pTT<ll>; using ppll = pp<ll>;\nusing psi = pa<string, int>; using pis = pa<int, string>;\nusing psu = pa<string, uc>; using pus = pa<uc, string>;\n\n#define nall(n) n.begin(), n.end()\n#define rnall(n) n.rbegin(), n.rend()\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define rrep(i, n) for (int i = (n); i >= 0; i--)\n#define rrep2(i, n, e) for (int i = (n); i >= (int)(e); i--)\n#define elfor(x, V) for(auto &x : V)\n#define bitfor(b, n) rep(b, (1 << n))\n#define bitfor2(b, s, n) rep2(b, s, (1 << n))\n#define getbitelm(i, b, n) rep(i, n) if(b & (1 << i))\n#define cl '\\n'\n#define cend cout << cl\n#define print(s) cout << (s) << cl\n#define printarry(i, A) rep(i, A.size()) { if(i) cout << ' '; cout << A.at(i);} cout << endl;\n#define print12(c) cout << (c).first << ' ' << (c).second << cl\n#define print21(c) cout << (c).second << ' ' << (c).first << cl\n#define Yes cout << \"Yes\" << cl\n#define YES cout << \"YES\" << cl\n#define No cout << \"No\" << cl\n#define NO cout << \"NO\" << cl\n#define inistd cin.tie(nullptr); ios_base::sync_with_stdio(0)\n#define fixout(n) cout << fixed << setprecision(n)\n\nll n, k;\n\nvoid solve() {\n vl A(n);\n elfor(a, A) cin >> a;\n vl S(n+1, 0);\n for(int i = 0; i < n; i++) {\n S[i + 1] = S[i] + A[i];\n }\n ll ans = 0;\n for(int i = 0; i < n + 1 - k; i++) {\n ans = max(ans, S[i+k] - S[i]);\n }\n cout << ans << cl;\n}\n\nint main() {\n while(cin >> n >> k) {\n if(n == 0 && k == 0) return 0;\n solve();\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4440, "score_of_the_acc": -0.8652, "final_rank": 15 }, { "submission_id": "aoj_0516_10361486", "code_snippet": "#include <bits/stdc++.h>\n#include <cmath>\nusing namespace std;\n\nint main() {\n int n, k;\n cin >> n >> k;\n while(n != 0 || k != 0) {\n vector<int> a(n);\n for(int i = 0; i < n; i++) cin >> a[i];\n vector<int> s(n+1, 0);\n for(int i = 0; i < n; i++) {\n s[i+1] = s[i] + a[i+1];\n }\n int M = s[k] - s[0];\n for(int i = 1; i < n-k; i++) {\n M = max(M, s[i+k] - s[i]);\n }\n cout << M << endl;\n cin >> n >> k;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3836, "score_of_the_acc": -0.3298, "final_rank": 7 }, { "submission_id": "aoj_0516_10332016", "code_snippet": "#include <iostream>\n#include <set>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <unordered_map>\n#include <algorithm>\n#include <numeric>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n\nvoid solve(){\n while(1){\n int n,k;\n cin >> n >> k;\n if(n==0 && k==0) break;\n vector<int> a(n);\n rep(i,n) cin >> a[i];\n\n vector<long long> b(n+1);\n b[0]=0;\n rep(i,n) b[i+1]=b[i]+a[i];\n\n long long res=-1e16;\n rep(i,n-k+1){\n res = max(res,b[i+k]-b[i]);\n }\n cout << res << endl;\n }\n}\n\nint main(){\n solve();\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4308, "score_of_the_acc": -0.7482, "final_rank": 13 }, { "submission_id": "aoj_0516_10299210", "code_snippet": "// #define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)\ntemplate <typename T>\ninline void print(const vector<T>& v, string s = \" \") {\n rep(i, v.size()) cout << v[i] << (i != (ll)v.size() - 1 ? s : \"\\n\");\n}\nll div_ceil(ll a, ll b) { return (a >= 0 ? (a + b - 1) : a) / b; }\nvector<int> di = {-1, 0, 0, 1}, dj = {0, -1, 1, 0};\n\nint main() {\n ll N, K;\n while (cin >> N >> K) {\n if (N == 0) break;\n vector<ll> A(N), S(N + 1);\n rep(i, N) cin >> A[i];\n rep(i, N) S[i + 1] = S[i] + A[i];\n\n ll ans = 0;\n rep(i, N - K + 1) { ans = max(ans, S[i + K] - S[i]); }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4512, "score_of_the_acc": -0.9291, "final_rank": 16 }, { "submission_id": "aoj_0516_10278501", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nint main(){\n int n,k;\n while(1){\n cin >> n >> k;\n vector<int> A(n);\n if(n==0&&k==0) break;\n for(int i = 0; i < n; i++){\n cin >> A[i];\n }\n vector<int> sum(n+1,0);\n for(int i = 1; i <= n; i++){\n sum[i] = sum[i-1] + A[i-1];\n }\n int ans = -1e9;\n for(int i = 0; i+k-1 < n; i++){\n int right = (i+k-1)+1;\n int left = i;\n ans = max(ans,sum[right]-sum[left]);\n }\n cout << ans << endl;\n }\n \n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4096, "score_of_the_acc": -0.5603, "final_rank": 8 }, { "submission_id": "aoj_0516_10278484", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nint main(){\n int n,k;\n while(1){\n cin >> n >> k;\n vector<int> A(n);\n if(n==0&&k==0) break;\n for(int i = 0; i < n; i++){\n cin >> A[i];\n }\n vector<int> sum(n+1,0);\n for(int i = 1; i <= n; i++){\n sum[i] = sum[i-1] + A[i-1];\n }\n int ans = -1e9;\n for(int i = 0; i+k <= n; i++){\n ans = max(ans,sum[k+i]-sum[i]);\n }\n cout << ans << endl;\n }\n \n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4096, "score_of_the_acc": -0.5603, "final_rank": 8 }, { "submission_id": "aoj_0516_10145940", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\nusing ll = long long;\nusing vvi = vector<vector<int>>;\n\nint main() {\n\n int n, k;\n while(cin >> n >> k) {\n if (n == 0) break;\n\n vector<ll> a(n);\n rep(i,n) {\n cin >> a[i];\n }\n\n vector<int> s(n+1,0);\n rep(i, n+1) {\n s[i+1] = s[i] + a[i]; \n }\n\n ll ans = -1LL<<60;\n rep(i, n+1-k) {\n ll val = s[i+k] - s[i];\n if (val > ans) {\n ans = val;\n }\n }\n\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4352, "score_of_the_acc": -0.7872, "final_rank": 14 }, { "submission_id": "aoj_0516_10054796", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long INF = 1LL << 60;\nconst int inf = 1<<30;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\ntypedef long long ll;\n//a:97, A:65\nconst int dx[]={1,0,-1,0};\nconst int dy[]={0,1,0,-1};\nconst double PI = acos(-1);\ntypedef string::const_iterator State;//構文解析用\n\nint main(){\n while(1){\n int n,k; cin >> n >> k;\n if(!n&&!k) break;\n vector<ll> s(n+1);\n for(int i=0;i<n;i++){\n ll a; cin >> a;\n s[i+1]=s[i]+a;\n }\n \n ll ans=-INF;\n for(int i=k;i<=n;i++) ans = max(ans,s[i]-s[i-k]);\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3800, "score_of_the_acc": -0.2979, "final_rank": 6 }, { "submission_id": "aoj_0516_10015694", "code_snippet": "#define _GLGBCXX_DEBUG\n#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr int INF = (1 << 30);\n\nint main() {\n while (true) {\n int n, k, answer = -INF;\n cin >> n >> k;\n\n if (!n && !k) break;\n\n vector<int> a(n + 1);\n\n for (int i = 1; i <= n; i++) {\n int temp;\n cin >> temp;\n\n a.at(i) = a.at(i - 1) + temp;\n }\n\n for (int j = k; j <= n; j++)\n answer = max(answer, a.at(j) - a.at(j - k));\n\n cout << answer << '\\n';\n }\n \n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3464, "score_of_the_acc": 0, "final_rank": 1 } ]
aoj_0517_cpp
最長の階段 問題 1 から n までの整数がそれぞれ 1 つずつ書かれた n 枚のカードと,1 枚の白紙の カードがある.これら n + 1 枚のカードの内, k 枚のカードが与えられる.ただし, 1 ≤ k ≤ n である.白紙のカードには 1 から n までの整数を 1 つ書くことができ る.与えられたカードだけで,できるだけ長い連続した整数列を作りたい. 与えられるカードが入力されたときに, 与えられたカードから作ることができる連 続した整数列の最大長を出力するプログラムを作成せよ. 例1 n = 7, k = 5 とする.6, 2, 4, 7, 1 のカードが与えられたとき,このカードを使っ て作れる連続した整数列のうち最長のものは 1, 2 であり,その長さは 2 である. 例2 n = 7, k = 5 とする.6, 2, 4, 7 と白紙のカードが与えられたとき,このカードを 使って作れる連続した整数列のうち最長のものは,白紙のカードに 5 を書くことに よってできる 4, 5, 6, 7 であり,その長さは 4 である. 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．入力はゼロ２つを含む行で終了する． 1 行目には,2 つの整数 n (1 ≤ n ≤ 100000) と k (1 ≤ k ≤ n ) がこの順で 1 つの 空白を区切りとして書かれている.続く k 行には整数が 1 つずつ書かれており,与 えられる k 枚のカードに書かれている整数を表している.白紙のカードは 0 で表さ れる. 採点用データのうち, 配点の 40% 分は 1 ≤ n ≤ 1000, 1 ≤ k ≤ 500 を, 配点の 20% 分は 1 ≤ n ≤ 60000, 1 ≤ k ≤ 50000 を. 配点の 40% 分は 1 ≤ n ≤ 100000, 1 ≤ k ≤ 100000 を満たす. データセットの数は 5 を超えない． 出力 データセットごとに整数を1行に出力する． 入出力例 入力例 7 5 6 2 4 7 1 7 5 6 2 0 4 7 0 0 出力例 2 4 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0517_11046220", "code_snippet": "#include <iostream>\n#include <math.h>\n#include <vector>\n#include <algorithm>\n#include <set>\nusing namespace std;\nusing ll = long long;\nint main(){\n while(true){\n int N,K;\n cin >> N >> K;\n if(N == 0 and K == 0) break;\n int zero = 0;\n vector<int> v(N+1,false);\n vector<vector<int>> vv(2,vector<int>(N+1,0));\n for(int i = 0;i < K;i++){\n int c;\n cin >> c; \n if(c == 0) zero = 1;\n v[c] = true;\n }\n int ans = 0;\n for(int i = 1;i < N+1;i++){\n vv[1][i] = (vv[0][i-1] + 1)*zero;\n if(v[i]){\n vv[0][i] = vv[0][i-1] + 1;\n vv[1][i] = (vv[1][i-1] + 1)*zero;\n if(ans < vv[0][i]) ans = vv[0][i];\n if(ans < vv[1][i]) ans = vv[1][i];\n }\n }\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4660, "score_of_the_acc": -0.2047, "final_rank": 16 }, { "submission_id": "aoj_0517_10851066", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\nint main() {\n int n, k;\n while(cin >> n >> k, n) {\n vector<int> v(k);\n for(int i=0; i<k; ++i) {\n cin >> v[i];\n }\n sort(v.begin(), v.end());\n int f = v[0] == 0;\n int l = 0+f, r = 1+f, cnt = 0, next_l = -1;\n int res = 0;\n while(true) {\n next_l = -1;\n while(r < k && (v[r] - v[r-1] == 1 || v[r] - v[r-1] == 2)) {\n if(v[r] - v[r-1] == 1) {\n r++;\n } else if(cnt < f) {\n cnt++;\n next_l = r;\n r++;\n } else {\n break;\n }\n }\n res = max(res, r - l + ((r == k && cnt < f) || cnt));\n if(r == k) {\n break;\n }\n if(next_l == -1) {\n l = r;\n r++;\n } else {\n l = next_l;\n }\n cnt = 0;\n }\n cout << res << endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3376, "score_of_the_acc": -0.0444, "final_rank": 4 }, { "submission_id": "aoj_0517_10824757", "code_snippet": "#include <iostream>\n#include <vector>\n#include<algorithm>\nusing namespace std;\n\nint main() {\n int N, K;\n while (true) {\n cin >> N >> K;\n if (N == 0 and K == 0) {\n break;\n }\n vector<int>A(N, 0);\n int c = -1;\n for (int i = 0; i < K; i++) {\n int x;\n cin >> x;\n\n if (x > 0) {\n A[x - 1] = 1;\n }\n else if (x == 0) {\n c = 0;\n }\n }\n int max_ans = 0;\n int skipsiyou = 0;\n int jun = 0;\n for (int i = 0; i < N; i++) {\n if (c != -1) {\n if (A[i] == 1) {\n jun += 1;\n skipsiyou += 1;\n }\n else if (A[i] == 0) {\n max_ans = max(max_ans, skipsiyou);\n skipsiyou = jun + 1;\n jun = 0;\n }\n }\n else {\n if (A[i] == 1) {\n jun += 1;\n }\n else if (A[i] == 0) {\n max_ans = max(jun, max_ans);\n jun = 0;\n }\n }\n }\n max_ans = max(max_ans, skipsiyou);\n cout << max_ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3516, "score_of_the_acc": -0.0619, "final_rank": 6 }, { "submission_id": "aoj_0517_10594307", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long \n#define INF 1e18\nint main(){\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n\n while(1){\n ll ans=0,n,k;cin>>n>>k;\n if(n==0)return 0;\n vector<pair<ll,ll>> dp(n+10);\n map<ll,bool> ma;\n while(k--){\n ll a;cin>>a;\n ma[a]=1;\n }\n for(ll i=1;i<=n;i++){\n if(!ma[0]){\n if(ma[i])dp[i+1].first=dp[i].first+1;\n }else{\n if(ma[i]){\n dp[i+1].first=dp[i].first+1;\n dp[i+1].second=dp[i].second+1;\n }\n else{\n dp[i+1].second=dp[i].first+1;\n }\n }\n ans=max({ans,dp[i+1].first,dp[i+1].second});\n }\n cout<<ans<<endl;\n }\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 11032, "score_of_the_acc": -1.3333, "final_rank": 19 }, { "submission_id": "aoj_0517_10338238", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n\nstruct pair_hash {\n template <typename T1, typename T2>\n size_t operator ()(const pair<T1, T2>& p) const {\n auto h1 = hash<T1>{}(p.first);\n auto h2 = hash<T2>{}(p.second);\n return h1 ^ (h2 << 1);\n }\n};\n\nint main(){\n while(1){\n int n,k;\n cin >> n >> k;\n if(n==0 && k==0) break;\n\n vector<bool> present(n+1,false);\n rep(i,k){\n int x;\n cin >> x;\n present[x]=true;\n }\n int allowed=0;\n if(present[0]){\n allowed=1;\n }\n\n int res=0;\n int left=1;\n int gap=0;\n for(int right=1;right<=n;right++){\n if(!present[right]){\n gap++;\n }\n while(gap>allowed && left<=right){\n if(!present[left]){\n gap--;\n }\n left++;\n }\n res=max(res,right-left+1);\n }\n cout << res << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3224, "score_of_the_acc": -0.0255, "final_rank": 3 }, { "submission_id": "aoj_0517_9835628", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#ifdef LOCAL\n #include \"settings/debug.cpp\"\n#else\n #define Debug(...) void(0)\n#endif\n#define rep(i, n) for (int i = 0; i < (n); ++i)\nusing ll = long long;\nusing ull = unsigned long long;\n\nint main() {\n while (true) {\n int n, k;\n cin >> n >> k;\n if (n + k == 0) break;\n vector<int> a(k);\n rep(i, k) cin >> a[i];\n sort(a.begin(), a.end());\n bool has0 = a[0] == 0;\n if (has0) {\n a.erase(a.begin());\n k--;\n }\n vector<pair<int, int>> v(0);\n for (int x : a) {\n if (v.empty() || v.back().second + 1 < x) {\n v.push_back({ x, x });\n }\n else {\n assert(v.back().second + 1 == x);\n v.back().second = x;\n }\n }\n Debug(v);\n int ans = 0;\n rep(i, v.size()) {\n if (has0 && i + 1 < v.size() && v[i].second + 2 == v[i + 1].first) {\n ans = max(ans, v[i + 1].second - v[i].first + 1);\n }\n else {\n ans = max(ans, v[i].second - v[i].first + 1 + has0);\n }\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3968, "score_of_the_acc": -0.1183, "final_rank": 14 }, { "submission_id": "aoj_0517_6493026", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\n#define rep(i, n) for (int i=0; i<n; ++i)\n#define repi(i, j, n) for (int i=j; i<n; ++i)\n\nint main () {\n\trep(t, 5) {\n\t\tint n, k, x;\n\t\tcin >> n >> k;\n\t\tif (n == 0 && k == 0) return 0;\n\t\tvector<bool> v(n+1, false);\n\t\trep(i, k) {\n\t\t\tcin >> x;\n\t\t\tv[x] = true;\n\t\t}\n\n\t\tint ans = 0, right = 1;\n\t\tbool bln = v[0];\n\t\trepi(left, 1, n) {\n\t\t\twhile (right <= n) {\n\t\t\t\tif (v[right]) ++right;\n\t\t\t\telse if (v[0] && bln) {\n\t\t\t\t\tbln = false;\n\t\t\t\t\t++right;\n\t\t\t\t}\n\t\t\t\telse break;\n\t\t\t}\n\t\t\t\n\t\t\tans = max(ans, right - left);\n\t\t\tif (left == right) ++right;\n\t\t\tif (!v[left] && v[0]) bln = true;\n\t\t}\n\t\tprintf(\"%d\\n\", ans);\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3432, "score_of_the_acc": -0.0514, "final_rank": 5 }, { "submission_id": "aoj_0517_6492910", "code_snippet": "#include<bits/extc++.h>\nusing namespace std;\n\n#define ll long long\n#define ld long double\n#define ull unsigned long long\n#define _overload4(_1,_2,_3,_4,name,...) name\n#define _overload3(_1,_2,_3,name,...) name\n#define _rep1(n) for(ll i = 0; i < n; ++i)\n#define _rep2(i, n) for(ll i = 0; i < n; ++i)\n#define _rep3(i, a, b) for(ll i = a; i < b; ++i)\n#define _rep4(i, a, b, c) for(ll i = a; i < b; i += c)\n#define rep(...) _overload4(__VA_ARGS__, _rep4, _rep3, _rep2, _rep1)(__VA_ARGS__)\n#define rrep(i, n) for(int i = n-1; i >= 0; i--)\n#define rrep2(i, a, b) for(int i = a-1; i >= b; i--)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define MAX(x) *max_element(all(x))\n#define MIN(x) *min_element(all(x))\n#define eb emplace_back\n#define fi first\n#define se second\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define pcc pair<char, char>\n#define pdd pair<double, double>\n#define endl '\\n'\ntemplate<class T> using pq = priority_queue< T >;\ntemplate<class T> using pqg = priority_queue< T , vector< T >, greater< T >>;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\ntemplate<class T>\nT ceil_div(T a, T b) {\n if(b < 0) a = -a, b = -b;\n return (a >= 0 ? (a + b - 1) / b : a / b);\n}\n \ntemplate<class T>\nT floor_div(T a, T b) {\n if(b < 0) a = -a, b = -b;\n return (a >= 0 ? a / b : (a - b + 1) / b);\n}\ninline ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll digit(ll x){\n string s = to_string(x);\n return (ll)s.size();\n}\n\nconst int inf = 1001001001;\nconst ll INF = 1001001001001001001;\n\nconst double PI = acos(-1);\n\nbool range(int y, int x, int h, int w){\n return (0 <= y && y < h && 0 <= x && x < w);\n}\nint dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\nint dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\n\nconst int MOD = 998244353;\n//const int MOD = 1000000007;\nstruct dsu {\n public:\n dsu() : _n(0) {}\n explicit dsu(int n) : _n(n), parent_or_size(n, -1) {}\n\n int merge(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n int x = leader(a), y = leader(b);\n if (x == y) return x;\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\n parent_or_size[x] += parent_or_size[y];\n parent_or_size[y] = x;\n return x;\n }\n\n bool same(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n return leader(a) == leader(b);\n }\n\n int leader(int a) {\n assert(0 <= a && a < _n);\n if (parent_or_size[a] < 0) return a;\n return parent_or_size[a] = leader(parent_or_size[a]);\n }\n\n int size(int a) {\n assert(0 <= a && a < _n);\n return -parent_or_size[leader(a)];\n }\n\n std::vector<std::vector<int>> groups() {\n std::vector<int> leader_buf(_n), group_size(_n);\n for (int i = 0; i < _n; i++) {\n leader_buf[i] = leader(i);\n group_size[leader_buf[i]]++;\n }\n std::vector<std::vector<int>> result(_n);\n for (int i = 0; i < _n; i++) {\n result[i].reserve(group_size[i]);\n }\n for (int i = 0; i < _n; i++) {\n result[leader_buf[i]].push_back(i);\n }\n result.erase(\n std::remove_if(result.begin(), result.end(),\n [&](const std::vector<int>& v) { return v.empty(); }),\n result.end());\n return result;\n }\n\n private:\n int _n;\n // root node: -1 * component size\n // otherwise: parent\n std::vector<int> parent_or_size;\n};\nsigned main(){\n cout << fixed << setprecision(15);\n \n while(true){\n int n, k;\n cin >> n >> k;\n if(n == 0 && k == 0) break;\n vector<int> x(100010);\n dsu tree(100010);\n bool zero = false;\n rep(i, k){\n int a;\n cin >> a;\n if(a == 0) zero = true;\n else x[a] = 1;\n }\n rep(i, 1, 100000){\n if(x[i] == 1 && x[i+1] == 1) tree.merge(i, i+1);\n }\n int ans = 0;\n rep(i, 1, 100001){\n chmax(ans, (int)tree.size(i));\n if(zero){\n if(x[i] == 1 && x[i+1] == 0 && x[i+2] == 1){\n chmax(ans, (int)tree.size(i) + 1 + (int)tree.size(i+2));\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3592, "score_of_the_acc": -0.0714, "final_rank": 10 }, { "submission_id": "aoj_0517_5775714", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\ntypedef long long ll;\ntypedef pair<long long, long long> P;\nconst long long INF = 1e9;\ntemplate <typename T>\nvoid input_arr(vector<T>& A, long long N) {\n for (long long i = 0; i < N; i++) {\n cin >> A[i];\n }\n}\nll binary_search(vector<long long>&A, long long key) {\n ll left = (long long)A.size(), right = -1;\n if (A.back() < key) return INF;\n while (abs(left-right)>1){\n long long mid = (left + right) / 2;\n if (A[mid] > key) left = mid;\n else right = mid;\n }\n return left;\n}\nint main() {\n long long N, K; cin >> N >> K;\n while (!(N == 0 && K == 0)) {\n vector<long long>A(K); input_arr(A, K);\n sort(A.begin(),A.end());\n vector<bool>B(N, false);\n if (A[0] == 0) {\n for (long long i = 1; i < K; i++) {\n B[A[i]-1] = true;\n }\n vector<P>C;\n C.push_back(make_pair(1, B[0]));\n for (long long i = 1; i < N; i++) {\n if (B[i] == B[i-1]) C.back().first++;\n else C.push_back(make_pair(1, B[i]));\n }\n long long ans = -1;\n for (long long i = 0; i < C.size(); i++) {\n if (C[i].second == 0 && C[i].first == 1) {\n long long sum = 0;\n if (i - 1 >= 0) sum += C[i-1].first;\n if (i + 1 < C.size()) sum += C[i+1].first;\n sum++;\n ans = max(ans, sum);\n }\n else if (C[i].second == 1) ans = max(ans, C[i].first);\n }\n cout << ans << endl;\n } \n else {\n for (long long i = 0; i < K; i++) {\n B[A[i]-1] = true;\n }\n vector<P>C;\n C.push_back(make_pair(1, B[0]));\n for (long long i = 1; i < N; i++) {\n if (B[i] == B[i-1]) C.back().first++;\n else C.push_back(make_pair(1, B[i]));\n }\n long long ans = -1;\n for (long long i = 0; i < C.size(); i++) {\n if (C[i].second == 1) ans = max(ans, C[i].first);\n }\n cout << ans << endl;\n }\n cin >> N >> K;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4296, "score_of_the_acc": -0.1593, "final_rank": 15 }, { "submission_id": "aoj_0517_5718175", "code_snippet": "#include<iostream>\n#include<set>\n#include<map>\n\nusing namespace std;\n\nint main()\n{\n\twhile (true)\n\t{\n\t\tint n, k;\n\t\tcin >> n >> k;\n\t\tif (n == 0 && k == 0)\n\t\t\tbreak;\n\t\tset<int> nums;\n\t\tmap<int, int> counter;\n\t\tint num;\n\t\tfor (int i = 0; i < k; i++)\n\t\t{\n\t\t\tcin >> num;\n\t\t\tnums.insert(num);\n\t\t}\n\t\tbool haveZero = false;\n\t\tauto iter = nums.begin();\n\t\tif (*iter == 0)\n\t\t{\n\t\t\thaveZero = true;\n\t\t\titer = nums.erase(iter);\n\t\t}\n\t\tauto iter_rear = nums.begin();\n\t\tint ans = 0;\n\t\twhile (iter != nums.end())\n\t\t{\n\t\t\tcounter[*iter] = 0;\n\t\t\tfor (iter_rear = iter; iter_rear != nums.end(); iter_rear++)\n\t\t\t{\n\t\t\t\tif (*iter_rear - *iter != counter[*iter])\n\t\t\t\t\tbreak;\n\t\t\t\tcounter[*iter]++;\n\t\t\t}\n\t\t\tans = max(ans, counter[*iter]);\n\t\t\titer = iter_rear;\n\t\t}\n\t\tif (haveZero)\n\t\t{\n\t\t\tfor (pair<int,int> c : counter)\n\t\t\t{\n\t\t\t\tif (counter.count(c.first + c.second + 1))\n\t\t\t\t\tans = max(ans, counter[c.first] + counter[c.first + c.second + 1] + 1);\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\n\t//system(\"pause\");\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 7492, "score_of_the_acc": -1.5582, "final_rank": 20 }, { "submission_id": "aoj_0517_5469161", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, N) for (ll i = 0; i < N; i++)\n\nint main()\n{\n\n while(1){\n int n, k;\n cin >> n >> k;\n if(n ==0 && k == 0) return 0;\n int kk[k], nn[n + 2] = {};\n rep(i, k)\n {\n cin >> kk[i];\n nn[kk[i]]++;\n }\n int maxv = 0;\n int cnt = 0;\n int prevs = -10, preve = -10, curs = -10, prevcnt = -10;\n if (nn[0] == 1)\n {\n for (int i = 1; i <= n + 1; i++)\n {\n if (nn[i] == 1)\n {\n cnt++;\n if (curs < 0)\n curs = i;\n }\n else\n {\n if (nn[i - 1] == 1)\n {\n int tmp = cnt;\n if (curs - 2 == preve)\n {\n cnt += prevcnt + 1;\n }\n else\n cnt++;\n if (maxv < cnt)\n {\n maxv = cnt;\n }\n prevcnt = tmp;\n prevs = curs;\n curs = -1;\n preve = i - 1;\n }\n else\n {\n prevcnt = 0;\n }\n cnt = 0;\n }\n // cout << i << \" \" << prevs << \" \" << preve << \" \" << curs << \" \" << prevcnt << \" \" << cnt << \" \" << maxv << endl;\n }\n }\n else\n {\n for (int i = 1; i <= n; i++)\n {\n if (nn[i] == 1)\n {\n cnt++;\n }\n else\n {\n if (maxv < cnt)\n {\n maxv = cnt;\n }\n cnt = 0;\n }\n // cout << i << \" \" << prevs << \" \" << preve << \" \" << curs << \" \" << prevcnt << \" \" << cnt << \" \" << maxv << endl;\n }\n }\n cout << maxv << endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3772, "score_of_the_acc": -0.0939, "final_rank": 11 }, { "submission_id": "aoj_0517_5239534", "code_snippet": "#include <bits/stdc++.h>\n \n#define rep(i,n) for(ll i=0;i<n;++i)\n#define rrep(i, n) for(ll i=n-1;i>=0;--i)\n#define rep1(i, n) for(ll i=1; i<=n; ++i)\n#define repitr(itr,mp) for(auto itr=mp.begin();itr!=mp.end();++itr)\n#define ALL(a) (a).begin(),(a).end()\n\ntemplate<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}\ntemplate<class T> void chmin(T &a, const T &b){if(a > b){a = b;}}\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing pll = pair<ll, ll>;\n\nconst ll MOD = 1e9 + 7;\nconst ll LINF = 1LL << 60;\nconst int INF = 1e9 + 7;\nconst double PI = 3.1415926535897932384626;\n\nint main(){\n ll n, k;\n while(cin >> n >> k){\n if(n + k == 0)break;\n\n vector<ll> num(n+1, 0);\n rep(i, k){\n ll x;\n cin >> x;\n num[x] = 1;\n }\n\n ll back = 0;\n ll ans = 0;\n //　白紙がない場合\n if(!num[0]){\n rep1(i, n){\n if(!num[i])back = i;\n else chmax(ans, i - back);\n }\n }\n // 白紙がある場合\n else {\n int zero = 0;\n rep1(i, n){\n if(!num[i]){\n chmax(ans, zero - back);\n back = zero;\n zero = i;\n }\n else chmax(ans, i - back);\n }\n }\n\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3580, "score_of_the_acc": -0.0699, "final_rank": 9 }, { "submission_id": "aoj_0517_5239028", "code_snippet": "#include <bits/stdc++.h>\n \n#define rep(i,n) for(ll i=0;i<n;++i)\n#define rrep(i, n) for(ll i=n-1;i>=0;--i)\n#define rep1(i, n) for(ll i=1; i<=n; ++i)\n#define repitr(itr,mp) for(auto itr=mp.begin();itr!=mp.end();++itr)\n#define ALL(a) (a).begin(),(a).end()\n\ntemplate<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}\ntemplate<class T> void chmin(T &a, const T &b){if(a > b){a = b;}}\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing pll = pair<ll, ll>;\n\nconst ll MOD = 1e9 + 7;\nconst ll LINF = 1LL << 60;\nconst int INF = 1e9 + 7;\nconst double PI = 3.1415926535897932384626;\n\nint main(){\n ll n, k;\n while(cin >> n >> k){\n if(n + k == 0)break;\n\n vector<ll> num(k);\n rep(i, k)cin >> num[i];\n sort(ALL(num));\n\n bool has0 = !num[0];\n if(has0){\n num.erase(num.begin());\n }\n // NOTE: *_usingは白紙カードをつかった場合のやつ\n vector<ll> ans(1, num[0]), ans_using(1, num[0]), tmp(1, num[0]), tmp_using(1, num[0]);\n rep1(i, num.size()-1){\n if(tmp.empty() || num[i-1] + 1 == num[i]){\n tmp.push_back(num[i]);\n tmp_using.push_back(num[i]);\n }\n else {\n if(tmp.size() > ans.size())ans = tmp;\n if(tmp_using.size() > ans_using.size())ans_using = tmp_using;\n\n // 白紙を使う\n if(num[i-1] + 2 == num[i]){\n tmp_using = tmp;\n tmp_using.push_back(num[i]);\n }\n else {\n tmp_using.clear();\n tmp_using.push_back(num[i]);\n }\n\n tmp.clear();\n tmp.push_back(num[i]);\n }\n }\n\n if(tmp.size() > ans.size())ans = tmp;\n if(tmp_using.size() > ans_using.size())ans_using = tmp_using;\n\n ll res;\n if(has0)res = max(ans.size(), ans_using.size()) + 1;\n else res = ans.size();\n\n cout << min(res, k) << endl;\n }\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3324, "score_of_the_acc": -0.3713, "final_rank": 18 }, { "submission_id": "aoj_0517_4936764", "code_snippet": "#include <bits/stdc++.h>\n//#include <atcoder/all>\n#define LOCAL\nusing namespace std;\n//using namespace atcoder;\ntemplate <typename A, typename B>\nostream& operator <<(ostream& out, const pair<A, B>& a) {\nout << \"(\" << a.first << \",\" << a.second << \")\";\nreturn out;\n}\ntemplate <typename T, size_t N>\nostream& operator <<(ostream& out, const array<T, N>& a) {\nout << \"[\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" : \", \"); out << v; first = 0;} out << \"]\";\nreturn out;\n}\ntemplate <typename T>\nostream& operator <<(ostream& out, const vector<T>& a) {\nout << \"[\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" : \", \"); out << v; first = 0;} out << \"]\";\nreturn out;\n}\ntemplate <typename T, class Cmp>\nostream& operator <<(ostream& out, const set<T, Cmp>& a) {\nout << \"{\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" : \", \"); out << v; first = 0;} out << \"}\";\nreturn out;\n}\ntemplate <typename U, typename T, class Cmp>\nostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {\nout << \"{\"; bool first = true;\nfor (auto& p : a) { out << (first ? \"\" : \", \"); out << p.first << \":\" << p.second; first = 0;} out << \"}\";\nreturn out;\n}\n#ifdef LOCAL\n#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define trace(...) 42\n#endif\ntemplate <typename Arg1>\nvoid __f(const char* name, Arg1&& arg1){\ncerr << name << \": \" << arg1 << endl;\n}\ntemplate <typename Arg1, typename... Args>\nvoid __f(const char* names, Arg1&& arg1, Args&&... args){\nconst char* comma = strchr(names + 1, ',');\ncerr.write(names, comma - names) << \": \" << arg1 << \" |\";\n__f(comma + 1, args...);\n}\n#define rep(i,n) for(int i=0; i<(n); i++)\nusing ll = long long;\n//#define int long long\nusing P = pair<int,int>;\n//#########################################\nint main(){\n while(1){\n int n,k;cin >>n >> k;\n if(n == 0 && k == 0) return 0;\n vector<int> a;\n int flag = 0;\n rep(i,k){\n int x;cin >> x;\n if(x == 0){\n flag = 1;\n continue;\n }\n a.push_back(x);\n }\n sort(a.begin(),a.end());\n int m = a.size();\n vector<int> kouho;\n rep(i,m){\n if(i == m-1 || a[i] +1 != a[i+1])kouho.push_back(1);\n else{\n int cnt = 0;\n while(i < m-1 && a[i] +1 == a[i+1]){\n cnt++;\n i++;\n }\n kouho.push_back(cnt+1);\n \n }\n\n }\n // trace(kouho);\n m = kouho.size();\n if(flag){\n int ret = 0;\n for(int i = 0;i < m-1;i++){\n ret = max(ret,kouho[i] + kouho[i+1]);\n }\n cout << ret +1 << endl;\n }\n else {\n int ret = 0;\n rep(i,m)ret = max(ret,kouho[i]);\n cout << ret << endl;\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3556, "score_of_the_acc": -0.0669, "final_rank": 7 }, { "submission_id": "aoj_0517_4936726", "code_snippet": "#include<iostream>\n#include<vector>\n#include<functional>\n#include<algorithm>\nusing namespace std;\n\ntemplate<typename T>\nT meguru_search(T ok, T ng, function<bool(T)> check){\n while(max(ok, ng) - min(ok, ng) > T(1)){\n T mid = (ok + ng) / T(2);\n if(check(mid)){\n ok = mid;\n }else{\n ng = mid;\n }\n }\n return ok;\n}\n\nint main(){\n int n, k;\n\n while(cin >> n >> k, n){\n vector<int> sum(n + 1, 0);\n int cnt = 0;\n\n for(int i = 0 ; i < k ; ++i){\n int a;\n cin >> a;\n\n if(a == 0){\n ++cnt;\n }else{\n ++sum[a];\n }\n }\n\n for(int i = 1 ; i <= n ; ++i){\n sum[i] += sum[i - 1];\n }\n\n auto check = [&](int mid){\n for(int i = mid ; i <= n ; ++i){\n if(sum[i] - sum[i - mid] + cnt >= mid){\n return true;\n }\n }\n return false;\n };\n\n int ans = meguru_search<int>(0, n + 1, check);\n cout << ans << endl;\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3064, "score_of_the_acc": -0.0055, "final_rank": 2 }, { "submission_id": "aoj_0517_4936658", "code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<queue>\n#include<iomanip>\n#include <string>\n#include <math.h>\nusing namespace std;\n\nint main(){\n int n,k,q,w,ans;\n cin>>n;\n vector<int>a(200000);\n vector<int>b(200000);\n while(n!=0){\n cin>>k;\n q=0;\n w=0;\n ans=0;\n vector<int>b(200000,0);\n for(int i=0;i<k;i++){\n cin>>a[i];\n b[a[i]]++;\n }\n if(b[0]==1){\n for(int i=1;i<n+2;i++){\n if(b[i]==1){\n q++;\n } \n else{\n if(ans<q+w+1){\n ans=q+w+1;\n }\n w=q;\n q=0;\n }\n }\n }\n else{\n for(int i=1;i<n+2;i++){\n if(b[i]==1){\n q++;\n } \n else{\n if(ans<q){\n ans=q;\n }\n q=0;\n }\n }\n }\n cout<<ans<<endl;\n cin>>n;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5084, "score_of_the_acc": -0.2576, "final_rank": 17 }, { "submission_id": "aoj_0517_4936601", "code_snippet": "#include<iostream>\n#include<string>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<map>\n#include<math.h>\n#include<iomanip>\n#include<set>\n#include<numeric>\n#include<cstring>\n#include<cstdio>\n#include<functional>\n#include<bitset>\n#include<limits.h>\n#include<cassert>\n#include<iterator>\n#include<complex>\n#include<stack>\n#include<sstream>\n#include<iterator>\n#include<list>\n\nusing namespace std;\n\n#define INF LLONG_MAX/5\n#define MOD 1000000007\n#define pi 3.14159265358979\n#define int long long\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define sort(v) sort((v).begin(), (v).end())\n#define reverse(v) reverse((v).begin(), (v).end())\n#define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge)\n#define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge)\n#define enld endl\n\nvoid vout(vector<int>A) {\n\trep(i, A.size()) {\n\t\tcout << A[i];\n\t\tif (i == A.size() - 1) {\n\t\t\tcout << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << ' ';\n\t\t}\n\t}\n}\n\nvoid vvout(vector<vector<int>>A) {\n\trep(i, A.size()) {\n\t\trep(j, A[i].size()) {\n\t\t\tcout << A[i][j];\n\t\t\tif (j == A[i].size() - 1) {\n\t\t\t\tcout << endl;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tcout << ' ';\n\t\t\t}\n\t\t}\n\t}\n}\n\nsigned main() {\n\tint N, K;\n\twhile (1) {\n\t\tbool zero = false;\n\t\tcin >> N >> K;\n\t\tif (K == 1) {\n\t\t\tcout << 1 << enld;\n\t\t}\n\t\telse {\n\t\t\tif (N == 0 && K == 0) {\n\t\t\t\treturn 0;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tvector<int>V(K);\n\t\t\t\trep(i, K) {\n\t\t\t\t\tcin >> V[i];\n\t\t\t\t}\n\t\t\t\tsort(V);\n\t\t\t\tif (V[0] == 0) {\n\t\t\t\t\tzero = true;\n\t\t\t\t\tV.erase(V.begin());\n\t\t\t\t}\n\t\t\t\tif (zero) {\n\t\t\t\t\tint cnt = 0;\n\t\t\t\t\tint ans = 0;\n\t\t\t\t\tvector<bool>F;\n\t\t\t\t\tvector<int>S;\n\t\t\t\t\trep(i, V.size()) {\n\t\t\t\t\t\tif (i == 0) {\n\t\t\t\t\t\t\tcnt = 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tif (V[i] - V[i - 1] == 1) {\n\t\t\t\t\t\t\t\tcnt++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse if (V[i] - V[i - 1] == 2) {\n\t\t\t\t\t\t\t\tS.push_back(cnt);\n\t\t\t\t\t\t\t\tcnt = 1;\n\t\t\t\t\t\t\t\tF.push_back(true);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\tS.push_back(cnt);\n\t\t\t\t\t\t\t\tcnt = 1;\n\t\t\t\t\t\t\t\tF.push_back(false);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (cnt != 1) {\n\t\t\t\t\t\tS.push_back(cnt);\n\t\t\t\t\t}\n\t\t\t\t\trep(i, S.size()) {\n\t\t\t\t\t\tans = max(ans, S[i]);\n\t\t\t\t\t}\n\t\t\t\t\trep(i, S.size() - 1) {\n\t\t\t\t\t\tif (F[i]) {\n\t\t\t\t\t\t\tans = max(ans, S[i] + S[i + 1] + 1);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tcout << ans << endl;\n\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tint cnt = 0;\n\t\t\t\t\tint ans = 0;\n\t\t\t\t\trep(i, V.size()) {\n\t\t\t\t\t\tif (i == 0) {\n\t\t\t\t\t\t\tcnt = 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tif (V[i] - V[i - 1] == 1) {\n\t\t\t\t\t\t\t\tcnt++;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\telse {\n\t\t\t\t\t\t\t\tans = max(ans, cnt);\n\t\t\t\t\t\t\t\tcnt = 1;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tcout << ans << endl;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3796, "score_of_the_acc": -0.0969, "final_rank": 12 }, { "submission_id": "aoj_0517_4668016", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint N, K;\nint DpLen[2][100002];\nbool Used[100001];\n\nint solve() {\n\tint maxLen;\n\n\tfor (int i = 1; i <= N; ++i) {\n\t\tif (!Used[i]) {\n\t\t\tcontinue;\n\t\t}\n\t\tDpLen[0][i] = DpLen[0][i - 1] + 1;\n\t}\n\tfor (int i = N; i >= 1; --i) {\n\t\tif (!Used[i]) {\n\t\t\tcontinue;\n\t\t}\n\t\tDpLen[1][i] = DpLen[1][i + 1] + 1;\n\t}\n\n\tmaxLen = 1;\n\n\n\tfor (int i = 1; i <= N; ++i) {\n\t\tmaxLen = max(maxLen, max(DpLen[0][i], DpLen[1][i]));\n\t\tif (!Used[0] || Used[i]) {\n\t\t\tcontinue;\n\t\t}\n\t\tmaxLen = max(maxLen, DpLen[0][i - 1] + 1 + DpLen[1][i + 1]);\n\t}\n\n\treturn maxLen;\n}\n\nint main() {\n\tint a;\n\n\twhile (cin >> N >> K, N) {\n\t\tmemset(DpLen, 0, sizeof(DpLen));\n\t\tmemset(Used, false, sizeof(Used));\n\t\tfor (int i = 0; i < K; ++i) {\n\t\t\tcin >> a;\n\t\t\tUsed[a] = true;\n\t\t}\n\t\tcout << solve() << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3964, "score_of_the_acc": -0.1178, "final_rank": 13 }, { "submission_id": "aoj_0517_4463431", "code_snippet": "#include <bits/stdc++.h>\n\nbool compare(const std::pair<int, int> &a, const std::pair<int, int> &b) {\n return a.second - a.first > b.second - b.first;\n}\n\nint main() {\n int N, k, i;\n for (;;) {\n std::scanf(\"%d %d\", &N, &k);\n if (N == 0 && k == 0) break;\n int arr[k];\n int cnt0 = 0;\n std::vector< std::pair<int, int> > v;\n for (i = 0; i < k; i++) {\n std::scanf(\"%d\", &arr[i]);\n }\n std::sort(arr, arr+k);\n for (i = 0; i < k; i++) {\n if (arr[i] != 0) break;\n cnt0++;\n }\n int idx = i;\n for (i = idx+1; i < k; i++) {\n if (arr[i] - arr[i-1] > 1) {\n v.push_back({idx, i-1});\n idx = i;\n }\n }\n v.push_back({idx, i-1});\n if (cnt0 == 0) {\n std::sort(v.begin(), v.end(), compare);\n std::cout << v[0].second - v[0].first + 1 << std::endl;\n } else {\n int global_max = 0, current_max = 0;\n int diff;\n for (int j = 0; j < v.size()-1; j++) {\n diff = cnt0;\n current_max = v[j].second - v[j].first+1;\n if (arr[v[j+1].first] - arr[v[j].second]-1 > diff) {\n current_max += diff;\n global_max = std::max(global_max, current_max);\n }\n else {\n for (int k = j+1; k < v.size(); k++) {\n if (arr[v[k].first]-arr[v[k-1].second]-1 > diff) {\n current_max += diff;\n break;\n }\n current_max += arr[v[k].second]-arr[v[k-1].second];\n diff -= arr[v[k].first] - arr[v[k-1].second]-1;\n }\n global_max = std::max(global_max, current_max);\n }\n }\n std::cout << global_max << std::endl;\n }\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3560, "score_of_the_acc": -0.0674, "final_rank": 8 }, { "submission_id": "aoj_0517_4391592", "code_snippet": "#include <bits/stdc++.h>\n\n#define ALL(a) (a).begin(), (a).end()\n\nusing namespace std;\n\nsigned main(){\n\twhile(true) {\n\t\tint n; cin >> n;\n\t\tif(n == 0) break;\n\t\tint k; cin >> k;\n\t\tvector<int> arr(k);\n\t\tfor(auto &&e : arr) cin >> e;\n\t\tsort(ALL(arr));\n\t\tint ans = 0;\n\t\tif(arr[0] == 0) {\n\t\t\tint acc = 1;\n\t\t\tint prev = 0;\n\t\t\tfor(size_t i = 2; i < k; i++) {\n\t\t\t\tswitch(arr[i] - arr[i-1]) {\n\t\t\t\t\tcase 1:\n\t\t\t\t\t\tacc += 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 2:\n\t\t\t\t\t\tans = max(ans, acc + prev + 1);\n\t\t\t\t\t\tprev = acc;\n\t\t\t\t\t\tacc = 1;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tans = max(ans, acc + prev + 1);\n\t\t\t\t\t\tacc = 1;\n\t\t\t\t\t\tprev = 0;\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = max(ans, acc + prev + 1);\n\t\t} else {\n\t\t\tint acc = 1;\n\t\t\tfor(size_t i = 1; i < k; i++) {\n\t\t\t\tif(arr[i] - arr[i-1] == 1) {\n\t\t\t\t\tacc += 1;\n\t\t\t\t} else {\n\t\t\t\t\tans = max(ans, acc);\n\t\t\t\t\tacc = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = max(ans, acc);\n\t\t}\n\t\tcout << ans << \"\\n\";\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3020, "score_of_the_acc": 0, "final_rank": 1 } ]
aoj_0518_cpp
最古の遺跡 問題 昔, そこには集落があり, 多くの人が暮らしていた. 人々は形も大きさも様々な建物を建てた. だが, それらの建造物は既に失われ, 文献と, 遺跡から見つかった柱だけが建造物の位置を知る手がかりだった. 文献には神殿の記述がある. 神殿は上から見ると正確に正方形になっており, その四隅には柱があった. 神殿がどの向きを向いていたかはわからない. また, 辺上や内部に柱があったかどうかもわからない. 考古学者たちは, 遺跡から見つかった柱の中で, 正方形になっているもののうち, 面積が最大のものが神殿に違いないと考えた. 柱の位置の座標が与えられるので, 4 本の柱でできる正方形のうち面積が最大のものを探し, その面積を出力するプログラムを書け. なお, 正方形の辺は座標軸に平行とは限らないことに注意せよ. 例 下の図の例では, 10 本の柱があり, 座標 (4, 2), (5, 2), (5, 3), (4, 3) にある 4 本と座標 (1, 1), (4, 0), (5, 3), (2, 4) にある 4 本が正方形をなしている. 面積が最大の正方形は後者で, その面積は 10 である. 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる．入力はゼロ１つを含む行で終了する． 1 行目には, 遺跡から見つかった柱の本数 n が書かれている. 2 行目から n + 1 行目までの n 行の各々には, 柱の x 座標と y 座標が空白区切りで書かれている. 1 本の柱が 2 度以上現れることはない. n は 1 ≤ n ≤ 3000 を満たす整数であり, 柱の x 座標と y 座標は 0 以上 5000 以下の整数である. 採点用データのうち, 配点の 30% 分は 1 ≤ n ≤ 100 を満たし, 配点の 60% 分は1 ≤ n ≤ 500 を満たす. データセットの数は 10 を超えない． 出力 データセットごとに 1 個の整数を出力する. 4 本の柱からなる正方形が存在する場合は, そのような正方形のうち面積が最大のものの面積を出力し, そのような正方形が存在しない場合は 0 を出力せよ. 入出力例 入力例 10 9 4 4 3 1 1 4 2 2 4 5 8 4 0 5 3 0 5 5 2 10 9 4 4 3 1 1 4 2 2 4 5 8 4 0 5 3 0 5 5 2 0 出力例 10 10 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0518_11046473", "code_snippet": "#include <iostream>\n#include <math.h>\n#include <vector>\n#include <algorithm>\n#include <set>\nusing namespace std;\nusing ll = long long;\nint main(){\n while(true){\n int N;\n cin >> N;\n if(N == 0) break;\n vector<int> x(N,0);\n vector<int> y(N,0);\n for(int i = 0;i < N;i++){\n cin >> x[i];\n cin >> y[i];\n }\n vector<vector<int>> vv(N,vector<int>(N,0));\n for(int i = 0;i < N;i++){\n for(int j = 0;j < N;j++){\n vv[i][j] = ((x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]));\n }\n }\n ll ans = 0;\n for(int i = 0;i < N;i++){\n for(int j = i+1;j < N;j++){\n int def = vv[i][j];\n for(int k = j+1;k < N;k++){\n if(vv[i][k] == def){\n if(vv[i][j] * 2 == vv[j][k]){\n int shahen = vv[j][k];\n for(int l = i+1;l < N;l++){\n if(vv[i][l] == shahen){\n if(vv[j][l] == def){\n if(def > ans) ans = def;\n }\n }\n }\n }\n }\n } \n }\n }\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 4280, "memory_kb": 38176, "score_of_the_acc": -1.3591, "final_rank": 20 }, { "submission_id": "aoj_0518_10825937", "code_snippet": "#include <iostream>\n#include <vector>\n#include <unordered_set>\n#include <unordered_map>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\n// 座標を一意に識別するためのハッシュ関数\ninline int encode(int x, int y) {\n return x * 5001 + y;\n}\n\nint main() {\n while (true) {\n int N;\n cin >> N;\n if (N == 0) break;\n\n vector<int> X(N), Y(N);\n unordered_set<int> point_set;\n\n for (int i = 0; i < N; i++) {\n cin >> X[i] >> Y[i];\n point_set.insert(encode(X[i], Y[i]));\n }\n\n int ans = 0;\n\n for (int i = 0; i < N; i++) {\n for (int j = i + 1; j < N; j++) {\n int x1 = X[i], y1 = Y[i];\n int x2 = X[j], y2 = Y[j];\n\n // 正方形の3,4点目を計算（90度回転）\n int x3 = x1 - (y2 - y1), y3 = y1 + (x2 - x1);\n int x4 = x2 - (y2 - y1), y4 = y2 + (x2 - x1);\n\n if (0 <= x3 && x3 <= 5000 && 0 <= y3 && y3 <= 5000 &&\n 0 <= x4 && x4 <= 5000 && 0 <= y4 && y4 <= 5000) {\n if (point_set.count(encode(x3, y3)) && point_set.count(encode(x4, y4))) {\n int dist = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);\n ans = max(ans, dist);\n }\n }\n\n // もう一方に90度回転した場合\n x3 = x1 + (y2 - y1), y3 = y1 - (x2 - x1);\n x4 = x2 + (y2 - y1), y4 = y2 - (x2 - x1);\n\n if (0 <= x3 && x3 <= 5000 && 0 <= y3 && y3 <= 5000 &&\n 0 <= x4 && x4 <= 5000 && 0 <= y4 && y4 <= 5000) {\n if (point_set.count(encode(x3, y3)) && point_set.count(encode(x4, y4))) {\n int dist = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);\n ans = max(ans, dist);\n }\n }\n }\n }\n\n cout << ans << endl;\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 510, "memory_kb": 3284, "score_of_the_acc": -0.0949, "final_rank": 3 }, { "submission_id": "aoj_0518_10539551", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int n;\n // n==0 で終了\n while ( (cin >> n) && n ) {\n vector<pair<int,int>> v(n);\n // 都市の座標を読み込み\n for (auto& p : v) {\n cin >> p.first >> p.second;\n }\n // 二分探索での検索用にソートしておく\n sort(v.begin(), v.end());\n\n ll ans = 0;\n // すべての点対 (i,j) を試す O(n^2)\n for (int i = 0; i < n - 1; ++i) {\n auto [xi, yi] = v[i];\n for (int j = i + 1; j < n; ++j) {\n auto [xj, yj] = v[j];\n // ベクトル (dx,dy) = v[i] -> v[j]\n ll dx = ll(xj) - xi;\n ll dy = ll(yj) - yi;\n // 90° 回転させたベクトルを足し引きして正方形の他の頂点を得る\n // 回転方向１： (dx,dy) → ( dy, -dx )\n pair<int,int> p1{ int(xi + dy), int(yi - dx) };\n pair<int,int> p2{ int(xj + dy), int(yj - dx) };\n if (binary_search(v.begin(), v.end(), p1)\n && binary_search(v.begin(), v.end(), p2)) {\n ans = max(ans, dx*dx + dy*dy);\n }\n // 回転方向２： (dx,dy) → ( -dy, dx )\n p1 = { int(xi - dy), int(yi + dx) };\n p2 = { int(xj - dy), int(yj + dx) };\n if (binary_search(v.begin(), v.end(), p1)\n && binary_search(v.begin(), v.end(), p2)) {\n ans = max(ans, dx*dx + dy*dy);\n }\n }\n }\n\n // 答えを出力（最大辺長の自乗）\n cout << ans << \"\\n\";\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 1280, "memory_kb": 3584, "score_of_the_acc": -0.2835, "final_rank": 13 }, { "submission_id": "aoj_0518_10339094", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n==0) break;\n \n vector<pair<int,int>> points(n);\n set<pair<int,int>> point_set;\n rep(i,n){\n cin >> points[i].first >> points[i].second;\n point_set.insert(points[i]);\n }\n \n int res=0;\n rep(i,n){\n for(int j=i+1;j<n;j++){\n int a=points[i].first,b=points[i].second;\n int c=points[j].first,d=points[j].second;\n int dx=c-a,dy=d-b;\n\n if(point_set.count({a-dy,b+dx}) && point_set.count({c-dy,d+dx})){\n res=max(res,dx*dx+dy*dy);\n }\n if(point_set.count({a+dy,b-dx}) && point_set.count({c+dy,d-dx})){\n res = max(res,dx*dx+dy*dy);\n }\n }\n }\n cout << res << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 1570, "memory_kb": 3224, "score_of_the_acc": -0.3497, "final_rank": 15 }, { "submission_id": "aoj_0518_9843649", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;++i)\n#define ALL(a) (a).begin(),(a).end()\nconst int inf = INT_MAX;\nusing ll = long long;\nconst ll INF = 1e18;\nusing P = pair<int,int>;\nstruct Edge{\n int to;\n ll cost;\n Edge(int to,ll cost):to(to),cost(cost){}\n};\nusing kEdge = pair<int,pair<int,int>>;\nusing Graph = vector<vector<int>>;\nusing WeightedGraph = vector<vector<Edge>>;\n\n\nstruct UnionFind{\n vector<int> par,rank,siz;\n UnionFind(int n) : par(n,-1),rank(n,0),siz(n,1){ }\n\n int root(int x){\n if(par[x]==-1)return x;\n else return par[x]=root(par[x]);\n }\n\n bool issame(int x,int y){\n return root(x)==root(y);\n }\n\n bool unite(int x,int y){\n int rx=root(x),ry=root(y);\n if(rx==ry)return false;\n if(rank[rx]<rank[ry])swap(rx,ry);\n par[ry]=rx;\n if(rank[rx]==rank[ry])rank[rx]++;\n siz[rx]+=siz[ry];\n return true;\n }\n\n int size(int x){\n return siz[root(x)];\n }\n};\n\nclass SegmentTree{\n public:\n vector<int>dat;\n int siz=1;\n\n void init(int N){\n siz=1;\n while(siz<N)siz*=2;\n dat=vector<int>(2*siz,0);\n }\n\n void update(int pos,int x){\n pos=pos+siz-1;\n dat[pos]=x;\n while(pos>=2){\n pos/=2;\n dat[pos]=max(dat[pos*2],dat[pos*2+1]);\n }\n }\n\n int query(int l,int r,int a,int b,int u){\n if(r<=a || b<=l)return -100000000;\n if(l<=a && b<=r)return dat[u];\n int m=(a+b)/2;\n int AnsL=query(l,r,a,m,u*2);\n int AnsR=query(l,r,m,b,u*2+1);\n return max(AnsL,AnsR);\n }\n};\n\ntemplate<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}\ntemplate<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}\n\nvector<int>dxs={1,0,-1,0};\nvector<int>dys={0,1,0,-1};\n\n//fixed << setprecision(10)\n//A[i].erase(unique(ALL(A[i])),A[i].end());\n\nint main(){\n int n;\n while(cin >> n){\n if(n==0)break;\n vector<int>x(n),y(n);\n rep(i,n)cin >> x[i] >> y[i];\n\n vector<vector<bool>>g(6000,vector<bool>(6000,false));\n rep(i,n)g[x[i]][y[i]]=true;\n\n auto check=[&](int p,int q)->bool{\n if(p<0 || p>=6000 || q<0 || q>=6000)return false;\n return g[p][q];\n };\n\n int ans=0;\n rep(i,n){\n for(int j=i+1;j<n;j++){\n int dx=x[j]-x[i],dy=y[j]-y[i];\n if(check(x[j]-dy,y[j]+dx) && check(x[i]-dy,y[i]+dx)){\n chmax(ans,dx*dx+dy*dy);\n }\n if(check(x[j]+dy,y[j]-dx) && check(x[i]+dy,y[i]-dx)){\n chmax(ans,dx*dx+dy*dy);\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 8176, "score_of_the_acc": -0.0532, "final_rank": 1 }, { "submission_id": "aoj_0518_9736429", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nconst int MAX_N = 3e3 + 10;\nint n;\nbool p[5005][5005];\nint px[MAX_N];\nint py[MAX_N];\n\n\nint main(){\n while(cin >> n){\n if(n == 0)break;\n int ans = 0;\n memset(p, 0, sizeof(p));\n for(int i = 0; i < n; i++) {\n cin >> px[i] >> py[i];\n p[px[i]][py[i]] = 1;\n }\n\n for(int i = 0; i < n; i++)\n for(int j = i + 1; j < n; j++) {\n int dx = px[i] - px[j], dy = py[i] - py[j];\n int x1 = px[i] - dy, y1 = py[i] + dx;\n int x2 = px[j] - dy, y2 = py[j] + dx;\n if (0 <= x1 && x1 <= 5000 && 0 <= y1 && y1 <= 5000 && p[x1][y1] &&\n 0 <= x2 && x2 <= 5000 && 0 <= y2 && y2 <= 5000 && p[x2][y2]) {\n ans = max(ans, dx * dx + dy * dy);\n }\n\n int x3 = px[i] + dy, y3 = py[i] - dx;\n int x4 = px[j] + dy, y4 = py[j] - dx;\n if (0 <= x3 && x3 <= 5000 && 0 <= y3 && y3 <= 5000 && p[x3][y3] &&\n 0 <= x4 && x4 <= 5000 && 0 <= y4 && y4 <= 5000 && p[x4][y4]) {\n ans = max(ans, dx * dx + dy * dy);\n }\n }\n\n cout << ans << '\\n';\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 210, "memory_kb": 27548, "score_of_the_acc": -0.27, "final_rank": 12 }, { "submission_id": "aoj_0518_8977406", "code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n if (x < 0) { cout << (i64)(x); }\n else { cout << (u64)(x); }\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll n, x, y;\n cin >> n;\n if (n == 0) return 1;\n set<pi> s;\n rep(n) {\n cin >> x >> y;\n s.emplace(mp(x, y));\n }\n ll ans = 0;\n auto i = s.begin();\n while (i != s.end()) {\n auto [xi, yi] = *i;\n i++;\n if (i == s.end()) break;\n auto j = i;\n for ( ; j != s.end(); j++) {\n auto [xj, yj] = *j;\n if (s.count(mp(xj-yj+yi, yj+xj-xi)) and s.count(mp(xi-yj+yi, yi+xj-xi))) {\n ll xx = xi - xj;\n ll yy = yi - yj;\n chmax(ans, xx*xx + yy*yy);\n }\n }\n }\n print(ans);\n return 0;\n}", "accuracy": 1, "time_ms": 960, "memory_kb": 3500, "score_of_the_acc": -0.2055, "final_rank": 8 }, { "submission_id": "aoj_0518_7082709", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n\n\n\nint main(){\n while(1){\n int N;\n cin>>N;\n if(N==0)return 0;\n\n set<pair<int,int>> S;\n vector<pair<int,int>> P(N);\n for(int i=0;i<N;i++){\n cin>>P[i].first>>P[i].second;\n S.insert(P[i]);\n }\n int an=0;\n for(int i=0;i<N;i++)for(int j=i+1;j<N;j++){\n int dx=P[j].first-P[i].first;\n int dy=P[j].second-P[i].second;\n int nx=P[j].first-dy;\n int ny=P[j].second+dx;\n if(!S.count({nx,ny}))continue;\n nx-=dx;\n ny-=dy;\n if(!S.count({nx,ny}))continue;\n an=max(an,dx*dx+dy*dy);\n }\n cout<<an<<endl;\n //return 0;\n\n\n\n\n }\n}", "accuracy": 1, "time_ms": 850, "memory_kb": 3512, "score_of_the_acc": -0.1792, "final_rank": 7 }, { "submission_id": "aoj_0518_6824317", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define all(x) (x).begin(), (x).end()\nusing namespace std;\ntypedef long long ll;\nint main(void)\n{\n while (true)\n {\n int n; cin >> n; if (n == 0) break;\n vector<pair<int, int>> p(n);\n rep(i, n) cin >> p.at(i).first >> p.at(i).second;\n sort(all(p));\n int ans = 0;\n rep(i, n)for(int j=i+1;j<n;j++)\n {\n pair<int, int> a = {p[i].first, p[i].second}, b = {p[j].first, p[j].second};\n pair<int, int> q = {b.first - b.second + a.second, b.second + b.first - a.first}, r = {a.first - b.second + a.second, a.second + b.first - a.first};\n if (binary_search(all(p), q) && binary_search(all(p), r))\n {\n ans = max(ans, (int)pow(a.first-b.first, 2) + (int)pow(a.second-b.second, 2));\n }\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 660, "memory_kb": 3360, "score_of_the_acc": -0.1318, "final_rank": 5 }, { "submission_id": "aoj_0518_6740148", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing pii = pair<int, int>;\n\npii add(pii a, pii b) {\n return {a.first + b.first, a.second + b.second};\n}\n\npii diff(pii a, pii b) {\n return {a.first - b.first, a.second - b.second};\n}\n\nint dot(pii a) {\n return a.first*a.first + a.second*a.second;\n}\n\nbool judge(pii a) {\n int x = a.first, y = a.second;\n bool res = true;\n if ((x + y) & 1) res = false;\n if (abs(x - y) & 1) res = false;\n if (abs(-x + y) & 1) res = false;\n return res;\n}\n\nvoid out(pii a) {\n cout << a.first << ' ' << a.second << endl;\n}\n\nint solve(int n) {\n vector<int> xs(n), ys(n);\n for (int i = 0 ; i < n ; i++) cin >> xs[i] >> ys[i];\n set<pii> st;\n for (int i = 0 ; i < n ; i++) st.emplace(xs[i], ys[i]);\n\n int res = 0;\n for (int i = 0 ; i < n ; i++) for (int j = 0 ; j < n ; j++) {\n if (i == j) continue;\n int vecx = xs[j] - xs[i], vecy = ys[j] - ys[i];\n if (!judge({vecx, vecy})) continue;\n pii a = add(make_pair(xs[i], ys[i]), {(vecx + vecy)/2, (-vecx + vecy)/2});\n pii b = add(make_pair(xs[i], ys[i]), {(vecx - vecy)/2, (vecx + vecy)/2});\n if (st.count(a) and st.count(b)) {\n int s = dot(diff(make_pair(xs[i], ys[i]), a));\n if (s > res) res = s;\n }\n }\n \n return res;\n}\n\nint main() {\n while(1) {\n int n; cin >> n;\n if (!n) break;\n cout << solve(n) << endl;\n }\n}", "accuracy": 1, "time_ms": 1200, "memory_kb": 3308, "score_of_the_acc": -0.2614, "final_rank": 10 }, { "submission_id": "aoj_0518_6718911", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing P = pair<int, int>;\nusing VP = vector<P>;\nusing Long = long long;\n\n// 面積計算\nLong area(VP& v) {\n sort(v.begin(), v.end());\n int max_x = 0, max_y = 0;\n int min_x = 50000, min_y = 50000;\n\n for (int i = 0; i < 4; ++i) {\n max_x = max(max_x, v[i].first);\n min_x = min(min_x, v[i].first);\n max_y = max(max_y, v[i].second);\n min_y = min(min_y, v[i].second);\n }\n Long outer_area = (max_x - min_x) * (max_y - min_y);\n Long triangle =\n abs(v[0].first - v[1].first) * abs(v[0].second - v[1].second);\n return (outer_area - triangle * 4 / 2);\n}\n// めぐる式二分探索\nbool search(const VP& v, const P& x) {\n int left = -1;\n int right = (int)v.size();\n while (right - left > 1) {\n int mid = (left + right) / 2;\n if (v[mid] == x) {\n return true;\n } else if (v[mid] > x) {\n right = mid;\n } else {\n left = mid;\n }\n }\n return false;\n}\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n while (true) {\n int n;\n cin >> n;\n if (n == 0) break;\n\n VP p;\n\n for (int i = 0; i < n; ++i) {\n int x, y;\n cin >> x >> y;\n p.push_back(make_pair(x, y));\n }\n\n sort(p.begin(), p.end());\n Long max_area = 0;\n for (int i = 0; i < n; ++i) {\n for (int j = i + 1; j < n; ++j) {\n int diff_x = abs(p[i].first - p[j].first);\n int diff_y = abs(p[i].second - p[j].second);\n P left_down =\n make_pair(p[i].first - diff_y, p[i].second + diff_x);\n if (search(p, left_down)) {\n P left_up =\n make_pair(p[j].first - diff_y, p[j].second + diff_x);\n if (search(p, left_up)) {\n VP v = {p[i], p[j], left_down, left_up};\n max_area = max(max_area, area(v));\n }\n }\n }\n }\n cout << max_area << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 650, "memory_kb": 3416, "score_of_the_acc": -0.13, "final_rank": 4 }, { "submission_id": "aoj_0518_6542434", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define REP(i,n) for(int i=0;i<int(n);i++)\ntypedef long long ll;\ntypedef pair<int,int> P;\n\n\nint main(void){\n\tint i,j,k;\n\n\tcin.tie(0); ios_base::sync_with_stdio(false);\n\n\twhile(1){\n\tint N;\n\tcin >> N;\n\tif(N==0) break;\n\tvector<P> v(N);\n\tset<P> s;\n\tfor(i=0;i<N;i++){\n\t\tcin >> v[i].first >> v[i].second;\n\t\ts.insert(v[i]);\n\t}\n\n\tint mx=0;\n\tfor(i=0;i<N;i++){\n\t\tfor(j=i+1;j<N;j++){\n\t\t\tint x1=v[i].first,y1=v[i].second,x2=v[j].first,y2=v[j].second;\n\t\t\tP q1=make_pair(y1-y2+x1,x2-x1+y1),p1=make_pair(y1-y2+x2,x2-x1+y2);\n\t\t\tP q2=make_pair(y2-y1+x1,x1-x2+y1),p2=make_pair(y2-y1+x2,x1-x2+y2);\n\t\t\tif((s.count(p1) && s.count(q1)) || (s.count(p2) && s.count(q2))) mx=max(mx,(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\n\n\t\t}\n\t}\n\n\tcout << mx << endl;\n\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 1720, "memory_kb": 3280, "score_of_the_acc": -0.3864, "final_rank": 17 }, { "submission_id": "aoj_0518_6324334", "code_snippet": "#include <stdio.h>\n#include <unordered_set>\nusing namespace std;\n\nint point[4096][2];\nunordered_set<int> st;\n\nint main(void) {\n int n, r, x, y, dx, dy;\n for (int tt = 0;; tt++) {\n scanf(\"%d\", &n);\n if (n == 0) break;\n r = 0;\n for (int i = 0; i < n; i++) {\n scanf(\"%d %d\", &point[i][0], &point[i][1]);\n st.insert((point[i][0] << 16) | point[i][1]);\n }\n for (int i = 0; i < n; i++) {\n x = point[i][0];\n y = point[i][1];\n for (int j = i + 1; j < n; j++) {\n dx = point[j][0] - x;\n dy = point[j][1] - y;\n if (st.find(((x + dy) << 16) | (y - dx)) != st.end() &&\n st.find(((x + dx + dy) << 16) | (y - dx + dy)) != st.end()) {\n if (dx * dx + dy * dy > r) r = dx * dx + dy * dy;\n }\n if (st.find(((x - dy) << 16) | (y + dx)) != st.end() &&\n st.find(((x + dx - dy) << 16) | (y + dx + dy)) != st.end()) {\n if (dx * dx + dy * dy > r) r = dx * dx + dy * dy;\n }\n }\n }\n printf(\"%d\\n\", r);\n st.clear();\n }\n return 0;\n}", "accuracy": 1, "time_ms": 770, "memory_kb": 2960, "score_of_the_acc": -0.1543, "final_rank": 6 }, { "submission_id": "aoj_0518_6324326", "code_snippet": "#include <stdio.h>\n#include <set>\nusing namespace std;\n\nint point[4096][2];\nset<pair<int, int>> st;\n\nint main(void) {\n int n, r, x, y, dx, dy;\n pair<int, int> p1, p2;\n for (int tt = 0;; tt++) {\n scanf(\"%d\", &n);\n if (n == 0) break;\n r = 0;\n for (int i = 0; i < n; i++) {\n scanf(\"%d %d\", &point[i][0], &point[i][1]);\n st.insert(pair<int, int>(point[i][0], point[i][1]));\n }\n for (int i = 0; i < n; i++) {\n x = point[i][0];\n y = point[i][1];\n for (int j = i + 1; j < n; j++) {\n dx = point[j][0] - x;\n dy = point[j][1] - y;\n p1.first = x + dy;\n p1.second = y - dx;\n p2.first = x + dx + dy;\n p2.second = y + dy - dx;\n if (st.find(p1) != st.end() &&\n st.find(p2) != st.end()) {\n if (dx * dx + dy * dy > r) r = dx * dx + dy * dy;\n }\n p1.first = x - dy;\n p1.second = y + dx;\n p2.first = x + dx - dy;\n p2.second = y + dx + dy;\n if (st.find(p1) != st.end() &&\n st.find(p2) != st.end()) {\n if (dx * dx + dy * dy > r) r = dx * dx + dy * dy;\n }\n }\n }\n printf(\"%d\\n\", r);\n st.clear();\n }\n return 0;\n}", "accuracy": 1, "time_ms": 1550, "memory_kb": 3024, "score_of_the_acc": -0.3429, "final_rank": 14 }, { "submission_id": "aoj_0518_6324316", "code_snippet": "#include <stdio.h>\n#include <set>\nusing namespace std;\n\nint point[4096][2];\nset<pair<int, int>> st;\n\nint main(void) {\n int n, r, x, y, dx, dy;\n for (int tt = 0;; tt++) {\n scanf(\"%d\", &n);\n if (n == 0) break;\n r = 0;\n for (int i = 0; i < n; i++) {\n scanf(\"%d %d\", &point[i][0], &point[i][1]);\n st.insert(pair<int, int>(point[i][0], point[i][1]));\n }\n for (int i = 0; i < n; i++) {\n x = point[i][0];\n y = point[i][1];\n for (int j = i + 1; j < n; j++) {\n dx = point[j][0] - x;\n dy = point[j][1] - y;\n if (st.find(make_pair(x + dy, y - dx)) != st.end() &&\n st.find(make_pair(x + dx + dy, y + dy - dx)) != st.end()) {\n if (dx * dx + dy * dy > r) r = dx * dx + dy * dy;\n }\n if (st.find(make_pair(x - dy, y + dx)) != st.end() &&\n st.find(make_pair(x + dx - dy, y + dx + dy)) != st.end()) {\n if (dx * dx + dy * dy > r) r = dx * dx + dy * dy;\n }\n }\n }\n printf(\"%d\\n\", r);\n st.clear();\n }\n return 0;\n}", "accuracy": 1, "time_ms": 1610, "memory_kb": 2956, "score_of_the_acc": -0.3566, "final_rank": 16 }, { "submission_id": "aoj_0518_6157866", "code_snippet": "#include \"bits/stdc++.h\"\n\n#define REP(i,num) for(ll i=0;i<(num);++i)\n#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))\n#define LOOP(i) while(i--)\n#define ALL(c) c.begin(),c.end()\n#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;\n#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}\n\nusing namespace std;\n//using ll = long long;\nusing ll = int;\nusing ull = unsigned long long;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\n\nconstexpr ll atcoder_mod = 1e9+7;\n\ntemplate<typename T=ll>\nT in(){ T x; cin >> x; return (x); }\ntemplate<typename T=ll,typename C=vector<T>>\nC vecin(int N){ C x(N);REP(i,N){ x[i]=in<T>(); }return x; }\ntemplate<typename T=ll,size_t N>\narray<T,N> arrin(){array<T,N> x;REP(i,N){ x[i]=in<T>(); }return x;}\n\nvoid vout(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid vout(Head&& h,Tail&&... t){ cout << ' ' << h;vout(forward<Tail>(t)...); }\nvoid out(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid out(Head&& h,Tail&&... t){ cout << h;vout(forward<Tail>(t)...); }\n\ntemplate<typename T>\nbool chmax(T& a,T b){ if(a<b){ a=b;return true; }return false; }\ntemplate<typename T>\nbool chmin(T& a,T b){ if(a>b){ a=b;return true; }return false; }\n\nll search(vvll& M,pair<ll,ll>& start,pair<ll,ll>& end){\n\tll area=0;\n\tpair<ll,ll> vect(end.first-start.first,end.second-start.second);\n\n\tbool exist = true;\n\tpair<ll,ll> now(end);\n\tfor(int i=0;i<3;i++){\n\t\tswap(vect.first,vect.second);\n\t\tvect.second = -vect.second;\n\t\tpair<ll,ll> next(now.first+vect.first,now.second+vect.second);\n\t\tif(next.first<0 || next.second<0 || next.first>5000 || next.second>5000 || (!M[next.first][next.second])){\n\t\t\texist = false;\n\t\t\tbreak;\n\t\t}\n\t\tnow = next;\n\t}\n\n\tif(exist) area = (end.first-start.first)*(end.first-start.first)+(end.second-start.second)*(end.second-start.second);\n\n\treturn area;\n}\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(10);\n\n\twhile(true){\n\t\tll N=in();\n\t\tif(!N) break;\n\t\t\n\t\tvvll M(5001,vll(5001,0));\n\t\tvector<pair<ll,ll>> P(N);\n\t\tREP(i,N){\n\t\t\tP[i].first=in(),P[i].second=in();\n\t\t\tM[P[i].first][P[i].second]=1;\n\t\t}\n\n\t\tll maxA=0;\n\t\tREP(i,N){\n\t\t\tFOR(j,i+1,N){\n\t\t\t\tmaxA = max(maxA,search(M,P[i],P[j]));\n\t\t\t\tmaxA = max(maxA,search(M,P[j],P[i]));\n\t\t\t}\n\t\t}\n\t\tout(maxA);\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 650, "memory_kb": 101048, "score_of_the_acc": -1.1253, "final_rank": 19 }, { "submission_id": "aoj_0518_5956244", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\ntypedef long long ll;\ntypedef pair<long long, long long> P;\nconst long long INF = 1e18;\nconst ll MOD = INF;\ntemplate <typename T>\nvoid input_arr(vector<T>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i];\n\t}\n}\ntemplate <typename T, typename Q>\nvoid input_arr(vector<pair<T, Q>>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i].first >> A[i].second;\n\t}\n}\ntemplate <typename T>\nvoid input_arr(vector<vector<T>>& A, ll H, ll W) {\n\tfor (ll i = 0; i < H; i++) {\n\t\tfor (ll j = 0; j < W; j++) {\n\t\t\tcin >> A[i][j];\n\t\t}\n\t}\n}\nint main() {\n\tll N; cin >> N;\n\twhile (N != 0) {\n\t\tvector<P>A(N); input_arr(A, N);\n\t\tvector<vector<bool>>Map(6000, vector<bool>(6000, false));\n\t\tfor (ll i = 0; i < N; i++) {\n\t\t\tMap[A[i].first][A[i].second] = true;\n\t\t}\n\t\tll ans = 0;\n\t\tfor (ll i = 0; i < N; i++) {\n\t\t\tfor (ll j = 0; j < N; j++) {\n\t\t\t\tif (i == j) continue;\n\t\t\t\tll dx = A[i].first - A[j].first;\n\t\t\t\tll dy = A[i].second - A[j].second;\n\t\t\t\tP point1 = {A[i].first - dy, A[i].second + dx};\n\t\t\t\tP point2 = {A[j].first - dy, A[j].second + dx};\n\t\t\t\tif (point1.first < 0 || point1.second < 0 || point2.first < 0 || point2.second < 0) continue;\n\t\t\t\tif (point1.first > 5000 || point1.second > 5000 || point2.first > 5000 || point2.second > 5000) continue;\n\t\t\t\tif (Map[point1.first][point1.second] && Map[point2.first][point2.second]) {\n\t\t\t\t\tll S = (abs(dx) + abs(dy)) * (abs(dx) + abs(dy));\n\t\t\t\t\tS -= 2 * abs(dx) * abs(dy);\n\t\t\t\t ans = max(ans, S);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t\tcin >> N;\n\t}\n}", "accuracy": 1, "time_ms": 180, "memory_kb": 8196, "score_of_the_acc": -0.0655, "final_rank": 2 }, { "submission_id": "aoj_0518_5896519", "code_snippet": "#include<cstdio>\n#include<cstdlib>\n\nusing namespace std;\n\nint main(){\n\tbool (*map)[5010] = (bool(*)[5010])malloc(5010*5010*sizeof(bool));\n\tint n,x[3010],y[3010],dx,dy,best=0;\n\twhile(1){\n\t\tbest=0;\n\t\tscanf(\"%d\",&n);\n\t\tif(n==0) break;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tscanf(\"%d %d\",&x[i],&y[i]);\n\t\t\tmap[x[i]][y[i]]=true;\n\t\t}\n\t\tfor(int i=0;i<n-1;i++){\n\t\t\tfor(int j=i+1;j<n;j++){\n\t\t\t\tdx=x[j]-x[i];\n\t\t\t\tdy=y[j]-y[i];\n\t\t\t\tif(y[i]-dx>=0&&y[j]-dx>=0&&x[i]+dy>=0&&x[j]+dy>=0){\n\t\t\t\t\tif(y[i]-dx<=5000&&y[j]-dx<=5000&&x[i]+dy<=5000&&x[j]+dy<=5000){\n\t\t\t\t\t\tif(map[x[i]+dy][y[i]-dx]&&map[x[j]+dy][y[j]-dx]){\n\t\t\t\t\t\t\tif(best<dx*dx+dy*dy)best=dx*dx+dy*dy;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tif(x[i]-dy>=0&&x[j]-dy>=0&&y[i]+dx>=0&&y[j]+dx>=0){\n\t\t\t\t\tif(x[i]-dy<=5000&&x[j]-dy<=5000&&y[i]+dx<=5000&&y[j]+dx<=5000){\n\t\t\t\t\t\tif(map[x[i]-dy][y[i]+dx]&&map[x[j]-dy][y[j]+dx]){\n\t\t\t\t\t\t\tif(best<dx*dx+dy*dy)best=dx*dx+dy*dy;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",best);\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 210, "memory_kb": 22372, "score_of_the_acc": -0.2172, "final_rank": 9 }, { "submission_id": "aoj_0518_5720741", "code_snippet": "#include<iostream>\n#include<set>\n#include<cmath>\n\nusing namespace std;\n\nint main()\n{\n\twhile (true)\n\t{\n\t\tint n;\n\t\tcin >> n;\n\t\tif (n == 0)\n\t\t\tbreak;\n\t\tint x, y;\n\t\tset<pair<int, int>> points;\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tcin >> x >> y;\n\t\t\tpoints.insert(make_pair(x, y));\n\t\t}\n\t\tint ans = 0;\n\t\tfor (auto iter1 = points.begin(); iter1 != points.end(); iter1++)\n\t\t{\n\t\t\tauto iter2 = iter1;\n\t\t\twhile (++iter2 != points.end())\n\t\t\t{\n\t\t\t\tint x1 = iter1->first;\n\t\t\t\tint y1 = iter1->second;\n\t\t\t\tint x2 = iter2->first;\n\t\t\t\tint y2 = iter2->second;\n\t\t\t\tint dx = x2 - x1;\n\t\t\t\tint dy = y2 - y1;\n\t\t\t\tfor (int i = 0; i <= 1; i++)\n\t\t\t\t{\n\t\t\t\t\tint x3 = x1 + int(pow(-1, i)) * dy;\n\t\t\t\t\tint y3 = y1 - int(pow(-1, i)) * dx;\n\t\t\t\t\tif (points.count(make_pair(x3, y3)) == 0)\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\tint x4 = x2 + x3 - x1;\n\t\t\t\t\tint y4 = y2 + y3 - y1;\n\t\t\t\t\tif (points.count(make_pair(x4, y4)) != 0)\n\t\t\t\t\t\tans = max(ans, dx * dx + dy * dy);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\n\t//system(\"pause\");\n}", "accuracy": 1, "time_ms": 2220, "memory_kb": 3276, "score_of_the_acc": -0.5069, "final_rank": 18 }, { "submission_id": "aoj_0518_5612783", "code_snippet": "#include<stdio.h>\n#include<string.h>\n#include<iostream>\n\nint x[3000];\nint y[3000];\nbool coordiate[5001][5001];\nint n;\n\nint max(int a, int b)\n{\n\treturn a > b ? a : b;\n}\n\nbool check(int y1, int x1)\n{\n\tif (y1 >= 0 && y1 <= 5000 &&\n\t\tx1 >= 0 && x1 <= 5000)\n\t{\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nint main()\n{\n\tint dx, dy;\n\tint area;\n\twhile (1)\n\t{\n\t\tstd::cin >> n;\n\t\tif (n == 0) break;\n\t\tmemset(coordiate, 0, sizeof(coordiate));\n\t\tarea = 0;\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tstd::cin >> x[i] >> y[i];\n\t\t\tcoordiate[y[i]][x[i]] = true;\n\t\t}\n\n\t\tfor (int i = 0; i < n; i++)\n\t\t{\n\t\t\tfor (int j = i + 1; j < n; j++)\n\t\t\t{\n\t\t\t\tdx = x[j] - x[i];\n\t\t\t\tdy = y[j] - y[i];\n\t\t\t\tif (check(y[i] - dx, x[i] + dy) && coordiate[y[i] - dx][x[i] + dy] == true &&\n\t\t\t\t\tcheck(y[j] - dx, x[j] + dy) && coordiate[y[j] - dx][x[j] + dy] == true)\n\t\t\t\t{\n\t\t\t\t\tarea = max(area, dx * dx + dy * dy);\n\t\t\t\t}\n\n\t\t\t\tif (check(y[i] + dx, x[i] - dy) && coordiate[y[i] + dx][x[i] - dy] == true &&\n\t\t\t\t\tcheck(y[j] + dx, x[j] - dy) && coordiate[y[j] + dx][x[j] - dy] == true)\n\t\t\t\t{\n\t\t\t\t\tarea = max(area, dx * dx + dy * dy);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tstd::cout << area << std::endl;\n\t}\n}", "accuracy": 1, "time_ms": 210, "memory_kb": 27524, "score_of_the_acc": -0.2697, "final_rank": 11 } ]
aoj_0526_cpp
船旅 問題 JOI国には，n 島の島があり，各島には 1 から n までの番号が付けられている．現在，JOI国では各島の間を結ぶ航路網の整備が進んでいる． あなたは，船舶の切符を扱っているチケットセンターに勤務している．JOI国には船舶を使って，できる限り安価に，島と島の間を旅行したいと考えている人が沢山おり，彼らは，出発地と目的地を注文票に記入して，あなたのところに送ってくる． あなたの仕事は，客から注文票を受け取ったらすぐに，いくつかの船舶を乗り継いで，出発地と目的地を結ぶ航路の中で，もっとも安価な運賃を計算し，客に伝えることである． ただし，旅程によっては，船舶を使って旅行することが出来ない場合もある．そのときは『船舶を使って旅行することが出来ない』と客に伝える必要がある．また，JOI国では，島と島の間を結ぶ新しい船舶が，次々と運航を開始しており，あなたには，その情報が随時伝えられる．客に返事をする際には，最新の情報に留意しなければならない． 入力として，客の注文票や新たに運航を開始した船舶の運航情報が与えられたときに，客への返事を求めるプログラムを作成せよ． なお，入力例１と出力例１に対する実行状況を，図１として図示している． 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる． 入力の 1 行目には2つの整数 n, k (1 ≤ n ≤ 100, 1 ≤ k ≤ 5000) が書かれている．これは，島の数が n 島で，入力が k + 1 行からなることを表す． i + 1 行目 (1 ≤ i ≤ k) には， 3 個または 4 個の整数が空白を区切りとして書かれている． 最初の数字が 0 のとき，この行は客の注文票を表す． この行には3個の整数 0, a, b (1 ≤ a ≤ n, 1 ≤ b ≤ n, a ≠ b) が空白を区切りとして書かれている． これは，客が，島 a を出発地とし島 b を目的地とするような注文票を送ってきたことを表す． 最初の数字が 1 のとき，この行は新たに運航を開始した船舶の運航情報を表す． この行には 4 個の整数 1, c, d, e (1 ≤ c ≤ n, 1 ≤ d ≤ n, c ≠ d, 1 ≤ e ≤ 1000000) が書かれている． これは島 c と島 d を往復する船舶が新たに運航を開始し，この船舶の島 c から島 d への運賃と，島 d から島 c への運賃が，共に e であることを表す． この行以降の注文票に対しては，この船舶も考慮して返事をしなければならない． 最初の段階では，船舶は一隻も運航していないものとする．入力のうち，船舶の運航情報を表す行は 1000 行以下である．また，島と島の間に，複数の船舶が運航することがあることに注意せよ． n, k がともに 0 のとき入力の終了を示す. データセットの数は 5 を超えない． 出力 データセットごとに以下の形式で出力する． 入力のうち，注文票を表す行の数を m とおく． 各データセットの出力は m 行からなり， i 行目(1 ≤ i ≤ m)には， i 番目の注文票に対する返事を表す整数を書く． すなわち， i 番目の注文票の出発地と目的地の間を，いくつかの船舶を乗り継いで旅行することが可能ならば，その運賃の合計の最小値を書く．旅行することが不可能ならば，-1 を出力する． 入出力例 入力例 3 8 1 3 1 10 0 2 3 1 2 3 20 1 1 2 5 0 3 2 1 1 3 7 1 2 1 9 0 2 3 5 16 1 1 2 343750 1 1 3 3343 1 1 4 347392 1 1 5 5497 1 2 3 123394 1 2 4 545492 1 2 5 458 1 3 4 343983 1 3 5 843468 1 4 5 15934 0 2 1 0 4 1 0 3 2 0 4 2 0 4 3 0 5 3 0 0 出力例 -1 15 12 5955 21431 9298 16392 24774 8840 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0526_10851566", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconstexpr int INF = 1e9;\n\nint main() {\n int n, k;\n while(cin >> n >> k, n) {\n vector<vector<int>> d(n, vector<int>(n, INF));\n for(int i=0; i<n; ++i) {\n d[i][i] = 0;\n }\n for(int i=0; i<k; ++i) {\n int a;\n cin >> a;\n if(a == 0) {\n int b, c;\n cin >> b >> c;\n b--; c--;\n cout << (d[b][c] == INF ? -1 : d[b][c]) << endl;\n } else {\n int b, c, e;\n cin >> b >> c >> e;\n b--; c--;\n if(d[b][c] <= e) {\n continue;\n }\n for(int j=0; j<n; ++j) {\n for(int l=0; l<n; ++l) {\n d[j][l] = min(d[j][l], min(d[j][b] + d[c][l], d[j][c] + d[b][l]) + e);\n }\n }\n }\n }\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3416, "score_of_the_acc": -0.0108, "final_rank": 3 }, { "submission_id": "aoj_0526_10339204", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n\nvector<long long> dijkstra(int v,int r,const vector<vector<pair<int,int>>>& graph){\n const long long INF=LLONG_MAX;\n vector<long long> dist(v,INF);\n dist[r]=0;\n\n priority_queue<pair<long long,int>,vector<pair<long long,int>>,greater<>> pq;\n pq.push({0,r});\n\n while(!pq.empty()){\n auto [current_dist,u]=pq.top();\n pq.pop();\n if(current_dist>dist[u]) continue;\n \n for(auto& [to,weight]:graph[u]){\n long long new_dist=current_dist+weight;\n if(new_dist<dist[to]){\n dist[to]=new_dist;\n pq.push({new_dist,to});\n }\n }\n }\n return dist;\n}\n//計算量はO((V+E)logV)\n\nint main(){\n while(1){\n int n,k;\n cin >> n >> k;\n if(n==0 && k==0) break;\n\n vector<vector<pair<int,int>>> graph(n);\n rep(i,k){\n int check;\n cin >> check;\n if(check==0){\n int a,b;\n cin >> a >> b;\n a--;b--;\n vector<long long> dist=dijkstra(n,a,graph);\n if(dist[b]==LLONG_MAX){\n cout << -1 << endl;\n }\n else{\n cout << dist[b] << endl;\n }\n }\n else{\n int c,d,e;\n cin >> c >> d >> e;\n c--;d--;\n graph[c].push_back({d,e});\n graph[d].push_back({c,e});\n }\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 3392, "score_of_the_acc": -0.1249, "final_rank": 9 }, { "submission_id": "aoj_0526_10308145", "code_snippet": "#include <iostream>\n#include <vector>\n#include <queue>\n#include <limits>\n\n\nusing namespace std;\ntypedef long long int ll;\ntypedef vector<ll> vll;\ntypedef vector<vector<ll>> vvll;\n\nconst ll INF = numeric_limits<ll>::max();\n\nvoid get_fare(ll n, vvll& fares) {\n ll a, b;\n cin >> a >> b;\n\n vll total_fare(n+1, INF);\n queue<ll> bfs_queue;\n bfs_queue.push(a);\n total_fare[a] = 0;\n while(!bfs_queue.empty()) {\n ll current = bfs_queue.front(); bfs_queue.pop();\n for (ll i = 1; i <= n; i++) {\n ll adj_fare = fares[current][i];\n if (adj_fare == INF) continue;\n if (total_fare[i] > adj_fare + total_fare[current]) {\n total_fare[i] = adj_fare + total_fare[current];\n //cout << i << \": \" << total_fare[i] << \" => \" << adj_fare + total_fare[current] << endl;\n bfs_queue.push(i);\n }\n }\n }\n\n if (total_fare[b] == INF) {\n cout << -1 << endl;\n }\n else {\n cout << total_fare[b] << endl;\n }\n}\n\nvoid set_fare(vvll& fares) {\n ll c, d, e;\n cin >> c >> d >> e;\n if (fares[c][d] > e) {\n fares[c][d] = e;\n fares[d][c] = e;\n }\n}\n\nvoid solve(ll n, ll k) {\n vll temp(n+1, INF);\n vvll fares(n+1, temp);\n\n for (ll i = 0; i < k; i++) {\n ll c;\n cin >> c;\n if (c == 0) {\n get_fare(n, fares);\n }\n else {\n set_fare(fares);\n }\n }\n}\n\nint main() {\n ll n, k;\n for (;;) {\n cin >> n >> k;\n if (n == 0 && k == 0) {\n break;\n }\n\n solve(n, k);\n }\n}", "accuracy": 1, "time_ms": 490, "memory_kb": 3148, "score_of_the_acc": -0.791, "final_rank": 18 }, { "submission_id": "aoj_0526_9779131", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;++i)\n#define ALL(a) (a).begin(),(a).end()\nconst int inf = INT_MAX;\nusing ll = long long;\nconst ll INF = 1e18;\nusing P = pair<ll,int>;\nstruct Edge{\n int to;\n ll cost;\n Edge(int to,ll cost):to(to),cost(cost){}\n};\nusing kEdge = pair<int,pair<int,int>>;\nusing Graph = vector<vector<int>>;\nusing WeightedGraph = vector<vector<Edge>>;\n\n\nstruct UnionFind{\n vector<int> par,rank,siz;\n UnionFind(int n) : par(n,-1),rank(n,0),siz(n,1){ }\n\n int root(int x){\n if(par[x]==-1)return x;\n else return par[x]=root(par[x]);\n }\n\n bool issame(int x,int y){\n return root(x)==root(y);\n }\n\n bool unite(int x,int y){\n int rx=root(x),ry=root(y);\n if(rx==ry)return false;\n if(rank[rx]<rank[ry])swap(rx,ry);\n par[ry]=rx;\n if(rank[rx]==rank[ry])rank[rx]++;\n siz[rx]+=siz[ry];\n return true;\n }\n\n int size(int x){\n return siz[root(x)];\n }\n};\n\nclass SegmentTree{\n public:\n vector<int>dat;\n int siz=1;\n\n void init(int N){\n siz=1;\n while(siz<N)siz*=2;\n dat=vector<int>(2*siz,0);\n }\n\n void update(int pos,int x){\n pos=pos+siz-1;\n dat[pos]=x;\n while(pos>=2){\n pos/=2;\n dat[pos]=max(dat[pos*2],dat[pos*2+1]);\n }\n }\n\n int query(int l,int r,int a,int b,int u){\n if(r<=a || b<=l)return -100000000;\n if(l<=a && b<=r)return dat[u];\n int m=(a+b)/2;\n int AnsL=query(l,r,a,m,u*2);\n int AnsR=query(l,r,m,b,u*2+1);\n return max(AnsL,AnsR);\n }\n};\n\ntemplate<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}\ntemplate<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}\n\nvector<int>dxs={1,0,-1,0};\nvector<int>dys={0,1,0,-1};\n\n//fixed << setprecision(10)\n//A[i].erase(unique(ALL(A[i])),A[i].end());\n\nint main(){\n\n int n,k;\n while(cin >> n && cin >> k){\n WeightedGraph g(n);\n rep(i,k){\n int q;\n cin >> q;\n if(q==0){\n int a,b;\n cin >> a >> b;\n a--,b--;\n\n vector<ll>dist(n,INF);\n priority_queue<P,vector<P>,greater<P>> que;\n dist[a]=0;\n que.emplace(0,a);\n\n while(!que.empty()){\n ll d=que.top().first;\n int v=que.top().second;\n que.pop();\n if(d>dist[v])continue;\n for(auto vs:g[v]){\n ll nd=d+vs.cost;\n int to=vs.to;\n if(chmin(dist[to],nd))que.emplace(nd,to);\n }\n }\n\n if(dist[b]==INF)cout << -1 << endl;\n else cout << dist[b] << endl;\n }else{\n int c,d,e;\n cin >> c >> d >> e;\n c--,d--;\n g[c].push_back(Edge(d,e));\n g[d].push_back(Edge(c,e));\n }\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 3200, "score_of_the_acc": -0.1201, "final_rank": 8 }, { "submission_id": "aoj_0526_9666842", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n#define endl \"\\n\"\ntypedef long long ll;\n#define int long long\nconst int INF = 1LL << 55;\nvoid solved() {\n int n, q;\n\n while (cin >> n >> q) {\n if (n == 0 && q == 0) break;\n vector g(n, vector(n, INF));\n\n auto dij = [&](int s) -> vector<int> {\n vector<int> dp(n, INF);\n vector<bool> seen(n, false);\n dp[s] = 0;\n for (int i = 0; i < n; i++) {\n int md = INF;\n int mv = -1;\n for (int v = 0; v < n; v++) {\n if (seen[v]) continue;\n if (dp[v] < md) {\n md = dp[v];\n mv = v;\n }\n }\n if (mv == -1) break;\n seen[mv] = true;\n for (int v = 0; v < n; v++) {\n dp[v] = min(dp[v], dp[mv] + g[mv][v]);\n }\n }\n return dp;\n };\n for (int i = 0; i < q; i++) {\n int k, a, b, w = 0;\n cin >> k >> a >> b;\n --a, --b;\n if (k == 1) {\n cin >> w;\n g[a][b] = min(g[a][b], w);\n g[b][a] = min(g[b][a], w);\n } else {\n const auto &dp = dij(a);\n\n cout << (dp[b] < INF ? dp[b] : -1) << endl;\n }\n }\n }\n}\nsigned main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n /*int t = 1;\n cin >> t;\n while (t--)*/\n solved();\n\n return 0;\n}", "accuracy": 1, "time_ms": 160, "memory_kb": 3404, "score_of_the_acc": -0.2564, "final_rank": 13 }, { "submission_id": "aoj_0526_8973386", "code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n if (x < 0) { cout << (i64)(x); }\n else { cout << (u64)(x); }\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"/opt/library/graph/base.hpp\"\n\ntemplate <typename T>\nstruct Edge {\n ll frm, to;\n T cost;\n ll id;\n};\n\ntemplate <typename T = ll, bool directed = false>\nstruct Graph {\n static constexpr bool is_directed = directed;\n ll N, M;\n using cost_type = T;\n using edge_type = Edge<T>;\n vector<edge_type> edges;\n vi indptr;\n vc<edge_type> csr_edges;\n vc<ll> vc_deg, vc_indeg, vc_outdeg;\n bool prepared;\n\n class OutgoingEdges {\n public:\n OutgoingEdges(const Graph* G, ll l, ll r) : G(G), l(l), r(r) {}\n\n const edge_type* begin() const {\n if (l == r) { return 0; }\n return &G->csr_edges[l];\n }\n\n const edge_type* end() const {\n if (l == r) { return 0; }\n return &G->csr_edges[r];\n }\n\n private:\n const Graph* G;\n ll l, r;\n };\n\n bool is_prepared() { return prepared; }\n\n Graph() : N(0), M(0), prepared(0) {}\n Graph(ll N) : N(N), M(0), prepared(0) {}\n\n void build(ll n) {\n N = n, M = 0;\n prepared = 0;\n edges.clear();\n indptr.clear();\n csr_edges.clear();\n vc_deg.clear();\n vc_indeg.clear();\n vc_outdeg.clear();\n }\n\n void add(ll frm, ll to, T cost = 1, ll i = -1) {\n assert(!prepared);\n assert(0 <= frm && 0 <= to && to < N);\n if (i == -1) i = M;\n auto e = edge_type({frm, to, cost, i});\n edges.eb(e);\n ++M;\n }\n\n#ifdef FASTIO\n // wt, off\n void read_tree(bool wt = false, ll off = 1) { read_graph(N - 1, wt, off); }\n\n void read_graph(ll M, bool wt = false, ll off = 1) {\n for (ll m = 0; m < M; ++m) {\n LL(a, b);\n a -= off, b -= off;\n if (!wt) {\n add(a, b);\n } else {\n T c;\n read(c);\n add(a, b, c);\n }\n }\n build();\n }\n#endif\n\n void build() {\n assert(!prepared);\n prepared = true;\n indptr.assign(N + 1, 0);\n for (auto&& e: edges) {\n indptr[e.frm + 1]++;\n if (!directed) indptr[e.to + 1]++;\n }\n for (ll v = 0; v < N; ++v) { indptr[v + 1] += indptr[v]; }\n auto counter = indptr;\n csr_edges.resize(indptr.back() + 1);\n for (auto&& e: edges) {\n csr_edges[counter[e.frm]++] = e;\n if (!directed)\n csr_edges[counter[e.to]++] = edge_type({e.to, e.frm, e.cost, e.id});\n }\n }\n\n OutgoingEdges operator[](ll v) const {\n assert(prepared);\n return {this, indptr[v], indptr[v + 1]};\n }\n\n vi deg_array() {\n if (vc_deg.empty()) calc_deg();\n return vc_deg;\n }\n\n pair<vi, vi> deg_array_inout() {\n if (vc_indeg.empty()) calc_deg_inout();\n return {vc_indeg, vc_outdeg};\n }\n\n ll deg(ll v) {\n if (vc_deg.empty()) calc_deg();\n return vc_deg[v];\n }\n\n ll in_deg(ll v) {\n if (vc_indeg.empty()) calc_deg_inout();\n return vc_indeg[v];\n }\n\n ll out_deg(ll v) {\n if (vc_outdeg.empty()) calc_deg_inout();\n return vc_outdeg[v];\n }\n\n#ifdef FASTIO\n void debug() {\n print(\"Graph\");\n if (!prepared) {\n print(\"frm to cost id\");\n for (auto&& e: edges) print(e.frm, e.to, e.cost, e.id);\n } else {\n print(\"indptr\", indptr);\n print(\"frm to cost id\");\n rep(v, N) for (auto&& e: (*this)[v]) print(e.frm, e.to, e.cost, e.id);\n }\n }\n#endif\n\n vi new_idx;\n vc<bool> used_e;\n\n // G における頂点 V[i] が、新しいグラフで i になるようにする\n // {G, es}\n Graph<T, directed> rearrange(vi V, bool keep_eid = 0) {\n if (len(new_idx) != N) new_idx.assign(N, -1);\n if (len(used_e) != M) used_e.assign(M, 0);\n ll n = len(V);\n rep(i, n) new_idx[V[i]] = i;\n Graph<T, directed> G(n);\n vi history;\n rep(i, n) {\n for (auto&& e: (*this)[V[i]]) {\n if (used_e[e.id]) continue;\n ll a = e.frm, b = e.to;\n if (new_idx[a] != -1 && new_idx[b] != -1) {\n history.eb(e.id);\n used_e[e.id] = 1;\n ll eid = (keep_eid ? e.id : -1);\n G.add(new_idx[a], new_idx[b], e.cost, eid);\n }\n }\n }\n rep(i, n) new_idx[V[i]] = -1;\n for (auto&& eid: history) used_e[eid] = 0;\n G.build();\n return G;\n }\n\nprivate:\n void calc_deg() {\n assert(vc_deg.empty());\n vc_deg.resize(N);\n for (auto&& e: edges) vc_deg[e.frm]++, vc_deg[e.to]++;\n }\n\n void calc_deg_inout() {\n assert(vc_indeg.empty());\n vc_indeg.resize(N);\n vc_outdeg.resize(N);\n for (auto&& e: edges) { vc_indeg[e.to]++, vc_outdeg[e.frm]++; }\n }\n};\n#line 3 \"/opt/library/graph/shortest_path/dijkstra.hpp\"\n\ntemplate <typename T, typename GT>\npair<vc<T>, vi> dijkstra_dense(GT& G, ll s) {\n const ll N = G.N;\n vc<T> dist(N, infty<T>);\n vi par(N, -1);\n vc<bool> done(N);\n dist[s] = 0;\n while (1) {\n ll v = -1;\n T mi = infty<T>;\n rep(i, N) {\n if (!done[i] && chmin(mi, dist[i])) v = i;\n }\n if (v == -1) break;\n done[v] = 1;\n for (auto&& e: G[v]) {\n if (chmin(dist[e.to], dist[v] + e.cost)) par[e.to] = v;\n }\n }\n return {dist, par};\n}\n\ntemplate <typename T, typename GT, bool DENSE = false>\npair<vc<T>, vi> dijkstra(GT& G, ll v) {\n if (DENSE) return dijkstra_dense<T>(G, v);\n auto N = G.N;\n vc<T> dist(N, infty<T>);\n vi par(N, -1);\n using P = pair<T, ll>;\n\n priority_queue<P, vector<P>, greater<P>> que;\n\n dist[v] = 0;\n que.emplace(0, v);\n while (!que.empty()) {\n auto [dv, v] = que.top();\n que.pop();\n if (dv > dist[v]) continue;\n for (auto&& e: G[v]) {\n if (chmin(dist[e.to], dist[e.frm] + e.cost)) {\n par[e.to] = e.frm;\n que.emplace(dist[e.to], e.to);\n }\n }\n }\n return {dist, par};\n}\n\n// 多点スタート。[dist, par, root]\ntemplate <typename T, typename GT>\ntuple<vc<T>, vi, vi> dijkstra(GT& G, vi vs) {\n assert(G.is_prepared());\n ll N = G.N;\n vc<T> dist(N, infty<T>);\n vi par(N, -1);\n vi root(N, -1);\n\n using P = pair<T, ll>;\n\n priority_queue<P, vector<P>, greater<P>> que;\n\n for (auto&& v: vs) {\n dist[v] = 0;\n root[v] = v;\n que.emplace(T(0), v);\n }\n\n while (!que.empty()) {\n auto [dv, v] = que.top();\n que.pop();\n if (dv > dist[v]) continue;\n for (auto&& e: G[v]) {\n if (chmin(dist[e.to], dist[e.frm] + e.cost)) {\n root[e.to] = root[e.frm];\n par[e.to] = e.frm;\n que.push(mp(dist[e.to], e.to));\n }\n }\n }\n return {dist, par, root};\n}\n#line 3 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll n, k, t, a, b, c, d, e;\n cin >> n >> k;\n if ((n==0) and (k==0)) return 1;\n Graph<ll> G(n);\n G.build();\n rep(k) {\n cin >> t;\n G.prepared = false;\n if (t == 0) {\n cin >> a >> b;\n G.build();\n a--; b--;\n auto [dist, par] = dijkstra<ll>(G, a);\n if (dist[b] == inf) print(-1);\n else print(dist[b]);\n } else {\n cin >> c >> d >> e;\n c--; d--;\n G.add(c, d, e);\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 3524, "score_of_the_acc": -0.161, "final_rank": 12 }, { "submission_id": "aoj_0526_8194914", "code_snippet": "#include <algorithm>\n#include <iostream>\n#include <map>\n#include <queue>\n\nusing namespace std;\n\n#define INF 1e9\n\nint n, k;\nint ship[100][100];\n\nint main() {\n while (cin >> n >> k, n + k > 0) {\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n ship[i][j] = i == j ? 0 : INF;\n }\n }\n for (int m = 0; m < k; m++) {\n int type;\n cin >> type;\n if (type == 1) {\n int a, b, cost;\n cin >> a >> b >> cost;\n a--;\n b--;\n if (ship[a][b] <= cost) {\n continue;\n }\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n ship[i][j] = min(ship[i][j],\n min(ship[i][a] + cost + ship[b][j],\n ship[i][b] + cost + ship[a][j]));\n }\n }\n } else {\n int from, to;\n cin >> from >> to;\n from--;\n to--;\n if (ship[from][to] != INF) {\n cout << ship[from][to] << endl;\n } else {\n cout << -1 << endl;\n }\n }\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3120, "score_of_the_acc": -0.0034, "final_rank": 1 }, { "submission_id": "aoj_0526_7908773", "code_snippet": "#include<stdio.h>\n#include<stdlib.h>\n\n#define INF 1e18\n\nstruct Node\n{\n int id;\n long long cost;\n struct Node *next;\n} *Graph[101];\n\nstruct Node *Heap[20000] = { NULL };\nstatic int heap_p = 1;\n\nvoid push( struct Node *p )\n{\n Heap[heap_p++] = p;\n int cur = heap_p - 1, par = cur / 2;\n struct Node *tmp;\n while( par > 0 )\n {\n if( Heap[cur]->cost < Heap[par]->cost )\n {\n tmp = Heap[cur], Heap[cur] = Heap[par], Heap[par] = tmp;\n cur /= 2, par /= 2;\n }\n else\n {\n break;\n }\n }\n}\n\nstruct Node *pop( void )\n{\n struct Node *rep = Heap[1];\n Heap[1] = Heap[--heap_p];\n int cur = 1, child = 2;\n struct Node *tmp;\n while( child < heap_p )\n {\n if( child + 1 < heap_p && Heap[child]->cost > Heap[child + 1]->cost ) child++;\n if( Heap[child]->cost < Heap[cur]->cost )\n {\n tmp = Heap[child], Heap[child] = Heap[cur], Heap[cur] = tmp;\n cur = child, child *= 2;\n }\n else\n {\n break;\n }\n }\n\n return rep;\n}\n\nint empty( void )\n{\n return heap_p == 0;\n}\n\nvoid clear( void )\n{\n heap_p = 1;\n}\n\nlong long searchShortestPath( int start, int goal )\n{\n long long shortest[101];\n for( int i = 1; i <= 100; i++ ) shortest[i] = INF;\n struct Node s;\n s.id = start, s.cost = 0, s.next = NULL;\n clear(), push( &s );\n shortest[start] = 0;\n struct Node *cur, *p, *q;\n while( !empty() )\n {\n cur = pop();\n if( shortest[cur->id] < cur->cost ) continue;\n\n p = Graph[cur->id];\n while( p != NULL )\n {\n if( shortest[p->id] > shortest[cur->id] + p->cost )\n {\n shortest[p->id] = shortest[cur->id] + p->cost;\n q = ( struct Node * )malloc( sizeof( struct Node ) );\n q->id = p->id, q->cost = shortest[p->id];\n push( q );\n }\n\n p = p->next;\n }\n }\n\n return shortest[goal] == INF ? -1 : shortest[goal];\n}\n\nint main( void )\n{\n int n, k;\n while( 1 )\n {\n scanf( \"%d %d\", &n, &k );\n if( n == 0 && k == 0 ) break;\n\n struct Node *cur, *pre;\n for( int i = 1; i <= n; i++ )\n {\n cur = Graph[i];\n while( cur != NULL )\n {\n pre = cur;\n cur = cur->next;\n free( pre );\n }\n Graph[i] = NULL;\n }\n\n int order, a, b, c;\n for( int i = 0; i < k; i++ )\n {\n scanf( \"%d\", &order );\n if( order == 1 )\n {\n scanf( \"%d %d %d\", &a, &b, &c );\n\n cur = ( struct Node * )malloc( sizeof( struct Node ) );\n cur->id = b, cur->cost = c;\n cur->next = Graph[a], Graph[a] = cur;\n\n cur = ( struct Node * )malloc( sizeof( struct Node ) );\n cur->id = a, cur->cost = c;\n cur->next = Graph[b], Graph[b] = cur;\n }\n else\n {\n scanf( \"%d %d\", &a, &b );\n printf( \"%lld\\n\", searchShortestPath( a, b ) );\n }\n }\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 120, "memory_kb": 43068, "score_of_the_acc": -1.1803, "final_rank": 20 }, { "submission_id": "aoj_0526_7891052", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vl = vector<ll>;\nusing vvl = vector<vl>;\nusing pl = pair<ll,ll>;\nusing vp = vector<pl>;\n#define rep(i,n) for(ll i=0;i<(ll)(n);++i)\n#define reps(i,s,n) for(ll i=(s);i<(ll)(n);++i)\n#define rep1(i,n) for(ll i=1;i<=(ll)(n);++i)\ntemplate<typename T>inline bool chmax(T &a,T b){return a<b?a=b,true:false;}\ntemplate<typename T>inline bool chmin(T &a,T b){return a>b?a=b,true:false;}\n#define fi first\n#define se second\n#define pb push_back\n#define eb emplace_back\n#define be(v) (v).begin(),(v).end()\nconst long long INF = 1e18;\n#ifdef DEBUG\n#include <debug.hpp>\n#endif\n\nbool solve(){\n\t#ifdef DEBUG\n\tcout<<1e18<<endl;\n\tcout<<1e18-1<<endl;\n\tcout<<(ll)1e18-1<<endl;\n\tcout << \"--- Input ---\" << endl;\n\t#endif\n\t//cin.unsetf(ios::skipws);\n\tll N,Q;cin>>N>>Q;\n\tif(N==0&&Q==0)return false;\n\n\t#ifdef DEBUG\n\tcout<<N<<\" \"<<Q<<endl;\n\tcout << \"--- Logic ---\" << endl;\n\t#endif\n\tvector<vp> g(N);\n\tauto dijk=[&](ll s){\n\t\t//priority_queue<pl,vp,greater<pl>> qu;\n\t\tpriority_queue<pl> qu;\n\t\tqu.emplace(0,s);\n\t\tvl dis(N,INF);\n\t\tdis.at(s)=0;\n\t\twhile(!qu.empty()){\n\t\t\tpl p=qu.top();qu.pop();\n\t\t\tll u=p.se;\n\t\t\tfor(auto e:g.at(u)){\n\t\t\t\tll v=e.se,c=e.fi;\n\t\t\t\tif(chmin(dis.at(v),dis.at(u)+c)){\n\t\t\t\t\tqu.emplace(c,v);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn dis;\n\t};\n\trep(qi,Q){\n\t\tll t;cin>>t;\n\t\tif(t==0){\n\t\t\tll a,b;cin>>a>>b;--a;--b;\n\t\t\tvl d=dijk(a);\n\t\t\tif(d.at(b)>=INF)cout<<-1<<endl;\n\t\t\telse cout<<d.at(b)<<endl;\n\t\t}else if(t==1){\n\t\t\tll u,v,c;cin>>u>>v>>c;--u;--v;\n\t\t\tg.at(u).eb(c,v);\n\t\t\tg.at(v).eb(c,u);\n\t\t}\n\t}\n\n\t#ifdef DEBUG\n\tcout << \"--- Answer ---\" << endl;\n\t#endif\n\treturn true;\n}\nint main(){\n\t#ifdef DEBUG\n\tcout << \"--- Main ---\" << endl;\n\t#endif\n\t//solve();\n\twhile(solve());\n\treturn 0;\n}\n//cout << fixed << setprecision(9);", "accuracy": 1, "time_ms": 620, "memory_kb": 3460, "score_of_the_acc": -1.0119, "final_rank": 19 }, { "submission_id": "aoj_0526_7377832", "code_snippet": "#include <algorithm>\n#include <iostream>\n#include <iomanip>\n#include <limits.h>\n#include <map>\n#include <math.h>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\n#include <stack>\n#include <complex>\n\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define rep1(i, n) for (int i = 1; i < n + 1; i++)\n#define all(A) A.begin(), A.end()\n#define itr(A, l, r) A.begin() + l, A.begin() + r\n#define debug(var) cout << #var << \" = \" << var << endl;\ntypedef long long ll;\n\ntemplate <typename T1, typename T2>\nostream &operator<<(ostream &os, const pair<T1, T2> &p)\n{\n os << \"(\" << p.first << \",\" << p.second << \")\";\n return os;\n}\n\ntemplate <typename T1, typename T2>\nistream &operator>>(istream &is, pair<T1, T2> &p)\n{\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate <typename T>\nostream &operator<<(ostream &os, const vector<T> &v)\n{\n for (int i = 0; i < (int)v.size(); i++)\n {\n os << v[i] << (i + 1 != (int)v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate <typename T>\nostream &operator<<(ostream &os, const vector<vector<T>> &v)\n{\n for (int i = 0; i < (int)v.size(); i++)\n {\n os << v[i] << endl;\n }\n return os;\n}\n\ntemplate <typename T>\nostream &operator<<(ostream &os, const vector<vector<vector<T>>> &v)\n{\n for (int i = 0; i < (int)v.size(); i++)\n {\n os << \"i = \" << i << endl;\n os << v[i];\n }\n return os;\n}\n\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &v)\n{\n for (T &in : v)\n is >> in;\n return is;\n}\n\ntemplate <typename T, typename S>\nostream &operator<<(ostream &os, map<T, S> &mp)\n{\n for (auto &[key, val] : mp)\n {\n os << key << \":\" << val << \" \";\n }\n cout << endl;\n return os;\n}\n\ntemplate <typename T>\nostream &operator<<(ostream &os, set<T> st)\n{\n auto itr = st.begin();\n for (int i = 0; i < (int)st.size(); i++)\n {\n os << *itr << (i + 1 != (int)st.size() ? \" \" : \"\");\n itr++;\n }\n return os;\n}\n\ntemplate <typename T>\nostream &operator<<(ostream &os, multiset<T> st)\n{\n auto itr = st.begin();\n for (int i = 0; i < (int)st.size(); i++)\n {\n os << *itr << (i + 1 != (int)st.size() ? \" \" : \"\");\n itr++;\n }\n return os;\n}\n\nint main()\n{\n while (1)\n {\n int n, k;\n cin >> n >> k;\n if (n + k == 0)\n {\n return 0;\n }\n int inf = 1e9;\n using S = pair<int, int>;\n vector<vector<S>> to(n, vector<S>());\n // debug(n);\n // debug(k);\n while (k--)\n {\n int t;\n cin >> t;\n // debug(to);\n if (t == 0)\n {\n vector<int> dist(n, inf);\n int a, b;\n cin >> a >> b;\n a--;\n b--;\n priority_queue<S, vector<S>, greater<S>> pq;\n pq.push({0, a});\n while (pq.size())\n {\n auto [d, now] = pq.top();\n pq.pop();\n if (d >= dist[now])\n {\n continue;\n }\n dist[now] = d;\n for (auto [next, cost] : to[now])\n {\n pq.push({d + cost, next});\n }\n }\n // cout << dist << endl;\n if (dist[b] == inf)\n {\n cout << -1 << endl;\n }\n else\n {\n cout << dist[b] << endl;\n }\n }\n if (t == 1)\n {\n int c, d, e;\n cin >> c >> d >> e;\n c--;\n d--;\n to[c].push_back({d, e});\n to[d].push_back({c, e});\n }\n }\n }\n}", "accuracy": 1, "time_ms": 340, "memory_kb": 3440, "score_of_the_acc": -0.5524, "final_rank": 15 }, { "submission_id": "aoj_0526_7119330", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing i32 = int;\nusing pii = pair<i32, i32>;\n\nconst i32 supi = 1e9;\n\nvoid solve(i32 n, i32 k) {\n vector G(n, vector(0, pair(0, 0)));\n auto dij = [&](i32 a, i32 b) -> i32 {\n vector dist(n, supi);\n dist[a] = 0;\n priority_queue<pii, vector<pii>, greater<pii>> que;\n que.emplace(0, a);\n while (que.size()) {\n auto [w, v] = que.top();\n que.pop();\n if (v == b) {\n break;\n }\n if (dist[v] < w) {\n continue;\n }\n for (auto [x, d] : G[v]) {\n if (dist[x] > w + d) {\n dist[x] = w + d;\n que.emplace(dist[x], x);\n }\n }\n }\n return (dist[b] == supi ? -1 : dist[b]);\n };\n for (i32 _ = 0 ; _ < k ; _++) {\n i32 t; cin >> t;\n assert(t == 0 or t == 1);\n if (t == 0) {\n i32 a, b; cin >> a >> b;\n cout << dij(a - 1, b - 1) << endl;\n }\n if (t == 1) {\n i32 c, d, e; cin >> c >> d >> e;\n G[c - 1].emplace_back(d - 1, e);\n G[d - 1].emplace_back(c - 1, e);\n }\n }\n}\n\nint main() {\n while (1) {\n i32 n, k; cin >> n >> k;\n if (!n) {\n break;\n }\n solve(n, k);\n }\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3336, "score_of_the_acc": -0.058, "final_rank": 6 }, { "submission_id": "aoj_0526_7061736", "code_snippet": "#include <iostream>\nusing namespace std;\n\nconstexpr int SIZE = 101;\nconstexpr int INF = 1e9;\nint dist[SIZE][SIZE];\n\nint main() {\n for (;;) {\n int N, K; cin >> N >> K;\n if (N == 0 && K == 0) break;\n for (int i = 1; i <= N; ++i)\n for (int j = 1; j <= N; ++j)\n dist[i][j] = (i == j ? 0 : INF);\n\n while (K-- > 0) {\n int op; cin >> op;\n if (op == 0) {\n int a, b; cin >> a >> b;\n cout << (dist[a][b] == INF ? -1 : dist[a][b]) << endl;\n } else {\n int c, d, e; cin >> c >> d >> e;\n if (dist[c][d] < e) continue;\n dist[c][d] = e;\n dist[d][c] = e;\n for (int k = c; k == c || k == d; k += (d - c))\n for (int i = 1; i <= N; ++i)\n for (int j = 1; j <= N; ++j)\n dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);\n }\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3368, "score_of_the_acc": -0.0096, "final_rank": 2 }, { "submission_id": "aoj_0526_6929176", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\ntemplate<class t> using vc = vector<t>;\ntemplate<class t> using vvc = vc<vc<t>>;\nusing pi = pair<int,int>;\nusing vi = vc<int>;\nusing vvi = vvc<int>;\n\n#define rep(i,a,b) for (int i = (a); i < (b); i++)\n#define irep(i,a,b) for (int i = (a); i > (b); i--)\n#define all(a) a.begin(),a.end()\n#define print(n) cout << n << '\\n'\n#define pritn(n) print(n)\n#define printv(n,a) {copy(all(n),ostream_iterator<a>(cout,\" \")); cout<<\"\\n\";}\n#define rup(a,b) (a+b-1)/b\n#define input(A,N) rep(i,0,N) cin>>A[i]\n#define chmax(a,b) a = max(a,b)\n#define chmin(a,b) a = min(a,b)\n\ntemplate< typename T >\nstruct edge{\n int to;\n T cost;\n /*\n *to:繋がってる先\n *cost:辺のコスト\n */\n edge(int to, T cost):to(to),cost(cost){};\n edge &operator=(const int& x){\n to = x;\n return *this;\n }\n};\n\ntemplate< typename T >\nstruct graph{\n int n;\n vector<vector<edge<T>>> e;\n bool isweighted=false,isdirected=false;\n graph(int n, bool isweighted=false, bool isdirected=false):\n n(n),e(vector<vector<edge<T>>>(n)),isweighted(isweighted),isdirected(isdirected){}\n\n graph(int n, vector<vector<T>>& edges, int index=1,bool isweighted=false, bool isdirected=false)\n :n(n),e(vector<vector<edge<T>>>(n)),isweighted(isweighted),isdirected(isdirected){\n addedges(edges,index);\n }\n\n void addedges(vector<vector<T>>& edges, int index=1){\n for(int i=0; i<edges.size(); i++){\n addedges(edges[i],index);\n }\n return;\n }\n\n void addedges(vector<T>& edges, int index=1){\n int u = edges[0];u -= index;\n int v = edges[1];v -= index;\n T cost;\n if(isweighted) cost = edges[2];\n else cost = 1;\n e[u].emplace_back(v,cost);\n if(!isdirected) e[v].emplace_back(u,cost);\n return;\n }\n\n vector<edge<T>> &operator[](int i) {\n return e[i];\n }\n};\n\n/*\n* O(ElogV)\n* 到達不能の場合は―1が入ってる。\n*/\ntemplate< typename T >\nvector<T> dijkstra(graph<T>& g, int st){\n int n = g.n;\n using pt = pair<T,int>;\n vector<T> dist(n,-1);\n dist[st] = 0;\n priority_queue<pt, vector<pt>, greater<pt>>que;\n que.emplace(0,st);\n while(que.size()){\n int ni;\n T cost;\n tie(cost,ni) = que.top();\n que.pop();\n if(dist[ni]<cost&&dist[ni]!=-1) continue;\n for(edge<T> itr:g[ni]){\n int nxt = itr.to;\n if(dist[nxt]>cost+itr.cost||dist[nxt]==-1){\n dist[nxt] = cost + itr.cost;\n que.emplace(dist[nxt],nxt);\n }\n }\n }\n return dist;\n};\n\nvoid solve(int n,int k){\n graph<ll> g(n,true,false);\n while(k--){\n int i;\n cin>>i;\n if(i==0){\n int a,b;\n cin>>a>>b;\n a--;b--;\n vector<ll> dist = dijkstra(g,a);\n print(dist[b]);\n }else{\n int a,b,c;\n cin>>a>>b>>c;\n vector<ll> e{a,b,c};\n g.addedges(e);\n }\n }\n}\n\nint main(){\n cout << fixed << setprecision(15);\n \n while(1){\n int n,k;\n cin>>n>>k;\n if(n==0&&k==0) break;\n solve(n,k);\n }\n \n //system(\"pause\");\n return 0;\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 3396, "score_of_the_acc": -0.125, "final_rank": 10 }, { "submission_id": "aoj_0526_6852629", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\nusing pii = pair<int, int>;\n\nconst int inf = 1e9 + 10;\nint dist[110][110];\n\nint main()\n{\n int n, K;\n while(cin >> n >> K, n + K){\n rep(i, n) rep(j, n) dist[i][j] = (i == j ? 0 : inf); \n \n while (K--) {\n int t, x, y, z;\n cin >> t;\n if (t == 0) {\n cin >> x >> y;\n x--, y--;\n cout << (dist[x][y] == inf ? -1 : dist[x][y]) << endl;\n }\n else if (t == 1) {\n cin >> x >> y >> z;\n x--, y--;\n if (dist[x][y] <= z) continue;\n dist[x][y] = z;\n dist[y][x] = z;\n rep(k, n) rep(i, n) rep(j, n) dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);\n }\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 430, "memory_kb": 3360, "score_of_the_acc": -0.6979, "final_rank": 16 }, { "submission_id": "aoj_0526_6710508", "code_snippet": "// ダイクストラ法\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing P = pair<int, int>;\n\nconst int MAX = 10000001;\n\nint check_route(const VVI& route, const int from, const int to, const int n) {\n VI distance(n + 1, MAX);\n distance[from] = 0;\n priority_queue<P, vector<P>, greater<P>> pq;\n pq.push(make_pair(0, from));\n while (!pq.empty()) {\n P p = pq.top();\n pq.pop();\n if (p.second == to) continue;\n for (int i = 1; i < (int)route[p.second].size(); ++i) {\n if (distance[i] < p.first + route[p.second][i]) continue;\n pq.push(make_pair(p.first + route[p.second][i], i));\n distance[i] = p.first + route[p.second][i];\n }\n }\n if (distance[to] == MAX)\n return -1;\n else\n return distance[to];\n}\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n while (true) {\n int n, k;\n cin >> n >> k;\n if (n == 0 && k == 0) break;\n\n VVI route(n + 1, VI(n + 1, MAX));\n\n for (int i = 0; i < k; ++i) {\n int x, a, b, c, d, e;\n cin >> x;\n if (x == 0) {\n cin >> a >> b;\n cout << check_route(route, a, b, n) << endl;\n } else {\n cin >> c >> d >> e;\n route[c][d] = min(route[c][d], e);\n route[d][c] = min(route[d][c], e);\n }\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 270, "memory_kb": 3368, "score_of_the_acc": -0.4358, "final_rank": 14 }, { "submission_id": "aoj_0526_6710169", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing P = pair<int, int>;\n\nconst int MAX = 10000001;\n\nint check_route(const VVI& route, const int from, const int to, const int n) {\n VI distance(n + 1, MAX);\n distance[from] = 0;\n deque<P> dq;\n dq.push_back(make_pair(from, 0));\n while (!dq.empty()) {\n P p = dq.front();\n dq.pop_front();\n if (p.first == to) continue;\n for (int i = 1; i < (int)route[p.first].size(); ++i) {\n if (i == p.first || route[p.first][i] == MAX) continue;\n if (distance[i] < p.second + route[p.first][i]) continue;\n dq.push_back(make_pair(i, p.second + route[p.first][i]));\n distance[i] = p.second + route[p.first][i];\n }\n }\n if (distance[to] == MAX)\n return -1;\n else\n return distance[to];\n}\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n while (true) {\n int n, k;\n cin >> n >> k;\n if (n == 0 && k == 0) break;\n\n VVI route(n + 1, VI(n + 1, MAX));\n\n for (int i = 0; i < k; ++i) {\n int x, a, b, c, d, e;\n cin >> x;\n if (x == 0) {\n cin >> a >> b;\n cout << check_route(route, a, b, n) << endl;\n } else {\n cin >> c >> d >> e;\n route[c][d] = min(route[c][d], e);\n route[d][c] = min(route[d][c], e);\n route[c][c] = 0;\n route[d][d] = 0;\n }\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 460, "memory_kb": 3420, "score_of_the_acc": -0.7486, "final_rank": 17 }, { "submission_id": "aoj_0526_6710037", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing VI = vector<int>;\nusing VVI = vector<VI>;\n\nconst int MAX = 10000001;\n\nvoid upd_route(VVI& r, const int c, const int d, const int e) {\n for (int i = 1; i < (int)r.size(); ++i) {\n for (int j = 1; j < (int)r[i].size(); ++j) {\n int x = r[i][c] + e + r[d][j];\n int y = r[i][d] + e + r[c][j];\n int z = r[i][j];\n r[i][j] = min({x, y, z});\n }\n }\n}\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n while (true) {\n int n, k;\n cin >> n >> k;\n if (n == 0 && k == 0) break;\n \n VVI route(n + 1, VI(n + 1, MAX));\n\n for (int i = 0; i < k; ++i) {\n int x, a, b, c, d, e;\n cin >> x;\n if (x == 0) {\n cin >> a >> b;\n if (route[a][b] == MAX)\n cout << -1 << endl;\n else\n cout << route[a][b] << endl;\n } else {\n cin >> c >> d >> e;\n route[c][c] = 0;\n route[d][d] = 0;\n upd_route(route, c, d, e);\n }\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3424, "score_of_the_acc": -0.011, "final_rank": 4 }, { "submission_id": "aoj_0526_6652666", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define all(A) A.begin(),A.end()\nusing vll = vector<ll>;\n#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)\nusing Graph = vector<vector<int>>;\n\n\nint main() {\n while(1){ll N, K;\n cin >> N >> K;\n if(N==0)return 0;\n vector<vll> dist(N, vll(N, 1e17));\n rep(i, N) {\n dist[i][i] = 0;\n }\n rep(k, K) {\n ll X;\n cin >> X;\n if (X == 0) {\n ll A, B;\n cin >> A >> B;\n A--; B--;\n if (dist[A][B] > 1e16) {\n cout << -1 << endl;\n }\n else {\n cout << dist[A][B] << endl;\n }\n }\n else {\n ll C, D, E;\n cin >> C >> D >> E;\n\n C--; D--;\n rep(a, N) {\n rep(b, N) {\n dist[a][b] = min(dist[a][C] + E + dist[D][b], dist[a][b]);\n dist[a][b] = min(dist[a][D] + E + dist[C][b], dist[a][b]);\n dist[b][a] = dist[a][b];\n }\n }\n }\n }}\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3448, "score_of_the_acc": -0.028, "final_rank": 5 }, { "submission_id": "aoj_0526_6327429", "code_snippet": "#include <stdio.h>\n#include <vector>\n#include <queue>\n#define INF 1012345678\nusing namespace std;\n\nint dist[128], vis[128];\nvector<pair<int, int>> ed[128];\npriority_queue <pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;\n\nint dijk(int n, int s, int e) {\n int x, d;\n for (int i = 1; i <= n; i++) {\n dist[i] = INF;\n vis[i] = 0;\n }\n pq.push(pair<int, int>(0, s));\n while (pq.size()) {\n d = pq.top().first;\n x = pq.top().second;\n pq.pop();\n if (vis[x]) continue;\n else vis[x] = 1;\n for (auto i : ed[x]) {\n if (d + i.second < dist[i.first]) {\n dist[i.first] = d + i.second;\n pq.push(pair<int, int>(d + i.second, i.first));\n }\n }\n }\n if (dist[e] == INF) return -1;\n else return dist[e];\n}\n\nint main(void) {\n int n, k, o, a, b, c;\n for (int tt = 0;; tt++) {\n scanf(\"%d %d\", &n, &k);\n if (n == 0) break;\n for (int i = 0; i < k; i++) {\n scanf(\"%d\", &o);\n if (o) {\n scanf(\"%d %d %d\", &a, &b, &c);\n ed[a].push_back(pair<int, int>(b, c));\n ed[b].push_back(pair<int, int>(a, c));\n }\n else {\n scanf(\"%d %d\", &a, &b);\n printf(\"%d\\n\", dijk(n, a, b));\n }\n }\n\n for (int i = 1; i <= n; i++) ed[i].clear();\n while (pq.size()) pq.pop();\n }\n return 0;\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 2984, "score_of_the_acc": -0.0984, "final_rank": 7 }, { "submission_id": "aoj_0526_6327204", "code_snippet": "#include <algorithm>\n#include <iostream>\n#include <iomanip>\n#include <limits.h>\n#include <map>\n#include <math.h>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\n#include <stack>\n\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define rep1(i, n) for (int i = 1; i < n + 1; i++)\n#define all(A) A.begin(), A.end()\n#define itr(A, l, r) A.begin() + l, A.begin() + r\n#define debug(var) cout << #var << \" = \" << var << endl;\ntypedef long long ll;\n\nconst int inf = 1e9;\n\ntemplate <typename T>\nvector<T> dijkstra(int n, vector<vector<pair<int, T>>> to, int start)\n{\n vector<T> dist(n + 1, inf);\n priority_queue<pair<int, T>, vector<pair<int, T>>, greater<pair<int, T>>> pq;\n dist[start] = 0;\n pq.push({0, start});\n while (pq.size() > 0)\n {\n auto now_pair = pq.top();\n pq.pop();\n int now = now_pair.second;\n int now_dist = now_pair.first;\n if (dist[now] < now_dist)\n {\n continue;\n }\n for (auto next_pair : to[now])\n {\n int next = next_pair.first;\n T cost = next_pair.second;\n if (dist[now] + cost >= dist[next])\n {\n continue;\n }\n dist[next] = dist[now] + cost;\n pq.push({dist[next], next});\n }\n }\n return dist;\n}\n\nvoid solve(int n, int k)\n{\n vector<vector<pair<int, int>>> to(n + 1, vector<pair<int, int>>());\n rep(i, k)\n {\n int q;\n cin >> q;\n if (q == 0)\n {\n int a, b;\n cin >> a >> b;\n vector<int> dist = dijkstra(n, to, a);\n if (dist[b] == inf)\n {\n cout << -1 << endl;\n }\n else\n {\n cout << dist[b] << endl;\n }\n }\n if (q == 1)\n {\n int c, d, e;\n cin >> c >> d >> e;\n to[c].push_back({d, e});\n to[d].push_back({c, e});\n }\n }\n}\n\nint main(void)\n{\n while (true)\n {\n int n, k;\n cin >> n >> k;\n if (n == 0 && k == 0)\n {\n return 0;\n }\n solve(n, k);\n }\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 3420, "score_of_the_acc": -0.1584, "final_rank": 11 } ]
aoj_0519_cpp
最悪の記者 問題 あなたは JOI 新聞社の記者であり，スポーツ記事を担当している． 昨日までに，クロアチアでは，n 個のサッカーチームによる総当りのリーグ戦が行われた．大会実行委員会は，試合結果と規定に基づき各チームに 1 位から n 位までの順位をつけたようである．あなたには，一部の試合の勝敗とともに，次の情報が伝えられた． 情報 1 引き分けの試合はなかった． 情報 2 全てのチームに異なる順位がついた． 情報 3 全ての 1 ≤ a < b ≤ n に対し，a 位のチームと b 位のチームの試合において，必ず a 位のチームが勝利した． あなたは記事を作成するために，一部の試合の勝敗と，伝えられた情報 1 3 をもとに，順位表を推測することにした． 入力として一部の試合の勝敗が与えられたとき，伝えられた情報に適合する順位表を 1 つ出力するプログラムを作れ．また，出力した順位表以外に，伝えられた情報に適合する順位表が存在するかどうかも判定せよ． ここで，順位表とは 1 位から n 位の順にチームを並べたもののことをいう． 例 例1 (情報に適合する順位表が 1 つしかない場合) チーム数が4で，各チームに1から4までの番号が付けられており，勝敗が次の表で与えられていたとする． i 行 j 列が○のときは，番号 i のチームと番号 j のチームの試合において，番号 i のチームが勝利したことを意味する．また，×のときは，番号 j のチームが勝利したことを意味する．? は勝敗が与えられていないことを意味する．このとき，伝えられた情報に適合する順位表は次の 1 つしかない 1 位 番号 3 のチーム 2 位 番号 4 のチーム 3 位 番号 1 のチーム 4 位 番号 2 のチーム 例2 (情報に適合する順位表が複数存在する場合) チーム数が3で，各チームに1から3までの番号が付けられており，勝敗が次の表で与えられていたとする． このとき，伝えられた情報に適合する順位表は，次の 2 つである． 1 位 番号 2 のチーム 2 位 番号 1 のチーム 3 位 番号 3 のチーム 1 位 番号 2 のチーム 2 位 番号 3 のチーム 3 位 番号 1 のチーム 入力 入力は以下の形式で与えられる． 1 行目には，サッカーチームの個数 n が書かれている．各チームには，1 から n までの番号が付けられている． 2 行目には，与えられた試合の勝敗の個数 m が書かれている． 3 行目から m + 2 行目は試合の勝敗を表す．各行は空白で区切られた 2 つの整数 i, j を含み，番号 i のチームが番号 j のチームに勝利したことを表す． n, m は 1 ≤ n ≤ 5000, 1 ≤ m ≤ 100000 をみたす． 採点の際に用いるテストデータのうち，30% は 1 ≤ n ≤ 7, 1 ≤ m ≤ 15 をみたす．また，60% は 1 ≤ n ≤ 100, 1 ≤ m ≤ 2000 をみたす． 出力 出力 は n + 1 行からなる． 1 行目から n 行目までの n 行には，伝えられた情報に適合する順位表を出力せよ． i 行目 (1 ≤ i ≤ n) に i 位のチームの番号を出力せよ． n + 1 行目には，出力した順位表以外に，伝えられた情報に適合する順位表が存在するかどうかを表す整数を出力せよ．もし存在しなければ 0 を，存在する場合は 1 を出力せよ． 入出力例 例 1 に対応する入出力は以下の通りである． 入力例 1 4 5 1 2 3 1 3 2 3 4 4 1 出力例 1 3 4 1 2 0 例 2 に対応する入出力は以下の通りである． 入力例 2 3 2 2 1 2 3 この入力データに対して，次の 2 通りの出力データが考えられる．どちらを出力してもよい． 出力例 2 2 1 3 1 2 3 1 1 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0519_10850480", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nvoid visit(vector<vector<int>> const& g, int v, vector<bool>& used, vector<int>& res) {\n if(!used[v]) {\n used[v] = true;\n for(auto& to : g[v]) {\n visit(g, to, used, res);\n }\n res.push_back(v);\n }\n}\n\nvector<int> tsort(vector<vector<int>> const& g) {\n vector<bool> used(g.size());\n vector<int> res;\n for(int i=0; i<g.size(); ++i) {\n visit(g, i, used, res);\n }\n reverse(res.begin(), res.end());\n return res;\n}\n\nint main() {\n int n, m;\n cin >> n >> m;\n vector<vector<int>> g(n);\n for(int i=0; i<m; ++i) {\n int a, b;\n cin >> a >> b;\n a--; b--;\n g[a].push_back(b);\n }\n auto res = tsort(g);\n bool f = true;\n for(int i=0; i<n-1; ++i) {\n bool f2 = false;\n for(int j=0; j<g[res[i]].size(); ++j) {\n f2 |= g[res[i]][j] == res[i+1];\n }\n f &= f2;\n }\n\n for(auto x : res) {\n cout << x+1 << endl;\n }\n cout << !f << endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 4240, "score_of_the_acc": -0.0989, "final_rank": 14 }, { "submission_id": "aoj_0519_10314690", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define all(a) a.begin(),a.end()\n#define reps(i, a, n) for (int i = (a); i < (int)(n); i++)\n#define rep(i, n) reps(i, 0, n)\n#define rreps(i, a, n) for (int i = (a); i > (int)(n); i--)\nconst long long mod = 1000000007;\nconst long long INF = 1e18;\nll myceil(ll a, ll b) {return (a+b-1)/b;}\n\n\ntemplate <typename T>\nstruct edge {\n int src, to;\n T cost;\n\n edge(int _to, T _cost) : src(-1), to(_to), cost(_cost) {}\n edge(int _src, int _to, T _cost) : src(_src), to(_to), cost(_cost) {}\n\n edge &operator=(const int &x) {\n to = x;\n return *this;\n }\n\n operator int() const { return to; }\n};\ntemplate <typename T>\nusing Edges = vector<edge<T>>;\ntemplate <typename T>\nusing WeightedGraph = vector<Edges<T>>;\nusing UnweightedGraph = vector<vector<int>>;\n\n// Input of (Unweighted) Graph\nUnweightedGraph graph(int N, int M = -1, bool is_directed = false,\n bool is_1origin = true) {\n UnweightedGraph g(N);\n if (M == -1) M = N - 1;\n for (int _ = 0; _ < M; _++) {\n int x, y;\n cin >> x >> y;\n if (is_1origin) x--, y--;\n g[x].push_back(y);\n if (!is_directed) g[y].push_back(x);\n }\n return g;\n}\n\n// Input of Weighted Graph\ntemplate <typename T>\nWeightedGraph<T> wgraph(int N, int M = -1, bool is_directed = false,\n bool is_1origin = true) {\n WeightedGraph<T> g(N);\n if (M == -1) M = N - 1;\n for (int _ = 0; _ < M; _++) {\n int x, y;\n cin >> x >> y;\n T c;\n cin >> c;\n if (is_1origin) x--, y--;\n g[x].emplace_back(x, y, c);\n if (!is_directed) g[y].emplace_back(y, x, c);\n }\n return g;\n}\n\n// Input of Edges\ntemplate <typename T>\nEdges<T> esgraph([[maybe_unused]] int N, int M, int is_weighted = true,\n bool is_1origin = true) {\n Edges<T> es;\n for (int _ = 0; _ < M; _++) {\n int x, y;\n cin >> x >> y;\n T c;\n if (is_weighted)\n cin >> c;\n else\n c = 1;\n if (is_1origin) x--, y--;\n es.emplace_back(x, y, c);\n }\n return es;\n}\n\n// Input of Adjacency Matrix\ntemplate <typename T>\nvector<vector<T>> adjgraph(int N, int M, T INF, int is_weighted = true,\n bool is_directed = false, bool is_1origin = true) {\n vector<vector<T>> d(N, vector<T>(N, INF));\n for (int _ = 0; _ < M; _++) {\n int x, y;\n cin >> x >> y;\n T c;\n if (is_weighted)\n cin >> c;\n else\n c = 1;\n if (is_1origin) x--, y--;\n d[x][y] = c;\n if (!is_directed) d[y][x] = c;\n }\n return d;\n}\n\n/**\n * @brief グラフテンプレート\n * @docs docs/graph/graph-template.md\n */\n\n\n\n// if the graph is not DAG, return empty vector\ntemplate <typename T>\nvector<int> TopologicalSort(T &g) {\n int N = g.size();\n vector<int> marked(N, 0), temp(N, 0), v;\n auto visit = [&](auto f, int i) -> bool {\n if (temp[i] == 1) return false;\n if (marked[i] == 0) {\n temp[i] = 1;\n for (auto &e : g[i]) {\n if (f(f, e) == false) return false;\n }\n marked[i] = 1;\n v.push_back(i);\n temp[i] = 0;\n }\n return true;\n };\n\n for (int i = 0; i < N; i++) {\n if (marked[i] == 0) {\n if (visit(visit, i) == false) return vector<int>();\n }\n }\n reverse(v.begin(), v.end());\n return v;\n}\n\n\nvoid solve() {\n int n,m;\n cin >> n >> m;\n auto g = graph(n,m,true,true);\n auto tg = TopologicalSort(g);\n\n\n\n for (auto x : tg) {\n cout << x+1 << endl;\n }\n rep(i,tg.size()-1) {\n rep(j,g[tg[i]].size()) {\n if (g[tg[i]][j] == tg[i+1]) {\n break;\n }\n if (j == g[tg[i]].size()-1) {\n // cout << i << ' ' << j << endl;\n cout << 1 << endl;\n return;\n }\n }\n }\n cout << 0 << endl;\n return;\n}\n\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n solve();\n \n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4372, "score_of_the_acc": -0.0836, "final_rank": 13 }, { "submission_id": "aoj_0519_10285986", "code_snippet": "#include <iostream>\n#include <vector>\n#include <set>\n\n\nusing namespace std;\n\ntypedef long long int ll;\ntypedef vector<ll> vll;\ntypedef set<ll> sll;\n\nint main() {\n ll n, m;\n cin >> n >> m;\n\n bool is_team_mentioned[n+1];\n sll wins[n+1];\n sll loses[n+1];\n sll nodes;\n for (ll i = 1; i <= n; i++) {\n is_team_mentioned[n] = false;\n wins[i] = sll();\n loses[i] = sll();\n nodes.insert(i);\n }\n\n for (ll i = 0; i < m; i++) {\n ll win, lose;\n cin >> win >> lose;\n is_team_mentioned[win] = true;\n is_team_mentioned[lose] = true;\n wins[win].insert(lose);\n loses[lose].insert(win);\n }\n\n bool cant_determine = false;\n vll res;\n for (ll t = 1; t <= n; t++) {\n if (is_team_mentioned[t] == false) {\n cant_determine = true;\n res.push_back(t);\n nodes.erase(t);\n }\n }\n\n while (!nodes.empty()) {\n // 勝利の情報だけあるチームを列挙\n vll current_best;\n for (ll t = 1; t <= n; t++) {\n if (nodes.count(t) == 0) {\n continue;\n }\n if (loses[t].size() == 0) {\n current_best.push_back(t);\n }\n }\n\n // 複数チームあったなら一意にソート不可\n if (current_best.size() > 1) {\n cant_determine = true;\n }\n\n // 列挙したチームを出力し、グラフから削除\n for (ll t : current_best) {\n res.push_back(t);\n for (auto lose_team : wins[t]) {\n loses[lose_team].erase(t);\n }\n nodes.erase(t);\n }\n }\n\n for (ll t : res) {\n cout << t << endl;\n }\n cout << ((cant_determine == true) ? 1 : 0) << endl;\n}", "accuracy": 1, "time_ms": 770, "memory_kb": 13560, "score_of_the_acc": -1.8452, "final_rank": 20 }, { "submission_id": "aoj_0519_9028148", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int N, M; cin >> N >> M;\n vector<vector<int>> g(N), rg(N);\n vector<int> in(N, 0), out(N, 0);\n for (int i = 0; i < M; i++) {\n int a, b; cin >> a >> b;\n a--, b--;\n g[a].push_back(b);\n rg[b].push_back(a);\n in[b]++;\n out[a]++;\n }\n queue<int> que;\n for (int i = 0; i < N; i++) {\n if (out[i] == 0) que.push(i);\n }\n int ok = 1;\n vector<int> usd(N, 0), ans;\n while (!que.empty()) {\n ok &= que.size() == 1;\n int u = que.front(); que.pop();\n ans.push_back(u+1);\n usd[u] = 1;\n for (auto v : rg[u]) {\n if (usd[v]) continue;\n out[v]--;\n if (out[v] == 0) que.push(v);\n }\n }\n reverse(ans.begin(), ans.end());\n for (auto x : ans) {\n cout << x << '\\n';\n }\n cout << !ok << endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 4968, "score_of_the_acc": -0.1593, "final_rank": 16 }, { "submission_id": "aoj_0519_9028142", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int N, M; cin >> N >> M;\n vector<vector<int>> g(N), rg(N);\n vector<int> in(N, 0), out(N, 0);\n for (int i = 0; i < M; i++) {\n int a, b; cin >> a >> b;\n a--, b--;\n g[a].push_back(b);\n rg[b].push_back(a);\n in[b]++;\n out[a]++;\n }\n queue<int> que;\n for (int i = 0; i < N; i++) {\n if (out[i] == 0) que.push(i);\n }\n int ok = 1;\n vector<int> usd(N, 0), ans;\n while (!que.empty()) {\n ok &= que.size() == 1;\n int u = que.front(); que.pop();\n ans.push_back(u+1);\n usd[u] = 0;\n for (auto v : rg[u]) {\n out[v]--;\n if (out[v] == 0) que.push(v);\n }\n }\n reverse(ans.begin(), ans.end());\n for (auto x : ans) {\n cout << x << '\\n';\n }\n cout << !ok << endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 5052, "score_of_the_acc": -0.1662, "final_rank": 17 }, { "submission_id": "aoj_0519_8860719", "code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <iostream>\n#include <vector>\n#include <stack>\nusing namespace std;\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, n) FOR(i, 0, n)\ntypedef pair<int, int> pii;\nint n, m;\nvector<int> edge[5000];\nint cnt[5000];\nint main() {\n cin >> n >> m;\n REP(i, m) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n a--;\n b--;\n edge[a].push_back(b);\n cnt[b]++;\n }\n vector<int> ans;\n bool flag = false;\n stack<int> next; // Change next to stack\n REP(i, n) if (cnt[i] == 0) next.push(i);\n REP(i, n) {\n int tar = next.top(); // use top() instead of next[next.size() - 1]\n ans.push_back(tar + 1);\n next.pop(); // use pop() instead of next.erase(next.end() - 1)\n if (!next.empty()) // use empty() instead of next.size() > 0\n flag = true; // move flag update inside if condition\n REP(j, edge[tar].size()) {\n int to = edge[tar][j];\n if (--cnt[to] == 0)\n next.push(to);\n }\n }\n REP(i, ans.size()) printf(\"%d\\n\", ans[i]);\n if (flag)\n puts(\"1\");\n else\n puts(\"0\");\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3892, "score_of_the_acc": -0.0438, "final_rank": 7 }, { "submission_id": "aoj_0519_8860718", "code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <vector>\nusing namespace std;\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, n) FOR(i, 0, n)\ntypedef pair<int, int> pii;\nint n, m;\nvector<int> edge[5000];\nint cnt[5000];\nint main() {\n scanf(\"%d %d\", &n, &m);\n REP(i, m) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n a--;\n b--;\n edge[a].push_back(b);\n cnt[b]++;\n }\n vector<int> ans(n); // preallocate size\n bool flag = false;\n vector<int> next;\n REP(i, n) if (cnt[i] == 0) next.push_back(i);\n int index = 0; // keep track of next node to be processed\n REP(i, n) {\n int tar = next[index++]; // use index to get next node\n ans[i] = tar + 1;\n if (index < next.size())\n flag = true;\n REP(j, edge[tar].size()) {\n int to = edge[tar][j];\n if (--cnt[to] == 0)\n next.push_back(to);\n }\n }\n REP(i, ans.size()) printf(\"%d\\n\", ans[i]);\n if (flag)\n puts(\"1\");\n else\n puts(\"0\");\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3432, "score_of_the_acc": -0.0056, "final_rank": 2 }, { "submission_id": "aoj_0519_8860717", "code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <iostream>\n#include <vector>\n#include <queue>\nusing namespace std;\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, n) FOR(i, 0, n)\ntypedef pair<int, int> pii;\nint n, m;\nvector<int> edge[5000];\nint cnt[5000];\n\nint main() {\n cin >> n >> m;\n REP(i, m) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n a--;\n b--;\n edge[a].push_back(b);\n cnt[b]++;\n }\n\n bool flag = false;\n queue<int> next;\n REP(i, n) if (cnt[i] == 0) next.push(i);\n REP(i, n) {\n int tar = next.front();\n next.pop();\n printf(\"%d\\n\", tar + 1);\n if (!next.empty())\n flag = true;\n REP(j, edge[tar].size()) {\n int to = edge[tar][j];\n if (--cnt[to] == 0)\n next.push(to);\n }\n }\n \n if (flag)\n puts(\"1\");\n else\n puts(\"0\");\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3780, "score_of_the_acc": -0.0345, "final_rank": 4 }, { "submission_id": "aoj_0519_8809414", "code_snippet": "#include <cstdio>\n#include <vector>\nusing namespace std;\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, n) FOR(i, 0, n)\n\nconst int MAX_N = 5000;\n\nint n, m;\nvector<int> edge[MAX_N];\nint cnt[MAX_N];\n\nint main() {\n scanf(\"%d %d\", &n, &m);\n REP(i, m) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n a--;\n b--;\n edge[a].push_back(b);\n cnt[b]++;\n }\n\n vector<int> ans;\n bool flag = false;\n vector<int> next;\n REP(i, n) if (cnt[i] == 0) next.push_back(i);\n\n REP(i, n) {\n int tar = next.back();\n next.pop_back();\n ans.push_back(tar + 1);\n if (!next.empty())\n flag = true;\n\n REP(j, edge[tar].size()) {\n int to = edge[tar][j];\n if (--cnt[to] == 0)\n next.push_back(to);\n }\n }\n\n REP(i, ans.size()) printf(\"%d\\n\", ans[i]);\n if (flag)\n puts(\"1\");\n else\n puts(\"0\");\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3364, "score_of_the_acc": 0, "final_rank": 1 }, { "submission_id": "aoj_0519_8809412", "code_snippet": "#include <cstdio>\n#include <vector>\nusing namespace std;\n#define FOR(i, a, b) for (int i = (a); i < (b); ++i)\n#define REP(i, n) FOR(i, 0, n)\n\nint n, m;\nvector<int> edge[5000];\nint cnt[5000];\n\nint main() {\n scanf(\"%d%d\", &n, &m);\n REP(i, m) {\n int a, b;\n scanf(\"%d%d\", &a, &b);\n --a;\n --b;\n edge[a].push_back(b);\n ++cnt[b];\n }\n vector<int> ans;\n bool flag = false;\n vector<int> next;\n REP(i, n) if (cnt[i] == 0) next.push_back(i);\n REP(i, n) {\n int tar = next.back();\n ans.push_back(tar + 1);\n next.pop_back();\n if (!next.empty())\n flag = true;\n for (int j = 0; j < edge[tar].size(); ++j) {\n int to = edge[tar][j];\n if (--cnt[to] == 0)\n next.push_back(to);\n }\n }\n REP(i, ans.size()) printf(\"%d\\n\", ans[i]);\n if (flag)\n puts(\"1\");\n else\n puts(\"0\");\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3440, "score_of_the_acc": -0.0063, "final_rank": 3 }, { "submission_id": "aoj_0519_8809409", "code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <iostream>\n#include <stack>\n#include <vector>\nusing namespace std;\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, n) FOR(i, 0, n)\ntypedef pair<int, int> pii;\nint n, m;\nvector<int> edge[5000];\nint cnt[5000];\nint main() {\n cin >> n >> m;\n REP(i, m) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n a--;\n b--;\n edge[a].push_back(b);\n cnt[b]++;\n }\n vector<int> ans;\n bool flag = false;\n stack<int> next;\n REP(i, n) if (cnt[i] == 0) next.push(i);\n REP(i, n) {\n int tar = next.top();\n next.pop();\n ans.push_back(tar + 1);\n if (!next.empty())\n flag = true;\n REP(j, edge[tar].size()) {\n int to = edge[tar][j];\n if (--cnt[to] == 0)\n next.push(to);\n }\n }\n REP(i, ans.size()) printf(\"%d\\n\", ans[i]);\n if (flag)\n puts(\"1\");\n else\n puts(\"0\");\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3936, "score_of_the_acc": -0.0474, "final_rank": 11 }, { "submission_id": "aoj_0519_8497572", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\ntemplate<class T>\nbool chmax(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\ntemplate<class T>\nbool chmin(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p > q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n ll N,M;\n cin>>N>>M;\n vvll G(N);\n vll E(N,0);\n rep(i,M){\n ll U,V;\n cin>>U>>V;\n U--;V--;\n G[U].push_back(V);\n E[V]++;\n }\n queue<ll> Q;\n vll AN;\n vb seen(N,false);\n rep(i,N)if(E[i]==0)Q.push(i);\n while(!Q.empty()){\n ll p=Q.front();\n Q.pop();\n if(seen[p])continue;\n seen[p]=1;\n AN.push_back(p);\n for(auto v:G[p]){\n E[v]--;\n if(E[v]==0&&!seen[v])Q.push(v);\n }\n }\n bool OK=0;\n rep(i,N-1){\n bool EG=0;\n for(auto v:G[AN[i]])if(v==AN[i+1])EG=1;\n if(!EG)OK=1;\n }\n rep(i,N)cout<<AN[i]+1<<endl;\n cout<<OK<<endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4808, "score_of_the_acc": -0.1197, "final_rank": 15 }, { "submission_id": "aoj_0519_8214854", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\n#define repi(i, m, n) for (int i = m; i < n; i++)\n#define rep(i, n) repi(i, 0, n)\ntypedef pair<int, int> P;\ntypedef vector<int> vi;\nconst int inf = 1e9 + 7;\nconst int INF = 1e18 + 7;\nclass t_sort {\npublic:\n int n;\n vi ans, deg;\n vector<vi> G;\n void init(int N) {\n n = N;\n deg.resize(n);\n G.resize(n);\n }\n void add_edge(int from, int to) {\n G[from].push_back(to);\n deg[to]++;\n }\n void tsort() {\n stack<int> st;\n rep(i, n) if (deg[i] == 0) st.push(i);\n while (!st.empty()) {\n int v = st.top();\n st.pop();\n ans.push_back(v);\n rep(i, G[v].size()) if (--deg[G[v][i]] == 0) st.push(G[v][i]);\n }\n }\n};\nmap<P, int> mp;\nsigned main() {\n int n, m;\n scanf(\"%lld%lld\", &n, &m);\n t_sort t;\n t.init(n);\n rep(i, m) {\n int x, y;\n scanf(\"%lld%lld\", &x, &y);\n x--;\n y--;\n t.add_edge(x, y);\n mp[P(x, y)] = 1;\n }\n t.tsort();\n vi ans = t.ans;\n rep(i, n) printf(\"%lld\\n\", ans[i] + 1);\n int res = 1;\n rep(i, n - 1) {\n if (mp[P(ans[i], ans[i + 1])] == 0)\n res = 0;\n }\n printf(\"%lld\\n\", res == 1 ? 0 : 1);\n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 11028, "score_of_the_acc": -0.6748, "final_rank": 18 }, { "submission_id": "aoj_0519_8214820", "code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, n) FOR(i, 0, n)\nint n, m;\nvector<int> edge[5000];\nint cnt[5000];\nint main() {\n cin >> n >> m;\n REP(i, m) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n a--;\n b--;\n edge[a].push_back(b);\n cnt[b]++;\n }\n vector<int> ans;\n bool flag = false;\n vector<int> next;\n REP(i, n) if (cnt[i] == 0) next.push_back(i);\n REP(i, n) {\n int tar = next[next.size() - 1];\n ans.push_back(tar + 1);\n next.erase(next.end() - 1);\n if (next.size() > 0)\n flag = true;\n REP(j, edge[tar].size()) {\n int to = edge[tar][j];\n if (--cnt[to] == 0)\n next.push_back(to);\n }\n }\n REP(i, ans.size()) printf(\"%d\\n\", ans[i]);\n if (flag)\n puts(\"1\");\n else\n puts(\"0\");\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3944, "score_of_the_acc": -0.0481, "final_rank": 12 }, { "submission_id": "aoj_0519_8214819", "code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, n) FOR(i, 0, n)\ntypedef pair<int, int> pii;\nint n, m;\nvector<int> edge[5000];\nint cnt[5000];\nint main() {\n cin >> n >> m;\n REP(i, m) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n a--;\n b--;\n edge[a].push_back(b);\n cnt[b]++;\n }\n vector<int> ans;\n bool flag = false;\n vector<int> next;\n REP(i, n) if (cnt[i] == 0) next.push_back(i);\n REP(i, n) {\n int tar = next[next.size() - 1];\n ans.push_back(tar + 1);\n next.erase(next.end() - 1);\n if (next.size() > 0)\n flag = true;\n REP(j, edge[tar].size()) {\n int to = edge[tar][j];\n if (--cnt[to] == 0)\n next.push_back(to);\n }\n }\n REP(i, ans.size()) printf(\"%d\\n\", ans[i]);\n if (flag)\n puts(\"1\");\n else\n puts(\"0\");\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3860, "score_of_the_acc": -0.0411, "final_rank": 5 }, { "submission_id": "aoj_0519_8207469", "code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, n) FOR(i, 0, n)\ntypedef pair<int, int> pii;\nint n, m;\nvector<int> edge[5000];\nint cnt[5000];\nint main() {\n cin >> n >> m;\n REP(i, m) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n a--;\n b--;\n edge[a].push_back(b);\n cnt[b]++;\n }\n vector<int> ans;\n bool flag = false;\n vector<int> next;\n REP(i, n) if (cnt[i] == 0) next.push_back(i);\n REP(i, n) {\n int tar = next[next.size() - 1];\n ans.push_back(tar + 1);\n next.pop_back();\n if (next.size() > 0)\n flag = true;\n REP(j, edge[tar].size()) {\n int to = edge[tar][j];\n if (--cnt[to] == 0)\n next.push_back(to);\n }\n }\n REP(i, ans.size()) printf(\"%d\\n\", ans[i]);\n if (flag)\n puts(\"1\");\n else\n puts(\"0\");\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3932, "score_of_the_acc": -0.0471, "final_rank": 10 }, { "submission_id": "aoj_0519_8115268", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\n#define UNIQUE(v) v.erase(unique(all(v)), v.end());\n#define ZIP(v) sort(all(v)), UNIQUE(v)\n#define ADD(a, b) a = (a + b) % mod\n#define SUB(a, b) a = (a + mod - b) % mod\n#define MUL(a, b) a = (a * b) % mod\n#define repi(i, m, n) for (int i = m; i < n; i++)\n#define drep(i, n, m) for (int i = n; i >= m; i--)\n#define rep(i, n) repi(i, 0, n)\n#define rrep(i, n) repi(i, 1, n + 1)\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\n#define all(v) v.begin(), v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define dmp(x, y) make_pair(x, y)\n#define pb(x) push_back(x)\n#define fi first\n#define se second\ntypedef pair<int, int> P;\ntypedef pair<int, P> PP;\ntypedef vector<int> vi;\ntypedef deque<int> dq;\nconst int inf = 1e9 + 7;\nconst int INF = 1e18 + 7;\n\nconst int MAX_N = 2e5 + 5;\nint n, m, res;\nvector<int> ans, deg, G[MAX_N], top_sort;\nmap<P, int> mp;\n\nvoid init() {\n rep(i, n) deg.pb(0);\n}\n\nvoid add_edge(int from, int to) {\n G[from].pb(to);\n deg[to]++;\n}\n\nvoid tsort() {\n stack<int> st;\n rep(i, n) if (deg[i] == 0) st.push(i);\n while (!st.empty()) {\n int v = st.top();\n st.pop();\n top_sort.pb(v);\n rep(i, G[v].size()) if (--deg[G[v][i]] == 0) st.push(G[v][i]);\n }\n}\n\nsigned main() {\n scanf(\"%lld%lld\", &n, &m);\n init();\n rep(i, m) {\n int x, y;\n scanf(\"%lld%lld\", &x, &y);\n x--;\n y--;\n add_edge(x, y);\n mp[P(x, y)] = 1;\n }\n tsort();\n ans = top_sort;\n rep(i, n) printf(\"%lld\\n\", ans[i] + 1);\n rep(i, n - 1) {\n if (mp[P(ans[i], ans[i + 1])] == 0) res = 1;\n }\n printf(\"%lld\\n\", res);\n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 15428, "score_of_the_acc": -1.0395, "final_rank": 19 }, { "submission_id": "aoj_0519_8115255", "code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, n) FOR(i, 0, n)\ntypedef pair<int, int> pii;\nint n, m;\nvector<int> edge[5000];\nint cnt[5000];\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout.tie(NULL);\n scanf(\"%d %d\", &n, &m);\n REP(i, m) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n a--;\n b--;\n edge[a].push_back(b);\n cnt[b]++;\n }\n vector<int> ans;\n bool flag = false;\n vector<int> next;\n REP(i, n) if (cnt[i] == 0) next.push_back(i);\n REP(i, n) {\n int tar = next.back();\n next.pop_back();\n ans.push_back(tar + 1);\n if (!next.empty())\n flag = true;\n REP(j, edge[tar].size()) {\n int to = edge[tar][j];\n if (--cnt[to] == 0)\n next.push_back(to);\n }\n }\n REP(i, ans.size()) printf(\"%d\\n\", ans[i]);\n if (flag)\n puts(\"1\");\n else\n puts(\"0\");\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3896, "score_of_the_acc": -0.0441, "final_rank": 8 }, { "submission_id": "aoj_0519_8112570", "code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, n) FOR(i, 0, n)\ntypedef pair<int, int> pii;\nint n, m;\nvector<int> edge[5000];\nint cnt[5000];\nint main() {\n cin >> n >> m;\n REP(i, m) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n a--;\n b--;\n edge[a].push_back(b);\n cnt[b]++;\n }\n vector<int> ans;\n bool flag = false;\n vector<int> next;\n REP(i, n) if (cnt[i] == 0) next.push_back(i);\n REP(i, n) {\n int tar = next[next.size() - 1];\n ans.push_back(tar + 1);\n next.erase(next.end() - 1);\n if (next.size() > 0)\n flag = true;\n REP(i, edge[tar].size()) {\n int to = edge[tar][i];\n if (--cnt[to] == 0)\n next.push_back(to);\n }\n }\n REP(i, ans.size()) printf(\"%d\\n\", ans[i]);\n if (flag)\n puts(\"1\");\n else\n puts(\"0\");\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3880, "score_of_the_acc": -0.0428, "final_rank": 6 }, { "submission_id": "aoj_0519_8112568", "code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <iostream>\n#include <vector>\nusing namespace std;\n#define FOR(i, a, b) for (int i = (a); i < (b); i++)\n#define REP(i, n) FOR(i, 0, n)\ntypedef pair<int, int> pii;\nint n, m;\nvector<int> edge[5000];\nint cnt[5000];\nint main() {\n cin >> n >> m;\n REP(i, m) {\n int a, b;\n scanf(\"%d %d\", &a, &b);\n a--;\n b--;\n edge[a].push_back(b);\n cnt[b]++;\n }\n vector<int> ans;\n bool flag = false;\n vector<int> next;\n REP(i, n) if (cnt[i] == 0) next.push_back(i);\n REP(i, n) {\n int tar = next[next.size() - 1];\n ans.push_back(tar + 1);\n next.erase(next.end() - 1);\n if (next.size() > 0)\n flag = true;\n REP(j, edge[tar].size())\n if (--cnt[edge[tar][j]] == 0)\n next.push_back(edge[tar][j]);\n }\n REP(i, ans.size()) printf(\"%d\\n\", ans[i]);\n if (flag)\n puts(\"1\");\n else\n puts(\"0\");\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3920, "score_of_the_acc": -0.0461, "final_rank": 9 } ]
aoj_0524_cpp
星座探し 問題 あなたは星空の写真の中から星座を探している．写真には必ず，探したい星座と同じ形・向き・大きさの図形がちょうど一つ含まれている．ただし，写真の中には星座を構成する星以外に余分な星が写っている可能性がある． 例えば，図 1 の星座は図 2 の写真に含まれている（丸で囲んで示した）．与えられた星座の星の座標を x 方向に 2， y 方向に −3 だけ平行移動すると写真の中の位置になる． 探したい星座の形と写真に写っている星の位置が与えられたとき，星座の座標を写真の中の座標に変換するために平行移動するべき量を答えるプログラムを書け． 図 1: 探したい星座 図 2: 星空の写真 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる． 入力の 1 行目には探したい星座を構成する星の個数 m が書かれている．続く m 行には探したい星座を構成する m 個の星の x 座標と y 座標を示す整数が空白区切りで書かれている． m +2 行目には写真に写っている星の個数 n が書かれている．続く n 行には写真に写っている n 個の星の x 座標と y 座標を示す整数が空白区切りで書かれている． 星座を構成する m 個の星の位置はすべて異なる．また，写真に写っている n 個の星の位置はすべて異なる． 1 ≤ m ≤ 200， 1 ≤ n ≤ 1000 である．星の x 座標と y 座標はすべて 0 以上 1000000 以下である． m が 0　のとき入力の終わりを示す. データセットの数は 5 を超えない． 出力 各データセットの出力は 1 行からなり， 2 個の整数を空白区切りで書く．これらは探したい星座の座標をどれだけ平行移動すれば写真の中の座標になるかを表す．最初の整数が x 方向に平行移動する量，次の整数が y 方向に平行移動する量である． 入出力例 入力例 5 8 5 6 4 4 3 7 10 0 10 10 10 5 2 7 9 7 8 10 10 2 1 2 8 1 6 7 6 0 0 9 5 904207 809784 845370 244806 499091 59863 638406 182509 435076 362268 10 757559 866424 114810 239537 519926 989458 461089 424480 674361 448440 81851 150384 459107 795405 299682 6700 254125 362183 50795 541942 0 出力例 2 -3 -384281 179674 入出力例の１つ目は上の図に対応している． 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0524_6791636", "code_snippet": "#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n// #include <atcoder/modint>\n// #include <atcoder/fenwicktree>\n// #include <atcoder/segtree>\n// #include <atcoder/scc>\n\n#define int long long\n#define all(x) begin(x), end(x)\n\nusing namespace std;\n// using namespace atcoder;\n// using mint = modint998244353;\n// using mint = modint1000000007;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing vvvi = vector<vector<vector<int>>>;\nusing vp = vector<pii>;\nusing vs = vector<string>;\n\nvoid debug(vector<int> a) {\n for (auto x : a) cout << x << ' ';\n cout << endl;\n}\n\nvoid debug(vector<vector<int>> a) {\n for (auto y : a) debug(y);\n}\n\ntemplate <typename T1, typename T2>\ninline bool chmax(T1 &a, T2 b) {return a < b and (a = b, true);}\n\ntemplate <typename T1, typename T2>\ninline bool chmin(T1 &a, T2 b) {return a > b and (a = b, true);}\n\n// inline bool in(int y, int x) {return 0 <= x and x < w and 0 <= y and y < h;}\n\nconst int supl = 1e18 - 100;\n\npii solve(int m) {\n vp ps(m);\n for (auto& [y, x] : ps) cin >> x >> y;\n set<pii> st;\n int n; cin >> n;\n for (int _ = 0 ; _ < n ; _++) {\n int y, x; cin >> x >> y;\n st.insert(make_pair(y, x));\n }\n\n\n int ansy, ansx;\n for (auto [ny, nx] : st) {\n // cout << ny << ' ' << nx << endl;\n int movey = ny - ps[0].first;\n int movex = nx - ps[0].second;\n // cout << movey << ' ' << movex << endl << endl;\n bool ok = true;\n for (auto [y, x] : ps) {\n if (!st.count(make_pair(y + movey, x + movex))) ok = false;\n }\n if (ok) {\n ansy = movey, ansx = movex;\n }\n }\n\n return {ansy, ansx};\n}\n\nvoid main_() {\n while(1) {\n int m; cin >> m;\n if (!m) break;\n auto [y, x] = solve(m);\n cout << x << ' ' << y << endl;\n }\n}\n\nsigned main() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n\n main_();\n\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3224, "score_of_the_acc": -0.0068, "final_rank": 12 }, { "submission_id": "aoj_0524_6709508", "code_snippet": "#include <bits/stdc++.h>\n//#include <atcoder/all>\n//using namespace atcoder;\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\nusing vd = vector<double>;\nusing vvd = vector<vd>;\nusing vvvd = vector<vvd>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\nusing pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;\n\ntemplate<class T>\nbool chmax(T& p, T q) {\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\ntemplate<class T>\nbool chmin(T& p, T q) {\n if (p > q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\nll gcd(ll(a), ll(b)) {\n ll c = a;\n while (a % b != 0) {\n c = a % b;\n a = b;\n b = c;\n }\n return b;\n}\nll modPow(long long a, long long n, long long p) {\n if (n == 0) return 1; // 0乗にも対応する場合\n if (n == 1) return a % p;\n if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;\n long long t = modPow(a, n / 2, p);\n return (t * t) % p;\n}\n\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n while(1){\n ll N;\n cin>>N;\n if(N==0)return 0;\n vector<pair<ll,ll>> P(N);\n rep(i,N){\n cin>>P[i].first>>P[i].second;\n }\n ll M;\n cin>>M;\n set<pair<ll,ll>> Q;\n rep(i,M){\n ll X,Y;\n cin>>X>>Y;\n Q.insert({X,Y});\n }\n for(auto q:Q){\n ll dx=q.first-P[0].first;\n ll dy=q.second-P[0].second;\n bool C=1;\n rep(i,N){\n ll x=dx+P[i].first;\n ll y=dy+P[i].second;\n if(!Q.count({x,y}))C=0;\n }\n if(C){\n cout<<dx<<\" \"<<dy<<endl;\n break;\n }\n }}\n\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3428, "score_of_the_acc": -0.013, "final_rank": 13 }, { "submission_id": "aoj_0524_5878968", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\ntypedef long long ll;\ntypedef pair<long long, long long> P;\nconst long long INF = 1e9;\nconst ll MOD = MOD1;\ntemplate <typename T>\nvoid input_arr(vector<T>& A, ll N) {\n for (ll i = 0; i < N; i++) {\n cin >> A[i];\n }\n}\ntemplate <typename T, typename Q>\nvoid input_arr(vector<pair<T, Q>>& A, ll N) {\n for (ll i = 0; i < N; i++) {\n cin >> A[i].first >> A[i].second;\n }\n}\nint main() {\n ll M; cin >> M;\n while (M != 0) {\n vector<P>A(M); input_arr(A, M);\n ll N; cin >> N;\n vector<vector<ll>>B(1000001);\n vector<P>C(N);\n for (ll i = 0; i < N; i++) {\n ll x, y; cin >> x >> y;\n C[i] = make_pair(x, y);\n B[x].push_back(y);\n }\n \tfor (ll i = 0; i <= 1000000; i++) {\n \tif (B[i].empty()) continue;\n \tsort(B[i].begin(),B[i].end());\n }\n for(ll i = 0; i < N; i++) {\n ll dx = C[i].first - A[0].first;\n ll dy = C[i].second - A[0].second;\n bool check = true;\n for (ll j = 0; j < M; j++) {\n if (A[j].first + dx < 0 || A[j].first + dx > 1000000 || A[j].second + dy < 0 || A[j].second + dy > 1000000) {\n check = false;\n break;\n }\n if (!binary_search(B[A[j].first + dx].begin(), B[A[j].first + dx].end(), A[j].second + dy)) {\n check = false;\n break;\n }\n }\n if (check) {\n cout << dx << ' ' << dy << endl;\n break;\n }\n }\n cin >> M;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 26916, "score_of_the_acc": -0.7263, "final_rank": 18 }, { "submission_id": "aoj_0524_5035577", "code_snippet": "#include<iostream>\n#include<vector>\n\nstruct Coord{\n int x,y;\n Coord() : x(0), y(0) {}\n};\n\nbool check(std::vector<Coord> target,\n std::vector<Coord> sky,\n Coord diff){\n for(int m=1; m<target.size(); ++m){\n int dx = target[m].x + diff.x;\n int dy = target[m].y + diff.y;\n bool found=false;\n for(int n=0; n<sky.size(); ++n){\n if(sky[n].x == dx && sky[n].y == dy)\n found=true;\n }\n if(!found) return false;\n }\n std::cout << diff.x << ' ' << diff.y << std::endl;\n return true;\n};\n\nint main(){\n int M,N;\n while(std::cin >> M, M){\n std::vector<Coord> target(M);\n for(int i=0; i<M; ++i)\n std::cin >> target[i].x >> target[i].y;\n std::cin >> N;\n std::vector<Coord> sky(N);\n for(int i=0; i<N; ++i)\n std::cin >> sky[i].x >> sky[i].y;\n\n for(int i=0; i<N; ++i){\n Coord diff;\n diff.x = sky[i].x - target[0].x;\n diff.y = sky[i].y - target[0].y;\n if(check(target, sky, diff))\n break;\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3108, "score_of_the_acc": -0.0033, "final_rank": 6 }, { "submission_id": "aoj_0524_4675263", "code_snippet": "#include<iostream>\n#include<string>\n#include<algorithm> \n#include<cmath>\n#include<map>\n#include<vector>\n#include<math.h>\n#include<stdio.h>\n#include<stack>\n#include<queue>\n#include<tuple>\n#include<cassert>\n#include<set>\n#include<functional>\n//#include<bits/stdc++.h>\n#define rep(i, x) for(ll i = 0; i < x; i++)\n#define all(a) (a).begin(),(a).end()\nusing ll = long long;\nusing ld = long double;\nusing namespace std;\nconst ll INF = 1000000000000000000;\nconst ll mod = 1000000007;\nconst ld pi = 3.141592653589793238;\n\nll gcd(ll a, ll b) {\n\tif (a < b)swap(a, b);\n\tif (a % b == 0)return b;\n\treturn gcd(b, a % b);\n}\nll lcm(ll a, ll b) {\n\treturn a / gcd(a, b) * b;\n}\nll modpow(ll x, ll y) {\n\tll res = 1;\n\twhile (y) {\n\t\tif (y % 2) { res *= x; res %= mod; }\n\t\tx = x * x % mod; y /= 2;\n\t}\n\treturn res;\n}\nll keta(ll n) {\n\tll res = 0;\n\twhile (n >= 1) {\n\t\tres += n % 10; n /= 10;\n\t}\n\treturn res;\n}\nll nCk(ll n, ll k) {\n\tll a = 1, b = 1;\n\tfor (int h = n - k + 1; h <= n; h++) { a *= h; a %= mod; }\n\tfor (int h = 1; h <= k; h++) { b *= h; b %= mod; }\n\treturn a * modpow(b, mod - 2) % mod;\n}\nbool IsPrime(ll num) {\n\tif (num < 2) return false;\n\telse if (num == 2) return true;\n\telse if (num % 2 == 0) return false; // 偶数はあらかじめ除く\n\tdouble sqrtNum = sqrt(num);\n\tfor (int i = 3; i <= sqrtNum; i += 2) {\n\t\tif (num % i == 0) { // 素数ではない\n\t\t\treturn false;\n\t\t}\n\t}\n\t// 素数である\n\treturn true;\n}\n//printf(\"%.10f\\n\", n);\n\nll x[1234567], y[1234567];\nsigned main() {\n while(true){\n\tll m, n, a, b; cin >> m; map<ll, map<ll, ll>>ma;\n\tif(m==0){return 0;}\n\tvector<ll> v1, v2;\n\trep(i, m) {\n\t\tcin >> x[i] >> y[i];\n\t}\n\tcin >> n;\n\trep(i, n) {\n\t\tcin >> a >> b;\n\t\trep(j, m) {\n\t\t\tif (ma[a - x[j]][b - y[j]] == 0) {\n\t\t\t\tv1.push_back(a - x[j]); v2.push_back(b - y[j]);\n\t\t\t}\n\t\t\tma[a - x[j]][b - y[j]]++;\n\t\t}\n\t}\n\trep(i, v1.size()) {\n\t\t//cout << v1[i] << ' ' << v2[i] << ' ' << ma[v1[i]][v2[i]] << endl;\n\t\tif (ma[v1[i]][v2[i]] == m) {\n\t\t\tcout << v1[i] << ' ' << v2[i] << endl;break;\n\t\t}\n\t}\n }\n\treturn 0;\n}", "accuracy": 1, "time_ms": 190, "memory_kb": 35928, "score_of_the_acc": -1.5143, "final_rank": 20 }, { "submission_id": "aoj_0524_4551768", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll=long long;\nconst ll INF=1LL<<60;\nconst ll MOD=1e9+7;\n\nstruct Point{\n int x;\n int y;\n};\n\n\nint main(){\n while(1){\n int m; cin >> m;\n if(m == 0) break;\n vector<Point> point1(m);\n for(int i=0; i<m; i++){\n cin >> point1[i].x >> point1[i].y; \n }\n int n; cin >> n;\n vector<Point> point2(n);\n for(int i=0; i<n; i++){\n cin >> point2[i].x >> point2[i].y;\n }\n Point res;\n for(int i=0; i<n; i++){\n int dx=point2[i].x-point1[0].x;\n int dy=point2[i].y-point1[0].y;\n bool ok;\n for(int j=1; j<m; j++){\n ok=false;\n int nx=point1[j].x+dx;\n int ny=point1[j].y+dy;\n for(int k=0; k<n; k++){\n if(point2[k].x == nx && point2[k].y == ny) ok=true;\n }\n if(!ok) break;\n }\n if(ok){\n res.x=dx;\n res.y=dy;\n }\n }\n cout << res.x << \" \" << res.y << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3000, "score_of_the_acc": 0, "final_rank": 1 }, { "submission_id": "aoj_0524_4416874", "code_snippet": "#include <bits/stdc++.h>\n#define int long long\n#define double long double\n#define rep(i, a, n) for(int i = (int)(a);(i) < (int)(n);++(i))\n#define repe(i, a, n) for(int i = (int)(a);(i) <= (int)(n);++(i))\n#define repif(i, a, x) for(int i = (int)(a);(x);++(i))\n#define repr(i, a, n) for(int i = ((int)(a)-1);(i) >= (int)(n);--(i))\n#define reper(i, a, n) for(int i = (int)(a);(i) >= (int)(n);--(i))\n#define SZ(x) ((int)(x).size())\n#define ALL(x) begin(x), end(x)\n#define CEIL(x) ((int)ceil(((double)x)))\n#define POW(x, y) ((int)pow(x, y))\n#define UNIQUE(x) (x).erase(unique(ALL((x))), end(x))\n#define gcd(x, y) __gcd(x, y)\n#define lcm(x, y) ((x)/gcd(x,y)*(y))\n#define isin(x, l, r) ((l) <= (x) and (x) < (r))\n#define fcout(n) cout << fixed << setprecision(n)\n#define rcout(n) cout << right << setw(n)\n#define pb push_back\n#define eb emplace_back\n#define lb lower_bound\n#define ub upper_bound\n#define PI (acosl(-1))\n#define EPS (1e-10)\n#define INF LLONG_MAX\n#define INF32 INT32_MAX\n#define MOD 1000000007LL\nusing namespace std;\nusing VI = vector<int>;\nusing PII = pair<int, int>;\nusing TIII = tuple<int, int, int>;\nusing VPII = vector<PII>;\nusing VTIII = vector<TIII>;\nusing Complex = complex<double>;\ntemplate<typename T, template<typename> typename C = less> using PQ = priority_queue<T, vector<T>, C<T>>;\ntemplate<typename T> bool chmax(T& a, const T& b, bool t = false){ if(a<b or (t and a == b)){ a=b; return true; } return false; }\ntemplate<typename T> bool chmin(T& a, const T& b, bool t = false){ if(a>b or (t and a == b)){ a=b; return true; } return false; }\n\n\nsigned main(){\n int m;\n while(cin >> m, m){\n vector<PII> v(m);\n rep(i, 0, m) cin >> v[i].first >> v[i].second;\n int n;\n cin >> n;\n vector<PII> u(n);\n map<PII, bool> mp;\n rep(i, 0, n) cin >> u[i].first >> u[i].second, mp[u[i]] = true;\n int dx = -1, dy = -1;\n rep(i, 0, n){\n dx = u[i].first-v[0].first;\n dy = u[i].second-v[0].second;\n bool f = true;\n rep(j, 0, m) if(!mp[make_pair(v[j].first+dx, v[j].second+dy)]) f = false;\n if(f) break;\n }\n cout << dx << ' ' << dy << endl;\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 10928, "score_of_the_acc": -0.3551, "final_rank": 16 }, { "submission_id": "aoj_0524_4404538", "code_snippet": "#include<bits/stdc++.h>\n#define enld '\\n'\n#define rep(i,n) for(int i=0; i<(n); i++)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"Ofast\")\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\nconstexpr ll mod = 1000000007;\nconstexpr ll mod2 = 998244353;\nconst double PI = 3.1415926535897932384626433832795028841971;\nconst int dx[6] = {1, 0, -1, 0,1,1};\nconst int dy[6] = {0, 1, 0, -1,1,-1};\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n// ---------------------------------------------------------------------------\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N;\n cin >> N;\n while(N != 0){\n int x0,y0;\n cin >> x0 >> y0;\n vector<P> hosi(N-1);\n for(int i=0; i<N-1; i++){\n int a,b;\n cin >> a >> b;\n a -= x0;\n b -= y0;\n hosi[i] = P(a,b);\n }\n int M;\n cin >> M;\n set<P> suzu;\n for(int i=0; i<M; i++){\n int a,b;\n cin >> a >> b;\n suzu.emplace(a,b);\n }\n int ans_x,ans_y;\n for(auto ken: suzu){\n int x = ken.first;\n int y = ken.second;\n bool can = true;\n for(int i=0; i<N-1; i++){\n if(!suzu.count(P(x+hosi[i].first,y+hosi[i].second))) can = false;\n }\n if(can){\n ans_x = x;\n ans_y = y;\n }\n }\n cout << ans_x-x0 << \" \" << ans_y-y0 << enld;\n cin >> N;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3080, "score_of_the_acc": -0.0024, "final_rank": 4 }, { "submission_id": "aoj_0524_4222943", "code_snippet": "#include <bits/stdc++.h>\n\n#define REP(i, n) for (int i = 0; i < n; i++)\n#define ALL(obj) obj.begin(), obj.end()\n\ntemplate <class T>\ninline bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <class T>\ninline bool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\n\nconst int iINF = 1e9;\nconst long long llINF = 1e18;\nconst int MOD = 1e9 + 7;\n\nusing namespace std;\n\nint nx[1010], ny[1010], mx[210], my[210];\nset<pair<int, int>> s;\n\nvoid solve(int m) {\n int n;\n REP(i, m) { cin >> mx[i] >> my[i]; }\n cin >> n;\n REP(i, n) {\n cin >> nx[i] >> ny[i];\n s.insert(make_pair(nx[i], ny[i]));\n }\n REP(i, m) {\n REP(j, n) {\n bool flag1 = true;\n bool flag2 = true;\n int dx = nx[j] - mx[i];\n int dy = ny[j] - my[i];\n\n REP(k, m) {\n auto nnx = dx + mx[k];\n auto nny = dy + my[k];\n\n if (!s.count(make_pair(nnx, nny))) {\n flag1 = false;\n }\n }\n\n if (flag1) {\n cout << dx << \" \" << dy << endl;\n return;\n }\n\n dx = -dx;\n dy = -dy;\n\n REP(k, m) {\n auto nnx = dx + mx[k];\n auto nny = dy + my[k];\n\n if (!s.count(make_pair(nnx, nny))) {\n flag2 = false;\n }\n }\n\n if (flag2) {\n cout << dx << \" \" << dy << endl;\n return;\n }\n }\n }\n}\n\nint main() {\n int m;\n while (cin >> m && m) {\n solve(m);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3252, "score_of_the_acc": -0.0362, "final_rank": 14 }, { "submission_id": "aoj_0524_4185091", "code_snippet": "#define _USE_MATH_DEFINES\n#include <bits/stdc++.h>\nusing namespace std;\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(v) (v).begin(),(v).end()\nusing ll = long long;\ntemplate <typename T> using posteriority_queue = priority_queue<T, vector<T>, greater<T> >;\nconst int INF = 0x3f3f3f3f;\nconst ll LINF = 0x3f3f3f3f3f3f3f3fLL;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007;\n// const int MOD = 998244353;\nconst int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};\nconst int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};\ntemplate <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }\ntemplate <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }\ntemplate <typename T> void unique(vector<T> &a) { a.erase(unique(ALL(a)), a.end()); }\nstruct IOSetup {\n IOSetup() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n }\n} iosetup;\n\nvoid solve(int m) {\n vector<int> m_x(m), m_y(m); REP(i, m) cin >> m_x[i] >> m_y[i];\n int n; cin >> n;\n vector<int> n_x(n), n_y(n);\n set<pair<int, int> > st;\n REP(i, n) {\n cin >> n_x[i] >> n_y[i];\n st.emplace(n_x[i], n_y[i]);\n }\n REP(i, n) {\n int dX = n_x[i] - m_x[0], dY = n_y[i] - m_y[0];\n bool ans = true;\n REP(j, m) ans &= st.count(make_pair(m_x[j] + dX, m_y[j] + dY)) == 1;\n if (ans) {\n cout << dX << ' ' << dY << '\\n';\n return;\n }\n }\n assert(false);\n}\n\nint main() {\n while (true) {\n int m; cin >> m;\n if (m == 0) break;\n solve(m);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3080, "score_of_the_acc": -0.0024, "final_rank": 4 }, { "submission_id": "aoj_0524_4143662", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing P = pair<int,int>;\n\nint main(){\n int n, m;\n while(cin >> m, m){\n vector<P> a(m);\n set<P> st;\n for(int i=0;i<m;i++){\n int x, y;\n cin >> x >> y;\n a[i] = P(x,y);\n }\n cin >> n;\n for(int i=0;i<n;i++){\n int x, y;\n cin >> x >> y;\n st.insert(P(x,y));\n }\n for(int i=1;i<m;i++){\n a[i].first -= a[0].first;\n a[i].second -= a[0].second;\n }\n for(auto p : st){\n int x0 = p.first, y0 = p.second;\n bool ok = true;\n for(int i=1;i<m;i++){\n ok &= st.count(P(a[i].first+x0,a[i].second+y0)) > 0;\n }\n if(ok){\n int dx, dy;\n dx = x0-a[0].first; dy = y0-a[0].second;\n cout << dx << \" \" << dy << endl;\n break;\n }\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3152, "score_of_the_acc": -0.0046, "final_rank": 11 }, { "submission_id": "aoj_0524_4124866", "code_snippet": "#include<bits/stdc++.h>\n#define int long long\nusing namespace std;\nconstexpr int mod=1e9+7;\nsigned main(){\n int m,x[200],y[200],n,a,b;\n while(cin>>m,m){\n for(int i=0;i<m;i++)\n cin>>x[i]>>y[i];\n set<pair<int,int>>st;\n cin>>n;\n for(int i=0;i<n;i++){\n cin>>a>>b;\n st.emplace(a,b);\n }\n for(auto e:st){\n bool ok=1;\n int dx=e.first-x[0],dy=e.second-y[0];\n for(int i=0;i<m;i++)\n if(!st.count(make_pair(dx+x[i],dy+y[i])))\n ok=0;\n if(ok){\n cout<<dx<<' '<<dy<<endl;\n break;\n }\n }}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3148, "score_of_the_acc": -0.0045, "final_rank": 9 }, { "submission_id": "aoj_0524_3482014", "code_snippet": "#include<iostream>\nusing namespace std;\n\nclass Point\n{\n private:\n int x, y;\n\n public:\n Point( int x = 0, int y = 0 );\n void setXY( int a, int b ){ x = a; y = b; }\n int getX(){ return x; }\n int getY(){ return y; }\n bool operator==( Point a );\n Point operator+( Point a );\n Point operator-( Point a );\n};\n\nPoint::Point( int a, int b )\n{\n x = a;\n y = b;\n}\n\nbool Point::operator==( Point a )\n{\n if( x == a.x && y == a.y )\n return true;\n else\n return false;\n}\n\nPoint Point::operator+( Point a )\n{\n Point res;\n res.x = x + a.x;\n res.y = y + a.y;\n \n return res;\n}\n\nPoint Point::operator-( Point a )\n{\n Point res;\n res.x = x - a.x;\n res.y = y - a.y;\n \n return res;\n}\n\n\nint main()\n{\n int n, m, x, y;\n\n while( cin >> n )\n {\n if( !n )\n break;\n\n Point a[n];\n for( int i = 0; i < n; i++ )\n {\n cin >> x >> y;\n a[i].setXY( x, y );\n }\n\n cin >> m;\n\n Point b[m];\n for( int i = 0; i < m; i++ )\n {\n cin >> x >> y;\n b[i].setXY( x, y );\n }\n\n Point c[m];\n for( int i = 0; i < m; i++ )\n c[i] = b[i] - a[0];\n\n for( int i = 0; i < m; i++ )\n {\n bool judge = true;\n for( int j = 0; j < n; j++ )\n {\n Point d = a[j] + c[i];\n\n bool judge2 = false;\n for( int k = 0; k < m; k++ )\n if( d == b[k] )\n judge2 = true;\n \n if( !judge2 )\n judge = false;\n }\n \n if( judge )\n {\n cout << c[i].getX() << \" \" << c[i].getY() << endl;\n break;\n }\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 3032, "score_of_the_acc": -0.4581, "final_rank": 17 }, { "submission_id": "aoj_0524_3456384", "code_snippet": "//\n//\n// Codeforces: ganariya\n// AtCoder: ganariya2525\n// MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM\n// MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM\n// MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM\n// MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMHBYYYWMMMM#BYYTTTYWMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM\n// MMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMB9O1==?????zzCC111>>;;;;;;;;;;;<?TMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM\n// MMMMMMMMMMMMMMMMMMMMMMMMMMMMMM9Olll=l======??????????>>>>>>;;;;;;;;;:;?TMMMMMMMMMMMMMMMMMMMMMMMMMMMM\n// MMMMMMMMMMMMMMMMMMMMMMMMMMM9ttlllllllll=l=======?????????>>>>>>;;;;;;;;;;?TMMMMMMMMMMMMMMMMMMMMMMMMM\n// MMMMMMMMMMMMMMMMMMMMMMMMBOttOtttttltlllllllll=======??????????>>>>>>>;;;;;;?TMMMMMMMMMMMMMMMMMMMMMMM\n// MMMMMMMMMMMMMMMMMMMMMMBttwOtttttttttttttlllllllll========?????????>>>>>>;;;;;<TMMMMMMMMMMMMMMMMMMMMM\n// MMMMMMMMMMMMMMMMMMMMBrwZrttttttttttttttttttlllllllllll======???????????>>>>>>;;?HMMMMMMMMMMMMMMMMMMM\n// MMMMMMMMMMMMMMMMMMMSw0trtrrtrtrttrtttttttttttttlllOllllll========????<<zz??>>>>>>ZMMMMMMMMMMMMMMMMMM\n// MMMMMMMMMMMMMMMMMMX0ttrtrOOttrttrttOOttttttttttttltwllllllllll========??wy?????>>>vZMMMMMMMMMMMMMMMM\n// MMMMMMMMMMMMMMMMM0ttrI+wV1rtttttttwZtttttttltttOwylOXOllllllllllll=l====1dkz???????vZdMMMMMMMMMMMMMM\n// MMMMMMMMMMMMMMMSrrwrtwZCjttttttttwSttOlllltllllwtXOlZkOlllllllllllllll==z+dk===?????X2JMMMMMMMMMMMMM\n// MMMMMMMMMMMMMBrtwwtrw0<jttttttttOXllOttltllttllOZwHOtXkyltlllllllllllllll<+XZ======?dk?JMMMMMMMMMMMM\n// MMMMMMMMMMMMStwdZtwXC<+ttttttOOOd6ltZlltllllttllStWWOOHWytttttltltOllltllz:zHllll===zX=?dMMMMMMMMMMM\n// MMMMMMMMMMBrwdKOtwW3;;zrttttwZwXRlldOllltltlltttwlXvktdXWytltttttttOttlttl<<dklllllllZ===dMMMMMMMMMM\n// MMMMMMMMM8tQM#ttwW3;;;1trttwSwfUOlORltllltlllllldtX>dktDOWOtlttltttOOttltO<;+WOllllllXlllzMMMMMMMMMM\n// MMMMMMMM9OdM#Ottd$;;;;;<?1z0OKjRltd0llltOllllllldZX>?WOw_WWOtttttttttOttI<;;<dkttttllllllldMMMMMMMMM\n// MMMMMMM9wMMMSttwS<;;;;>;;;J<j>(I<?U111zltllllllld0X>~dkwl(WkttlttlOOwWk<;;:;;zHttttttwOllllMMMMMMMMM\n// MMMMMMBdMMM8tttdI+zttttttdSXt~dlzXwlllzzOzzzzzlldkW<~?kOk~?sx++++jdHmH6+++<;;jdZtttttdkOtlldMMMMMMMM\n// MMMMM#dMMM#tttw0+tttttttdKdf((RsdfRllllldZllltlldWK~~_W0w_~OWOlOdgg9ZtOWOtttz+wktttttdpktttwMMMMMMMM\n// MMMMMWMMMMSlttdIttttttOdWHH>~(IzWDRll=llzRlllzlldk$>++dkd<~_XkdgH9tttttdktttt+OkrttrtdfpkttOMMMMMMMM\n// MMMMNWMMM#Zttlk=tttttOXWWd$_.(IdW1R=llll=SlllzOldK<_._(kd6+-(MM9lltttttrWktttztWZttrwXppWttrMMMMMMMM\n// MMMMNMMMM#lltwDzttllOXyW0X:..(OXk<Rl=ll=lwOlllOld3<``.(Rd>~?CdklllltttttXdXttzOWktrwwWpfpkrtMMMMMMMM\n// MMMMMMMMM@ltldIzlttOXyW$w$```(OyD(Rl==llldZ=llIlw;~```-Xd:~~~~UkylltttAyHdgSrzObRtOXwpfppWrrMMMMMMMM\n// MMMMMMMMM@llldtlllldVyW+d>```.wZ$ wl==lI=wRl=ll=w<```` dd_..~~(RZXOQdggHH9ZwrzwHWrdXXppfppkrMMMMMMMM\n// MMMMMMMMM#llldlltlwyyyD(S-...,Wk] zI=l=llzWzl=l=P~```` jZ``...~zQkH@MBUtrZtrtldHRdSdpfpffpkwMMMMMMMM\n// MMMMNMMMMNZllXtllldVyW3(Mf=<ONMHP~(k===l=zdk=lld3```...(C````..(M96lttttrrtrrtdHWHXpfpppfpRwMMMMMMMM\n// MMMMMMMMMMNzzWZllzyyyy(W@` =~MWK6 jz=lzlzvRz=lZ`.I+JgkWm&-. `..(ZltlttttrtttrWWHppfppfpppSdMMMMMMMM\n// MMMMMMMMMMMkAWRllzVyyS_(b .MNHU-(Uz=lI={XkzO>.dVT7<TMHMNHHx-.(kwZyltttrtrrdHHpfppfpffpp0dMMMMMMMM\n// MMMMMMMMMMMMKyWzOzyyyk.`<! hdWMH]``(S==t=l(kX2 ?_` WMMHH#HH+.XwkwOttttrwrZ~(HfpfpppfpWwXMMMMMMMM\n// MMMMMMMMMMMMMHWROOyyyW;` `. (WVM#b```(0=zzz wX!``` a.dM#NM@N(4WhXkXkWtttttwd3O_(HpffpfpfWwSMMMMMMMM\n// MMMMMMMMMMMMNZvWzXXyyXP```-_ ?o+?!````.4=Z=`(:```` HpbNNMHHH (C=XXyWZWttrdwf:(>.dfppffppSXSMMMMMMMM\n// MMMMMMMMMMMMMRzuHzXyZXH.``````````````` ?zz ``````` ZKvTHHbWt `` XZyyHZWOdSZ<::~`(fpfpfffXp0WMMMMMMM\n// MMMMMMMMMMMMMKzyyHvyZZW____.`````````````.I_```````` ?nJzX7^````.WXWyyHyWKZ<:::_`Jffpfpfpfp0WMMMMMMM\n// MMMMMMMMMMMMM@zZyZWwWyXo-_~(~ ```````````` `````````````` _`````.WXkyyVWmWc::<~ .HffppfffffkXMMMMMMM\n// MMMMMMMMMMMMMKzZZZZXkUXr~....```````....```````````` ... ````..JXWWyyW83vXx~..WfffVfWVffffkdMMMMMMM\n// MMMMMMMMMMMMMRzZZZZZZZZb````````````<````````````./<~._<_.____`(WfdyW3<:~~(XWkVVVVVVVHVVVVV0dMMMMMMM\n// MMMMMMMMMMMMMSzZZZZZZZWX-```````````````````````````.......~~._j9jX=_~~_(XZyVHHkyyyyWHyyykykOMMMMMMM\n// MMMMMMMMMMMMMSzuuuuuZXWZW,```````````````````````````````.``..(3<! ...JWyyXWyyyWHkyyWHyyyHyklMMMMMMM\n// MMMMMMMMMMMMNXzuuuXXuXSuuXh,```````` .... ```````````````````_~ .JWyyyyZyy0HyyZyyZyZXWZZZWHZIdMMMMMM\n// MMMMMMMMMMMMNwtuuuXkuXXuuuuXh,``````(:::~<?71(,``````````````.(UMNUkZZZZZZZHZZ0ZZZZZWWZZZWNXIdMMMMMM\n// MMMMMMMMMMMMNKOzuzXkuXuuuuuXuXW, ```` _~~~:~~(}```````````.(YC;::<kCfZZZZXO#ZZVZZZZZMZZuuMMNXzMMMMMM\n// MMMMMMMMMMMMHKOzzuXkzdzzzzuXXzuuU&.``````````````````` .JY>::::;;J=:dZuZuZd#uuruuuud#uuuXMMMNXdMMMMM\n// MMMMMMMMMMMMMNOvzzXkvMRzzzzXKzuzzzXh, `````````````..JC<;:;;:;;+7<:~(HHuXIdNuuzuuuXMSuuuWMMMMROMMMMM\n// MMMMMMMMMMMMMNvvvrdkvM#vzzzzHzzzzzuzzUG. ``` ...JdY<:;:;:::;;+v<~~~:(HpHmzMNXZzuzzd#zzzdMMMMMMRdMMMM\n// MMMMMMMMMMMMMNwrrvdRrMNwvvvvdRvvvzwkzzzzXWWHY=~~O+::::::::<+<~~~~~~~dppppWMMkZzzzwM#zzdMMMMMMMMNMMMM\n// MMMMMMMMMMMMMM#rrrwRrMMbOrrOZNkrvvvXwvvvvvwX;.~._W_:::::(?!~~~~~~~~(HpppppppHWdvwM#XwdMMMMMMMMMMNMMM\n// MMMMMMMMMMMMMMNyrrrRrWMMmzOrzdNyrrrZNvrwQWWfb....(r~~_J>_.....~.~~-dpfpffpfpppWHHMNdMMMMMMMMMMMMMMMM\n// MMMMMMMMMMMMMMMNrtrStdMMMNxzrzMNmrrrdNWfVfffP._-.(~_J!............JpfpffpfpfffpppWNppppHMMMMMMMMMMMM\n// MMMMMMMMMMMMMMMMNOtXtdMMMMMNxzZMMNmgHyVVVVVW%..?/(.,(x-..........(HfffpffpffpffWHHffpffppfVyyWMMMMMM\n\n\n//include\n//------------------------------------------\n#include <vector>\n#include <list>\n#include <map>\n#include <unordered_map>\n#include <climits>\n#include <set>\n#include <unordered_set>\n#include <deque>\n#include <stack>\n#include <bitset>\n#include <algorithm>\n#include <functional>\n#include <numeric>\n#include <utility>\n#include <sstream>\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <cmath>\n#include <cstdlib>\n#include <cctype>\n#include <string>\n#include <cstring>\n#include <ctime>\n#include <queue>\n#include <random>\n#include <complex>\n#include <regex>\n#include <locale>\n#include <random>\n#include <type_traits>\n\nusing namespace std;\n\n#define SHOW_VECTOR(v) {std::cerr << #v << \"\\t:\";for(const auto& xxx : v){std::cerr << xxx << \" \";}std::cerr << \"\\n\";}\n#define SHOW_MAP(v){std::cerr << #v << endl; for(const auto& xxx: v){std::cerr << xxx.first << \" \" << xxx.second << \"\\n\";}}\n\nusing LL = long long;\n\n//~~~~~~~~~~~~~~~~~~~~~_(＾～＾ ｣ ∠)_~~~~~~~~~~~~~~~~~~~~~\n\nint main() {\n\n while (true) {\n\n int m;\n cin >> m;\n\n if (m == 0) break;\n\n vector<pair<int, int>> a(m);\n for (int i = 0; i < m; i++) {\n int x, y;\n cin >> x >> y;\n a[i] = make_pair(x, y);\n }\n\n int n;\n cin >> n;\n\n vector<pair<int, int>> b(n);\n map<pair<int, int>, bool> mp;\n for (int i = 0; i < n; i++) {\n int x, y;\n cin >> x >> y;\n b[i] = make_pair(x, y);\n mp[make_pair(x, y)] = true;\n }\n\n for (int i = 0; i < n; i++) {\n int dy = b[i].second - a[0].second;\n int dx = b[i].first - a[0].first;\n bool good = true;\n for (int j = 0; j < m; j++) {\n int toY = dy + a[j].second;\n int toX = dx + a[j].first;\n if (mp.count(make_pair(toX, toY))) continue;\n good = false;\n }\n if (good) {\n cout << dx << \" \" << dy << endl;\n break;\n }\n }\n\n }\n\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3148, "score_of_the_acc": -0.0045, "final_rank": 9 }, { "submission_id": "aoj_0524_3450249", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\nusing ull = unsigned long long;\n\n#define REP(i,n) for(long long i = 0; i < (n); i++)\n#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)\n#define ALL(obj) (obj).begin(),(obj).end()\n\ntemplate<class T> using V = vector<T>;\ntemplate<class T, class U> using P = pair<T, U>;\n\nconst ll MOD = (ll)1e9 + 7;\nconst ll MOD2 = 998244353;\nconst ll LLINF = (ll)1e18;\nconst ll INTINF = (ll)1e9;\nconst long double PI = 3.1415926535897932384626433;\n\ntemplate <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}\ntemplate <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << \"{\"; for (auto &x : obj) o << \" {\" << x.first << \" : \" << x.second << \"}\" << \",\"; o << \" }\"; return o;}\ntemplate <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << \"{\"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? \", \" : \"\") << *itr; o << \"}\"; return o;}\ntemplate <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << \"{\"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? \", \" : \"\") << *itr; o << \"}\"; return o;}\ntemplate <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << \"{\"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? \", \" : \"\") << obj[i]; o << \"}\"; return o;}\ntemplate <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << \"{\" << obj.first << \", \" << obj.second << \"}\"; return o;}\ntemplate <template <class tmp> class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << \"{\"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? \", \" : \"\") << *itr; o << \"}\"; return o;}\nvoid print(void) {cout << endl;}\ntemplate <class Head> void print(Head&& head) {cout << head;print();}\ntemplate <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << \" \";print(forward<Tail>(tail)...);}\ntemplate <class T> void chmax(T& a, const T b){a=max<T>(a,b);}\ntemplate <class T> void chmin(T& a, const T b){a=min<T>(a,b);}\nvoid YN(bool flg) {cout << ((flg) ? \"YES\" : \"NO\") << endl;}\nvoid Yn(bool flg) {cout << ((flg) ? \"Yes\" : \"No\") << endl;}\nvoid yn(bool flg) {cout << ((flg) ? \"yes\" : \"no\") << endl;}\n\nint main() {\n\tint N,M;\n\twhile(1){\n\t\tcin >> N;\n\t\tif(N==0) return 0;\n\t\tV<int> a(N),b(N);\n\t\tREP(i,N) cin >> a[i] >> b[i];\n\t\tcin >> M;\n\t\tV<int> c(M),d(M);\n\t\tREP(i,M) cin >> c[i] >> d[i];\n\t\tmap<P<int,int>,int> mp;\n\t\tREP(i,M) mp[{c[i],d[i]}];\n\t\tfor(int i = 0; i < M; ++i){\n\t\t\tint x = c[i] - a[0];\n\t\t\tint y = d[i] - b[0];\n\t\t\tint flg = 1;\n\t\t\tfor(int j = 0; j < N; ++j){\n\t\t\t\tif( !mp.count({a[j]+x,b[j]+y}) ) flg = 0;\n\t\t\t}\n\t\t\tif(flg) {\n\t\t\t\tcout << x << \" \" << y << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3076, "score_of_the_acc": -0.0023, "final_rank": 3 }, { "submission_id": "aoj_0524_3419184", "code_snippet": "// だーれだ？\n//qqqqqqHHMqqqqqHf!(:;jHmmkf``(:;jkqqqqqqqqqmMH#HMqqK_````````````````(kqqqqqqHMMM\n//qqqqqqHHmqqqqH=` :;;jkqH=?~..;;jqqqqqqqqqmM#HM#MHH!```` ```````..-``dqWbWkRqHMMM\n//qqqqqqMHmqqqK!``.;;;dqH: ```.?TUqqHmqqqqmHHHM4Mqkt..```` ..JgHHW@P`.HHkqHHHqM#NN\n//qqqqqmHMmqHTYWHgHmmgHR...``` :;Jkq9qqqqqgMH#1dHk$...-gW@HY\"=!``dH! dHNmqqqqmM###\n//qqqqqqgMmH[````` ?dHMMMHHHHHJ<;JkK>XqqqmMH#<+Hb%.WYYTHppf-````.gt`.HHMmmqqqmM###\n//qqkqqqm@H?S,```` Jpbbpp:```` :!dK<;JkqqMMY(;dW^````.ppbpf!```.Y<`.HHHMgmqqqmH###\n//qqqqqqqqD`` ````(ppbppW````` ~.f`:;jkqM#^.;jf!````.Wppbpf````````(HH#HmmqqmH#NN#\n//qqqqqqqkP``````.fpbpbpf``` ` `.``~:;WHY``(+=``````Jppbpf\\```` ``.MH#HHgqqqmHNNNN\n//qqqqqqqk]```` `,fpbbpf>```` `` ``_:<? ``.?!``` `` Wpppp%``` ``` dHH##HmmqqmH####\n//qqqqqqqk]``````,fpbppt``` `` `` `_~````` `` `` ```WppW=``` ````.HHHHMHmmqqmM####\n//qqqqqqqk$`` ````4ppfY```` `` `` `- `` `` `` ``` ``(T=`````` ``.MH##HMMmmqqmM##HH\n//qqqqqqHqP``` ````?7!```` `` `` ``` `` ` ` `` ````````` ` ````.MHH#HgMmqmqmHHHHH\n//qqqkqqmkR```` ` `` ` `` ` ` ` ``` ` ``` ` ......_. ```dH#HHgMqqgqqmH#HH\n//NqqqqqHqR``` _ ........_` `` ``` ``` ````` ``` ............```,HHHHmqqqHqqmMH##\n//MmqqqqHqR``` _........_ `` `` ``` `` ` `` ` ` ` `__ ` ``,HHHMmmqqMHmmMHH#\n//HMqqqqXkH `````````````` ` `` ` `` `` `` `` `` ```` ````` ````.HHHMmMHm@HHqmMHH\n//HHHmqqfHk;``` ` ` `` ` ` `` ``` ` ` ``` `` `` `` ```` `..```.HHHHMMHMg@HHHHHMH\n//HHMmmqMHkP<.`` ``` ` ` ``` `` ``` ``` ` `` `` `` ` ```` ```.MH##HM#HMg@@@@H@HH\n//##HNmqR`jW<<_ ``` ````` `` ` ` ``` `` `` `` `` ```` ````` .dHH##H#HHHMHH@@H@@@@\n//HH##NqH..X2:<<-.`` ` `` ``` ``` ` `` `` `` ` `` ` ``` ` .gMHHH#H#HHH#HM@@H@@H@@H\n//-WHHHNH[ =v._:::<-. ` `` ` `` ```````.`` ````````` .MHH###H#MHHHHH@H@H@@HH@\n//` 7MHHMH.l==. ~:::::<_-.. ````` ``````` `` ...uX; `,MHHHH#M@@MM@@@@@@H@@@@\n// . TMHHbZl=1. _~::::::(<::<:<___-___:<<:::::jX3=. ` ` `,MMHM@@@@Mg@@@@@@@@@H@\n//\n#include <bits/stdc++.h>\n#define int long long\n#define ll long long \n#define rep(i,a,b) for(signed i=a;i<(b);++i)\n#define erep(i,a,b) for(signed i=a;i<=(b);++i)\n#define per(i,a,b) for(signed i=(a);i>(b);--i)\n#define eper(i,a,b) for(signed i=(a);i>=b;--i)\n#define fore(i, x, a) for(auto &&x:a) \n#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)\n#define pb push_back\n#define mp make_pair\n#define ALL(x) begin(x),end(x)\n#define F first\n#define S second\n#define debug(x) cout << #x << \": \" << (x) << '\\n';\nconst long long INF=1001001001001001001;\nconst int MOD=(int)1e9 + 7;\nconst double EPS=1e-9;\nusing namespace std;\nusing Pii = pair<int,int>;\nusing vii = vector<int>;\ntemplate<class T>using PS_queue = priority_queue<T, vector<T>, greater<T> >;\ntemplate<class T>using vv = vector<T>;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }\ntemplate<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val){fill( (T*)array, (T*)(array+N), val );}\ntemplate<class T> ostream& operator<<(ostream &os,const vector<T> &v) {\n ITR(i,begin(v),end(v))os<<*i<<(i==end(v)-1?\"\":\" \");return os;}\ntemplate<class T> istream& operator>>(istream &is,vector<T> &v) {\n ITR(i,begin(v),end(v)) is>>*i;return is;}\ntemplate<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {\n is>>p.first>>p.second;return is;}\ntemplate<class T>T gcd(T a, T b){ return b ? gcd(b, a % b) : a; }\ntemplate<class T>T lcm(T a, T b){ return a / gcd(a, b) * b; }\nstruct edge { int from, to, cost; };\nint dy[]={0, 1, -1, 0}; int dx[]={1, 0, 0, -1};\n// cout << fixed;\n// cout << setprecision(10) << val;\n\nint m, n;\nsigned main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n while (cin >> m) {\n if (!m) break;\n vii x(m), y(m);\n rep(i, 0, m) {\n cin >> x[i] >> y[i];\n }\n int x0 = x[0], y0 = y[0];\n rep(i, 1, m) x[i] -= x0, y[i] -= y0;\n x[0] = 0, y[0] = 0;\n int n;\n cin >> n;\n vii px(n), py(n);\n rep(i, 0, n) cin >> px[i] >> py[i];\n rep(i, 0, n) {\n int nx = px[i], ny = py[i];\n bool used[m] = {false};\n rep(j, 0, n) {\n int vec_x = px[j] - nx, vec_y = py[j] - ny;\n rep(k, 0, m) {\n if (!used[k] && x[k] == vec_x && y[k] == vec_y) {\n used[k] = true;\n break;\n }\n }\n }\n bool flag = true;\n rep(k, 0, m) {\n if (!used[k]) flag = false;\n }\n if (flag) {\n cout << nx - x0 << \" \" << ny - y0 << endl;\n break;\n }\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 360, "memory_kb": 3148, "score_of_the_acc": -1.0045, "final_rank": 19 }, { "submission_id": "aoj_0524_3370736", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define REP(i,m) for(int i=0; i<m; i++)\n#define FOR(i,n,m) for(int i=n; i<m; i++)\n#define INF 1000000007\n#define INFL (1LL << 60)\n#define MOD 998244353\n#define ALL(v) v.begin(),v.end()\n#define pb push_back\n#define ll long long int\n#define P pair<ll, ll>\n\nint main(){\n\twhile(true){\n\t\tint n;\n\t\tcin >> n;\n\t\tif(n == 0) break;\n\t\tint tx[n], ty[n];\n\t\tREP(i, n) cin >> tx[i] >> ty[i];\n\t\tint m;\n\t\tcin >> m;\n\t\tint sx[m], sy[m];\n\t\tREP(i, m) cin >> sx[i] >> sy[i];\n\t\tll search[m];\n\t\tREP(i, m) search[i] = 10000000LL*sx[i]+sy[i];\n\t\tsort(search, search+m);\n\t\tint ax = -1, ay = -1;\n\t\tREP(i, m){\n\t\t\tint dx = sx[i]-tx[0], dy = sy[i]-ty[0];\n\t\t\tbool c = true;\n\t\t\tREP(j, n){\n\t\t\t\tint nx = tx[j] + dx, ny = ty[j] + dy;\n\t\t\t\tll key = 10000000LL*nx+ny;\n\t\t\t\tif(!binary_search(search, search+m, key)){\n\t\t\t\t\tc = false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(c){\n\t\t\t\tax = dx; ay = dy;\n\t\t\t}\n\t\t}\n\t\tcout << ax << \" \" << ay << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3024, "score_of_the_acc": -0.0007, "final_rank": 2 }, { "submission_id": "aoj_0524_3277164", "code_snippet": "#include <cassert>\n\n#include <cctype>\n#include <cerrno>\n#include <cfloat>\n#include <ciso646>\n#include <climits>\n#include <clocale>\n#include <cmath>\n#include <csetjmp>\n#include <csignal>\n#include <cstdarg>\n#include <cstddef>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#include <ccomplex>\n#include <cfenv>\n#include <cinttypes>\n#include <cstdbool>\n#include <cstdint>\n#include <ctgmath>\n#include <cwchar>\n#include <cwctype>\n\n// C++\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n#include <vector>\n#include <array>\n#include <atomic>\n#include <chrono>\n#include <condition_variable>\n#include <forward_list>\n#include <future>\n#include <initializer_list>\n#include <mutex>\n#include <random>\n#include <ratio>\n#include <regex>\n#include <scoped_allocator>\n#include <system_error>\n#include <thread>\n#include <tuple>\n#include <typeindex>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n//#include <boost/foreach.hpp>\n//#include <boost/range/algorithm.hpp>\n#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)\n#define ll long long\n#define Sort(v) sort(all(v))\n#define INF 1000000000\n#define END return 0\n#define pb push_back\n#define se second\n#define fi first\n#define pb push_back\n#define all(v) (v).begin() , (v).end()\n#define MP make_pair\n#define MOD 1000000007LL\nusing namespace std;\nint day[12]={31,28,31,30,31,30,31,31,30,31,30,31};\n\nint main (){\n int m;\n while(cin>>m&&m){\n map<pair<int,int>,bool> mp; //pairの座標に点があるかどうか\n vector<pair<int,int>> a(m); //星座の構成点の座標\n rep(i,0,m)cin>>a[i].fi>>a[i].se;\n int n; cin>>n;\n vector<pair<int,int>> b(n); //フィールドに存在する全ての点の座標\n rep(i,0,n){\n cin>>b[i].fi>>b[i].se;\n mp[pair<int,int>(b[i].fi,b[i].se)]=true;\n }\n\n rep(i,0,n){\n //存在する全ての点を全探索し、まずは星座を構成する一つの点に対する移動距離をdに保存。\n pair<int,int> d=make_pair(b[i].fi-a[0].fi,b[i].se-a[0].se);\n bool ok=true;\n rep(j,0,m){ //星座の構成要素を全探索し、移動量dを加えた先に点が存在するかどうかを確認。１つでも無ければok=false\n pair<int,int> p=make_pair(a[j].fi+d.fi,a[j].se+d.se);\n if(!mp[p])ok=false;\n }\n //okがtrueのまま降りてこれば、dを出力して終了\n if(ok){\n cout<<d.fi<<\" \"<<d.se<<endl;\n break;\n }\n }\n }\n\n \n}\n\n\n/*\n5\n8 5\n6 4\n4 3\n7 10\n0 10\n10\n10 5\n2 7\n9 7\n8 10\n10 2\n1 2\n8 1\n6 7\n6 0\n0 9\n5\n904207 809784\n845370 244806\n499091 59863\n638406 182509\n435076 362268\n10\n757559 866424\n114810 239537\n519926 989458\n461089 424480\n674361 448440\n81851 150384\n459107 795405\n299682 6700\n254125 362183\n50795 541942\n0\n*/", "accuracy": 1, "time_ms": 50, "memory_kb": 10904, "score_of_the_acc": -0.3543, "final_rank": 15 }, { "submission_id": "aoj_0524_3268479", "code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<string>\nusing namespace std;\nint cl(int a, int b) {\n\treturn (a - (a%b)) / b;//b=0だと積む\n}\nint up(int a, int b) {\n\treturn cl(a + b - 1, b);//b=0だと積む\n}\nint ord(int a, int p) {\n\tif (a%p == 0) {\n\t\treturn ord(a / p, p) + 1;\n\t}\n\telse {\n\t\treturn 0;\n\t}\n}\nint main() {\n int soo=1;\n while(soo==1){\n int n, m; int ans = 0;\n\tcin >> m;\n\tif(m==0){\n\t soo=0;\n\t}\n\telse{\n\t vector<int> sex(m);\n\tvector<int> sey(m);\n\tfor (int i = 0; i < m; i++) {\n\t\tcin >> sex[i] >> sey[i];\n\t}\n\tcin >> n;\n\tvector<int> hox(n);\n\tvector<int> hoy(n);\n\tfor(int i = 0; i < n; i++) {\n\t\tcin >> hox[i] >> hoy[i];\n\t}\n\tint das1 = 1;\n\tfor (int i = 0; i < n and das1==1; i++) {\n\t\tint x = hox[i] - sex[0];//iは0に合わせるもの\n\t\tint y = hoy[i] - sey[0];\n\t\tint ok = 1;\n\t\tint das2=1;\n\t\tfor (int j = 0; j < m and das2==1; j++) {\n\t\t\tint sx = sex[j] + x;\n\t\t\tint sy = sey[j] + y;\n\t\t\tint das3 = 0;\n\t\t\tfor (int k = 0; k < n and das3 == 0; k++) {\n\t\t\t\tif (sx == hox[k] and sy == hoy[k]) {\n\t\t\t\t\tdas3 = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (das3 == 0) {\n\t\t\t\tdas2 = 0;\n\t\t\t}\n\n\t\t}\n\t\tif (das2 == 1) {\n\t\t\tdas1 = 0;\n\t\t\tcout << x << \" \" << y<<endl;\n\t\t} \n } \n\t}\n\t}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3112, "score_of_the_acc": -0.0034, "final_rank": 7 }, { "submission_id": "aoj_0524_3261432", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <iomanip>\n#include <map>\n#include <queue>\n#include <set>\n\nstatic const int MOD = 1000000007;\nusing ll = long long;\nusing u32 = unsigned;\nusing namespace std;\n\ntemplate<class T>\nconstexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;\n\nint main() {\n int m;\n while (cin >> m, m){\n vector<pair<int, int>> v, v2;\n for (int i = 0; i < m; ++i) {\n int a, b;\n cin >> a >> b;\n v.emplace_back(a, b);\n }\n int n;\n cin >> n;\n set<pair<int, int>> s;\n for (int i = 0; i < n; ++i) {\n int a, b;\n cin >> a >> b;\n s.emplace(a, b);\n v2.emplace_back(a, b);\n }\n for (int i = 0; i < n; ++i) {\n int pp = v2[i].first-v[0].first, qq = v2[i].second-v[0].second;\n int valid = 1;\n for (int j = 0; j < m; ++j) {\n if(!s.count(make_pair(v[j].first+pp, v[j].second+qq))) valid = 0;\n }\n if(valid) {\n cout << pp << \" \" << qq << \"\\n\";\n }\n }\n } \n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3112, "score_of_the_acc": -0.0034, "final_rank": 7 } ]
aoj_0527_cpp
碁石ならべ 問題 白と黒の碁石をテーブルの上にならべて遊ぶ.まずテーブルの左端に碁石を置く.次に左から 2 番目の場所に碁石を置く.これを n 回繰り返して n 個の碁石を横一列にならべる.ただし,新しく i 番目の碁石を置く際には,次のルールに従ってテーブル上の碁石を置き換える. i が奇数の場合: テーブルに置いてあった碁石は置き換えず,新しい碁石を左 から i 番目に置く. i が偶数の場合: 新しく左から i 番目に置く碁石の色とテーブル上の右端の碁 石の色が同じ場合は,テーブル上の碁石は置き換えず,新しい碁石を左から i 番目に置く.そうでない場合,すなわち,新しく左から i 番目に置く碁石の色 とテーブル上の右端の碁石の色が異なる場合は,まずテーブル上の右端の連続 した同色の碁石を全て取り除き,i 番目の碁石と同色の碁石に置き換える.そ してテーブルの右端に i 番目の碁石を置く. 例えば,最初の 7 個の碁石を置いた時点で, ○○●●○○○ となっていたとする. (○は白の碁石を,●は黒の碁石を表す. ) 8 番目の碁石が白(○)の場合は,右端の碁石と同色なので,そのまま置く.し たがって,テーブル上の碁石は ○○●●○○○○ となる. 8 番目の碁石が黒(●)の場合は,右端の碁石(○)と色が異なるので,まず テーブルの右端にある 3 個の連続した白い碁石(○)を取り除き,黒い碁石 (●)に置き換える.そして右端に 8 番目の碁石を置く.したがって,テーブ ル上の碁石は ○○●●●●●● となる. 入力として置く碁石の順番が与えられたとき,n 個の碁石をならべ終わった後,テー ブル上に置いてある白い碁石の個数を求めるプログラムを作成せよ. 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる． 1 行目には正整数 n (1 ≤ n ≤ 100000) が書かれている.2 行目以降の第 i + 1 行目 (1 ≤ i ≤ n) には,i 番目に置く碁石の色を表す整数 c i が書かれており,c i が 0 なら i 番目に置く碁石の色が白であることを,1 なら i 番目に置く碁石の色が黒であることを表す. 採点用データのうち, 配点の 50% 分については, n ≤ 10000 を満たす. n が 0 のとき入力の終了を示す. データセットの数は 10 を超えない． 出力 データセットごとに, n 個の碁石をならべ終わった後にテーブル上に置いてある白い碁石の個数を 1 行に出力する. 入出力例 入力例 8 1 0 1 1 0 0 0 0 8 1 0 1 1 0 0 0 1 0 出力例 6 2 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0527_10371238", "code_snippet": "#include<stdio.h>\n\nint main(){\n\nint n[100001];\nint N;\nwhile(1){\nscanf(\"%d\",&N);\nif(N==0)break;\nfor(int i=0;i<N;i++)\nscanf(\"%d\",&n[i]);\n\nfor(int i=0;i<N;i++)\nif(i%2==1){\nfor(int j=i-1;j>=0;j--)\nif(n[j]!=n[i])n[j]=n[i];\nelse if(n[j]==n[i])break;\n}\nint c=0;\nfor(int i=0;i<N;i++)\nif(n[i]==0)c++;\n\nprintf(\"%d\\n\",c);\n}\nreturn 0;\n}", "accuracy": 1, "time_ms": 750, "memory_kb": 3108, "score_of_the_acc": -0.9668, "final_rank": 17 }, { "submission_id": "aoj_0527_6664297", "code_snippet": "#include <bits/stdc++.h>\n \nusing namespace std;\n \n#define REP(i,n) for(int i=0;i<int(n);i++)\ntypedef long long ll;\ntypedef pair<int,int> P;\n\nint a[100010];\n\nint main(void){\n\tint i,j,k;\n \n\tcin.tie(0); ios_base::sync_with_stdio(false);\n\n\n\tfor(i=0;;i++){\n\t\tint n;\n\t\tcin >> n;\n\t\tif(n==0) return 0;\n\n\n\t\tfor(j=1;j<=n;j++){\n\t\t\tcin >> a[j];\n\t\t\tif(j%2==0){\n\t\t\tfor(k=j-1;k>=1;k--){\n\t\t\t\tif(a[k]==a[j]) break;\n\t\t\t\telse a[k]=a[j];\n\t\t\t}\n\t\t\t}\n\t\t}\n\n\n\t\tint ans=0;\n\t\tfor(j=1;j<=n;j++) if(a[j]==0) ans++;\n\n\t\tcout << ans << endl;\n\n\n\t}\n\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 860, "memory_kb": 3516, "score_of_the_acc": -1.4467, "final_rank": 20 }, { "submission_id": "aoj_0527_5892789", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef pair<int, int> P;\ntypedef pair<P, int> PP;\n#define F first \n#define S second\n#define INF (int) 2e9\n#define REP(i,a,b) for(int i=a;i<b;i++)\n#define rep(i,n) REP(i,0,n)\nint n;\nvector<P> st;\n\nint main(){\n while(cin >> n && n){\n int s = 0, e = 0, ans = 0;\n bool flag = false;\n st.clear();\n REP(i, 1, n + 1){\n int stone;\n cin >> stone;\n if(i % 2){\n if(st.empty()){\n st.push_back(P(stone, 1));\n continue;\n }\n if(st[st.size() - 1].F == stone){\n st[st.size() - 1].S++;\n }else{\n st.push_back(P(stone, 1));\n }\n }\n else{\n if(st[st.size() - 1].F == stone){\n st[st.size() - 1].S++;\n }else{\n if(st.size() >= 2){\n st[st.size() - 2].S += st[st.size() - 1].S + 1;\n st.pop_back();\n }\n else{\n st[st.size() - 1].F = stone;\n st[st.size() - 1].S++;\n }\n \n } \n }\n // cout << st[st.size() - 1].F << \" \" << st[st.size() - 1].S << endl;\n\n }\n rep(i, st.size()){\n if(st[i].F == 0){\n ans += st[i].S;\n }\n }\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3072, "score_of_the_acc": -0.0653, "final_rank": 6 }, { "submission_id": "aoj_0527_5790591", "code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<sstream>\n#include<regex>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int Mod=998244353;\nconst int inf=mod*mod;\nconst double eps=1e-9;\nsigned main(){\n\tint n;\n\twhile(cin>>n,n){\n\t\tint c;\n\t\tvector<pair<int,int>>rle;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tcin>>c;\n\t\t\tif(i%2==0){\n\t\t\t\tif(i==0||rle.back().first!=c)\n\t\t\t\t\trle.emplace_back(c,1);\n\t\t\t\telse\n\t\t\t\t\trle.back().second++;\n\t\t\t}else{\n\t\t\t\tif(rle.back().first==c)\n\t\t\t\t\trle.back().second++;\n\t\t\t\telse{\n\t\t\t\t\tint num=rle.back().second+1;\n\t\t\t\t\trle.pop_back();\n\t\t\t\t\tif(rle.empty())\n\t\t\t\t\t\trle.emplace_back(c,num);\n\t\t\t\t\telse\n\t\t\t\t\t\trle.back().second+=num;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint ans=0;\n\t\tfor(auto x:rle)\n\t\t\tif(x.first==0)\n\t\t\t\tans+=x.second;\n\t\tcout<<ans<<endl;\n\t}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3344, "score_of_the_acc": -0.299, "final_rank": 12 }, { "submission_id": "aoj_0527_5747437", "code_snippet": "#include<iostream>\n#include<stack>\n\nusing namespace std;\n\nint main()\n{\n\twhile (true)\n\t{\n\t\tint n;\n\t\tcin >> n;\n\t\tif (n == 0)\n\t\t\tbreak;\n\t\tstack<pair<int, int>> q;\n\t\tq.push(make_pair(-1, -1));\n\t\tint c;\n\t\tfor (int i = 1; i <= n; i++)\n\t\t{\n\t\t\tcin >> c;\n\t\t\tpair<int, int> rear = q.top();\n\t\t\tint amount = rear.first;\n\t\t\tint color = rear.second;\n\t\t\tif (i % 2 == 1)\n\t\t\t{\n\t\t\t\tif (color == c)\n\t\t\t\t{\n\t\t\t\t\tq.pop();\n\t\t\t\t\tq.push(make_pair(amount + 1, c));\n\t\t\t\t}\n\t\t\t\telse\n\t\t\t\t\tq.push(make_pair(1, c));\n\t\t\t}\n\t\t\telse\n\t\t\t{\n\t\t\t q.pop();\n\t\t\t\tint newAmount = amount + 1;\n\t\t\t\tpair<int, int> newRear = q.top();\n\t\t\t\tif (newRear.second == c)\n\t\t\t\t{\n\t\t\t\t\tnewAmount += newRear.first;\n\t\t\t\t\tq.pop();\n\t\t\t\t}\n\t\t\t q.push(make_pair(newAmount,c));\n\t\t\t}\n\t\t}\n\t\tint ans = 0;\n\t\twhile (!q.empty())\n\t\t{\n\t\t\tpair<int, int> seg = q.top();\n\t\t\tif (seg.second == 0)\n\t\t\t\tans += seg.first;\n\t\t\tq.pop();\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\n //system(\"pause\");\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3084, "score_of_the_acc": -0.0756, "final_rank": 8 }, { "submission_id": "aoj_0527_5473298", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, N) for (ll i = 0; i < N; i++)\n\nint main()\n{\n while(1){\n int n;\n cin >> n;\n if(n == 0) return 0;\n int nn[n];\n rep(i, n) cin >> nn[i];\n int wb[n][2] = {};\n int cur;\n int id = 0;\n if (nn[0] == 0)\n {\n cur = 0;\n }\n else\n cur = 1;\n wb[id][cur]++;\n\n for (int i = 1; i < n; i++)\n {\n // cout << i+1 << \" --------|\" << endl;\n // rep(ii,n) cout << nn[ii] << \" |\";\n if (nn[i] == nn[i - 1]) // same\n {\n wb[id][cur]++;\n }\n else // diff\n {\n cur = nn[i];\n if (i % 2 == 0) // odd\n {\n // cout << \" incre id \" << id << \" i \" << i << endl;\n id++;\n wb[id][cur]++;\n }\n else // even\n {\n if (id == 0)\n {\n if (nn[i] == 0)\n {\n wb[id][0] = wb[id][1];\n wb[id][1] = 0;\n nn[i] = 0;\n }\n else\n {\n // cout << \" black first \" << id << \" \" << wb[id][1] << \" \" << wb[id][0] << endl;\n wb[id][1] = wb[id][0];\n wb[id][0] = 0;\n nn[i] = 1;\n }\n //id--;\n wb[id][cur]++;\n }\n else // di > 1\n {\n if (nn[i] == 0)\n {\n // cout << \" white \" << id << \" \" << wb[id-1][0] << \" \" << wb[id][1] << endl;\n wb[id-1][0] += wb[id][1];\n wb[id][1] = 0;\n nn[i] = 0;\n }\n else\n {\n // cout << \" black \" << id << \" \" << wb[id-1][1] << \" \" << wb[id][0] << endl;\n wb[id-1][1] += wb[id][0];\n wb[id][0] = 0;\n nn[i] = 1;\n }\n id--;\n wb[id][cur]++;\n }\n }\n }\n /*\n rep(k, 2)\n {\n rep(m, 3)\n {\n cout << wb[m][k] << \" * \";\n }\n cout << endl;\n }*/\n } // for\n ll cnt = 0;\n rep(i, id + 1) cnt += wb[i][0];\n cout << cnt << endl;\n}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4160, "score_of_the_acc": -1, "final_rank": 18 }, { "submission_id": "aoj_0527_5095152", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\nvoid solve(int n) {\n vector<pair<int, int>> v;\n int f;\n cin >> f;\n v.push_back({f, 1});\n for (int i = 2; i <= n; i++) {\n int now;\n cin >> now;\n if (i % 2 == 1) {\n if (now == 0) {\n if (!v.back().first)\n v.back().second++;\n else\n v.push_back({0, 1});\n } else {\n if (v.back().first)\n v.back().second++;\n else\n v.push_back({1, 1});\n }\n } else {\n if (now == 0) {\n if (!v.back().first)\n v.back().second++;\n else {\n int cnt = v.back().second;\n v.pop_back();\n v.push_back({0, cnt + 1});\n }\n } else {\n if (v.back().first)\n v.back().second++;\n else {\n int cnt = v.back().second;\n v.pop_back();\n v.push_back({1, cnt + 1});\n }\n }\n while (!(v.size() == 1) && v.back().first == v[v.size()-2].first) {\n int cnt = v.back().second;\n v.pop_back();\n v.back().second += cnt;\n }\n }\n }\n int ans = 0;\n for (int i = 0; i < v.size(); i++) {\n if (v[i].first == 0) ans += v[i].second;\n }\n cout << ans << endl;\n}\n\nint main() {\n while (1) {\n int n;\n cin >> n;\n if (!n) break;\n solve(n);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3180, "score_of_the_acc": -0.1581, "final_rank": 10 }, { "submission_id": "aoj_0527_4952464", "code_snippet": "#include <iostream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <map>\n#include <set>\n#include <numeric>\n#include <iomanip>\n#include <stack>\n#include <tuple>\n\nusing namespace std;\n\nusing ll = long long;\n\ntemplate<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }\n\nconst int inf = (1 << 30) - 1;\n\nint main() {\n\n // オセロ？\n\n vector<int> output;\n\n while (true) {\n int n;\n cin >> n;\n if (n == 0) break;\n vector<int> c(n);\n for (int i = 0; i < n; ++i) cin >> c[i];\n\n // first : 個数 second : 色\n stack<pair<int, int>> st;\n st.emplace(1, c[0]);\n for (int i = 1; i < n; ++i) {\n auto [cnt, color] = st.top();\n st.pop();\n\n if (i % 2 == 1) {\n if (c[i] == color) {\n st.emplace(cnt + 1, color);\n }\n else {\n int add = 0;\n if (st.size() != 0) {\n auto [p_cnt, p_color] = st.top();\n st.pop();\n add = p_cnt;\n }\n int new_cnt = add + cnt + 1;\n st.emplace(new_cnt, c[i]);\n }\n }\n else { // そのまま入れる\n if (c[i] == color) st.emplace(cnt + 1, color);\n else {\n st.emplace(cnt, color);\n st.emplace(1, 1 - color);\n }\n }\n }\n\n int ans = 0;\n while (st.size()) {\n auto [cnt, color] = st.top();\n st.pop();\n if (color == 0) ans += cnt;\n }\n\n output.emplace_back(ans);\n }\n\n for (auto ans : output) cout << ans << endl;\n\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3212, "score_of_the_acc": -0.1856, "final_rank": 11 }, { "submission_id": "aoj_0527_4952411", "code_snippet": "#include <bitset>\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n#include <limits>\n#include <iomanip>\n#include <stack>\n#include <algorithm>\n#include <iostream>\n#include <string>\n#include <map>\n#include <queue>\n#include <set>\n#include <stdio.h>\n#include <math.h>\n\n\nusing namespace std;\n\ntypedef long long ll;\n\ntypedef vector<vector<int>> vvi;\ntypedef vector<int> vi;\ntypedef vector<ll> vll;\ntypedef vector<vector<ll>> vvll;\n\n#define mp(x, y) make_pair(x, y)\n\n#define rep(i, n) for(int i=0; i<(n); ++i)\n\n#define all(v) v.begin(), v.end()\n//sort( all(v) )　などと使える\n\n//nが素数かをO(√n)で判断\nbool is_prime(int n) {\n bool res = true;\n\n if (n == 1) return false;\n else if (n == 2) return true;\n\n else {\n for (int i = 2; i * i <= n; i++) {\n if (n % i == 0) {\n res = false;\n break;\n }\n }\n }\n\n return res;\n}\n\n\n\nint perm(int n, int r) {\n if (r == 1) return n;\n return n * perm(n - 1, r - 1);\n}\n\nint fact(int n) {\n if (n == 1) return 1;\n return fact(n - 1) * n;\n}\n\nint comb(int n, int r) {\n int a = min(n, r), b = max(n, r);\n return perm(a, b) / fact(a);\n}\n\n//aの逆元　a^(-1)\nll inv_mod(ll a, ll mod) {\n ll b = mod, u = 1, v = 0;\n while (b) {\n ll t = a / b;\n a -= t * b; swap(a, b);\n u -= t * v; swap(u, v);\n }\n u %= mod;\n if (u < 0) u += mod;\n return u;\n}\n\n\n//n!\nll fact_mod(ll n, ll mod) {\n ll f = 1; for (int i = 2; i <= n; i++) f = f * (i % mod) % mod;\n return f;\n}\n\nll pow_mod(ll x, ll n, ll mod) {\n ll res = 1;\n while (n > 0) {\n if (n & 1) res = (res * x) % mod;\n x = (x * x) % mod;\n n >>= 1; //右シフト(n = n >> 1)\n }\n return res;\n}\n\n//nCr(mod P)\nll comb_mod(ll n, ll r, ll mod) {\n if (r > n - r) r = n - r;\n if (r == 0) return 1;\n ll a = 1;\n for (int i = 0; i < r; i++) a = a * ((n - i) % mod) % mod;\n ll b = pow_mod(fact_mod(r, mod), mod - 2, mod);\n return (a % mod) * (b % mod) % mod;\n}\n\nbool isContain(int v, int s) {\n return s & (1 << v);\n}\n\n//unionFind ランクとりバージョン\n/*\n注意点\n・tree.isSame(a, b)とtreeに対してisSameを使う\n・スペルはisSame\n*/\nstruct unionFind {\n vector<int> par, rnk;\n\n unionFind(int N) : par(N), rnk(N, 0) {\n for (int i = 0; i < N; i++) par[i] = i;\n }\n\n int root(int x) {\n if (par[x] == x) return x;\n else return par[x] = root(par[x]);\n }\n\n void unite(int x, int y) {\n x = root(x), y = root(y);\n\n if (x == y) return;\n else if (rnk[x] < rnk[y]) par[x] = y;\n else {\n par[y] = x;\n if (rnk[x] == rnk[y]) rnk[y]++;\n }\n }\n\n bool isSame(int x, int y) {\n return root(x) == root(y);\n }\n};\n\n/*クラスカル法\n注意点！\n・long long 型\n・関数kraskulの引数は(頂点数、辺集合)の順\n・unionFindはランクバージョンを使用すること\n*/\n\nstruct edge {\n int s, t;\n long long cost;\n};\n\nbool comp(const edge& left, const edge& right) {\n return left.cost < right.cost;\n}\n\nvector<edge> es;\nlong long kraskul(int N, vector<edge> es) {\n long long res = 0;\n\n unionFind tree(N);\n\n //sortを忘れないように!\n //compを忘れないように！\n sort(es.begin(), es.end(), comp);\n\n for (int i = 0; i < es.size(); i++) {\n edge e = es[i];\n if (!tree.isSame(e.s, e.t)) {\n res += e.cost;\n tree.unite(e.s, e.t);\n }\n }\n\n return res;\n}\n\n\n\ntypedef pair<int, int> Pair;\n\n//max intはだいたい2e9\n//max llはだいたい9e18\n\nconst int INF = 1e9;\nconst long long LINF = 1e18;\n\nconst ll mod = 100000;\n\n\nint main() {\n //小数点１０コまで出力 main関数の頭に書く\n //cout << fixed << setprecision(10) << endl;\n int n;\n while (1) {\n cin >> n;\n if (n == 0) break;\n\n //碁石の列をvectorで管理\n //ex) 0001010011010など\n vector<int> osero;\n\n for (int i = 0; i < n; i++) {\n //各iに対して追加する石の色を受け取る\n int stone;\n cin >> stone;\n\n osero.push_back(stone);\n\n if (i % 2 == 0) continue;\n else {\n if (stone == osero[i - 1]) continue;\n else {\n //処理がやや面倒\n int j = i - 1;\n while (osero[j] != stone && j >= 0) {\n osero[j] = 1 - osero[j];\n j--;\n\n if (j < 0)break;\n }\n }\n }\n }\n\n //white-colorの数\n int cnt = 0;\n for (int i = 0; i < osero.size(); i++) {\n if (osero[i] == 0) cnt++;\n }\n\n cout << cnt << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 760, "memory_kb": 3572, "score_of_the_acc": -1.3772, "final_rank": 19 }, { "submission_id": "aoj_0527_4952405", "code_snippet": "#include <iostream>\n#include <vector>\n#include <utility>\n#include <cassert>\nusing namespace std;\n\nbool solve(){\n int n;\n cin >> n;\n if(not n) return false;\n vector<int> C(n);\n // Black : 1\n // White : 0\n for(int i = 0; i < n; ++i){\n cin >> C[i];\n }\n vector<pair<int,int>> A;\n for(int i = 0; i < n; ++i){\n if(i%2){\n if(A.empty()) A.emplace_back(C[i],1);\n else if(A.back().first == C[i])\n ++A.back().second;\n else{\n pair<int,int> b = A.back();\n A.pop_back();\n b.first ^= 1;\n b.second += 1;\n if(A.size()){\n assert(A.back().first == b.first);\n A.back().second += b.second;\n }else{\n A.emplace_back(b);\n }\n }\n }else{\n if(A.size() and A.back().first == C[i])\n ++A.back().second;\n else\n A.emplace_back(C[i],1);\n }\n }\n int ans = 0;\n for(auto e : A){\n if(not e.first)\n ans += e.second;\n }\n cout << ans << '\\n';\n return true;\n}\n\nint main(){\n while(solve());\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3436, "score_of_the_acc": -0.378, "final_rank": 14 }, { "submission_id": "aoj_0527_4781369", "code_snippet": "#include <bits/stdc++.h>\n#define int long long\n#define double long double\n#define rep(i, a, n) for(int i = (int)(a);(i) < (int)(n);++(i))\n#define repe(i, a, n) for(int i = (int)(a);(i) <= (int)(n);++(i))\n#define repif(i, a, x) for(int i = (int)(a);(x);++(i))\n#define repr(i, a, n) for(int i = ((int)(a)-1);(i) >= (int)(n);--(i))\n#define reper(i, a, n) for(int i = (int)(a);(i) >= (int)(n);--(i))\n#define SZ(x) ((int)(x).size())\n#define ALL(x) begin(x), end(x)\n#define CEIL(x) ((int)ceil(((double)x)))\n#define POW(x, y) ((int)pow(x, y))\n#define UNIQUE(x) (x).erase(unique(ALL((x))), end(x))\n#define gcd(x, y) __gcd(x, y)\n#define lcm(x, y) ((x)/gcd(x,y)*(y))\nusing namespace std;\nusing VI = vector<int>;\nusing VVI = vector<vector<int>>;\nusing PII = pair<int, int>;\nusing TIII = tuple<int, int, int>;\nusing VPII = vector<pair<int, int>>;\nusing VTIII = vector<tuple<int, int, int>>;\nusing Complex = complex<double>;\ntemplate<typename T> inline bool chmax(T& a, const T& b, bool t = false){ if(a<b or (t and a==b)){ a=b; return true; } return false; }\ntemplate<typename T> inline bool chmin(T& a, const T& b, bool t = false){ if(a>b or (t and a==b)){ a=b; return true; } return false; }\ntemplate<typename T> inline bool isin(const T& x, const T& l, const T& r){ return l <= x and x < r; }\ninline ostream& fcout(int n = 10){ return cout << fixed << setprecision(n); }\ninline ostream& rcout(int n = 2){ return cout << right << setw(n); }\nconstexpr int64_t INF = numeric_limits<int64_t>::max();\nconstexpr int32_t INF32 = numeric_limits<int32_t>::max();\nconstexpr int64_t MOD = 1000000007LL;\nconstexpr double PI = 3.14159265358979323846264338327950288;\nconstexpr double EPS = 1e-10;\n\n\nint32_t main(){\n int n;\n while(cin >> n, n){\n int c;\n vector<tuple<int, int, int>> v;\n cin >> c;\n v.emplace_back(0, c, 1);\n rep(i, 1, n){\n cin >> c;\n int& vp = get<0>(v.back());\n int& vc = get<1>(v.back());\n int& vn = get<2>(v.back());\n if(i%2){\n if(vc == c) vn++;\n else {\n int m = vn;\n v.pop_back();\n if(v.empty()) v.emplace_back(0, c, m+1);\n else get<2>(v.back()) += m+1;\n }\n }\n else {\n if(vc == c) vn++;\n else v.emplace_back(vp+vn, c, 1);\n }\n }\n int ans = 0;\n for(auto t : v) if(get<1>(t) == 0) ans += get<2>(t);\n cout << ans << endl;\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3112, "score_of_the_acc": -0.0997, "final_rank": 9 }, { "submission_id": "aoj_0527_4765737", "code_snippet": "#include<bits/stdc++.h>\n#define rep(i, x) for(ll i = 0; i < x; i++)\n#define rep2(i, x) for(ll i = 1; i <= x; i++)\n#define all(a) (a).begin(),(a).end()\nusing ll = long long;\nusing ld = long double;\nusing namespace std;\nconst ll INF = 1000000000000000000;\nconst ll mod = 1000000007;\nconst ld pi = 3.141592653589793238;\n\nll color[12345678], ko[12345678];\nsigned main() {\n\twhile (true) {\n\t\tll n, a; cin >> n;\n\t\tif (n == 0) { break; }\n\t\tll saigo = 0, z = 0;\n\t\trep(i, n) {\n\t\t\tcin >> a; a += 2;\n\t\t\tif (i == 0) { color[z] = a; ko[z] = 1; z++; }\n\t\t\telse if (i % 2 == 0) {\n\t\t\t\tif (saigo == a) { ko[z - 1]++; }\n\t\t\t\telse { color[z] = a; ko[z] = 1; z++; }\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (saigo == a) { ko[z - 1]++; }\n\t\t\t\telse {\n\t\t\t\t\tif (z == 1) {\n\t\t\t\t\t\tcolor[z - 1] = a; ko[z - 1]++;\n\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tko[z - 2] += 1 + ko[z - 1];\n\t\t\t\t\t\tcolor[z - 1] = 0; ko[z - 1] = 0; z--;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tsaigo = a;\n\t\t}\n\t\tll ans = 0;\n\t\trep(i, z) {\n\t\t\t//cout << color[i] << ' ' << ko[i] << endl;\n\t\t\tif (color[i] == 2) { ans += ko[i]; }\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3004, "score_of_the_acc": -0.0069, "final_rank": 2 }, { "submission_id": "aoj_0527_4672565", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint N;\npair<int, int> StonesInfo[100000];\n\nint main() {\n\tint num, curPos, sum;\n\t\n\twhile (cin >> N, N) {\n\t\tcin >> num;\n\t\tStonesInfo[0] = { num,1 };\n\t\tcurPos = 0;\n\t\tfor (int i = 2; i <= N; ++i) {\n\t\t\tcin >> num;\n\t\t\tif ((i & 1) == 1) {\n\t\t\t\tif (StonesInfo[curPos].first == num) {\n\t\t\t\t\t++StonesInfo[curPos].second;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\t++curPos;\n\t\t\t\t\tStonesInfo[curPos] = { num,1 };\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tif (StonesInfo[curPos].first == num) {\n\t\t\t\t++StonesInfo[curPos].second;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tif (curPos == 0) {\n\t\t\t\tStonesInfo[curPos].first = num;\n\t\t\t\t++StonesInfo[curPos].second;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tStonesInfo[curPos - 1].second += StonesInfo[curPos].second + 1;\n\t\t\t\t--curPos;\n\t\t\t}\n\t\t}\n\t\tsum = 0;\n\t\tfor (int i = 0; i <= curPos; ++i) {\n\t\t\tif (StonesInfo[i].first == 0) {\n\t\t\t\tsum += StonesInfo[i].second;\n\t\t\t}\n\t\t}\n\t\tcout << sum << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3784, "score_of_the_acc": -0.677, "final_rank": 16 }, { "submission_id": "aoj_0527_4209878", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define pb push_back\n#define fi first\n#define se second\ntypedef pair<ll,ll> P;\nusing VP = vector<P>; using VVP = vector<VP>;\nusing VI = vector<ll>; using VVI = vector<VI>; using VVVI = vector<VVI>;\nconst int inf=1e9+7;\nconst ll INF=1LL<<61;\nconst ll mod=1e9+7;\n\ntemplate<class T>\ninline bool chmax(T &a, T b) {\n if(a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate<class T>\ninline bool chmin(T &a, T b) {\n if(a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\nint main(){\n int i,j;\n int n;\n while(1){\n cin>>n;\n if(n==0) break;\n stack<P> st;\n int w=0;\n for(i=1;i<=n;i++){\n int x;\n cin>>x;\n if(i%2==1){\n if(i==1) st.push(P(x,1));\n else{\n P u=st.top();\n if(u.fi==x) st.top().se++;\n else st.push(P(x,1));\n }\n }\n else {\n P u=st.top();\n if(u.fi==x) st.top().se++;\n else {\n st.pop();\n int r=1+u.se;\n if(st.size()) {\n r+=st.top().se;\n st.pop();\n }\n st.push(P(x,r));\n }\n }\n }\n ll sum=0;\n while(st.size()){\n sum+=(1-st.top().fi)*st.top().se;\n st.pop();\n }\n cout<<sum<<endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3080, "score_of_the_acc": -0.0722, "final_rank": 7 }, { "submission_id": "aoj_0527_4021047", "code_snippet": "#include<iostream>\n#include<algorithm>\n#include<stack>\n#include<vector>\n#include<cmath>\n#define int long long\n#define mod 1000000007\n#define for0(i, n) for(int i = 0; i < (n); i++)\n#define for1(i, n) for(int i = 1; i <= (n);i++)\nusing namespace std;\nint n;\nsigned main() {\n\twhile (cin >> n, n) {\n\t\tstack<pair<short, int>>st;\n\t\tfor0(i, n) {\n\t\t\tshort t; cin >> t;\n\t\t\tif (i % 2 == 0) { if (st.size() == 0 || st.top().first != t)st.push(make_pair(t, i)); }\n\t\t\telse if (st.top().first != t) { st.pop(); if (st.size() == 0)st.push(make_pair(t, (int)0)); }\n\t\t}\n\t\tint ans = 0;\n\t\twhile (st.size()) {\n\t\t\tif (st.top().first == 0)ans += n - st.top().second;\n\t\t\tn = st.top().second;\n\t\t\tst.pop();\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3020, "score_of_the_acc": -0.0206, "final_rank": 3 }, { "submission_id": "aoj_0527_3879477", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define F first\n#define S second\n#define pii pair<int, int>\n#define eb emplace_back\n#define all(v) v.begin(), v.end()\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define rep3(i, l, n) for (int i = l; i < (n); ++i)\n#define sz(v) (int)v.size()\n#define inf (int)(1e9+7)\n#define abs(x) (x >= 0 ? x : -(x))\n#define ceil(a, b) a / b + !!(a % b)\ntemplate<typename T1, typename T2> inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }\ntemplate<typename T1, typename T2> inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }\ntemplate<typename T> T pow(T a, int b) { return b ? pow(a * a, b / 2) * (b % 2 ? a : 1) : 1; }\ntemplate<typename T> T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); }\n\nint main() {\n \n int n;\n while (cin >> n && n) {\n stack<pii> stk;\n \n int ans = 0;\n rep(i, n) {\n int a;\n cin >> a;\n // cout << \"sz \" << sz(stk) << endl;\n if (i == 0) stk.push(pii(a, 1));\n else if (i % 2 == 0) { // 0indexedで奇数番目\n pii b = stk.top();\n stk.pop();\n if (b.F == a) {\n stk.push(pii(a, b.S + 1));\n } else {\n stk.push(b);\n stk.push(pii(a, 1));\n }\n } else {\n pii b = stk.top();\n stk.pop();\n // cout << b.F << \" \" << b.S << endl;\n \n if (b.F != a && sz(stk)) {\n pii c = stk.top();\n stk.pop();\n stk.push(pii(a, b.S + c.S + 1));\n } else {\n stk.push(pii(a, b.S + 1));\n }\n \n }\n \n // cout << stk.top().F << \" \" << stk.top().S << endl;\n \n }\n while (!stk.empty()) {\n pii a = stk.top();\n // cout << a.F << \" \" << a.S << endl;\n if (a.F == 0) ans += a.S;\n stk.pop();\n }\n \n cout << ans << '\\n';\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3068, "score_of_the_acc": -0.0619, "final_rank": 4 }, { "submission_id": "aoj_0527_3531303", "code_snippet": "#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<cctype>\n#include<math.h>\n#include<string>\n#include<string.h>\n#include<stack>\n#include<queue>\n#include<vector>\n#include<utility>\n#include<set>\n#include<map>\n#include<stdlib.h>\n#include<iomanip>\n\nusing namespace std;\n\n#define ll long long\n#define ld long double\n#define EPS 0.0000000001\n#define INF 1e9\n#define LINF (ll)INF*INF\n#define MOD 1000000007\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define loop(i,a,n) for(int i=a;i<(n);i++)\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\n\n#define int ll //!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n\ntypedef vector<int> vi;\ntypedef vector<string> vs;\ntypedef pair<int,int> pii;\ntypedef vector<pii> vp;\n\nint gcd(int a, int b){\n if(b==0) return a;\n return gcd(b,a%b);\n}\nint lcm(int a, int b){\n return a/gcd(a,b)*b;\n}\n\n\nsigned main(void) {\n int n;\n while(cin >> n, n){\n vp v;\n rep(i,n){\n int t;\n cin >> t;\n if(v.size()){\n if(v.back().first == t){\n v.back().second++;\n }else if(i%2 == 0){\n v.push_back(pii(t,1));\n }else{\n int tmp = v.back().second + 1;\n v.pop_back();\n if(v.size())v.back().second += tmp;\n else v.push_back(pii(t,tmp));\n }\n }else{\n v.push_back(pii(t,1));\n }\n //cout << \"!\"<<i << endl;\n //rep(j,v.size())cout << v[j].first << \" \" << v[j].second << endl;\n }\n int ans = 0;\n rep(i,v.size())if(!v[i].first)ans += v[i].second;\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 2996, "score_of_the_acc": 0, "final_rank": 1 }, { "submission_id": "aoj_0527_3367034", "code_snippet": "#include<iostream>\n#include<string>\n#include<algorithm>\n#include<math.h>\n#include<queue>\n#include<set>\n#include<map>\n\nusing namespace std;\n\n\nint N;\nint c[100000];\n\nint main() {\n\twhile (cin >> N, N)\n\t{\n\t\tif (N == 0) break;\n\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tcin >> c[i];\n\t\t}\n\n\t\tint ans = 0;\n\t\tint ren[100000]; ren[0] = 0;\n\t\tint k = 0;\n\t\tint last = c[0];\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tif (i % 2 == 1) {\n\t\t\t\tif (last != c[i]) {\n\t\t\t\t\tif (c[i] == 0) {\n\t\t\t\t\t\tans += ren[k];\t\t\t\t\t\t\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\tans -= ren[k];\n\t\t\t\t\t}\n\n\t\t\t\t\tif (k > 0) {\n\t\t\t\t\t\tren[k - 1] += ren[k];\n\t\t\t\t\t\tk--;\n\t\t\t\t\t}\t\t\t\t\t\n\t\t\t\t}\n\t\t\t\tren[k]++;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (last == c[i]) {\n\t\t\t\t\tren[k]++;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tk++;\n\t\t\t\t\tren[k] = 1;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (c[i] == 0) {\n\t\t\t\tans++;\n\t\t\t}\n\n\t\t\tlast = c[i];\n\t\t}\n\n\n\t\tcout << ans << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3464, "score_of_the_acc": -0.4021, "final_rank": 15 }, { "submission_id": "aoj_0527_3349716", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef tuple<int,int,int>T;\ntypedef vector<T>VT;\nint main(void){\n\tint n;\n\tint stone[100001];\n\tint i,j,k;\n\tint f,b,c;\n\tVT v;\n\tint sum;\n\twhile(1){\n\t\tcin>>n;\n\t\tv.clear();\n\t\tif(n==0)\tbreak;\n\t\tfor(i=1;i<=n;i++)\tcin>>stone[i];\n\t\tf=1;\tb=1;\tc=stone[i];\n\t\tv.push_back(make_tuple(f,b,c));\n\t\tfor(i=2;i<=n;i++){\n\t\t\tif(i%2!=0){\n\t\t\t\tif(stone[i]!=stone[i-1]){\n\t\t\t\t\tf=i;\tb=i;\tc=stone[i];\n\t\t\t\t\tv.push_back(make_tuple(f,b,c));\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tget<1>(v[v.size()-1])++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{//i%2==0\n\t\t\t\tif(stone[i]==stone[i-1]){\n\t\t\t\t\tget<1>(v[v.size()-1])++;\n\t\t\t\t}\n\t\t\t\telse{//stone[i]!=stone[i-1]\n\t\t\t\t\tv.push_back(make_tuple(i,i,stone[i]));\n\t\t\t\t\t/* for(j=0;j<v.size();j++)\t\tcout<<get<0>(v[j])<<\" \"<<get<1>(v[j])<<\" \"<<get<2>(v[j])<<endl;\n\t\t\t\t\tcout<<endl; */\n\t\t\t\t\tj=v.size()-1;\n\t\t\t\t\t//cout<<j<<endl;\n\t\t\t\t\twhile(j>-1){\n\t\t\t\t\t\tj--;\n\t\t\t\t\t\tif(stone[i]==get<2>(v[j]))\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\t//cout<<j<<endl;\n\t\t\t\t\tif(j==-1){\n\t\t\t\t\t\tv.clear();\n\t\t\t\t\t\tf=1;\tb=i;\tc=stone[i];\n\t\t\t\t\t\tv.push_back(make_tuple(f,b,c));\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tget<0>(v[v.size()-1])=get<0>(v[j]);\n\t\t\t\t\t\tfor(k=v.size()-2;k>=j;k--){\n\t\t\t\t\t\t\tv.erase(v.begin()+k);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t/* for(j=0;j<v.size();j++)\t\tcout<<get<0>(v[j])<<\" \"<<get<1>(v[j])<<\" \"<<get<2>(v[j])<<endl;\n\t\t\t\t\tcout<<endl; */\n\t\t\t\t}\n\t\t\t}\n\t\t\t/* for(j=0;j<v.size();j++)\t\tcout<<get<0>(v[j])<<\" \"<<get<1>(v[j])<<\" \"<<get<2>(v[j])<<endl;\n\t\t\tcout<<endl; */\n\t\t}\n\t\tsum=0;\n\t\tfor(i=0;i<v.size();i++){\n\t\t\tif(get<2>(v[i])==0){\n\t\t\t\t//cout<<get<1>(v[i])-(get<0>(v[i])-1)<<endl;\n\t\t\t\tsum+=get<1>(v[i])-(get<0>(v[i])-1);\n\t\t\t}\n\t\t}\n\t\tcout<<sum<<endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3408, "score_of_the_acc": -0.354, "final_rank": 13 }, { "submission_id": "aoj_0527_3288138", "code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<string>\nusing namespace std;\nint cl(int a, int b) {\n\treturn (a - (a%b)) / b;//b=0だと積む\n}\nint up(int a, int b) {\n\treturn cl(a + b - 1, b);//b=0だと積む\n}\nint ord(int a, int p) {\n\tif (a%p == 0) {\n\t\treturn ord(a / p, p) + 1;\n\t}\n\telse {\n\t\treturn 0;\n\t}\n}\nint main() {\n\tint n;\n\tcin >> n;\n\twhile(n!=0)\n\t{\n\tint ans = 0;\n\tvector<int> go(n);\n\tint ch, ba,fi;\n\tfor (int i = 0; i < n; i++) {\n\t\tint x;\n\t\tcin >> x;\n\t\tif (i == 0) {\n\t\t\tgo[0] = 1;\n\t\t\tch = 0;\n\t\t\tfi = x;\n\t\t}\n\t\telse if (i % 2 == 0) {\n\t\t\tif(x != ba){\n\t\t\t\tch++;\n\t\t\t}\n\t\t\tgo[ch]++;\n\t\t}\n\t\telse {\n\t\t\tif (x == ba) {\n\t\t\t\tgo[ch]++;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tif (ch == 0) {\n\t\t\t\t\tgo[ch]++;\n\t\t\t\t\tfi = (fi + 1) % 2;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tgo[ch - 1] = go[ch - 1] + go[ch] + 1;\n\t\t\t\t\tgo[ch] = 0;\n\t\t\t\t\tch = ch - 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tba = x;\n\t}\n\tint wh = 1 - fi;\n\tfor (int i = 0; i < n; i++) {\n\t\tans = ans + wh * go[i];\n\t\twh = 1 - wh;\n\t}\n\tcout << ans<<endl;\n\tcin >> n;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3068, "score_of_the_acc": -0.0619, "final_rank": 4 } ]
aoj_0528_cpp
共通部分文字列 問題 2 個の文字列が与えられたとき, 両方の文字列に含まれる文字列のうち最も長いものを探し, その長さを答えるプログラムを作成せよ. ここで, 文字列 s が文字列 t に含まれるとは, t の中に s が連続して現れることをいう. 空文字列, すなわち長さ 0 の文字列は, どんな文字列にも含まれる. 例えば, 文字列 ABRACADABRA には次の文字列が含まれる: ABRA, RAC, D, ACADABRA, ABRACADABRA,空文字列など. 一方, 文字列 ABRACADABRA には次の文字列は含まれない: ABRC, RAA,BA, K など. 例 例 1: 文字列として ABRACADABRA と ECADADABRBCRDARA が与えられた場合, 両方に含まれる文字列には CA や CADA や ADABR や空文字列などがある. そのうち最も長いのは ADABR であり, その長さは 5 である. 2 個の文字列の中に含まれる ADABR の位置を以下に示す. ABRAC ADABR A ECAD ADABR BCRDARA 例 2: 文字列として UPWJCIRUCAXIIRGL と SBQNYBSBZDFNEV が与えられた場合, 両方に含まれる文字列は空文字列のみであり, その長さは 0 である. 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる． 入力は 2 行からなり, 1 行目に 1 個目の文字列が, 2 行目に 2 個目の文字列が与えられる. 文字列は英大文字からなり, 各々の文字列の長さは 1 以上 4000 以下である. 採点用データのうち, 配点の 30% 分については, 各々の文字列の長さは 1 以上 50以下である. 入力の終わりは EOF で示される. データセットの数は 10 を超えない． 出力 データセットごとに与えられた 2 個の文字列の両方に含まれる文字列のうち最も長いものの長さを 1 行に出力する. 入出力例 入力例 ABRACADABRA ECADADABRBCRDARA UPWJCIRUCAXIIRGL SBQNYBSBZDFNEV 出力例 5 0 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0528_10848158", "code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<string>\nusing namespace std;\nstring S, T, U;\nint solve(string U1, string U2) {\n\tint t = 0, maxn = 0;\n\tfor (int i = 0; i < min(U1.size(), U2.size()); i++) {\n\t\tif (U1[i] == U2[i])t++;\n\t\telse { maxn = max(t, maxn); t = 0; }\n\t}\n\treturn max(t, maxn);\n}\nint main() {\n\twhile (cin >> S) {\n\t\tcin >> T; int ret = 0; U = \"\";\n\t\tfor (int i = 0; i <= T.size(); i++)ret = max(ret, solve(S, T.substr(i, T.size() - i)));\n\t\tfor (int i = 0; i <= S.size(); i++) { ret = max(ret, solve(S, U + T)); U += \"-\"; }\n\t\tcout << ret << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 3312, "score_of_the_acc": -0.0564, "final_rank": 5 }, { "submission_id": "aoj_0528_10829300", "code_snippet": "#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\n\nusing namespace std;\n\nint main() {\n string S1, S2;\n\n while (getline(cin, S1) && getline(cin, S2)) {\n int n = S1.length();\n int m = S2.length();\n\n vector<int> prev(m + 1, 0), curr(m + 1, 0);\n int ans = 0;\n\n for (int i = 1; i <= n; ++i) {\n for (int j = 1; j <= m; ++j) {\n if (S1[i - 1] == S2[j - 1]) {\n curr[j] = prev[j - 1] + 1;\n ans = max(ans, curr[j]);\n } else {\n curr[j] = 0;\n }\n }\n swap(prev, curr);\n }\n\n cout << ans << endl;\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 3384, "score_of_the_acc": -0.0164, "final_rank": 2 }, { "submission_id": "aoj_0528_10539486", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n string s, t;\n // 複数データセット、EOFまでループ\n while (true) {\n if (!getline(cin, s)) break; // 1行目が読めなければ終了\n if (!getline(cin, t)) break; // 対応する2行目を読めなければ終了\n\n int n = s.size();\n int m = t.size();\n // DPの各行を保持する配列。メモリをO(m)に抑える。\n vector<int> prev(m + 1, 0), curr(m + 1, 0);\n\n int best = 0; // 最長共通部分文字列の長さ\n\n // i文字目を末尾とするsの部分文字列と、\n // j文字目を末尾とするtの部分文字列の一致長を計算\n for (int i = 1; i <= n; i++) {\n for (int j = 1; j <= m; j++) {\n if (s[i - 1] == t[j - 1]) {\n // 末尾文字が一致する場合、ひとつ前の状態から延長\n curr[j] = prev[j - 1] + 1;\n best = max(best, curr[j]);\n } else {\n // 一致しなければ長さ0にリセット\n curr[j] = 0;\n }\n }\n // 次の行計算のためprevとcurrを入れ替え\n swap(prev, curr);\n // currは0で埋め直しておく（安全策）\n fill(curr.begin(), curr.end(), 0);\n }\n\n // 結果出力\n cout << best << \"\\n\";\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 3712, "score_of_the_acc": -0.0055, "final_rank": 1 }, { "submission_id": "aoj_0528_10441224", "code_snippet": "#include \"bits/stdc++.h\"\n#include <ext/pb_ds/assoc_container.hpp>\n#include <ext/pb_ds/tree_policy.hpp>\n#include <ext/pb_ds/tag_and_trait.hpp>\nusing namespace __gnu_pbds;\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\n#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)\n#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)\n#define Endl endl\n#define all(a) a.begin(), a.end()\n#define pr(i, j) make_pair(i, j)\n#define isin(x, l, r) (l <= x && x < r)\n#define chmin(a, b) a = min(a, b)\n#define chmax(a, b) a = max(a, b)\n#define srt(ar) sort(ar.begin(), ar.end())\n#define rev(ar) reverse(ar.begin(), ar.end())\n#define jge(f, s, t) cout << (f ? s : t) << endl\ntemplate <typename T>\nusing ordered_set = tree<T, null_type, std::less<T>, rb_tree_tag, tree_order_statistics_node_update>;\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n#define printar(ar) \\\n do \\\n { \\\n for (auto dbg : ar) \\\n { \\\n cout << dbg << \" \"; \\\n } \\\n cout << endl; \\\n } while (0)\nconst ll inf = 1e18;\nconst ld pi = 3.14159265358979;\nconst ld eps = 1e-9;\ntemplate <class T, ll n, ll idx = 0>\nauto make_vec(const ll (&d)[n], const T &init) noexcept\n{\n if constexpr (idx < n)\n return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));\n else\n return init;\n}\n\ntemplate <class T, ll n>\nauto make_vec(const ll (&d)[n]) noexcept\n{\n return make_vec(d, T{});\n}\n//////////////// 以下を貼る ////////////////\ntemplate <class T>\nsize_t HashCombine(const size_t seed, const T &v)\n{\n return seed ^ (std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2));\n}\n/* pair用 */\ntemplate <class T, class S>\nstruct std::hash<std::pair<T, S>>\n{\n size_t operator()(const std::pair<T, S> &keyval) const noexcept\n {\n return HashCombine(std::hash<T>()(keyval.first), keyval.second);\n }\n};\n/* vector用 */\ntemplate <class T>\nstruct std::hash<std::vector<T>>\n{\n size_t operator()(const std::vector<T> &keyval) const noexcept\n {\n size_t s = 0;\n for (auto &&v : keyval)\n s = HashCombine(s, v);\n return s;\n }\n};\n/* tuple用 */\ntemplate <int N>\nstruct HashTupleCore\n{\n template <class Tuple>\n size_t operator()(const Tuple &keyval) const noexcept\n {\n size_t s = HashTupleCore<N - 1>()(keyval);\n return HashCombine(s, std::get<N - 1>(keyval));\n }\n};\ntemplate <>\nstruct HashTupleCore<0>\n{\n template <class Tuple>\n size_t operator()(const Tuple &keyval) const noexcept { return 0; }\n};\ntemplate <class... Args>\nstruct std::hash<std::tuple<Args...>>\n{\n size_t operator()(const tuple<Args...> &keyval) const noexcept\n {\n return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);\n }\n};\n////////////////////////////////////////////\n/////////////////////////////////////////////////////////////////\n\nconst ull mod = 0x1fffffffffffffff, base = chrono::duration_cast<chrono::microseconds>(chrono::system_clock::now().time_since_epoch()).count() % mod;\nstruct RollingHash\n{\n vector<ull> hashed, power;\n\n static constexpr ull mask(ll a) { return (1ULL << a) - 1; }\n\n inline ull mul(ull a, ull b) const\n {\n // without __uint128_t\n ull a31 = a >> 31, b31 = b >> 31;\n a &= mask(31);\n b &= mask(31);\n ull x = a * b31 + b * a31;\n ull ans = (a31 * b31 << 1) + (x >> 30) + ((x & mask(30)) << 31) + a * b;\n //*/\n ans = (ans >> 61) + (ans & mod);\n if (ans >= mod)\n ans -= mod;\n return ans;\n }\n\n RollingHash(const string &s)\n {\n ll n = s.size();\n hashed.assign(n + 1, 0);\n power.assign(n + 1, 0);\n power[0] = 1;\n for (ll i = 0; i < n; i++)\n {\n power[i + 1] = mul(power[i], base);\n hashed[i + 1] = mul(hashed[i], base) + s[i];\n if (hashed[i + 1] >= mod)\n hashed[i + 1] -= mod;\n }\n }\n\n ull get(ll l, ll r) const\n {\n ull ret = hashed[r] + mod - mul(hashed[l], power[r - l]);\n if (ret >= mod)\n ret -= mod;\n return ret;\n }\n\n ull connect(ull h1, ull h2, ll h2len) const\n {\n ull ret = mul(h1, power[h2len]) + h2;\n if (ret >= mod)\n ret -= mod;\n return ret;\n }\n\n void connect(const string &s)\n {\n ll n = hashed.size() - 1, m = s.size();\n hashed.resize(n + m + 1);\n power.resize(n + m + 1);\n for (ll i = n; i < n + m; i++)\n {\n power[i + 1] = mul(power[i], base);\n hashed[i + 1] = mul(hashed[i], base) + s[i - n];\n if (hashed[i + 1] >= mod)\n hashed[i + 1] -= mod;\n }\n }\n\n ll LCP(const RollingHash &b, ll l1, ll r1, ll l2, ll r2)\n {\n ll len = min(r1 - l1, r2 - l2);\n ll low = -1, high = len + 1;\n while (high - low > 1)\n {\n ll mid = (low + high) / 2;\n if (get(l1, l1 + mid) == b.get(l2, l2 + mid))\n low = mid;\n else\n high = mid;\n }\n return low;\n }\n};\n\n/*\n\nmod 2^61 - 1 の RollingHash です 結構強いです\n名前の衝突がある場合は namespace で囲うと良いです\nhashed[i] : s[0, i) のハッシュ結果 hashed[i + 1] = s[i] + s[i-1] * power[1] + s[i-2] * power[2] + ...\npower[i] : base ** i\nget(l, r) : s[l, r) のハッシュ結果 s[r-1] + s[r-2] * power[1] + ... + s[l] * power[r - l + 1]\nconnect(h1, h2, h2len) : 2つのハッシュ結果からそれらを繋げたときのハッシュ結果を得ます\nconnect(s) : コンストラクタで渡した文字列に s を繋げたことにします 過去必要になったやつ\nLCP(...) : Longest Common Prefix の長さ\n\n*/\n////////////////////////////////////////\nint main()\n{\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n string s, t;\n while (cin >> s >> t)\n {\n vector<vector<ll>> dp(s.length() + 1, vector<ll>(t.length() + 1));\n rep(i, 0, s.length())\n {\n rep(j, 0, t.length())\n {\n if (s[i] == t[j])\n {\n chmax(dp[i + 1][j + 1], dp[i][j] + 1);\n }\n }\n }\n ll ans = 0;\n rep(i, 0, s.length() + 1)\n {\n rep(j, 0, t.length() + 1)\n {\n chmax(ans, dp[i][j]);\n }\n }\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 340, "memory_kb": 128768, "score_of_the_acc": -1.3919, "final_rank": 20 }, { "submission_id": "aoj_0528_10316490", "code_snippet": "#line 1 \"aizu-suffix-array.test.cpp\"\n#define PROBLEM \"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0528\"\n\n#line 1 \"/Users/alfred/Desktop/Tools/cpp-templates/src/alfred/config/io-sync-off.hpp\"\n#include <bits/stdc++.h>\n\ninline void optimizeIO(void) {\n std::ios::sync_with_stdio(false);\n std::cin.tie(NULL), std::cout.tie(NULL);\n}\n#line 1 \"/Users/alfred/Desktop/Tools/cpp-templates/src/alfred/string/suffix-array.hpp\"\n\n\n\n#line 7 \"/Users/alfred/Desktop/Tools/cpp-templates/src/alfred/string/suffix-array.hpp\"\n\n#line 1 \"/Users/alfred/Desktop/Tools/cpp-templates/src/alfred/data_structure/sparse-table.hpp\"\n\n\n\n#line 7 \"/Users/alfred/Desktop/Tools/cpp-templates/src/alfred/data_structure/sparse-table.hpp\"\n\ntemplate <class T>\nstruct MaxInfo {\n T val;\n MaxInfo(void) { val = std::numeric_limits<T>::min(); }\n template <class InitT>\n MaxInfo(InitT x) { val = x; }\n MaxInfo operator+(MaxInfo &x) {\n return {std::max(val, x.val)};\n }\n};\ntemplate <class T>\nstruct MinInfo {\n T val;\n MinInfo(void) { val = std::numeric_limits<T>::max(); }\n template <class InitT>\n MinInfo(InitT x) { val = x; }\n MinInfo operator+(MinInfo &x) {\n return {std::min(val, x.val)};\n }\n};\ntemplate <class T>\nstruct GcdInfo {\n T val;\n GcdInfo(void) { val = T(); }\n template <class InitT>\n GcdInfo(InitT x) { val = x; }\n GcdInfo operator+(GcdInfo &x) {\n#if __cplusplus >= 201703L\n return {std::gcd(x.val, val)};\n#else\n return {__gcd(x.val, val)};\n#endif\n }\n};\ntemplate <class T>\nclass SparseTable {\nprivate:\n int n;\n std::vector<std::vector<T>> ST;\n\npublic:\n SparseTable(void) {}\n SparseTable(int N) : n(N), ST(N, std::vector<T>(std::__lg(N) + 1)) {}\n template <class InitT>\n SparseTable(std::vector<InitT> &_init) : SparseTable(_init.size()) { init(_init, true); }\n template <class InitT>\n inline void init(std::vector<InitT> &_init, bool internal = false) {\n if (!internal) {\n n = _init.size();\n ST.assign(n, std::vector<T>(std::__lg(n) + 1));\n }\n for (int i = 0; i < n; i++) ST[i][0] = T(_init[i]);\n for (int i = 1; (1 << i) <= n; i++) {\n for (int j = 0; j + (1 << i) - 1 < n; j++) {\n ST[j][i] = ST[j][i - 1] + ST[j + (1 << (i - 1))][i - 1];\n }\n }\n }\n inline T query(int l, int r) { // 0 based\n if (l > r) return T();\n int w = std::__lg(r - l + 1);\n return ST[l][w] + ST[r - (1 << w) + 1][w];\n }\n inline T disjoint_query(int l, int r) {\n T ans = T();\n for (int i = l; i <= r; i += (1 << std::__lg(r - i + 1))) {\n ans = ans + ST[i][std::__lg(r - i + 1)];\n }\n return ans;\n }\n};\n\n\n#line 9 \"/Users/alfred/Desktop/Tools/cpp-templates/src/alfred/string/suffix-array.hpp\"\n\nclass SuffixArray {\nprivate:\n int n;\n std::string s; // internal is 1-index, access is 0-indexed.\n SparseTable<MinInfo<int>> ST;\n std::vector<int> sa, rnk, old, h;\n\npublic:\n SuffixArray(std::string S) : n(S.size()), s(S) {\n const int m = n + 1;\n s.insert(s.begin(), ' '), sa.assign(m, 0);\n rnk.assign(m, 0), old.assign(m, 0), h.assign(m, 0);\n for (int i = 1; i <= n; i++) sa[i] = i, rnk[i] = s[i];\n\n for (int w = 1; w < n; w *= 2) {\n std::copy(rnk.begin(), rnk.end(), old.begin());\n auto cmp = [&](int x, int y) {\n if (old[x] != old[y]) return old[x] < old[y];\n if (y + w > n) return false;\n if (x + w > n) return true;\n return old[x + w] < old[y + w];\n };\n std::sort(std::next(sa.begin()), sa.end(), cmp);\n for (int i = 1; i <= n; i++) {\n rnk[sa[i]] = rnk[sa[i - 1]] + cmp(sa[i - 1], sa[i]);\n }\n if (rnk[sa[n]] == n) break;\n }\n\n for (int i = 1, k = 0; i <= n; i++) {\n if (rnk[i] == 0) continue;\n if (k != 0) k--;\n while (std::max(i, sa[rnk[i] - 1]) <= n - k &&\n s[i + k] == s[sa[rnk[i] - 1] + k]) {\n k++;\n }\n h[rnk[i]] = k;\n }\n ST.init(h);\n }\n const std::vector<int> get_h(void) { return h; }\n const std::vector<int> get_sa(void) { return sa; }\n const std::vector<int> get_rnk(void) { return rnk; }\n inline int lcp(int i, int j) { // 0-indexed !\n i = rnk[i + 1], j = rnk[j + 1];\n if (i > j) std::swap(i, j);\n return i == j ? n - i : ST.query(i + 1, j).val;\n }\n};\n\n\n#line 6 \"aizu-suffix-array.test.cpp\"\n\nstd::string S, T;\n\ninline void solve(void) {\n SuffixArray SA(S + '#' + T);\n int n = S.size(), m = T.size(), ans = 0;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n ans = std::max(ans, SA.lcp(i, j + n + 1));\n }\n }\n std::cout << ans << '\\n';\n}\n\nint main(int argc, char const *argv[]) {\n optimizeIO();\n while (std::cin >> S >> T) {\n solve();\n }\n return 0;\n}", "accuracy": 1, "time_ms": 430, "memory_kb": 4000, "score_of_the_acc": -0.5213, "final_rank": 8 }, { "submission_id": "aoj_0528_9902984", "code_snippet": "#include <bits/stdc++.h>\n\n\nusing namespace std;\n//make -f ../makefile SRC=\n/*\n\n\n*/\n\n//------------------------------------------------------------------------------\nbool DEBUG = false;\n\n//------------------------------------------------------------------------------\nint lcs(const string& X, const string& Y)\n{\n int res = 0;\n\n int M = X.size();\n int N = Y.size();\n\n int S[M+1][N+1];\n for (int i=0; i<M+1; i++)\n {\n for (int j=0; j<N+1; j++)\n {\n if (i == 0 || j == 0) S[i][j] = 0;\n else if (X[i-1] == Y[j-1])\n {\n S[i][j] = S[i-1][j-1] + 1;\n res = max(res, S[i][j]);\n }\n else S[i][j] = 0;\n }\n }\n return res;\n}\n\n//------------------------------------------------------------------------------\nint main()\n{\n //DEBUG = true;\n //test(); return 0;\n //--------------------------------------------------------------------------\n string X, Y;\n while (true)\n {\n getline(cin, X);\n if (cin.eof()) break;\n getline(cin, Y);\n int res = lcs(X, Y);\n printf(\"%d\\n\", res);\n }\n\n //--------------------------------------------------------------------------\n return 0;\n}\n//------------------------------------------------------------------------------", "accuracy": 1, "time_ms": 90, "memory_kb": 66124, "score_of_the_acc": -0.5559, "final_rank": 10 }, { "submission_id": "aoj_0528_9818211", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n\nint main() {\n string s, t;\n while (cin >> s >> t) {\n vector<vector<int> > dp(s.size(), vector<int>(t.size(), 0));\n int mx = -1;\n for (int i = 0; i < s.size(); i++) {\n for (int j = 0; j < t.size(); j++) {\n if (s[i] != t[j]) {\n dp[i][j] = 0;\n } else {\n if (i > 0 && j > 0) dp[i][j] = dp[i - 1][j - 1];\n dp[i][j]++;\n }\n if (dp[i][j] > mx) {\n mx = dp[i][j];\n }\n }\n }\n cout << mx << endl;\n }\n}", "accuracy": 1, "time_ms": 240, "memory_kb": 65936, "score_of_the_acc": -0.7571, "final_rank": 16 }, { "submission_id": "aoj_0528_9818210", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n\nint main() {\n string s, t;\n while (cin >> s >> t) {\n vector<vector<int> > dp(s.size(), vector<int>(t.size(), 0));\n int mx = -1;\n int idx = 0;\n for (int i = 0; i < s.size(); i++) {\n for (int j = 0; j < t.size(); j++) {\n if (s[i] != t[j]) {\n dp[i][j] = 0;\n } else {\n if (i > 0 && j > 0) dp[i][j] = dp[i - 1][j - 1];\n dp[i][j]++;\n if (dp[i][j] > mx) {\n mx = dp[i][j];\n idx = i;\n }\n }\n }\n }\n string ans;\n for (int i = idx; i > idx - mx; i--) {\n ans = s[i] + ans;\n }\n cout << ans.size() << endl;\n }\n}", "accuracy": 1, "time_ms": 180, "memory_kb": 65648, "score_of_the_acc": -0.6737, "final_rank": 12 }, { "submission_id": "aoj_0528_6893652", "code_snippet": "#include <bits/stdc++.h>\n#include <random>\nusing namespace std;\n//#include <atcoder/all>\n//using namespace atcoder;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vvvvll = vector<vvvll>;\nusing vvvvvll = vector<vvvvll>;\nusing vvvvvvll = vector<vvvvvll>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\nusing vvvvb = vector<vvvb>;\nusing vd = vector<double>;\nusing vvd = vector<vd>;\nusing vvvd = vector<vvd>;\nusing vvvvd = vector<vvvd>;\nusing vvvvvd = vector<vvvvd>;\n#define all(A) A.begin(),A.end()\n#define ALL(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\nusing pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;\n\ntemplate<class T>\nbool chmax(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\ntemplate<class T>\nbool chmin(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p > q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\nll gcd(ll(a), ll(b)) {\n if (b == 0)return a;\n ll c = a;\n while (a % b != 0) {\n c = a % b;\n a = b;\n b = c;\n }\n return b;\n}\n\n\nstruct dsu {\n public:\n dsu() : _n(0) {}\n dsu(int n) : _n(n), par_size(n, -1) {}\n\n int merge(int a, int b) {\n int x = leader(a), y = leader(b);\n if (x == y) return x;\n if (-par_size[x] < -par_size[y]) swap(x, y);\n par_size[x] += par_size[y];\n par_size[y] = x;\n return x;\n }\n int merge(pair<ll,ll> p) {\n int a=p.first;\n int b=p.second;\n int x = leader(a), y = leader(b);\n if (x == y) return x;\n if (-par_size[x] < -par_size[y]) swap(x, y);\n par_size[x] += par_size[y];\n par_size[y] = x;\n return x;\n }\n\n bool same(int a, int b) {\n return leader(a) == leader(b);\n }\n bool same(pair<ll,ll> p) {\n int a=p.first;\n int b=p.second;\n return leader(a) == leader(b);\n }\n\n int leader(int a) {\n if (par_size[a] < 0) return a;\n return par_size[a] = leader(par_size[a]);\n }\n\n int size(int a) {\n return -par_size[leader(a)];\n }\n\n vector<vector<int>> groups() {\n std::vector<int> leader_buf(_n), gr_size(_n);\n for (int i = 0; i < _n; i++) {\n leader_buf[i] = leader(i);\n gr_size[leader_buf[i]]++;\n }\n std::vector<vector<int>> res(_n);\n for (int i = 0; i < _n; i++) {\n res[i].reserve(gr_size[i]);\n }\n for (int i = 0; i < _n; i++) {\n res[leader_buf[i]].push_back(i);\n }\n res.erase(\n remove_if(res.begin(), res.end(),\n [&](const vector<int>& v) { return v.empty(); }),\n res.end());\n return res;\n }\n private:\n int _n;\n vector<int> par_size;\n};\n\ntemplate <class T> std::vector<int> z_algorithm(const std::vector<T>& s) {\n int n = int(s.size());\n if (n == 0) return {};\n std::vector<int> z(n);\n z[0] = 0;\n for (int i = 1, j = 0; i < n; i++) {\n int& k = z[i];\n k = (j + z[j] <= i) ? 0 : std::min(j + z[j] - i, z[i - j]);\n while (i + k < n && s[k] == s[i + k]) k++;\n if (j + z[j] < i + z[i]) j = i;\n }\n z[0] = n;\n return z;\n}\n\nvector<int> z_algorithm(const std::string& s) {\n int n = int(s.size());\n std::vector<int> s2(n);\n for (int i = 0; i < n; i++) {\n s2[i] = s[i];\n }\n return z_algorithm(s2);\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n string A,B;\n while(cin>>A>>B){\n if(A.size()<B.size())swap(A,B);\n ll an=0;\n //string AB=A+B;\n rep(i,A.size()){\n string AB=A.substr(i,A.size()-i)+B;\n auto p=z_algorithm(AB);\n for(ll j=A.size()-i;j<p.size();j++)chmax(an,min(ll(p[j]),ll(A.size()-i)));\n }\n cout<<an<<endl;\n }\n \n\n \n}", "accuracy": 1, "time_ms": 790, "memory_kb": 3500, "score_of_the_acc": -1.0038, "final_rank": 18 }, { "submission_id": "aoj_0528_6857909", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\nusing pii = pair<int, int>;\n\nint main()\n{\n string s, t;\n while (cin >> s) {\n cin >> t;\n int m = s.size();\n int ans = 0;\n rep(idx, m) {\n string st = s.substr(idx) + \"#\" + t;\n int n = st.size();\n\n vi<int> z(n);\n //z[0] = n;\n int i = 1, len = 0;\n while (i < n) {\n while (i + len < n && st[len] == st[i + len]) len++;\n z[i] = len;\n if (len == 0) {\n i++;\n continue;\n }\n int k = 1;\n while (k + z[k] < len) {\n z[i + k] = z[k];\n k++;\n }\n len -= k;\n i += k;\n }\n \n for (int i = m - idx; i < n; i++) ans = max(ans, z[i]);\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 440, "memory_kb": 3432, "score_of_the_acc": -0.5303, "final_rank": 9 }, { "submission_id": "aoj_0528_6857167", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\n#include <cmath>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\nusing pii = pair<int, int>;\n\nvoid chmax(int& x, int y) { x = max(x, y); }\n\nint main()\n{\n std::cin.tie(nullptr);\n std::ios_base::sync_with_stdio(false);\n string s, t;\n while(cin >> s){\n cin >> t;\n int ls = s.size(), lt = t.size();\n \n vi<int> dp(lt + 1);\n \n int ans = 0;\n for (int i = ls - 1; i >= 0; i--) {\n vi<int> prev(lt + 1);\n swap(dp, prev);\n for (int j = lt - 1; j >= 0; j--) {\n if (s[i] == t[j]) {\n dp[j] = prev[j + 1] + 1;\n chmax(ans, dp[j]);\n }\n }\n }\n \n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 3308, "score_of_the_acc": -0.0563, "final_rank": 4 }, { "submission_id": "aoj_0528_6704931", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n string s;\n string t;\n while (cin >> s >> t) {\n s = \"0\" + s;\n t = \"0\" + t;\n\n deque<vector<int>> dp;\n dp.push_back(vector<int>(t.length(), 0));\n int max_len = 0;\n for (int i = 1; i < (int)s.length(); ++i) {\n vector<int> sv = dp.front();\n dp.pop_front();\n vector<int> tv(t.length(), 0);\n for (int j = 1; j < (int)t.length(); ++j) {\n if (s[i] == t[j]) {\n tv[j] = sv[j - 1] + 1;\n max_len = max(max_len, tv[j]);\n }\n }\n dp.push_back(tv);\n }\n cout << max_len << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 3432, "score_of_the_acc": -0.0708, "final_rank": 6 }, { "submission_id": "aoj_0528_6350881", "code_snippet": "#include<string.h>\n#include<stdio.h>\n#define MAXN 4000\n\n\nchar g_a[MAXN + 1];\nchar g_b[MAXN + 1];\n\n\nint g_dp[MAXN + 1][MAXN + 1];\n\nvoid slove()\n{\n\tint alen = strlen(g_a);\n\tint blen = strlen(g_b);\n\n\tint maxlen = 0;\n\n\tfor (int i = 1; i <= blen; i++)\n\t{\n\t\tfor (int j = 1; j <= alen; j++)\n\t\t{\n\t\t\tif (g_b[i - 1] == g_a[j - 1])\n\t\t\t{\n\t\t\t\tg_dp[i][j] = g_dp[i - 1][j - 1] + 1;\n\t\t\t\tif (maxlen < g_dp[i][j])\n\t\t\t\t\tmaxlen = g_dp[i][j];\n\t\t\t}\n\t\t}\n\t}\n\n\tprintf(\"%d\\n\", maxlen);\n}\n\n\n\nint main()\n{\n\twhile (1)\n\t{\n\t\tmemset(g_a, 0, sizeof(g_a));\n\t\tmemset(g_b, 0, sizeof(g_b));\n\t\tmemset(g_dp, 0, sizeof(g_dp));\n\t\tif (scanf(\"%s\", g_a) == EOF)\n\t\t\tbreak;\n\n\t\tscanf(\"%s\", g_b);\n\t\tslove();\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 65248, "score_of_the_acc": -0.603, "final_rank": 11 }, { "submission_id": "aoj_0528_6274620", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint dp[4444][4444];\n\nint main(void)\n{\n\tint i, j, ans = 0;\n\n\tstring a, b;\n\twhile (cin >> a >> b) {\n\n \tint alen = a.size(), blen = b.size();\n \ta = '#' + a, b = '#' + b;\n ans = 0;\n \tfor (i = 1; i <= alen; i++)\n \t\tfor (j = 1; j <= blen; j++)\n \t\t{\n \t\t\tif (a[i] == b[j])\n \t\t\t\tdp[i][j] = dp[i - 1][j - 1] + 1;\n \t\t\telse\n dp[i][j] = 0;\n \n \t\t\tif (ans < dp[i][j])\n \t\t\t\tans = dp[i][j];\n \t\t}\n \n \tprintf(\"%d\\n\" ,ans);\n\t}\n return 0;\n}", "accuracy": 1, "time_ms": 160, "memory_kb": 72720, "score_of_the_acc": -0.7029, "final_rank": 15 }, { "submission_id": "aoj_0528_6158065", "code_snippet": "#include \"bits/stdc++.h\"\n\n#define REP(i,num) for(ll i=0;i<(num);++i)\n#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))\n#define LOOP(i) while(i--)\n#define ALL(c) c.begin(),c.end()\n#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;\n#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}\n\nusing namespace std;\n//using ll = long long;\nusing ll = int;\nusing ull = unsigned long long;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\n\nconstexpr ll atcoder_mod = 1e9+7;\n\ntemplate<typename T=ll>\nT in(){ T x; cin >> x; return (x); }\ntemplate<typename T=ll,typename C=vector<T>>\nC vecin(int N){ C x(N);REP(i,N){ x[i]=in<T>(); }return x; }\ntemplate<typename T=ll,size_t N>\narray<T,N> arrin(){array<T,N> x;REP(i,N){ x[i]=in<T>(); }return x;}\n\nvoid vout(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid vout(Head&& h,Tail&&... t){ cout << ' ' << h;vout(forward<Tail>(t)...); }\nvoid out(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid out(Head&& h,Tail&&... t){ cout << h;vout(forward<Tail>(t)...); }\n\ntemplate<typename T>\nbool chmax(T& a,T b){ if(a<b){ a=b;return true; }return false; }\ntemplate<typename T>\nbool chmin(T& a,T b){ if(a>b){ a=b;return true; }return false; }\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(10);\n\n\twhile(true){\n\t\tstring S,T;\n\t\tgetline(cin,S);\n\t\tif(cin.eof()) break;\n\t\tgetline(cin,T);\n\t\t\n\t\tvvll dp(T.length()+1,vll(S.length()+1,0));\n\t\tREP(i,T.length()){\n\t\t\tREP(j,S.length()){\n\t\t\t\tif(S[j]==T[i]){\n\t\t\t\t\tdp[i+1][j+1] = dp[i][j]+1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tll maxL=0;\n\t\tREP(i,T.length()){\n\t\t\tREP(j,S.length()){\n\t\t\t\tmaxL = max(maxL,dp[i+1][j+1]);\n\t\t\t}\n\t\t}\n\t\tout(maxL);\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 300, "memory_kb": 65808, "score_of_the_acc": -0.8372, "final_rank": 17 }, { "submission_id": "aoj_0528_5947023", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\ntypedef long long ll;\ntypedef pair<long long, long long> P;\nconst long long INF = 1e18;\nconst ll MOD = INF;\ntemplate <typename T>\nvoid input_arr(vector<T>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i];\n\t}\n}\ntemplate <typename T, typename Q>\nvoid input_arr(vector<pair<T, Q>>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i].first >> A[i].second;\n\t}\n}\ntemplate <typename T>\nvoid input_arr(vector<vector<T>>& A, ll H, ll W) {\n\tfor (ll i = 0; i < H; i++) {\n\t\tfor (ll j = 0; j < W; j++) {\n\t\t\tcin >> A[i][j];\n\t\t}\n\t}\n}\nint main() {\n\tstring S, T;\n\twhile (cin >> S >> T) {\n\t\tll ans = 0;\n\t\tfor (ll i = 0; i < S.size(); i++) {\n\t\t\tll num = 0, sum = 0;\n\t\t\tfor (ll j = 0; j < T.size() && i + j < S.size(); j++) {\n\t\t\t\tif (S[i + j] == T[j]) {\n\t\t\t\t\tsum++;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tnum = max(num, sum);\n \tsum = 0;\n\t\t\t\t}\n\t\t\t}\n \tnum = max(num, sum);\n\t\t\tans = max(ans, num);\n\t\t}\n \tfor (ll i = 0; i < T.size(); i++) {\n\t\t\tll num = 0, sum = 0;\n\t\t\tfor (ll j = 0; j < S.size() && i + j < T.size(); j++) {\n\t\t\t\tif (T[i + j] == S[j]) {\n\t\t\t\t\tsum++;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tnum = max(num, sum);\n \tsum = 0;\n\t\t\t\t}\n\t\t\t}\n \tnum = max(num, sum);\n\t\t\tans = max(ans, num);\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 3276, "score_of_the_acc": -0.0426, "final_rank": 3 }, { "submission_id": "aoj_0528_5790653", "code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<sstream>\n#include<regex>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int Mod=998244353;\nconst int inf=mod*mod;\nconst double eps=1e-9;\nint dp[4001][4001];\nsigned main(){\n\tstring s,t;\n\twhile(cin>>s>>t){\n\t\tfor(int i=0;i<=s.size();i++)\n\t\t\tfor(int j=0;j<=t.size();j++)\n\t\t\t\tdp[i][j]=0;\n\t\tint mx=0;\n\t\tfor(int i=0;i<s.size();i++){\n\t\t\tfor(int j=0;j<t.size();j++){\n\t\t\t\tif(s[i]==t[j]){\n\t\t\t\t\tdp[i+1][j+1]=dp[i][j]+1;\n\t\t\t\t\tmx=max(mx,dp[i+1][j+1]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<mx<<endl;\n\t}\n}", "accuracy": 1, "time_ms": 120, "memory_kb": 128528, "score_of_the_acc": -1.0927, "final_rank": 19 }, { "submission_id": "aoj_0528_5759142", "code_snippet": "#include<iostream>\n\nusing namespace std;\n\nint dp[4001][4001];\n\nint main()\n{\n\tstring s1,s2;\n\twhile (cin >> s1)\n\t{\n\t\tcin >> s2;\n\t\tint ans = 0;\n\t\tfor (int i = 1; i <= s1.size(); i++)\n\t\t for (int j = 1; j <= s2.size(); j++)\n\t\t\t dp[i][j] = 0;\n\t\tfor (int i = 1; i <= s1.size(); i++)\n\t\t{\n\t\t\tfor (int j = 1; j <= s2.size(); j++)\n\t\t\t{\n\t\t\t\tif (s1[i - 1] == s2[j - 1])\n\t\t\t\t{\n\t\t\t\t\tdp[i][j] = dp[i - 1][j - 1] + 1;\n\t\t\t\t\tans = max(ans, dp[i][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\n //system(\"pause\");\n}", "accuracy": 1, "time_ms": 200, "memory_kb": 65652, "score_of_the_acc": -0.7008, "final_rank": 14 }, { "submission_id": "aoj_0528_5701005", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n\nusing namespace std;\n\nint dp[4001][4001];\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tstd::ifstream ifs(\"test0.txt\");\n\tstd::cin.rdbuf(ifs.rdbuf());\n#endif\n\t\n\twhile (true) {\n\t\tstring s, t;\n\t\tcin >> s >> t;\n\t\tif (s == \"\") {\n\t\t\tbreak;\n\t\t}\n\t\tint n = s.size();\n\t\tint m = t.size();\n\t\tint max_length = 0;\n\t\tfor (int i = 0; i < 4001; i++) {\n\t\t\tdp[i][0] = 0;\n\t\t\tdp[0][i] = 0;\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tif (s[i] == t[j]) {\n\t\t\t\t\tdp[i + 1][j + 1] = dp[i][j] + 1;\n\t\t\t\t\tmax_length = max(max_length, dp[i + 1][j + 1]);\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tdp[i + 1][j + 1] = 0;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << max_length << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 190, "memory_kb": 65556, "score_of_the_acc": -0.6865, "final_rank": 13 }, { "submission_id": "aoj_0528_5473498", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, N) for (ll i = 0; i < N; i++)\n\nint main()\n{\n\n string a, b;\n while(cin >> a >> b){\n ll alen = a.length();\n ll blen = b.length();\n ll maxv = 0;\n ll cnt = 0;\n rep(i, alen)\n {\n rep(j, blen)\n {\n if(i+j >= alen-1) continue;\n if (a[i + j] == b[j])\n {\n cnt++;\n }\n else\n {\n maxv = max(maxv, cnt);\n cnt = 0;\n }\n }\n maxv = max(maxv, cnt);\n cnt = 0;\n }\n\n rep(i, alen)\n {\n rep(j, blen)\n {\n if(alen -1 - i - j < 0) continue;\n\n if (a[alen -1 - i - j] == b[blen - 1 - j])\n {\n cnt++;\n }\n else\n {\n maxv = max(maxv, cnt);\n cnt = 0;\n }\n }\n maxv = max(maxv, cnt);\n cnt = 0;\n }\n\n cout << maxv << endl;\n }\n}", "accuracy": 1, "time_ms": 140, "memory_kb": 3020, "score_of_the_acc": -0.1216, "final_rank": 7 } ]
aoj_0529_cpp
ダーツ 問題 あなたは以下のルールでダーツゲームをすることになった. あなたは,矢を的(まと)に向かって 4 本まで投げることができる.必ずしも 4 本全てを投げる必要はなく,1 本も投げなくてもかまわない.的は N 個の部分に区切られていて,各々の部分に点数 P 1 ,..., P N が書か れている.矢が刺さった場所の点数の合計 S があなたの得点の基礎となる.S があらかじめ決められたある点数 M 以下の場合は S がそのままあなたの得点となる.しかし,S が M を超えた場合はあなたの得点は 0 点となる. 的に書かれている点数と M の値が与えられたとき,あなたが得ることのできる点数の最大値を求めるプログラムを作成せよ. 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる． 1 行目には,整数 N (1 ≤ N ≤ 1000) と M (1 ≤ M ≤ 200000000 = 2 × 10 8 )がこの順に空白区切りで書かれている.2 行目以降の第 1 + i 行目 (1 ≤ i ≤ N ) には, P i (1 ≤ P i ≤ 100000000 = 10 8 ) が書かれている. 採点用データのうち, 配点の 20% 分は N ≤ 100 を満たし,配点の 50% 分はN ≤ 300 を満たす. N, M がともに 0 のとき入力の終了を示す. データセットの数は 10 を超えない． 出力 データセットごとにあなたが得ることのできる点数の最大値を１行に出力する. 入出力例 入力例 4 50 3 14 15 9 3 21 16 11 2 0 0 出力例 48 20 1つ目の例では,15 点の部分に 3 本,3 点の部分に 1 本の矢が刺さった場合にあなたの得点は最大になり,その得点は 48 点である. 2つ目の例では,16 点の場所に 1 本,2 点の場所に 2 本の矢が刺さった場合にあなたの得点は最大になり,その得点は 20 点である. 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0529_11008304", "code_snippet": "#define _GLGBCXX_DEBUG\n#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n while (true) {\n int N, M, answer = 0;\n cin >> N >> M;\n\n if (N == 0 && M == 0)\n break;\n \n vector<int> P(N + 1), P_pair_score;\n \n for (int i = 0; i < N; i++)\n cin >> P.at(i);\n \n P.push_back(0);\n \n for (int i = 0; i < N; i++)\n for (int j = i + 1; j < N + 1; j++)\n P_pair_score.push_back(P.at(i) + P.at(j));\n \n sort(P_pair_score.begin(), P_pair_score.end());\n \n for (int score: P_pair_score) {\n if (score <= M) {\n auto itr = upper_bound(P_pair_score.begin(), P_pair_score.end(), M - score);\n \n if (itr == P_pair_score.begin())\n answer = max(answer, score);\n else {\n itr--;\n answer = max(answer, score + *itr);\n }\n } else\n break;\n }\n \n cout << answer << '\\n';\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 190, "memory_kb": 6860, "score_of_the_acc": -0.0041, "final_rank": 1 }, { "submission_id": "aoj_0529_10883913", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include<utility>\n#include<set>\n#include<deque>\n#include <unordered_map>\n#include<string>\n#include<map>\n#include<cmath>\n\nusing namespace std;\n\n\nint main() {\n\twhile (true) {\n\t\tint N, M;\n\t\tcin >> N >> M;\n\t\tif (N == 0 and M == 0)break;\n\t\tvector<long long>s(N);\n\n\t\tfor (int i = 0; i < N; i++)cin >> s[i];\n\t\ts.push_back(0);\n\t\tvector<int>V;\n\t\tfor (int i = 0; i <= N; i++) {\n\t\t\tfor (int j = 0; j <= N; j++) {\n\t\t\t\tV.push_back(s[i] + s[j]);\n\t\t\t}\n\t\t}\n\n\t\tsort(V.begin(), V.end());\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < V.size(); i++) {\n\t\t\tint a = V[i];\n\t\t\tauto it = upper_bound(V.begin(), V.end(), M - a);\n\n\t\t\tint ind = it - V.begin();\n\t\t\tif (ind == 0)continue;\n\t\t\tind -= 1;\n\t\t\ta += V[ind];\n\t\t\tans = max(ans, a);\n\t\t}\n\n\t\tcout << ans << endl;\n\t}\n}", "accuracy": 1, "time_ms": 410, "memory_kb": 11212, "score_of_the_acc": -0.5513, "final_rank": 10 }, { "submission_id": "aoj_0529_10851051", "code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<string>\nusing namespace std;\nvector<int>v; int a[2000], n, k, maxn;\nint main() {\n\twhile (true) {\n\t\tcin >> n >> k; if (n == 0)break; maxn = 0; for (int i = 0; i < n; i++)cin >> a[i]; a[n] = 0; v.clear();\n\t\tfor (int i = 0; i <= n; i++) { for (int j = 0; j <= n; j++)v.push_back(a[i] + a[j]); }\n\t\tsort(v.begin(), v.end());\n\t\tfor (int i = 0; i < v.size(); i++) {\n\t\t\tint pos1 = upper_bound(v.begin(), v.end(), k - v[i]) - v.begin();\n\t\t\tif (pos1 >= 1)maxn = max(maxn, v[i] + v[pos1 - 1]);\n\t\t}\n\t\tcout << maxn << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 360, "memory_kb": 9116, "score_of_the_acc": -0.3954, "final_rank": 8 }, { "submission_id": "aoj_0529_10539492", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n while(true){\n int N;\n long long M;\n cin >> N >> M;\n if(!cin || (N==0 && M==0)) break;\n\n vector<int> P(N+1);\n P[0] = 0;\n for(int i=1;i<=N;i++){\n cin >> P[i];\n }\n\n // Build all sums of two throws (including throwing 0 darts via the 0 entry).\n int K = N+1; \n vector<int> X;\n X.reserve((long long)K * K);\n for(int i=0;i<K;i++){\n for(int j=0;j<K;j++){\n X.push_back(P[i] + P[j]);\n }\n }\n\n sort(X.begin(), X.end());\n\n long long best = 0;\n // For each x in X (sorted ascending), find max y in X with x+y <= M\n for(long long x : X){\n if(x > M) break; // since X sorted, all further x are too big\n long long rem = M - x;\n // upper_bound → first element > rem, step back one to get ≤ rem\n auto it = upper_bound(X.begin(), X.end(), (int)rem);\n if(it == X.begin()) continue;\n --it;\n best = max(best, x + (long long)*it);\n }\n\n cout << best << \"\\n\";\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 370, "memory_kb": 7700, "score_of_the_acc": -0.3742, "final_rank": 7 }, { "submission_id": "aoj_0529_10506515", "code_snippet": "// #pragma GCC optimize(3,\"Ofast\",\"inline\")\n#include <bits/stdc++.h>\n\nusing namespace std;\nusing i64=long long;\nusing u32=unsigned;\nusing u64=unsigned long long;\nusing u128=unsigned __int128;\n\nconstexpr int inf=numeric_limits<int>::max()/2;\nconstexpr i64 INF=numeric_limits<i64>::max()/2;\n\nvoid solve(){\n while(true){\n int n,m;\n cin>>n>>m;\n if(n==m&&m==0){\n break;\n }\n vector<int> p(n);\n for(int i=0;i<n;i++){\n cin>>p[i];\n }\n sort(p.begin(),p.end());\n i64 ans=0;\n for(int i=0;i<n;i++){\n if(p[i]<=m){\n ans=p[i];\n }else{\n break;\n }\n }\n for(int i=0;i<n;i++){\n for(int j=i;j<n;j++){\n i64 x=p[i]+p[j];\n if(x<=m){\n ans=max(ans,x);\n }else{\n break;\n }\n }\n }\n for(int i=0;i<n;i++){\n for(int j=0;j<=i;j++){\n i64 x=p[i]+p[j];\n int l=0,r=j;\n while(l<r){\n int mid=l+r+1>>1;\n if(x+p[mid]<=m){\n l=mid;\n }else{\n r=mid-1;\n }\n }\n if(x+p[l]<=m){\n ans=max(ans,x+p[l]);\n }\n }\n }\n vector<array<i64,2>> pre;\n for(int i=0;i<n;i++){\n for(int j=0;j<=i;j++){\n pre.push_back({p[i]+p[j],i});\n }\n }\n int t=pre.size();\n int c=0;\n map<i64,int,greater<i64>> cnt;\n for(int i=0;i<n;i++){\n while(c<t&&pre[c][1]<=i){\n cnt[pre[c++][0]]++;\n }\n for(int j=i;j<n;j++){\n i64 x=m-p[i]-p[j];\n auto it=cnt.lower_bound(x);\n if(it==cnt.end()){\n break;\n }\n i64 y=it->first;\n ans=max(ans,p[i]+p[j]+y);\n }\n }\n cout<<ans<<\"\\n\";\n }\n}\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int test=1;\n // cin>>test;\n while(test--){\n solve();\n }\n \n \n \n return 0;\n}", "accuracy": 1, "time_ms": 710, "memory_kb": 41788, "score_of_the_acc": -2, "final_rank": 20 }, { "submission_id": "aoj_0529_10341466", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n\nint main(){\n while(1){\n int n,m;\n cin >> n >> m;\n if(n==0 && m==0) break;\n\n vector<int> p(n);\n rep(i,n){\n cin >> p[i];\n }\n\n vector<int> twoSum={0};\n rep(i,n){\n twoSum.push_back(p[i]);\n for(int j=i;j<n;j++){\n twoSum.push_back(p[i]+p[j]);\n }\n }\n sort(twoSum.begin(),twoSum.end());\n\n int res=0;\n rep(i,twoSum.size()){\n int rem=m-twoSum[i];\n auto it=upper_bound(twoSum.begin(),twoSum.end(),rem);\n if(it!=twoSum.begin()){\n it--;\n res=max(res,twoSum[i]+*it);\n }\n }\n cout << res << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 210, "memory_kb": 7216, "score_of_the_acc": -0.0527, "final_rank": 2 }, { "submission_id": "aoj_0529_10036105", "code_snippet": "#include <bits/stdc++.h>\n#define endl '\\n'\n#define MAX 1000000\nusing namespace std;\ntypedef unsigned long long ull;\ntypedef long double db;\ntypedef long long ll;\ntypedef __int128 i128;\ntypedef pair<int,int>P;\ntypedef pair<ll,ll>Pll;\nmt19937 rnd(time(0));\nconst ll mod=1e9+7;\nconst ll INF=1e9;\nconst int N=1e3+5;\nvoid solve(){\n ll n,m;\n while(cin >> n >> m){\n if(n==0&&m==0) break;\n vector<ll>a(n);\n for(int i=0;i<n;i++) cin >> a[i];\n sort(a.begin(),a.end());\n vector<ll>sum;\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n ll A=a[i]+a[j];\n sum.push_back(A);\n }\n }\n for(int i=0;i<n;i++) sum.push_back(a[i]);\n ll ans=0;\n sort(sum.begin(),sum.end());\n for(int i=0;i<n;i++){\n for(int j=0;j<n;j++){\n ll D=m-a[i]-a[j];\n int id=lower_bound(sum.begin(),sum.end(),D)-sum.begin();\n if(id==sum.size()) id--;\n if(id==0&&sum[id]>D) continue;\n if(sum[id]>D) id--;\n ans=max(ans,sum[id]+a[i]+a[j]); \n }\n }\n for(int i=0;i<n;i++){\n ll D=m-a[i];\n int id=lower_bound(sum.begin(),sum.end(),D)-sum.begin();\n if(id==sum.size()) id--;\n if(id==0&&sum[id]>D) continue;\n if(sum[id]>D) id--;\n ans=max(ans,sum[id]+a[i]); \n }\n cout << ans << '\\n';\n }\n}\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(4);\n int T = 1;\n //cin >> T;\n while (T--) {\n solve();\n }\n return 0;\n}", "accuracy": 1, "time_ms": 490, "memory_kb": 18992, "score_of_the_acc": -0.9269, "final_rank": 17 }, { "submission_id": "aoj_0529_9371208", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n \n int N, M;\n \n while (true){\n cin >> N >> M;\n if (N == 0 && M == 0) break;\n \n vector<ll> p(N);\n for (auto &t : p) cin >> t;\n p.push_back(0);\n \n vector<ll> dbl;\n for (int i=0; i<N+1; i++){\n for (int j=0; j<N+1; j++){\n dbl.push_back(p[i] + p[j]);\n }\n }\n\n sort(dbl.begin(), dbl.end());\n \n ll max_score = 0;\n \n for (int i=0; i<(int)dbl.size(); i++){\n int itr = lower_bound(dbl.begin(), dbl.end(), M-dbl[i]) - dbl.begin();\n \n if (itr > 0) max_score = max(max_score, dbl[i] + dbl[itr-1]);\n }\n \n cout << max_score << endl;\n }\n}", "accuracy": 1, "time_ms": 410, "memory_kb": 19440, "score_of_the_acc": -0.7859, "final_rank": 12 }, { "submission_id": "aoj_0529_9033915", "code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n if (x < 0) { cout << (i64)(x); }\n else { cout << (u64)(x); }\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll N, M;\n cin >> N >> M;\n if ((N == 0) and (M == 0)) return 1;\n vi P(N);\n rep(i, N) cin >> P[i];\n vi Q(P);\n Q.eb(0);\n Q.eb(inf);\n rep(i, N) rep(j, N) Q.eb(P[i]+P[j]);\n sort(all(Q));\n ll ans = 0;\n rep(i, len(Q)-1) {\n if (M < Q[i]) continue;\n ll j = LB(Q, M-Q[i]+1);\n chmax(ans, Q[i]+Q[j-1]);\n }\n print(ans);\n return 0;\n}", "accuracy": 1, "time_ms": 420, "memory_kb": 18916, "score_of_the_acc": -0.7902, "final_rank": 14 }, { "submission_id": "aoj_0529_8942558", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main() {\n while (1) {\n int n, m;\n cin >> n >> m;\n if (!n && !m) break;\n vector<long long> P(n);\n for (int i = 0; i < n; i++) {\n cin >> P[i];\n }\n P.push_back(0);\n vector<long long> S;\n for (int i = 0; i <= n; i++) {\n for (int j = 0; j <= n; j++) {\n long long tmp = P[i] + P[j];\n S.push_back(tmp);\n }\n }\n sort(S.begin(), S.end());\n long long ans = 0;\n int n2 = S.size();\n for (int i = 0; i < n2; i++) {\n if (m - S[i] >= 0) {\n int l = 0, r = n2;\n while (r - l > 1) {\n int mid = (r + l) / 2;\n if (S[mid] <= m - S[i]) {\n l = mid;\n } else {\n r = mid;\n }\n }\n ans = max(ans, S[i] + S[l]);\n }\n }\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 470, "memory_kb": 19104, "score_of_the_acc": -0.8917, "final_rank": 16 }, { "submission_id": "aoj_0529_8942421", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main() {\n while (1) {\n int n, m;\n cin >> n >> m;\n if (!n && !m) break;\n vector<long long> P(n);\n vector<int> S;\n for (int i = 0; i < n; i++) {\n cin >> P[i];\n S.push_back(P[i]);\n }\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n long long tmp = P[i] + P[j];\n if (tmp <= m) {\n S.push_back(tmp);\n }\n }\n }\n P.push_back(0);\n sort(S.begin(), S.end());\n S.erase(unique(S.begin(), S.end()), S.end());\n long long ans = 0;\n for (int i = 0; i <= n; i++) {\n for (int j = 0; j <= n; j++) {\n long long tmp = m - P[i] - P[j];\n auto itr = upper_bound(S.begin(), S.end(), tmp);\n if (itr == S.begin()) continue;\n itr--;\n ans = max(ans, P[i] + P[j] + *itr);\n }\n }\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 570, "memory_kb": 11008, "score_of_the_acc": -0.8531, "final_rank": 15 }, { "submission_id": "aoj_0529_8680513", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n\twhile (true) {\n\t\tint n, m;\n\t\tcin >> n >> m;\n\n\t\tif (n == 0 && m == 0) break;\n\n\t\tvector <int> p(n + 1, 0);\n\t\tfor (int i = 1; i <= n; i++) cin >> p[i];\n\n\t\tvector <int> s, t;\n\t\tfor (int i = 0; i <= n; i++) for (int j = 0; j <= n; j++) s.push_back(p[i] + p[j]), t.push_back(p[i] + p[j]);\n\t\tsort(s.begin(), s.end());\n\t\tsort(t.begin(), t.end());\n\n\t\tint max_score = 0;\n\t\tfor (int i = 0; i < s.size(); i++) {\n\t\t\tif (m < s[i]) break;\n\t\t\tmax_score = max(max_score, s[i] + *prev(upper_bound(t.begin(), t.end(), m - s[i])));\n\t\t}\n\n\t\tcout << max_score << '\\n';\n\t}\n}", "accuracy": 1, "time_ms": 660, "memory_kb": 16444, "score_of_the_acc": -1.1812, "final_rank": 19 }, { "submission_id": "aoj_0529_8322690", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint query() {\n int n, m;\n cin >> n >> m;\n if (n == 0 && m == 0) return -1;\n vector<int> p(n + 1);\n for (int i = 1; i <= n; i++) cin >> p[i];\n vector<int> t;\n for (int i: p) for (int j: p) if (i + j <= m) t.push_back(i + j);\n sort(t.begin(), t.end());\n int ans = 0;\n for (int i: t) {\n int x = lower_bound(t.begin(), t.end(), m - i) - t.begin();\n if (x <= t.size()) {\n int c = i + t[x - 1];\n if (c <= m) ans = max(ans, c);\n }\n }\n return ans;\n}\n\nint main() {\n while (true) {\n int ans = query();\n if (ans == -1) break;\n cout << ans << '\\n';\n }\n}", "accuracy": 1, "time_ms": 370, "memory_kb": 11080, "score_of_the_acc": -0.4706, "final_rank": 9 }, { "submission_id": "aoj_0529_8065569", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing LL = long long;\n\nint main() {\n while (true) {\n int n, m;\n cin >> n >> m;\n if (n == 0 && m == 0) return 0;\n vector<LL> p(n + 1);\n for (int i = 1; i <= n; ++i) cin >> p[i];\n vector<LL> q = {0};\n for (int i = 0; i <= n; ++i) {\n for (int j = i; j <= n; ++j) {\n if (p[i] + p[j] <= m) q.push_back(p[i] + p[j]);\n }\n }\n sort(q.begin(), q.end());\n LL max_points = 0;\n for (LL x : q) {\n size_t pos = lower_bound(q.begin(), q.end(), m - x) - q.begin();\n if (pos == 0) {\n max_points = max(max_points, x + q[0]);\n } else {\n max_points = max(max_points, x + q[pos - 1]);\n }\n }\n cout << max_points << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 190, "memory_kb": 11100, "score_of_the_acc": -0.125, "final_rank": 3 }, { "submission_id": "aoj_0529_7895895", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vl = vector<ll>;\nusing vvl = vector<vl>;\nusing pl = pair<ll,ll>;\nusing vp = vector<pl>;\n#define rep(i,n) for(ll i=0;i<(ll)(n);++i)\n#define reps(i,s,n) for(ll i=(s);i<(ll)(n);++i)\n#define rep1(i,n) for(ll i=1;i<=(ll)(n);++i)\ntemplate<typename T>inline bool chmax(T &a,T b){return a<b?a=b,true:false;}\ntemplate<typename T>inline bool chmin(T &a,T b){return a>b?a=b,true:false;}\n#define fi first\n#define se second\n#define pb push_back\n#define eb emplace_back\n#define be(v) (v).begin(),(v).end()\nconst long long INF = 1e18;\n#ifdef DEBUG\n#include <debug.hpp>\n#endif\n\nbool solve(){\n\t#ifdef DEBUG\n\tcout << \"--- Input ---\" << endl;\n\t#endif\n\t//cin.unsetf(ios::skipws);\n\tll N,M;cin>>N>>M;\n\tif(N==0&&M==0)return false;\n\tvl P(N);rep(n,N)cin>>P.at(n);\n\n\tP.pb(0);\n\tvl v;\n\t//rep(i,N)rep(j,N){\n\tfor(auto e:P)for(auto f:P){\n\t\tv.pb(e+f);\n\t}\n\tsort(be(v));\n\t#ifdef DEBUG\n\tshow(N,M,P,v);\n\tcout << \"--- Logic ---\" << endl;\n\t#endif\n\tll ans=0;\n\tfor(auto e:v){\n\t\tauto it=lower_bound(be(v),M-e);\n\t\tif(it==v.end() && e<=M) chmax(ans,e);\n\t\telse if(e + *it<=M) chmax(ans,e + *it);\n\t\telse if(it>v.begin()) chmax(ans,e + *(it-1));\n\t\telse if(e<=M) chmax(ans,e);\n\t}\n\t#ifdef DEBUG\n\tcout << \"--- Answer ---\" << endl;\n\t#endif\n\tcout<<ans<<endl;\n\treturn true;\n}\nint main(){\n\t#ifdef DEBUG\n\tcout << \"--- Main ---\" << endl;\n\t#endif\n\t//solve();\n\twhile(solve());\n\treturn 0;\n}\n//cout << fixed << setprecision(9);", "accuracy": 1, "time_ms": 390, "memory_kb": 19208, "score_of_the_acc": -0.7408, "final_rank": 11 }, { "submission_id": "aoj_0529_7636981", "code_snippet": "#include <queue>\n#include <vector>\n#include <string>\n#include <cassert>\n#include <cstring>\n#include <iomanip>\n#include <numeric>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\n\ntypedef long long i64;\n\nint main() {\n\tios::sync_with_stdio(0);\n\tcin.tie(0);\n\t\n\tint n, m;\n\twhile (cin >> n >> m && !(n == 0 && m == 0)) {\n\t\tvector<int> a(n);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> a[i];\n\t\t}\n\t\t\n\t\tvector<int> todo;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\ttodo.emplace_back(a[i]);\n\t\t}\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = i; j < n; j++) {\n\t\t\t\ttodo.emplace_back(a[i] + a[j]);\n\t\t\t}\n\t\t}\n\t\t\n\t\tint ans = 0;\n\t\tfor (int x : todo) if (x <= m) ans = max(ans, x);\n\t\t\n\t\tsort(todo.begin(), todo.end());\n\t\t\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = i; j < n; j++) {\n\t\t\t\tif (m < a[i] + a[j]) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tauto it = upper_bound(todo.begin(), todo.end(), m - a[i] - a[j]);\n\t\t\t\tif (it != todo.begin()) {\n\t\t\t\t\tans = max(ans, int(*(prev(it))) + a[i] + a[j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t\n\t\tcout << ans << \"\\n\";\n\t}\n\t\n\treturn 0;\n}", "accuracy": 1, "time_ms": 300, "memory_kb": 6928, "score_of_the_acc": -0.2176, "final_rank": 6 }, { "submission_id": "aoj_0529_7621522", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n int N, M;\n while (cin >> N >> M)\n {\n if(N==0&&M==0)\n break;\n vector<int> point(N + 1, 0);\n for (int i = 0; i < N; i++)\n {\n cin >> point.at(i + 1);\n }\n\n vector<int> dp((N+1) * (N+1));\n for (int i = 0; i < N+1; i++)\n {\n for (int j = 0; j < N+1; j++)\n {\n dp.at((N+1) * i + j) = point.at(i) + point.at(j);\n }\n }\n sort(dp.begin(), dp.end());\n\n int maxpoint = 0;\n for (int i = 0; i < N+1; i++)\n {\n for (int j = 0; j < N+1; j++)\n {\n int sum = point.at(i) + point.at(j);\n if (sum > M)\n continue;\n else\n {\n sum += *prev(upper_bound(dp.begin(), dp.end(), M - sum));\n maxpoint = max(maxpoint, sum);\n }\n }\n }\n cout << maxpoint << endl;\n }\n}", "accuracy": 1, "time_ms": 590, "memory_kb": 7344, "score_of_the_acc": -0.7871, "final_rank": 13 }, { "submission_id": "aoj_0529_7329654", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nint main(void){\n // Your code here!\n int N,M;\n while(1){\n cin >> N >> M;\n if(N==0 && M==0){\n break;\n }\n vector<int> A(N+1);\n A[0]=0;\n for(int i=1;i<N+1;i++){\n cin >> A[i];\n }\n \n vector<int> B((N+2)*(N+1)/2);\n for(int i=0;i<N+1;i++){\n for(int j=i;j<N+1;j++){\n B.push_back( A[i]+A[j] );\n }\n }\n \n sort(B.begin(),B.end());\n \n long res,resMax=0;\n for(int i=0;i<B.size();i++){\n if(B[i]>M){\n break;\n }\n auto iter=upper_bound(B.begin(),B.end(),M-B[i]);\n iter--;\n res=B[i]+*(iter);\n if(res>resMax){\n resMax=res; \n }\n }\n cout << resMax<< endl;\n }\n}", "accuracy": 1, "time_ms": 250, "memory_kb": 9008, "score_of_the_acc": -0.1807, "final_rank": 4 }, { "submission_id": "aoj_0529_7277008", "code_snippet": "#include <iostream>\n#include <stdlib.h>\nusing namespace std;\n\nint compare_int(const void *a, const void *b)\n{\n return *(int*)a - *(int*)b;\n}\n\nint lower(int a[],int s,int v){\n int l = 0;\n int r =s- 1;\n while (r-l>1)\n {\n int mid = l + (r - l) / 2;\n if (a[mid]<=v){\n l = mid ;\n }else{\n r = mid ;\n }\n }\n return l;\n}\n\n\nint main(void){\n // Your code here!\n int N,M;\n while(1){\n cin >> N >>M;\n if(N==0 && M==0){\n break;\n }\n int P[N+1];\n \n P[0]=0;\n for(int i=1;i<N+1;i++){\n cin >> P[i];\n }\n \n int P2[(N+1)*(N+1)];\n for(int i=0;i<N+1;i++){\n for(int j=0;j<N+1;j++){\n P2[i*(N+1)+j]=P[i]+P[j]; \n }\n }\n qsort(P2, (N+1)*(N+1), sizeof(int), compare_int);\n \n int sum1,sum2;\n int maxSum=0;\n int PMax=P2[(N+1)*(N+1)-1];\n //int startN=lower(P,M/4);\n for(int i=0;i<(N+1)*(N+1);i++){\n sum1=P2[i];\n if(sum1>M-PMax && sum1<=M){\n int res=lower(P2,(N+1)*(N+1),M-sum1);\n sum2=sum1+P2[res];\n if(sum2>maxSum) {\n maxSum=sum2;\n }\n }\n }\n cout <<maxSum <<endl;\n }\n}", "accuracy": 1, "time_ms": 700, "memory_kb": 11124, "score_of_the_acc": -1.1065, "final_rank": 18 }, { "submission_id": "aoj_0529_7033347", "code_snippet": "#include <algorithm>\n#include <cstdio>\nusing namespace std;\n\nconstexpr int MAX_N = 1000;\nint ps[MAX_N + 1];\nint qs[(MAX_N + 1) * (MAX_N + 1)];\n\nint main() {\n for (;;) {\n int N, M;\n scanf(\"%d %d\", &N, &M);\n if (N == 0 && M == 0)\n break;\n ps[0] = 0;\n for (int i = 0; i < N; ++i)\n scanf(\"%d\", &ps[i + 1]);\n\n int i = 0;\n for (int j = 0; j < N + 1; ++j)\n for (int k = 0; k < N + 1; ++k)\n qs[i++] = ps[j] + ps[k];\n int qs_size = (N + 1) * (N + 1);\n sort(&qs[0], &qs[qs_size]);\n\n int max_ = 0;\n for (int i = qs_size - 1; i >= 0; --i) {\n int a = qs[i];\n if (a < M / 2)\n break;\n auto it = upper_bound(&qs[0], &qs[qs_size], M - a);\n if (it == &qs[0])\n continue;\n max_ = max(max_, a + *(it - 1));\n }\n printf(\"%d\\n\", max_);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 290, "memory_kb": 6716, "score_of_the_acc": -0.1923, "final_rank": 5 } ]
aoj_0530_cpp
ぴょんぴょん川渡り 問題 ある川で,一方の岸から石の上を次々と飛び移って反対側の岸まで行くという少々危険なゲームがはやっている. 今,図 4-1 のように,石はマス目の上に存在すると考える.行の数は n である. 図 4-1 では n = 5 である. このゲームでは,一方の岸から始めて,通常のジャンプまたは m 回以下の一行飛ばしのジャンプをして反対側の岸まで渡る.通常のジャンプとは,今いる行の一つ先の行の岸または石のどれかに飛び移ることであり,一行飛ばしのジャンプとは,今いる行の二つ先の行の岸または石のどれかに飛び移ることである.始める岸の一つ先の行は 1 行目,二つ先の行は 2 行目であり,n − 1 行目の二つ先の行,及び n 行目の一つ先の行は反対側の岸であるとする. さて,このゲームをできるだけ安全に成し遂げるために,ジャンプの危険度というものを考えることにした.それぞれの石には,滑りやすさが定まっている.石から石へ飛び移る際のジャンプの危険度は,通常のジャンプであっても,一行飛ばしのジャンプであっても, (今いる石の滑りやすさ + 飛び移る先の石の滑りやすさ)×(横の移動距離) で定める.ただし,横の移動距離とは,列の番号の差である.また,岸から石へ,あるいは石から岸へ飛び移るジャンプの危険度は 0 とする. 入力として n, m,それぞれの石の位置と滑りやすさが与えられたとき,反対側の岸まで到達する際のジャンプの危険度の合計の最小値を求めるプログラムを作成せよ.与えられる入力データは必ず反対側の岸まで到達することができるようになっており,同じマス目に石は 2 個以上存在しない. 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる． 入力の 1 行目には,空白を区切りとして 2 個の整数 n,m が書かれている.これは,行の数と,一行飛ばしのジャンプの許される回数を表す.n,m はそれぞれ 2 ≤ n ≤ 150, 0 ≤ m ≤ (n+1)/2　を満たす. 続く n 行には,それぞれの行にある石の情報が書かれている.i+1 行目 (1 ≤ i ≤ n)には,1 つの整数 k i (0 ≤ k i ≤ 10) と,それに続き 2 × ki 個の整数が空白で区切られ書かれている.これらは,始める岸から数えて i 番目の行にある石の情報を表す. ki はその行に存在する石の個数を表し,それに続く 2 × ki 個の整数については,2 × j - 1 個目 (1 ≤ j ≤ k i ) の整数 x i,j はその行の j 個目の石の列の番号を,2 × j個目の整数 d i,j はその行の j 個目の石の滑りやすさをそれぞれ表す.x i,j ,d i,j はそれぞれ 1 ≤ x i,j , d i,j ≤1000 を満たす. 採点用データのうち, 配点の 20% 分については, n ≤ 6 を満たし,配点の別の 20%分については, m = 0 を満たす. n, m がともに 0 のとき入力の終了を示す. データセットの数は 10 を超えない． 出力 データセットごとに, 反対側の岸まで到達する際のジャンプの危険度の合計の最小値を表す 1 つの整数を1 行に出力する. 例 図 4-2 において,石に書かれた数字はそれぞれの石の滑りやすさを表すとする. 矢印で示された順番で石を渡るとき,それぞれのジャンプの危険度は,順番に 0, (2 + 2) × 1 = 4,(2 + 1) × 1 = 3,(1 + 4) × 2 = 10,0 であり,合計は 17 となる. このとき,ジャンプの危険度の合計は最小となる. この例は１つ目の入出力例に対応している. 入出力例 入力例 5 1 2 1 3 2 2 1 3 2 1 1 7 1 2 1 1 4 4 5 0 2 1 3 2 2 1 3 2 1 1 7 1 2 1 1 4 4 0 0 出力例 17 40 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0530_10852905", "code_snippet": "#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<queue>\n#include<tuple>\n#include<functional>\nusing namespace std;\nint n, m, a, b, c, dist[4000][100]; vector<tuple<int, int, int>>p; vector<tuple<int, int, int>>K[4000][100];\nint main() {\n\twhile (true) {\n\t\tfor (int i = 0; i < 4000; i++) { for (int j = 0; j < 100; j++) { dist[i][j] = 999999999; K[i][j].clear(); } }\n\t\tcin >> n >> m; p.clear(); if (n == 0 && m == 0)break;\n\t\tfor (int i = 1; i <= n; i++) {\n\t\t\tcin >> a; for (int j = 0; j < a; j++) { cin >> b >> c; p.push_back(make_tuple(i, b, c)); }\n\t\t}\n\t\tsort(p.begin(), p.end());\n\t\tfor (int i = 0; i < p.size(); i++) {\n\t\t\tif (get<0>(p[i]) == 1 || get<0>(p[i]) == 2) { p.push_back(make_tuple(0, get<1>(p[i]), 0)); }\n\t\t\tif (get<0>(p[i]) == n || get<0>(p[i]) == n - 1) { p.push_back(make_tuple(n + 1, get<1>(p[i]), 0)); }\n\t\t}\n\t\tsort(p.begin(), p.end());\n\t\tfor (int h = 0; h <= m; h++) {\n\t\t\tfor (int i = 0; i < p.size(); i++) {\n\t\t\t\tfor (int j = i + 1; j < p.size(); j++) {\n\t\t\t\t\tif (get<0>(p[j]) - get<0>(p[i]) == 1) {\n\t\t\t\t\t\tint rx = get<1>(p[i]), sx = get<1>(p[j]);\n\t\t\t\t\t\tint rp = get<2>(p[i]), sp = get<2>(p[j]);\n\t\t\t\t\t\tint U = abs(rx - sx)*(rp + sp);\n\t\t\t\t\t\tK[i][h].push_back(make_tuple(j, h, U));\n\t\t\t\t\t}\n\t\t\t\t\tif (get<0>(p[j]) - get<0>(p[i]) == 2) {\n\t\t\t\t\t\tint rx = get<1>(p[i]), sx = get<1>(p[j]);\n\t\t\t\t\t\tint rp = get<2>(p[i]), sp = get<2>(p[j]);\n\t\t\t\t\t\tint U = abs(rx - sx)*(rp + sp);\n\t\t\t\t\t\tK[i][h].push_back(make_tuple(j, h + 1, U));\n\t\t\t\t\t}\n\t\t\t\t\tif (get<0>(p[j]) - get<0>(p[i]) >= 3) { break; }\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tpriority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, greater<tuple<int, int, int>>>Q;\n\t\tfor (int i = 0; i < p.size(); i++) {\n\t\t\tif (get<0>(p[i]) == 0) { Q.push(make_tuple(0, i, 0)); dist[i][0] = 0; }\n\t\t}\n\t\twhile (!Q.empty()) {\n\t\t\tint a1 = get<0>(Q.top()), a2 = get<1>(Q.top()), a3 = get<2>(Q.top()); Q.pop();\n\t\t\tfor (int i = 0; i < K[a2][a3].size(); i++) {\n\t\t\t\tint to1 = get<0>(K[a2][a3][i]), to2 = get<1>(K[a2][a3][i]), cost = get<2>(K[a2][a3][i]);\n\t\t\t\tif (dist[to1][to2] > a1 + cost) {\n\t\t\t\t\tdist[to1][to2] = a1 + cost; Q.push(make_tuple(dist[to1][to2], to1, to2));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint maxn = 999999999;\n\t\tfor (int i = 0; i < p.size(); i++) {\n\t\t\tif (get<0>(p[i]) != (n + 1))continue;\n\t\t\tfor (int j = 0; j <= m; j++)maxn = min(maxn, dist[i][j]);\n\t\t}\n\t\tcout << maxn << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 150, "memory_kb": 59684, "score_of_the_acc": -1.5869, "final_rank": 18 }, { "submission_id": "aoj_0530_9710878", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i,n) for(int i=0;i<(n);i++)\n\n// #include <atcoder/all>\n// using namespace atcoder;\n// using mint=modint1000000007;\n\nusing ll=long long;\nusing ull=unsigned long long;\nusing P=pair<int,int>;\nusing Pl=pair<ll,ll>;\nusing Pd=pair<double,int>;\n\nconst ll ll_INF=1e18;\nconst int INF=1001001001;\nconst int di[]={0,1,0,-1};\nconst int dj[]={1,0,-1,0};\n\ntemplate<class T>\nvoid chmin(T &a, T b) { a=min(a,b); }\ntemplate<class T>\nvoid chmax(T &a, T b) { a=max(a,b); }\n\nstruct Edge{\n int to; ll cost;\n Edge(){}\n Edge(int to):to(to){};\n Edge(int to, ll cost):to(to),cost(cost){};\n};\n\nint main(){\n while(true){\n const int MAX_ROW_STONE_NUM=10;\n int n,m; cin >> n >> m;\n if(n==0 && m==0) break;\n\n vector<vector<P>> stones(n+2);\n REP(ni,n){\n int k; cin >> k;\n REP(ki,k){\n int x,d; cin >> x >> d;\n stones.at(ni+1).emplace_back(x,d);\n }\n }\n stones.at(0).emplace_back(0,0);\n stones.at(n+1).emplace_back(0,0);\n\n vector dp(n+2,vector(MAX_ROW_STONE_NUM+1,vector<int>(m+1,INF)));\n dp.at(0).at(0).at(0)=0;\n\n REP(ni,n+1){\n auto now_st=stones.at(ni+1);\n auto prev_st=stones.at(ni);\n REP(nj,now_st.size())REP(pj,prev_st.size()){\n auto [nx,nd]=now_st.at(nj);\n auto [px,pd]=prev_st.at(pj);\n\n int danger=(nd+pd)*abs(nx-px);\n if(ni==0 || ni==n) danger=0;\n\n REP(mi,m+1){\n chmin(dp.at(ni+1).at(nj).at(mi),dp.at(ni).at(pj).at(mi)+danger);\n }\n }\n\n if(ni==n) break;\n\n now_st=stones.at(ni+2);\n REP(nj,now_st.size())REP(pj,prev_st.size()){\n auto [nx,nd]=now_st.at(nj);\n auto [px,pd]=prev_st.at(pj);\n\n int danger=(nd+pd)*abs(nx-px);\n if(ni==0 || ni==n-1) danger=0;\n\n REP(mi,m){\n chmin(dp.at(ni+2).at(nj).at(mi+1),dp.at(ni).at(pj).at(mi)+danger);\n }\n }\n }\n\n int min_danger=INF;\n REP(mi,m+1) chmin(min_danger,dp.at(n+1).at(0).at(mi));\n cout << min_danger << endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3824, "score_of_the_acc": -0.0043, "final_rank": 2 }, { "submission_id": "aoj_0530_7777471", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vl = vector<ll>;\nusing vvl = vector<vl>;\nusing pl = pair<ll,ll>;\nusing vp = vector<pl>;\n#define rep(i,n) for(ll i=0;i<(ll)(n);++i)\n#define reps(i,s,n) for(ll i=(s);i<(ll)(n);++i)\n#define rep1(i,n) for(ll i=1;i<=(ll)(n);++i)\ntemplate<typename T>inline bool chmax(T &a,T b){return a<b?a=b,true:false;}\ntemplate<typename T>inline bool chmin(T &a,T b){return a>b?a=b,true:false;}\n#define fi first\n#define se second\n#define pb push_back\n#define eb emplace_back\n#define be(v) (v).begin(),(v).end()\nconst long long INF = 1e18;\ninline ll ipow(ll x,ll p){\n\tll ret=x; rep1(i,p-1) ret*=x; return ret;\n}\n#ifdef DEBUG\n#include <debug.hpp>\n#endif\n\nbool solve(){\n#ifdef DEBUG\n\tcout << \"--- Input ---\" << endl;\n#endif\n\tll N,M;cin>>N>>M;\n\tif(N==0 && M==0)return false;\n\tvvl X(N+2),D(N+2);\n\trep1(n,N){\n\t\tll K;cin>>K;\n\t\trep(k,K){\n\t\t\tll x,d;cin>>x>>d;X.at(n).pb(x);D.at(n).pb(d);\n\t\t}\n\t}\n\n#ifdef DEBUG\n\tcout<<N<<\" \"<<M<<endl<<X<<D<<endl;\n\tcout << \"--- Logic ---\" << endl;\n#endif\n\tll MX=10;\n\tvector<vector<map<ll,ll>>> dp(N+2,vector<map<ll,ll>>(MX));\n\t\t//j.rep(i,D.at(j).size()){\n\t\t\t//dp.at(j).at(i)[0] = 0;\n\t\t////}\n\tdp.at(0).at(0)[0]=0;\n\tX.at(0).pb(0); D.at(0).pb(0);\n\tX.at(N+1).pb(0); D.at(N+1).pb(0);\n\trep(n,N+1){\n\t\trep(i,X.at(n).size()){\n\t\t\tfor(ll m=1;m<=2 && n+m<=N+1;++m){ //reps(m,min(M)\n\t\t\t\trep(j,X.at(n+m).size()){\n\t\t\t\t\tfor(auto now:dp.at(n).at(i)){\n#ifdef DEBUG\n\t\t\t\t\t\tcout<<\"n=\"<<n<<\" i=\"<<i<<\" m=\"<<m<<\" j=\"<<j<<\"now=\"<<now.fi<<\",\"<<now.se\n\t\t\t\t\t\t\t<<\" D=\"<<D.at(n).at(i)<<\",\"<<D.at(n+m).at(j)\n\t\t\t\t\t\t\t<<\" X=\"<<X.at(n).at(i)<<\",\"<<X.at(n+m).at(j)<<endl;\n#endif\n\t\t\t\t\t\tif(m==2 && now.fi>=M)continue;\n\t\t\t\t\t\tif(n==0){\n\t\t\t\t\t\t\tdp.at(n+m).at(j)[now.fi+m-1]=0;\n\t\t\t\t\t\t}else if(n+m==N+1){\n\t\t\t\t\t\t\tif(dp.at(n+m).at(j).count(now.fi+m-1)){\n\t\t\t\t\t\t\t\tchmin(dp.at(n+m).at(j)[now.fi+m-1],now.se);\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\tdp.at(n+m).at(j)[now.fi+m-1] = now.se;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\tif(dp.at(n+m).at(j).count(now.fi+m-1)){\n\t\t\t\t\t\t\t\tchmin(dp.at(n+m).at(j)[now.fi+m-1],now.se+(D.at(n).at(i)+D.at(n+m).at(j))*abs(X.at(n).at(i)-X.at(n+m).at(j)));\n\t\t\t\t\t\t\t}else{\n\t\t\t\t\t\t\t\tdp.at(n+m).at(j)[now.fi+m-1] = now.se+(D.at(n).at(i)+D.at(n+m).at(j))*abs(X.at(n).at(i)-X.at(n+m).at(j));\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n#ifdef DEBUG\n\t\t\t\t\t\tcout<<dp.at(n+m).at(j)[now.fi+m-1]<<endl;\n#endif\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tll ans=INF;\n\trep(i,MX){\n\t\tfor(auto e:dp.at(N+1).at(i)){\n\t\t\tchmin(ans,e.se);\n\t\t}\n\t}\n#ifdef DEBUG\n\tcout<<dp;\n\tcout << \"--- Answer ---\" << endl;\n#endif\n\tcout<<ans<<endl;\n\treturn true;\n}\nint main(){\n\twhile(solve());\n\treturn 0;\n}\n//cout << fixed << setprecision(9);", "accuracy": 1, "time_ms": 60, "memory_kb": 6612, "score_of_the_acc": -0.3905, "final_rank": 12 }, { "submission_id": "aoj_0530_6893738", "code_snippet": "#include <bits/stdc++.h>\n#include <random>\nusing namespace std;\n//#include <atcoder/all>\n//using namespace atcoder;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vvvvll = vector<vvvll>;\nusing vvvvvll = vector<vvvvll>;\nusing vvvvvvll = vector<vvvvvll>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\nusing vvvvb = vector<vvvb>;\nusing vd = vector<double>;\nusing vvd = vector<vd>;\nusing vvvd = vector<vvd>;\nusing vvvvd = vector<vvvd>;\nusing vvvvvd = vector<vvvvd>;\n#define all(A) A.begin(),A.end()\n#define ALL(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\nusing pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;\n\ntemplate<class T>\nbool chmax(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\ntemplate<class T>\nbool chmin(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p > q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\nll gcd(ll(a), ll(b)) {\n if (b == 0)return a;\n ll c = a;\n while (a % b != 0) {\n c = a % b;\n a = b;\n b = c;\n }\n return b;\n}\n\n\nstruct dsu {\n public:\n dsu() : _n(0) {}\n dsu(int n) : _n(n), par_size(n, -1) {}\n\n int merge(int a, int b) {\n int x = leader(a), y = leader(b);\n if (x == y) return x;\n if (-par_size[x] < -par_size[y]) swap(x, y);\n par_size[x] += par_size[y];\n par_size[y] = x;\n return x;\n }\n int merge(pair<ll,ll> p) {\n int a=p.first;\n int b=p.second;\n int x = leader(a), y = leader(b);\n if (x == y) return x;\n if (-par_size[x] < -par_size[y]) swap(x, y);\n par_size[x] += par_size[y];\n par_size[y] = x;\n return x;\n }\n\n bool same(int a, int b) {\n return leader(a) == leader(b);\n }\n bool same(pair<ll,ll> p) {\n int a=p.first;\n int b=p.second;\n return leader(a) == leader(b);\n }\n\n int leader(int a) {\n if (par_size[a] < 0) return a;\n return par_size[a] = leader(par_size[a]);\n }\n\n int size(int a) {\n return -par_size[leader(a)];\n }\n\n vector<vector<int>> groups() {\n std::vector<int> leader_buf(_n), gr_size(_n);\n for (int i = 0; i < _n; i++) {\n leader_buf[i] = leader(i);\n gr_size[leader_buf[i]]++;\n }\n std::vector<vector<int>> res(_n);\n for (int i = 0; i < _n; i++) {\n res[i].reserve(gr_size[i]);\n }\n for (int i = 0; i < _n; i++) {\n res[leader_buf[i]].push_back(i);\n }\n res.erase(\n remove_if(res.begin(), res.end(),\n [&](const vector<int>& v) { return v.empty(); }),\n res.end());\n return res;\n }\n private:\n int _n;\n vector<int> par_size;\n};\n\ntemplate <class T> std::vector<int> z_algorithm(const std::vector<T>& s) {\n int n = int(s.size());\n if (n == 0) return {};\n std::vector<int> z(n);\n z[0] = 0;\n for (int i = 1, j = 0; i < n; i++) {\n int& k = z[i];\n k = (j + z[j] <= i) ? 0 : std::min(j + z[j] - i, z[i - j]);\n while (i + k < n && s[k] == s[i + k]) k++;\n if (j + z[j] < i + z[i]) j = i;\n }\n z[0] = n;\n return z;\n}\n\nvector<int> z_algorithm(const std::string& s) {\n int n = int(s.size());\n std::vector<int> s2(n);\n for (int i = 0; i < n; i++) {\n s2[i] = s[i];\n }\n return z_algorithm(s2);\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n while(1){\n ll N,M;\n cin>>N>>M;\n if(N+M==0)return 0;\n vector<vector<pair<ll,ll>>> R(N+2);\n rep(i,1001)R[0].push_back({i,0});\n rep(i,1001)R[N+1].push_back({i,0});\n rep(i,N){\n ll K;\n cin>>K;\n R[i+1].resize(K);\n rep(k,K){\n ll X,D;\n cin>>X>>D;\n R[i+1][k]={X,D};\n }\n sort(all(R[i+1]));\n }\n vvvll DP(N+2,vvll(M+1));\n rep(m,M+1)rep(i,N+1){\n DP[i+1][m].assign(R[i+1].size(),1e18);\n }\n rep(m,M+1)rep(i,R[0].size())DP[0][m].push_back(0);\n rep(i,N+1){\n rep(m,M+1){\n rep(t,R[i+1].size()){\n rep(r,R[i].size()){\n chmin(DP[i+1][m][t],DP[i][m][r]+(R[i+1][t].second+R[i][r].second)*abs(R[i+1][t].first-R[i][r].first));\n }\n if(i!=0&&m!=M){\n rep(r,R[i-1].size()){\n chmin(DP[i+1][m+1][t],DP[i-1][m][r]+(R[i+1][t].second+R[i-1][r].second)*abs(R[i+1][t].first-R[i-1][r].first));\n }\n }\n }\n }\n }\n ll an=1e18;\n rep(m,M+1)rep(r,R[N+1].size()){\n chmin(an,DP[N+1][m][r]);\n }\n rep(m,M)rep(r,R[N].size()){\n chmin(an,DP[N][m][r]);\n }\n cout<<an<<endl;\n }\n \n\n \n}", "accuracy": 1, "time_ms": 20, "memory_kb": 5616, "score_of_the_acc": -0.0944, "final_rank": 10 }, { "submission_id": "aoj_0530_6739118", "code_snippet": "#include \"bits/stdc++.h\"\n\n#define REP(i,num) for(ll i=0;i<(num);++i)\n#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))\n#define LOOP(i) while(i--)\n#define ALL(c) c.begin(),c.end()\n#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;\n#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\n\nconstexpr ll atcoder_mod = 1e9+7;\n\ntemplate<typename T=ll>\nT in(){ T x; cin >> x; return (x); }\ntemplate<typename T=ll,typename C=vector<T>>\nC vecin(int N){ C x(N);REP(i,N){ x[i]=in<T>(); }return x; }\ntemplate<typename T=ll,size_t N>\narray<T,N> arrin(){array<T,N> x;REP(i,N){ x[i]=in<T>(); }return x;}\n\nvoid vout(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid vout(Head&& h,Tail&&... t){ cout << ' ' << h;vout(forward<Tail>(t)...); }\nvoid out(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid out(Head&& h,Tail&&... t){ cout << h;vout(forward<Tail>(t)...); }\n\ntemplate<typename T>\nbool chmax(T& a,T b){ if(a<b){ a=b;return true; }return false; }\ntemplate<typename T>\nbool chmin(T& a,T b){ if(a>b){ a=b;return true; }return false; }\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(10);\n\n\twhile(true){\n\t\tll N=in(),M=in();\n\t\tif(!N && !M) break;\n\n\t\tvector<vvll> dp(N+1,vvll(1001,vll(M+1,1ll<<60)));\n\t\tvector<vector<pair<ll,ll>>> A(N);\n\t\tREP(i,N){\n\t\t\tll K=in();\n\t\t\tREP(j,K){\n\t\t\t\tll u=in()-1,v=in();\n\t\t\t\tA[i].emplace_back(u,v);\n\t\t\t}\n\t\t}\n\t\tfor(auto& x:A[0]){\n\t\t\tdp[0][x.first][0]=0;\n\t\t}\n\t\tif(M>0){\n\t\t\tfor(auto& x:A[1]){\n\t\t\t\tdp[1][x.first][1]=0;\n\t\t\t}\n\t\t}\n\n\t\tfor(int n=0;n<N;n++){\n\t\t\tfor(int i=0;i<A[n].size();i++){\n\t\t\t\tauto now = A[n][i];\n\t\t\t\tfor(int m=0;m<=M;m++){\n\t\t\t\t\t// 飛ばさない\n\t\t\t\t\tif(n<N-1){\n\t\t\t\t\t\tfor(int j=0;j<A[n+1].size();j++){\n\t\t\t\t\t\t\tauto next = A[n+1][j];\n\t\t\t\t\t\t\tchmin(dp[n+1][next.first][m],dp[n][now.first][m]+(now.second+next.second)*(abs(now.first-next.first)));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\telse{\n\t\t\t\t\t\tfor(int j=0;j<1001;j++){\n\t\t\t\t\t\t\tchmin(dp[n+1][j][m],dp[n][j][m]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t// 飛ばす\n\t\t\t\t\tif(m<M){\n\t\t\t\t\t\tif(n<N-2){\n\t\t\t\t\t\t\tfor(int j=0;j<A[n+2].size();j++){\n\t\t\t\t\t\t\t\tauto next = A[n+2][j];\n\t\t\t\t\t\t\t\tchmin(dp[n+2][next.first][m+1],dp[n][now.first][m]+(now.second+next.second)*(abs(now.first-next.first)));\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse if(n<N-1){\n\t\t\t\t\t\t\tfor(int j=0;j<1001;j++){\n\t\t\t\t\t\t\t\tchmin(dp[n+2][j][m+1],dp[n][j][m]);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tll C=1ll<<60;\n\t\tfor(auto& x:dp[N]){\n\t\t\tfor(auto& y:x){\n\t\t\t\tchmin(C,y);\n\t\t\t}\n\t\t}\n\t\tout(C);\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 140, "memory_kb": 99292, "score_of_the_acc": -1.9286, "final_rank": 20 }, { "submission_id": "aoj_0530_5905219", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n\n //dp[i][j][k] i行目のj個目の石に1行飛ばしk回以下で行くための危険度の最小値\n //dp[i][j][k] = min_l dp[i-1][l][k]+(d[i-1][l]+d[i][j])*(j-l) lをi-1行目の石全体動かす\n // dp[i-2][l][k-1]+(d[i-2][l]+d[i][j])*(j-l) lをi-2行目の石全体動かす\n\n while(1){\n\n int n,m;\n int64_t INF = 922337203685477580;\n cin >> n >> m;\n if ((n ==0) && (m == 0)) break;\n vector <vector <pair<int,int>>> grid(n);\n\n for(int i=0;i< n ;i++){\n int maxj;\n cin>> maxj;\n for(int j=0;j< maxj ;j++){\n int x,d;\n cin >> x >> d;\n grid[i].push_back(make_pair(x,d));\n }\n }\n\n vector <vector <vector <int64_t>>> dp(n,vector <vector <int64_t>>(10,vector <int64_t>(m+1,INF)));\n\n for(int j=0;j< grid[0].size() ;j++)for(int k=0;k< m+1 ;k++) dp[0][j][k] = 0;\n for(int j=0;j< grid[1].size() ;j++)for(int k=1;k< m+1 ;k++) dp[1][j][k] = 0;\n \n\n for(int i=1;i< n ;i++){\n int maxj = grid[i].size();\n for(int j=0;j< maxj ;j++){\n for(int k=0;k< m+1 ;k++){\n for(int jj=0;jj< grid[i-1].size() ;jj++) dp[i][j][k] = min(dp[i][j][k],dp[i-1][jj][k]+(abs(grid[i][j].first-grid[i-1][jj].first))*(grid[i][j].second+grid[i-1][jj].second));\n if ((i >= 2) && (k > 0)){for(int jj=0;jj<grid[i-2].size() ;jj++) dp[i][j][k] = min(dp[i][j][k],dp[i-2][jj][k-1]+(abs(grid[i][j].first-grid[i-2][jj].first))*(grid[i][j].second+grid[i-2][jj].second));}\n }\n }\n\n }\n\n int64_t ans = INF;\n for(int j=0;j< grid[n-1].size() ;j++) ans = min(ans,dp[n-1][j][m]);\n if(m >= 1) for(int j=0;j< grid[n-2].size() ;j++) ans = min(ans,dp[n-2][j][m-1]);\n\n cout << ans << endl;\n\n }\n\n return 0;\n \n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4048, "score_of_the_acc": -0.0066, "final_rank": 5 }, { "submission_id": "aoj_0530_4861302", "code_snippet": "#include<bits/stdc++.h>\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#define rep(i, x) for(ll i = 0; i < x; i++)\n#define rep2(i, x) for(ll i = 1; i <= x; i++)\n#define all(a) (a).begin(),(a).end()\nusing ll = long long;\nusing ld = long double;\nusing namespace std;\nconst ll INF = 1000000000000000000;\nconst ll mod = 1000000007;\nconst ll MOD = 998244353;\nconst ld pi = 3.141592653589793238;\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tstd::cin.tie(nullptr);\n\n\twhile (true) {\n\t\tll n, m; cin >> n >> m; m++;\n\t\tif (n == 0) { return 0; }\n\t\tvector<vector<vector<ll>>> dp(n + 1);\n\t\ttypedef pair<ll, ll> p; vector<vector<p>> v(n + 1);\n\t\trep2(i, n) {\n\t\t\tll k; cin >> k;\n\t\t\trep(j, k) {\n\t\t\t\tll a, b; cin >> a >> b;\n\t\t\t\tv[i].push_back(p(a, b));\n\t\t\t}\n\t\t\tdp[i] = vector<vector<ll>>(k, vector<ll>(m + 1));\n\t\t}\n\t\trep2(i, n) {\n\t\t\trep(j, v[i].size()) {\n\t\t\t\trep(k, m) {\n\t\t\t\t\tdp[i][j][k] = 1000000000000000;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\trep(i, v[1].size()) { dp[1][i][0] = 0; }\n\t\trep(i, v[2].size()) { dp[2][i][1] = 0; }\n\t\tfor (int i = 2; i <= n; i++) {//今見てる行 O(n)\n\t\t\trep(j, v[i].size()) {//今の行の石 O(10)\n\t\t\t\trep(k, v[i - 1].size()) {//一つ前の行の石 O(10)\n\t\t\t\t\trep(l, m) {//飛びジャンプ\n\t\t\t\t\t\tll cnt = (v[i - 1][k].second + v[i][j].second) * abs(v[i - 1][k].first - v[i][j].first);\n\t\t\t\t\t\tdp[i][j][l] = min(dp[i][j][l], dp[i - 1][k][l] + cnt);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\trep(k, v[i - 2].size()) {//二つ前の行の石 O(10)\n\t\t\t\t\trep(l, m - 1) {//飛びジャンプ\n\t\t\t\t\t\tll cnt = (v[i - 2][k].second + v[i][j].second) * abs(v[i - 2][k].first - v[i][j].first);\n\t\t\t\t\t\tdp[i][j][l + 1] = min(dp[i][j][l + 1], dp[i - 2][k][l] + cnt);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tll ans = INF;\n\t\trep(i, v[n - 1].size()) {\n\t\t\trep(j, m - 1) {\n\t\t\t\tans = min(ans, dp[n - 1][i][j]);\n\t\t\t}\n\t\t}\n\t\trep(i, v[n].size()) {\n\t\t\trep(j, m) {\n\t\t\t\tans = min(ans, dp[n][i][j]);\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3948, "score_of_the_acc": -0.0056, "final_rank": 4 }, { "submission_id": "aoj_0530_4819268", "code_snippet": "#include <cmath>\n#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nconst int inf = 1012345678;\nint main() {\n\tcin.tie(0);\n\tios_base::sync_with_stdio(false);\n\twhile (true) {\n\t\tint N, M;\n\t\tcin >> N >> M;\n\t\tif (N == 0 && M == 0) break;\n\t\tvector<int> pos(N + 3), X = { 0 }, D = { 0 };\n\t\tpos[1] = 1;\n\t\tfor (int i = 1; i <= N; ++i) {\n\t\t\tint K;\n\t\t\tcin >> K;\n\t\t\tpos[i + 1] = pos[i] + K;\n\t\t\tfor (int j = 0; j < K; ++j) {\n\t\t\t\tint tx, td;\n\t\t\t\tcin >> tx >> td;\n\t\t\t\tX.push_back(tx);\n\t\t\t\tD.push_back(td);\n\t\t\t}\n\t\t}\n\t\tpos[N + 2] = pos[N + 1] + 1;\n\t\tX.push_back(0);\n\t\tD.push_back(0);\n\t\tvector<vector<int> > dp(pos[N + 2], vector<int>(M + 1, inf));\n\t\tfill(dp[0].begin(), dp[0].end(), 0);\n\t\tfor (int i = 1; i <= N + 1; ++i) {\n\t\t\tfor (int j = 1; j <= i && j <= 2; ++j) {\n\t\t\t\tfor (int k = pos[i]; k < pos[i + 1]; ++k) {\n\t\t\t\t\tfor (int x = (j == 2 ? 1 : 0); x <= M; ++x) {\n\t\t\t\t\t\tfor (int l = pos[i - j]; l < pos[i - j + 1]; ++l) {\n\t\t\t\t\t\t\tdp[k][x] = min(dp[k][x], dp[l][x - (j == 2 ? 1 : 0)] + (i - j == 0 || i == N + 1 ? 0 : abs(X[k] - X[l]) * (D[k] + D[l])));\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << dp.back()[M] << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3412, "score_of_the_acc": 0, "final_rank": 1 }, { "submission_id": "aoj_0530_4740984", "code_snippet": "#define _GLIBCXX_DEBUG\n#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i = 0;i < (int)(n);i++)\nusing ll = long long;\nconst ll MOD=1000000007;\nconst long long INF = 1LL << 60;\nconst double pi=acos(-1.0);\n\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\n\nvector<vector<map<ll,ll>>> table;\nvector<vector<pair<ll,ll>>> grid;\n\nll dp(ll n,ll x,ll d,ll m){\n if(m<0) return INF;\n if(n==0) return 0;\n if(n==1&&m>=1) return 0;\n if(table.at(m).at(n).count(x)) return table.at(m).at(n).at(x);\n \n table.at(m).at(n)[x]=INF;\n //n-1からの移動\n for(auto p:grid.at(n-1)){\n ll px,pd; tie(px,pd)=p;\n chmin(table.at(m).at(n).at(x),dp(n-1,px,pd,m)+(d+pd)*abs(x-px));\n }\n \n if(n<2||m<1) return table.at(m).at(n).at(x);\n //n-2からの移動\n for(auto p:grid.at(n-2)){\n ll px,pd; tie(px,pd)=p;\n chmin(table.at(m).at(n).at(x),dp(n-2,px,pd,m-1)+(d+pd)*abs(x-px));\n }\n \n return table.at(m).at(n).at(x);\n}\n\n\nint main()\n{\n while(true){\n ll N,M; cin>>N>>M; if(N==0&&M==0) break;\n grid=vector<vector<pair<ll,ll>>>(N,vector<pair<ll,ll>>(0));\n rep(i,N){\n ll k; cin>>k;\n rep(j,k){\n ll x,d; cin>>x>>d; x--;\n grid.at(i).push_back({x,d});\n }\n }\n \n //dp\n table=vector<vector<map<ll,ll>>>(M+1,vector<map<ll,ll>>(N));\n ll ans=INF;\n for(auto p:grid.at(N-1)){\n ll x,d;tie(x,d)=p;\n chmin(ans,dp(N-1,x,d,M));\n }\n \n if(M<1) {cout<<ans<<endl; continue;}\n \n for(auto p:grid.at(N-2)){\n ll x,d; tie(x,d)=p;\n chmin(ans,dp(N-2,x,d,M-1));\n }\n \n cout<<ans<<endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 7316, "score_of_the_acc": -0.8979, "final_rank": 13 }, { "submission_id": "aoj_0530_4686468", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint N, M;\nint MapData[152][1002];\nvector<pair<int, int> > StoneInfo[152];\nint DpSum[152][1002][78];\n\nconst int INF = 999999999;\n\nvoid solve() {\n\tint curRowStone, curCol, cost, minSum;\n\n\tcurRowStone = StoneInfo[1].size();\n\tfor (int i = 0; i < curRowStone; ++i) {\n\t\tcurCol = StoneInfo[1][i].first;\n\t\tDpSum[1][curCol][0] = 0;\n\t}\n\n\tcurRowStone = StoneInfo[2].size();\n\tfor (int i = 0; i < curRowStone; ++i) {\n\t\tcurCol = StoneInfo[2][i].first;\n\t\tDpSum[2][curCol][1] = 0;\n\t}\n\n\tfor (int i = 1; i < N; ++i) {\n\t\tfor (int j = 1; j < 1002; ++j) {\n\t\t\tfor (int k = 0; k <= M; ++k) {\n\t\t\t\tif (DpSum[i][j][k] == INF) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tcurRowStone = StoneInfo[i + 1].size();\n\t\t\t\tfor (int t = 0; t < curRowStone; ++t) {\n\t\t\t\t\tcurCol = StoneInfo[i + 1][t].first;\n\t\t\t\t\tcost = (MapData[i][j] + StoneInfo[i + 1][t].second) * abs(j - curCol);\n\t\t\t\t\tDpSum[i + 1][curCol][k] = min(DpSum[i + 1][curCol][k], DpSum[i][j][k] + cost);\n\t\t\t\t}\n\n\t\t\t\tif (k == M || i == N - 1) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tcurRowStone = StoneInfo[i + 2].size();\n\t\t\t\tfor (int t = 0; t < curRowStone; ++t) {\n\t\t\t\t\tcurCol = StoneInfo[i + 2][t].first;\n\t\t\t\t\tcost = (MapData[i][j] + StoneInfo[i + 2][t].second) * abs(j - curCol);\n\t\t\t\t\tDpSum[i + 2][curCol][k + 1] = min(DpSum[i + 2][curCol][k + 1], DpSum[i][j][k] + cost);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tminSum = INF;\n\tfor (int i = 0; i < 1002; ++i) {\n\t\tfor (int k = 0; k <= M; ++k) {\n\t\t\tminSum = min(minSum, DpSum[N][i][k]);\n\t\t}\n\t}\n\tfor (int i = 0; i < 1002; ++i) {\n\t\tfor (int k = 0; k < M; ++k) {\n\t\t\tminSum = min(minSum, DpSum[N - 1][i][k]);\n\t\t}\n\t}\n\tcout << minSum << endl;\n}\n\nint main() {\n\tint k, col, value;\n\n\twhile (cin >> N >> M, N) {\n\t\tfor (int i = 0; i < 152; ++i) {\n\t\t\tStoneInfo[i].clear();\n\t\t\tfor (int j = 0; j < 1002; ++j) {\n\t\t\t\tMapData[i][j] = INF;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 1; i <= N; ++i) {\n\t\t\tcin >> k;\n\t\t\tfor (int j = 0; j < k; ++j) {\n\t\t\t\tcin >> col >> value;\n\t\t\t\tMapData[i][col] = value;\n\t\t\t\tStoneInfo[i].push_back({ col,value });\n\t\t\t}\n\t\t}\n\t\t//fill_n(&DpSum[0][0][0], N * 1002 * M, INF);\n\t\tfor (int i = 0; i < 152; ++i) {\n\t\t\tfor (int j = 0; j < 1002; ++j) {\n\t\t\t\tfor (int k = 0; k < 78; ++k) {\n\t\t\t\t\tDpSum[i][j][k] = INF;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tsolve();\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 140, "memory_kb": 50132, "score_of_the_acc": -1.4158, "final_rank": 17 }, { "submission_id": "aoj_0530_4686465", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint N, M;\nint MapData[152][1002];\nvector<pair<int, int> > StoneInfo[152];\nint DpSum[152][1002][78];\n\nconst int INF = 999999999;\n\nvoid solve() {\n\tint curRowStone, curCol, cost, minSum;\n\n\tcurRowStone = StoneInfo[0].size();\n\tfor (int i = 0; i < curRowStone; ++i) {\n\t\tcurCol = StoneInfo[0][i].first;\n\t\tDpSum[0][curCol][0] = 0;\n\t}\n\n\tcurRowStone = StoneInfo[1].size();\n\tfor (int i = 0; i < curRowStone; ++i) {\n\t\tcurCol = StoneInfo[1][i].first;\n\t\tDpSum[1][curCol][1] = 0;\n\t}\n\n\tfor (int i = 0; i < N - 1; ++i) {\n\t\tfor (int j = 0; j < 1002; ++j) {\n\t\t\tfor (int k = 0; k <= M; ++k) {\n\t\t\t\tif (DpSum[i][j][k] == INF) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\n\t\t\t\tcurRowStone = StoneInfo[i + 1].size();\n\t\t\t\tfor (int t = 0; t < curRowStone; ++t) {\n\t\t\t\t\tcurCol = StoneInfo[i + 1][t].first;\n\t\t\t\t\tcost = (MapData[i][j] + StoneInfo[i + 1][t].second) * abs(j - curCol);\n\t\t\t\t\tDpSum[i + 1][curCol][k] = min(DpSum[i + 1][curCol][k], DpSum[i][j][k] + cost);\n\t\t\t\t}\n\n\t\t\t\tif (k == M || i == N - 1) {\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tcurRowStone = StoneInfo[i + 2].size();\n\t\t\t\tfor (int t = 0; t < curRowStone; ++t) {\n\t\t\t\t\tcurCol = StoneInfo[i + 2][t].first;\n\t\t\t\t\tcost = (MapData[i][j] + StoneInfo[i + 2][t].second) * abs(j - curCol);\n\t\t\t\t\tDpSum[i + 2][curCol][k + 1] = min(DpSum[i + 2][curCol][k + 1], DpSum[i][j][k] + cost);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tminSum = INF;\n\tfor (int i = 0; i < 1002; ++i) {\n\t\tfor (int k = 0; k <= M; ++k) {\n\t\t\tminSum = min(minSum, DpSum[N - 1][i][k]);\n\t\t}\n\t}\n\tfor (int i = 0; i < 1002; ++i) {\n\t\tfor (int k = 0; k < M; ++k) {\n\t\t\tminSum = min(minSum, DpSum[N - 2][i][k]);\n\t\t}\n\t}\n\tcout << minSum << endl;\n}\n\nint main() {\n\tint k, col, value;\n\n\twhile (cin >> N >> M, N) {\n\t\tfor (int i = 0; i < 152; ++i) {\n\t\t\tStoneInfo[i].clear();\n\t\t\tfor (int j = 0; j < 1002; ++j) {\n\t\t\t\tMapData[i][j] = INF;\n\t\t\t}\n\t\t}\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tcin >> k;\n\t\t\tfor (int j = 0; j < k; ++j) {\n\t\t\t\tcin >> col >> value;\n\t\t\t\t--col;\n\t\t\t\tMapData[i][col] = value;\n\t\t\t\tStoneInfo[i].push_back({ col,value });\n\t\t\t}\n\t\t}\n\t\t//fill_n(&DpSum[0][0][0], N * 1002 * M, INF);\n\t\tfor (int i = 0; i < 152; ++i) {\n\t\t\tfor (int j = 0; j < 1002; ++j) {\n\t\t\t\tfor (int k = 0; k < 78; ++k) {\n\t\t\t\t\tDpSum[i][j][k] = INF;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tsolve();\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 140, "memory_kb": 50124, "score_of_the_acc": -1.4158, "final_rank": 16 }, { "submission_id": "aoj_0530_4379988", "code_snippet": "#include<bits/stdc++.h>\n#define enld '\\n'\n#define rep(i,n) for(int i=0; i<(n); i++)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"Ofast\")\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\nconstexpr ll mod = 1000000007;\nconstexpr ll mod2 = 998244353;\nconst double PI = 3.1415926535897932384626433832795028841971;\nconst int dx[6] = {1, 0, -1, 0,1,1};\nconst int dy[6] = {0, 1, 0, -1,1,-1};\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n// ---------------------------------------------------------------------------\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N,M;\n cin >> N >> M;\n while(N != 0){\n vector<vector<pair<ll,ll>>> G(N);\n for(int i=0; i<N; i++){\n int k;\n cin >> k;\n for(int j=0; j<k; j++){\n int a,b;\n cin >> a >> b;\n G[i].emplace_back(a,b);\n }\n }\n ll dp[N+1][15][N];\n for(int i=0; i<N; i++){\n for(int j=0; j<G[i].size(); j++){\n for(int k=0; k<=M; k++){\n dp[i][j][k] = INF; \n }\n }\n }\n for(int i=0; i<G[0].size(); i++){\n dp[0][i][0] = 0;\n }\n for(int i=0; i<G[1].size(); i++){\n dp[1][i][1] = 0;\n }\n for(int i=0; i<N-1; i++){\n for(int j=0; j<G[i].size(); j++){\n for(int k=0; k<=M; k++){\n for(int l=0; l<G[i+1].size(); l++){\n ll cost = G[i][j].second + G[i+1][l].second;\n ll sa = abs(G[i][j].first - G[i+1][l].first);\n chmin(dp[i+1][l][k],dp[i][j][k]+cost*sa);\n }\n if(i+2<N and k<M){\n for(int l=0; l<G[i+2].size(); l++){\n ll cost = G[i][j].second + G[i+2][l].second;\n ll sa = abs(G[i][j].first - G[i+2][l].first);\n chmin(dp[i+2][l][k+1],dp[i][j][k]+cost*sa);\n }\n }\n }\n }\n }\n // for(int i=0; i<N; i++){\n // for(int j=0; j<G[i].size(); j++){\n // for(int k=0; k<=M; k++){\n // cout << \"check:\" << i << \" \" << j << \" \" << k << \" \" << dp[i][j][k] << enld;\n // }\n // }\n // }\n ll ans = INF;\n for(int i=0; i<G[N-2].size(); i++){\n for(int j=0; j<M; j++){\n chmin(ans,dp[N-2][i][j]);\n }\n }\n for(int i=0; i<G[N-1].size(); i++){\n for(int j=0; j<=M; j++){\n chmin(ans,dp[N-1][i][j]);\n }\n }\n cout << ans << enld;\n cin >> N >> M;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 5600, "score_of_the_acc": -0.0942, "final_rank": 9 }, { "submission_id": "aoj_0530_4379969", "code_snippet": "#include<bits/stdc++.h>\n#define enld '\\n'\n#define rep(i,n) for(int i=0; i<(n); i++)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"Ofast\")\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\nconstexpr ll mod = 1000000007;\nconstexpr ll mod2 = 998244353;\nconst double PI = 3.1415926535897932384626433832795028841971;\nconst int dx[6] = {1, 0, -1, 0,1,1};\nconst int dy[6] = {0, 1, 0, -1,1,-1};\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n// ---------------------------------------------------------------------------\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n ll N,M;\n cin >> N >> M;\n while(N != 0){\n vector<vector<pair<ll,ll>>> G(N);\n for(int i=0; i<N; i++){\n int k;\n cin >> k;\n for(int j=0; j<k; j++){\n ll a,b;\n cin >> a >> b;\n G[i].emplace_back(a,b);\n }\n }\n ll dp[N+1][15][N];\n for(int i=0; i<N; i++){\n for(int j=0; j<G[i].size(); j++){\n for(int k=0; k<=M; k++){\n dp[i][j][k] = INF; \n }\n }\n }\n for(int i=0; i<G[0].size(); i++){\n dp[0][i][0] = 0;\n }\n for(int i=0; i<G[1].size(); i++){\n dp[1][i][1] = 0;\n }\n for(int i=0; i<N-1; i++){\n for(int j=0; j<G[i].size(); j++){\n for(int k=0; k<=M; k++){\n for(int l=0; l<G[i+1].size(); l++){\n ll cost = G[i][j].second + G[i+1][l].second;\n ll sa = abs(G[i][j].first - G[i+1][l].first);\n chmin(dp[i+1][l][k],dp[i][j][k]+cost*sa);\n }\n if(i+2<N and k<M){\n for(int l=0; l<G[i+2].size(); l++){\n ll cost = G[i][j].second + G[i+2][l].second;\n ll sa = abs(G[i][j].first - G[i+2][l].first);\n chmin(dp[i+2][l][k+1],dp[i][j][k]+cost*sa);\n }\n }\n }\n }\n }\n // for(int i=0; i<N; i++){\n // for(int j=0; j<G[i].size(); j++){\n // for(int k=0; k<=M; k++){\n // cout << \"check:\" << i << \" \" << j << \" \" << k << \" \" << dp[i][j][k] << enld;\n // }\n // }\n // }\n ll ans = INF;\n for(int i=0; i<G[N-2].size(); i++){\n for(int j=0; j<M; j++){\n chmin(ans,dp[N-2][i][j]);\n }\n }\n for(int i=0; i<G[N-1].size(); i++){\n for(int j=0; j<=M; j++){\n chmin(ans,dp[N-1][i][j]);\n }\n }\n cout << ans << enld;\n cin >> N >> M;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 5576, "score_of_the_acc": -0.094, "final_rank": 8 }, { "submission_id": "aoj_0530_4379022", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n\nstruct edge {\n ll cost;\n int tobasu;\n int to;\n edge(){}\n edge(ll cost,int tobasu,int to):cost(cost),tobasu(tobasu),to(to){}\n\n bool operator<(const edge& rhs) const{\n if(cost>rhs.cost)return true;\n else if(cost<rhs.cost)return false;\n else return to<rhs.to;\n }\n\n edge operator+(const edge rhs){\n return edge(cost+rhs.cost,tobasu+rhs.tobasu,rhs.to);\n }\n};\n\nvector<vector<edge>> G;\nvector<vector<pair<ll,pair<int,int>>>> ishi;\nvector<vector<ll>> dp;\n\nint main() {\n while(true) {\n int n,m;\n cin>>n>>m;\n if(n==0)break;\n\n int vt=0;\n ishi.resize(n);\n for(int i = 0;i < n;++i) {\n int k;\n cin>>k;\n for(int j = 0;j < k;++j) {\n int a;\n ll c;\n cin>>a>>c;\n ishi[i].emplace_back(c,make_pair(a,vt));\n ++vt;\n }\n }\n\n G.resize(vt+2);\n for(int i = 0;i < n;++i) {\n for(auto v:ishi[i]) {\n if(i!=n-1) {\n for(auto x:ishi[i+1]) {\n ll cost=(v.first+x.first)*abs(v.second.first-x.second.first);\n G[v.second.second].emplace_back(cost,0,x.second.second);\n }\n }\n else {\n G[v.second.second].emplace_back(0,0,vt);\n }\n\n if(i<n-2) {\n for(auto x:ishi[i+2]) {\n ll cost=(v.first+x.first)*abs(v.second.first-x.second.first);\n G[v.second.second].emplace_back(cost,1,x.second.second);\n }\n }\n else if(i==n-2){\n G[v.second.second].emplace_back(0,1,vt);\n }\n }\n }\n\n//cerr<<\"OK\"<<endl;\n\n priority_queue<edge> pq;\n for(auto v:ishi[0]) {\n pq.emplace(0LL,0,v.second.second);\n }\n\n for(auto v:ishi[1]) {\n pq.emplace(0LL,1,v.second.second);\n }\n\n dp.assign(vt+1,vector<ll>(m+1,1000000000000LL));\n\n while(!pq.empty()) {\n auto t=pq.top();\n//cerr<<\"cost:\"<<t.cost<<\" tobasu:\"<<t.tobasu<<\" to:\"<<t.to<<endl;\n if(t.to==vt)break;\n pq.pop();\n for(auto v:G[t.to]) {\n auto te=t+v;\n if(te.tobasu>m)continue;\n if(dp[te.to][te.tobasu]<te.cost)continue;\n dp[te.to][te.tobasu]=te.cost;\n pq.push(te);\n }\n }\n\n cout<<pq.top().cost<<endl;\n\n G.clear();\n ishi.clear();\n dp.clear();\n }\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 6696, "score_of_the_acc": -0.1771, "final_rank": 11 }, { "submission_id": "aoj_0530_4378992", "code_snippet": "#include <iostream>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <functional>\n#include <bitset>\n\nusing namespace std;\nusing lint = long long int;\nlong long int INF = 1001001001001001LL;\nint inf = 1000000007;\nlong long int MOD = 1000000007LL;\ndouble PI = 3.1415926535897932;\n\ntemplate<typename T1,typename T2>inline void chmin(T1 &a,const T2 &b){if(a>b) a=b;}\ntemplate<typename T1,typename T2>inline void chmax(T1 &a,const T2 &b){if(a<b) a=b;}\n\n#define ALL(a) a.begin(),a.end()\n#define RALL(a) a.rbegin(),a.rend()\n\n/* do your best */\n\n\nbool solve() {\n\n int n, m; cin >> n >> m;\n if (n == 0 and m == 0) {\n return false;\n }\n\n vector<vector<pair<int, int>>> info(n); // info[i] := 行 i {位置，cost}\n\n for (int i = 0; i < n; i++) {\n int k; cin >> k;\n for (int j = 0; j < k; j++) {\n int pos, cost; cin >> pos >> cost;\n info[i].push_back({pos, cost});\n }\n }\n \n vector<vector<vector<lint>>> dp(n, vector<vector<lint>> (1001, vector<lint> (m + 1, INF)));\n for (int j = 0; j < info[0].size(); j++) {\n int pos = info[0][j].first;\n dp[0][pos][0] = 0;\n }\n\n for (int j = 0; j < info[1].size(); j++) {\n int pos = info[1][j].first;\n dp[1][pos][1] = 0;\n }\n\n for (int i = 0; i < n - 1; i++) {\n for (int j = 0; j < info[i].size(); j++) {\n for (int k = 0; k <= m; k++) {\n // cerr << \"kudan : \" << dp[2][1][1] << endl;\n int curPos = info[i][j].first;\n lint cost1 = info[i][j].second;\n lint curCost = dp[i][curPos][k];\n\n // 普通のジャンプ\n for (int j = 0; j < info[i + 1].size(); j++) {\n int nxtPos = info[i + 1][j].first;\n lint cost2 = info[i + 1][j].second;\n lint nxtCost = (cost1 + cost2) * (lint)abs(curPos - nxtPos);\n dp[i + 1][nxtPos][k] = min(dp[i + 1][nxtPos][k], curCost + nxtCost);\n }\n\n // 2 段飛ばしジャンプ\n if (i + 2 < n and k < m) {\n for (int j = 0; j < info[i + 2].size(); j++) {\n int nxtPos = info[i + 2][j].first;\n // cerr << \"i = \" << i << \", curPos = \" << curPos << \", nxtPos = \" << nxtPos << endl;\n lint cost2 = info[i + 2][j].second;\n lint nxtCost = (cost1 + cost2) * (lint)abs(curPos - nxtPos);\n // cerr << \"curCost = \" << curCost << \", nxtCost = \" << nxtCost << endl;\n // cerr << \"before: \" << i + 2 << \" \" << nxtPos << \" \" << k + 1 << \", \" << dp[i + 2][nxtPos][k + 1] << endl;\n dp[i + 2][nxtPos][k + 1] = min(dp[i + 2][nxtPos][k + 1], curCost + nxtCost);\n // cerr << \"after: \" << i + 2 << \" \" << nxtPos << \" \" << k + 1 << \", \" << dp[i + 2][nxtPos][k + 1] << endl;\n }\n }\n }\n }\n }\n\n lint ans = INF;\n for (int j = 0; j < info[n - 1].size(); j++) {\n for (int k = 0; k <= m; k++) {\n int pos = info[n - 1][j].first;\n ans = min(ans, dp[n - 1][pos][k]);\n }\n }\n\n for (int j = 0; j < info[n - 2].size(); j++) {\n for (int k = 0; k < m; k++) {\n int pos = info[n - 2][j].first;\n ans = min(ans, dp[n - 2][pos][k]);\n }\n }\n\n cout << ans << endl;\n return true;\n}\n\n\nint main() {\n \n while (1) {\n if (!solve()) break;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 140, "memory_kb": 98412, "score_of_the_acc": -1.9194, "final_rank": 19 }, { "submission_id": "aoj_0530_4153932", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\nll n,m;\nvector<ll> x[200],d[200];\n\nll get_cost(int a,int b,int c, int d_){\n if(a == 0) return 0;\n if(c == n+1) return 0;\n return (d[a][b]+d[c][d_])*abs(x[a][b]-x[c][d_]);\n}\n\nll dp[200][200][10];\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n while(1){\n cin >> n >> m;\n if(n == 0) break;\n \n for(int i = 0;i < 200;i++){\n x[i] = vector<ll>(0); d[i] = vector<ll>(0);\n\n }\n\n x[0].push_back(0);\n x[n+1].push_back(0);\n\n for (int i = 1;i <= n;i++){\n ll k; cin >> k;\n for (int j = 0;j < k;j++){\n ll x_,d_; cin >> x_ >> d_;\n x[i].push_back(x_);\n d[i].push_back(d_);\n }\n }\n\n for (int i = 0;i < 200;i++){\n for (int j = 0;j < 200;j++){\n for (int k = 0;k < 10;k++){\n dp[i][j][k] = LLONG_MAX;\n }\n }\n }\n\n dp[0][m][0] = 0;\n\n for (int i = 0;i <= n;i++){\n for (int j = 0;j <= m;j++){\n for (int k = 0;k < x[i].size();k++){\n if(dp[i][j][k] == LLONG_MAX) continue;\n //cout << i << \" \" << j << \" \" << k << endl;\n if(i != n && j != 0){\n for (int l = 0;l < x[i+2].size();l++){\n dp[i+2][j-1][l] = min(dp[i+2][j-1][l],dp[i][j][k]+get_cost(i,k,i+2,l));\n }\n }\n for (int l = 0;l < x[i+1].size();l++){\n dp[i+1][j][l] = min(dp[i+1][j][l],dp[i][j][k]+get_cost(i,k,i+1,l));\n }\n }\n }\n }\n\n ll ans = LLONG_MAX;\n for (int i = 0;i <= m;i++){\n ans = min(dp[n+1][i][0],ans);\n }\n\n cout << ans << endl;\n }\n\n return 0;\n\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 6352, "score_of_the_acc": -0.0307, "final_rank": 7 }, { "submission_id": "aoj_0530_3995448", "code_snippet": "#include <algorithm>\n#include <bitset>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <cstdio>\n#include <ctime>\n#include <deque>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <random>\n#include <set>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <vector>\nusing namespace std;\n\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(v) (v).begin(),(v).end()\n\nconst int INF = 0x3f3f3f3f;\nconst long long LINF = 0x3f3f3f3f3f3f3f3fLL;\n/*----------------------------------------*/\n\nint main() {\n cin.tie(0); ios::sync_with_stdio(false);\n // freopen(\"input.txt\", \"r\", stdin);\n\n while (true) {\n int n, m; cin >> n >> m;\n if (n == 0 && m == 0) break;\n vector<vector<pair<int, int>>> stone(n+3, vector<pair<int, int>>(0));\n FOR(i, 1, n+1) {\n int k; cin >> k;\n REP(j, k) {\n int x, d; cin >> x >> d;\n stone[i].push_back({x, d});\n }\n }\n FOR(j, 1, 1001) {\n stone[0].push_back({j, 0});\n stone[n+1].push_back({j, 0});\n stone[n+2].push_back({j, 0});\n }\n vector<vector<vector<int>>> dp(n+3, vector<vector<int>>(1001, vector<int>(m+1, INF)));\n FOR(j, 1, 1001) dp[0][j][0] = 0;\n REP(i, n+1) for (auto a : stone[i]) {\n for (auto b : stone[i+1]) REP(k, m+1) {\n dp[i+1][b.first][k] = min(dp[i+1][b.first][k], dp[i][a.first][k] + (a.second == 0 || b.second == 0? 0 : (a.second+b.second)*abs(a.first-b.first)));\n }\n for (auto b : stone[i+2]) REP(k, m) {\n dp[i+2][b.first][k+1] = min(dp[i+2][b.first][k+1], dp[i][a.first][k] + (a.second == 0 || b.second == 0? 0 : (a.second+b.second)*abs(a.first-b.first)));\n }\n }\n int ans = INF;\n FOR(j, 1, 1001) REP(k, m+1) ans = min({ans, dp[n+1][j][k], dp[n+2][j][k]});\n cout << ans << '\\n';\n }\n return 0;\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 54572, "score_of_the_acc": -1.1764, "final_rank": 15 }, { "submission_id": "aoj_0530_3945369", "code_snippet": "#include <bits/stdc++.h>\n#define err(args...) {}\n#ifdef DEBUG\n#include \"_debug.cpp\"\n#endif\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\ntemplate <typename T> using lim = numeric_limits<T>;\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& a) { for(T& x : a) { is >> x; } return is; }\nconst int N = 150;\nint opt[N+2][N+2][10];\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n int n, m;\n while(cin >> n >> m and (n or m)) {\n vector<vector<int>> pos(n + 2), slip(n + 2);\n for(int i = 1; i <= n; i++) {\n int k;\n cin >> k;\n pos[i].resize(k);\n slip[i].resize(k);\n for(int j = 0; j < k; j++) {\n cin >> pos[i][j] >> slip[i][j];\n }\n }\n for(int i = 0; i <= n + 1; i++) {\n for(int j = 0; j <= m; j++) {\n for(int cur_pos = 0; cur_pos < pos[i].size() + (i == 0 or i == n + 1); cur_pos++) {\n if(i == 0) {\n opt[i][j][cur_pos] = 0; \n } else {\n opt[i][j][cur_pos] = lim<int>::max();\n for(int new_pos = 0; new_pos < pos[i - 1].size() + (i - 1 == 0); new_pos++) {\n int cost = i == n + 1 or i - 1 == 0 ? 0 : (slip[i][cur_pos] + slip[i - 1][new_pos]) * abs(pos[i][cur_pos] - pos[i - 1][new_pos]);\n opt[i][j][cur_pos] = min(opt[i][j][cur_pos], opt[i - 1][j][new_pos] + cost);\n }\n if(j > 0 and i - 2 >= 0) {\n for(int new_pos = 0; new_pos < pos[i - 2].size() + (i - 2 == 0); new_pos++) {\n int cost = i == n + 1 or i - 2 == 0 ? 0 : (slip[i][cur_pos] + slip[i - 2][new_pos]) * abs(pos[i][cur_pos] - pos[i - 2][new_pos]);\n opt[i][j][cur_pos] = min(opt[i][j][cur_pos], opt[i - 2][j - 1][new_pos] + cost);\n }\n }\n }\n }\n }\n }\n cout << opt[n + 1][m][0] << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3936, "score_of_the_acc": -0.0055, "final_rank": 3 }, { "submission_id": "aoj_0530_3886898", "code_snippet": "#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\nconst int INF = (int)1e9 + 7;\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\ntemplate <class T>\nvector<T> make_v(size_t size, const T &init) {\n return vector<T>(size, init);\n}\ntemplate <class... Ts>\nauto make_v(size_t size, Ts... rest) {\n return vector<decltype(make_v(rest...))>(size, make_v(rest...));\n}\n\nint main() {\n const int MAXW = 1e3;\n int n, m;\n while (cin >> n >> m, n) {\n vector<vector<pair<int, int>>> stone(n);\n for (int i = 0; i < n; i++) {\n int k; cin >> k;\n while (k--) {\n int x, d; cin >> x >> d; x--;\n stone[i].emplace_back(x, d);\n }\n }\n auto dp = make_v(n, MAXW, m + 1, INF);\n for (int j = 0; j < MAXW; j++) {\n for (auto &p: stone[0]) dp[0][p.first][m] = 0;\n if (m) for (auto &p: stone[1]) dp[1][p.first][m - 1] = 0;\n }\n for (int i = 0; i < n - 1; i++) for (int k = 0; k <= m; k++) {\n for (auto &s: stone[i]) for (auto &t: stone[i + 1]) {\n int cost = abs(s.first - t.first) * (s.second + t.second);\n chmin(dp[i + 1][t.first][k], dp[i][s.first][k] + cost);\n }\n if (i == n - 2 || k == 0) continue;\n for (auto &s: stone[i]) for (auto &t: stone[i + 2]) {\n int cost = abs(s.first - t.first) * (s.second + t.second);\n chmin(dp[i + 2][t.first][k - 1], dp[i][s.first][k] + cost);\n }\n }\n int ans = INF;\n for (int j = 0; j < MAXW; j++) for (int k = 0; k <= m; k++) {\n if (k) chmin(ans, dp[n - 2][j][k]);\n chmin(ans, dp[n - 1][j][k]);\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 53472, "score_of_the_acc": -1.0935, "final_rank": 14 }, { "submission_id": "aoj_0530_3880799", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define F first\n#define S second\n#define pii pair<int, int>\n#define eb emplace_back\n#define all(v) v.begin(), v.end()\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n#define rep3(i, l, n) for (int i = l; i < (n); ++i)\n#define sz(v) (int)v.size()\n#define inf (int)(1e9+7)\n#define abs(x) (x >= 0 ? x : -(x))\n#define ceil(a, b) a / b + !!(a % b)\ntemplate<typename T1, typename T2> inline void chmin(T1 &a, T2 b) { if (a > b) a = b; }\ntemplate<typename T1, typename T2> inline void chmax(T1 &a, T2 b) { if (a < b) a = b; }\ntemplate<typename T> T pow(T a, int b) { return b ? pow(a * a, b / 2) * (b % 2 ? a : 1) : 1; }\ntemplate<typename T> T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); }\n\n\n\n\n\n\n\nint main() {\n \n const ll INF = 1e18;\n const int A = 170, B = 15, C = 80;\n int n, m;\n\n while (cin >> n >> m && n) {\n ll dp[A][B][C]; // 行, その行の石, 何回とばししたか\n vector<pii> v[170];\n \n rep(i, n) {\n int k;\n cin >> k;\n rep(j, k) {\n int col, val;\n cin >> col >> val;\n v[i].eb(col, val);\n }\n }\n \n fill_n(**dp, A * B * C, INF);\n rep(j, 15) dp[0][j][0] = 0;\n rep(j, sz(v[1])) dp[1][j][1] = 0;\n \n rep(i, n - 1) {\n \n rep(k, sz(v[i])) {\n rep(l, m + 1) {\n rep(j, sz(v[i + 1])) {\n ll cost = (v[i + 1][j].S + v[i][k].S) * abs(v[i + 1][j].F - v[i][k].F);\n chmin(dp[i + 1][j][l], dp[i][k][l] + cost);\n // if (dp[i + 1][j][l] == 5198) cout << v[i + 1][j].F << \" \" << v[i + 1][j].S << \" \" << v[i][k].F << \" \" << v[i][k].S << endl;\n }\n if (i <= n - 3 && l <= m - 1) {\n // if (l == 2) cout << i << \" \" << k << \" \" << l << endl;\n rep(j, sz(v[i + 2])) {\n \n ll cost = (v[i + 2][j].S + v[i][k].S) * abs(v[i + 2][j].F - v[i][k].F); // 後ろのi + 1にしてた!!\n \n if (dp[i + 2][j][l + 1] > dp[i][k][l] + cost) {\n chmin(dp[i + 2][j][l + 1], dp[i][k][l] + cost);\n // if (dp[i + 2][k][l + 1] == 27027) cout << i + 2 << \" \" << k << \" \" << l + 1 << \" \" << dp[i][k][l] << \" \" << cost << \" \" << endl;\n }\n \n }\n }\n }\n }\n }\n \n ll ans = INF;\n rep(j, B) rep(k, m + 1) chmin(ans, dp[n - 1][j][k]);\n \n rep(j, B) rep(k, m) chmin(ans, dp[n - 2][j][k]); // これ忘れてた\n \n \n cout << ans << '\\n';\n \n \n // cout << dp[2][0][1] << endl;\n\n /*\n rep(i, n) {\n cout << endl << \"i \" << i << endl;\n rep(j, B) {\n cout << \"j \" << j << endl;\n rep(k, m + 1) cout << dp[i][j][k] << \" \"; cout << endl;\n }\n }*/\n \n }\n \n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4644, "score_of_the_acc": -0.0128, "final_rank": 6 } ]
aoj_0525_cpp
おせんべい 問題 IOI製菓では，創業以来の伝統の製法で煎餅（せんべい）を焼いている．この伝統の製法は，炭火で一定時間表側を焼き，表側が焼けると裏返して，炭火で一定時間裏側を焼くというものである．この伝統を守りつつ，煎餅を機械で焼いている．この機械は縦 R (1 ≤ R ≤ 10) 行, 横 C (1 ≤ C ≤ 10000) 列の長方形状に煎餅を並べて焼く．通常は自動運転で，表側が焼けたら一斉に煎餅を裏返し裏側を焼く． ある日，煎餅を焼いていると，煎餅を裏返す直前に地震が起こり何枚かの煎餅が裏返ってしまった．幸いなことに炭火の状態は適切なままであったが，これ以上表側を焼くと創業以来の伝統で定められている焼き時間を超えてしまい，煎餅の表側が焼けすぎて商品として出荷できなくなる．そこで，急いで機械をマニュアル操作に変更し，まだ裏返っていない煎餅だけを裏返そうとした．この機械は，横の行を何行か同時に裏返したり縦の列を何列か同時に裏返したりすることはできるが，残念なことに，煎餅を１枚ごと裏返すことはできない． 裏返すのに時間がかかると，地震で裏返らなかった煎餅の表側が焼けすぎて商品として出荷できなくなるので，横の何行かを同時に１回裏返し，引き続き，縦の何列かを同時に１回裏返して，表側を焼きすぎずに両面を焼くことのできる煎餅，つまり，「出荷できる煎餅」の枚数をなるべく多くすることにした．横の行を１行も裏返さない，あるいは，縦の列を１列も裏返さない場合も考えることにする．出荷できる煎餅の枚数の最大値を出力するプログラムを書きなさい． 地震の直後に，煎餅が次の図のような状態になったとする．黒い丸が表側が焼ける状態を，白い丸が裏側が焼ける状態を表している． 1行目を裏返すと次の図のような状態になる． さらに， 1列目と5列目を裏返すと次の図のような状態になる．この状態では，出荷できる煎餅は9枚である． ヒント R の上限 10 は C の上限 10000 に比べて小さいことに注意せよ． 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる． 入力の1行目には2つの整数 R, C (1 ≤ R ≤ 10, 1 ≤ C ≤ 10 000) が空白を区切りとして書かれている．続く R 行は地震直後の煎餅の状態を表す． (i+1) 行目 (1 ≤ i ≤ R) には， C 個の整数 a i,1 , a i,2 , ……, a i,C が空白を区切りとして書かれており， a i,j は i 行 j 列 の煎餅の状態を表している. a i,j が 1 なら表側が焼けることを， 0 なら裏側が焼けることを表す． C, R がともに 0 のとき入力の終了を示す.　データセットの数は 5 を超えない． 出力 データセットごとに，出荷できる煎餅の最大枚数を1行に出力する． 入出力例 入力例 2 5 0 1 0 1 0 1 0 0 0 1 3 6 1 0 0 0 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 0 出力例 9 15 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0525_11014462", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cstring>\nusing namespace std;\nint ans;\nint ones[10001]={0};//全局变量一定要及时清理！！！，不然下次循环又累加了\nint m,n;\nint a[11][10001];\nvoid solve(){\n memset(ones,0,sizeof(ones));//不只是赋值，更是清空\n ans=0;\n for(int i=0;i<m;i++){\n for(int j=0;j<n;j++){\n ones[j]+=a[i][j];\n }\n }\n int _ones[10001];//每一列的总和\n for(int no=(1<<m)-1;no>=0;no--){//十行都有两种情况的枚举，共2的10次方，1左移64位减去一就是了\n int nos=no;\n for(int i=0;i<n;i++){\n _ones[i]=ones[i];\n }\n for(int i=0;i<m;i++){\n if(nos&1){//1就是翻转，判断此时最后一位是不是1，是的话就把ones的值更新\n for(int j=0;j<n;j++){\n _ones[j]+=a[i][j]?-1:1;\n }\n }\n nos>>=1;//右移一位nos=nos>>1；判断下一位要不要转\n }\n int tem=0;\n for(int j=0;j<n;j++){\n tem+=max(m-_ones[j],_ones[j]);//每一行都处理好了，这里看每一列翻不翻转哪个大\n }\n ans=max(ans,tem);\n }\n}\nint main(){\n while(cin>>m>>n&&m>0&&n>0){\n for(int i=0;i<m;i++){\n for(int j=0;j<n;j++){\n cin>>a[i][j];\n }\n }\n solve();\n cout<<ans<<endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 3640, "score_of_the_acc": -0.0504, "final_rank": 4 }, { "submission_id": "aoj_0525_10883246", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include<utility>\n#include<set>\n#include<deque>\n#include <unordered_map>\n#include<string>\n#include<map>\n#include<cmath>\n\nusing namespace std;\n\nint binary(int bina) {\n\tint ans = 0;\n\tfor (int i = 0; bina > 0; i++)\n\t{\n\t\tans = ans + (bina % 2) * pow(10, i);\n\t\tbina = bina / 2;\n\t}\n\treturn ans;\n}\n\nconst long long INF = 1LL << 60;\nint main() {\n\tint H, W;\n\twhile (true) {\n\t\tcin >> H >> W;\n\t\tif (H == 0 and W == 0)break;\n\t\tvector<vector<int>>M(H, vector<int>(W, 0));\n\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tfor (int j = 0; j < W; j++) {\n\t\t\t\tcin >> M[i][j];\n\t\t\t}\n\t\t}\n\t\tint A = 1;\n\t\tfor (int i = 0; i < H; i++) {\n\t\t\tA *= 2;\n\t\t}\n\t\tA -= 1;\n\t\tint ans = 0;\n\t\tfor (int i = 0; i <= A; i++) {\n\n\t\t\tstring S = to_string(binary(i));\n\n\t\t\tfor (int j = 0; j < S.size(); j++) {\n\t\t\t\tif (S[j] == '1') {\n\t\t\t\t\tfor (int k = 0; k < W; k++) {\n\t\t\t\t\t\tif (M[j][k] == 0) {\n\t\t\t\t\t\t\tM[j][k] = 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tM[j][k] = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\n\n\n\t\t\tint ka = 0;\n\t\t\tfor (int j = 0; j < W; j++) {\n\t\t\t\tint zc = 0, oc = 0;\n\t\t\t\tfor (int k = 0; k < H; k++) {\n\t\t\t\t\tif (M[k][j] == 0) {\n\t\t\t\t\t\tzc += 1;\n\t\t\t\t\t}\n\t\t\t\t\telse {\n\t\t\t\t\t\toc += 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tka += max(zc, oc);\n\t\t\t}\n\t\t\tans = max(ans, ka);\n\t\t\tfor (int j = 0; j < S.size(); j++) {\n\t\t\t\tif (S[j] == '1') {\n\t\t\t\t\tfor (int k = 0; k < W; k++) {\n\t\t\t\t\t\tif (M[j][k] == 0) {\n\t\t\t\t\t\t\tM[j][k] = 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\telse {\n\t\t\t\t\t\t\tM[j][k] = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}", "accuracy": 1, "time_ms": 720, "memory_kb": 4116, "score_of_the_acc": -0.4468, "final_rank": 17 }, { "submission_id": "aoj_0525_10853937", "code_snippet": "#include <iostream>\n#include <bitset>\n#include <cstdio>\n\nusing namespace std;\n\n#define MAX_R 10\n#define MAX_C 10000\n\nint w,h;\nbitset<MAX_C> mat[MAX_R];\nint maxcnt;\n\nvoid DFS2(int cur)\n{\n\tif(cur==w)\n\t{\n\t\tint cnt=0;\n\t\tfor(int i=0;i<h;i++)\n\t\tfor(int j=0;j<w;j++)\n\t\t\tif(mat[i][j]) cnt++;\n\n\t\tmaxcnt=max(cnt,maxcnt);\n\t\treturn;\n\t}\n\n\tint cnt0=0,cnt1=0;\n\n\tfor(int i=0;i<h;i++)\n\t\tif(mat[i][cur]) cnt1++;\n\t\telse cnt0++;\n\n\tif(cnt0>cnt1)\n\t\tfor(int i=0;i<h;i++) mat[i][cur].flip();\n\n\tDFS2(cur+1);\n}\n\nvoid DFS1(int cur)\n{\n\tif(cur==h)\n\t{\n\t\tDFS2(0);\n\t\treturn;\n\t}\n\n\tmat[cur].flip();\n\tDFS1(cur+1);\n\tmat[cur].flip();\n\tDFS1(cur+1);\n}\n\nint main()\n{\n\tscanf(\"%d%d\",&h,&w);\n\n\twhile(w!=0 || h!=0)\n\t{\n\t\tfor(int i=0;i<h;i++)\n\t\t{\n\t\t\tmat[i].reset();\n\t\t\tfor(int j=0;j<w;j++)\n\t\t\t{\n\t\t\t\tint val;\n\t\t\t\tscanf(\"%d\",&val);\n\t\t\t\tif(val) mat[i][j]=true;\n\t\t\t\telse mat[i][j]=false;\n\t\t\t}\n\t\t}\n\n\t\tmaxcnt=0;\n\n\t\tDFS1(0);\n\t\tprintf(\"%d\\n\",maxcnt);\n\n\t\tscanf(\"%d%d\",&h,&w);\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 650, "memory_kb": 3504, "score_of_the_acc": -0.3746, "final_rank": 16 }, { "submission_id": "aoj_0525_10698607", "code_snippet": "#include <iostream>\n#include <algorithm>\n\n#define MAXN 10000\n\nusing namespace std;\n\nint H, W;\nint region[15][MAXN];\nint ans;\n\nvoid dfs(int col) {\n if (col == H) {\n int sum = 0;\n\n for (int i = 0; i < W; i++) {\n int volsum = 0;\n for (int j = 0; j < H; j++) {\n volsum += region[j][i];\n }\n\n sum += max(volsum, H - volsum);\n }\n\n ans = max(ans, sum);\n return;\n }\n\n dfs(col + 1);\n\n for (int i = 0; i < W; i++) {\n region[col][i] = !region[col][i];\n }\n\n dfs(col + 1);\n\n for (int i = 0; i < W; i++) {\n region[col][i] = !region[col][i];\n }\n\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n while (cin >> H >> W, H + W) {\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n cin >> region[i][j];\n }\n }\n\n ans = 0;\n dfs(0);\n cout << ans << '\\n';\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 3852, "score_of_the_acc": -0.0618, "final_rank": 6 }, { "submission_id": "aoj_0525_10347996", "code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdio>\n#include <vector>\n\nint main() {\n int r, c;\n while (scanf(\"%d %d\", &r, &c) == 2 && r != 0) {\n std::vector<std::vector<int>> g(r, std::vector<int>(c, 0));\n\n for (int i = 0; i < r; i++) {\n for (int j = 0; j < c; j++) {\n scanf(\"%d\", &g[i][j]);\n }\n }\n\n int ans = 0;\n\n int b = 0;\n int upper = std::pow(2, r);\n while (b < upper) {\n auto t = g;\n for (int i = 0; i < r; i++) {\n if (b & (1 << i)) {\n for (int j = 0; j < c; j++) {\n t[i][j] = t[i][j] == 1 ? 0 : 1;\n }\n }\n }\n int total = 0;\n for (int j = 0; j < c; j++) {\n int ct = 0;\n for (int i = 0; i < r; i++) {\n if (t[i][j] == 1) {\n ct++;\n }\n }\n total += std::max(ct, r - ct);\n }\n\n ans = std::max(ans, total);\n b++;\n }\n\n printf(\"%d\\n\", ans);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 200, "memory_kb": 3712, "score_of_the_acc": -0.133, "final_rank": 10 }, { "submission_id": "aoj_0525_10340988", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n\nint main(){\n while(1){\n int r,c;\n cin >> r >> c;\n if(r==0 && c==0) break;\n vector<vector<int>> grid(r,vector<int>(c));\n rep(i,r){\n rep(j,c){\n cin >> grid[i][j];\n }\n }\n int ans=0;\n for(int bit=0;bit<(1<<r);bit++){\n vector<vector<int>> grid2=grid;\n rep(i,r){\n if(bit&(1<<i)){\n rep(j,c){\n grid2[i][j]=1-grid2[i][j];\n }\n }\n }\n int res=0;\n rep(j,c){\n int zero=0;\n rep(i,r){\n if(grid2[i][j]==0){\n zero++;\n }\n }\n res += max(zero,r-zero);\n }\n ans=max(ans,res);\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 210, "memory_kb": 3808, "score_of_the_acc": -0.1437, "final_rank": 12 }, { "submission_id": "aoj_0525_10057112", "code_snippet": "#include <algorithm>\n#include <string>\n#include <vector>\n#include <iostream>\n#include <queue>\n#include <map>\n#include <set>\n#include <sstream>\n#include <stdio.h>\nusing namespace std;\nusing ll = long long;\nint grid[11][10001];\nint senbeis[10001];\nll H, W;\nll maximum = -1;\n\nvoid turn(int n){\n if(n == H){\n ll sum = 0;\n for(ll j = 0; j < W; j++){\n sum += max((ll)senbeis[j], H-senbeis[j]);\n }\n maximum = max(maximum, sum);\n }\n else{\n for(int j = 0; j < W; j++){\n if(grid[n][j] == 1){\n grid[n][j] = 0;\n senbeis[j]++;\n }\n else{\n grid[n][j] = 1;\n senbeis[j]--;\n }\n }\n turn(n+1);\n\n for(int j = 0; j < W; j++){\n if(grid[n][j] == 1){\n grid[n][j] = 0;\n senbeis[j]++;\n }\n else{\n grid[n][j] = 1;\n senbeis[j]--;\n }\n }\n\n turn(n+1);\n }\n}\n\nint main(){\n while(true){\n maximum = -1;\n cin >> H >> W;\n if(H == 0 || W == 0) return 0;\n for(ll j = 0; j < W; j++) senbeis[j] = 0;\n\n for(ll i = 0; i < H; i++){\n for(ll j = 0; j < W; j++){\n cin >> grid[i][j];\n if(grid[i][j] == 0) senbeis[j]++;\n }\n }\n turn(0);\n cout << maximum << endl;\n }\n}", "accuracy": 1, "time_ms": 120, "memory_kb": 3748, "score_of_the_acc": -0.09, "final_rank": 8 }, { "submission_id": "aoj_0525_9637771", "code_snippet": "// https://codeforces.com/blog/entry/96344\n#pragma GCC optimize(\"O3,unroll-loops\")\n#pragma GCC target(\"avx2,bmi,bmi2,lzcnt,popcnt\")\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\n\ntemplate<typename T>\nbool chmax(T& a, const T& b) {\n bool res = a < b;\n a = max(a, b);\n return res;\n}\ntemplate<typename T>\nbool chmin(T& a, const T& b){\n bool res = a > b;\n a = min(a, b);\n return res;\n}\n\ntypedef vector<long long> vl;\ntypedef pair<ll,ll> pll;\ntypedef vector<pair<ll, ll>> vll;\ntypedef vector<int> vi;\ntypedef vector<pair<int,int>> vii;\ntypedef pair<int,int> pii;\n\nconst int inf = 1000000009;\nconst ll linf = 4000000000000000009;\n\n\n// https://trap.jp/post/1224/\ntemplate<class... T>\nvoid input(T&... a){\n (cin >> ... >> a);\n}\n\nvoid print(){\n cout << '\\n';\n}\ntemplate<class T, class... Ts>\nvoid print(const T& a, const Ts&... b){\n cout << a;\n (cout << ... << (cout << ' ', b));\n cout << '\\n';\n}\n\n#define rep1(a) for(int i = 0; i < a; i++)\n#define rep2(i, a) for(int i = 0; i < a; i++)\n#define rep3(i, a, b) for(int i = a; i < b; i++)\n#define rep4(i, a, b, c) for(int i = a; i < b; i += c)\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n//---------------------------------\n\n#define MAX_C 10009\nint a[MAX_C];\nint ans, x;\n\n\nvoid solve(int r, int c){\n ans = 0;\n memset(a, 0, c*sizeof(int));\n rep(j, r) rep(i, c){\n cin >> x;\n a[i] += x*(1<<j);\n }\n for(int mask = 0; mask < (1<<r); mask++){\n int cur = 0;\n rep(i, c){\n int aft = mask ^ a[i];\n int pop = __builtin_popcount(aft);\n cur += max(pop, r-pop);\n }\n chmax(ans, cur);\n }\n print(ans);\n}\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n int r,c;\n cin >> r >> c;\n while(r > 0){\n solve(r, c);\n cin >> r >> c;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3364, "score_of_the_acc": -0.0075, "final_rank": 1 }, { "submission_id": "aoj_0525_9637487", "code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\n\nint main(){\n\n int H, W;\n\n while(cin >> H >> W && H != 0 && W != 0){\n\n vector<vector<int> > vec(H, vector<int>(W));\n\n for(int i = 0 ; i < H ; i ++){\n for(int j = 0 ; j < W ; j ++){\n\n cin >> vec[i][j];\n\n }\n }\n\n int result = 0;\n\n //实现翻转哪一行的外部loop，如果i与bit的论理积为1，则翻转，否则跳过那行\n for(int bit = 0 ; bit < (1<<H) ; bit++){\n\n vector<vector<int> > vec_copy(vec);\n\n for(int i = 0 ; i < H ; i ++){\n if(!(bit & (1 << i))) continue;\n\n for(int j = 0 ; j < W ; j ++){\n\n vec_copy[i][j] = 1 - vec_copy[i][j];\n\n }\n }\n\n int tmp = 0;\n\n for(int j = 0 ; j < W ; j ++){\n\n int num = 0;\n\n for(int i = 0 ; i < H ; i ++){\n\n if(vec_copy[i][j] == 0) num ++;\n\n }\n tmp += max(num , H-num);\n\n }\n\n result = max(result,tmp);\n\n\n }\n\n cout << result << endl;\n\n }\n\n return 0;\n\n\n\n}", "accuracy": 1, "time_ms": 210, "memory_kb": 3752, "score_of_the_acc": -0.1407, "final_rank": 11 }, { "submission_id": "aoj_0525_9556642", "code_snippet": "#include <bits/stdc++.h>\n//#include <atcoder/all>\n#include <unordered_set>\n#include <functional>\nusing namespace std;\n//using namespace atcoder;\nusing ll = long long;\nusing P = pair<int, int>;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n//void chmin(ll & a, ll b) { a = min(a, b); }\n//using mint = modint998244353;\n\nint main() {\n\twhile (true) {\n\t\tint r, c;\n\t\tint ans = 0;\n\t\tcin >> r >> c;\n\t\tif (r == 0 && c == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tvector o(r, vector<int>(c));\n\t\trep(i, r)rep(j, c) cin >> o[i][j];//1の数の最小化\n\t\t\n\t\tfor (int i = 0; i < (1 << r); i++) {\n\t\t\tvector oc = o;\n\t\t\tfor (int j = 0; j < r; j++) {\n\t\t\t\tif (i & (1 << j)) {\n\t\t\t\t\trep(k, c) {\n\t\t\t\t\t\toc[j][k] ^= 1;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tvector<int> s(c);\n\t\t\trep(j, c) {\n\t\t\t\tint num1 = 0;\n\t\t\t\trep(k, r) {\n\t\t\t\t\tif (oc[k][j] == 1) {\n\t\t\t\t\t\tnum1++;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\ts[j] = num1;\n\t\t\t}\n\n\t\t\tint temp = 0;\n\t\t\trep(j, c) {\n\t\t\t\tif (s[j] * 2 > r) {\n\t\t\t\t\ttemp += s[j];\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttemp += r - s[j];\n\t\t\t\t}\n\t\t\t}\n\t\t\tans = max(ans, temp);\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}", "accuracy": 1, "time_ms": 240, "memory_kb": 3972, "score_of_the_acc": -0.1694, "final_rank": 14 }, { "submission_id": "aoj_0525_9515862", "code_snippet": "#include \"iostream\"\n#include \"vector\"\n\nusing namespace std;\nint c,r;\nint g_o[11][10001];\nint g_i[11][10001];\n\n\nint main(){\n while((cin >> r >> c) && (r+c) != 0){\n for(int i = 0 ; i < r; i++){\n for(int j = 0; j < c; j++){\n cin >> g_o[i][j];\n g_i[i][j] = g_o[i][j] ^ 1;\n }\n }\n int ans = 0;\n\n for(int index = 0; index < (1 << r); index++){\n int result = 0;\n vector<int> cnt_o(c,0);\n for(int i = 0; i < r; i++){\n for(int j = 0; j < c; j++){\n if((index>>i) & 1) cnt_o[j] += g_i[i][j];\n else cnt_o[j] += g_o[i][j];\n }\n }\n for(int j = 0; j < c; j++){\n result += max(cnt_o[j], r-cnt_o[j]);\n }\n ans = max(ans, result);\n }\n cout << ans << endl;\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 110, "memory_kb": 3932, "score_of_the_acc": -0.0942, "final_rank": 9 }, { "submission_id": "aoj_0525_9466367", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint ans;\nint n, m;\nbool maze[15][10005];\nvoid solve(int step) {\n\tif (step > n) {\n\t\tint sum = 0;\n\t\tfor (int j = 1; j <= m; ++j) {\n\t\t\tint cnt = 0;\n\t\t\tfor (int i = 1; i <= n; ++i) {\n\t\t\t\tcnt += maze[i][j];\n\t\t\t}\n\t\t\tcnt = max(cnt, n - cnt);\n\t\t\tsum += cnt;\n\t\t}\n\t\tans = max(ans, sum);\n\t\treturn;\n\t}\n\tsolve(step + 1);\n\tfor (int i = 1; i <= m; ++i) maze[step][i] = !maze[step][i];\n\tsolve(step+1);\n\treturn;\n}\nint main()\n{\n\tios::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n\tcin >> n >> m;\n\twhile (n && m) {\n\t\tfor (int i = 1; i <= n; i++)\n\t\t\tfor (int j = 1; j <= m; ++j) cin >> maze[i][j];\n\t\tans = 0;\n\t\tsolve(1);\n\t\tcout << ans << '\\n';\n\t\tcin >> n >> m;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 3568, "score_of_the_acc": -0.041, "final_rank": 3 }, { "submission_id": "aoj_0525_9430287", "code_snippet": "/* c++11 header*/\n#include <algorithm>\n#include <iostream>\n#include <utility>\n#include <vector>\n#include <string>\n#include <cmath>\n#include <iomanip>\n#include <stack>\n#include <queue>\n#include <map>\n#include <set>\n#include <list>\n\nusing namespace std;\n\n#define MAGICNUMBER 0x9e3779b9\n#define fsio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);\nconst int INF = 0x3f3f3f3f;\nconst double EPS = 1e-6;\n\nint r, c, pan;\nvector<vector<int>> g;\n\nvoid changes(int wr) {\n // 对当前第 wr 行进行反转，0 变 1 ，1 变 0\n for (int i = 0; i < c; i++) {\n if (g[wr][i]) {\n g[wr][i] = 0;\n g[r][i]--; // 对于原先的列 少了一个 1\n } else {\n g[wr][i] = 1;\n g[r][i]++; // 对于原先的列 多了一个 1\n }\n }\n}\n\nvoid flip(int wr) {\n if (wr == r) {\n int sum = 0;\n for (int i = 0; i < c; i++) { // 对于每一列 有多少个 1，有多少个 0，实际上选择最多的那一个，我们对这列进行反转\n int one = g[r][i], zero = r - one;\n sum += max(one, zero);\n }\n pan = max(pan, sum);\n return;\n }\n\n changes(wr);\n flip(wr + 1);\n changes(wr);\n\n // 不对第 wr 行进行反转，没有任何事情发生\n flip(wr + 1);\n}\n\nint main() {\n fsio;\n \n while (cin >> r >> c) {\n if (r == 0 && c == 0) break;\n\n g.assign(r + 1, vector<int>(c, 0));\n\n // 目标 0 的数量多\n for (int i = 0; i < r; i++) {\n for (int j = 0; j < c; j++) {\n cin >> g[i][j];\n g[r][j] += g[i][j];\n }\n }\n\n pan = 0;\n flip(0);\n cout << pan << \"\\n\";\n }\n \n return 0;\n}", "accuracy": 1, "time_ms": 110, "memory_kb": 3396, "score_of_the_acc": -0.0654, "final_rank": 7 }, { "submission_id": "aoj_0525_9309650", "code_snippet": "#include<iostream>\n#include<bitset>\n#define Max_R 10\n#define Max_C 10000\nusing namespace std;\n\nbitset<Max_C> Box[Max_R];\nint R,C;\n\nint main()\n{\n\twhile(scanf(\"%d%d\",&R,&C),R||C)\n\t{\n\t\tint ans=0;\n\t\tbool x;\n\t\tfor(int i=0;i<R;++i)\n\t\t for(int j=0;j<C;++j)\n\t\t {\n\t\t \tcin>>x;\n\t\t \tBox[i][j]=x;\n\t\t }\n \t \n\t\t for(int i=0;i<1<<R;++i)\n\t\t { \n\t\t int sum=0;\n\t\t \t\t \n\t\t \t\t for(int j=0;j<R;++j)\n\t\t \t\t {\n\t\t\t\t if(i&(1<<j))\n\t\t \t Box[j].flip();\n\t\t \t }\n\t\t \n\t\t for(int j=0;j<C;++j)\n\t\t { \n\t\t int temp=0;\n\t\t \tfor(int k=0;k<R;++k)\n\t\t \t{\n\t\t \t\tif(Box[k][j])\n\t\t \t\t temp++;\n\t\t\t\t\t}\n\t\t\t\t\tsum+=max(temp,R-temp);\n\t\t\t\t}\n\t\t\t\tans=max(ans,sum);\n\t\t\t\t\n\t\t\t\t for(int j=0;j<R;++j)\n\t\t \t\t {\n\t\t\t\t if(i&(1<<j))\n\t\t \t Box[j].flip();\n\t\t \t }\n\t\t \n \t }\n \tcout<<ans<<endl;\n }\n\t\n\treturn 0;\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 3368, "score_of_the_acc": -0.0527, "final_rank": 5 }, { "submission_id": "aoj_0525_9301884", "code_snippet": "#include<iostream>\nusing namespace std;\nshort b[10][10000];\nint R,C;\nint sum =0;\n\nvoid dfs(int t)\n{\n if(t==R)\n {\n int ans=0;\n for(int j=0;j<C;j++)\n {\n int tmp=0;\n for(int i=0;i<R;i++)\n {\n tmp+=b[i][j];\n }\n ans+= max(tmp,R-tmp);\n }\n sum = max(sum,ans);\n return;\n }\n dfs(t+1);\n for(int j=0;j<C;j++)\n {\n b[t][j]=1-b[t][j];\n }\n dfs(t+1);\n return;\n}\n\nusing namespace std;\nint main()\n{\n while(cin >> R >> C)\n {\n if((R==0)||(C==0)) break;\n if(R<=C)\n {\n //short b[R][C];\n for(int i=0;i<R;i++)\n {\n for(int j=0;j<C;j++)\n {\n cin >> b[i][j];\n }\n }\n }\n else\n {\n //short b[C][R];\n for(int j=0;j<R;j++)\n {\n for(int i=0;i<C;i++)\n {\n cin >> b[i][j];\n }\n }\n int tmp;\n tmp = C;\n C = R;\n R = tmp;\n }\n sum = 0;\n dfs(0);\n cout << sum << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 3224, "score_of_the_acc": -0.0393, "final_rank": 2 }, { "submission_id": "aoj_0525_9166108", "code_snippet": "#include <iostream>\n#include <cmath>\nusing namespace std;\n\nconst int MAX_R = 10, MAX_C = 10000;\n\nint R, C;\nint board[MAX_C][MAX_R];\n\nint main() {\n while (true) {\n cin >> R >> C;\n if (R == 0 && C == 0)\n return 0;\n int ans = 0;\n for (int i = 0; i < R; i++) {\n for (int j = 0; j < C; j++) {\n cin >> board[j][i];\n }\n }\n for (int i = 0; i < (1 << R); i++) {\n for (int j = 0; j < R; j++) {\n if ((i >> j) & 1) {\n for (int k = 0; k < C; k++) {\n if (board[k][j] == 0)\n board[k][j] = 1;\n else\n board[k][j] = 0;\n }\n }\n }\n int tmp = 0;\n for (int j = 0; j < C; j++) {\n int head = 0;\n for (int k = 0; k < R; k++) {\n if (board[j][k] == 0)\n head++;\n }\n tmp += max(head, R - head);\n }\n ans = max(ans, tmp);\n for (int j = 0; j < R; j++) {\n if ((i >> j) & 1) {\n for (int k = 0; k < C; k++) {\n if (board[k][j] == 0)\n board[k][j] = 1;\n else\n board[k][j] = 0;\n }\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 270, "memory_kb": 3380, "score_of_the_acc": -0.1545, "final_rank": 13 }, { "submission_id": "aoj_0525_9113641", "code_snippet": "//C\n#ifndef _GLIBCXX_NO_ASSERT\n#include <cassert>\n#endif\n#include <cctype>\n#include <cerrno>\n#include <cfloat>\n#include <ciso646>\n#include <climits>\n#include <clocale>\n#include <cmath>\n#include <csetjmp>\n#include <csignal>\n#include <cstdarg>\n#include <cstddef>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n\n#if __cplusplus >= 201103L\n#include <ccomplex>\n#include <cfenv>\n#include <cinttypes>\n#include <cstdalign>\n#include <cstdbool>\n#include <cstdint>\n#include <ctgmath>\n#include <cwchar>\n#include <cwctype>\n#endif\n\n// C++\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n#include <vector>\n\n#if __cplusplus >= 201103L\n#include <array>\n#include <atomic>\n#include <chrono>\n#include <condition_variable>\n#include <forward_list>\n#include <future>\n#include <initializer_list>\n#include <mutex>\n#include <random>\n#include <ratio>\n#include <regex>\n#include <scoped_allocator>\n#include <system_error>\n#include <thread>\n#include <tuple>\n#include <typeindex>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n#endif\nusing namespace std;\nint n,c,g[11][100001],tempg[11][100001];\nint main(){\n\twhile(1){\n\t\tcin >> n >> c;\n\t\tif(n==0 && c==0){\n\t\t\treturn 0;\n\t\t}\n\t\tfor(int i=1;i<=n;i++){\n\t\t\tfor(int j=1;j<=c;j++){\n\t\t\t\tcin >> g[i][j];\n\t\t\t}\n\t\t}\n\t\tint ans=0,tans=0;\n\t\tfor(int i=0;i<= 2<<n;i++){\n\t\t\tans=0;\n\t\t\tmemcpy(tempg,g,sizeof g);\n\t\t\tfor(int j=1,k=i;j<=n;j++){\n\t\t\t\tif((k&1)==1){\n\t\t\t\t\tfor(int l=1;l<=c;l++)tempg[j][l]=!tempg[j][l];\n\t\t\t\t}\n\t\t\t\tk=k>>1;\n\t\t\t}\n\t\t\t\n\t\t\tfor(int j=1;j<=c;j++){\n\t\t\t\tint one=0,zero=0;\n\t\t\t\tfor(int k=1;k<=n;k++){\n\t\t\t\t\tif(tempg[k][j]==1)one++;\n\t\t\t\t\telse if(tempg[k][j]==0)zero++;\n\t\t\t\t}\n\t\t\t\tans+=max(one,zero);\n\t\t\t}\n\t\t\ttans=max(ans,tans);\n\t\t}\n\t\tcout << tans <<'\\n';\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 1790, "memory_kb": 11584, "score_of_the_acc": -1.4493, "final_rank": 20 }, { "submission_id": "aoj_0525_9097252", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, _n) for (int i = 0; i < (_n); i++)\n\nbool bd[10][10000];\nint R, C;\nint res = 0;\n\nvoid turnCol() {\n int tmp = 0;\n rep(j, C) {\n int oneCount = 0, zeroCount = 0;\n rep(i, R) {\n if (bd[i][j]) oneCount++;\n else zeroCount++;\n }\n tmp += max(oneCount, zeroCount);\n }\n res = max(res, tmp);\n}\n\nint main() {\n while (1) {\n cin >> R >> C;\n if (R == 0 && C == 0) break;\n\n rep(i, R) rep(j, C) {\n int tmp; cin >> tmp;\n bd[i][j] = tmp == 1 ? true : false;\n }\n\n int rs = 0;\n while (rs != (1 << (R + 1))) {\n bool backup[10][10000];\n memcpy(backup, bd, 100000);\n rep(i, R) {\n if ((1 << i) & rs) {\n rep(j, C) bd[i][j] = !bd[i][j];\n }\n }\n turnCol();\n rs++;\n memcpy(bd, backup, 100000);\n }\n\n cout << res << endl;\n }\n}", "accuracy": 1, "time_ms": 1130, "memory_kb": 3244, "score_of_the_acc": -0.6303, "final_rank": 18 }, { "submission_id": "aoj_0525_9036013", "code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n if (x < 0) { cout << (i64)(x); }\n else { cout << (u64)(x); }\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll R, C;\n cin >> R >> C;\n if (R==0 and C==0) return 1;\n vv(ll, a, R, C);\n rep(i, R) rep(j, C) cin >> a[i][j];\n ll ans = 0;\n rep(mask, 1<<R) {\n ll total_cnt = 0;\n rep(j, C) {\n ll max_c = 0;\n rep(k, 2) {\n ll cnt = 0;\n rep(i, R) {\n cnt += ((a[i][j]^bit(mask,i)^k) == 0);\n }\n chmax(max_c, cnt);\n }\n total_cnt += max_c;\n }\n chmax(ans, total_cnt);\n }\n print(ans);\n return 0;\n}", "accuracy": 1, "time_ms": 260, "memory_kb": 3892, "score_of_the_acc": -0.1763, "final_rank": 15 }, { "submission_id": "aoj_0525_9011380", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint arr[11][1000000];\nvoid solve(){\n int n,m;\n while(cin >> n >> m){\n int maxn=0;\n if(n==0||m==0) break;\n for(int i=0;i<n;i++){\n for(int j=0;j<m;j++){\n cin >> arr[i][j];\n }\n }\n for(int s=0;s<=1<<n;s++){\n int ans=0;\n for(int j=0;j<m;j++){\n int cnt=0;\n for(int i=0;i<n;i++){\n int x=1&(s>>i);\n if(x^arr[i][j]) cnt++;\n }\n ans+=max(cnt,n-cnt);\n }\n maxn=max(ans,maxn);\n }\n cout << maxn << \"\\n\";\n }\n}\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n solve();\n}", "accuracy": 1, "time_ms": 150, "memory_kb": 21832, "score_of_the_acc": -1.0787, "final_rank": 19 } ]
aoj_0534_cpp
連鎖 問題 次のようなゲームがある． あるキャラクターが縦 1 列に N 個並んでいる．これらのキャラクターの色は赤，青，黄のいずれかであり，初期状態で同じ色のキャラクターが4つ以上連続して並んでいることはない．プレーヤーは，ある位置のキャラクターを選び他の色に変更することができる．この操作により同じ色のキャラクターが4つ以上連続して並ぶとそれらのキャラクターは消滅する．キャラクターが消滅することにより新たに同じ色のキャラクターが4つ以上連続して並ぶとそれらのキャラクターも消滅し，同じ色のキャラクターが4つ以上連続して並んでいる箇所がなくなるまでこの連鎖は続く．このゲームの目的は，消滅しないで残っているキャラクター数をなるべく少なくすることである． 例えば，下図の左端の状態で，上から6番目のキャラクターの色を黄色から青に変更すると，青のキャラクターが5つ連続するので消滅し，最終的に3つのキャラクターが消滅せずに残る． 初期状態における N 個のキャラクターの色の並びが与えられたとき， 1箇所だけキャラクターの色を変更した場合の，消滅しないで残っているキャラクター数の最小値 M を求めるプログラムを作成せよ． 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる． 1行目はキャラクター数 N (1 ≤ N ≤ 10000) だけからなる．続く N 行には 1, 2, 3 のいずれか1つの整数が書かれており， i + 1 行目 (1 ≤ i ≤ N) は初期状態における上から i 番目のキャラクターの色を表す（1 は赤を，2 は青を，3は黄を表す）． N が 0 のとき入力の終了を示す．データセットの数は 5 を超えない． 出力 データセットごとに, 消滅しないで残っているキャラクター数の最小値 M を１行に出力せよ． 入出力例 入力例 12 3 2 1 1 2 3 2 2 2 1 1 3 12 3 2 1 1 2 3 2 1 3 2 1 3 0 出力例 3 12 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0534_10576688", "code_snippet": "// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/0534\n#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <iterator>\n#include <type_traits>\n#include <utility>\n/// @brief ランレングス圧縮\ntemplate <class Container>\nauto run_length_encoding(const Container &v) {\n std::vector<std::pair<std::decay_t<decltype(*std::begin(v))>, int>> res;\n for (auto &&e : v) {\n if (res.empty() || res.back().first != e) res.emplace_back(e, 1);\n else ++res.back().second;\n }\n return res;\n}\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\nstruct increment_impl {\n template <class T>\n const increment_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) ++x;\n return *this;\n }\n} Inc;\nstruct decrement_impl {\n template <class T>\n const decrement_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) --x;\n return *this;\n }\n} Dec;\nstruct sort_impl {\n template <class T>\n const sort_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n return *this;\n }\n} Sort;\nstruct unique_impl {\n template <class T>\n const unique_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n v.erase(std::unique(v.begin(), v.end()), v.end());\n return *this;\n }\n} Uniq;\nint main(void) {\n while (true) {\n int n;\n std::cin >> n;\n if (!n)\n break;\n std::vector<int> a(n);\n for (auto &e : a) std::cin >> e;\n Dec >> a;\n int ans = n;\n for (int i = 0; i < n; ++i) {\n auto b = a;\n for (int j = 0; j < 3; ++j) {\n if (a[i] == j)\n continue;\n b[i] = j;\n auto v = run_length_encoding(b);\n std::stack<std::pair<int, int>> st;\n for (auto p : v) {\n if (p.second >= 4)\n continue;\n if (!st.empty() && st.top().first == p.first && st.top().second + p.second >= 4)\n st.pop();\n else\n st.emplace(p);\n }\n int sum = 0;\n while (!st.empty()) {\n sum += st.top().second;\n st.pop();\n }\n ans = std::min(ans, sum);\n }\n }\n std::cout << ans << '\\n';\n }\n return 0;\n}", "accuracy": 1, "time_ms": 810, "memory_kb": 3840, "score_of_the_acc": -0.9005, "final_rank": 14 }, { "submission_id": "aoj_0534_10508638", "code_snippet": "// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/0534\n#include <algorithm>\n#include <iostream>\n#include <stack>\n#include <utility>\n#include <vector>\n#include <type_traits>\n/// @brief ランレングス圧縮\ntemplate <class Container>\nauto run_length_encoding(const Container &v) {\n std::vector<std::pair<std::decay_t<decltype(*v.begin())>, int>> res;\n for (auto &&e : v) {\n if (res.empty() || res.back().first != e) res.emplace_back(e, 1);\n else ++res.back().second;\n }\n return res;\n}\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\nstruct increment_impl {\n template <class T>\n const increment_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) ++x;\n return *this;\n }\n} Inc;\nstruct decrement_impl {\n template <class T>\n const decrement_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) --x;\n return *this;\n }\n} Dec;\nstruct sort_impl {\n template <class T>\n const sort_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n return *this;\n }\n} Sort;\nstruct unique_impl {\n template <class T>\n const unique_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n v.erase(std::unique(v.begin(), v.end()), v.end());\n return *this;\n }\n} Uniq;\nint main(void) {\n while (true) {\n int n;\n std::cin >> n;\n if (!n)\n break;\n std::vector<int> a(n);\n for (auto &e : a) std::cin >> e;\n Dec >> a;\n int ans = n;\n for (int i = 0; i < n; ++i) {\n auto b = a;\n for (int j = 0; j < 3; ++j) {\n if (a[i] == j)\n continue;\n b[i] = j;\n auto v = run_length_encoding(b);\n std::stack<std::pair<int, int>> st;\n for (auto p : v) {\n if (p.second >= 4)\n continue;\n if (!st.empty() && st.top().first == p.first && st.top().second + p.second >= 4)\n st.pop();\n else\n st.emplace(p);\n }\n int sum = 0;\n while (!st.empty()) {\n sum += st.top().second;\n st.pop();\n }\n ans = std::min(ans, sum);\n }\n }\n std::cout << ans << '\\n';\n }\n return 0;\n}", "accuracy": 1, "time_ms": 690, "memory_kb": 3712, "score_of_the_acc": -0.7653, "final_rank": 11 }, { "submission_id": "aoj_0534_10508629", "code_snippet": "// competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/problems/0534\n#include <algorithm>\n#include <iostream>\n#include <iterator>\n#include <vector>\n#include <type_traits>\n#include <utility>\n/// @brief ランレングス圧縮\ntemplate <class Container>\nauto run_length_encoding(const Container &v) {\n std::vector<std::pair<std::decay_t<decltype(*v.begin())>, int>> res;\n for (auto &&e : v) {\n if (res.empty() || res.back().first != e) res.emplace_back(e, 1);\n else ++res.back().second;\n }\n return res;\n}\n#ifdef ATCODER\n#pragma GCC target(\"sse4.2,avx512f,avx512dq,avx512ifma,avx512cd,avx512bw,avx512vl,bmi2\")\n#endif\n#pragma GCC optimize(\"Ofast,fast-math,unroll-all-loops\")\n#include <bits/stdc++.h>\n#ifndef ATCODER\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#endif\ntemplate <class T, class U>\nconstexpr bool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nconstexpr bool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = 3.14159265358979323846;\nstruct increment_impl {\n template <class T>\n const increment_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) ++x;\n return *this;\n }\n} Inc;\nstruct decrement_impl {\n template <class T>\n const decrement_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) --x;\n return *this;\n }\n} Dec;\nstruct sort_impl {\n template <class T>\n const sort_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n return *this;\n }\n} Sort;\nstruct unique_impl {\n template <class T>\n const unique_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n v.erase(std::unique(v.begin(), v.end()), v.end());\n return *this;\n }\n} Uniq;\nint main(void) {\n while (true) {\n int n;\n std::cin >> n;\n if (!n)\n break;\n std::vector<int> a(n);\n std::copy_n(std::istream_iterator<int>(std::cin), n, std::begin(a));\n Dec >> a;\n int ans = n;\n for (int i = 0; i < n; ++i) {\n auto b = a;\n for (int j = 0; j < 3; ++j) {\n if (a[i] == j)\n continue;\n b[i] = j;\n auto v = run_length_encoding(b);\n std::stack<std::pair<int, int>> st;\n for (auto p : v) {\n if (p.second >= 4)\n continue;\n if (!st.empty() && st.top().first == p.first && st.top().second + p.second >= 4)\n st.pop();\n else\n st.emplace(p);\n }\n int sum = 0;\n while (!st.empty()) {\n sum += st.top().second;\n st.pop();\n }\n chmin(ans, sum);\n }\n }\n std::cout << ans << '\\n';\n }\n return 0;\n}", "accuracy": 1, "time_ms": 600, "memory_kb": 3712, "score_of_the_acc": -0.6653, "final_rank": 10 }, { "submission_id": "aoj_0534_9030803", "code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n if (x < 0) { cout << (i64)(x); }\n else { cout << (u64)(x); }\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll N;\n cin >> N;\n if (N == 0) return 1;\n string S(N, '0');\n rep(i, N) {\n ll c;\n cin >> c;\n S[i] += c;\n }\n static unordered_map<string,ll> mem;\n mem[\"\"] = 0;\n auto dfs = [&](auto self, string T) -> ll {\n if (mem.count(T)) return mem[T];\n ll M = len(T);\n ll cnt = 1;\n char prev = T[0];\n string U;\n bool removed = false;\n rep(i, 1, M+1) {\n if ((i == M) or (prev != T[i])) {\n if (cnt >= 4) {\n removed = true;\n U += T.substr(i, M);\n break;\n }\n U += T.substr(i-cnt, cnt);\n cnt = 1;\n prev = T[i];\n } else {\n cnt++;\n }\n }\n if (removed) {\n mem[T] = self(self, U);\n } else {\n mem[T] = len(T);\n }\n return mem[T];\n };\n ll ans = N;\n rep(i, N) {\n rep(k, 1, 3+1) {\n char c = char('0'+k);\n if (S[i] == c) continue;\n ll l=i, r=i;\n rrep(j, i) {\n if (c != S[j]) {\n l = j+1;\n break;\n }\n }\n rep(j, i+1, N) {\n if (c != S[j]) {\n r = j-1;\n break;\n }\n }\n ll cnt = r-l+1;\n if (cnt >= 4) {\n string T = S.substr(0, l) + S.substr(r+1, N);\n chmin(ans, dfs(dfs, T));\n }\n }\n }\n print(ans);\n return 0;\n}", "accuracy": 1, "time_ms": 370, "memory_kb": 69048, "score_of_the_acc": -1.4, "final_rank": 20 }, { "submission_id": "aoj_0534_8313518", "code_snippet": "#line 1 \"a.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/problems/0534\"\n#line 2 \"/home/kuhaku/home/github/algo/lib/template/template.hpp\"\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\ntemplate <class T, class U>\nbool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nbool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr int MOD = 1000000007;\nconstexpr int MOD_N = 998244353;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = M_PI;\n#line 2 \"/home/kuhaku/home/github/algo/lib/algorithm/rle.hpp\"\n\ntemplate <class Container>\nauto run_length_encoding(const Container &a) {\n std::vector<std::pair<std::decay_t<decltype(a[0])>, int>> res;\n for (auto &&e : a) {\n if (res.empty() || res.back().first != e) res.emplace_back(e, 1);\n else ++res.back().second;\n }\n return res;\n}\n#line 3 \"/home/kuhaku/home/github/algo/lib/template/macro.hpp\"\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\n#line 3 \"/home/kuhaku/home/github/algo/lib/template/sonic.hpp\"\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n }\n\n constexpr void operator()() const {}\n} sonic;\n#line 5 \"/home/kuhaku/home/github/algo/lib/template/atcoder.hpp\"\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) {\n os << (it == v.begin() ? \"\" : \" \") << *it;\n }\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\ntemplate <typename T, typename... Args>\nauto make_vector(T x, int arg, Args... args) {\n if constexpr (sizeof...(args) == 0) return std::vector<T>(arg, x);\n else return std::vector(arg, make_vector<T>(x, args...));\n}\nvoid setp(int n) {\n std::cout << std::fixed << std::setprecision(n);\n}\nvoid Yes(bool is_correct = true) {\n std::cout << (is_correct ? \"Yes\" : \"No\") << '\\n';\n}\nvoid No(bool is_not_correct = true) {\n Yes(!is_not_correct);\n}\nvoid YES(bool is_correct = true) {\n std::cout << (is_correct ? \"YES\" : \"NO\") << '\\n';\n}\nvoid NO(bool is_not_correct = true) {\n YES(!is_not_correct);\n}\nvoid Takahashi(bool is_correct = true) {\n std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n';\n}\nvoid Aoki(bool is_not_correct = true) {\n Takahashi(!is_not_correct);\n}\n#line 3 \"/home/kuhaku/home/github/algo/lib/template/vector.hpp\"\n\nstruct increment_impl {\n template <class T>\n const increment_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) ++x;\n return *this;\n }\n} Inc;\n\nstruct decrement_impl {\n template <class T>\n const decrement_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) --x;\n return *this;\n }\n} Dec;\n\nstruct sort_impl {\n template <class T>\n const sort_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n return *this;\n }\n} Sort;\n\nstruct unique_impl {\n template <class T>\n const unique_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n v.erase(std::unique(v.begin(), v.end()), v.end());\n return *this;\n }\n} Uniq;\n#line 5 \"a.cpp\"\n\nint main(void) {\n while (true) {\n int n;\n cin >> n;\n if (!n)\n break;\n vector<int> a(n);\n cin >> a;\n Dec >> a;\n int ans = n;\n rep (i, n) {\n auto b = a;\n rep (j, 3) {\n if (a[i] == j)\n continue;\n b[i] = j;\n auto v = run_length_encoding(b);\n stack<pair<int, int>> st;\n for (auto p : v) {\n if (p.second >= 4)\n continue;\n if (!st.empty() && st.top().first == p.first && st.top().second + p.second >= 4)\n st.pop();\n else\n st.emplace(p);\n }\n int sum = 0;\n while (!st.empty()) {\n sum += st.top().second;\n st.pop();\n }\n chmin(ans, sum);\n }\n }\n co(ans);\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 910, "memory_kb": 3528, "score_of_the_acc": -1.0069, "final_rank": 17 }, { "submission_id": "aoj_0534_8313510", "code_snippet": "#line 1 \"a.cpp\"\n#define PROBLEM \"\"\n#line 2 \"/home/kuhaku/home/github/algo/lib/template/template.hpp\"\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\ntemplate <class T, class U>\nbool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nbool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr int MOD = 1000000007;\nconstexpr int MOD_N = 998244353;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = M_PI;\n#line 2 \"/home/kuhaku/home/github/algo/lib/algorithm/rle.hpp\"\n\ntemplate <class Container>\nauto run_length_encoding(const Container &a) {\n std::vector<std::pair<std::decay_t<decltype(a[0])>, int>> res;\n for (auto &&e : a) {\n if (res.empty() || res.back().first != e) res.emplace_back(e, 1);\n else ++res.back().second;\n }\n return res;\n}\n#line 3 \"/home/kuhaku/home/github/algo/lib/template/macro.hpp\"\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\n#line 3 \"/home/kuhaku/home/github/algo/lib/template/sonic.hpp\"\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n }\n\n constexpr void operator()() const {}\n} sonic;\n#line 5 \"/home/kuhaku/home/github/algo/lib/template/atcoder.hpp\"\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) {\n os << (it == v.begin() ? \"\" : \" \") << *it;\n }\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\ntemplate <typename T, typename... Args>\nauto make_vector(T x, int arg, Args... args) {\n if constexpr (sizeof...(args) == 0) return std::vector<T>(arg, x);\n else return std::vector(arg, make_vector<T>(x, args...));\n}\nvoid setp(int n) {\n std::cout << std::fixed << std::setprecision(n);\n}\nvoid Yes(bool is_correct = true) {\n std::cout << (is_correct ? \"Yes\" : \"No\") << '\\n';\n}\nvoid No(bool is_not_correct = true) {\n Yes(!is_not_correct);\n}\nvoid YES(bool is_correct = true) {\n std::cout << (is_correct ? \"YES\" : \"NO\") << '\\n';\n}\nvoid NO(bool is_not_correct = true) {\n YES(!is_not_correct);\n}\nvoid Takahashi(bool is_correct = true) {\n std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n';\n}\nvoid Aoki(bool is_not_correct = true) {\n Takahashi(!is_not_correct);\n}\n#line 3 \"/home/kuhaku/home/github/algo/lib/template/vector.hpp\"\n\nstruct increment_impl {\n template <class T>\n const increment_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) ++x;\n return *this;\n }\n} Inc;\n\nstruct decrement_impl {\n template <class T>\n const decrement_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) --x;\n return *this;\n }\n} Dec;\n\nstruct sort_impl {\n template <class T>\n const sort_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n return *this;\n }\n} Sort;\n\nstruct unique_impl {\n template <class T>\n const unique_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n v.erase(std::unique(v.begin(), v.end()), v.end());\n return *this;\n }\n} Uniq;\n#line 5 \"a.cpp\"\n\nint main(void) {\n while (true) {\n int n;\n cin >> n;\n if (!n)\n break;\n vector<int> a(n);\n cin >> a;\n Dec >> a;\n int ans = n;\n rep (i, n) {\n rep (j, 3) {\n if (a[i] == j)\n continue;\n auto b = a;\n b[i] = j;\n auto v = run_length_encoding(b);\n stack<pair<int, int>> st;\n for (auto p : v) {\n if (p.second >= 4)\n continue;\n if (!st.empty() && st.top().first == p.first &&\n st.top().second + p.second >= 4) {\n st.pop();\n } else {\n st.emplace(p);\n }\n }\n int sum = 0;\n while (!st.empty()) {\n sum += st.top().second;\n st.pop();\n }\n chmin(ans, sum);\n }\n }\n co(ans);\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 910, "memory_kb": 3696, "score_of_the_acc": -1.0095, "final_rank": 19 }, { "submission_id": "aoj_0534_8313457", "code_snippet": "#line 1 \"a.cpp\"\n#define PROBLEM \"\"\n#line 2 \"/home/kuhaku/home/github/algo/lib/template/template.hpp\"\n#pragma GCC target(\"sse4.2,avx2,bmi2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\ntemplate <class T, class U>\nbool chmax(T &a, const U &b) {\n return a < (T)b ? a = (T)b, true : false;\n}\ntemplate <class T, class U>\nbool chmin(T &a, const U &b) {\n return (T)b < a ? a = (T)b, true : false;\n}\nconstexpr std::int64_t INF = 1000000000000000003;\nconstexpr int Inf = 1000000003;\nconstexpr int MOD = 1000000007;\nconstexpr int MOD_N = 998244353;\nconstexpr double EPS = 1e-7;\nconstexpr double PI = M_PI;\n#line 2 \"/home/kuhaku/home/github/algo/lib/algorithm/rle.hpp\"\n\ntemplate <class Container>\nauto run_length_encoding(const Container &a) {\n std::vector<std::pair<std::decay_t<decltype(a[0])>, int>> res;\n for (auto &&e : a) {\n if (res.empty() || res.back().first != e) res.emplace_back(e, 1);\n else ++res.back().second;\n }\n return res;\n}\n#line 3 \"/home/kuhaku/home/github/algo/lib/template/macro.hpp\"\n#define FOR(i, m, n) for (int i = (m); i < int(n); ++i)\n#define FORR(i, m, n) for (int i = (m)-1; i >= int(n); --i)\n#define FORL(i, m, n) for (int64_t i = (m); i < int64_t(n); ++i)\n#define rep(i, n) FOR (i, 0, n)\n#define repn(i, n) FOR (i, 1, n + 1)\n#define repr(i, n) FORR (i, n, 0)\n#define repnr(i, n) FORR (i, n + 1, 1)\n#define all(s) (s).begin(), (s).end()\n#line 3 \"/home/kuhaku/home/github/algo/lib/template/sonic.hpp\"\nstruct Sonic {\n Sonic() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n }\n\n constexpr void operator()() const {}\n} sonic;\n#line 5 \"/home/kuhaku/home/github/algo/lib/template/atcoder.hpp\"\nusing namespace std;\nusing ll = std::int64_t;\nusing ld = long double;\ntemplate <class T, class U>\nstd::istream &operator>>(std::istream &is, std::pair<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nstd::istream &operator>>(std::istream &is, std::vector<T> &v) {\n for (T &i : v) is >> i;\n return is;\n}\ntemplate <class T, class U>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {\n return os << '(' << p.first << ',' << p.second << ')';\n}\ntemplate <class T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &v) {\n for (auto it = v.begin(); it != v.end(); ++it) {\n os << (it == v.begin() ? \"\" : \" \") << *it;\n }\n return os;\n}\ntemplate <class Head, class... Tail>\nvoid co(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cout << head << '\\n';\n else std::cout << head << ' ', co(std::forward<Tail>(tail)...);\n}\ntemplate <class Head, class... Tail>\nvoid ce(Head &&head, Tail &&...tail) {\n if constexpr (sizeof...(tail) == 0) std::cerr << head << '\\n';\n else std::cerr << head << ' ', ce(std::forward<Tail>(tail)...);\n}\ntemplate <typename T, typename... Args>\nauto make_vector(T x, int arg, Args... args) {\n if constexpr (sizeof...(args) == 0) return std::vector<T>(arg, x);\n else return std::vector(arg, make_vector<T>(x, args...));\n}\nvoid setp(int n) {\n std::cout << std::fixed << std::setprecision(n);\n}\nvoid Yes(bool is_correct = true) {\n std::cout << (is_correct ? \"Yes\" : \"No\") << '\\n';\n}\nvoid No(bool is_not_correct = true) {\n Yes(!is_not_correct);\n}\nvoid YES(bool is_correct = true) {\n std::cout << (is_correct ? \"YES\" : \"NO\") << '\\n';\n}\nvoid NO(bool is_not_correct = true) {\n YES(!is_not_correct);\n}\nvoid Takahashi(bool is_correct = true) {\n std::cout << (is_correct ? \"Takahashi\" : \"Aoki\") << '\\n';\n}\nvoid Aoki(bool is_not_correct = true) {\n Takahashi(!is_not_correct);\n}\n#line 3 \"/home/kuhaku/home/github/algo/lib/template/vector.hpp\"\n\nstruct increment_impl {\n template <class T>\n const increment_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) ++x;\n return *this;\n }\n} Inc;\n\nstruct decrement_impl {\n template <class T>\n const decrement_impl &operator>>(std::vector<T> &v) const {\n for (auto &x : v) --x;\n return *this;\n }\n} Dec;\n\nstruct sort_impl {\n template <class T>\n const sort_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n return *this;\n }\n} Sort;\n\nstruct unique_impl {\n template <class T>\n const unique_impl &operator>>(std::vector<T> &v) const {\n std::sort(v.begin(), v.end());\n v.erase(std::unique(v.begin(), v.end()), v.end());\n return *this;\n }\n} Uniq;\n#line 5 \"a.cpp\"\n\nint main(void) {\n while (true) {\n int n;\n cin >> n;\n if (!n)\n break;\n vector<int> a(n);\n cin >> a;\n Dec >> a;\n int ans = n;\n rep (i, n) {\n rep (j, 3) {\n if (a[i] == j)\n continue;\n auto b = a;\n b[i] = j;\n auto v = run_length_encoding(b);\n stack<pair<int, int>> st;\n for (auto p : v) {\n if (p.second >= 4)\n continue;\n if (!st.empty() && st.top().first == p.first &&\n st.top().second + p.second >= 4) {\n st.pop();\n } else {\n st.emplace(p);\n }\n }\n int sum = 0;\n while (!st.empty()) {\n sum += st.top().second;\n st.pop();\n }\n chmin(ans, sum);\n }\n }\n co(ans);\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 910, "memory_kb": 3600, "score_of_the_acc": -1.008, "final_rank": 18 }, { "submission_id": "aoj_0534_6444835", "code_snippet": "//Source.cpp\n//いつもの\n#ifdef LOCAL\n#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<unordered_set>\n#include<unordered_map>\n#include<list>\n#include<array>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<climits>\n#include<iomanip>\n#include<cctype>\n#include<sstream>\n#include<regex>\n#include<bitset>\n#include<random>\n#include<complex>\n#include<cassert>\n#else\n#include<bits/stdc++.h>\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#ifdef ONLINE_JUDGE\n#include<atcoder/all>\nusing namespace atcoder;\n#else\n#define gcd __gcd\n#define lcm __detail::__lcm\n#endif\n#endif\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\n#ifdef LOCAL\n//*\n#include<atcoder/all>\nusing namespace atcoder;\n//*/\nunsigned popcount(unsigned x){\n\treturn __popcnt(x);\n}\nunsigned popcountll(ull x){\n\treturn __popcnt64(x);\n}\nunsigned parity(unsigned x){\n\treturn popcount(x)%2;\n}\nunsigned parityll(ull x){\n\treturn popcountll(x)%2;\n}\nunsigned clz(unsigned x){\n\tif(x==0)\n\t\tthrow;\n\tunsigned cnt=__lzcnt(x);\n\treturn cnt;\n}\nunsigned clzll(ull x){\n\tif(x==0)\n\t\tthrow;\n\tunsigned cnt=__lzcnt64(x);\n\treturn cnt;\n}\nunsigned ctz(unsigned x){\n\tif(x==0)\n\t\tthrow;\n\tx&=~x+1;\n\tunsigned cnt=0;\n\tif(x&0xffff0000)\n\t\tcnt|=16;\n\tif(x&0xff00ff00)\n\t\tcnt|=8;\n\tif(x&0xf0f0f0f0)\n\t\tcnt|=4;\n\tif(x&0xcccccccc)\n\t\tcnt|=2;\n\tif(x&0xaaaaaaaa)\n\t\tcnt|=1;\n\treturn cnt;\n}\nunsigned ctzll(ull x){\n\tif(x==0)\n\t\tthrow;\n\tx&=~x+1;\n\tunsigned cnt=0;\n\tif(x&0xffffffff00000000)\n\t\tcnt|=32;\n\tif(x&0xffff0000ffff0000)\n\t\tcnt|=16;\n\tif(x&0xff00ff00ff00ff00)\n\t\tcnt|=8;\n\tif(x&0xf0f0f0f0f0f0f0f0)\n\t\tcnt|=4;\n\tif(x&0xcccccccccccccccc)\n\t\tcnt|=2;\n\tif(x&0xaaaaaaaaaaaaaaaa)\n\t\tcnt|=1;\n\treturn cnt;\n}\nunsigned ffs(unsigned x){\n\tif(x==0)\n\t\treturn 0;\n\treturn ctz(x)+1;\n}\nunsigned ffsll(ull x){\n\tif(x==0)\n\t\treturn 0;\n\treturn ctzll(x)+1;\n}\n#define __builtin_popcount popcount\n#define __builtin_popcountll popcountll\n#define __builtin_parity parity\n#define __builtin_parityll parityll\n#define __builtin_clz clz\n#define __builtin_clzll clzll\n#define __builtin_ctz ctz\n#define __builtin_ctzll ctzll\n#define __builtin_ffs ffs\n#define __builtin_ffsll ffsll\n#endif\nconstexpr int mod=1e9+7;\nconstexpr int Mod=998244353;\nconstexpr int inf=mod;\nconstexpr ll linf=(ll)mod*mod;\nstruct fastio{\n\tfastio(){\n\t\tcin.tie(0);\n\t\tios::sync_with_stdio(0);\n\t\tcout<<fixed<<setprecision(20);\n\t};\n}fio;\ntemplate<class T>\nbool chmax(T&a,const T&b){\n\tif(a<b){\n\t\ta=b;\n\t\treturn 1;\n\t}\n\treturn 0;\n}\ntemplate<class T>\nbool chmin(T&a,const T&b){\n\tif(a>b){\n\t\ta=b;\n\t\treturn 1;\n\t}\n\treturn 0;\n}\nint main(){\n\tint n,c[10000];\n\twhile(cin>>n,n){\n\t\tfor(int i=0;i<n;i++)\n\t\t\tcin>>c[i],--c[i];\n\t\tint ans=n;\n\t\tfor(int i=0;i<n;i++){\n\t\t\tfor(int j=0;j<3;j++){\n\t\t\t\tif(c[i]==j)\n\t\t\t\t\tcontinue;\n\t\t\t\tdeque<int>d1(c,c+i),d2(c+i,c+n);\n\t\t\t\td2[0]=j;\n\t\t\t\twhile(d2.size()){\n\t\t\t\t\tint cnt1,cnt2;\n\t\t\t\t\tfor(cnt1=0;cnt1<d1.size()&&d1[d1.size()-1-cnt1]==d2[0];cnt1++);\n\t\t\t\t\tfor(cnt2=0;cnt2<d2.size()&&d2[cnt2]==d2[0];cnt2++);\n\t\t\t\t\tif(cnt1+cnt2>=4){\n\t\t\t\t\t\tfor(int k=0;k<cnt1;k++)\n\t\t\t\t\t\t\td1.pop_back();\n\t\t\t\t\t\tfor(int k=0;k<cnt2;k++)\n\t\t\t\t\t\t\td2.pop_front();\n\t\t\t\t\t} else\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tchmin(ans,int(d1.size()+d2.size()));\n\t\t\t}\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 3552, "score_of_the_acc": -0.0739, "final_rank": 8 }, { "submission_id": "aoj_0534_5933069", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\ntypedef long long ll;\ntypedef pair<long long, long long> P;\nconst long long INF = 1e18;\nconst ll MOD = INF;\ntemplate <typename T>\nvoid input_arr(vector<T>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i];\n\t}\n}\ntemplate <typename T, typename Q>\nvoid input_arr(vector<pair<T, Q>>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i].first >> A[i].second;\n\t}\n}\ntemplate <typename T>\nvoid input_arr(vector<vector<T>>& A, ll H, ll W) {\n\tfor (ll i = 0; i < H; i++) {\n\t\tfor (ll j = 0; j < W; j++) {\n\t\t\tcin >> A[i][j];\n\t\t}\n\t}\n}\nvector<P> RLE(vector<ll>&A) {\n\tll N = (ll)A.size();\n\tvector<P>B; B.push_back(make_pair(A[0], 1));\n\tfor (ll i = 1; i < N; i++) {\n\t\tif (A[i] != A[i - 1]) {\n\t\t\tB.push_back(make_pair(A[i], 1));\n\t\t}\n\t\telse B.back().second++;\n\t}\n\treturn B;\n}\nint main() {\n\tll N; cin >> N;\n\twhile (N != 0) {\n\tvector<ll>A(N); input_arr(A, N);\n\tvector<P>B = RLE(A);\n\tvector<P>pos;\n\tll num = -1;\n\tfor (ll i = 0; i < B.size(); i++) {\n\t\tif (B[i].second != 3) {\n\t\t\tnum += B[i].second;\n\t\t\tcontinue;\n\t\t}\n\t\tif (i != 0) pos.push_back({num, B[i].first});\n\t\tif (i != B.size() - 1) pos.push_back({num + 4, B[i].first});\n\t\tnum += 3;\n\t}\n\tll ans = 0;\n\tfor (ll k = 0; k < pos.size(); k++) {\n\t\tvector<ll>D = A;\n\t\tD[pos[k].first] = pos[k].second;\n\t\tvector<P>C = RLE(D);\n\t\tll pos = 0;\n\t\tfor (ll i = 0; i < C.size(); i++) {\n\t\t\tif (C[i].second >= 4) {\n\t\t\t\tpos = i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tll m = 1, sum = C[pos].second;\n\t\twhile (pos - m >= 0 && pos + m < C.size()) {\n\t\t\tif (C[pos - m].first == C[pos + m].first && C[pos - m].second + C[pos + m].second >= 4) {\n\t\t\t\tsum += C[pos - m].second + C[pos + m].second;\n\t\t\t}\n\t\t\telse break;\n\t\t\tm++;\n\t\t}\n\t\tans = max(ans, sum);\n\t}\n\tcout << N - ans << endl;\n\tcin >> N;\n\t}\n}", "accuracy": 1, "time_ms": 160, "memory_kb": 3752, "score_of_the_acc": -0.177, "final_rank": 9 }, { "submission_id": "aoj_0534_5734789", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\nstatic const int INF = 1e9;\n\nint erace(int n, vector<int> v, int idx, int c) {\n\tint n_tmp = n;\n\tint l = idx;\n\tint r = idx + 1;\n\tint color = c;\n\twhile (1) {\n\t\tint cnt = 0;\n\t\twhile (0 <= l && v[l] == color) {\n\t\t\tcnt++;\n\t\t\tl--;\n\t\t}\n\t\twhile (r < n && v[r] == color) {\n\t\t\tcnt++;\n\t\t\tr++;\n\t\t}\n\t\tif (cnt >= 4) {\n\t\t\tn_tmp -= cnt;\n\t\t\tif (0 <= l && r < n && v[l] == v[r]) {\n\t\t\t\tcolor = v[l];\n\t\t\t}\n\t\t\telse break;\n\t\t}\n\t\telse {\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn n_tmp;\n}\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (1) {\n\t\tint n;\n\t\tcin >> n;\n\t\tif (n == 0) return 0;\n\t\tvector<int> v(n);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> v[i];\n\t\t}\n\t\tint ans = INF;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint tmp = v[i];\n\t\t\tfor (int j = 1; j < 4; j++) {\n\t\t\t\tif (tmp == j) continue;\n\t\t\t\tv[i] = j;\n\t\t\t\tans = min(ans, erace(n, v, i, j));\n\t\t\t}\n\t\t\tv[i] = tmp;\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3072, "score_of_the_acc": -0.0222, "final_rank": 2 }, { "submission_id": "aoj_0534_5734787", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\nstatic const int INF = 1e9;\n\nint erace(int n, vector<int> v, int num, int c) {\n\tint n_tmp = n;\n\tint l = num;\n\tint r = num + 1;\n\tint color = c;\n\twhile (1) {\n\t\tint cnt = 0;\n\t\twhile (0 <= l && v[l] == color) {\n\t\t\tcnt++;\n\t\t\tl--;\n\t\t}\n\t\twhile (r < n && v[r] == color) {\n\t\t\tcnt++;\n\t\t\tr++;\n\t\t}\n\t\tif (cnt >= 4) {\n\t\t\tn_tmp -= cnt;\n\t\t\tif (v[l] == v[r]) {\n\t\t\t\tcolor = v[l];\n\t\t\t}\n\t\t\telse break;\n\t\t}\n\t\telse {\n\t\t\tbreak;\n\t\t}\n\t}\n\treturn n_tmp;\n}\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (1) {\n\t\tint n;\n\t\tcin >> n;\n\t\tif (n == 0) return 0;\n\t\tvector<int> v(n);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> v[i];\n\t\t}\n\t\tint ans = INF;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tint tmp = v[i];\n\t\t\tfor (int j = 1; j < 4; j++) {\n\t\t\t\tif (tmp == j) continue;\n\t\t\t\tv[i] = j;\n\t\t\t\tans = min(ans, erace(n, v, i, j));\n\t\t\t}\n\t\t\tv[i] = tmp;\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3184, "score_of_the_acc": -0.0239, "final_rank": 5 }, { "submission_id": "aoj_0534_5734785", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\nstatic const int INF = 1e9;\n\nint erace(int n, vector<int> v, int num, int c) {//ボールの個数　ボール（数字）の配列　色を変えた場所 変えた色の番号\n\tint n_tmp = n;//残っているボールの番号\n\tint l = num;//色変えた場所の番号\n\tint r = num + 1;\n\tint color = c;//変えた場所の数字の番号（色）\n\twhile (1) {\n\t\tint cnt = 0;//同じ数字が連続している数\n\t\t//左側に何個同じ色が連続しているか\n\t\twhile (0 <= l && v[l] == color) {\n\t\t\tcnt++;\n\t\t\tl--;//左端を伸ばす\n\t\t}\n\t\t//右側に何個同じ色が連続しているか\n\t\twhile (r < n && v[r] == color) {\n\t\t\tcnt++;\n\t\t\tr++;//右端を伸ばす\n\t\t}\n\t\tif (cnt >= 4) {\n\t\t\tn_tmp -= cnt;//連続した数の分を消す\n\t\t\tif (v[l] == v[r]) {\n\t\t\t\tcolor = v[l];//次に消える色を更新する\n\t\t\t}\n\t\t\telse break;//消した後の両サイドが同じ色でなければ、それ以上消えることはない\n\t\t}\n\t\telse {\n\t\t\tbreak;//４つ消えなければ、それ以上消えることはない\n\t\t}\n\t}\n\treturn n_tmp;\n}\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (1) {\n\t\tint n;\n\t\tcin >> n;\n\t\tif (n == 0) return 0;\n\t\tvector<int> v(n);\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tcin >> v[i];\n\t\t}\n\t\tint ans = INF;//初期化\n\t\t//全探索\n\t\tfor (int i = 0; i < n; i++) {//色を変えるとこの番号\n\t\t\tint tmp = v[i];\n\t\t\t//色を変える\n\t\t\tfor (int j = 1; j < 4; j++) {//色を変える\n\t\t\t\tif (tmp == j) continue;\n\t\t\t\tv[i] = j;\n\t\t\t\tans = min(ans, erace(n, v, i, j));\n\t\t\t}\n\t\t\tv[i] = tmp;//ボールの色を元に戻す\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3156, "score_of_the_acc": -0.0235, "final_rank": 4 }, { "submission_id": "aoj_0534_5734784", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\nstatic const int INF = 1e9;\n\nint erace(int n, vector<int> v, int num, int c){//ボールの個数　ボール（数字）の配列　色を変えた場所 変えた色の番号\n int n_tmp = n;//残っているボールの番号\n int l = num;//色変えた場所の番号\n int r = num + 1;\n int color = c;//変えた場所の数字の番号（色）\n while(1){\n int cnt = 0;//同じ数字が連続している数\n //左側に何個同じ色が連続しているか\n while(0 <= l && v[l] == color){\n cnt++;\n l--;//左端を伸ばす\n }\n //右側に何個同じ色が連続しているか\n while(r < n && v[r] == color){\n cnt++;\n r++;//右端を伸ばす\n }\n if(cnt >= 4){\n n_tmp -= cnt;//連続した数の分を消す\n if(v[l] == v[r]){\n color = v[l];//次に消える色を更新する\n }\n else break;//消した後の両サイドが同じ色でなければ、それ以上消えることはない\n }else{\n break;//４つ消えなければ、それ以上消えることはない\n }\n }\n return n_tmp;\n}\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\t\n while(1){\n int n; \n cin >> n;\n if(n == 0) return 0;\n vector<int> v(n);\n rep(i, n) {\n cin >> v[i];\n }\n int ans = INF;//初期化\n //全探索\n rep(i, n){//色を変えるとこの番号\n int tmp = v[i];\n //色を変える\n reps(j, 1, 4){//色を変える\n if(tmp == j) continue;\n v[i] = j;\n ans = min(ans, erace(n, v, i, j));\n }\n v[i] = tmp;//ボールの色を元に戻す\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3152, "score_of_the_acc": -0.0234, "final_rank": 3 }, { "submission_id": "aoj_0534_5734781", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <algorithm>\n#include <vector>\nusing namespace std;\n\n#define rep(i,n) for(int i=0;i<(n);i++)\n#define reps(i,f,n) for(int i=(f);i<(n);i++)\nstatic const int INF = 1e9;\n\nint erace(int n, vector<int> v, int num, int c){//ボールの個数　ボール（数字）の配列　色を変えた場所 変えた色の番号\n int n_tmp = n;//残っているボールの番号\n int l = num;//色変えた場所の番号\n int r = num + 1;\n int color = c;//変えた場所の数字の番号（色）\n while(1){\n int cnt = 0;//同じ数字が連続している数\n //左側に何個同じ色が連続しているか\n while(0 <= l && v[l] == color){\n cnt++;\n l--;//左端を伸ばす\n }\n //右側に何個同じ色が連続しているか\n while(r < n && v[r] == color){\n cnt++;\n r++;//右端を伸ばす\n }\n if(cnt >= 4){\n n_tmp -= cnt;//連続した数の分を消す\n if(v[l] == v[r]){\n color = v[l];//次に消える色を更新する\n }\n else break;//消した後の両サイドが同じ色でなければ、それ以上消えることはない\n }else{\n break;//４つ消えなければ、それ以上消えることはない\n }\n }\n return n_tmp;\n}\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\t\n while(1){\n int n; \n cin >> n;\n if(n == 0) return 0;\n vector<int> v(n);\n rep(i, n) {\n cin >> v[i];\n }\n int ans = INF;//初期化\n //全探索\n rep(i, n){//色を変えるとこの番号\n int tmp = v[i];\n //色を変える\n reps(j, 1, 4){//色を変える\n if(tmp == j) continue;\n v[i] = j;\n ans = min(ans, erace(n, v, i, j));\n }\n v[i] = tmp;//ボールの色を元に戻す\n }\n printf(\"%d\\n\", ans);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3340, "score_of_the_acc": -0.0263, "final_rank": 7 }, { "submission_id": "aoj_0534_5484179", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\ntemplate<typename T>\nvector<pair<T, int>> run_length_encode(vector<T> &vec){\n vector<pair<T, int>> res;\n for(const T& a: vec){\n if(res.empty() or res.back().first!=a){\n res.emplace_back(a, 0);\n }\n res.back().second++;\n }\n return res;\n}\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n == 0) break;\n \n vector<int> a(n);\n for(int &i: a){\n cin >> i;\n }\n int ans = n;\n for(int i=0; i<n; i++){\n int tmp = a[i];\n vector<int> ch;\n if(i > 0){\n ch.push_back(a[i-1]);\n }\n if(i < n-1){\n ch.push_back(a[i+1]);\n }\n if(ch.size()==2u and ch[0]==ch[1]){\n ch.pop_back();\n }\n for(int j: ch){\n a[i] = j;\n auto b = run_length_encode(a);\n vector<pair<int,int>> c;\n c.reserve(b.size());\n for(auto p: b){\n if(!c.empty() and c.back().first==p.first){\n c.back().second += p.second;\n }else{\n c.push_back(p);\n }\n while(!c.empty() and c.back().second >= 4){\n c.pop_back();\n }\n }\n int sub = 0;\n for(auto p: c){\n sub += p.second;\n }\n ans = min(ans, sub);\n }\n a[i] = tmp;\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 820, "memory_kb": 3344, "score_of_the_acc": -0.9041, "final_rank": 15 }, { "submission_id": "aoj_0534_5044568", "code_snippet": "#include<iostream>\n\nusing namespace std;\n\nint main()\n{\n\tint N;\n\tcin >> N;\n\twhile (N)\n\t{\n\t\tint* a = new int[N + 2];\n\t\ta[0] = 0;\n\t\ta[N + 1] = 9;\n\t\tfor (int i = 1; i <= N; i++)\n\t\t\tcin >> a[i];\n\t\tint* tmp = new int[N + 2];\n\t\tint ans = 0;\n\t\tfor (int i = 1; i <= N; i++)\n\t\t{\n\t\t\tfor (int j = 1; j <= 2; j++)\n\t\t\t{\n\t\t\t\tint _ans = 0;\n\t\t\t\tcopy(a, a + N + 2, tmp);\n\t\t\t\tint color = a[i] + j;\n\t\t\t\tif (color > 3) color -= 3;\n\t\t\t\ttmp[i] = color;\n\t\t\t\tint up = i, down = i - 1;\n\t\t\t\twhile (true)\n\t\t\t\t{\n\t\t\t\t\tint counter = 0;\n\t\t\t\t\twhile (tmp[up] == color) { up++; counter++; }\n\t\t\t\t\twhile (tmp[down] == color) { down--; counter++; }\n\t\t\t\t\tif (counter < 4)\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t_ans += counter;\n\t\t\t\t\tif (tmp[up] != tmp[down]) \n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcolor = tmp[up];\n\t\t\t\t}\n\t\t\t\tans = max(ans, _ans);\n\t\t\t}\n\t\t}\n\t\tans = N - ans;\n\t\tcout << ans << endl;\n\t\tcin >> N;\n\t}\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3196, "score_of_the_acc": -0.0241, "final_rank": 6 }, { "submission_id": "aoj_0534_4557071", "code_snippet": "#include <iostream>\n#include <iomanip>\n#include <cstdlib>\nusing namespace std;\n\nint shoukyo(int*,int);\nint nokori;\nbool check(int*,int);\nvoid hyouji(int*);\n\nint main(){\n\tint a[10000],b[10000];\n\tint n,i,j,k,l;\n\tint chP,chC;\n\tint mini;\n\t\n\twhile(1){\n\t\t\n\t\tcin>>n;\n\t\tif(n==0){break;}\n\t\tnokori=n;\n\t\tfor(i=n-1;i>=0;i--){\n\t\tcin>>b[i];\n\t}\n\t//hyouji(b);\n\t\tmini=n;\n\t\t\n\t\t\n\t\t\n\t\t\n\t\tfor(j=0;j<n-1;j++){\n\t\t\tfor(i=0;i<n;i++){\n\t\t\t\ta[i]=b[i];\n\t\t\t}\n\t\t\n\t\t\tnokori=n;\n\t\t\ta[j]=a[j+1];\n\t\t\tk=1;\n\t\t\twhile(k==1){\n\t\t\t\tif(nokori<4){break;}\n\t\t\t\tfor(int i=0;i<nokori-3;i++){\n\t\t\t\t\tk=check(a,i);\n\t\t\t\t\tif(k==1){i=0;}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(nokori<mini){\n\t\t\t\tmini=nokori;\n\t\t\t}\n\t\t}\n\t\tfor(j=1;j<n;j++){\n\t\t\tfor(i=0;i<n;i++){\n\t\t\t\ta[i]=b[i];\n\t\t\t}\n\t\t\tnokori=n;\n\t\t\ta[j]=a[j-1];\n\t\t\tk=1;\n\t\t\twhile(k==1){\n\t\t\t\tif(nokori<4){break;}\n\t\t\t\tfor(int i=0;i<nokori-3;i++){\n\t\t\t\t\tk=check(a,i);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(nokori<mini){mini=nokori;}\n\t\t}\n\t\tcout<<mini<<endl;\n\t\t\t\t\n\t\n\t}\n\treturn 0;\n}\n\nint shoukyo(int a[],int p){\n\tint k=4;\n\twhile(k+p<nokori&&a[p]==a[k+p]){\n\t\tk++;\n\t}\n\t\n\t\n\tfor(int i=p;i<nokori-k;i++){\n\t\ta[i]=a[i+k];\n\t\t\n\t}\n\tnokori=nokori-k;\n\n\n\t\n\t\n\treturn 0;\n}\n\n\nbool check(int a[],int i){\n\tif(abs(a[i]-a[i+1])+abs(a[i+1]-a[i+2])+abs(a[i+2]-a[i+3])==0){\n\t\t//hyouji(a);\n\t\tshoukyo(a,i);\n\t\treturn 1;\n\t}\n\treturn 0;\n}\n\nvoid hyouji(int a[]){\n\tfor(int i=0;i<nokori;i++){\n\t\tcout<<a[i]<<\" \";\n\t}\n\tcout<<endl;\n\treturn;\n}", "accuracy": 1, "time_ms": 700, "memory_kb": 3088, "score_of_the_acc": -0.7669, "final_rank": 12 }, { "submission_id": "aoj_0534_4479589", "code_snippet": "#include <iostream>\n#include <vector>\n\nstd::vector<std::pair<int, int>> st;\n\nbool solve() {\n int n;\n std::cin >> n;\n if (n == 0) return false;\n\n std::vector<int> cs(n);\n for (auto& c : cs) std::cin >> c;\n\n int ans = n;\n for (int i = 0; i < n; ++i) {\n int pc = cs[i];\n\n for (int nc = 1; nc <= 3; ++nc) {\n if (i != 0 && nc == pc) continue;\n cs[i] = nc;\n\n st.emplace_back(0, 0);\n for (auto c : cs) {\n if (st.back().first != c &&\n st.back().second >= 4) {\n st.pop_back();\n }\n\n if (st.back().first == c) {\n ++st.back().second;\n } else {\n st.emplace_back(c, 1);\n }\n }\n\n if (st.back().second >= 4) st.pop_back();\n\n int ret = 0;\n while (!st.empty()) {\n ret += st.back().second;\n st.pop_back();\n }\n\n ans = std::min(ans, ret);\n }\n cs[i] = pc;\n }\n\n std::cout << ans << \"\\n\";\n return true;\n}\n\nint main() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n while (solve()) {}\n\n return 0;\n}", "accuracy": 1, "time_ms": 860, "memory_kb": 3284, "score_of_the_acc": -0.9477, "final_rank": 16 }, { "submission_id": "aoj_0534_4083948", "code_snippet": "#include <bits/stdc++.h>\n\n// #include <boost/multiprecision/cpp_int.hpp>\n #define int long long\n #define inf 1000000007\n #define pa pair<int,int>\n #define ll long long\n #define pal pair<double,double>\n #define ppap pair<pa,int>\n// #define PI 3.14159265358979323846\n #define paa pair<int,char>\n #define mp make_pair\n #define pb push_back\n #define EPS (1e-10)\n \n int dx[8]={0,-1,0,1,1,1,-1,-1};\n int dy[8]={1,0,-1,0,-1,1,1,-1};\n using namespace std;\n \t\t\tclass pa3{\n \tpublic:\n \tint x,y,z;\n \tpa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}\n \tbool operator < (const pa3 &p) const{\n \t\tif(x!=p.x) return x<p.x;\n \t\tif(y!=p.y) return y<p.y;\n \t\t return z<p.z;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \t\t\t\tbool operator > (const pa3 &p) const{\n \t\tif(x!=p.x) return x>p.x;\n \t\tif(y!=p.y) return y>p.y;\n \t\t return z>p.z;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const pa3 &p) const{\n \t\treturn x==p.x && y==p.y && z==p.z;\n \t}\n \t\tbool operator != (const pa3 &p) const{\n \t\t\treturn !( x==p.x && y==p.y && z==p.z);\n \t}\n \n };\n \n class pa4{\n \tpublic:\n \tdouble x;\n \tint y,z,w;\n \tpa4(double x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}\n \tbool operator < (const pa4 &p) const{\n \t\tif(x!=p.x) return x<p.x;\n \t\tif(y!=p.y) return y<p.y;\n \t\tif(z!=p.z)return z<p.z;\n \t\treturn w<p.w;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator > (const pa4 &p) const{\n \t\tif(x!=p.x) return x>p.x;\n \t\tif(y!=p.y) return y>p.y;\n \t\tif(z!=p.z)return z>p.z;\n \t\treturn w>p.w;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const pa4 &p) const{\n \t\treturn x==p.x && y==p.y && z==p.z &&w==p.w;\n \t}\n \t\t\n \n };\n class pa2{\n \tpublic:\n \tint x,y;\n \tpa2(int x=0,int y=0):x(x),y(y) {}\n \tpa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}\n \tpa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}\n \tbool operator < (const pa2 &p) const{\n \t\treturn y != p.y ? y<p.y: x<p.x;\n \t}\n \tbool operator > (const pa2 &p) const{\n \t\treturn x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const pa2 &p) const{\n \t\treturn abs(x-p.x)==0 && abs(y-p.y)==0;\n \t}\n \tbool operator != (const pa2 &p) const{\n \t\treturn !(abs(x-p.x)==0 && abs(y-p.y)==0);\n \t}\n \t\t\n \n };\n \n/*\n class Point{\n \tpublic:\n \tdouble x,y;\n \tPoint(double x=0,double y=0):x(x),y(y) {}\n \tPoint operator + (Point p) {return Point(x+p.x,y+p.y);}\n \tPoint operator - (Point p) {return Point(x-p.x,y-p.y);}\n \tPoint operator * (double a) {return Point(x*a,y*a);}\n \tPoint operator / (double a) {return Point(x/a,y/a);}\n \tdouble absv() {return sqrt(norm());}\n \tdouble norm() {return x*x+y*y;}\n \tbool operator < (const Point &p) const{\n \t\treturn x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const Point &p) const{\n \t\treturn fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;\n \t}\n };\n typedef Point Vector;\n #define pl pair<int,pas>\n struct Segment{\n Point p1,p2;\n };\n double dot(Vector a,Vector b){\n \treturn a.x*b.x+a.y*b.y;\n }\n double cross(Vector a,Vector b){\n \treturn a.x*b.y-a.y*b.x;\n }\n \n bool parareru(Point a,Point b,Point c,Point d){\n //\tif(abs(cross(a-b,d-c))<EPS)cout<<\"dd \"<<cross(a-b,d-c)<<endl;\n \treturn abs(cross(a-b,d-c))<EPS;\n }\n double distance_ls_p(Point a, Point b, Point c) {\n if ( dot(b-a, c-a) < EPS ) return (c-a).absv();\n if ( dot(a-b, c-b) < EPS ) return (c-b).absv();\n return abs(cross(b-a, c-a)) / (b-a).absv();\n }\n bool is_intersected_ls(Segment a,Segment b) {\n \tif(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;\n \tif(parareru((a.p2),(a.p1),(a.p1),(b.p2))&&parareru((a.p2),(a.p1),(a.p1),(b.p1))){\n //\t\tcout<<\"sss\"<<endl;\n \t\tif(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;\n \t\tif(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;\n \t\tif(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;\n \t\tif(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;\n \t\treturn false;\n \t}\n else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );\n }\n \n double segment_dis(Segment a,Segment b){\n \tif(is_intersected_ls(a,b))return 0;\n \tdouble r=distance_ls_p(a.p1, a.p2, b.p1);\n \tr=min(r,distance_ls_p(a.p1, a.p2, b.p2));\n \tr=min(r,distance_ls_p(b.p1, b.p2, a.p2));\n \tr=min(r,distance_ls_p(b.p1, b.p2, a.p1));\n \treturn r;\n }\n Point intersection_ls(Segment a, Segment b) {\n Point ba = b.p2-b.p1;\n double d1 = abs(cross(ba, a.p1-b.p1));\n double d2 = abs(cross(ba, a.p2-b.p1));\n double t = d1 / (d1 + d2);\n \n return a.p1 + (a.p2-a.p1) * t;\n }\n */ \n string itos( int i ) {\n ostringstream s ;\n s << i ;\n return s.str() ;\n }\n \n int gcd(int v,int b){\n \tif(v>b) return gcd(b,v);\n \tif(v==b) return b;\n \tif(b%v==0) return v;\n \treturn gcd(v,b%v);\n }\n \n double distans(double x1,double y1,double x2,double y2){\n \tdouble rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);\n \treturn sqrt(rr);\n \t\n }\n int mod;\n \n int pr[500010];\n int inv[500010];\n \n int beki(int wa,int rr,int warukazu){\n \tif(rr==0) return 1%warukazu;\n \tif(rr==1) return wa%warukazu;\n \tif(rr%2==1) return (beki(wa,rr-1,warukazu)*wa)%warukazu;\n \tint zx=beki(wa,rr/2,warukazu);\n \treturn (zx*zx)%warukazu;\n }\n double bekid(double w,int r){\n \tif(r==0) return 1.0;\n \tif(r==1) return w;\n \tif(r%2) return bekid(w,r-1)*w;\n \tdouble f=bekid(w,r/2);\n \treturn f*f;\n }\n \n \t\t\tint comb(int nn,int rr){\n \t\t\t\tint r=pr[nn]*inv[rr];\n \t\t\t\tr%=mod;\n \t\t\t\tr*=inv[nn-rr];\n \t\t\t\tr%=mod;\n \t\t\t\treturn r;\n \t\t\t}\n \n void gya(int ert){\n \tpr[0]=1;\n \tfor(int i=1;i<ert;i++){\n \t\tpr[i]=(pr[i-1]*i)%mod;\n \t}\n \tfor(int i=0;i<ert;i++) inv[i]=beki(pr[i],mod-2,mod);\n \t\n }\n \n // cin.tie(0);\n \t\t//\tios::sync_with_stdio(false);\n \t\t\t//priority_queue<pa3,vector<pa3>,greater<pa3>> pq; \n //sort(ve.begin(),ve.end(),greater<int>());\n //----------------kokomade tenpure------------\n //vector<double> ans(100000000),ans2(100000000)\n \nint a[100020];\nint n;\n\nint solve(){\n\tvector<pa> ve;\n\t\n\tve.pb(mp(a[0],1));\n\tfor(int i=1;i<n;i++){\n\t\tif(ve.back().first==a[i]) ve.back().second++;\n\t\telse ve.pb(mp(a[i],1));\n\t}\n\tint l=ve.size();\n\tint d=-1;\n\tfor(int i=0;i<l;i++){\n\t\tif(ve[i].second>=4) d=i;\n\t}\n\tif(d==-1) return n;\n\tint noz=ve[d].second;\n\tint k=1;\n\twhile(1){\n\t\tif(d-k<0|| d+k>=l) break;\n\t\tif(ve[d-k].first!=ve[d+k].first)break;\n\t\tif(ve[d-k].second+ve[d+k].second<=3)break;\n\t\tnoz+=ve[d-k].second+ve[d+k].second;\n\t\tk++;\n\t}\n\treturn n-noz;\n}\n\n signed main(){\n \t cin.tie(0);\n \t\t\tios::sync_with_stdio(false);\n \twhile(1){\ncin>>n;\n \t\tif(n==0) break;\n \tfor(int i=0;i<n;i++)cin>>a[i];\n \tint ans=n;\n \tfor(int i=0;i<n;i++){\n \t\tif(i>0 && a[i]!=a[i-1]){\n \t\t\tint t=a[i];\n \t\t\ta[i]=a[i-1];\n \t\t\tans=min(ans,solve());\n \t\t\ta[i]=t;\n \t\t}\n \t\tif(i+1<n && a[i]!=a[i+1]){\n \t\t\tint t=a[i];\n \t\t\ta[i]=a[i+1];\n \t\t\tans=min(ans,solve());\n \t\t\ta[i]=t;\n \t\t}\n \t\t\n \t}\n \tcout<<ans<<endl;\n \t}\n \treturn 0;\n }", "accuracy": 1, "time_ms": 730, "memory_kb": 3316, "score_of_the_acc": -0.8037, "final_rank": 13 }, { "submission_id": "aoj_0534_3866763", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n\nint right(int iro[],int kazu[],int m,int len){\n\tint l=1;int r=3;\n\twhile(true){\n\t\tif(iro[m-l]==iro[m+r] && 4<=kazu[m-l]+kazu[m+r]){\n\t\t\tl+=1;\n\t\t\tr+=1;\n\t\t}\n\t\telse{\n\t\t\tbreak;\n\t\t}\n\t}\n\tint w=0;\n\tfor(int n=0;n<=m-l;n++){\n\t\tw+=kazu[n];\n\t}\n\tfor(int aa=m+r;aa<=len;aa++){\n\t\tw+=kazu[aa];\n\t}\n\treturn w;\n}\n\n\n\nint left(int iro[],int kazu[],int m,int len){\n\tint l=3;int r=1;\n\twhile(true){\n\t\tif(iro[m-l]==iro[m+r]&&4<=kazu[m-l]+kazu[m+r]){\n\t\t\tl+=1;\n\t\t\tr+=1;\n\t\t}\n\t\telse{\n\t\t\tbreak;\n\t\t}\n\t}\n\tint w=0;\n\tfor(int n=0;n<=m-l;n++){\n\t\tw+=kazu[n];\n\t}\n\tfor(int aa=m+r;aa<=len;aa++){\n\t\tw+=kazu[aa];\n\t\n\t}\n\treturn w;\n}\n\n\n\n\n\nint thright(int iro[],int kazu[],int m,int len){\n\tkazu[m]+=1;\n\tkazu[m+1]-=1;\n\tint l=1;\n\tint r=1;\n\tint w=0;\n\twhile(true){\n\t\tif(iro[m-l]==iro[m+r]&&4<=kazu[m-l]+kazu[m+r]){\n\t\t\tl+=1;\n\t\t\tr+=1;\n\t\t}\n\t\telse{\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(int n=0;n<=m-l;n++){\n\t\tw+=kazu[n];\n\t}\n\tfor(int aa=m+r;aa<=len;aa++){\n\t\tw+=kazu[aa];\n\t}\n\tkazu[m]-=1;\n\tkazu[m+1]+=1;\nreturn w;\n}\n\n\nint thleft(int iro[],int kazu[],int m,int len){\n\tkazu[m]+=1;\n\tkazu[m-1]-=1;\n\tint l=1;\n\tint r=1;\n\tint w=0;\n\twhile(true){\n\t\tif(iro[m-l]==iro[m+r]&&4<=kazu[m-l]+kazu[m+r]){\n\t\t\tl+=1;\n\t\t\tr+=1;\n\t\t}\n\t\telse{\n\t\t\tbreak;\n\t\t}\n\t}\n\tfor(int n=0;n<=m-l;n++){\n\t\tw+=kazu[n];\n\t}\n\tfor(int aa=m+r;aa<=len;aa++){\n\t\tw+=kazu[aa];\n\t}\n\tkazu[m]-=1;\n\tkazu[m-1]+=1;\nreturn w;\n}\n\n\n\n\nint main(){\n\twhile(true){\n\t\t\n\t\tint kazu[10000]={};\n\t\tint iro[10000]={};\n\t\tint a,b,c;\n\t\tint len=1;\n\t\tcin >> a;\n\t\tif(a==0){\n\t\t\tbreak;\n\t\t}\n\t\tcin >> c;\n\t\tint z=0;\n\t\tiro[0]={c};\n\t\tkazu[0]={1};\n\t\tfor(int n=0;n<a-1;n++){\n\t\t\tcin >> b;\n\t\t\tif(c!=b){\n\t\t\t\tz+=1;\n\t\t\t\tiro[z]={b};\n\t\t\t\tc=b;\n\t\t\t\tlen+=1;\n\t\t\t}\n\t\t\tkazu[z]+=1;\n\t\t}\n\t\tint anser=a;\n\t\tfor(int m=0;m<len;m++){\n\t\t\tif(kazu[m]>=2){\n\t\t\t\tif(m!=len&&iro[m]==iro[m+2]&&kazu[m+1]==1){\n\t\t\t\t\tanser=min(anser,right(iro,kazu,m,len));\n\t\t\t\t}\n\t\t\t\tif(m!=0&&iro[m]==iro[m-2]&&kazu[m-1]==1){\n\t\t\t\t\tanser=min(anser,left(iro,kazu,m,len));\n\t\t\t\t}\n\t\t\t\tif(kazu[m]==3){\n\t\t\t\t\tif(m!=len){\n\t\t\t\t\t\tanser=min(anser,thright(iro,kazu,m,len));\n\t\t\t\t\t}\n\t\t\t\t\tif(m!=0){\n\t\t\t\t\t\tanser=min(anser,thleft(iro,kazu,m,len));\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\t\n\t\t}\n\t\tprintf(\"%d\\n\",anser);\n\t}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3196, "score_of_the_acc": -0.0019, "final_rank": 1 } ]
aoj_0535_cpp
薄氷渡り 問題 冬の寒いある日，JOI太郎君は広場にはった薄氷を割って遊ぶことにした．広場は長方形で，東西方向に m 個，南北方向に n 個，つまり， m × n の区画に区切られている．また，薄氷が有る区画と無い区画がある． JOI太郎君は，次のルールにしたがって，薄氷を割りながら区画を移動することにした． 薄氷があるどの区画からも薄氷を割り始めることができる． 東西南北のいずれかの方向に隣接し， まだ割られていない薄氷のある区画に移動できる． 移動した先の区画の薄氷をかならず割る． JOI太郎君が薄氷を割りながら移動できる区画数の最大値を求めるプログラムを作成せよ．ただし， 1 ≤ m ≤ 90，1 ≤ n ≤ 90 である．与えられる入力データでは，移動方法は20万通りを超えない． 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる． 入力はn+2行ある． 1 行目には整数 m が書かれている． 2 行目には整数 n が書かれている． 3 行目から n+2 行目までの各行には、0 もしくは 1 が， 空白で区切られて m 個書かれており，各区画に薄氷があるか否かを表している．北から i 番目，西からj番目の区画を (i,j) と記述することにすると (1 ≤ i ≤ n, 1 ≤ j ≤ m)，第 i+2 行目の j 番目の値は，区画 (i,j) に薄氷が存在する場合は 1 となり，区画 (i,j) に薄氷が存在しない場合は 0 となる． m, n がともに 0 のとき入力の終了を示す. データセットの数は 5 を超えない． 出力 データセットごとに, 移動できる区画数の最大値を１行に出力せよ． 入出力例 入力例 3 3 1 1 0 1 0 1 1 1 0 5 3 1 1 1 0 1 1 1 0 0 0 1 0 0 0 1 0 0 出力例 5 5 1つ目の入力例に対して，最大値を与える移動方法の例 2つ目の入力例に対して，最大値を与える移動方法の例 2つ目の入力例に対して，最大値を与えない移動方法の例 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0535_10863977", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nconst int dx[4] = {0, 0, -1, 1};\nconst int dy[4] = {-1, 1, 0, 0};\nint m, n;\nint max_length;\n\nvoid dfs(int y, int x, const vector<vector<int>>& grid, vector<vector<bool>>& visited, int depth) {\n max_length = max(max_length, depth);\n visited[y][x] = true;\n\n for (int dir = 0; dir < 4; ++dir) {\n int ny = y + dy[dir];\n int nx = x + dx[dir];\n\n if (ny < 0 || ny >= n || nx < 0 || nx >= m) continue;\n if (grid[ny][nx] == 0 || visited[ny][nx]) continue;\n\n dfs(ny, nx, grid, visited, depth + 1);\n }\n\n visited[y][x] = false; // バックトラック\n}\n\nint main() {\n while (cin >> m >> n) {\n if (m == 0 && n == 0) break;\n\n vector<vector<int>> grid(n, vector<int>(m));\n for (int i = 0; i < n; ++i)\n for (int j = 0; j < m; ++j)\n cin >> grid[i][j];\n\n max_length = -1;\n\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < m; ++j) {\n if (grid[i][j] == 1) {\n vector<vector<bool>> visited(n, vector<bool>(m, false));\n dfs(i, j, grid, visited, 1);\n }\n }\n }\n\n cout << max_length << endl;\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3368, "score_of_the_acc": -0.4422, "final_rank": 7 }, { "submission_id": "aoj_0535_6799098", "code_snippet": "#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n// #include <atcoder/modint>\n// #include <atcoder/fenwicktree>\n// #include <atcoder/segtree>\n// #include <atcoder/scc>\n\n#define int long long\n#define all(x) begin(x), end(x)\n\nusing namespace std;\n// using namespace atcoder;\n// using mint = modint998244353;\n// using mint = modint1000000007;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing vp = vector<pii>;\nusing vvp = vector<vp>;\nusing vs = vector<string>;\nusing vvc = vector<vector<char>>;\n\nvoid debug(vector<int> a) {\n for (auto x : a) cout << x << ' ';\n cout << endl;\n}\n\nvoid debug(vector<vector<int>> a) {\n for (auto y : a) debug(y);\n}\n\ntemplate <typename T1, typename T2>\ninline bool chmax(T1 &a, T2 b) {return a < b and (a = b, true);}\n\ntemplate <typename T1, typename T2>\ninline bool chmin(T1 &a, T2 b) {return a > b and (a = b, true);}\n\nconst int supl = LONG_LONG_MAX - 100;\n\nint solve(int h, int w) {\n vvi as(h, vi(w)); for (auto& y : as) for (auto& x : y) cin >> x;\n\n int d[] = {-1, 1};\n auto in = [&](int y, int x) {\n return 0 <= y and y < h and 0 <= x and x < w;\n };\n\n int ans = 0;\n \n for (int i = 0 ; i < h ; i++) for (int j = 0 ; j < w ; j++) {\n vvi used(h, vi(w));\n function<int(int, int, int)> dfs = [&](int y, int x, int v) {\n used[y][x] = 1;\n int res = v;\n for (auto dy : d) if (in(y + dy, x)) if (!used[y + dy][x]) {\n // used[y + dy][x] = 1;\n if (as[y + dy][x]) {\n chmax(res, dfs(y + dy, x, v + 1));\n used[y + dy][x] = 0;\n }\n }\n for (auto dx : d) if (in(y, x + dx)) if (!used[y][x + dx]) {\n // used[y][x + dx] = 1;\n if (as[y][x + dx]) {\n chmax(res, dfs(y, x + dx, v + 1));\n used[y][x + dx] = 0;\n }\n }\n\n return res;\n };\n\n // cout << i << ' ' << j << endl;\n // used[i][j] = 1;\n if (as[i][j]) {\n chmax(ans, dfs(i, j, 1));\n }\n }\n\n return ans;\n}\n\nvoid main_() {\n while(1) {\n int w, h; cin >> w >> h;\n if (!w) break;\n cout << solve(h, w) << endl;\n }\n}\n\nsigned main() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n\n main_();\n\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3512, "score_of_the_acc": -0.5364, "final_rank": 10 }, { "submission_id": "aoj_0535_6704612", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing VI = vector<int>;\nusing VVI = vector<VI>;\n\nVI dx = {-1, 0, 1, 0};\nVI dy = {0, -1, 0, 1}; // 左、上、右、下\n\n// 深さ優先探索\nvoid one_stroke(VVI s, VI& v, int len, int y, int x) {\n if (s[y][x] == 0) {\n return;\n } else {\n ++len;\n s[y][x] = 0;\n for (int i = 0; i < 4; ++i) {\n if (s[y + dy[i]][x + dx[i]] == 1) {\n one_stroke(s, v, len, y + dy[i], x + dx[i]);\n }\n }\n v.push_back(len);\n }\n}\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n while (true) {\n int m, n;\n cin >> m;\n cin >> n;\n if (n == 0 && m == 0) break;\n\n VVI square(n + 2, VI(m + 2, 0));\n for (int i = 1; i <= n; ++i) {\n for (int j = 1; j <= m; ++j) {\n cin >> square[i][j];\n }\n }\n\n int max_len = 0;\n for (int i = 1; i <= n; ++i) {\n for (int j = 1; j <= m; ++j) {\n VI vec;\n one_stroke(square, vec, 0, i, j);\n if (vec.size() > 0) {\n max_len =\n max(max_len, *max_element(vec.begin(), vec.end()));\n }\n }\n }\n cout << max_len << endl;\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 550, "memory_kb": 3992, "score_of_the_acc": -1.368, "final_rank": 13 }, { "submission_id": "aoj_0535_6291342", "code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\nlong long DFS(vector<vector<int>>& A, int x, int y, vector<vector<bool>>& reach) {\n if (A.at(y).at(x) == 0) return 0;\n if (reach.at(y).at(x)) return 0;\n long long ans = 0;\n reach.at(y).at(x) = true;\n ans = max(ans, DFS(A, x, y + 1, reach));\n ans = max(ans, DFS(A, x, y - 1, reach));\n ans = max(ans, DFS(A, x + 1, y, reach));\n ans = max(ans, DFS(A, x - 1, y, reach));\n reach.at(y).at(x) = false;\n return ans + 1;\n}\nint main() {\n int H, W;\n cin >> W >> H;\n while (W != 0 || H != 0) {\n vector<vector<int>>A(H + 2, vector<int>(W + 2));\n for (int i = 0; i < H + 2; i++) {\n for (int j = 0; j < W + 2; j++) {\n if (i == 0 || i == H + 1) {\n A.at(i).at(j) = 0;\n }\n else if (j == 0 || i == W + 1) {\n A.at(i).at(j) = 0;\n }\n }\n }\n for (int i = 1; i <= H; i++) {\n for (int j = 1; j <= W; j++) {\n cin >> A.at(i).at(j);\n }\n }\n long long ans = -1;\n for (int i = 1; i <= H; i++) {\n for (int j = 1; j <= W; j++) {\n vector<vector<bool>>reach(H + 2, vector<bool>(W + 2, false));\n ans = max(ans, DFS(A, j, i, reach));\n }\n }\n cout << ans << endl;\n cin >> W >> H;\n }\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 3488, "score_of_the_acc": -0.5544, "final_rank": 11 }, { "submission_id": "aoj_0535_5461017", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, N) for (int i = 0; i < N; i++)\n\nbool nm[100][100] = {};\nbool isvisit[100][100];\nint cnt = 0;\nint ans = 0;\n\nvoid dfs(int i, int j)\n{\n //cout << \" dfs i j \" << i << \" \" << j << endl;\n if(isvisit[i][j]) return;\n isvisit[i][j] = true;\n cnt++;\n ans = max(ans, cnt);\n if (nm[i - 1][j])\n {\n dfs(i - 1, j);\n }\n if (nm[i][j - 1])\n {\n dfs(i, j - 1);\n }\n if (nm[i + 1][j])\n {\n dfs(i + 1, j);\n }\n if (nm[i][j + 1])\n {\n dfs(i, j + 1);\n }\n cnt--;\n isvisit[i][j] = false;\n}\n\nint main()\n{\n while(1){\n\n\n nm[100][100] = {};\n\ncnt = 0;\nans = 0;\n\n int m, n;\n cin >> m >> n;\n if(m==0 && n==0) return 0;\n rep(i, n) rep(j, m) cin >> nm[i + 1][j + 1];\n\n rep(i, n)\n {\n rep(j, m)\n {\n rep(ii,n){\n rep(jj,m){\n isvisit[ii][jj] = false;\n }\n }\n //i++;\n // j++;\n if (nm[i+1][j+1])\n {\n dfs(i+1, j+1);\n }\n }\n }\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3092, "score_of_the_acc": -0.2821, "final_rank": 3 }, { "submission_id": "aoj_0535_5196836", "code_snippet": "#include <bits/stdc++.h>\n#define all(v) v.begin(), v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)\n#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)\n#define codefor int test;scanf(\"%d\",&test);while(test--)\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define yes(ans) if(ans)printf(\"yes\\n\");else printf(\"no\\n\")\n#define Yes(ans) if(ans)printf(\"Yes\\n\");else printf(\"No\\n\")\n#define YES(ans) if(ans)printf(\"YES\\n\");else printf(\"NO\\n\")\n#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\n#define umap unordered_map\n#define uset unordered_set\nusing namespace std;\nusing ll = long long;\nconst int MOD=1000000007;\nconst int MOD2=998244353;\nconst int INF=1<<30;\nconst ll INF2=(ll)1<<60;\n//入力系\nvoid scan(int& a){scanf(\"%d\",&a);}\nvoid scan(long long& a){scanf(\"%lld\",&a);}\ntemplate<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}\ntemplate<class T> void scan(T& a){cin>>a;}\ntemplate<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}\n//出力系\nvoid print(const int& a){printf(\"%d\",a);}\nvoid print(const long long& a){printf(\"%lld\",a);}\nvoid print(const double& a){printf(\"%.15lf\",a);}\ntemplate<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}\ntemplate<class T> void print(const T& a){cout<<a;}\ntemplate<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}\nvoid out(){putchar('\\n');}\ntemplate<class T> void out(const T& t){print(t);putchar('\\n');}\ntemplate <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}\n//デバッグ系\ntemplate<class T> void dprint(const T& a){cerr<<a;}\ntemplate<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<\" \"<<*it;}}\nvoid debug(){cerr<<endl;}\ntemplate<class T> void debug(const T& t){dprint(t);cerr<<endl;}\ntemplate <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<\" \";debug(tail...);}\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\nll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}\nll updivide(ll a,ll b){if(a%b==0) return a/b;else return (a/b)+1;}\ntemplate<class T> void chmax(T &a,const T b){if(b>a)a=b;}\ntemplate<class T> void chmin(T &a,const T b){if(b<a)a=b;}\n\nint rec(int y,int x,vector<vector<bool>> visited,vector<vector<int>>& mat){\n int dist=1,dy,dx,h=mat.size(),w=mat[0].size();\n visited[y][x]=true;\n for(int i=0;i<4;i++){\n dy=(i==0)-(i==1);\n dx=(i==2)-(i==3);\n if(y+dy<0||x+dx<0||y+dy>=h||x+dx>=w)continue;\n if(mat[y+dy][x+dx]==1&&!visited[y+dy][x+dx]){\n chmax(dist,rec(y+dy,x+dx,visited,mat)+1);\n }\n }\n return dist;\n}\n\nint main(){\n while(1){\n INT(w,h);\n if(w==0&&h==0)return 0;\n vector2d(int,mat,h,w);\n vector2d(bool,visited,h,w,false);\n in(mat);\n int ans=0;\n rep(y,h){\n rep(x,w){\n if(mat[y][x]==1)chmax(ans,rec(y,x,visited,mat));\n }\n }\n out(ans);\n }\n}", "accuracy": 1, "time_ms": 870, "memory_kb": 3428, "score_of_the_acc": -1.3813, "final_rank": 14 }, { "submission_id": "aoj_0535_5043596", "code_snippet": "#include<iostream>\n#include<vector>\n\nconst int dx[] = {-1, 0, +1, 0};\nconst int dy[] = {0, -1, 0, +1};\n\nvoid dfs(std::vector<std::vector<int> > field, int n, int m, int cnt, int &ans){\n field[n][m] = 0;\n bool f = true;\n for(int i=0; i<4; ++i){\n int x = dx[i] + m;\n int y = dy[i] + n;\n if(field[y][x] != 0){\n dfs(field, y, x, cnt+1, ans);\n f = false;\n }\n }\n field[n][m] = 1;\n if(f && cnt+1 > ans){\n ans = cnt+1;\n }\n return;\n}\n\nint main(){\n int M,N;\n while(std::cin >> M >> N, M || N){\n std::vector<std::vector<int> > field(N+2, std::vector<int>(M+2,0));\n for(int n=1; n<=N; ++n){\n for(int m=1; m<=M; ++m){\n std::cin >> field[n][m];\n }\n }\n\n int ans = 0;\n for(int n=1; n<=N; ++n){\n for(int m=1; m<M; ++m){\n if(field[n][m] == 1){\n int tmp = 0;\n dfs(field, n, m, 0, tmp);\n ans = std::max(ans, tmp);\n }\n }\n }\n std::cout << ans << std::endl;\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 870, "memory_kb": 3904, "score_of_the_acc": -1.6574, "final_rank": 18 }, { "submission_id": "aoj_0535_4569155", "code_snippet": "#include<bits/stdc++.h>\n\n#define _GLIBCXX_DEBUG\n#define all(v) (v).begin(),(v).end()\n\nusing namespace std;\n\nusing ll=long long;\nusing pii=pair<int, int>;\nusing vi=vector<int>;\n\nconst ll INF=1LL<<60;\nconst int MOD=1e9+7;\n\nint dx[4]={1, 0, -1, 0};\nint dy[4]={0, 1, 0, -1};\nvector<vector<bool>> visit;\nint m, n;\n\nint dfs(vector<vi> ice, int x, int y){\n int MAX=1;\n visit[x][y]=true;\n for(int i=0; i<4; i++){\n int nx=x+dx[i];\n int ny=y+dy[i];\n if(nx<0 || nx>=n || ny<0 || ny>=m) continue;\n if(ice[nx][ny] == 0 || visit[nx][ny]) continue;\n MAX=max(MAX, dfs(ice, nx, ny)+1);\n }\n visit[x][y]=false;\n return MAX;\n}\n\nint main(){\n while(cin >> m >> n){\n if(m==0 && n==0) break;\n visit.assign(n, vector<bool>(m));\n vector<vi> ice(n, vi(m));\n for(int i=0; i<n; i++){\n for(int j=0; j<m; j++){\n cin >> ice[i][j];\n }\n }\n int res=0;\n for(int i=0; i<n; i++){\n for(int j=0; j<m; j++){\n if(ice[i][j] == 0) continue;\n res=max(res,dfs(ice, i, j));\n }\n }\n cout << res << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 870, "memory_kb": 3884, "score_of_the_acc": -1.6458, "final_rank": 17 }, { "submission_id": "aoj_0535_3741350", "code_snippet": "#include <iostream>\n#include <queue>\n\nusing namespace std;\nconst int MAX_N = 90;\nconst int MAX_M = 90;\nstruct map {\n int maze[MAX_N + 1][MAX_M + 1];\n int skcount[MAX_M];\n}mapmap[5];\nint X[4] = {0, 0, 1, -1};\nint Y[4] = {1, -1, 0, 0};\nint m[5];\nint n[5];\nint k, l;\nint res = 0;\nstruct node{\n int x, y;\n int step;\n bool last[MAX_N][MAX_M];\n}Node;\nqueue<node> q;\n\nbool test(int x, int y, node S,int f){\n if(x >= n[f] || x < 0 || y >= m[f] || y < 0) return false;\n if(mapmap[f].maze[x][y] == 0) return false;\n if(S.last[x][y] == true) return false;\n return true;\n}\n\nvoid BFS(node S,int f){\n q.push(S);\n node top = q.front();\n q.pop();\n for(int i = 0; i < 4; i++) {\n int newX = top.x + X[i];\n int newY = top.y + Y[i];\n if (test(newX, newY, Node,f)) {\n Node.x = newX, Node.y = newY;\n Node.step = top.step + 1;\n mapmap[f].skcount[Node.step]++;\n Node.last[newX][newY] = true;\n BFS(Node,f);\n }\n }\n Node.last[top.x][top.y] = false;\n return;\n}\n\nint main() {\n for(int f = 0; f < 5; f++) {\n cin >> m[f];\n cin >> n[f];\n for (int i = 0; i < n[f]; i++) {\n for (int j = 0; j < m[f]; j++) {\n cin >> mapmap[f].maze[i][j];\n }\n }\n for (k = 0; k < n[f]; k++) {\n for (l = 0; l < m[f]; l++) {\n if (mapmap[f].maze[k][l] == 1) {\n node S;\n S.x = k;\n S.y = l;\n Node.last[k][l] = true;\n S.step = 1;\n mapmap[f].skcount[S.step]++;\n BFS(S,f);\n }\n }\n }\n if(m[f] == 0 || n[f] == 0) break;\n res++;\n }\n for(int f = 0; f < res; f++){\n for (int i = 1; i < MAX_M; i++) {\n if (mapmap[f].skcount[i] == 0) {\n cout << i - 1;\n break;\n }\n }\n cout << '\\n';\n }\n return 0;\n}", "accuracy": 1, "time_ms": 220, "memory_kb": 3780, "score_of_the_acc": -0.8939, "final_rank": 12 }, { "submission_id": "aoj_0535_3279115", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint solve(int x,int y,vector< vector<int> > a,int ma)\n{\n ma++;\n int bx[4]={1,0,-1,0},by[4]={0,1,0,-1};\n int p=ma;\n for(int i=0;i<4;i++){\n if(a[x+bx[i]][y+by[i]]==1){\n a[x][y]=0;\n ma=max(ma,solve(x+bx[i],y+by[i],a,p));\n }\n }\n return ma;\n}\n\nint main()\n{\n int n,m;\n for(;;){\n cin >> n >> m;\n if(n==0&&m==0) break;\n vector< vector<int> > a(m+2);\n for(int i=0;i<n+2;i++)\n a[0].push_back(0);\n int in;\n for(int i=1;i<m+1;i++){\n a[i].push_back(0);\n for(int j=1;j<n+1;j++){\n cin >> in;\n a[i].push_back(in);\n }\n a[i].push_back(0);\n }\n for(int i=0;i<n+2;i++)\n a[m+1].push_back(0);\n int p=0;\n for(int i=1;i<m+1;i++)\n for(int j=1;j<n+1;j++){\n int ma=0;\n if(a[i][j]==0) continue;\n p=max(p,solve(i,j,a,ma));\n }\n cout << p << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 880, "memory_kb": 3892, "score_of_the_acc": -1.661, "final_rank": 19 }, { "submission_id": "aoj_0535_3095040", "code_snippet": "#include <bits/stdc++.h>\n#define range(i, a, b) for(int i = (a); i < (b); i++)\n#define rep(i, a) range(i, 0, a)\nusing namespace std;\n\nint w, h;\nvector <vector <int>> ice, used;\n\nint rec(int y, int x) {\n if (x < 0 || w <= x || y < 0 || h <= y) return 0;\n\n int res = 0;\n\n int dy[] = { 1, 0, -1, 0},\n dx[] = { 0, 1, 0, -1};\n\n rep (i, 4) {\n int yy = y + dy[i], xx = x + dx[i];\n if (xx < 0 || w <= xx || yy < 0 || h <= yy) continue;\n if (!ice[yy][xx]) continue;\n if (used[yy][xx]) continue;\n used[yy][xx] = true;\n res = max(res, rec(yy, xx) + 1);\n used[yy][xx] = false;\n }\n\n return res;\n}\n\nint main() {\n while(cin >> w >> h, w) {\n ice = vector <vector <int>> (w, vector <int> (h));\n rep (i, h) rep (j, w) cin >> ice[i][j];\n int ans = 0;\n rep (i, h) rep (j, w) {\n used = vector <vector <int>> (w, vector <int> (h, false));\n used[i][j] = true;\n ans = max(ans, rec(i, j));\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3200, "score_of_the_acc": -0.3554, "final_rank": 6 }, { "submission_id": "aoj_0535_3064402", "code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\nint solve(vector<vector<int> > map, int x, int y, int walk) {\n\tint tmp = 1;\n\tint flag = 0;\n\tif (map[x - 1][y]) {\n\t\tmap[x - 1][y] = 0;\n\t\tint result = solve(map, x - 1, y, walk + 1);\n\t\tif (tmp < result) tmp = result;\n\t\tmap[x - 1][y] = 1;\n\t\tflag++;\n\t}\n\tif (map[x + 1][y]) {\n\t\tmap[x + 1][y] = 0;\n\t\tint result = solve(map, x + 1, y, walk + 1);\n\t\tif (tmp < result) tmp = result;\n\t\tmap[x + 1][y] = 1;\n\t\tflag++;\n\t}\n\tif (map[x][y + 1]) {\n\t\tmap[x][y + 1] = 0;\n\t\tint result = solve(map, x, y + 1, walk + 1);\n\t\tif (tmp < result) tmp = result;\n\t\tmap[x][y + 1] = 1;\n\t\tflag++;\n\t}\n\tif (map[x][y - 1]) {\n\t\tmap[x][y - 1] = 0;\n\t\tint result = solve(map, x, y - 1, walk + 1);\n\t\tif (tmp < result) tmp = result;\n\t\tmap[x][y - 1] = 1;\n\t\tflag++;\n\t}\n\tif (!flag)return walk;\n\treturn tmp;\n}\n\nint main() {\n\twhile (1) {\n\t\tint m, n;\n\t\tcin >> m >> n;\n\t\tif (m == 0 && n == 0)break;\n\t\tvector<vector<int> > map(m + 2, vector<int>(n + 2, 0));\n\t\tfor (int i = 0; i < m; i++)for (int j = 0; j < n; j++) cin >> map[i + 1][j + 1];\n\n\t\tint max = 0;\n\t\tfor (int i = 0; i < m; i++)for (int j = 0; j < n; j++) {\n\t\t\tif (map[i + 1][j + 1] == 0)continue;\n\t\t\tmap[i + 1][j + 1] = 0;\n\t\t\tint result = solve(map, i + 1, j + 1, 1);\n\t\t\tif (max < result)max = result;\n\t\t\tmap[i + 1][j + 1] = 1;\n\t\t}\n\n\t\tcout << max << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 880, "memory_kb": 3840, "score_of_the_acc": -1.6309, "final_rank": 16 }, { "submission_id": "aoj_0535_2918837", "code_snippet": "#include<stdio.h>\n\n#include<algorithm>\n#include<iostream>\n#include<stack>\n\nusing namespace std ;\n\n#define y first\n#define x second\n\n#define NM_MAX 90\n\nint mx[] = { 0 ,1 ,-1 ,0 } ;\nint my[] = { 1 ,0 ,0 ,-1 } ;\n\nstruct Data\n{\n\tint cnt ;\n\tpair<int ,int> p ;\n\tbool map[ NM_MAX + 2 ][ NM_MAX + 2 ] ;\n};\n\n\nint main( void )\n{\n\tData init = { 0 ,make_pair(1 ,1) ,false } ;\n\tstack< pair<int ,int> > start ;\n\n\tint W ,H ;\n\twhile( true )\n\t{\n\t\tscanf( \"%d %d\" ,&W ,&H ) ;\n\n\t\tif( W | H )\n\t\t{\n\t\t\tint ans = 0 ;\n\n\t\t\tint i ,j ;\n\t\t\tfor( i = 1 ; i <= H ; ++i )\n\t\t\t{\n\t\t\t\tfor( j = 1 ; j <= W ; ++j )\n\t\t\t\t{\n\t\t\t\t\tint input ;\n\t\t\t\t\tscanf( \"%d\" ,&input ) ;\n\n\t\t\t\t\tinit.map[ i ][ j ] = (input == 0 ? false : true ) ;\n\n\t\t\t\t\tif( init.map[ i ][ j ] )\n\t\t\t\t\t{\n\t\t\t\t\t\tstart.push( make_pair(i ,j) ) ;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tstack< Data > st ;\n\n\t\t\twhile( !start.empty() )\n\t\t\t{\n\t\t\t\tinit.p = start.top() ;\n\t\t\t\tstart.pop() ;\n\n\t\t\t\tst.push( init ) ;\n\t\t\t\twhile( !st.empty() )\n\t\t\t\t{\n\t\t\t\t\tData move = st.top() ;\n\t\t\t\t\tst.pop() ;\n\n\t\t\t\t\tint X = move.p.x ;\n\t\t\t\t\tint Y = move.p.y ;\n\n\t\t\t\t\t++move.cnt ;\n\t\t\t\t\tmove.map[ Y ][ X ] = false ;\n\t\t\t\t\tans = max( ans ,move.cnt ) ;\n\n\t\t\t\t\tData copy = move ;\n\n\t\t\t\t\tfor( i = 0 ; i < 4 ; ++i )\n\t\t\t\t\t{\n\t\t\t\t\t\tint nextX = X + mx[ i ] ;\n\t\t\t\t\t\tint nextY = Y + my[ i ] ;\n\n\t\t\t\t\t\tif( move.map[ nextY ][ nextX ] == true )\n\t\t\t\t\t\t{\n\t\t\t\t\t\t\tcopy.p.x = nextX ;\n\t\t\t\t\t\t\tcopy.p.y = nextY ;\n\n\t\t\t\t\t\t\tst.push( copy ) ;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tprintf( \"%d\\n\" ,ans ) ;\n\t\t}\n\t\t\n\t\telse\n\t\t{\n\t\t\treturn 0 ;\n\t\t}\n\t}\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 3384, "score_of_the_acc": -0.5153, "final_rank": 9 }, { "submission_id": "aoj_0535_2759335", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int MAX = 90;\n\nint a[MAX][MAX];\nint c[MAX][MAX];\n\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, 1, 0, -1 };\n\nint m, n;\n\nint dfs(int x, int y) {\n\tc[x][y] = 0;\n\tint ma = 0;\n\tfor (int i = 0; i < 4; i++) {\n\t\tint tx = x + dx[i], ty = y + dy[i];\n\t\tif (0 <= tx && tx < n && 0 <= ty && ty < m && c[tx][ty]) {\n\t\t\tma = max(ma, dfs(tx, ty));\n\t\t}\n\t}\n\tc[x][y] = 1;\n\treturn ma + 1;\n}\n\nint main()\n{\n\twhile (cin >> m >> n, m | n) {\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tcin >> a[i][j];\n\t\t\t}\n\t\t}\n\t\tint res = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tfor (int j = 0; j < m; j++) {\n\t\t\t\tif (a[i][j] == 1) {\n\t\t\t\t\tfor (int x = 0; x < n; x++) {\n\t\t\t\t\t\tfor (int y = 0; y < m; y++) {\n\t\t\t\t\t\t\tc[x][y] = a[x][y];\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tres = max(res, dfs(i, j));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << res << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3132, "score_of_the_acc": -0.2947, "final_rank": 5 }, { "submission_id": "aoj_0535_2678921", "code_snippet": "//http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=2676345#1\n//http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=2676345#1\n#include <iostream>\n#include<cstdlib>\n#include<queue>\n#include<set>\n#include<vector>\n#include<string>\n#include<algorithm>\n#include<stack>\n#include<map>\n#include<cstdio>\n#include<fstream>\n#include<cstring>\nusing namespace std;\n#define rep(i,a) for(int i=0;i<a;i++)\n#define mp make_pair\n#define P pair<int,int>\n#define ll __int64\n\nint m,n;\nint table[100][100];\nbool used[100][100];\nint u[100][100];\nint ans=0;\nint dx[4]={1,0,-1,0};\nint dy[4]={0,1,0,-1};\n\nint dfs(set<P>jo,int y,int x){\n\tif(y<0||x<0||y>=n||x>=m||table[y][x]==0)return 0;\n\tif(u[y][x]==1)return 0;\n\n\t//cout<<y<<\" \"<<x<<\" \"<<jo.size()<<endl;\n\tint ma=0;\n\tjo.insert(mp(y,x));\n\tint ny,nx;\n\trep(i,4){\n\t\t\tny=y+dy[i];\n\t\t\tnx=x+dx[i];\n\t\t\tif(jo.find(mp(ny,nx))==jo.end()){\n\n\t\t\t\tma=max(dfs(jo,ny,nx)+1,ma);\n\t\t\t}\n\t\t//ma=max(dfs(y+dy[i],x+dx[i])+1,ma);\n\t}\n\n\treturn ma;\n}\n\n\nint main(){\nwhile(cin>>m>>n,n||m){\nrep(i,100)memset(used[i],0,sizeof used[i]);\nrep(i,100)memset(u[i],0,sizeof u[i]);\nrep(i,100)memset(table[i],0,sizeof table[i]);\n\nrep(i,n){\n\trep(j,m)cin>>table[i][j];\n}\nint ans=0;\n\nfor(int i=0;i<n;i++){\n\tfor(int j=0;j<m;j++){\n\t\t\tif(table[i][j]==0)continue;\n\t\t\tset<P>jo;\n\t\t\tjo.clear();\n\t\t\tint now=dfs(jo,i,j);\n\t\t\tans=max(ans,now);\n\t\t\t//cout<<i<<\" \"<<j<<\" \"<<now<<endl;\n\n\t}\n}\ncout<<ans<<endl;\n}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 210, "memory_kb": 3124, "score_of_the_acc": -0.5028, "final_rank": 8 }, { "submission_id": "aoj_0535_2649917", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint m, n;\nint field[92][92];\nbool visited[92][92];\nint max_dist;\nint dist;\n\nvoid dfs(int i, int j){\n\tvisited[i][j] = true;\n\tif(dist > max_dist){\n\t\tmax_dist = dist;\n\t}\n\tif(field[i + 1][j] == 1 && visited[i + 1][j] == false){\n\t\tdist++;\n\t\tdfs(i + 1, j);\n\t\tvisited[i + 1][j] = false;\n\t\tdist--;\n\t}\n\tif(field[i][j + 1] == 1 && visited[i][j + 1] == false){\n\t\tdist++;\n\t\tdfs(i, j + 1);\n\t\tvisited[i][j + 1] = false;\n\t\tdist--;\n\t}\n\tif(field[i - 1][j] == 1 && visited[i - 1][j] == false){\n\t\tdist++;\n\t\tdfs(i - 1, j);\n\t\tvisited[i - 1][j] = false;\n\t\tdist--;\n\t}\n\tif(field[i][j - 1] == 1 && visited[i][j - 1] == false){\n\t\tdist++;\n\t\tdfs(i, j - 1);\n\t\tvisited[i][j - 1] = false;\n\t\tdist--;\n\t}\n\treturn;\n}\n\nint main(){\n\tfor(;;){\n\t\tcin >> m >> n;\n\t\tif(m == 0) break;\n\t\tfor(int i = 0; i <= m + 1; i++){\n\t\t\tfor(int j = 0; j <= n + 1; j++){\n\t\t\t\tfield[i][j] = 0;\n\t\t\t}\n\t\t}\n\t\tfor(int i = 1; i <= m; i++){\n\t\t\tfor(int j = 1; j <= n; j++){\n\t\t\t\tcin >> field[i][j];\n\t\t\t}\n\t\t}\n\t\tmax_dist = 0;\n\t\tfor(int i = 1; i <= m; i++){\n\t\t\tfor(int j = 1; j <= n; j++){\n\t\t\t\tfor(int k = 0; k <= m + 1; k++){\n\t\t\t\t\tfor(int l = 0; l <= n + 1; l++){\n\t\t\t\t\t\tvisited[k][l] = false;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tdist = 0;\n\t\t\t\tdfs(i, j);\n\t\t\t}\n\t\t}\n\t\tcout << max_dist << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3036, "score_of_the_acc": -0.2496, "final_rank": 2 }, { "submission_id": "aoj_0535_2638655", "code_snippet": "#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nint m, n;\nint dfs(int b[100][100], int y, int x){\n\tint a[100][100];\n\tfor(int i = 0;i < 100;i++)\n\tfor(int j = 0;j < 100;j++)a[i][j] = b[i][j];\n\tif(!a[y][x])return 0;\n\tint ans = a[y][x] = 0;\n\tif(a[y-1][x])ans = max(ans, dfs(a, y-1, x));\n\tif(a[y+1][x])ans = max(ans, dfs(a, y+1, x));\n\tif(a[y][x-1])ans = max(ans, dfs(a, y, x-1));\n\tif(a[y][x+1])ans = max(ans, dfs(a, y, x+1));\n\treturn ans+1;\n}\n\nint main(){\n\tint a[100][100];\n\twhile(cin >> m >> n, m){\n\t\tfill((int*)a, (int*)(a+100), 0);\n\t\tfor(int i = 1;i <= n;i++)\n\t\tfor(int j = 1;j <= m;j++)cin >> a[i][j];\n\t\t\n\t\tint ans = 0;\n\t\tfor(int i = 1;i <= n;i++)\n\t\tfor(int j = 1;j <= m;j++)ans = max(ans, dfs(a, i, j));\n\t\tcout << ans << endl;\n\t\t//cout << ans << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 860, "memory_kb": 4348, "score_of_the_acc": -1.9043, "final_rank": 20 }, { "submission_id": "aoj_0535_2274929", "code_snippet": "#include \"iostream\"\n#include \"climits\"\n#include \"list\"\n#include \"queue\"\n#include \"stack\"\n#include \"set\"\n#include \"functional\"\n#include \"algorithm\"\n#include \"math.h\"\n#include \"utility\"\n#include \"string\"\n#include \"map\"\n#include \"unordered_map\"\n#include \"iomanip\"\n#include \"random\"\n\nusing namespace std;\nconst long long int MOD = 1000000007;\n\nint H, W;\nint ans = 0;\n\nvoid Search(int x, int y, vector<vector<bool> >flag, int dis) {\n\tflag[y][x] = false;\n\tint d[5] = { 1,0,-1,0,1 };\n\tfor (int k = 0; k < 4; k++) {\n\t\tif (flag[y + d[k + 1]][x + d[k]]) {\n\t\t\tSearch(x + d[k], y + d[k + 1], flag, dis + 1);\n\t\t}\n\t}\n\tans = max(ans, dis);\n\treturn;\n}\n\nint main() {\n\tcin >> W;\n\tcin >> H;\n\twhile (W&&H) {\n\t\tans = 0;\n\t\tvector<vector<bool> >v(H+2);\n\t\tfor (int i = 1; i <= H; i++) {\n\t\t\tv[i].push_back(0);\n\t\t\tfor (int j = 1; j <= W; j++) {\n\t\t\t\tbool box;\n\t\t\t\tcin >> box;\n\t\t\t\tv[i].push_back(box);\n\t\t\t}\n\t\t\tv[i].push_back(0);\n\t\t}\n\t\tfor (int i = 0; i <= W + 1; i++) {\n\t\t\tv[0].push_back(0);\n\t\t\tv[H + 1].push_back(0);\n\t\t}\n\t\tfor (int i = 1; i <= H; i++) {\n\t\t\tfor (int j = 1; j <= W; j++) {\n\t\t\t\tif(v[i][j])\tSearch(j, i, v, 1);\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t\tcin >> W;\n\t\tcin >> H;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 950, "memory_kb": 3348, "score_of_the_acc": -1.42, "final_rank": 15 }, { "submission_id": "aoj_0535_2166962", "code_snippet": "#include <iostream>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <map>\n#include <utility>\n#include <functional>\n\nusing namespace std;\n\n//????????????\n\nint dx[] = { 0, 1, 0, -1 };\nint dy[] = { -1, 0, 1, 0 };\nint m, n, f[90][90], ans;\nbool used[90][90];\n\nvoid dfs(int y, int x, int d) {\n\tused[y][x] = true;\n\tans = max(ans, d);\n\tfor (int i = 0; i < 4; ++i) {\n\t\tint ny = y + dy[i];\n\t\tint nx = x + dx[i];\n\t\tif (ny < 0 || ny >= n || nx < 0 || nx >= m || f[ny][nx] == 0 || used[ny][nx] == true)\n\t\t\tcontinue;\n\t\tdfs(ny, nx, d + 1);\n\t}\n\tused[y][x] = false;\n}\n\nint main() {\n\twhile (cin >> m >> n && m != 0) {\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tfor (int j = 0; j < m; ++j) {\n\t\t\t\tcin >> f[i][j];\n\t\t\t}\n\t\t}\n\n\t\tans = 0;\n\t\tfor (int i = 0; i < n; ++i) {\n\t\t\tfor (int j = 0; j < m; ++j) {\n\t\t\t\tif (f[i][j]) {\n\t\t\t\t\tfill(used[0], used[n], false);\n\t\t\t\t\tdfs(i, j, 1);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3116, "score_of_the_acc": -0.2854, "final_rank": 4 }, { "submission_id": "aoj_0535_2132145", "code_snippet": "#include<stdio.h>\nint i,j,n,m,y[101][101],max,cnt,dx[4]={0,-1,0,1},dy[4]={-1,0,1,0};\nvoid func(int s,int x)\n{\n\tint ss,xx,i;\n\tfor(i=0;i<4;i++){\n\t\tss=s+dy[i]; xx=x+dx[i];\n\t\tif(y[ss][xx]==1&&0<=ss&&ss<n&&0<=xx&&xx<m){\n\t\t\tcnt++;\n\t\t\ty[ss][xx]=0;\n\t\t\tif(max<cnt) max=cnt;\n\t\t\tfunc(ss,xx);\n\t\t\ty[ss][xx]=1; cnt--;\n\t\t}\n\t}\n}\nint main(void)\n{\n\twhile(1){\n\t\tscanf(\"%d%d\",&m,&n);\n\t\tif(m==0&&n==0) break;\n\t\tfor(i=0;i<n;i++){\n\t\t\tfor(j=0;j<m;j++){\n\t\t\t\tscanf(\"%d\",&y[i][j]);\n\t\t\t}\n\t\t}\n\t\tmax=0;\n\t\tfor(i=0;i<n;i++){\n\t\t\tfor(j=0;j<m;j++){\n\t\t\t\tcnt=0;\n\t\t\t\tfunc(i,j);\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\",max);\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 2624, "score_of_the_acc": 0, "final_rank": 1 } ]
aoj_0531_cpp
ペンキの色 問題 情報オリンピックの宣伝のために,長方形のベニヤ板にペンキを塗り看板を制作したい.ベニヤ板には色を塗りたくないところにあらかじめ何枚かの長方形のマスキングテープが貼られている.そこでマスキングテープで区切られた領域ごとに別々の色を使いペンキを塗ることにした.例えば,図 5-1 の場合は 5 色のペンキを使う. 入力としてマスキングテープを貼る位置が与えられた時,使うペンキの色の数を求めるプログラムを作成せよ.ただし,ベニヤ板全体がマスキングテープで覆われることはなく,全てのマスキングテープの辺はベニヤ板のいずれかの辺に平行である. 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる． 1 行目にはベニヤ板の幅 w (1 ≤ w ≤ 1000000 となる整数) と高さ h (1 ≤ h ≤ 1000000 となる整数) がこの順に空白区切りで書かれている. 2 行目にはマスキングテープの数 n (1 ≤ n ≤ 1000 となる整数) が書かれている. 続く 3 行目以降の 2 + i 行目 (1 ≤ i ≤ n) には,i 番目に貼るマスキングテープの左下の座標 (x 1 , y 1 ) と,右上の座標 (x 2 , y 2 ) が x 1 , y 1 , x 2 , y 2 (0 ≤ x 1 < x 2 ≤ w, 0 ≤ y 1 < y 2 ≤ h となる整数) の順に空白区切りで書かれている. ただし,ベニヤ板の左下の角の座標は (0, 0) で右上の角の座標は (w, h) である. 採点用データのうち, 配点の 30% 分は w ≤ 100, h ≤ 100, n ≤ 100 を満たす. h, w がともに 0 のとき入力の終了を示す. データセットの数は 20 を超えない． 出力 データセットごとに使うペンキの色数を１行に出力する. 入出力例 次の例は図 5-1 の場合である. 入力例 15 6 10 1 4 5 6 2 1 4 5 1 0 5 1 6 1 7 5 7 5 9 6 7 0 9 2 9 1 10 5 11 0 14 1 12 1 13 5 11 5 14 6 0 0 出力例 5 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0531_10539526", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n// 整数ペアを表すエイリアス\nusing pii = pair<int,int>;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n while(true){\n int W, H;\n cin >> W >> H;\n if(!W) break; // W==0 で終了\n\n int N;\n cin >> N;\n\n // 入力される長方形のリスト\n vector<array<int,4>> rects(N);\n // 圧縮用の x, y 座標集合\n vector<int> xs, ys;\n\n for(int i = 0; i < N; i++){\n int x1,y1,x2,y2;\n cin >> x1 >> y1 >> x2 >> y2;\n rects[i] = {x1,y1,x2,y2};\n\n // ±1 マージンも含めて圧縮座標に登録\n for(auto dx : {-1,0,1}){\n int tx1 = x1 + dx, tx2 = x2 + dx;\n if(0 <= tx1 && tx1 < W) xs.push_back(tx1);\n if(0 <= tx2 && tx2 < W) xs.push_back(tx2);\n }\n for(auto dy : {-1,0,1}){\n int ty1 = y1 + dy, ty2 = y2 + dy;\n if(0 <= ty1 && ty1 < H) ys.push_back(ty1);\n if(0 <= ty2 && ty2 < H) ys.push_back(ty2);\n }\n }\n\n // 重複を取り除いてソート\n sort(xs.begin(), xs.end());\n xs.erase(unique(xs.begin(), xs.end()), xs.end());\n sort(ys.begin(), ys.end());\n ys.erase(unique(ys.begin(), ys.end()), ys.end());\n\n // 座標を圧縮インデックスに置き換え\n for(auto& r : rects){\n r[0] = int(lower_bound(xs.begin(), xs.end(), r[0]) - xs.begin());\n r[2] = int(lower_bound(xs.begin(), xs.end(), r[2]) - xs.begin());\n r[1] = int(lower_bound(ys.begin(), ys.end(), r[1]) - ys.begin());\n r[3] = int(lower_bound(ys.begin(), ys.end(), r[3]) - ys.begin());\n }\n\n // 圧縮後のグリッドサイズ\n int w = xs.size(), h = ys.size();\n // 塗られたマスを true にするフィールド\n vector<vector<bool>> field(w, vector<bool>(h, false));\n\n // 長方形ごとに内部を塗りつぶし\n for(auto [x1,y1,x2,y2] : rects){\n for(int x = x1; x < x2; x++){\n for(int y = y1; y < y2; y++){\n field[x][y] = true;\n }\n }\n }\n\n // 未塗りマスの連結領域数をカウント\n int regions = 0;\n array<int,4> dir{0,1,0,-1}; // dx,dy を交互に参照\n\n for(int sx = 0; sx < w; sx++){\n for(int sy = 0; sy < h; sy++){\n if(!field[sx][sy]){\n // 新しい領域を発見\n regions++;\n // BFS で領域を塗りつぶし\n queue<pii> q;\n field[sx][sy] = true;\n q.emplace(sx, sy);\n while(!q.empty()){\n auto [x,y] = q.front();\n q.pop();\n // 4 方向に拡張\n for(int k = 0; k < 4; k++){\n int nx = x + dir[k];\n int ny = y + dir[(k+1)%4];\n if(nx < 0 || nx >= w || ny < 0 || ny >= h) continue;\n if(field[nx][ny]) continue;\n field[nx][ny] = true;\n q.emplace(nx, ny);\n }\n }\n }\n }\n }\n\n // 領域数を出力\n cout << regions << \"\\n\";\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3968, "score_of_the_acc": -0.0072, "final_rank": 2 }, { "submission_id": "aoj_0531_10229506", "code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <queue>\n#include <vector>\nusing namespace std;\n\nint x1[1010], x2[1010], y1[1010], y2[1010], N, W, H;\nbool fid[10010][10010];\nint compress(int x1[], int x2[], int w) {\n vector<int> xs;\n xs.push_back(0);\n xs.push_back(w);\n for (int i = 1; i <= N; ++i)\n for (int d = -1; d <= 1; ++d) {\n int tx1 = x1[i] + d, tx2 = x2[i] + d;\n if (0 <= tx1 && tx1 <= w) xs.push_back(tx1);\n if (0 <= tx2 && tx2 <= w) xs.push_back(tx2);\n }\n sort(xs.begin(), xs.end());\n xs.erase(unique(xs.begin(), xs.end()), xs.end());\n for (int i = 1; i <= N; ++i) {\n x1[i] = find(xs.begin(), xs.end(), x1[i]) - xs.begin() + 1;\n x2[i] = find(xs.begin(), xs.end(), x2[i]) - xs.begin() + 1;\n }\n return xs.size() - 1;\n}\nint bfs() {\n int ans = 0;\n const int flag[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};\n memset(fid, 0, sizeof(fid));\n for (int i = 1; i <= N; ++i)\n for (int y = y1[i]; y < y2[i]; ++y)\n for (int x = x1[i]; x < x2[i]; ++x) fid[x][y] = true;\n for (int i = 1; i <= W; ++i)\n for (int j = 1; j <= H; ++j) {\n if (fid[i][j]) continue;\n ++ans;\n queue<pair<int, int>> que;\n que.push(make_pair(i, j));\n while (!que.empty()) {\n int sx = que.front().first, sy = que.front().second;\n que.pop();\n for (int k = 0; k < 4; ++k) {\n int tx = sx + flag[k][0], ty = sy + flag[k][1];\n if (tx < 1 || tx > W || ty < 1 || ty > H || fid[tx][ty]) continue;\n fid[tx][ty] = true;\n que.push(make_pair(tx, ty));\n }\n }\n }\n return ans;\n}\nint main() {\n //freopen(\"aizu0531.in\", \"r\", stdin);\n while (scanf(\"%d %d\", &W, &H) == 2 && W + H) {\n scanf(\"%d\", &N);\n for (int i = 1; i <= N; ++i)\n scanf(\"%d %d %d %d\", &x1[i], &y1[i], &x2[i], &y2[i]);\n W = compress(x1, x2, W);\n H = compress(y1, y2, H);\n printf(\"%d\\n\", bfs());\n }\n return 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 100804, "score_of_the_acc": -1.018, "final_rank": 19 }, { "submission_id": "aoj_0531_9858617", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nrandom_device seed_gen;mt19937 rnd(seed_gen());\n\nusing ll = long long;using ull = unsigned long long;\nusing vi = vector<int>;using vvi = vector<vi>;using vvvi = vector<vvi>;\nusing vl = vector<ll>;using vvl = vector<vl>;using vvvl = vector<vvl>;\ntemplate<typename T>inline bool chmax(T& a, T b) { return ((a < b) ? (a = b, true) : (false)); }\ntemplate<typename T>inline bool chmin(T& a, T b) { return ((a > b) ? (a = b, true) : (false)); }\nbool eq(double a, double b) { return abs(a - b) < 0.0000001; }\nconst int di4[4] = { 0,-1,0,1 },dj4[4] = { -1,0,1,0 };//LRUD\nconst int di8[8] = { 0,0,1,1,1,-1,-1,-1 },dj8[8] = { 1,-1,0,-1,1,0,-1,1 };\n\n#define rep(i,n) for(int i=0;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define Rrep(i,n) for(int i=n-1;i>=0;i--)\n#define Rrep1(i,n) for(int i=n;i>0;i--)\n#define all(a) a.begin(),a.end()\n#define yesno(ans) cout<<((ans)?\"Yes\\n\":\"No\\n\")\n#define YESNO(ans) cout<<((ans)?\"YES\\n\":\"NO\\n\")\n#define INF ((ll)2e18)\n#define IINF ((int)(1e9+5e8))\nconst double PI = 3.1415926535897932384626;\n#define eb emplace_back\n#define pb push_back\n\n\nint solve();\nint main(){\n int T=1;\n //cin>>T;\n while (1){\n if(solve())break;\n }\n return 0;\n}\n\nint W,H;\nvoid dfs(int i,int j,vvi&memo){\n memo[i][j]=1;\n rep(d,4){\n int ni=i+di4[d];\n int nj=j+dj4[d];\n if(ni<0||ni>=H||nj<0||nj>=W)continue;\n if(memo[ni][nj]==0)dfs(ni,nj,memo);\n }\n}\n\nint solve() {\n cin>>W>>H;\n if(W==0)return 1;\n int N;cin>>N;\n vi X1(N),Y1(N),X2(N),Y2(N);\n vi X,Y;\n rep(i,N){\n cin>>X1[i]>>Y1[i]>>X2[i]>>Y2[i];\n for(int d=-1;d<=1;d++){\n if(X1[i]+d>=0&&X1[i]+d<W)X.pb(X1[i]+d);\n if(X1[i]+d>=0&&X2[i]+d<W)X.pb(X2[i]+d);\n if(Y1[i]+d>=0&&Y1[i]+d<H)Y.pb(Y1[i]+d);\n if(Y2[i]+d>=0&&Y2[i]+d<H)Y.pb(Y2[i]+d);\n }\n }\n sort(all(X));\n sort(all(Y));\n X.erase(unique(all(X)),X.end());\n Y.erase(unique(all(Y)),Y.end());\n H=Y.size();\n W=X.size();\n vvi memo(H+1,vi(W+1));\n rep(i,N){\n X1[i]=lower_bound(all(X),X1[i])-X.begin();\n X2[i]=lower_bound(all(X),X2[i])-X.begin();\n Y1[i]=lower_bound(all(Y),Y1[i])-Y.begin();\n Y2[i]=lower_bound(all(Y),Y2[i])-Y.begin();\n memo[Y1[i]][X1[i]]++;\n memo[Y1[i]][X2[i]]--;\n memo[Y2[i]][X1[i]]--;\n memo[Y2[i]][X2[i]]++;\n }\n rep(i,H+1)rep(j,W)memo[i][j+1]+=memo[i][j];\n rep(i,H)rep(j,W+1)memo[i+1][j]+=memo[i][j];\n\n int ans=0;\n rep(i,H)rep(j,W)if(memo[i][j]==0){\n ans++;\n dfs(i,j,memo);\n }\n cout<<ans<<\"\\n\";\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 34228, "score_of_the_acc": -0.3193, "final_rank": 6 }, { "submission_id": "aoj_0531_9455954", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <utility>\nusing namespace std;\n\nconst int MAX_N = 1000;\nconst int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, -1, 0, 1};\nint w, h, n, x1, x2, y1, y2;\nint xs[MAX_N * 2], ys[MAX_N * 2];\nbool used[MAX_N * 6][MAX_N * 6];\n\nint main() {\n while (cin >> w >> h) {\n if (w == 0 && h == 0)\n break;\n cin >> n;\n for (int i = 0; i < n; i++) {\n cin >> x1 >> y1 >> x2 >> y2;\n xs[i * 2] = x1 * 2; xs[i * 2 + 1] = x2 * 2;\n ys[i * 2] = y1 * 2; ys[i * 2 + 1] = y2 * 2;\n }\n vector<int> xc, yc;\n for (int i = 0; i < n * 2; i++) {\n for (int d = -1; d <= 1; d++) {\n int tx = xs[i] + d, ty = ys[i] + d;\n if (tx >= 0 && tx <= w * 2)\n xc.push_back(tx);\n if (ty >= 0 && ty <= h * 2)\n yc.push_back(ty);\n }\n }\n sort(xc.begin(), xc.end());\n sort(yc.begin(), yc.end());\n xc.erase(unique(xc.begin(), xc.end()), xc.end());\n yc.erase(unique(yc.begin(), yc.end()), yc.end());\n int wc = xc.size(), hc = yc.size();\n fill((bool*)used, (bool*)(used + MAX_N * 6), false);\n for (int i = 0; i < n; i++) {\n x1 = lower_bound(xc.begin(), xc.end(), xs[i * 2]) - xc.begin();\n x2 = lower_bound(xc.begin(), xc.end(), xs[i * 2 + 1]) - xc.begin();\n y1 = lower_bound(yc.begin(), yc.end(), ys[i * 2]) - yc.begin();\n y2 = lower_bound(yc.begin(), yc.end(), ys[i * 2 + 1]) - yc.begin();\n for (int j = x1; j <= x2; j++) {\n for (int k = y1; k <= y2; k++)\n used[j][k] = true;\n }\n }\n int ans = 0;\n queue<pair<int, int>> que;\n for (int i = 0; i < wc; i++) {\n for (int j = 0; j < hc; j++) {\n if (!used[i][j]) {\n ans++;\n que.push(make_pair(i, j));\n used[i][j] = true;\n while (!que.empty()) {\n for (int d = 0; d < 4; d++) {\n int nx = que.front().first + dx[d], ny = que.front().second + dy[d];\n if (nx >= 0 && nx < wc && ny >= 0 && ny < hc && !used[nx][ny]) {\n que.push(make_pair(nx, ny));\n used[nx][ny] = true;\n }\n }\n que.pop();\n }\n }\n }\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 110, "memory_kb": 38552, "score_of_the_acc": -0.4118, "final_rank": 16 }, { "submission_id": "aoj_0531_8861902", "code_snippet": "#include <algorithm>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\n#define y1 hogwhoasjfd\n#define fst first\n#define scd second\n#define PB push_back\n#define MP make_pair\n#define all(a) a.begin(), a.end()\n#define rall(a) a.rbegin(), a.rend()\n#define omajinai \\\n ios::sync_with_stdio(false); \\\n cin.tie(0)\n#define rep(i, x) for (int i = 0; i < (int)(x); ++i)\n#define rep1(i, x) for (int i = 1; i <= (int)(x); ++i)\nusing ll = long long;\nusing ld = long double;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing pii = pair<int, int>;\nusing vpii = vector<pii>;\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> p) {\n os << \"(\" << p.fst << \", \" << p.scd << \")\";\n return os;\n}\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> v) {\n rep(i, v.size()) {\n if (i)\n os << \", \";\n os << v[i];\n }\n return os;\n}\ntemplate <typename T> T &max(T &a, T &b) {\n if (a >= b)\n return a;\n return b;\n}\ntemplate <typename T> T &min(T &a, T &b) {\n if (a < b)\n return a;\n return b;\n}\ntemplate <typename T> bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <typename T> bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\nconstexpr int inf = 1e9;\nconstexpr ll linf = 3e18;\nconstexpr double eps = 1e-9;\nint w, h;\nint n;\nvector<int> x1(1005), x2(1005); // Use vectors instead of fixed-size arrays\nvector<int> y1(1005), y2(1005);\nbool fld[1005 * 6 + 2][1005 * 6 + 2];\nint dx[4] = {-1, 0, 1, 0};\nint dy[4] = {0, -1, 0, 1};\nint compress(vector<int> &x1, vector<int> &x2, int w) { // Use vector references\n vi xs;\n rep(i, n) {\n for (int d = -1; d <= 1; ++d) {\n int tx1 = x1[i] + d, tx2 = x2[i] + d;\n if (0 <= tx1 && tx1 <= w)\n xs.PB(tx1);\n if (0 <= tx2 && tx2 <= w)\n xs.PB(tx2);\n }\n }\n sort(all(xs));\n xs.erase(unique(all(xs)), end(xs));\n rep(i, n) {\n x1[i] = lower_bound(all(xs), x1[i]) - begin(xs);\n x2[i] = lower_bound(all(xs), x2[i]) - begin(xs);\n }\n return xs.size();\n}\nint main() {\n omajinai;\n while (cin >> w >> h, w) {\n cin >> n;\n memset(fld, 0, sizeof fld);\n rep(i, n) { cin >> x1[i] >> y1[i] >> x2[i] >> y2[i]; }\n w = compress(x1, x2, w);\n h = compress(y1, y2, h);\n rep(i, n) {\n for (int y = y1[i]; y <= y2[i] - 1; ++y) {\n for (int x = x1[i]; x <= x2[i] - 1; ++x) {\n fld[y][x] = true;\n }\n }\n }\n int ans = 0;\n rep(y, h - 1) rep(x, w - 1) {\n if (fld[y][x])\n continue;\n ans++;\n queue<pii> q;\n q.push(pii(y, x));\n while (q.size()) {\n pii p = q.front();\n q.pop();\n rep(i, 4) {\n int ny = p.fst + dy[i], nx = p.scd + dx[i];\n if (ny < 0 || ny >= h - 1 || nx < 0 || nx >= w - 1 || fld[ny][nx])\n continue;\n fld[ny][nx] = true;\n q.push(pii(ny, nx));\n }\n }\n }\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 38792, "score_of_the_acc": -0.3664, "final_rank": 8 }, { "submission_id": "aoj_0531_8861900", "code_snippet": "#include <algorithm>\n#include <set>\n#include <queue>\n#include <iostream>\nusing namespace std;\n\n#define rep(i, x) for (int i = 0; i < (int)(x); ++i)\n#define rep1(i, x) for (int i = 1; i <= (int)(x); ++i)\ntypedef pair<int, int> pii;\n\nint w, h, n;\nint x1[1005], x2[1005], y1[1005], y2[1005];\nset<pii> fld;\nint dx[4] = {-1, 0, 1, 0}, dy[4] = {0, -1, 0, 1};\n\nint compress(int *x1, int *x2, int w) {\n vector<int> xs;\n rep(i, n) {\n for (int d = -1; d <= 1; ++d) {\n int tx1 = x1[i] + d, tx2 = x2[i] + d;\n if (0 <= tx1 && tx1 <= w)\n xs.push_back(tx1);\n if (0 <= tx2 && tx2 <= w)\n xs.push_back(tx2);\n }\n }\n sort(xs.begin(), xs.end());\n xs.erase(unique(xs.begin(), xs.end()), xs.end());\n rep(i, n) {\n x1[i] = lower_bound(xs.begin(), xs.end(), x1[i]) - xs.begin();\n x2[i] = lower_bound(xs.begin(), xs.end(), x2[i]) - xs.begin();\n }\n return xs.size();\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n \n while (cin >> w >> h, w) {\n cin >> n;\n fld.clear();\n rep(i, n) { cin >> x1[i] >> y1[i] >> x2[i] >> y2[i]; }\n w = compress(x1, x2, w);\n h = compress(y1, y2, h);\n rep(i, n) {\n for (int y = y1[i]; y <= y2[i] - 1; ++y) {\n for (int x = x1[i]; x <= x2[i] - 1; ++x) {\n fld.insert(make_pair(y, x));\n }\n }\n }\n int ans = 0;\n rep(y, h - 1) rep(x, w - 1) {\n if (fld.find(make_pair(y, x)) != fld.end())\n continue;\n ans++;\n queue<pii> q;\n q.push(make_pair(y, x));\n while (q.size()) {\n pii p = q.front();\n q.pop();\n rep(i, 4) {\n int ny = p.first + dy[i], nx = p.second + dx[i];\n if (ny < 0 || ny >= h - 1 || nx < 0 || nx >= w - 1 || fld.find(make_pair(ny, nx)) != fld.end())\n continue;\n fld.insert(make_pair(ny, nx));\n q.push(make_pair(ny, nx));\n }\n }\n }\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 1690, "memory_kb": 87552, "score_of_the_acc": -1.8633, "final_rank": 20 }, { "submission_id": "aoj_0531_8861899", "code_snippet": "#include <algorithm>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <utility>\n#include <vector>\nusing namespace std;\n#define y1 hogwhoasjfd\n#define fst first\n#define scd second\n#define PB push_back\n#define MP make_pair\n#define all(a) a.begin(), a.end()\n#define rall(a) a.rbegin(), a.rend()\n#define omajinai \\\n ios::sync_with_stdio(false); \\\n cin.tie(0)\n#define rep(i, x) for (int i = 0; i < (int)(x); ++i)\n#define rep1(i, x) for (int i = 1; i <= (int)(x); ++i)\nusing ll = long long;\nusing ld = long double;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing pii = pair<int, int>;\nusing vpii = vector<pii>;\nusing stpii = stack<pii>;\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> p) {\n os << \"(\" << p.fst << \", \" << p.scd << \")\";\n return os;\n}\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> v) {\n rep(i, v.size()) {\n if (i)\n os << \", \";\n os << v[i];\n }\n return os;\n}\ntemplate <typename T> T &max(T &a, T &b) {\n if (a >= b)\n return a;\n return b;\n}\ntemplate <typename T> T &min(T &a, T &b) {\n if (a < b)\n return a;\n return b;\n}\ntemplate <typename T> bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <typename T> bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\nconstexpr int inf = 1e9;\nconstexpr ll linf = 3e18;\nconstexpr double eps = 1e-9;\nint w, h;\nint n;\nint x1[1005], x2[1005];\nint y1[1005], y2[1005];\nbool fld[1005 * 6 + 2][1005 * 6 + 2];\nint dx[4] = {-1, 0, 1, 0};\nint dy[4] = {0, -1, 0, 1};\nint compress(int *x1, int *x2, int w) {\n vi xs;\n rep(i, n) {\n for (int d = -1; d <= 1; ++d) {\n int tx1 = x1[i] + d, tx2 = x2[i] + d;\n if (0 <= tx1 && tx1 <= w)\n xs.PB(tx1);\n if (0 <= tx2 && tx2 <= w)\n xs.PB(tx2);\n }\n }\n sort(all(xs));\n xs.erase(unique(all(xs)), end(xs));\n rep(i, n) {\n x1[i] = lower_bound(all(xs), x1[i]) - begin(xs);\n x2[i] = lower_bound(all(xs), x2[i]) - begin(xs);\n }\n return xs.size();\n}\nint main() {\n omajinai;\n while (cin >> w >> h, w) {\n cin >> n;\n memset(fld, 0, sizeof fld);\n rep(i, n) { cin >> x1[i] >> y1[i] >> x2[i] >> y2[i]; }\n w = compress(x1, x2, w);\n h = compress(y1, y2, h);\n rep(i, n) {\n for (int y = y1[i]; y <= y2[i] - 1; ++y) {\n memset(fld[y] + x1[i], 1, x2[i] - x1[i]); // use memset instead of inner loop\n }\n }\n int ans = 0;\n rep(y, h - 1) rep(x, w - 1) {\n if (fld[y][x])\n continue;\n ans++;\n stpii s; // use stack instead of queue\n s.push(pii(y, x));\n while (s.size()) {\n pii p = s.top();\n s.pop();\n rep(i, 4) {\n int ny = p.fst + dy[i], nx = p.scd + dx[i];\n if (ny < 0 || ny >= h - 1 || nx < 0 || nx >= w - 1 || fld[ny][nx])\n continue;\n fld[ny][nx] = true;\n s.push(pii(ny, nx));\n }\n }\n }\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 40920, "score_of_the_acc": -0.3943, "final_rank": 15 }, { "submission_id": "aoj_0531_8861895", "code_snippet": "#include <iostream>\n#include <vector>\n#include <set>\n#include <queue>\n#include <cstring>\n\nusing namespace std;\n\n#define rep(i, x) for (int i = 0; i < (int)(x); ++i)\n#define all(a) a.begin(), a.end()\n\nusing vi = vector<int>;\nusing pii = pair<int, int>;\n\nconstexpr int dx[4] = {-1, 0, 1, 0};\nconstexpr int dy[4] = {0, -1, 0, 1};\n\nint w, h;\nint n;\nint x1[1005], x2[1005];\nint y1[1005], y2[1005];\nbool fld[1005 * 6 + 2][1005 * 6 + 2];\n\nint compress(int *x1, int *x2, int w) {\n set<int> xs;\n rep(i, n) {\n for (int d = -1; d <= 1; ++d) {\n int tx1 = x1[i] + d, tx2 = x2[i] + d;\n if (0 <= tx1 && tx1 <= w)\n xs.insert(tx1);\n if (0 <= tx2 && tx2 <= w)\n xs.insert(tx2);\n }\n }\n\n vi vxs(all(xs));\n rep(i, n) {\n x1[i] = lower_bound(all(vxs), x1[i]) - vxs.begin();\n x2[i] = lower_bound(all(vxs), x2[i]) - vxs.begin();\n }\n \n return vxs.size();\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n \n while (cin >> w >> h, w) {\n cin >> n;\n memset(fld, 0, sizeof fld);\n rep(i, n) { cin >> x1[i] >> y1[i] >> x2[i] >> y2[i]; }\n w = compress(x1, x2, w);\n h = compress(y1, y2, h);\n\n rep(i, n) {\n for (int y = y1[i]; y <= y2[i] - 1; ++y) {\n for (int x = x1[i]; x <= x2[i] - 1; ++x) {\n fld[y][x] = true;\n }\n }\n }\n \n int ans = 0;\n rep(y, h - 1) rep(x, w - 1) {\n if (fld[y][x])\n continue;\n ans++;\n queue<pii> q;\n q.push(pii(y, x));\n fld[y][x] = true;\n while (!q.empty()) {\n pii p = q.front();\n q.pop();\n rep(i, 4) {\n int ny = p.first + dy[i], nx = p.second + dx[i];\n if (ny < 0 || ny >= h - 1 || nx < 0 || nx >= w - 1 || fld[ny][nx])\n continue;\n q.push(pii(ny, nx));\n fld[ny][nx] = true;\n }\n }\n }\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 38900, "score_of_the_acc": -0.3675, "final_rank": 9 }, { "submission_id": "aoj_0531_8861889", "code_snippet": "#include <algorithm>\n#include <vector>\n#include <unordered_map>\n#include <iostream>\n#include <cstring>\nusing namespace std;\n\n#define rep(i, x) for (int i = 0; i < (int)(x); ++i)\n#define all(a) a.begin(), a.end()\nusing pii = pair<int, int>;\n\nint w, h;\nint n;\nint x1[1005], x2[1005];\nint y1[1005], y2[1005];\nbool fld[1005 * 6 + 2][1005 * 6 + 2];\n\nint compress(int *x1, int *x2, int w) {\n vector<int> xs;\n rep(i, n) {\n for (int d = -1; d <= 1; ++d) {\n int tx1 = x1[i] + d, tx2 = x2[i] + d;\n if (0 <= tx1 && tx1 <= w)\n xs.push_back(tx1);\n if (0 <= tx2 && tx2 <= w)\n xs.push_back(tx2);\n }\n }\n sort(all(xs));\n xs.erase(unique(all(xs)), end(xs));\n \n unordered_map<int, int> xs_map;\n int idx = 0;\n for(int x : xs)\n xs_map[x] = idx++;\n\n rep(i, n) {\n x1[i] = xs_map[x1[i]];\n x2[i] = xs_map[x2[i]];\n }\n return xs.size();\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n while (cin >> w >> h, w) {\n cin >> n;\n memset(fld, 0, sizeof fld);\n rep(i, n) { cin >> x1[i] >> y1[i] >> x2[i] >> y2[i]; }\n w = compress(x1, x2, w);\n h = compress(y1, y2, h);\n rep(i, n) {\n for (int y = y1[i]; y <= y2[i] - 1; ++y) {\n for (int x = x1[i]; x <= x2[i] - 1; ++x) {\n fld[y][x] = true;\n }\n }\n }\n int ans = 0;\n vector<pii> q;\n int head = 0; // Our manual queue head index\n rep(y, h - 1) rep(x, w - 1) {\n if (fld[y][x])\n continue;\n ans++;\n q.push_back(pii(y, x));\n fld[y][x] = true;\n while (head < q.size()) {\n pii p = q[head++];\n int ny, nx;\n ny = p.first - 1, nx = p.second;\n if (ny >= 0 && !fld[ny][nx]) {\n q.push_back(pii(ny, nx));\n fld[ny][nx] = true;\n }\n ny = p.first, nx = p.second - 1;\n if (nx >= 0 && !fld[ny][nx]) {\n q.push_back(pii(ny, nx));\n fld[ny][nx] = true;\n }\n ny = p.first + 1, nx = p.second;\n if (ny < h - 1 && !fld[ny][nx]) {\n q.push_back(pii(ny, nx));\n fld[ny][nx] = true;\n }\n ny = p.first, nx = p.second + 1;\n if (nx < w - 1 && !fld[ny][nx]) {\n q.push_back(pii(ny, nx));\n fld[ny][nx] = true;\n }\n }\n }\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 64176, "score_of_the_acc": -0.6282, "final_rank": 18 }, { "submission_id": "aoj_0531_8819601", "code_snippet": "#include <algorithm>\n#include <climits>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <deque>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <vector>\nusing namespace std;\n#define fst first\n#define scd second\n#define PB push_back\n#define MP make_pair\n#define all(a) a.begin(), a.end()\n#define rall(a) a.rbegin(), a.rend()\n#define omajinai ios::sync_with_stdio(false); cin.tie(0)\n#define rep(i, x) for (int i = 0; i < (int)(x); ++i)\n#define rep1(i, x) for (int i = 1; i <= (int)(x); ++i)\nusing ll = long long;\nusing vi = vector<int>;\nusing pii = pair<int, int>;\nusing vpii = vector<pii>;\nconstexpr int inf = 1e9;\nconstexpr ll linf = 3e18;\nconstexpr double eps = 1e-9;\nint w, h;\nint n;\nint x1[1005], x2[1005];\nint y1[1005], y2[1005];\nbool fld[1005 * 6 + 2][1005 * 6 + 2];\nint dx[4] = {-1, 0, 1, 0};\nint dy[4] = {0, -1, 0, 1};\nint compress(int *x1, int *x2, int w) {\n vi xs;\n rep(i, n) {\n for (int d = -1; d <= 1; ++d) {\n int tx1 = x1[i] + d, tx2 = x2[i] + d;\n if (0 <= tx1 && tx1 <= w)\n xs.PB(tx1);\n if (0 <= tx2 && tx2 <= w)\n xs.PB(tx2);\n }\n }\n sort(all(xs));\n xs.erase(unique(all(xs)), end(xs));\n rep(i, n) {\n x1[i] = lower_bound(all(xs), x1[i]) - begin(xs);\n x2[i] = lower_bound(all(xs), x2[i]) - begin(xs);\n }\n return xs.size();\n}\nint main() {\n omajinai;\n while (cin >> w >> h, w) {\n cin >> n;\n memset(fld, 0, sizeof fld);\n rep(i, n) { cin >> x1[i] >> y1[i] >> x2[i] >> y2[i]; }\n w = compress(x1, x2, w);\n h = compress(y1, y2, h);\n rep(i, n) {\n for (int y = y1[i]; y <= y2[i] - 1; ++y) {\n for (int x = x1[i]; x <= x2[i] - 1; ++x) {\n fld[y][x] = true;\n }\n }\n }\n int ans = 0;\n rep(y, h - 1) rep(x, w - 1) {\n if (fld[y][x])\n continue;\n ans++;\n queue<pii> q;\n q.push(pii(y, x));\n while (q.size()) {\n pii p = q.front();\n q.pop();\n rep(i, 4) {\n int ny = p.fst + dy[i], nx = p.scd + dx[i];\n if (ny < 0 || ny >= h - 1 || nx < 0 || nx >= w - 1 || fld[ny][nx])\n continue;\n fld[ny][nx] = true;\n q.push(pii(ny, nx));\n }\n }\n }\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 38720, "score_of_the_acc": -0.3716, "final_rank": 13 }, { "submission_id": "aoj_0531_8819600", "code_snippet": "#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <queue>\n#include <cstring>\nusing namespace std;\n\nconstexpr int inf = 1e9;\nconstexpr long long linf = 3e18;\nconstexpr double eps = 1e-9;\nconstexpr int dx[4] = {-1, 0, 1, 0};\nconstexpr int dy[4] = {0, -1, 0, 1};\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n int w, h, n;\n while (cin >> w >> h, w) {\n cin >> n;\n\n vector<int> x1(n), x2(n), y1(n), y2(n);\n vector<vector<bool>> fld(h, vector<bool>(w, false));\n\n for (int i = 0; i < n; ++i) {\n cin >> x1[i] >> y1[i] >> x2[i] >> y2[i];\n }\n\n for (int i = 0; i < n; ++i) {\n for (int y = y1[i]; y <= y2[i] - 1; ++y) {\n for (int x = x1[i]; x <= x2[i] - 1; ++x) {\n fld[y][x] = true;\n }\n }\n }\n\n int ans = 0;\n for (int y = 0; y < h - 1; ++y) {\n for (int x = 0; x < w - 1; ++x) {\n if (fld[y][x])\n continue;\n ans++;\n queue<pair<int, int>> q;\n q.push(make_pair(y, x));\n while (!q.empty()) {\n pair<int, int> p = q.front();\n q.pop();\n for (int i = 0; i < 4; ++i) {\n int ny = p.first + dy[i], nx = p.second + dx[i];\n if (ny < 0 || ny >= h - 1 || nx < 0 || nx >= w - 1 || fld[ny][nx])\n continue;\n fld[ny][nx] = true;\n q.push(make_pair(ny, nx));\n }\n }\n }\n }\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 160, "memory_kb": 4580, "score_of_the_acc": -0.0914, "final_rank": 5 }, { "submission_id": "aoj_0531_8819599", "code_snippet": "#include <cstdio>\n#include <cstring>\n#include <algorithm>\n#include <deque>\n#include <vector>\nusing namespace std;\n#define rep(i, x) for (int i = 0; i < (int)(x); ++i)\n#define all(a) a.begin(), a.end()\n#define PB push_back\nusing ll = long long;\nusing pii = pair<int, int>;\nusing vi = vector<int>;\nconstexpr int inf = 1e9;\nconstexpr ll linf = 3e18;\nconstexpr double eps = 1e-9;\nint w, h;\nint n;\nint x1[1005], x2[1005];\nint y1[1005], y2[1005];\nbool fld[1005 * 6 + 2][1005 * 6 + 2];\nint dx[4] = {-1, 0, 1, 0};\nint dy[4] = {0, -1, 0, 1};\nint compress(int *x1, int *x2, int w) {\n vi xs;\n rep(i, n) {\n for (int d = -1; d <= 1; ++d) {\n int tx1 = x1[i] + d, tx2 = x2[i] + d;\n if (0 <= tx1 && tx1 <= w)\n xs.PB(tx1);\n if (0 <= tx2 && tx2 <= w)\n xs.PB(tx2);\n }\n }\n sort(all(xs));\n xs.erase(unique(all(xs)), end(xs));\n rep(i, n) {\n x1[i] = lower_bound(all(xs), x1[i]) - begin(xs);\n x2[i] = lower_bound(all(xs), x2[i]) - begin(xs);\n }\n return xs.size();\n}\nint main() {\n while (scanf(\"%d%d\", &w, &h), w) {\n scanf(\"%d\", &n);\n memset(fld, 0, sizeof fld);\n rep(i, n) { scanf(\"%d%d%d%d\", &x1[i], &y1[i], &x2[i], &y2[i]); }\n w = compress(x1, x2, w);\n h = compress(y1, y2, h);\n rep(i, n) {\n for (int y = y1[i]; y <= y2[i] - 1; ++y) {\n for (int x = x1[i]; x <= x2[i] - 1; ++x) {\n fld[y][x] = true;\n }\n }\n }\n int ans = 0;\n rep(y, h - 1) rep(x, w - 1) {\n if (fld[y][x])\n continue;\n ans++;\n deque<pii> q;\n q.push_back(pii(y, x));\n while (!q.empty()) {\n pii p = q.front();\n q.pop_front();\n rep(i, 4) {\n int ny = p.first + dy[i], nx = p.second + dx[i];\n if (ny < 0 || ny >= h - 1 || nx < 0 || nx >= w - 1 || fld[ny][nx])\n continue;\n fld[ny][nx] = true;\n q.push_back(pii(ny, nx));\n }\n }\n }\n printf(\"%d\\n\", ans);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 38476, "score_of_the_acc": -0.3631, "final_rank": 7 }, { "submission_id": "aoj_0531_8819598", "code_snippet": "#include <algorithm>\n#include <array>\n#include <cmath>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <unordered_set>\n#include <utility>\n#include <vector>\n\nusing namespace std;\n#define y1 hogwhoasjfd\n#define fst first\n#define scd second\n#define PB push_back\n#define MP make_pair\n#define all(a) a.begin(), a.end()\n#define rall(a) a.rbegin(), a.rend()\n#define omajinai ios::sync_with_stdio(false); cin.tie(0)\n#define rep(i, x) for (int i = 0; i < (int)(x); ++i)\n\nusing ll = long long;\nusing ld = long double;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing pii = pair<int, int>;\nusing vpii = vector<pii>;\n\nconstexpr int inf = 1e9;\nconstexpr ll linf = 3e18;\nconstexpr double eps = 1e-9;\nint w, h;\nint n;\narray<int, 1005> x1, x2;\narray<int, 1005> y1, y2;\nbool fld[1005 * 6 + 2][1005 * 6 + 2];\narray<int, 4> dx = {-1, 0, 1, 0};\narray<int, 4> dy = {0, -1, 0, 1};\n\nint compress(array<int, 1005> &x1, array<int, 1005> &x2, int w) {\n unordered_set<int> xs;\n rep(i, n) {\n for (int d = -1; d <= 1; ++d) {\n int tx1 = x1[i] + d, tx2 = x2[i] + d;\n if (0 <= tx1 && tx1 <= w)\n xs.insert(tx1);\n if (0 <= tx2 && tx2 <= w)\n xs.insert(tx2);\n }\n }\n vi xs_sorted(xs.begin(), xs.end());\n sort(xs_sorted.begin(), xs_sorted.end());\n rep(i, n) {\n x1[i] = lower_bound(xs_sorted.begin(), xs_sorted.end(), x1[i]) - xs_sorted.begin();\n x2[i] = lower_bound(xs_sorted.begin(), xs_sorted.end(), x2[i]) - xs_sorted.begin();\n }\n return xs.size();\n}\n\nint main() {\n omajinai;\n while (cin >> w >> h, w) {\n cin >> n;\n memset(fld, 0, sizeof fld);\n rep(i, n) { cin >> x1[i] >> y1[i] >> x2[i] >> y2[i]; }\n w = compress(x1, x2, w);\n h = compress(y1, y2, h);\n rep(i, n) {\n for (int y = y1[i]; y <= y2[i] - 1; ++y) {\n for (int x = x1[i]; x <= x2[i] - 1; ++x) {\n fld[y][x] = true;\n }\n }\n }\n int ans = 0;\n rep(y, h - 1) rep(x, w - 1) {\n if (fld[y][x])\n continue;\n ans++;\n queue<pii> q;\n q.emplace(y, x);\n while (!q.empty()) {\n pii p = q.front();\n q.pop();\n rep(i, 4) {\n int ny = p.fst + dy[i], nx = p.scd + dx[i];\n if (ny < 0 || ny >= h - 1 || nx < 0 || nx >= w - 1 || fld[ny][nx])\n continue;\n fld[ny][nx] = true;\n q.emplace(ny, nx);\n }\n }\n }\n cout << ans << '\\n';\n }\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 38960, "score_of_the_acc": -0.3741, "final_rank": 14 }, { "submission_id": "aoj_0531_8819597", "code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <queue>\n#include <vector>\nusing namespace std;\n#define fst first\n#define scd second\n#define PB push_back\n#define MP make_pair\n#define all(a) a.begin(), a.end()\n#define rall(a) a.rbegin(), a.rend()\n#define omajinai ios::sync_with_stdio(false); cin.tie(0)\n#define rep(i, x) for (int i = 0; i < (int)(x); ++i)\n#define rep1(i, x) for (int i = 1; i <= (int)(x); ++i)\nusing ll = long long;\nusing ld = long double;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing pii = pair<int, int>;\nusing vpii = vector<pii>;\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const pair<T, U> &p) {\n os << \"(\" << p.fst << \", \" << p.scd << \")\";\n return os;\n}\ntemplate <class T> ostream &operator<<(ostream &os, const vector<T> &v) {\n rep(i, v.size()) {\n if (i)\n os << \", \";\n os << v[i];\n }\n return os;\n}\ntemplate <typename T> const T &max(const T &a, const T &b) {\n if (a >= b)\n return a;\n return b;\n}\ntemplate <typename T> const T &min(const T &a, const T &b) {\n if (a < b)\n return a;\n return b;\n}\ntemplate <typename T> bool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <typename T> bool chmin(T &a, const T &b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\nconstexpr int inf = 1e9;\nconstexpr ll linf = 3e18;\nconstexpr double eps = 1e-9;\nint w, h;\nint n;\nint x1[1005], x2[1005];\nint y1[1005], y2[1005];\nbool fld[6010][6010];\nint dx[4] = {-1, 0, 1, 0};\nint dy[4] = {0, -1, 0, 1};\nint compress(int *x1, int *x2, int w) {\n vi xs;\n rep(i, n) {\n for (int d = -1; d <= 1; ++d) {\n int tx1 = x1[i] + d, tx2 = x2[i] + d;\n if (0 <= tx1 && tx1 <= w)\n xs.PB(tx1);\n if (0 <= tx2 && tx2 <= w)\n xs.PB(tx2);\n }\n }\n sort(all(xs));\n xs.erase(unique(all(xs)), end(xs));\n rep(i, n) {\n x1[i] = lower_bound(all(xs), x1[i]) - begin(xs);\n x2[i] = lower_bound(all(xs), x2[i]) - begin(xs);\n }\n return xs.size();\n}\nint main() {\n omajinai;\n while (cin >> w >> h, w) {\n cin >> n;\n memset(fld, 0, sizeof fld);\n rep(i, n) { cin >> x1[i] >> y1[i] >> x2[i] >> y2[i]; }\n w = compress(x1, x2, w);\n h = compress(y1, y2, h);\n rep(i, n) {\n for (int y = y1[i]; y <= y2[i] - 1; ++y) {\n for (int x = x1[i]; x <= x2[i] - 1; ++x) {\n fld[y][x] = true;\n }\n }\n }\n int ans = 0;\n rep(y, h - 1) rep(x, w - 1) {\n if (fld[y][x])\n continue;\n ans++;\n queue<pii> q;\n q.push(pii(y, x));\n while (q.size()) {\n pii p = q.front();\n q.pop();\n rep(i, 4) {\n int ny = p.fst + dy[i], nx = p.scd + dx[i];\n if (ny < 0 || ny >= h - 1 || nx < 0 || nx >= w - 1 || fld[ny][nx])\n continue;\n fld[ny][nx] = true;\n q.push(pii(ny, nx));\n }\n }\n }\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 38648, "score_of_the_acc": -0.3709, "final_rank": 12 }, { "submission_id": "aoj_0531_8819593", "code_snippet": "#include <algorithm>\n#include <iostream>\n#include <vector>\n#include <queue>\n#include <cstring>\nusing namespace std;\nusing pii = pair<int, int>;\nconstexpr int dx[4] = {-1, 0, 1, 0};\nconstexpr int dy[4] = {0, -1, 0, 1};\nint w, h;\nint n;\nint x1[1005], x2[1005];\nint y1[1005], y2[1005];\nbool fld[1005 * 6 + 2][1005 * 6 + 2];\n\nint compress(int *x1, int *x2, int w) {\n vector<int> xs;\n for (int i = 0; i < n; ++i) {\n for (int d = -1; d <= 1; ++d) {\n int tx1 = x1[i] + d, tx2 = x2[i] + d;\n if (0 <= tx1 && tx1 <= w)\n xs.push_back(tx1);\n if (0 <= tx2 && tx2 <= w)\n xs.push_back(tx2);\n }\n }\n sort(xs.begin(), xs.end());\n xs.erase(unique(xs.begin(), xs.end()), xs.end());\n for (int i = 0; i < n; ++i) {\n x1[i] = lower_bound(xs.begin(), xs.end(), x1[i]) - xs.begin();\n x2[i] = lower_bound(xs.begin(), xs.end(), x2[i]) - xs.begin();\n }\n return xs.size();\n}\n\nint main() {\n ios::sync_with_stdio(false); \n cin.tie(0);\n while (cin >> w >> h, w) {\n cin >> n;\n memset(fld, 0, sizeof fld);\n for (int i = 0; i < n; ++i) { cin >> x1[i] >> y1[i] >> x2[i] >> y2[i]; }\n w = compress(x1, x2, w);\n h = compress(y1, y2, h);\n for (int i = 0; i < n; ++i) {\n for (int y = y1[i]; y <= y2[i] - 1; ++y) {\n for (int x = x1[i]; x <= x2[i] - 1; ++x) {\n fld[y][x] = true;\n }\n }\n }\n int ans = 0;\n for (int y = 0; y < h - 1; ++y) {\n for (int x = 0; x < w - 1; ++x) {\n if (fld[y][x])\n continue;\n ans++;\n queue<pii> q;\n q.emplace(y, x);\n while (q.size()) {\n pii p = q.front();\n q.pop();\n for (int i = 0; i < 4; ++i) {\n int ny = p.first + dy[i], nx = p.second + dx[i];\n if (ny < 0 || ny >= h - 1 || nx < 0 || nx >= w - 1 || fld[ny][nx])\n continue;\n fld[ny][nx] = true;\n q.emplace(ny, nx);\n }\n }\n }\n }\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 38944, "score_of_the_acc": -0.368, "final_rank": 10 }, { "submission_id": "aoj_0531_8807548", "code_snippet": "#include <algorithm>\n#include <iostream>\n#include <queue>\n#include <vector>\n\nconstexpr int inf = 1e9;\n\nint w, h;\nint n;\nstd::vector<int> x1, x2, y1, y2;\nstd::vector<std::vector<bool>> fld;\nstd::vector<int> dx = {-1, 0, 1, 0};\nstd::vector<int> dy = {0, -1, 0, 1};\n\nint compress(std::vector<int>& x1, std::vector<int>& x2, int w) {\n std::vector<int> xs;\n for (int i = 0; i < n; ++i) {\n for (int d = -1; d <= 1; ++d) {\n int tx1 = x1[i] + d, tx2 = x2[i] + d;\n if (0 <= tx1 && tx1 <= w) xs.push_back(tx1);\n if (0 <= tx2 && tx2 <= w) xs.push_back(tx2);\n }\n }\n std::sort(xs.begin(), xs.end());\n xs.erase(std::unique(xs.begin(), xs.end()), xs.end());\n for (int i = 0; i < n; ++i) {\n x1[i] = std::lower_bound(xs.begin(), xs.end(), x1[i]) - xs.begin();\n x2[i] = std::lower_bound(xs.begin(), xs.end(), x2[i]) - xs.begin();\n }\n return xs.size();\n}\n\nint main() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(0);\n\n while (std::cin >> w >> h, w) {\n std::cin >> n;\n\n x1.resize(n);\n x2.resize(n);\n y1.resize(n);\n y2.resize(n);\n\n for (int i = 0; i < n; ++i) {\n std::cin >> x1[i] >> y1[i] >> x2[i] >> y2[i];\n }\n\n w = compress(x1, x2, w);\n h = compress(y1, y2, h);\n\n fld.assign(h, std::vector<bool>(w, false));\n\n for (int i = 0; i < n; ++i) {\n for (int y = y1[i]; y <= y2[i] - 1; ++y) {\n for (int x = x1[i]; x <= x2[i] - 1; ++x) {\n fld[y][x] = true;\n }\n }\n }\n\n int ans = 0;\n for (int y = 0; y < h - 1; ++y) {\n for (int x = 0; x < w - 1; ++x) {\n if (fld[y][x]) continue;\n ++ans;\n std::deque<std::pair<int, int>> q;\n q.push_back(std::make_pair(y, x));\n while (!q.empty()) {\n std::pair<int, int> p = q.front();\n q.pop_front();\n for (int i = 0; i < 4; ++i) {\n int ny = p.first + dy[i], nx = p.second + dx[i];\n if (ny < 0 || ny >= h - 1 || nx < 0 || nx >= w - 1 || fld[ny][nx])\n continue;\n fld[ny][nx] = true;\n q.push_back(std::make_pair(ny, nx));\n }\n }\n }\n }\n\n std::cout << ans << \"\\n\";\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3848, "score_of_the_acc": -0.006, "final_rank": 1 }, { "submission_id": "aoj_0531_8807543", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cstring>\n#include <queue>\n\nusing namespace std;\n\nint w, h;\nint n;\nint x1[1005], x2[1005];\nint y1[1005], y2[1005];\nbool fld[1005 * 6 + 2][1005 * 6 + 2];\nint dx[4] = {-1, 0, 1, 0};\nint dy[4] = {0, -1, 0, 1};\n\nint compress(int *x1, int *x2, int w) {\n vector<int> xs;\n for (int i = 0; i < n; ++i) {\n for (int d = -1; d <= 1; ++d) {\n int tx1 = x1[i] + d, tx2 = x2[i] + d;\n if (0 <= tx1 && tx1 <= w)\n xs.push_back(tx1);\n if (0 <= tx2 && tx2 <= w)\n xs.push_back(tx2);\n }\n }\n sort(xs.begin(), xs.end());\n xs.erase(unique(xs.begin(), xs.end()), xs.end());\n for (int i = 0; i < n; ++i) {\n int val = lower_bound(xs.begin(), xs.end(), x1[i]) - xs.begin();\n x1[i] = val;\n val = lower_bound(xs.begin(), xs.end(), x2[i]) - xs.begin();\n x2[i] = val;\n }\n return xs.size();\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n while (cin >> w >> h, w) {\n cin >> n;\n memset(fld, 0, sizeof fld);\n for (int i = 0; i < n; ++i) {\n cin >> x1[i] >> y1[i] >> x2[i] >> y2[i];\n }\n w = compress(x1, x2, w);\n h = compress(y1, y2, h);\n for (int i = 0; i < n; ++i) {\n for (int y = y1[i]; y <= y2[i] - 1; ++y) {\n for (int x = x1[i]; x <= x2[i] - 1; ++x) {\n fld[y][x] = true;\n }\n }\n }\n int ans = 0;\n for (int y = 0; y < h - 1; ++y) {\n for (int x = 0; x < w - 1; ++x) {\n if (fld[y][x])\n continue;\n ans++;\n queue<pair<int, int>> q;\n q.push({y, x});\n while (!q.empty()) {\n pair<int, int> p = q.front();\n q.pop();\n for (int i = 0; i < 4; ++i) {\n int ny = p.first + dy[i], nx = p.second + dx[i];\n if (ny < 0 || ny >= h - 1 || nx < 0 || nx >= w - 1 || fld[ny][nx])\n continue;\n fld[ny][nx] = true;\n q.push({ny, nx});\n }\n }\n }\n }\n cout << ans << endl;\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 38956, "score_of_the_acc": -0.3681, "final_rank": 11 }, { "submission_id": "aoj_0531_8807539", "code_snippet": "#include <algorithm>\n#include <iostream>\n#include <queue>\n#include <unordered_set>\n#include <vector>\n\nconstexpr int inf = 1e9;\n\nint w, h;\nint n;\nstd::vector<int> x1, x2, y1, y2;\nstd::vector<std::vector<bool>> fld;\nstd::vector<int> dx = {-1, 0, 1, 0};\nstd::vector<int> dy = {0, -1, 0, 1};\n\nint compress(std::vector<int>& x1, std::vector<int>& x2, int w) {\n std::unordered_set<int> xs;\n for (int i = 0; i < n; ++i) {\n for (int d = -1; d <= 1; ++d) {\n int tx1 = x1[i] + d, tx2 = x2[i] + d;\n if (0 <= tx1 && tx1 <= w)\n xs.insert(tx1);\n if (0 <= tx2 && tx2 <= w)\n xs.insert(tx2);\n }\n }\n std::vector<int> sorted_xs(xs.begin(), xs.end());\n std::sort(sorted_xs.begin(), sorted_xs.end());\n for (int i = 0; i < n; ++i) {\n x1[i] = std::lower_bound(sorted_xs.begin(), sorted_xs.end(), x1[i]) - sorted_xs.begin();\n x2[i] = std::lower_bound(sorted_xs.begin(), sorted_xs.end(), x2[i]) - sorted_xs.begin();\n }\n return sorted_xs.size();\n}\n\nint main() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(0);\n\n while (std::cin >> w >> h, w) {\n std::cin >> n;\n x1.resize(n);\n x2.resize(n);\n y1.resize(n);\n y2.resize(n);\n fld.assign(6 * w + 2, std::vector<bool>(6 * h + 2, false));\n\n for (int i = 0; i < n; ++i) {\n std::cin >> x1[i] >> y1[i] >> x2[i] >> y2[i];\n }\n\n w = compress(x1, x2, w);\n h = compress(y1, y2, h);\n\n for (int i = 0; i < n; ++i) {\n for (int y = y1[i]; y <= y2[i] - 1; ++y) {\n for (int x = x1[i]; x <= x2[i] - 1; ++x) {\n fld[y][x] = true;\n }\n }\n }\n\n int ans = 0;\n for (int y = 0; y < h - 1; ++y) {\n for (int x = 0; x < w - 1; ++x) {\n if (fld[y][x])\n continue;\n\n ans++;\n std::queue<std::pair<int, int>> q;\n q.emplace(y, x);\n\n while (!q.empty()) {\n std::pair<int, int> p = q.front();\n q.pop();\n\n for (int i = 0; i < 4; ++i) {\n int ny = p.first + dy[i], nx = p.second + dx[i];\n if (ny < 0 || ny >= h - 1 || nx < 0 || nx >= w - 1 || fld[ny][nx])\n continue;\n fld[ny][nx] = true;\n q.emplace(ny, nx);\n }\n }\n }\n }\n\n std::cout << ans << \"\\n\";\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 48384, "score_of_the_acc": -0.4773, "final_rank": 17 }, { "submission_id": "aoj_0531_8314331", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <queue>\nusing namespace std;\ntypedef pair<int, int> P;\nint x[6007], y[6007], xLen, yLen, w, h, x_1[1007], x_2[1007], y_1[1007], y_2[1007], n, ans;\nint dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};\nbool field[6007][6007];\nqueue<P> que;\nvoid input()\n{\n ans = 0;\n scanf(\"%d\", &n);\n for (int i = 0; i < n; i++)\n {\n scanf(\"%d%d%d%d\", &x_1[i], &y_1[i], &x_2[i], &y_2[i]);\n }\n}\nvoid compress()\n{\n xLen = 0;\n for (int i = 0; i < n; i++)\n {\n if (x_1[i] > 0)\n {\n x[xLen++] = x_1[i] - 1;\n }\n x[xLen++] = x_1[i];\n if (x_1[i] < w)\n {\n x[xLen++] = x_1[i] + 1;\n }\n if (x_2[i] > 0)\n {\n x[xLen++] = x_2[i] - 1;\n }\n x[xLen++] = x_2[i];\n if (x_2[i] < w)\n {\n x[xLen++] = x_2[i] + 1;\n }\n }\n yLen = 0;\n for (int i = 0; i < n; i++)\n {\n if (y_1[i] > 0)\n {\n y[yLen++] = y_1[i] - 1;\n }\n y[yLen++] = y_1[i];\n if (y_1[i] < h)\n {\n y[yLen++] = y_1[i] + 1;\n }\n if (y_2[i] > 0)\n {\n y[yLen++] = y_2[i] - 1;\n }\n y[yLen++] = y_2[i];\n if (y_2[i] < h)\n {\n y[yLen++] = y_2[i] + 1;\n }\n }\n sort(x, x + xLen);\n sort(y, y + yLen);\n}\nvoid distinctBy2Posinter()\n{\n int tmpLen = 1;\n for (int i = 1; i < xLen; i++)\n {\n if (x[tmpLen - 1] != x[i])\n {\n x[tmpLen++] = x[i];\n }\n }\n xLen = tmpLen;\n tmpLen = 1;\n for (int i = 1; i < yLen; i++)\n {\n if (y[tmpLen - 1] != y[i])\n {\n y[tmpLen++] = y[i];\n }\n }\n yLen = tmpLen;\n}\nvoid handleX_1X_2Y_1Y_2()\n{\n for (int i = 0; i < n; i++)\n {\n x_1[i] = lower_bound(x, x + xLen, x_1[i]) - x;\n x_2[i] = lower_bound(x, x + xLen, x_2[i]) - x;\n y_1[i] = lower_bound(y, y + yLen, y_1[i]) - y;\n y_2[i] = lower_bound(y, y + yLen, y_2[i]) - y;\n }\n w = xLen - 1;\n h = yLen - 1;\n}\nvoid handleField()\n{\n for (int i = 0; i < h; i++)\n {\n for (int j = 0; j < w; j++)\n {\n field[i][j] = true;\n }\n }\n for (int i = 0; i < n; i++)\n {\n for (int j = y_1[i]; j <= (y_2[i] - 1); j++)\n {\n for (int k = x_1[i]; k <= (x_2[i] - 1); k++)\n {\n field[j][k] = false;\n }\n }\n }\n}\nvoid bfs()\n{\n while (!que.empty())\n {\n P p = que.front();\n que.pop();\n for (int i = 0; i < 4; i++)\n {\n int ny = p.first + dy[i];\n int nx = p.second + dx[i];\n if (ny >= 0 && ny < h && nx >= 0 && nx < w && field[ny][nx])\n {\n field[ny][nx] = false;\n que.push(P(ny, nx));\n }\n }\n }\n}\nvoid solve()\n{\n for (int i = 0; i < h; i++)\n {\n for (int j = 0; j < w; j++)\n {\n if (field[i][j])\n {\n field[i][j] = false;\n que.push(P(i, j));\n bfs();\n ans++;\n }\n }\n }\n}\nint main()\n{\n while (true)\n {\n scanf(\"%d%d\", &w, &h);\n if (w == 0 && h == 0)\n {\n break;\n }\n input();\n compress();\n distinctBy2Posinter();\n handleX_1X_2Y_1Y_2();\n handleField();\n solve();\n printf(\"%d\\n\", ans);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 11448, "score_of_the_acc": -0.0784, "final_rank": 4 }, { "submission_id": "aoj_0531_8214878", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <cstring>\n\nusing namespace std;\n\n#define REP(i, n) for (int i = 0; i < (n); i++)\n\nconstexpr int dx[4] = {-1, 0, 1, 0};\nconstexpr int dy[4] = {0, -1, 0, 1};\n\nvector<int> compress(int *x1, int *x2, int w, int n) {\n vector<int> xs;\n REP(i, n) {\n for (int d = -1; d <= 1; ++d) {\n int tx1 = x1[i] + d, tx2 = x2[i] + d;\n if (0 <= tx1 && tx1 <= w)\n xs.push_back(tx1);\n if (0 <= tx2 && tx2 <= w)\n xs.push_back(tx2);\n }\n }\n sort(xs.begin(), xs.end());\n xs.erase(unique(xs.begin(), xs.end()), xs.end());\n REP(i, n) {\n x1[i] = lower_bound(xs.begin(), xs.end(), x1[i]) - xs.begin();\n x2[i] = lower_bound(xs.begin(), xs.end(), x2[i]) - xs.begin();\n }\n return xs;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n int w, h, n;\n while (cin >> w >> h, w) {\n cin >> n;\n vector<vector<bool>> fld(1005 * 6 + 2, vector<bool>(1005 * 6 + 2, false));\n vector<int> x1(n), x2(n), y1(n), y2(n);\n REP(i, n) { cin >> x1[i] >> y1[i] >> x2[i] >> y2[i]; }\n auto xs = compress(x1.data(), x2.data(), w, n);\n auto ys = compress(y1.data(), y2.data(), h, n);\n REP(i, n) {\n for (int y = y1[i]; y < y2[i]; ++y) {\n for (int x = x1[i]; x < x2[i]; ++x) {\n fld[y][x] = true;\n }\n }\n }\n int ans = 0;\n REP(y, ys.size() - 1) REP(x, xs.size() - 1) {\n if (fld[y][x])\n continue;\n ans++;\n queue<pair<int, int>> q;\n q.push({y, x});\n while (q.size()) {\n auto p = q.front();\n q.pop();\n REP(i, 4) {\n int ny = p.first + dy[i], nx = p.second + dx[i];\n if (ny < 0 || ny >= ys.size() - 1 || nx < 0 || nx >= xs.size() - 1 || fld[ny][nx])\n continue;\n fld[ny][nx] = true;\n q.push({ny, nx});\n }\n }\n }\n cout << ans << \"\\n\";\n }\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 8148, "score_of_the_acc": -0.0563, "final_rank": 3 } ]
aoj_0536_cpp
Description fetch failed. Please view: https://onlinejudge.u-aizu.ac.jp/problems/0536
[ { "submission_id": "aoj_0536_10319009", "code_snippet": "#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <climits>\n#include <cmath>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <memory>\n#include <numeric>\n#include <optional>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <unordered_map>\n#include <vector>\n\nenum class Balance {\n\tLeft, Neutral, Right\n};\ntemplate<typename T>\nclass AVLArray;\ntemplate<typename T>\nclass Node {\npublic:\n\tvirtual unsigned int size() const = 0;\n\tvirtual unsigned int height() const = 0;\n\tvirtual Balance balance() const = 0;\n\tvirtual void appendToVector(std::vector<std::pair<unsigned int, T>>& destination) const = 0;\n};\n\ntemplate<typename T>\nclass Leaf : public Node<T> {\npublic:\n\tunsigned int mSize;\n\tT mValue;\n\tLeaf(const unsigned int size, const T& value) : mSize{ size }, mValue{ value } {\n\t\tassert(size > 0);\n\t};\n\tunsigned int size() const override {\n\t\treturn mSize;\n\t}\n\tunsigned int height() const override {\n\t\treturn 1;\n\t}\n\tBalance balance() const override {\n\t\treturn Balance::Neutral;\n\t}\n\tvoid appendToVector(std::vector<std::pair<unsigned int, T>>& destination) const override {\n\t\tdestination.emplace_back(mSize, mValue);\n\t}\n};\n\ntemplate<typename T>\nclass Branch : public Node<T> {\npublic:\n\tstd::shared_ptr<Node<T>> mLeft, mRight;\n\tunsigned int mSize, mHeight;\n\tBranch(std::shared_ptr<Node<T>> left, std::shared_ptr<Node<T>> right) : mLeft{ std::move(left) }, mRight{ std::move(right) }, mSize{ mLeft->size() + mRight->size() }, mHeight{ std::max(mLeft->height(), mRight->height()) + 1 } {\n\t\tassert(mLeft);\n\t\tassert(mRight);\n\t\tassert(std::abs(static_cast<int>(mLeft->height()) - static_cast<int>(mRight->height())) <= 1);\n\t};\n\tunsigned int size() const override {\n\t\treturn mSize;\n\t}\n\tunsigned int height() const override {\n\t\treturn mHeight;\n\t}\n\tBalance balance() const override {\n\t\tswitch (mLeft->height() - mRight->height()) {\n\t\tcase 1: return Balance::Left;\n\t\tcase 0: return Balance::Neutral;\n\t\tcase -1: return Balance::Right;\n\t\tdefault:\n\t\t\tassert(false);\n\t\t}\n\t}\n\tvoid appendToVector(std::vector<std::pair<unsigned int, T>>& destination) const override {\n\t\tmLeft->appendToVector(destination);\n\t\tmRight->appendToVector(destination);\n\t}\n};\ntemplate<typename T>\nclass AVLArray {\n\tstd::shared_ptr<Node<T>> root{ nullptr };\n\tstatic std::shared_ptr<Node<T>> balanceLeft(const std::shared_ptr<Node<T>>& left, const std::shared_ptr<Node<T>>& right) {\n\t\tif (std::abs(static_cast<int>(left->height()) - static_cast<int>(right->height())) <= 1) {\n\t\t\treturn std::make_shared<Branch<T>>(left, right);\n\t\t}\n\t\tassert(left->height() == right->height() + 2);\n\t\tconst auto leftBranch{ dynamic_cast<Branch<T>*>(left.get()) };\n\t\tassert(leftBranch);\n\t\tif (leftBranch->balance() == Balance::Right) {\n\t\t\tconst auto leftRightBranch{ dynamic_cast<Branch<T>*>(leftBranch->mRight.get()) };\n\t\t\tassert(leftRightBranch);\n\t\t\treturn std::make_shared<Branch<T>>(std::make_shared<Branch<T>>(leftBranch->mLeft, leftRightBranch->mLeft), std::make_shared<Branch<T>>(leftRightBranch->mRight, right));\n\t\t}\n\t\telse {\n\t\t\treturn std::make_shared<Branch<T>>(leftBranch->mLeft, std::make_shared<Branch<T>>(leftBranch->mRight, right));\n\t\t}\n\t}\n\tstatic std::shared_ptr<Node<T>> balanceRight(const std::shared_ptr<Node<T>>& left, const std::shared_ptr<Node<T>>& right) {\n\t\tif (std::abs(static_cast<int>(left->height()) - static_cast<int>(right->height())) <= 1) {\n\t\t\treturn std::make_shared<Branch<T>>(left, right);\n\t\t}\n\t\tassert(left->height() + 2 == right->height());\n\t\tconst auto rightBranch{ dynamic_cast<Branch<T>*>(right.get()) };\n\t\tassert(rightBranch);\n\t\tif (rightBranch->balance() == Balance::Left) {\n\t\t\tconst auto rightLeftBranch{ dynamic_cast<Branch<T>*>(rightBranch->mLeft.get()) };\n\t\t\tassert(rightLeftBranch);\n\t\t\treturn std::make_shared<Branch<T>>(std::make_shared<Branch<T>>(left, rightLeftBranch->mLeft), std::make_shared<Branch<T>>(rightLeftBranch->mRight, rightBranch->mRight));\n\t\t}\n\t\telse {\n\t\t\treturn std::make_shared<Branch<T>>(std::make_shared<Branch<T>>(left, rightBranch->mLeft), rightBranch->mRight);\n\t\t}\n\t}\n\tstatic std::shared_ptr<Node<T>> merge(const std::shared_ptr<Node<T>>& left, const std::shared_ptr<Node<T>>& right) {\n\t\tif (left == nullptr) {\n\t\t\treturn right;\n\t\t}\n\t\telse if (right == nullptr) {\n\t\t\treturn left;\n\t\t}\n\t\telse {\n\t\t\tconst auto diff{ static_cast<int>(left->height()) - static_cast<int>(right->height()) };\n\t\t\tif (diff < -1) {\n\t\t\t\tconst auto rightBranch{ dynamic_cast<Branch<T>*>(right.get()) };\n\t\t\t\tassert(rightBranch);\n\t\t\t\treturn balanceLeft(merge(left, rightBranch->mLeft), rightBranch->mRight);\n\t\t\t}\n\t\t\telse if (1 < diff) {\n\t\t\t\tconst auto leftBranch{ dynamic_cast<Branch<T>*>(left.get()) };\n\t\t\t\tassert(leftBranch);\n\t\t\t\treturn balanceRight(leftBranch->mLeft, merge(leftBranch->mRight, right));\n\t\t\t}\n\t\t\telse {\n\t\t\t\treturn std::make_shared<Branch<T>>(left, right);\n\t\t\t}\n\t\t}\n\t}\n\tstatic std::pair<std::shared_ptr<Node<T>>, std::shared_ptr<Node<T>>> split(const std::shared_ptr<Node<T>>& node, const unsigned int size) {\n\t\tif (size == 0) {\n\t\t\treturn std::make_pair(nullptr, node);\n\t\t}\n\t\telse if (node == nullptr || node->size() <= size) {\n\t\t\treturn std::make_pair(node, nullptr);\n\t\t}\n\t\telse if (const auto branch = dynamic_cast<Branch<T>*>(node.get()); branch) {\n\t\t\tif (size == branch->mLeft->size()) {\n\t\t\t\treturn std::make_pair(branch->mLeft, branch->mRight);\n\t\t\t}\n\t\t\telse if (size < branch->mLeft->size()) {\n\t\t\t\tconst auto [left, right] = split(branch->mLeft, size);\n\t\t\t\treturn std::make_pair(left, merge(right, branch->mRight));\n\t\t\t}\n\t\t\telse {\n\t\t\t\tconst auto [left, right] = split(branch->mRight, size - branch->mLeft->size());\n\t\t\t\treturn std::make_pair(merge(branch->mLeft, left), right);\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tconst auto leaf{ dynamic_cast<Leaf<T>*>(node.get()) };\n\t\t\tassert(leaf);\n\t\t\treturn std::make_pair(std::make_shared<Leaf<T>>(size, leaf->mValue), std::make_shared<Leaf<T>>(leaf->size() - size, leaf->mValue));\n\t\t}\n\t}\n\tAVLArray(const std::shared_ptr<Node<T>>& root) : root{ root } {};\npublic:\n\tAVLArray() : AVLArray(nullptr) {};\n\tAVLArray<T> operator+(const AVLArray<T>& other) const {\n\t\treturn AVLArray<T>{merge(root, other.root)};\n\t}\n\tAVLArray<T> appended(const unsigned int size, const T& value) const {\n\t\treturn merge(root, std::make_shared<Leaf<T>>(size, value));\n\t}\n\tAVLArray<T> prepended(const unsigned int size, const T& value) const {\n\t\treturn merge(std::make_shared<Leaf<T>>(size, value), root);\n\t}\n\tstd::pair<AVLArray<T>, AVLArray<T>> splited(const unsigned int size) const {\n\t\tconst auto [left, right] = split(root, size);\n\t\treturn std::make_pair(AVLArray{ left }, AVLArray{ right });\n\t}\n\tstd::vector<std::pair<unsigned int, T>> convertToVector() const {\n\t\tstd::vector<std::pair<unsigned int, T>> vec;\n\t\tif (root) {\n\t\t\troot->appendToVector(vec);\n\t\t}\n\t\treturn vec;\n\t}\n\tunsigned int size() const {\n\t\treturn root ? root->size() : 0;\n\t}\n};\nint solve(const int n, const int p, const int q, const int r, const std::vector<std::pair<int, int>>& queries) {\n\tAVLArray<bool> array;\n\tarray = array.prepended(r, true);\n\tarray = array.appended(n - r, false);\n\tfor (const auto [x, y] : queries) {\n\t\tconst auto [leftMid, right] = array.splited(y);\n\t\tconst auto [left, mid] = leftMid.splited(x);\n\t\tarray = right + mid + left;\n\t}\n\tconst auto resultVec = array.splited(q).first.splited(p).second.convertToVector();\n\treturn std::accumulate(resultVec.begin(), resultVec.end(), 0, [](const int acc, const std::pair<unsigned int, bool>& p) {\n\t\treturn acc + (p.second ? p.first : 0);\n\t\t});\n}\nint main() {\n\twhile (true) {\n\t\tint n; std::cin >> n;\n\t\tif (n == 0) break;\n\t\tint m; std::cin >> m;\n\t\tint p, q, r; std::cin >> p >> q >> r; --p;\n\t\tstd::vector<std::pair<int, int>> queries(m);\n\t\tfor (auto& [x, y] : queries) {\n\t\t\tstd::cin >> x >> y;\n\t\t}\n\t\tconst auto result{ solve(n, p, q, r, queries) };\n\t\tstd::cout << result << '\\n';\n\t}\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 4048, "score_of_the_acc": -1, "final_rank": 19 }, { "submission_id": "aoj_0536_9613012", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n\nvector<pair<ll,ll>> shu(vector<pair<ll,ll>> S,ll x,ll y){\n vector<pair<ll,ll>> A,B,C;\n int N=S.size();\n ll sm=0;\n for(int i=0;i<N;i++){\n ll d=S[i].second-S[i].first+1;\n if(sm<x)A.push_back(S[i]);\n else if(sm<y)B.push_back(S[i]);\n else C.push_back(S[i]);\n sm+=d;\n }\n for(auto v:B)C.push_back(v);\n for(auto v:A)C.push_back(v);\n return C;\n}\n\n\nvector<pair<ll,ll>> sep(vector<pair<ll,ll>> S,ll x){\n int N=S.size();\n vector<pair<ll,ll>> A;\n ll sm=0;\n for(int i=0;i<N;i++){\n ll d=S[i].second-S[i].first+1;\n if(sm+d<=x){\n A.push_back(S[i]);\n }\n else if(sm<x){\n A.push_back({S[i].first,S[i].first+x-sm-1});\n A.push_back({S[i].first+x-sm,S[i].second});\n }\n else A.push_back(S[i]);\n sm+=d;\n }\n return A;\n}\n\n\nint main() {\n ll N,M;\n while(cin>>N,N!=0){\n cin>>M;\n vector<pair<ll,ll>> C={{1,N}};\n ll P,Q,R;\n cin>>P>>Q>>R;\n for(int i=0;i<M;i++){\n ll x,y;\n cin>>x>>y;\n C=sep(C,x);\n C=sep(C,y);\n C=shu(C,x,y);\n // for(auto [l,r]:C)cout<<l<<\" \"<<r<<endl;\n }\n if(P!=1)C=sep(C,P-1);\n C=sep(C,Q);\n\n int CN=C.size();\n ll sm=0;\n ll an=0;\n for(int i=0;i<CN;i++){\n ll d=C[i].second-C[i].first+1;\n if(sm<P-1){\n }\n else if(sm<Q){\n an+=min(R,C[i].second);\n an-=min(R,C[i].first-1);\n }\n else {\n\n }\n sm+=d;\n }\n cout<<an<<endl;\n}}", "accuracy": 1, "time_ms": 760, "memory_kb": 3684, "score_of_the_acc": -1.5728, "final_rank": 20 }, { "submission_id": "aoj_0536_6357992", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nclass CardInfo {\npublic:\n\tint begin_num;\n\tint num_cards;\n\npublic:\n\tCardInfo(int b, int n) : begin_num(b), num_cards(n) {\n\t}\n\n\t~CardInfo() {\n\t}\n};\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint n = -1;\n\t\tint m = -1;\n\t\tint p = -1;\n\t\tint q = -1;\n\t\tint r = -1;\n\t\tvector<CardInfo> card_info_vec;\n\t\tvector<CardInfo> tmp_card_info_vec0;\n\t\tvector<CardInfo> tmp_card_info_vec1;\n\t\tint p_num_cards = -1;\n\t\tint c_num_cards = -1;\n\t\tint x = -1;\n\t\tint y = -1;\n\t\tint i = -1;\n\t\tint j = -1;\n\t\tint k = -1;\n\t\tint j_a = -1;\n\t\tint j_b = -1;\n\t\tbool is_found = false;\n\t\tint result = 0;\n\n\t\tcin >> n;\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tcin >> m >> p >> q >> r;\n\t\tcard_info_vec.push_back(CardInfo(1, n));\n\n\t\tfor (i = 0; i < m; i++) {\n\t\t\tcin >> x >> y;\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\ttmp_card_info_vec0.clear();\n\t\t\ttmp_card_info_vec1.clear();\n\t\t\tis_found = false;\n\n\t\t\tfor (j = 0; j < card_info_vec.size(); j++) {\n\t\t\t\tint& z = card_info_vec[j].begin_num;\n\n\t\t\t\tc_num_cards += card_info_vec[j].num_cards;\n\t\t\t\tif (x <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = x - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - x);\n\n\t\t\t\t\ttmp_card_info_vec0.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\ttmp_card_info_vec0.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_a = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttmp_card_info_vec0.push_back(card_info_vec[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\tis_found = false;\n\t\t\tfor (j = 0; j < tmp_card_info_vec0.size(); j++) {\n\t\t\t\tint& z = tmp_card_info_vec0[j].begin_num;\n\n\t\t\t\tc_num_cards += tmp_card_info_vec0[j].num_cards;\n\t\t\t\tif (y <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = y - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - y);\n\n\t\t\t\t\ttmp_card_info_vec1.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\ttmp_card_info_vec1.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_b = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttmp_card_info_vec1.push_back(tmp_card_info_vec0[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tcard_info_vec.clear();\n\t\t\tfor (k = j_b + 1; k < tmp_card_info_vec1.size(); k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (k = j_a + 1; k < j_b + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (k = 0; k < j_a + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t}\n\n\t\tp_num_cards = 0;\n\t\tc_num_cards = 0;\n\t\tis_found = false;\n\t\tresult = 0;\n\t\tfor (CardInfo& card_info : card_info_vec) {\n\t\t\tint& zb = card_info.begin_num;\n\t\t\tint ze = zb + card_info.num_cards - 1;\n\t\t\tint zq = zb + q - p_num_cards - 1;\n\n\t\t\tc_num_cards += card_info.num_cards;\n\t\t\tif (q <= c_num_cards && !is_found) {\n\t\t\t\tint zp = zb + p - p_num_cards - 1;\n\t\t\t\tint idx_r = r - zp;\n\n\t\t\t\tresult += min(max(idx_r, -1), zq - zp) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (p <= c_num_cards && !is_found) {\n\t\t\t\tint zp = zb + p - p_num_cards - 1;\n\t\t\t\tint idx_r = r - zp;\n\t\t\t\tresult += min(max(idx_r, -1), ze - zp) + 1;\n\t\t\t\tis_found = true;\n\t\t\t}\n\t\t\telse if (q > c_num_cards && is_found) {\n\t\t\t\tint idx_r = r - zb;\n\n\t\t\t\tresult += min(max(idx_r, -1), ze - zb) + 1;\n\t\t\t}\n\t\t\telse if (q <= c_num_cards && is_found) {\n\t\t\t\tint idx_r = r - zb;\n\t\t\t\tresult += min(max(idx_r, -1), zq - zb) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tp_num_cards = c_num_cards;\n\t\t}\n\t\tcout << result << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 3196, "score_of_the_acc": -0.1806, "final_rank": 1 }, { "submission_id": "aoj_0536_6357985", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nclass CardInfo {\npublic:\n\tint begin_num;\n\tint num_cards;\n\npublic:\n\tCardInfo(int b, int n) : begin_num(b), num_cards(n) {\n\t}\n\n\t~CardInfo() {\n\t}\n};\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint n = -1;\n\t\tint m = -1;\n\t\tint p = -1;\n\t\tint q = -1;\n\t\tint r = -1;\n\t\tvector<CardInfo> card_info_vec;\n\t\tvector<CardInfo> tmp_card_info_vec0;\n\t\tvector<CardInfo> tmp_card_info_vec1;\n\t\tint p_num_cards = -1;\n\t\tint c_num_cards = -1;\n\t\tint x = -1;\n\t\tint y = -1;\n\t\tint j_a = -1;\n\t\tint j_b = -1;\n\t\tbool is_found = false;\n\t\tint result = 0;\n\n\t\tcin >> n;\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tcin >> m >> p >> q >> r;\n\t\tcard_info_vec.push_back(CardInfo(1, n));\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tcin >> x >> y;\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\ttmp_card_info_vec0.clear();\n\t\t\ttmp_card_info_vec1.clear();\n\t\t\tis_found = false;\n\n\t\t\tfor (int j = 0; j < card_info_vec.size(); j++) {\n\t\t\t\tint& z = card_info_vec[j].begin_num;\n\n\t\t\t\tc_num_cards += card_info_vec[j].num_cards;\n\t\t\t\tif (x <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = x - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - x);\n\n\t\t\t\t\ttmp_card_info_vec0.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\ttmp_card_info_vec0.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_a = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttmp_card_info_vec0.push_back(card_info_vec[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\tis_found = false;\n\t\t\tfor (int j = 0; j < tmp_card_info_vec0.size(); j++) {\n\t\t\t\tint& z = tmp_card_info_vec0[j].begin_num;\n\n\t\t\t\tc_num_cards += tmp_card_info_vec0[j].num_cards;\n\t\t\t\tif (y <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = y - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - y);\n\n\t\t\t\t\ttmp_card_info_vec1.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\ttmp_card_info_vec1.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_b = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttmp_card_info_vec1.push_back(tmp_card_info_vec0[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tcard_info_vec.clear();\n\t\t\tfor (int k = j_b + 1; k < tmp_card_info_vec1.size(); k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = j_a + 1; k < j_b + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = 0; k < j_a + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t}\n\n\t\tp_num_cards = 0;\n\t\tc_num_cards = 0;\n\t\tis_found = false;\n\t\tresult = 0;\n\t\tfor (CardInfo& card_info : card_info_vec) {\n\t\t\tint& zb = card_info.begin_num;\n\t\t\tint ze = zb + card_info.num_cards - 1;\n\t\t\tint zq = zb + q - p_num_cards - 1;\n\n\t\t\tc_num_cards += card_info.num_cards;\n\t\t\tif (q <= c_num_cards && !is_found) {\n\t\t\t\tint zp = zb + p - p_num_cards - 1;\n\t\t\t\tint idx_r = r - zp;\n\n\t\t\t\tresult += min(max(idx_r, -1), zq - zp) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (p <= c_num_cards && !is_found) {\n\t\t\t\tint zp = zb + p - p_num_cards - 1;\n\t\t\t\tint idx_r = r - zp;\n\t\t\t\tresult += min(max(idx_r, -1), ze - zp) + 1;\n\t\t\t\tis_found = true;\n\t\t\t}\n\t\t\telse if (q > c_num_cards && is_found) {\n\t\t\t\tint idx_r = r - zb;\n\n\t\t\t\tresult += min(max(idx_r, -1), ze - zb) + 1;\n\t\t\t}\n\t\t\telse if (q <= c_num_cards && is_found) {\n\t\t\t\tint idx_r = r - zb;\n\t\t\t\tresult += min(max(idx_r, -1), zq - zb) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tp_num_cards = c_num_cards;\n\t\t}\n\t\tcout << result << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 3488, "score_of_the_acc": -0.5233, "final_rank": 11 }, { "submission_id": "aoj_0536_6357983", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nclass CardInfo {\npublic:\n\tint begin_num;\n\tint num_cards;\n\npublic:\n\tCardInfo(int b, int n) : begin_num(b), num_cards(n) {\n\t}\n\n\t~CardInfo() {\n\t}\n};\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint n = -1;\n\t\tint m = -1;\n\t\tint p = -1;\n\t\tint q = -1;\n\t\tint r = -1;\n\t\tvector<CardInfo> card_info_vec;\n\t\tvector<CardInfo> tmp_card_info_vec0;\n\t\tvector<CardInfo> tmp_card_info_vec1;\n\t\tint p_num_cards = -1;\n\t\tint c_num_cards = -1;\n\t\tint x = -1;\n\t\tint y = -1;\n\t\tint j_a = -1;\n\t\tint j_b = -1;\n\t\tbool is_found = false;\n\t\tint result = 0;\n\n\t\tcin >> n;\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tcin >> m >> p >> q >> r;\n\t\tcard_info_vec.push_back(CardInfo(1, n));\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tcin >> x >> y;\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\ttmp_card_info_vec0.clear();\n\t\t\ttmp_card_info_vec1.clear();\n\t\t\tis_found = false;\n\n\t\t\tfor (int j = 0; j < card_info_vec.size(); j++) {\n\t\t\t\tint& z = card_info_vec[j].begin_num;\n\n\t\t\t\tc_num_cards += card_info_vec[j].num_cards;\n\t\t\t\tif (x <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = x - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - x);\n\n\t\t\t\t\ttmp_card_info_vec0.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\ttmp_card_info_vec0.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_a = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttmp_card_info_vec0.push_back(card_info_vec[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\tis_found = false;\n\t\t\tfor (int j = 0; j < tmp_card_info_vec0.size(); j++) {\n\t\t\t\tint& z = tmp_card_info_vec0[j].begin_num;\n\n\t\t\t\tc_num_cards += tmp_card_info_vec0[j].num_cards;\n\t\t\t\tif (y <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = y - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - y);\n\n\t\t\t\t\ttmp_card_info_vec1.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\ttmp_card_info_vec1.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_b = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttmp_card_info_vec1.push_back(tmp_card_info_vec0[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tcard_info_vec.clear();\n\t\t\tfor (int k = j_b + 1; k < tmp_card_info_vec1.size(); k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = j_a + 1; k < j_b + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = 0; k < j_a + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t}\n\n\t\tp_num_cards = 0;\n\t\tc_num_cards = 0;\n\t\tis_found = false;\n\t\tresult = 0;\n\t\tfor (CardInfo& card_info : card_info_vec) {\n\t\t\tint& zb = card_info.begin_num;\n\n\t\t\tc_num_cards += card_info.num_cards;\n\t\t\tif (q <= c_num_cards && !is_found) {\n\t\t\t\tint zp = zb + p - p_num_cards - 1;\n\t\t\t\tint zq = zb + q - p_num_cards - 1;\n\t\t\t\tint idx_r = r - zp;\n\n\t\t\t\tresult += min(max(idx_r, -1), zq - zp) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (p <= c_num_cards && !is_found) {\n\t\t\t\tint zp = zb + p - p_num_cards - 1;\n\t\t\t\tint ze = zb + card_info.num_cards - 1;\n\t\t\t\tint idx_r = r - zp;\n\t\t\t\tresult += min(max(idx_r, -1), ze - zp) + 1;\n\t\t\t\tis_found = true;\n\t\t\t}\n\t\t\telse if (q > c_num_cards && is_found) {\n\t\t\t\tint ze = zb + card_info.num_cards - 1;\n\t\t\t\tint idx_r = r - zb;\n\n\t\t\t\tresult += min(max(idx_r, -1), ze - zb) + 1;\n\t\t\t}\n\t\t\telse if (q <= c_num_cards && is_found) {\n\t\t\t\tint zq = zb + q - p_num_cards - 1;\n\t\t\t\tint idx_r = r - zb;\n\n\t\t\t\tresult += min(max(idx_r, -1), zq - zb) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tp_num_cards = c_num_cards;\n\t\t}\n\t\tcout << result << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 200, "memory_kb": 3344, "score_of_the_acc": -0.3959, "final_rank": 5 }, { "submission_id": "aoj_0536_6357978", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nclass CardInfo {\npublic:\n\tint begin_num;\n\tint num_cards;\n\npublic:\n\tCardInfo(int b, int n) : begin_num(b), num_cards(n) {\n\t}\n\n\t~CardInfo() {\n\t}\n};\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint n = -1;\n\t\tint m = -1;\n\t\tint p = -1;\n\t\tint q = -1;\n\t\tint r = -1;\n\t\tvector<CardInfo> card_info_vec;\n\t\tvector<CardInfo> tmp_card_info_vec0;\n\t\tvector<CardInfo> tmp_card_info_vec1;\n\t\tint p_num_cards = -1;\n\t\tint c_num_cards = -1;\n\t\tint x = -1;\n\t\tint y = -1;\n\t\tint j_a = -1;\n\t\tint j_b = -1;\n\t\tbool is_found = false;\n\t\tint result = 0;\n\n\t\tcin >> n;\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tcin >> m >> p >> q >> r;\n\t\tcard_info_vec.push_back(CardInfo(1, n));\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tcin >> x >> y;\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\ttmp_card_info_vec0.clear();\n\t\t\ttmp_card_info_vec1.clear();\n\t\t\tis_found = false;\n\n\t\t\tfor (int j = 0; j < card_info_vec.size(); j++) {\n\t\t\t\tint& z = card_info_vec[j].begin_num;\n\n\t\t\t\tc_num_cards += card_info_vec[j].num_cards;\n\t\t\t\tif (x <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = x - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - x);\n\n\t\t\t\t\ttmp_card_info_vec0.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\ttmp_card_info_vec0.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_a = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttmp_card_info_vec0.push_back(card_info_vec[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\tis_found = false;\n\t\t\tfor (int j = 0; j < tmp_card_info_vec0.size(); j++) {\n\t\t\t\tint& z = tmp_card_info_vec0[j].begin_num;\n\n\t\t\t\tc_num_cards += tmp_card_info_vec0[j].num_cards;\n\t\t\t\tif (y <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = y - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - y);\n\n\t\t\t\t\ttmp_card_info_vec1.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\ttmp_card_info_vec1.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_b = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttmp_card_info_vec1.push_back(tmp_card_info_vec0[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tcard_info_vec.clear();\n\t\t\tfor (int k = j_b + 1; k < tmp_card_info_vec1.size(); k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = j_a + 1; k < j_b + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = 0; k < j_a + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t}\n\n\t\tp_num_cards = 0;\n\t\tc_num_cards = 0;\n\t\tis_found = false;\n\t\tresult = 0;\n\t\tfor (CardInfo& card_info : card_info_vec) {\n\t\t\tint& zb = card_info.begin_num;\n\t\t\tint ze = zb + card_info.num_cards - 1;\n\t\t\tint zq = zb + q - p_num_cards - 1;\n\n\t\t\tc_num_cards += card_info.num_cards;\n\t\t\tif (q <= c_num_cards && !is_found) {\n\t\t\t\tint zp = zb + p - p_num_cards - 1;\n\t\t\t\tint idx_r = r - zp;\n\n\t\t\t\tresult += min(max(idx_r, -1), zq - zp) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (p <= c_num_cards && !is_found) {\n\t\t\t\tint zp = zb + p - p_num_cards - 1;\n\t\t\t\tint idx_r = r - zp;\n\t\t\t\tresult += min(max(idx_r, -1), ze - zp) + 1;\n\t\t\t\tis_found = true;\n\t\t\t}\n\t\t\telse if (q > c_num_cards && is_found) {\n\t\t\t\tint idx_r = r - zb;\n\n\t\t\t\tresult += min(max(idx_r, -1), ze - zb) + 1;\n\t\t\t}\n\t\t\telse if (q <= c_num_cards && is_found) {\n\t\t\t\tint idx_r = r - zb;\n\n\t\t\t\tresult += min(max(idx_r, -1), zq - zb) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tp_num_cards = c_num_cards;\n\t\t}\n\t\tcout << result << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 3508, "score_of_the_acc": -0.5468, "final_rank": 14 }, { "submission_id": "aoj_0536_6357977", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nclass CardInfo {\npublic:\n\tint begin_num;\n\tint num_cards;\n\npublic:\n\tCardInfo(int b, int n) : begin_num(b), num_cards(n) {\n\t}\n\n\t~CardInfo() {\n\t}\n};\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint n = -1;\n\t\tint m = -1;\n\t\tint p = -1;\n\t\tint q = -1;\n\t\tint r = -1;\n\t\tvector<CardInfo> card_info_vec;\n\t\tvector<CardInfo> tmp_card_info_vec0;\n\t\tvector<CardInfo> tmp_card_info_vec1;\n\t\tint p_num_cards = -1;\n\t\tint c_num_cards = -1;\n\t\tbool is_found = false;\n\t\tint result = 0;\n\n\t\tcin >> n;\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tcin >> m >> p >> q >> r;\n\t\tcard_info_vec.push_back(CardInfo(1, n));\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint x = -1;\n\t\t\tint y = -1;\n\t\t\tint j_a = -1;\n\t\t\tint j_b = -1;\n\n\t\t\tcin >> x >> y;\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\ttmp_card_info_vec0.clear();\n\t\t\ttmp_card_info_vec1.clear();\n\t\t\tis_found = false;\n\n\t\t\tfor (int j = 0; j < card_info_vec.size(); j++) {\n\t\t\t\tint& z = card_info_vec[j].begin_num;\n\n\t\t\t\tc_num_cards += card_info_vec[j].num_cards;\n\t\t\t\tif (x <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = x - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - x);\n\n\t\t\t\t\ttmp_card_info_vec0.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\ttmp_card_info_vec0.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_a = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttmp_card_info_vec0.push_back(card_info_vec[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\tis_found = false;\n\t\t\tfor (int j = 0; j < tmp_card_info_vec0.size(); j++) {\n\t\t\t\tint& z = tmp_card_info_vec0[j].begin_num;\n\n\t\t\t\tc_num_cards += tmp_card_info_vec0[j].num_cards;\n\t\t\t\tif (y <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = y - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - y);\n\n\t\t\t\t\ttmp_card_info_vec1.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\ttmp_card_info_vec1.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_b = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttmp_card_info_vec1.push_back(tmp_card_info_vec0[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tcard_info_vec.clear();\n\t\t\tfor (int k = j_b + 1; k < tmp_card_info_vec1.size(); k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = j_a + 1; k < j_b + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = 0; k < j_a + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t}\n\n\t\tp_num_cards = 0;\n\t\tc_num_cards = 0;\n\t\tis_found = false;\n\t\tresult = 0;\n\t\tfor (CardInfo& card_info : card_info_vec) {\n\t\t\tint& zb = card_info.begin_num;\n\t\t\tint ze = zb + card_info.num_cards - 1;\n\t\t\tint zq = zb + q - p_num_cards - 1;\n\n\t\t\tc_num_cards += card_info.num_cards;\n\t\t\tif (q <= c_num_cards && !is_found) {\n\t\t\t\tint zp = zb + p - p_num_cards - 1;\n\t\t\t\tint idx_r = r - zp;\n\n\t\t\t\tresult += min(max(idx_r, -1), zq - zp) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (p <= c_num_cards && !is_found) {\n\t\t\t\tint zp = zb + p - p_num_cards - 1;\n\t\t\t\tint idx_r = r - zp;\n\t\t\t\tresult += min(max(idx_r, -1), ze - zp) + 1;\n\t\t\t\tis_found = true;\n\t\t\t}\n\t\t\telse if (q > c_num_cards && is_found) {\n\t\t\t\tint idx_r = r - zb;\n\n\t\t\t\tresult += min(max(idx_r, -1), ze - zb) + 1;\n\t\t\t}\n\t\t\telse if (q <= c_num_cards && is_found) {\n\t\t\t\tint idx_r = r - zb;\n\n\t\t\t\tresult += min(max(idx_r, -1), zq - zb) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tp_num_cards = c_num_cards;\n\t\t}\n\t\tcout << result << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 190, "memory_kb": 3480, "score_of_the_acc": -0.5417, "final_rank": 12 }, { "submission_id": "aoj_0536_6357973", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nclass CardInfo {\npublic:\n\tint begin_num;\n\tint num_cards;\n\npublic:\n\tCardInfo(int b, int n) : begin_num(b), num_cards(n) {\n\t}\n\n\t~CardInfo() {\n\t}\n};\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint n = -1;\n\t\tint m = -1;\n\t\tint p = -1;\n\t\tint q = -1;\n\t\tint r = -1;\n\t\tvector<CardInfo> card_info_vec;\n\t\tvector<CardInfo> tmp_card_info_vec0;\n\t\tvector<CardInfo> tmp_card_info_vec1;\n\t\tint p_num_cards = -1;\n\t\tint c_num_cards = -1;\n\t\tint x = -1;\n\t\tint y = -1;\n\t\tint j_a = -1;\n\t\tint j_b = -1;\n\t\tint ze = -1;\n\t\tint zp = -1;\n\t\tint zq = -1;\n\t\tint idx_r = -1;\n\t\tbool is_found = false;\n\t\tint result = 0;\n\n\t\tcin >> n;\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tcin >> m >> p >> q >> r;\n\t\tcard_info_vec.push_back(CardInfo(1, n));\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tcin >> x >> y;\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\ttmp_card_info_vec0.clear();\n\t\t\ttmp_card_info_vec1.clear();\n\t\t\tis_found = false;\n\n\t\t\tfor (int j = 0; j < card_info_vec.size(); j++) {\n\t\t\t\tint& z = card_info_vec[j].begin_num;\n\n\t\t\t\tc_num_cards += card_info_vec[j].num_cards;\n\t\t\t\tif (x <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = x - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - x);\n\n\t\t\t\t\ttmp_card_info_vec0.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\ttmp_card_info_vec0.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_a = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttmp_card_info_vec0.push_back(card_info_vec[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\tis_found = false;\n\t\t\tfor (int j = 0; j < tmp_card_info_vec0.size(); j++) {\n\t\t\t\tint& z = tmp_card_info_vec0[j].begin_num;\n\n\t\t\t\tc_num_cards += tmp_card_info_vec0[j].num_cards;\n\t\t\t\tif (y <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = y - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - y);\n\n\t\t\t\t\ttmp_card_info_vec1.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\ttmp_card_info_vec1.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_b = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttmp_card_info_vec1.push_back(tmp_card_info_vec0[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tcard_info_vec.clear();\n\t\t\tfor (int k = j_b + 1; k < tmp_card_info_vec1.size(); k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = j_a + 1; k < j_b + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = 0; k < j_a + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t}\n\n\t\tp_num_cards = 0;\n\t\tc_num_cards = 0;\n\t\tis_found = false;\n\t\tresult = 0;\n\t\tfor (CardInfo& card_info : card_info_vec) {\n\t\t\tint& zb = card_info.begin_num;\n\n\t\t\tze = zb + card_info.num_cards - 1;\n\t\t\tzp = zb + p - p_num_cards - 1;\n\t\t\tzq = zb + q - p_num_cards - 1;\n\n\t\t\tc_num_cards += card_info.num_cards;\n\t\t\tif (q <= c_num_cards && !is_found) {\n\t\t\t\tidx_r = r - zp;\n\n\t\t\t\tresult += min(max(idx_r, -1), zq - zp) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (p <= c_num_cards && !is_found) {\n\t\t\t\tidx_r = r - zp;\n\t\t\t\tresult += min(max(idx_r, -1), ze - zp) + 1;\n\t\t\t\tis_found = true;\n\t\t\t}\n\t\t\telse if (q > c_num_cards && is_found) {\n\t\t\t\tidx_r = r - zb;\n\n\t\t\t\tresult += min(max(idx_r, -1), ze - zb) + 1;\n\t\t\t}\n\t\t\telse if (q <= c_num_cards && is_found) {\n\t\t\t\tidx_r = r - zb;\n\t\t\t\tresult += min(max(idx_r, -1), zq - zb) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tp_num_cards = c_num_cards;\n\t\t}\n\t\tcout << result << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 210, "memory_kb": 3460, "score_of_the_acc": -0.546, "final_rank": 13 }, { "submission_id": "aoj_0536_6357971", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nclass CardInfo {\npublic:\n\tint begin_num;\n\tint num_cards;\n\npublic:\n\tCardInfo(int b, int n) : begin_num(b), num_cards(n) {\n\t}\n\n\t~CardInfo() {\n\t}\n};\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint n = -1;\n\t\tint m = -1;\n\t\tint p = -1;\n\t\tint q = -1;\n\t\tint r = -1;\n\t\tvector<CardInfo> card_info_vec;\n\t\tvector<CardInfo> tmp_card_info_vec0;\n\t\tvector<CardInfo> tmp_card_info_vec1;\n\t\tint p_num_cards = -1;\n\t\tint c_num_cards = -1;\n\t\tint x = -1;\n\t\tint y = -1;\n\t\tint j_a = -1;\n\t\tint j_b = -1;\n\t\tint ze = -1;\n\t\tint zp = -1;\n\t\tint zq = -1;\n\t\tint idx_r = -1;\n\t\tbool is_found = false;\n\t\tint result = 0;\n\n\t\tcin >> n;\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tcin >> m >> p >> q >> r;\n\t\tcard_info_vec.push_back(CardInfo(1, n));\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tcin >> x >> y;\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\ttmp_card_info_vec0.clear();\n\t\t\ttmp_card_info_vec1.clear();\n\t\t\tis_found = false;\n\n\t\t\tfor (int j = 0; j < card_info_vec.size(); j++) {\n\t\t\t\tint& z = card_info_vec[j].begin_num;\n\n\t\t\t\tc_num_cards += card_info_vec[j].num_cards;\n\t\t\t\tif (x <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = x - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - x);\n\n\t\t\t\t\ttmp_card_info_vec0.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\ttmp_card_info_vec0.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_a = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttmp_card_info_vec0.push_back(card_info_vec[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\tis_found = false;\n\t\t\tfor (int j = 0; j < tmp_card_info_vec0.size(); j++) {\n\t\t\t\tint& z = tmp_card_info_vec0[j].begin_num;\n\n\t\t\t\tc_num_cards += tmp_card_info_vec0[j].num_cards;\n\t\t\t\tif (y <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = y - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - y);\n\n\t\t\t\t\ttmp_card_info_vec1.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\ttmp_card_info_vec1.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_b = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttmp_card_info_vec1.push_back(tmp_card_info_vec0[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tcard_info_vec.clear();\n\t\t\tfor (int k = j_b + 1; k < tmp_card_info_vec1.size(); k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = j_a + 1; k < j_b + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = 0; k < j_a + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t}\n\n\t\tp_num_cards = 0;\n\t\tc_num_cards = 0;\n\t\tis_found = false;\n\t\tresult = 0;\n\t\tfor (CardInfo& card_info : card_info_vec) {\n\t\t\tint& zb = card_info.begin_num;\n\n\n\t\t\tc_num_cards += card_info.num_cards;\n\t\t\tif (q <= c_num_cards && !is_found) {\n\t\t\t\tzq = zb + q - p_num_cards - 1;\n\t\t\t\tidx_r = r - zp;\n\n\t\t\t\tresult += min(max(idx_r, -1), zq - zp) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (p <= c_num_cards && !is_found) {\n\t\t\t\tzp = zb + p - p_num_cards - 1;\n\t\t\t\tze = zb + card_info.num_cards - 1;\n\t\t\t\tidx_r = r - zp;\n\t\t\t\tresult += min(max(idx_r, -1), ze - zp) + 1;\n\t\t\t\tis_found = true;\n\t\t\t}\n\t\t\telse if (q > c_num_cards && is_found) {\n\t\t\t\tze = zb + card_info.num_cards - 1;\n\t\t\t\tidx_r = r - zb;\n\n\t\t\t\tresult += min(max(idx_r, -1), ze - zb) + 1;\n\t\t\t}\n\t\t\telse if (q <= c_num_cards && is_found) {\n\t\t\t\tzq = zb + q - p_num_cards - 1;\n\t\t\t\tidx_r = r - zb;\n\t\t\t\tresult += min(max(idx_r, -1), zq - zb) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tp_num_cards = c_num_cards;\n\t\t}\n\t\tcout << result << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 200, "memory_kb": 3344, "score_of_the_acc": -0.3959, "final_rank": 5 }, { "submission_id": "aoj_0536_6357970", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nclass CardInfo {\npublic:\n\tint begin_num;\n\tint num_cards;\n\npublic:\n\tCardInfo(int b, int n) : begin_num(b), num_cards(n) {\n\t}\n\n\t~CardInfo() {\n\t}\n};\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint n = -1;\n\t\tint m = -1;\n\t\tint p = -1;\n\t\tint q = -1;\n\t\tint r = -1;\n\t\tvector<CardInfo> card_info_vec;\n\t\tvector<CardInfo> tmp_card_info_vec0;\n\t\tvector<CardInfo> tmp_card_info_vec1;\n\t\tint p_num_cards = -1;\n\t\tint c_num_cards = -1;\n\t\tint x = -1;\n\t\tint y = -1;\n\t\tint j_a = -1;\n\t\tint j_b = -1;\n\t\tint ze = -1;\n\t\tint zp = -1;\n\t\tint zq = -1;\n\t\tint idx_r = -1;\n\t\tbool is_found = false;\n\t\tint result = 0;\n\n\t\tcin >> n;\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tcin >> m >> p >> q >> r;\n\t\tcard_info_vec.push_back(CardInfo(1, n));\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tcin >> x >> y;\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\ttmp_card_info_vec0.clear();\n\t\t\ttmp_card_info_vec1.clear();\n\t\t\tis_found = false;\n\n\t\t\tfor (int j = 0; j < card_info_vec.size(); j++) {\n\t\t\t\tint& z = card_info_vec[j].begin_num;\n\n\t\t\t\tc_num_cards += card_info_vec[j].num_cards;\n\t\t\t\tif (x <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = x - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - x);\n\n\t\t\t\t\ttmp_card_info_vec0.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\ttmp_card_info_vec0.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_a = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttmp_card_info_vec0.push_back(card_info_vec[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\tis_found = false;\n\t\t\tfor (int j = 0; j < tmp_card_info_vec0.size(); j++) {\n\t\t\t\tint& z = tmp_card_info_vec0[j].begin_num;\n\n\t\t\t\tc_num_cards += tmp_card_info_vec0[j].num_cards;\n\t\t\t\tif (y <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = y - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - y);\n\n\t\t\t\t\ttmp_card_info_vec1.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\ttmp_card_info_vec1.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_b = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttmp_card_info_vec1.push_back(tmp_card_info_vec0[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tcard_info_vec.clear();\n\t\t\tfor (int k = j_b + 1; k < tmp_card_info_vec1.size(); k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = j_a + 1; k < j_b + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = 0; k < j_a + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t}\n\n\t\tp_num_cards = 0;\n\t\tc_num_cards = 0;\n\t\tis_found = false;\n\t\tresult = 0;\n\t\tfor (CardInfo& card_info : card_info_vec) {\n\t\t\tint& zb = card_info.begin_num;\n\n\t\t\tze = zb + card_info.num_cards - 1;\n\t\t\tzq = zb + q - p_num_cards - 1;\n\n\t\t\tc_num_cards += card_info.num_cards;\n\t\t\tif (q <= c_num_cards && !is_found) {\n\t\t\t\tzp = zb + p - p_num_cards - 1;\n\t\t\t\tidx_r = r - zp;\n\n\t\t\t\tresult += min(max(idx_r, -1), zq - zp) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (p <= c_num_cards && !is_found) {\n\t\t\t\tzp = zb + p - p_num_cards - 1;\n\t\t\t\tidx_r = r - zp;\n\t\t\t\tresult += min(max(idx_r, -1), ze - zp) + 1;\n\t\t\t\tis_found = true;\n\t\t\t}\n\t\t\telse if (q > c_num_cards && is_found) {\n\t\t\t\tidx_r = r - zb;\n\n\t\t\t\tresult += min(max(idx_r, -1), ze - zb) + 1;\n\t\t\t}\n\t\t\telse if (q <= c_num_cards && is_found) {\n\t\t\t\tidx_r = r - zb;\n\t\t\t\tresult += min(max(idx_r, -1), zq - zb) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tp_num_cards = c_num_cards;\n\t\t}\n\t\tcout << result << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 3428, "score_of_the_acc": -0.4529, "final_rank": 8 }, { "submission_id": "aoj_0536_6357966", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nclass CardInfo {\npublic:\n\tint begin_num;\n\tint num_cards;\n\npublic:\n\tCardInfo(int b, int n) : begin_num(b), num_cards(n) {\n\t}\n\n\t~CardInfo() {\n\t}\n};\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint n = -1;\n\t\tint m = -1;\n\t\tint p = -1;\n\t\tint q = -1;\n\t\tint r = -1;\n\t\tvector<CardInfo> card_info_vec;\n\t\tvector<CardInfo> tmp_card_info_vec0;\n\t\tvector<CardInfo> tmp_card_info_vec1;\n\t\tint p_num_cards = -1;\n\t\tint c_num_cards = -1;\n\t\tint x = -1;\n\t\tint y = -1;\n\t\tint j_a = -1;\n\t\tint j_b = -1;\n\t\tbool is_found = false;\n\t\tint result = 0;\n\n\t\tcin >> n;\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tcin >> m >> p >> q >> r;\n\t\tcard_info_vec.push_back(CardInfo(1, n));\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tcin >> x >> y;\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\ttmp_card_info_vec0.clear();\n\t\t\ttmp_card_info_vec1.clear();\n\t\t\tis_found = false;\n\n\t\t\tfor (int j = 0; j < card_info_vec.size(); j++) {\n\t\t\t\tint& z = card_info_vec[j].begin_num;\n\n\t\t\t\tc_num_cards += card_info_vec[j].num_cards;\n\t\t\t\tif (x <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = x - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - x);\n\n\t\t\t\t\ttmp_card_info_vec0.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\ttmp_card_info_vec0.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_a = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttmp_card_info_vec0.push_back(card_info_vec[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\tis_found = false;\n\t\t\tfor (int j = 0; j < tmp_card_info_vec0.size(); j++) {\n\t\t\t\tint& z = tmp_card_info_vec0[j].begin_num;\n\n\t\t\t\tc_num_cards += tmp_card_info_vec0[j].num_cards;\n\t\t\t\tif (y <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = y - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - y);\n\n\t\t\t\t\ttmp_card_info_vec1.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\ttmp_card_info_vec1.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_b = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ttmp_card_info_vec1.push_back(tmp_card_info_vec0[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tcard_info_vec.clear();\n\t\t\tfor (int k = j_b + 1; k < tmp_card_info_vec1.size(); k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = j_a + 1; k < j_b + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = 0; k < j_a + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(tmp_card_info_vec1[k]);\n\t\t\t}\n\t\t}\n\n\t\tp_num_cards = 0;\n\t\tc_num_cards = 0;\n\t\tis_found = false;\n\t\tresult = 0;\n\t\tfor (CardInfo& card_info : card_info_vec) {\n\t\t\tint& zb = card_info.begin_num;\n\n\t\t\tc_num_cards += card_info.num_cards;\n\t\t\tif (q <= c_num_cards && !is_found) {\n\t\t\t\tint zp = zb + p - p_num_cards - 1;\n\t\t\t\tint zq = zb + q - p_num_cards - 1;\n\t\t\t\tint idx_r = r - zp;\n\n\t\t\t\tresult += min(max(idx_r, -1), zq - zp) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (p <= c_num_cards && !is_found) {\n\t\t\t\tint zp = zb + p - p_num_cards - 1;\n\t\t\t\tint ze = zb + card_info.num_cards - 1;\n\t\t\t\tint idx_r = r - zp;\n\t\t\t\tresult += min(max(idx_r, -1), ze - zp) + 1;\n\t\t\t\tis_found = true;\n\t\t\t}\n\t\t\telse if (q > c_num_cards && is_found) {\n\t\t\t\tint ze = zb + card_info.num_cards - 1;\n\t\t\t\tint idx_r = r - zb;\n\n\t\t\t\tresult += min(max(idx_r, -1), ze - zb) + 1;\n\t\t\t}\n\t\t\telse if (q <= c_num_cards && is_found) {\n\t\t\t\tint zq = zb + q - p_num_cards - 1;\n\t\t\t\tint idx_r = r - zb;\n\t\t\t\tresult += min(max(idx_r, -1), zq - zb) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tp_num_cards = c_num_cards;\n\t\t}\n\t\tcout << result << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 200, "memory_kb": 3264, "score_of_the_acc": -0.302, "final_rank": 3 }, { "submission_id": "aoj_0536_6357202", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nclass CardInfo {\npublic:\n\tint begin_num;\n\tint num_cards;\n\npublic:\n\tCardInfo(int b, int n) : begin_num(b), num_cards(n) {\n\t}\n\n\t~CardInfo() {\n\t}\n};\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint n = -1;\n\t\tint m = -1;\n\t\tint p = -1;\n\t\tint q = -1;\n\t\tint r = -1;\n\t\tvector<CardInfo> card_info_vec;\n\t\tvector<CardInfo> n_card_info_vec0;\n\t\tvector<CardInfo> n_card_info_vec1;\n\t\tint p_num_cards = -1;\n\t\tint c_num_cards = -1;\n\t\tint x = -1;\n\t\tint y = -1;\n\t\tint j_a = -1;\n\t\tint j_b = -1;\n\t\tbool is_found = false;\n\t\tint result = 0;\n\n\t\tcin >> n;\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tcin >> m >> p >> q >> r;\n\t\tcard_info_vec.push_back(CardInfo(1, n));\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tcin >> x >> y;\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\tn_card_info_vec0.clear();\n\t\t\tn_card_info_vec1.clear();\n\t\t\tis_found = false;\n\n\t\t\tfor (int j = 0; j < card_info_vec.size(); j++) {\n\t\t\t\tint& z = card_info_vec[j].begin_num;\n\n\t\t\t\tc_num_cards += card_info_vec[j].num_cards;\n\t\t\t\tif (x <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = x - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - x);\n\n\t\t\t\t\tn_card_info_vec0.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\tn_card_info_vec0.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_a = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tn_card_info_vec0.push_back(card_info_vec[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\tis_found = false;\n\t\t\tfor (int j = 0; j < n_card_info_vec0.size(); j++) {\n\t\t\t\tint& z = n_card_info_vec0[j].begin_num;\n\n\t\t\t\tc_num_cards += n_card_info_vec0[j].num_cards;\n\t\t\t\tif (y <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = y - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - y);\n\n\t\t\t\t\tn_card_info_vec1.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\tn_card_info_vec1.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_b = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tn_card_info_vec1.push_back(n_card_info_vec0[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tcard_info_vec.clear();\n\t\t\tfor (int k = j_b + 1; k < n_card_info_vec1.size(); k++) {\n\t\t\t\tcard_info_vec.push_back(n_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = j_a + 1; k < j_b + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(n_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = 0; k < j_a + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(n_card_info_vec1[k]);\n\t\t\t}\n\t\t}\n\n\t\tp_num_cards = 0;\n\t\tc_num_cards = 0;\n\t\tis_found = false;\n\t\tresult = 0;\n\t\tfor (CardInfo& card_info : card_info_vec) {\n\t\t\tint& zb = card_info.begin_num;\n\t\t\tint ze = zb + card_info.num_cards - 1;\n\t\t\tint zq = zb + q - p_num_cards - 1;\n\n\t\t\tc_num_cards += card_info.num_cards;\n\t\t\tif (q <= c_num_cards && !is_found) {\n\t\t\t\tint zp = zb + p - p_num_cards - 1;\n\t\t\t\tint idx_r = r - zp;\n\n\t\t\t\tresult += min(max(idx_r, -1), zq - zp) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (p <= c_num_cards && !is_found) {\n\t\t\t\tint zp = zb + p - p_num_cards - 1;\n\t\t\t\tint idx_r = r - zp;\n\t\t\t\tresult += min(max(idx_r, -1), ze - zp) + 1;\n\t\t\t\tis_found = true;\n\t\t\t}\n\t\t\telse if (q > c_num_cards && is_found) {\n\t\t\t\tint idx_r = r - zb;\n\n\t\t\t\tresult += min(max(idx_r, -1), ze - zb) + 1;\n\t\t\t}\n\t\t\telse if (q <= c_num_cards && is_found) {\n\t\t\t\tint idx_r = r - zb;\n\t\t\t\tresult += min(max(idx_r, -1), zq - zb) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tp_num_cards = c_num_cards;\n\t\t}\n\t\tcout << result << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 3460, "score_of_the_acc": -0.4904, "final_rank": 9 }, { "submission_id": "aoj_0536_6357200", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nclass CardInfo {\npublic:\n\tint begin_num;\n\tint num_cards;\n\npublic:\n\tCardInfo(int b, int n) : begin_num(b), num_cards(n) {\n\t}\n\n\t~CardInfo() {\n\t}\n};\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint n = -1;\n\t\tint m = -1;\n\t\tint p = -1;\n\t\tint q = -1;\n\t\tint r = -1;\n\t\tint p_num_cards = -1;\n\t\tint c_num_cards = -1;\n\t\tvector<CardInfo> card_info_vec;\n\t\tbool is_found = false;\n\t\tint result = 0;\n\n\t\tcin >> n;\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tcin >> m >> p >> q >> r;\n\t\tcard_info_vec.push_back(CardInfo(1, n));\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint x = -1;\n\t\t\tint y = -1;\n\t\t\tvector<CardInfo> n_card_info_vec0;\n\t\t\tvector<CardInfo> n_card_info_vec1;\n\t\t\tint j_a = -1;\n\t\t\tint j_b = -1;\n\n\t\t\tcin >> x >> y;\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\tn_card_info_vec0.clear();\n\t\t\tn_card_info_vec1.clear();\n\t\t\tis_found = false;\n\n\t\t\tfor (int j = 0; j < card_info_vec.size(); j++) {\n\t\t\t\tint& z = card_info_vec[j].begin_num;\n\n\t\t\t\tc_num_cards += card_info_vec[j].num_cards;\n\t\t\t\tif (x <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = x - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - x);\n\n\t\t\t\t\tn_card_info_vec0.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\tn_card_info_vec0.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_a = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tn_card_info_vec0.push_back(card_info_vec[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\tis_found = false;\n\t\t\tfor (int j = 0; j < n_card_info_vec0.size(); j++) {\n\t\t\t\tint& z = n_card_info_vec0[j].begin_num;\n\n\t\t\t\tc_num_cards += n_card_info_vec0[j].num_cards;\n\t\t\t\tif (y <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = y - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - y);\n\n\t\t\t\t\tn_card_info_vec1.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\tn_card_info_vec1.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_b = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tn_card_info_vec1.push_back(n_card_info_vec0[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tcard_info_vec.clear();\n\t\t\tfor (int k = j_b + 1; k < n_card_info_vec1.size(); k++) {\n\t\t\t\tcard_info_vec.push_back(n_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = j_a + 1; k < j_b + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(n_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = 0; k < j_a + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(n_card_info_vec1[k]);\n\t\t\t}\n\t\t}\n\n\t\tp_num_cards = 0;\n\t\tc_num_cards = 0;\n\t\tis_found = false;\n\t\tresult = 0;\n\t\tfor (CardInfo& card_info : card_info_vec) {\n\t\t\tint& zb = card_info.begin_num;\n\t\t\tint ze = zb + card_info.num_cards - 1;\n\t\t\tint zq = zb + q - p_num_cards - 1;\n\n\t\t\tc_num_cards += card_info.num_cards;\n\t\t\tif (q <= c_num_cards && !is_found) {\n\t\t\t\tint zp = zb + p - p_num_cards - 1;\n\t\t\t\tint idx_r = r - zp;\n\n\t\t\t\tresult += min(max(idx_r, -1), zq - zp) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (p <= c_num_cards && !is_found) {\n\t\t\t\tint zp = zb + p - p_num_cards - 1;\n\t\t\t\tint idx_r = r - zp;\n\t\t\t\tresult += min(max(idx_r, -1), ze - zp) + 1;\n\t\t\t\tis_found = true;\n\t\t\t}\n\t\t\telse if (q > c_num_cards && is_found) {\n\t\t\t\tint idx_r = r - zb;\n\n\t\t\t\tresult += min(max(idx_r, -1), ze - zb) + 1;\n\t\t\t}\n\t\t\telse if (q <= c_num_cards && is_found) {\n\t\t\t\tint idx_r = r - zb;\n\t\t\t\tresult += min(max(idx_r, -1), zq - zb) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tp_num_cards = c_num_cards;\n\t\t}\n\t\tcout << result << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 340, "memory_kb": 3460, "score_of_the_acc": -0.7265, "final_rank": 17 }, { "submission_id": "aoj_0536_6357194", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nclass CardInfo {\npublic:\n\tint begin_num;\n\tint num_cards;\n\npublic:\n\tCardInfo(int b, int n) : begin_num(b), num_cards(n) {\n\t}\n\n\t~CardInfo() {\n\t}\n};\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint n = -1;\n\t\tint m = -1;\n\t\tint p = -1;\n\t\tint q = -1;\n\t\tint r = -1;\n\t\tvector<CardInfo> card_info_vec;\n\t\tvector<CardInfo> n_card_info_vec0;\n\t\tvector<CardInfo> n_card_info_vec1;\n\t\tint p_num_cards = -1;\n\t\tint c_num_cards = -1;\n\t\tint j_a = -1;\n\t\tint j_b = -1;\n\t\tbool is_found = false;\n\t\tint result = 0;\n\n\t\tcin >> n;\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tcin >> m >> p >> q >> r;\n\t\tcard_info_vec.push_back(CardInfo(1, n));\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint x = -1;\n\t\t\tint y = -1;\n\n\t\t\tcin >> x >> y;\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\tn_card_info_vec0.clear();\n\t\t\tn_card_info_vec1.clear();\n\t\t\tis_found = false;\n\n\t\t\tfor (int j = 0; j < card_info_vec.size(); j++) {\n\t\t\t\tint& z = card_info_vec[j].begin_num;\n\n\t\t\t\tc_num_cards += card_info_vec[j].num_cards;\n\t\t\t\tif (x <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = x - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - x);\n\n\t\t\t\t\tn_card_info_vec0.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\tn_card_info_vec0.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_a = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tn_card_info_vec0.push_back(card_info_vec[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\tis_found = false;\n\t\t\tfor (int j = 0; j < n_card_info_vec0.size(); j++) {\n\t\t\t\tint& z = n_card_info_vec0[j].begin_num;\n\n\t\t\t\tc_num_cards += n_card_info_vec0[j].num_cards;\n\t\t\t\tif (y <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = y - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - y);\n\n\t\t\t\t\tn_card_info_vec1.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\tn_card_info_vec1.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_b = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tn_card_info_vec1.push_back(n_card_info_vec0[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tcard_info_vec.clear();\n\t\t\tfor (int k = j_b + 1; k < n_card_info_vec1.size(); k++) {\n\t\t\t\tcard_info_vec.push_back(n_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = j_a + 1; k < j_b + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(n_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = 0; k < j_a + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(n_card_info_vec1[k]);\n\t\t\t}\n\t\t}\n\n\t\tp_num_cards = 0;\n\t\tc_num_cards = 0;\n\t\tis_found = false;\n\t\tresult = 0;\n\t\tfor (CardInfo& card_info : card_info_vec) {\n\t\t\tint& zb = card_info.begin_num;\n\t\t\tint ze = zb + card_info.num_cards - 1;\n\t\t\tint zq = zb + q - p_num_cards - 1;\n\n\t\t\tc_num_cards += card_info.num_cards;\n\t\t\tif (q <= c_num_cards && !is_found) {\n\t\t\t\tint zp = zb + p - p_num_cards - 1;\n\t\t\t\tint idx_r = r - zp;\n\n\t\t\t\tresult += min(max(idx_r, -1), zq - zp) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (p <= c_num_cards && !is_found) {\n\t\t\t\tint zp = zb + p - p_num_cards - 1;\n\t\t\t\tint idx_r = r - zp;\n\t\t\t\tresult += min(max(idx_r, -1), ze - zp) + 1;\n\t\t\t\tis_found = true;\n\t\t\t}\n\t\t\telse if (q > c_num_cards && is_found) {\n\t\t\t\tint idx_r = r - zb;\n\n\t\t\t\tresult += min(max(idx_r, -1), ze - zb) + 1;\n\t\t\t}\n\t\t\telse if (q <= c_num_cards && is_found) {\n\t\t\t\tint idx_r = r - zb;\n\t\t\t\tresult += min(max(idx_r, -1), zq - zb) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tp_num_cards = c_num_cards;\n\t\t}\n\t\tcout << result << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 3580, "score_of_the_acc": -0.6313, "final_rank": 16 }, { "submission_id": "aoj_0536_6357185", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nclass CardInfo {\npublic:\n\tint begin_num;\n\tint num_cards;\n\npublic:\n\tCardInfo(int b, int n) : begin_num(b), num_cards(n) {\n\t}\n\n\t~CardInfo() {\n\t}\n};\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint n = -1;\n\t\tint m = -1;\n\t\tint p = -1;\n\t\tint q = -1;\n\t\tint r = -1;\n\t\tvector<CardInfo> card_info_vec;\n\t\tvector<CardInfo> n_card_info_vec0;\n\t\tvector<CardInfo> n_card_info_vec1;\n\t\tint p_num_cards = -1;\n\t\tint c_num_cards = -1;\n\t\tint x = -1;\n\t\tint y = -1;\n\t\tint j_a = -1;\n\t\tint j_b = -1;\n\t\tbool is_found = false;\n\t\tint result = 0;\n\n\t\tcin >> n;\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tcin >> m >> p >> q >> r;\n\t\tcard_info_vec.push_back(CardInfo(1, n));\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tcin >> x >> y;\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\tn_card_info_vec0.clear();\n\t\t\tn_card_info_vec1.clear();\n\t\t\tis_found = false;\n\n\t\t\tfor (int j = 0; j < card_info_vec.size(); j++) {\n\t\t\t\tint& z = card_info_vec[j].begin_num;\n\n\t\t\t\tc_num_cards += card_info_vec[j].num_cards;\n\t\t\t\tif (x <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = x - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - x);\n\n\t\t\t\t\tn_card_info_vec0.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\tn_card_info_vec0.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_a = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tn_card_info_vec0.push_back(card_info_vec[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\tis_found = false;\n\t\t\tfor (int j = 0; j < n_card_info_vec0.size(); j++) {\n\t\t\t\tint& z = n_card_info_vec0[j].begin_num;\n\n\t\t\t\tc_num_cards += n_card_info_vec0[j].num_cards;\n\t\t\t\tif (y <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = y - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - y);\n\n\t\t\t\t\tn_card_info_vec1.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\tn_card_info_vec1.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_b = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tn_card_info_vec1.push_back(n_card_info_vec0[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tcard_info_vec.clear();\n\t\t\tfor (int k = j_b + 1; k < n_card_info_vec1.size(); k++) {\n\t\t\t\tcard_info_vec.push_back(n_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = j_a + 1; k < j_b + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(n_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = 0; k < j_a + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(n_card_info_vec1[k]);\n\t\t\t}\n\t\t}\n\n\t\tp_num_cards = 0;\n\t\tc_num_cards = 0;\n\t\tis_found = false;\n\t\tresult = 0;\n\t\tfor (CardInfo& card_info : card_info_vec) {\n\t\t\tint& zb = card_info.begin_num;\n\t\t\tint ze = zb + card_info.num_cards - 1;\n\t\t\tint zp = -1;\n\t\t\tint zq = zb + q - p_num_cards - 1;\n\t\t\tint idx_r = -1;\n\n\t\t\tc_num_cards += card_info.num_cards;\n\t\t\tif (q <= c_num_cards && !is_found) {\n\t\t\t\tzp = zb + p - p_num_cards - 1;\n\t\t\t\tidx_r = r - zp;\n\t\t\t\tresult += min(max(idx_r, -1), zq - zp) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (p <= c_num_cards && !is_found) {\n\t\t\t\tzp = zb + p - p_num_cards - 1;\n\t\t\t\tidx_r = r - zp;\n\t\t\t\tresult += min(max(idx_r, -1), ze - zp) + 1;\n\t\t\t\tis_found = true;\n\t\t\t}\n\t\t\telse if (q > c_num_cards && is_found) {\n\t\t\t\tidx_r = r - zb;\n\t\t\t\tresult += min(max(idx_r, -1), ze - zb) + 1;\n\t\t\t}\n\t\t\telse if (q <= c_num_cards && is_found) {\n\t\t\t\tidx_r = r - zb;\n\t\t\t\tresult += min(max(idx_r, -1), zq - zb) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tp_num_cards = c_num_cards;\n\t\t}\n\t\tcout << result << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 200, "memory_kb": 3480, "score_of_the_acc": -0.5556, "final_rank": 15 }, { "submission_id": "aoj_0536_6357181", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nclass CardInfo {\npublic:\n\tint begin_num;\n\tint num_cards;\n\npublic:\n\tCardInfo(int b, int n) : begin_num(b), num_cards(n) {\n\t}\n\n\t~CardInfo() {\n\t}\n};\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint n = -1;\n\t\tint m = -1;\n\t\tint p = -1;\n\t\tint q = -1;\n\t\tint r = -1;\n\t\tvector<CardInfo> card_info_vec;\n\t\tvector<CardInfo> n_card_info_vec0;\n\t\tvector<CardInfo> n_card_info_vec1;\n\t\tint p_num_cards = -1;\n\t\tint c_num_cards = -1;\n\t\tint x = -1;\n\t\tint y = -1;\n\t\tint j_a = -1;\n\t\tint j_b = -1;\n\t\tbool is_found = false;\n\t\tint result = 0;\n\n\t\tcin >> n;\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tcin >> m >> p >> q >> r;\n\t\tcard_info_vec.push_back(CardInfo(1, n));\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tcin >> x >> y;\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\tn_card_info_vec0.clear();\n\t\t\tn_card_info_vec1.clear();\n\t\t\tn_card_info_vec0.reserve(sizeof(CardInfo) * m);\n\t\t\tn_card_info_vec1.reserve(sizeof(CardInfo) * m);\n\t\t\tis_found = false;\n\n\t\t\tfor (int j = 0; j < card_info_vec.size(); j++) {\n\t\t\t\tint& z = card_info_vec[j].begin_num;\n\n\t\t\t\tc_num_cards += card_info_vec[j].num_cards;\n\t\t\t\tif (x <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = x - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - x);\n\n\t\t\t\t\tn_card_info_vec0.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\tn_card_info_vec0.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_a = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tn_card_info_vec0.push_back(card_info_vec[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\tis_found = false;\n\t\t\tfor (int j = 0; j < n_card_info_vec0.size(); j++) {\n\t\t\t\tint& z = n_card_info_vec0[j].begin_num;\n\n\t\t\t\tc_num_cards += n_card_info_vec0[j].num_cards;\n\t\t\t\tif (y <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = y - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - y);\n\n\t\t\t\t\tn_card_info_vec1.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\tn_card_info_vec1.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_b = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tn_card_info_vec1.push_back(n_card_info_vec0[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tcard_info_vec.clear();\n\t\t\tcard_info_vec.reserve(sizeof(CardInfo) * m);\n\t\t\tfor (int k = j_b + 1; k < n_card_info_vec1.size(); k++) {\n\t\t\t\tcard_info_vec.push_back(n_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = j_a + 1; k < j_b + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(n_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = 0; k < j_a + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(n_card_info_vec1[k]);\n\t\t\t}\n\t\t}\n\n\t\tp_num_cards = 0;\n\t\tc_num_cards = 0;\n\t\tis_found = false;\n\t\tresult = 0;\n\t\tfor (CardInfo& card_info : card_info_vec) {\n\t\t\tint& zb = card_info.begin_num;\n\t\t\tint ze = zb + card_info.num_cards - 1;\n\t\t\tint zp = -1;\n\t\t\tint zq = zb + q - p_num_cards - 1;\n\t\t\tint idx_r = -1;\n\n\t\t\tc_num_cards += card_info.num_cards;\n\t\t\tif (q <= c_num_cards && !is_found) {\n\t\t\t\tzp = zb + p - p_num_cards - 1;\n\t\t\t\tidx_r = r - zp;\n\t\t\t\tresult += min(max(idx_r, -1), zq - zp) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (p <= c_num_cards && !is_found) {\n\t\t\t\tzp = zb + p - p_num_cards - 1;\n\t\t\t\tidx_r = r - zp;\n\t\t\t\tresult += min(max(idx_r, -1), ze - zp) + 1;\n\t\t\t\tis_found = true;\n\t\t\t}\n\t\t\telse if (q > c_num_cards && is_found) {\n\t\t\t\tidx_r = r - zb;\n\t\t\t\tresult += min(max(idx_r, -1), ze - zb) + 1;\n\t\t\t}\n\t\t\telse if (q <= c_num_cards && is_found) {\n\t\t\t\tidx_r = r - zb;\n\t\t\t\tresult += min(max(idx_r, -1), zq - zb) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tp_num_cards = c_num_cards;\n\t\t}\n\t\tcout << result << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 200, "memory_kb": 3344, "score_of_the_acc": -0.3959, "final_rank": 5 }, { "submission_id": "aoj_0536_6357161", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <vector>\n\nusing namespace std;\n\nclass CardInfo {\npublic:\n\tint begin_num;\n\tint num_cards;\n\npublic:\n\tCardInfo(int b, int n) : begin_num(b), num_cards(n) {\n\t}\n\n\t~CardInfo() {\n\t}\n};\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test1.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\twhile (true) {\n\t\tint n = -1;\n\t\tint m = -1;\n\t\tint p = -1;\n\t\tint q = -1;\n\t\tint r = -1;\n\t\tvector<CardInfo> card_info_vec;\n\t\tvector<CardInfo> n_card_info_vec0;\n\t\tvector<CardInfo> n_card_info_vec1;\n\t\tint p_num_cards = -1;\n\t\tint c_num_cards = -1;\n\t\tint x = -1;\n\t\tint y = -1;\n\t\tint j_a = -1;\n\t\tint j_b = -1;\n\t\tbool is_found = false;\n\t\tint result = 0;\n\n\t\tcin >> n;\n\t\tif (n == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tcin >> m >> p >> q >> r;\n\t\tcard_info_vec.push_back(CardInfo(1, n));\n\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tcin >> x >> y;\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\tn_card_info_vec0.clear();\n\t\t\tn_card_info_vec1.clear();\n\t\t\tis_found = false;\n\n\t\t\tfor (int j = 0; j < card_info_vec.size(); j++) {\n\t\t\t\tint &z = card_info_vec[j].begin_num;\n\n\t\t\t\tc_num_cards += card_info_vec[j].num_cards;\n\t\t\t\tif (x <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = x - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - x);\n\n\t\t\t\t\tn_card_info_vec0.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\tn_card_info_vec0.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_a = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tn_card_info_vec0.push_back(card_info_vec[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\n\t\t\tp_num_cards = 0;\n\t\t\tc_num_cards = 0;\n\t\t\tis_found = false;\n\t\t\tfor (int j = 0; j < n_card_info_vec0.size(); j++) {\n\t\t\t\tint& z = n_card_info_vec0[j].begin_num;\n\n\t\t\t\tc_num_cards += n_card_info_vec0[j].num_cards;\n\t\t\t\tif (y <= c_num_cards && !is_found) {\n\t\t\t\t\tint offset = y - p_num_cards;\n\t\t\t\t\tCardInfo card_info0(z, offset);\n\t\t\t\t\tCardInfo card_info1(z + offset, c_num_cards - y);\n\n\t\t\t\t\tn_card_info_vec1.push_back(card_info0);\n\t\t\t\t\tif (card_info1.num_cards > 0) {\n\t\t\t\t\t\tn_card_info_vec1.push_back(card_info1);\n\t\t\t\t\t}\n\t\t\t\t\tj_b = j;\n\t\t\t\t\tis_found = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tn_card_info_vec1.push_back(n_card_info_vec0[j]);\n\t\t\t\t}\n\t\t\t\tp_num_cards = c_num_cards;\n\t\t\t}\n\t\t\t\n\t\t\tcard_info_vec.clear();\n\n\t\t\tfor (int k = j_b + 1; k < n_card_info_vec1.size(); k++) {\n\t\t\t\tcard_info_vec.push_back(n_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = j_a + 1; k < j_b + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(n_card_info_vec1[k]);\n\t\t\t}\n\t\t\tfor (int k = 0; k < j_a + 1; k++) {\n\t\t\t\tcard_info_vec.push_back(n_card_info_vec1[k]);\n\t\t\t}\n\t\t}\n\t\tp_num_cards = 0;\n\t\tc_num_cards = 0;\n\t\tis_found = false;\n\t\tresult = 0;\n\t\tfor (CardInfo& card_info : card_info_vec) {\n\t\t\tint& zb = card_info.begin_num;\n\t\t\tint ze = zb + card_info.num_cards - 1;\n\t\t\tint zq = zb + q - p_num_cards - 1;\n\n\t\t\tc_num_cards += card_info.num_cards;\n\t\t\tif (q <= c_num_cards && !is_found) {\n\t\t\t\tint zp = zb + p - p_num_cards - 1;\n\t\t\t\tint idx_r = r - zp;\n\n\t\t\t\tresult += min(max(idx_r, -1), zq - zp) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse if (p <= c_num_cards && !is_found) {\n\t\t\t\tint zp = zb + p - p_num_cards - 1;\n\t\t\t\tint idx_r = r - zp;\n\n\t\t\t\tresult += min(max(idx_r, -1), ze - zp) + 1;\n\t\t\t\tis_found = true;\n\t\t\t}\n\t\t\telse if (q > c_num_cards && is_found) {\n\t\t\t\tint idx_r = r - zb;\n\n\t\t\t\tresult += min(max(idx_r, -1), ze - zb) + 1;\n\t\t\t}\n\t\t\telse if (q <= c_num_cards && is_found) {\n\t\t\t\tint idx_r = r - zb;\n\n\t\t\t\tresult += min(max(idx_r, -1), zq - zb) + 1;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tp_num_cards = c_num_cards;\n\t\t}\n\t\tcout << result << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 3480, "score_of_the_acc": -0.5139, "final_rank": 10 }, { "submission_id": "aoj_0536_6325009", "code_snippet": "#include <bits/stdc++.h>\n#define all(v) v.begin(), v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)\n#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)\n#define codefor int test;scanf(\"%d\",&test);while(test--)\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define yes(ans) if(ans)printf(\"yes\\n\");else printf(\"no\\n\")\n#define Yes(ans) if(ans)printf(\"Yes\\n\");else printf(\"No\\n\")\n#define YES(ans) if(ans)printf(\"YES\\n\");else printf(\"NO\\n\")\n#define popcount(v) __builtin_popcount(v)\n#define vector1d(type,name,...) vector<type>name(__VA_ARGS__)\n#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\n#define vector4d(type,name,h,w,d,...) vector<vector<vector<vector<type>>>>name(h,vector<vector<vector<type>>>(w,vector<vector<type>>(d,vector<type>(__VA_ARGS__))))\nusing namespace std;\nusing ll = long long;\ntemplate<class T>using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;\nconst int MOD=1000000007;\nconst int MOD2=998244353;\nconst int INF=1<<30;\nconst ll INF2=(ll)1<<60;\n//入力系\nvoid scan(int& a){scanf(\"%d\",&a);}\nvoid scan(long long& a){scanf(\"%lld\",&a);}\ntemplate<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}\ntemplate<class T> void scan(T& a){cin>>a;}\ntemplate<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}\n//出力系\nvoid print(const int& a){printf(\"%d\",a);}\nvoid print(const long long& a){printf(\"%lld\",a);}\nvoid print(const double& a){printf(\"%.15lf\",a);}\ntemplate<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}\ntemplate<class T> void print(const T& a){cout<<a;}\ntemplate<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}\nvoid out(){putchar('\\n');}\ntemplate<class T> void out(const T& t){print(t);putchar('\\n');}\ntemplate <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}\n//デバッグ系\ntemplate<class T> void dprint(const T& a){cerr<<a;}\ntemplate<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<\" \"<<*it;}}\nvoid debug(){cerr<<endl;}\ntemplate<class T> void debug(const T& t){dprint(t);cerr<<endl;}\ntemplate <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<\" \";debug(tail...);}\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\nll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}\nll updivide(ll a,ll b){if(a%b==0) return a/b;else return (a/b)+1;}\ntemplate<class T> void chmax(T &a,const T b){if(b>a)a=b;}\ntemplate<class T> void chmin(T &a,const T b){if(b<a)a=b;}\n\nint main(){\n while(1){\n INT(n);\n if(!n)return 0;\n INT(m);\n deque<pair<int,int>> dq;\n dq.push_back({1,n});\n INT(p,q,r);\n auto shuffle=[&](int x,int y){\n deque<pair<int,int>> A,B;\n y-=x;\n while(x>=1){\n if(x>=dq.front().second-dq.front().first+1){\n x-=dq.front().second-dq.front().first+1;\n A.push_back(dq.front());\n dq.pop_front();\n }else{\n int xr=dq.front().first+x-1,xrr=dq.front().second;\n A.push_back({dq.front().first,xr});\n dq.pop_front();\n dq.push_front({xr+1,xrr});\n x=0;\n }\n }\n while(y>=1){\n if(y>=dq.front().second-dq.front().first+1){\n y-=dq.front().second-dq.front().first+1;\n B.push_back(dq.front());\n dq.pop_front();\n }else{\n int yr=dq.front().first+y-1,yrr=dq.front().second;\n B.push_back({dq.front().first,yr});\n dq.pop_front();\n dq.push_front({yr+1,yrr});\n y=0;\n }\n }\n while(!B.empty()){\n dq.push_back(B.front());\n B.pop_front();\n }\n while(!A.empty()){\n dq.push_back(A.front());\n A.pop_front();\n }\n };\n auto count=[&](int x,int y,int r){\n int ans=0;\n x--;\n y-=x;\n while(x>=1){\n if(x>=dq.front().second-dq.front().first+1){\n x-=dq.front().second-dq.front().first+1;\n dq.pop_front();\n }else{\n int xr=dq.front().first+x-1,xrr=dq.front().second;\n dq.pop_front();\n dq.push_front({xr+1,xrr});\n x=0;\n }\n }\n while(y>=1){\n if(y>=dq.front().second-dq.front().first+1){\n y-=dq.front().second-dq.front().first+1;\n ans+=max(0,min(r,dq.front().second)-dq.front().first+1);\n dq.pop_front();\n }else{\n int yr=dq.front().first+y-1,yrr=dq.front().second;\n ans+=max(0,min(r,yr)-dq.front().first+1);\n dq.pop_front();\n y=0;\n }\n }\n return ans;\n };\n while(m--){\n INT(x,y);\n shuffle(x,y);\n }\n out(count(p,q,r));\n }\n}", "accuracy": 1, "time_ms": 120, "memory_kb": 3340, "score_of_the_acc": -0.2801, "final_rank": 2 }, { "submission_id": "aoj_0536_6291345", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\ntypedef long long ll;\n//typedef int ll;\ntypedef pair<ll, ll> P;\nconst long long INF = 1e9;\ntemplate <typename T>\nvoid input_arr(vector<T>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i];\n\t}\n}\ntemplate <typename T, typename Q>\nvoid input_arr(vector<pair<T, Q>>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i].first >> A[i].second;\n\t}\n}\ntemplate <typename T>\nvoid input_arr(vector<vector<T>>& A, ll H, ll W) {\n\tfor (ll i = 0; i < H; i++) {\n\t\tfor (ll j = 0; j < W; j++) {\n\t\t\tcin >> A[i][j];\n\t\t}\n\t}\n}\nbool cmp(P a, P b) {\n if (a.first != b.first) return a.first < b.first;\n else return a.second > b.second;\n}\nint main() {\n ll N, M; cin >> N >> M;\n while (N != 0) {\n ll x, y, z; cin >> x >> y >> z;\n vector<P>A;\n A.push_back({1, N});\n for (ll i = 0; i < M; i++) {\n vector<vector<P>>B(3);\n ll a, b; cin >> a >> b;\n ll pos = 0, left = A[0].first, right = A[0].second;\n ll sum = 0;\n while (pos < A.size()) {\n if (sum + (right - left + 1) < a) {\n sum += (right - left + 1);\n B[0].push_back({left, right});\n pos++;\n if (pos < A.size()) {left = A[pos].first; right = A[pos].second;}\n }\n else if (sum < a && sum + (right - left + 1) >= a) {\n B[0].push_back({left, left + (a - sum - 1)});\n left += (a - sum);\n sum = a;\n if (left > right) {\n pos++;\n left = A[pos].first; right = A[pos].second;\n }\n }\n else if (sum >= a) {\n if (sum + (right - left + 1) < b) {\n sum += (right - left + 1);\n B[1].push_back({left, right});\n pos++;\n if (pos < A.size()) {left = A[pos].first; right = A[pos].second;}\n }\n else if (sum < b && sum + (right - left + 1) >= b) {\n B[1].push_back({left, left + (b - sum - 1)});\n left += (b - sum);\n sum = b;\n if (left > right) {\n pos++;\n left = A[pos].first; right = A[pos].second;\n }\n }\n else if (sum >= b) {\n B[2].push_back({left, right});\n sum += (right - left + 1);\n pos++;\n if (pos < A.size()) {left = A[pos].first; right = A[pos].second;}\n }\n }\n }\n swap(B[0], B[2]);\n A.clear();\n for (ll j = 0; j < 3; j++) {\n for (P a : B[j]) {\n A.push_back(a);\n }\n }\n }\n ll sum = 0, ans = 0;\n for (ll i = 0; i < A.size(); i++) {\n if (sum + (A[i].second - A[i].first + 1) < x) {\n sum += (A[i].second - A[i].first + 1);\n }\n else if (sum < x && sum + (A[i].second - A[i].first + 1) >= x) {\n if (sum + (A[i].second - A[i].first + 1) < y) {\n ll left = A[i].first + (x - sum - 1);\n ans += min(z, A[i].second) - min(z, max(0LL, left - 1));\n sum += (A[i].second - A[i].first + 1);\n }\n else {\n ll left = A[i].first + (x - sum - 1), right = A[i].first + (y - sum - 1);\n ans += min(z, right) - min(z, max(0LL, left - 1));\n break;\n }\n }\n else if (sum >= x) {\n if (sum >= y) break;\n if (sum + (A[i].second - A[i].first + 1) < y) {\n sum += (A[i].second - A[i].first + 1);\n ans += min(z, A[i].second) - min(z, max(0LL, A[i].first - 1));\n }\n else {\n ll right = A[i].first + (y - sum - 1);\n ans += min(z, right) - min(z, max(0LL, A[i].first - 1));\n break;\n }\n }\n }\n cout << ans << endl; cin >> N >> M;\n }\n}", "accuracy": 1, "time_ms": 290, "memory_kb": 3648, "score_of_the_acc": -0.8777, "final_rank": 18 }, { "submission_id": "aoj_0536_5044271", "code_snippet": "#include<iostream>\n#include<vector>\n\n// This struct represents interval [s,t]\nstruct Bundle{\n int s,t;\n Bundle() : s(0), t(0) {}\n Bundle(int s_, int t_) : s(s_), t(t_) {}\n int count(void){\n return t-s+1;\n }\n};\n\nstd::vector<Bundle> Shuffle(int x, int y, std::vector<Bundle> card){\n std::vector<Bundle> first, second;\n std::vector<Bundle> res;\n int total = 0;\n int idx = 0;\n while(total + card[idx].count() < x){\n first.push_back(card[idx]);\n total += card[idx].count();\n ++idx;\n }\n if(total + card[idx].count() > x){\n first.emplace_back(card[idx].s, card[idx].s+x-total-1);\n total += first.back().count();\n card[idx].s = first.back().t+1;\n }else{\n first.push_back(card[idx]);\n total += card[idx++].count();\n }\n while(total + card[idx].count() < y){\n second.push_back(card[idx]);\n total += card[idx].count();\n ++idx;\n }\n if(total + card[idx].count() > y){\n second.emplace_back(card[idx].s, card[idx].s+y-total-1);\n total += second.back().count();\n card[idx].s = second.back().t+1;\n }else{\n second.push_back(card[idx]);\n total += card[idx++].count();\n }\n while(idx < card.size()) res.push_back(card[idx++]);\n for(auto s : second) res.push_back(s);\n for(auto f : first) res.push_back(f);\n return res;\n}\n\nint count(int P, int Q, int R, std::vector<Bundle> card){\n int ans = 0;\n int idx = 0;\n int count = 0; // total cards card[0..idx] bundles\n while(count + card[idx].count() < P)\n count += card[idx++].count();\n\n if(count + card[idx].count() >= P){\n if(card[idx].s > R){\n count += card[idx++].count();\n }else{\n int p = card[idx].s + (P - count-1);\n int q = std::min(card[idx].t, R);\n ans += std::min(q-p+1, Q-count);\n count += card[idx++].count();\n }\n }\n while(idx < card.size() && Q > count){\n if(card[idx].s > R){\n count += card[idx++].count();\n continue;\n }\n int p = card[idx].s;\n int q = std::min(card[idx].t, R);\n ans += std::min(q-p+1, Q-count);\n count += card[idx++].count();\n }\n\n return ans;\n}\n\nint main(){\n int N,M;\n while(std::cin >> N, N){\n std::vector<Bundle> card;\n card.emplace_back(1,N);\n std::cin >> M;\n int P,Q,R; std::cin >> P >> Q >> R;\n for(int m=0; m<M; ++m){\n int x,y; std::cin >> x >> y;\n card = Shuffle(x, y, card);\n }\n std::cout << count(P, Q, R, card) << std::endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 250, "memory_kb": 3260, "score_of_the_acc": -0.3668, "final_rank": 4 } ]
aoj_0537_cpp
ビンゴ 問題 あるプログラミングコンテストでは,競技後の懇親会でビンゴゲームをする習わしがある．しかし,このビンゴゲームで使うビンゴカードは少々特殊で,以下の条件に従って作成される． ビンゴカードは N 行 N 列のマス目に区切られており，各マス目には正整数が１つずつ書かれている．それらの整数は全て異なる． マス目に書かれている整数は 1 以上 M 以下である． ビンゴカードに書かれているN×N個の整数の合計は S である． どの列を見たときも，上から下に向かって整数は昇順に並んでいる． どのマス目の整数も，そのマス目より左の列のどの整数よりも大きい． 以下は， N = 5, M = 50, S = 685 のときのビンゴカードの例である． 懇親会のために上の条件を満たすビンゴカードをできるだけたくさん作りたい．ただし，同一のカードを2枚以上作ってはならない．作ることができるビンゴカードの枚数の最大値を 100000 で割った余りを出力するプログラムを作成せよ． 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる． 入力は1行からなり, その行にはビンゴカードのサイズ N (1≤N≤7), マス目に書かれている整数の上限 M (1≤M≤2000),ビンゴカードに書かれている整数の合計 S (1≤S≤3000) を表す3つの正整数が空白区切りで書かれている．ただし, 与えられるどの入力データにおいても，条件を満たすビンゴカードを1枚以上作ることができる． N, M, S が 0 のとき入力の終了を示す. データセットの数は 5 を超えない． 出力 データセットごとに, 作ることができるビンゴカードの枚数の最大値を 100000 で割った余りを1行に出力せよ． 入出力例 入力例 3 9 45 3 100 50 5 50 685 0 0 0 出力例 1 7 74501 3つ目の入力例に対して，作ることができるビンゴカードの枚数の最大値は 642499974501 であるので， 100000 で割った余りの 74501 を出力する． 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0537_9596124", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nconst ll mod=100000;\nint main(){\n ll N,M,S;\n while(cin>>N>>M>>S,N+M+S!=0){ vector<vector<ll>> DP(N*N+1,vector<ll>(S+1,0));\n DP[0][0]=1;\n for(int m=1;m<=M;m++){\n auto NDP=DP;\n for(int n=0;n<=N*N;n++){\n for(int s=0;s<=S;s++){\n if(n+1<=N*N&&m+s<=S){\n NDP[n+1][m+s]+=DP[n][s];\n NDP[n+1][m+s]%=mod;\n }\n }\n }\n swap(DP,NDP);\n }\n cout<<DP[N*N][S]<<endl;}\n \n}", "accuracy": 1, "time_ms": 800, "memory_kb": 5252, "score_of_the_acc": -1.0549, "final_rank": 19 }, { "submission_id": "aoj_0537_8861602", "code_snippet": "#include <iostream>\n#include <cstring>\n#include <omp.h>\n\nusing ll = long long;\nconst int inf = 1 << 29;\nint dp[55][3030];\n\ntemplate <class T1, class T2>\ninline bool minimize(T1& a, T2 b) {\n return b < a && (a = b, true);\n}\n\ntemplate <class T1, class T2>\ninline bool maximize(T1& a, T2 b) {\n return a < b && (a = b, true);\n}\n\nint main() {\n const int MOD = 100000;\n int N, M, S;\n while (std::cin >> N >> M >> S && (N | M | S)) {\n std::memset(dp, 0, sizeof(dp)); // Faster array initialization\n dp[0][0] = 1;\n // Parallelize outer two loops\n #pragma omp parallel for collapse(2)\n for (int add = 1; add <= M; ++add) {\n for (int currIndex = N * N; currIndex >= 1; --currIndex) {\n for (int currSum = add; currSum <= S; ++currSum) {\n dp[currIndex][currSum] = (dp[currIndex][currSum] + dp[currIndex - 1][currSum - add]) % MOD;\n }\n }\n }\n std::cout << dp[N * N][S] << std::endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 3988, "score_of_the_acc": -0.1193, "final_rank": 9 }, { "submission_id": "aoj_0537_8861601", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i, a, b) for (int i = a; i < (int)b; i++)\n#define rep(i, n) REP(i, 0, n)\n#define all(c) (c).begin(), (c).end()\n#define zero(a) memset(a, 0, sizeof a)\n#define minus(a) memset(a, -1, sizeof a)\n#define watch(a) \\\n { cout << #a << \" = \" << a << endl; }\ntemplate <class T1, class T2> inline bool minimize(T1 &a, T2 b) {\n return b < a && (a = b, 1);\n}\ntemplate <class T1, class T2> inline bool maximize(T1 &a, T2 b) {\n return a < b && (a = b, 1);\n}\ntypedef long long ll;\nint const inf = 1 << 29;\nint dp[55][3030];\nint main() {\n int const MOD = 100000;\n for (int N, M, S; cin >> N >> M >> S && (N | M | S);) {\n rep(i, 55) rep(j, 3030) dp[i][j] = 0;\n dp[0][0] = 1;\n REP(add, 1, M + 1) {\n for (int currIndex = N * N; currIndex >= 1; currIndex--) {\n for (int currSum = add; currSum <= S; currSum++) {\n (dp[currIndex][currSum] += dp[currIndex - 1][currSum - add]) %= MOD;\n }\n }\n }\n cout << dp[N * N][S] << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 3960, "score_of_the_acc": -0.1185, "final_rank": 7 }, { "submission_id": "aoj_0537_8861597", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i, a, b) for (int i = a; i < (int)b; i++)\n#define rep(i, n) REP(i, 0, n)\n#define all(c) (c).begin(), (c).end()\n#define zero(a) memset(a, 0, sizeof a)\n#define minus(a) memset(a, -1, sizeof a)\n#define watch(a) \\\n { cout << #a << \" = \" << a << endl; }\ntemplate <class T1, class T2> inline bool minimize(T1 &a, T2 b) {\n return b < a && (a = b, 1);\n}\ntemplate <class T1, class T2> inline bool maximize(T1 &a, T2 b) {\n return a < b && (a = b, 1);\n}\ntypedef long long ll;\nconst int inf = 1 << 29;\nint dp[55][3030];\nint main() {\n const int MOD = 100000;\n for (int N, M, S; cin >> N >> M >> S && (N | M | S);) {\n rep(i, 55) rep(j, 3030) dp[i][j] = 0;\n dp[0][0] = 1;\n REP(add, 1, M + 1) {\n for (int currIndex = N * N; currIndex >= 1; currIndex--) {\n for (int currSum = add; currSum <= S; currSum++) {\n if(currSum - add >= 0) { // Avoid undefined behaviour\n (dp[currIndex][currSum] += dp[currIndex - 1][currSum - add]) %= MOD;\n }\n }\n }\n }\n cout << dp[N * N][S] << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 210, "memory_kb": 3960, "score_of_the_acc": -0.1757, "final_rank": 18 }, { "submission_id": "aoj_0537_8861596", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i, a, b) for (int i = a; i < (int)b; i++)\n#define rep(i, n) REP(i, 0, n)\n#define all(c) (c).begin(), (c).end()\n#define zero(a) memset(a, 0, sizeof a)\n#define minus(a) memset(a, -1, sizeof a)\n#define watch(a) { cout << #a << \" = \" << a << endl; }\ntemplate <class T1, class T2> inline bool minimize(T1 &a, T2 b) {\n return b < a && (a = b, 1);\n}\ntemplate <class T1, class T2> inline bool maximize(T1 &a, T2 b) {\n return a < b && (a = b, 1);\n}\ntypedef long long ll;\nint const inf = 1 << 29;\nint dp[55][3030];\nint main() {\n int const MOD = 100000;\n for (int N, M, S; cin >> N >> M >> S && (N | M | S);) {\n int NN = N * N;\n rep(i, 55) rep(j, 3030) dp[i][j] = 0;\n dp[0][0] = 1;\n REP(add, 1, M + 1) {\n for (int currIndex = NN; currIndex >= 1; currIndex--) {\n for (int currSum = add; currSum <= S; currSum++) {\n (dp[currIndex][currSum] += dp[currIndex - 1][currSum - add]) %= MOD;\n }\n }\n }\n cout << dp[NN][S] << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 4072, "score_of_the_acc": -0.1217, "final_rank": 12 }, { "submission_id": "aoj_0537_8861594", "code_snippet": "#include <iostream>\n#include <vector>\n\nconst int MODULO = 100000;\n\nint main() {\n int numCount, numRange, targetSum;\n while (std::cin >> numCount >> numRange >> targetSum && (numCount || numRange || targetSum)) {\n std::vector<std::vector<int>> ways(numCount * numCount + 1, std::vector<int>(targetSum + 1, 0));\n ways[0][0] = 1;\n\n for (int add = 1; add <= numRange; ++add) {\n for (int currIndex = numCount * numCount; currIndex >= 1; --currIndex) {\n for (int currSum = add; currSum <= targetSum; ++currSum) {\n (ways[currIndex][currSum] += ways[currIndex - 1][currSum - add]) %= MODULO;\n }\n }\n }\n\n std::cout << ways[numCount * numCount][targetSum] << std::endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 180, "memory_kb": 3300, "score_of_the_acc": -0.1143, "final_rank": 4 }, { "submission_id": "aoj_0537_8861593", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i, a, b) for (int i = a; i < (int)b; i++)\n#define rep(i, n) REP(i, 0, n)\n#define all(c) (c).begin(), (c).end()\n#define zero(a) memset(a, 0, sizeof a)\n#define minus(a) memset(a, -1, sizeof a)\n#define watch(a) \\\n { cout << #a << \" = \" << a << endl; }\ntemplate <class T1, class T2> inline bool minimize(T1 &a, T2 b) {\n return b < a && (a = b, 1);\n}\ntemplate <class T1, class T2> inline bool maximize(T1 &a, T2 b) {\n return a < b && (a = b, 1);\n}\ntypedef long long ll;\nint const inf = 1 << 29;\nint dp[55][3030];\nint main() {\n int const MOD = 100000;\n for (int N, M, S; cin >> N >> M >> S && (N | M | S);) {\n // Initialize only necessary part of dp array\n REP(i, 0, N * N + 1) {\n REP(j, 0, S + 1) {\n dp[i][j] = 0;\n }\n }\n dp[0][0] = 1;\n REP(add, 1, M + 1) {\n for (int currIndex = N * N; currIndex >= 1; currIndex--) {\n for (int currSum = add; currSum <= S; currSum++) {\n (dp[currIndex][currSum] += dp[currIndex - 1][currSum - add]) %= MOD;\n }\n }\n }\n cout << dp[N * N][S] << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 3784, "score_of_the_acc": -0.1136, "final_rank": 3 }, { "submission_id": "aoj_0537_8836844", "code_snippet": "#include <iostream>\n#include <cstring>\nusing namespace std;\n\ntypedef long long ll;\n\nint const MOD = 100000;\n\nint main() {\n int const MAX_N = 55;\n int const MAX_S = 3030;\n int dp[MAX_N * MAX_N + 1][MAX_S + 1];\n\n int N, M, S;\n while (cin >> N >> M >> S && (N | M | S)) {\n // Clear dp array\n memset(dp, 0, sizeof dp);\n\n dp[0][0] = 1;\n\n for (int add = 1; add <= M; add++) {\n for (int currIndex = N * N; currIndex >= 1; currIndex--) {\n for (int currSum = add; currSum <= S; currSum++) {\n int prevSum = currSum - add;\n dp[currIndex][currSum] = (dp[currIndex][currSum] + dp[currIndex - 1][prevSum]) % MOD;\n }\n }\n }\n\n cout << dp[N * N][S] << endl;\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 180, "memory_kb": 38880, "score_of_the_acc": -1.1143, "final_rank": 20 }, { "submission_id": "aoj_0537_8819273", "code_snippet": "#include <iostream>\n#include <vector>\n\ntemplate <class T1, class T2> \ninline bool minimize(T1 &a, T2 b) {\n return b < a && (a = b, 1);\n}\n\ntemplate <class T1, class T2> \ninline bool maximize(T1 &a, T2 b) {\n return a < b && (a = b, 1);\n}\n\ntypedef long long ll;\n\nconstexpr int inf = 1 << 29;\nint dp[55][3030];\n\nint main() {\n constexpr int MOD = 100000;\n int N, M, S;\n while(std::cin >> N >> M >> S && (N | M | S)){\n for(int i=0; i<55; i++)\n for(int j=0; j<3030; j++)\n dp[i][j] = 0;\n \n dp[0][0] = 1;\n \n for(int add=1; add <= M; add++) {\n for(int currIndex=N*N; currIndex >=1; currIndex--){\n for(int currSum=add; currSum <= S; currSum++){\n dp[currIndex][currSum] = (dp[currIndex][currSum] + dp[currIndex - 1][currSum - add]) % MOD;\n }\n }\n }\n std::cout << dp[N*N][S] << std::endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 3976, "score_of_the_acc": -0.119, "final_rank": 8 }, { "submission_id": "aoj_0537_8819271", "code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\nconst int inf = 1 << 29;\nint main() {\n int const MOD = 100000;\n vector<vector<int>> dp(55, vector<int>(3030, 0));\n for (int N, M, S; cin >> N >> M >> S && (N | M | S);) {\n for(auto& v: dp)\n fill(v.begin(), v.end(), 0);\n dp[0][0] = 1;\n int maxIndex = N * N;\n for (int add = 1; add <= M; ++add) {\n for (int currIndex = maxIndex; currIndex >= 1; --currIndex) {\n for (int currSum = add; currSum <= S; ++currSum) {\n (dp[currIndex][currSum] += dp[currIndex - 1][currSum - add]) %= MOD;\n }\n }\n }\n cout << dp[maxIndex][S] << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 3636, "score_of_the_acc": -0.1094, "final_rank": 2 }, { "submission_id": "aoj_0537_8819268", "code_snippet": "#include <iostream>\n#include <cstring>\n\n#define REP(i, a, b) for (int i = a; i < (int)b; i++)\n\ntypedef int int32;\nint32 const inf = 1 << 29;\nint32 dp[55][3030];\n\nint main() {\n int32 const MOD = 100000;\n std::ios::sync_with_stdio(false);\n std::cin.tie(NULL);\n\n for (int32 N, M, S; std::cin >> N >> M >> S && (N || M || S);) {\n std::memset(dp, 0, sizeof(dp));\n dp[0][0] = 1;\n REP(add, 1, M + 1) {\n for (int32 currIndex = N * N; currIndex >= 1; currIndex--) {\n for (int32 currSum = add; currSum <= S; currSum++) {\n (dp[currIndex][currSum] += dp[currIndex - 1][currSum - add]) %= MOD;\n }\n }\n }\n std::cout << dp[N * N][S] << std::endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 180, "memory_kb": 3996, "score_of_the_acc": -0.1338, "final_rank": 16 }, { "submission_id": "aoj_0537_8819264", "code_snippet": "#include<iostream>\n#include <vector>\nusing namespace std;\n\ntypedef long long ll;\nconst int MOD = 100000;\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n\n vector<vector<int>> dp(55,vector<int>(3030,0));\n\n int N, M, S;\n\n while (cin >> N >> M >> S && (N | M | S)) {\n for(int i = 0; i<55; i++)\n for(int j = 0; j<3030; j++)\n dp[i][j] = 0;\n\n dp[0][0] = 1;\n\n for (int add = 1; add <= M; add++) {\n for (int currIndex = N * N; currIndex >= 1; currIndex--) {\n for (int currSum = add; currSum <= S; currSum++) {\n (dp[currIndex][currSum] += dp[currIndex - 1][currSum - add]) %= MOD;\n }\n }\n }\n cout << dp[N * N][S] << \"\\n\";\n }\n return 0;\n}", "accuracy": 1, "time_ms": 180, "memory_kb": 3716, "score_of_the_acc": -0.126, "final_rank": 14 }, { "submission_id": "aoj_0537_8819263", "code_snippet": "#include <iostream>\n#include <cstring>\n\nusing namespace std;\n\ntypedef long long ll;\nconst int inf = 1 << 29;\nint dp[55][3030];\n\nbool minimize(int &a, int b) {\n return b < a && (a = b, 1);\n}\n\nbool maximize(int &a, int b) {\n return a < b && (a = b, 1);\n}\n\nint main() {\n std::ios_base::sync_with_stdio(false); cin.tie(NULL);\n\n const int MOD = 100000;\n for (int N, M, S; cin >> N >> M >> S && (N | M | S);) {\n for(int i=0; i<55; i++) {\n for(int j=0; j<3030; j++) {\n dp[i][j] = 0;\n }\n }\n dp[0][0] = 1;\n for(int add = 1; add < M + 1; add++) {\n for (int currIndex = N * N; currIndex >= 1; currIndex--) {\n for (int currSum = add; currSum <= S; currSum++) {\n (dp[currIndex][currSum] += dp[currIndex - 1][currSum - add]) %= MOD;\n }\n }\n }\n cout << dp[N * N][S] << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 190, "memory_kb": 3976, "score_of_the_acc": -0.1476, "final_rank": 17 }, { "submission_id": "aoj_0537_8819261", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\nint const inf = 1 << 29;\nint dp[55][3030];\nint main() {\n int const MOD = 100000;\n int N, M, S;\n while (scanf(\"%d %d %d\", &N, &M, &S) && (N | M | S)) {\n fill(&dp[0][0], &dp[0][0] + sizeof(dp) / sizeof(int), 0);\n dp[0][0] = 1;\n for (int add = 1; add <= M; add++) {\n for (int currIndex = N * N; currIndex >= 1; currIndex--) {\n for (int currSum = add; currSum <= S; currSum++) {\n dp[currIndex][currSum] += dp[currIndex - 1][currSum - add];\n if (dp[currIndex][currSum] >= MOD) dp[currIndex][currSum] -= MOD;\n }\n }\n }\n printf(\"%d\\n\", dp[N * N][S]);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 4168, "score_of_the_acc": -0.0244, "final_rank": 1 }, { "submission_id": "aoj_0537_8819260", "code_snippet": "#include <iostream>\n\nconst int MOD = 100000;\nconst int MAX_INDEX = 55;\nconst int MAX_SUM = 3030;\n\nint dp[MAX_INDEX][MAX_SUM];\n\nint main() {\n for (int N, M, S; std::cin >> N >> M >> S && (N | M | S);) {\n for(int i = 0; i < MAX_INDEX; ++i) {\n for(int j = 0; j < MAX_SUM; ++j) {\n dp[i][j] = 0;\n }\n }\n dp[0][0] = 1;\n for (int add = 1; add <= M; ++add) {\n for (int currIndex = N * N; currIndex >= 1; --currIndex) {\n for (int currSum = add; currSum <= S; ++currSum) {\n (dp[currIndex][currSum] += dp[currIndex - 1][currSum - add]) %= MOD;\n }\n }\n }\n std::cout << dp[N * N][S] << std::endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 180, "memory_kb": 3816, "score_of_the_acc": -0.1288, "final_rank": 15 }, { "submission_id": "aoj_0537_8819257", "code_snippet": "#include <iostream>\n#include <vector>\n#include <cstdint>\nusing namespace std;\n\nint main() {\n const int MOD = 100000;\n vector<vector<int64_t>> dp(55, vector<int64_t>(3030, 0));\n\n for (int N, M, S; cin >> N >> M >> S && (N | M | S);) {\n for(auto &v : dp) \n fill(v.begin(), v.end(), 0);\n dp[0][0] = 1;\n int total = N * N;\n for (int add = 1; add <= M; ++add) {\n for (int currIndex = total; currIndex >= 1; --currIndex) {\n for (int currSum = add; currSum <= S; ++currSum) {\n (dp[currIndex][currSum] += dp[currIndex - 1][currSum - add]) %= MOD;\n }\n }\n }\n cout << dp[total][S] << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 4012, "score_of_the_acc": -0.12, "final_rank": 11 }, { "submission_id": "aoj_0537_8810276", "code_snippet": "#include <iostream>\n#include <vector>\n\ntypedef long long ll;\n\nint main() {\n int const MOD = 100000;\n for (int N, M, S; std::cin >> N >> M >> S && (N | M | S);) {\n std::vector<std::vector<int>> dp(N * N + 1, std::vector<int>(S + 1));\n dp[0][0] = 1;\n for (int add = 1; add <= M; add++) {\n for (int currIndex = N * N; currIndex >= 1; currIndex--) {\n for (int currSum = add; currSum <= S; currSum++) {\n dp[currIndex][currSum] += dp[currIndex - 1][currSum - add];\n dp[currIndex][currSum] %= MOD;\n }\n }\n }\n std::cout << dp[N * N][S] << std::endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 180, "memory_kb": 3564, "score_of_the_acc": -0.1217, "final_rank": 13 }, { "submission_id": "aoj_0537_8810275", "code_snippet": "#include <iostream>\nusing namespace std;\n\nconst int MOD = 100000;\nconst int MAX_N = 55;\nconst int MAX_S = 3030;\n\nint dp[MAX_N][MAX_S];\n\nint main() {\n int N, M, S;\n while (cin >> N >> M >> S && (N | M | S)) {\n for (int i = 0; i <= N * N; i++) {\n for (int j = 0; j <= S; j++) {\n dp[i][j] = 0;\n }\n }\n dp[0][0] = 1;\n for (int add = 1; add <= M; add++) {\n for (int currIndex = N * N; currIndex >= 1; currIndex--) {\n for (int currSum = add; currSum <= S; currSum++) {\n dp[currIndex][currSum] += dp[currIndex - 1][currSum - add];\n dp[currIndex][currSum] %= MOD;\n }\n }\n }\n cout << dp[N * N][S] << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 3908, "score_of_the_acc": -0.1171, "final_rank": 6 }, { "submission_id": "aoj_0537_8810273", "code_snippet": "#include <iostream>\nusing namespace std;\n\ntypedef long long ll;\n\nint const inf = 1 << 29;\n\nint dp[55][3030];\n\nint main() {\n int const MOD = 100000;\n int N, M, S;\n while (cin >> N >> M >> S && (N != 0 && M != 0 && S != 0)) {\n for (int i = 0; i < 55; i++) {\n for (int j = 0; j < 3030; j++) {\n dp[i][j] = 0;\n }\n }\n dp[0][0] = 1;\n for (int add = 1; add <= M; add++) {\n for (int currIndex = N * N; currIndex >= 1; currIndex--) {\n for (int currSum = add; currSum <= S; currSum++) {\n int temp = dp[currIndex - 1][currSum - add];\n dp[currIndex][currSum] = (dp[currIndex][currSum] + temp) % MOD;\n }\n }\n }\n cout << dp[N * N][S] << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 3816, "score_of_the_acc": -0.1145, "final_rank": 5 }, { "submission_id": "aoj_0537_8810271", "code_snippet": "#include <iostream>\nusing namespace std;\n\ntypedef long long ll;\n\nconst int MOD = 100000;\n\nint dp[55][3030];\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n while (true) {\n int N, M, S;\n cin >> N >> M >> S;\n \n if (N == 0 && M == 0 && S == 0) {\n break;\n }\n\n for (int i = 0; i < 55; i++) {\n for (int j = 0; j < 3030; j++) {\n dp[i][j] = 0;\n }\n }\n \n dp[0][0] = 1;\n\n for (int add = 1; add <= M; add++) {\n for (int currIndex = N * N; currIndex >= 1; currIndex--) {\n for (int currSum = S; currSum >= add; currSum--) {\n dp[currIndex][currSum] = (dp[currIndex][currSum] + dp[currIndex - 1][currSum - add]) % MOD;\n }\n }\n }\n\n cout << dp[N * N][S] << endl;\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 4008, "score_of_the_acc": -0.1199, "final_rank": 10 } ]
aoj_0540_cpp
あみだくじ 問題 あなたは J 君と一緒にあみだくじを使って遊んでいる.あみだくじは n 本の縦棒と m 本の横棒からなる.縦棒には左から順に 1 から n の番号がついており,縦棒 i の下端には正整数 s i が書かれている. 図 3-1 あみだくじの例( n = 4, m = 5, s 1 = 20, s 2 = 80, s 3 = 100, s 4 = 50) 縦棒 i の一番上から順に道をたどっていき到達した下端に書かれている整数が, 縦 棒 i を選んだ場合の得点である.例えば,図 3-1 では,縦棒 1 を選ぶと得点は 80 点 であり,縦棒 2 を選ぶと得点は 100 点である. 図 3-2 道のたどり方の例 J 君は縦棒 1 から縦棒 k までの連続した k 本を選ぶことにした.それら k 本の縦棒を選んだときの点数の合計が J 君の得点となる.ただし,あなたはあみだくじ内の 横棒を一本選び,その横棒をあみだくじから削除することができる. (削除しなくてもよい.) もし,あなたが横棒を一本削除した場合は,削除後のあみだくじにおいて, 縦棒 1 から縦棒 k までの連続した k 本の縦棒を選んだときの点数の合計が J 君の得点となる. 入力としてあみだくじの形と J 君の選ぶ縦棒の本数 k が与えられたとき,J 君の得 点の最小値を求めるプログラムを作成せよ. 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる． 1 行目には 4 つの整数 n , m , h , k が空白区切りで書かれている. n (2 ≤ n ≤ 1000) は縦棒の本数を, m (1 ≤ m ≤ 100000) は横棒の本数を, h (2 ≤ h ≤ 1000) は縦棒の長さを, k (1 ≤ k ≤ n) は J 君が選ぶ縦棒の本数を表す. 続く n 行には縦棒の下端に書かれている点数が書かれている. i + 1 行目 (1 ≤ i ≤ n)には正整数 s i が書かれている. また, s 1 + s 2 + ... + s n ≤ 2000000000 = 2 × 10 9 を満たす. 続く m 行には横棒の位置が書かれている.横棒には 1 から m までの番号がついている. i + n + 1 行目 (1 ≤ i ≤ m ) には, 横棒 i の位置を表す 2 つの整数 a i , b i (1 ≤ a i ≤ n - 1, 1 ≤ b i ≤ h - 1) が空白区切りで書かれており,横棒 i が縦棒 a i と縦棒 a i + 1 を結び, 横棒 i の上端からの距離が b i であることを表す. ただし,どの 2 つの横棒も端点を共有することはない. 採点用データのうち,配点の 20 % 分は横棒を削除しない場合に J 君の得点が最少となる.また,配点の 30 % 分は n ≤ 20, m ≤ 30, h ≤ 10 を満たし,配点の 60 % 分は m ≤ 1000 を満たす. 入力の終わりは 4つのゼロを含む行で示される. データセットの数は 10 を超えない． 出力 データセットごとに, J 君の得点の最小値を1 行に出力する. 入出力例 入力例 4 5 7 2 20 80 100 50 1 1 2 6 2 3 1 5 3 1 2 2 5 1 10 20 1 1 1 3 0 0 0 0 出力例 100 10 1つ目の例 は図 3-1 に対応し,あなたが横棒 4 (縦棒 1 と縦棒 2 を上端から距離 5 の場所で結ぶ横棒)を削除したとき,J 君の得点は最小になる.例 2 では,あなたが横棒を削除しない場合に J 君の得点が最小になる. (図3-3 を見よ.) 図 3-3 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0540_10848631", "code_snippet": "/* ---------- STL Libraries ---------- */\n// IO library\n#include <cstdio>\n\n#include <fstream>\n#include <iomanip>\n#include <ios>\n#include <iostream>\n\n// algorithm library\n#include <algorithm>\n\n#include <cmath>\n#include <numeric>\n#include <random>\n#include <cstring>\n#include <cassert>\n\n// container library\n#include <array>\n#include <bitset>\n#include <deque>\n#include <map>\n#include <unordered_map>\n#include <queue>\n#include <set>\n#include <string>\n#include <tuple>\n#include <vector>\n#include <stack>\n\n// type\n#include <cstdint>\n\n/* ---------- Namespace ---------- */\nusing namespace std;\n\n/* ---------- Type ---------- */\nusing ll = long long;\n#define int ll\n#define P pair<ll, ll>\n\n/* ---------- Constants */\nconst double PI = 3.141592653589793238462643383279;\nconst ll MOD = 1e9 + 7;\nconst int INF = 1LL << 55;\n\nbool solve() {\n int N, M, H, K;\n cin >> N >> M >> H >> K;\n if (!(N || M || H || K)) return false;\n vector<int> goals(N);\n for (int i = 0; i < N; i++) cin >> goals[i];\n\n vector<P> bars(M); // <height, left>\n for (int i = 0; i < M; i++) {\n int a, b;\n cin >>a >> b;\n bars[i].first = b;\n bars[i].second = a - 1;\n }\n sort(bars.begin(), bars.end());\n\n vector<int> players(N);\n for (int i = 0; i < N; i++) players[i] = i;\n\n vector<P> bar_swaps(M);\n for (int i = 0; i < M; i++) {\n int left = bars[i].second;\n int right = bars[i].second + 1;\n bar_swaps[i].first = players[left];\n bar_swaps[i].second = players[right];\n swap(players[left], players[right]);\n }\n\n vector<int> results(N);\n for (int i = 0; i < N; i++) {\n results[players[i]] = goals[i];\n }\n\n int mn = 1;\n for (int i = 0; i < M; i++) {\n int left = bar_swaps[i].first;\n int right = bar_swaps[i].second;\n if (left > right) swap(left, right);\n if (left < K && right >= K) {\n mn = min(mn, results[right] - results[left]);\n }\n }\n\n int sum = 0;\n for (int i = 0; i < K; i++) sum += results[i];\n if (mn < 0) sum += mn;\n\n cout << sum << endl;\n return true;\n}\n\nsigned main() {\n while (true) {\n bool ret = solve();\n if (!ret) break;\n }\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 6028, "score_of_the_acc": -0.2268, "final_rank": 15 }, { "submission_id": "aoj_0540_9906738", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nint main() {\n int n, m, h, k;\n while (true) {\n cin >> n >> m >> h >> k;\n if (n == 0 && m == 0 && h == 0 && k == 0) {\n break;\n }\n vector<int> c(n), st(n), ans(n);\n vector<pair<int, int>> a(m, {0, 0}), s;\n\n for (int i = 0; i < n; i++) {\n cin >> c[i];\n st[i] = i;\n }\n for (int i = 0; i < m; i++) {\n int x, y;\n cin >> x >> y;\n a[i] = {y, x - 1};\n }\n sort(a.begin(), a.end());\n for (int i = 0; i < m; i++) {\n s.push_back({st[a[i].second], st[a[i].second + 1]});\n swap(st[a[i].second], st[a[i].second + 1]);\n }\n for (int i = 0; i < n; i++) {\n ans[st[i]] = c[i];\n }\n\n int mx = 0;\n for (int i = 0; i < m; i++) {\n int x = min(s[i].first, s[i].second), y = max(s[i].first, s[i].second);\n if (y >= k && x < k) {\n mx = max(mx, ans[x] - ans[y]);\n }\n }\n\n int sm = 0;\n for (int i = 0; i < k; i++) {\n sm += ans[i];\n }\n cout << sm - mx << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 4848, "score_of_the_acc": -0.1518, "final_rank": 11 }, { "submission_id": "aoj_0540_9596147", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nint main(){\n ll N,M,H,K;\n while(cin>>N>>M>>H>>K,N+M!=0){\n vector<ll> S(N);\n for(int i=0;i<N;i++)cin>>S[i];\n vector<pair<ll,ll>> F(M);\n for(int i=0;i<M;i++)cin>>F[i].second>>F[i].first;\n sort(F.begin(),F.end());\n vector<int> P(N);\n for(int i=0;i<N;i++)P[i]=i;\n vector<pair<int,int>> SW(M);\n for(int i=0;i<M;i++){\n int a=F[i].second;\n SW[i]={P[a],P[a-1]};\n swap(P[a],P[a-1]);\n }\n vector<ll> T(N);\n for(int i=0;i<N;i++)T[P[i]]=S[i];\n ll an=0,bn=0;\n for(int i=0;i<K;i++)bn+=T[i];\n an=bn;\n for(int i=0;i<M;i++){\n int u=SW[i].first;\n int v=SW[i].second;\n if(u>v)swap(u,v);\n if(u<K&&v>=K){\n an=min(an,bn-T[u]+T[v]);\n }\n }\n cout<<an<<endl;\n \n}}", "accuracy": 1, "time_ms": 30, "memory_kb": 5324, "score_of_the_acc": -0.182, "final_rank": 12 }, { "submission_id": "aoj_0540_9287134", "code_snippet": "#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint popcnt(i32 x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n\n#line 2 \"cp-library/src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr_rep {\n T i, d;\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\n};\n\ntemplate < class T > struct rep {\n const itr_rep< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr_rep < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n#line 3 \"cp-library/src/utility/io.hpp\"\n\n/* 128bit integer */\nistream& operator>>(istream& is, i128& x) {\n std::string s; is >> s;\n int pm = (s[0] == '-');\n x = 0;\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\n if(pm) x *= -1;\n return is;\n}\nostream& operator<<(ostream& os, const i128& x) {\n if(x == 0) return os << '0';\n i128 y = x;\n if(y < 0) { os << '-'; y *= -1; }\n std::vector<int> ny;\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\n for(int i : revrep(ny.size())) os << ny[i];\n return os;\n}\n\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \" \" << x.second; return os; }\n\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; std::cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator std::vector< T >() {\n std::vector< T > v(n);\n for(T& x : v) std::cin >> x;\n return v;\n }\n };\n struct mat {\n int h, w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator std::vector< std::vector< T > >() {\n std::vector m(h, std::vector< T >(w));\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(0);\n }\n } speedup_instance;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\n void flush() { std::cout.flush(); }\n}\n\ntemplate < class T >\nostream& operator<<(ostream& os, const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\n return os;\n}\n\nint print() { std::cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\n return print(std::forward<tail>(t)...);\n}\ntemplate < class T > int print_n(const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) std::cout << a[i] << \"\\n\";\n return 0;\n}\n\n\n#line 2 \"cp-library/src/utility/key_val.hpp\"\n\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n template < std::size_t Index >\n std::tuple_element_t< Index, key_val >& get() {\n if constexpr (Index == 0) return key;\n if constexpr (Index == 1) return val;\n }\n};\n\nnamespace std {\n\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\n\n}\n#line 2 \"cp-library/src/utility/vec_op.hpp\"\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\n int i = std::max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\n int i = std::min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\n S sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\n vector< S > res(R - L, S(0));\n for(const T x : a) res[x - L] += 1;\n return res;\n}\ntemplate < class S, class T > struct prefix_sum {\n vector< S > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), S(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n S sum(int L, int R) { return s[R] - s[L]; }\n};\n#line 3 \"cp-library/src/utility/heap.hpp\"\n\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\n\n#line 27 \"cp-library/src/cp-template.hpp\"\n\n#line 1 \"cp-library/src/algorithm/bin_search.hpp\"\ntemplate < class T, class F >\nT bin_search(T ok, T ng, F f) {\n while(abs(ng - ok) > 1) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate < class T, class F >\nT bin_search_real(T ok, T ng, F f, int step = 80) {\n while(step--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#line 2 \"cp-library/src/algorithm/argsort.hpp\"\n\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\n std::vector< int > ids((int)a.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\n return a[i] < a[j] || (a[i] == a[j] && i < j);\n });\n return ids;\n}\n#line 1 \"macro.hpp\"\nnamespace macro {\n\nusing size_type = int;\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\ntemplate < class container > void unique(container& a) {\n std::sort(std::begin(a), std::end(a));\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\n}\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\n\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\n\n#ifdef _DEBUG\n#define debug(x) std::cout << \"[\" << __LINE__ << \"] \" << #x << \": \" << x << std::endl\n#else\n#define debug(x)\n#endif\n\ntemplate < class container > void concat(container& a, const container& b) {\n a.insert(std::end(a), std::begin(b), std::end(b));\n}\nstd::vector<size_type> iota(const size_type n) {\n std::vector<size_type> I(n);\n std::iota(std::begin(I), std::end(I), 0);\n return I;\n}\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\n return I;\n}\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\n return std::move(I);\n}\n\nstruct grid {\n using size_type = int;\n size_type H, W;\n grid(const size_type H, const size_type W) : H(H), W(W) {}\n bool contains(const size_type i, const size_type j) {\n return 0 <= i and i < H and 0 <= j and j < W;\n }\n};\n\nusing f64 = long double;\n\ntemplate < class T > vector< T >& operator++(vector< T >& a) { for(T& x : a) x++; return a; }\ntemplate < class T > vector< T >& operator--(vector< T >& a) { for(T& x : a) x--; return a; }\ntemplate < class T > vector< T > operator++(vector< T >& a, signed) { vector< T > res = a; for(T& x : a) x++; return res; }\ntemplate < class T > vector< T > operator--(vector< T >& a, signed) { vector< T > res = a; for(T& x : a) x--; return res; }\n\n} // namespace macro\n\nusing namespace macro;\n#line 3 \"A.cpp\"\n\nint main() {\n while(true) {\n int n = in(), m = in(), h = in(), k = in(); if(n == 0) return 0;\n vector<int> s = in(n);\n\n vector<pair<int,int>> e(m); // height, swap(i, i + 1)\n for(auto &[a, b] : e) {\n a = in(), b = in();\n tie(a, b) = make_pair(b, a - 1);\n }\n sort(e);\n \n vector<pair<int,int>> f;\n vector<int> p = iota(n);\n for(auto [_, i] : e) {\n f.push_back({p[i], p[i + 1]});\n swap(p[i], p[i + 1]);\n }\n\n int sum = [&] {\n int res = 0;\n for(int i : rep(n)) if(p[i] < k) res += s[i];\n return res;\n }();\n\n vector<int> t(n, -1);\n for(int i : rep(n)) t[p[i]] = s[i];\n\n int mi = 0;\n for(auto [i, j] : f) {\n if(i < k and k <= j) chmin(mi, t[j] - t[i]);\n if(j < k and k <= i) chmin(mi, t[i] - t[j]);\n }\n print(sum + mi);\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4880, "score_of_the_acc": -0.0669, "final_rank": 3 }, { "submission_id": "aoj_0540_9280250", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define all(a) a.begin(),a.end()\n#define reps(i, a, n) for (int i = (a); i < (int)(n); i++)\n#define rep(i, n) reps(i, 0, n)\n#define rreps(i, a, n) for (int i = (a); i > (int)(n); i--)\nconst long long mod = 1000000007;\nconst long long INF = 1e18;\n\nll n,m,h,k;\n\nvoid solve() {\n vector<ll> score (n);\n vector<ll> start (n);\n rep(i,n) {\n start[i] = i;\n }\n set<pair<int,int>> change;\n vector<ll> g (n);\n rep(i,n) {\n cin >> g[i];\n }\n \n vector<pair<int,int>> yoko (m);\n rep(i,m) {\n cin >> yoko[i].second >> yoko[i].first;\n }\n sort(all(yoko));\n \n rep(i,m) {\n swap(start[yoko[i].second-1],start[yoko[i].second]);\n change.insert({start[yoko[i].second-1],start[yoko[i].second]});\n }\n vector<ll> ans (n);\n rep(i,n) {\n ans[start[i]] = g[i];\n }\n \n vector<ll> rr (n+1,0);\n rep(i,n) {\n rr[i+1] = rr[i] + ans[i];\n }\n ll mn = INF;\n mn = min(mn,rr[0+k]-rr[0]);\n for (auto w : change) {\n swap(ans[w.first],ans[w.second]);\n rr[0] = 0;\n rep(i,n) {\n rr[i+1] = rr[i] + ans[i];\n }\n mn = min(mn,rr[k]-rr[0]);\n swap(ans[w.first],ans[w.second]);\n }\n cout << mn << endl;\n return;\n}\n\nint main() {\n while (true) {\n cin >> n >> m >> h >> k;\n if (n == 0) {\n return 0;\n }\n solve();\n }\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 5140, "score_of_the_acc": -0.2573, "final_rank": 17 }, { "submission_id": "aoj_0540_9280092", "code_snippet": "// (⁠◕⁠ᴗ⁠◕⁠✿⁠)\n\n#include <bits/stdc++.h>\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n#define srep(i, s, n) for (ll i = s; i < (n); i++)\n#define len(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\nusing namespace std;\ntemplate<typename T> using vc = vector<T>;\ntemplate<typename T> using vv = vc<vc<T>>;\ntemplate<typename T> using vvv = vv<vc<T>>;\nusing vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;\nusing ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;\nusing ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nconst ld pi = acos(-1.0);\nconst int inf = 0x3f3f3f3f;\nconst ll INF = 0x3f3f3f3f3f3f3f3f;\n// const ll mod = 1000000007;\nconst ll mod = 998244353;\ninline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }\n\n#define debug(var) do{std::cout << #var << \" : \\n\";view(var);}while(0)\ntemplate<typename T> void view(T e){cout << e << endl;}\ntemplate<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << \" \"; } cout << endl;}\ntemplate<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } }\n\nll solve(int N, int M, int H, int K){\n vl S(N); rep(i, N) cin >> S[i];\n vc<set<int>> toR(H), toL(H);\n map<pair<int, int>, int> toid;\n rep(i, M){\n int a, b; cin >> a >> b; a--;\n toR[b].insert(a);\n toL[b].insert(a + 1);\n toid[{b, a}] = i;\n }\n vi use(N, 0), goal(N); rep(i, K) use[i] = 1;\n // debug(use);\n vi L(M, -1), R(M, -1);\n rep(i, N){\n int p = i;\n rep(h, H){\n if (toR[h].count(p)){\n R[toid[{h, p}]] = i;\n p++;\n }else if (toL[h].count(p)){\n p--;\n L[toid[{h, p}]] = i;\n }\n }\n goal[i] = p;\n }\n // debug(goal);\n // debug(L);\n // debug(R);\n ll ans = 0, tmp;\n rep(i, N) if (use[i]) ans += S[goal[i]];\n tmp = ans;\n rep(i, M){\n // cout << L[i] << \" \" << R[i] << endl;\n if (use[L[i]] && !use[R[i]]) ans = min(ans, tmp - S[goal[L[i]]] + S[goal[R[i]]]);\n if (!use[L[i]] && use[R[i]]) ans = min(ans, tmp - S[goal[R[i]]] + S[goal[L[i]]]);\n // cout << ans << endl;\n }\n return ans;\n}\n\nint main(){\n vl ans;\n while (true){\n int N, M, H, K; cin >> N >> M >> H >> K;\n if (N == 0) break;\n ans.push_back(solve(N, M, H, K));\n }\n for (auto x : ans) cout << x << endl;\n}", "accuracy": 1, "time_ms": 240, "memory_kb": 19564, "score_of_the_acc": -2, "final_rank": 20 }, { "submission_id": "aoj_0540_8941355", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main() {\n while (1) {\n int n, m, h, k;\n cin >> n >> m >> h >> k;\n if (!n && !m && !h && !k) break;\n vector<int> s(n);\n for (int i = 0; i < n; i++) {\n cin >> s[i];\n }\n vector<pair<int, int>> ab(m);\n for (int i = 0; i < m; i++) {\n int a, b;\n cin >> a >> b;\n a--;\n ab[i] = make_pair(b, a);\n }\n sort(ab.begin(), ab.end());\n vector<int> R(n);//R[下] = 上\n iota(R.begin(), R.end(), 0);\n for (int i = 0; i < m; i++) {\n int a = ab[i].second;\n swap(R[a], R[a + 1]);\n }\n vector<int> P(n);//P[上] = 下\n long long Sum = 0;\n\n for (int i = 0; i < n; i++) {\n if (R[i] < k) {//下の番号に対して，上がk未満の時Sumに加算\n Sum += s[i];\n }\n P[R[i]] = i;\n }\n vector<int> c(n);\n iota(c.begin(), c.end(), 0);//更新しながら見ていくと，c[結んでいる棒の番号] = 上\n long long MIN = 0;\n for (int i = 0; i < m; i++) {\n int a = ab[i].second;\n //P[c[a]]はc[a]が消す棒の左側から上にたどっていったときの棒の番号であるから，棒を消さなかったとき左側から入り，たどり着く下の番号\n //棒を消すとP[c[a]]とP[c[a + 1]]が入れ替わる。\n //c[a]とc[a + 1]のどちらかが[0, k)の時，棒を消すとスコアの和が変化する。\n if (c[a] < k && c[a + 1] >= k) {\n long long tmp = -s[P[c[a]]] + s[P[c[a + 1]]];\n MIN = min(MIN, tmp);\n }\n if (c[a] >= k && c[a + 1] < k) {\n long long tmp = s[P[c[a]]] - s[P[c[a + 1]]];\n MIN = min(MIN, tmp);\n } \n swap(c[a], c[a + 1]);\n }\n long long ans = Sum + MIN;\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3828, "score_of_the_acc": -0.087, "final_rank": 5 }, { "submission_id": "aoj_0540_8309340", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair<int, int> Pi;\nint main(){\n int n, m, h, k, a, b, s[1010], tate[1010], po[1010];\n while(cin >> n >> m >> h >> k, n){\n vector<Pi> vec;\n for(int i=1;i<=n;i++) cin >> s[i];\n for(int i=0;i<m;i++){\n cin >> a >> b;\n vec.push_back(Pi(b, a));\n }\n sort(vec.begin(), vec.end());\n for(int i=1;i<=n;i++) tate[i] = i;\n vector<Pi> pa;\n for(int i=0;i<vec.size();i++){\n pa.push_back(Pi(tate[vec[i].second], tate[vec[i].second+1]));\n swap(tate[vec[i].second], tate[vec[i].second+1]);\n }\n int sum = 0;\n for(int i=1;i<=n;i++){\n po[tate[i]] = s[i];\n if(tate[i]<=k) sum += s[i];\n }\n int ans = sum;\n for(int i=0;i<pa.size();i++){\n if(pa[i].first<=k && pa[i].second>k) ans = min(ans, sum-po[pa[i].first]+po[pa[i].second]);\n if(pa[i].first>k && pa[i].second<=k) ans = min(ans, sum-po[pa[i].second]+po[pa[i].first]);\n }\n cout << ans << endl;\n }\n return(0);\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 5124, "score_of_the_acc": -0.2128, "final_rank": 13 }, { "submission_id": "aoj_0540_7978119", "code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n,m,h,k;\n while (cin >> n >> m >> h >> k, k) {\n vector<int> a(n);\n for (int i = 0; i < n; i++) {\n cin >> a[i];\n }\n vector<pair<int,int>> v;\n for (int i = 0; i < m; i++) {\n int a,b; cin >> a >> b;\n a--;\n v.push_back({b, a});\n }\n sort(v.begin(), v.end());\n vector<int> to(n);\n for (int i = 0; i < n; i++) {\n to[i] = i;\n }\n vector<pair<int,int>> u;\n for (auto p : v) {\n int i = p.second;\n u.push_back({to[i], to[i+1]});\n swap(to[i], to[i+1]);\n }\n vector<int> id(n);\n for (int i = 0; i < n; i++) {\n id[to[i]] = i;\n }\n ll sum = 0;\n for (int i = 0; i < k; i++) {\n sum += a[id[i]];\n }\n ll res = sum;\n for (auto p : u) {\n if ((p.first < k) != (p.second < k)) {\n if (p.first < k) {\n res = min(res, sum-a[id[p.first]]+a[id[p.second]]);\n }\n else {\n swap(p.first, p.second);\n res = min(res, sum-a[id[p.first]]+a[id[p.second]]);\n }\n }\n }\n cout << res << \"\\n\";\n }\n \n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5344, "score_of_the_acc": -0.0963, "final_rank": 8 }, { "submission_id": "aoj_0540_7976285", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vl = vector<ll>;\nusing vvl = vector<vl>;\nusing pl = pair<ll,ll>;\nusing vp = vector<pl>;\n#define rep(i,n) for(ll i=0;i<(ll)(n);++i)\n#define reps(i,s,n) for(ll i=(s);i<(ll)(n);++i)\n#define rep1(i,n) for(ll i=1;i<=(ll)(n);++i)\ntemplate<typename T>inline bool chmax(T &a,T b){return a<b?a=b,true:false;}\ntemplate<typename T>inline bool chmin(T &a,T b){return a>b?a=b,true:false;}\n#define fi first\n#define se second\n#define pb push_back\n#define eb emplace_back\n#define be(v) (v).begin(),(v).end()\nconst long long INF = 1e18;\n#ifdef DEBUG\n#include <debug.hpp>\nrandom_device rd;\nmt19937 gen(rd());\nll random(ll l,ll h){\n\tuniform_int_distribution<ll> dist(l,h);\n\treturn dist(gen);\n}\n#endif\n\nll N,M,H,K;\nvl S;\nvector<vp> A;\n#ifdef DEBUG\nvoid showall(){\n\tshow(N,M,H,K,S);show(A);\n}\n#endif\nbool input(){\n\t#ifdef DEBUG\n\tshow(\"input\");\n\t#endif\n\tcin>>N>>M>>H>>K;\n\tif(N==0)return false;\n\tS.assign(N,0);\n\trep(n,N)cin>>S.at(n);\n\tA.assign(N,vp(0));\n\t//A.assign(N,vp);\n\trep(m,M){\n\t\tll a,b;cin>>a>>b;--a;\n\t\tA.at(a).eb(b,1);\n\t\tA.at(a+1).eb(b,-1);\n\t}\n\trep(n,N){\n\t\tsort(be(A.at(n)));\n\t}\n\t#ifdef DEBUG\n\tshowall();\n\t#endif\n\treturn true;\n}\nvoid logic(){\n#ifdef DEBUG\nshow(\"logic\");\n#endif\n\tvl G(N);\n\tmap<pl,pl> mp;\n\trep(n,N){\n\t\tll h=0,p=n;\n\t\twhile(true){\n\t#ifdef DEBUG\n\t\t\tshow(\"n h p\",n,h,p);\n\t#endif\n\t\t\tauto it = lower_bound(be(A.at(p)),pl(h+1,-INF));\n\t\t\tif(it == A.at(p).end()){\n\t\t\t\tG.at(n) = S.at(p);break;\n\t\t\t}\n\t\t\tpl z; \n\t\t\tif(it->se == -1) z={p-1,it->fi};\n\t\t\telse z={p,it->fi};\n\t\t\tif(mp.count(z)){\n\t\t\t\tif(mp[z].fi > n){\n\t\t\t\t\tmp[z].se = mp[z].fi;\n\t\t\t\t\tmp[z].fi = n;\n\t\t\t\t}else{\n\t\t\t\t\tmp[z].se = n;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse mp[z].fi = n;\n\t\t\th = it->fi;\n\t\t\tp += it->se;\n\t\t}\n\t}\n\t#ifdef DEBUG\n\tshow(\"G\",G);show(\"mp\",mp);\n\t#endif\n\tll mx=0,ans=0;\n\tfor(auto e:mp){\n\t\tll x = e.se.fi, y = e.se.se;\n\t\tif(x < K && y >= K){\n\t\t\tif(G.at(x) > G.at(y)){\n\t\t\t\tchmax(mx, G.at(x) - G.at(y));\n\t\t\t}\n\t\t}\n\t}\n\trep(n,K){\n\t\tans += G.at(n);\n\t}\n\tcout<< ans - mx <<endl;\n}\n#ifdef DEBUG\nll naive(){\n\treturn 1;\n}\n#endif\nint main(){\n\twhile(input())logic();\n\t#ifdef DEBUG\n\t//show(\"naive=\",naive());\n\t#endif\n\t#ifdef DEBUG\n\t/*\n\trep(q,100){\n\t\tN=random(1LL,1000LL);\n\t\tll lans=logic(),nans=naive();\n\t\tshowall();\n\t\tif(lans!=nans){ show(\" WA\",lans,nans); break; }\n\t\telse{ show(\" AC\",lans,nans); }\n\t}\n\t*/\n\t#endif\n\treturn 0;\n}\n//cout << fixed << setprecision(9);", "accuracy": 1, "time_ms": 80, "memory_kb": 15044, "score_of_the_acc": -1.0171, "final_rank": 19 }, { "submission_id": "aoj_0540_6884376", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\nusing pii = pair<int, int>;\n\nint main()\n{\n int n, m, h, k;\n while(cin >> n >> m >> h >> k, n + m + h + k){\n vi<int> score(n);\n map<int, vi<int>> mp;\n rep(i, n) cin >> score[i];\n rep(i, m) {\n int a, b;\n cin >> a >> b;\n a--;\n mp[b].push_back(a);\n }\n \n vi<int> idx(n);\n rep(i, n) idx[i] = i;\n \n set<pii> st;\n for (auto elem : mp) {\n for (int v : elem.second) {\n st.insert({ idx[v], idx[v + 1] });\n swap(idx[v], idx[v + 1]);\n }\n }\n \n vi<int> pos(n);\n rep(i, n) pos[idx[i]] = score[i];\n int acum = 0;\n rep(i, k) acum += pos[i];\n \n int ans = acum;\n for (pii elem : st) {\n if (elem.first < k && elem.second < k) continue;\n if (elem.first >= k && elem.second >= k) continue;\n if (elem.first > elem.second) swap(elem.first, elem.second);\n ans = min(ans, acum + pos[elem.second] - pos[elem.first]);\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 5284, "score_of_the_acc": -0.223, "final_rank": 14 }, { "submission_id": "aoj_0540_6347270", "code_snippet": "//#include <atcoder/all>\n#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long;\nconstexpr lint mod = 1e9 + 7;\n#define all(x) begin(x), end(x)\n#define bitcount(n) __builtin_popcountll((lint)(n))\n#define fcout cout << fixed << setprecision(15)\n#define highest(x) (63 - __builtin_clzll(x))\n#define rep(i, n) for(int i = 0; i < int(n); i++)\n#define rep2(i, l, r) for(int i = int(l); i < int(r); i++)\n#define repr(i, n) for(int i = int(n) - 1; i >= 0; i--)\n#define repr2(i, l, r) for(int i = int(r) - 1; i >= int(l); i--)\nconstexpr int inf9 = 1e9; constexpr lint inf18 = 1e18;\ninline void Yes(bool condition){ if(condition) cout << \"Yes\" << endl; else cout << \"No\" << endl; }\ntemplate<class itr> void array_output(itr start, itr goal){ for(auto i = start; i != goal; i++) cout << (i == start ? \"\" : \" \") << (*i); cout << endl; }\ntemplate<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }\ntemplate<class T> T gcd(T a, T b){ if(b) return gcd(b, a % b); else return a; }\ntemplate<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }\ntemplate<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b){ if(b < a){ a = b; return 1; } return 0; }\ninline int has(lint i, int j){ return (i >> j) & 1; }\nint dy[4] = {1, 0, -1, 0}; int dx[4] = {0, 1, 0, -1};\nbool is_inside(lint y, lint x, lint H, lint W){ return (0 <= y && y < H && 0 <= x && x < W); }\n\nstruct io_init {\n io_init() {\n cin.tie(nullptr); cout.tie(nullptr);\n std::ios::sync_with_stdio(false);\n }\n} io_init;\n\nvoid solve(){\n int n, m, h, k;\n cin >> n >> m >> h >> k;\n if(n == 0) exit(0);\n \n lint s[n];\n rep(i, n) cin >> s[i];\n \n vector<pair<int, int>> bars;\n rep(_, m){\n int a, b;\n cin >> a >> b;\n a--, b--;\n bars.push_back({b, a});\n }\n \n sort(all(bars));\n \n vector<bool> chosen(n, false);\n rep(i, k) chosen[i] = true;\n for(auto [b, a]: bars){\n swap(chosen[a], chosen[a + 1]);\n }\n \n lint score = 0;\n rep(i, n){\n if(chosen[i]) score += s[i];\n }\n \n vector<int> goal(n);\n rep(i, n) goal[i] = i;\n reverse(all(bars));\n lint min_diff = 0;\n for(auto [b, a]: bars){\n if(chosen[goal[a]] != chosen[goal[a + 1]]){\n if(chosen[goal[a]]){\n chmin(min_diff, s[goal[a + 1]] - s[goal[a]]);\n }else{\n chmin(min_diff, s[goal[a]] - s[goal[a + 1]]);\n }\n }\n swap(goal[a], goal[a + 1]);\n }\n \n cout << score + min_diff << endl;\n}\n\nint main(){\n while(true) solve();\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4080, "score_of_the_acc": -0.016, "final_rank": 1 }, { "submission_id": "aoj_0540_6146442", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef pair< int , int > Pi;\n\nint main(){\n int n, m, h, k, s[1000];\n Pi ab[100000], c[100000], d[100000];\n int ans[1000], pos[1000];\n\n while(scanf(\"%d %d %d %d\", &n, &m, &h, &k), n){\n for(int i = 0; i < n; i++){\n scanf(\"%d\", &s[i]);\n ans[i] = i;\n }\n for(int i = 0; i < m; i++){\n scanf(\"%d %d\", &ab[i].second, &ab[i].first);\n }\n sort( ab, ab + m);\n \n int base = 0;\n for(int i = 0; i < m; i++){\n swap(ans[ab[i].second - 1], ans[ab[i].second]);\n d[i] = Pi( ans[ab[i].second - 1], ans[ab[i].second]);\n }\n for(int i = 0; i < n; i++){\n if(ans[i] < k) base += s[i];\n pos[ans[i]] = i;\n }\n\n int ret = base;\n\n for(int i = 0; i < m; i++){\n int res = base;\n \n if(d[i].first < k && d[i].second >= k){\n res -= s[pos[d[i].first]];\n res += s[pos[d[i].second]];\n }\n if(d[i].second < k && d[i].first >= k){\n res += s[pos[d[i].first]];\n res -= s[pos[d[i].second]];\n }\n ret = min( res, ret);\n }\n \n cout << ret << endl;\n } \n}", "accuracy": 1, "time_ms": 20, "memory_kb": 5516, "score_of_the_acc": -0.1507, "final_rank": 10 }, { "submission_id": "aoj_0540_6089697", "code_snippet": "#include <bits/stdc++.h>\n#define all(v) v.begin(), v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)\n#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)\n#define codefor int test;scanf(\"%d\",&test);while(test--)\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define yes(ans) if(ans)printf(\"yes\\n\");else printf(\"no\\n\")\n#define Yes(ans) if(ans)printf(\"Yes\\n\");else printf(\"No\\n\")\n#define YES(ans) if(ans)printf(\"YES\\n\");else printf(\"NO\\n\")\n#define popcount(v) __builtin_popcount(v)\n#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\nusing namespace std;\nusing ll = long long;\ntemplate<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;\nconst int MOD=1000000007;\nconst int MOD2=998244353;\nconst int INF=1<<30;\nconst ll INF2=1LL<<60;\nvoid scan(int& a){scanf(\"%d\",&a);}\nvoid scan(long long& a){scanf(\"%lld\",&a);}\ntemplate<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}\ntemplate<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}\ntemplate<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i);}\ntemplate<class T> void scan(T& a){cin>>a;}\ntemplate<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}\nvoid print(const int& a){printf(\"%d\",a);}\nvoid print(const long long& a){printf(\"%lld\",a);}\nvoid print(const double& a){printf(\"%.15lf\",a);}\ntemplate<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}\ntemplate<class T> void print(const T& a){cout<<a;}\ntemplate<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}\nvoid out(){putchar('\\n');}\ntemplate<class T> void out(const T& t){print(t);putchar('\\n');}\ntemplate <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}\ntemplate<class T> void dprint(const T& a){cerr<<a;}\ntemplate<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<\" \"<<*it;}}\nvoid debug(){cerr<<endl;}\ntemplate<class T> void debug(const T& t){dprint(t);cerr<<endl;}\ntemplate <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<\" \";debug(tail...);}\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\nll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}\nll updivide(ll a,ll b){return (a+b-1)/b;}\ntemplate<class T> void chmax(T &a,const T b){if(b>a)a=b;}\ntemplate<class T> void chmin(T &a,const T b){if(b<a)a=b;}\n\nint main(){\n while(1){\n INT(n,m,h,k);\n if(n==0)return 0;\n vector<ll> sc(n);\n in(sc);\n vector<vector<int>> t(h);\n vector<vector<int>> g(n);\n int u,v;\n rep(i,m){\n in(u,v);\n t[--v].push_back(--u);\n }\n vector<int> pos(n);\n iota(all(pos),0);\n for(auto vec:t){\n for(auto x:vec){\n g[pos[x]].push_back(pos[x+1]);\n g[pos[x+1]].push_back(pos[x]);\n swap(pos[x],pos[x+1]);\n }\n }\n vector<ll> a(n),sumv(n+1,0);\n rep(i,n)a[pos[i]]=sc[i];\n rep(i,n)sumv[i+1]=sumv[i]+a[i];\n ll ans=INF2;\n chmin(ans,sumv[k]-sumv[0]);\n for(int i=0;i<k;i++){\n for(auto x:g[i]){\n if(x<k)continue;\n chmin(ans,sumv[k]-sumv[0]-a[i]+a[x]);\n }\n }\n out(ans);\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5068, "score_of_the_acc": -0.0788, "final_rank": 4 }, { "submission_id": "aoj_0540_5515769", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\nusing lli = long long int;\n\nint main(){\n while(1){\n int n,m,h,k;\n cin >> n >> m >> h >> k;\n if(n == 0) break;\n\n vector<int> a(n);\n for(int i=0; i<n; i++){\n cin >> a[i];\n }\n vector<pair<int,int>> bar(m);\n for(int i=0; i<m; i++){\n cin >> bar[i].second >> bar[i].first;\n bar[i].second--;\n }\n sort(bar.begin(), bar.end());\n vector<int> curr(n);\n for(int i=0; i<n; i++){\n curr[i] = i;\n }\n vector<pair<int,int>> swp(m);\n for(int i=0; i<m; i++){\n swp[i] = {curr[bar[i].second], curr[bar[i].second +1]};\n swap(curr[bar[i].second], curr[bar[i].second +1]);\n }\n vector<int> score(n);\n for(int i=0; i<n; i++){\n score[curr[i]] = a[i];\n }\n int sum = 0;\n for(int i=0; i<k; i++){\n sum += score[i];\n }\n int ans = sum;\n for(int i=0; i<m; i++){\n int a = swp[i].first;\n int b = swp[i].second;\n if(a > b) swap(a, b);\n if(a<k and b>=k){\n ans = min(ans, sum-score[a]+score[b]);\n }\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 4584, "score_of_the_acc": -0.135, "final_rank": 9 }, { "submission_id": "aoj_0540_5484231", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std; typedef long long ll; typedef pair <ll, ll> P;\n\n#define dbg(x) true;\n#define vdbg(x) true;\n#define vvdbg(x) true;\n#define pdbg(x) true;\n#define vpdbg(x) true;\n#define spdbg(x) true;\nint main() {cin.tie(0); ios::sync_with_stdio(false); \n\twhile(true){\n\t\tll n,m,h,k; cin >> n >> m >> h >>k;\n\t\tif (n == 0) break;\n\t\tvector<ll> a(n), aa(n), bb(n), c(n);\n\t\tfor( ll i = 0 ; i < n ; i++ ){\n\t\t\tcin >> a[i];\n\t\t\taa[i] = i;\n\t\t\tbb[i] = i;\n\t\t}\n\t\tvector<P> p(m);\n\t\tvdbg(a);\n\n\t\tfor( ll i = 0 ; i < m ; i++ ){\n\t\t\tcin >> p[i].first >> p[i].second;\n\t\t\tp[i].first --;\n\t\t}\n\t\tsort(p.begin(),p.end(), [&](P a, P b) -> bool { return a.second < b.second;});\n\t\tpdbg(p);\n\t\tfor( ll i = 0 ; i < m ; i++ ){\n\t\t\tswap(aa[p[i].first+1], aa[p[i].first]);\n\t\t}\n\t\tfor( ll i = 0 ; i < n ; i++ ){\n\t\t\tc[aa[i]] = a[i];\n\t\t}\n\t\tvdbg(c);\n\t\tll ans = 0;\n\t\tvector<bool> flag(n,false); \n\n\t\tfor( ll i = 0 ; i < n ; i++ ){\n\t\t\tif(aa[i] < k) {\n\t\t\t\tdbg(a[i]);\n\t\t\t\tans += a[i];\n\t\t\t\tflag[i] = true;\n\t\t\t}\n\t\t}\n\t\tvdbg(aa);\tvdbg(flag);\n\n\t\tll tmp = 0; \n\t\tfor( ll i = 0 ; i < m ; i++ ){\n\t\t\tll x = bb[p[i].first+1], y = bb[p[i].first];\n\t\t\tdbg(x) ; dbg(y);\n\t\t\tif (( x < k) && (k <= y) ){\n\t\t\t\ttmp = min( tmp, c[y]-c[x]);\n\t\t\t\tdbg(c[y]-c[x]);\n\t\t\t}\n\t\t\tif ( (k <= x) && (y < k) ){\n\t\t\t\ttmp = min( tmp, c[x]-c[y]);\n\t\t\t\tdbg(c[x]-c[y]);\n\t\t\t}\n\t\t\tswap(bb[p[i].first+1], bb[p[i].first]);\n\t\t\t\n\t\t}\n\t\tdbg(tmp); dbg(ans);\n\t\tcout << ans +tmp << endl;\n\t}\n\treturn 0;\n}\n\n// 80 100 50 20", "accuracy": 1, "time_ms": 10, "memory_kb": 4320, "score_of_the_acc": -0.0313, "final_rank": 2 }, { "submission_id": "aoj_0540_5201211", "code_snippet": "#include<cstdio>\n#include<algorithm>\nusing namespace std;\ntypedef pair<int,int>P;\nP p[100001];\nint a[1001],y[100001],z[100001],ans[1001]={0};\nint main(void)\n{\n\tint n,m,h,k,i,b,c,j,x,mn,sum=0,sum2;\n\twhile(1){\n\t\tscanf(\"%d%d%d%d\",&n,&m,&h,&k);\n\t\tif(n==0)\tbreak;\n\t\tfor(i=1;i<=n;i++)\tscanf(\"%d\",&a[i]);\n\t\tfor(i=1;i<=m;i++){\n\t\t\tscanf(\"%d%d\",&b,&c);\n\t\t\tp[i].first=c;\tp[i].second=b;\n\t\t}\n\t\tsort(p+1,p+m+1);\n\t\tfor(i=1;i<=n;i++){\n\t\t\tx=i;\n\t\t\tfor(j=1;j<=m;j++){\n\t\t\t\tif(p[j].second==x){\n\t\t\t\t\ty[j]=i;\n\t\t\t\t\tx++;\n\t\t\t\t}\n\t\t\t\telse if(p[j].second==x-1){\n\t\t\t\t\tz[j]=i;\n\t\t\t\t\tx--;\n\t\t\t\t}\n\t\t\t}\n\t\t\tans[i]=a[x];\n\t\t}\n\t\t/*for(i=1;i<=n;i++)\tprintf(\"%d \",ans[i]);\n\t\tprintf(\"\\n\");\n\t\tfor(i=1;i<=m;i++)\tprintf(\"%d %d\\n\",y[i],z[i]);\n\t\tprintf(\"\\n\");*/\n\t\tsum=0;\n\t\tfor(i=1;i<=k;i++)\tsum+=ans[i];\n\t\tmn=sum;\n\t\tfor(i=1;i<=m;i++){\n\t\t\tsum2=sum;\n\t\t\tif(y[i]<=k)\t\tsum2+=ans[z[i]]-ans[y[i]];\n\t\t\tif(z[i]<=k)\t\tsum2+=ans[y[i]]-ans[z[i]];\n\t\t\tmn=min(mn,sum2);\n\t\t}\n\t\tprintf(\"%d\\n\",mn);\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 4268, "score_of_the_acc": -0.2454, "final_rank": 16 }, { "submission_id": "aoj_0540_5124801", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n \n sss:\n int n, m, h, k;\n cin >> n >> m >> h >> k;\n if (n + m + h + k == 0) return 0;\n \n vector<int> score(n);\n for (int i = 0; i < n; i++) cin >> score.at(i);\n \n vector<pair<int, int>> x(m);\n for (int i = 0; i < m; i++) {\n cin >> x.at(i).second >> x.at(i).first;\n x.at(i).first *= -1;\n }\n \n sort(x.begin(), x.end());\n \n vector<int> order(n);\n for (int i = 0; i < n; i++) order.at(i) = i;\n \n vector<pair<int, int>> swap_p(m);\n for (int i = 0; i < m; i++) {\n swap_p.at(i).second = order.at(x.at(i).second);\n swap_p.at(i).first = order.at(x.at(i).second - 1);\n swap(order.at(x.at(i).second), order.at(x.at(i).second - 1));\n }\n \n set<int> st;\n int keep = 0;\n for (int i = 0; i < k; i++) {\n keep += score.at(order.at(i));\n st.insert(order.at(i));\n }\n \n int ans = keep;\n for (int i = 0; i < m; i++) {\n if (st.find(swap_p.at(i).first) == st.end() && st.find(swap_p.at(i).second) != st.end()) {\n ans = min(ans, keep - score.at(swap_p.at(i).second) + score.at(swap_p.at(i).first));\n }\n if (st.find(swap_p.at(i).first) != st.end() && st.find(swap_p.at(i).second) == st.end()) {\n ans = min(ans, keep + score.at(swap_p.at(i).second) - score.at(swap_p.at(i).first));\n }\n }\n \n cout << ans << '\\n';\n goto sss;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4600, "score_of_the_acc": -0.0925, "final_rank": 7 }, { "submission_id": "aoj_0540_4936008", "code_snippet": "#include<bits/stdc++.h>\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#define rep(i, x) for(ll i = 0; i < x; i++)\n#define rep2(i, x) for(ll i = 1; i <= x; i++)\n#define all(a) (a).begin(),(a).end()\nusing ll = long long;\nusing ld = long double;\nusing namespace std;\nconst ll INF = 1000000000;\nconst int intINF = 1000000000;\nconst ll mod = 1000000007;\nconst ll MOD = 998244353;\nconst ld pi = 3.141592653589793238;\n\ntypedef pair <ll, ll> P;\nll dx[4] = { 1, 0, -1, 0 }, dy[4] = { 0, 1, 0, -1 };\n\nll n, m, h, k;//縦棒の本数、横棒の本数、縦の長さ、選ぶ本数\n\nvector<ll> ten(1002);\nvector<P> sa(100002, P(0, 0));\nvector<vector<ll>> aru(100002, vector<ll>(2, 0));\nvector<vector<P>> leng(1002);\nll dfs(ll tate, ll yoko, ll start) {\n\t//cout << tate << ' ' << yoko << endl;\n\t//にぶたん1回目\n\tll ok = -1, ng = leng[yoko].size(), mid = (ok + ng) / 2;\n\twhile (ng - ok > 1) {\n\t\tif (leng[yoko][mid].first > tate) { ng = mid; }\n\t\telse { ok = mid; }\n\t\tmid = (ok + ng) / 2;\n\t}\n\tok++;\n\tll a = leng[yoko][ok].first, b = leng[yoko][ok].second;\n\t//cout << a << ' ' << b << endl;\n\t//にぶたん二回目\n\tok = -1, ng = leng[yoko - 1].size(), mid = (ok + ng) / 2;\n\twhile (ng - ok > 1) {\n\t\tif (leng[yoko - 1][mid].first > tate) { ng = mid; }\n\t\telse { ok = mid; }\n\t\tmid = (ok + ng) / 2;\n\t}\n\tok++;\n\tif (leng[yoko - 1][ok].first < a) {\n\t\ta = leng[yoko - 1][ok].first; b = leng[yoko - 1][ok].second;\n\t\tif (a == h) { return ten[yoko]; }\n\t\tyoko--;\n\t\tif (start <= k) { aru[b][1] = 1; }\n\t\treturn sa[b].second = dfs(a, yoko, start);\n\t}\n\telse {\n\t\tif (a == h) { /*cout << tate << endl;*/ return ten[yoko]; }\n\t\tyoko++;\n\t\tif (start <= k) { aru[b][0] = 1; }\n\t\treturn sa[b].first = dfs(a, yoko, start);\n\t}\n\t//終わり\n}\nsigned main() {\n\tios::sync_with_stdio(false);\n\tstd::cin.tie(nullptr);\n\t//cout << fixed << setprecision(15);\n\n\twhile (true) {\n\t\tcin >> n >> m >> h >> k;\n\t\tif (n == 0 && m == 0) { break; }\n\t\trep2(i, n) { cin >> ten[i]; }\n\t\trep(i, m) {\n\t\t\tll a, b; cin >> a >> b;\n\t\t\tleng[a].push_back(P(b, i));\n\t\t}\n\t\tleng[0].push_back(P(h, 0));\n\t\trep2(i, n) { leng[i].push_back(P(h, 0)); sort(all(leng[i])); }\n\t\tll ans = 0;\n\t\trep2(i, n) {//あみだくじを前から\n\t\t\tll uio = dfs(0, i, i);\n\t\t\tif (i <= k) { ans += uio; }\n\t\t\t//cout << uio << endl;\n\t\t}\n\t\t//削除\n\t\tll cnt = 0;\n\t\trep(i, m) {\n\t\t\tif (aru[i][0] == 1 && aru[i][1] == 1) { continue; }\n\t\t\tif (aru[i][0] == 1) {\n\t\t\t\tcnt = max(cnt, sa[i].first - sa[i].second);\n\t\t\t}\n\t\t\tif (aru[i][1] == 1) {\n\t\t\t\tcnt = max(cnt, sa[i].second - sa[i].first);\n\t\t\t}\n\t\t}\n\t\tcout << ans - cnt << endl;\n\t\trep(i, m) {\n\t\t\trep(j, 2) {\n\t\t\t\taru[i][j] = 0;\n\t\t\t}\n\t\t}\n\t\trep(i, n + 2) { leng[i].clear(); }\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 12032, "score_of_the_acc": -0.6083, "final_rank": 18 }, { "submission_id": "aoj_0540_4819373", "code_snippet": "#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nvector<int> transform(int N, vector<int> arr, vector<int> perm) {\n\tvector<int> res(N);\n\tfor (int i = 0; i < N; ++i) {\n\t\tres[i] = arr[perm[i]];\n\t}\n\treturn res;\n}\nint main() {\n\tcin.tie(0);\n\tios_base::sync_with_stdio(false);\n\twhile (true) {\n\t\tint N, M, H, K;\n\t\tcin >> N >> M >> H >> K;\n\t\tif (N == 0 && M == 0 && H == 0 && K == 0) break;\n\t\tvector<int> S(N), A(M), B(M);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tcin >> S[i];\n\t\t}\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tcin >> A[i] >> B[i]; --A[i];\n\t\t}\n\t\tvector<int> perm(M);\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tperm[i] = i;\n\t\t}\n\t\tsort(perm.begin(), perm.end(), [&](int i, int j) { return B[i] < B[j]; });\n\t\tA = transform(M, A, perm);\n\t\tB = transform(M, B, perm);\n\t\tvector<int> p(N);\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tp[i] = i;\n\t\t}\n\t\tvector<int> lc(M), rc(M);\n\t\tfor (int i = 0; i < M; ++i) {\n\t\t\tlc[i] = p[A[i]];\n\t\t\trc[i] = p[A[i] + 1];\n\t\t\tswap(p[A[i]], p[A[i] + 1]);\n\t\t}\n\t\tint maxdiff = 0;\n\t\tfor (int i = M - 1; i >= 0; --i) {\n\t\t\tswap(S[A[i]], S[A[i] + 1]);\n\t\t\tif (lc[i] < K && rc[i] >= K) {\n\t\t\t\tmaxdiff = max(maxdiff, S[A[i]] - S[A[i] + 1]);\n\t\t\t}\n\t\t\tif (lc[i] >= K && rc[i] < K) {\n\t\t\t\tmaxdiff = max(maxdiff, S[A[i] + 1] - S[A[i]]);\n\t\t\t}\n\t\t}\n\t\tint score = 0;\n\t\tfor (int i = 0; i < K; ++i) {\n\t\t\tscore += S[i];\n\t\t}\n\t\tcout << score - maxdiff << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5240, "score_of_the_acc": -0.0897, "final_rank": 6 } ]
aoj_0538_cpp
IOIOI 問題 整数 n (1 ≤ n ) に対し, n + 1 個の I と n 個の O を I から始めて交互に並べてできる文字列を P n とする.ここで I と O はそれぞれ英大文字のアイとオーである. P 1 IOI P 2 IOIOI P 3 IOIOIOI . . . P n IOIOIO ... OI ( O が n 個) 図 1-1 本問で考える文字列 P n 整数 n と, I と O のみからなる文字列 s が与えられた時, s の中に P n が何ヶ所含まれているかを出力するプログラムを作成せよ. 例 n が 1, s が OOIOIOIOIIOII の場合, P 1 は IOI であり,下図 1-2 に示した 4ヶ所に含まれている.よって,出力は 4 である. OO IOI OIOIIOII OOIO IOI OIIOII OOIOIO IOI IOII OOIOIOIOI IOI I 図 1-2 n が 1, s が OOIOIOIOIIOII の場合の例 n が 2, s が OOIOIOIOIIOII の場合, P 2 は IOIOI であり,下図 1-3 に示した 2ヶ所に含まれている.よって,出力は 2 である. OO IOIOI OIIOII OOIO IOIOI IOII 図 1-3 n が 2, s が OOIOIOIOIIOII の場合の例 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる． 1 行目には整数 n (1 ≤ n ≤ 1000000) が書かれている. 2 行目には整数 m (1 ≤ m ≤ 1000000) が書かれている. m は s の文字数を表す. 3 行目には文字列 s が書かれている. s は I と O のみからなる. 全ての採点用データで, 2 n + 1 ≤ m である.採点用データのうち, 配点の 50% 分については, n ≤ 100, m ≤ 10000 を満たす. n が 0 のとき入力の終了を示す. データセットの数は 10 を超えない． 出力 データセットごとに,文字列 s に文字列 P n が何ヶ所含まれるかを表す 1 つの整数を1 行に出力する. s に P n が含まれていない場合は,整数として 0 を出力せよ. 入出力例 入力例 1 13 OOIOIOIOIIOII 2 13 OOIOIOIOIIOII 0 出力例 4 2 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0538_10864946", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include<utility>\n#include<set>\n#include<deque>\n#include <unordered_map>\n#include<string>\n#include<cmath>\n\nusing namespace std;\n\n\nint main() {\n\twhile (true) {\n\t\tint m, n;\n\t\tcin >> m >> n;\n\t\tif (m == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tstring S;\n\t\tcin >> S;\n\t\tint M = 2 * m + 1;\n\t\tint co = 0;\n\t\tint z = 0;\n\t\tint p = -1;\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < n; i++) {\n\n\t\t\tif (S[i] == 'I' and p == -1) {\n\t\t\t\tco += 1;\n\t\t\t\tif (co >= M) {\n\t\t\t\t\tans += 1;\n\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (S[i] == 'O' and p == 1 and co > 0) {\n\t\t\t\tco += 1;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tco = 0;\n\t\t\t\tp = -1;\n\t\t\t}\n\n\t\t\tif (S[i] == 'I') {\n\t\t\t\tp = 1;\n\t\t\t\tif (co == 0) {\n\t\t\t\t\tco = 1;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse {\n\t\t\t\tp = -1;\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5128, "score_of_the_acc": -0.023, "final_rank": 4 }, { "submission_id": "aoj_0538_6862796", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\nusing pii = pair<int, int>;\n\nint main()\n{\n int n, m;\n string s;\n while (cin >> n, n) {\n cin >> m >> s;\n string t = \"I\";\n rep(i, n) t += \"OI\";\n t += \"#\" + s;\n int lt = t.size();\n vi<int> z(lt);\n int idx = 1, len = 0;\n while (idx < lt) {\n while (t[len] == t[idx + len]) len++;\n if (len == 0) {\n idx++;\n continue;\n }\n z[idx] = len;\n int k = 1;\n while (k + z[k] < len) {\n z[idx + k] = z[k];\n k++;\n }\n idx += k;\n len -= k;\n }\n\n int ans = 0;\n rep(i, lt) if (z[i] == 2 * n + 1) ans++;\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 9204, "score_of_the_acc": -0.0923, "final_rank": 12 }, { "submission_id": "aoj_0538_6347200", "code_snippet": "//#include <atcoder/all>\n#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long;\nconstexpr lint mod = 1e9 + 7;\n#define all(x) begin(x), end(x)\n#define bitcount(n) __builtin_popcountll((lint)(n))\n#define fcout cout << fixed << setprecision(15)\n#define highest(x) (63 - __builtin_clzll(x))\n#define rep(i, n) for(int i = 0; i < int(n); i++)\n#define rep2(i, l, r) for(int i = int(l); i < int(r); i++)\n#define repr(i, n) for(int i = int(n) - 1; i >= 0; i--)\n#define repr2(i, l, r) for(int i = int(r) - 1; i >= int(l); i--)\nconstexpr int inf9 = 1e9; constexpr lint inf18 = 1e18;\ninline void Yes(bool condition){ if(condition) cout << \"Yes\" << endl; else cout << \"No\" << endl; }\ntemplate<class itr> void array_output(itr start, itr goal){ for(auto i = start; i != goal; i++) cout << (i == start ? \"\" : \" \") << (*i); cout << endl; }\ntemplate<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }\ntemplate<class T> T gcd(T a, T b){ if(b) return gcd(b, a % b); else return a; }\ntemplate<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }\ntemplate<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b){ if(b < a){ a = b; return 1; } return 0; }\ninline int has(lint i, int j){ return (i >> j) & 1; }\nint dy[4] = {1, 0, -1, 0}; int dx[4] = {0, 1, 0, -1};\nbool is_inside(lint y, lint x, lint H, lint W){ return (0 <= y && y < H && 0 <= x && x < W); }\n\nstruct io_init {\n io_init() {\n cin.tie(nullptr); cout.tie(nullptr);\n std::ios::sync_with_stdio(false);\n }\n} io_init;\n\nvoid solve(){\n int n, m;\n string s;\n cin >> n;\n if(n == 0) exit(0);\n cin >> m >> s;\n \n vector<int> ioi;\n rep(i, m - 2){\n if(s.substr(i, 3) == \"IOI\"){\n ioi.push_back(i);\n }\n }\n \n int len = 0, ans = 0;\n rep(i, ioi.size()){\n if(i > 0 && ioi[i - 1] + 2 == ioi[i]){\n len++;\n }else{\n len = 1;\n }\n if(len >= n){\n ans++;\n }\n }\n \n cout << ans << endl;\n}\n\nint main(){\n while(true) solve();\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 7144, "score_of_the_acc": -0.0573, "final_rank": 10 }, { "submission_id": "aoj_0538_6131113", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\n//typedef long long ll;\ntypedef int ll;\ntypedef pair<ll, ll> P;\nconst long long INF = 1e9;\ntemplate <typename T>\nvoid input_arr(vector<T>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i];\n\t}\n}\ntemplate <typename T, typename Q>\nvoid input_arr(vector<pair<T, Q>>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i].first >> A[i].second;\n\t}\n}\ntemplate <typename T>\nvoid input_arr(vector<vector<T>>& A, ll H, ll W) {\n\tfor (ll i = 0; i < H; i++) {\n\t\tfor (ll j = 0; j < W; j++) {\n\t\t\tcin >> A[i][j];\n\t\t}\n\t}\n}\nint main() {\n ll N; cin >> N;\n while (N != 0) {\n ll M; cin >> M;\n string S; cin >> S;\n vector<ll>A;\n bool check = false;\n char ch = 'c';\n ll num = 0;\n for (ll i = 0; i < M; i++) {\n if (i == 0) {\n ch = S[i];\n if (ch == 'I') {\n num++;\n check = true;\n }\n continue;\n }\n if (!check) {\n ch = S[i];\n if (S[i] == 'I') {\n check = true;\n num = 1;\n }\n continue;\n }\n if (ch != S[i] && check) {\n num++;\n ch = S[i];\n continue;\n }\n if (ch == S[i] && check) {\n ch = S[i];\n A.push_back(num);\n if (S[i] == 'I') num = 1;\n else {\n check = false;\n num = 0;\n }\n }\n }\n for (ll &i : A) {\n i = (i - 1) / 2;\n }\n ll ans = 0;\n for (ll i : A) {\n ans += max(i - N + 1, 0);\n }\n cout << ans << endl;\n cin >> N;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5060, "score_of_the_acc": -0.0219, "final_rank": 2 }, { "submission_id": "aoj_0538_5793290", "code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<sstream>\n#include<regex>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int Mod=998244353;\nconst int inf=mod*mod;\nconst double eps=1e-9;\nsigned main(){\n\tint n,m;\n\tstring s;\n\twhile(cin>>n,n){\n\t\tcin>>m>>s;\n\t\tint tmp=0,ans=0;\n\t\tfor(int i=0;i<m;i++){\n\t\t\tif(tmp%2==0&&s[i]=='I')\n\t\t\t\ttmp++;\n\t\t\telse if(s[i]=='I')\n\t\t\t\ttmp=1;\n\t\t\telse if(tmp%2==1&&s[i]=='O')\n\t\t\t\ttmp++;\n\t\t\telse\n\t\t\t\ttmp=0;\n\t\t\tif(tmp%2==1&&tmp>=2*n+1)\n\t\t\t\tans++;\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4924, "score_of_the_acc": -0.0196, "final_rank": 1 }, { "submission_id": "aoj_0538_5737757", "code_snippet": "#include<iostream>\n\nusing namespace std;\n\nint main()\n{\n\twhile (true)\n\t{\n\t\tint n;\n\t\tcin >> n;\n\t\tif (n == 0)\n\t\t\tbreak;\n\t\tstring pn = \"IOI\";\n\t\tfor (int i = 1; i < n; i++)\n\t\t\tpn += \"OI\";\n\t\tint m;\n\t\tcin >> m;\n\t\tstring s;\n\t\tcin >> s;\n\t\tint bound = m - pn.size();\n\t\tint ans = 0;\n\t\tfor (int i = 0; i <= bound; i++)\n\t\t\tans += s.substr(i, pn.size()) == pn;\n\t\tcout << ans << endl;\n\t}\n\n\t//system(\"pause\");\n}", "accuracy": 1, "time_ms": 180, "memory_kb": 3948, "score_of_the_acc": -0.8977, "final_rank": 17 }, { "submission_id": "aoj_0538_5473629", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, N) for (int i = 0; i < N; i++)\n\nint main()\n{\n while(1){\n int n, m;\n cin >> n;\n if(n==0) return 0;\n cin >> m;\n string s;\n cin >> s;\n int out = 0;\n int i = 0;\n while (i < m)\n {\n // cout << i << endl;\n if (s[i] == 'I')\n {\n int cnt = 0;\n i++;\n while (1)\n {\n if (s[i] == 'O' && s[i + 1] == 'I')\n {\n cnt++;\n i += 2;\n }\n else\n {\n if (cnt >= n)\n out += cnt - n + 1;\n break;\n }\n }\n }\n else\n i++;\n }\n cout << out << endl;\n }\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3772, "score_of_the_acc": -0.0526, "final_rank": 5 }, { "submission_id": "aoj_0538_5379674", "code_snippet": "#include <bits/stdc++.h>\n \n#define rep(i,n) for(ll i=0;i<n;++i)\n#define rrep(i, n) for(ll i=n-1;i>=0;--i)\n#define rep1(i, n) for(ll i=1; i<=n; ++i)\n#define repitr(itr,mp) for(auto itr=mp.begin();itr!=mp.end();++itr)\n#define ALL(a) (a).begin(),(a).end()\n\ntemplate<class T> void chmax(T &a, const T &b){if(a < b){a = b;}}\ntemplate<class T> void chmin(T &a, const T &b){if(a > b){a = b;}}\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing pll = pair<ll, ll>;\n\nconst ll MOD = 998244353;\nconst ll LINF = 1LL << 60;\nconst int INF = 1e9 + 7;\nconst double PI = 3.1415926535897932384626;\n\nll mod(ll a, ll m){return (a + m) % m;}\n\nint main(){\n ll n;\n while(cin >> n){\n if(!n)break;\n\n ll m;\n string s;\n cin >> m >> s;\n\n string pn = \"\";\n rep(i, 2*n+1){\n if(i%2)pn += \"O\";\n else pn += \"I\";\n }\n\n ll ans = 0;\n string t = \"\";\n rep(i, m){\n if(t.size() >= 2*n + 1)t.erase(t.begin());\n t.push_back(s[i]);\n\n if(t == pn)ans++;\n }\n\n cout << ans << endl;\n }\n}", "accuracy": 1, "time_ms": 160, "memory_kb": 3812, "score_of_the_acc": -0.7902, "final_rank": 16 }, { "submission_id": "aoj_0538_5309003", "code_snippet": "#pragma region Macros\n#include <bits/stdc++.h>\n#define ll long long\n#define ld long double\n#define rep(i, n) for(ll i = 0; i < n; ++i)\n#define drep(i,n) for(ll i = n-1;i >= 0;i--)\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define pb push_back\n#define eb emplace_back\n#define vi vector<int>\n#define vll vector<ll>\n#define vpi vector<pii>\n#define vpll vector<pll>\n#define endl '\\n'\n#define overload2(_1, _2, name, ...) name\n#define vec(type, name, ...) vector<type> name(__VA_ARGS__)\n#define VEC(type, name, size)\\\n vector<type> name(size);\\\n IN(name)\n#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define VV(type, name, h, w)\\\n vector<vector<type>> name(h, vector<type>(w));\\\n IN(name)\n#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...)\\\n vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n#define fi first\n#define se second\n#define all(c) begin(c), end(c)\n#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))\nusing namespace std;\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\n#define si(c) (int)(c).size()\n#define INT(...)\\\n int __VA_ARGS__;\\\n IN(__VA_ARGS__)\n#define LL(...)\\\n ll __VA_ARGS__;\\\n IN(__VA_ARGS__)\n#define STR(...)\\\n string __VA_ARGS__;\\\n IN(__VA_ARGS__)\n#define CHR(...)\\\n char __VA_ARGS__;\\\n IN(__VA_ARGS__)\n#define DBL(...)\\\n double __VA_ARGS__;\\\n IN(__VA_ARGS__)\nint scan() { return getchar(); }\nvoid scan(int &a) { cin >> a; }\nvoid scan(long long &a) { cin >> a; }\nvoid scan(char &a) { cin >> a; }\nvoid scan(double &a) { cin >> a; }\nvoid scan(string &a) { cin >> a; }\ntemplate <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }\ntemplate <class T> void scan(vector<T> &);\ntemplate <class T> void scan(vector<T> &a) {\n for(auto &i : a) scan(i);\n}\ntemplate <class T> void scan(T &a) { cin >> a; }\nvoid IN() {}\ntemplate <class Head, class... Tail> void IN(Head &head, Tail &... tail) {\n scan(head);\n IN(tail...);\n}\ntemplate <class T, class S> inline bool chmax(T &a, S b) {\n if(a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <class T, class S> inline bool chmin(T &a, S b) {\n if(a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\nvi iota(int n) {\n vi a(n);\n iota(all(a), 0);\n return a;\n}\ntemplate <typename T> vi iota(vector<T> &a, bool greater = false) {\n vi res(a.size());\n iota(all(res), 0);\n sort(all(res), [&](int i, int j) {\n if(greater) return a[i] > a[j];\n return a[i] < a[j];\n });\n return res;\n}\n#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())\ntemplate <class T> T POW(T x, int n) {\n T res = 1;\n for(; n; n >>= 1, x *= x)\n if(n & 1) res *= x;\n return res;\n}\nvector<pll> factor(ll x) {\n vector<pll> ans;\n for(ll i = 2; i * i <= x; i++)\n if(x % i == 0) {\n ans.push_back({i, 1});\n while((x /= i) % i == 0) ans.back().second++;\n }\n if(x != 1) ans.push_back({x, 1});\n return ans;\n}\ntemplate <class T> vector<T> divisor(T x) {\n vector<T> ans;\n for(T i = 1; i * i <= x; i++)\n if(x % i == 0) {\n ans.pb(i);\n if(i * i != x) ans.pb(x / i);\n }\n return ans;\n}\ntemplate <typename T> void zip(vector<T> &x) {\n vector<T> y = x;\n sort(all(y));\n for(int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); }\n}\nint popcount(ll x) { return __builtin_popcountll(x); }\nint in() {\n int x;\n cin >> x;\n return x;\n}\nll lin() {\n unsigned long long x;\n cin >> x;\n return x;\n}\n#define i128 __int128_t\n#define ull unsigned long long int\ntemplate <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;\nstruct Setup_io {\n Setup_io() {\n ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(15);\n }\n} setup_io;\ntemplate <typename A, typename B>\nostream& operator <<(ostream& out, const pair<A, B>& a) {\nout << \"(\" << a.first << \",\" << a.second << \")\";\nreturn out;\n}\ntemplate <typename T, size_t N>\nostream& operator <<(ostream& out, const array<T, N>& a) {\nout << \"[\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" : \", \"); out << v; first = 0;} out << \"]\";\nreturn out;\n}\ntemplate <typename T>\nostream& operator <<(ostream& out, const vector<T>& a) {\nout << \"[\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" : \", \"); out << v; first = 0;} out << \"]\";\nreturn out;\n}\ntemplate <typename T, class Cmp>\nostream& operator <<(ostream& out, const set<T, Cmp>& a) {\nout << \"{\"; bool first = true;\nfor (auto& v : a) { out << (first ? \"\" :\", \"); out << v; first = 0;} out << \"}\";\nreturn out;\n}\ntemplate <typename U, typename T, class Cmp>\nostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {\nout << \"{\"; bool first = true;\nfor (auto& p : a) { out << (first ? \"\" : \", \"); out << p.first << \":\" << p.second; first = 0;} out << \"}\";\nreturn out;\n}\n// #define LOCAL\n#ifdef LOCAL\n#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)\n#else\n#define trace(...) 42\n#endif\ntemplate <typename Arg1>\nvoid __f(const char* name, Arg1&& arg1){\ncerr << name << \": \" << arg1 << endl;\n}\ntemplate <typename Arg1, typename... Args>\nvoid __f(const char* names, Arg1&& arg1, Args&&... args){\nconst char* comma = strchr(names + 1, ',');\ncerr.write(names, comma - names) << \": \" << arg1 << \" |\";\n__f(comma + 1, args...);\n}\n#pragma endregion\n//#include<atcoder/all>\n//using namespace atcoder;\nint main(){\n // //dp[i][j]:iまでみて(iつかう),最後がjの時の最大値\n // if(s[i] != j)dp[i][j] = 0;\n // else dp[i][j] = dp[i-1][j^1]+1;\n for(;;){\n INT(m);\n if(!m)return 0;\n INT(n);\n STR(tmp);\n vector<int> s(tmp.size()+1);\n rep(i,n){\n auto c = tmp[i];\n if(c == 'I')s[i] = 1;\n else s[i] = 0;\n }\n vector dp(n+1,vector<int>(2));\n rep(i,n)rep(j,2){\n if(s[i] != j)dp[i][j] = 0;\n else{\n dp[i][j] = 1;\n if(i)dp[i][j] += dp[i-1][j^1];\n }\n }\n // trace(dp);\n int ret = 0;\n rep(i,n){\n if(s[i] == 1){\n // trace(dp[i][1]);\n if(dp[i][1] >= m*2+1)ret++;\n }\n }\n cout << ret << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 62624, "score_of_the_acc": -1.1053, "final_rank": 20 }, { "submission_id": "aoj_0538_5196860", "code_snippet": "#include <bits/stdc++.h>\n#define all(v) v.begin(), v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)\n#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)\n#define codefor int test;scanf(\"%d\",&test);while(test--)\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define yes(ans) if(ans)printf(\"yes\\n\");else printf(\"no\\n\")\n#define Yes(ans) if(ans)printf(\"Yes\\n\");else printf(\"No\\n\")\n#define YES(ans) if(ans)printf(\"YES\\n\");else printf(\"NO\\n\")\n#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\n#define umap unordered_map\n#define uset unordered_set\nusing namespace std;\nusing ll = long long;\nconst int MOD=1000000007;\nconst int MOD2=998244353;\nconst int INF=1<<30;\nconst ll INF2=(ll)1<<60;\n//入力系\nvoid scan(int& a){scanf(\"%d\",&a);}\nvoid scan(long long& a){scanf(\"%lld\",&a);}\ntemplate<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}\ntemplate<class T> void scan(T& a){cin>>a;}\ntemplate<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}\n//出力系\nvoid print(const int& a){printf(\"%d\",a);}\nvoid print(const long long& a){printf(\"%lld\",a);}\nvoid print(const double& a){printf(\"%.15lf\",a);}\ntemplate<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}\ntemplate<class T> void print(const T& a){cout<<a;}\ntemplate<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}\nvoid out(){putchar('\\n');}\ntemplate<class T> void out(const T& t){print(t);putchar('\\n');}\ntemplate <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}\n//デバッグ系\ntemplate<class T> void dprint(const T& a){cerr<<a;}\ntemplate<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<\" \"<<*it;}}\nvoid debug(){cerr<<endl;}\ntemplate<class T> void debug(const T& t){dprint(t);cerr<<endl;}\ntemplate <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<\" \";debug(tail...);}\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\nll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}\nll updivide(ll a,ll b){if(a%b==0) return a/b;else return (a/b)+1;}\ntemplate<class T> void chmax(T &a,const T b){if(b>a)a=b;}\ntemplate<class T> void chmin(T &a,const T b){if(b<a)a=b;}\n\nint rec(int i,string &s,vector<int> &memo){\n if(memo[i]!=-1)return memo[i];\n if(i+1<s.size()&&s[i+1]!=s[i])return memo[i]=rec(i+1,s,memo)+1;\n return memo[i]=1;\n}\n\nint main(){\n while(1){\n INT(n);\n if(n==0)return 0;\n INT(m);\n string s;\n cin>>s;\n vector<int> memo(m,-1);\n int ans=0;\n rep(i,m){\n if(s[i]=='I')ans+=(rec(i,s,memo)>=2*n+1);\n }\n out(ans);\n }\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 9380, "score_of_the_acc": -0.1479, "final_rank": 14 }, { "submission_id": "aoj_0538_5131021", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n while(1){\n int n;\n cin >> n;\n if(n == 0) break;\n\n int len;\n string s;\n cin >> len >> s;\n s += \"XX\";\n vector<int> a;\n for(int i=0; i<len; i++){\n if(s[i] == 'I'){\n int count = 0;\n while(s[i+1]=='O' and s[i+2]=='I'){\n count++;\n i += 2;\n }\n a.push_back(count);\n }\n }\n int ans = 0;\n for(int i: a){\n ans += max(0, i-n+1);\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5080, "score_of_the_acc": -0.0222, "final_rank": 3 }, { "submission_id": "aoj_0538_4677108", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint N, M;\n\nint main() {\n\tint curPos, cnt;\n\tstring allType, target, str;\n\n\tallType = \"I\";\n\tfor (int i = 1; i <= 1000000; ++i) {\n\t\tallType += \"OI\";\n\t}\n\n\twhile (cin >> N, N) {\n\t\tcin >> M >> str;\n\t\ttarget = allType.substr(0, 1 + 2 * N);\n\t\tcnt = 0;\n\t\tcurPos = str.find(target);\n\t\twhile (curPos != string::npos) {\n\t\t\t++cnt;\n\t\t\tcurPos = str.find(target, curPos + 1);\n\t\t}\n\t\tcout << cnt << endl;\n\t}\n\t\n\treturn 0;\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 6816, "score_of_the_acc": -0.3149, "final_rank": 15 }, { "submission_id": "aoj_0538_4260007", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n// using ll = long long;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n\nint main() {\n while (cin) {\n int n;\n cin >> n;\n if (n == 0) break;\n\n int m;\n string s;\n cin >> m >> s;\n\n int i = 0;\n int ans = 0;\n while (i < m) {\n if (s[i] == 'I') {\n int j = i;\n for (; j < m; j++) {\n if ((j - i) & 1) {\n if (s[j] == 'O')\n continue;\n else\n break;\n } else {\n if (s[j] == 'I')\n continue;\n else\n break;\n }\n }\n int count = j - i;\n if(count & 1){\n count /= 2;\n } else {\n count--;\n count /= 2;\n }\n ans += max(0, count - n + 1);\n // cout << j << \" \" << max(0, count - n + 1) << endl;\n i = j;\n i--;\n }\n i++;\n }\n cout << ans << endl;\n }\n}\n\n/*\n1\n50\nIOOIOOOIIOIIIIIIIOOIOIOIOOOIIIOIIIOIIIOOOOOIIIOIIO\n\n6\n*/", "accuracy": 1, "time_ms": 20, "memory_kb": 3908, "score_of_the_acc": -0.0549, "final_rank": 8 }, { "submission_id": "aoj_0538_4253607", "code_snippet": "#include <bits/stdc++.h>\n//typedef\n//-------------------------#include <bits/stdc++.h>\n \nconst double pi = 3.141592653589793238462643383279;\n \n \nusing namespace std;\n \n//conversion\n//------------------------------------------\ninline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }\ntemplate<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }\ninline int readInt() { int x; scanf(\"%d\", &x); return x; }\n \n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n \n \n//container util\n \n//------------------------------------------\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SQ(a) ((a)*(a))\n#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define SORT(c) sort((c).begin(),(c).end())\n \n \n//repetition\n//------------------------------------------\n#define FOR(i,s,n) for(int i=s;i<(int)n;++i)\n#define REP(i,n) FOR(i,0,n)\n#define MOD 1000000007\n \n#define rep(i, a, b) for(int i = a; i < (b); ++i)\n#define trav(a, x) for(auto& a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n \ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\nconst double EPS = 1E-8;\n \n#define chmin(x,y) x=min(x,y)\n#define chmax(x,y) x=max(x,y)\n \nclass UnionFind {\npublic:\n vector <int> par; \n vector <int> siz; \n\n UnionFind(int sz_): par(sz_), siz(sz_, 1) {\n for (ll i = 0; i < sz_; ++i) par[i] = i;\n }\n void init(int sz_) {\n par.resize(sz_);\n siz.assign(sz_, 1LL);\n for (ll i = 0; i < sz_; ++i) par[i] = i;\n }\n \n int root(int x) { \n while (par[x] != x) {\n x = par[x] = par[par[x]];\n }\n return x;\n }\n \n bool merge(int x, int y) {\n x = root(x);\n y = root(y);\n if (x == y) return false;\n if (siz[x] < siz[y]) swap(x, y);\n siz[x] += siz[y];\n par[y] = x;\n return true;\n }\n \n bool issame(int x, int y) { \n return root(x) == root(y);\n }\n \n int size(int x) { \n return siz[root(x)];\n }\n};\n \n \nll modPow(ll x, ll n, ll mod = MOD){\n if(n <= 0) return 1;\n ll res = 1;\n while(n){\n if(n&1) res = (res * x)%mod;\n \n res %= mod;\n x = x * x %mod;\n n >>= 1;\n }\n return res;\n}\n \n#define SIEVE_SIZE 5000000+10\nbool sieve[SIEVE_SIZE];\nvoid makeSieve(){\n for(int i=0; i<SIEVE_SIZE; ++i) sieve[i] = true;\n sieve[0] = sieve[1] = false;\n for(int i=2; i*i<SIEVE_SIZE; ++i) if(sieve[i]) for(int j=2; i*j<SIEVE_SIZE; ++j) sieve[i*j] = false;\n}\n \nbool isprime(ll n){\n if(n == 0 || n == 1) return false;\n for(ll i=2; i*i<=n; ++i) if(n%i==0) return false;\n return true;\n}\n \nconst int MAX = 2000010;\nlong long fac[MAX], finv[MAX], inv[MAX];\n \n// テーブルを作る前処理\nvoid COMinit() {\n fac[0] = fac[1] = 1;\n finv[0] = finv[1] = 1;\n inv[1] = 1;\n for (int i = 2; i < MAX; i++){\n fac[i] = fac[i - 1] * i % MOD;\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n finv[i] = finv[i - 1] * inv[i] % MOD;\n }\n}\n \n// 二項係数計算\nlong long COM(int n, int k){\n if (n < k) return 0;\n if (n < 0 || k < 0) return 0;\n return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;\n}\n \nlong long extGCD(long long a, long long b, long long &x, long long &y) {\n if (b == 0) {\n x = 1;\n y = 0;\n return a;\n }\n long long d = extGCD(b, a%b, y, x);\n y -= a/b * x;\n return d;\n}\n// 負の数にも対応した mod (a = -11 とかでも OK) \ninline long long mod(long long a, long long m) {\n return (a % m + m) % m;\n}\n \n// 逆元計算 (ここでは a と m が互いに素であることが必要)\nlong long modinv(long long a, long long m) {\n long long x, y;\n extGCD(a, m, x, y);\n return mod(x, m); // 気持ち的には x % m だが、x が負かもしれないので\n}\nll GCD(ll a, ll b){\n \n if(b == 0) return a;\n return GCD(b, a%b);\n}\n\ntemplate< unsigned mod >\nstruct RollingHash {\n vector< unsigned > hashed, power;\n\n inline unsigned mul(unsigned a, unsigned b) const {\n unsigned long long x = (unsigned long long) a * b;\n unsigned xh = (unsigned) (x >> 32), xl = (unsigned) x, d, m;\n asm(\"divl %4; \\n\\t\" : \"=a\" (d), \"=d\" (m) : \"d\" (xh), \"a\" (xl), \"r\" (mod));\n return m;\n }\n\n RollingHash(const string &s, unsigned base = 10007) {\n int sz = (int) s.size();\n hashed.assign(sz + 1, 0);\n power.assign(sz + 1, 0);\n power[0] = 1;\n for(int i = 0; i < sz; i++) {\n power[i + 1] = mul(power[i], base);\n hashed[i + 1] = mul(hashed[i], base) + s[i];\n if(hashed[i + 1] >= mod) hashed[i + 1] -= mod;\n }\n }\n\n unsigned get(int l, int r) const {\n unsigned ret = hashed[r] + mod - mul(hashed[l], power[r - l]);\n if(ret >= mod) ret -= mod;\n return ret;\n }\n\n unsigned connect(unsigned h1, int h2, int h2len) const {\n unsigned ret = mul(h1, power[h2len]) + h2;\n if(ret >= mod) ret -= mod;\n return ret;\n }\n\n int LCP(const RollingHash< mod > &b, int l1, int r1, int l2, int r2) {\n int len = min(r1 - l1, r2 - l2);\n int low = -1, high = len + 1;\n while(high - low > 1) {\n int mid = (low + high) / 2;\n if(get(l1, l1 + mid) == b.get(l2, l2 + mid)) low = mid;\n else high = mid;\n }\n return (low);\n }\n};\n\nusing RH = RollingHash< 1000000007 >;\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n //cout << fixed << setprecision(15);\n\n int n, m; \n while(cin >> n, n){\n cin >> m;\n string s; cin >> s;\n RH rh(s);\n\n int ans = 0;\n string t=\"\";\n for(int i=0; i<n; i++){\n t += \"IO\";\n }\n t += \"I\";\n\n RH rh2(t);\n\n for(int i=0; i+t.size()<=s.size(); i++){\n if(rh.get(i, i+t.size()) == rh2.get(0, t.size())) ans++;\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 11824, "score_of_the_acc": -0.1368, "final_rank": 13 }, { "submission_id": "aoj_0538_3952860", "code_snippet": "#include<iostream>\n#include<string>\n#include<algorithm>\t\n#include<cmath>\nusing namespace std;\nint main() {\n\tfor (int h = 0; h < 10; h++) {\n\t\tlong long n, m, a = 0, sum = 0, ans = 0; string s; cin >> n;\n\t\tif(n==0){\n\t\t return 0;\n\t\t}\n\t\tcin>>m>>s;\n\t\tint test[123456] = { 0 };\n\t\tfor (int h = 0; h < m - 2; h++) {\n\t\t\tif (s[h] == 'I' && s[h + 1] == 'O' && s[h + 2] == 'I') {\n\t\t\t\tsum++; h += 1;\n\t\t\t}\n\t\t\telse if (sum != 0) {\n\t\t\t\ttest[a] = sum;\n\t\t\t\ta++; sum = 0;\n\t\t\t}\n\t\t}\n\t\ttest[a] = sum;\n\t\ta++;\n\n\t\tfor (int h = 0; h < a; h++) {\n\t\t\tif (test[h] >= n) {\n\t\t\t\tans += test[h] - n + 1;\n\t\t\t}\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4468, "score_of_the_acc": -0.0645, "final_rank": 11 }, { "submission_id": "aoj_0538_3519159", "code_snippet": "#include <iostream>\n#include <string>\nusing namespace std;\n\nint main(){\n int ans = 0;\n int n;\n cin >> n;\n while(n != 0){\n int m;\n cin >> m;\n string s;\n cin >> s;\n string see = \"I\";\n for(int i = 0; i < n; i++){\n string temp = \"OI\";\n\n see = see+temp;\n }\n int ans = 0;\n string sn = s.substr( 0 , n*2);\n for(int i = 0; i < m - n*2 ; i ++){\n sn = s.substr(i , n*2+1);\n if(sn == see)ans++;\n }\n \n cout << ans << endl;\n cin >> n;\n }\n\n\n \n}", "accuracy": 1, "time_ms": 200, "memory_kb": 3924, "score_of_the_acc": -1.0026, "final_rank": 19 }, { "submission_id": "aoj_0538_3396149", "code_snippet": "#include<iostream>\n#include<string>\nusing namespace std;\n\nint main()\n{\n int n, m;\n string s, t, u;\n\n while( cin >> n )\n {\n s = \"I\";\n u = \"\";\n if( !n )\n break;\n\n for( int i = 0; i < n; i++ )\n s += \"OI\";\n\n cin >> m;\n\n cin >> t;\n \n int cnt = 0, i = 0;\n while( i < m )\n {\n u = t.substr( i, s.size() );\n if( s == u )\n cnt++;\n i++;\n }\n cout << cnt << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 190, "memory_kb": 3820, "score_of_the_acc": -0.9482, "final_rank": 18 }, { "submission_id": "aoj_0538_3394000", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef pair<P,P> PP;\nconst ll MOD = 1000000007;\nconst int IINF = INT_MAX;\nconst ll LLINF = LLONG_MAX;\nconst int MAX_N = int(2e5 + 5);\nconst double EPS = 1e-10;\nconst int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};\n#define REP(i, n) for (int i = 0; i < n; i++)\n#define REPR(i, n) for (int i = n; i >= 0; i--)\n#define SORT(v) sort((v).begin(), (v).end())\n#define ALL(v) (v).begin(), (v).end()\n\n\nint main() {\n int n;\n while(cin >> n, n){\n int m, cnt = 0, len = 0;\n string s;\n cin >> m >> s;\n s.push_back('#');\n REP(i,m+1){\n if(len%2==0 && s[i]=='I'){\n len++;\n }\n else if(len%2==1 && s[i]=='O'){\n len++;\n }\n else if(len > 0){\n cnt += max(0, (len-1)/2 - n + 1);\n len = 0;\n if(s[i]=='I')len++;\n }\n }\n cout << cnt << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3912, "score_of_the_acc": -0.055, "final_rank": 9 }, { "submission_id": "aoj_0538_3367399", "code_snippet": "#include<iostream>\n#include<string>\n#include<algorithm>\n#include<math.h>\n#include<queue>\n#include<set>\n#include<map>\n\nusing namespace std;\n\n\nint N, M;\nstring s;\n\nint main() {\n\n\twhile (cin >> N, N)\n\t{\n\t\tcin >> M >> s;\n\n\t\tint ren = 0;\n\t\tbool frag = false;\n\t\tint ans = 0;\n\t\tvector<int> a;\n\t\tint k = 0;\n\t\ta.push_back(0);\n\n\t\tfor (int i = 0; i < M; i++) {\n\n\t\t\tif (frag) {\n\t\t\t\tif (s[i] == 'O' && s[i + 1] == 'I') {\n\t\t\t\t\tren++;\n\n\t\t\t\t\ta[k] = max(a[k], ren - N + 1);\n\n\t\t\t\t\ti++;\n\t\t\t\t}\n\t\t\t\telse {\n\n\t\t\t\t\tk++;\n\t\t\t\t\ta.push_back(0);\n\t\t\t\t\tren = 0;\n\t\t\t\t\tfrag = false;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif (s[i] == 'I') {\n\t\t\t\tfrag = true;\n\t\t\t}\n\n\t\t\t\n\t\t}\n\n\t\tfor (int i = 0; i < k; i++) {\n\t\t\tans += a[i];\n\t\t}\n\n\n\t\tcout << ans << endl;\n\n\t}\n\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3856, "score_of_the_acc": -0.0541, "final_rank": 7 }, { "submission_id": "aoj_0538_3340812", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(void){\n\tint n;\n\tint m;\n\tstring s;\n\tint i;\n\tint cnt;\n\tvector<int>v;\n\tint flg;\n\tint sum;\n\tint x;\n\twhile(1){\n\t\tcin>>n;\n\t\tif(n==0)\tbreak;\n\t\tcin>>m;\n\t\tcin>>s;\n\t\tv.clear();\n\t\ti=0;\n\t\tcnt=0;\n\t\twhile(s.size()-1>i){\n\t\t\tflg=0;\n\t\t\tif(s[i]=='I'){\n\t\t\t\tif(s[i+1]=='O'){\n\t\t\t\t\tif(s[i+2]=='I'){\n\t\t\t\t\t\tcnt++;\n\t\t\t\t\t\tflg=1;\n\t\t\t\t\t\ti+=2;\n\t\t\t\t\t}\n\t\t\t\t} \n\t\t\t}\n\t\t\tif(flg==0){\n\t\t\t\tif(cnt!=0){\n\t\t\t\t\tv.push_back(cnt);\n\t\t\t\t}\n\t\t\t\tcnt=0;\n\t\t\t\ti++;\n\t\t\t}\n\t\t}\n\t\t/* for(i=0;i<v.size();i++){\n\t\t\tcout<<v[i]<<endl;\n\t\t} */\n\t\tsum=0;\n\t\tfor(i=0;i<v.size();i++){\n\t\t\tif(v[i]+1-n>=0){\n\t\t\t\tsum+=v[i]+1-n;\n\t\t\t}\n\t\t}\n\t\tcout<<sum<<endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3840, "score_of_the_acc": -0.0538, "final_rank": 6 } ]
aoj_0545_cpp
パーティー 問題 あなたはクリスマスパーティーに学校内の自分の友達と，自分の友達の友達を招待することにした． あなたの通う学校の生徒数は n 人であり，それぞれの生徒には 1 から n までの番号が割り振られている． あなたの番号は 1 である． あなたの手元には，誰と誰が友達であるかを記したリストがある． このリストをもとに， あなたがクリスマスパーティーに招待する生徒数を求めるプログラムを作成せよ． 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる． データセットの1 行目には学校の生徒数 n （2 ≤ n ≤ 500）が， 2 行目にはリストの長さ m （1 ≤ m ≤ 10000）が書かれている． 入力は全部で 2+m 行からなる．2+i 行目（1 ≤ i ≤ m）には 2 つの整数 a i と b i （1 ≤ a i < b i ≤ n）が空白区切りで書かれており，番号 a i と番号 b i の生徒が友達同士であることを表す． 3 行目から 2+m 行目には同じ友達関係を表す行が重複して現れることはない． n, m がともに 0 のとき入力の終了を示す.データセットの数は 5 を超えない． 出力 データセットごとに，あなたがクリスマスパーティーに招待する生徒数を1 行に出力する． 入出力例 入力例 6 5 1 2 1 3 3 4 2 3 4 5 6 5 2 3 3 4 4 5 5 6 2 5 0 0 出力例 3 0 1つ目の入力例 において，あなたの友達は番号 2 と番号 3 の生徒の 2 人である． また，番号 3 と番号 4 の生徒は友達同士であるので， 番号 4 の生徒はあなたの友達の友達である． 番号 5 と番号 6 の生徒はあなたの友達でもなく，あなたの友達の友達でもない． したがって，あなたは番号 2,3,4 の 3 人の生徒をクリスマスパーティーに招待する． 2つ目の入力例 において，あなたには友達はいない． したがって，あなたがクリスマスパーティーに招待する生徒数は 0 人である． 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0545_3395409", "code_snippet": "#include <bits/stdc++.h>\n\n// #include <boost/multiprecision/cpp_int.hpp>\n #define int long long\n #define inf 1000000007\n #define pa pair<int,int>\n #define ll long long\n #define pal pair<double,double>\n #define ppap pair<pa,int>\n// #define PI 3.14159265358979323846\n #define paa pair<int,char>\n #define mp make_pair\n #define pb push_back\n #define EPS (1e-10)\n \n int dx[8]={0,-1,0,1,1,1,-1,-1};\n int dy[8]={1,0,-1,0,-1,1,1,-1};\n using namespace std;\n \t\t\tclass pa3{\n \tpublic:\n \tint x,y,z;\n \tpa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}\n \tbool operator < (const pa3 &p) const{\n \t\tif(x!=p.x) return x<p.x;\n \t\tif(y!=p.y) return y<p.y;\n \t\t return z<p.z;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \t\t\t\tbool operator > (const pa3 &p) const{\n \t\tif(x!=p.x) return x>p.x;\n \t\tif(y!=p.y) return y>p.y;\n \t\t return z>p.z;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const pa3 &p) const{\n \t\treturn x==p.x && y==p.y && z==p.z;\n \t}\n \t\tbool operator != (const pa3 &p) const{\n \t\t\treturn !( x==p.x && y==p.y && z==p.z);\n \t}\n \n };\n \n class pa4{\n \tpublic:\n \tdouble x;\n \tint y,z,w;\n \tpa4(double x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}\n \tbool operator < (const pa4 &p) const{\n \t\tif(x!=p.x) return x<p.x;\n \t\tif(y!=p.y) return y<p.y;\n \t\tif(z!=p.z)return z<p.z;\n \t\treturn w<p.w;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator > (const pa4 &p) const{\n \t\tif(x!=p.x) return x>p.x;\n \t\tif(y!=p.y) return y>p.y;\n \t\tif(z!=p.z)return z>p.z;\n \t\treturn w>p.w;\n \t\t//return x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const pa4 &p) const{\n \t\treturn x==p.x && y==p.y && z==p.z &&w==p.w;\n \t}\n \t\t\n \n };\n class pa2{\n \tpublic:\n \tint x,y;\n \tpa2(int x=0,int y=0):x(x),y(y) {}\n \tpa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}\n \tpa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}\n \tbool operator < (const pa2 &p) const{\n \t\treturn y != p.y ? y<p.y: x<p.x;\n \t}\n \tbool operator > (const pa2 &p) const{\n \t\treturn x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const pa2 &p) const{\n \t\treturn abs(x-p.x)==0 && abs(y-p.y)==0;\n \t}\n \tbool operator != (const pa2 &p) const{\n \t\treturn !(abs(x-p.x)==0 && abs(y-p.y)==0);\n \t}\n \t\t\n \n };\n \n/*\n class Point{\n \tpublic:\n \tdouble x,y;\n \tPoint(double x=0,double y=0):x(x),y(y) {}\n \tPoint operator + (Point p) {return Point(x+p.x,y+p.y);}\n \tPoint operator - (Point p) {return Point(x-p.x,y-p.y);}\n \tPoint operator * (double a) {return Point(x*a,y*a);}\n \tPoint operator / (double a) {return Point(x/a,y/a);}\n \tdouble absv() {return sqrt(norm());}\n \tdouble norm() {return x*x+y*y;}\n \tbool operator < (const Point &p) const{\n \t\treturn x != p.x ? x<p.x: y<p.y;\n \t}\n \tbool operator == (const Point &p) const{\n \t\treturn fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;\n \t}\n };\n typedef Point Vector;\n #define pl pair<int,pas>\n struct Segment{\n Point p1,p2;\n };\n double dot(Vector a,Vector b){\n \treturn a.x*b.x+a.y*b.y;\n }\n double cross(Vector a,Vector b){\n \treturn a.x*b.y-a.y*b.x;\n }\n \n bool parareru(Point a,Point b,Point c,Point d){\n //\tif(abs(cross(a-b,d-c))<EPS)cout<<\"dd \"<<cross(a-b,d-c)<<endl;\n \treturn abs(cross(a-b,d-c))<EPS;\n }\n double distance_ls_p(Point a, Point b, Point c) {\n if ( dot(b-a, c-a) < EPS ) return (c-a).absv();\n if ( dot(a-b, c-b) < EPS ) return (c-b).absv();\n return abs(cross(b-a, c-a)) / (b-a).absv();\n }\n bool is_intersected_ls(Segment a,Segment b) {\n \tif(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;\n \tif(parareru((a.p2),(a.p1),(a.p1),(b.p2))&&parareru((a.p2),(a.p1),(a.p1),(b.p1))){\n //\t\tcout<<\"sss\"<<endl;\n \t\tif(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;\n \t\tif(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;\n \t\tif(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;\n \t\tif(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;\n \t\treturn false;\n \t}\n else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );\n }\n \n double segment_dis(Segment a,Segment b){\n \tif(is_intersected_ls(a,b))return 0;\n \tdouble r=distance_ls_p(a.p1, a.p2, b.p1);\n \tr=min(r,distance_ls_p(a.p1, a.p2, b.p2));\n \tr=min(r,distance_ls_p(b.p1, b.p2, a.p2));\n \tr=min(r,distance_ls_p(b.p1, b.p2, a.p1));\n \treturn r;\n }\n Point intersection_ls(Segment a, Segment b) {\n Point ba = b.p2-b.p1;\n double d1 = abs(cross(ba, a.p1-b.p1));\n double d2 = abs(cross(ba, a.p2-b.p1));\n double t = d1 / (d1 + d2);\n \n return a.p1 + (a.p2-a.p1) * t;\n }\n */ \n string itos( int i ) {\n ostringstream s ;\n s << i ;\n return s.str() ;\n }\n \n int gcd(int v,int b){\n \tif(v>b) return gcd(b,v);\n \tif(v==b) return b;\n \tif(b%v==0) return v;\n \treturn gcd(v,b%v);\n }\n \n double distans(double x1,double y1,double x2,double y2){\n \tdouble rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);\n \treturn sqrt(rr);\n \t\n }\n int mod;\n \n int pr[500010];\n int inv[500010];\n \n int beki(int wa,int rr,int warukazu){\n \tif(rr==0) return 1%warukazu;\n \tif(rr==1) return wa%warukazu;\n \tif(rr%2==1) return (beki(wa,rr-1,warukazu)*wa)%warukazu;\n \tint zx=beki(wa,rr/2,warukazu);\n \treturn (zx*zx)%warukazu;\n }\n double bekid(double w,int r){\n \tif(r==0) return 1.0;\n \tif(r==1) return w;\n \tif(r%2) return bekid(w,r-1)*w;\n \tdouble f=bekid(w,r/2);\n \treturn f*f;\n }\n \n \t\t\tint comb(int nn,int rr){\n \t\t\t\tint r=pr[nn]*inv[rr];\n \t\t\t\tr%=mod;\n \t\t\t\tr*=inv[nn-rr];\n \t\t\t\tr%=mod;\n \t\t\t\treturn r;\n \t\t\t}\n \n void gya(int ert){\n \tpr[0]=1;\n \tfor(int i=1;i<ert;i++){\n \t\tpr[i]=(pr[i-1]*i)%mod;\n \t}\n \tfor(int i=0;i<ert;i++) inv[i]=beki(pr[i],mod-2,mod);\n \t\n }\n \n // cin.tie(0);\n \t\t//\tios::sync_with_stdio(false);\n \t\t\t//priority_queue<pa3,vector<pa3>,greater<pa3>> pq; \n //sort(ve.begin(),ve.end(),greater<int>());\n //----------------kokomade tenpure------------\n //vector<double> ans(100000000),ans2(100000000)\n \n\n signed main(){\n \t cin.tie(0);\n \t\t\tios::sync_with_stdio(false);\n while(1){\n \n \n int n,m;\n \tcin>>n>>m;\n \tif(n==0&&m==0) return 0;\n \tint a[510][510];\n \tfor(int i=1;i<=n;i++)for(int j=1;j<=n;j++){\n \t\tif(i==j) a[i][j]=0;\n \t\telse a[i][j]=inf;\n \t}\n \tfor(int i=0;i<m;i++){\n \t\tint y,yy;\n \t\tcin>>y>>yy;\n \t\ta[y][yy]=1;\n \t\ta[yy][y]=1;\n \t}\n \tfor(int i=1;i<=n;i++)for(int j=1;j<=n;j++)for(int k=1;k<=n;k++){\n \t\ta[j][k]=min(a[j][k],a[j][i]+a[i][k]);\n \t}\n\n \tint ans=0;\n \tfor(int i=2;i<=n;i++)if(a[i][1]<=2) ans++;\n cout<<ans<<endl;\n }\n \treturn 0;\n }", "accuracy": 1, "time_ms": 110, "memory_kb": 5096, "score_of_the_acc": -1.5, "final_rank": 6 }, { "submission_id": "aoj_0545_3037364", "code_snippet": "//https://onlinejudge.u-aizu.ac.jp/challenges/sources/JOI/Prelim/0545?year=2010\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst auto INF = (long long) 1e9;\n\nint main() {\n int n, m;\n\n while (cin >> n >> m, n | m) {\n\n // Warshall–Floyd\n int dp[510][510];\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n if (i == j) {\n dp[i][i] = 0;\n } else {\n dp[i][j] = INF;\n }\n }\n }\n\n for (int i = 0; i < m; ++i) {\n int a, b;\n cin >> a >> b;\n a--;\n b--;\n dp[a][b] = 1;\n dp[b][a] = 1;\n }\n\n for (int k = 0; k < n; ++k) {\n for (int i = 0; i < n; ++i) {\n for (int j = 0; j < n; ++j) {\n dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);\n }\n }\n }\n\n int ans = 0;\n for (int i = 0; i < n; ++i) {\n if (dp[0][i] == 1 or dp[0][i] == 2) ans++;\n }\n cout << ans << endl;\n }\n return 0;\n}\n\n/*\n * ワーシャル・フロイド。\n * 自分からの距離が1か2の人を数える。\n *\n */", "accuracy": 1, "time_ms": 110, "memory_kb": 4068, "score_of_the_acc": -1.0666, "final_rank": 4 }, { "submission_id": "aoj_0545_2964632", "code_snippet": "#include <iostream>\n#include <string>\n#include <map>\n#include <vector>\n#include <utility>\n#include <set>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <algorithm>\n#include <cmath>\n#include <iomanip>\n#include <numeric>\n\n#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)\n#define itrep(i,x) for(auto i=(x).begin(); i!=(x).end();i++)\n#define Sort(x) sort((x).begin(),(x).end())\n#define all(x) (x).begin(),(x).end()\n#define fi first\n#define se second\n#define vec vector\n#define INF (int)1e9\n#define INFL 1e18\n#define MOD 1000000007\n#define pb push_back\n#define MP make_pair\n#define PI 3.1415926535\n#define fcout cout<<fixed<<setprecision(10)\ntypedef long long int ll;\ntypedef std::pair<int,int> P;\nint D=1;\nint dx[4]={0,1,0,-1},dy[4]={-1,0,1,0};\nint day[12]={31,28,31,30,31,30,31,31,30,31,30,31};\n//template<typename T>void pp(T x){cout<<x<<endl;}\n\nusing namespace std;\ntemplate<typename T> void test(vector<T> v){for(int i=0;i<v.size();i++){if(i)cout<<\" \";cout<<v[i];}cout<<endl;}\n\nint main(){\n int n,m;\n while(cin>>n&&n){\n cin>>m;\n vector<vector<int>> v(n,vector<int>(n,INF));\n rep(i,0,n)v[i][i]=0;\n rep(i,0,m){\n int a,b;\n cin>>a>>b;\n a--; b--;\n v[a][b]=1;\n v[b][a]=1;\n }\n\n rep(i,0,n){\n rep(j,0,n){\n rep(k,0,n){\n v[j][k]=min(v[j][k],v[j][i]+v[i][k]);\n }\n }\n }\n int ans=0;\n rep(i,0,n){\n if(v[0][i]==2||v[0][i]==1)ans++;\n }\n cout<<ans<<endl;\n }\n \n return 0;\n}", "accuracy": 1, "time_ms": 110, "memory_kb": 3908, "score_of_the_acc": -0.9992, "final_rank": 3 }, { "submission_id": "aoj_0545_2612349", "code_snippet": "#include<stdio.h>\n#include<iostream>\nusing namespace std;\nint a[10000],b[10000];\nint main(){\n\twhile(1){\n\t\tint i,n,m,l=0,s[501]={0},j;\n\t\tcin>>n>>m;\n\t\tif(n==0&&m==0)break;\n\t\ts[1]=3;\n\t\tfor(i=0;i<m;i++){\n\t\tcin>>a[i]>>b[i];\n\t\t}\n\t\tfor(i=0;i<m;i++){\n\t\t\tfor(j=0;j<m;j++){\n\t\t\t\tif(s[a[j]]>0&&s[b[j]]<s[a[j]]-1)s[b[j]]=s[a[j]]-1;\n\t\t\t\tif(s[b[j]]>0&&s[a[j]]<s[b[j]]-1)s[a[j]]=s[b[j]]-1;\n\t\t\t}\n\t\t}\n\t\tfor(i=2;i<=n;i++){\n\t\tif(s[i]!=0)l++;\n\t\t}\n\t\tcout<<l<<endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 180, "memory_kb": 3124, "score_of_the_acc": -1.1686, "final_rank": 5 }, { "submission_id": "aoj_0545_2158260", "code_snippet": "#include<iostream>\n#include<algorithm>\n#include<cstdio>\n#include<cmath>\n#include<math.h>\n#include<string>\n#include<string.h>\n#include<stack>\n#include<queue>\n#include<vector>\n#include<utility>\n#include<set>\n#include<map>\n#include<stdlib.h>\n#include<iomanip>\n\nusing namespace std;\n\n#define ll long long\n#define ld long double\n#define EPS 0.0000000001\n#define INF 1e9\n#define rep(i,n) for(i=0;i<n;i++)\n#define loop(i,a,n) for(i=a;i<n;i++)\n#define all(in) in.begin(),in.end()\n#define shosu(x) fixed<<setprecision(x)\n\ntypedef vector<int> vi;\ntypedef pair<int,int> pii;\n\nint main()\n{\n int i,j,k;\n int n,m;\n while(1){\n cin>>n>>m;\n if(n==0 && m==0)break;\n int v[500][500];\n rep(i,n)rep(j,n)\n if(i==j)v[i][j]=0;\n else v[i][j]=INF;\n rep(i,m){\n int a,b;\n cin>>a>>b;\n a--;b--;\n v[a][b]=1;\n v[b][a]=1;\n }\n rep(k,n)rep(i,n)rep(j,n)\n v[i][j]=min(v[i][j],v[i][k]+v[k][j]);\n int ans=0;\n rep(i,n)\n if(v[0][i]==1 || v[0][i]==2)ans++;\n cout<<ans<<endl;\n }\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 3964, "score_of_the_acc": -0.9513, "final_rank": 2 }, { "submission_id": "aoj_0545_2089822", "code_snippet": "#include <stdio.h>\n#include <string.h>\n\nint n, m, a[11234], b[11234];\nint my_friends[11234], their_friends[11234];\nint ans = 0;\nbool cancel = false;\n\nint main(void) {\n\twhile (true) {\n\t\tans = 0;\n\t\tscanf(\"%d%d\", &n, &m);\n\t\tif (n == 0 && m == 0) { break; }\n\t\tfor (int i = 0; i < m; ++i) { scanf(\"%d%d\", &a[i], &b[i]); }\n\n\t\tmemset(my_friends, -1, sizeof(my_friends));\n\t\tmemset(their_friends, -1, sizeof(their_friends));\n\t\tmy_friends[0] = 1, their_friends[0] = 1;\n\t\tfor (int i = 0; i < m; ++i) {\n\t\t\tif (a[i] == 1) { my_friends[b[i] - 1] = b[i]; ans++; }\n\t\t}\n\t\tfor (int i = 0; i < m; ++i) {\n\t\t\tfor (int j = 0; j < m; ++j) {\n\t\t\t\tif (a[i] == my_friends[j]) {\n\t\t\t\t\tfor (int k = 0; k < n; ++k) {\n\t\t\t\t\t\tif (b[i] == my_friends[k] || b[i] == their_friends[k]) {\n\t\t\t\t\t\t\tcancel = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (cancel == false) { their_friends[b[i] - 1] = b[i]; ans++; }\n\t\t\t\t\tcancel = false;\n\t\t\t\t}\n\t\t\t\telse if (b[i] == my_friends[j]) {\n\t\t\t\t\tfor (int k = 0; k < n; ++k) {\n\t\t\t\t\t\tif (a[i] == my_friends[k] || a[i] == their_friends[k]) {\n\t\t\t\t\t\t\tcancel = true;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif (cancel == false) { their_friends[a[i] - 1] = a[i]; ans++; }\n\t\t\t\t\tcancel = false;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tprintf(\"%d\\n\", ans);\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 2724, "score_of_the_acc": 0, "final_rank": 1 } ]
aoj_0542_cpp
認証レベル 問題 あなたは Just Odd Inventions 社を知っているだろうか? この会社の業務は「ただ奇妙な発明 (just odd inventions)」をすることである.ここでは略して JOI 社と呼ぶ. JOI 社には 2 つの事務所があり,それぞれ同じ大きさの正方形の部屋がマス目状に並んでできている.辺で接しているすべての部屋の間に,身分証による認証機能の付いた扉がある.JOI 社では様々なレベルの機密情報を扱っているため,部屋ごとに機密レベルという正の整数が設定されており,身分証の事務所ごとに定められた非負整数の認証レベルが,機密レベル以上でないとその部屋に入室することができない.各事務所の出入り口は唯一あるエレベーターホールのみで,エレベーターホールの部屋の機密レベルは最低の 1 である.その事務所についての認証レベルが 0 のときはエレベーターホールに入ることさえできない. JOI 社では,社長の突発的な提案で,一般の人に社内を見学してもらうツアーを実施することになった.あなたは見学者に渡す身分証の認証レベルの組み合わせを決める必要がある.見学者は開けられる扉を見つけると必ず開けて中に入る (同じ部屋を何度も訪れることも可能である).そのため,必要以上に見学者の身分証の認証レベルを高くしたくはない.しかし,ツアーに魅力を持たせるため,ツアーではエレベーターホールの部屋を含め 2 つの事務所であわせて R 個以上の部屋を訪れることができるようにする必要がある.身分証の認証レベルを低くしすぎると,この条件を満たすことができないかもしれない. JOI 社には事務所が 2 個あり,第 k 事務所 ( k = 1, 2) の部屋は東西方向に W k 個,南北方向に H k 個並んでおり,全部で W k × H k 個ある. 西から i 番目,北から j 番目の部屋を ( i , j ) k で表すことにする. W k と H k と R の値,エレベーターホールの位置 ( X k , Y k ) k ,各部屋の機密レベルが与えられたとき,見学者が 2 つの事務所であわせて R 個以上の部屋を訪れることができるための,見学者の身分証の認証レベルの和の最小値を求めるプログラムを作成せよ. なお,JOI 社が「ただ奇妙な発明」をすることでどうやって利益を得ているかは,社内でも最高機密であり社長以外の誰も知らない. 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる． 1 行目には正整数 R (1 ≤ R ≤ 100000) が書かれている.2 行目以降には,2 つの事務所のデータが順に与えられる. 事務所のデータは,最初の行に正整数 W k , H k , X k , Y k (1 ≤ X k ≤ W k ≤ 500, 1 ≤ Y k ≤ H k ≤ 500), 続く H k 行の j 行目の i 番目に, 部屋 ( i , j ) k の機密レベルを表す整数 L k, i,j (1 ≤ L k,i,j < 100000000 = 10 8 ) として与えられる. また, R ≤ W 1 × H 1 + W 2 × H 2 を満たす. 採点用データのうち, 配点の 30% 分については, R , W k , H k ≤ 100 を満たす. R が 0 のとき入力の終了を示す.　データセットの数は 10 を超えない． 出力 データセットごとに,求める身分証の認証レベルの和の最小値を 1 行に出力する. 入出力例 入力例 5 2 2 1 2 9 5 1 17 3 2 2 1 6 1 20 8 18 3 8 5 4 1 3 5 5 4 5 5 8 2 1 9 7 1 1 3 5 1 7 2 7 1 3 6 5 6 2 2 3 5 8 2 7 1 6 9 4 5 1 2 4 5 4 2 2 5 4 2 5 3 3 7 1 5 1 5 6 6 3 3 2 2 2 9 2 9 1 9 2 9 2 2 2 1 1 1 3 5 7 0 出力例 15 4 9 1つ目の例 では,見学者に渡す身分証の認証レベルを,事務所 1 の認証レベルが 9,事務所 2 の認証レベルが 6 となるように設定すると,見学者は 5 個の部屋 (事務所 1 の部屋 (1, 1) 1 , (1, 2) 1 , (2, 1) 1 と,事務所 2 の部屋 (1, 1) 2 , (2, 1) 2 ) を訪れることができる.このとき,認証レベルの和は 15 となる.これが合計 5 個以上の部屋を訪れることができるための認証レベルの和の最小値である. ３つ目の例 では,見学者に渡す身分証の認証レベルを,事務所 1 の認証レベルが 9,事務所 2 の認証レベルが 0 となるように設定すると,見学者は 9 個の部屋 (事務所 1 の部屋 (1, 1) 1 , (1, 2) 1 , (1, 3) 1 , (2, 1) 1 , (2, 2) 1 , (2, 3) 1 , (3, 1) 1 , (3, 2) 1 , (3, 3) 1 ) を訪れることができる.事務所 2 の部屋は 1 個も訪れることができない.(エレベーターホール (1, 1) 2 にすら入ることができない.) このとき,認証レベルの和は 9 となる.これが合計 6 個以上の部屋を訪れることができるための認証レベルの和の最小値である. 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0542_10854022", "code_snippet": "#include <bits/stdc++.h>\n \n#define FOR(i,a,b) for( ll i = (a); i < (ll)(b); i++ )\n#define REP(i,n) FOR(i,0,n)\n#define YYS(x,arr) for(auto& x:arr)\n#define ALL(x) (x).begin(),(x).end()\n#define SORT(x) sort( (x).begin(),(x).end() )\n#define REVERSE(x) reverse( (x).begin(),(x).end() )\n#define UNIQUE(x) (x).erase( unique( ALL( (x) ) ) , (x).end() )\n#define PW(x) (1LL<<(x))\n#define SZ(x) ((ll)(x).size())\n#define SHOW(x) cout << #x << \" = \" << x << endl\n#define SHOWA(x,n) for( int yui = 0; yui < n; yui++ ){ cout << x[yui] << \" \"; } cout << endl\n\n#define pb emplace_back\n#define fi first\n#define se second\n\nusing namespace std;\n\ntypedef long double ld;\ntypedef long long int ll;\ntypedef pair<int,int> pi;\ntypedef pair<ll,ll> pl;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef vector<bool> vb;\ntypedef vector<ld> vd;\ntypedef vector<pi> vpi;\ntypedef vector<pl> vpl;\ntypedef vector<vpl> gr;\ntypedef vector<vl> ml;\ntypedef vector<vd> md;\ntypedef vector<vi> mi;\n \nconst ll INF = (ll)1e9 + 10;\nconst ll INFLL = (ll)1e18 + 10;\nconst ld EPS = 1e-12;\nconst ll MOD = 1e9+7;\n \ntemplate<class T> T &chmin( T &a , const T &b ){ return a = min(a,b); }\ntemplate<class T> T &chmax( T &a , const T &b ){ return a = max(a,b); }\ntemplate<class T> inline T sq( T a ){ return a * a; }\n\nll in(){ long long int x; scanf( \"%lld\" , &x ); return x; }\nchar yuyushiki[1000010]; string stin(){ scanf( \"%s\" , yuyushiki ); return yuyushiki; }\n\n// head\n\ntemplate<class T> pair<vi,vector<T> > compress( vector<T> a ){\n vector<T> ord = a;\n vi res(0);\n SORT( ord );\n UNIQUE( ord );\n YYS( w , a ) res.pb( lower_bound( ALL(ord) , w ) - ord.begin() );\n return make_pair( res , ord );\n}\n\nint w, h;\nint a[510][510];\nbool used[510][510];\n\nconst int dx[] = {1, 0, -1, 0};\nconst int dy[] = {0, -1, 0, 1};\n\nbool isin(int y, int x){\n return 0 <= y && y < h && 0 <= x && x < w;\n}\n\nusing T = tuple<int, int, int>;\n\nvi calc(){\n w = in();\n h = in();\n int x = in() - 1;\n int y = in() - 1;\n vi v(0);\n REP(i, h){\n REP(j, w){\n v.pb(in());\n }\n }\n auto c = compress(v);\n REP(i, h){\n REP(j, w){\n a[i][j] = c.fi[i*w+j];\n }\n }\n REP(i, h){\n REP(j, w){\n used[i][j] = false;\n }\n }\n vi res = {0};\n int cur = 0;\n priority_queue<T, vector<T>, greater<T> > que;\n que.emplace(a[y][x], y, x);\n used[y][x] = true;\n while(!que.empty()){\n int val, cy, cx;\n tie(val, cy, cx) = que.top();\n que.pop();\n chmax(cur, val);\n res.pb(c.se[cur]);\n REP(i, 4){\n int ny = cy + dy[i];\n int nx = cx + dx[i];\n if(isin(ny, nx) && !used[ny][nx]){\n used[ny][nx] = true; \n que.emplace(a[ny][nx], ny, nx);\n }\n }\n }\n return res;\n}\n\nvoid solve(){\n int r = in();\n if(r == 0){\n exit(0);\n }\n vi resa = calc();\n vi resb = calc();\n /*\n SHOWA(resa, SZ(resa));\n SHOWA(resb, SZ(resb));\n */\n int ans = INF;\n REP(i, r+1){\n int j = r - i;\n if(i < SZ(resa) && j < SZ(resb)){\n chmin(ans, resa[i] + resb[j]);\n }\n }\n printf(\"%d\\n\", ans);\n}\n\nint main(){\n\n while(1){\n solve();\n }\n \n return 0;\n}", "accuracy": 1, "time_ms": 160, "memory_kb": 12120, "score_of_the_acc": -0.7593, "final_rank": 14 }, { "submission_id": "aoj_0542_10525125", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nstatic constexpr int INF = 1<<28;\nstatic constexpr int dr[4][2] = {{0,1},{1,0},{0,-1},{-1,0}};\n\n// R 本のクエリに対してそれぞれ最短の“最大値”経路を求める関数\n// d: グリッドの高さ H, 幅 W の重みを格納した2D配列\n// sx, sy: スタート位置 (0–based)\n// out: 長さ R+1 のベクタ。 step i で到達可能な最小の“最大重み”を out[i] に格納\nvoid dijkstra_maxmin(const vector<vector<int>>& d, int sx, int sy, vector<int>& out) {\n int H = d.size(), W = d[0].size(), R = out.size() - 1;\n // memo[y][x]: (y,x) に到達するまでの「最小の最大重み」\n static int memo[501][501];\n for (int y = 0; y < H; y++)\n for (int x = 0; x < W; x++)\n memo[y][x] = INF;\n\n // (cost, (x,y)), cost はこれまで通ったセル重みの最大値\n priority_queue< pair<int,pair<int,int>>,\n vector<pair<int,pair<int,int>>>,\n greater<> >\n pq;\n\n memo[sy][sx] = d[sy][sx];\n pq.emplace(d[sy][sx], pair{sx, sy});\n\n int step = 0;\n out[step++] = 0; // 0 ステップ目はまだ何も踏んでいないので cost=0\n\n while (!pq.empty() && step <= R) {\n auto [cost, pos] = pq.top(); pq.pop();\n auto [x, y] = pos;\n if (cost != memo[y][x]) continue;\n out[step++] = cost;\n\n for (auto& mv : dr) {\n int nx = x + mv[0], ny = y + mv[1];\n if (nx < 0 || nx >= W || ny < 0 || ny >= H) continue;\n int ncost = max(cost, d[ny][nx]);\n if (ncost < memo[ny][nx]) {\n memo[ny][nx] = ncost;\n pq.emplace(ncost, pair{nx, ny});\n }\n }\n }\n}\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n while (true) {\n int R;\n cin >> R;\n if (!R) break;\n\n // 2 回分のクエリ情報を読み取り、各々について R+1 長の配列を得る\n vector<vector<int>> results(2, vector<int>(R+1, INF));\n for (int t = 0; t < 2; t++) {\n int W, H, X, Y;\n cin >> W >> H >> X >> Y;\n vector<vector<int>> d(H, vector<int>(W));\n for (int i = 0; i < H; i++) {\n for (int j = 0; j < W; j++) {\n cin >> d[i][j];\n }\n }\n // 1-based の X,Y を 0-based に\n dijkstra_maxmin(d, X-1, Y-1, results[t]);\n }\n\n // 2 つのルートを i ステップと R−i ステップに分割して最適化\n int answer = INF;\n for (int i = 0; i <= R; i++) {\n answer = min(answer, results[0][i] + results[1][R - i]);\n }\n cout << answer << \"\\n\";\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 6496, "score_of_the_acc": -0.1117, "final_rank": 3 }, { "submission_id": "aoj_0542_9613029", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n\nvector<ll> calc(){ \n ll W,H,X,Y;\n cin>>W>>H>>X>>Y;\n X--;Y--;\n vector<vector<ll>> A(H,vector<ll>(W));\n for(int h=0;h<H;h++){\n for(int w=0;w<W;w++)cin>>A[h][w];\n } \n priority_queue<pair<ll,pair<ll,ll>>,vector<pair<ll,pair<ll,ll>>>,greater<pair<ll,pair<ll,ll>>>> Q;\n vector<ll> res(H*W+1,0);\n ll an=0;\n vector<ll> dx={-1,0,1,0},dy={0,1,0,-1}; \n vector<vector<bool>> seen(H,vector<bool>(W,0));\n seen[Y][X]=1;\n Q.push({A[Y][X],{Y,X}});\n for(int i=0;i<H*W;i++){\n auto c=Q.top().first;\n auto [y,x]=Q.top().second;\n Q.pop();\n an=max(an,c);\n res[i+1]=an;\n for(int d=0;d<4;d++){\n ll ny=y+dy[d];\n ll nx=x+dx[d];\n if(ny<0||nx<0||ny>=H||nx>=W)continue;\n if(seen[ny][nx])continue;\n Q.push({A[ny][nx],{ny,nx}});\n seen[ny][nx]=1;\n }\n }\n return res;\n}\n\nint main() {\n ll R;\n while(cin>>R,R!=0){\n vector<ll> A=calc(),B=calc();\n ll an=1e18;\n for(int i=0;i<A.size();i++){\n int j=R-i;\n if(j>=B.size())continue;\n an=min(an,A[i]+B[j]);\n }\n cout<<an<<endl;\n}\n}", "accuracy": 1, "time_ms": 160, "memory_kb": 10284, "score_of_the_acc": -0.7182, "final_rank": 12 }, { "submission_id": "aoj_0542_8967568", "code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <cmath>\n#include <cassert>\n#include <algorithm>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <vector>\n#define repi(i,a,b) for(ll i=(a);i<(b);++i)\n#define rep(i,a) repi(i,0,a)\n#define repdi(i,a,b) for(ll i=(a)-1;i>=(b);--i)\n#define repd(i,a) repdi(i,a,0)\n#define itr(it,a) for( auto it = (a).begin(); it != (a).end(); ++it )\n#define all(a) (a).begin(), (a).end()\n#define rall(a) (a).rbegin(), (a).rend()\n#define endl '\\n'\n#define debug(x) std::cerr << #x << \" = \" << (x) << endl;\n\nusing ll = long long;\nusing P = std::pair<ll, ll>;\nusing PP = std::pair<ll, P>;\n\nconstexpr ll INF = 1ll<<60;\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\ntemplate<class S, class T>\nstd::ostream& operator<< ( std::ostream& out, const std::pair<S,T>& a )\n{ std::cout << '(' << a.first << \", \" << a.second << ')'; return out; }\n\ntemplate<class T>\nstd::ostream &operator<< ( std::ostream& out, const std::vector<T>& a )\n{ std::cout << '['; rep( i, a.size() ){ std::cout << a[i]; if( i != a.size()-1 ) std::cout << \", \"; } std::cout << ']'; return out; }\n\nll R;\nll W[2], H[2], X[2], Y[2];\nll L[2][1000][1000];\n\nconst ll dx[4] = { -1, 0, 1, 0 }, dy[4] = { 0, 1, 0, -1 };\n\nll dist[2][1000][1000];\n\nstd::vector<ll> ds[2];\n\nvoid dijkstra(ll i) {\n std::priority_queue<PP, std::vector<PP>, std::greater<PP>> pque;\n\n rep( j, W[i] ) rep( k, H[i] )\n dist[i][j][k] = INF;\n\n dist[i][X[i]][Y[i]] = 1;\n\n pque.emplace( dist[i][X[i]][Y[i]], P( X[i], Y[i] ) );\n\n while( !pque.empty() ) {\n PP p = pque.top(); pque.pop();\n ll d = p.first;\n ll x = p.second.first, y = p.second.second;\n\n if( d > dist[i][x][y] )\n continue;\n\n rep( dir, 4 ) {\n ll nx = x + dx[dir], ny = y + dy[dir];\n\n if (nx < 0 || nx >= W[i] || ny < 0 || ny >= H[i])\n continue;\n\n if( chmin( dist[i][nx][ny], std::max(d, L[i][nx][ny]) ) )\n pque.emplace( dist[i][nx][ny], P(nx, ny) );\n }\n }\n\n return;\n}\n\nint main() {\n while( std::cin >> R, R) {\n rep( i, 2 ) {\n std::cin >> W[i] >> H[i] >> X[i] >> Y[i];\n --X[i]; --Y[i];\n\n rep( j, H[i] ) {\n rep( k, W[i] ) {\n std::cin >> L[i][k][j];\n }\n }\n }\n\n dijkstra(0);\n dijkstra(1);\n\n rep( i, 2 )\n ds[i].clear();\n\n rep( i, 2 ) rep( j, W[i] ) rep( k, H[i] ) {\n ds[i].emplace_back(dist[i][j][k]);\n }\n \n rep( i, 2 )\n std::sort(all(ds[i]));\n\n ll ans = INF;\n\n rep( i, ds[0].size() ) {\n ll l = ds[0][i];\n\n ll cnt0 = std::upper_bound(all(ds[0]), l) - ds[0].begin();\n \n if (R-cnt0 > 0 && R-cnt0-1 >= ds[1].size()) {\n continue;\n }\n\n ll l2 = R-cnt0 > 0 ? ds[1][R-cnt0-1] : 0;\n\n chmin( ans, l + l2 );\n }\n\n std::cout << ans << endl;\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 190, "memory_kb": 31132, "score_of_the_acc": -1.315, "final_rank": 19 }, { "submission_id": "aoj_0542_7937638", "code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <queue>\nusing namespace std;\nvoid reader(int *x) {\n int k = getchar_unlocked();\n *x = k - '0';\n while (1) {\n k = getchar_unlocked();\n if (k < '0' || k > '9')\n break;\n *x = ((*x) << 1) + ((*x) << 3) + k - '0';\n }\n}\nstruct state {\n int sx, sy, cost;\n};\nbool operator<(const state &s1, const state &s2) { return s1.cost < s2.cost; }\nint R, H[2], W[2], sx[2], sy[2], a[2][509][509], cnt[2], b[2][250009];\nbool vis[509][509];\nint dir[] = {0, 1, 0, -1};\nint main() {\n while (scanf(\"%d\", &R), R) {\n for (int i = 0; i < 2; i++) {\n scanf(\"%d%d%d%d\", &W[i], &H[i], &sy[i], &sx[i]);\n sy[i]--, sx[i]--;\n for (int j = 0; j < H[i]; j++) {\n for (int k = 0; k < W[i]; k++) {\n reader(&a[i][j][k]);\n vis[j][k] = false;\n }\n }\n priority_queue<state> que;\n que.push(state{sx[i], sy[i], -1});\n vis[sx[i]][sy[i]] = true;\n cnt[i] = 1;\n while (!que.empty()) {\n state u = que.top();\n que.pop();\n b[i][cnt[i]++] = a[i][u.sx][u.sy];\n for (int j = 0; j < 4; j++) {\n int tx = u.sx + dir[j], ty = u.sy + dir[j ^ 1];\n if (0 <= tx && tx < H[i] && 0 <= ty && ty < W[i] && !vis[tx][ty]) {\n a[i][tx][ty] = max(a[i][tx][ty], a[i][u.sx][u.sy]);\n vis[tx][ty] = true;\n que.push(state{tx, ty, -a[i][tx][ty]});\n }\n }\n }\n }\n int ret = 2000000009;\n for (int i = 0; i <= H[0] * W[0]; i++) {\n int z = max(R - i, 0);\n if (z > H[1] * W[1])\n continue;\n ret = min(ret, b[0][i] + b[1][z]);\n }\n printf(\"%d\\n\", ret);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 7184, "score_of_the_acc": -0.2141, "final_rank": 6 }, { "submission_id": "aoj_0542_7937637", "code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <queue>\nusing namespace std;\nvoid reader(int *x) {\n int k = getchar_unlocked();\n *x = k - '0';\n while (1) {\n k = getchar_unlocked();\n if (k < '0' || k > '9')\n break;\n *x = ((*x) << 1) + ((*x) << 3) + k - '0';\n }\n}\nstruct state {\n int sx, sy, cost;\n};\nbool operator<(const state &s1, const state &s2) { return s1.cost < s2.cost; }\nint R, H[2], W[2], sx[2], sy[2], a[2][509][509], cnt[2], b[2][250009];\nbool vis[509][509];\nint dir[] = {0, 1, 0, -1};\nint main() {\n while (scanf(\"%d\", &R), R) {\n for (int i = 0; i < 2; i++) {\n scanf(\"%d%d%d%d\", &W[i], &H[i], &sy[i], &sx[i]);\n sy[i]--, sx[i]--;\n for (int j = 0; j < H[i]; j++) {\n for (int k = 0; k < W[i]; k++) {\n reader(&a[i][j][k]);\n }\n }\n priority_queue<state> que;\n que.push(state{sx[i], sy[i], -1});\n memset(vis, 0, sizeof(vis));\n vis[sx[i]][sy[i]] = true;\n cnt[i] = 1;\n while (!que.empty()) {\n state u = que.top();\n que.pop();\n b[i][cnt[i]++] = a[i][u.sx][u.sy];\n for (int j = 0; j < 4; j++) {\n int tx = u.sx + dir[j], ty = u.sy + dir[j ^ 1];\n if (0 <= tx && tx < H[i] && 0 <= ty && ty < W[i] && !vis[tx][ty]) {\n a[i][tx][ty] = max(a[i][tx][ty], a[i][u.sx][u.sy]);\n vis[tx][ty] = true;\n que.push(state{tx, ty, -a[i][tx][ty]});\n }\n }\n }\n }\n int ret = 2000000009;\n for (int i = 0; i <= H[0] * W[0]; i++) {\n int z = max(R - i, 0);\n if (z > H[1] * W[1])\n continue;\n ret = min(ret, b[0][i] + b[1][z]);\n }\n printf(\"%d\\n\", ret);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 7280, "score_of_the_acc": -0.2162, "final_rank": 7 }, { "submission_id": "aoj_0542_7937633", "code_snippet": "#include <cstring>\n#include <iostream>\n#include <queue>\n#include <vector>\nusing namespace std;\n#define fst first\n#define scd second\n#define PB push_back\n#define MP make_pair\n#define all(a) a.begin(), a.end()\n#define omajinai \\\n ios::sync_with_stdio(false); \\\n cin.tie(0)\n#define rep(i, x) for (int i = 0; i < (int)(x); ++i)\ntypedef pair<int, int> pii;\ntypedef vector<pii> vpii;\ntemplate <typename T> bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <typename T> bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\nconst int inf = 1e9;\nint dy[] = {-1, 0, 1, 0};\nint dx[] = {0, -1, 0, 1};\nint R;\nint W[2], H[2];\nint X[2], Y[2];\nint A[2][502][502];\nbool used[502][502];\nvpii data[2];\nvoid bfs(int num) {\n typedef pair<int, pii> Data;\n memset(used, false, sizeof(used));\n priority_queue<Data> q;\n q.push(Data(-1, pii(Y[num], X[num])));\n used[Y[num]][X[num]] = true;\n if (num == 0) {\n data[num].PB(pii(1, 0));\n } else {\n data[num].PB(pii(0, 0));\n data[num].PB(pii(0, 1));\n }\n int ma = 1;\n int cnt = 0;\n int hoge = 0;\n while (q.size()) {\n Data p = q.top();\n q.pop();\n int cur = -p.fst;\n if (ma < cur) {\n if (num == 0) {\n data[num].back().scd = cnt;\n } else {\n data[num].back().fst = cnt;\n }\n ma = cur;\n if (num == 0) {\n data[num].PB(pii(ma, 0));\n } else {\n data[num].PB(pii(0, ma));\n }\n }\n cnt++;\n rep(i, 4) {\n int ny = p.scd.fst + dy[i], nx = p.scd.scd + dx[i];\n if (ny < 0 || ny >= H[num] || nx < 0 || nx >= W[num] || used[ny][nx])\n continue;\n used[ny][nx] = true;\n q.push(Data(-A[num][ny][nx], pii(ny, nx)));\n }\n }\n if (num == 0) {\n data[num].back().scd = cnt;\n } else {\n data[num].back().fst = cnt;\n }\n}\nsigned main() {\n while (cin >> R, R) {\n data[0].clear();\n data[1].clear();\n rep(i, 2) {\n cin >> W[i] >> H[i] >> X[i] >> Y[i];\n --X[i], --Y[i];\n rep(j, H[i]) rep(k, W[i]) { cin >> A[i][j][k]; }\n }\n bfs(0);\n bfs(1);\n int mi = inf;\n data[1].PB(pii(inf, inf));\n rep(i, data[0].size()) {\n pii a = data[0][i];\n chmin(mi, a.fst + lower_bound(all(data[1]), pii(R - a.scd, -inf))->scd);\n }\n cout << mi << endl;\n }\n}", "accuracy": 1, "time_ms": 200, "memory_kb": 7624, "score_of_the_acc": -0.8326, "final_rank": 16 }, { "submission_id": "aoj_0542_7937603", "code_snippet": "#include <cstring>\n#include <iostream>\n#include <queue>\n#include <vector>\nusing namespace std;\n#define fst first\n#define scd second\n#define PB push_back\n#define all(a) a.begin(), a.end()\n#define omajinai \\\n ios::sync_with_stdio(false); \\\n cin.tie(0)\n#define rep(i, x) for (int i = 0; i < (int)(x); ++i)\ntypedef pair<int, int> pii;\ntypedef vector<pii> vpii;\ntemplate <typename T> bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <typename T> bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\nconst int inf = 1e9;\nint dy[] = {-1, 0, 1, 0};\nint dx[] = {0, -1, 0, 1};\nint R;\nint W[2], H[2];\nint X[2], Y[2];\nint A[2][502][502];\nbool used[502][502];\nvpii data[2];\nvoid bfs(int num) {\n typedef pair<int, pii> Data;\n memset(used, false, sizeof(used));\n priority_queue<Data> q;\n q.push(Data(-1, pii(Y[num], X[num])));\n used[Y[num]][X[num]] = true;\n if (num == 0) {\n data[num].PB(pii(1, 0));\n } else {\n data[num].PB(pii(0, 0));\n data[num].PB(pii(0, 1));\n }\n int ma = 1;\n int cnt = 0;\n int hoge = 0;\n while (q.size()) {\n Data p = q.top();\n q.pop();\n int cur = -p.fst;\n if (ma < cur) {\n if (num == 0) {\n data[num].back().scd = cnt;\n } else {\n data[num].back().fst = cnt;\n }\n ma = cur;\n if (num == 0) {\n data[num].PB(pii(ma, 0));\n } else {\n data[num].PB(pii(0, ma));\n }\n }\n cnt++;\n rep(i, 4) {\n int ny = p.scd.fst + dy[i], nx = p.scd.scd + dx[i];\n if (ny < 0 || ny >= H[num] || nx < 0 || nx >= W[num] || used[ny][nx])\n continue;\n used[ny][nx] = true;\n q.push(Data(-A[num][ny][nx], pii(ny, nx)));\n }\n }\n if (num == 0) {\n data[num].back().scd = cnt;\n } else {\n data[num].back().fst = cnt;\n }\n}\nsigned main() {\n omajinai;\n while (cin >> R, R) {\n data[0].clear();\n data[1].clear();\n rep(i, 2) {\n cin >> W[i] >> H[i] >> X[i] >> Y[i];\n --X[i], --Y[i];\n rep(j, H[i]) rep(k, W[i]) { cin >> A[i][j][k]; }\n }\n bfs(0);\n bfs(1);\n int mi = inf;\n data[1].PB(pii(inf, inf));\n rep(i, data[0].size()) {\n pii a = data[0][i];\n chmin(mi, a.fst + lower_bound(all(data[1]), pii(R - a.scd, -inf))->scd);\n }\n cout << mi << endl;\n }\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 7644, "score_of_the_acc": -0.3548, "final_rank": 10 }, { "submission_id": "aoj_0542_7937593", "code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <queue>\n#pragma warning(disable : 4996)\nusing namespace std;\nstruct state {\n int sx, sy, cost;\n};\nbool operator<(const state &s1, const state &s2) { return s1.cost < s2.cost; }\nint R, H[2], W[2], sx[2], sy[2], a[2][509][509], cnt[2], b[2][250009];\nbool vis[509][509];\nint dir[] = {0, 1, 0, -1};\nint main() {\n while (scanf(\"%d\", &R), R) {\n for (int i = 0; i < 2; i++) {\n scanf(\"%d%d%d%d\", &W[i], &H[i], &sy[i], &sx[i]);\n sy[i]--, sx[i]--;\n for (int j = 0; j < H[i]; j++) {\n for (int k = 0; k < W[i]; k++) {\n scanf(\"%d\", &a[i][j][k]);\n vis[j][k] = false;\n }\n }\n priority_queue<state> que;\n que.push(state{sx[i], sy[i], -1});\n vis[sx[i]][sy[i]] = true;\n cnt[i] = 1;\n while (!que.empty()) {\n state u = que.top();\n que.pop();\n b[i][cnt[i]++] = a[i][u.sx][u.sy];\n for (int j = 0; j < 4; j++) {\n int tx = u.sx + dir[j], ty = u.sy + dir[j ^ 1];\n if (0 <= tx && tx < H[i] && 0 <= ty && ty < W[i] && !vis[tx][ty]) {\n a[i][tx][ty] = max(a[i][tx][ty], a[i][u.sx][u.sy]);\n vis[tx][ty] = true;\n que.push(state{tx, ty, -a[i][tx][ty]});\n }\n }\n }\n }\n int ret = 2000000009;\n for (int i = 0; i <= H[0] * W[0]; i++) {\n int z = max(R - i, 0);\n if (z > H[1] * W[1])\n continue;\n ret = min(ret, b[0][i] + b[1][z]);\n }\n printf(\"%d\\n\", ret);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 7352, "score_of_the_acc": -0.3483, "final_rank": 9 }, { "submission_id": "aoj_0542_7937590", "code_snippet": "#include <algorithm>\n#include <cassert>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n#define f first\n#define s second\n#define mp make_pair\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOR(i, c) \\\n for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)\n#define ALL(c) (c).begin(), (c).end()\n#define IN(x, s, g) ((x) >= (s) && (x) < (g))\n#define ISIN(x, y, w, h) (IN((x), 0, (w)) && IN((y), 0, (h)))\n#define print(x) printf(\"%d\\n\", x)\nusing namespace std;\ntypedef unsigned int uint;\ntypedef long long ll;\nconst int _dx[] = {0, 1, 0, -1};\nconst int _dy[] = {-1, 0, 1, 0};\nint getInt() {\n int ret = 0, c;\n c = getchar();\n while (!isdigit(c))\n c = getchar();\n while (isdigit(c)) {\n ret *= 10;\n ret += c - '0';\n c = getchar();\n }\n return ret;\n}\nint l[2][500][500];\nbool c[2][500][500];\nint memo[2][250001];\nstruct level {\n int l;\n int x;\n int y;\n level(int a, int b, int c) {\n l = a;\n x = b;\n y = c;\n }\n};\nbool operator<(const level &a, const level &b) { return a.l > b.l; }\nint main() {\n int r;\n while (r = getInt()) {\n int w[2], h[2], x[2], y[2];\n REP(k, 2) {\n w[k] = getInt();\n h[k] = getInt();\n x[k] = getInt() - 1;\n y[k] = getInt() - 1;\n REP(i, h[k]) REP(j, w[k]) {\n l[k][i][j] = getInt();\n c[k][i][j] = false;\n }\n priority_queue<level> pq;\n pq.push(level(1, x[k], y[k]));\n c[k][y[k]][x[k]] = true;\n int cnt = 0;\n int now = 1;\n memo[k][cnt++] = 0;\n while (!pq.empty()) {\n level lv = pq.top();\n int ll = lv.l;\n int xx = lv.x;\n int yy = lv.y;\n pq.pop();\n memo[k][cnt++] = (now = max(ll, now));\n REP(i, 4) {\n int xxx = xx + _dx[i];\n int yyy = yy + _dy[i];\n if (ISIN(xxx, yyy, w[k], h[k]) && !c[k][yyy][xxx]) {\n c[k][yyy][xxx] = true;\n pq.push(level(l[k][yyy][xxx], xxx, yyy));\n }\n }\n }\n }\n int end = min(r, w[0] * h[0]) + 1;\n int start = max(0, r - w[1] * h[1]);\n int ans = INT_MAX;\n rep(i, start, end) ans = min(ans, memo[0][i] + memo[1][r - i]);\n print(ans);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 7640, "score_of_the_acc": -0.2678, "final_rank": 8 }, { "submission_id": "aoj_0542_7937561", "code_snippet": "#include <algorithm>\n#include <cassert>\n#include <climits>\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <vector>\n#define f first\n#define s second\n#define mp make_pair\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\n#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)\n#define FOR(i, c) \\\n for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)\n#define ALL(c) (c).begin(), (c).end()\n#define IN(x, s, g) ((x) >= (s) && (x) < (g))\n#define ISIN(x, y, w, h) (IN((x), 0, (w)) && IN((y), 0, (h)))\n#define print(x) printf(\"%d\\n\", x)\nusing namespace std;\ntypedef unsigned int uint;\ntypedef long long ll;\nconst int _dx[] = {0, 1, 0, -1};\nconst int _dy[] = {-1, 0, 1, 0};\nint getInt() {\n int ret = 0, c;\n c = getchar();\n while (!isdigit(c))\n c = getchar();\n while (isdigit(c)) {\n ret *= 10;\n ret += c - '0';\n c = getchar();\n }\n return ret;\n}\nint l[2][500][500];\nbool c[2][500][500];\nint memo[2][250001];\nstruct level {\n int l;\n int x;\n int y;\n level(int a, int b, int c) {\n l = a;\n x = b;\n y = c;\n }\n};\nbool operator<(const level &a, const level &b) { return a.l > b.l; }\nint main() {\n int r;\n while (r = getInt()) {\n int w[2], h[2], x[2], y[2];\n REP(k, 2) {\n w[k] = getInt();\n h[k] = getInt();\n x[k] = getInt() - 1;\n y[k] = getInt() - 1;\n REP(i, h[k]) REP(j, w[k]) {\n l[k][i][j] = getInt();\n c[k][i][j] = false;\n }\n priority_queue<level> pq;\n pq.push(level(1, x[k], y[k]));\n c[k][y[k]][x[k]] = true;\n int cnt = 0;\n int now = 1;\n memo[k][cnt++] = 0;\n while (!pq.empty()) {\n level lv = pq.top();\n int ll = lv.l;\n int xx = lv.x;\n int yy = lv.y;\n pq.pop();\n memo[k][cnt++] = (now = max(ll, now));\n if (cnt == r + 1)\n break;\n REP(i, 4) {\n int xxx = xx + _dx[i];\n int yyy = yy + _dy[i];\n if (ISIN(xxx, yyy, w[k], h[k]) && !c[k][yyy][xxx]) {\n c[k][yyy][xxx] = true;\n pq.push(level(l[k][yyy][xxx], xxx, yyy));\n }\n }\n }\n }\n int end = min(r, w[0] * h[0]) + 1;\n int start = max(0, r - w[1] * h[1]);\n int ans = INT_MAX;\n rep(i, start, end) ans = min(ans, memo[0][i] + memo[1][r - i]);\n print(ans);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 6472, "score_of_the_acc": -0.1112, "final_rank": 2 }, { "submission_id": "aoj_0542_7937560", "code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <queue>\n#include <vector>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)n; ++i)\nint dx[] = {0, 1, 0, -1};\nint dy[] = {1, 0, -1, 0};\nstruct P {\n int d;\n int x, y;\n P(int d, int x, int y) : d(d), x(x), y(y) {}\n};\nbool operator<(const P &a, const P &b) { return a.d > b.d; }\nint main() {\n int r;\n while (cin >> r, r) {\n int w[2], h[2], sx[2], sy[2];\n int ba[2][500][500];\n rep(k, 2) {\n cin >> w[k] >> h[k] >> sx[k] >> sy[k];\n sx[k]--;\n sy[k]--;\n rep(y, h[k]) rep(x, w[k]) cin >> ba[k][x][y];\n }\n int table[2][250001];\n rep(k, 2) {\n priority_queue<P> Q;\n Q.push(P(1, sx[k], sy[k]));\n bool visited[w[k]][h[k]];\n memset(visited, 0, sizeof(visited));\n int nowd = 0;\n int cnt = 0;\n while (!Q.empty()) {\n P p = Q.top();\n int x = p.x;\n int y = p.y;\n Q.pop();\n if (visited[x][y])\n continue;\n nowd = max(nowd, p.d);\n table[k][++cnt] = nowd;\n visited[x][y] = 1;\n rep(i, 4) {\n int xx = x + dx[i];\n int yy = y + dy[i];\n if (xx < 0 || xx >= w[k] || yy < 0 || yy >= h[k])\n continue;\n if (visited[xx][yy])\n continue;\n Q.push(P(ba[k][xx][yy], xx, yy));\n }\n }\n }\n int res = 1 << 29;\n for (int i = 0; i <= r; ++i) {\n if (i > w[0] * h[0] || r - i > w[1] * h[1])\n continue;\n res = min(res, table[0][i] + table[1][r - i]);\n }\n cout << res << endl;\n }\n}", "accuracy": 1, "time_ms": 250, "memory_kb": 8440, "score_of_the_acc": -1.0683, "final_rank": 17 }, { "submission_id": "aoj_0542_7937559", "code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <queue>\n#include <vector>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)n; ++i)\nint dx[] = {0, 1, 0, -1};\nint dy[] = {1, 0, -1, 0};\nstruct P {\n int d;\n int x, y;\n P(int d, int x, int y) : d(d), x(x), y(y) {}\n};\nbool operator<(const P &a, const P &b) { return a.d > b.d; }\nint main() {\n int r;\n while (cin >> r, r) {\n int w[2], h[2], sx[2], sy[2];\n int ba[2][500][500];\n rep(k, 2) {\n cin >> w[k] >> h[k] >> sx[k] >> sy[k];\n sx[k]--;\n sy[k]--;\n rep(y, h[k]) rep(x, w[k]) cin >> ba[k][x][y];\n }\n int table[2][250001];\n rep(k, 2) {\n priority_queue<P> Q;\n Q.push(P(1, sx[k], sy[k]));\n bool visited[w[k]][h[k]];\n memset(visited, 0, sizeof(visited));\n int nowd = 0;\n int cnt = 0;\n while (!Q.empty()) {\n P p = Q.top();\n int x = p.x;\n int y = p.y;\n Q.pop();\n if (visited[x][y])\n continue;\n nowd = max(nowd, p.d);\n table[k][++cnt] = nowd;\n if (cnt >= r)\n break;\n visited[x][y] = 1;\n rep(i, 4) {\n int xx = x + dx[i];\n int yy = y + dy[i];\n if (xx < 0 || xx >= w[k] || yy < 0 || yy >= h[k])\n continue;\n if (visited[xx][yy])\n continue;\n Q.push(P(ba[k][xx][yy], xx, yy));\n }\n }\n }\n int res = 1 << 29;\n for (int i = 0; i <= r; ++i) {\n if (i > w[0] * h[0] || r - i > w[1] * h[1])\n continue;\n res = min(res, table[0][i] + table[1][r - i]);\n }\n cout << res << endl;\n }\n}", "accuracy": 1, "time_ms": 180, "memory_kb": 6452, "score_of_the_acc": -0.7195, "final_rank": 13 }, { "submission_id": "aoj_0542_7937558", "code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <queue>\nusing namespace std;\nvoid reader(int *x) {\n int k = getchar_unlocked();\n *x = k - '0';\n while (1) {\n k = getchar_unlocked();\n if (k < '0' || k > '9')\n break;\n *x = ((*x) << 1) + ((*x) << 3) + k - '0';\n }\n}\nstruct state {\n int sx, sy, cost;\n};\nbool operator<(const state &s1, const state &s2) { return s1.cost < s2.cost; }\nint R, H[2], W[2], sx[2], sy[2], a[2][509][509], cnt[2], b[2][250009],\n vis[509][36];\nint dir[] = {0, 1, 0, -1};\nint main() {\n while (scanf(\"%d\", &R), R) {\n for (int i = 0; i < 2; i++) {\n scanf(\"%d%d%d%d\", &W[i], &H[i], &sy[i], &sx[i]);\n sy[i]--, sx[i]--;\n for (int j = 0; j < H[i]; j++) {\n for (int k = 0; k < W[i]; k++) {\n reader(&a[i][j][k]);\n }\n }\n priority_queue<state> que;\n que.push(state{sx[i], sy[i], -1});\n memset(vis, 0, sizeof(vis));\n vis[sx[i]][sy[i] >> 5] |= 1 << (sy[i] & 31);\n cnt[i] = 1;\n while (!que.empty()) {\n state u = que.top();\n que.pop();\n b[i][cnt[i]++] = a[i][u.sx][u.sy];\n for (int j = 0; j < 4; j++) {\n int tx = u.sx + dir[j], ty = u.sy + dir[j ^ 1];\n if (0 <= tx && tx < H[i] && 0 <= ty && ty < W[i] &&\n !(vis[tx][ty >> 5] & (1 << (ty & 31)))) {\n a[i][tx][ty] = max(a[i][tx][ty], a[i][u.sx][u.sy]);\n vis[tx][ty >> 5] |= 1 << (ty & 31);\n que.push(state{tx, ty, -a[i][tx][ty]});\n }\n }\n }\n }\n int ret = 2000000009;\n for (int i = 0; i <= H[0] * W[0]; i++) {\n int z = max(R - i, 0);\n if (z > H[1] * W[1])\n continue;\n ret = min(ret, b[0][i] + b[1][z]);\n }\n printf(\"%d\\n\", ret);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 7080, "score_of_the_acc": -0.2118, "final_rank": 5 }, { "submission_id": "aoj_0542_7937557", "code_snippet": "#include <algorithm>\n#include <cstdio>\n#include <cstring>\n#include <queue>\nusing namespace std;\nvoid reader(int *x) {\n int k = getchar_unlocked();\n *x = k - '0';\n while (1) {\n k = getchar_unlocked();\n if (k < '0' || k > '9')\n break;\n *x = ((*x) << 1) + ((*x) << 3) + k - '0';\n }\n}\nstruct state {\n int sx, sy, cost;\n};\nbool operator<(const state &s1, const state &s2) { return s1.cost < s2.cost; }\nint R, H[2], W[2], sx[2], sy[2], a[2][509][509], cnt[2], b[2][250009],\n vis[509][36];\nint dir[] = {0, 1, 0, -1};\nint main() {\n while (scanf(\"%d\", &R), R) {\n for (int i = 0; i < 2; i++) {\n scanf(\"%d%d%d%d\", &W[i], &H[i], &sy[i], &sx[i]);\n sy[i]--, sx[i]--;\n for (int j = 0; j < H[i]; j++) {\n for (int k = 0; k < W[i]; k++) {\n reader(&a[i][j][k]);\n }\n }\n priority_queue<state> que;\n que.push(state{sx[i], sy[i], -1});\n memset(vis, 0, sizeof(vis));\n vis[sx[i]][sy[i] >> 5] |= 1 << (sy[i] & 31);\n cnt[i] = 1;\n while (!que.empty()) {\n state u = que.top();\n que.pop();\n b[i][cnt[i]++] = a[i][u.sx][u.sy];\n if (cnt[i] > R)\n break;\n for (int j = 0; j < 4; j++) {\n int tx = u.sx + dir[j], ty = u.sy + dir[j ^ 1];\n if (0 <= tx && tx < H[i] && 0 <= ty && ty < W[i] &&\n !(vis[tx][ty >> 5] & (1 << (ty & 31)))) {\n a[i][tx][ty] = max(a[i][tx][ty], a[i][u.sx][u.sy]);\n vis[tx][ty >> 5] |= 1 << (ty & 31);\n que.push(state{tx, ty, -a[i][tx][ty]});\n }\n }\n }\n }\n int ret = 2000000009;\n for (int i = 0; i <= R && i <= H[0] * W[0]; i++) {\n int z = max(R - i, 0);\n if (z > H[1] * W[1])\n continue;\n ret = min(ret, b[0][i] + b[1][z]);\n }\n printf(\"%d\\n\", ret);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 5768, "score_of_the_acc": -0.0085, "final_rank": 1 }, { "submission_id": "aoj_0542_7937548", "code_snippet": "#include <cstring>\n#include <iostream>\n#include <queue>\n#include <vector>\nusing namespace std;\n#define fst first\n#define scd second\n#define PB push_back\n#define all(a) a.begin(), a.end()\n#define omajinai \\\n ios::sync_with_stdio(false); \\\n cin.tie(0)\n#define rep(i, x) for (int i = 0; i < (int)(x); ++i)\ntypedef pair<int, int> pii;\ntypedef vector<pii> vpii;\ntemplate <typename T> bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\nconst int inf = 1e9;\nint dy[] = {-1, 0, 1, 0};\nint dx[] = {0, -1, 0, 1};\nint R;\nint W[2], H[2];\nint X[2], Y[2];\nint A[2][502][502];\nbool used[502][502];\nvpii data[2];\nvoid bfs(int num) {\n typedef pair<int, pii> Data;\n memset(used, false, sizeof(used));\n priority_queue<Data> q;\n q.push(Data(-1, pii(Y[num], X[num])));\n used[Y[num]][X[num]] = true;\n if (num == 0) {\n data[num].PB(pii(1, 0));\n } else {\n data[num].PB(pii(0, 0));\n data[num].PB(pii(0, 1));\n }\n int ma = 1;\n int cnt = 0;\n while (q.size()) {\n Data p = q.top();\n q.pop();\n int cur = -p.fst;\n if (ma < cur) {\n if (num == 0) {\n data[num].back().scd = cnt;\n ma = cur;\n data[num].PB(pii(ma, 0));\n } else {\n data[num].back().fst = cnt;\n ma = cur;\n data[num].PB(pii(0, ma));\n }\n }\n cnt++;\n rep(i, 4) {\n int ny = p.scd.fst + dy[i], nx = p.scd.scd + dx[i];\n if (ny < 0 || ny >= H[num] || nx < 0 || nx >= W[num] || used[ny][nx])\n continue;\n used[ny][nx] = true;\n q.push(Data(-A[num][ny][nx], pii(ny, nx)));\n }\n }\n if (num == 0) {\n data[num].back().scd = cnt;\n } else {\n data[num].back().fst = cnt;\n }\n}\nsigned main() {\n while (cin >> R, R) {\n data[0].clear();\n data[1].clear();\n rep(i, 2) {\n cin >> W[i] >> H[i] >> X[i] >> Y[i];\n --X[i], --Y[i];\n rep(j, H[i]) rep(k, W[i]) { cin >> A[i][j][k]; }\n }\n bfs(0);\n bfs(1);\n int mi = inf;\n data[1].PB(pii(inf, inf));\n rep(i, data[0].size()) {\n pii a = data[0][i];\n chmin(mi, a.fst + lower_bound(all(data[1]), pii(R - a.scd, -inf))->scd);\n }\n cout << mi << endl;\n }\n}", "accuracy": 1, "time_ms": 190, "memory_kb": 7552, "score_of_the_acc": -0.7875, "final_rank": 15 }, { "submission_id": "aoj_0542_7937532", "code_snippet": "#include <cstring>\n#include <iostream>\n#include <queue>\n#include <vector>\nusing namespace std;\n#define fst first\n#define scd second\n#define PB push_back\n#define all(a) a.begin(), a.end()\n#define omajinai \\\n ios::sync_with_stdio(false); \\\n cin.tie(0)\n#define rep(i, x) for (int i = 0; i < (int)(x); ++i)\ntypedef pair<int, int> pii;\ntypedef vector<pii> vpii;\ntemplate <typename T> bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\nconst int inf = 1e9;\nint dy[] = {-1, 0, 1, 0};\nint dx[] = {0, -1, 0, 1};\nint R;\nint W[2], H[2];\nint X[2], Y[2];\nint A[2][502][502];\nbool used[502][502];\nvpii data[2];\nvoid bfs(int num) {\n typedef pair<int, pii> Data;\n memset(used, false, sizeof(used));\n priority_queue<Data> q;\n q.push(Data(-1, pii(Y[num], X[num])));\n used[Y[num]][X[num]] = true;\n if (num == 0) {\n data[num].PB(pii(1, 0));\n } else {\n data[num].PB(pii(0, 0));\n data[num].PB(pii(0, 1));\n }\n int ma = 1;\n int cnt = 0;\n while (q.size()) {\n Data p = q.top();\n q.pop();\n int cur = -p.fst;\n if (ma < cur) {\n if (num == 0) {\n data[num].back().scd = cnt;\n ma = cur;\n data[num].PB(pii(ma, 0));\n } else {\n data[num].back().fst = cnt;\n ma = cur;\n data[num].PB(pii(0, ma));\n }\n }\n cnt++;\n rep(i, 4) {\n int ny = p.scd.fst + dy[i], nx = p.scd.scd + dx[i];\n if (ny < 0 || ny >= H[num] || nx < 0 || nx >= W[num] || used[ny][nx])\n continue;\n used[ny][nx] = true;\n q.push(Data(-A[num][ny][nx], pii(ny, nx)));\n }\n }\n if (num == 0) {\n data[num].back().scd = cnt;\n } else {\n data[num].back().fst = cnt;\n }\n}\nsigned main() {\n omajinai;\n while (cin >> R, R) {\n data[0].clear();\n data[1].clear();\n rep(i, 2) {\n cin >> W[i] >> H[i] >> X[i] >> Y[i];\n --X[i], --Y[i];\n rep(j, H[i]) rep(k, W[i]) { cin >> A[i][j][k]; }\n }\n bfs(0);\n bfs(1);\n int mi = inf;\n data[1].PB(pii(inf, inf));\n rep(i, data[0].size()) {\n pii a = data[0][i];\n chmin(mi, a.fst + lower_bound(all(data[1]), pii(R - a.scd, -inf))->scd);\n }\n cout << mi << endl;\n }\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 7692, "score_of_the_acc": -0.3559, "final_rank": 11 }, { "submission_id": "aoj_0542_7937520", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < n; i++)\nusing namespace std;\nint ans[2][100001], w, h, x, y, f[500][500];\nint dx[]{1, -1, 0, 0}, dy[]{0, 0, 1, -1};\nbool used[500][500];\nstruct st {\n int x, y, c;\n};\nbool operator<(st a, st b) { return a.c > b.c; }\nint main() {\n int r;\n while (scanf(\"%d\", &r), r) {\n fill(ans[0], ans[2], INT_MAX);\n rep(i, 2) {\n memset(used, 0, sizeof(used));\n ans[i][0] = 0;\n scanf(\"%d%d%d%d\", &w, &h, &y, &x);\n x--;\n y--;\n rep(j, h) rep(k, w) scanf(\"%d\", &f[j][k]);\n priority_queue<st> que;\n que.push({x, y, 1});\n used[x][y] = true;\n int cnt = 0, Max = 0;\n while (!que.empty()) {\n st s = que.top();\n que.pop();\n cnt++;\n Max = max(Max, s.c);\n ans[i][cnt] = min(ans[i][cnt], Max);\n if (cnt >= r)\n break;\n rep(j, 4) {\n int nx = s.x + dx[j], ny = s.y + dy[j];\n if (0 <= nx && nx < h && 0 <= ny && ny < w && !used[nx][ny]) {\n used[nx][ny] = true;\n que.push({nx, ny, f[nx][ny]});\n }\n }\n }\n for (int j = r - 1; j > 0; j--)\n ans[i][j] = min(ans[i][j], ans[i][j + 1]);\n }\n int Min = INT_MAX;\n rep(i, r + 1) {\n if (ans[0][i] == INT_MAX || ans[1][r - i] == INT_MAX)\n continue;\n Min = min(Min, ans[0][i] + ans[1][r - i]);\n }\n printf(\"%d\\n\", Min);\n }\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 5388, "score_of_the_acc": -0.1739, "final_rank": 4 }, { "submission_id": "aoj_0542_6899438", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\n#include <random>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\nusing tii = tuple<int, int, int>;\nusing pii = pair<int, int>;\n\nint seclv[2][510][510];\nint passlv[2][510][510];\nconst int dx[4] = { 1, 0, -1, 0 };\nconst int dy[4] = { 0, 1, 0, -1 };\n\nint main()\n{\n int r;\n while(cin >> r, r){\n vi<int> w(2), h(2), x(2), y(2);\n const int inf = 1e9;\n rep(idx, 2) {\n cin >> w[idx] >> h[idx] >> y[idx] >> x[idx];\n x[idx]--, y[idx]--;\n rep(i, h[idx]) rep(j, w[idx]) cin >> seclv[idx][i][j];\n rep(i, h[idx]) rep(j, w[idx]) passlv[idx][i][j] = inf; \n }\n \n rep(idx, 2) {\n priority_queue<tii, vi<tii>, greater<tii>> pq;\n pq.push({ 1, x[idx], y[idx] });\n passlv[idx][x[idx]][y[idx]] = 1;\n int now = 1;\n int num, sx, sy;\n while (!pq.empty()) {\n tie(num, sx, sy) = pq.top();\n pq.pop();\n //cout << num << ' ' << sx << ' ' << sy << endl;\n if (passlv[idx][sx][sy] < num) continue;\n if (num > now) now = num;\n rep(i, 4) {\n int nx = sx + dx[i];\n int ny = sy + dy[i];\n if (nx < 0 || nx >= h[idx] || ny < 0 || ny >= w[idx]) continue;\n int tp = max(now, seclv[idx][nx][ny]);\n if (passlv[idx][nx][ny] <= tp) continue;\n passlv[idx][nx][ny] = tp;\n pq.push({ tp, nx, ny });\n }\n }\n }\n \n vi<map<int, int>> mp(2);\n vii<pii> d(2);\n rep(idx, 2) {\n rep(i, h[idx]) rep(j, w[idx]) mp[idx][passlv[idx][i][j]]++;\n \n d[idx].push_back({ 0, 0 });\n for (auto elem : mp[idx]) {\n d[idx].push_back({ d[idx].back().first + elem.second, elem.first });\n }\n }\n \n int ans = inf;\n {\n int ld0 = d[0].size();\n int ld1 = d[1].size();\n int pos = 0; \n for (int i = ld0 - 1; i >= 0; i--) {\n while (pos < ld1 && d[0][i].first + d[1][pos].first < r) pos++;\n if (pos == ld1) break;\n ans = min(ans, d[0][i].second + d[1][pos].second); \n }\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 230, "memory_kb": 19668, "score_of_the_acc": -1.2324, "final_rank": 18 }, { "submission_id": "aoj_0542_6331196", "code_snippet": "#include <bits/stdc++.h>\n#define all(v) v.begin(), v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)\n#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)\n#define codefor int test;scanf(\"%d\",&test);while(test--)\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define yes(ans) if(ans)printf(\"yes\\n\");else printf(\"no\\n\")\n#define Yes(ans) if(ans)printf(\"Yes\\n\");else printf(\"No\\n\")\n#define YES(ans) if(ans)printf(\"YES\\n\");else printf(\"NO\\n\")\n#define popcount(v) __builtin_popcountll(v)\n#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\n#define vector4d(type,name,h,w,d,...) vector<vector<vector<vector<type>>>>name(h,vector<vector<vector<type>>>(w,vector<vector<type>>(d,vector<type>(__VA_ARGS__))))\nusing namespace std;\nusing ll = long long;\ntemplate<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;\nconst int MOD=1000000007;\nconst int MOD2=998244353;\nconst int INF=1<<30;\nconst ll INF2=1LL<<60;\nvoid scan(int& a){scanf(\"%d\",&a);}\nvoid scan(long long& a){scanf(\"%lld\",&a);}\ntemplate<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}\ntemplate<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}\ntemplate<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i);}\ntemplate<class T> void scan(T& a){cin>>a;}\ntemplate<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}\nvoid print(const int& a){printf(\"%d\",a);}\nvoid print(const long long& a){printf(\"%lld\",a);}\nvoid print(const double& a){printf(\"%.15lf\",a);}\ntemplate<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}\ntemplate<class T> void print(const T& a){cout<<a;}\ntemplate<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}\nvoid out(){putchar('\\n');}\ntemplate<class T> void out(const T& t){print(t);putchar('\\n');}\ntemplate <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}\ntemplate<class T> void dprint(const T& a){cerr<<a;}\ntemplate<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<\" \"<<*it;}}\nvoid debug(){cerr<<endl;}\ntemplate<class T> void debug(const T& t){dprint(t);cerr<<endl;}\ntemplate <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<\" \";debug(tail...);}\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\nll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}\nll updivide(ll a,ll b){return (a+b-1)/b;}\nint msb(ll v){return 63-__builtin_clzll(v);}\ntemplate<class T> void chmax(T &a,const T b){if(b>a)a=b;}\ntemplate<class T> void chmin(T &a,const T b){if(b<a)a=b;}\n\ntemplate<class T> struct compressed_array{\n int N;\n vector<T> dat;\n const T operator[](int i) const { return dat[i]; }\n T operator[](int i) { return dat[i]; }\n compressed_array(){}\n compressed_array(vector<int> &a){\n dat=a;\n }\n void build(){\n sort(dat.begin(), dat.end());\n dat.erase(unique(dat.begin(), dat.end()), dat.end());\n N = dat.size();\n }\n int size(){return N;}\n void insert(const T v){\n dat.push_back(v);\n }\n void insert(vector<T> &a){\n for(int i = 0; i < a.size() ; i++)dat.push_back(a[i]);\n }\n //type1でfirst,type2でsecond\n void insert(vector<pair<T, T>> &a, int type){\n if(type==1){\n for(int i = 0; i < a.size(); i++)dat.push_back(a[i].first);\n }else{\n for(int i = 0; i < a.size(); i++)dat.push_back(a[i].second);\n }\n }\n template<size_t size> void insert(vector<array<T,size>> &a, int pos){\n assert(0 <= pos && pos < size);\n for(int i = 0; i < a.size() ; i++){\n dat.push_back(a[i][pos]);\n }\n }\n int load(T &v){\n return lower_bound(dat.begin(), dat.end(), v) - dat.begin();\n }\n void load(vector<T> &a){\n for(int i = 0; i < a.size() ; i++)a[i] = load(a[i]);\n }\n void load(vector<pair<T, T>> &a, int type){\n if(type==1){\n for(int i = 0; i < a.size(); i++)a[i].first = load(a[i].first);\n }else{\n for(int i = 0; i < a.size(); i++)a[i].second = load(a[i].second);\n }\n }\n template<size_t size> void load(vector<array<T,size>> &a, int pos){\n assert(0 <= pos && pos < size);\n for(int i = 0; i < a.size() ; i++){\n a[i][pos] = load(a[i][pos]);\n }\n }\n};\n\nstruct dsu {\n public:\n dsu() : _n(0) {}\n dsu(int n) : _n(n), parent_or_size(n, -1) {}\n\n int merge(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n int x = leader(a), y = leader(b);\n if (x == y) return x;\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\n parent_or_size[x] += parent_or_size[y];\n parent_or_size[y] = x;\n return x;\n }\n\n bool same(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n return leader(a) == leader(b);\n }\n\n int leader(int a) {\n assert(0 <= a && a < _n);\n if (parent_or_size[a] < 0) return a;\n return parent_or_size[a] = leader(parent_or_size[a]);\n }\n\n int size(int a) {\n assert(0 <= a && a < _n);\n return -parent_or_size[leader(a)];\n }\n\n std::vector<std::vector<int>> groups() {\n std::vector<int> leader_buf(_n), group_size(_n);\n for (int i = 0; i < _n; i++) {\n leader_buf[i] = leader(i);\n group_size[leader_buf[i]]++;\n }\n std::vector<std::vector<int>> result(_n);\n for (int i = 0; i < _n; i++) {\n result[i].reserve(group_size[i]);\n }\n for (int i = 0; i < _n; i++) {\n result[leader_buf[i]].push_back(i);\n }\n result.erase(\n std::remove_if(result.begin(), result.end(),\n [&](const std::vector<int>& v) { return v.empty(); }),\n result.end());\n return result;\n }\n\n private:\n int _n;\n // root node: -1 * component size\n // otherwise: parent\n std::vector<int> parent_or_size;\n};\n\nint main(){\n while(1){\n INT(R);\n if(!R)return 0;\n INT(w1,h1,x1,y1);\n compressed_array<int> ca;\n vector2d(int,A,h1,w1);\n in(A);\n INT(w2,h2,x2,y2);\n vector2d(int,B,h2,w2);\n in(B);\n x1--,y1--,x2--,y2--;\n vector<int> t1(h1*w1+1,INF),t2(h2*w2+1,INF);\n vector2d(bool,used1,h1,w1,false);\n vector2d(bool,used2,h2,w2,false);\n rep(y,h1)ca.insert(A[y]);\n rep(y,h2)ca.insert(B[y]);\n ca.build();\n vector<vector<pair<int,int>>> At(ca.size()),Bt(ca.size());\n rep(y,h1){\n ca.load(A[y]);\n rep(x,w1)At[A[y][x]].emplace_back(y,x);\n }\n rep(y,h2){\n ca.load(B[y]);\n rep(x,w2)Bt[B[y][x]].emplace_back(y,x);\n }\n dsu uf1(h1*w1),uf2(h2*w2);\n for(int i=0,y,x;i<ca.size();i++){\n for(auto p:At[i]){\n tie(y,x)=p;\n used1[y][x]=true;\n for(int j=0;j<4;j++){\n int dy=(j==0)-(j==1);\n int dx=(j==2)-(j==3);\n if(y+dy<0||x+dx<0||y+dy>=h1||x+dx>=w1)continue;\n if(!used1[y+dy][x+dx])continue;\n uf1.merge(y*w1+x,(y+dy)*w1+x+dx);\n }\n }\n chmin(t1[uf1.size(y1*w1+x1)],ca[i]);\n for(auto p:Bt[i]){\n tie(y,x)=p;\n used2[y][x]=true;\n for(int j=0;j<4;j++){\n int dy=(j==0)-(j==1);\n int dx=(j==2)-(j==3);\n if(y+dy<0||x+dx<0||y+dy>=h2||x+dx>=w2)continue;\n if(!used2[y+dy][x+dx])continue;\n uf2.merge(y*w2+x,(y+dy)*w2+x+dx);\n }\n }\n chmin(t2[uf2.size(y2*w2+x2)],ca[i]);\n }\n t1[0]=0,t2[0]=0;\n for(int i=h1*w1;i>=1;i--)chmin(t1[i-1],t1[i]);\n for(int i=h2*w2;i>=1;i--)chmin(t2[i-1],t2[i]);\n //debug(t1);\n //debug(t2);\n int ans=INF;\n for(int i=0;i<=h1*w1;i++){\n int j=R-i;\n if(j>h2*w2||j<0)continue;\n chmin(ans,t1[i]+t2[j]);\n }\n out(ans);\n }\n}", "accuracy": 1, "time_ms": 220, "memory_kb": 50096, "score_of_the_acc": -1.8696, "final_rank": 20 } ]
aoj_0547_cpp
通勤経路 問題 JOIさんが住むカナダのある都市は，南北方向にまっすぐに伸びる w 本の道路と，東西方向にまっすぐに伸びる h 本の道路により，碁盤の目の形に区分けされている． 南北方向の w 本の道路には，西から順に 1, 2, ... , w の番号が付けられている．また，東西方向の h 本の道路には，南から順に 1, 2, ... , h の番号が付けられている．西から i 番目の南北方向の道路と，南から j 番目の東西方向の道路が交わる交差点を (i, j) で表す． JOIさんは，交差点 (1, 1) の近くに住んでおり，交差点 (w, h) の近くの会社に車で通っている．車は道路に沿ってのみ移動することができる．JOIさんは，通勤時間を短くするため，東または北にのみ向かって移動して通勤している．また，この都市では，交通事故を減らすために，次のような交通規則が設けられている： 交差点を曲がった車は，その直後の交差点で曲がることは出来ない． すなわち，交差点で曲がったあとに1ブロックだけ進んで再び曲がることは許されない．このとき，JOIさんの通勤経路は何通り考えられるだろうか． w と h が与えられたとき，JOIさんの通勤経路の個数を 100000 で割った余りを出力するプログラムを作成せよ． 入力 入力は複数のデータセットからなる．各データセットは1行からなり，空白を区切りとして2個の整数 w, h (2 ≤ w ≤ 100， 2 ≤ h ≤ 100) が書かれている．w は南北方向の道路の本数， h は東西方向の道路の本数を表す． w, h がともに 0 のとき入力の終了を示す.データセットの数は 5 を超えない． 出力 データセットごとに，JOIさんの通勤経路の個数を 100000 で割った余りを1行に出力する． 入出力例 入力例 3 4 15 15 0 0 出力例 5 43688 1つ目の入力例におけるJOIさんの通勤経路 ( 5 通り) 1つ目の入力例において，JOIさんの通勤経路は図のように 5 通り考えられる．したがって，5を出力する． 2つ目の入力例において，JOIさんの通勤経路は 143688 通り考えられる．したがって，143688 を 100000 で割った余りである 43688 を出力する． 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0547_3813319", "code_snippet": "#include <bits/stdc++.h>\n#define loop(n) for (int ngtkana_is_geneous = 0; ngtkana_is_geneous < n; ngtkana_is_geneous++)\n#define rep(i, begin, end) for(int i = begin; i < end; i++)\n\n#define LOCAL\nusing std::to_string;\nauto to_string(std::string s) -> std::string {\n return '\"' + s + '\"';\n}\nauto to_string(char c) -> std::string {\n return \"'\" + std::string{c} + \"'\";\n}\nauto to_string(const char* s) -> std::string {\n return to_string((std::string) s);\n}\nauto to_string(bool b) -> std::string {\n return (b ? \"true\" : \"false\");\n}\ntemplate <typename T, typename U>\nauto to_string(std::pair<T, U> p) -> std::string {\n return \"(\" + to_string(p.first) + \", \" + to_string(p.second) + \")\";\n}\ntemplate <size_t N>\nauto to_string(std::bitset<N> bs) -> std::string {\n std::string res{};\n for (size_t i = 0; i < N; i++)\n res.insert(res.begin(), bs.test(i) ? '1' : '0');\n return res;\n}\ntemplate <typename T>\nauto to_string(T v) -> std::string {\n bool flg = false;\n std::string res = \"{\";\n for (auto const&x : v) {\n if (flg) res += \", \";\n else flg = true;\n res += to_string(x);\n }\n res += \"}\";\n return res;\n}\nvoid debug_out() { std::cerr << std::endl; }\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head H, Tail... T) {\n std::cerr << \" \" << to_string(H);\n debug_out(T...);\n}\n#ifdef LOCAL\n#define debug(...) std::cerr << \"[\" << #__VA_ARGS__ << \"]:\", debug_out(__VA_ARGS__)\n#else\n#define debug(...) 42\n#endif\n\ntemplate <typename T>\nT inverse(T a, T m) {\n T u = 0, v = 1;\n while (a != 0) {\n T t = m / a;\n m -= t * a; std::swap(a, m);\n u -= t * v; std::swap(u, v);\n }\n assert(m == 1);\n return u;\n}\ntemplate <typename T>\nclass modular {\n private:\n int value;\n public:\n constexpr modular() = default;\n constexpr modular(const modular&) = default;\n constexpr modular(modular&&) = default;\n modular& operator=(const modular&) = default;\n modular& operator=(modular&&) = default;\n\n template <typename U>\n modular (const U& x) {value = normalize(x);}\n\n template <typename U>\n static auto normalize(const U& x) {\n int v = static_cast<int>(-mod() <= x && x < mod() ? x : x % mod());\n if (v < 0) v += mod();\n return v;\n }\n\n auto const& operator()() const { return value; }\n template <typename U>\n explicit operator U() const { return static_cast<U>(value); }\n constexpr static auto mod() { return T::value; }\n\n auto& operator+=(const modular& other) {\n if ((value += other.value) >= mod()) value -= mod();\n return *this;\n }\n auto& operator-=(const modular& other) {\n if ((value -= other.value) < 0) value += mod();\n return *this;\n }\n template <typename U>\n auto& operator+=(const U& other) {return *this += modular(other); }\n template <typename U>\n auto& operator-=(const U& other) {return *this -= modular(other); }\n auto operator-() const { return modular(-value); }\n auto& operator++() {return *this += 1;}\n auto& operator--() {return *this -= 1;}\n auto operator++(int) {modular result(*this); operator++(); return result;}\n auto operator--(int) {modular result(*this); operator--(); return result;}\n \n template <typename U = T>\n auto& operator*=(const modular& rhs) {\n value = normalize(static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value));\n return *this;\n }\n auto& operator/=(const modular& other) {\n return *this *= modular(inverse(other.value, mod()));\n }\n};\ntemplate <typename T> struct is_modular : std::false_type {};\ntemplate <typename T> struct is_modular <modular<T>> : std::true_type{};\ntemplate <typename T> constexpr bool is_modular_v = is_modular<T>::value;\n\ntemplate <typename T> bool operator==(const modular<T>& lhs, const modular<T>& rhs) { return lhs.value == rhs.value; }\ntemplate <typename T, typename U> bool operator==(const modular<T>& lhs, U rhs) { return lhs == modular<T>(rhs); }\ntemplate <typename T, typename U> bool operator==(U lhs, const modular<T>& rhs) { return modular<T>(lhs) == rhs; }\n\ntemplate <typename T> bool operator!=(const modular<T>& lhs, const modular<T>& rhs) { return !(lhs == rhs); }\ntemplate <typename T, typename U> bool operator!=(const modular<T>& lhs, U rhs) { return !(lhs == rhs); }\ntemplate <typename T, typename U> bool operator!=(U lhs, const modular<T>& rhs) { return !(lhs == rhs); }\n\ntemplate <typename T> modular<T> operator+(const modular<T>& lhs, const modular<T>& rhs) { return modular<T>(lhs) += rhs; }\ntemplate <typename T, typename U> modular<T> operator+(const modular<T>& lhs, U rhs) { return modular<T>(lhs) += rhs; }\ntemplate <typename T, typename U> modular<T> operator+(U lhs, const modular<T>& rhs) { return modular<T>(lhs) += rhs; }\n\ntemplate <typename T> modular<T> operator-(const modular<T>& lhs, const modular<T>& rhs) { return modular<T>(lhs) -= rhs; }\ntemplate <typename T, typename U> modular<T> operator-(const modular<T>& lhs, U rhs) { return modular<T>(lhs) -= rhs; }\ntemplate <typename T, typename U> modular<T> operator-(U lhs, const modular<T>& rhs) { return modular<T>(lhs) -= rhs; }\n\ntemplate <typename T> modular<T> operator*(const modular<T>& lhs, const modular<T>& rhs) { return modular<T>(lhs) *= rhs; }\ntemplate <typename T, typename U> modular<T> operator*(const modular<T>& lhs, U rhs) { return modular<T>(lhs) *= rhs; }\ntemplate <typename T, typename U> modular<T> operator*(U lhs, const modular<T>& rhs) { return modular<T>(lhs) *= rhs; }\n\ntemplate <typename T> modular<T> operator/(const modular<T>& lhs, const modular<T>& rhs) { return modular<T>(lhs) /= rhs; }\ntemplate <typename T, typename U> modular<T> operator/(const modular<T>& lhs, U rhs) { return modular<T>(lhs) /= rhs; }\ntemplate <typename T, typename U> modular<T> operator/(U lhs, const modular<T>& rhs) { return modular<T>(lhs) /= rhs; }\n\ntemplate<typename T, typename U>\nmodular<T> pow (const modular<T>& a, U b) {\n assert(b >= 0);\n modular<T> x = a, ret = 1;\n for (; b > 0; b /= 2) {\n if (b % 2 == 1) ret *= x;\n x *= x;\n }\n return ret;\n}\n\ntemplate <typename T>\nstd::string to_string(const modular<T>& a) {\n return std::to_string(a());\n}\ntemplate <typename T>\nauto operator<<(std::ostream& os, const T& a)\n -> std::enable_if_t<is_modular_v<T>, std::ostream&>{\n return os << a();\n }\ntemplate <typename T>\nauto operator>>(std::istream& is, T& a)\n -> std::enable_if_t<is_modular_v<T>, std::istream&> {\n long long x; is >> x;\n a = T(x);\n return is;\n}\n\n/*\nusing ModType = int;\n\nstruct VarMod { static ModType value; };\nModType VarMod::value;\nModType& md = VarMod::value;\nusing Mint = Modular<VarMod>;\n*/\n\ntemplate <typename T>\nauto make_vector(size_t sz, T t) {\n return std::vector<T>(sz, t);\n}\ntemplate <size_t N, typename T, typename U, std::enable_if_t<\n N == 1, std::nullptr_t> = nullptr>\nauto make_higher_vector(size_t sz, U u) {\n return make_vector(sz, T(u));\n}\ntemplate <size_t N, typename T, std::enable_if_t<\n N == 1, std::nullptr_t> = nullptr>\nauto make_higher_vector(size_t sz) {\n return std::vector<T>(sz);\n}\ntemplate <size_t N, typename T, typename... Args, std::enable_if_t<\n N != 1, std::nullptr_t> = nullptr>\nauto make_higher_vector(size_t a, Args... args) {\n return make_vector(a, make_higher_vector<N - 1, T>(args...));\n}\ntemplate <typename T, typename Size_t>\nauto& at(T& t, Size_t i) {\n return t.at(i);\n}\ntemplate <typename T, typename Size_t, typename... Args>\nauto& at(T& t, Size_t i, Args... args) {\n return at(t.at(i), args...);\n}\n\nconstexpr int md = 100'000;\nusing mint = modular<std::integral_constant<std::decay_t<decltype(md)>, md>>;\n\n\nint main()\n{\n std::cin.tie(0); std::cin.sync_with_stdio(false);\n while (true)\n {\n int h, w; std::cin >> h >> w;\n if (h == 0 && w == 0) return 0;\n h--, w--;\n auto dp = make_higher_vector<2, mint>(h + 1, w + 1, 0);\n auto ep = make_higher_vector<2, mint>(w + 1, h + 1, 0);\n rep(i, 0, h + 1) at(dp, i, 0) = 1;\n rep(j, 0, w + 1) at(ep, j, 0) = 1;\n rep(i, 1, h + 1) rep(j, 1, w + 1)\n {\n rep(k, 0, i - 1) at(dp, i, j) += at(ep, j, k);\n rep(k, 0, j - 1) at(ep, j, i) += at(dp, i, k);\n }\n at(dp, h, w) += at(ep, w, h - 1);\n at(ep, w, h) += at(dp, h, w - 1);\n std::cout << at(dp, h, w) + at(ep, w, h) << std::endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3316, "score_of_the_acc": -0.0934, "final_rank": 1 }, { "submission_id": "aoj_0547_2463342", "code_snippet": "#include<iostream>\n#include<string>\n#include<cmath>\n#include<queue>\n#include<map>\n#include<set>\n#include<list>\n#include<random>\n#include<iomanip>\n#include<vector>\n#include<functional>\n#include<algorithm>\n#include<cstdio>\n#include<stdlib.h>\n#include<unordered_map>\n#include<time.h>\n#define rep(i,a,n) for (int (i)=(a);(i)<(n);(i)++)\n//#define int long long\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\nusing namespace std;\nint h, w;\nint dp[100][100][2][100];//???????¨??????±??????????????????????????§?????????????????\\??????\nint solve(int i, int j, bool dir, int dis) {\n\tif (i == h - 1 && j == w - 1)\n\t\treturn 1;\n\tif (dp[i][j][dir][dis] != -1)\n\t\treturn dp[i][j][dir][dis];\n\tint ans = 0;\n\tfor (int z = 0; z < 2; z++) {\n\t\tint x = (z == 0 ? i + 1 : i), y = (z == 1 ? j + 1 : j);\n\t\tif (x == h || y == w) continue;\n\t\tif (dis < 2 && (int)dir != z) continue;\n\t\tans += solve(x, y, z, z == (int)dir ? dis + 1 : 1);\n\t}\n\treturn (dp[i][j][dir][dis] = ans % 100000);\n}\nsigned main() {\n\twhile (cin >> w >> h&&w != 0 && h != 0) {\n\t\tfor (int i = 0; i < h; i++) {\n\t\t\tfor (int j = 0; j < w; j++) {\n\t\t\t\tfor (int dir = 0; dir < 2; dir++) {\n\t\t\t\t\tfor (int dis = 0; dis < 100; dis++)\n\t\t\t\t\t\tdp[i][j][dir][dis] = -1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << (solve(0, 1, 1, 2) + solve(1, 0, 0, 2)) % 100000 << endl;\n\t}\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 10896, "score_of_the_acc": -1.3899, "final_rank": 5 }, { "submission_id": "aoj_0547_1642647", "code_snippet": "#include<bits/stdc++.h>\n#define FOR(i,a,b) for(int i=a;i<=b;++i)\n#define LL long long\nstatic const LL INF = 1<<24;\nstatic const LL LL_INF = 1<<60;\nstatic const int mod = 1e+5;\nstatic const int MAX_N = 200;\nint dx[]={0,1};\nint dy[]={1,0};\nusing namespace std;\n\n\nint w,h;\nLL mem[MAX_N][MAX_N][3][3][3][3];\nLL cal(int x,int y,int px,int py,int ppx,int ppy){\n LL res=0;\n if(mem[x][y][px][py][ppx][ppy]!=0)return mem[x][y][px][py][ppx][ppy];\n if(x>=w||y>=h)return 0;\n if(x==w-1&&y==h-1)return 1;\n FOR(i,0,1){\n if(x==0&&y==0)res+=cal(x+dx[i],y+dy[i],dx[i],dy[i],px,py);\n else{\n if(px!=ppx&&py!=ppy&&px!=dx[i]&&py!=dy[i])continue;\n res+=cal(x+dx[i],y+dy[i],dx[i],dy[i],px,py)%mod;\n }\n }\n return mem[x][y][px][py][ppx][ppy]=res%mod;\n}\n\nint main(){\n while(1){\n memset(mem,0,sizeof(mem));\n cin>>w>>h;\n if(w==0&&h==0)break;\n cout<<cal(0,0,0,0,0,0)<<endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 26496, "score_of_the_acc": -1, "final_rank": 3 }, { "submission_id": "aoj_0547_528467", "code_snippet": "#include <cstdio>\n#include <algorithm>\nusing namespace std;\nlong long mod(long long a){\n\treturn a%100000;\n}\nlong long dp[101][101][101][2]={},ans=0;/*0が縦、1が横*/\nint main(){\n\t\twhile(1){\n\t\t\tfor(int i=0;i<101;i++){\n\t\t\t\tfor(int j=0;j<101;j++){\n\t\t\t\t\tfor(int k=0;k<101;k++){\n\t\t\t\t\t\tfor(int h=0;h<2;h++){\n\t\t\t\t\t\t\tdp[i][j][k][h]=0;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\tint c,d;\n\t\tscanf(\"%d %d\",&c,&d);\n\t\tif(c==0){\n\t\t\tbreak;\n\t\t}\n\tfor(int i=2;i<101;i++){\n\t\tdp[1][i][i-1][0]=1;\n\t}\n\tfor(int i=2;i<101;i++){\n\t\tdp[i][1][i-1][1]=1;\n\t}\n\tfor(int i=2;i<c+1;i++){\n\t\tfor(int j=2;j<d+1;j++){\n\t\t\tfor(int h=1;h<max(i,j);h++){\n\t\t\t\tif(h!=1){\n\t\t\t\t\tdp[i][j][h][0]=mod(dp[i][j-1][h-1][0]);\n\t\t\t\t\tdp[i][j][h][1]=mod(dp[i-1][j][h-1][1]);\n\t\t\t\t}else{\n\t\t\t\t\tif(i==2 && j==2){\n\t\t\t\t\t\tdp[2][2][1][0]=1;\n\t\t\t\t\t\tdp[2][2][1][1]=1;\n\t\t\t\t\t}else{\n\t\t\t\t\t\tfor(int y=2;y<=max(i,j-1);y++){\n\t\t\t\t\t\t\tdp[i][j][h][0]+=mod(dp[i][j-1][y][1]);\n\t\t\t\t\t\t\tdp[i][j][h][1]+=mod(dp[i-1][j][y][0]);\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\tfor(int y=1;y<=max(c,d);y++){\n\t\tans+=mod(dp[c][d][y][0])+mod(dp[c][d][y][1]);\n\t\tans=mod(ans);\n\t}\n\tprintf(\"%lld\\n\",mod(ans));\n ans=0;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 17124, "score_of_the_acc": -1.1334, "final_rank": 4 }, { "submission_id": "aoj_0547_228984", "code_snippet": "#include<vector>\n#include<list>\n#include<algorithm>\n#include<iostream>\n#include<string>\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\nusing namespace std;\nint f(int a[][100][100],int x,int y,int w,int h,int p,int q){\n if(x==w||y==h)\n return (p&1)==(q&1)||(p&2)==(q&2);\n else{\n if((p&1)==(q&1)||(p&2)==(q&2))\n return (f(a,x+1,y,w,h,1,p)+f(a,x,y+1,w,h,2,p))%100000;\n else{\n if(a[(p-1+(w-x>h-y))%2][w-x<h-y?w-x:h-y][w-x>h-y?w-x:h-y]==0)\n\ta[(p-1+(w-x>h-y))%2][w-x<h-y?w-x:h-y][w-x>h-y?w-x:h-y]=f(a,x+!!(p&1),y+!!(p&2),w,h,p,p);\n return a[(p-1+(w-x>h-y))%2][w-x<h-y?w-x:h-y][w-x>h-y?w-x:h-y];\n }\n }\n}\nint main(){\n int a[3][100][100],w,h;\n memset(a,0,sizeof(a));\n for(h=2;h<101;h++)\n for(w=h;w<101;w++)\n a[2][h][w]=f(a,1,1,h,w,3,3);\n while(cin>>w>>h&&w+h)\n cout<<a[2][w<h?w:h][w>h?w:h]<<endl;\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 928, "score_of_the_acc": -0.5, "final_rank": 2 } ]
aoj_0539_cpp
ピザ 問題 JOI ピザでは,市の中心部を通る全長 d メートルの環状線の沿線上でピザの宅配販 売を行っている. JOI ピザは,環状線上に n 個の店舗 S 1 , ... , S n を持つ.本店は S 1 である. S 1 から S i まで,時計回りに環状線を移動したときの道のりを d i メートルとおく. d 2 , ... , d n は 1 以上 d - 1 以下の整数である. d 2 , ... , d n は全て異なる. ピザの注文を受けると, ピザが冷めないように, 宅配先までの移動距離がもっとも短い店舗でピザを焼き宅配する. 宅配先の位置は 0 以上 d - 1 以下の整数 k で表される.これは, 本店 S 1 から宅配先までに時計回りで環状線を移動したときの道のりが k メートルであることを意味する. ピザの宅配は環状線に沿って行われ, それ以外の道を通ることは許されない. ただし, 環状線上は時計回りに移動しても反時計回りに移動してもよい. 例えば,店舗の位置と宅配先の位置が下図のようになっている場合 (この例は「入出力の例」の例 1 と対応している), 宅配先 1 にもっとも近い店舗は S 2 なので, 店舗 S 2 から宅配する.このとき, 店舗からの移動距離は 1 である.また, 宅配先 2 にもっとも近い店舗は S 1 (本店) なので, 店舗 S 1 (本店) から宅配する.このとき,店舗からの移動距離は 2 である. 環状線の全長 d , JOI ピザの店舗の個数 n , 注文の個数 m , 本店以外の位置を表す n - 1 個の整数 d 2 , ... , d n , 宅配先の場所を表す整数 k 1 , ... , k m が与えられたとき, 各注文に対する宅配時の移動距離 (すなわち,最寄店舗から宅配先までの道のり) の全注文にわたる総和を求めるプログラムを作成せよ. 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる． 1 行目には環状線の全長を表す正整数 d (2 ≤ d ≤ 1000000000 = 10 9 ), 2 行目には店舗の個数を表す正整数 n (2 ≤ n ≤ 100000), 3 行目には注文の個数を表す正整数 m (1 ≤ m ≤ 10000) が書かれている. 4 行目以降の n - 1 行には本店以外の店舗の位置を表す整数 d 2 , d 3 , ... , d n (1 ≤ d i ≤ d - 1) がこの順に書かれており, n + 3 行目以降の m 行には宅配先の場所を表す整数 k 1 , k 2 , ... , k m (0 ≤ k i ≤ d - 1) がこの順に書かれている. 採点用データのうち,配点の 40% 分については, n ≤ 10000 を満たす. また,配点の 40% 分については, 求める移動距離の総和と d の値はともに 1000000 以下である. さらに,全ての採点用データにおいて, 求める移動距離の総和は 1000000000 = 10 9 以下である. d が 0 のとき入力の終了を示す. データセットの数は 10 を超えない． 出力 データセットごとに,宅配時の移動距離の総和を表す 1 つの整数を1 行に出力する. 入出力例 入力例 8 3 2 3 1 4 6 20 4 4 12 8 16 7 7 11 8 0 出力例 3 3 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0539_10890669", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include<utility>\n#include<set>\n#include<deque>\n#include <unordered_map>\n#include<string>\n#include<map>\n#include<cmath>\n#include <unordered_set>\n\nusing namespace std;\n\nint main() {\n\twhile (true) {\n\t\tint d, n, m;\n\t\tcin >> d;\n\t\tif (d == 0)break;\n\t\tcin >> n >> m;\n\t\tvector<int>T(n);\n\t\tT[0] = 0;\n\t\tfor (int i = 1; i < n; i++) {\n\t\t\tcin >> T[i];\n\t\t}\n\n\t\tT.push_back(d);\n\n\n\t\tint sa = 0;\n\t\tsort(T.begin(), T.end());\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tint p;\n\t\t\tcin >> p;\n\t\t\tauto it = upper_bound(T.begin(), T.end(), p);\n\t\t\tint ind = it - T.begin();\n\n\t\t\tint ans = 0;\n\t\t\tans = min(abs(p - T[ind]), abs(p - T[ind - 1]));\n\n\t\t\tsa += ans;\n\t\t}\n\t\tcout << sa << endl;\n\t}\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3660, "score_of_the_acc": -0.2552, "final_rank": 8 }, { "submission_id": "aoj_0539_10851299", "code_snippet": "#include <stdio.h>\n#include <algorithm>\n#include <string.h>\n#include <queue>\nusing namespace std;\nint pos[110000];\nint erfen(int n, int x)\n{\n int l = 1, r = n, ans = 1;\n while(l<=r)\n {\n int mid = (l+r)/2;\n if(pos[mid]<=x)\n {\n ans = mid;\n l = mid+1;\n }\n else\n r = mid-1;\n }\n return ans;\n}\nint main()\n{\n int d, n, m;\n while(scanf(\"%d\", &d), d)\n {\n scanf(\"%d %d\", &n, &m);\n for(int i=1; i<n; i++)\n scanf(\"%d\", &pos[i]);\n\n sort(pos+1, pos+n);\n\n long long ans = 0;\n for(int i=1; i<=m; i++)\n {\n int x;\n scanf(\"%d\", &x);\n if(x<=pos[1])\n ans += min(pos[1]-x, x);\n else\n {\n int Index = erfen(n-1, x);\n if(Index == n-1)\n ans += min(x-pos[n-1], d-x);\n else\n ans += min(x-pos[Index], pos[Index+1]-x);\n }\n\n }\n\n printf(\"%lld\\n\", ans);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3188, "score_of_the_acc": 0, "final_rank": 1 }, { "submission_id": "aoj_0539_10525085", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n while(true){\n ll d;\n if(!(cin >> d)) return 0; // 入力終了\n if(d == 0) break;\n\n int n; \n cin >> n;\n int m; \n cin >> m;\n\n vector<ll> stores;\n stores.reserve(n);\n // 本店 S1 を 0 としておく\n stores.push_back(0);\n // S2～Sn の位置\n for(int i = 2; i <= n; i++){\n ll di;\n cin >> di;\n stores.push_back(di);\n }\n sort(stores.begin(), stores.end());\n\n ll total = 0;\n int N = stores.size(); // = n\n\n while(m--){\n ll k;\n cin >> k;\n // 二分探索で k 以上の最初の要素の index を求める\n int idx = int(lower_bound(stores.begin(), stores.end(), k) - stores.begin());\n // ラップアラウンドを含む２つの候補\n int i1 = idx % N; // idx==N のときは 0\n int i2 = (idx + N - 1) % N; // idx==0 のときは N-1\n\n ll best = d;\n // 候補1\n {\n ll dist = llabs(k - stores[i1]);\n best = min(best, min(dist, d - dist));\n }\n // 候補2\n {\n ll dist = llabs(k - stores[i2]);\n best = min(best, min(dist, d - dist));\n }\n\n total += best;\n }\n\n cout << total << \"\\n\";\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4224, "score_of_the_acc": -0.4667, "final_rank": 18 }, { "submission_id": "aoj_0539_10422110", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <functional>\n\n\nusing namespace std;\ntypedef long long int ll;\ntypedef vector<ll> vll;\n\nbool solve() {\n ll d, n, m;\n cin >> d;\n if (d == 0) {\n return false;\n }\n cin >> n;\n cin >> m;\n vll huts;\n huts.push_back(0); // 本店\n for (ll i = 0; i < n-1; i++) {\n ll di;\n cin >> di;\n huts.push_back(di);\n }\n huts.push_back(d); // 本店\n sort(huts.begin(), huts.end());\n\n ll res = 0;\n for (ll i = 0; i < m; i++) {\n ll k;\n cin >> k;\n\n auto hut1_d = lower_bound(huts.begin(), huts.end(), k);\n auto hut2_d = lower_bound(huts.rbegin(), huts.rend(), k, greater<ll>{});\n\n res += min(*hut1_d - k, k - *hut2_d);\n }\n\n cout << res << endl;\n return true;\n}\n\nint main() {\n while (solve());\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3992, "score_of_the_acc": -0.4047, "final_rank": 15 }, { "submission_id": "aoj_0539_10346687", "code_snippet": "#include <stdio.h>\n#include <vector>\n#include<algorithm>\nusing namespace std;\n\nint main()\n{\n int d, n, m, sum;\n\n while(1){\n sum = 0;\n int store[100000];\n scanf(\"%d\\n\", &d); //最大経路\n if(d==0) break;\n scanf(\"%d\\n\", &n); //店舗数\n scanf(\"%d\\n\", &m); // 宅配先\n\n // printf(\"%d, %d, %d\\n\", d,n,m);\n \n int tmp; \n // 本店はデータにないので先に入れる\n store[0] = 0;\n for(int i=0;i<n - 1;i++){ \n scanf(\"%d\\n\", &tmp); \n store[i] = tmp; \n }\n\n // 環状は面倒なので一本道化する\n store[n] = d;\n n = n + 1;\n \n\n \n // for(int i=0; i < n; i++){ \n // printf(\"%d\\n\",store[i]); \n // }\n // printf(\"\\n\");\n\n // 店舗の位置を並べ替え\n sort(store,store+n);\n // for(int i=0; i < n; i++){ \n // printf(\"%d\\n\",store[i]); \n // }\n\n for(;m--;){ \n scanf(\"%d\\n\", &tmp); \n // printf(\"%d \",tmp);\n for(int i=0; i < n; i++){ \n if(store[i] >= tmp){\n if(store[i] == tmp){\n // 店舗と宅配先が同じ座標なのでコスト0\n // printf(\"0\\n\");\n }\n if(store[i] - tmp < tmp - store[i-1])\n {\n // iの方が近い\n // printf(\"%d\\n\",store[i] - tmp);\n sum+=store[i] - tmp;\n }else{\n // i-1の方が近い\n // printf(\"%d\\n\",tmp-store[i-1]);\n sum+=tmp-store[i-1];\n }\n break;\n }\n }\n } \n printf(\"%d\\n\",sum);\n }\n\n}", "accuracy": 1, "time_ms": 220, "memory_kb": 3192, "score_of_the_acc": -0.4486, "final_rank": 17 }, { "submission_id": "aoj_0539_9804255", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;++i)\n#define ALL(a) (a).begin(),(a).end()\nconst int inf = INT_MAX;\nusing ll = long long;\nconst ll INF = 1e18;\nusing P = pair<int,int>;\nstruct Edge{\n int to;\n ll cost;\n Edge(int to,ll cost):to(to),cost(cost){}\n};\nusing kEdge = pair<int,pair<int,int>>;\nusing Graph = vector<vector<int>>;\nusing WeightedGraph = vector<vector<Edge>>;\n\n\nstruct UnionFind{\n vector<int> par,rank,siz;\n UnionFind(int n) : par(n,-1),rank(n,0),siz(n,1){ }\n\n int root(int x){\n if(par[x]==-1)return x;\n else return par[x]=root(par[x]);\n }\n\n bool issame(int x,int y){\n return root(x)==root(y);\n }\n\n bool unite(int x,int y){\n int rx=root(x),ry=root(y);\n if(rx==ry)return false;\n if(rank[rx]<rank[ry])swap(rx,ry);\n par[ry]=rx;\n if(rank[rx]==rank[ry])rank[rx]++;\n siz[rx]+=siz[ry];\n return true;\n }\n\n int size(int x){\n return siz[root(x)];\n }\n};\n\nclass SegmentTree{\n public:\n vector<int>dat;\n int siz=1;\n\n void init(int N){\n siz=1;\n while(siz<N)siz*=2;\n dat=vector<int>(2*siz,0);\n }\n\n void update(int pos,int x){\n pos=pos+siz-1;\n dat[pos]=x;\n while(pos>=2){\n pos/=2;\n dat[pos]=max(dat[pos*2],dat[pos*2+1]);\n }\n }\n\n int query(int l,int r,int a,int b,int u){\n if(r<=a || b<=l)return -100000000;\n if(l<=a && b<=r)return dat[u];\n int m=(a+b)/2;\n int AnsL=query(l,r,a,m,u*2);\n int AnsR=query(l,r,m,b,u*2+1);\n return max(AnsL,AnsR);\n }\n};\n\ntemplate<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}\ntemplate<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}\n\nvector<int>dxs={1,0,-1,0};\nvector<int>dys={0,1,0,-1};\n\n//fixed << setprecision(10)\n//A[i].erase(unique(ALL(A[i])),A[i].end());\n\nint main(){\n int d,n,m;\n while(cin >> d >> n >> m){\n vector<int>dist(n),k(m);\n dist[0]=0;\n for(int i=1;i<n;i++)cin >> dist[i];\n rep(i,m)cin >> k[i];\n dist.push_back(d);\n ll ans=0;\n sort(ALL(dist));\n rep(i,m){\n int v=lower_bound(ALL(dist),k[i])-dist.begin();\n if(v!=0)ans+=min(dist[v]-k[i],k[i]-dist[v-1]);\n else ans+=dist[v]-k[i];\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3696, "score_of_the_acc": -0.2714, "final_rank": 10 }, { "submission_id": "aoj_0539_9804248", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0;i<n;++i)\n#define ALL(a) (a).begin(),(a).end()\nconst int inf = INT_MAX;\nusing ll = long long;\nconst ll INF = 1e18;\nusing P = pair<int,int>;\nstruct Edge{\n int to;\n ll cost;\n Edge(int to,ll cost):to(to),cost(cost){}\n};\nusing kEdge = pair<int,pair<int,int>>;\nusing Graph = vector<vector<int>>;\nusing WeightedGraph = vector<vector<Edge>>;\n\n\nstruct UnionFind{\n vector<int> par,rank,siz;\n UnionFind(int n) : par(n,-1),rank(n,0),siz(n,1){ }\n\n int root(int x){\n if(par[x]==-1)return x;\n else return par[x]=root(par[x]);\n }\n\n bool issame(int x,int y){\n return root(x)==root(y);\n }\n\n bool unite(int x,int y){\n int rx=root(x),ry=root(y);\n if(rx==ry)return false;\n if(rank[rx]<rank[ry])swap(rx,ry);\n par[ry]=rx;\n if(rank[rx]==rank[ry])rank[rx]++;\n siz[rx]+=siz[ry];\n return true;\n }\n\n int size(int x){\n return siz[root(x)];\n }\n};\n\nclass SegmentTree{\n public:\n vector<int>dat;\n int siz=1;\n\n void init(int N){\n siz=1;\n while(siz<N)siz*=2;\n dat=vector<int>(2*siz,0);\n }\n\n void update(int pos,int x){\n pos=pos+siz-1;\n dat[pos]=x;\n while(pos>=2){\n pos/=2;\n dat[pos]=max(dat[pos*2],dat[pos*2+1]);\n }\n }\n\n int query(int l,int r,int a,int b,int u){\n if(r<=a || b<=l)return -100000000;\n if(l<=a && b<=r)return dat[u];\n int m=(a+b)/2;\n int AnsL=query(l,r,a,m,u*2);\n int AnsR=query(l,r,m,b,u*2+1);\n return max(AnsL,AnsR);\n }\n};\n\ntemplate<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}\ntemplate<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}\n\nvector<int>dxs={1,0,-1,0};\nvector<int>dys={0,1,0,-1};\n\n//fixed << setprecision(10)\n//A[i].erase(unique(ALL(A[i])),A[i].end());\n\nint main(){\n int d,n,m;\n while(cin >> d && cin >> n && cin >> m){\n vector<int>dist(n),k(m);\n dist[0]=0;\n for(int i=1;i<n;i++)cin >> dist[i];\n rep(i,m)cin >> k[i];\n dist.push_back(d);\n ll ans=0;\n sort(ALL(dist));\n rep(i,m){\n int v=lower_bound(ALL(dist),k[i])-dist.begin();\n if(v!=0)ans+=min(dist[v]-k[i],k[i]-dist[v-1]);\n else ans+=dist[v]-k[i];\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3728, "score_of_the_acc": -0.2858, "final_rank": 12 }, { "submission_id": "aoj_0539_9028691", "code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n if (x < 0) { cout << (i64)(x); }\n else { cout << (u64)(x); }\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {}\n return 0;\n}\n\nint solve() {\n ll D, N, M, k;\n cin >> D;\n if (D == 0) return 1;\n cin >> N >> M;\n vi d(N+1);\n rep(i, 1, N) cin >> d[i];\n d[0] = 0;\n d[N] = D;\n sort(all(d));\n ll ans = 0;\n rep(M) {\n cin >> k;\n ll lb = LB(d, k);\n ll dist = d[lb] - k;\n if (lb >= 1) chmin(dist, k-d[lb-1]);\n ans += dist;\n }\n print(ans);\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3896, "score_of_the_acc": -0.3189, "final_rank": 14 }, { "submission_id": "aoj_0539_9023911", "code_snippet": "#ifdef LOCAL\n#include \"algo/debug.h\"\n#else\n#define _debug(...) 42\n#endif\n\n#include <bits/stdc++.h>\n\nvoid solve(unsigned int len) {\n\tstd::size_t n, m;\n\tstd::cin >> n >> m;\n\n\tstd::vector<unsigned int> d(n + 1, 0);\n\tfor (std::size_t i = 1; i < n; ++i) std::cin >> d[i];\n\td[n] = len;\n\tstd::sort(d.begin(), d.end());\n\n\tauto get_nearest_shops_dist = [&d, n](unsigned int k) {\n\t\tunsigned int left = 0, right = n;\n\t\twhile (right - left > 1) {\n\t\t\tunsigned int middle = (left + right) / 2;\n\t\t\tif (d[middle] <= k) left = middle;\n\t\t\telse right = middle;\n\t\t}\n\t\treturn std::min(k - d[left], d[right] - k);\n\t};\n\n\tunsigned long long result = 0;\n\n\twhile (m--) {\n\t\tunsigned int k;\n\t\tstd::cin >> k;\n\n\t\tresult += get_nearest_shops_dist(k);\n\t}\n\n\tstd::cout << result << '\\n';\n}\n\nint main() {\n\tstd::cin.tie(nullptr);\n\tstd::ios::sync_with_stdio(false);\n\n\twhile (true) {\n\t\tunsigned int len;\n\t\tstd::cin >> len;\n\n\t\tif (len == 0) break;\n\n\t\tsolve(len);\n\t}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3500, "score_of_the_acc": -0.1405, "final_rank": 3 }, { "submission_id": "aoj_0539_8484198", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint d, n, m;\nint main(){\n ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);\n while(cin >> d && d){\n cin >> n >> m;\n vector<int> vet;\n vet.push_back(0);\n for(int i = 0; i < n-1; ++ i){\n int x;\n cin >> x;\n vet.push_back(x);\n }\n vet.push_back(d);\n sort(vet.begin(), vet.end());\n long long res = 0;\n for(int i = 0; i < m; ++ i){\n int x;\n cin >> x;\n vector<int>::iterator p = upper_bound(vet.begin(), vet.end(), x);\n res += min(*p - x, x - *(p-1));\n }\n cout << res << \"\\n\";\n }\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3496, "score_of_the_acc": -0.1387, "final_rank": 2 }, { "submission_id": "aoj_0539_8479032", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n while(true){\nlong long d,n,m;cin >>d;\nif(d == 0)return 0;\ncin >>n>>m;\nvector<unsigned long long>v;\nv.push_back(0);\nfor(long long i = 1;i < n;i++){\n long long u;cin >>u;\n v.push_back(u);\n}\nv.push_back(d);\nlong long ans = 0;\nsort(v.begin(),v.end());\nfor(long long i = 0;i < m;i++){\n long long u;cin >>u;\n long long y = lower_bound(v.begin(),v.end(),u)-v.begin();\n ans += min(v[y]-u,u-v[y-1]);\n}\ncout <<ans<<\"\\n\";\n }\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 4012, "score_of_the_acc": -0.4137, "final_rank": 16 }, { "submission_id": "aoj_0539_8479024", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n while(true){\nlong long d,n,m;cin >>d;\nif(d == 0)return 0;\ncin >>n>>m;\nvector<unsigned int>v;\nv.push_back(0);\nfor(long long i = 1;i < n;i++){\n long long u;cin >>u;\n v.push_back(u);\n}\nv.push_back(d);\nlong long ans = 0;\nsort(v.begin(),v.end());\nfor(long long i = 0;i < m;i++){\n long long u;cin >>u;\n long long y = lower_bound(v.begin(),v.end(),u)-v.begin();\n ans += min(v[y]-u,u-v[y-1]);\n}\ncout <<ans<<\"\\n\";\n }\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3620, "score_of_the_acc": -0.2371, "final_rank": 6 }, { "submission_id": "aoj_0539_8478995", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n while(true){\nlong long d,n,m;cin >>d;\nif(d == 0)return 0;\ncin >>n>>m;\nvector<int>v;\nv.push_back(0);\nfor(long long i = 1;i < n;i++){\n long long u;cin >>u;\n v.push_back(u);\n}\nv.push_back(d);\nlong long ans = 0;\nsort(v.begin(),v.end());\nfor(long long i = 0;i < m;i++){\n long long u;cin >>u;\n long long y = lower_bound(v.begin(),v.end(),u)-v.begin();\n ans += min(v[y]-u,u-v[y-1]);\n}\ncout <<ans<<\"\\n\";\n }\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3756, "score_of_the_acc": -0.2984, "final_rank": 13 }, { "submission_id": "aoj_0539_7895513", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vl = vector<ll>;\nusing vvl = vector<vl>;\nusing pl = pair<ll,ll>;\nusing vp = vector<pl>;\n#define rep(i,n) for(ll i=0;i<(ll)(n);++i)\n#define reps(i,s,n) for(ll i=(s);i<(ll)(n);++i)\n#define rep1(i,n) for(ll i=1;i<=(ll)(n);++i)\ntemplate<typename T>inline bool chmax(T &a,T b){return a<b?a=b,true:false;}\ntemplate<typename T>inline bool chmin(T &a,T b){return a>b?a=b,true:false;}\n#define fi first\n#define se second\n#define pb push_back\n#define eb emplace_back\n#define be(v) (v).begin(),(v).end()\nconst long long INF = 1e18;\n#ifdef DEBUG\n#include <debug.hpp>\n#endif\n\nbool solve(){\n\t#ifdef DEBUG\n\tcout << \"--- Input ---\" << endl;\n\t#endif\n\t//cin.unsetf(ios::skipws);\n\tll D,N,M;cin>>D>>N>>M;\n\tif(D==0)return false;\n\tvl E(N),W(N),C(M);\n\tE.at(0)=0;W.at(0)=0;\n\treps(n,1,N){\n\t\tcin>>E.at(n);\n\t\tW.at(n)=D-E.at(n);\n\t}\n\trep(m,M)cin>>C.at(m);\n\tsort(be(E));\n\tsort(be(W));\n\tsort(be(C));\n\t#ifdef DEBUG\n\tshow(D,N,M,E,W,C);\n\tcout << \"--- Logic ---\" << endl;\n\t#endif\n\tauto cal=[&](vl v,ll c){\n\t\tll ret;\n\t\tauto i=lower_bound(be(v),c)-v.begin();\n\t\tif(i==N) ret=D-c;\n\t\telse ret=v.at(i)-c;\n\t\treturn ret;\n\t};\n\tll ans=0;\n\trep(m,M){\n\t\tll a1=cal(E,C.at(m));\n\t\tll a2=cal(W,D-C.at(m));\n\t\tans+=min(a1,a2);\n\t#ifdef DEBUG\n\t\tshow(\"m=\",m,\"a1=\",a1,\"a2=\",a2,\"ans=\",ans,'\\n');\n\t#endif\n\t}\n\t#ifdef DEBUG\n\tcout << \"--- Answer ---\" << endl;\n\t#endif\n\tcout<<ans<<endl;\n\treturn true;\n}\nint main(){\n\t#ifdef DEBUG\n\tcout << \"--- Main ---\" << endl;\n\t#endif\n\t//solve();\n\twhile(solve());\n\treturn 0;\n}\n//cout << fixed << setprecision(9);", "accuracy": 1, "time_ms": 480, "memory_kb": 5408, "score_of_the_acc": -2, "final_rank": 20 }, { "submission_id": "aoj_0539_7082700", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n\n\n\nint main(){\n while(1){\n int D,N,M;\n cin>>D;\n if(D==0)return 0;\n cin>>N>>M;\n\n vector<int> S(N+1,0);\n for(int i=1;i<N;i++)cin>>S[i];\n S[N]=D;\n int an=0;\n sort(S.begin(),S.end());\n for(int i=0;i<M;i++){\n int a;\n cin>>a;\n int res=D;\n auto p=upper_bound(S.begin(),S.end(),a);\n res=min(res,*p-a);\n p--;\n res=min(res,a-*p);\n an+=res;\n }\n cout<<an<<endl;\n }\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3532, "score_of_the_acc": -0.1975, "final_rank": 5 }, { "submission_id": "aoj_0539_6922492", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\ntemplate<class t> using vc = vector<t>;\ntemplate<class t> using vvc = vc<vc<t>>;\nusing pi = pair<int,int>;\nusing vi = vc<int>;\nusing vvi = vvc<int>;\n\n#define rep(i,a,b) for (int i = (a); i < (b); i++)\n#define irep(i,a,b) for (int i = (a); i > (b); i--)\n#define all(a) a.begin(),a.end()\n#define print(n) cout << n << '\\n'\n#define pritn(n) print(n)\n#define printv(n,a) {copy(all(n),ostream_iterator<a>(cout,\" \")); cout<<\"\\n\";}\n#define rup(a,b) (a+b-1)/b\n#define input(A,N) rep(i,0,N) cin>>A[i]\n#define chmax(a,b) a = max(a,b)\n#define chmin(a,b) a = min(a,b)\n\n\nint main(){\n cout << fixed << setprecision(15);\n \n while(1){\n ll d,n,m;\n cin>>d;\n if(d==0) break;\n cin>>n>>m;\n vc<ll> ds(n+1);\n ds[0] = 0;\n rep(i,1,n){\n ll a;cin>>a;\n ds[i] = a;\n }\n ds[n] = d;\n sort(all(ds));\n ll sum = 0;\n rep(i,0,m){\n ll k;cin>>k;\n if(k==0){\n continue;\n }\n auto itr = upper_bound(all(ds),k);\n sum += min(abs(k-*itr),abs(k-*(itr-1)));\n // cout << k << \" \"<<*itr<<\" \"<<*(itr-1)<<endl;\n }\n print(sum);\n\n }\n\n \n //system(\"pause\");\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3720, "score_of_the_acc": -0.2822, "final_rank": 11 }, { "submission_id": "aoj_0539_6860439", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\nusing pii = pair<int, int>;\n\nint main()\n{\n int d, n, m;\n while (cin >> d, d) {\n cin >> n >> m;\n vi<int> dist(n);\n rep(i, n - 1) cin >> dist[i];\n dist.push_back(d);\n sort(dist.begin(), dist.end());\n int k = 0;\n int ans = 0;\n rep(i, m) {\n cin >> k;\n auto pos = upper_bound(dist.begin(), dist.end(), k) - dist.begin();\n ans += min(dist[pos] - k, k - dist[pos - 1]);\n }\n cout << ans << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3524, "score_of_the_acc": -0.1939, "final_rank": 4 }, { "submission_id": "aoj_0539_6739334", "code_snippet": "#include \"bits/stdc++.h\"\n\n#define REP(i,num) for(ll i=0;i<(num);++i)\n#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))\n#define LOOP(i) while(i--)\n#define ALL(c) c.begin(),c.end()\n#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;\n#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\n\nconstexpr ll atcoder_mod = 1e9+7;\n\ntemplate<typename T=ll>\nT in(){ T x; cin >> x; return (x); }\ntemplate<typename T=ll,typename C=vector<T>>\nC vecin(int N){ C x(N);REP(i,N){ x[i]=in<T>(); }return x; }\ntemplate<typename T=ll,size_t N>\narray<T,N> arrin(){array<T,N> x;REP(i,N){ x[i]=in<T>(); }return x;}\n\nvoid vout(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid vout(Head&& h,Tail&&... t){ cout << ' ' << h;vout(forward<Tail>(t)...); }\nvoid out(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid out(Head&& h,Tail&&... t){ cout << h;vout(forward<Tail>(t)...); }\n\ntemplate<typename T>\nbool chmax(T& a,T b){ if(a<b){ a=b;return true; }return false; }\ntemplate<typename T>\nbool chmin(T& a,T b){ if(a>b){ a=b;return true; }return false; }\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(10);\n\n\twhile(true){\n\t\tll D=in();\n\t\tif(!D) break;\n\n\t\tll N=in(),M=in();\n\t\tvll S(N);\n\t\tS[0]=0;\n\t\tFOR(i,1,N){\n\t\t\tS[i]=in();\n\t\t}\n\t\tsort(ALL(S));\n\n\t\tll L=0;\n\t\tLOOP(M){\n\t\t\tll Q=in();\n\t\t\tauto res = upper_bound(ALL(S),Q);\n\t\t\tif(res==S.begin()){\n\t\t\t\tL += 0;\n\t\t\t}\n\t\t\telse if(res==S.end()){\n\t\t\t\tL += min(Q-S.back(),D-Q);\n\t\t\t}\n\t\t\telse{\n\t\t\t\tL += min(*res-Q,Q-*(res-1));\n\t\t\t}\n\t\t}\n\t\tout(L);\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3756, "score_of_the_acc": -0.2559, "final_rank": 9 }, { "submission_id": "aoj_0539_6444861", "code_snippet": "//Source.cpp\n//いつもの\n#ifdef LOCAL\n#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<unordered_set>\n#include<unordered_map>\n#include<list>\n#include<array>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<climits>\n#include<iomanip>\n#include<cctype>\n#include<sstream>\n#include<regex>\n#include<bitset>\n#include<random>\n#include<complex>\n#include<cassert>\n#else\n#include<bits/stdc++.h>\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#ifdef ONLINE_JUDGE\n#include<atcoder/all>\nusing namespace atcoder;\n#else\n#define gcd __gcd\n#define lcm __detail::__lcm\n#endif\n#endif\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ull;\n#ifdef LOCAL\n//*\n#include<atcoder/all>\nusing namespace atcoder;\n//*/\nunsigned popcount(unsigned x){\n\treturn __popcnt(x);\n}\nunsigned popcountll(ull x){\n\treturn __popcnt64(x);\n}\nunsigned parity(unsigned x){\n\treturn popcount(x)%2;\n}\nunsigned parityll(ull x){\n\treturn popcountll(x)%2;\n}\nunsigned clz(unsigned x){\n\tif(x==0)\n\t\tthrow;\n\tunsigned cnt=__lzcnt(x);\n\treturn cnt;\n}\nunsigned clzll(ull x){\n\tif(x==0)\n\t\tthrow;\n\tunsigned cnt=__lzcnt64(x);\n\treturn cnt;\n}\nunsigned ctz(unsigned x){\n\tif(x==0)\n\t\tthrow;\n\tx&=~x+1;\n\tunsigned cnt=0;\n\tif(x&0xffff0000)\n\t\tcnt|=16;\n\tif(x&0xff00ff00)\n\t\tcnt|=8;\n\tif(x&0xf0f0f0f0)\n\t\tcnt|=4;\n\tif(x&0xcccccccc)\n\t\tcnt|=2;\n\tif(x&0xaaaaaaaa)\n\t\tcnt|=1;\n\treturn cnt;\n}\nunsigned ctzll(ull x){\n\tif(x==0)\n\t\tthrow;\n\tx&=~x+1;\n\tunsigned cnt=0;\n\tif(x&0xffffffff00000000)\n\t\tcnt|=32;\n\tif(x&0xffff0000ffff0000)\n\t\tcnt|=16;\n\tif(x&0xff00ff00ff00ff00)\n\t\tcnt|=8;\n\tif(x&0xf0f0f0f0f0f0f0f0)\n\t\tcnt|=4;\n\tif(x&0xcccccccccccccccc)\n\t\tcnt|=2;\n\tif(x&0xaaaaaaaaaaaaaaaa)\n\t\tcnt|=1;\n\treturn cnt;\n}\nunsigned ffs(unsigned x){\n\tif(x==0)\n\t\treturn 0;\n\treturn ctz(x)+1;\n}\nunsigned ffsll(ull x){\n\tif(x==0)\n\t\treturn 0;\n\treturn ctzll(x)+1;\n}\n#define __builtin_popcount popcount\n#define __builtin_popcountll popcountll\n#define __builtin_parity parity\n#define __builtin_parityll parityll\n#define __builtin_clz clz\n#define __builtin_clzll clzll\n#define __builtin_ctz ctz\n#define __builtin_ctzll ctzll\n#define __builtin_ffs ffs\n#define __builtin_ffsll ffsll\n#endif\nconstexpr int mod=1e9+7;\nconstexpr int Mod=998244353;\nconstexpr int inf=mod;\nconstexpr ll linf=(ll)mod*mod;\nstruct fastio{\n\tfastio(){\n\t\tcin.tie(0);\n\t\tios::sync_with_stdio(0);\n\t\tcout<<fixed<<setprecision(20);\n\t};\n}fio;\ntemplate<class T>\nbool chmax(T&a,const T&b){\n\tif(a<b){\n\t\ta=b;\n\t\treturn 1;\n\t}\n\treturn 0;\n}\ntemplate<class T>\nbool chmin(T&a,const T&b){\n\tif(a>b){\n\t\ta=b;\n\t\treturn 1;\n\t}\n\treturn 0;\n}\nint main(){\n\tint d[100001],n,m,k;\n\twhile(cin>>d[0]>>n>>m){\n\t\tfor(int i=1;i<n;i++)\n\t\t\tcin>>d[i];\n\t\td[n]=0;\n\t\tsort(d,d+n+1);\n\t\tll ans=0;\n\t\tfor(int i=0;i<m;i++){\n\t\t\tcin>>k;\n\t\t\tauto it1=*prev(upper_bound(d,d+n+1,k)),it2=*lower_bound(d,d+n+1,k);\n\t\t\tans+=min(it2-k,k-it1);\n\t\t}\n\t\tcout<<ans<<endl;\n\t}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3748, "score_of_the_acc": -0.2523, "final_rank": 7 }, { "submission_id": "aoj_0539_6347232", "code_snippet": "//#include <atcoder/all>\n#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long;\nconstexpr lint mod = 1e9 + 7;\n#define all(x) begin(x), end(x)\n#define bitcount(n) __builtin_popcountll((lint)(n))\n#define fcout cout << fixed << setprecision(15)\n#define highest(x) (63 - __builtin_clzll(x))\n#define rep(i, n) for(int i = 0; i < int(n); i++)\n#define rep2(i, l, r) for(int i = int(l); i < int(r); i++)\n#define repr(i, n) for(int i = int(n) - 1; i >= 0; i--)\n#define repr2(i, l, r) for(int i = int(r) - 1; i >= int(l); i--)\nconstexpr int inf9 = 1e9; constexpr lint inf18 = 1e18;\ninline void Yes(bool condition){ if(condition) cout << \"Yes\" << endl; else cout << \"No\" << endl; }\ntemplate<class itr> void array_output(itr start, itr goal){ for(auto i = start; i != goal; i++) cout << (i == start ? \"\" : \" \") << (*i); cout << endl; }\ntemplate<class itr> void cins(itr first, itr last){ for(auto i = first; i != last; i++){ cin >> (*i); } }\ntemplate<class T> T gcd(T a, T b){ if(b) return gcd(b, a % b); else return a; }\ntemplate<class T> T lcm(T a, T b){ return a / gcd(a, b) * b; }\ntemplate<class T> bool chmax(T &a, const T &b){ if(a < b){ a = b; return 1; } return 0; }\ntemplate<class T> bool chmin(T &a, const T &b){ if(b < a){ a = b; return 1; } return 0; }\ninline int has(lint i, int j){ return (i >> j) & 1; }\nint dy[4] = {1, 0, -1, 0}; int dx[4] = {0, 1, 0, -1};\nbool is_inside(lint y, lint x, lint H, lint W){ return (0 <= y && y < H && 0 <= x && x < W); }\n\nstruct io_init {\n io_init() {\n cin.tie(nullptr); cout.tie(nullptr);\n std::ios::sync_with_stdio(false);\n }\n} io_init;\n\nvoid solve(){\n lint d;\n int n, q;\n cin >> d;\n if(d == 0) exit(0);\n cin >> n >> q;\n \n vector<lint> shop(n, 0);\n rep2(i, 1, n){\n lint di;\n cin >> di;\n shop[i] = di;\n }\n sort(all(shop));\n shop.push_back(d);\n \n lint ans = 0;\n rep(_, q){\n lint x;\n cin >> x;\n \n int r_pos = int(lower_bound(all(shop), x) - shop.begin());\n lint dist = abs(x - shop[r_pos]);\n \n if(r_pos > 0){\n chmin(dist, abs(x - shop[r_pos - 1]));\n }\n \n ans += dist;\n// cout << dist << endl;\n }\n \n cout << ans << endl;\n}\n\nint main(){\n while(true) solve();\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4560, "score_of_the_acc": -0.618, "final_rank": 19 } ]
aoj_0546_cpp
カード並べ 問題 花子さんは n 枚（4 ≤ n ≤ 10）のカードを並べて遊んでいる． それぞれのカードには 1 以上 99 以下の整数が 1 つずつ書かれている． 花子さんは，これらのカードの中から k 枚（2 ≤ k ≤ 4）を選び， 横一列に並べて整数を作ることにした． 花子さんは全部で何種類の整数を作ることができるだろうか． 例えば，1, 2, 3, 13, 21 の 5 枚のカードが与えられ，そこから 3 枚を選び整数を作ることを考える． 2, 1, 13 をこの順に並べると，整数 2113 を作ることができる． また，21, 1, 3 をこの順に並べても，同じ整数 2113 を作ることができる． このように，異なるカードの組み合わせから同じ整数が作られることもある． n 枚のカードに書かれた整数が与えられたとき， その中から k 枚を選び，横一列に並べることで作ることができる整数の個数を求めるプログラムを作成せよ． 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる． 各データセットは 2+n 行からなる． 1 行目にはカードの枚数 n （4 ≤ n ≤ 10）が， 2 行目にはカードを選ぶ枚数 k （2 ≤ k ≤ 4）が書かれている． 2+i 行目（1 ≤ i ≤ n）には i 枚目のカードに書かれている 1 以上 99 以下の整数が書かれている． n, k がともに 0 のとき入力の終了を示す.データセットの数は 5 を超えない． 出力 データセットごとに，花子さんが作ることができる整数の個数を1 行に出力する． 入出力例 入力例 4 2 1 2 12 1 6 3 72 2 12 7 2 1 0 0 出力例 7 68 1つ目の入力例 において， 1, 2, 12, 1 の 4 枚のカードの中から 2 枚を選び，横一列に並べて作ることができる整数は， 11, 12, 21, 112, 121, 122, 212 の 7 個である． 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0546_10865043", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include<utility>\n#include<set>\n#include<deque>\n#include <unordered_map>\n#include<string>\n#include<cmath>\n\nusing namespace std;\n\n\nint main() {\n\twhile (true) {\n\t\tint N;\n\t\tset<string>A;\n\t\tcin >> N;\n\t\tint k;\n\t\tcin >> k;\n\t\tif (N == 0 and k == 0) {\n\t\t\tbreak;\n\t\t}\n\t\tvector<int>o(N);\n\t\tint x;\n\t\tfor (int i = 0; i < N; i++) {\n\t\t\tcin >> x;\n\t\t\to[i] = x;\n\t\t}\n\t\tsort(o.begin(), o.end());\n\n\t\tdo {\n\t\t\tstring s = \"\";\n\t\t\tif (k == 2) {\n\t\t\t\ts += to_string(o[0]) + to_string(o[1]);\n\t\t\t\tA.insert(s);\n\t\t\t}\n\t\t\telse if (k == 3) {\n\t\t\t\ts += to_string(o[0]) + to_string(o[1]) + to_string(o[2]);\n\t\t\t\tA.insert(s);\n\t\t\t}\n\t\t\telse if (k == 4) {\n\t\t\t\ts += to_string(o[0]) + to_string(o[1]) + to_string(o[2]) + to_string(o[3]);\n\t\t\t\tA.insert(s);\n\t\t\t}\n\t\t} while (next_permutation(o.begin(), o.end()));\n\n\t\tcout << A.size() << endl;\n\t}\n}", "accuracy": 1, "time_ms": 980, "memory_kb": 3596, "score_of_the_acc": -0.9974, "final_rank": 18 }, { "submission_id": "aoj_0546_10117410", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef unsigned long long ull;\ntypedef long double db;\ntypedef long long ll;\ntypedef __int128 i128;\ntypedef pair<int,int>P;\ntypedef pair<ll,ll>Pll;\nmt19937 rnd(time(0));\nconst ll mod=998244353;\nconst ll inf=1<<30;\nconst int N=1e5+5;\nbool ok=true;\nint dx[8]={0,0,1,-1,1,1,-1,-1};\nint dy[8]={1,-1,0,0,1,-1,1,-1};\nset<int>e[N];\nvoid solve(){\n int n,k;\n while(cin >> n >> k){\n unordered_set<string>se;\n if(n==0&&k==0) break;\n vector<string>a(n);\n int ans=0;\n for(int i=0;i<n;i++) cin >> a[i];\n sort(a.begin(),a.end());\n do{\n for(int i=0;i<=n-k;i++){\n string x;\n for(int j=i;j<=i+k-1;j++){\n x+=a[j];\n }\n se.insert(x);\n }\n }while(next_permutation(a.begin(),a.end()));\n cout << se.size() << \"\\n\";\n }\n}\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0), cout.tie(0);\n cout << fixed << setprecision(2);\n int T = 1;\n //cin >> T;\n while (T--) {\n solve();\n }\n return 0;\n}", "accuracy": 1, "time_ms": 1000, "memory_kb": 8256, "score_of_the_acc": -1.2041, "final_rank": 20 }, { "submission_id": "aoj_0546_9568221", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing pl = pair<ll, ll>;\n\n#define rep(i, x) for (int i = 0; i < (x); ++i)\n#define reps(i, pr, x) for (int i = (pr); i < (x); ++i)\n#define vl vector<ll>\n#define fore(i, m2) for (auto &i : m2)\n#define all(X) (X).begin(), (X).end()\n#define out(X) cout << (X) << endl;\n\ntemplate <class T> inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T> inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\nconst ll MOD = 1e9 + 7;\nconst ll INF = (1LL << 58);\nconst ll MAX = 1e5 + 5;\n\nint main() {\n\n ll n, k;\n while (true) {\n\n cin >> n >> k;\n if (n == 0 && k == 0) break;\n vl a(n);\n rep(i, n) { cin >> a[i]; }\n sort(all(a));\n set<ll> st;\n do {\n string nm = \"\";\n rep(i, k) { nm += to_string(a[i]); }\n st.insert(stoll(nm));\n\n } while (next_permutation(all(a)));\n\n out(st.size());\n }\n}", "accuracy": 1, "time_ms": 880, "memory_kb": 3608, "score_of_the_acc": -0.8969, "final_rank": 15 }, { "submission_id": "aoj_0546_9000957", "code_snippet": "#include<iostream>\n#include<vector>\n#include<string>\n#include<iomanip>\n#include<queue>\n#include<map>\n#include<algorithm>\n#include<set>\nusing namespace std;\n\nint64_t power(int y) {\n\tint ans = 1;\n\tfor (int i = 0; i < y; i++) {\n\t\tans *= 10;\n\t}\n\treturn ans;\n}\n\nvoid solve(int n, int k) {\n\tvector<int64_t> vec1(n);\n\tvector<int> vec2(n);\n\tfor (int i = 0; i < n; i++) {\n\t\tint64_t x;\n\t\tcin >> x;\n\t\tvec1.at(i) = x;\n\t\tstring y = to_string(x);\n\t\tvec2.at(i) = y.size();\n\t}\n\n\tvector<int> parm(n);\n\tfor (int i = 0; i < n; i++) {\n\t\tparm.at(i) = i;\n\t}\n\tset<int> S;\n\tdo {\n\t\tint64_t a = 0;\n\t\tint count = 0;\n\t\tfor (int i = 0; i < k; i++) {\n\t\t\tint y = parm.at(i);\n\t\t\tint64_t p = vec1.at(y);\n\t\t\ta += (p * power(count));\n\t\t\tcount += vec2.at(y);\n\t\t}\n\t\tS.insert(a);\n\t} while (next_permutation(parm.begin(), parm.end()));\n\tint ans = S.size();\n\tcout << ans << endl;\n}\n\nint main() {\n\tint n, k;\n\tcin >> n >> k;\n\twhile (n != 0 || k != 0) {\n\t\tsolve(n, k);\n\t\tcin >> n >> k;\n\t}\n}", "accuracy": 1, "time_ms": 240, "memory_kb": 3308, "score_of_the_acc": -0.2384, "final_rank": 9 }, { "submission_id": "aoj_0546_7638859", "code_snippet": "//templateなのだ！\n#include <bits/stdc++.h>\n#define int long long\n#define double long double\n#define rep(i, l, r) for (int i=(int)(l); i<(int)(r); i++)\n#define repd(i,l,r) for (int i=(int)(l); i>=r; i--)\n#define all(a) (a).begin(), (a).end()\n#define BS(v, k) (binary_search(all(v),(k)))\n#define LBS(v, k) (lower_bound(all(v),(k))-v.begin())\n#define UBS(v, k) (upper_bound(all(v),(k))-v.begin())\nusing namespace std;\nusing vec=vector<int>;\nusing mat=vector<vec>;\nusing graph=vector<vector<pair<int, int> > >;\n#define cinvec(v) \\\n rep(bakatan,0,(int)v.size()) cin>>v[bakatan];\n#define coutvec(v) \\\n rep(bakatan,0,(int)v.size()) cout<<v[bakatan]<<' '; cout<<endl;\n#define coutvecl(v) \\\n rep(bakatan,0,(int)v.size()) cout<<v[bakatan]<<endl;\n#pragma GCC target(\"avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\nconst int INT_INF=(1ll<<31)-1;\nconst int INF=1e17;\nconst int mod1=998244353ll;\nconst int mod2=1e9+7;\n//数学系関数なのだ！\nint GCD(int a, int b) {\n if (a<0) a=abs(a); \n if (b<0) b=abs(b);\n if (a<b) swap(a,b);\n if (b==0) return a;\n else return GCD(b,a%b);\n}\nint LCM(int a, int b) {\n return (a/GCD(a,b))*b;\n}\nint Pow(int a, int b) {\n int Ans=1;\n rep(i,0,b) Ans*=a;\n return Ans;\n}\nint Powmod (int a, int b, int m) {\n int Ans=1, p=a;\n rep(i, 0, 63) {\n if ((b&(1ll<<i))!=0) {Ans*=p; Ans%=m;}\n p*=p; p%=m;\n }\n return Ans;\n}\nint extGCD(int a, int b, int &x, int &y) {\n if (a<b) return extGCD(b, a, y, x);\n if (b==0) {x=1,y=0; return a;}\n int d=extGCD(b,a%b,y,x); y-=a/b*x;\n return d;\n} \nvoid Euclid(int a, int b, int c, int &x, int &y) {\n int d=extGCD(a,b,x,y); x*=c/d, y*=c/d;\n}\nint Digit(int N) {\n int Ans=0;\n while (N>0) {N/=10; Ans++;}\n return Ans;\n}\nint DigitSum(int N) {\n int Ans=0;\n while (N>0) {Ans+=N%10; N/=10;}\n return Ans;\n}\nint MOD(int a, int m) {\n return (a%m+m)%m;\n}\nint CRT(int b1, int m1, int b2, int m2) {\n int p, q; int d=extGCD(m1, m2, p, q);\n if ((b2-b1)%d!=0) return -1;\n return MOD(b1+m1*((b2-b1)/d*p%(m2/d)), m1*m2/d);\n}\nvoid primefac(int N,vec &p,vec &e) {\n for (int i=2;i*i<=N;i++) {\n int cnt=0; while (N%i==0) {N/=i; cnt++;}\n if (cnt>0) {p.push_back(i); e.push_back(cnt);}\n }\n if (N!=1) {p.push_back(N); e.push_back(1);}\n return;\n}\nvoid getprime(int N, vector<int> &prime) {\n vector<bool> flag(N+1, true);\n for (int i=2; i*i<=N; i++) {\n if (flag[i]) {for (int j=2; i*j<=N; j++) flag[i*j]=false;}\n }\n rep(i, 2, N+1) {if (flag[i]) prime.push_back(i);}\n return;\n}\n// sum_{i=0}^{N-1} floor((A*i+B)/M)\nint floorsum(int N,int M,int A,int B) {\n if (N==0) return 0;\n int Ans=0;\n if (A>=M) Ans+=N*(N-1)*(A/M)/2,A%=M;\n if (B>=M) Ans+=N*(B/M),B%=M;\n int Y=(A*N+B)/M,X=Y*M-B;\n if (A==0||Y==0) return Ans;\n Ans+=(N-(X+A-1)/A)*Y+floorsum(Y,A,M,(A-X%A)%A);\n return Ans;\n}\n//n以下の正整数のうちnと互いに素なものの個数...O(sqrt(N))\nint Euler(int n) {\n int Ans=n; vec p; //素因数\n for (int i=2;i*i<=n;i++) {\n if (n%i==0) {\n p.push_back(i);\n while (n%i==0) {n/=i;}\n }\n }\n if (n!=1) p.push_back(n);\n rep(i,0,(int)p.size()) Ans=Ans/p[i]*(p[i]-1);\n return Ans;\n}\nvec fact,fact_inv,inv;\nvoid init_nCk(int SIZE,int mod) {\n fact.resize(SIZE+5); fact_inv.resize(SIZE+5); inv.resize(SIZE+5);\n fact[0]=fact[1]=1; fact_inv[0]=fact_inv[1]=1; inv[1]=1;\n rep(i,2,SIZE+5) {\n fact[i]=fact[i-1]*i%mod;\n inv[i]=mod-inv[mod%i]*(mod/i)%mod;\n fact_inv[i]=fact_inv[i-1]*inv[i]%mod;\n }\n}\nint nCk(int n,int k,int mod) {\n if (n<k||n<0||k<0) return -1;\n return fact[n]*(fact_inv[k]*fact_inv[n-k]%mod)%mod;\n}\n//データ構造なのだ！\n/* unionfindの説明なのだ！\nunionfind():大きさ0で宣言...O(1)\nunionfind(N):大きさNで宣言...O(1)\ninit(N):大きさNで初期化\nroot(v):頂点vの根..O(1)\nunite(u,v):頂点uを含む集合と頂点vを含む集合を統合\nsame(u,v):頂点uとvが同じ集合に属するか判定\n*/\nclass UnionFind {\n public:\n vector<int> par, siz;\n UnionFind() {init(0);}\n UnionFind(int N) {init(N);}\n void init(int N) {par.resize(N,-1); siz.resize(N,1);}\n int root(int pos) { //posの根を返す関数\n if (par[pos]==-1) return pos;\n else return par[pos]=root(par[pos]);\n }\n void unite(int u, int v) { //要素uとvを統合する関数\n int RootU=root(u), RootV=root(v);\n if (RootU==RootV) return;\n if (siz[RootU]<siz[RootV]) {par[RootU]=RootV; siz[RootV]+=siz[RootU];}\n else {par[RootV]= RootU; siz[RootU]+=siz[RootV];}\n }\n bool same(int u, int v) { //要素uとvが同じグループに属するか判定する関数\n if (root(u)==root(v)) return true;\n else return false;\n }\n};\n/* セグメント木の説明なのだ！\n・宣言 : N=配列の大きさ, fx=モノイドXの二項演算, ex=fx(a,e)=fx(e,a)=aとなる単位元e\n・set(i,x):i番目をxとおく（後でbuild()が必要）...O(logN)\n・build():セグメント木を再構築する...O(1)\n・update(i,x):i番目をxに変更する...O(logN)\n・query(l,r):fx(A[l],A[l+1],...A[r-1])を求める...O(logN)\n・find_right, find_left:セグメント木上での二分探索（必要に応じて）...0(logN)\n*/\ntemplate <typename X> \nstruct SegmentTree{\n using FX=function<X(X,X)>;\n vector<X> dat; //各ノードの値\n int siz; //葉の数\n FX fx; //二項演算\n const X ex; //単位元\n SegmentTree(int N,FX fx_,X ex_):siz(),fx(fx_),ex(ex_),dat() {\n siz=1; while (siz<N) siz*=2;\n dat.resize(2*siz-1); rep(i,0,2*siz-1) dat[i]=ex;\n }\n void set(int i,X x) { dat[i+siz-1] = x;}\n void build() {\n for (int i=siz-2; i>=0; i--) dat[i]=fx(dat[2*i+1], dat[2*i+2]);\n }\n void update(int pos,X x) {\n pos+=siz-1; dat[pos] = x;\n while (pos>0) {pos=(pos-1)/2; dat[pos]=fx(dat[pos*2+1], dat[pos*2+2]);}\n }\n X query(int a,int b) {return query_sub(a,b,0,0,siz);} //範囲は[a, b)\n X query_sub(int a,int b,int k,int l,int r) {\n if (r<=a||b<=l) return ex;\n if (a<=l&&r<=b) return dat[k];\n X left=query_sub(a,b,k*2+1,l,(l+r)/2);\n X right=query_sub(a,b,k*2+2,(l+r)/2,r);\n return fx(left, right);\n }\n};\n//セグ木の二項演算\nint Fx(int x1, int x2) {return min(x1,x2);}\nint Fx2(int x1,int x2) {return max(x1,x2);}\n/*遅延評価セグメント木の説明なのだ！\nSegTreeLazy(n,fx,fa,fm,ex,em):要素数n,二項演算fx,fa,fm,単位元ex,emのセグ木を構築...O(logn)\nset(i,x)→build():i番目の値をxになおす...set:O(1),build:O(logn)\nupdate(a,b,x):[a,b)の値をxに変更...O(logn)\nquery(a,b):[a,b)に対応するなんらかの値を返す...O(logn)\n*/\ntemplate<typename X,typename M> \nstruct SegTreeLazy {\n using FX=function<X(X,X)>; FX fx; //セグ木のデータに関する演算\n using FA=function<X(X,M)>; FA fa;//遅延評価を作用させる演算\n using FM=function<M(M,M)>; FM fm; //遅延評価に関する演算\n int n;\n const X ex; const M em; //集合X,Mに関する単位元\n vector<X> dat;\n vector<M> lazy;\n SegTreeLazy(int n_,FX fx_,FA fa_,FM fm_,X ex_,M em_)\n :n(),fx(fx_),fa(fa_),fm(fm_),ex(ex_),em(em_),dat(n_*4,ex),lazy(n_*4,em) {\n n=1; while (n_>n) n*=2;\n }\n void set(int i,X x) {dat[i+n-1]=x;}\n void build() {\n for (int k=n-2;k>=0;k--) dat[k]=fx(dat[2*k+1],dat[2*k+2]);\n }\n void eval(int k) {\n if (lazy[k]==em) return;\n if (k<n-1) {\n lazy[2*k+1]=fm(lazy[2*k+1],lazy[k]);\n lazy[2*k+2]=fm(lazy[2*k+2],lazy[k]);\n }\n dat[k]=fa(dat[k],lazy[k]);\n lazy[k]=em;\n }\n void update(int a,int b,M x,int k,int l,int r) {\n eval(k);\n if (a<=l&&r<=b) {\n lazy[k]=fm(lazy[k],x); eval(k);\n }\n else if (a<r&&l<b) {\n update(a,b,x,2*k+1,l,(l+r)/2);\n update(a,b,x,2*k+2,(l+r)/2,r);\n dat[k]=fx(dat[2*k+1],dat[2*k+2]);\n }\n }\n void update(int a,int b,M x) {update(a,b,x,0,0,n);}\n X query_sub(int a,int b,int k,int l,int r) {\n eval(k);\n if (r<=a||b<=l) return ex;\n if (a<=l&&r<=b) return dat[k];\n else {\n X left=query_sub(a,b,2*k+1,l,(l+r)/2);\n X right=query_sub(a,b,2*k+2,(l+r)/2,r);\n return fx(left,right);\n }\n }\n X query(int a,int b) {return query_sub(a,b,0,0,n);}\n};\n//遅延セグ木の二項演算\nint fx(int a,int b) {return min(a,b);}\nint fa(int a,int b) {return b;}\nint fm(int a,int b) {return b;}\n/* BITの説明なのだ！\n宣言:N=配列の大きさ\nadd(l,r,x):[l,r)にxを加算する\nquery(l,r):[l,r)の和を返す\n＊内部では1-indexになっていることに注意\n*/\ntemplate <typename T>\nstruct BIT {\n int N; vector<T> bit[2];\n BIT(int n) {init(n);}\n private:\n void init(int n) {\n N=n+1; rep(i,0,2) bit[i].assign(N,0);\n }\n void add_sub(int p,int i,T x) {\n for (int idx=i; idx<N; idx+=(idx&-idx)) bit[p][idx]+=x;\n }\n T sum_sub(int p,int i) {\n T s(0);\n for (int idx=i; idx>0; idx-=(idx&-idx)) s+=bit[p][idx];\n return s;\n }\n T sum(int i) {return sum_sub(0,i)+sum_sub(1,i)*i;}\n public:\n void add(int l,int r,T x) {\n l++; r++;\n add_sub(0,l,-x*(l-1)); add_sub(0,r,x*(r-1));\n add_sub(1,l,x); add_sub(1,r,-x);\n }\n T query(int l,int r) {l++; r++; return sum(r-1)-sum(l-1);}\n};\n/* RollingHashの説明なのだ！\n宣言:Sに関するHash値を計算する\nquery(l,r):[l,r)のHash値を計算する\n*/\nstruct RollingHash{\n int Mod=(1ll<<61)-1,Modsub=(1ll<<31)-1;\n int RollingHash_MOD(int x) { \n int res=(x>>61)+(x&Mod);\n if (res>=Mod) res-=Mod;\n return res;\n }\n int Mul(int a,int b) {\n int tmp=(a&Modsub)*(b>>31)+(b&Modsub)*(a>>31);\n int res=(a>>31)*(b>>31)*2+(tmp>>30)+((tmp&((1ll<<30)-1))<<31)+(a&Modsub)*(b&Modsub);\n return RollingHash_MOD(res);\n }\n string S; int siz,Base=RollingHash_MOD(rand());\n vec Hash, Power;\n RollingHash(string T):S(T),siz((int)T.size()) {\n Hash.resize(siz+1); Power.resize(siz+1); Hash[0]=0; Power[0]=1;\n rep(i,1,siz+1) Hash[i]=RollingHash_MOD(Mul(Base,Hash[i-1])+(S[i-1]-'a')+1);\n rep(i,1,siz+1) Power[i]=Mul(Power[i-1],Base);\n }\n int query(int l, int r) {\n return RollingHash_MOD(Hash[r]+Mod-Mul(Hash[l],Power[r-l]));\n }\n};\n//グラフアルゴリズムなのだ！\nvoid BFS(int start, mat G, vec &dist) {\n int N=(int)G.size(); \n dist.assign(N,-1); dist[start]=0;\n queue<int> Q; Q.push(start);\n while (!Q.empty()) {\n int pos=Q.front(); Q.pop();\n rep(i,0,(int)G[pos].size()) {\n if (dist[G[pos][i]]==-1) {\n dist[G[pos][i]]=dist[pos]+1; Q.push(G[pos][i]);\n }\n }\n }\n return;\n}\nvoid Dijkstra(int start, graph G, vector<int> &dist) {\n int N=(int)G.size(); \n dist.resize(N); rep(i,0,N) dist[i]=INF;\n priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > Q;\n vector<bool> flag(N, false);\n dist[start]=0; Q.push(make_pair(0,start));\n while (!Q.empty()) {\n int pos=Q.top().second; Q.pop();\n if (flag[pos]) continue;\n flag[pos]=true;\n rep(i,0,(int)G[pos].size()) {\n if (dist[G[pos][i].first]>dist[pos]+G[pos][i].second) {\n dist[G[pos][i].first]=dist[pos]+G[pos][i].second;\n Q.push(make_pair(dist[G[pos][i].first], G[pos][i].first));\n }\n }\n }\n}\nint Path2(int s, int t, graph G, vector<int> &route) {\n int N=(int)G.size(), pos=t; \n vector<int> dist(N); Dijkstra(s, G, dist);\n while (true) {\n route.push_back(pos);\n if (pos==s) break;\n rep(i,0,(int)G[pos].size()) {\n if (dist[G[pos][i].first]+G[pos][i].second==dist[pos]) {\n pos=G[pos][i].first; break;\n }\n }\n }\n reverse(all(route));\n return dist[t];\n}\n//トポロジカルソート\nvec topo_sort(mat G) { //BFS\n int N=(int)G.size(); vec Ans,ind(N);\n rep(i,0,N) {\n rep(j,0,(int)G[i].size()) ind[G[i][j]]++;\n }\n queue<int> Q;\n rep(i,0,N) {\n if (ind[i]==0) Q.push(i);\n }\n while (!Q.empty()) {\n int pos=Q.front(); Q.pop();\n Ans.push_back(pos);\n rep(i,0,(int)G[pos].size()) {\n ind[G[pos][i]]--;\n if (ind[G[pos][i]]==0) Q.push(G[pos][i]);\n }\n }\n return Ans;\n}\n/*最大フローの説明なのだ！\n宣言:N=グラフの大きさ\nadd(a,b,c):aからbをつなぐ大きさcの辺を追加する(0-index、有向辺)\nmax_flow(s,t):sからtへの最大フローを求める\n*/\nstruct MaxFlow_Edge {int to,cap,rev;};\nclass MaxFlow {\n public:\n int N; vector<bool> flag; vector<vector<MaxFlow_Edge> > G;\n MaxFlow(int n):N(n),flag(n),G(n) {}\n void add(int a,int b,int c) {\n MaxFlow_Edge tmp1={b,c,(int)G[b].size()};\n MaxFlow_Edge tmp2={a,0,(int)G[a].size()};\n G[a].push_back(tmp1); G[b].push_back(tmp2);\n }\n int dfs(int pos,int goal,int MinFlow) {\n if (pos==goal) return MinFlow;\n flag[pos]=true;\n rep(i,0,(int)G[pos].size()) {\n if (G[pos][i].cap==0) continue;\n if (flag[G[pos][i].to]) continue;\n int Flow=dfs(G[pos][i].to,goal,min(MinFlow,G[pos][i].cap));\n if (Flow>0) {\n G[pos][i].cap-=Flow; \n G[G[pos][i].to][G[pos][i].rev].cap+=Flow;\n return Flow;\n }\n }\n return 0;\n }\n int max_flow(int s,int t) {\n int Ans=0;\n while (true) {\n rep(i,0,N) flag[i]=false;\n int Flow=dfs(s,t,INF);\n if (Flow==0) break;\n Ans+=Flow;\n }\n return Ans;\n }\n};\n/*LCAの説明なのだ！\nLCA(mat G,int root):根がrootの木Gで前処理を行う...O(NlogN)\nquery(u,v):頂点uとvの最小共通祖先を求める...O((logN)^2)\n*/\nstruct LCA{\n mat par; //par[k][v]:頂点vの2^k先の親\n vec dist;\n LCA(const mat &G,int root=0) {init(G,root);}\n void init(const mat &G,int root=0) {\n int N=(int)G.size(),cnt=0;\n while ((1<<cnt)<N) cnt++;\n par.assign(cnt,vec(N,-1));\n dist.assign(N,-1);\n dfs(G,root,-1,0);\n rep(k,0,cnt-1) {\n rep(v,0,N) {\n if (par[k][v]<0) par[k+1][v]=-1;\n else par[k+1][v]=par[k][par[k][v]];\n }\n }\n }\n void dfs(const mat &G,int v,int p,int d) {\n par[0][v]=p; dist[v]=d;\n rep(i,0,(int)G[v].size()) {\n if (G[v][i]!=p) dfs(G,G[v][i],v,d+1);\n }\n }\n int query(int u,int v) {\n if (dist[u]<dist[v]) swap(u,v);\n int cnt=(int)par.size();\n rep(k,0,cnt) {\n if ((dist[u]-dist[v])>>k&1) u=par[k][u];\n }\n if (u==v) return u;\n for (int k=cnt-1;k>=0;k--) {\n if (par[k][u]!=par[k][v]) {u=par[k][u]; v=par[k][v];}\n }\n return par[0][u];\n }\n};\n//便利関数なのだ！\ntemplate <typename T>\nvoid chmax(T &a, const T b) {\n if (a<b) a=b;\n}\ntemplate <typename T>\nvoid chmin(T &a, const T b) {\n if (a>b) a=b;\n}\nint swap_count(vec A) { //i<j,A[i]>A[j]を満たす(i,j)を数える...O(NlogN)\n int N=(int)A.size();\n //まず座圧\n set<int> T; rep(i,0,N) T.insert(A[i]);\n vec t; while (!T.empty()) {t.push_back(*begin(T)); T.erase(*begin(T));}\n vec P(N); rep(i,0,N) P[i]=LBS(t,A[i]);\n //最大がN-1になったから転倒数を求める\n BIT<int> S(N);\n int Ans=0;\n rep(i,0,N) {\n Ans+=i-S.query(0,P[i]);\n S.add(P[i],P[i]+1,1);\n }\n return Ans;\n}\ntemplate <typename T>\nT Sum(vector<T> A) {\n T Ans=0;\n rep(i,0,(int)A.size()) Ans+=A[i];\n return Ans;\n}\ntemplate<typename T>\nT Min(vector<T> A) {\n T Ans=A[0];\n rep(i,1,(int)A.size()) chmin(Ans,A[i]);\n return Ans;\n}\ntemplate<typename T>\nT Max(vector<T> A) {\n T Ans=A[0];\n rep(i,1,(int)A.size()) chmax(Ans,A[i]);\n return Ans;\n}\n\nsigned main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n //init_nCk(2*1e6+9,mod2);\n cout<<fixed<<setprecision(15);\n srand(time(NULL));\n while (true) {\n int N,K; cin>>N>>K;\n if (N==0&&K==0) return 0;\n vector<string> S(N); cinvec(S);\n vec P(N); rep(i,0,N) P[i]=i;\n set<string> Ans;\n do {\n string s=\"\";\n rep(i,0,K) s+=S[P[i]];\n Ans.insert(s);\n }while (next_permutation(all(P)));\n cout<<(int)Ans.size()<<endl;\n }\n}", "accuracy": 1, "time_ms": 900, "memory_kb": 3648, "score_of_the_acc": -0.9187, "final_rank": 16 }, { "submission_id": "aoj_0546_7622294", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main()\n{\n int n, k;\n while (cin >> n >> k)\n {\n if (n == 0 && k == 0)\n break;\n vector<string> card(n);\n for (int i = 0; i < n; i++)\n {\n cin >> card.at(i);\n }\n set<string> number;\n sort(card.begin(), card.end());\n do\n {\n string newcard = \"\";\n for (int i = 0; i < k; i++)\n newcard += card.at(i);\n number.insert(newcard);\n } while (next_permutation(card.begin(), card.end()));\n cout << number.size() << endl;\n }\n}", "accuracy": 1, "time_ms": 310, "memory_kb": 3528, "score_of_the_acc": -0.3179, "final_rank": 10 }, { "submission_id": "aoj_0546_6426145", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nvoid solve(bool& flag)\n{\n\tint n, k;\n\tcin >> n >> k;\n\tif (n == 0 && k == 0)\n\t{\n\t\tflag = true;\n\t\treturn;\n\t}\n\tvector<string>numbers(n);\n\tvector<int>indexs(n);\n\tfor (int a = 0; a < n; a++)\n\t{\n\t\tstring num;\n\t\tcin >> num;\n\t\tnumbers.at(a) = num;\n\t\tindexs.at(a) = a;\n\t}\n\tset<string>MixedNumbers;\n\tdo\n\t{\n\t\tstring mixedNumber;\n\t\tfor (int a = 0; a < k; a++)\n\t\t{\n\t\t\tmixedNumber += numbers.at(indexs.at(a));\n\t\t}\n\t\tMixedNumbers.insert(mixedNumber);\n\t} \n\twhile (next_permutation(indexs.begin(), indexs.end()));\n\tcout << MixedNumbers.size() << endl;\n}\nint main()\n{\n\tbool flag = false;\n\twhile (!flag)\n\t\tsolve(flag);\n}", "accuracy": 1, "time_ms": 860, "memory_kb": 3348, "score_of_the_acc": -0.8663, "final_rank": 14 }, { "submission_id": "aoj_0546_5880352", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\ntypedef long long ll;\ntypedef pair<long long, long long> P;\nconst long long INF = 1e17;\nconst ll MOD = MOD1;\ntemplate <typename T>\nvoid input_arr(vector<T>& A, ll N) {\n for (ll i = 0; i < N; i++) {\n cin >> A[i];\n }\n}\ntemplate <typename T, typename Q>\nvoid input_arr(vector<pair<T, Q>>& A, ll N) {\n for (ll i = 0; i < N; i++) {\n cin >> A[i].first >> A[i].second;\n }\n}\ntemplate <typename T>\nll elements(vector<T>& A) {\n sort(A.begin(), A.end());\n ll ans = 1;\n for (ll i = 1; i < A.size(); i++) {\n if (A[i] != A[i - 1]) ans++;\n }\n return ans;\n}\nint main() {\n ll N, K; cin >> N >> K;\n while (!(N==0 && K==0)) {\n vector<ll>A(N); input_arr(A, N);\n sort(A.begin(),A.end());\n vector<ll>S;\n do {\n ll num = A[0];\n for (ll i = 1; i < K; i++) {\n num *= 10;\n if (A[i] >= 10) num *= 10;\n num += A[i];\n }\n S.push_back(num);\n }while(next_permutation(A.begin(),A.end()));\n cout << elements(S) << endl;\n cin >> N >> K;\n }\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 28148, "score_of_the_acc": -1.0505, "final_rank": 19 }, { "submission_id": "aoj_0546_5518000", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nsigned main() {\n while(true) {\n int n, k; cin >> n >> k;\n if(n == 0 && k == 0) return 0;\n vector<string> a(n);\n for(int i=0; i<n; i++) cin >> a[i];\n sort(a.begin(), a.end());\n unordered_set<string> result;\n do {\n string test = \"\";\n for(int i=0; i<k; i++) test += a[i];\n result.insert(test);\n } while(next_permutation(a.begin(), a.end()));\n cout << result.size() << endl;\n }\n}", "accuracy": 1, "time_ms": 160, "memory_kb": 3640, "score_of_the_acc": -0.1709, "final_rank": 8 }, { "submission_id": "aoj_0546_5054508", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define ve(i) vector<i>\n#define pa(i, j) pair<i, j>\n#define qu(i) queue<i>\n#define tu(i, j, k) tuple<i, j, k>\n#define ma(i, j) map<i, j>\n#define st(i) stack<i>\n#define fop(i, n) for(int i=0; i<n; ++i)\n#define fom(i, n) for(int i=n-1; i<=0; --i)\n#define bgen(i) i.begin(),i.end()\n\nvoid chmin(int& a, int& b){if(a > b)a = b;}\nvoid chmax(int& a, int& b){if(a < b)a = b;}\n\nconst ve(int) DX = {-1, 0, 1, 0};\nconst ve(int) DY = {0, 1, 0, -1};\n\nint main() {\n while(1){\n int n, k;\n cin >> n >> k;\n if(n == 0 && k == 0)return 0;\n int jump = 1;\n fop(i, n-k) jump *= (i+1);\n --jump;\n ve(int) num(n);\n fop(i, n) cin >> num[i];\n sort(bgen(num));\n \n set<string> numb;\n do{\n fop(i, jump)continue;\n string s;\n fop(i, k) s += to_string(num[i]);\n numb.insert(s);\n }while(next_permutation(bgen(num)));\n\n cout << numb.size() << endl;\n }\n}", "accuracy": 1, "time_ms": 910, "memory_kb": 3712, "score_of_the_acc": -0.9313, "final_rank": 17 }, { "submission_id": "aoj_0546_5048269", "code_snippet": "#include<algorithm>\n#include<iostream>\n#include<vector>\n#include<set>\n\nint calc(std::vector<std::string> card, int K){\n std::sort(card.begin(), card.end());\n std::set<std::string> st;\n do{\n std::string s=\"\";\n for(int i=0; i<K; ++i) s += card[i];\n st.insert(s);\n }while(std::next_permutation(card.begin(), card.end()));\n return st.size();\n}\n\nint main(){\n int N,K;\n while(std::cin >> N >> K, N || K){\n std::vector<std::string> card(N);\n for(int n=0; n<N; ++n) std::cin >> card[n];\n std::cout << calc(card, K) << std::endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 760, "memory_kb": 3412, "score_of_the_acc": -0.7678, "final_rank": 13 }, { "submission_id": "aoj_0546_4576776", "code_snippet": "#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int, int>;\n\nint main() {\n int n, k;\n while(cin >> n >> k) {\n if (n == 0) break;\n vector<int> card(n);\n rep(i, n) {\n cin >> card[i];\n }\n \n sort(card.begin(), card.end());\n set<int> ans;\n int sum;\n do {\n sum = 0;\n rep(i, k) {\n if (card[i] < 10) {\n sum = 10 * sum + card[i];\n } else {\n sum = 100 * sum + card[i];\n }\n }\n ans.insert(sum);\n } while (next_permutation(card.begin(), card.end()));\n\n cout << ans.size() << endl;\n \n } \n return 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 3224, "score_of_the_acc": -0.0431, "final_rank": 4 }, { "submission_id": "aoj_0546_4564684", "code_snippet": "#include <algorithm>\n#include <iostream>\n#include <queue>\n#include <set>\n#include <vector>\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\nusing namespace std;\n\nint main() {\n int n, k;\n while (true) {\n cin >> n >> k;\n if (n == 0 && k == 0) return 0;\n vector<string> a(n);\n rep(i, n) cin >> a[i];\n sort(a.begin(), a.end());\n\n set<string> s;\n do {\n string ans;\n rep(i, k) ans += a[i];\n s.insert(ans);\n } while (next_permutation(a.begin(), a.end()));\n\n cout << s.size() << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 750, "memory_kb": 3268, "score_of_the_acc": -0.752, "final_rank": 12 }, { "submission_id": "aoj_0546_4461477", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,n) for(int i=0; i<(n); ++i)\nusing ll = long long;\nusing P = pair<int, int>;\n\nint main() {\n vector<int> ans;\n while (true) {\n int n, k;\n cin >> n >> k;\n if (n == 0 && k == 0) break;\n vector<string> c(n);\n rep(i,n) cin >> c[i];\n\n set<string> num;\n sort(c.begin(), c.end());\n do {\n string tmp;\n rep(i,k) {\n\ttmp += c[i];\n }\n num.insert(tmp);\n } while (next_permutation(c.begin(), c.end()));\n ans.push_back(num.size());\n }\n\n rep(i,ans.size()) cout << ans[i] << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 740, "memory_kb": 3424, "score_of_the_acc": -0.7481, "final_rank": 11 }, { "submission_id": "aoj_0546_4428292", "code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<n;i++)\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0); \n\n int n,k;\n\n \n while(cin >> n >> k){\n if(!n && !k) break;\n\n int card[n];\n rep(i,n) cin >> card[i];\n\n sort( card, card + n );\n\n int ans = 0;\n map<int,int> memo;\n do{\n int temp = 0;\n rep(i,k){\n temp *= 10;\n if(card[i]>9) temp *= 10;\n temp += card[i];\n }\n if(memo[temp] == 0) ans++;\n memo[temp] = 1;\n }while(next_permutation( card, card + n ));\n\n cout << ans << endl;\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 3236, "score_of_the_acc": -0.0941, "final_rank": 7 }, { "submission_id": "aoj_0546_3840633", "code_snippet": "#include <bits/stdc++.h>\n#define ll long long\n#define rep(i,n) for(ll (i)=0;(i)<(n);++(i))\nusing namespace std;\n\nint main(){\n while(true){\n ll n,k;\n cin>>n>>k;\n if(n==0&&k==0)return 0;\n vector<ll> a(n);\n rep(i,n)cin>>a[i];\n sort(a.begin(),a.end());\n set<string> ans;\n if(k==2){\n rep(i,n){\n rep(j,n){\n if(i==j)continue;\n string v;\n v+=to_string(a[i])+to_string(a[j]);\n ans.insert(v);\n }\n }\n }else if(k==3){\n rep(i,n){\n rep(j,n){\n if(i==j)continue;\n rep(l,n){\n if(i==l || j==l)continue;\n string v;\n v+=to_string(a[i])+to_string(a[j])+to_string(a[l]);\n ans.insert(v);\n }\n }\n }\n }else if(k==4){\n rep(i,n){\n rep(j,n){\n if(i==j)continue;\n rep(l,n){\n if(i==l || j==l)continue;\n rep(m,n){\n if(i==m || j==m || l==m)continue;\n string v;\n v+=to_string(a[i])+to_string(a[j])+to_string(a[l])+to_string(a[m]);\n ans.insert(v);\n }\n }\n }\n }\n }\n cout<<ans.size()<<endl;\n }\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3432, "score_of_the_acc": -0.011, "final_rank": 1 }, { "submission_id": "aoj_0546_3834584", "code_snippet": "#include <algorithm>\n#include <iostream>\n#include <map>\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\n\n#define MOD 1000000007\n#define REP(i, N) for (int i = 0; i < N; ++i)\n#define REP1(i, N) for (int i = 1; i <= N; ++i)\n#define RREP(i, N) for (int i = N - 1; i >= 0; --i)\n#define ALL(a) a.begin(), a.end()\n\nint main() {\n int n, k;\n while (cin >> n >> k) {\n if (n == 0 && k == 0) break;\n vector<int> card;\n REP(i, n) {\n int c;\n cin >> c;\n card.push_back(c);\n }\n sort(ALL(card));\n map<int, int> mp;\n do {\n int num = 0;\n REP(i, k) {\n if (i == 0) {\n num += card[i];\n } else {\n int d = 0;\n int tmp = card[i];\n while (0 < tmp) {\n tmp /= 10;\n d++;\n }\n REP(j, d) num *= 10;\n num += card[i];\n }\n }\n mp[num]++;\n } while (next_permutation(ALL(card)));\n cout << mp.size() << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 3168, "score_of_the_acc": -0.051, "final_rank": 6 }, { "submission_id": "aoj_0546_3834582", "code_snippet": "// TLE\n#include <algorithm>\n#include <iostream>\n#include <map>\n#include <vector>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<ll, ll> P;\n\n#define MOD 1000000007\n#define REP(i, N) for (int i = 0; i < N; ++i)\n#define REP1(i, N) for (int i = 1; i <= N; ++i)\n#define RREP(i, N) for (int i = N - 1; i >= 0; --i)\n#define ALL(a) a.begin(), a.end()\n\nint main() {\n int n, k;\n while (cin >> n >> k) {\n if (n == 0 && k == 0) break;\n vector<int> card;\n REP(i, n) {\n int c;\n cin >> c;\n card.push_back(c);\n }\n sort(ALL(card));\n map<int, int> mp;\n do {\n int num = 0;\n REP(i, k) {\n if (i == 0) {\n num += card[i];\n } else {\n int d = 0;\n int tmp = card[i];\n while (0 < tmp) {\n tmp /= 10;\n d++;\n }\n REP(j, d) num *= 10;\n num += card[i];\n }\n }\n mp[num]++;\n } while (next_permutation(ALL(card)));\n cout << mp.size() << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 3156, "score_of_the_acc": -0.0505, "final_rank": 5 }, { "submission_id": "aoj_0546_3765365", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <set>\n\nusing namespace std;\n\nint main() {\n\tint n, k; \n\twhile (cin >> n >> k, n + k) {\n\t\tvector<int> card(n);\n\t\tfor (int i = 0; i < n; ++i) cin >> card[i];\n\t\tsort(card.begin(), card.end());\n\t\tset<int> cnt;\n\t\tdo {\n\t\t\tint tmp = 0;\n\t\t\tfor (int i = 0; i < k; ++i)\n\t\t\t\ttmp = tmp * (card[i] >= 10 ? 100 : 10) + card[i];\n\t\t\tcnt.insert(tmp);\n\t\t} while (next_permutation(card.begin(), card.end()));\n\t\tcout << cnt.size() << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 3196, "score_of_the_acc": -0.042, "final_rank": 3 }, { "submission_id": "aoj_0546_3765362", "code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <set>\n\nusing namespace std;\n\nint digit(int x) {\n\tint dig = 0;\n\twhile (x / 10) x /= 10, dig++;\n\treturn dig;\n}\n\nint main() {\n\tint n, k; \n\twhile (cin >> n >> k, n + k) {\n\t\tvector<int> card(n);\n\t\tfor (int i = 0; i < n; ++i) cin >> card[i];\n\t\tsort(card.begin(), card.end());\n\t\tset<int> cnt;\n\t\tdo {\n\t\t\tint tmp = 0;\n\t\t\tfor (int i = 0; i < k; ++i)\n\t\t\t\ttmp = tmp * (card[i] >= 10 ? 100 : 10) + card[i];\n\t\t\tcnt.insert(tmp);\n\t\t} while (next_permutation(card.begin(), card.end()));\n\t\tcout << cnt.size() << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 3188, "score_of_the_acc": -0.0417, "final_rank": 2 } ]
aoj_0548_cpp
方向音痴のトナカイ 問題 今年も JOI 町にサンタクロースが空からやってきた．JOI 町にある全ての家には子供がいるので，このサンタクロースは JOI 町の全ての家にプレゼントを配ってまわらなければならない．しかし，今年は連れているトナカイが少々方向音痴であり，また建物の上以外に降りることができないため，全ての家にプレゼントを配るためには少々道順を工夫しなければならないようだ． JOI 町は東西南北に区画整理されており，各区画は家，教会，空き地のいずれかである．JOI 町には 1 つだけ教会がある．次のルールに従い，サンタクロースとトナカイは教会から出発し，全ての家に 1 回ずつプレゼントを配った後，教会に戻る． 今年のトナカイは少々方向音痴であるため，東西南北いずれかの方向にまっすぐ飛ぶことしかできず，空中では方向転換できない． まだプレゼントを配っていない家の上は自由に通過できる．まだプレゼントを配っていない家には降りることができる．家に降りた時は必ずプレゼントを配り，その後は東西南北いずれかの方向に飛び立つ． JOI 町の家では，クリスマスの夜はサンタクロースが来るまでは暖炉をつけずに過ごしているが，サンタクロースが飛び立った後は暖炉をつける．暖炉をつけると煙突から煙が出るので，プレゼントを配り終えた家の上を通過することはできない． 教会の上は自由に通過することができる．しかし，教会では礼拝が行われているので，全てのプレゼントを配り終えるまで教会に降りることはできない． 空き地の上は自由に通過することができるが，空き地に降りることはできない． 入力として町の構造が与えられたとき，サンタクロースとトナカイがプレゼントを配る道順が何通りあるかを求めるプログラムを作成せよ． 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる． 各データセットは n+1 行ある． 1 行目には整数 m (1 ≤ m ≤ 10) と整数 n (1 ≤ n ≤ 10) が空白で区切られて書かれている． 2 行目から n+1 行目までの各行には，0，1，2 のいずれかが， 空白で区切られて m 個書かれており，各々が各区画の状態を表している． 北から i 番目，西から j 番目の区画を (i,j) と記述することにすると (1 ≤ i ≤ n, 1 ≤ j ≤ m)， 第 i+1 行目の j 番目の値は， 区画 (i,j) が空き地である場合は 0 となり， 家である場合は 1 となり， 教会である場合は 2 となる． 教会の個数は 1 であり，家の個数は 1 以上 23 以下である． ただし，採点用入力データでは配る道順が 2000000 通りをこえることはない． m, n がともに 0 のとき入力の終了を示す.データセットの数は 5 を超えない． 出力 データセットごとに,プレゼントを配る道順が何通りあるかを表す整数を1 行に出力する． 入出力例 入力例 3 2 1 0 1 1 0 2 3 3 1 1 1 1 0 1 1 1 2 0 0 出力例 2 6 図: 2つ目の入力例 に対する 6 通り全ての道順 （数字は配る順序を表す） 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0548_9553935", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n while(1){\n ll N, M;\n cin >> M >> N;\n if(N+M==0)return 0;\n vector<pair<ll, ll>> P;\n ll Y, X;\n vector<vector<ll>> A(N, vector<ll>(M, -1));\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < M; j++) {\n ll a;\n cin >> a;\n if (a == 0)continue;\n else if (a == 1) {\n A[i][j] = P.size();\n P.push_back({ i,j });\n }\n else {\n A[i][j] = -2;\n Y = i;\n X = j;\n }\n }\n }\n ll PN = P.size();\n vector<vector<int>> U(PN, vector<int>(PN, 0));\n for (int j = 0; j < PN; j++) {\n for (int k = 0; k < PN; k++) {\n if (P[j].first != P[k].first && P[j].second != P[k].second)continue;\n if (P[j].first == P[k].first) {\n ll L = min(P[j].second, P[k].second);\n ll R = max(P[j].second, P[k].second);\n bool OK = 1;\n for (ll x = L + 1; x < R; x++) {\n ll d = A[P[j].first][x];\n if (d >= 0)U[j][k] += (1 << d);\n }\n }\n else {\n ll L = min(P[j].first, P[k].first);\n ll R = max(P[j].first, P[k].first);\n bool OK = 1;\n for (ll x = L + 1; x < R; x++) {\n ll d = A[x][P[j].second];\n if (d >= 0)U[j][k] += (1 << d);\n }\n }\n }\n }\n\n vector<vector<int>> DP;\n unordered_map<int, int> idx;\n for (int i = 0; i < PN; i++) {\n if (P[i].first == Y || P[i].second == X) {\n bool OK = 1;\n if (P[i].first == Y) {\n ll L = min(P[i].second, X);\n ll R = max(P[i].second, X);\n for (int j = L + 1; j < R; j++)if (A[Y][j] >= 0)OK = 0;\n }\n if (P[i].second == X) {\n ll L = min(P[i].first, Y);\n ll R = max(P[i].first, Y);\n for (int j = L + 1; j < R; j++)if (A[j][X] >= 0)OK = 0;\n }\n if (!OK)continue;\n if (!idx.count(1 << i)) {\n idx[1 << i] = DP.size();\n DP.push_back(vector<int>(PN, 0));\n }\n int id = idx[1 << i];\n DP[id][i] = 1;\n }\n }\n int bitcnnt = 0;\n for (ll bt = 0; bt < (1 << PN) - 1; bt++) {\n if (!idx.count(bt))continue;\n int bit = idx[bt];\n if (DP[bit].size() == 0)continue;\n bitcnnt++;\n for (int j = 0; j < PN; j++) {\n if (DP[bit][j] == 0)continue;\n for (ll k = 0; k < PN; k++) {\n if (bt & (1 << k))continue;\n if (P[j].first != P[k].first && P[j].second != P[k].second)continue;\n if (((1 << PN) - bt - 1) & U[j][k])continue;\n if (!idx.count(bt + (1 << k))) {\n idx[bt + (1 << k)] = DP.size();\n DP.push_back(vector<int>(PN, 0));\n }\n int kid = idx[bt + (1 << k)];\n DP[kid][k] += DP[bit][j];\n }\n }\n DP[bit].clear();\n DP[bit].shrink_to_fit();\n }\n ll an = 0;\n if (!idx.count((1 << PN) - 1)) {\n cout << 0 << endl;\n continue;;\n }\n int fb = idx[(1 << PN) - 1];\n for (ll j = 0; j < PN; j++) {\n if (P[j].first != Y && P[j].second != X)continue;\n an += DP[fb][j];\n }\n cout << an << endl;\n // cout << bitcnnt << endl;}\n}}", "accuracy": 1, "time_ms": 680, "memory_kb": 36228, "score_of_the_acc": -0.4724, "final_rank": 2 }, { "submission_id": "aoj_0548_7000387", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint m, n, masu[11][11];\nint dx[] = {1, 0, -1, 0};\nint dy[] = {0, 1, 0, -1};\nint dfs(int x, int y, int cnt){\n int res = 0;\n for(int i=0;i<4;i++){\n int nx = x+dx[i];\n int ny = y+dy[i];\n while(nx>=0 && nx<m && ny>=0 && ny<n && masu[ny][nx]!=1){\n if(cnt == 0 && masu[ny][nx] == 2) return 1;\n nx += dx[i];\n ny += dy[i];\n }\n if(cnt == 0 || !(nx>=0 && nx<m && ny>=0 && ny<n)) continue;\n masu[ny][nx] = 0;\n res += dfs(nx, ny, cnt-1);\n masu[ny][nx] = 1;\n }\n return res;\n}\nint main(){\n int sx, sy, sum;\n while(cin >> m >> n, m!=0){\n sum = 0;\n for(int i=0;i<n;i++){\n for(int j=0;j<m;j++){\n cin >> masu[i][j];\n if(masu[i][j] == 1){\n sum++;\n } else if(masu[i][j] == 2){\n sx = j;\n sy = i;\n }\n }\n }\n cout << dfs(sx, sy, sum) << endl;\n }\n return(0);\n}", "accuracy": 1, "time_ms": 6330, "memory_kb": 3036, "score_of_the_acc": -0.7958, "final_rank": 14 }, { "submission_id": "aoj_0548_6602511", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <unordered_map>\n#include <vector>\nusing namespace std;\n\n\nconst int house = 1;\nconst int church = 2;\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, 1, 0, -1 };\nint width = -1;\nint height = -1;\nvector<vector<char>> index_grid;\nint church_x = -1;\nint church_y = -1;\nunsigned char num_houses = -1;\nunordered_map<int, int> dp;\n\n\ninline bool is_inside(int x, int y) {\n\treturn 0 <= x && x < width && 0 <= y && y < height;\n}\n\ninline bool is_visited(char house_idx, const int& visited_houses) {\n\treturn (visited_houses & (1 << house_idx)) > 0;\n}\n\ninline void add_house(unsigned char house_idx, int& visited_houses) {\n\tvisited_houses |= (1 << house_idx);\n\treturn;\n}\n\ninline int count_visited_houses(const int& visited_houses) {\n\tint counter = 0;\n\tint v = visited_houses;\n\n\tfor (int i = 0; i < num_houses; i++) {\n\t\tcounter += v & 1;\n\t\tv >>= 1;\n\t\tif (v == 0) { break; }\n\t}\n\n\treturn counter;\n}\n\nbool can_go_ahead(int x, int y, int visited_houses, int num_visited_houses) {\n\tchar c_idx = -1;\n\n\tif (x == church_x && y == church_y) {\n\t\tif (num_visited_houses < num_houses) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tc_idx = index_grid[y][x];\n\tif (c_idx < 0) {\n\t\treturn true;\n\t}\n\t\n\treturn is_visited(c_idx, visited_houses);\n}\n\nint dfs(int dp_state, int x, int y) {\n\tint num_visited_houses = count_visited_houses(dp_state);\n\tunsigned char c_idx = index_grid[y][x];\n\tint num_paths = 0;\n\n\tif (num_visited_houses >= num_houses) {\n\t\tif (x == church_x and y == church_y) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tdp_state = dp_state & ((1 << num_houses) - 1) | (c_idx << num_houses);\n\tif (dp.count(dp_state) > 0) {\n\t\treturn dp[dp_state];\n\t}\n\n\tfor (int i = 0; i < 4; i++) {\n\t\tint nx = x + dx[i];\n\t\tint ny = y + dy[i];\n\t\tchar n_idx = -1;\n\t\tint n_dp_state = dp_state;\n\n\t\twhile (is_inside(nx, ny) && can_go_ahead(nx, ny, dp_state, num_visited_houses)) {\n\t\t\tnx += dx[i];\n\t\t\tny += dy[i];\n\t\t}\n\n\t\tif (!is_inside(nx, ny)) {\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tn_idx = index_grid[ny][nx];\n\t\tif (n_idx >= 0) { add_house(n_idx, n_dp_state); }\n\t\tnum_paths += dfs(n_dp_state, nx, ny);\n\t}\n\n\tdp[dp_state] = num_paths;\n\treturn num_paths;\n}\n\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tvector<vector<int>> grid;\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tgrid = vector<vector<int>>(height, vector<int>(width, 0));\n\t\tindex_grid = vector<vector<char>>(height, vector<char>(width, -1));\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tcin >> grid[y][x];\n\t\t\t}\n\t\t}\n\t\t\n\t\tnum_houses = 0;\n\t\tchurch_x = -1;\n\t\tchurch_y = -1;\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif (grid[y][x] == house) {\n\t\t\t\t\tindex_grid[y][x] = num_houses;\n\t\t\t\t\tnum_houses++;\n\t\t\t\t}\n\t\t\t\telse if (grid[y][x] == church) {\n\t\t\t\t\tchurch_x = x;\n\t\t\t\t\tchurch_y = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tdp.clear();\n\t\tdp[0] = 0;\n\t\tcout << dfs(0, church_x, church_y) << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 700, "memory_kb": 52628, "score_of_the_acc": -0.7086, "final_rank": 3 }, { "submission_id": "aoj_0548_6602489", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <unordered_map>\n#include <vector>\nusing namespace std;\n\n\nconst int house = 1;\nconst int church = 2;\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, 1, 0, -1 };\nint width = -1;\nint height = -1;\nvector<vector<char>> index_grid;\nint church_x = -1;\nint church_y = -1;\nunsigned char num_houses = -1;\nunordered_map<int, int> dp;\n\n\ninline bool is_inside(int x, int y) {\n\treturn 0 <= x && x < width && 0 <= y && y < height;\n}\n\ninline bool is_visited(char house_idx, const int& visited_houses) {\n\treturn (visited_houses & (1 << house_idx)) > 0;\n}\n\ninline void add_house(unsigned char house_idx, int& visited_houses) {\n\tvisited_houses |= (1 << house_idx);\n\treturn;\n}\n\ninline int count_visited_houses(const int& visited_houses) {\n\tint counter = 0;\n\tint v = visited_houses;\n\n\tfor (int i = 0; i < num_houses; i++) {\n\t\tcounter += v & 1;\n\t\tv >>= 1;\n\t\tif (v == 0) { break; }\n\t}\n\n\treturn counter;\n}\n\nbool can_go_ahead(int x, int y, int visited_houses, int num_visited_houses) {\n\tchar c_idx = -1;\n\n\tif (x == church_x && y == church_y) {\n\t\tif (num_visited_houses < num_houses) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tif (index_grid[y][x] < 0) {\n\t\treturn true;\n\t}\n\t\n\tc_idx = index_grid[y][x];\n\treturn is_visited(c_idx, visited_houses);\n}\n\nint dfs(int dp_state, int x, int y) {\n\tint num_visited_houses = count_visited_houses(dp_state);\n\tunsigned char c_idx = index_grid[y][x];\n\tint num_paths = 0;\n\n\tif (num_visited_houses >= num_houses) {\n\t\tif (x == church_x and y == church_y) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tdp_state = dp_state & ((1 << num_houses) - 1) | (c_idx << num_houses);\n\tif (dp.count(dp_state) > 0) {\n\t\treturn dp[dp_state];\n\t}\n\n\tfor (int i = 0; i < 4; i++) {\n\t\tint nx = x + dx[i];\n\t\tint ny = y + dy[i];\n\t\tchar n_idx = -1;\n\t\tint n_dp_state = dp_state;\n\n\t\twhile (is_inside(nx, ny) && can_go_ahead(nx, ny, dp_state, num_visited_houses)) {\n\t\t\tnx += dx[i];\n\t\t\tny += dy[i];\n\t\t}\n\n\t\tif (!is_inside(nx, ny)) {\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tn_idx = index_grid[ny][nx];\n\t\tif (n_idx >= 0) { add_house(n_idx, n_dp_state); }\n\t\tnum_paths += dfs(n_dp_state, nx, ny);\n\t}\n\n\tdp[dp_state] = num_paths;\n\treturn num_paths;\n}\n\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tvector<vector<int>> grid;\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tgrid = vector<vector<int>>(height, vector<int>(width, 0));\n\t\tindex_grid = vector<vector<char>>(height, vector<char>(width, -1));\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tcin >> grid[y][x];\n\t\t\t}\n\t\t}\n\t\t\n\t\tnum_houses = 0;\n\t\tchurch_x = -1;\n\t\tchurch_y = -1;\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif (grid[y][x] == house) {\n\t\t\t\t\tindex_grid[y][x] = num_houses;\n\t\t\t\t\tnum_houses++;\n\t\t\t\t}\n\t\t\t\telse if (grid[y][x] == church) {\n\t\t\t\t\tchurch_x = x;\n\t\t\t\t\tchurch_y = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tdp.clear();\n\t\tdp[0] = 0;\n\t\tcout << dfs(0, church_x, church_y) << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 690, "memory_kb": 52748, "score_of_the_acc": -0.7089, "final_rank": 4 }, { "submission_id": "aoj_0548_6602474", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <unordered_map>\n#include <vector>\nusing namespace std;\n\n\nconst int house = 1;\nconst int church = 2;\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, 1, 0, -1 };\nint width = -1;\nint height = -1;\nvector<vector<char>> index_grid;\nint church_x = -1;\nint church_y = -1;\nunsigned char num_houses = -1;\nunordered_map<int, int> dp;\n\n\ninline bool is_inside(int x, int y) {\n\treturn 0 <= x && x < width && 0 <= y && y < height;\n}\n\ninline int count_visited_houses(const int& visited_houses) {\n\tint counter = 0;\n\tint v = visited_houses;\n\n\tfor (int i = 0; i < num_houses; i++) {\n\t\tcounter += v & 1;\n\t\tv >>= 1;\n\t\tif (v == 0) { break; }\n\t}\n\n\treturn counter;\n}\n\ninline bool is_visited(char house_idx, const int& visited_houses) {\n\treturn (visited_houses & (1 << house_idx)) > 0;\n}\n\ninline bool can_go_ahead(int x, int y, int visited_houses, int num_visited_houses) {\n\tchar c_idx = -1;\n\n\tif (x == church_x && y == church_y) {\n\t\tif (num_visited_houses < num_houses) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tif (index_grid[y][x] < 0) {\n\t\treturn true;\n\t}\n\t\n\tc_idx = index_grid[y][x];\n\treturn is_visited(c_idx, visited_houses);\n}\n\ninline void add_house(unsigned char house_idx, int& visited_houses) {\n\tvisited_houses |= (1 << house_idx);\n\treturn;\n}\n\nint dfs(int dp_state, int x, int y) {\n\tint num_visited_houses = count_visited_houses(dp_state);\n\tunsigned char c_idx = index_grid[y][x];\n\tint num_paths = 0;\n\n\tif (num_visited_houses >= num_houses) {\n\t\tif (x == church_x and y == church_y) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tdp_state = dp_state & ((1 << num_houses) - 1) | (c_idx << num_houses);\n\tif (dp.count(dp_state) > 0) {\n\t\treturn dp[dp_state];\n\t}\n\n\tfor (int i = 0; i < 4; i++) {\n\t\tint nx = x + dx[i];\n\t\tint ny = y + dy[i];\n\t\tchar n_idx = -1;\n\t\tint n_dp_state = dp_state;\n\n\t\twhile (is_inside(nx, ny) && can_go_ahead(nx, ny, dp_state, num_visited_houses)) {\n\t\t\tnx += dx[i];\n\t\t\tny += dy[i];\n\t\t}\n\n\t\tif (!is_inside(nx, ny)) {\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tn_idx = index_grid[ny][nx];\n\t\tif (n_idx >= 0) { add_house(n_idx, n_dp_state); }\n\t\tnum_paths += dfs(n_dp_state, nx, ny);\n\t}\n\n\tdp[dp_state] = num_paths;\n\treturn num_paths;\n}\n\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tvector<vector<int>> grid;\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tgrid = vector<vector<int>>(height, vector<int>(width, 0));\n\t\tindex_grid = vector<vector<char>>(height, vector<char>(width, -1));\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tcin >> grid[y][x];\n\t\t\t}\n\t\t}\n\t\t\n\t\tnum_houses = 0;\n\t\tchurch_x = -1;\n\t\tchurch_y = -1;\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif (grid[y][x] == house) {\n\t\t\t\t\tindex_grid[y][x] = num_houses;\n\t\t\t\t\tnum_houses++;\n\t\t\t\t}\n\t\t\t\telse if (grid[y][x] == church) {\n\t\t\t\t\tchurch_x = x;\n\t\t\t\t\tchurch_y = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tdp.clear();\n\t\tdp[0] = 0;\n\t\tcout << dfs(0, church_x, church_y) << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 690, "memory_kb": 52764, "score_of_the_acc": -0.7091, "final_rank": 6 }, { "submission_id": "aoj_0548_6602464", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <unordered_map>\n#include <vector>\n\nusing namespace std;\n\nconst int house = 1;\nconst int church = 2;\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, 1, 0, -1 };\nint width = -1;\nint height = -1;\nvector<vector<char>> index_grid;\nint church_x = -1;\nint church_y = -1;\nunsigned char num_houses = -1;\nunordered_map<int, int> dp;\n\n\ninline bool is_inside(int x, int y) {\n\treturn 0 <= x && x < width && 0 <= y && y < height;\n}\n\ninline int count_visited_houses(const int& visited_houses) {\n\tint counter = 0;\n\tint v = visited_houses;\n\n\tfor (int i = 0; i < num_houses; i++) {\n\t\tcounter += v & 1;\n\t\tv >>= 1;\n\t\tif (v == 0) { break; }\n\t}\n\n\treturn counter;\n}\n\ninline bool is_visited(char house_idx, const int& visited_houses) {\n\treturn (visited_houses & (1 << house_idx)) > 0;\n}\n\nbool can_go_ahead(int x, int y, int visited_houses, int num_visited_houses) {\n\tchar c_idx = -1;\n\n\tif (x == church_x && y == church_y) {\n\t\tif (num_visited_houses < num_houses) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tif (index_grid[y][x] < 0) {\n\t\treturn true;\n\t}\n\t\n\tc_idx = index_grid[y][x];\n\treturn is_visited(c_idx, visited_houses);\n}\n\ninline void add_house(unsigned char house_idx, int& visited_houses) {\n\tvisited_houses|= (1 << house_idx);\n\treturn;\n}\n\nint dfs(int dp_state, int x, int y) {\n\tint num_visited_houses = count_visited_houses(dp_state);\n\tunsigned char c_idx = index_grid[y][x];\n\tint num_paths = 0;\n\n\tif (num_visited_houses >= num_houses) {\n\t\tif (x == church_x and y == church_y) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tdp_state = dp_state & ((1 << num_houses) - 1) | (c_idx << num_houses);\n\tif (dp.count(dp_state) > 0) {\n\t\treturn dp[dp_state];\n\t}\n\n\tfor (int i = 0; i < 4; i++) {\n\t\tint nx = x + dx[i];\n\t\tint ny = y + dy[i];\n\t\tchar n_idx = -1;\n\t\tint n_dp_state = dp_state;\n\n\t\twhile (is_inside(nx, ny) && can_go_ahead(nx, ny, dp_state, num_visited_houses)) {\n\t\t\tnx += dx[i];\n\t\t\tny += dy[i];\n\t\t}\n\n\t\tif (!is_inside(nx, ny)) {\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tn_idx = index_grid[ny][nx];\n\t\tif (n_idx >= 0) { add_house(n_idx, n_dp_state); }\n\t\tnum_paths += dfs(n_dp_state, nx, ny);\n\t}\n\n\tdp[dp_state] = num_paths;\n\treturn num_paths;\n}\n\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tvector<vector<int>> grid;\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tgrid = vector<vector<int>>(height, vector<int>(width, 0));\n\t\tindex_grid = vector<vector<char>>(height, vector<char>(width, -1));\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tcin >> grid[y][x];\n\t\t\t}\n\t\t}\n\t\t\n\t\tnum_houses = 0;\n\t\tchurch_x = -1;\n\t\tchurch_y = -1;\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif (grid[y][x] == house) {\n\t\t\t\t\tindex_grid[y][x] = num_houses;\n\t\t\t\t\tnum_houses++;\n\t\t\t\t}\n\t\t\t\telse if (grid[y][x] == church) {\n\t\t\t\t\tchurch_x = x;\n\t\t\t\t\tchurch_y = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tdp.clear();\n\t\tdp[0] = 0;\n\t\tcout << dfs(0, church_x, church_y) << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 690, "memory_kb": 52796, "score_of_the_acc": -0.7096, "final_rank": 8 }, { "submission_id": "aoj_0548_6602332", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <unordered_map>\n#include <vector>\n\nusing namespace std;\n\nconst int house = 1;\nconst int church = 2;\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, 1, 0, -1 };\nint width = -1;\nint height = -1;\nvector<vector<char>> index_grid;\nint church_x = -1;\nint church_y = -1;\nunsigned char num_houses = -1;\nunordered_map<int, int> dp;\n\n\ninline bool is_inside(int x, int y) {\n\treturn 0 <= x && x < width && 0 <= y && y < height;\n}\n\nint count_visited_houses(const int& visited_houses) {\n\tint counter = 0;\n\tint v = visited_houses;\n\n\tfor (int i = 0; i < num_houses; i++) {\n\t\tcounter += v & 1;\n\t\tv >>= 1;\n\t\tif (v == 0) { break; }\n\t}\n\n\treturn counter;\n}\n\ninline bool is_visited(char house_idx, const int& visited_houses) {\n\treturn (visited_houses & (1 << house_idx)) > 0;\n}\n\nbool can_go_ahead(int x, int y, int visited_houses, int num_visited_houses) {\n\tchar c_idx = -1;\n\n\tif (x == church_x && y == church_y) {\n\t\tif (num_visited_houses < num_houses) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tif (index_grid[y][x] < 0) {\n\t\treturn true;\n\t}\n\t\n\tc_idx = index_grid[y][x];\n\treturn is_visited(c_idx, visited_houses);\n}\n\ninline void add_house(unsigned char house_idx, int& visited_houses) {\n\tvisited_houses|= (1 << house_idx);\n\treturn;\n}\n\nint dfs(int dp_state, int x, int y) {\n\tint num_visited_houses = count_visited_houses(dp_state);\n\tunsigned char c_idx = index_grid[y][x];\n\tint num_paths = 0;\n\n\tif (num_visited_houses >= num_houses) {\n\t\tif (x == church_x and y == church_y) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tdp_state = dp_state & ((1 << num_houses) - 1) | (c_idx << num_houses);\n\tif (dp.count(dp_state) > 0) {\n\t\treturn dp[dp_state];\n\t}\n\n\tfor (int i = 0; i < 4; i++) {\n\t\tint nx = x + dx[i];\n\t\tint ny = y + dy[i];\n\t\tchar n_idx = -1;\n\t\tint n_dp_state = dp_state;\n\n\t\twhile (is_inside(nx, ny) && can_go_ahead(nx, ny, dp_state, num_visited_houses)) {\n\t\t\tnx += dx[i];\n\t\t\tny += dy[i];\n\t\t}\n\n\t\tif (!is_inside(nx, ny)) {\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tn_idx = index_grid[ny][nx];\n\t\tif (n_idx >= 0) { add_house(n_idx, n_dp_state); }\n\t\tnum_paths += dfs(n_dp_state, nx, ny);\n\t}\n\n\tdp[dp_state] = num_paths;\n\treturn num_paths;\n}\n\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tvector<vector<int>> grid;\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tgrid = vector<vector<int>>(height, vector<int>(width, 0));\n\t\tindex_grid = vector<vector<char>>(height, vector<char>(width, -1));\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tcin >> grid[y][x];\n\t\t\t}\n\t\t}\n\t\t\n\t\tnum_houses = 0;\n\t\tchurch_x = -1;\n\t\tchurch_y = -1;\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif (grid[y][x] == house) {\n\t\t\t\t\tindex_grid[y][x] = num_houses;\n\t\t\t\t\tnum_houses++;\n\t\t\t\t}\n\t\t\t\telse if (grid[y][x] == church) {\n\t\t\t\t\tchurch_x = x;\n\t\t\t\t\tchurch_y = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tdp.clear();\n\t\tdp[0] = 0;\n\t\tcout << dfs(0, church_x, church_y) << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 700, "memory_kb": 52764, "score_of_the_acc": -0.7105, "final_rank": 9 }, { "submission_id": "aoj_0548_6602262", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <unordered_map>\n#include <vector>\n\nusing namespace std;\n\nconst int house = 1;\nconst int church = 2;\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, 1, 0, -1 };\nint width = -1;\nint height = -1;\nvector<vector<char>> index_grid;\nint church_x = -1;\nint church_y = -1;\nunsigned char num_houses = -1;\nunordered_map<int, int> dp;\n\n\ninline bool is_inside(int x, int y) {\n\treturn 0 <= x && x < width && 0 <= y && y < height;\n}\n\nint count_visited_houses(const int& visited_houses) {\n\tint counter = 0;\n\tint v = visited_houses;\n\n\tfor (int i = 0; i < num_houses; i++) {\n\t\tcounter += v & 1;\n\t\tv >>= 1;\n\t}\n\n\treturn counter;\n}\n\ninline bool is_visited(char house_idx, const int& visited_houses) {\n\treturn (visited_houses & (1 << house_idx)) > 0;\n}\n\nbool can_go_ahead(int x, int y, int visited_houses, int num_visited_houses) {\n\tchar c_idx = -1;\n\n\tif (x == church_x && y == church_y) {\n\t\tif (num_visited_houses < num_houses) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tif (index_grid[y][x] < 0) {\n\t\treturn true;\n\t}\n\t\n\tc_idx = index_grid[y][x];\n\treturn is_visited(c_idx, visited_houses);\n}\n\ninline void add_house(unsigned char house_idx, int& visited_houses) {\n\tvisited_houses|= (1 << house_idx);\n\treturn;\n}\n\nint dfs(int dp_state, int x, int y) {\n\tint num_visited_houses = count_visited_houses(dp_state);\n\tunsigned char c_idx = index_grid[y][x];\n\tint num_paths = 0;\n\n\tif (num_visited_houses >= num_houses) {\n\t\tif (x == church_x and y == church_y) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tdp_state = dp_state & ((1 << num_houses) - 1) | (c_idx << num_houses);\n\tif (dp.count(dp_state) > 0) {\n\t\treturn dp[dp_state];\n\t}\n\n\tfor (int i = 0; i < 4; i++) {\n\t\tint nx = x + dx[i];\n\t\tint ny = y + dy[i];\n\t\tchar n_idx = -1;\n\t\tint n_dp_state = dp_state;\n\n\t\twhile (is_inside(nx, ny) && can_go_ahead(nx, ny, dp_state, num_visited_houses)) {\n\t\t\tnx += dx[i];\n\t\t\tny += dy[i];\n\t\t}\n\n\t\tif (!is_inside(nx, ny)) {\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tn_idx = index_grid[ny][nx];\n\t\tif (n_idx >= 0) { add_house(n_idx, n_dp_state); }\n\t\tnum_paths += dfs(n_dp_state, nx, ny);\n\t}\n\n\tdp[dp_state] = num_paths;\n\treturn num_paths;\n}\n\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tvector<vector<int>> grid;\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tgrid = vector<vector<int>>(height, vector<int>(width, 0));\n\t\tindex_grid = vector<vector<char>>(height, vector<char>(width, -1));\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tcin >> grid[y][x];\n\t\t\t}\n\t\t}\n\t\t\n\t\tnum_houses = 0;\n\t\tchurch_x = -1;\n\t\tchurch_y = -1;\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif (grid[y][x] == house) {\n\t\t\t\t\tindex_grid[y][x] = num_houses;\n\t\t\t\t\tnum_houses++;\n\t\t\t\t}\n\t\t\t\telse if (grid[y][x] == church) {\n\t\t\t\t\tchurch_x = x;\n\t\t\t\t\tchurch_y = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tdp.clear();\n\t\tdp[0] = 0;\n\t\tcout << dfs(0, church_x, church_y) << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 690, "memory_kb": 52760, "score_of_the_acc": -0.709, "final_rank": 5 }, { "submission_id": "aoj_0548_6602165", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <unordered_map>\n#include <vector>\n\nusing namespace std;\n\nconst int house = 1;\nconst int church = 2;\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, 1, 0, -1 };\nint width = -1;\nint height = -1;\nvector<vector<char>> index_grid;\nint church_x = -1;\nint church_y = -1;\nunsigned char num_houses = -1;\nunordered_map<int, int> dp;\n\n\ninline bool is_inside(int x, int y) {\n\treturn 0 <= x && x < width && 0 <= y && y < height;\n}\n\nint count_visited_houses(const int& visited_houses) {\n\tint counter = 0;\n\tint v = visited_houses;\n\n\tfor (int i = 0; i < num_houses; i++) {\n\t\tcounter += v & 1;\n\t\tv >>= 1;\n\t}\n\n\treturn counter;\n}\n\ninline bool is_visited(char house_idx, const int& visited_houses) {\n\treturn (visited_houses & (1 << house_idx)) > 0;\n}\n\nbool can_go_ahead(int x, int y, int visited_houses, int num_visited_houses) {\n\tchar c_idx = -1;\n\n\tif (x == church_x && y == church_y) {\n\t\tif (num_visited_houses < num_houses) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tif (index_grid[y][x] < 0) {\n\t\treturn true;\n\t}\n\t\n\tc_idx = index_grid[y][x];\n\treturn is_visited(c_idx, visited_houses);\n}\n\ninline void add_house(unsigned char house_idx, int& visited_houses) {\n\tvisited_houses|= (1 << house_idx);\n\treturn;\n}\n\nint dfs(int dp_state, int x, int y) {\n\tint num_visited_houses = count_visited_houses(dp_state);\n\tunsigned char c_idx = index_grid[y][x];\n\tint num_paths = 0;\n\n\tif (num_visited_houses >= num_houses) {\n\t\tif (x == church_x and y == church_y) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tdp_state = dp_state & ((1 << num_houses) - 1) | (c_idx << num_houses);\n\tif (dp.count(dp_state) > 0) {\n\t\treturn dp[dp_state];\n\t}\n\n\tfor (int i = 0; i < 4; i++) {\n\t\tint nx = x + dx[i];\n\t\tint ny = y + dy[i];\n\t\tchar n_idx = -1;\n\t\tint n_dp_state = dp_state;\n\n\t\twhile (is_inside(nx, ny) && can_go_ahead(nx, ny, dp_state, num_visited_houses)) {\n\t\t\tnx += dx[i];\n\t\t\tny += dy[i];\n\t\t}\n\n\t\tif (!is_inside(nx, ny)) {\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tn_idx = index_grid[ny][nx];\n\t\tadd_house(n_idx, n_dp_state);\n\t\tnum_paths += dfs(n_dp_state, nx, ny);\n\t}\n\n\tdp[dp_state] = num_paths;\n\treturn num_paths;\n}\n\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tvector<vector<int>> grid;\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tgrid = vector<vector<int>>(height, vector<int>(width, 0));\n\t\tindex_grid = vector<vector<char>>(height, vector<char>(width, -1));\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tcin >> grid[y][x];\n\t\t\t}\n\t\t}\n\t\t\n\t\tnum_houses = 0;\n\t\tchurch_x = -1;\n\t\tchurch_y = -1;\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif (grid[y][x] == house) {\n\t\t\t\t\tindex_grid[y][x] = num_houses;\n\t\t\t\t\tnum_houses++;\n\t\t\t\t}\n\t\t\t\telse if (grid[y][x] == church) {\n\t\t\t\t\tchurch_x = x;\n\t\t\t\t\tchurch_y = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tdp.clear();\n\t\tdp[0] = 0;\n\t\tcout << dfs(0, church_x, church_y) << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 700, "memory_kb": 52696, "score_of_the_acc": -0.7095, "final_rank": 7 }, { "submission_id": "aoj_0548_6602119", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <unordered_map>\n#include <vector>\n\nusing namespace std;\n\nconst int house = 1;\nconst int church = 2;\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, 1, 0, -1 };\nint width = -1;\nint height = -1;\nvector<vector<char>> index_grid;\nint church_x = -1;\nint church_y = -1;\nunsigned char num_houses = -1;\nunordered_map<int, int> dp;\n\n\ninline bool is_inside(int x, int y) {\n\treturn 0 <= x && x < width && 0 <= y && y < height;\n}\n\nint count_visited_houses(const int& visited_houses) {\n\tint counter = 0;\n\tint v = visited_houses;\n\n\tfor (int i = 0; i < num_houses; i++) {\n\t\tcounter += v & 1;\n\t\tv >>= 1;\n\t}\n\n\treturn counter;\n}\n\ninline bool is_visited(char house_idx, const int& visited_houses) {\n\treturn (visited_houses & (1 << house_idx)) > 0;\n}\n\nbool can_go_ahead(int x, int y, const int& visited_houses) {\n\tint num_visited_houses = count_visited_houses(visited_houses);\n\tchar c_idx = -1;\n\n\tif (x == church_x && y == church_y) {\n\t\tif (num_visited_houses < num_houses) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tif (index_grid[y][x] < 0) {\n\t\treturn true;\n\t}\n\t\n\tc_idx = index_grid[y][x];\n\treturn is_visited(c_idx, visited_houses);\n}\n\ninline void add_house(unsigned char house_idx, int& visited_houses) {\n\tvisited_houses|= (1 << house_idx);\n\treturn;\n}\n\nint dfs(int dp_state, int x, int y) {\n\tint num_visited_houses = count_visited_houses(dp_state);\n\tunsigned char c_idx = index_grid[y][x];\n\tint num_paths = 0;\n\n\tif (num_visited_houses >= num_houses) {\n\t\tif (x == church_x and y == church_y) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tdp_state = dp_state & ((1 << num_houses) - 1) | (c_idx << num_houses);\n\tif (dp.count(dp_state) > 0) {\n\t\treturn dp[dp_state];\n\t}\n\n\tfor (int i = 0; i < 4; i++) {\n\t\tint nx = x + dx[i];\n\t\tint ny = y + dy[i];\n\t\tchar n_idx = -1;\n\t\tint n_dp_state = dp_state;\n\n\t\twhile (is_inside(nx, ny) && can_go_ahead(nx, ny, dp_state)) {\n\t\t\tnx += dx[i];\n\t\t\tny += dy[i];\n\t\t}\n\n\t\tif (!is_inside(nx, ny)) {\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tn_idx = index_grid[ny][nx];\n\t\tadd_house(n_idx, n_dp_state);\n\t\tnum_paths += dfs(n_dp_state, nx, ny);\n\t}\n\n\tdp[dp_state] = num_paths;\n\treturn num_paths;\n}\n\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tvector<vector<int>> grid;\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tgrid = vector<vector<int>>(height, vector<int>(width, 0));\n\t\tindex_grid = vector<vector<char>>(height, vector<char>(width, -1));\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tcin >> grid[y][x];\n\t\t\t}\n\t\t}\n\t\t\n\t\tnum_houses = 0;\n\t\tchurch_x = -1;\n\t\tchurch_y = -1;\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif (grid[y][x] == house) {\n\t\t\t\t\tindex_grid[y][x] = num_houses;\n\t\t\t\t\tnum_houses++;\n\t\t\t\t}\n\t\t\t\telse if (grid[y][x] == church) {\n\t\t\t\t\tchurch_x = x;\n\t\t\t\t\tchurch_y = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tdp.clear();\n\t\tdp[0] = 0;\n\t\tcout << dfs(0, church_x, church_y) << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 1020, "memory_kb": 52728, "score_of_the_acc": -0.7551, "final_rank": 12 }, { "submission_id": "aoj_0548_6602054", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <unordered_map>\n#include <vector>\n\nusing namespace std;\n\nconst int house = 1;\nconst int church = 2;\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, 1, 0, -1 };\nint width = -1;\nint height = -1;\nvector<vector<char>> index_grid;\nint church_x = -1;\nint church_y = -1;\nunsigned char num_houses = -1;\nunordered_map<int, int> dp;\n\n\ninline bool is_inside(int x, int y) {\n\treturn 0 <= x && x < width && 0 <= y && y < height;\n}\n\nint count_visited_houses(const int& visited_houses) {\n\tint counter = 0;\n\tint v = visited_houses;\n\n\tfor (int i = 0; i < num_houses; i++) {\n\t\tcounter += v & 1;\n\t\tv >>= 1;\n\t}\n\n\treturn counter;\n}\n\ninline bool is_visited(char idx, const int& visited_houses) {\n\treturn (visited_houses & (1 << idx)) > 0;\n}\n\nbool can_go_ahead(int x, int y, const int& visited_houses) {\n\tint num_visited_houses = count_visited_houses(visited_houses);\n\tchar c_idx = -1;\n\n\tif (x == church_x && y == church_y) {\n\t\tif (num_visited_houses < num_houses) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tif (index_grid[y][x] < 0) {\n\t\treturn true;\n\t}\n\t\n\tc_idx = index_grid[y][x];\n\treturn is_visited(c_idx, visited_houses);\n}\n\ninline void add_house(unsigned char house_idx, int& visited_houses) {\n\tvisited_houses|= (1 << house_idx);\n\treturn;\n}\n\nint dfs(int dp_state, int x, int y) {\n\tint num_visited_houses = count_visited_houses(dp_state);\n\tunsigned char c_idx = index_grid[y][x];\n\tint num_paths = 0;\n\n\tdp_state = dp_state & ((1 << num_houses) - 1) | (c_idx << num_houses);\n\tif (num_visited_houses >= num_houses) {\n\t\tif (x == church_x and y == church_y) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tif (dp.count(dp_state) > 0) {\n\t\treturn dp[dp_state];\n\t}\n\n\tfor (int i = 0; i < 4; i++) {\n\t\tint nx = x + dx[i];\n\t\tint ny = y + dy[i];\n\t\tchar n_idx = -1;\n\t\tint n_dp_state = dp_state;\n\n\t\twhile (is_inside(nx, ny) && can_go_ahead(nx, ny, dp_state)) {\n\t\t\tnx += dx[i];\n\t\t\tny += dy[i];\n\t\t}\n\n\t\tif (!is_inside(nx, ny)) {\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tn_idx = index_grid[ny][nx];\n\t\tadd_house(n_idx, n_dp_state);\n\t\tnum_paths += dfs(n_dp_state, nx, ny);\n\t}\n\n\tdp[dp_state] = num_paths;\n\treturn num_paths;\n}\n\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tvector<vector<int>> grid;\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tgrid = vector<vector<int>>(height, vector<int>(width, 0));\n\t\tindex_grid = vector<vector<char>>(height, vector<char>(width, -1));\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tcin >> grid[y][x];\n\t\t\t}\n\t\t}\n\t\t\n\t\tnum_houses = 0;\n\t\tchurch_x = -1;\n\t\tchurch_y = -1;\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif (grid[y][x] == house) {\n\t\t\t\t\tindex_grid[y][x] = num_houses;\n\t\t\t\t\tnum_houses++;\n\t\t\t\t}\n\t\t\t\telse if (grid[y][x] == church) {\n\t\t\t\t\tchurch_x = x;\n\t\t\t\t\tchurch_y = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tdp.clear();\n\t\tdp[0] = 0;\n\t\tcout << dfs(0, church_x, church_y) << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 1040, "memory_kb": 52584, "score_of_the_acc": -0.7558, "final_rank": 13 }, { "submission_id": "aoj_0548_6602012", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <unordered_map>\n#include <vector>\n\nusing namespace std;\n\nconst int house = 1;\nconst int church = 2;\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, -1, 0, 1 };\nint width = -1;\nint height = -1;\nvector<vector<char>> index_grid;\nint church_x = -1;\nint church_y = -1;\nunsigned char num_houses = -1;\nunordered_map<int, int> dp;\n\n\ninline bool is_inside(int x, int y) {\n\treturn 0 <= x && x < width && 0 <= y && y < height;\n}\n\nint count_visited_houses(const int& visited_houses) {\n\tint counter = 0;\n\tint v = visited_houses;\n\n\tfor (int i = 0; i < num_houses; i++) {\n\t\tcounter += v & 1;\n\t\tv >>= 1;\n\t}\n\n\n\treturn counter;\n}\n\nbool is_visited(char idx, const int& visited_houses) {\n\treturn (visited_houses & (1 << idx)) > 0;\n}\n\nbool can_go_ahead(int x, int y, const int& visited_houses) {\n\tint num_visited_houses = count_visited_houses(visited_houses);\n\tchar c_idx = -1;\n\n\tif (x == church_x && y == church_y) {\n\t\tif (num_visited_houses < num_houses) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tif (index_grid[y][x] < 0) {\n\t\treturn true;\n\t}\n\t\n\tc_idx = index_grid[y][x];\n\treturn is_visited(c_idx, visited_houses);\n}\n\nvoid add_house(unsigned char house_idx, int& visited_houses) {\n\tvisited_houses|= (1 << house_idx);\n\treturn;\n}\n\nint dfs(int dp_state, int x, int y) {\n\tint num_visited_houses = count_visited_houses(dp_state);\n\tunsigned char c_idx = index_grid[y][x];\n\tint num_paths = 0;\n\n\tdp_state = dp_state & ((1 << num_houses) - 1) | (c_idx << num_houses);\n\tif (num_visited_houses >= num_houses) {\n\t\tif (x == church_x and y == church_y) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tif (dp.count(dp_state) > 0) {\n\t\treturn dp[dp_state];\n\t}\n\n\tfor (int i = 0; i < 4; i++) {\n\t\tint nx = x + dx[i];\n\t\tint ny = y + dy[i];\n\t\tchar n_idx = -1;\n\t\tint n_dp_state = dp_state;\n\n\t\twhile (is_inside(nx, ny) && can_go_ahead(nx, ny, dp_state)) {\n\t\t\tnx += dx[i];\n\t\t\tny += dy[i];\n\t\t}\n\n\t\tif (!is_inside(nx, ny)) {\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tn_idx = index_grid[ny][nx];\n\t\tadd_house(n_idx, n_dp_state);\n\t\tnum_paths += dfs(n_dp_state, nx, ny);\n\t}\n\n\tdp[dp_state] = num_paths;\n\treturn num_paths;\n}\n\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tvector<vector<int>> grid;\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\n\t\tgrid = vector<vector<int>>(height, vector<int>(width, 0));\n\t\tindex_grid = vector<vector<char>>(height, vector<char>(width, -1));\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tcin >> grid[y][x];\n\t\t\t}\n\t\t}\n\t\t\n\t\tnum_houses = 0;\n\t\tchurch_x = -1;\n\t\tchurch_y = -1;\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif (grid[y][x] == house) {\n\t\t\t\t\tindex_grid[y][x] = num_houses;\n\t\t\t\t\tnum_houses++;\n\t\t\t\t}\n\t\t\t\telse if (grid[y][x] == church) {\n\t\t\t\t\tchurch_x = x;\n\t\t\t\t\tchurch_y = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tdp.clear();\n\t\tdp[0] = 0;\n\t\tcout << dfs(0, church_x, church_y) << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 970, "memory_kb": 52692, "score_of_the_acc": -0.7475, "final_rank": 11 }, { "submission_id": "aoj_0548_6404082", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <unordered_map>\n#include <vector>\n\nusing namespace std;\n\nconst int house = 1;\nconst int church = 2;\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, -1, 0, 1 };\nconst int max_num_houses_in_dp = 23;\nint width = -1;\nint height = -1;\nvector<vector<char>> index_grid;\nint church_x = -1;\nint church_y = -1;\nunsigned char num_houses = -1;\nint max_num_houses = -1;\nunordered_map<int, int> dp;\n\n\ninline bool is_inside(int x, int y) {\n\treturn 0 <= x && x < width && 0 <= y && y < height;\n}\n\nint count_visited_houses(const int& visited_houses) {\n\tint counter = 0;\n\tint v = visited_houses;\n\n\tfor (int i = 0; i < num_houses; i++) {\n\t\tcounter += v & 1;\n\t\tv >>= 1;\n\t}\n\n\n\treturn counter;\n}\n\nbool is_visited(char idx, const int& visited_houses) {\n\treturn (visited_houses & (1 << idx)) > 0;\n}\n\nbool can_go_ahead(int x, int y, const int& visited_houses) {\n\tint num_visited_houses = count_visited_houses(visited_houses);\n\tchar c_idx = -1;\n\n\tif (x == church_x && y == church_y) {\n\t\tif (num_visited_houses < num_houses) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tif (index_grid[y][x] < 0) {\n\t\treturn true;\n\t}\n\t\n\tc_idx = index_grid[y][x];\n\treturn is_visited(c_idx, visited_houses);\n}\n\nvoid add_house(unsigned char house_idx, int& visited_houses) {\n\tvisited_houses|= (1 << house_idx);\n\treturn;\n}\n\nint dfs(int dp_state, int x, int y) {\n\tint num_visited_houses = count_visited_houses(dp_state);\n\tunsigned char c_idx = index_grid[y][x];\n\tint num_paths = 0;\n\n\tdp_state = dp_state & ((1 << num_houses) - 1) | (c_idx << num_houses);\n\tif (num_visited_houses >= num_houses) {\n\t\tif (x == church_x and y == church_y) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tif (num_visited_houses < max_num_houses) {\n\t\tif (dp.count(dp_state) > 0) {\n\t\t\treturn dp[dp_state];\n\t\t}\n\t}\n\n\tfor (int i = 0; i < 4; i++) {\n\t\tint nx = x + dx[i];\n\t\tint ny = y + dy[i];\n\t\tchar n_idx = -1;\n\t\tint n_dp_state = dp_state;\n\n\t\twhile (is_inside(nx, ny) && can_go_ahead(nx, ny, dp_state)) {\n\t\t\tnx += dx[i];\n\t\t\tny += dy[i];\n\t\t}\n\n\t\tif (!is_inside(nx, ny)) {\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tn_idx = index_grid[ny][nx];\n\t\tadd_house(n_idx, n_dp_state);\n\t\tnum_paths += dfs(n_dp_state, nx, ny);\n\t}\n\n\tif (num_visited_houses < max_num_houses) {\n\t\tdp[dp_state] = num_paths;\n\t}\n\treturn num_paths;\n}\n\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tvector<vector<char>> grid;\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tindex_grid.clear();\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tvector<char> row(width, -1);\n\n\t\t\tindex_grid.push_back(row);\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tint cell = -1;\n\n\t\t\t\tcin >> cell;\n\t\t\t\trow[x] = cell;\n\t\t\t}\n\t\t\tgrid.push_back(row);\n\t\t}\n\t\t\n\t\tnum_houses = 0;\n\t\tchurch_x = -1;\n\t\tchurch_y = -1;\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif (grid[y][x] == house) {\n\t\t\t\t\tindex_grid[y][x] = num_houses;\n\t\t\t\t\tnum_houses++;\n\t\t\t\t}\n\t\t\t\telse if (grid[y][x] == church) {\n\t\t\t\t\tchurch_x = x;\n\t\t\t\t\tchurch_y = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tmax_num_houses = min(max_num_houses_in_dp, int(num_houses));\n\t\tdp.clear();\n\t\tdp[0] = 0;\n\t\tcout << dfs(0, church_x, church_y) << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 970, "memory_kb": 52616, "score_of_the_acc": -0.7464, "final_rank": 10 }, { "submission_id": "aoj_0548_6404073", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <map>\n#include <vector>\n\nusing namespace std;\n\nconst int house = 1;\nconst int church = 2;\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, -1, 0, 1 };\nconst int max_num_houses_in_dp = 23;\nint width = -1;\nint height = -1;\nvector<vector<char>> index_grid;\nint church_x = -1;\nint church_y = -1;\nunsigned char num_houses = -1;\nint max_num_houses = -1;\nmap<int, int> dp;\n\n\ninline bool is_inside(int x, int y) {\n\treturn 0 <= x && x < width && 0 <= y && y < height;\n}\n\nint count_visited_houses(const int& visited_houses) {\n\tint counter = 0;\n\tint v = visited_houses;\n\n\tfor (int i = 0; i < num_houses; i++) {\n\t\tcounter += v & 1;\n\t\tv >>= 1;\n\t}\n\n\n\treturn counter;\n}\n\nbool is_visited(char idx, const int& visited_houses) {\n\treturn (visited_houses & (1 << idx)) > 0;\n}\n\nbool can_go_ahead(int x, int y, const int& visited_houses) {\n\tint num_visited_houses = count_visited_houses(visited_houses);\n\tchar c_idx = -1;\n\n\tif (x == church_x && y == church_y) {\n\t\tif (num_visited_houses < num_houses) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tif (index_grid[y][x] < 0) {\n\t\treturn true;\n\t}\n\t\n\tc_idx = index_grid[y][x];\n\treturn is_visited(c_idx, visited_houses);\n}\n\nvoid add_house(unsigned char house_idx, int& visited_houses) {\n\tvisited_houses|= (1 << house_idx);\n\treturn;\n}\n\nint dfs(int dp_state, int x, int y) {\n\tint num_visited_houses = count_visited_houses(dp_state);\n\tunsigned char c_idx = index_grid[y][x];\n\tint num_paths = 0;\n\n\tdp_state = dp_state & ((1 << num_houses) - 1) | (c_idx << num_houses);\n\tif (num_visited_houses >= num_houses) {\n\t\tif (x == church_x and y == church_y) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tif (num_visited_houses < max_num_houses) {\n\t\tif (dp.count(dp_state) > 0) {\n\t\t\treturn dp[dp_state];\n\t\t}\n\t}\n\n\tfor (int i = 0; i < 4; i++) {\n\t\tint nx = x + dx[i];\n\t\tint ny = y + dy[i];\n\t\tchar n_idx = -1;\n\t\tint n_dp_state = dp_state;\n\n\t\twhile (is_inside(nx, ny) && can_go_ahead(nx, ny, dp_state)) {\n\t\t\tnx += dx[i];\n\t\t\tny += dy[i];\n\t\t}\n\n\t\tif (!is_inside(nx, ny)) {\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tn_idx = index_grid[ny][nx];\n\t\tadd_house(n_idx, n_dp_state);\n\t\tnum_paths += dfs(n_dp_state, nx, ny);\n\t}\n\n\tif (num_visited_houses < max_num_houses) {\n\t\tdp[dp_state] = num_paths;\n\t}\n\treturn num_paths;\n}\n\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tvector<vector<char>> grid;\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tindex_grid.clear();\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tvector<char> row(width, -1);\n\n\t\t\tindex_grid.push_back(row);\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tint cell = -1;\n\n\t\t\t\tcin >> cell;\n\t\t\t\trow[x] = cell;\n\t\t\t}\n\t\t\tgrid.push_back(row);\n\t\t}\n\t\t\n\t\tnum_houses = 0;\n\t\tchurch_x = -1;\n\t\tchurch_y = -1;\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif (grid[y][x] == house) {\n\t\t\t\t\tindex_grid[y][x] = num_houses;\n\t\t\t\t\tnum_houses++;\n\t\t\t\t}\n\t\t\t\telse if (grid[y][x] == church) {\n\t\t\t\t\tchurch_x = x;\n\t\t\t\t\tchurch_y = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tmax_num_houses = min(max_num_houses_in_dp, int(num_houses));\n\t\tdp.clear();\n\t\tdp[0] = 0;\n\t\tcout << dfs(0, church_x, church_y) << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 1690, "memory_kb": 55424, "score_of_the_acc": -0.8878, "final_rank": 15 }, { "submission_id": "aoj_0548_6366512", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <map>\n#include <vector>\n\nusing namespace std;\n\nconst int house = 1;\nconst int church = 2;\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, -1, 0, 1 };\nconst int max_num_houses_in_dp = 23;\nint width = -1;\nint height = -1;\nvector<vector<char>> index_grid;\nint church_x = -1;\nint church_y = -1;\nunsigned char num_houses = -1;\nint max_num_houses = -1;\nmap<pair<pair<unsigned short, unsigned char>, unsigned char>, int> dp;\n\n\ninline bool is_inside(int x, int y) {\n\treturn 0 <= x && x < width && 0 <= y && y < height;\n}\n\nint count_visited_houses(const pair<unsigned short, unsigned char>& visited_houses) {\n\tint counter = 0;\n\tint f = visited_houses.first;\n\tint s = visited_houses.second;\n\n\twhile (f > 0) {\n\t\tcounter += f & 1;\n\t\tf >>= 1;\n\t}\n\n\twhile (s > 0) {\n\t\tcounter += s & 1;\n\t\ts >>= 1;\n\t}\n\n\treturn counter;\n}\n\nbool is_visited(char idx, const pair<unsigned short, unsigned char>& visited_houses) {\n\tif (idx < 16) {\n\t\treturn (visited_houses.first & (1 << idx)) > 0;\n\t}\n\telse {\n\t\tidx -= 16;\n\t\treturn (visited_houses.second & (1 << idx)) > 0;\n\t}\n}\n\nbool can_go_ahead(int x, int y, const pair<unsigned short, unsigned char>& visited_houses) {\n\tint num_visited_houses = count_visited_houses(visited_houses);\n\tchar c_idx = -1;\n\n\tif (x == church_x && y == church_y) {\n\t\tif (num_visited_houses < num_houses) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tif (index_grid[y][x] < 0) {\n\t\treturn true;\n\t}\n\t\n\tc_idx = index_grid[y][x];\n\treturn is_visited(c_idx, visited_houses);\n}\n\nvoid add_house(unsigned char house_idx, pair<unsigned short, unsigned char>& visited_houses) {\n\tif (house_idx < 16) {\n\t\tvisited_houses.first |= (1 << house_idx);\n\t}\n\telse {\n\t\thouse_idx -= 16;\n\t\tvisited_houses.second |= (1 << house_idx);\n\t}\n\treturn;\n}\n\nint dfs(pair<pair<unsigned short, unsigned char>, unsigned char> dp_state, int x, int y) {\n\tpair<unsigned short, unsigned char> c_visited_houses = dp_state.first;\n\tint num_visited_houses = count_visited_houses(c_visited_houses);\n\tunsigned char c_idx = index_grid[y][x];\n\tint num_paths = 0;\n\n\tdp_state = pair<pair<unsigned short, unsigned char>, unsigned char>(c_visited_houses, c_idx);\n\tif (num_visited_houses >= num_houses) {\n\t\tif (x == church_x and y == church_y) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tif (num_visited_houses < max_num_houses) {\n\t\tif (dp.count(dp_state) > 0) {\n\t\t\treturn dp[dp_state];\n\t\t}\n\t}\n\n\tfor (int i = 0; i < 4; i++) {\n\t\tint nx = x + dx[i];\n\t\tint ny = y + dy[i];\n\t\tchar n_idx = -1;\n\t\tpair<unsigned short, unsigned char> n_visited_houses = c_visited_houses;\n\n\t\twhile (is_inside(nx, ny) && can_go_ahead(nx, ny, c_visited_houses)) {\n\t\t\tnx += dx[i];\n\t\t\tny += dy[i];\n\t\t}\n\n\t\tif (!is_inside(nx, ny)) {\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tn_idx = index_grid[ny][nx];\n\t\tadd_house(n_idx, n_visited_houses);\n\t\tnum_paths += dfs(pair<pair<unsigned short, unsigned char>, unsigned char>(n_visited_houses, n_idx), nx, ny);\n\t}\n\n\tif (num_visited_houses < max_num_houses) {\n\t\tdp[dp_state] = num_paths;\n\t}\n\treturn num_paths;\n}\n\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tvector<vector<char>> grid;\n\t\tpair<pair<unsigned short, unsigned char>, unsigned char> initial_state(pair<unsigned short, unsigned char>(0, 0), 0);\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tindex_grid.clear();\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tvector<char> row(width, -1);\n\n\t\t\tindex_grid.push_back(row);\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tint cell = -1;\n\n\t\t\t\tcin >> cell;\n\t\t\t\trow[x] = cell;\n\t\t\t}\n\t\t\tgrid.push_back(row);\n\t\t}\n\t\t\n\t\tnum_houses = 0;\n\t\tchurch_x = -1;\n\t\tchurch_y = -1;\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif (grid[y][x] == house) {\n\t\t\t\t\tindex_grid[y][x] = num_houses;\n\t\t\t\t\tnum_houses++;\n\t\t\t\t}\n\t\t\t\telse if (grid[y][x] == church) {\n\t\t\t\t\tchurch_x = x;\n\t\t\t\t\tchurch_y = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tmax_num_houses = min(max_num_houses_in_dp, int(num_houses));\n\t\tdp.clear();\n\t\tdp[initial_state] = 0;\n\t\tcout << dfs(initial_state, church_x, church_y) << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 1720, "memory_kb": 72956, "score_of_the_acc": -1.1415, "final_rank": 17 }, { "submission_id": "aoj_0548_6366509", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <map>\n#include <vector>\n\nusing namespace std;\n\nconst int house = 1;\nconst int church = 2;\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, -1, 0, 1 };\nconst int max_num_houses_in_dp = 23;\nint width = -1;\nint height = -1;\nvector<vector<char>> index_grid;\nint church_x = -1;\nint church_y = -1;\nunsigned char num_houses = -1;\nint max_num_houses = -1;\nmap<pair<pair<unsigned short, unsigned char>, unsigned char>, int> dp;\n\n\ninline bool is_inside(int x, int y) {\n\treturn 0 <= x && x < width && 0 <= y && y < height;\n}\n\nint count_visited_houses(const pair<unsigned short, unsigned char>& visited_houses) {\n\tint counter = 0;\n\tint f = visited_houses.first;\n\tint s = visited_houses.second;\n\n\twhile (f > 0) {\n\t\tcounter += f & 1;\n\t\tf >>= 1;\n\t}\n\n\twhile (s > 0) {\n\t\tcounter += s & 1;\n\t\ts >>= 1;\n\t}\n\n\treturn counter;\n}\n\nbool is_visited(char idx, const pair<unsigned short, unsigned char>& visited_houses) {\n\tif (idx < 16) {\n\t\treturn (visited_houses.first & (1 << idx)) > 0;\n\t}\n\telse {\n\t\tidx -= 16;\n\t\treturn (visited_houses.second & (1 << idx)) > 0;\n\t}\n}\n\nbool can_go_ahead(int x, int y, const pair<unsigned short, unsigned char>& visited_houses) {\n\tint num_visited_houses = count_visited_houses(visited_houses);\n\tchar c_idx = -1;\n\n\tif (x == church_x && y == church_y) {\n\t\tif (num_visited_houses < num_houses) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tif (index_grid[y][x] < 0) {\n\t\treturn true;\n\t}\n\t\n\tc_idx = index_grid[y][x];\n\treturn is_visited(c_idx, visited_houses);\n}\n\nvoid add_house(unsigned char house_idx, pair<unsigned short, unsigned char>& visited_houses) {\n\tif (house_idx < 16) {\n\t\tvisited_houses.first |= (1 << house_idx);\n\t}\n\telse {\n\t\thouse_idx -= 16;\n\t\tvisited_houses.second |= (1 << house_idx);\n\t}\n\treturn;\n}\n\nint dfs(pair<pair<unsigned short, unsigned char>, unsigned char> dp_state, int x, int y) {\n\tpair<unsigned short, unsigned char> c_visited_houses = dp_state.first;\n\tint num_visited_houses = count_visited_houses(c_visited_houses);\n\tunsigned char c_idx = index_grid[y][x];\n\tint num_paths = 0;\n\n\tdp_state = pair<pair<unsigned short, unsigned char>, unsigned char>(c_visited_houses, c_idx);\n\tif (dp.count(dp_state) > 0) {\n\t\treturn dp[dp_state];\n\t}\n\n\tif (num_visited_houses >= num_houses) {\n\t\tif (x == church_x and y == church_y) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tfor (int i = 0; i < 4; i++) {\n\t\tint nx = x + dx[i];\n\t\tint ny = y + dy[i];\n\t\tchar n_idx = -1;\n\t\tpair<unsigned short, unsigned char> n_visited_houses = c_visited_houses;\n\n\t\twhile (is_inside(nx, ny) && can_go_ahead(nx, ny, n_visited_houses)) {\n\t\t\tnx += dx[i];\n\t\t\tny += dy[i];\n\t\t}\n\n\t\tif (!is_inside(nx, ny)) {\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tn_idx = index_grid[ny][nx];\n\t\tadd_house(n_idx, n_visited_houses);\n\t\tnum_paths += dfs(pair<pair<unsigned short, unsigned char>, unsigned char>(n_visited_houses, n_idx), nx, ny);\n\t}\n\n\tdp[dp_state] = num_paths;\n\treturn num_paths;\n}\n\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tvector<vector<char>> grid;\n\t\tpair<pair<unsigned short, unsigned char>, unsigned char> initial_state(pair<unsigned short, unsigned char>(0, 0), 0);\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tindex_grid.clear();\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tvector<char> row(width, -1);\n\n\t\t\tindex_grid.push_back(row);\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tint cell = -1;\n\n\t\t\t\tcin >> cell;\n\t\t\t\trow[x] = cell;\n\t\t\t}\n\t\t\tgrid.push_back(row);\n\t\t}\n\t\t\n\t\tnum_houses = 0;\n\t\tchurch_x = -1;\n\t\tchurch_y = -1;\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif (grid[y][x] == house) {\n\t\t\t\t\tindex_grid[y][x] = num_houses;\n\t\t\t\t\tnum_houses++;\n\t\t\t\t}\n\t\t\t\telse if (grid[y][x] == church) {\n\t\t\t\t\tchurch_x = x;\n\t\t\t\t\tchurch_y = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tmax_num_houses = min(max_num_houses_in_dp, int(num_houses));\n\t\tdp.clear();\n\t\tdp[initial_state] = 0;\n\t\tcout << dfs(initial_state, church_x, church_y) << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 1760, "memory_kb": 72956, "score_of_the_acc": -1.1472, "final_rank": 19 }, { "submission_id": "aoj_0548_6366456", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <map>\n#include <vector>\n\nusing namespace std;\n\nconst int house = 1;\nconst int church = 2;\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, -1, 0, 1 };\nconst int max_num_house_in_dp = 23;\nint width = -1;\nint height = -1;\nvector<vector<char>> index_grid;\nint church_x = -1;\nint church_y = -1;\nunsigned char num_house = -1;\nint max_num_house = -1;\nmap<pair<pair<unsigned short, unsigned char>, unsigned char>, int> dp;\n\n\ninline bool is_inside(int x, int y) {\n\treturn 0 <= x && x < width && 0 <= y && y < height;\n}\n\nint count_visited_houses(const pair<unsigned short, unsigned char>& cur_visited_houses) {\n\tint counter = 0;\n\tint f = cur_visited_houses.first;\n\tint s = cur_visited_houses.second;\n\n\twhile (f > 0) {\n\t\tcounter += f & 1;\n\t\tf >>= 1;\n\t}\n\n\twhile (s > 0) {\n\t\tcounter += s & 1;\n\t\ts >>= 1;\n\t}\n\n\treturn counter;\n}\n\nbool is_visited(char idx, const pair<unsigned short, unsigned char>& cur_visited_houses) {\n\tif (idx < 16) {\n\t\treturn (cur_visited_houses.first & (1 << idx)) > 0;\n\t}\n\telse {\n\t\tidx -= 16;\n\t\treturn (cur_visited_houses.second & (1 << idx)) > 0;\n\t}\n}\n\nbool can_go_ahead(int x, int y, const pair<unsigned short, unsigned char>& cur_visited_houses) {\n\tint num_visited_houses = count_visited_houses(cur_visited_houses);\n\tchar c_idx = -1;\n\n\tif (x == church_x && y == church_y) {\n\t\tif (num_visited_houses < num_house) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tif (index_grid[y][x] < 0) {\n\t\treturn true;\n\t}\n\t\n\tc_idx = index_grid[y][x];\n\treturn is_visited(c_idx, cur_visited_houses);\n}\n\nvoid add_house(unsigned char house_idx, pair<unsigned short, unsigned char>& visited_houses) {\n\tif (house_idx < 16) {\n\t\tvisited_houses.first |= (1 << house_idx);\n\t}\n\telse {\n\t\thouse_idx -= 16;\n\t\tvisited_houses.second |= (1 << house_idx);\n\t}\n\treturn;\n}\n\nint dfs(pair<pair<unsigned short, unsigned char>, unsigned char> dp_state, int x, int y) {\n\tpair<unsigned short, unsigned char> cur_visited_houses = dp_state.first;\n\tint num_visited_houses = count_visited_houses(cur_visited_houses);\n\tunsigned char c_idx = index_grid[y][x];\n\tint cur_num_paths = 0;\n\n\tdp_state = pair<pair<unsigned short, unsigned char>, unsigned char>(cur_visited_houses, c_idx);\n\n\tif (num_visited_houses >= num_house) {\n\t\tif (x == church_x and y == church_y) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tif (num_visited_houses < max_num_house) {\n\t\tif (dp.count(dp_state) > 0) {\n\t\t\treturn dp[dp_state];\n\t\t}\n\t}\n\n\tfor (int i = 0; i < 4; i++) {\n\t\tint nx = x + dx[i];\n\t\tint ny = y + dy[i];\n\t\tchar n_idx = -1;\n\t\tpair<unsigned short, unsigned char> n_visited_houses = cur_visited_houses;\n\n\t\twhile (is_inside(nx, ny) && can_go_ahead(nx, ny, cur_visited_houses)) {\n\t\t\tnx += dx[i];\n\t\t\tny += dy[i];\n\t\t}\n\n\t\tif (!is_inside(nx, ny)) {\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tn_idx = index_grid[ny][nx];\n\t\tadd_house(n_idx, n_visited_houses);\n\t\tcur_num_paths += dfs(pair<pair<unsigned short, unsigned char>, unsigned char>(n_visited_houses, n_idx), nx, ny);\n\t}\n\n\tif (num_visited_houses < max_num_house) {\n\t\tdp[dp_state] = cur_num_paths;\n\t}\n\treturn cur_num_paths;\n}\n\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tvector<vector<char>> grid;\n\t\tpair<pair<unsigned short, unsigned char>, unsigned char> initial_state(pair<unsigned short, unsigned char>(0, 0), 0);\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tindex_grid.clear();\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tvector<char> row(width, -1);\n\n\t\t\tindex_grid.push_back(row);\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tint cell = -1;\n\n\t\t\t\tcin >> cell;\n\t\t\t\trow[x] = cell;\n\t\t\t}\n\t\t\tgrid.push_back(row);\n\t\t}\n\t\t\n\t\tnum_house = 0;\n\t\tchurch_x = -1;\n\t\tchurch_y = -1;\n\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif (grid[y][x] == house) {\n\t\t\t\t\tindex_grid[y][x] = num_house;\n\t\t\t\t\tnum_house++;\n\t\t\t\t}\n\t\t\t\telse if (grid[y][x] == church) {\n\t\t\t\t\tchurch_x = x;\n\t\t\t\t\tchurch_y = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tmax_num_house = min(max_num_house_in_dp, int(num_house));\n\t\tdp.clear();\n\t\tdp[initial_state] = 0;\n\t\tcout << dfs(initial_state, church_x, church_y) << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 1730, "memory_kb": 73172, "score_of_the_acc": -1.146, "final_rank": 18 }, { "submission_id": "aoj_0548_6366384", "code_snippet": "#define READ_FROM_FILE 0\n\n#if READ_FROM_FILE\n#include <fstream>\n#endif\n\n#include <iostream>\n#include <map>\n#include <vector>\n\nusing namespace std;\n\nconst int house = 1;\nconst int church = 2;\nconst int dx[] = { 1, 0, -1, 0 };\nconst int dy[] = { 0, -1, 0, 1 };\nconst int max_num_house_in_dp = 23;\nint width = -1;\nint height = -1;\nvector<vector<char>> index_grid;\nint church_x = -1;\nint church_y = -1;\nunsigned char num_house = -1;\nint max_num_house = -1;\nmap<pair<pair<unsigned short, unsigned char>, unsigned char>, int> dp;\n\n\nbool is_inside(int x, int y) {\n\treturn 0 <= x && x < width && 0 <= y && y < height;\n}\n\nint count_visited_houses(pair<unsigned short, unsigned char> cur_visited_houses) {\n\tint counter = 0;\n\tint f = cur_visited_houses.first;\n\tint s = cur_visited_houses.second;\n\n\twhile (f > 0) {\n\t\tcounter += f & 1;\n\t\tf >>= 1;\n\t}\n\n\twhile (s > 0) {\n\t\tcounter += s & 1;\n\t\ts >>= 1;\n\t}\n\n\treturn counter;\n}\n\nbool is_visited(char idx, pair<unsigned short, unsigned char> cur_visited_houses) {\n\tif (idx < 16) {\n\t\treturn (cur_visited_houses.first & (1 << idx)) > 0;\n\t}\n\telse {\n\t\tidx -= 16;\n\t\treturn (cur_visited_houses.second & (1 << idx)) > 0;\n\t}\n}\n\nbool can_go_ahead(int x, int y, pair<unsigned short, unsigned char> cur_visited_houses) {\n\tint num_visited_houses = count_visited_houses(cur_visited_houses);\n\tchar c_idx = -1;\n\n\tif (x == church_x && y == church_y) {\n\t\tif (num_visited_houses < num_house) {\n\t\t\treturn true;\n\t\t}\n\t\telse {\n\t\t\treturn false;\n\t\t}\n\t}\n\n\tif (index_grid[y][x] < 0) {\n\t\treturn true;\n\t}\n\t\n\tc_idx = index_grid[y][x];\n\treturn is_visited(c_idx, cur_visited_houses);\n}\n\npair<unsigned short, unsigned char> add_house(unsigned char house_idx, pair<unsigned short, unsigned char> visited_houses) {\n\tif (house_idx < 16) {\n\t\tvisited_houses.first |= (1 << house_idx);\n\t}\n\telse {\n\t\thouse_idx -= 16;\n\t\tvisited_houses.second |= (1 << house_idx);\n\t}\n\treturn visited_houses;\n}\n\nint dfs(pair<pair<unsigned short, unsigned char>, unsigned char> dp_state, int x, int y) {\n\tpair<unsigned short, unsigned char> cur_visited_houses = dp_state.first;\n\tint num_visited_houses = count_visited_houses(cur_visited_houses);\n\tunsigned char c_idx = index_grid[y][x];\n\tint cur_num_paths = 0;\n\n\tdp_state = pair<pair<unsigned short, unsigned char>, unsigned char>(cur_visited_houses, c_idx);\n\n\tif (num_visited_houses >= num_house) {\n\t\tif (x == church_x and y == church_y) {\n\t\t\treturn 1;\n\t\t}\n\t}\n\n\tif (num_visited_houses < max_num_house) {\n\t\tif (dp.count(dp_state) > 0) {\n\t\t\treturn dp[dp_state];\n\t\t}\n\t}\n\n\tfor (int i = 0; i < 4; i++) {\n\t\tint nx = x + dx[i];\n\t\tint ny = y + dy[i];\n\t\tchar n_idx = -1;\n\t\tpair<unsigned short, unsigned char> n_visited_houses = cur_visited_houses;\n\n\t\twhile (is_inside(nx, ny) && can_go_ahead(nx, ny, cur_visited_houses)) {\n\t\t\tnx += dx[i];\n\t\t\tny += dy[i];\n\t\t}\n\n\t\tif (!is_inside(nx, ny)) {\n\t\t\tcontinue;\n\t\t}\n\t\t\n\t\tn_idx = index_grid[ny][nx];\n\t\tn_visited_houses = add_house(n_idx, n_visited_houses);\n\t\tcur_num_paths += dfs(pair<pair<unsigned short, unsigned char>, unsigned char>(n_visited_houses, n_idx), nx, ny);\n\t}\n\n\tif (num_visited_houses < max_num_house) {\n\t\tdp[dp_state] = cur_num_paths;\n\t}\n\treturn cur_num_paths;\n}\n\n\n\nint main(int argc, char** argv) {\n#if READ_FROM_FILE\n\tifstream ifs(\"test0.txt\");\n\tcin.rdbuf(ifs.rdbuf());\n#endif\n\n\twhile (true) {\n\t\tvector<vector<char>> grid;\n\t\tpair<pair<unsigned short, unsigned char>, unsigned char> initial_state(pair<unsigned short, unsigned char>(0, 0), 0);\n\n\t\tcin >> width >> height;\n\t\tif (width == 0 && height == 0) {\n\t\t\tbreak;\n\t\t}\n\t\t\n\t\tindex_grid.clear();\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tvector<char> row(width, -1);\n\n\t\t\tindex_grid.push_back(row);\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tint cell = -1;\n\n\t\t\t\tcin >> cell;\n\t\t\t\trow[x] = cell;\n\t\t\t}\n\t\t\tgrid.push_back(row);\n\t\t}\n\t\t\n\t\tnum_house = 0;\n\t\tchurch_x = -1;\n\t\tchurch_y = -1;\n\n\t\tfor (int y = 0; y < height; y++) {\n\t\t\tfor (int x = 0; x < width; x++) {\n\t\t\t\tif (grid[y][x] == house) {\n\t\t\t\t\tindex_grid[y][x] = num_house;\n\t\t\t\t\tnum_house++;\n\t\t\t\t}\n\t\t\t\telse if (grid[y][x] == church) {\n\t\t\t\t\tchurch_x = x;\n\t\t\t\t\tchurch_y = y;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tmax_num_house = min(max_num_house_in_dp, int(num_house));\n\t\tdp.clear();\n\t\tdp[initial_state] = 0;\n\t\tcout << dfs(initial_state, church_x, church_y) << endl;\n\t}\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 1770, "memory_kb": 73304, "score_of_the_acc": -1.1535, "final_rank": 20 }, { "submission_id": "aoj_0548_4996202", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\n\nint main(){\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\tint h,w; \n\twhile(cin >> w >> h,w){\n\t vector<pair<int,int>> v;\n \tint sx,sy;\n \tfor(int i=0;i<h;i++){\n \t\tfor(int j=0;j<w;j++){\n \t\t\tint a; cin >> a;\n \t\t\tif(a==2){\n \t\t\t\tsx=i,sy=j;\n \t\t\t}\n \t\t\telse if(a==1){\n \t\t\t\tv.push_back({i,j});\n \t\t\t}\n \t\t}\n \t}\n \tv.push_back({sx,sy});\n \tint n=v.size();\n \tvector<int> l(n,-1),r(n,-1),u(n,-1),d(n,-1);\n \tfor(int i=0;i<n;i++){\n \t\tint ma,id;\n \t\tma=-1; id=-1;\n \t\tfor(int j=0;j<n;j++){\n \t\t\tif(v[i].first==v[j].first and ma<v[j].second and v[j].second<v[i].second){\n \t\t\t\tma=v[j].second;\n \t\t\t\tid=j;\n \t\t\t}\n \t\t}\n \t\tl[i]=id;\n \t\tma=1e9; id=-1;\n \t\tfor(int j=0;j<n;j++){\n \t\t\tif(v[i].first==v[j].first and ma>v[j].second and v[j].second>v[i].second){\n \t\t\t\tma=v[j].second;\n \t\t\t\tid=j;\n \t\t\t}\n \t\t}\n \t\tr[i]=id;\n \t\tma=-1; id=-1;\n \t\tfor(int j=0;j<n;j++){\n \t\t\tif(v[i].second==v[j].second and v[j].first>ma and v[j].first<v[i].first){\n \t\t\t\tma=v[j].first;\n \t\t\t\tid=j;\n \t\t\t}\n \t\t}\n \t\tu[i]=id;\n \t\tma=1e9; id=-1;\n \t\tfor(int j=0;j<n;j++){\n \t\t\tif(v[i].second==v[j].second and v[j].first<ma and v[j].first>v[i].first){\n \t\t\t\tma=v[j].first;\n \t\t\t\tid=j;\n \t\t\t}\n \t\t}\n \t\td[i]=id;\n \t}\n \tint res=0;\n \tauto dfs=[&](auto dfs,int bit,int cur)->void{\n \t\tif(bit==0){\n \t\t\tif(v[cur].first==v.back().first or v[cur].second==v.back().second)res++;\n \t\t\treturn;\n \t\t}\n \t\tint nx;\n \t\t// left\n \t\tnx=cur;\n \t\twhile(1){\n \t\t\tnx=l[nx];\n \t\t\tif(nx==-1)break;\n \t\t\telse{\n \t\t\t\tif((1<<nx)&bit){\n \t\t\t\t\tdfs(dfs,bit-(1<<nx),nx);\n \t\t\t\t\tbreak;\n \t\t\t\t}\n \t\t\t}\n \t\t}\n \t\t// right\n \t\tnx=cur;\n \t\twhile(1){\n \t\t\tnx=r[nx];\n \t\t\tif(nx==-1)break;\n \t\t\telse{\n \t\t\t\tif((1<<nx)&bit){\n \t\t\t\t\tdfs(dfs,bit-(1<<nx),nx);\n \t\t\t\t\tbreak;\n \t\t\t\t}\n \t\t\t}\n \t\t}\n \t\t// up\n \t\tnx=cur;\n \t\twhile(1){\n \t\t\tnx=u[nx];\n \t\t\tif(nx==-1)break;\n \t\t\telse{\n \t\t\t\tif((1<<nx)&bit){\n \t\t\t\t\tdfs(dfs,bit-(1<<nx),nx);\n \t\t\t\t\tbreak;\n \t\t\t\t}\n \t\t\t}\n \t\t}\n \t\t// down\n \t\tnx=cur;\n \t\twhile(1){\n \t\t\tnx=d[nx];\n \t\t\tif(nx==-1)break;\n \t\t\telse{\n \t\t\t\tif((1<<nx)&bit){\n \t\t\t\t\tdfs(dfs,bit-(1<<nx),nx);\n \t\t\t\t\tbreak;\n \t\t\t\t}\n \t\t\t}\n \t\t}\n \t};\n \tn--;\n \tdfs(dfs,(1<<n)-1,n);\n \tcout << res << endl;\n\t}\n}", "accuracy": 1, "time_ms": 2610, "memory_kb": 3132, "score_of_the_acc": -0.2732, "final_rank": 1 }, { "submission_id": "aoj_0548_4564873", "code_snippet": "#include <iostream>\n#include <utility>\n#include <tuple>\n#include <vector>\n#include <string>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <unordered_set>\n#include <algorithm>\n#include <functional>\n#include <climits>\n#include <numeric>\n#include <queue>\n#include <cmath>\n#include <iomanip>\n#include <array>\n#include <string>\n#include <stack>\n#include <cassert>\n#include <memory>\nstruct Coordinate {\n\tint x, y;\n\tCoordinate operator+(const Coordinate that) const {\n\t\treturn Coordinate{ x + that.x, y + that.y };\n\t}\n};\n\nconstexpr std::array<Coordinate, 4> direction{ Coordinate{1, 0}, Coordinate{-1, 0}, Coordinate{0, 1}, Coordinate{0, -1} };\nint count_route(const Coordinate current, const int delivered, const std::vector<std::vector<int>>& state) {\n\tint count{ 0 };\n\tfor (const auto dir : direction) {\n\t\tfor (auto next = current + dir; 0 <= next.x && next.x < state.size() && 0 <= next.y && next.y < state[next.x].size(); next = next + dir) {\n\t\t\tif (state[next.x][next.y] == -1) {\n\t\t\t\tif (delivered == 0) {\n\t\t\t\t\t++count;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse if (state[next.x][next.y] > 0) {\n\t\t\t\tif ((delivered & (1 << (state[next.x][next.y] - 1))) != 0) {\n\t\t\t\t\tcount += count_route(next, delivered ^ (1 << (state[next.x][next.y] - 1)), state);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\treturn count;\n}\nint main() {\n\tint m, n; std::cin >> m >> n;\n\twhile (m != 0 && n != 0) {\n\t\tstd::vector<std::vector<int>> state(n, std::vector<int>(m));\n\t\tfor (auto& line : state) for (auto& cell : line) std::cin >> cell;\n\t\tCoordinate start{ -1, -1 };\n\t\tint count{ 0 };\n\t\tfor (auto i = 0; i < n; ++i) {\n\t\t\tfor (auto j = 0; j < m; ++j) {\n\t\t\t\tif (state[i][j] == 2) {\n\t\t\t\t\tstart = Coordinate{ i, j };\n\t\t\t\t\tstate[i][j] = -1;\n\t\t\t\t}\n\t\t\t\tif (state[i][j] == 1) {\n\t\t\t\t\tstate[i][j] = ++count;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tstd::cout << count_route(start, (1 << count) - 1, state) << '\\n';\n\t\tstd::cin >> m >> n;\n\t}\n}", "accuracy": 1, "time_ms": 7780, "memory_kb": 3152, "score_of_the_acc": -1.0017, "final_rank": 16 } ]
aoj_0541_cpp
散歩 問題 JOI 町に住む太郎君は, ある日,健康増進のために散歩を日課にしようと思い立った. 太郎君の住む JOI 町には,図のように,東西方向に走る ( H + 1) 本の道路と,南北 方向に走る ( W + 1) 本の道路が碁盤目状に通っている.太郎君の家はもっとも北西の 交差点にあり,ここから散歩を開始する. 以降,北から a 番目,西から b 番目の交差点を ( a , b ) で表す.たとえば,太郎君の家がある交差点は (1, 1) である. 図: JOI 町の図 ( H = 3, W = 4 の場合).図の上が北,左が西に対応する. 太郎君は,散歩のルートが日々違ったほうが面白いと考えたので,(1, 1) から ( H , W ) までの H × W 個の交差点に, 「東」または「南」の文字を書き,次のようなルールに従って毎日散歩を行うことにした. 文字の書かれた交差点にいる場合,その交差点に書かれている文字が「東」な ら「南」に, 「南」なら「東」に文字を書き換え,もともと書かれていた文字の方角にある次の交差点まで進む. もっとも東やもっとも南の道路に到達したら散歩を終了する. この計画を考えた後,太郎君は,将来の散歩で自分がどのようなルートをたどる ことになるのかが気になった.太郎君のために,太郎君の N 回目の散歩のルートを 予測するプログラムを作成せよ. 入力 入力は複数のデータセットからなる．各データセットは以下の形式で与えられる． 1 行目には,3 つの正整数が空白区切りで書かれている.これらは,問題文中の 3 つの数値 H , W , N の値である. H , W , N はそれぞれ, 1 ≤ H ≤ 1000, 1 ≤ W ≤ 1000, 1 ≤ N ≤ 10000000 = 10 7 をみたす. 2 行目から H + 1 行目には,それぞれ W 個の整数が空白区切りで書かれている.これらは,太郎君が最初に交差点に書いた文字の情報を表す. i + 1 行目の j 番目の整数が 0 なら,交差点 ( i , j ) に書かれた文字が「南」であることを, 1 なら, 交差点 ( i , j ) に書かれた文字が「東」であることを表す. 採点用データのうち,配点の 30%分については, H ≤ 100, W ≤ 100, N ≤ 1000 を満たす. H , W , N がすべて 0 のとき入力の終了を示す. データセットの数は 10 を超えない． 出力 データセットごとに次の形式で出力する. N 回目の散歩において太郎君が散歩を終了する交差点が ( i , j ) のとき, i と j をこの順に空白で区切って出力せよ. 入出力の例 入力例 3 4 3 1 0 1 1 0 1 0 0 1 0 1 0 0 0 0 出力例 1 5 上の例では,1 回目から 3 回目の散歩のルートは次の図のようになる. 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0541_10525122", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n while (true) {\n int h, w, n;\n cin >> h >> w >> n;\n if (!h && !w && !n) break; // 終了条件\n\n // c[y][x]: (y,x) マスに到達するトークン数\n // 入力のマス a を足したり反転判定に使う\n vector<vector<long long>> c(h+1, vector<long long>(w+1, 0));\n int a;\n c[0][0] = n - 1; // 最初に (0,0) に n−1 個を置く\n\n // 行 i, 列 j を走査\n for(int i = 0; i < h; i++){\n for(int j = 0; j < w; j++){\n cin >> a;\n long long tok = c[i][j];\n long long half = tok / 2;\n // 均等分配\n c[i+1][j] += half;\n c[i][j+1] += half;\n // 余り1なら a によって振り分け先を決定\n if (tok & 1LL) {\n if (a) {\n // a==1 なら下に余り\n c[i][j+1]++;\n } else {\n // a==0 なら右に余り\n c[i+1][j]++;\n }\n }\n // c[i][j] に a を「スイッチ」として足す\n c[i][j] += a;\n }\n }\n\n // 最終的に (0,0) から落ちてくるルートを追跡\n int x = 0, y = 0;\n while (x < w && y < h) {\n // c[y][x] の偶奇で進行方向を決定\n if (c[y][x] & 1LL) {\n x++;\n } else {\n y++;\n }\n }\n\n // 1-index 出力\n cout << (y + 1) << \" \" << (x + 1) << \"\\n\";\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 11248, "score_of_the_acc": -0.0778, "final_rank": 1 }, { "submission_id": "aoj_0541_9714248", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i,n) for(int i=0;i<(n);i++)\n\n// #include <atcoder/all>\n// using namespace atcoder;\n// using mint=modint1000000007;\n\nusing ll=long long;\nusing ull=unsigned long long;\nusing P=pair<int,int>;\nusing Pl=pair<ll,ll>;\nusing Pd=pair<double,int>;\n\nconst ll ll_INF=1e18;\nconst int INF=1001001001;\nconst int di[]={0,1,0,-1};\nconst int dj[]={1,0,-1,0};\n\ntemplate<class T>\nvoid chmin(T &a, T b) { a=min(a,b); }\ntemplate<class T>\nvoid chmax(T &a, T b) { a=max(a,b); }\n\nstruct Edge{\n int to; ll cost;\n Edge(){}\n Edge(int to):to(to){};\n Edge(int to, ll cost):to(to),cost(cost){};\n};\n\nint main(){\n while(true){\n int h,w,n; cin >> h >> w >> n;\n if(h==0 && w==0 && n==0) break;\n vector direction(h,vector<int>(w));\n REP(i,h)REP(j,w){\n int d; cin >> d;\n direction.at(i).at(j)=d;\n }\n vector dp(h+1,vector<int>(w+1));\n dp.at(0).at(0)=n-1;\n REP(i,h)REP(j,w){\n if(direction.at(i).at(j)){\n dp.at(i).at(j+1)+=(dp.at(i).at(j)+1)/2;\n dp.at(i+1).at(j)+=dp.at(i).at(j)/2;\n } else {\n dp.at(i).at(j+1)+=dp.at(i).at(j)/2;\n dp.at(i+1).at(j)+=(dp.at(i).at(j)+1)/2;\n }\n }\n\n REP(i,h)REP(j,w){\n if(dp.at(i).at(j)&1) direction.at(i).at(j)^=1;\n }\n int x=0,y=0;\n while(x<h && y<w){\n if(direction.at(x).at(y)) y++;\n else x++;\n }\n cout << x+1 << \" \" << y+1 << endl;\n }\n}", "accuracy": 1, "time_ms": 110, "memory_kb": 10620, "score_of_the_acc": -0.7273, "final_rank": 13 }, { "submission_id": "aoj_0541_9559388", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int H,W,N;\n while(cin>>H>>W>>N,H+W+N!=0){\n vector<vector<int>> A(H,vector<int>(W));\n vector<vector<int>> DP(H,vector<int>(W,0));\n DP[0][0]=N-1;\n for(int h=0;h<H;h++)for(int w=0;w<W;w++){\n cin>>A[h][w];\n if(h!=0)DP[h][w]+=(DP[h-1][w]+1-A[h-1][w])/2;\n if(w!=0)DP[h][w]+=(DP[h][w-1]+A[h][w-1])/2;\n }\n for(int h=0;h<H;h++)for(int w=0;w<W;w++)if(DP[h][w]%2)A[h][w]=1-A[h][w];\n int y=0,x=0;\n while(y<H&&x<W){\n if(A[y][x])x++;\n else y++;\n }\n cout<<y+1<<\" \"<<x+1<<endl;\n }\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 10920, "score_of_the_acc": -0.6735, "final_rank": 11 }, { "submission_id": "aoj_0541_9470973", "code_snippet": "#include <bits/stdc++.h>\n//#include <atcoder/all>\nusing namespace std;\n//using namespace atcoder;\n#define rep(i,n) for(int i=0;i<(n);i++)\n//using mint=modint1000000007;\nusing ll=long long;\nusing P=pair<int,int>;\nusing Pl=pair<ll,ll>;\n\nconst int INF=1e9;\nconst int dx[]={0,1};\nconst int dy[]={1,0};\n\nstruct Edge{\n int to; ll cost;\n Edge(){}\n Edge(int to):to(to){};\n Edge(int to, ll cost):to(to),cost(cost){};\n};\n\nint main(){\n while(true){\n int h,w,n; cin >> h >> w >> n;\n if(h==0 && w==0 && n==0) break;\n vector dir(h,vector<int>(w));\n rep(i,h) rep(j,w) cin >> dir[i][j];\n vector dp(h+1,vector<int>(w+1));\n dp[0][0]=n-1;\n rep(i,h) rep(j,w){\n if(dir[i][j]==0){\n dp[i+1][j]+=dp[i][j]-dp[i][j]/2;\n dp[i][j+1]+=dp[i][j]/2;\n } else {\n dp[i+1][j]+=dp[i][j]/2;\n dp[i][j+1]+=dp[i][j]-dp[i][j]/2;\n }\n }\n rep(i,h) rep(j,w) {\n dir[i][j]=(dir[i][j]+dp[i][j]%2)%2;\n }\n\n int i=0,j=0;\n while(i<h && j<w){\n if(dir[i][j]==0) i++;\n else j++;\n }\n cout << i+1 << \" \" << j+1 << endl;\n }\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 10948, "score_of_the_acc": -0.677, "final_rank": 12 }, { "submission_id": "aoj_0541_9458195", "code_snippet": "#include <bits/stdc++.h>\n//#include <atcoder/all>\nusing namespace std;\n//using namespace atcoder;\n#define rep(i,n) for(int i=0;i<(n);i++)\n//using mint=modint1000000007;\nusing ll=long long;\nusing P=pair<int,int>;\n\nconst int INF=1001001001;\nconst int dx[]={1,0};\nconst int dy[]={0,1};\n\nstruct Edge{\n int to,cost;\n Edge(){}\n Edge(int to):to(to){};\n Edge(int to, int cost):to(to),cost(cost){};\n};\n\nint main(){\n while(true){\n int h,w,n; cin>>h>>w>>n;\n if(h==0 && w==0 && n==0) break;\n vector dir(h,vector<int>(w));\n rep(i,h) rep(j,w) cin>>dir[i][j];\n vector dp(h+1,vector<int>(w+1));\n dp[0][0]=n-1;\n rep(i,h) rep(j,w){\n if(dir[i][j]){\n dp[i+1][j]+=dp[i][j]/2;\n dp[i][j+1]+=dp[i][j]-dp[i][j]/2;\n } else {\n dp[i][j+1]+=dp[i][j]/2;\n dp[i+1][j]+=dp[i][j]-dp[i][j]/2;\n }\n }\n rep(i,h)rep(j,w) dir[i][j]=(dir[i][j]+dp[i][j]%2)%2;\n int i=0,j=0;\n while(i<h && j<w){\n if(dir[i][j]) j++;\n else i++;\n }\n cout << i+1 << \" \" << j+1 << endl;\n }\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 10832, "score_of_the_acc": -0.6626, "final_rank": 9 }, { "submission_id": "aoj_0541_9456458", "code_snippet": "#include <bits/stdc++.h>\n//#include <atcoder/all>\nusing namespace std;\n//using namespace atcoder;\n#define rep(i,n) for(int i=0;i<(n);i++)\n//using mint=modint1000000007;\nusing ll=long long;\nusing P=pair<int,int>;\n\nconst int INF=1001001001;\nconst int dx[]={1,0};\nconst int dy[]={0,1};\n\nstruct Edge{\n int to,cost;\n Edge(){}\n Edge(int to):to(to){};\n Edge(int to, int cost):to(to),cost(cost){};\n};\n\nint main(){\n while(true){\n int h,w,n; cin >> h >> w >> n;\n if(h==0 && w==0 && n==0) break;\n vector<vector<int>> dir(h,vector<int>(w));\n rep(i,h) rep(j,w) cin >> dir[i][j];\n vector dp(h+1,vector<int>(w+1));\n dp[0][0]=n-1;\n rep(i,h) rep(j,w){\n int now=dp[i][j];\n if(dir[i][j]) {\n dp[i+1][j]+=now/2;\n dp[i][j+1]+=now-now/2;\n } else {\n dp[i][j+1]+=now/2;\n dp[i+1][j]+=now-now/2;\n }\n }\n rep(i,h) rep(j,w){\n dir[i][j]=(dir[i][j]+dp[i][j]%2)%2;\n }\n // rep(i,h) {\n // rep(j,w) cout << dir[i][j];\n // cout << endl;\n // }\n int x=0,y=0;\n while(x<h && y<w){\n if(dir[x][y]) y++;\n else x++;\n }\n cout << x+1 << \" \" << y+1 << endl;\n }\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 10864, "score_of_the_acc": -0.6666, "final_rank": 10 }, { "submission_id": "aoj_0541_9416544", "code_snippet": "#include <bits/stdc++.h>\n//#include <atcoder/all>\nusing namespace std;\n//using namespace atcoder;\n#define rep(i,n) for(int i=0;i<(n);i++)\n//using mint=modint1000000007;\nusing ll=long long;\nusing P=pair<int,int>;\n\nconst int INF=1001001001;\nconst int dx[]={1,0};\nconst int dy[]={0,1};\n\nstruct Edge{\n int to,cost;\n Edge(){}\n Edge(int to):to(to){};\n Edge(int to, int cost):to(to),cost(cost){};\n};\n\nint main(){\n while(1){\n int h,w,n; cin >> h >> w >> n;\n if(h==0) break;\n vector d(h,vector<int>(w));\n rep(i,h)rep(j,w) cin >> d[i][j];\n vector dp(h+1,vector<int>(w+1));\n dp[0][0]=n;\n rep(i,h)rep(j,w){\n int m=dp[i][j]/2;\n if(d[i][j]){\n dp[i+1][j]+=m;\n dp[i][j+1]+=dp[i][j]-m;\n } else {\n dp[i][j+1]+=m;\n dp[i+1][j]+=dp[i][j]-m;\n }\n }\n int x=0,y=0;\n while(x<h && y<w){\n //初手東\n if(d[x][y]){\n //dpはn回散歩を行った後の通過回数\n //初手東でdpが奇数ならn回散歩した後は南になった状態\n //つまりn回目は東へ進んだということ\n if(dp[x][y]&1) y++;\n else x++;\n } else {\n if(dp[x][y]&1) x++;\n else y++;\n }\n }\n x++; y++;\n cout << x << ' ' << y << '\\n';\n }\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 10812, "score_of_the_acc": -0.6601, "final_rank": 8 }, { "submission_id": "aoj_0541_8860562", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint mp[1001][1001], dp[1001][1001];\nint h, w, n;\n\nvoid saiki(int x, int y) {\n int dx[] = {0, 1}, dy[] = {1, 0};\n if (y == h || x == w)\n cout << y + 1 << \" \" << x + 1 << endl;\n else\n saiki(x + dx[mp[y][x]], y + dy[mp[y][x]]);\n}\n\nint main() {\n while (1) {\n cin >> h >> w >> n;\n if (!h && !w && !n)\n break;\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++)\n cin >> mp[i][j];\n memset(dp, 0, sizeof(dp));\n dp[0][0] = n - 1;\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++) {\n int half = dp[i][j] / 2; // Compute half\n int remainder = dp[i][j] % 2; // Compute remainder\n dp[i][j + 1] += half + mp[i][j] * remainder;\n dp[i + 1][j] += half + !mp[i][j] * remainder;\n if (remainder)\n mp[i][j] = !mp[i][j];\n }\n saiki(0, 0);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 140, "memory_kb": 10924, "score_of_the_acc": -1.0377, "final_rank": 18 }, { "submission_id": "aoj_0541_8821782", "code_snippet": "#include <iostream>\n#include <cstring>\nusing namespace std;\n\nint mp[1001][1001], dp[1001][1001];\nint h, w, n;\n\nvoid saiki(int x, int y) {\n int dx[] = {0, 1}, dy[] = {1, 0};\n if (y == h || x == w)\n cout << y + 1 << \" \" << x + 1 << '\\n';\n else\n saiki(x + dx[mp[y][x]], y + dy[mp[y][x]]);\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(NULL);\n\n while (1) {\n cin >> h >> w >> n;\n if (!h && !w && !n)\n break;\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++)\n cin >> mp[i][j];\n memset(dp, 0, sizeof(dp));\n dp[0][0] = n - 1;\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++) {\n dp[i][j + 1] += dp[i][j] / 2 + mp[i][j] * dp[i][j] % 2;\n dp[i + 1][j] += dp[i][j] / 2 + !mp[i][j] * dp[i][j] % 2;\n if (dp[i][j] % 2)\n mp[i][j] = !mp[i][j];\n }\n saiki(0, 0);\n }\n\n return 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 11184, "score_of_the_acc": -0.2517, "final_rank": 7 }, { "submission_id": "aoj_0541_8214906", "code_snippet": "#include <iostream>\n#include <cstring>\n#define MAX_SIZE 1001\n\nint mp[MAX_SIZE][MAX_SIZE], dp[MAX_SIZE][MAX_SIZE];\nint h, w, n;\n\nvoid saiki(int x, int y) {\n int dx[] = {0, 1}, dy[] = {1, 0};\n if (y == h || x == w)\n std::cout << y + 1 << \" \" << x + 1 << '\\n';\n else\n saiki(x + dx[mp[y][x]], y + dy[mp[y][x]]);\n}\n\nint main() {\n std::ios_base::sync_with_stdio(false); \n std::cin.tie(NULL);\n while (1) {\n std::cin >> h >> w >> n;\n if (!h && !w && !n)\n break;\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++)\n std::cin >> mp[i][j];\n std::memset(dp, 0, sizeof(dp));\n dp[0][0] = n - 1;\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++) {\n dp[i][j + 1] += dp[i][j] / 2 + mp[i][j] * dp[i][j] % 2;\n dp[i + 1][j] += dp[i][j] / 2 + !mp[i][j] * dp[i][j] % 2;\n if (dp[i][j] % 2)\n mp[i][j] = !mp[i][j];\n }\n saiki(0, 0);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 10996, "score_of_the_acc": -0.2284, "final_rank": 6 }, { "submission_id": "aoj_0541_8214897", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint mp[1001][1001], dp[1001][1001];\nint h, w, n;\nvoid saiki(int x, int y) {\n int dx[] = {0, 1}, dy[] = {1, 0};\n if (y == h || x == w)\n cout << y + 1 << \" \" << x + 1 << endl;\n else\n saiki(x + dx[mp[y][x]], y + dy[mp[y][x]]);\n}\nint main() {\n while (1) {\n cin >> h >> w >> n;\n if (!h && !w && !n)\n break;\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++)\n cin >> mp[i][j];\n memset(dp, 0, sizeof(dp));\n dp[0][0] = n - 1;\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++) {\n dp[i][j + 1] += dp[i][j] / 2 + mp[i][j] * dp[i][j] % 2;\n dp[i + 1][j] += dp[i][j] / 2 + !mp[i][j] * dp[i][j] % 2;\n if (dp[i][j] % 2)\n mp[i][j] = !mp[i][j];\n }\n saiki(0, 0);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 140, "memory_kb": 10876, "score_of_the_acc": -1.0317, "final_rank": 17 }, { "submission_id": "aoj_0541_8214896", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint mp[1001][1001], dp[1001][1001];\n;\nint h, w, n;\nvoid saiki(int x, int y) {\n int dx[] = {0, 1}, dy[] = {1, 0};\n if (y == h || x == w)\n cout << y + 1 << \" \" << x + 1 << endl;\n else\n saiki(x + dx[mp[y][x]], y + dy[mp[y][x]]);\n}\nint main() {\n while (1) {\n cin >> h >> w >> n;\n if (!h && !w && !n)\n break;\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++)\n cin >> mp[i][j];\n memset(dp, 0, sizeof(dp));\n dp[0][0] = n - 1;\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++) {\n dp[i][j + 1] += dp[i][j] / 2 + mp[i][j] * dp[i][j] % 2;\n dp[i + 1][j] += dp[i][j] / 2 + !mp[i][j] * dp[i][j] % 2;\n if (dp[i][j] % 2)\n mp[i][j] = !mp[i][j];\n }\n saiki(0, 0);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 140, "memory_kb": 10824, "score_of_the_acc": -1.0253, "final_rank": 15 }, { "submission_id": "aoj_0541_8207515", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint mp[1001][1001], dp[1001][1001];\n;\nint h, w, n;\nvoid saiki(int x, int y) {\n int dx[] = {0, 1}, dy[] = {1, 0};\n if (y == h || x == w)\n cout << y + 1 << \" \" << x + 1 << endl;\n else\n saiki(x + dx[mp[y][x]], y + dy[mp[y][x]]);\n}\nint main() {\n while (1) {\n cin >> h >> w >> n;\n if (!h && !w && !n)\n break;\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++)\n cin >> mp[i][j];\n memset(dp, 0, sizeof(dp));\n dp[0][0] = n - 1;\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++) {\n dp[i][j + 1] += dp[i][j] / 2 + mp[i][j] * dp[i][j] % 2;\n dp[i + 1][j] += dp[i][j] / 2 + !mp[i][j] * dp[i][j] % 2;\n if (dp[i][j] & 1)\n mp[i][j] = !mp[i][j];\n }\n saiki(0, 0);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 140, "memory_kb": 10824, "score_of_the_acc": -1.0253, "final_rank": 15 }, { "submission_id": "aoj_0541_8115329", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int MAX = 1001;\nint mp[MAX][MAX], dp[MAX][MAX];\nint h, w, n;\nvoid saiki(int x, int y) {\n int dx[] = {0, 1}, dy[] = {1, 0};\n if (y == h || x == w)\n cout << y + 1 << \" \" << x + 1 << endl;\n else\n saiki(x + dx[mp[y][x]], y + dy[mp[y][x]]);\n}\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n while (1) {\n cin >> h >> w >> n;\n if (!h && !w && !n)\n break;\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++)\n cin >> mp[i][j];\n memset(dp, 0, sizeof(dp));\n dp[0][0] = n - 1;\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++) {\n int x = dp[i][j] / 2;\n dp[i][j + 1] += x + mp[i][j] * (dp[i][j] & 1);\n dp[i + 1][j] += x + !mp[i][j] * (dp[i][j] & 1);\n if (dp[i][j] & 1)\n mp[i][j] = !mp[i][j];\n }\n saiki(0, 0);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 10960, "score_of_the_acc": -0.2239, "final_rank": 5 }, { "submission_id": "aoj_0541_8115324", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint mp[1001][1001], dp[1001][1001];\nint h, w, n;\nvoid saiki(int x, int y) {\n int dx[] = {0, 1}, dy[] = {1, 0};\n if (y == h || x == w)\n cout << y + 1 << \" \" << x + 1 << endl;\n else\n saiki(x + dx[mp[y][x]], y + dy[mp[y][x]]);\n}\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n while (cin >> h >> w >> n, h || w || n) {\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++)\n cin >> mp[i][j];\n memset(dp, 0, sizeof(dp));\n dp[0][0] = n - 1;\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++) {\n int half = dp[i][j] / 2, odd = dp[i][j] % 2;\n dp[i][j + 1] += half + mp[i][j] * odd;\n dp[i + 1][j] += half + !mp[i][j] * odd;\n if (odd)\n mp[i][j] = !mp[i][j];\n }\n saiki(0, 0);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 10936, "score_of_the_acc": -0.221, "final_rank": 2 }, { "submission_id": "aoj_0541_8115321", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint mp[1001][1001], dp[1001][1001];\nint h, w, n;\nvoid saiki(int x, int y) {\n int dx[] = {0, 1}, dy[] = {1, 0};\n while (y != h && x != w) {\n int nx = x + dx[mp[y][x]];\n int ny = y + dy[mp[y][x]];\n x = nx;\n y = ny;\n }\n cout << y + 1 << \" \" << x + 1 << endl;\n}\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n while (1) {\n cin >> h >> w >> n;\n if (!h && !w && !n)\n break;\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++)\n cin >> mp[i][j];\n memset(dp, 0, sizeof(dp));\n dp[0][0] = n - 1;\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++) {\n int t = dp[i][j] % 2;\n dp[i][j + 1] += dp[i][j] / 2 + mp[i][j] * t;\n dp[i + 1][j] += dp[i][j] / 2 + !mp[i][j] * t;\n if (t)\n mp[i][j] = !mp[i][j];\n }\n saiki(0, 0);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 10936, "score_of_the_acc": -0.221, "final_rank": 2 }, { "submission_id": "aoj_0541_8115319", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint mp[1001][1001], dp[1001][1001];\nint h, w, n;\nvoid saiki(int x, int y) {\n int dx[] = {0, 1}, dy[] = {1, 0};\n if (y == h || x == w)\n cout << y + 1 << \" \" << x + 1 << endl;\n else\n saiki(x + dx[mp[y][x]], y + dy[mp[y][x]]);\n}\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n while (1) {\n cin >> h >> w >> n;\n if (!h && !w && !n)\n break;\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++)\n cin >> mp[i][j];\n memset(dp, 0, sizeof(dp));\n dp[0][0] = n - 1;\n for (int i = 0; i < h; i++)\n for (int j = 0; j < w; j++) {\n int t1 = dp[i][j] / 2 + mp[i][j] * dp[i][j] % 2;\n int t2 = dp[i][j] / 2 + !mp[i][j] * dp[i][j] % 2;\n dp[i][j + 1] += t1;\n dp[i + 1][j] += t2;\n if (dp[i][j] % 2)\n mp[i][j] = !mp[i][j];\n }\n saiki(0, 0);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 10956, "score_of_the_acc": -0.2234, "final_rank": 4 }, { "submission_id": "aoj_0541_7780395", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vl = vector<ll>;\nusing vvl = vector<vl>;\nusing pl = pair<ll,ll>;\nusing vp = vector<pl>;\n#define rep(i,n) for(ll i=0;i<(ll)(n);++i)\n#define reps(i,s,n) for(ll i=(s);i<(ll)(n);++i)\n#define rep1(i,n) for(ll i=1;i<=(ll)(n);++i)\ntemplate<typename T>inline bool chmax(T &a,T b){return a<b?a=b,true:false;}\ntemplate<typename T>inline bool chmin(T &a,T b){return a>b?a=b,true:false;}\n#define fi first\n#define se second\n#define pb push_back\n#define eb emplace_back\n#define be(v) (v).begin(),(v).end()\nconst long long INF = 1e18;\ninline ll ipow(ll x,ll p){\n\tll ret=x; rep1(i,p-1) ret*=x; return ret;\n}\n#ifdef DEBUG\n#include <debug.hpp>\n#endif\n\nbool solve(){\n#ifdef DEBUG\n\tcout << \"--- Input ---\" << endl;\n#endif\n\tll H,W,N;cin>>H>>W>>N;\n\tif(H==0 && W==0 && N==0)return false;\n\tvvl A(H,vl(W,0));\n\trep(h,H)rep(w,W)cin>>A.at(h).at(w);\n#ifdef DEBUG\n\tcout<<H<<\" \"<<W<<\" \"<<N<<endl<<A;\n\tcout << \"--- Logic ---\" << endl;\n#endif\n\tvvl dp(H,vl(W,0));\n\tdp.at(0).at(0)=N-1;\n\trep(h,H)rep(w,W){\n\t\tif(h-1>=0){\n\t\t\tdp.at(h).at(w)+=dp.at(h-1).at(w)/2;\n\t\t\tif(dp.at(h-1).at(w)%2 && !A.at(h-1).at(w))\n\t\t\t\tdp.at(h).at(w)+=1;\n\t\t}\n\t\tif(w-1>=0){\n\t\t\tdp.at(h).at(w)+=dp.at(h).at(w-1)/2;\n\t\t\tif(dp.at(h).at(w-1)%2 && A.at(h).at(w-1))\n\t\t\t\tdp.at(h).at(w)+=1;\n\t\t}\n\t}\n#ifdef DEBUG\n\tcout<<dp;\n#endif\n\tll ih=0,iw=0;\n\twhile(ih<H && iw<W){\n\t\tif(dp.at(ih).at(iw)%2 && A.at(ih).at(iw)) ++ih;\n\t\telse if(dp.at(ih).at(iw)%2 && !A.at(ih).at(iw)) ++iw;\n\t\telse if(!(dp.at(ih).at(iw)%2) && A.at(ih).at(iw)) ++iw;\n\t\telse if(!(dp.at(ih).at(iw)%2) && !A.at(ih).at(iw)) ++ih;\n#ifdef DEBUG\n\t\tcout<<\"ih=\"<<ih<<\" iw=\"<<iw<<endl;\n#endif\n\t}\n#ifdef DEBUG\n\tcout << \"--- Answer ---\" << endl;\n#endif\n\tcout<<ih+1<<\" \"<<iw+1<<endl;\n\treturn true;\n}\nint main(){\n\twhile(solve());\n\treturn 0;\n}\n//cout << fixed << setprecision(9);", "accuracy": 1, "time_ms": 100, "memory_kb": 18604, "score_of_the_acc": -1.6255, "final_rank": 20 }, { "submission_id": "aoj_0541_6897251", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\n#include <random>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\nint main()\n{\n int h, w, n;\n while(cin >> h >> w >> n, h + w + n){\n vii<int> d(h, vi<int>(w));\n rep(i, h) rep(j, w) cin >> d[i][j];\n \n vii<int> dp(h, vi<int>(w));\n dp[0][0] = n - 1;\n \n const int dx[2] = { 1, 0 };\n const int dy[2] = { 0, 1 };\n \n for (int i = 0; i < h + w; i++) {\n for (int j = 0; j <= i; j++) {\n int x = i - j;\n int y = j;\n if (x < 0 || x >= h || y < 0 || y >= w) continue;\n rep(k, 2) {\n int nx = x + dx[k];\n int ny = y + dy[k];\n if (nx >= h || ny >= w) continue;\n if (k == d[x][y]) dp[nx][ny] += (dp[x][y] + 1) / 2;\n else dp[nx][ny] += dp[x][y] / 2;\n }\n if (dp[x][y] % 2) d[x][y] = 1 - d[x][y];\n }\n }\n \n {\n int sx = 0, sy = 0;\n while (sx < h && sy < w) {\n int nx = sx + dx[d[sx][sy]];\n int ny = sy + dy[d[sx][sy]];\n sx = nx, sy = ny;\n }\n sx++, sy++;\n cout << sx << ' ' << sy << endl;\n }\n }\n return 0;\n}", "accuracy": 1, "time_ms": 110, "memory_kb": 10812, "score_of_the_acc": -0.7511, "final_rank": 14 }, { "submission_id": "aoj_0541_6739601", "code_snippet": "#include \"bits/stdc++.h\"\n\n#define REP(i,num) for(ll i=0;i<(num);++i)\n#define FOR(i,c,num) for(ll (i)=(c);(i)<(num);++(i))\n#define LOOP(i) while(i--)\n#define ALL(c) c.begin(),c.end()\n#define PRINTALL(c) for(auto pitr=c.begin();pitr!=c.end();++pitr){cout<<*pitr;if(next(pitr,1)!=c.end())cout<<' ';}cout<<endl;\n#define PAIRCOMP(c,comp) [](const pair<ll,ll>& lhs,const pair<ll,ll>& rhs){return lhs.c comp rhs.c;}\n\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\n\nconstexpr ll atcoder_mod = 1e9+7;\n\ntemplate<typename T=ll>\nT in(){ T x; cin >> x; return (x); }\ntemplate<typename T=ll,typename C=vector<T>>\nC vecin(int N){ C x(N);REP(i,N){ x[i]=in<T>(); }return x; }\ntemplate<typename T=ll,size_t N>\narray<T,N> arrin(){array<T,N> x;REP(i,N){ x[i]=in<T>(); }return x;}\n\nvoid vout(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid vout(Head&& h,Tail&&... t){ cout << ' ' << h;vout(forward<Tail>(t)...); }\nvoid out(){ cout << endl; }\ntemplate<typename Head,typename... Tail>\nvoid out(Head&& h,Tail&&... t){ cout << h;vout(forward<Tail>(t)...); }\n\ntemplate<typename T>\nbool chmax(T& a,T b){ if(a<b){ a=b;return true; }return false; }\ntemplate<typename T>\nbool chmin(T& a,T b){ if(a>b){ a=b;return true; }return false; }\n\nint main(){\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\tcout<<fixed<<setprecision(10);\n\n\twhile(true){\n\t\tll H=in(),W=in(),N=in();\n\t\tif(!H && !W && !N) break;\n\n\t\tvvll S(H,vll(W)),C(H+1,vll(W+1,0));\n\t\tREP(i,H){\n\t\t\tREP(j,W){\n\t\t\t\tS[i][j]=in();\n\t\t\t}\n\t\t}\n\t\tC[0][0]=N;\n\n\t\tREP(v,H){\n\t\t\tREP(u,W){\n\t\t\t\tll R=C[v][u]/2;\n\t\t\t\tif(S[v][u]){\n\t\t\t\t\tC[v+1][u] += R;\n\t\t\t\t\tC[v][u+1] += C[v][u]-R;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tC[v][u+1] += R;\n\t\t\t\t\tC[v+1][u] += C[v][u]-R;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tll x=0,y=0;\n\t\twhile(x<W && y<H){\n\t\t\tif(S[y][x]){\n\t\t\t\tif(C[y][x]%2){\n\t\t\t\t\tx++;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\ty++;\n\t\t\t\t}\n\t\t\t}\n\t\t\telse{\n\t\t\t\tif(C[y][x]%2){\n\t\t\t\t\ty++;\n\t\t\t\t}\n\t\t\t\telse{\n\t\t\t\t\tx++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tout(y+1,x+1);\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 18692, "score_of_the_acc": -1.1818, "final_rank": 19 } ]
aoj_0550_cpp
お菓子の分割 問題 長さ N ミリメートルの棒状のお菓子が 1 本ある(ここで N は偶数). 2 人の JOI 関係者が,このお菓子を複数本に切断して,合計 N/2 ミリメートルずつに分けること にした. 理由は不明であるが,このお菓子は場所によって切断のしやすさが異なっている. 2 人は,お菓子を左から 1 ミリメートルごとに調べ,各場所で切断に何秒かかるか を割り出した.2 人がお菓子を分けるための切断にかかる秒数の最小値を求めるプ ログラムを作成せよ. 入力 入力の 1 行目には,棒の長さ N(2 ≤ N ≤ 10000 ,ただし N は偶数) が書かれてい る.入力の i + 1 行目 (1 ≤ i ≤ N − 1) には,左端から i ミリメートル目の場所の切 断にかかる秒数を表す整数 ti (1 ≤ ti ≤ 10000) が書かれている.切断可能な場所が N − 1 箇所であることに注意せよ. 採点用データのうち,配点の 5% 分については,高々 2 カ所を切断することで最 小値を実現でき,10% 分については,高々 3 カ所を切断することで最小値を実現で きる.配点の 20% 分については,N ≤ 20 である. 出力 出力は2 人がお菓子を分るための切断にかかる秒数の最小値を含む 1 行からなる. 入出力例 入力例 1 6 1 8 12 6 2 出力例 1 7 この場合,左端から 1 ミリメートルと 4 ミリメートルの場所で切断するとかかる 秒数が最小となる.かかる秒数は 1 秒と 6 秒で,合計 7 秒である. 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0550_10854045", "code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nint n, a[100000], dp[5005][2];\nint main() {\n\tcin >> n; for (int i = 0; i < n - 1; i++)cin >> a[i];\n\tfor (int i = 0; i < 5005; i++) { dp[i][0] = 999999999; dp[i][1] = 999999999; }\n\tdp[n / 2][0] = 0; dp[n / 2][1] = 0;\n\tfor (int i = n - 1; i >= 0; i--) {\n\t\tfor (int j = 0; j <= n / 2; j++) {\n\t\t\tdp[j][0] = min(dp[j][0], dp[j][1] + a[i]);\n\t\t\tdp[j][1] = min(dp[j + 1][1], dp[j + 1][0] + a[i]);\n\t\t}\n\t}\n\tcout << min(dp[0][0], dp[0][1]) << endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3520, "score_of_the_acc": -0.2749, "final_rank": 4 }, { "submission_id": "aoj_0550_10399699", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstatic const int INF = 1e9;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int N;\n cin >> N;\n vector<int> t(N); // t[1..N-1] に切断コスト\n for(int i = 1; i < N; i++){\n cin >> t[i];\n }\n\n int half = N / 2;\n // dp[k][b]: 現在位置 i まで決めて、A(=1)の数が k、ラベルの色が b(0= B, 1= A) のときの最小コスト\n // N は最大 10000 で half=5000。i ごとには k=0..half のみ必要なのでメモリ ≃ 5001×2 をローリング配列で回す。\n vector<int> dp0(half+1, INF), dp1(half+1, INF);\n\n // i=1 の初期化：コスト0 でラベル B(0) or A(1) を許す\n dp0[0] = 0; // ラベルB で Aの数 0 の場合\n if(half >= 1) dp1[1] = 0; // ラベルA で Aの数 1 の場合\n\n // i=1 から i=N-1 まで遷移\n for(int i = 1; i < N; i++){\n vector<int> ndp0(half+1, INF), ndp1(half+1, INF);\n for(int k = 0; k <= half; k++){\n int c0 = dp0[k];\n int c1 = dp1[k];\n if(c0 < INF){\n // 旧ラベル B(0)→ 新ラベル B(0): 境界切断なし\n ndp0[k] = min(ndp0[k], c0);\n // 旧ラベル B(0)→ 新ラベル A(1): 境界 i で切断→ コスト +t[i]\n if(k+1 <= half)\n ndp1[k+1] = min(ndp1[k+1], c0 + t[i]);\n }\n if(c1 < INF){\n // 旧ラベル A(1)→ 新ラベル B(0): 切断\n ndp0[k] = min(ndp0[k], c1 + t[i]);\n // 旧ラベル A(1)→ 新ラベル A(1): そのまま\n if(k+1 <= half)\n ndp1[k+1] = min(ndp1[k+1], c1);\n }\n }\n dp0.swap(ndp0);\n dp1.swap(ndp1);\n }\n\n // 最終的に A の数 half, ラベル B/A いずれでも良いので最小値を取る\n int ans = min(dp0[half], dp1[half]);\n cout << ans << \"\\n\";\n return 0;\n}", "accuracy": 1, "time_ms": 110, "memory_kb": 3584, "score_of_the_acc": -0.3264, "final_rank": 11 }, { "submission_id": "aoj_0550_8859736", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main() {\n const int INF = 1000000000;\n int n, c;\n vector<vector<vector<int>>> dp(2, vector<vector<int>>(5002, vector<int>(2, INF)));\n\n dp[1][1][0] = 0;\n dp[1][0][1] = 0;\n cin >> n;\n \n for (int i = 2; i <= n; i++) {\n int s = i % 2, t = 1 - s;\n cin >> c;\n \n dp[s][0][0] = INF; // move out of the loop\n for (int j = 1; j <= n / 2; j++) {\n dp[s][j][0] = min(dp[t][j - 1][0], dp[t][j - 1][1] + c);\n dp[s][j][1] = min(dp[t][j][0] + c, dp[t][j][1]);\n }\n }\n cout << min(dp[0][n / 2][0], dp[0][n / 2][1]) << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 3828, "score_of_the_acc": -0.4188, "final_rank": 15 }, { "submission_id": "aoj_0550_8859731", "code_snippet": "#include <iostream>\nusing namespace std;\nint main() {\n const int INF = 1000000000;\n int n, c;\n static int dp[2][5002][2]; // Reduced size of dp array\n for (int i = 0; i < 2; i++)\n for (int j = 0; j < 5002; j++) {\n dp[i][j][0] = INF;\n dp[i][j][1] = INF;\n }\n dp[1][1][0] = 0;\n dp[1][0][1] = 0;\n scanf(\"%d\", &n);\n int s, t;\n for (int i = 2; i <= n; i++) {\n s = i % 2;\n t = 1 - s; // Compute s and t outside the loop\n scanf(\"%d\", &c);\n for (int j = 0; j <= n / 2; j++) {\n if (j == 0)\n dp[s][j][0] = INF;\n else\n dp[s][j][0] = min(dp[t][j - 1][0], dp[t][j - 1][1] + c);\n dp[s][j][1] = min(dp[t][j][0] + c, dp[t][j][1]);\n }\n }\n printf(\"%d\\n\", min(dp[0][n / 2][0], dp[0][n / 2][1]));\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3632, "score_of_the_acc": -0.3206, "final_rank": 10 }, { "submission_id": "aoj_0550_8859725", "code_snippet": "#include <iostream>\nusing namespace std;\n\nint main() {\n const int INF = 1000000000;\n int n, c;\n static int dp0[5002][2], dp1[5002][2];\n \n // Initialization\n for (int j = 0; j < 5002; j++) {\n dp0[j][0] = INF;\n dp0[j][1] = INF;\n dp1[j][0] = INF;\n dp1[j][1] = INF;\n }\n dp1[1][0] = 0;\n dp1[0][1] = 0;\n\n // Read input\n scanf(\"%d\", &n);\n for (int i = 2; i <= n; i++) {\n int s = i % 2, t = 1 - s;\n scanf(\"%d\", &c);\n for (int j = 0; j <= n / 2; j++) {\n if (j == 0)\n (s ? dp1 : dp0)[j][0] = INF;\n else\n (s ? dp1 : dp0)[j][0] = min((t ? dp1 : dp0)[j - 1][0], (t ? dp1 : dp0)[j - 1][1] + c);\n (s ? dp1 : dp0)[j][1] = min((t ? dp1 : dp0)[j][0] + c, (t ? dp1 : dp0)[j][1]);\n }\n }\n \n // Output result\n printf(\"%d\\n\", min(dp0[n / 2][0], dp0[n / 2][1]));\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 3632, "score_of_the_acc": -0.3279, "final_rank": 12 }, { "submission_id": "aoj_0550_8859721", "code_snippet": "#include <cstdio>\n#include <cstring>\nusing namespace std;\nint n;\nint t[10002];\nint dp[2][5002][2];\n\nint solve() {\n memset(dp, -1, sizeof(dp));\n dp[0][1][0] = dp[0][0][1] = 0;\n for (int i = 1; i < n; i++) {\n int cur = i & 1;\n int pre = 1 - cur;\n memset(dp[cur], -1, sizeof(dp[cur]));\n for (int j = 0; j <= n / 2; j++) {\n for (int p = 0; p < 2; p++) {\n if (dp[pre][j][p] == -1)\n continue;\n for (int next = 0; next < 2; next++) {\n if (p == next) {\n if (next == 0 && (dp[cur][j + 1][next] == -1 || dp[cur][j + 1][next] > dp[pre][j][p]))\n dp[cur][j + 1][next] = dp[pre][j][p];\n else if (dp[cur][j][next] == -1 || dp[cur][j][next] > dp[pre][j][p])\n dp[cur][j][next] = dp[pre][j][p];\n } else {\n if (next == 0 && (dp[cur][j + 1][next] == -1 || dp[cur][j + 1][next] > dp[pre][j][p] + t[i - 1]))\n dp[cur][j + 1][next] = dp[pre][j][p] + t[i - 1];\n else if (dp[cur][j][next] == -1 || dp[cur][j][next] > dp[pre][j][p] + t[i - 1])\n dp[cur][j][next] = dp[pre][j][p] + t[i - 1];\n }\n }\n }\n }\n }\n int final = n & 1;\n if (dp[final][n / 2][0] == -1) return dp[final][n / 2][1];\n if (dp[final][n / 2][1] == -1) return dp[final][n / 2][0];\n return dp[final][n / 2][0] > dp[final][n / 2][1] ? dp[final][n / 2][1] : dp[final][n / 2][0];\n}\n\nint main() {\n scanf(\"%d\", &n);\n for (int i = 0; i < n - 1; i++) {\n scanf(\"%d\", &t[i]);\n }\n printf(\"%d\\n\", solve());\n}", "accuracy": 0.1, "time_ms": 290, "memory_kb": 2856, "score_of_the_acc": -0.0942, "final_rank": 18 }, { "submission_id": "aoj_0550_8859707", "code_snippet": "#include <cstdio>\n#include <cstring>\n#include <iostream>\nusing namespace std;\n\nint n;\nint t[10002];\nint dp[2][5002][2];\n\nint main() {\n scanf(\"%d\", &n);\n for (int i = 0; i < n - 1; i++) {\n scanf(\"%d\", &t[i]);\n }\n\n memset(dp, -1, sizeof(dp));\n int cur = 0, pre = 1;\n dp[cur][1][0] = dp[cur][0][1] = 0;\n\n for (int i = 1; i < n; i++) {\n swap(cur, pre);\n memset(dp[cur], -1, sizeof(dp[cur]));\n for (int j = 0; j <= n / 2; j++) {\n for (int pre_state = 0; pre_state < 2; pre_state++) {\n if (dp[pre][j][pre_state] != -1) {\n int val0 = dp[pre][j][pre_state] + (pre_state == 0 ? 0 : t[i - 1]);\n dp[cur][j + 1][0] = dp[cur][j + 1][0] != -1 ? min(val0, dp[cur][j + 1][0]) : val0;\n int val1 = dp[pre][j][pre_state] + (pre_state == 1 ? 0 : t[i - 1]);\n dp[cur][j][1] = dp[cur][j][1] != -1 ? min(val1, dp[cur][j][1]) : val1;\n }\n }\n }\n }\n\n int ans = dp[cur][n / 2][0] != -1 ? dp[cur][n / 2][0] : dp[cur][n / 2][1];\n if (dp[cur][n / 2][0] != -1 && dp[cur][n / 2][1] != -1) {\n ans = min(dp[cur][n / 2][0], dp[cur][n / 2][1]);\n }\n printf(\"%d\\n\", ans);\n}", "accuracy": 1, "time_ms": 240, "memory_kb": 3328, "score_of_the_acc": -0.2689, "final_rank": 3 }, { "submission_id": "aoj_0550_8838481", "code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\nint main() {\n const int INF = 1000000000;\n int n, c;\n vector<vector<vector<int>>> dp(2, vector<vector<int>>(5000 + 2, vector<int>(2, INF)));\n\n dp[1][1][0] = 0;\n dp[1][0][1] = 0;\n\n scanf(\"%d\", &n);\n\n for (int i = 2; i <= n; i++) {\n int s = i % 2;\n int t = 1 - s;\n scanf(\"%d\", &c);\n\n dp[s][0][0] = INF;\n\n for (int j = 1; j <= n / 2; j++) {\n dp[s][j][0] = min(dp[t][j - 1][0], dp[t][j - 1][1] + c);\n dp[s][j][1] = min(dp[t][j][0] + c, dp[t][j][1]);\n }\n }\n\n printf(\"%d\\n\", min(dp[0][n / 2][0], dp[0][n / 2][1]));\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 3968, "score_of_the_acc": -0.476, "final_rank": 16 }, { "submission_id": "aoj_0550_8838476", "code_snippet": "#include <iostream>\nusing namespace std;\n\nint main() {\n const unsigned int INF = 1000000000;\n unsigned int n, c;\n cin >> n;\n\n // Dynamic allocation of the dp array\n unsigned int*** dp = new unsigned int**[2];\n for (unsigned int i = 0; i < 2; i++) {\n dp[i] = new unsigned int*[n / 2 + 1];\n for (unsigned int j = 0; j <= n / 2; j++) {\n dp[i][j] = new unsigned int[2];\n dp[i][j][0] = INF;\n dp[i][j][1] = INF;\n }\n }\n\n dp[1][1][0] = 0;\n dp[1][0][1] = 0;\n\n for (unsigned int i = 2; i <= n; i++) {\n unsigned int s = i % 2;\n unsigned int t = 1 - s;\n cin >> c;\n\n // Optimized inner loop\n for (unsigned int j = 1; j <= n / 2; j++) {\n dp[s][j][0] = min(dp[t][j - 1][0], dp[t][j - 1][1] + c);\n dp[s][j][1] = min(dp[t][j][0] + c, dp[t][j][1]);\n }\n }\n\n cout << min(dp[0][n / 2][0], dp[0][n / 2][1]) << endl;\n\n // Freeing the dynamically allocated memory\n for (unsigned int i = 0; i < 2; i++) {\n for (unsigned int j = 0; j <= n / 2; j++) {\n delete[] dp[i][j];\n }\n delete[] dp[i];\n }\n delete[] dp;\n\n return 0;\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 3820, "score_of_the_acc": -0.4119, "final_rank": 14 }, { "submission_id": "aoj_0550_8838461", "code_snippet": "#include <cstdio>\n#include <cstring>\n#include <iostream>\nusing namespace std;\n\nint n;\nint t[10002];\nint dp[5002][2], tmp[5002][2];\n\nint minCost(const int &a, const int &b) {\n int result = a;\n if (result == -1 || (b != -1 && b < result)) {\n result = b;\n }\n return result;\n}\n\nint solve() {\n memset(tmp, -1, sizeof(tmp));\n tmp[1][0] = tmp[0][1] = 0;\n\n for (int i = 1; i < n; i++) {\n memset(dp, -1, sizeof(dp));\n\n for (int j = 0; j <= n / 2; j++) {\n for (int pre = 0; pre < 2; pre++) {\n if (tmp[j][pre] == -1)\n continue;\n for (int next = 0; next < 2; next++) {\n if (pre == next) {\n if (next == 0)\n dp[j + 1][next] = minCost(dp[j + 1][next], tmp[j][pre]);\n else\n dp[j][next] = minCost(dp[j][next], tmp[j][pre]);\n } else {\n if (next == 0)\n dp[j + 1][next] =\n minCost(dp[j + 1][next], tmp[j][pre] + t[i - 1]);\n else\n dp[j][next] = minCost(dp[j][next], tmp[j][pre] + t[i - 1]);\n }\n }\n }\n }\n swap(dp, tmp);\n }\n\n return minCost(dp[n / 2][0], dp[n / 2][1]);\n}\n\nint main() {\n scanf(\"%d\", &n);\n for (int i = 0; i < n - 1; i++) {\n scanf(\"%d\", &t[i]);\n }\n printf(\"%d\\n\", solve());\n}", "accuracy": 0.1, "time_ms": 360, "memory_kb": 3316, "score_of_the_acc": -0.3075, "final_rank": 19 }, { "submission_id": "aoj_0550_8821395", "code_snippet": "#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nint n;\nint *t;\nint dp[5002][2], tmp[5002][2];\nint minCost(const int &a, const int &b) {\n if (a == -1)\n return b;\n if (b == -1)\n return a;\n return a > b ? b : a;\n}\nint solve() {\n int half = n/2;\n memset(tmp, -1, sizeof(tmp));\n tmp[1][0] = tmp[0][1] = 0;\n for (int i = 1; i < n; i++) {\n for(int j = 0; j <= half; j++){\n dp[j][0] = dp[j][1] = -1;\n }\n for (int j = 0; j <= half; j++) {\n for (int pre = 0; pre < 2; pre++) {\n if (tmp[j][pre] == -1)\n continue;\n for (int next = 0; next < 2; next++) {\n if (pre == next) {\n if (next == 0)\n dp[j + 1][next] = minCost(dp[j + 1][next], tmp[j][pre]);\n else\n dp[j][next] = minCost(dp[j][next], tmp[j][pre]);\n } else {\n if (next == 0)\n dp[j + 1][next] =\n minCost(dp[j + 1][next], tmp[j][pre] + t[i - 1]);\n else\n dp[j][next] = minCost(dp[j][next], tmp[j][pre] + t[i - 1]);\n }\n }\n }\n }\n swap(dp, tmp);\n }\n return minCost(tmp[half][0], tmp[half][1]);\n}\nint main() {\n scanf(\"%d\", &n);\n t = new int[n-1];\n for (int i = 0; i < n - 1; i++) {\n scanf(\"%d\", &t[i]);\n }\n printf(\"%d\\n\", solve());\n delete[] t;\n}", "accuracy": 1, "time_ms": 400, "memory_kb": 3336, "score_of_the_acc": -0.3301, "final_rank": 13 }, { "submission_id": "aoj_0550_8821388", "code_snippet": "#include <cstdio>\n#include <cstring>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nint n;\nint t[10002];\nint dp[5002][2], tmp[5002][2];\nint minCost(const int &a, const int &b) {\n if (a == -1)\n return b;\n if (b == -1)\n return a;\n return a > b ? b : a;\n}\nint solve() {\n memset(tmp, -1, sizeof(tmp[0][0]) * ((n / 2) + 1) * 2);\n tmp[1][0] = tmp[0][1] = 0;\n for (int i = 1; i < n; i++) {\n memset(dp, -1, sizeof(dp[0][0]) * ((n / 2) + 1) * 2);\n for (int j = 0; j <= n / 2; j++) {\n for (int pre = 0; pre < 2; pre++) {\n if (tmp[j][pre] == -1)\n continue;\n for (int next = 0; next < 2; next++) {\n int cost = minCost(dp[j + (next == 0 ? 1 : 0)][next], tmp[j][pre] + (pre != next ? t[i - 1] : 0));\n dp[j + (next == 0 ? 1 : 0)][next] = cost;\n }\n }\n }\n std::copy(&dp[0][0], &dp[0][0] + (n / 2 + 1) * 2, &tmp[0][0]);\n }\n return minCost(dp[n / 2][0], dp[n / 2][1]);\n}\nint main() {\n cin >> n;\n for (int i = 0; i < n - 1; i++) {\n cin >> t[i];\n }\n cout << solve() << '\\n';\n}", "accuracy": 1, "time_ms": 200, "memory_kb": 3264, "score_of_the_acc": -0.2283, "final_rank": 2 }, { "submission_id": "aoj_0550_8821384", "code_snippet": "#include <cstdio>\n#include <cstring>\n#include <iostream>\nusing namespace std;\nint n;\nint t[10002];\nint dp[2][5002][2];\nint minCost(const int &a, const int &b) {\n if (a == -1)\n return b;\n if (b == -1)\n return a;\n return a > b ? b : a;\n}\nint solve() {\n int cur = 0, pre = 1;\n memset(dp[cur], -1, sizeof(dp[cur]));\n dp[cur][1][0] = dp[cur][0][1] = 0;\n for (int i = 1; i < n; i++) {\n swap(cur, pre);\n memset(dp[cur], -1, sizeof(dp[cur]));\n for (int j = 0; j <= n / 2; j++) {\n for (int preState = 0; preState < 2; preState++) {\n if (dp[pre][j][preState] == -1)\n continue;\n for (int nextState = 0; nextState < 2; nextState++) {\n int cost = dp[pre][j][preState];\n if (preState != nextState)\n cost += t[i - 1];\n if (nextState == 0)\n dp[cur][j + 1][nextState] = minCost(dp[cur][j + 1][nextState], cost);\n else\n dp[cur][j][nextState] = minCost(dp[cur][j][nextState], cost);\n }\n }\n }\n }\n return minCost(dp[cur][n / 2][0], dp[cur][n / 2][1]);\n}\nint main() {\n scanf(\"%d\", &n);\n for (int i = 0; i < n - 1; i++) {\n scanf(\"%d\", &t[i]);\n }\n printf(\"%d\\n\", solve());\n}", "accuracy": 1, "time_ms": 370, "memory_kb": 3336, "score_of_the_acc": -0.3193, "final_rank": 9 }, { "submission_id": "aoj_0550_8821377", "code_snippet": "#include <iostream>\nusing namespace std;\nint main() {\n std::ios::sync_with_stdio(false);\n const int INF = 1000000000;\n int n, c;\n static int dp[2][5002][2];\n for (int i = 0; i < 2; i++)\n for (int j = 0; j < 5002; j++) {\n dp[i][j][0] = INF;\n dp[i][j][1] = INF;\n }\n dp[1][1][0] = 0;\n dp[1][0][1] = 0;\n cin >> n;\n for (int i = 2; i <= n; i++) {\n int s = i % 2, t = 1 - s;\n cin >> c;\n for (int j = 0; j <= n / 2; j++) {\n int t_j_0 = dp[t][j][0], t_j_1 = dp[t][j][1], t_jm1_0 = dp[t][j - 1][0], t_jm1_1 = dp[t][j - 1][1];\n if (j == 0)\n dp[s][j][0] = INF;\n else\n dp[s][j][0] = min(t_jm1_0, t_jm1_1 + c);\n int t_j_0_c = t_j_0 + c;\n dp[s][j][1] = min(t_j_0_c, t_j_1);\n }\n }\n cout << min(dp[0][n / 2][0], dp[0][n / 2][1]) << \"\\n\";\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3524, "score_of_the_acc": -0.2765, "final_rank": 6 }, { "submission_id": "aoj_0550_8821376", "code_snippet": "#include <cstdio>\n#include <algorithm>\nusing namespace std;\n\nconst int INF = 1000000000;\nstatic int dp[2][5002][2];\nint n, c;\n\nint main() {\n for (int i = 0; i < 2; i++)\n for (int j = 0; j <= 5000; j++)\n dp[i][j][0] = dp[i][j][1] = INF;\n\n scanf(\"%d\", &n);\n dp[1][0][0] = dp[1][0][1] = 0;\n bool flip = true;\n for (int i = 2; i <= n; i++) {\n flip = !flip;\n scanf(\"%d\", &c);\n for (int j = 0; j <= n / 2; j++) {\n if (j == 0)\n dp[flip][j][0] = INF;\n else\n dp[flip][j][0] = min(dp[!flip][j - 1][0], dp[!flip][j - 1][1] + c);\n dp[flip][j][1] = min(dp[!flip][j][0] + c, dp[!flip][j][1]);\n }\n }\n printf(\"%d\\n\", min(dp[flip][n / 2][0], dp[flip][n / 2][1]));\n return 0;\n}", "accuracy": 0.05, "time_ms": 40, "memory_kb": 3040, "score_of_the_acc": -0.0788, "final_rank": 20 }, { "submission_id": "aoj_0550_8808931", "code_snippet": "#include <iostream>\nusing std::cin;\nusing std::cout;\n\nconst int INF = 1000000000;\n\nint main() {\n int n, c;\n int dp[2][5002][2];\n \n for (int i = 0; i < 2; i++) {\n for (int j = 0; j < 5002; j++) {\n dp[i][j][0] = INF;\n dp[i][j][1] = INF;\n }\n }\n \n dp[1][1][0] = 0;\n dp[1][0][1] = 0;\n \n cin >> n;\n \n for (int i = 2; i <= n; i++) {\n int s = i % 2;\n int t = 1 - s;\n \n cin >> c;\n \n for (int j = 0; j <= n / 2; j++) {\n if (j == 0) {\n dp[s][j][0] = INF;\n } else {\n dp[s][j][0] = dp[t][j - 1][0] < dp[t][j - 1][1] + c ? dp[t][j - 1][0] : dp[t][j - 1][1] + c;\n }\n \n dp[s][j][1] = dp[t][j][0] + c < dp[t][j][1] ? dp[t][j][0] + c : dp[t][j][1];\n }\n }\n \n cout << (dp[0][n / 2][0] < dp[0][n / 2][1] ? dp[0][n / 2][0] : dp[0][n / 2][1]) << \"\\n\";\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 3536, "score_of_the_acc": -0.2886, "final_rank": 8 }, { "submission_id": "aoj_0550_8808928", "code_snippet": "#include <iostream>\n#include <algorithm>\nusing std::cin;\nusing std::cout;\nusing std::endl;\nusing std::min;\n\nconst int INF = 1000000000;\n\nint main() {\n int n, c;\n static int dp[2][5000 + 2][2];\n\n for (int i = 0; i < 2; i++)\n for (int j = 0; j < 5002; j++) {\n dp[i][j][0] = INF;\n dp[i][j][1] = INF;\n }\n\n dp[1][1][0] = 0;\n dp[1][0][1] = 0;\n\n cin >> n;\n\n for (int i = 2; i <= n; i++) {\n int s = i % 2, t = 1 - s;\n cin >> c;\n\n for (int j = 0; j <= n / 2; j++) {\n if (j == 0)\n dp[s][j][0] = INF;\n else\n dp[s][j][0] = min(dp[t][j - 1][0], dp[t][j - 1][1] + c);\n dp[s][j][1] = min(dp[t][j][0] + c, dp[t][j][1]);\n }\n }\n\n cout << min(dp[0][n / 2][0], dp[0][n / 2][1]) << endl;\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 3500, "score_of_the_acc": -0.2776, "final_rank": 7 }, { "submission_id": "aoj_0550_8497775", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\ntemplate<class T>\nbool chmax(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\ntemplate<class T>\nbool chmin(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p > q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n int N;\n cin >> N;\n vector<int> A(N/2+1,20000);\n vector<int> B(N/2+1,20000);\n vector<int> NB(N/2+1,20000);\n vector<int> NA(N/2+1, 20000);\n A[0]=B[1] = 0;\n rep(j, N - 1) {\n int t;\n cin >> t;\n for(int i=max(0,N/2-(N-int(j))-3);i<=min(int(j),N/2);i++){\n \n NA[i]=min(A[i],B[i]+t);\n if (i == N/2)break;\n NB[i+1]=min(B[i],A[i]+t);\n }\n swap(B,NB);\n swap(A,NA);\n }\n cout << min(A[N / 2], B[N / 2]) << endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3532, "score_of_the_acc": -0.2761, "final_rank": 5 }, { "submission_id": "aoj_0550_8497658", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\ntemplate<class T>\nbool chmax(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\ntemplate<class T>\nbool chmin(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p > q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n ll N;\n cin >> N;\n vector<vector<int>> A(2, vector<int>(2,20000));\n rep(i, 2)A[i][i] = 0;\n rep(j, N - 1) {\n int t;\n cin >> t;\n vector<vector<int>> NA(j+2, vector<int>(2, 20000));\n rep(i, j+1) {\n int a=min(A[i][0],A[i][1]+t);\n if(a<NA[i][0])NA[i][0]=a;\n if (i == N)break;\n a=min(A[i][1],A[i][0]+t);\n if(a<NA[i+1][1])NA[i+1][1]=a;\n }\n A = NA;\n }\n cout << min(A[N / 2][0], A[N / 2][1]) << endl;\n}", "accuracy": 1, "time_ms": 2790, "memory_kb": 5304, "score_of_the_acc": -2, "final_rank": 17 }, { "submission_id": "aoj_0550_8300796", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nconst int INF = (1<<29);\nint n, t;\nint dp[2][5005];\nint main(){\n cin >> n;\n fill_n(*dp, 2*5005, INF);\n dp[1][0] = 0;\n dp[0][1] = 0;\n for(int i=0;i<n-1;i++){\n cin >> t;\n for(int j=n/2;j>0;j--){\n dp[1][j] = min(dp[1][j], dp[0][j]+t);\n dp[0][j] = min(dp[0][j-1], dp[1][j-1]+t);\n }\n }\n cout << dp[0][n/2] << endl;\n return(0);\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 3148, "score_of_the_acc": -0.1302, "final_rank": 1 } ]
aoj_0549_cpp
旅人 問題 あなたは JOI 街道を旅する旅人である.JOI 街道は東西にまっすぐに延びた道路で,JOI 街道上には n 個の宿場町がある.宿場町には西から東の順に 1 から n までの番号が付けられている.JOI 街道上の最も西の宿場町が宿場町 1 であり,最も東の宿場町が宿場町 n である. あなたは,宿場町 1 から出発して m 日間の旅に出ることになった.あなたの旅程は数列 a1 , a2 , . . . , am に従い,次のように決められている.ai は i 日目の移動方法を表す 0 ではない整数である.i 日目にあなたが出発する宿場町を宿場町 k とおくと,i 日目にあなたは宿場町 k から宿場町 k + ai までまっすぐに移動することを意味する. 宿場町の個数 n,旅の日数 m,宿場町間の距離の情報と,移動方法を表す数列a1 , a2 , . . . , am が与えられたとき,m 日間の旅におけるあなたの移動距離の合計を100000 = 10 5 で割った余りを求めるプログラムを作成せよ. 入出力の例に対応する図 入力 1 行目には整数 n, m が空白区切りで書かれている.n (2 ≤ n ≤ 100000 = 10 5 ) はJOI 街道上の宿場町の個数を,m (1 ≤ m ≤ 100000 = 10 5 ) は旅の日数を表す. 続く n − 1 行は JOI 街道上の宿場町間の距離を表す.i + 1 行目 (1 ≤ i ≤ n − 1) に は宿場町 i と宿場町 i + 1 の距離を表す正整数 si (1 ≤ si ≤ 100) が書かれている. 続く m 行には m 日間の移動方法を表す数列が書かれている.i + n 行目 (1 ≤ i ≤ m) には i 日目のあなたの移動方法を表す 0 ではない整数 ai が書かれている. 採点用データにおいて,宿場町 1 より西に移動することや,宿場町 n より東に移 動することはない. 採点用データのうち,配点の 50% 分については,n ≤ 100 かつ m ≤ 100 を満たす. 出力 出力 は, m 日間の旅におけるあなたの移動距離の合計を 100000 = 10 5 で割った余りを含む 1 行からなる. 入出力例 入力例 1 7 5 2 1 1 3 2 1 2 -1 3 2 -3 出力例 1 18 1 日目に,あなたは宿場町 1 から宿場町 3 まで移動する.2 日目に,あなたは宿場 町 3 から宿場町 2 まで移動する.そして,3 日目に宿場町 2 から宿場町 5 まで移動 し,4 日目に宿場町 5 から宿場町 7 まで移動し,5 日目に宿場町 7 から宿場町 4 ま で移動する.5 日間の旅におけるあなたの移動距離の合計は 18 である. 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0549_10865330", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include<utility>\n#include<set>\n#include<deque>\n#include <unordered_map>\n#include<string>\n#include<cmath>\n\nusing namespace std;\n\nconst int MOD = 100000;\nint main() {\n\tint m, n;\n\tcin >> m >> n;\n\tint s = 1;\n\tvector<int>A(m-1);\n\tvector<int>B(m+1,0);\n\tfor (int i = 0; i < m-1; i++) {\n\t\tcin >> A[i];\n\t}\n\tint x;\n\n\tfor (int i = 0; i < n; i++) {\n\t\t\n\t\tcin >> x;\n\n\t\tint y = s+x;\n\t\tint s2 = y;\n\t\tif (s>y) {\n\t\t\tswap(s, y);\n\t\t}\n\t\tB[s - 1] += 1;\n\t\tB[y-1] -= 1;\n\t\ts = s2;\n\t}\n\t\n\t\n\tfor (int i = 1; i < m; i++) {\n\t\tB[i] = B[i] + B[i - 1];\n\t}\n\t\n\t\n\tint ans = 0;\n\t\n\tfor (int i = 0; i < m - 1; i++) {\n\t\tans += A[i] * B[i];\n\t\tans %= 100000;\n\t}\n\tcout << ans<<endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3792, "score_of_the_acc": -0.2849, "final_rank": 3 }, { "submission_id": "aoj_0549_10851342", "code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nint n, m, a[200000], b[200000], c[200000], s;\nint main() {\n\tcin >> n >> m; for (int i = 1; i <= n - 1; i++)cin >> a[i];\n\tfor (int i = 1; i <= m; i++) cin >> b[i]; b[0] = 1;\n\tfor (int i = 1; i <= m; i++)b[i] += b[i - 1];\n\tfor (int i = 1; i <= m; i++) { int J1 = b[i], J2 = b[i - 1]; if (J1 > J2)swap(J1, J2); c[J1]++; c[J2]--; }\n\tfor (int i = 1; i <= n; i++)c[i] += c[i - 1];\n\tfor (int i = 1; i < n; i++) { s += a[i] * c[i]; s %= 100000; }\n\tcout << s << endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4624, "score_of_the_acc": -0.6405, "final_rank": 12 }, { "submission_id": "aoj_0549_10399688", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n const int MOD = 100000;\n\n int n, m;\n cin >> n >> m;\n\n // s[i] = 宿場町 i と i+1 の距離 (1-indexed, i=1..n-1)\n vector<int> s(n);\n for(int i = 1; i < n; i++){\n cin >> s[i];\n }\n\n // d[i] = 宿場町 1 から i までの累積距離\n // d[1] = 0, d[i] = d[i-1] + s[i-1]\n vector<long long> d(n+1, 0);\n for(int i = 2; i <= n; i++){\n d[i] = d[i-1] + s[i-1];\n }\n\n long long answer = 0;\n int pos = 1; // 現在の宿場町（1 からスタート）\n\n for(int day = 0; day < m; day++){\n int a;\n cin >> a;\n int nxt = pos + a; // 移動先\n // 絶対距離\n long long dist = llabs(d[nxt] - d[pos]);\n answer = (answer + dist) % MOD;\n pos = nxt;\n }\n\n cout << answer << \"\\n\";\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4240, "score_of_the_acc": -0.4701, "final_rank": 10 }, { "submission_id": "aoj_0549_10351932", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n\nint main(){\n int n,m;\n cin >> n >> m;\n vector<int> s(n-1);\n rep(i,n-1){\n cin >> s[i];\n }\n vector<int> a(m);\n rep(i,m){\n cin >> a[i];\n }\n\n vector<int> x(n);\n x[0]=0;\n rep(i,n-1){\n x[i+1]=x[i]+s[i];\n }\n int now=0;//0-based\n int res=0;\n rep(i,m){\n int next=now+a[i];\n res+=abs(x[now]-x[next]);\n now=next;\n res %= 100000;\n }\n cout << res << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4164, "score_of_the_acc": -0.4439, "final_rank": 8 }, { "submission_id": "aoj_0549_8957607", "code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\ndouble binary_search_real(F check, double ok, double ng, ll iter = 100) {\n rep(iter) {\n double x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n if (x < 0) { cout << (i64)(x); }\n else { cout << (u64)(x); }\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"/opt/library/mod/modint_common.hpp\"\n\nstruct has_mod_impl {\n template <class T>\n static auto check(T &&x) -> decltype(x.get_mod(), std::true_type{});\n template <class T>\n static auto check(...) -> std::false_type;\n};\n\ntemplate <class T>\nclass has_mod : public decltype(has_mod_impl::check<T>(std::declval<T>())) {};\n\ntemplate <typename mint>\nmint inv(ll n) {\n static const ll mod = mint::get_mod();\n static vector<mint> dat = {0, 1};\n assert(0 <= n);\n if (n >= mod) n %= mod;\n while (len(dat) <= n) {\n ll k = len(dat);\n ll q = (mod + k - 1) / k;\n dat.eb(dat[k * q - mod] * mint::raw(q));\n }\n return dat[n];\n}\n\ntemplate <typename mint>\nmint fact(ll n) {\n static const ll mod = mint::get_mod();\n assert(0 <= n && n < mod);\n static vector<mint> dat = {1, 1};\n while (len(dat) <= n) dat.eb(dat[len(dat) - 1] * mint::raw(len(dat)));\n return dat[n];\n}\n\ntemplate <typename mint>\nmint fact_inv(ll n) {\n static vector<mint> dat = {1, 1};\n if (n < 0) return mint(0);\n while (len(dat) <= n) dat.eb(dat[len(dat) - 1] * inv<mint>(len(dat)));\n return dat[n];\n}\n\ntemplate <class mint, class... Ts>\nmint fact_invs(Ts... xs) {\n return (mint(1) * ... * fact_inv<mint>(xs));\n}\n\ntemplate <typename mint, class Head, class... Tail>\nmint multinomial(Head &&head, Tail &&... tail) {\n return fact<mint>(head) * fact_invs<mint>(std::forward<Tail>(tail)...);\n}\n\ntemplate <typename mint>\nmint C_dense(ll n, ll k) {\n static vvc<mint> C;\n static ll H = 0, W = 0;\n auto calc = [&](ll i, ll j) -> mint {\n if (i == 0) return (j == 0 ? mint(1) : mint(0));\n return C[i - 1][j] + (j ? C[i - 1][j - 1] : 0);\n };\n if (W <= k) {\n rep(i, H) {\n C[i].resize(k + 1);\n rep(j, W, k + 1) { C[i][j] = calc(i, j); }\n }\n W = k + 1;\n }\n if (H <= n) {\n C.resize(n + 1);\n rep(i, H, n + 1) {\n C[i].resize(W);\n rep(j, W) { C[i][j] = calc(i, j); }\n }\n H = n + 1;\n }\n return C[n][k];\n}\n\ntemplate <typename mint, bool large = false, bool dense = false>\nmint C(ll n, ll k) {\n assert(n >= 0);\n if (k < 0 || n < k) return 0;\n if constexpr (dense) return C_dense<mint>(n, k);\n if constexpr (!large) return multinomial<mint>(n, k, n - k);\n k = min(k, n - k);\n mint x(1);\n rep(i, k) x *= mint(n - i);\n return x * fact_inv<mint>(k);\n}\n\ntemplate <typename mint, bool large = false>\nmint C_inv(ll n, ll k) {\n assert(n >= 0);\n assert(0 <= k && k <= n);\n if (!large) return fact_inv<mint>(n) * fact<mint>(k) * fact<mint>(n - k);\n return mint(1) / C<mint, 1>(n, k);\n}\n\n// [x^d](1-x)^{-n}\ntemplate <typename mint, bool large = false, bool dense = false>\nmint C_negative(ll n, ll d) {\n assert(n >= 0);\n if (d < 0) return mint(0);\n if (n == 0) { return (d == 0 ? mint(1) : mint(0)); }\n return C<mint, large, dense>(n + d - 1, d);\n}\n#line 3 \"/opt/library/mod/modint.hpp\"\n\ntemplate <ll mod>\nstruct modint {\n static constexpr u32 umod = u32(mod);\n static_assert(umod < u32(1) << 31);\n u32 val;\n\n static modint raw(u32 v) {\n modint x;\n x.val = v;\n return x;\n }\n constexpr modint() : val(0) {}\n constexpr modint(u32 x) : val(x % umod) {}\n constexpr modint(u64 x) : val(x % umod) {}\n constexpr modint(u128 x) : val(x % umod) {}\n constexpr modint(int x) : val((x %= mod) < 0 ? x + mod : x){};\n constexpr modint(ll x) : val((x %= mod) < 0 ? x + mod : x){};\n constexpr modint(i128 x) : val((x %= mod) < 0 ? x + mod : x){};\n bool operator<(const modint &other) const { return val < other.val; }\n modint &operator+=(const modint &p) {\n if ((val += p.val) >= umod) val -= umod;\n return *this;\n }\n modint &operator-=(const modint &p) {\n if ((val += umod - p.val) >= umod) val -= umod;\n return *this;\n }\n modint &operator*=(const modint &p) {\n val = u64(val) * p.val % umod;\n return *this;\n }\n modint &operator/=(const modint &p) {\n *this *= p.inverse();\n return *this;\n }\n modint operator-() const { return modint::raw(val ? mod - val : u32(0)); }\n modint operator+(const modint &p) const { return modint(*this) += p; }\n modint operator-(const modint &p) const { return modint(*this) -= p; }\n modint operator*(const modint &p) const { return modint(*this) *= p; }\n modint operator/(const modint &p) const { return modint(*this) /= p; }\n bool operator==(const modint &p) const { return val == p.val; }\n bool operator!=(const modint &p) const { return val != p.val; }\n modint inverse() const {\n ll a = val, b = mod, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b), swap(u -= t * v, v);\n }\n return modint(u);\n }\n modint pow(ll n) const {\n assert(n >= 0);\n modint ret(1), mul(val);\n while (n > 0) {\n if (n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n static constexpr ll get_mod() { return mod; }\n // (n, r), r は 1 の 2^n 乗根\n static constexpr pair<ll, ll> ntt_info() {\n if (mod == 120586241) return {20, 74066978};\n if (mod == 167772161) return {25, 17};\n if (mod == 469762049) return {26, 30};\n if (mod == 754974721) return {24, 362};\n if (mod == 880803841) return {23, 211};\n if (mod == 943718401) return {22, 663003469};\n if (mod == 998244353) return {23, 31};\n if (mod == 1045430273) return {20, 363};\n if (mod == 1051721729) return {20, 330};\n if (mod == 1053818881) return {20, 2789};\n return {-1, -1};\n }\n static constexpr bool can_ntt() { return ntt_info().fi != -1; }\n};\n\ntemplate <ll mod>\nvoid wt(modint<mod> x) {\n wt(x.val);\n}\n\nusing modint107 = modint<1000000007>;\nusing modint998 = modint<998244353>;\n#line 3 \"main.cpp\"\nusing mint = modint<100000>;\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {break;}\n return 0;\n}\n\nint solve() {\n ll n, m;\n cin >> n >> m;\n vi s(n-1), a(m);\n rep(i, n-1) cin >> s[i];\n rep(i, m) cin >> a[i];\n auto b = cumsum<ll>(s);\n mint ans = 0;\n ll p = 0;\n rep(i, m) {\n ans += abs(b[p+a[i]] - b[p]);\n p += a[i];\n }\n print(ans);\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5408, "score_of_the_acc": -0.9692, "final_rank": 16 }, { "submission_id": "aoj_0549_8520237", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(void)\n{\n\tint ki=0,i,n,m,c=0;\n\tint s[100001],b[100001],sum[100001],wa=0,ta=0;\n\tcin>>n>>m;\n\tfor(i=1;i<n;i++) cin>>s[i];\t\n\tfor(i=0;i<m;i++) cin>>b[i];\n\tsum[0]=0;\n\tfor(i=1;i<n;i++){\n\t\tsum[i]=s[i]+sum[i-1];\n\t}\n\tfor(i=0;i<m;i++){\n\t\tc+=b[i];\n\t\tki=sum[c];\n\t\tif(i==0) wa=ki;\n\t\telse if(ki-ta<=0)wa+=ta-ki;\n\t\telse if(ta-ki<=0) wa+=ki-ta;\n\t\tta=ki;\n\t\t\n\t\t\n\t}\n\tcout<<wa%100000<<endl;\n\treturn 0;\n}", "accuracy": 0.5, "time_ms": 30, "memory_kb": 4236, "score_of_the_acc": -0.481, "final_rank": 20 }, { "submission_id": "aoj_0549_8019795", "code_snippet": "#include <iostream>\n#include <queue>\n#define rep(i, n) for(int i=0;i<(int)(n);i++)\nusing namespace std;\nlong long ans;\nint n,m;\nint S[100010],Psum[100010];\nvoid make_prefix_sum(){\n rep(i, n-1){\n rep(j, i+1){\n Psum[i+1]+=S[j];\n }\n }\n}\nint main(){\n cin >> n >> m;\n rep(i, n-1){\n cin >> S[i];\n }\n make_prefix_sum();\n int cur=0;\n rep(i, m){\n int a,l;\n cin >> a;\n if(a>0) l=Psum[cur+a]-Psum[cur];\n else l=Psum[cur]-Psum[cur+a];\n ans+=l;\n cur=cur+a;\n }\n cout << ans%100000 << endl;\n}", "accuracy": 1, "time_ms": 1600, "memory_kb": 3868, "score_of_the_acc": -1.3111, "final_rank": 19 }, { "submission_id": "aoj_0549_8019514", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define endl \"\\n\"\n#define all(v) v.begin(), v.end()\n#define rep(i, begin, end) for(auto i = (begin); i < (end); i++)\n#define rrep(i, end, begin) for(auto i = (end) - 1; i >= (begin); i--)\ntemplate<class T> inline bool chmin(T& a, T b){ if (a > b){ a = b; return true; } return false; }\ntemplate<class T> inline bool chmax(T& a, T b){ if (a < b){ a = b; return true; } return false; }\ntemplate<class T> inline T roundup(T a, T b){ return (a + b - 1) / b; }\nconstexpr int dy[] = {0, 1, 0, -1, 1, 1, -1, -1, 0};\nconstexpr int dx[] = {1, 0, -1, 0, 1, -1, 1, -1, 0};\nusing ll = long long;\nconstexpr ll INF = 1e9;\nstruct Edge{ int to; ll cost; Edge(int to, ll cost) : to(to), cost(cost) {} };\nusing Graph = vector<vector<int>>;\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n \n const int MOD = 100000;\n \n int n, m;\n cin >> n >> m;\n vector s(n - 1, 0);\n for(auto&& e : s) cin >> e;\n \n vector sum(n, 0);\n sum[0] = s[0];\n rep(i, 1, n) sum[i] = sum[i - 1] + s[i - 1];\n int ans = 0;\n int pos = 0;\n while(m--){\n int a;\n cin >> a;\n \n int l = pos, r = pos + a;\n if(l > r) swap(l, r);\n ans += sum[r] - sum[l];\n ans %= MOD;\n \n pos += a;\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3876, "score_of_the_acc": -0.3145, "final_rank": 6 }, { "submission_id": "aoj_0549_7416637", "code_snippet": "#include <bits/stdc++.h>\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define all(x) (x).begin(), (x).end()\nusing namespace std;\ntypedef long long ll;\nconst int dx[4] = {1, 0, -1, 0};\nconst int dy[4] = {0, 1, 0, -1};\nvoid Yes(){printf(\"Yes\\n\");}\nvoid No(){printf(\"No\\n\");}\n\nint main(void)\n{\n\tconst ll MOD = 100000;\n\n\tll n, m; cin >> n >> m;\n\tvector<ll> a(n-1);\n\trep(i, n-1) cin >> a[i];\n\tvector<ll> s(n);\n\ts[0] = 0;\n\trep(i, n-1)\n\t{\n\t\ts[i+1] = s[i] + a[i];\n\t}\n\n\tll now = 0;\n\tll ans = 0;\n\trep(i, m)\n\t{\n\t\tll v; cin >> v;\n\t\tif (v >= 0)\n\t\t{\n\t\t\tans += (s[now+v] % MOD - s[now] % MOD) % MOD;\n\t\t}\n\t\telse\n\t\t{\n\t\t\tans += (s[now] % MOD - s[now+v] % MOD) % MOD;\n\t\t}\n\t\tnow += v;\n\t}\n\tans %= MOD;\n\tcout << ans << endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4668, "score_of_the_acc": -0.6593, "final_rank": 13 }, { "submission_id": "aoj_0549_6893460", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define all(A) A.begin(),A.end()\nusing vll = vector<ll>;\n#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)\n\n\nint main() {\n\tll N,K;\n\tcin>>N>>K;\n\tvll A(N+1,0);\n\trep(i,N-1){\n\t\tll B;\n\t\tcin>>B;\n\t\tA[i+1]=A[i]+B;\n\n\t}\n\tll an=0;\n\tll n=0;\n\tll mod=100000;\n\trep(k,K){\n\t\tll S;\n\t\tcin>>S;\n\t\tif(S>0){\n\t\t\tan+=A[n+S]-A[n];\n\t\t\tn+=S;\n\t\t}\n\t\telse{\n\t\t\tan+=A[n]-A[n+S];\n\t\t\tn+=S;\n\t\t}\n\t\tan%=mod;\n\t\t//cout<<an<<endl;\n\t}\n\tcout<<an<<endl;\n\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3860, "score_of_the_acc": -0.314, "final_rank": 4 }, { "submission_id": "aoj_0549_6856768", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define REP(i, a, b) for (int i = a; i < b; i++)\n\nint main(){\n int n,m; cin >> n >> m;\n vector<long long> S(n-1); rep(i,n-1) cin >> S[i];\n vector<long long> A(m); rep(i,m) cin >> A[i];\n\n vector<long long> accumS(n,0); rep(i,n-1) accumS[i+1] = accumS[i] + S[i];\n\n long long ans = 0;\n int cur = 0;\n rep(i,m){\n int next = cur + A[i];\n ans += abs(accumS[next] - accumS[cur]);\n ans %= 100000;\n cur = next;\n }\n\n cout << ans << endl;\n\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 5164, "score_of_the_acc": -0.8775, "final_rank": 15 }, { "submission_id": "aoj_0549_6276705", "code_snippet": "#include <stdio.h>\n#include <string.h>\n#include <stdlib.h>\n\nint g_pos[100001];\n\n\n\nint main()\n{\n\tint n, m;\n\tint val;\n\tscanf(\"%d%d\", &n, &m);\n\n\tfor (int i = 2; i <=n; i++)\n\t{\n\t\tscanf(\"%d\", &val);\n\t\tg_pos[i] = val + g_pos[i - 1];\n\t}\n\n\tint sum = 0, tmp = 0;\n\tint npos = 1, mk = 0;\n\tfor (int i = 0; i < m; i++)\n\t{\n\t\tscanf(\"%d\", &mk);\n\t\tif (mk >= 0)\n\t\t\tnpos += mk;\n\t\telse\n\t\t{\n\t\t\ttmp = (g_pos[npos] - g_pos[npos + mk]) * 2;\n\t\t\tsum = (sum + tmp) % 100000;\n\t\t\tnpos += mk;\n\t\t}\n\t}\n\n\tsum = (sum + g_pos[npos]) % 100000;\n\tprintf(\"%d\\n\", sum);\n\treturn 0;\n\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3140, "score_of_the_acc": 0, "final_rank": 1 }, { "submission_id": "aoj_0549_6259871", "code_snippet": "#include <iostream>\n#include <stdio.h>\n#include <math.h>\n#include <vector>\n#include <algorithm>\nusing namespace std;\ntypedef long long ll;\nstatic const ll MOD=100000;\n\nint main() {\n int n, m;\n cin>> n >> m;\n\n int distance[n];\n distance[0]=0;\n for(int i=1; i<n; i++) {\n cin >> distance[i];\n }\n ll ruiseki[n];\n ruiseki[0]=0;\n for(int i=1; i<n; i++) {\n ruiseki[i]=ruiseki[i-1]+distance[i];\n }\n \n int process[m];\n for(int i=0; i<m; i++) {\n cin >> process[i];\n }\n\n int before_index=0;\n int after_index;\n ll ans=0;\n\n for(int i=0; i<m; i++) {\n after_index=before_index+process[i];\n ans=ans+(abs(ruiseki[after_index]-ruiseki[before_index]));\n before_index=after_index;\n }\n cout << ans%MOD << endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 4656, "score_of_the_acc": -0.6604, "final_rank": 14 }, { "submission_id": "aoj_0549_6083747", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n int n,m; cin >> n >> m;\n vector<int>s(n);\n vector<int>move(m);\n for(int i = 0; i < n-1; ++i){\n cin >> s[i];\n }\n for(int i = 0; i < m; ++i){\n cin >> move[i];\n }\n vector<int>cumsum(n,0);\n for(int i = 0; i < n-1; ++i){\n cumsum[i+1] = cumsum[i] + s[i];\n }\n\n ll sum = 0;\n int moBe = 0;\n int moAf = 0;\n for(int i = 0; i < m; ++i){\n moBe += move[i];\n sum += abs(cumsum[moBe] -cumsum[moAf]) % 100000;\n moAf += move[i];\n \n }\n cout << sum % 100000 << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4320, "score_of_the_acc": -0.5106, "final_rank": 11 }, { "submission_id": "aoj_0549_5973930", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\ntypedef long long ll;\ntypedef pair<long long, long long> P;\nconst long long INF = 1e18;\nconst ll MOD = INF;\ntemplate <typename T>\nvoid input_arr(vector<T>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i];\n\t}\n}\ntemplate <typename T, typename Q>\nvoid input_arr(vector<pair<T, Q>>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i].first >> A[i].second;\n\t}\n}\ntemplate <typename T>\nvoid input_arr(vector<vector<T>>& A, ll H, ll W) {\n\tfor (ll i = 0; i < H; i++) {\n\t\tfor (ll j = 0; j < W; j++) {\n\t\t\tcin >> A[i][j];\n\t\t}\n\t}\n}\nint main() {\n\tll N, M; cin >> N >> M;\n\tvector<ll>A(N, 0);\n\tfor (ll i = 1; i < N; i++) {\n\t\tll x; cin >> x;\n\t\tA[i] = A[i - 1] + x;\n\t}\n\tll ans = 0, pos = 0;\n\tfor (ll i = 0; i < M; i++) {\n\t\tll x; cin >> x;\n\t\tif (x > 0) ans += A[pos + x] - A[pos];\n\t\tif (x < 0) ans += A[pos] - A[pos + x];\n \tpos += x;\n\t\tans %= 100000;\n\t}\n\tcout << ans << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3860, "score_of_the_acc": -0.314, "final_rank": 4 }, { "submission_id": "aoj_0549_5849473", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long;\n#define rep(i, n) for(int i = 0; i < int(n); i++)\n#define rep2(i, l, n) for(int i = int(l); i < int(n); i++)\n\nint main(){\n int n, m;\n cin >> n >> m;\n lint dist[n];\n dist[0] = 0;\n rep(i, n - 1){\n int s;\n cin >> s;\n dist[i + 1] = dist[i] + s;\n }\n \n int at = 0;\n lint ans = 0;\n rep(i, m){\n int a;\n cin >> a;\n ans += abs(dist[at] - dist[at + a]);\n at += a;\n }\n \n cout << ans % int(1e5) << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4132, "score_of_the_acc": -0.4302, "final_rank": 7 }, { "submission_id": "aoj_0549_5794052", "code_snippet": "#define _USE_MATH_DEFINES\n#include<iostream>\n#include<string>\n#include<vector>\n#include<stack>\n#include<queue>\n#include<set>\n#include<map>\n#include<list>\n#include<algorithm>\n#include<numeric>\n#include<cmath>\n#include<iomanip>\n#include<sstream>\n#include<regex>\n#include<random>\nusing namespace std;\n#define int long long\n#define uint unsigned long long\nconst int mod=1e9+7;\nconst int Mod=998244353;\nconst int inf=mod*mod;\nconst double eps=1e-9;\nsigned main(){\n\tint n,m,s[100000],a,tmp=0,ans=0;\n\tcin>>n>>m;\n\ts[0]=0;\n\tfor(int i=1;i<n;i++){\n\t\tcin>>s[i];\n\t\ts[i]+=s[i-1];\n\t}\n\twhile(cin>>a){\n\t\tans+=abs(s[tmp]-s[tmp+a]);\n\t\ttmp+=a;\n\t}\n\tcout<<ans%100000<<endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4220, "score_of_the_acc": -0.4678, "final_rank": 9 }, { "submission_id": "aoj_0549_5786226", "code_snippet": "#include<iostream>\n\nusing namespace std;\n\nint main()\n{\n\tint n, m;\n\tcin >> n >> m;\n\tint* d = new int[n + 1];\n\td[1] = 0;\n\tfor (int i = 2; i <= n; i++)\n\t{\n\t\tcin >> d[i];\n\t\td[i] += d[i - 1];\n\t}\n\tint a;\n\tint ans = 0, cr = 1;\n\tfor (int i = 0; i < m; i++)\n\t{\n\t\tcin >> a;\n\t\tif (a > 0)\n\t\t\tans += d[cr + a] - d[cr];\n\t\telse\n\t\t\tans += d[cr] - d[cr + a];\n\t\tans %= 100000;\n\t\tcr += a;\n\t}\n\tcout << ans << endl;\n\n\t//system(\"pause\");\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3496, "score_of_the_acc": -0.1647, "final_rank": 2 }, { "submission_id": "aoj_0549_5463261", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, N) for (int i = 0; i < N; i++)\n\nint main()\n{\n ll n, m; cin >> n >> m;\n ll dist[n-1];\n ll dist2[n];\n dist2[0] = 0;\n rep(i,n-1) cin >> dist[i];\n ll mm[m];\n rep(i,m) cin >> mm[i];\n for(int i=0;i<n-1;i++){\n dist2[i+1] = dist2[i] + dist[i];\n }\n// rep(i,n) cout << dist2[i] << \" | \";\n int mod = 1e5;\n ll ans = 0;\n int loc = 0;\n rep(i,m){\n // cout << \" ans \" << ans << \" loc \" << loc << \" i \" << i << \" mmi \" << mm[i] << endl;\n if(i == 0){\n ans = (ans + dist2[loc + mm[i]])%mod;\n loc = mm[i];\n }\n else{\n if(mm[i] <0){\n ans = (ans + dist2[loc] - dist2[loc + mm[i]] ) % mod;\n }\n else {\n ans = (ans + dist2[loc + mm[i]] - dist2[loc] ) % mod; \n }\n loc += mm[i];\n }\n }\n cout << ans << endl;\n\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 5412, "score_of_the_acc": -0.9835, "final_rank": 17 }, { "submission_id": "aoj_0549_5199201", "code_snippet": "#include <bits/stdc++.h>\n#define all(v) v.begin(), v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)\n#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)\n#define codefor int test;scanf(\"%d\",&test);while(test--)\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define yes(ans) if(ans)printf(\"yes\\n\");else printf(\"no\\n\")\n#define Yes(ans) if(ans)printf(\"Yes\\n\");else printf(\"No\\n\")\n#define YES(ans) if(ans)printf(\"YES\\n\");else printf(\"NO\\n\")\n#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\n#define umap unordered_map\n#define uset unordered_set\nusing namespace std;\nusing ll = long long;\nconst int MOD=1000000007;\nconst int MOD2=998244353;\nconst int INF=1<<30;\nconst ll INF2=(ll)1<<60;\n//入力系\nvoid scan(int& a){scanf(\"%d\",&a);}\nvoid scan(long long& a){scanf(\"%lld\",&a);}\ntemplate<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}\ntemplate<class T> void scan(T& a){cin>>a;}\ntemplate<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}\n//出力系\nvoid print(const int& a){printf(\"%d\",a);}\nvoid print(const long long& a){printf(\"%lld\",a);}\nvoid print(const double& a){printf(\"%.15lf\",a);}\ntemplate<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}\ntemplate<class T> void print(const T& a){cout<<a;}\ntemplate<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}\nvoid out(){putchar('\\n');}\ntemplate<class T> void out(const T& t){print(t);putchar('\\n');}\ntemplate <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}\n//デバッグ系\ntemplate<class T> void dprint(const T& a){cerr<<a;}\ntemplate<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<\" \"<<*it;}}\nvoid debug(){cerr<<endl;}\ntemplate<class T> void debug(const T& t){dprint(t);cerr<<endl;}\ntemplate <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<\" \";debug(tail...);}\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\nll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}\nll updivide(ll a,ll b){if(a%b==0) return a/b;else return (a/b)+1;}\ntemplate<class T> void chmax(T &a,const T b){if(b>a)a=b;}\ntemplate<class T> void chmin(T &a,const T b){if(b<a)a=b;}\n\nint main(){\n INT(n,m);\n vector<ll> a(n-1),b(m),sumv(1,0);\n in(a,b);\n rep(i,a.size()){\n sumv.push_back(sumv[i]+a[i]);\n }\n ll pre=0,ans=0;\n rep(i,m){\n assert(pre+b[i]>=0&&pre+b[i]<sumv.size());\n assert(pre>=0&&pre<sumv.size());\n if(sumv[pre+b[i]]>sumv[pre])ans+=sumv[pre+b[i]]-sumv[pre];\n else ans+=sumv[pre]-sumv[pre+b[i]];\n pre=pre+b[i];\n }\n out(ans%100000);\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5480, "score_of_the_acc": -1, "final_rank": 18 } ]
aoj_0552_cpp
博覧会 問題 JOI 市では,とある大規模な博覧会を開催することになった. 今回の博覧会には 2 つのテーマがあり,JOI 市にある N 個の展示施設でそれぞれ, 2 つのテーマのうちどちらか一方に沿った展示を行う予定である. 施設の位置は平面座標 (x, y) で表される.位置 (x, y) にある施設から (x′ , y′) にある施設まで移動するためには, |x − x′| + |y − y′| だけの時間がかかる (整数 a に対して, |a| で a の絶対値を表す).同一テーマ内での統一感を出すため,および一方のテーマのみに関心を持つ人に不便を感じさせないために,同一のテーマで展示を行っている 2 つの施設の間の移動時間がなるべく短くなるようにテーマを割りふりたい.すべての展示施設に同じテーマを割りふらない限り, どのようにテーマを割りふってもよい. 同一のテーマで展示を行っている 2 つの施設の間の移動時間の最大値を M とする. N 個の展示施設の位置が与えられたとき, M の最小値を求めるプログラムを作成せよ. 入力 入力の 1 行目には, 施設の個数 N(3 ≤ N ≤ 100000 = 10 5 ) が書かれている.入力のi + 1 行目 (1 ≤ i ≤ N) には,各施設の座標を表す 2 つの整数 x i , y i (|x i | ≤ 100000 = 10 5 , |y i | ≤ 100000 = 10 5 ) が空白区切りで書かれている.これは,i 個目の施設の座標が(x i , y i ) であることを表す. 同一の座標に 2 つ以上の施設が存在することはない. 採点用データのうち,配点の 40% 分については, N ≤ 2000 である. 出力 出力は 1 行のみからなる.同一のテーマで展示を行っている 2 つの施設間の移動時間の最大値 M の最小値を出力せよ. 入出力例 入力例 1 5 0 0 1 0 -1 -2 0 1 -1 1 出力例 1 3 この場合,たとえば座標 (0, 0), (1, 0), (0, 1) にある施設に一方のテーマを,(−1, −2), (−1, 1) にある施設にもう一方のテーマを割りふると,同一のテーマで展示を行う 2 つの施設間の移動時間はすべて 3 以下になる.移動時間をすべて 2 以下にすることはできないので,3 を出力する. 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0552_10852741", "code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\nusing namespace std;\nint x[100000], y[100000], n, mx, my; bool unused[100000];\nint solve(int lx, int ly, int rx, int ry) {\n\tfor (int i = 0; i < n; i++)unused[i] = false;\n\tfor (int i = 0; i < n; i++) {\n\t\tif (lx <= x[i] && x[i] <= rx && ly <= y[i] && y[i] <= ry)unused[i] = true;\n\t}\n\tint ex = 1000000, ey = 1000000, sx = 0, sy = 0;\n\tfor (int i = 0; i < n; i++) { if (unused[i] == false) { ex = min(ex, x[i]); ey = min(ey, y[i]); sx = max(sx, x[i]); sy = max(sy, y[i]); } }\n\treturn max(sx - ex, sy - ey);\n}\nbool solve(int r) {\n\treturn (solve(0, 0, r, r) <= r || solve(0, my - r, r, my) <= r || solve(mx - r, 0, mx, r) <= r || solve(mx - r, my - r, mx, my) <= r);\n}\nint main() {\n\tcin >> n;\n\tfor (int i = 0; i < n; i++) {\n\t\tcin >> x[i] >> y[i]; int r1 = x[i] - y[i], r2 = x[i] + y[i]; x[i] = r1; y[i] = r2; mx = min(mx, x[i]); my = min(my, y[i]);\n\t}\n\tfor (int i = 0; i < n; i++) { x[i] -= mx; y[i] -= my; }mx = 0; my = 0;\n\tfor (int i = 0; i < n; i++) { mx = max(mx, x[i]); my = max(my, y[i]); }\n\tint L = 0, R = 1000000, M;\n\twhile (true) {\n\t\tM = (L + R) / 2; bool U1 = solve(M - 1), U2 = solve(M);\n\t\tif (U1 == false && U2 == true) { cout << M << endl; break; }\n\t\tif (U1 == true)R = M;\n\t\tif (U2 == false)L = M;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 4312, "score_of_the_acc": -0.2127, "final_rank": 12 }, { "submission_id": "aoj_0552_10399732", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n/**\n * 変数説明:\n * uma, umi : 全点について u = x + y の最大・最小\n * vma, vmi : 全点について v = x - y の最大・最小\n */\nstatic int uma, umi, vma, vmi;\n\n/**\n * da(u,v): 現在の (u,v) から最適にテーマ分け（２グループ）した際、\n * (u,v) が属するグループ内での最大距離（マンハッタン距離の変換後）が\n * もう一方のグループとの境界距離で評価したときの最小値を返す。\n */\nint da(int u, int v) {\n // グループA: 境界は (uma, vma) と (umi, vmi) の線分\n int d1 = max(uma - u, vma - v);\n int d2 = max(u - umi, v - vmi);\n return min(d1, d2);\n}\n\n/**\n * db(u,v): 同様にもう一つのグループ分けパターンで評価\n */\nint db(int u, int v) {\n // グループB: 境界は (uma, vmi) と (umi, vma) の線分\n int d1 = max(uma - u, v - vmi);\n int d2 = max(u - umi, vma - v);\n return min(d1, d2);\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int n;\n cin >> n;\n\n vector<int> u(n), v(n);\n for (int i = 0; i < n; ++i) {\n int x, y;\n cin >> x >> y;\n // (x,y) を 45° 回転しマンハッタン距離の最大化問題に帰着\n u[i] = x + y;\n v[i] = x - y;\n if (i == 0) {\n uma = umi = u[i];\n vma = vmi = v[i];\n } else {\n uma = max(uma, u[i]);\n umi = min(umi, u[i]);\n vma = max(vma, v[i]);\n vmi = min(vmi, v[i]);\n }\n }\n\n // ２つの分け方それぞれの最大「最小距離」を求める\n int bestA = 0, bestB = 0;\n for (int i = 0; i < n; ++i) {\n bestA = max(bestA, da(u[i], v[i]));\n bestB = max(bestB, db(u[i], v[i]));\n }\n\n // ２パターンのうち小さいほうが答え\n cout << min(bestA, bestB) << \"\\n\";\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3732, "score_of_the_acc": -0.025, "final_rank": 2 }, { "submission_id": "aoj_0552_9390263", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int INF = (int)1e9 + 1001010;\nconst ll llINF = (long long)4e18 + 22000020;\nconst string endn = \"\\n\";\ntemplate <class T> inline auto vector2(size_t i, size_t j, const T &init = T()) {return vector(i, vector<T>(j, init));}\nconst string ELEM_SEPARATION = \" \", VEC_SEPARATION = endn;\ntemplate<class T> istream& operator >>(istream &i, vector<T> &A) {for(auto &I : A) {i >> I;} return i;}\ntemplate<class T> ostream& operator <<(ostream &o, const vector<T> &A) {int i=A.size(); for(const auto &I : A){o << I << (--i ? ELEM_SEPARATION : \"\");} return o;}\ntemplate<class T> ostream& operator <<(ostream &o, const vector<vector<T>> &A) {int i=A.size(); for(const auto &I : A){o << I << (--i ? VEC_SEPARATION : \"\");} return o;}\ntemplate<class T> vector<T>& operator ++(vector<T> &A, int n) {for(auto &I : A) {I++;} return A;}\ntemplate<class T> vector<T>& operator --(vector<T> &A, int n) {for(auto &I : A) {I--;} return A;}\ntemplate<class T, class U> bool chmax(T &a, const U &b) {return ((a < b) ? (a = b, true) : false);}\ntemplate<class T, class U> bool chmin(T &a, const U &b) {return ((a > b) ? (a = b, true) : false);}\nll floor(ll a, ll b){if (b < 0) a = -a, b = -b; if(a >= 0) return a / b; else return (a + 1) / b - 1;}\nll ceil(ll a, ll b){if (b < 0) a = -a, b = -b; if(a > 0) return (a - 1) / b + 1; else return a / b;}\nll bit(unsigned long long val, unsigned long long digit){return (val >> digit) & 1;}\n#ifdef DEBUG\n#include <debug_slephy.cpp>\n#else\n#define debug(...)\n#endif\n// ================================== ここまでテンプレ ==================================\n\ntemplate<class Judgement>\nll binary_search_ll(ll ok, ll ng, Judgement judge){\n auto need_continue = [&]() -> bool {\n if(ok > ng) return((__int128_t)ok - (__int128_t)ng > 1);\n else return ((__int128_t)ng - (__int128_t)ok > 1);\n };\n while(need_continue()){\n ll mid = ((__int128_t)ok + (__int128_t)ng) / 2;\n if(judge(mid)) ok = mid;\n else ng = mid;\n }\n return ok;\n};\nbool is_between(ll inf, ll n, ll sup){return(inf <= n && n <= sup);}\n\nint main(int argc, char *argv[]){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n ll n; cin >> n;\n vector<ll> x(n), y(n);\n for(int i = 0; i < n; i++) cin >> x[i] >> y[i];\n {\n vector<ll> X(n), Y(n);\n for(int i = 0; i < n; i++){\n X[i] = x[i] - y[i];\n Y[i] = x[i] + y[i];\n }\n x = move(X);\n y = move(Y);\n }\n\n ll min_x = *min_element(x.begin(), x.end());\n ll max_x = *max_element(x.begin(), x.end());\n ll min_y = *min_element(y.begin(), y.end());\n ll max_y = *max_element(y.begin(), y.end());\n\n auto judge = [&](ll k) -> bool {\n bool ok1 = true; // {min_x, min_y}, {max_x, max_y}\n bool ok2 = true; // {min_x, max_y}, {max_x, min_y}\n\n for(int i = 0; i < n; i++){\n ok1 &= (is_between(min_x, x[i], min_x + k) && is_between(min_y, y[i], min_y + k)\n || is_between(max_x - k, x[i], max_x) && is_between(max_y - k, y[i], max_y));\n ok2 &= (is_between(min_x, x[i], min_x + k) && is_between(max_y - k, y[i], max_y)\n || is_between(max_x - k, x[i], max_x) && is_between(min_y, y[i], min_y + k));\n }\n\n return (ok1 || ok2);\n };\n\n ll ans = binary_search_ll(1e6, 0, judge);\n cout << ans << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 6252, "score_of_the_acc": -0.3068, "final_rank": 16 }, { "submission_id": "aoj_0552_9089019", "code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) { return (ull)rng() % B; }\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int n;\n cin >> n;\n vector<ll> w(n), v(n);\n for (int i = 0; i < n; i++) {\n ll x, y;\n cin >> x >> y;\n w[i] = x + y;\n v[i] = x - y;\n }\n ll wmx = w[0], wmi = w[0];\n ll vmx = v[0], vmi = v[0];\n for (int i = 0; i < n; i++) {\n wmx = max(wmx, w[i]), wmi = min(wmi, w[i]);\n vmx = max(vmx, v[i]), vmi = min(vmi, v[i]);\n }\n ll L = -1, R = 1e6;\n auto check = [&](ll x) -> bool {\n if (wmi + x >= wmx) {\n for (int i = 0; i < n; i++) {\n if (min(v[i] - vmi, vmx - v[i]) > x) return false;\n }\n return true;\n }\n if (vmi + x >= vmx) {\n for (int i = 0; i < n; i++) {\n if (min(w[i] - wmi, wmx - w[i]) > x) return false;\n }\n return true;\n }\n // wmxとvmxが同じグループ\n {\n bool ok = true;\n for (int i = 0; i < n; i++) {\n ll d1 = max(wmx - w[i], vmx - v[i]);\n ll d2 = max(w[i] - wmi, v[i] - vmi);\n if (min(d1, d2) > x) {\n ok = false;\n break;\n }\n }\n if (ok) return true;\n }\n // wmxとvmiが同じグループ\n {\n bool ok = true;\n for (int i = 0; i < n; i++) {\n ll d1 = max(wmx - w[i], v[i] - vmi);\n ll d2 = max(w[i] - wmi, vmx - v[i]);\n if (min(d1, d2) > x) {\n ok = false;\n break;\n }\n }\n if (ok) return true;\n }\n return false;\n };\n while (R - L > 1) {\n ll mid = (L + R) / 2;\n if (check(mid)) R = mid;\n else L = mid;\n }\n cout << R << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4608, "score_of_the_acc": -0.123, "final_rank": 8 }, { "submission_id": "aoj_0552_5849546", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long;\n#define rep(i, n) for(int i = 0; i < int(n); i++)\n#define rep2(i, l, n) for(int i = int(l); i < int(n); i++)\n\nlint inf = 1e18;\n\nint n;\nlint x[101010], y[101010];\n\nbool solve_small(lint m){\n lint r = -inf, l = inf;\n lint u = -inf, d = inf;\n \n rep(i, n){\n r = max(r, x[i]);\n l = min(l, x[i]);\n u = max(u, y[i]);\n d = min(d, y[i]);\n }\n rep(i, n){\n if(abs(x[i] - l) <= m && abs(y[i] - u) <= m) continue;\n if(abs(x[i] - r) <= m && abs(y[i] - d) <= m) continue;\n return false;\n }\n return true;\n}\n\nbool solve(lint m){\n bool ans = solve_small(m);\n rep(i, n){\n x[i] *= -1;\n }\n ans |= solve_small(m);\n rep(i, n){\n x[i] *= -1;\n }\n return ans;\n}\n\nint main(){\n cin >> n;\n rep(i, n){\n lint a, b;\n cin >> a >> b;\n x[i] = a + b;\n y[i] = a - b;\n }\n \n lint ng = 0, ok = 1e9;\n while(abs(ok - ng) > 1){\n lint mid = (ng + ok) / 2;\n \n if(solve(mid)){\n ok = mid;\n }else{\n ng = mid;\n }\n }\n \n cout << ok << endl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 4872, "score_of_the_acc": -0.2051, "final_rank": 10 }, { "submission_id": "aoj_0552_5480466", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\nint N;\nstruct Point{\n int x;\n int y;\n int num;\n Point(){}\n Point(int _x,int _y,int _num):x(_x),y(_y),num(_num){}\n \n};\nvector<Point> vp;\n\nbool is_ok(int d){\n // cout<<d<<endl;\n vector<Point> vpn;\n vector<Point> vpe1;\n vector<Point> vpe2;\n for(int i=0;i<N;i++){\n if(vp[i].x-vp[0].x<=d){\n vpn.push_back(vp[i]);\n }else{\n vpe1.push_back(vp[i]);\n vpe2.push_back(vp[i]);\n }\n }\n /*\n cout<<\"vpn \";\n for(int i=0;i<vpn.size();i++){\n cout<<vpn[i].x<<\":\"<<vpn[i].y<<\" \";\n }\n */\n \n sort(vpn.begin(),vpn.end(),[](Point a,Point b){\n return a.y<b.y;\n });\n for(int i=0;i<vpn.size();i++){\n if(vpn[i].y-vpn[0].y>d){\n vpe1.push_back(vpn[i]);\n }\n if(vpn.back().y-vpn[i].y>d){\n vpe2.push_back(vpn[i]);\n }\n }\n /*\n cout<<\"vpe1 \";\n for(int i=0;i<vpe1.size();i++){\n cout<<vpe1[i].x<<\":\"<<vpe1[i].y<<\" \";\n }\n cout<<\"vpe2 \";\n for(int i=0;i<vpe2.size();i++){\n cout<<vpe2[i].x<<\":\"<<vpe2[i].y<<\" \";\n }\n cout<<endl;\n */\n \n \n if(vpe1.empty()||vpe2.empty()){\n return true;\n }\n \n \n \n bool flag1=true;\n bool flag2=true;\n \n sort(vpe1.begin(),vpe1.end(),[](Point a,Point b){\n return a.x<b.x;\n });\n \n if(vpe1.back().x-vpe1[0].x>d){\n flag1=false;\n }\n sort(vpe1.begin(),vpe1.end(),[](Point a,Point b){\n return a.y<b.y;\n });\n if(vpe1.back().y-vpe1[0].y>d){\n flag1=false;\n }\n \n sort(vpe2.begin(),vpe2.end(),[](Point a,Point b){\n return a.x<b.x;\n });\n \n if(vpe2.back().x-vpe2[0].x>d){\n flag2=false;\n }\n sort(vpe2.begin(),vpe2.end(),[](Point a,Point b){\n return a.y<b.y;\n });\n if(vpe2.back().y-vpe2[0].y>d){\n flag2=false;\n }\n \n vpn.clear();\n vpe1.clear();\n vpe2.clear();\n \n \n for(int i=0;i<N;i++){\n if(vp.back().x-vp[i].x<=d){\n vpn.push_back(vp[i]);\n }else{\n vpe1.push_back(vp[i]);\n vpe2.push_back(vp[i]);\n }\n }\n /*\n cout<<\"vpn \";\n for(int i=0;i<vpn.size();i++){\n cout<<vpn[i].x<<\":\"<<vpn[i].y<<\" \";\n }\n cout<<\"vpe1 \";\n for(int i=0;i<vpe1.size();i++){\n cout<<vpe1[i].x<<\":\"<<vpe1[i].y<<\" \";\n }\n cout<<\"vpe2 \";\n for(int i=0;i<vpe2.size();i++){\n cout<<vpe2[i].x<<\":\"<<vpe2[i].y<<\" \";\n }\n cout<<endl;\n */\n \n \n \n sort(vpn.begin(),vpn.end(),[](Point a,Point b){\n return a.y<b.y;\n });\n for(int i=0;i<vpn.size();i++){\n if(vpn[i].y-vpn[0].y>d){\n vpe1.push_back(vpn[i]);\n }\n if(vpn.back().y-vpn[i].y>d){\n vpe2.push_back(vpn[i]);\n }\n }\n \n if(vpe1.empty()||vpe2.empty()){\n return true;\n }\n \n \n bool flag3=true;\n bool flag4=true;\n \n sort(vpe1.begin(),vpe1.end(),[](Point a,Point b){\n return a.x<b.x;\n });\n \n if(vpe1.back().x-vpe1[0].x>d){\n flag3=false;\n }\n sort(vpe1.begin(),vpe1.end(),[](Point a,Point b){\n return a.y<b.y;\n });\n if(vpe1.back().y-vpe1[0].y>d){\n flag3=false;\n }\n \n sort(vpe2.begin(),vpe2.end(),[](Point a,Point b){\n return a.x<b.x;\n });\n \n if(vpe2.back().x-vpe2[0].x>d){\n flag4=false;\n }\n sort(vpe2.begin(),vpe2.end(),[](Point a,Point b){\n return a.y<b.y;\n });\n if(vpe2.back().y-vpe2[0].y>d){\n flag4=false;\n }\n \n \n \n \n return flag1||flag2||flag3||flag4;\n \n \n \n}\n\n\nint main(){\n\n cin>>N;\n vp.resize(N);\n int x,y;\n for(int i=0;i<N;i++){\n cin>>x>>y;\n vp[i]=Point(x-y,x+y,i);\n }\n \n sort(vp.begin(),vp.end(),[](Point a,Point b){\n return a.x<b.x;\n });\n /*\n for(int i=0;i<vp.size();i++){\n cout<<vp[i].x<<\" : \"<<vp[i].y<<\" \";\n }\n cout<<endl;\n */\n \n \n \n int ng=-1;\n int ok=500050;\n int mid;\n \n while(ok-ng>1){\n mid=(ok+ng)/2;\n if(is_ok(mid)){\n ok=mid;\n }else{\n ng=mid;\n }\n }\n cout<<ok<<endl;\n \n \n}", "accuracy": 1, "time_ms": 370, "memory_kb": 7548, "score_of_the_acc": -1.0833, "final_rank": 17 }, { "submission_id": "aoj_0552_5480453", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\nint N;\nstruct Point{\n int x;\n int y;\n int num;\n Point(){}\n Point(int _x,int _y,int _num):x(_x),y(_y),num(_num){}\n \n};\nvector<Point> vp;\n\nbool is_ok(int d){\n // cout<<d<<endl;\n vector<Point> vpn;\n vector<Point> vpe1;\n vector<Point> vpe2;\n for(int i=0;i<N;i++){\n if(vp[i].x-vp[0].x<=d){\n vpn.push_back(vp[i]);\n }else{\n vpe1.push_back(vp[i]);\n vpe2.push_back(vp[i]);\n }\n }\n /*\n cout<<\"vpn \";\n for(int i=0;i<vpn.size();i++){\n cout<<vpn[i].x<<\":\"<<vpn[i].y<<\" \";\n }\n */\n \n sort(vpn.begin(),vpn.end(),[](Point a,Point b){\n return a.y<b.y;\n });\n for(int i=0;i<vpn.size();i++){\n if(vpn[i].y-vpn[0].y>d){\n vpe1.push_back(vpn[i]);\n }\n if(vpn.back().y-vpn[i].y>d){\n vpe2.push_back(vpn[i]);\n }\n }\n /*\n cout<<\"vpe1 \";\n for(int i=0;i<vpe1.size();i++){\n cout<<vpe1[i].x<<\":\"<<vpe1[i].y<<\" \";\n }\n cout<<\"vpe2 \";\n for(int i=0;i<vpe2.size();i++){\n cout<<vpe2[i].x<<\":\"<<vpe2[i].y<<\" \";\n }\n cout<<endl;\n */\n \n \n if(vpe1.empty()||vpe2.empty()){\n return true;\n }\n \n \n \n bool flag1=true;\n bool flag2=true;\n \n sort(vpe1.begin(),vpe1.end(),[](Point a,Point b){\n return a.x<b.x;\n });\n \n if(vpe1.back().x-vpe1[0].x>d){\n flag1=false;\n }\n sort(vpe1.begin(),vpe1.end(),[](Point a,Point b){\n return a.y<b.y;\n });\n if(vpe1.back().y-vpe1[0].y>d){\n flag1=false;\n }\n \n sort(vpe2.begin(),vpe2.end(),[](Point a,Point b){\n return a.x<b.x;\n });\n \n if(vpe2.back().x-vpe2[0].x>d){\n flag2=false;\n }\n sort(vpe2.begin(),vpe2.end(),[](Point a,Point b){\n return a.y<b.y;\n });\n if(vpe2.back().y-vpe2[0].y>d){\n flag2=false;\n }\n \n vpn.clear();\n vpe1.clear();\n vpe2.clear();\n \n \n for(int i=0;i<N;i++){\n if(vp.back().x-vp[i].x<=d){\n vpn.push_back(vp[i]);\n }else{\n vpe1.push_back(vp[i]);\n vpe2.push_back(vp[i]);\n }\n }\n /*\n cout<<\"vpn \";\n for(int i=0;i<vpn.size();i++){\n cout<<vpn[i].x<<\":\"<<vpn[i].y<<\" \";\n }\n cout<<\"vpe1 \";\n for(int i=0;i<vpe1.size();i++){\n cout<<vpe1[i].x<<\":\"<<vpe1[i].y<<\" \";\n }\n cout<<\"vpe2 \";\n for(int i=0;i<vpe2.size();i++){\n cout<<vpe2[i].x<<\":\"<<vpe2[i].y<<\" \";\n }\n cout<<endl;\n */\n \n \n \n sort(vpn.begin(),vpn.end(),[](Point a,Point b){\n return a.y<b.y;\n });\n for(int i=0;i<vpn.size();i++){\n if(vpn[i].y-vpn[0].y>d){\n vpe1.push_back(vpn[i]);\n }\n if(vpn.back().y-vpn[i].y>d){\n vpe2.push_back(vpn[i]);\n }\n }\n \n if(vpe1.empty()||vpe2.empty()){\n return true;\n }\n \n \n bool flag3=true;\n bool flag4=true;\n \n sort(vpe1.begin(),vpe1.end(),[](Point a,Point b){\n return a.x<b.x;\n });\n \n if(vpe1.back().x-vpe1[0].x>d){\n flag3=false;\n }\n sort(vpe1.begin(),vpe1.end(),[](Point a,Point b){\n return a.y<b.y;\n });\n if(vpe1.back().y-vpe1[0].y>d){\n flag3=false;\n }\n \n sort(vpe2.begin(),vpe2.end(),[](Point a,Point b){\n return a.x<b.x;\n });\n \n if(vpe2.back().x-vpe2[0].x>d){\n flag4=false;\n }\n sort(vpe2.begin(),vpe2.end(),[](Point a,Point b){\n return a.y<b.y;\n });\n if(vpe2.back().y-vpe2[0].y>d){\n flag4=false;\n }\n \n \n \n \n return flag1||flag2||flag3||flag4;\n \n \n \n}\n\n\nint main(){\n\n cin>>N;\n vp.resize(N);\n int x,y;\n for(int i=0;i<N;i++){\n cin>>x>>y;\n vp[i]=Point(x-y,x+y,i);\n }\n \n sort(vp.begin(),vp.end(),[](Point a,Point b){\n return a.x<b.x;\n });\n /*\n for(int i=0;i<vp.size();i++){\n cout<<vp[i].x<<\" : \"<<vp[i].y<<\" \";\n }\n cout<<endl;\n */\n \n \n \n int ng=-1;\n int ok=200050;\n int mid;\n \n while(ok-ng>1){\n mid=(ok+ng)/2;\n if(is_ok(mid)){\n ok=mid;\n }else{\n ng=mid;\n }\n }\n cout<<ok<<endl;\n \n \n}", "accuracy": 0.8, "time_ms": 580, "memory_kb": 9076, "score_of_the_acc": -1.6225, "final_rank": 20 }, { "submission_id": "aoj_0552_5366544", "code_snippet": "#include <iostream>\n#include <vector>\n\nusing namespace std;\nconstexpr int INF = 1 << 30;\n\nvoid solve() {\n int n;\n cin >> n;\n\n vector<pair<int, int>> ps(n);\n for (auto& [u, v] : ps) {\n int x, y;\n cin >> x >> y;\n // 45度回転\n u = x + y, v = x - y;\n }\n\n int ans = INF;\n for (int q = 0; q < 2; ++q) {\n int xl = INF, xr = -INF, yl = INF, yr = -INF;\n for (auto [x, y] : ps) {\n xl = min(xl, x), xr = max(xr, x);\n yl = min(yl, y), yr = max(yr, y);\n }\n\n int d = 0;\n for (auto [x, y] : ps) {\n // [xl,xl+d]*[yl,yl+d]か[xr-d,xr]*[yr-d,yr]に入れる\n int r = min(max(x - xl, y - yl), max(xr - x, yr - y));\n d = max(d, r);\n }\n ans = min(ans, d);\n\n // 上下反転\n for (auto& [x, y] : ps) x = -x;\n }\n\n cout << ans << \"\\n\";\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n solve();\n\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3780, "score_of_the_acc": -0.0304, "final_rank": 3 }, { "submission_id": "aoj_0552_4821738", "code_snippet": "#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nint main() {\n\tcin.tie(0);\n\tios_base::sync_with_stdio(false);\n\tint N;\n\tcin >> N;\n\tvector<int> X(N), Y(N);\n\tfor (int i = 0; i < N; ++i) {\n\t\tint xt, yt;\n\t\tcin >> xt >> yt;\n\t\tX[i] = xt + yt;\n\t\tY[i] = xt - yt;\n\t}\n\tint xl = *min_element(X.begin(), X.end());\n\tint xr = *max_element(X.begin(), X.end());\n\tint yl = *min_element(Y.begin(), Y.end());\n\tint yr = *max_element(Y.begin(), Y.end());\n\tint ans1 = min(max(xr - xl, (yr - yl) / 2), max(yr - yl, (xr - xl) / 2));\n\tint ans2 = 0, ans3 = 0;\n\tfor (int i = 0; i < N; ++i) {\n\t\tans2 = max(ans2, min(max(X[i] - xl, Y[i] - yl), max(xr - X[i], yr - Y[i])));\n\t\tans3 = max(ans3, min(max(X[i] - xl, yr - Y[i]), max(xr - X[i], Y[i] - yl)));\n\t}\n\tcout << min({ ans1, ans2, ans3 }) << endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3508, "score_of_the_acc": 0, "final_rank": 1 }, { "submission_id": "aoj_0552_4176048", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long int;\nusing P = pair<int, int>;\nusing P3 = pair<int,P>;\nusing PP = pair<P, P>;\nconstexpr int INF = 1<<30;\nconstexpr ll MOD = ll(1e9)+7;\nconstexpr int di[] = {0,1,0,-1};\nconstexpr int dj[] = {1,0,-1,0};\n\nvoid chmin(int &a, int b){\n a = min(a, b);\n}\n\nvoid chmax(int &a, int b){\n a = max(a, b);\n}\n\nint n, smax = -INF, smin = INF, tmax = -INF, tmin = INF;\nvector<int> s, t;\n\n// 距離x以下で分割できるか\nbool check(int x){\n vector<int> gs(n,2), gt(n,2);\n // 45度回転した平面で9つの領域に分類\n for(int i=0;i<n;i++){\n if(min(abs(s[i]-smin),abs(s[i]-smax)) > x) return false;\n else if(abs(s[i]-smax) > x) gs[i] = 0;\n else if(abs(s[i]-smin) > x) gs[i] = 1;\n }\n for(int i=0;i<n;i++){\n if(min(abs(t[i]-tmin),abs(t[i]-tmax)) > x) return false;\n else if(abs(t[i]-tmax) > x) gt[i] = 0;\n else if(abs(t[i]-tmin) > x) gt[i] = 1;\n }\n int cnt[4]{};\n for(int i=0;i<n;i++){\n if(gs[i]==0 && gt[i]==0) cnt[0]++;\n if(gs[i]==0 && gt[i]==1) cnt[1]++;\n if(gs[i]==1 && gt[i]==0) cnt[2]++;\n if(gs[i]==1 && gt[i]==1) cnt[3]++;\n }\n return (cnt[0]+cnt[3]==0 || cnt[1]+cnt[2]==0);\n}\n\nint main(){\n cin >> n;\n s.resize(n);\n t.resize(n);\n for(int i=0;i<n;i++){\n int x, y;\n cin >> x >> y;\n s[i] = x+y;\n t[i] = x-y;\n chmax(smax, s[i]); chmin(smin, s[i]);\n chmax(tmax, t[i]); chmin(tmin, t[i]);\n }\n int ok = 1e6, ng = 0;\n while(abs(ok-ng)>1){\n int mid = (ok+ng)/2;\n if(check(mid)){\n ok = mid;\n }else{\n ng = mid;\n }\n }\n cout << ok << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 60, "memory_kb": 4384, "score_of_the_acc": -0.1857, "final_rank": 9 }, { "submission_id": "aoj_0552_4106894", "code_snippet": "#include<iostream>\n#include<cstdlib>\n#include<algorithm>\nusing namespace std;\nint uma,umi,vma,vmi;\n\nint da(int u,int v){\n int l1,l2;\n l1 = max(uma-u,vma-v);\n l2 = max(u-umi,v-vmi);\n return min(l1,l2);\n}\n\nint db(int u,int v){\n int l1,l2;\n l1 = max(uma-u,v-vmi);\n l2 = max(u-umi,vma-v);\n return min(l1,l2);\n}\n\nint main(){\n int n,x,y,a,b;\n int u[100010],v[100010];\n \n cin >> n;\n for(int i=0;i<n;i++){\n cin >> x >> y;\n u[i] = x+y;\n v[i] = x-y;\n if(i == 0){\n uma = u[i];\n umi = u[i];\n vma = v[i];\n vmi = v[i];\n }\n uma = max(uma,u[i]);\n umi = min(umi,u[i]);\n vma = max(vma,v[i]);\n vmi = min(vmi,v[i]);\n }\n \n a = 0;\n b = 0;\n for(int i=0;i<n;i++){\n a = max(a,da(u[i],v[i]));\n b = max(b,db(u[i],v[i]));\n }\n cout << min(a,b) << endl;\n \n return(0);\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3872, "score_of_the_acc": -0.0933, "final_rank": 6 }, { "submission_id": "aoj_0552_3938850", "code_snippet": "#include <iostream>\n#include <vector>\n#include <array>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <unordered_map>\n#include <set>\n#include <unordered_set>\n#include <tuple>\n#include <bitset>\n#include <memory>\n#include <cmath>\n#include <algorithm>\n#include <functional>\n#include <iomanip>\n#include <numeric>\n#include <climits>\n#include <cfloat>\n\nstruct Line {\n\tint section;\n\tLine(const int s) : section{ s } {};\n\tvirtual int y(const int x) const = 0;\n};\n\nstruct Coordinate {\n\tint x, y;\n\tint distance_from(const Line& line) const {\n\t\treturn std::abs(y - line.y(x));\n\t}\n};\nstruct Line45 : public Line {\n\tint y(const int x) const override {\n\t\treturn section + x;\n\t}\n\tLine45(const Coordinate& c) : Line{ c.y - c.x } {};\n};\nstruct Line135 : public Line {\n\tint y(const int x) const override {\n\t\treturn section - x;\n\t}\n\tLine135(const Coordinate& c) : Line{ c.y + c.x } {};\n};\n\n\nint main() {\n\tint n; std::cin >> n;\n\tstd::vector<Coordinate> facility(n);\n\tfor (auto& f : facility) std::cin >> f.x >> f.y;\n\tLine45 min_line45(facility.front()), max_line45(facility.front());\n\tLine135 min_line135(facility.front()), max_line135(facility.front());\n\tfor (const auto& f : facility) {\n\t\tLine45 line45(f);\n\t\tLine135 line135(f);\n\t\tif (line45.section < min_line45.section) {\n\t\t\tmin_line45 = line45;\n\t\t}\n\t\tif (line45.section > max_line45.section) {\n\t\t\tmax_line45 = line45;\n\t\t}\n\t\tif (line135.section < min_line135.section) {\n\t\t\tmin_line135 = line135;\n\t\t}\n\t\tif (line135.section > max_line135.section) {\n\t\t\tmax_line135 = line135;\n\t\t}\n\t}\n\tauto min = 1;\n\tauto max = 400001;\n\twhile (min < max) {\n\t\tauto mid = (min + max) / 2;\n\t\tbool can_separate = \n\t\t\tstd::all_of(facility.begin(), facility.end(), [mid, min_line45, max_line45, min_line135, max_line135](const Coordinate& f) {\n\t\t\treturn (f.distance_from(min_line45) <= mid && f.distance_from(min_line135) <= mid) ||\n\t\t\t\t(f.distance_from(max_line45) <= mid && f.distance_from(max_line135) <= mid);\n\t\t\t\t}) ||\n\t\t\tstd::all_of(facility.begin(), facility.end(), [mid, min_line45, max_line45, min_line135, max_line135](const Coordinate& f) {\n\t\t\t\t\treturn (f.distance_from(max_line45) <= mid && f.distance_from(min_line135) <= mid) ||\n\t\t\t\t\t\t(f.distance_from(min_line45) <= mid && f.distance_from(max_line135) <= mid);\n\t\t\t\t});\n\t\t\t\tif (can_separate) {\n\t\t\t\t\tmax = mid;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tmin = mid + 1;\n\t\t\t\t}\n\t}\n\tstd::cout << max << '\\n';\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3636, "score_of_the_acc": -0.0669, "final_rank": 4 }, { "submission_id": "aoj_0552_3428291", "code_snippet": "#define _USE_MATH_DEFINES\n\n#include <cstdio>\n#include <cstdlib>\n#include <iostream>\n#include <cmath>\n#include <cstring>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <map>\n\nusing namespace std;\n\ntypedef pair<long long int, long long int> P;\n\nint INF = 1e9;\nlong long int MOD = 1e9 + 7;\n\nint x[110000], y[110000];\n\nint dist(int p1, int p2){\n\treturn abs(x[p1] - x[p2]) + abs(y[p1] - y[p2]);\n}\n\nint main(){\n\tint N;\n\tcin >> N;\n\tint n1 = INF, n2 = -INF, n3 = INF, n4 = -INF;\n\tint p1, p2, p3, p4;\n\tfor(int i = 0; i < N; i++){\n\t\tcin >> x[i] >> y[i];\n\t\tint m1 = x[i] + y[i], m2 = x[i] - y[i];\n\t\tif(m1 < n1){\n\t\t\tn1 = m1;\n\t\t\tp1 = i;\n\t\t}\n\t\tif(m1 > n2){\n\t\t\tn2 = m1;\n\t\t\tp2 = i;\n\t\t}\n\t\tif(m2 < n3){\n\t\t\tn3 = m2;\n\t\t\tp3 = i;\n\t\t}\n\t\tif(m2 > n4){\n\t\t\tn4 = m2;\n\t\t\tp4 = i;\n\t\t}\n\t}\n\tint ans = INF;\n\tint S = dist(p3, p4);\n\tfor(int i = 0; i < N; i++){\n\t\tS = max(S, min(dist(i, p1), dist(i, p2)));\n\t}\n\tans = min(S, ans);\n\tS = dist(p1, p2);\n\tfor(int i = 0; i < N; i++){\n\t\tS = max(S, min(dist(i, p3), dist(i, p4)));\n\t}\n\tans = min(S, ans);\n\tS = max(dist(p1, p3), dist(p2, p4));\n\tfor(int i = 0; i < N; i++){\n\t\tS = max(S, min(max(dist(i, p1), dist(i, p3)), max(dist(i, p2), dist(i, p4))));\n\t}\n\tans = min(S, ans);\n\tS = max(dist(p1, p4), dist(p2, p3));\n\tfor(int i = 0; i < N; i++){\n\t\tS = max(S, min(max(dist(i, p1), dist(i, p4)), max(dist(i, p2), dist(i, p3))));\n\t}\n\tans = min(S, ans);\n\tcout << ans << endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3796, "score_of_the_acc": -0.0848, "final_rank": 5 }, { "submission_id": "aoj_0552_3164212", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n\ntemplate<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}\ntemplate<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}\n\n//INSERT ABOVE HERE\nsigned main(){\n Int n;\n cin>>n;\n using P = pair<Int, Int>;\n vector<P> v;\n for(Int i=0;i<n;i++){\n Int x,y;\n cin>>x>>y;\n v.emplace_back(x+y,x-y);\n }\n Int iu=v[0].first,au=v[0].first;\n Int iv=v[0].second,av=v[0].second;\n for(Int i=0;i<n;i++){\n chmin(iu,v[i].first);\n chmax(au,v[i].first);\n chmin(iv,v[i].second);\n chmax(av,v[i].second);\n }\n //cout<<iu<<\" \"<<au<<\":\"<<iv<<\" \"<<av<<endl;\n auto check1=\n [&](Int d)->Int{\n for(Int i=0;i<n;i++){\n\tif(v[i].first<=iu+d&&v[i].second<=iv+d) continue;\n\tif(au-d<=v[i].first&&av-d<=v[i].second) continue;\n\treturn 0;\n }\n return 1;\n };\n auto check2=\n [&](Int d)->Int{\n for(Int i=0;i<n;i++){\n\tif(v[i].first<=iu+d&&av-d<=v[i].second) continue;\n\tif(au-d<=v[i].first&&v[i].second<=iv+d) continue;\n\treturn 0;\n }\n return 1;\n };\n \n Int l=-1,r=(au-iu)+(av-iv);\n while(l+1<r){\n Int m=(l+r)>>1;\n if(check1(m)||check2(m)) r=m;\n else l=m;\n }\n cout<<r<<endl;\n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 4936, "score_of_the_acc": -0.2123, "final_rank": 11 }, { "submission_id": "aoj_0552_3074744", "code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#define lol(i,n) for(int i=0;i<n;i++)\n#define Max(a,b) a=max(a,b);\n#define Min(a,b) a=min(a,b);\n#define mod 1000000007\ntypedef long long ll;\n\nusing namespace std;\n#define N 100010\nll x[N],y[N],n;\nbool F(ll m){\n ll mx=-mod,my=-mod,sx=mod,sy=mod;\n lol(i,n){\n\tMax(mx,x[i]);Max(my,y[i]);\n\tMin(sx,x[i]);Min(sy,y[i]);\n }\n if(mx-sx<=m){\n\tlol(i,n)if(sy+m<y[i]&&y[i]<my-m)return 0;\n\treturn 1;\n }\n if(my-sy<=m){\n\tlol(i,n)if(sx+m<x[i]&&x[i]<mx-m)return 0;\n\treturn 1;\n }\n ll mw=-mod,mh=-mod,sw=mod,sh=mod;\n lol(i,n){\n\tif(x[i]>sx+m||y[i]>sy+m){\n\t Max(mw,x[i]);Max(mh,y[i]);\n\t Min(sw,x[i]);Min(sh,y[i]);\n\t}\n }\n return (mw-sw<=m&&mh-sh<=m);\n}\nll Solve(){\n ll l=0,r=mod,m;\n while(l<r-1){\n\tm=(l+r)/2;\n\tif(F(m))r=m;\n\telse l=m;\n }\n return r;\n}\nvoid Flipx(){lol(i,n)x[i]=-x[i];}\nvoid Flipy(){lol(i,n)y[i]=-y[i];}\nint main(){\n cin>>n;\n lol(i,n){\n\tll a,b;cin>>a>>b;\n\tx[i]=a+b,y[i]=a-b;\n }\n ll ans=mod;\n Min(ans,Solve());\n Flipx();\n Min(ans,Solve());\n Flipy();\n Min(ans,Solve());\n Flipx();\n Min(ans,Solve());\n cout<<ans<<endl;\n return 0;\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 4588, "score_of_the_acc": -0.226, "final_rank": 13 }, { "submission_id": "aoj_0552_3025263", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <set>\nusing namespace std;\ntypedef pair<int, int> P;\n#define X first\n#define Y second\n\nstruct rcomp{\n bool operator()(const P &a, const P &b){\n return (a.Y != b.Y)? a.Y<b.Y: a.X<b.X;\n }\n};\n\nint main(){\n int n;\n cin >> n;\n set<P> pxf;\n set<P, rcomp> pyf;\n for(int i=0; i<n; i++){\n int x,y;\n cin >> x >> y;\n pxf.insert(P(x+y, x-y));\n pyf.insert(P(x+y, x-y));\n }\n\n //まず最遠点を分ける\n P fp[2];\n if((*pxf.rbegin()).X -(*pxf.begin()).X > (*pyf.rbegin()).Y -(*pyf.begin()).Y){\n fp[0] = *pxf.begin();\n fp[1] = *pxf.rbegin();\n }else{\n fp[0] = *pyf.begin();\n fp[1] = *pyf.rbegin();\n }\n pxf.erase(fp[0]);\n pxf.erase(fp[1]);\n pyf.erase(fp[0]);\n pyf.erase(fp[1]);\n\n //分割するグループ\n set<P> axf, bxf;\n set<P, rcomp> ayf, byf;\n axf.insert(fp[0]);\n ayf.insert(fp[0]);\n bxf.insert(fp[1]);\n byf.insert(fp[1]);\n\n while(!pxf.empty()){\n P p1 = *pxf.begin();\n pyf.erase(p1);\n pxf.erase(p1);\n //最も遠い点が、A,B、未処理のどこにあるか判定\n //(ソート済みの最初と最後だけ見ればいい)\n int dax = max(abs((*axf.begin()).X -p1.X), abs((*axf.rbegin()).X -p1.X));\n int day = max(abs((*ayf.begin()).Y -p1.Y), abs((*ayf.rbegin()).Y -p1.Y));\n int dbx = max(abs((*bxf.begin()).X -p1.X), abs((*bxf.rbegin()).X -p1.X));\n int dby = max(abs((*byf.begin()).Y -p1.Y), abs((*byf.rbegin()).Y -p1.Y));\n int dpx = 0;\n int dpy = 0;\n if(!pxf.empty()){\n dpx = max(abs((*pxf.begin()).X -p1.X), abs((*pxf.rbegin()).X -p1.X));\n dpy = max(abs((*pyf.begin()).Y -p1.Y), abs((*pyf.rbegin()).Y -p1.Y)); \n } \n int da = max(dax, day);\n int db = max(dbx, dby);\n int dp = max(dpx, dpy);\n\n //Aの場合はBに、Bの場合はAに入れる\n if(da >= max(db, dp)){\n bxf.insert(p1);\n byf.insert(p1);\n }else if(db >= max(da, dp)){\n axf.insert(p1);\n ayf.insert(p1);\n }else{\n //未処理の場合は、未処理最遠点対をA,Bに分けて入れる\n //未処理最遠点を取り出す\n P p2;\n if(dpx > dpy){\n if(abs((*pxf.begin()).X -p1.X) > abs((*pxf.rbegin()).X -p1.X)){\n p2 = *pxf.begin(); \n }else{\n p2 = *pxf.rbegin();\n }\n }else{\n if(abs((*pyf.begin()).Y -p1.Y) > abs((*pyf.rbegin()).Y -p1.Y)){\n p2 = *pyf.begin(); \n }else{\n p2 = *pyf.rbegin();\n }\n }\n pxf.erase(p2);\n pyf.erase(p2);\n\n //ロスの少ないほうに入れる\n int dax2 = max(abs((*axf.begin()).X -p2.X), abs((*axf.rbegin()).X -p2.X));\n int day2 = max(abs((*ayf.begin()).Y -p2.Y), abs((*ayf.rbegin()).Y -p2.Y));\n int dbx2 = max(abs((*bxf.begin()).X -p2.X), abs((*bxf.rbegin()).X -p2.X));\n int dby2 = max(abs((*byf.begin()).Y -p2.Y), abs((*byf.rbegin()).Y -p2.Y));\n int da2 = max(dax2, day2);\n int db2 = max(dbx2, dby2);\n if(max(da, db2) > max(db, da2)){\n swap(p1, p2);\n }\n axf.insert(p1);\n ayf.insert(p1);\n bxf.insert(p2);\n byf.insert(p2);\n }\n }\n cout << max(max((*axf.rbegin()).X -(*axf.begin()).X, (*ayf.rbegin()).Y -(*ayf.begin()).Y),\n max((*bxf.rbegin()).X -(*bxf.begin()).X, (*byf.rbegin()).Y -(*byf.begin()).Y) )\n << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 170, "memory_kb": 12452, "score_of_the_acc": -1.2807, "final_rank": 18 }, { "submission_id": "aoj_0552_2974099", "code_snippet": "#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define NUM 100000\n\nenum Type{\n\tA,\n\tB,\n\tBoth,\n};\n\nstruct ADD{\n\tbool operator<(const struct ADD &arg) const{\n\t\treturn value < arg.value;\n\t}\n\tint value,index;\n};\n\nstruct SUB{\n\tbool operator<(const struct SUB &arg) const{\n\t\treturn value < arg.value;\n\t}\n\tint value,index;\n};\n\nint N;\nADD info_add[NUM];\nSUB info_sub[NUM];\nType type[2][NUM];\n\n\nbool is_OK(int max_dist){\n\n\tfor(int i = 0; i < N; i++){\n\t\ttype[0][i] = Both;\n\t\ttype[1][i] = Both;\n\t}\n\n\tint num_A;\n\n\ttype[0][info_add[0].index] = A;\n\tnum_A = 1;\n\n\tfor(int i = 1; i < N; i++){\n\t\tif(info_add[i].value-info_add[0].value > max_dist && info_add[N-1].value - info_add[i].value > max_dist)return false;\n\n\t\tif(info_add[i].value-info_add[0].value > max_dist){\n\t\t\ttype[0][info_add[i].index] = B;\n\t\t}\n\t\tif(info_add[N-1].value-info_add[i].value > max_dist){\n\t\t\ttype[0][info_add[i].index] = A;\n\t\t\tnum_A++;\n\t\t}\n\t}\n\tif(num_A == N)return false;\n\n\ttype[1][info_sub[0].index] = A;\n\tnum_A = 1;\n\n\tfor(int i = 1; i < N; i++){\n\t\tif(info_sub[i].value-info_sub[0].value > max_dist && info_sub[N-1].value - info_sub[i].value > max_dist)return false;\n\n\t\tif(info_sub[i].value-info_sub[0].value > max_dist){\n\t\t\ttype[1][info_sub[i].index] = B;\n\t\t}\n\t\tif(info_sub[N-1].value-info_sub[i].value > max_dist){\n\t\t\ttype[1][info_sub[i].index] = A;\n\t\t\tnum_A++;\n\t\t}\n\t}\n\tif(num_A == N)return false;\n\n\n\tint num_both = 0;\n\tint num_diff = 0;\n\n\tfor(int i = 0; i < N; i++){\n\t\tif(type[0][i] == Both || type[1][i] == Both){\n\n\t\t\tnum_both++;\n\n\t\t}else if(type[0][i] != type[1][i]){\n\t\t\tnum_diff++;\n\t\t}\n\t}\n\n\tif(num_diff == 0)return true;\n\tif(num_both+num_diff == N)return true;\n\n\treturn false;\n\n\n}\n\nint main(){\n\n\tscanf(\"%d\",&N);\n\n\tfor(int i = 0; i < N; i++){\n\t\tinfo_add[i].index = i;\n\t\tinfo_sub[i].index = i;\n\t}\n\n\tint x,y;\n\tfor(int i = 0; i < N; i++){\n\t\tscanf(\"%d %d\",&x,&y);\n\n\t\tinfo_add[i].value = x+y;\n\t\tinfo_sub[i].value = x-y;\n\t}\n\tsort(info_add,info_add+N);\n\tsort(info_sub,info_sub+N);\n\n\tint left = 0,right = 400000, m = (left+right)/2;\n\tint ans = right;\n\n\twhile(left <= right){\n\n\t\tif(is_OK(m)){\n\t\t\tans = m;\n\t\t\tright = m-1;\n\t\t}else{\n\t\t\tleft = m+1;\n\t\t}\n\t\tm = (left+right)/2;\n\t}\n\n\tprintf(\"%d\\n\",ans);\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 5568, "score_of_the_acc": -0.2654, "final_rank": 14 }, { "submission_id": "aoj_0552_2739057", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\n#define rep(i,n) FOR(i,0,n)\n#define pb emplace_back\ntypedef long long ll;\ntypedef pair<int,int> pint;\n\nint x[100001],y[100001];\nint main(){\n int n,xi,yi;\n cin>>n;\n rep(i,n){\n cin>>xi>>yi;\n x[i]=xi+yi;\n y[i]=xi-yi;\n }\n int xmx=*max_element(x,x+n);\n int xmn=*min_element(x,x+n);\n int ymx=*max_element(y,y+n);\n int ymn=*min_element(y,y+n);\n int mx=0,mx2=0;\n rep(i,n){\n mx=max(mx,min(max(xmx-x[i],y[i]-ymn),max(ymx-y[i],x[i]-xmn)));\n mx2=max(mx2,min(max(xmx-x[i],ymx-y[i]),max(y[i]-ymn,x[i]-xmn)));\n }\n cout<<min(mx,mx2)<<endl;\n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 3892, "score_of_the_acc": -0.0956, "final_rank": 7 }, { "submission_id": "aoj_0552_2717506", "code_snippet": "#include <cstdio>\n#include <cstdlib>\n#include <cmath>\n#include <climits>\n#include <cfloat>\n#include <cstring>\n#include <map>\n#include <utility>\n#include <set>\n#include <iostream>\n#include <memory>\n#include <string>\n#include <vector>\n#include <list>\n#include <algorithm>\n#include <functional>\n#include <sstream>\n#include <complex>\n#include <stack>\n#include <queue>\n#include <unordered_set>\n#include <unordered_map>\n#include <array>\n#include <cassert>\n#include <bitset>\nusing namespace std;\nusing LL = long long;\n\nstruct point {\n\tLL x, y;\n\t//0=どちらも 1=A 2=B 3=矛盾\n\tint idx;\n\tint idy;\n\tpoint(LL x, LL y)\n\t\t:x(x), y(y), idx(), idy() {}\n};\n\nint N;\nvector<point>vec;\n\nint main(void)\n{\n\tcin >> N;\n\tfor (int i = 0; i < N; ++i) {\n\t\tLL x, y;\n\t\tcin >> x >> y;\n\t\tvec.push_back(point(x + y, x - y));\n\t}\n\tint lo = 0, hi = 222222;\n\twhile (lo + 1 < hi) {\n\t\tint mid = (lo + hi) / 2;\n\t\tvector<point>tmp = vec;\n\t\tsort(tmp.begin(), tmp.end(), [](const point&p1, const point&p2) {\n\t\t\treturn p1.x < p2.x;\n\t\t});\n\t\tLL fx = tmp.front().x;\n\t\tLL bx = tmp.back().x;\n\t\t//[fx+mid+1,INF]をAにする\n\t\t//[-INF,bx-mid-1]をBにする\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tif (fx + mid + 1 <= tmp[i].x) {\n\t\t\t\ttmp[i].idx += 1;\n\t\t\t}\n\t\t\tif (tmp[i].x <= bx - mid - 1) {\n\t\t\t\ttmp[i].idx += 2;\n\t\t\t}\n\t\t}\n\t\tsort(tmp.begin(), tmp.end(), [](const point&p1, const point&p2) {\n\t\t\treturn p1.y < p2.y;\n\t\t});\n\t\tLL fy = tmp.front().y;\n\t\tLL by = tmp.back().y;\n\t\t//[fy+mid+1,INF]をAにする\n\t\t//[-INF,by-mid-1]をBにする\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tif (fy + mid + 1 <= tmp[i].y) {\n\t\t\t\ttmp[i].idy += 1;\n\t\t\t}\n\t\t\tif (tmp[i].y <= by - mid - 1) {\n\t\t\t\ttmp[i].idy += 2;\n\t\t\t}\n\t\t}\n\t\t//チェックする\n\t\tbool oneflag = true;\n\t\tbool twoflag = true;\n\t\tconst auto convbit = [](int id) {\n\t\t\tif (id == 0)return 0;\n\t\t\tif (id == 1)return 2;\n\t\t\tif (id == 2)return 1;\n\t\t\tif (id == 3)return 3;\n\t\t};\n\t\tfor (int i = 0; i < N; ++i) {\n\t\t\tif ((tmp[i].idx | tmp[i].idy) == 3) {\n\t\t\t\toneflag = false;\n\t\t\t}\n\t\t\tif ((tmp[i].idx | convbit(tmp[i].idy)) == 3) {\n\t\t\t\ttwoflag = false;\n\t\t\t}\n\t\t}\n\t\tbool flag = (oneflag || twoflag);\n\t\tif (!flag) {\n\t\t\tlo = mid;\n\t\t}\n\t\telse {\n\t\t\thi = mid;\n\t\t}\n\t}\n\tcout << hi << endl;\n\treturn 0;\n}", "accuracy": 0.8, "time_ms": 250, "memory_kb": 7364, "score_of_the_acc": -0.8522, "final_rank": 19 }, { "submission_id": "aoj_0552_2698309", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define fi first\n#define se second\ntypedef pair<int,int> P;\nconst int inf = 1e6;\n#define rep(i,n) for(int i = 0;i < n;i++)\n#define rrep(i,n) for(int i = 1;i <= n;i++)\n\nint used[100000];\n\nint calc(int k, vector<P> x, int f, int a, int b){\n\tint n = x.size();\n\tfor(int i = 0;i < n;i++){\n\t\tif(x[0].fi+k < x[i].fi){\n\t\t\tint u = x[i].se;\n\t\t\tif(used[u] == b || x[i].fi+k < x[n-1].fi)return 0;\n\t\t\tif(f)used[u] = a;\n\t\t}\n\t}\n\tfor(int i = n-1;i >= 0;i--){\n\t\tif(x[i].fi+k < x[n-1].fi){\n\t\t\tint u = x[i].se;\n\t\t\tif(used[u] == a)return 0;\n\t\t\tif(f)used[u] = b;\n\t\t}\n\t}\n\treturn 1;\n}\n\nvector<P> x, y;\nint solve(int k){\n\tint t[3] = {}; \n\tt[0] = calc(k, x, 1, 1, 2);\n\tt[1] = calc(k, y, 0, 1, 2);\n\tt[2] = calc(k, y, 0, 2, 1);\n\tif(t[0] == 0)return 0;\n\tif(t[1] || t[2])return 1;\n\treturn 0;\n}\n\nint main(){\n\tint n, a, b;\n\t\n\tscanf(\"%d\", &n);\n\tfor(int i = 0;i < n;i++){\n\t\tscanf(\"%d%d\", &a, &b);\n\t\tx.push_back(P(a+b, i));\n\t\ty.push_back(P(b-a, i));\n\t}\n\tsort(x.begin(), x.end());\n\tsort(y.begin(), y.end());\n\t\n\t\n\tint lb = 0, ub = inf;\n\twhile(ub-lb > 1){\n\t\tfill(used, used+100000, 0);\n\t\tint mid = (lb+ub)/2;\n\t\tint res = solve(mid);\n\t\tif(res)ub = mid;\n\t\telse lb = mid;\n\t}\n\t\n\tprintf(\"%d\\n\", ub);\n\treturn 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 5760, "score_of_the_acc": -0.3044, "final_rank": 15 } ]
aoj_0551_cpp
つらら 問題 カナダに住む JOI 君の家の軒下には,立派なつららが出来ている.せっかくなので,JOI 君はつららについて調べてみることにした. JOI 君の家の軒下には N 本(2 ≤ N ≤ 100000 = 10 5 )のつららが出来ている.これらのつららは一直線上に並んでおり,軒下の左端から i cm(1 ≤ i ≤ N )の位置に i 本目のつららが出来ている.i 本目のつららの長さは最初 ai cm(ai は 1 以上の整数)である.これらのつららは,次のような規則によって伸びていく: i 本目のつららは,i − 1 本目のつららと i + 1 本目のつららの両方よりも長い場合にのみ,1 時間につき 1 cm ずつ伸びる(ただし,両端のつららに関しては片方の隣のみ考える.すなわち,1 本目のつららは 2 本目のつららより長ければ伸び,N 本目のつららは N − 1 本目のつららより長ければ伸びる). どのつららも,L cm(2 ≤ L ≤ 50000)に達した瞬間に,根元から折れる(折れたつららは,以後長さ 0 cm のつららとみなす) . 最初の段階で,隣り合う 2 本のつららの長さはすべて異なっている.このとき,十分な時間が経過すれば,N 本すべてのつららが折れて長さ 0 cm となる.JOI 君は,つららがこのような状態になるまでの時間を知りたくなった. N 本のつららの最初の長さとつららの限界の長さ L が与えられると,すべてのつららが折れるまでにかかる時間を求めるプログラムを作成せよ. 入力 入力の 1 行目には,つららの本数を表す整数 N とつららの限界の長さを表す整数 L が,空白を区切りとしてこの順に書かれている.入力の i + 1 行目 (1 ≤ i ≤ N) に は, i 本目のつららの最初の長さを表す整数 ai (1 ≤ ai < L) が書かれている. 採点用データのうち,配点の 30% 分については,N ≤ 500 かつ L ≤ 1000 を満 たす. 出力 出力 は,すべてのつららが折れるまでにかかる時間を表す 1 つの整数のみを含む 1 行からなる. 入出力例 入力例 1 4 6 4 2 3 5 出力例 1 8 例 1 の場合,1, 2, 3, 4 本目のつららは,それぞれ 2, 8, 4, 1 時間後に折れる.した がって,すべてのつららが折れるまでにかかる時間は 8 時間であるので,8 を出力 する. 入力例 2 6 10 3 4 1 9 5 1 出力例 2 15 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0551_10946339", "code_snippet": "#include<iostream>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<functional>\nusing namespace std;\npriority_queue<pair<long long, int>, vector<pair<long long, int>>, greater<pair<long long, int>>>Q;\nlong long dist[200000], a[200000], n, L, maxn;\nbool G(int t) { if (a[t] > a[t - 1] && a[t] > a[t + 1])return true; return false; }\nint main() {\n\tcin >> n >> L; for (int i = 1; i <= n; i++)cin >> a[i];\n\tfor (int i = 1; i <= n; i++) {\n\t\tif (G(i) == true) { Q.push(make_pair(L - a[i], i)); dist[i] = L - a[i]; }\n\t}\n\twhile (!Q.empty()) {\n\t\tlong long a1 = Q.top().first, a2 = Q.top().second; Q.pop(); a[a2] = 0; maxn = a1;\n\t\tif (a2 >= 2 && G(a2 - 1) == true) { dist[a2 - 1] = a1 + (L - a[a2 - 1]); Q.push(make_pair(dist[a2 - 1], a2 - 1)); }\n\t\tif (a2 <= n - 1 && G(a2 + 1) == true) { dist[a2 + 1] = a1 + (L - a[a2 + 1]); Q.push(make_pair(dist[a2 + 1], a2 + 1)); }\n\t}\n\tcout << maxn << endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 5864, "score_of_the_acc": -0.9634, "final_rank": 16 }, { "submission_id": "aoj_0551_10889012", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include<utility>\n#include<set>\n#include<deque>\n#include <unordered_map>\n#include<string>\n#include<map>\n#include<cmath>\n#include <unordered_set>\n\nusing namespace std;\nint N, L;\n\n\nvector<int>Li;\nvector<int>memo;\n\n//メモ化する\nint T(int n,vector<int>&memo) {\n\tint ans = 0;\n\tif (n == 0) {\n\t\tif (Li[n] < Li[n + 1]) {\n\t\t\tif (memo[n + 1] == -1) {\n\t\t\t\tans = L - Li[n] + T(n + 1,memo);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tans = L - Li[n] + memo[n+1];\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tmemo[n] = L - Li[n];\n\t\t\treturn L-Li[n];\n\t\t}\n\t}\n\telse if (n == N - 1) {\n\t\tif (Li[n] < Li[n - 1]) {\n\t\t\tif (memo[n - 1] == -1) {\n\t\t\t\tans = L - Li[n] + T(n - 1,memo);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tans = L - Li[n] + memo[n-1];\n\t\t\t}\n\t\t}\n\t\telse {\n\t\t\tmemo[n] = L - Li[n];\n\t\t\treturn L-Li[n];\n\t\t}\n\t}\n\telse {\n\t\tint z = -1;\n\t\tif (Li[n] < Li[n - 1]) {\n\t\t\tz = 0;\n\t\t\tif (memo[n - 1] == -1) {\n\t\t\t\tz = L - Li[n] + T(n - 1,memo);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tz = L - Li[n] + memo[n - 1];\n\t\t\t}\n\t\t\tans = z;\n\t\t}\n\t\tif (Li[n] < Li[n + 1]) {\n\t\t\tz = 0;\n\t\t\tif (memo[n + 1] == -1) {\n\t\t\t\tz = L - Li[n] + T(n + 1,memo);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tz = L - Li[n] + memo[n + 1];\n\t\t\t}\n\t\t\tans = max(ans,z);\n\t\t}\n\t\tif (z == -1) {\n\t\t\tmemo[n] = L - Li[n];\n\t\t\treturn L - Li[n];\n\t\t}\n\t\t\n\t}\n\tmemo[n] = ans;\n\treturn ans;\n\n}\n\nint main() {\n\t\n\tcin >> N >> L;\n\tfor (int i = 0; i < N; i++) {\n\t\tint x;\n\t\tcin >> x;\n\t\tLi.push_back(x);\n\t\tmemo.push_back(-1);\n\t\t\n\t}\n\t\n\t\n\t\n\tint ans = 0;\n\t\n\t\n\tfor (int i = 0; i < N; i++) {\n\t\t\n\t\tans = max(ans, T(i,memo));\n\t}\n\tcout << ans << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5860, "score_of_the_acc": -0.4625, "final_rank": 10 }, { "submission_id": "aoj_0551_10399702", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n// イベント用の構造体 (折損時刻 t, 氷柱 idx)\nstruct Event {\n ll t;\n int idx;\n bool operator<(Event const &e) const {\n // priority_queue は最大ヒープなので逆順に\n return t > e.t;\n }\n};\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n int N;\n ll L;\n cin >> N >> L;\n\n vector<ll> a(N);\n for(int i = 0; i < N; i++){\n cin >> a[i];\n }\n\n // 「ピーク化開始時刻」(まだピーク化していなければ -1)\n vector<ll> start(N, -1);\n // 折損済みフラグ\n vector<bool> broken(N, false);\n\n // 時刻順イベント\n priority_queue<Event> pq;\n\n // 領域外参照防止のため、長さ0のダミーを両端に設定\n auto length_at = [&](int i, ll now){\n if(i < 0 || i >= N) return 0LL;\n if(broken[i]) return 0LL;\n if(start[i] < 0) return a[i];\n // start[i]から now までずっとピーク成長した分を足す\n return a[i] + (now - start[i]);\n };\n\n // 「いまピーク化すべきか」を判定\n auto try_peak = [&](int j, ll now){\n if(j < 0 || j >= N) return;\n if(broken[j] || start[j] >= 0) return; // 壊済み or 既にピーク化済み\n ll Lc = length_at(j, now);\n ll Ll = length_at(j-1, now);\n ll Lr = length_at(j+1, now);\n if(Lc > Ll && Lc > Lr){\n // ピーク化開始\n start[j] = now;\n // 折損予定 = now + (L - 初期 a[j])\n ll t_break = now + (L - a[j]);\n pq.push({t_break, j});\n }\n };\n\n // 初期ピークをスケジュール\n for(int i = 0; i < N; i++){\n // 両隣より長ければピーク\n ll li = (i>0? a[i-1] : 0);\n ll ri = (i+1<N? a[i+1] : 0);\n if(a[i] > li && a[i] > ri){\n start[i] = 0;\n pq.push({L - a[i], i});\n }\n }\n\n ll ans = 0;\n // イベントを時刻順に消化\n while(!pq.empty()){\n auto ev = pq.top(); pq.pop();\n ll t = ev.t;\n int i = ev.idx;\n if(broken[i]) continue; // 既に壊れていたらスキップ\n // 実際に折損させる\n broken[i] = true;\n ans = max(ans, t);\n // 隣の 2 本を「今、この時刻でピーク化すべきか」チェック\n try_peak(i-1, t);\n try_peak(i+1, t);\n }\n\n cout << ans << \"\\n\";\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5704, "score_of_the_acc": -0.4263, "final_rank": 9 }, { "submission_id": "aoj_0551_10343042", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n\nint main(){\n int n,l;\n cin >> n >> l;\n vector<int> a(n);\n rep(i,n){\n cin >> a[i];\n }\n\n vector<int> ldp(n),rdp(n);\n ldp[0]=l-a[0];\n for(int i=1;i<n;i++){\n if(a[i-1]<a[i]){\n ldp[i]=l-a[i];\n }\n else{\n ldp[i]=ldp[i-1]+l-a[i];\n }\n }\n rdp[n-1]=l-a[n-1];\n for(int i=n-2;i>=0;i--){\n if(a[i+1]<a[i]){\n rdp[i]=l-a[i];\n }\n else{\n rdp[i]=rdp[i+1]+l-a[i];\n }\n }\n int res=0;\n rep(i,n){\n res = max({res,ldp[i],rdp[i]});\n }\n cout << res << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4316, "score_of_the_acc": -0.1047, "final_rank": 4 }, { "submission_id": "aoj_0551_9648066", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, N) for (int i = 0; i < N; i++)\nint I[110000] = {};\nint r[110000] = {};\nint N, L;\n\nint rec(int loc)\n{\n if (r[loc] != 0)\n return r[loc];\n else\n {\n if (I[loc - 1] < I[loc] && I[loc] > I[loc + 1])\n {\n r[loc] = L - I[loc];\n }\n else if (I[loc - 1] > I[loc] && I[loc] < I[loc + 1])\n {\n r[loc] = (L - I[loc] + max(rec(loc - 1), rec(loc + 1)));\n }\n else if (I[loc - 1] > I[loc] && I[loc] > I[loc + 1])\n {\n r[loc] = L - I[loc] + rec(loc - 1);\n }\n else if (I[loc - 1] < I[loc] && I[loc] < I[loc + 1])\n {\n r[loc] = L - I[loc] + rec(loc + 1);\n }\n return r[loc];\n }\n}\n\nint main()\n{\n cin >> N >> L;\n rep(i, N) cin >> I[i + 1]; // 1 - N\n\n for (int i = 1; i < N + 1; i++)\n {\n rec(i);\n }\n cout << *max_element(r + 1, r + N + 1) << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 5868, "score_of_the_acc": -0.9643, "final_rank": 17 }, { "submission_id": "aoj_0551_9024614", "code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\nf128 binary_search_real(F check, f128 ok, f128 ng, ll iter = 100) {\n rep(iter) {\n f128 x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n if (x < 0) { cout << (i64)(x); }\n else { cout << (u64)(x); }\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {break;}\n return 0;\n}\n\nint solve() {\n ll N, L;\n cin >> N >> L;\n vi a(N+2), dp(N+2, 0);\n pq<pi> Q;\n a[0] = a[N+1] = 0;\n rep(i, 1, N+1) cin >> a[i];\n rep(i, 1, N+1) Q.emplace(mp(a[i], i));\n while (!Q.empty()) {\n auto [l, i] = POP(Q);\n if (a[i] < a[i-1]) chmax(dp[i], dp[i-1]);\n if (a[i] < a[i+1]) chmax(dp[i], dp[i+1]);\n dp[i] += L - a[i];\n }\n print(MAX(dp));\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 6632, "score_of_the_acc": -0.6413, "final_rank": 13 }, { "submission_id": "aoj_0551_8475628", "code_snippet": "#include <bits/stdc++.h>\n#define endl \"\\n\"\n#define INF INT_MAX\nusing namespace std;\nbool check(char c,string s){\nbool f = 0;\n\tfor(int i = 0;i < s.size();i++){\n\t\tif(s[i] == c)f = 1;\n\t}\nreturn f;\n}\nint main(){\n#define int long long\ncin.tie(nullptr);ios::sync_with_stdio(false);\nint n,m;\ncin >>n>>m;\nvector<int>a(n+2);\nfor(int i = 1;i <= n;i++)cin >>a[i];\nint c = 0,time = 0;\npriority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>b;\nfor(int i = 1;i <= n;i++){\n\tif(a[i-1] < a[i]&&a[i+1] < a[i])b.push({m-a[i],i});\n}\nwhile(!b.empty()){\n\tint x = b.top().first,y = b.top().second;\n\tb.pop();\n\ttime = x;\n\tc++;\n\ta[y] = 0;\n\tif(y-1 != 0&&a[y-2] < a[y-1]&&a[y] < a[y-1])b.push({m-a[y-1]+time,y-1});\n\tif(y+1 != n+1&&a[y+2] < a[y+1]&&a[y] < a[y+1])b.push({m-a[y+1]+time,y+1});\n}\ncout <<time<<endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4820, "score_of_the_acc": -0.2215, "final_rank": 6 }, { "submission_id": "aoj_0551_8130796", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\n\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n ll N,L;\n cin>>N>>L;\n priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>> Q;\n vll A(N+2,0);\n rep(i,N){\n cin>>A[i+1];\n }\n rep(i,N){\n if(A[i]<A[i+1]&&A[i+1]>A[i+2]){\n Q.push({L-A[i+1],i+1});\n }\n }\n ll an=0;\n vll AN(N);\n while(!Q.empty()){\n auto tn=Q.top();\n Q.pop();\n ll t=tn.first;\n ll n=tn.second;\n an=t;\n AN[n-1]=t;\n A[n]=0;\n if(n-1!=0&&A[n-1]>0){\n if(A[n-1]>A[n-2]){\n Q.push({t+L-A[n-1],n-1});\n }\n }\n if(n+1!=N+1&&A[n+1]>A[n+2]&&A[n+1]>0){\n Q.push({t+L-A[n+1],n+1});\n }\n }\n cout<<an<<endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 5456, "score_of_the_acc": -0.3689, "final_rank": 8 }, { "submission_id": "aoj_0551_6354027", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint main(){\n int n, l; cin >> n >> l;\n vector<int> a(n); for(auto&e : a) cin >> e;\n queue<int> qu;\n vector<int> seen(n);\n auto f = [&](int i){\n if(i < 0 || n <= i) return false;\n if(i && a[i-1] >= a[i]) return false;\n if(i+1 != n && a[i] <= a[i+1]) return false;\n if(seen[i]) return false;\n return true;\n };\n \n for(int i = 0; i < n; ++i){\n if(!f(i)) continue;\n qu.emplace(i); seen[i] = 1;\n }\n \n int64_t ans = 0;\n vector<int64_t> st(n);\n while(!qu.empty()){\n auto x = qu.front(); qu.pop();\n int64_t t = st[x] + l - a[x];\n ans = max(ans, t);\n a[x] = 0;\n if(f(x-1)){ qu.emplace(x-1); seen[x-1] = 1; st[x-1] = t; }\n if(f(x+1)){ qu.emplace(x+1); seen[x+1] = 1; st[x+1] = t; }\n }\n cout << ans << \"\\n\";\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4940, "score_of_the_acc": -0.2493, "final_rank": 7 }, { "submission_id": "aoj_0551_6131574", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\ntypedef long long ll;\n//typedef int ll;\n//typedef pair<ll, ll> P;\nconst long long INF = 1e9;\ntemplate <typename T>\nvoid input_arr(vector<T>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i];\n\t}\n}\ntemplate <typename T, typename Q>\nvoid input_arr(vector<pair<T, Q>>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i].first >> A[i].second;\n\t}\n}\ntemplate <typename T>\nvoid input_arr(vector<vector<T>>& A, ll H, ll W) {\n\tfor (ll i = 0; i < H; i++) {\n\t\tfor (ll j = 0; j < W; j++) {\n\t\t\tcin >> A[i][j];\n\t\t}\n\t}\n}\nint main() {\n ll N, M; cin >> N >> M;\n vector<ll>A(N); input_arr(A, N);\n vector<ll>B = A;\n sort(B.begin(), B.end(), greater<ll>());\n for (ll i = 0; i < B.size(); i++) {\n }\n vector<vector<ll>>C(M + 1);\n for (ll i = 0; i < N; i++) {\n C[A[i]].push_back(i);\n }\n vector<bool>D(N, false);\n vector<ll>T(N, 0);\n for (ll i = 0; i < N; i++) {\n ll pos = C[B[i]].back();\n C[B[i]].pop_back();\n if (pos == 0) {\n if (!D[pos + 1]) {\n T[pos] = M - B[i];\n }\n else {\n T[pos] = T[pos + 1] + M - B[i];\n }\n }\n else if (pos == N - 1) {\n if (!D[pos - 1]) {\n T[pos] = M - B[i];\n }\n else {\n T[pos] = T[pos - 1] + M - B[i];\n }\n }\n else {\n if (!D[pos - 1] && !D[pos + 1]) {\n T[pos] = M - B[i];\n }\n else if (!D[pos - 1] && D[pos + 1]) {\n T[pos] = T[pos + 1] + M - B[i];\n }\n else if (D[pos - 1] && !D[pos + 1]) {\n T[pos] = T[pos - 1] + M - B[i];\n }\n else {\n T[pos] = max(T[pos - 1], T[pos + 1]) + M - B[i];\n }\n }\n D[pos] = true;\n }\n ll ans = -1;\n for (ll i = 0; i < N; i++) {\n ans = max(ans, T[i]);\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 8180, "score_of_the_acc": -1.5, "final_rank": 20 }, { "submission_id": "aoj_0551_5849524", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing lint = long long;\n#define rep(i, n) for(int i = 0; i < int(n); i++)\n#define rep2(i, l, n) for(int i = int(l); i < int(n); i++)\n\nint main(){\n int n;\n lint l;\n cin >> n >> l;\n lint a[n];\n rep(i, n) cin >> a[i];\n \n auto get = [&](int k){ return (0 <= k && k < n) ? a[k] : 0; };\n \n using P = pair<lint, int>;\n priority_queue<P, vector<P>, greater<P>> que;\n rep(i, n){\n if(a[i] > get(i - 1) && a[i] > get(i + 1)){\n que.push({l - a[i], i});\n }\n }\n \n lint ans = 0;\n while(!que.empty()){\n auto top = que.top();\n que.pop();\n int at = top.second;\n lint t = top.first;\n if(a[at] == 0) continue;\n a[at] = 0;\n \n ans = max(ans, t);\n \n if(at - 1 >= 0){\n int to = at - 1;\n if(a[to] > get(to - 1) && a[to] > get(to + 1)){\n que.push({t + l - a[to], to});\n }\n }\n if(at + 1 < n){\n int to = at + 1;\n if(a[to] > get(to - 1) && a[to] > get(to + 1)){\n que.push({t + l - a[to], to});\n }\n }\n }\n \n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4900, "score_of_the_acc": -0.74, "final_rank": 14 }, { "submission_id": "aoj_0551_5476831", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, N) for (int i = 0; i < N; i++)\nint I[110000] = {};\nint r[110000] = {};\nint N, L;\n\nint rec(int loc)\n{\n if (r[loc] != 0)\n return r[loc];\n else\n {\n if (I[loc - 1] < I[loc] && I[loc] > I[loc + 1])\n {\n r[loc] = L - I[loc];\n }\n else if (I[loc - 1] > I[loc] && I[loc] < I[loc + 1])\n {\n r[loc] = (L - I[loc] + max(rec(loc - 1), rec(loc + 1)));\n }\n else if (I[loc - 1] > I[loc] && I[loc] > I[loc + 1])\n {\n r[loc] = L - I[loc] + rec(loc - 1);\n }\n else if (I[loc - 1] < I[loc] && I[loc] < I[loc + 1])\n {\n r[loc] = L - I[loc] + rec(loc + 1);\n }\n return r[loc];\n }\n}\n\nint main()\n{\n cin >> N >> L;\n rep(i, N) cin >> I[i + 1]; // 1 - N\n\n for (int i = 1; i < N + 1; i++)\n {\n rec(i);\n }\n cout << *max_element(r + 1, r + N + 1) << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 5736, "score_of_the_acc": -0.9337, "final_rank": 15 }, { "submission_id": "aoj_0551_5379154", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint main(){\n int n,l;\n cin >> n >> l;\n vector<int> a(n);\n for(int i=0; i<n; i++){\n cin >> a[i];\n }\n vector<int> ans(n, 0);\n ans[0] = max(ans[0], l-a[0]);\n for(int i=1; i<n; i++){\n if(a[i] < a[i-1]){\n ans[i] = max(ans[i], ans[i-1]+l-a[i]);\n }else{\n ans[i] = max(ans[i], l-a[i]);\n }\n }\n for(int i=n-2; i>=0; i--){\n if(a[i] < a[i+1]){\n ans[i] = max(ans[i], ans[i+1]+l-a[i]);\n }else{\n ans[i] = max(ans[i], l-a[i]);\n }\n }\n cout << *max_element(ans.begin(), ans.end()) << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3864, "score_of_the_acc": 0, "final_rank": 1 }, { "submission_id": "aoj_0551_5240407", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n\treturn (ull)rng() % B;\n}\n\nint main(){\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\tint n,k; cin >> n >> k;\n\tvector<int> dp(n,0);\n\tqueue<int> q;\n\tvector<int> a(n);\n\tfor(int i=0;i<n;i++){\n\t\tcin >> a[i];\n\t}\n\tfor(int i=0;i<n;i++){\n\t\tif(!i or a[i-1]<a[i]){\n\t\t\tif(i+1==n or a[i]>a[i+1]){\n\t\t\t\tq.push(i);\n\t\t\t}\n\t\t}\n\t}\n\twhile(q.size()){\n\t\tint p=q.front(); q.pop();\n\t\tint mx=0;\n\t\tif(p-1>=0){\n\t\t\tmx=dp[p-1];\n\t\t\tif(p-2<0 or dp[p-2]>0 or a[p-1]>a[p-2])if(!dp[p-1])q.push(p-1);\n\t\t}\n\t\tif(p+1<n){\n\t\t\tmx=max(mx,dp[p+1]);\n\t\t\tif(p+2>=n or dp[p+2]>0 or a[p+1]>a[p+2])if(!dp[p+1])q.push(p+1);\n\t\t}\n\t\tdp[p]=mx+(k-a[p]);\n\t}\n\tsort(dp.begin(), dp.end());\n\tprintf(\"%d\\n\",dp.back());\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3980, "score_of_the_acc": -0.0269, "final_rank": 2 }, { "submission_id": "aoj_0551_4750415", "code_snippet": "#include<bits/stdc++.h>\n#define rep(i, x) for(ll i = 0; i < x; i++)\n#define rep2(i, x) for(ll i = 1; i <= x; i++)\n#define all(a) (a).begin(),(a).end()\nusing ll = long long;\nusing ld = long double;\nusing namespace std;\nconst ll INF = 1000000000000000000;\nconst ll mod = 1000000007;\nconst ld pi = 3.141592653589793238;\n\nll in[12345678], jikan[12345678], used[12345678];\nsigned main() {\n\tll n, l; cin >> n >> l;\n\tin[0] = 0; in[n + 1] = 0;\n\trep2(i, n) { cin >> in[i]; }\n\tqueue<ll> que;\n\trep2(i, n) {\n\t\tif (in[i - 1] < in[i] && in[i] > in[i + 1]) { \n\t\t\tjikan[i] = max(jikan[i - 1], jikan[i + 1]) + (l - in[i]); used[i]++; in[i] = 0;\n\t\t\tif (used[i - 1] == 0) { que.push(i - 1); }\n\t\t\tif (used[i + 1] == 0) { que.push(i + 1); }\n\t\t}\n\t}\n\twhile (que.size()) {\n\t\tll a = que.front(); que.pop();\n\t\tif (used[a] != 0) { continue; }\n\t\tif (a == 0 || a == n + 1) { continue; }\n\t\tif (in[a - 1] < in[a] && in[a] > in[a + 1]) {\n\t\t\tjikan[a] = max(jikan[a - 1], jikan[a + 1]) + (l - in[a]); used[a]++; in[a] = 0;\n\t\t\tif (used[a - 1] == 0) { que.push(a - 1); }\n\t\t\tif (used[a + 1] == 0) { que.push(a + 1); }\n\t\t}\n\t}\n\tll ans = 0;\n\trep2(i, n) { ans = max(ans, jikan[i]); }\n\tcout << ans << endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 5988, "score_of_the_acc": -0.9921, "final_rank": 18 }, { "submission_id": "aoj_0551_4695320", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nint N, L;\nvector<pair<int, int> > IciclesInfo;\nint DpTime[100002];\n\nvoid solve() {\n\tint curId;\n\n\tfor (int i = 0; i < N; ++i) {\n\t\tcurId = IciclesInfo[i].second;\n\t\tif (DpTime[curId - 1] == 0 && DpTime[curId + 1] == 0) {\n\t\t\tDpTime[curId] = L - IciclesInfo[i].first;\n\t\t\tcontinue;\n\t\t}\n\t\tif (DpTime[curId - 1] > DpTime[curId + 1]) {\n\t\t\tDpTime[curId] = DpTime[curId - 1] + L - IciclesInfo[i].first;\n\t\t}\n\t\telse {\n\t\t\tDpTime[curId] = DpTime[curId + 1] + L - IciclesInfo[i].first;\n\t\t}\n\t}\n}\n\nint main() {\n\tint a;\n\n\tmemset(DpTime, 0, sizeof(DpTime));\n\tcin >> N >> L;\n\tfor (int i = 0; i < N; ++i) {\n\t\tcin >> a;\n\t\tIciclesInfo.push_back({ a,i + 1 });\n\t}\n\tsort(IciclesInfo.begin(), IciclesInfo.end(), greater<pair<int,int> >());\n\t\n\tsolve();\n\tcout << *max_element(DpTime + 1, DpTime + N + 1) << endl;\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4208, "score_of_the_acc": -0.5797, "final_rank": 12 }, { "submission_id": "aoj_0551_4417787", "code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdint>\n#include <cstdio>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\n#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)\n#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)\n#define All(v) (v).begin(), (v).end()\n#define pb push_back\n#define MP(a, b) make_pair((a), (b))\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nconst int INF = 1 << 30;\nconst ll LINF = 1LL << 60;\nconst int MOD = 1e9 + 7;\n\nbool ready(int i, vector<pii> &icicle) {\n int N = icicle.size();\n if(i < 0 || i >= N)\n return false;\n if(i == 0) {\n if(icicle[i].first > icicle[i + 1].first) {\n return true;\n }\n } else if(i == N - 1) {\n if(icicle[i].first > icicle[i - 1].first) {\n return true;\n }\n } else {\n if(icicle[i].first > icicle[i + 1].first &&\n icicle[i].first > icicle[i - 1].first) {\n return true;\n }\n }\n return false;\n}\n\nint main() {\n int N, L;\n cin >> N >> L;\n vector<pii> icicle(N);\n rep(i, N) {\n int a;\n cin >> a;\n icicle[i] = MP(a, 0);\n }\n queue<pii> que;\n rep(i, N) {\n if(ready(i, icicle)) {\n que.push(MP(i, 0));\n }\n }\n\n while(!que.empty()) {\n auto p = que.front();\n que.pop();\n int idx = p.first;\n int now = p.second;\n icicle[idx].second = now + (L - icicle[idx].first);\n icicle[idx].first = 0;\n if(ready(idx - 1, icicle)) {\n int ma = 0;\n if(idx - 2 >= 0)\n ma = icicle[idx - 2].second;\n que.push(MP(idx - 1, max(ma, icicle[idx].second)));\n }\n if(ready(idx + 1, icicle)) {\n int ma = 0;\n if(idx + 2 < N)\n ma = icicle[idx + 2].second;\n que.push(MP(idx + 1, max(ma, icicle[idx].second)));\n }\n }\n int res = 0;\n rep(i, N) { res = max(res, icicle[i].second); }\n cout << res << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 4044, "score_of_the_acc": -0.5417, "final_rank": 11 }, { "submission_id": "aoj_0551_4379780", "code_snippet": "#include<bits/stdc++.h>\n#define enld '\\n'\n#define rep(i,n) for(int i=0; i<(n); i++)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"Ofast\")\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\nconstexpr ll mod = 1000000007;\nconstexpr ll mod2 = 998244353;\nconst double PI = 3.1415926535897932384626433832795028841971;\nconst int dx[6] = {1, 0, -1, 0,1,1};\nconst int dy[6] = {0, 1, 0, -1,1,-1};\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n// ---------------------------------------------------------------------------\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n ll N,L;\n cin >> N >> L;\n vector<int> A(N);\n for(int i=0; i<N; i++){\n cin >> A[i];\n }\n vector<int> cnt(N,0);\n priority_queue<pair<ll,int>> que;\n if(A[0] > A[1]){\n cnt[0] = 0;\n que.emplace(A[0],0);\n }else{\n cnt[0] = 1;\n }\n if(A[N-1] > A[N-2]){\n cnt[N-1] = 0;\n que.emplace(A[N-1],N-1);\n }else{\n cnt[N-1] = 1;\n }\n for(int i=1; i<N-1; i++){\n if(A[i-1] > A[i]) cnt[i]++;\n if(A[i] < A[i+1]) cnt[i]++;\n if(!cnt[i]) que.emplace(A[i],i);\n }\n ll ans = 0;\n while(que.size()){\n auto v = que.top();\n que.pop();\n v.first += ans;\n ans += L-v.first;\n if(v.second != 0){\n cnt[v.second-1]--;\n if(cnt[v.second-1] == 0){\n que.emplace(A[v.second-1]-ans,v.second-1);\n }\n }\n if(v.second != N-1){\n cnt[v.second+1]--;\n if(cnt[v.second+1] == 0){\n que.emplace(A[v.second+1]-ans,v.second+1);\n }\n }\n }\n cout<< ans << enld;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4684, "score_of_the_acc": -0.19, "final_rank": 5 }, { "submission_id": "aoj_0551_4379759", "code_snippet": "// #define _GLIBCXX_DEBUG // for STL debug (optional)\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\n#include <bitset>\nusing namespace std;\nusing ll = long long int;\nusing int64 = long long int;\n \ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\n \nint dx[] = {0, 0, 1, -1};\nint dy[] = {1, -1, 0, 0};\nconst int INF = 1LL << 29;\nconst ll LONGINF = 1LL << 60;\nconst ll MOD = 1000000007LL;\n \nint main() {\n int N, L; scanf(\"%d%d\", &N, &L);\n\n vector<int> A(N+2, -1);\n for(int i=1; i<=N; i++) scanf(\"%d\", &A[i]);\n\n vector<bool> visited(N+2);\n visited[0] = visited[N+1] = true;\n\n priority_queue< pair<ll, ll>, vector< pair<ll, ll> >, greater< pair<ll, ll> > > que;\n for(int i=1; i<=N; i++) {\n bool ok = true;\n for(int j=-1; j<=1; j+=2) ok &= A[i] > A[i+j];\n if(ok) que.emplace(0LL, (ll)i);\n }\n\n ll ans = 0;\n while(que.size()) {\n ll l, k; tie(l, k) = que.top(); que.pop();\n l += L - A[k];\n chmax(ans, l);\n A[k] = 0;\n for(int j=-1; j<=1; j++) {\n if(visited[k+j]) continue;\n if(A[k+j-1] < A[k+j] and A[k+j+1] < A[k+j]) {\n visited[k+j] = true;\n que.emplace(l, k+j);\n }\n }\n }\n printf(\"%lld\\n\", ans);\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 4240, "score_of_the_acc": -0.0871, "final_rank": 3 }, { "submission_id": "aoj_0551_4378806", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef pair<ll,ll> mp;\nll inf = 1e9;\n\n\nint main(){\n ll n,l;\n cin>>n>>l;\n\n vector<ll> a(n+2,0);\n vector<ll> d(n+2,0);\n for(ll i=1;i<=n;i++) cin>>a[i];\n for(ll i=1;i<=n;i++){\n if( a[i] < a[i-1] ) d[i]++;\n if( a[i] < a[i+1] ) d[i]++;\n }\n\n priority_queue<mp,vector<mp>,greater<mp> > q;\n for(ll i=1;i<=n;i++){\n if( d[i] == 0 ) q.push( mp( l-a[i] ,i ) );\n }\n ll res = 0;\n while(!q.empty() ){\n mp now = q.top();\n q.pop();\n ll nn = now.second;\n ll time = now.first;\n res = max( res , time );\n d[nn-1]--;\n d[nn+1]--;\n if( d[nn-1] == 0 ){\n q.push( mp(time + l-a[nn-1] , nn-1 ) );\n }\n if( d[nn+1] == 0 ){\n q.push( mp(time + l-a[nn+1] , nn+1 ) );\n }\n }\n cout<<res<<endl;\n\n return 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 5448, "score_of_the_acc": -1.367, "final_rank": 19 } ]
aoj_0556_cpp
タイル (Tile) 問題 JOI 高校では， 1 × 1 の正方形のタイルを使って N × N の正方形の壁画を作り，文化祭で展示することになった．タイルの色は，赤，青，黄の 3 種類である．壁画のデザインは次の通りである．まず，最も外側の周に赤のタイルを貼り，その内側の周に青のタイルを貼る．さらにその内側の周に黄色のタイルを貼る．これを N × N の正方形が埋め尽くされるまで繰り返す．用いるタイルの色は，一番外側の周から順番に赤，青，黄，赤，青，黄，…である． 文化祭が近づいてきたある日，壁画のうち K 枚のタイルがはがれていることが判明した．そこで，新しいタイルを購入して，はがれた箇所に新しいタイルを貼ることにした． 入力として壁画の一辺の長さ N と，はがれたタイルの枚数 K， K 枚のはがれたタイルの位置が与えられたとき，はがれたタイルの色を求めるプログラムを作成せよ． 例えば，N = 11 の場合，11 × 11 の壁画のデザインは下図の通りである． また，N = 16 の場合，16 × 16 の壁画のデザインは下図の通りである． 入力 入力は全部で 2+K 行からなる． 1 行目には，壁画の一辺の長さ N （1 ≤ N ≤ 1000000000 = 10 9 ）が， 2 行目には，はがれたタイルの枚数 K （1 ≤ K ≤ 1000）が書かれている． 2+i 行目（1 ≤ i ≤ K）には，2 つの整数 ai と bi （1 ≤ ai ≤ N, 1 ≤ bi ≤ N）が空白区切りで書かれており， i 枚目のはがれたタイルが，左から ai 列目，上から bi 行目のタイルであることを表す． 入力の 3 行目から 2+K 行目には同じタイルを表す行が重複して現れることはない．また，与えられる入力データ 40% では， N ≤ 1000 をみたしている． 出力 出力は K 行からなる．各行は 1 つの整数からなり， i 行目（1 ≤ i ≤K）の整数は，i 枚目のはがれたタイルが赤のときは 1 を，青のときは 2 を，黄色のときは 3 を表す． 入出力例 入力例 1 11 4 5 2 9 7 4 4 3 9 出力例 1 2 3 1 3 入力例 2 16 7 3 7 5 2 11 6 15 2 9 7 8 12 15 16 出力例 2 3 2 3 2 1 2 1 問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0556_2940233", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0; i<n; i++)\nint main(){\n int n;\n cin >> n;\n int t[n][n]={};\n int a,b,h=0,w=0;\n int cnt=1;\n while(1){\n for(int i=h; i<n-h; i++){\n for(int j=w; j<n-w; j++){\n t[i][j] = cnt;\n }\n }\n h++;\n w++;\n cnt++;\n if(cnt==4) cnt = 1;\n if(h==n/2+1) break;\n }\n /*rep(i,n){\n rep(j,n){\n cout << t[i][j];\n }\n cout << endl;\n }*/\n int k;\n cin >> k;\n rep(i,k){\n cin >> a >> b;\n cout << t[a-1][b-1] << endl;\n }\n return 0;\n}", "accuracy": 0.4, "time_ms": 70, "memory_kb": 6980, "score_of_the_acc": -1.0881, "final_rank": 4 }, { "submission_id": "aoj_0556_2940190", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0; i<n; i++)\nint main(){\n int n;\n cin >> n;\n int t[n+10][n+10]={};\n int a,b,h=0,w=0;\n int cnt=1;\n while(1){\n for(int i=h; i<n-h; i++){\n for(int j=w; j<n-w; j++){\n t[i][j] = cnt;\n }\n }\n h++;\n w++;\n cnt++;\n if(cnt==4) cnt = 1;\n if(h==n/2+1) break;\n }\n /*rep(i,n){\n rep(j,n){\n cout << t[i][j];\n }\n cout << endl;\n }*/\n int k;\n cin >> k;\n rep(i,k){\n cin >> a >> b;\n cout << t[a-1][b-1] << endl;\n }\n return 0;\n}", "accuracy": 0.4, "time_ms": 70, "memory_kb": 7036, "score_of_the_acc": -1.0914, "final_rank": 5 }, { "submission_id": "aoj_0556_2584779", "code_snippet": "#include<stdio.h>\n#include<iostream>\n#include<algorithm>\nusing namespace std;\nint main(){\nlong long n,a,b,f,m,i;\ncin>>n;\ncin>>f;\nfor(i=0;i<f;i++){\n\tcin>>a>>b;\n\tif(a>b){\n\tm=a;\n\ta=b;\n\tb=m;\n\t}\n\tm=min(a,n+1-b);\n\tm=m%3;\n\tif(m==0)m=3;\n\tcout<<m<<endl;\n}\nreturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3080, "score_of_the_acc": -0.1116, "final_rank": 3 }, { "submission_id": "aoj_0556_2104506", "code_snippet": "#include<stdio.h>\nlong long int hideo, masao, koutay, nagase, a[1010][1010] = { 0 }, y = 0, z = 0;\n\tlong long int str[1011][1011] = { 0 };\n\tint main(){\n\tscanf(\"%d\", &hideo);\n\tfor (int x = 0; x < hideo; x++) {\n\t\tfor (int i = z; i < hideo - z; i++) {\n\t\t\tfor (int j = z; j < hideo - z; j++) {\n\t\t\t\tif (y == 0) {\n\t\t\t\t\tstr[i][j] = 1;\n\t\t\t\t}\n\t\t\t\telse if (y == 1) {\n\t\t\t\t\tstr[i][j] = 2;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tstr[i][j] = 3;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tz++;\n\t\ty++;\n\t\tif (y == 3)y = 0;\n\t}\n\tscanf(\"%d\", &masao);\n\tfor (int i = 0; i < masao; i++) {\n\t\tscanf(\"%d %d\", &koutay, &nagase);\n\t\tprintf(\"%d\\n\", str[koutay - 1][nagase - 1]);\n\t}\n}", "accuracy": 0.4, "time_ms": 90, "memory_kb": 18372, "score_of_the_acc": -2, "final_rank": 9 }, { "submission_id": "aoj_0556_2104499", "code_snippet": "#include<stdio.h>\n\tunsigned int hideo, masao, koutay, nagase, a[1010][1010] = { 0 }, y = 0, z = 0;\n\tint str[1011][1011] = { 0 };\n\tint main(){\n\tscanf(\"%d\", &hideo);\n\tfor (int x = 0; x < hideo; x++) {\n\t\tfor (int i = z; i < hideo - z; i++) {\n\t\t\tfor (int j = z; j < hideo - z; j++) {\n\t\t\t\tif (y == 0) {\n\t\t\t\t\tstr[i][j] = 1;\n\t\t\t\t}\n\t\t\t\telse if (y == 1) {\n\t\t\t\t\tstr[i][j] = 2;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tstr[i][j] = 3;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tz++;\n\t\ty++;\n\t\tif (y == 3)y = 0;\n\t}\n\tscanf(\"%d\", &masao);\n\tfor (int i = 0; i < masao; i++) {\n\t\tscanf(\"%d %d\", &koutay, &nagase);\n\t\tprintf(\"%d\\n\", str[koutay - 1][nagase - 1]);\n\t}\n}", "accuracy": 0.4, "time_ms": 90, "memory_kb": 10456, "score_of_the_acc": -1.5401, "final_rank": 8 }, { "submission_id": "aoj_0556_2104473", "code_snippet": "#include<stdio.h>\n\tint hideo, masao, koutay, nagase, a[1001][1001] = { 0 }, y = 0, z = 0;\n\tint str[1001][1001] = { 0 };\n\tint main()\n\t{\n\tscanf(\"%d\", &hideo);\n\tfor (int x = 0; x < hideo; x++) {\n\t\tfor (int i = z; i < hideo - z; i++) {\n\t\t\tfor (int j = z; j < hideo - z; j++) {\n\t\t\t\tif (y == 0) {\n\t\t\t\t\tstr[i][j] = 1;\n\t\t\t\t}\n\t\t\t\telse if (y == 1) {\n\t\t\t\t\tstr[i][j] = 2;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tstr[i][j] = 3;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tz++;\n\t\ty++;\n\t\tif (y == 3)y = 0;\n\t}\n\tscanf(\"%d\", &masao);\n\tfor (int i = 0; i < masao; i++) {\n\t\tscanf(\"%d %d\", &koutay, &nagase);\n\t\tprintf(\"%d\\n\", str[koutay - 1][nagase - 1]);\n\t}\n}", "accuracy": 0.4, "time_ms": 90, "memory_kb": 10304, "score_of_the_acc": -1.5313, "final_rank": 7 }, { "submission_id": "aoj_0556_2104469", "code_snippet": "#include<stdio.h>\nint main()\n{\n\tint hideo, masao, koutay, nagase, a[1001][1001] = { 0 }, y = 0, z = 0;\n\tint str[1001][1001] = { 0 };\n\tscanf(\"%d\", &hideo);\n\tfor (int x = 0; x < hideo; x++) {\n\t\tfor (int i = z; i < hideo - z; i++) {\n\t\t\tfor (int j = z; j < hideo - z; j++) {\n\t\t\t\tif (y == 0) {\n\t\t\t\t\tstr[i][j] = 1;\n\t\t\t\t}\n\t\t\t\telse if (y == 1) {\n\t\t\t\t\tstr[i][j] = 2;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tstr[i][j] = 3;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tz++;\n\t\ty++;\n\t\tif (y == 3)y = 0;\n\t}\n\tscanf(\"%d\", &masao);\n\tfor (int i = 0; i < masao; i++) {\n\t\tscanf(\"%d %d\", &koutay, &nagase);\n\t\tprintf(\"%d\\n\", str[koutay - 1][nagase - 1]);\n\t}\n}", "accuracy": 0.4, "time_ms": 80, "memory_kb": 6640, "score_of_the_acc": -1.1934, "final_rank": 6 }, { "submission_id": "aoj_0556_1027046", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main()\n{\n int n, k;\n cin >> n >> k;\n\n while(k--){\n int a, b;\n cin >> a >> b;\n cout << (min( min( n - a + 1, a), min( n - b + 1, b)) + 2) % 3 + 1 << endl;\n }\n \n return(0);\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 1160, "score_of_the_acc": 0, "final_rank": 1 }, { "submission_id": "aoj_0556_997979", "code_snippet": "#include <iostream>\n#include <cmath>\nusing namespace std;\n\nint main() {\n\tlong long int n;\n\tint k;\n\tcin >> n >> k;\n\tlong long int a, b, c;\n\tfor (int i = 0; i < k; i++) {\n\t\tcin >> a >> b;\n\t\ta = min(a, n+1-a);\n\t\tb = min(b, n+1-b);\n\t\tc = min(a, b);\n\t\tc = c%3;\n\t\tif (c == 0) {\n\t\t\tc = 3;\n\t\t}\n\t\tcout << c << endl;\n\t}\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 1164, "score_of_the_acc": -0.0002, "final_rank": 2 } ]
aoj_0553_cpp
ダンジョン 問題 あなたはあるダンジョンの地下 N 階にある財宝を手に入れたいと思っている.最初,あなたは地下 1 階におり,あなたの体力は H(H は正整数) である.下の階に降りるときに,体力が消費される.あらかじめ各階における下の階に降りるときに消費される体力が分かっている.一方,各階には 1 つの回復の泉があり,泉を 1 回使うごとに回復できる体力がそれぞれ定まっている.体力が 0 以下になるとあなたは死んでしまう.また,体力が H よりも高くなることはない.回復の泉は何回でも使うことができるが,回復には時間がかかるので,あなたは泉の使用回数をできるだけ少なくしたいと考えている. N ,H ,各階の下の階に降りるときに消費される体力,そして各階で回復の泉を 1 回使用したときに回復する体力が与えられたとき,体力を 0 以下にすることなく地下 N 階まで到達するために必要な泉の使用回数の最小値を求めるプログラムを作成せよ. また,一度下の階に降りると,財宝を手に入れるまで上の階に戻ることはできない. 入力 入力は N 行からなる. 入力の 1 行目には 2 つの整数 N, H(2 ≤ N ≤ 100000 = 10 5 , 1 ≤ H ≤ 10000000 = 10 7 ) が空白を区切りとして書かれている.N は地下 N 階に財宝があるということを表し,H は初期体力 ( ダンジョンの地下 1 階に到着した段階の体力 ) であり,かつ体力の最大値である ( 回復によって体力が H より大きくなることはない ) . 続く N − 1 行には,2 つの整数が空白を区切りとして書かれている.1 + i 行目(1 ≤ i ≤ N − 1) の整数 di , hi について, di は地下 i 階から地下 i + 1 階に降りる際に消費される体力を,hi は地下 i 階で泉を 1 回使用したときに回復する体力を表す(0 ≤ di < H, 1 ≤ hi < H). どの採点用データにおいても,地下 N 階にたどり着く方法が存在する.採点用データのうち,配点の 10%分については,N ≤ 1000 かつ H ≤ 1000 を満たす.配点の30%分については,N ≤1000 を満たす.配点の 50%分については,泉の使用回数の最小値が 10 6 を超えない. 出力 出力は,体力を 0 以下にすることなく地下 N 階に到達するために必要な,泉の使用回数の最小値を含む 1 行からなる. 注意 この問題では,扱う整数の範囲が 32bit に収まらない可能性があることに注意せよ. 入出力例 入力例 1 10 10 4 2 2 5 6 1 7 3 6 4 9 6 0 8 4 1 9 4 出力例 1 10 上記問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0553_10399785", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nlong long N, H, a[100009], b[100009], s[100009], sum, G, sx = 1, cx = 1;\n\nint main() {\n\tcin >> N >> H;\n\tfor (int i = 1; i <= N - 1; i++) cin >> a[i] >> b[i];\n\ts[1] = H; for (int i = 2; i <= N; i++) s[i] = s[i - 1] - a[i - 1];\n\n\t//for(int i=1;i<=N;i++) cout<<s[i]<<\" \";cout<<endl;\n\twhile (true) {\n\t\twhile (sx <= N && G + s[sx] >= 1) sx++; if (sx > N) break;\n\t\tlong long maxn = 0, maxid = 0;\n\t\tfor (int j = cx; j < sx; j++) {\n\t\t\tlong long cost = min(b[j], H - (G + s[j]));\n\t\t\tif (maxn < cost) { maxn = cost; maxid = j; }\n\t\t}\n\t\tlong long B = (H - (G + s[maxid])) / maxn;\n\t\tlong long B2 = (-(s[sx] + G) + maxn) / maxn; B = min(B, B2);//cout<<B<<endl;\n\t\t//cout<<G<<\" \"<<sx<<\" \"<<maxn<<\" \"<<maxid<<\" \"<<B<<\" \"<<sum<<endl;\n\t\tsum += B; G += maxn * B;\n\t\tcx = maxid;\n\t}\n\tcout << sum << endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 5784, "score_of_the_acc": -0.0217, "final_rank": 1 }, { "submission_id": "aoj_0553_8860186", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1 << 28;\ntypedef pair<int, int> Pr;\nint N, H;\nint *d, *h;\nint *seg_v, *seg_a;\nPr *rmq;\nint size;\nvoid seg_add(int l, int r, int x, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return;\n if (l <= a && b <= r) {\n seg_a[k] += x;\n while (k) {\n k = (k - 1) / 2;\n seg_v[k] = max(seg_v[k * 2 + 1] + seg_a[k * 2 + 1],\n seg_v[k * 2 + 2] + seg_a[k * 2 + 2]);\n }\n return;\n }\n int m = (a + b) / 2;\n seg_add(l, r, x, k * 2 + 1, a, m);\n seg_add(l, r, x, k * 2 + 2, m, b);\n}\nint seg_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return -INF;\n if (l <= a && b <= r)\n return seg_a[k] + seg_v[k];\n int m = (a + b) / 2;\n int vl = seg_getMax(l, r, k * 2 + 1, a, m);\n int vr = seg_getMax(l, r, k * 2 + 2, m, b);\n return seg_a[k] + max(vl, vr);\n}\nvoid rmq_update(int k, int x) {\n int i = k;\n k += size - 1;\n rmq[k] = Pr(x, i);\n while (k) {\n k = (k - 1) / 2;\n rmq[k] = max(rmq[k * 2 + 1], rmq[k * 2 + 2]);\n }\n}\nPr _rmq_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return Pr(-INF, -1);\n if (l <= a && b <= r)\n return rmq[k];\n int m = (a + b) / 2;\n Pr vl = _rmq_getMax(l, r, k * 2 + 1, a, m);\n Pr vr = _rmq_getMax(l, r, k * 2 + 2, m, b);\n return max(vl, vr);\n}\nint rmq_getMax(int l, int r) { return _rmq_getMax(l, r).first; }\nint rmq_getMaxIdx(int l, int r) { return _rmq_getMax(l, r).second; }\nvoid solve() {\n long long int res = 0;\n for (int i = 0; i < N; i++) {\n rmq_update(i, h[i]);\n }\n seg_add(0, N, H);\n for (int fl = 0; fl < N; fl++) {\n int max_val = seg_getMax(fl, fl + 1);\n if (max_val > H) {\n seg_add(fl, N, H - max_val);\n }\n seg_add(fl, N, -d[fl]);\n max_val = seg_getMax(fl, fl + 1);\n if (max_val > 0)\n continue;\n while (true) {\n int idx = rmq_getMaxIdx(0, fl);\n int seg_max = seg_getMax(idx, fl);\n if (h[idx] > H - seg_max) {\n h[idx] = H - seg_max;\n rmq_update(idx, h[idx]);\n continue;\n }\n int s = (H - seg_max) / h[idx];\n int hp = seg_getMax(fl, fl + 1);\n int need = -hp + 1;\n int t = (need / h[idx]) + !!(need % h[idx]);\n int num = min(s, t);\n seg_add(idx, N, h[idx] * num);\n res += num;\n if (seg_getMax(fl, fl + 1) > 0)\n break;\n }\n }\n printf(\"%lld\\n\", res);\n}\nint main() {\n scanf(\"%d %d\", &N, &H);\n d = new int[N];\n h = new int[N];\n size = 1 << (int)ceil(log2(N));\n seg_v = new int[2*size - 1];\n seg_a = new int[2*size - 1];\n rmq = new Pr[2*size - 1];\n for (int i = 0; i < N - 1; i++) {\n scanf(\"%d %d\", d + i + 1, h + i);\n }\n solve();\n delete[] d;\n delete[] h;\n delete[] seg_v;\n delete[] seg_a;\n delete[] rmq;\n}", "accuracy": 1, "time_ms": 240, "memory_kb": 7132, "score_of_the_acc": -0.8049, "final_rank": 4 }, { "submission_id": "aoj_0553_8214939", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1 << 28;\ntypedef pair<int, int> Pr;\nint N, H;\nint d[100000], h[100000];\nconst int size = 1 << 20;\nint seg_v[size * 2 - 1];\nint seg_a[size * 2 - 1];\nPr rmq[size * 2 - 1];\nvoid seg_add(int l, int r, int x, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return;\n if (l <= a && b <= r) {\n seg_a[k] += x;\n while (k) {\n k = (k - 1) / 2;\n seg_v[k] = max(seg_v[k * 2 + 1] + seg_a[k * 2 + 1],\n seg_v[k * 2 + 2] + seg_a[k * 2 + 2]);\n }\n return;\n }\n int m = (a + b) / 2;\n seg_add(l, r, x, k * 2 + 1, a, m);\n seg_add(l, r, x, k * 2 + 2, m, b);\n seg_v[k] = max(seg_v[k * 2 + 1] + seg_a[k * 2 + 1], seg_v[k * 2 + 2] + seg_a[k * 2 + 2]);\n}\nint seg_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return -INF;\n if (l <= a && b <= r)\n return seg_a[k] + seg_v[k];\n int m = (a + b) / 2;\n int vl = seg_getMax(l, r, k * 2 + 1, a, m);\n int vr = seg_getMax(l, r, k * 2 + 2, m, b);\n return max(vl, vr) + seg_a[k];\n}\nvoid rmq_update(int k, int x) {\n int i = k;\n k += size - 1;\n rmq[k] = Pr(x, i);\n while (k) {\n k = (k - 1) / 2;\n rmq[k] = max(rmq[k * 2 + 1], rmq[k * 2 + 2]);\n }\n}\nPr _rmq_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return Pr(-INF, -1);\n if (l <= a && b <= r)\n return rmq[k];\n int m = (a + b) / 2;\n Pr vl = _rmq_getMax(l, r, k * 2 + 1, a, m);\n Pr vr = _rmq_getMax(l, r, k * 2 + 2, m, b);\n return max(vl, vr);\n}\nint rmq_getMax(int l, int r) { return _rmq_getMax(l, r).first; }\nint rmq_getMaxIdx(int l, int r) { return _rmq_getMax(l, r).second; }\nvoid solve() {\n long long int res = 0;\n for (int i = 0; i < N; i++) {\n rmq_update(i, h[i]);\n }\n seg_add(0, N, H);\n for (int fl = 0; fl < N; fl++) {\n int maxVal = seg_getMax(fl, fl + 1);\n if (maxVal > H) {\n seg_add(fl, N, H - maxVal);\n }\n seg_add(fl, N, -d[fl]);\n maxVal = seg_getMax(fl, fl + 1);\n if (maxVal > 0)\n continue;\n while (true) {\n int idx = rmq_getMaxIdx(0, fl);\n int currentMax = seg_getMax(idx, fl);\n if (h[idx] > H - currentMax) {\n h[idx] = H - currentMax;\n rmq_update(idx, h[idx]);\n continue;\n }\n int s = (H - currentMax) / h[idx];\n int hp = seg_getMax(fl, fl + 1);\n int need = -hp + 1;\n int t = (need / h[idx]) + (need % h[idx] != 0);\n int num = min(s, t);\n seg_add(idx, N, h[idx] * num);\n res += num;\n if (seg_getMax(fl, fl + 1) > 0)\n break;\n }\n }\n printf(\"%lld\\n\", res);\n}\nint main() {\n scanf(\"%d %d\", &N, &H);\n for (int i = 0; i < N - 1; i++) {\n scanf(\"%d %d\", d + i + 1, h + i);\n }\n solve();\n}", "accuracy": 1, "time_ms": 330, "memory_kb": 21564, "score_of_the_acc": -1.9958, "final_rank": 20 }, { "submission_id": "aoj_0553_8214938", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1 << 28;\ntypedef pair<int, int> Pr;\nnamespace std {\nbool operator<(const Pr &a, const Pr &b) {\n if (a.first != b.first)\n return a.first < b.first;\n return a.second > b.second;\n}\n} // namespace std\nint N, H;\nint d[100000], h[100000];\nconst int size = 1 << 20;\nint seg_v[size * 2 - 1];\nint seg_a[size * 2 - 1];\nPr rmq[size * 2 - 1];\nvoid seg_add(int l, int r, int x, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return;\n if (l <= a && b <= r) {\n seg_a[k] += x;\n while (k) {\n k = (k - 1) / 2;\n seg_v[k] = max(seg_v[k * 2 + 1] + seg_a[k * 2 + 1],\n seg_v[k * 2 + 2] + seg_a[k * 2 + 2]);\n }\n return;\n }\n int m = (a + b) / 2;\n seg_add(l, r, x, k * 2 + 1, a, m);\n seg_add(l, r, x, k * 2 + 2, m, b);\n}\nint seg_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return -INF;\n if (l <= a && b <= r)\n return seg_a[k] + seg_v[k];\n int m = (a + b) / 2;\n int vl = seg_getMax(l, r, k * 2 + 1, a, m);\n int vr = seg_getMax(l, r, k * 2 + 2, m, b);\n return seg_a[k] + max(vl, vr);\n}\nvoid rmq_update(int k, int x) {\n int i = k;\n k += size - 1;\n rmq[k] = Pr(x, i);\n while (k) {\n k = (k - 1) / 2;\n rmq[k] = max(rmq[k * 2 + 1], rmq[k * 2 + 2]);\n }\n}\nPr _rmq_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return Pr(-INF, -1);\n if (l <= a && b <= r)\n return rmq[k];\n int m = (a + b) / 2;\n Pr vl = _rmq_getMax(l, r, k * 2 + 1, a, m);\n Pr vr = _rmq_getMax(l, r, k * 2 + 2, m, b);\n return max(vl, vr);\n}\nint rmq_getMax(int l, int r) { return _rmq_getMax(l, r).first; }\nint rmq_getMaxIdx(int l, int r) { return _rmq_getMax(l, r).second; }\nvoid solve() {\n long long int res = 0;\n for (int i = 0; i < N; i++) {\n rmq_update(i, h[i]);\n }\n seg_add(0, N, H);\n for (int fl = 0; fl < N; fl++) {\n if (seg_getMax(fl, fl + 1) > H) {\n seg_add(fl, N, H - seg_getMax(fl, fl + 1));\n }\n seg_add(fl, N, -d[fl]);\n if (seg_getMax(fl, fl + 1) > 0)\n continue;\n while (true) {\n int idx = rmq_getMaxIdx(0, fl);\n if (h[idx] > H - seg_getMax(idx, fl)) {\n h[idx] = H - seg_getMax(idx, fl);\n rmq_update(idx, h[idx]);\n continue;\n }\n int s = (H - seg_getMax(idx, fl)) / h[idx];\n int hp = seg_getMax(fl, fl + 1);\n int need = -hp + 1;\n int t = (need / h[idx]) + !!(need % h[idx]);\n int num = min(s, t);\n seg_add(idx, N, h[idx] * num);\n res += num;\n if (seg_getMax(fl, fl + 1) > 0)\n break;\n }\n }\n printf(\"%lld\\n\", res);\n}\nint main() {\n scanf(\"%d %d\", &N, &H);\n for (int i = 0; i < N - 1; i++) {\n scanf(\"%d %d\", d + i + 1, h + i);\n }\n solve();\n}", "accuracy": 1, "time_ms": 310, "memory_kb": 21584, "score_of_the_acc": -1.9304, "final_rank": 19 }, { "submission_id": "aoj_0553_8214937", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1 << 28;\ntypedef pair<int, int> Pr;\nint N, H;\nint d[100000], h[100000];\nconst int size = 1 << 20;\nint seg_v[size * 2 - 1];\nint seg_a[size * 2 - 1];\nPr rmq[size * 2 - 1];\nvoid seg_add(int l, int r, int x, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return;\n if (l <= a && b <= r) {\n seg_a[k] += x;\n while (k) {\n k = (k - 1) / 2;\n seg_v[k] = max(seg_v[k * 2 + 1] + seg_a[k * 2 + 1],\n seg_v[k * 2 + 2] + seg_a[k * 2 + 2]);\n }\n return;\n }\n int m = (a + b) / 2;\n seg_add(l, r, x, k * 2 + 1, a, m);\n seg_add(l, r, x, k * 2 + 2, m, b);\n}\nint seg_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return -INF;\n if (l <= a && b <= r)\n return seg_a[k] + seg_v[k];\n int m = (a + b) / 2;\n int vl = seg_getMax(l, r, k * 2 + 1, a, m);\n int vr = seg_getMax(l, r, k * 2 + 2, m, b);\n return seg_a[k] + max(vl, vr);\n}\nvoid rmq_update(int k, int x) {\n int i = k;\n k += size - 1;\n rmq[k] = Pr(x, i);\n while (k) {\n k = (k - 1) / 2;\n rmq[k] = max(rmq[k * 2 + 1], rmq[k * 2 + 2]);\n }\n}\nPr _rmq_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return Pr(-INF, -1);\n if (l <= a && b <= r)\n return rmq[k];\n int m = (a + b) / 2;\n Pr vl = _rmq_getMax(l, r, k * 2 + 1, a, m);\n Pr vr = _rmq_getMax(l, r, k * 2 + 2, m, b);\n return max(vl, vr);\n}\nint rmq_getMax(int l, int r) { return _rmq_getMax(l, r).first; }\nint rmq_getMaxIdx(int l, int r) { return _rmq_getMax(l, r).second; }\nvoid solve() {\n long long int res = 0;\n for (int i = 0; i < N; i++) {\n rmq_update(i, h[i]);\n }\n seg_add(0, N, H);\n for (int fl = 0; fl < N; fl++) {\n if (seg_getMax(fl, fl + 1) > H) {\n seg_add(fl, N, H - seg_getMax(fl, fl + 1));\n }\n seg_add(fl, N, -d[fl]);\n if (seg_getMax(fl, fl + 1) > 0)\n continue;\n while (true) {\n int idx = rmq_getMaxIdx(0, fl);\n if (h[idx] > H - seg_getMax(idx, fl)) {\n h[idx] = H - seg_getMax(idx, fl);\n rmq_update(idx, h[idx]);\n continue;\n }\n int s = (H - seg_getMax(idx, fl)) / h[idx];\n int hp = seg_getMax(fl, fl + 1);\n int need = -hp + 1;\n int t = (need / h[idx]) + !!(need % h[idx]);\n int num = min(s, t);\n seg_add(idx, N, h[idx] * num);\n res += num;\n if (seg_getMax(fl, fl + 1) > 0)\n break;\n }\n }\n printf(\"%lld\\n\", res);\n}\nint main() {\n scanf(\"%d %d\", &N, &H);\n for (int i = 0; i < N - 1; i++) {\n scanf(\"%d %d\", d + i + 1, h + i);\n }\n solve();\n}", "accuracy": 1, "time_ms": 300, "memory_kb": 21608, "score_of_the_acc": -1.8985, "final_rank": 10 }, { "submission_id": "aoj_0553_8115384", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1 << 28;\ntypedef pair<int, int> Pr;\nint N, H;\nint d[100000], h[100000];\nconst int size = 1 << 20;\nint seg_v[size * 2 - 1];\nint seg_a[size * 2 - 1];\nPr rmq[size * 2 - 1];\nvoid seg_add(int l, int r, int x, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return;\n if (l <= a && b <= r) {\n seg_a[k] += x;\n while (k) {\n k = (k - 1) / 2;\n seg_v[k] = max(seg_v[k * 2 + 1] + seg_a[k * 2 + 1],\n seg_v[k * 2 + 2] + seg_a[k * 2 + 2]);\n }\n return;\n }\n int m = (a + b) / 2;\n seg_add(l, r, x, k * 2 + 1, a, m);\n seg_add(l, r, x, k * 2 + 2, m, b);\n}\nint seg_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return -INF;\n if (l <= a && b <= r)\n return seg_a[k] + seg_v[k];\n int m = (a + b) / 2;\n int vl = seg_getMax(l, r, k * 2 + 1, a, m);\n int vr = seg_getMax(l, r, k * 2 + 2, m, b);\n return seg_a[k] + max(vl, vr);\n}\nvoid rmq_update(int k, int x) {\n int i = k;\n k += size - 1;\n rmq[k] = Pr(x, i);\n while (k) {\n k = (k - 1) / 2;\n rmq[k] = max(rmq[k * 2 + 1], rmq[k * 2 + 2]);\n }\n}\nPr _rmq_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return Pr(-INF, -1);\n if (l <= a && b <= r)\n return rmq[k];\n int m = (a + b) / 2;\n Pr vl = _rmq_getMax(l, r, k * 2 + 1, a, m);\n Pr vr = _rmq_getMax(l, r, k * 2 + 2, m, b);\n return max(vl, vr);\n}\nint rmq_getMax(int l, int r) { return _rmq_getMax(l, r).first; }\nint rmq_getMaxIdx(int l, int r) { return _rmq_getMax(l, r).second; }\nvoid solve() {\n long long int res = 0;\n for (int i = 0; i < N; i++) {\n rmq_update(i, h[i]);\n }\n seg_add(0, N, H);\n for (int fl = 0; fl < N; fl++) {\n int maxSeg = seg_getMax(fl, fl + 1);\n if (maxSeg > H) {\n seg_add(fl, N, H - maxSeg);\n }\n seg_add(fl, N, -d[fl]);\n if (seg_getMax(fl, fl + 1) > 0) {\n continue;\n }\n while (true) {\n int idx = rmq_getMaxIdx(0, fl);\n int maxSegIdxToFl = seg_getMax(idx, fl);\n if (h[idx] > H - maxSegIdxToFl) {\n h[idx] = H - maxSegIdxToFl;\n rmq_update(idx, h[idx]);\n continue;\n }\n int s = (H - maxSegIdxToFl) / h[idx];\n int hp = seg_getMax(fl, fl + 1);\n int need = -hp + 1;\n int t = (need / h[idx]) + !!(need % h[idx]);\n int num = min(s, t);\n seg_add(idx, N, h[idx] * num);\n res += num;\n if (seg_getMax(fl, fl + 1) > 0) {\n break;\n }\n }\n }\n printf(\"%lld\\n\", res);\n}\nint main() {\n scanf(\"%d %d\", &N, &H);\n for (int i = 0; i < N - 1; i++) {\n scanf(\"%d %d\", d + i + 1, h + i);\n }\n solve();\n}", "accuracy": 1, "time_ms": 300, "memory_kb": 21624, "score_of_the_acc": -1.8995, "final_rank": 15 }, { "submission_id": "aoj_0553_8115382", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1 << 28;\ntypedef pair<int, int> Pr;\nconst int MAX_N = 1e5;\nint N, H;\nint d[MAX_N + 1], h[MAX_N];\nconst int size = 1 << 20;\nint seg_v[size * 2 - 1];\nint seg_a[size * 2 - 1];\nPr rmq[size * 2 - 1];\nvoid seg_add(int l, int r, int x, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return;\n if (l <= a && b <= r) {\n seg_a[k] += x;\n while (k) {\n k = (k - 1) / 2;\n seg_v[k] = max(seg_v[k * 2 + 1] + seg_a[k * 2 + 1],\n seg_v[k * 2 + 2] + seg_a[k * 2 + 2]);\n }\n return;\n }\n int m = (a + b) / 2;\n seg_add(l, r, x, k * 2 + 1, a, m);\n seg_add(l, r, x, k * 2 + 2, m, b);\n}\nint seg_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return -INF;\n if (l <= a && b <= r)\n return seg_a[k] + seg_v[k];\n int m = (a + b) / 2;\n int vl = seg_getMax(l, r, k * 2 + 1, a, m);\n int vr = seg_getMax(l, r, k * 2 + 2, m, b);\n return seg_a[k] + max(vl, vr);\n}\nvoid rmq_update(int k, int x) {\n int i = k;\n k += size - 1;\n rmq[k] = Pr(x, i);\n while (k) {\n k = (k - 1) / 2;\n rmq[k] = max(rmq[k * 2 + 1], rmq[k * 2 + 2]);\n }\n}\nPr _rmq_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return Pr(-INF, -1);\n if (l <= a && b <= r)\n return rmq[k];\n int m = (a + b) / 2;\n Pr vl = _rmq_getMax(l, r, k * 2 + 1, a, m);\n Pr vr = _rmq_getMax(l, r, k * 2 + 2, m, b);\n return max(vl, vr);\n}\nint rmq_getMax(int l, int r) { return _rmq_getMax(l, r).first; }\nint rmq_getMaxIdx(int l, int r) { return _rmq_getMax(l, r).second; }\nvoid solve() {\n long long int res = 0;\n for (int i = 0; i < N; i++) {\n rmq_update(i, h[i]);\n }\n seg_add(0, N, H);\n for (int fl = 0; fl < N; fl++) {\n if (seg_getMax(fl, fl + 1) > H) {\n seg_add(fl, N, H - seg_getMax(fl, fl + 1));\n }\n seg_add(fl, N, -d[fl]);\n if (seg_getMax(fl, fl + 1) > 0)\n continue;\n while (true) {\n int idx = rmq_getMaxIdx(0, fl);\n if (h[idx] > H - seg_getMax(idx, fl)) {\n h[idx] = H - seg_getMax(idx, fl);\n rmq_update(idx, h[idx]);\n continue;\n }\n int s = (H - seg_getMax(idx, fl)) / h[idx];\n int hp = seg_getMax(fl, fl + 1);\n int need = -hp + 1;\n int t = (need / h[idx]) + !!(need % h[idx]);\n int num = min(s, t);\n seg_add(idx, N, h[idx] * num);\n res += num;\n if (seg_getMax(fl, fl + 1) > 0)\n break;\n }\n }\n printf(\"%lld\\n\", res);\n}\nint main() {\n scanf(\"%d %d\", &N, &H);\n for (int i = 1; i < N; i++) {\n scanf(\"%d %d\", d + i, h + i - 1);\n }\n solve();\n}", "accuracy": 1, "time_ms": 300, "memory_kb": 21584, "score_of_the_acc": -1.897, "final_rank": 8 }, { "submission_id": "aoj_0553_8115380", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1 << 28;\ntypedef pair<int, int> Pr;\nint N, H;\nint d[100000], h[100000];\nconst int size = 1 << 20;\nint seg_v[size * 2 - 1];\nint seg_a[size * 2 - 1];\nPr rmq[size * 2 - 1];\nvoid seg_add(int l, int r, int x, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return;\n if (l <= a && b <= r) {\n seg_a[k] += x;\n while (k) {\n k = (k - 1) / 2;\n seg_v[k] = max(seg_v[k * 2 + 1] + seg_a[k * 2 + 1],\n seg_v[k * 2 + 2] + seg_a[k * 2 + 2]);\n }\n return;\n }\n int m = (a + b) / 2;\n seg_add(l, r, x, k * 2 + 1, a, m);\n seg_add(l, r, x, k * 2 + 2, m, b);\n}\nint seg_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return -INF;\n if (l <= a && b <= r)\n return seg_a[k] + seg_v[k];\n int m = (a + b) / 2;\n int vl = seg_getMax(l, r, k * 2 + 1, a, m);\n int vr = seg_getMax(l, r, k * 2 + 2, m, b);\n return seg_a[k] + max(vl, vr);\n}\nvoid rmq_update(int k, int x) {\n int i = k;\n k += size - 1;\n rmq[k] = Pr(x, i);\n while (k) {\n k = (k - 1) / 2;\n rmq[k] = max(rmq[k * 2 + 1], rmq[k * 2 + 2]);\n }\n}\nPr _rmq_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return Pr(-INF, -1);\n if (l <= a && b <= r)\n return rmq[k];\n int m = (a + b) / 2;\n Pr vl = _rmq_getMax(l, r, k * 2 + 1, a, m);\n Pr vr = _rmq_getMax(l, r, k * 2 + 2, m, b);\n return max(vl, vr);\n}\nint rmq_getMax(int l, int r) { return _rmq_getMax(l, r).first; }\nint rmq_getMaxIdx(int l, int r) { return _rmq_getMax(l, r).second; }\nvoid solve() {\n long long int res = 0;\n for (int i = 0; i < N; i++) {\n rmq_update(i, h[i]);\n }\n seg_add(0, N, H);\n for (int fl = 0; fl < N; fl++) {\n int max_fl = seg_getMax(fl, fl + 1);\n if (max_fl > H) {\n seg_add(fl, N, H - max_fl);\n }\n seg_add(fl, N, -d[fl]);\n if (seg_getMax(fl, fl + 1) > 0)\n continue;\n while (true) {\n int idx = rmq_getMaxIdx(0, fl);\n int max_idx_fl = H - seg_getMax(idx, fl);\n if (h[idx] > max_idx_fl) {\n h[idx] = max_idx_fl;\n rmq_update(idx, h[idx]);\n continue;\n }\n int s = max_idx_fl / h[idx];\n int hp = seg_getMax(fl, fl + 1);\n int need = -hp + 1;\n int t = (need / h[idx]) + !!(need % h[idx]);\n int num = min(s, t);\n seg_add(idx, N, h[idx] * num);\n res += num;\n if (seg_getMax(fl, fl + 1) > 0)\n break;\n }\n }\n printf(\"%lld\\n\", res);\n}\nint main() {\n scanf(\"%d %d\", &N, &H);\n for (int i = 0; i < N - 1; i++) {\n scanf(\"%d %d\", d + i + 1, h + i);\n }\n solve();\n}", "accuracy": 1, "time_ms": 300, "memory_kb": 21608, "score_of_the_acc": -1.8985, "final_rank": 10 }, { "submission_id": "aoj_0553_8115375", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1 << 28;\ntypedef pair<int, int> Pr;\nint N, H;\nint d[100000], h[100000];\nconst int size = 1 << 20;\nint seg_v[size * 2 - 1];\nint seg_a[size * 2 - 1];\nPr rmq[size * 2 - 1];\nvoid seg_add(int l, int r, int x, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return;\n if (l <= a && b <= r) {\n seg_a[k] += x;\n while (k) {\n k = (k - 1) / 2;\n seg_v[k] = max(seg_v[k * 2 + 1] + seg_a[k * 2 + 1],\n seg_v[k * 2 + 2] + seg_a[k * 2 + 2]);\n }\n return;\n }\n int m = (a + b) / 2;\n seg_add(l, r, x, k * 2 + 1, a, m);\n seg_add(l, r, x, k * 2 + 2, m, b);\n}\nint seg_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return -INF;\n if (l <= a && b <= r)\n return seg_a[k] + seg_v[k];\n int m = (a + b) / 2;\n int vl = seg_getMax(l, r, k * 2 + 1, a, m);\n int vr = seg_getMax(l, r, k * 2 + 2, m, b);\n return seg_a[k] + max(vl, vr);\n}\nvoid rmq_update(int k, int x) {\n int i = k;\n k += size - 1;\n rmq[k] = Pr(x, i);\n while (k) {\n k = (k - 1) / 2;\n rmq[k] = max(rmq[k * 2 + 1], rmq[k * 2 + 2]);\n }\n}\nPr _rmq_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return Pr(-INF, -1);\n if (l <= a && b <= r)\n return rmq[k];\n int m = (a + b) / 2;\n Pr vl = _rmq_getMax(l, r, k * 2 + 1, a, m);\n Pr vr = _rmq_getMax(l, r, k * 2 + 2, m, b);\n return max(vl, vr);\n}\nint rmq_getMax(int l, int r) { return _rmq_getMax(l, r).first; }\nint rmq_getMaxIdx(int l, int r) { return _rmq_getMax(l, r).second; }\nvoid solve() {\n long long int res = 0;\n for (int i = 0; i < N; i++) {\n rmq_update(i, h[i]);\n }\n seg_add(0, N, H);\n for (int fl = 0; fl < N; fl++) {\n if (seg_getMax(fl, fl + 1) > H) {\n seg_add(fl, N, H - seg_getMax(fl, fl + 1));\n }\n seg_add(fl, N, -d[fl]);\n if (seg_getMax(fl, fl + 1) > 0)\n continue;\n while (true) {\n int idx = rmq_getMaxIdx(0, fl);\n if (h[idx] > H - seg_getMax(idx, fl)) {\n h[idx] = H - seg_getMax(idx, fl);\n rmq_update(idx, h[idx]);\n continue;\n }\n int s = (H - seg_getMax(idx, fl)) / h[idx];\n int hp = seg_getMax(fl, fl + 1);\n int need = -hp + 1;\n int t = (need / h[idx]) + !!(need % h[idx]);\n int num = min(s, t);\n seg_add(idx, N, h[idx] * num);\n res += num;\n if (seg_getMax(fl, fl + 1) > 0)\n break;\n }\n }\n printf(\"%lld\\n\", res);\n}\nint main() {\n scanf(\"%d %d\", &N, &H);\n for (int i = 0; i < N - 1; i++) {\n scanf(\"%d %d\", d + i + 1, h + i);\n }\n solve();\n}", "accuracy": 1, "time_ms": 300, "memory_kb": 21612, "score_of_the_acc": -1.8988, "final_rank": 13 }, { "submission_id": "aoj_0553_8115370", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1 << 28;\ntypedef pair<int, int> Pr;\nint N, H;\nint d[100000], h[100000];\nconst int size = 1 << 20;\nint seg_v[size * 2 - 1];\nint seg_a[size * 2 - 1];\nPr rmq[size * 2 - 1];\nvoid seg_add(int l, int r, int x, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return;\n if (l <= a && b <= r) {\n seg_a[k] += x;\n for (k = (k - 1) / 2; k; k = (k - 1) / 2) {\n seg_v[k] = max(seg_v[k * 2 + 1] + seg_a[k * 2 + 1],\n seg_v[k * 2 + 2] + seg_a[k * 2 + 2]);\n }\n seg_v[k] = max(seg_v[k * 2 + 1] + seg_a[k * 2 + 1],\n seg_v[k * 2 + 2] + seg_a[k * 2 + 2]);\n return;\n }\n int m = (a + b) / 2;\n seg_add(l, r, x, k * 2 + 1, a, m);\n seg_add(l, r, x, k * 2 + 2, m, b);\n}\nint seg_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return -INF;\n if (l <= a && b <= r)\n return seg_a[k] + seg_v[k];\n int m = (a + b) / 2;\n return seg_a[k] + max(seg_getMax(l, r, k * 2 + 1, a, m), seg_getMax(l, r, k * 2 + 2, m, b));\n}\nvoid rmq_update(int k, int x) {\n int i = k;\n k += size - 1;\n rmq[k] = Pr(x, i);\n for (k = (k - 1) / 2; k; k = (k - 1) / 2) {\n rmq[k] = max(rmq[k * 2 + 1], rmq[k * 2 + 2]);\n }\n rmq[k] = max(rmq[k * 2 + 1], rmq[k * 2 + 2]);\n}\nPr _rmq_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return Pr(-INF, -1);\n if (l <= a && b <= r)\n return rmq[k];\n int m = (a + b) / 2;\n return max(_rmq_getMax(l, r, k * 2 + 1, a, m), _rmq_getMax(l, r, k * 2 + 2, m, b));\n}\nint rmq_getMax(int l, int r) { return _rmq_getMax(l, r).first; }\nint rmq_getMaxIdx(int l, int r) { return _rmq_getMax(l, r).second; }\nvoid solve() {\n long long int res = 0;\n for (int i = 0; i < N; i++) {\n rmq_update(i, h[i]);\n }\n seg_add(0, N, H);\n for (int fl = 0; fl < N; fl++) {\n if (seg_getMax(fl, fl + 1) > H) {\n seg_add(fl, N, H - seg_getMax(fl, fl + 1));\n }\n seg_add(fl, N, -d[fl]);\n if (seg_getMax(fl, fl + 1) > 0)\n continue;\n while (true) {\n int idx = rmq_getMaxIdx(0, fl);\n if (h[idx] > H - seg_getMax(idx, fl)) {\n h[idx] = H - seg_getMax(idx, fl);\n rmq_update(idx, h[idx]);\n continue;\n }\n int s = (H - seg_getMax(idx, fl)) / h[idx];\n int hp = seg_getMax(fl, fl + 1);\n int need = -hp + 1;\n int t = (need / h[idx]) + !!(need % h[idx]);\n int num = min(s, t);\n seg_add(idx, N, h[idx] * num);\n res += num;\n if (seg_getMax(fl, fl + 1) > 0)\n break;\n }\n }\n printf(\"%lld\\n\", res);\n}\nint main() {\n scanf(\"%d %d\", &N, &H);\n for (int i = 0; i < N - 1; i++) {\n scanf(\"%d %d\", d + i + 1, h + i);\n }\n solve();\n}", "accuracy": 1, "time_ms": 270, "memory_kb": 21612, "score_of_the_acc": -1.7988, "final_rank": 7 }, { "submission_id": "aoj_0553_8115367", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1 << 28;\ntypedef pair<int, int> Pr;\nint N, H;\nint d[100000], h[100000];\nconst int size = 1 << 20;\nint seg_v[size * 2 - 1];\nint seg_a[size * 2 - 1];\nPr rmq[size * 2 - 1];\nvoid seg_add(int l, int r, int x, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return;\n if (l <= a && b <= r) {\n seg_a[k] += x;\n int i = k;\n while (i) {\n i = (i - 1) / 2;\n seg_v[i] = max(seg_v[i * 2 + 1] + seg_a[i * 2 + 1],\n seg_v[i * 2 + 2] + seg_a[i * 2 + 2]);\n }\n return;\n }\n int m = (a + b) / 2;\n seg_add(l, r, x, k * 2 + 1, a, m);\n seg_add(l, r, x, k * 2 + 2, m, b);\n}\nint seg_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return -INF;\n if (l <= a && b <= r)\n return seg_a[k] + seg_v[k];\n int m = (a + b) / 2;\n int vl = seg_getMax(l, r, k * 2 + 1, a, m);\n int vr = seg_getMax(l, r, k * 2 + 2, m, b);\n return seg_a[k] + max(vl, vr);\n}\nvoid rmq_update(int k, int x) {\n int i = k;\n k += size - 1;\n rmq[k] = Pr(x, i);\n while (k) {\n k = (k - 1) / 2;\n rmq[k] = max(rmq[k * 2 + 1], rmq[k * 2 + 2]);\n }\n}\nPr _rmq_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return Pr(-INF, -1);\n if (l <= a && b <= r)\n return rmq[k];\n int m = (a + b) / 2;\n Pr vl = _rmq_getMax(l, r, k * 2 + 1, a, m);\n Pr vr = _rmq_getMax(l, r, k * 2 + 2, m, b);\n return max(vl, vr);\n}\nint rmq_getMax(int l, int r) { return _rmq_getMax(l, r).first; }\nint rmq_getMaxIdx(int l, int r) { return _rmq_getMax(l, r).second; }\nvoid solve() {\n long long int res = 0;\n for (int i = 0; i < N; i++) {\n rmq_update(i, h[i]);\n }\n seg_add(0, N, H);\n for (int fl = 0; fl < N; fl++) {\n if (seg_getMax(fl, fl + 1) > H) {\n seg_add(fl, N, H - seg_getMax(fl, fl + 1));\n }\n seg_add(fl, N, -d[fl]);\n if (seg_getMax(fl, fl + 1) > 0)\n continue;\n while (true) {\n int idx = rmq_getMaxIdx(0, fl);\n if (h[idx] > H - seg_getMax(idx, fl)) {\n h[idx] = H - seg_getMax(idx, fl);\n rmq_update(idx, h[idx]);\n continue;\n }\n int s = (H - seg_getMax(idx, fl)) / h[idx];\n int hp = seg_getMax(fl, fl + 1);\n int need = -hp + 1;\n int t = (need / h[idx]) + !!(need % h[idx]);\n int num = min(s, t);\n seg_add(idx, N, h[idx] * num);\n res += num;\n if (seg_getMax(fl, fl + 1) > 0)\n break;\n }\n }\n printf(\"%lld\\n\", res);\n}\nint main() {\n scanf(\"%d %d\", &N, &H);\n for (int i = 0; i < N - 1; i++) {\n scanf(\"%d %d\", d + i + 1, h + i);\n }\n solve();\n}", "accuracy": 1, "time_ms": 300, "memory_kb": 21604, "score_of_the_acc": -1.8983, "final_rank": 9 }, { "submission_id": "aoj_0553_8115365", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1 << 28;\ntypedef pair<int, int> Pr;\nconst int MAXN = 100000;\nint N, H;\nint d[MAXN], h[MAXN];\nconst int size = 1 << 20;\nint seg_v[size * 2 - 1];\nint seg_a[size * 2 - 1];\nPr rmq[size * 2 - 1];\nvoid seg_add(int l, int r, int x, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return;\n if (l <= a && b <= r) {\n seg_a[k] += x;\n while (k) {\n k = (k - 1) / 2;\n seg_v[k] = max(seg_v[k * 2 + 1] + seg_a[k * 2 + 1],\n seg_v[k * 2 + 2] + seg_a[k * 2 + 2]);\n }\n return;\n }\n int m = (a + b) / 2;\n seg_add(l, r, x, k * 2 + 1, a, m);\n seg_add(l, r, x, k * 2 + 2, m, b);\n}\nint seg_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return -INF;\n if (l <= a && b <= r)\n return seg_a[k] + seg_v[k];\n int m = (a + b) / 2;\n int vl = seg_getMax(l, r, k * 2 + 1, a, m);\n int vr = seg_getMax(l, r, k * 2 + 2, m, b);\n return seg_a[k] + max(vl, vr);\n}\nvoid rmq_update(int k, int x) {\n int i = k;\n k += size - 1;\n rmq[k] = Pr(x, i);\n while (k) {\n k = (k - 1) / 2;\n rmq[k] = max(rmq[k * 2 + 1], rmq[k * 2 + 2]);\n }\n}\nPr _rmq_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return Pr(-INF, -1);\n if (l <= a && b <= r)\n return rmq[k];\n int m = (a + b) / 2;\n Pr vl = _rmq_getMax(l, r, k * 2 + 1, a, m);\n Pr vr = _rmq_getMax(l, r, k * 2 + 2, m, b);\n return max(vl, vr);\n}\nint rmq_getMax(int l, int r) { return _rmq_getMax(l, r).first; }\nint rmq_getMaxIdx(int l, int r) { return _rmq_getMax(l, r).second; }\nvoid solve() {\n long long int res = 0;\n for (int i = 0; i < N; i++) {\n rmq_update(i, h[i]);\n }\n seg_add(0, N, H);\n for (int fl = 0; fl < N; fl++) {\n if (seg_getMax(fl, fl + 1) > H) {\n seg_add(fl, N, H - seg_getMax(fl, fl + 1));\n }\n seg_add(fl, N, -d[fl]);\n if (seg_getMax(fl, fl + 1) > 0)\n continue;\n while (true) {\n int idx = rmq_getMaxIdx(0, fl);\n if (h[idx] > H - seg_getMax(idx, fl)) {\n h[idx] = H - seg_getMax(idx, fl);\n rmq_update(idx, h[idx]);\n continue;\n }\n int s = (H - seg_getMax(idx, fl)) / h[idx];\n int hp = seg_getMax(fl, fl + 1);\n int need = -hp + 1;\n int t = (need / h[idx]) + !!(need % h[idx]);\n int num = min(s, t);\n seg_add(idx, N, h[idx] * num);\n res += num;\n if (seg_getMax(fl, fl + 1) > 0)\n break;\n }\n }\n printf(\"%lld\\n\", res);\n}\nint main() {\n scanf(\"%d %d\", &N, &H);\n for (int i = 0; i < N - 1; i++) {\n scanf(\"%d %d\", d + i + 1, h + i);\n }\n solve();\n}", "accuracy": 1, "time_ms": 300, "memory_kb": 21620, "score_of_the_acc": -1.8993, "final_rank": 14 }, { "submission_id": "aoj_0553_8112630", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1 << 28;\ntypedef pair<int, int> Pr;\nint N, H;\nint d[100000], h[100000];\nconst int size = 1 << 20;\nint seg_v[size * 2 - 1];\nint seg_a[size * 2 - 1];\nPr rmq[size * 2 - 1];\nvoid seg_add(int l, int r, int x, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return;\n if (l <= a && b <= r) {\n seg_a[k] += x;\n while (k) {\n k = (k - 1) / 2;\n seg_v[k] = max(seg_v[k * 2 + 1] + seg_a[k * 2 + 1],\n seg_v[k * 2 + 2] + seg_a[k * 2 + 2]);\n }\n return;\n }\n int m = (a + b) / 2;\n seg_add(l, r, x, k * 2 + 1, a, m);\n seg_add(l, r, x, k * 2 + 2, m, b);\n}\nint seg_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return -INF;\n if (l <= a && b <= r)\n return seg_a[k] + seg_v[k];\n int m = (a + b) / 2;\n int vl = seg_getMax(l, r, k * 2 + 1, a, m);\n int vr = seg_getMax(l, r, k * 2 + 2, m, b);\n return seg_a[k] + max(vl, vr);\n}\nvoid rmq_update(int k, int x) {\n int i = k;\n k += size - 1;\n rmq[k] = Pr(x, i);\n while (k) {\n k = (k - 1) / 2;\n rmq[k] = max(rmq[k * 2 + 1], rmq[k * 2 + 2]);\n }\n}\nPr _rmq_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return Pr(-INF, -1);\n if (l <= a && b <= r)\n return rmq[k];\n int m = (a + b) / 2;\n Pr vl = _rmq_getMax(l, r, k * 2 + 1, a, m);\n Pr vr = _rmq_getMax(l, r, k * 2 + 2, m, b);\n return max(vl, vr);\n}\nint rmq_getMax(int l, int r) { return _rmq_getMax(l, r).first; }\nint rmq_getMaxIdx(int l, int r) { return _rmq_getMax(l, r).second; }\nvoid solve() {\n long long int res = 0;\n for (int i = 0; i < N; i++) {\n rmq_update(i, h[i]);\n }\n seg_add(0, N, H);\n for (int fl = 0; fl < N; fl++) {\n if (seg_getMax(fl, fl + 1) > H) {\n seg_add(fl, N, H - seg_getMax(fl, fl + 1));\n }\n seg_add(fl, N, -d[fl]);\n if (seg_getMax(fl, fl + 1) > 0)\n continue;\n while (true) {\n int idx = rmq_getMaxIdx(0, fl);\n if (h[idx] > H - seg_getMax(idx, fl)) {\n h[idx] = H - seg_getMax(idx, fl);\n rmq_update(idx, h[idx]);\n continue;\n }\n int s = (H - seg_getMax(idx, fl)) / h[idx];\n int hp = seg_getMax(fl, fl + 1);\n int need = -hp + 1;\n int t = (need / h[idx]) + !!(need % h[idx]);\n int num = min(s, t);\n seg_add(idx, N, h[idx] * num);\n res += num;\n if (seg_getMax(fl, fl + 1) > 0)\n break;\n }\n }\n printf(\"%lld\\n\", res);\n}\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n scanf(\"%d %d\", &N, &H);\n for (int i = 0; i < N - 1; i++) {\n scanf(\"%d %d\", d + i + 1, h + i);\n }\n solve();\n}", "accuracy": 1, "time_ms": 300, "memory_kb": 21624, "score_of_the_acc": -1.8995, "final_rank": 15 }, { "submission_id": "aoj_0553_8112628", "code_snippet": "#pragma GCC optimize(\"Ofast\")\n#pragma GCC target(\"avx,avx2,fma\")\n#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1 << 28;\ntypedef pair<int, int> Pr;\nint N, H;\nint d[100000], h[100000];\nconst int size = 1 << 20;\nint seg_v[size * 2 - 1];\nint seg_a[size * 2 - 1];\nPr rmq[size * 2 - 1];\nvoid seg_add(int l, int r, int x, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return;\n if (l <= a && b <= r) {\n seg_a[k] += x;\n while (k) {\n k = (k - 1) / 2;\n seg_v[k] = max(seg_v[k * 2 + 1] + seg_a[k * 2 + 1],\n seg_v[k * 2 + 2] + seg_a[k * 2 + 2]);\n }\n return;\n }\n int m = (a + b) / 2;\n seg_add(l, r, x, k * 2 + 1, a, m);\n seg_add(l, r, x, k * 2 + 2, m, b);\n}\nint seg_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return -INF;\n if (l <= a && b <= r)\n return seg_a[k] + seg_v[k];\n int m = (a + b) / 2;\n int vl = seg_getMax(l, r, k * 2 + 1, a, m);\n int vr = seg_getMax(l, r, k * 2 + 2, m, b);\n return seg_a[k] + max(vl, vr);\n}\nvoid rmq_update(int k, int x) {\n int i = k;\n k += size - 1;\n rmq[k] = Pr(x, i);\n while (k) {\n k = (k - 1) / 2;\n rmq[k] = max(rmq[k * 2 + 1], rmq[k * 2 + 2]);\n }\n}\nPr _rmq_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return Pr(-INF, -1);\n if (l <= a && b <= r)\n return rmq[k];\n int m = (a + b) / 2;\n Pr vl = _rmq_getMax(l, r, k * 2 + 1, a, m);\n Pr vr = _rmq_getMax(l, r, k * 2 + 2, m, b);\n return max(vl, vr);\n}\nint rmq_getMax(int l, int r) { return _rmq_getMax(l, r).first; }\nint rmq_getMaxIdx(int l, int r) { return _rmq_getMax(l, r).second; }\nvoid solve() {\n long long int res = 0;\n for (int i = 0; i < N; i++) {\n rmq_update(i, h[i]);\n }\n seg_add(0, N, H);\n for (int fl = 0; fl < N; fl++) {\n if (seg_getMax(fl, fl + 1) > H) {\n seg_add(fl, N, H - seg_getMax(fl, fl + 1));\n }\n seg_add(fl, N, -d[fl]);\n if (seg_getMax(fl, fl + 1) > 0)\n continue;\n while (true) {\n int idx = rmq_getMaxIdx(0, fl);\n if (h[idx] > H - seg_getMax(idx, fl)) {\n h[idx] = H - seg_getMax(idx, fl);\n rmq_update(idx, h[idx]);\n continue;\n }\n int s = (H - seg_getMax(idx, fl)) / h[idx];\n int hp = seg_getMax(fl, fl + 1);\n int need = -hp + 1;\n int t = (need / h[idx]) + !!(need % h[idx]);\n int num = min(s, t);\n seg_add(idx, N, h[idx] * num);\n res += num;\n if (seg_getMax(fl, fl + 1) > 0)\n break;\n }\n }\n printf(\"%lld\\n\", res);\n}\nint main() {\n scanf(\"%d %d\", &N, &H);\n for (int i = 0; i < N - 1; i++) {\n scanf(\"%d %d\", d + i + 1, h + i);\n }\n solve();\n}", "accuracy": 1, "time_ms": 220, "memory_kb": 21620, "score_of_the_acc": -1.6326, "final_rank": 6 }, { "submission_id": "aoj_0553_8112627", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1 << 28;\ntypedef pair<int, int> Pr;\nint N, H;\nint d[100000], h[100000];\nconst int size = 1 << 20;\nint seg_v[size * 2 - 1];\nint seg_a[size * 2 - 1];\nPr rmq[size * 2 - 1];\nvoid seg_add(int l, int r, int x, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return;\n if (l <= a && b <= r) {\n seg_a[k] += x;\n while (k) {\n k = (k - 1) / 2;\n seg_v[k] = max(seg_v[k * 2 + 1] + seg_a[k * 2 + 1],\n seg_v[k * 2 + 2] + seg_a[k * 2 + 2]);\n }\n return;\n }\n int m = (a + b) / 2;\n seg_add(l, r, x, k * 2 + 1, a, m);\n seg_add(l, r, x, k * 2 + 2, m, b);\n}\nint seg_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return -INF;\n if (l <= a && b <= r)\n return seg_a[k] + seg_v[k];\n int m = (a + b) / 2;\n int vl = seg_getMax(l, r, k * 2 + 1, a, m);\n int vr = seg_getMax(l, r, k * 2 + 2, m, b);\n return seg_a[k] + max(vl, vr);\n}\nvoid rmq_update(int k, int x) {\n int i = k;\n k += size - 1;\n rmq[k] = Pr(x, i);\n while (k) {\n k = (k - 1) / 2;\n rmq[k] = max(rmq[k * 2 + 1], rmq[k * 2 + 2]);\n }\n}\nPr _rmq_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return Pr(-INF, -1);\n if (l <= a && b <= r)\n return rmq[k];\n int m = (a + b) / 2;\n Pr vl = _rmq_getMax(l, r, k * 2 + 1, a, m);\n Pr vr = _rmq_getMax(l, r, k * 2 + 2, m, b);\n return max(vl, vr);\n}\nint rmq_getMax(int l, int r) { return _rmq_getMax(l, r).first; }\nint rmq_getMaxIdx(int l, int r) { return _rmq_getMax(l, r).second; }\nvoid solve() {\n long long int res = 0;\n for (int i = 0; i < N; i++) {\n rmq_update(i, h[i]);\n }\n seg_add(0, N, H);\n for (int fl = 0; fl < N; fl++) {\n if (seg_getMax(fl, fl + 1) > H) {\n seg_add(fl, N, H - seg_getMax(fl, fl + 1));\n }\n seg_add(fl, N, -d[fl]);\n if (seg_getMax(fl, fl + 1) > 0)\n continue;\n while (true) {\n int idx = rmq_getMaxIdx(0, fl);\n if (h[idx] > H - seg_getMax(idx, fl)) {\n h[idx] = H - seg_getMax(idx, fl);\n rmq_update(idx, h[idx]);\n continue;\n }\n int s = (H - seg_getMax(idx, fl)) / h[idx];\n int hp = seg_getMax(fl, fl + 1);\n int need = -hp + 1;\n int t = (need / h[idx]) + !!(need % h[idx]);\n int num = min(s, t);\n seg_add(idx, N, h[idx] * num);\n res += num;\n if (seg_getMax(fl, fl + 1) > 0)\n break;\n }\n }\n printf(\"%lld\\n\", res);\n}\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n scanf(\"%d %d\", &N, &H);\n for (int i = 0; i < N - 1; i++) {\n scanf(\"%d %d\", d + i + 1, h + i);\n }\n solve();\n}", "accuracy": 1, "time_ms": 300, "memory_kb": 21608, "score_of_the_acc": -1.8985, "final_rank": 10 }, { "submission_id": "aoj_0553_8112625", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1 << 28;\ntypedef pair<int, int> Pr;\nint N, H;\nint d[100000], h[100000];\nconst int size = 1 << 20;\nint seg_v[size * 2 - 1];\nint seg_a[size * 2 - 1];\nPr rmq[size * 2 - 1];\nvoid seg_add(int l, int r, int x, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return;\n if (l <= a && b <= r) {\n seg_a[k] += x;\n while (k) {\n k = (k - 1) / 2;\n seg_v[k] = max(seg_v[k * 2 + 1] + seg_a[k * 2 + 1],\n seg_v[k * 2 + 2] + seg_a[k * 2 + 2]);\n }\n return;\n }\n int m = (a + b) / 2;\n seg_add(l, r, x, k * 2 + 1, a, m);\n seg_add(l, r, x, k * 2 + 2, m, b);\n}\nint seg_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return -INF;\n if (l <= a && b <= r)\n return seg_a[k] + seg_v[k];\n int m = (a + b) / 2;\n int vl = seg_getMax(l, r, k * 2 + 1, a, m);\n int vr = seg_getMax(l, r, k * 2 + 2, m, b);\n return seg_a[k] + max(vl, vr);\n}\nvoid rmq_update(int k, int x) {\n int i = k;\n k += size - 1;\n rmq[k] = Pr(x, i);\n while (k) {\n k = (k - 1) / 2;\n rmq[k] = max(rmq[k * 2 + 1], rmq[k * 2 + 2]);\n }\n}\nPr _rmq_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return Pr(-INF, -1);\n if (l <= a && b <= r)\n return rmq[k];\n int m = (a + b) / 2;\n Pr vl = _rmq_getMax(l, r, k * 2 + 1, a, m);\n Pr vr = _rmq_getMax(l, r, k * 2 + 2, m, b);\n return max(vl, vr);\n}\nint rmq_getMax(int l, int r) { return _rmq_getMax(l, r).first; }\nint rmq_getMaxIdx(int l, int r) { return _rmq_getMax(l, r).second; }\nvoid solve() {\n long long int res = 0;\n for (int i = 0; i < N; i++) {\n rmq_update(i, h[i]);\n }\n seg_add(0, N, H);\n for (int fl = 0; fl < N; fl++) {\n if (seg_getMax(fl, fl + 1) > H) {\n seg_add(fl, N, H - seg_getMax(fl, fl + 1));\n }\n seg_add(fl, N, -d[fl]);\n if (seg_getMax(fl, fl + 1) > 0)\n continue;\n while (true) {\n int idx = rmq_getMaxIdx(0, fl);\n if (h[idx] > H - seg_getMax(idx, fl)) {\n h[idx] = H - seg_getMax(idx, fl);\n rmq_update(idx, h[idx]);\n continue;\n }\n int s = (H - seg_getMax(idx, fl)) / h[idx];\n int hp = seg_getMax(fl, fl + 1);\n int need = -hp + 1;\n int t = (need / h[idx]) + !!(need % h[idx]);\n int num = min(s, t);\n seg_add(idx, N, h[idx] * num);\n res += num;\n if (seg_getMax(fl, fl + 1) > 0)\n break;\n }\n }\n printf(\"%lld\\n\", res);\n}\nint main() {\n ios_base::sync_with_stdio(0);\n cin.tie(0);\n cout.tie(0);\n scanf(\"%d %d\", &N, &H);\n for (int i = 0; i < N - 1; i++) {\n scanf(\"%d %d\", d + i + 1, h + i);\n }\n solve();\n}", "accuracy": 1, "time_ms": 300, "memory_kb": 21628, "score_of_the_acc": -1.8998, "final_rank": 17 }, { "submission_id": "aoj_0553_8112623", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1 << 28;\ntypedef pair<int, int> Pr;\nint N, H;\nint d[100000], h[100000];\nconst int size = 1 << 20;\nint seg_v[size * 2 - 1];\nint seg_a[size * 2 - 1];\nPr rmq[size * 2 - 1];\nvoid seg_add(int l, int r, int x, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return;\n if (l <= a && b <= r) {\n seg_a[k] += x;\n while (k) {\n k = (k - 1) / 2;\n seg_v[k] = max(seg_v[k * 2 + 1] + seg_a[k * 2 + 1],\n seg_v[k * 2 + 2] + seg_a[k * 2 + 2]);\n }\n return;\n }\n int m = (a + b) / 2;\n seg_add(l, r, x, k * 2 + 1, a, m);\n seg_add(l, r, x, k * 2 + 2, m, b);\n}\nint seg_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return -INF;\n if (l <= a && b <= r)\n return seg_a[k] + seg_v[k];\n int m = (a + b) / 2;\n int vl = seg_getMax(l, r, k * 2 + 1, a, m);\n int vr = seg_getMax(l, r, k * 2 + 2, m, b);\n return seg_a[k] + max(vl, vr);\n}\nvoid rmq_update(int k, int x) {\n int i = k;\n k += size - 1;\n rmq[k] = Pr(x, i);\n while (k) {\n k = (k - 1) / 2;\n rmq[k] = max(rmq[k * 2 + 1], rmq[k * 2 + 2]);\n }\n}\nPr _rmq_getMax(int l, int r, int k = 0, int a = 0, int b = size) {\n if (b <= l || r <= a)\n return Pr(-INF, -1);\n if (l <= a && b <= r)\n return rmq[k];\n int m = (a + b) / 2;\n Pr vl = _rmq_getMax(l, r, k * 2 + 1, a, m);\n Pr vr = _rmq_getMax(l, r, k * 2 + 2, m, b);\n return max(vl, vr);\n}\nint rmq_getMax(int l, int r) { return _rmq_getMax(l, r).first; }\nint rmq_getMaxIdx(int l, int r) { return _rmq_getMax(l, r).second; }\nvoid solve() {\n long long int res = 0;\n for (int i = 0; i < N; i++) {\n rmq_update(i, h[i]);\n }\n seg_add(0, N, H);\n for (int fl = 0; fl < N; fl++) {\n if (seg_getMax(fl, fl + 1) > H) {\n seg_add(fl, N, H - seg_getMax(fl, fl + 1));\n }\n seg_add(fl, N, -d[fl]);\n if (seg_getMax(fl, fl + 1) > 0)\n continue;\n while (true) {\n int idx = rmq_getMaxIdx(0, fl);\n if (h[idx] > H - seg_getMax(idx, fl)) {\n h[idx] = H - seg_getMax(idx, fl);\n rmq_update(idx, h[idx]);\n continue;\n }\n int s = (H - seg_getMax(idx, fl)) / h[idx];\n int hp = seg_getMax(fl, fl + 1);\n int need = -hp + 1;\n int t = (need / h[idx]) + !!(need % h[idx]);\n int num = min(s, t);\n seg_add(idx, N, h[idx] * num);\n res += num;\n if (seg_getMax(fl, fl + 1) > 0)\n break;\n }\n }\n printf(\"%lld\\n\", res);\n}\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n cout.tie(0);\n scanf(\"%d %d\", &N, &H);\n for (int i = 0; i < N - 1; i++) {\n scanf(\"%d %d\", d + i + 1, h + i);\n }\n solve();\n}", "accuracy": 1, "time_ms": 300, "memory_kb": 21632, "score_of_the_acc": -1.9, "final_rank": 18 }, { "submission_id": "aoj_0553_5263959", "code_snippet": "#include <cmath>\n#include <vector>\n#include <iostream>\n#include <iomanip>\n#include <fstream>\n#include <algorithm>\n#include <set>\n#include <queue>\n#include <string>\n#include <map>\n#include <stack>\n#include <climits>\n#include <array>\n#include <unordered_set>\n#include <unordered_map>\n#include <memory>\n#include <functional>\n#include <cfloat>\n#include <numeric>\n#include <random>\n#include <sstream>\n#include <bitset>\n#include <complex>\n#include <chrono>\n#include <cassert>\n\nclass MaxSeg {\n\tstd::vector<int> _lazy, _max;\n\tint _size, _log2, _half, _init;\n\tvoid _apply_lazy(const int position) {\n\t\tfor (auto i = _log2; i >= 1; --i) {\n\t\t\tif (((position >> i) << i) != position) {\n\t\t\t\t_apply((position >> i) << 1, _lazy[position >> i]);\n\t\t\t\t_apply(((position >> i) << 1) + 1, _lazy[position >> i]);\n\t\t\t\t_lazy[position >> i] = 0;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\tvoid _apply(const int position, const int value) {\n\t\t_max[position] += value;\n\t\tif (position < _half) {\n\t\t\t_lazy[position] += value;\n\t\t}\n\t}\n\tvoid _correct(const int position) {\n\t\tfor (auto i = 1; i <= _log2; ++i) {\n\t\t\tif (((position >> i) << i) != position) {\n\t\t\t\t_max[position >> i] = std::max(_max[(position >> i) << 1], _max[((position >> i) << 1) + 1]);\n\t\t\t}\n\t\t}\n\t}\n\tstatic int log2(int value) {\n\t\tint count{ 0 };\n\t\twhile (value > (1 << count)) {\n\t\t\t++count;\n\t\t}\n\t\treturn count;\n\t}\npublic:\n\tMaxSeg(const int size, const int initial) {\n\t\t_size = size;\n\t\t_log2 = log2(size);\n\t\t_half = 1 << _log2;\n\t\t_init = initial;\n\t\t_lazy.assign(_half, 0);\n\t\t_max.assign(_half << 1, initial);\n\t}\n\tMaxSeg(const int size) : MaxSeg(size, INT_MIN) {};\n\tvoid add(int from, int until, const int value) {\n\t\tassert(0 <= from && from < _size && from <= until && until <= _size);\n\t\tfrom += _half;\n\t\tuntil += _half;\n\t\t_apply_lazy(from);\n\t\t_apply_lazy(until);\n\t\tauto f = from; auto u = until;\n\t\twhile (from < until) {\n\t\t\tif (from & 1) {\n\t\t\t\tif (from < _half)\n\t\t\t\t\t_lazy[from] += value;\n\t\t\t\t_max[from++] += value;\n\t\t\t}\n\t\t\tif (until & 1) {\n\t\t\t\tif (--until < _half)\n\t\t\t\t\t_lazy[until] += value;\n\t\t\t\t_max[until] += value;\n\t\t\t}\n\t\t\tfrom >>= 1;\n\t\t\tuntil >>= 1;\n\t\t}\n\t\t_correct(f);\n\t\t_correct(u);\n\t}\n\tint get(int from, int until) {\n\t\tassert(0 <= from && from < _size && from <= until && until <= _size);\n\t\tfrom += _half;\n\t\tuntil += _half;\n\t\t_apply_lazy(from);\n\t\t_apply_lazy(until);\n\t\tint result{ _init };\n\t\twhile (from < until) {\n\t\t\tif (from & 1) {\n\t\t\t\tresult = std::max(result, _max[from++]);\n\t\t\t}\n\t\t\tif (until & 1) {\n\t\t\t\tresult = std::max(result, _max[--until]);\n\t\t\t}\n\t\t\tfrom >>= 1;\n\t\t\tuntil >>= 1;\n\t\t}\n\t\treturn result;\n\t}\n\tint size() const {\n\t\treturn _size;\n\t}\n};\n\nint main() {\n\tint n, max_health; std::cin >> n >> max_health;\n\tstd::vector<std::pair<int, int>> floor(n - 1);\n\tfor (auto& [d, h] : floor) {\n\t\tstd::cin >> d >> h;\n\t}\n\tconst auto comparator = [](const std::pair<int, int> a, const std::pair<int, int> b) {return a.second == b.second ? a.first < b.first : a.second < b.second; };\n\tstd::priority_queue<std::pair<int, int>, std::vector<std::pair<int, int>>, decltype(comparator)> queue(comparator);\n\tMaxSeg seg(n, 0);\n\tint hp = max_health;\n\tlong long int sum{ 0 };\n\tfor (auto i = 0; i < n - 1; ++i) {\n\t\tconst auto [d, h] = floor[i];\n\t\tqueue.emplace(i, std::min(max_health - hp, h));\n\t\tseg.add(i, i + 1, hp);\n\t\thp -= d;\n\t\twhile (hp <= 0) {\n\t\t\tconst auto [j, h] = queue.top();\n\t\t\tconst auto cap = max_health - seg.get(j, i + 1);\n\t\t\tif (h > cap) {\n\t\t\t\tqueue.pop();\n\t\t\t\tif (cap > 0) queue.emplace(j, cap);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tconst auto count = std::min(cap / h, (-hp + h) / h);\n\t\t\t\thp += count * h;\n\t\t\t\tsum += count;\n\t\t\t\tseg.add(j, i + 1, count * h);\n\t\t\t}\n\t\t}\n\t}\n\tstd::cout << sum << '\\n';\n}", "accuracy": 1, "time_ms": 90, "memory_kb": 5460, "score_of_the_acc": -0.2017, "final_rank": 3 }, { "submission_id": "aoj_0553_4267255", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nlong long N, H, a[100009], b[100009], s[100009], sum, G, sx = 1, cx = 1;\n\nint main() {\n\tcin >> N >> H;\n\tfor (int i = 1; i <= N - 1; i++) cin >> a[i] >> b[i];\n\ts[1] = H; for (int i = 2; i <= N; i++) s[i] = s[i - 1] - a[i - 1];\n\n\t//for(int i=1;i<=N;i++) cout<<s[i]<<\" \";cout<<endl;\n\twhile (true) {\n\t\twhile (sx <= N && G + s[sx] >= 1) sx++; if (sx > N) break;\n\t\tlong long maxn = 0, maxid = 0;\n\t\tfor (int j = cx; j < sx; j++) {\n\t\t\tlong long cost = min(b[j], H - (G + s[j]));\n\t\t\tif (maxn < cost) { maxn = cost; maxid = j; }\n\t\t}\n\t\tlong long B = (H - (G + s[maxid])) / maxn;\n\t\tlong long B2 = (-(s[sx] + G) + maxn) / maxn; B = min(B, B2);//cout<<B<<endl;\n\t\t//cout<<G<<\" \"<<sx<<\" \"<<maxn<<\" \"<<maxid<<\" \"<<B<<\" \"<<sum<<endl;\n\t\tsum += B; G += maxn * B;\n\t\tcx = maxid;\n\t}\n\tcout << sum << endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 5432, "score_of_the_acc": -0.0333, "final_rank": 2 }, { "submission_id": "aoj_0553_3995899", "code_snippet": "#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#define _USE_MATH_DEFINES\n#include <cmath>\n#include <cstdio>\n#include <cstring>\n#include <ctime>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <iterator>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <utility>\n#include <vector>\nusing namespace std;\n\n#define FOR(i,m,n) for(int i=(m);i<(n);++i)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(v) (v).begin(),(v).end()\n\nconst int INF = 0x3f3f3f3f;\nconst long long LINF = 0x3f3f3f3f3f3f3f3fLL;\nconst double EPS = 1e-8;\nconst int MOD = 1000000007; // 998244353;\nconst int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};\n/*-------------------------------------------------*/\ntemplate <typename Monoid>\nstruct RMinQandRAQ {\n RMinQandRAQ(int sz, const Monoid &UNITY, const Monoid &DEFAULT = 0) : UNITY(UNITY), DEFAULT(DEFAULT) {\n init(sz);\n dat.assign((n << 1) - 1, DEFAULT);\n }\n\n RMinQandRAQ(const vector<Monoid> &a, const Monoid &UNITY, const Monoid &DEFAULT = 0) : UNITY(UNITY), DEFAULT(DEFAULT) {\n int a_sz = a.size();\n init(a_sz);\n dat.resize((n << 1) - 1);\n REP(i, a_sz) dat[n - 1 + i] = a[i];\n for (int i = n - 2; i >= 0; --i) dat[i] = min(dat[(i << 1) + 1], dat[(i << 1) + 2]);\n }\n\n void add(int a, int b, const Monoid &value) { add(a, b, value, 0, 0, n); }\n\n Monoid query(int a, int b) { return query(a, b, 0, 0, n); }\n\n Monoid operator[](const int idx) { return query(idx, idx + 1); }\n\n int find(int a, int b, const Monoid &value) { return find(a, b, value, 0, 0, n); }\n\nprivate:\n int n = 1;\n const Monoid UNITY, DEFAULT;\n vector<Monoid> dat, lazy;\n\n void init(int sz) {\n while (n < sz) n <<= 1;\n lazy.assign((n << 1) - 1, DEFAULT);\n }\n\n inline void evaluate(int node) {\n if (lazy[node] != DEFAULT) {\n dat[node] += lazy[node];\n if (node < n - 1) {\n lazy[(node << 1) + 1] += lazy[node];\n lazy[(node << 1) + 2] += lazy[node];\n }\n lazy[node] = DEFAULT;\n }\n }\n\n void add(int a, int b, const Monoid &value, int node, int left, int right) {\n evaluate(node);\n if (right <= a || b <= left) return;\n if (a <= left && right <= b) {\n lazy[node] += value;\n evaluate(node);\n } else {\n add(a, b, value, (node << 1) + 1, left, (left + right) >> 1);\n add(a, b, value, (node << 1) + 2, (left + right) >> 1, right);\n dat[node] = min(dat[(node << 1) + 1], dat[(node << 1) + 2]);\n }\n }\n\n Monoid query(int a, int b, int node, int left, int right) {\n evaluate(node);\n if (right <= a || b <= left) return UNITY;\n if (a <= left && right <= b) return dat[node];\n return min(query(a, b, (node << 1) + 1, left, (left + right) >> 1), query(a, b, (node << 1) + 2, (left + right) >> 1, right));\n }\n\n int find(int a, int b, const Monoid &value, int node, int left, int right) {\n evaluate(node);\n if (dat[node] > value || right <= a || b <= left) return -1;\n if (right - left == 1) return node - (n - 1);\n int res_l = find(a, b, value, (node << 1) + 1, left, (left + right) >> 1);\n if (res_l != -1) return res_l;\n return find(a, b, value, (node << 1) + 2, (left + right) >> 1, right);\n }\n};\n\ntemplate <typename Monoid>\nstruct RMaxQandRAQ {\n RMaxQandRAQ(int sz, const Monoid &UNITY, const Monoid &DEFAULT = 0) : UNITY(UNITY), DEFAULT(DEFAULT) {\n init(sz);\n dat.assign((n << 1) - 1, DEFAULT);\n }\n\n RMaxQandRAQ(const vector<Monoid> &a, const Monoid &UNITY, const Monoid &DEFAULT = 0) : UNITY(UNITY), DEFAULT(DEFAULT) {\n int a_sz = a.size();\n init(a_sz);\n dat.resize((n << 1) - 1);\n REP(i, a_sz) dat[n - 1 + i] = a[i];\n for (int i = n - 2; i >= 0; --i) dat[i] = max(dat[(i << 1) + 1], dat[(i << 1) + 2]);\n }\n\n void add(int a, int b, const Monoid &value) { add(a, b, value, 0, 0, n); }\n\n Monoid query(int a, int b) { return query(a, b, 0, 0, n); }\n\n Monoid operator[](const int idx) { return query(idx, idx + 1); }\n\n int find(int a, int b, const Monoid &value) { return find(a, b, value, 0, 0, n); }\n\nprivate:\n int n = 1;\n const Monoid UNITY, DEFAULT;\n vector<Monoid> dat, lazy;\n\n void init(int sz) {\n while (n < sz) n <<= 1;\n lazy.assign((n << 1) - 1, DEFAULT);\n }\n\n inline void evaluate(int node) {\n if (lazy[node] != DEFAULT) {\n dat[node] += lazy[node];\n if (node < n - 1) {\n lazy[(node << 1) + 1] += lazy[node];\n lazy[(node << 1) + 2] += lazy[node];\n }\n lazy[node] = DEFAULT;\n }\n }\n\n void add(int a, int b, const Monoid &value, int node, int left, int right) {\n evaluate(node);\n if (right <= a || b <= left) return;\n if (a <= left && right <= b) {\n lazy[node] += value;\n evaluate(node);\n } else {\n add(a, b, value, (node << 1) + 1, left, (left + right) >> 1);\n add(a, b, value, (node << 1) + 2, (left + right) >> 1, right);\n dat[node] = max(dat[(node << 1) + 1], dat[(node << 1) + 2]);\n }\n }\n\n Monoid query(int a, int b, int node, int left, int right) {\n evaluate(node);\n if (right <= a || b <= left) return UNITY;\n if (a <= left && right <= b) return dat[node];\n return max(query(a, b, (node << 1) + 1, left, (left + right) >> 1), query(a, b, (node << 1) + 2, (left + right) >> 1, right));\n }\n\n int find(int a, int b, const Monoid &value, int node, int left, int right) {\n evaluate(node);\n if (dat[node] < value || right <= a || b <= left) return -1;\n if (right - left == 1) return node - (n - 1);\n int res_l = find(a, b, value, (node << 1) + 1, left, (left + right) >> 1);\n if (res_l != -1) return res_l;\n return find(a, b, value, (node << 1) + 2, (left + right) >> 1, right);\n }\n};\n\nint main() {\n cin.tie(nullptr); ios::sync_with_stdio(false);\n // freopen(\"input.txt\", \"r\", stdin);\n\n int n, H; cin >> n >> H;\n vector<int> d(n, 0), h(n, 0);\n FOR(i, 1, n) cin >> d[i] >> h[i - 1];\n long long hp = H, ans = 0;\n RMinQandRAQ<int> rmq(n, INF);\n RMaxQandRAQ<int> spring(n, -INF);\n FOR(i, 1, n) {\n hp -= d[i];\n // cout << \"HP:\" << hp << \" -> \";\n while (hp <= 0) {\n int idx = spring.find(0, i, spring.query(0, i)), mn = rmq.query(idx, i);\n if (mn < spring[idx]) {\n spring.add(idx, idx + 1, -(spring[idx] - mn));\n continue;\n }\n int need = -hp + 1;\n long long cnt = mn / spring[idx], mx = cnt * spring[idx];\n if (mx >= need) {\n cnt = (need + spring[idx] - 1) / spring[idx];\n mx = cnt * spring[idx];\n }\n hp += mx;\n ans += cnt;\n rmq.add(idx, i, -mx);\n int nx_mn = rmq.query(idx, i);\n if (nx_mn < spring[idx]) spring.add(idx, idx + 1, -(spring[idx] - nx_mn));\n }\n rmq.add(i, i + 1, H - hp);\n spring.add(i, i + 1, min(H - hp, (long long)h[i]));\n // cout << hp << \" Ans:\" << ans << '\\n';\n // REP(j, i + 1) cout << rmq[j] << ' ';\n // cout << '\\n';\n // REP(j, i + 1) cout << spring[j] << ' ';\n // cout << '\\n';\n }\n cout << ans << '\\n';\n return 0;\n}", "accuracy": 1, "time_ms": 270, "memory_kb": 7872, "score_of_the_acc": -0.9506, "final_rank": 5 } ]
aoj_0561_cpp
古本屋(Books) あなたの町にはJOI 古本店という老舗の古本屋があり，あなたはJOI 古本店をよく利用している．それぞれの本には基準価格が定まっており，JOI 古本店に行けばその価格で買い取ってもらえる． JOI 古本店では，本を小説,漫画,雑誌など10 種類のジャンルに分類して扱っている．ジャンルには1から10 までの番号が付けられている．JOI 古本店には，同じジャンルの本をまとめて買い取ってもらうと高値で買い取ってくれるというサービスがある．具体的には，同じジャンルの本をまとめてT 冊買い取ってもらう場合，そのジャンルの本の一冊あたりの買取価格が基準価格よりT - 1 円高くなる．例えば，同じジャンルで基準価格100 円，120 円，150 円の本をまとめてJOI 古本店に売ったとすると，買取価格はそれぞれ102 円，122 円，152 円となる． さて，あなたは一身上の都合で急遽引越しをすることになった．あなたはN 冊の本を持っているが，新しい住居にすべての本を持っていくことは困難なため， N 冊の本のうち K 冊をJOI 古本店に売ることにした． 課題 N 冊の本それぞれの基準価格とジャンルの番号が与えられるとき，合計買取価格の最大値を求めるプログラムを作成せよ． 制限 2 ≤ N ≤ 2000    あなたが持っている本の冊数 1 ≤ K < N JOI 古本店に売る本の冊数 1 ≤ C i ≤ 100000 = 10 5 i 番目の本の基準価格 1 ≤ G i ≤ 10 i 番目の本のジャンルの番号 入力 標準入力から以下の入力を読み込め． 1 行目には整数 N , K が空白を区切りとして書かれており，あなたの持っている本の冊数が N で，そのうち K 冊をJOI 古本店に売ることを表す． 続く N 行にはあなたの持っている本の情報が書かれている． i + 1 行目(1 ≤ i ≤ N ) には，整数 C i , G i が空白を区切りとして書かれており， i 番目の本の基準価格が C i で，ジャンルの番号が G i であることを表す． 出力 標準出力に，合計買取価格の最大値を表す整数を1 行で出力せよ． 採点基準 採点用データのうち， 配点の20% 分については， N ≤ 20 を満たす． 配点の20% 分については，すべての本のジャンルは1 または2 である． 配点の10% 分については，これら2 つの条件の両方を満たす． 配点の30% 分については，これら2 つの条件の少なくとも一方を満たす． 入出力の例 入力例 7 4 14 1 13 2 12 3 14 2 8 2 16 3 11 2 出力例 60 この入力例では，2 番目，4 番目，6 番目，7 番目の4 冊の本を売ったとき，ジャンル2 の本の買取価格が1 冊あたり2 円高くなるので，これらの本の買取価格は以下のようになる． 番号 基準価格 ジャンル 買取価格 2 4 6 7 13 14 16 11 2 2 3 2 15 16 16 13 よって合計買取価格は15 + 16 + 16 + 13 = 60 円である．このとき合計買取価格は最大となる． 問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0561_8115415", "code_snippet": "#include <algorithm>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <set>\n#include <sstream>\n#include <string>\n#include <vector>\n#define REP(i, k, n) for (int i = k; i < n; i++)\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define INF 1 << 30\n#define pb push_back\n#define mp make_pair\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\nll d[15][2005], dp[2005][2005];\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n int n, K;\n cin >> n >> K;\n vector<int> id, v[2005];\n rep(i, n) {\n int a, b;\n cin >> a >> b;\n id.pb(b - 1);\n v[b - 1].pb(a);\n }\n sort(id.begin(), id.end());\n id.erase(unique(id.begin(), id.end()), id.end());\n rep(i, id.size()) {\n int j = id[i];\n sort(v[j].begin(), v[j].end(), greater<int>());\n }\n memset(d, 0, sizeof(d));\n vector<P> p;\n for (int i = 0; i < id.size(); i++) {\n int j = id[i];\n REP(k, 1, v[j].size() + 1) {\n d[j][k] += d[j][k - 1] + v[j][k - 1] + (k - 1) * 2;\n p.pb(mp(k, d[j][k]));\n }\n }\n memset(dp, 0, sizeof(dp));\n for (int i = 0; i < id.size(); i++) {\n for (int j = 0; j <= K; j++) {\n ll res = dp[i][j];\n for (int k = 0; k <= v[id[i]].size(); k++) {\n if (j >= k) {\n res = max(res, dp[i][j - k] + d[id[i]][k]);\n }\n }\n dp[i + 1][j] = res;\n }\n }\n cout << dp[id.size()][K] << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 34960, "score_of_the_acc": -1, "final_rank": 16 }, { "submission_id": "aoj_0561_8115412", "code_snippet": "#include <algorithm>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <set>\n#include <sstream>\n#include <string>\n#include <vector>\n#define REP(i, k, n) for (int i = k; i < n; i++)\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define INF 1 << 30\n#define pb push_back\n#define mp make_pair\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\nll d[15][2005], dp[2005][2005];\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(NULL);\n int n, K;\n cin >> n >> K;\n vector<int> id, v[2005];\n rep(i, n) {\n int a, b;\n cin >> a >> b;\n id.pb(b - 1);\n v[b - 1].pb(a);\n }\n sort(id.begin(), id.end());\n id.erase(unique(id.begin(), id.end()), id.end());\n rep(i, id.size()) {\n int j = id[i];\n sort(v[j].rbegin(), v[j].rend());\n }\n memset(d, 0, sizeof(d));\n vector<P> p;\n rep(i, id.size()) {\n int j = id[i];\n REP(k, 1, v[j].size() + 1) {\n d[j][k] += d[j][k - 1] + v[j][k - 1] + (k - 1) * 2;\n p.pb(mp(k, d[j][k]));\n }\n }\n sort(p.rbegin(), p.rend());\n memset(dp, 0, sizeof(dp));\n rep(i, id.size()) {\n rep(j, K + 1) {\n ll res = dp[i][j];\n rep(k, v[id[i]].size() + 1) {\n if (j >= k) {\n res = max(res, dp[i][j - k] + d[id[i]][k]);\n }\n }\n dp[i + 1][j] = res;\n }\n }\n cout << dp[id.size()][K] << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 34932, "score_of_the_acc": -0.9991, "final_rank": 14 }, { "submission_id": "aoj_0561_8115408", "code_snippet": "#include <algorithm>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <set>\n#include <sstream>\n#include <string>\n#include <vector>\n#define REP(i, k, n) for (int i = k; i < n; i++)\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define INF 1 << 30\n#define pb push_back\n#define mp make_pair\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\nll d[15][2005], dp[2005][2005];\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n cout.tie(NULL);\n\n int n, K;\n cin >> n >> K;\n vector<int> id, v[2005];\n rep(i, n) {\n int a, b;\n cin >> a >> b;\n id.pb(b - 1);\n v[b - 1].pb(a);\n }\n sort(id.begin(), id.end());\n id.erase(unique(id.begin(), id.end()), id.end());\n rep(i, id.size()) {\n int j = id[i];\n sort(v[j].begin(), v[j].end(), greater<int>());\n }\n memset(d, 0, sizeof(d));\n vector<P> p;\n rep(i, id.size()) {\n int j = id[i];\n REP(k, 1, v[j].size() + 1) {\n d[j][k] += d[j][k - 1] + v[j][k - 1] + (k - 1) * 2;\n p.pb(mp(k, d[j][k]));\n }\n }\n memset(dp, 0, sizeof(dp));\n rep(i, id.size()) {\n rep(j, K + 1) {\n ll res = dp[i][j];\n rep(k, v[id[i]].size() + 1) {\n if (j >= k) {\n res = max(res, dp[i][j - k] + d[id[i]][k]);\n }\n }\n dp[i + 1][j] = res;\n }\n }\n cout << dp[id.size()][K] << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 34956, "score_of_the_acc": -0.9999, "final_rank": 15 }, { "submission_id": "aoj_0561_8115400", "code_snippet": "#include <algorithm>\n#include <cstring>\n#include <iostream>\n#include <map>\n#include <set>\n#include <sstream>\n#include <string>\n#include <vector>\n#define REP(i, k, n) for (int i = k; i < n; i++)\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define INF 1 << 30\n#define pb push_back\n#define mp make_pair\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> P;\nll d[15][2005], dp[2005][2005];\nint main() {\n int n, K;\n cin >> n >> K;\n vector<int> id, v[2005];\n rep(i, n) {\n int a, b;\n cin >> a >> b;\n id.push_back(b - 1);\n v[b - 1].push_back(a);\n }\n sort(id.begin(), id.end());\n id.erase(unique(id.begin(), id.end()), id.end());\n rep(i, id.size()) {\n int j = id[i];\n sort(v[j].begin(), v[j].end(), greater<int>());\n }\n memset(d, 0, sizeof(d));\n rep(i, id.size()) {\n int j = id[i];\n REP(k, 1, v[j].size() + 1) {\n d[j][k] += d[j][k - 1] + v[j][k - 1] + (k - 1) * 2;\n }\n }\n memset(dp, 0, sizeof(dp));\n rep(i, id.size()) {\n rep(j, K + 1) {\n ll res = dp[i][j];\n rep(k, v[id[i]].size() + 1) {\n if (j >= k) {\n res = max(res, dp[i][j - k] + d[id[i]][k]);\n }\n }\n dp[i + 1][j] = res;\n }\n }\n cout << dp[id.size()][K] << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 34812, "score_of_the_acc": -0.9953, "final_rank": 13 }, { "submission_id": "aoj_0561_6132002", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\n//typedef long long ll;\ntypedef int ll;\ntypedef pair<ll, ll> P;\nconst long long INF = 1e9;\ntemplate <typename T>\nvoid input_arr(vector<T>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i];\n\t}\n}\ntemplate <typename T, typename Q>\nvoid input_arr(vector<pair<T, Q>>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i].first >> A[i].second;\n\t}\n}\ntemplate <typename T>\nvoid input_arr(vector<vector<T>>& A, ll H, ll W) {\n\tfor (ll i = 0; i < H; i++) {\n\t\tfor (ll j = 0; j < W; j++) {\n\t\t\tcin >> A[i][j];\n\t\t}\n\t}\n}\nvector<ll>num(20, 0);\nbool cmp(P a, P b) {\n if (a.first + num[a.second] - 1 != b.first + num[b.second] - 1) {\n return a.first + num[a.second] - 1 > b.first + num[b.second] - 1;\n }\n else return num[a.second] > num[b.second];\n}\nint main() {\n ll N, M; cin >> N >> M;\n vector<P>A(N); input_arr(A, N);\n sort(A.begin(), A.end(), greater<P>());\n vector<P>ans;\n for (ll i = 0; i < M; i++) {\n ans.push_back(A[i]);\n num[A[i].second]++;\n }\n sort(ans.begin(), ans.end(), cmp);\n for (ll i = M; i < N; i++) {\n ll num1 = ans.back().first + num[ans.back().second] * (num[ans.back().second] - 1);\n ll num2 = A[i].first + (num[A[i].second] + 1) * num[A[i].second];\n if (ans.back().second == A[i].second) {\n num1 = ans.back().first;\n num2 = A[i].first;\n }\n if (num1 < num2) {\n num[ans.back().second]--;\n num[A[i].second]++;\n ans.pop_back();\n ans.push_back(A[i]);\n }\n sort(ans.begin(), ans.end(), cmp);\n }\n ll sum = 0;\n for (ll i = 0; i < M; i++) {\n sum += ans[i].first + num[ans[i].second] - 1;\n }\n cout << sum << endl;\n}", "accuracy": 0.3, "time_ms": 20, "memory_kb": 3412, "score_of_the_acc": -0.0914, "final_rank": 18 }, { "submission_id": "aoj_0561_4405222", "code_snippet": "#include <iostream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <array>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <sstream>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <list>\n#include <numeric>\n#include <stack>\n#include <iomanip>\n#include <random>\n#include <complex>\n#include <functional>\n#include <tuple>\n\nusing namespace std;\n\n#define Rep(i,a,b) for(ll i = a; i < b; ++i)\n#define rep(i,b) Rep(i,0,b)\n#define allof(a) (a).begin(), (a).end()\n\n#define Yes(q) ((q) ? \"Yes\" : \"No\")\n#define YES(q) ((q) ? \"YES\" : \"NO\")\n#define Possible(q) ((q) ? \"Possible\" : \"Impossible\")\n#define POSSIBLE(q) ((q) ? \"POSSIBLE\" : \"IMPOSSIBLE\")\n\nusing ll = long long;\n\nconstexpr int inf = 1e9 + 7;\nconstexpr ll infll = 1ll << 60ll;\nconstexpr ll mod = 1e9 + 7;\n// 0~3までは右左下上 4~7までは斜め\nconstexpr int dx[] = { 1, 0, -1, 0, 1, 1, -1, -1 };\nconstexpr int dy[] = { 0, -1, 0, 1, 1, -1, -1, 1 };\n\nnamespace {\n template<typename T> void chmax(T& a, T b) { a = std::max(a, b); }\n template<typename T> void chmin(T& a, T b) { a = std::min(a, b); }\n template<typename T> void chadd(T& a, T b) { a = a + b; }\n\n void Cout(long long x, const char* end = \"\\n\") { std::cout << x << end; }\n template <typename T> void Cout(const T& x, const char* end = \"\\n\") { std::cout << x << end; }\n template <typename T> void Cout(const std::vector<T>& x, const char* sep = \" \", const char* end = \"\\n\") { for (std::size_t i = 0, sz = x.size(); i < sz; i++) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }\n\n // 標準入出力\n struct inp {\n std::size_t sz;\n inp(std::size_t _sz = 1) : sz(_sz) {}\n template <typename T> operator T () const { T a; std::cin >> a; return a; }\n template <typename T> operator std::vector<T>() const { std::vector<T> a(sz); for (std::size_t i = 0; i < sz; i++) std::cin >> a[i]; return a; }\n };\n\n // 2次元用の標準入出力\n template<typename T>\n struct inpn {\n std::size_t szi, szj;\n inpn(std::size_t _szi, std::size_t _szj) : szi(_szi), szj(_szj) {}\n operator std::vector<std::vector<T>>() const {\n std::vector<std::vector<T>> a(szi, std::vector<T>(szj));\n for (std::size_t i = 0; i < szi; ++i)\n for (std::size_t j = 0; j < szj; ++j) cin >> a[i][j];\n return a;\n }\n };\n\n inp inp1; // input one\n}\n\n\nint main() {\n\n int n, k;\n cin >> n >> k;\n vector<pair<int, int>> cg(n);\n rep(i, n) cin >> cg[i].first >> cg[i].second;\n\n // k冊売る\n\n vector<vector<ll>> book(10, vector<ll>());\n rep(i, n) {\n book[cg[i].second - 1].push_back(cg[i].first);\n }\n rep(i, 10) {\n sort(allof(book[i]), greater<ll>());\n }\n\n vector<vector<ll>> sum(10, vector<ll>(k + 1, 0LL));\n\n rep(g, 10) {\n rep(j, min((size_t)k, book[g].size())) {\n sum[g][j + 1] = sum[g][j] + book[g][j] + j * 2;\n }\n }\n\n vector<vector<ll>> dp(11, vector<ll>(k + 1, 0LL));\n rep(g, 10) {\n for (int i = 0; i <= k; ++i) { // i冊売った\n for (int j = 0; j <= i; ++j) { // そのうちジャンルgをj冊売った\n chmax(dp[g + 1][i], dp[g][i - j] + sum[g][j]);\n }\n }\n }\n\n Cout(dp[10][k]);\n\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3292, "score_of_the_acc": -0.0043, "final_rank": 5 }, { "submission_id": "aoj_0561_4404936", "code_snippet": "#include <iostream>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <array>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <sstream>\n#include <cstdio>\n#include <cstring>\n#include <cmath>\n#include <list>\n#include <numeric>\n#include <stack>\n#include <iomanip>\n#include <random>\n#include <complex>\n#include <functional>\n#include <tuple>\n\nusing namespace std;\n\n#define Rep(i,a,b) for(ll i = a; i < b; ++i)\n#define rep(i,b) Rep(i,0,b)\n#define allof(a) (a).begin(), (a).end()\n\n#define Yes(q) ((q) ? \"Yes\" : \"No\")\n#define YES(q) ((q) ? \"YES\" : \"NO\")\n#define Possible(q) ((q) ? \"Possible\" : \"Impossible\")\n#define POSSIBLE(q) ((q) ? \"POSSIBLE\" : \"IMPOSSIBLE\")\n\nusing ll = long long;\n\nconstexpr int inf = 1e9 + 7;\nconstexpr ll infll = 1ll << 60ll;\nconstexpr ll mod = 1e9 + 7;\n// 0~3までは右左下上 4~7までは斜め\nconstexpr int dx[] = { 1, 0, -1, 0, 1, 1, -1, -1 };\nconstexpr int dy[] = { 0, -1, 0, 1, 1, -1, -1, 1 };\n\nnamespace {\n template<typename T> void chmax(T& a, T b) { a = std::max(a, b); }\n template<typename T> void chmin(T& a, T b) { a = std::min(a, b); }\n template<typename T> void chadd(T& a, T b) { a = a + b; }\n\n void Cout(long long x, const char* end = \"\\n\") { std::cout << x << end; }\n template <typename T> void Cout(const T& x, const char* end = \"\\n\") { std::cout << x << end; }\n template <typename T> void Cout(const std::vector<T>& x, const char* sep = \" \", const char* end = \"\\n\") { for (std::size_t i = 0, sz = x.size(); i < sz; i++) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }\n\n // 標準入出力\n struct inp {\n std::size_t sz;\n inp(std::size_t _sz = 1) : sz(_sz) {}\n template <typename T> operator T () const { T a; std::cin >> a; return a; }\n template <typename T> operator std::vector<T>() const { std::vector<T> a(sz); for (std::size_t i = 0; i < sz; i++) std::cin >> a[i]; return a; }\n };\n\n // 2次元用の標準入出力\n template<typename T>\n struct inpn {\n std::size_t szi, szj;\n inpn(std::size_t _szi, std::size_t _szj) : szi(_szi), szj(_szj) {}\n operator std::vector<std::vector<T>>() const {\n std::vector<std::vector<T>> a(szi, std::vector<T>(szj));\n for (std::size_t i = 0; i < szi; ++i)\n for (std::size_t j = 0; j < szj; ++j) cin >> a[i][j];\n return a;\n }\n };\n\n inp inp1; // input one\n}\n\n\nint main() {\n\n int n, k;\n cin >> n >> k;\n vector<pair<int, int>> cg(n);\n rep(i, n) cin >> cg[i].first >> cg[i].second;\n\n // k冊売る\n\n vector<vector<ll>> book(10, vector<ll>());\n rep(i, n) {\n book[cg[i].second - 1].push_back(cg[i].first);\n }\n rep(i, 10) {\n sort(allof(book[i]), greater<ll>());\n }\n\n vector<vector<ll>> sum(10, vector<ll>(k + 1, 0LL));\n\n rep(g, 10) {\n rep(j, min((size_t)k, book[g].size())) {\n sum[g][j + 1] = sum[g][j] + book[g][j] + j * 2;\n }\n }\n\n vector<ll> dp(k + 1, 0LL);\n rep(g, 10) {\n for (int i = k; i >= 0; --i) { // i冊売った\n for (int j = 0; j <= i; ++j) { // そのうちジャンルgをj冊売った\n chmax(dp[i], dp[i - j] + sum[g][j]);\n }\n }\n }\n\n Cout(dp[k]);\n\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3284, "score_of_the_acc": -0.004, "final_rank": 4 }, { "submission_id": "aoj_0561_4404702", "code_snippet": "#include<bits/stdc++.h>\n#define enld '\\n'\n#define rep(i,n) for(int i=0; i<(n); i++)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"Ofast\")\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\nconstexpr ll mod = 1000000007;\nconstexpr ll mod2 = 998244353;\nconst double PI = 3.1415926535897932384626433832795028841971;\nconst int dx[6] = {1, 0, -1, 0,1,1};\nconst int dy[6] = {0, 1, 0, -1,1,-1};\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n// ---------------------------------------------------------------------------\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N,K;\n cin >> N >> K;\n vector<vector<int>> suzu(11);\n for(int i=0; i<N; i++){\n int a,b;\n cin >> a >> b;\n b--;\n suzu[b].push_back(a);\n }\n for(int i=0; i<10; i++){\n if(!suzu[i].size()) continue;\n sort(suzu[i].begin(),suzu[i].end(),greater<int>());\n for(int j=0; j<suzu[i].size()-1; j++){\n suzu[i][j+1] += suzu[i][j] + (j+1)*2;\n }\n }\n // for(int i=0; i<10; i++){\n // for(int j=0; j<suzu[i].size(); j++){\n // cout << suzu[i][j] << \" \";\n // }\n // cout << enld;\n // }\n vector<int> ken(K+1,0); \n for(int i=0; i<10; i++){\n if(!suzu[i].size()) continue;\n vector<int> temp = ken;\n for(int j=0; j<K; j++){\n for(int k=0; k<suzu[i].size(); k++){\n if(j+k+1 > K) continue;\n chmax(temp[j+k+1],suzu[i][k] + ken[j]);\n }\n }\n ken = temp;\n }\n cout << ken[K] << enld;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3184, "score_of_the_acc": -0.0009, "final_rank": 1 }, { "submission_id": "aoj_0561_4404684", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n\nint main() {\n vector<ll> mae(2005,2LL);\n mae[0]=0;\n for(int i = 1;i < 2005;++i) {\n mae[i]+=mae[i-1];\n }\n int n,K;\n cin>>n>>K;\n vector<pair<ll,int>> books;\n for(int i = 0;i < n;++i) {\n ll c;\n int g;\n cin>>c>>g;\n --g;\n books.emplace_back(c,g);\n }\n\n vector<vector<vector<ll>>> dp(2,vector<vector<ll>>(10,vector<ll>(n+1,0)));\n dp[0][books[0].second][1]=books[0].first;\n for(int i = 1;i < n;++i) {\n int dpind=i%2;\n int dppreind=1-dpind;\n for(int j = 0;j < 10;++j) {\n int k=1;\n while(k<=n&&dp[dppreind][j][k]!=0) {\n if(books[i].second==j) {\n dp[dpind][j][k]=max(dp[dppreind][j][k],dp[dppreind][j][k-1]+books[i].first+mae[k-1]);\n }\n else {\n dp[dpind][j][k]=dp[dppreind][j][k];\n }\n ++k;\n }\n if(books[i].second==j) {\n dp[dpind][j][k]=max(dp[dppreind][j][k],dp[dppreind][j][k-1]+books[i].first+mae[k-1]);\n }\n else {\n dp[dpind][j][k]=dp[dppreind][j][k];\n }\n }\n }\n\n int li=(n-1)%2;\n\n\n\n vector<vector<ll>> ep(2,vector<ll>(K+1,0));\n ep[0][1]=dp[li][0][1];\n for(int i = 0;i < 10;++i) {\n for(int j = 1;j <= n;++j) {\n if(i==0&&j==1)continue;\n int dpind=(i*n+j-1)%2;\n int dppreind=1-dpind;\n for(int l = 1;l <= K;++l) {\n ep[dpind][l]=ep[dppreind][l];\n if(l<j)continue;\n if(dp[li][i][j]==0)continue;\n if(l-j!=0&&ep[dppreind][l-j]==0)continue;\n ep[dpind][l]=max(ep[dpind][l],ep[dppreind][l-j]+dp[li][i][j]);\n }\n\n\n }\n }\n\n li = (10*n-1)%2;\n\n cout<<ep[li][K]<<endl;\n\n return 0;\n}", "accuracy": 0.1, "time_ms": 10, "memory_kb": 3404, "score_of_the_acc": -0.0078, "final_rank": 19 }, { "submission_id": "aoj_0561_4404622", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <set>\n#include <utility>\nusing namespace std;\ntypedef pair<int, int> pii;\n\nint main(){\n int n,k;\n cin >> n >> k;\n vector<vector<int>> val_pre(10);\n for(int i=0; i<n; i++){\n int v,g;\n cin >> v >> g;\n val_pre[g-1].push_back(v);\n }\n vector<int> dp(k+1, 0);\n for(int i=0; i<10; i++){\n sort(val_pre[i].begin(), val_pre[i].end(), greater<int>());\n vector<int> v(k+1, 0);\n int curr = 0;\n for(int j=0; j<min(k, (int)val_pre[i].size()); j++){\n curr += val_pre[i][j];\n v[j+1] = curr +j*(j+1);\n }\n for(int j=k; j>=0; j--){\n for(int s=0; s<=j; s++){\n dp[j] = max(dp[j], dp[s]+v[j-s]);\n }\n }\n }\n cout << dp[k] << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3192, "score_of_the_acc": -0.0011, "final_rank": 2 }, { "submission_id": "aoj_0561_4356186", "code_snippet": "#include <iostream>\n#include <unordered_map>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nint main() {\n int N, K;\n cin >> N >> K;\n\n unordered_map<int, vector<int>> CG;\n\n for (int i = 1; i <= 10; i++) {\n CG[i].push_back(0);\n }\n\n for (int i = 0; i < N; i++) {\n int C, G;\n cin >> C >> G;\n CG[G].push_back(C);\n }\n\n for (int i = 1; i <= 10; i++) {\n sort(CG[i].begin() + 1, CG[i].end(), greater<>());\n for (int j = 1; j < CG[i].size(); j++) {\n CG[i][j] += CG[i][j - 1] + (j - 1) * 2;\n }\n }\n\n int dp[11][K + 1];\n fill(dp[0], dp[10] + K + 1, 0);\n\n for (int i = 1; i <= 10; i++) {\n for (int j = 0; j < CG[i].size(); j++) {\n for (int k = j; k <= K; k++) {\n dp[i][k] = max(dp[i][k], dp[i - 1][k - j] + CG[i][j]);\n }\n }\n }\n\n cout << dp[10][K] << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3188, "score_of_the_acc": -0.0843, "final_rank": 9 }, { "submission_id": "aoj_0561_4356168", "code_snippet": "#include <iostream>\n#include <unordered_map>\n#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nint main() {\n int N, K;\n cin >> N >> K;\n\n unordered_map<int, vector<int>> CG;\n\n for (int i = 1; i <= 10; i++) {\n CG[i].push_back(0);\n }\n\n for (int i = 0; i < N; i++) {\n int C, G;\n cin >> C >> G;\n CG[G].push_back(C);\n }\n\n for (int i = 1; i <= 10; i++) {\n sort(CG[i].begin() + 1, CG[i].end(), greater<>());\n for (int j = 1; j < CG[i].size(); j++) {\n CG[i][j] += CG[i][j - 1];\n }\n for (int j = 2; j < CG[i].size(); j++) {\n CG[i][j] += j * (j - 1);\n }\n }\n\n int dp[11][K + 1];\n fill(dp[0], dp[10] + K + 1, 0);\n\n for (int i = 1; i <= 10; i++) {\n for (int j = 0; j < CG[i].size(); j++) {\n for (int k = j; k <= K; k++) {\n dp[i][k] = max(dp[i][k], dp[i - 1][k - j] + CG[i][j]);\n }\n }\n }\n\n cout << dp[10][K] << endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 3188, "score_of_the_acc": -0.0843, "final_rank": 9 }, { "submission_id": "aoj_0561_3886644", "code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\n\nusing int64 = long long;\nusing i64 = int64;\n\ntemplate<typename T>\nusing p_que = priority_queue<T>;\ntemplate<typename T>\nusing rp_que = priority_queue<T, vector<T>, greater<T>>;\n\nconstexpr int INF = (1 << 30) - 1;\nconstexpr int64 INF64 = (1ll << 60) - 1;\n\n#define rep(i, N) for(int i=0;i<(int)(N);++i)\n#define fs first\n#define sc second\n#define e_b emplace_back\n#define m_p make_pair\n#define all(x) x.begin(),x.end()\n#define rall(x) x.rbegin(),x.rend()\n\ntemplate <typename T, typename U>\nostream& operator<<(ostream& os, const pair<T, U>& p) {\n\treturn os << \"P(\" << p.first << \", \" << p.second << \")\";\n}\ntemplate <typename T>\nostream& operator<<(ostream& os, const vector<T>& v) {\n\tos << \"[\";\n\tfor (auto& e : v) os << e << \", \";\n\treturn os << \"]\";\n}\ntemplate <typename T, typename U>\nostream& operator<<(ostream& os, const map<T, U>& m) {\n\tos << \"{\" << endl;\n\tfor (auto& e : m) os << \"(\" << e.first << \", \" << e.second << \")\" << endl;\n\treturn os << \"}\";\n}\ntemplate <typename T>\nostream& operator<<(ostream& os, const set<T>& s) {\n\tos << \"{\" << endl;\n\tfor (auto& e : s) os << \", \" << e << endl;\n\treturn os << \"}\";\n}\n\ntemplate<typename T>\nvector<T> make_v(size_t a, T b) { return vector<T>(a, b); }\ntemplate<typename... Ts>\nauto make_v(size_t a, Ts... ts) {\n\treturn vector<decltype(make_v(ts...))>(a, make_v(ts...));\n}\n\nint64 gcd(int64 x, int64 y) {\n\tif (x == 0 || y == 0) return 0;\n\tint64 r;\n\twhile ((r = y % x) != 0) {\n\t\ty = x;\n\t\tx = r;\n\t}\n\treturn x;\n}\nint64 lcm(int64 x, int64 y) {\n\tif (x == 0 || y == 0) return 0;\n\treturn x / gcd(x, y) * y;\n}\n\nint dx[] = { -1, 0, 1, 0 };\nint dy[] = { 0, 1, 0, -1 };\n\nvoid Main();\nsigned main() {\n\tcin.tie(nullptr);\n\tios_base::sync_with_stdio(false);\n\tcout << fixed << setprecision(30);\n\tMain();\n}\n\n/*----------------------------Insert from here!----------------------------*/\n\ntemplate <int mod>\nstruct ModInt {\n\tint x;\n\n\tModInt() : x(0) {}\n\n\tModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n\n\tModInt& operator+=(const ModInt& p) {\n\t\tif ((x += p.x) >= mod) x -= mod;\n\t\treturn *this;\n\t}\n\n\tModInt& operator-=(const ModInt& p) {\n\t\tif ((x += mod - p.x) >= mod) x -= mod;\n\t\treturn *this;\n\t}\n\n\tModInt& operator*=(const ModInt& p) {\n\t\tx = (int)(1LL * x * p.x % mod);\n\t\treturn *this;\n\t}\n\n\tModInt& operator/=(const ModInt& p) {\n\t\t*this *= p.inverse();\n\t\treturn *this;\n\t}\n\n\tModInt operator-() const { return ModInt(-x); }\n\n\tModInt operator+(const ModInt& p) const { return ModInt(*this) += p; }\n\n\tModInt operator-(const ModInt& p) const { return ModInt(*this) -= p; }\n\n\tModInt operator*(const ModInt& p) const { return ModInt(*this) *= p; }\n\n\tModInt operator/(const ModInt& p) const { return ModInt(*this) /= p; }\n\n\tbool operator==(const ModInt& p) const { return x == p.x; }\n\n\tbool operator!=(const ModInt& p) const { return x != p.x; }\n\n\tModInt inverse() const {\n\t\tint a = x, b = mod, u = 1, v = 0, t;\n\t\twhile (b > 0) {\n\t\t\tt = a / b;\n\t\t\tswap(a -= t * b, b);\n\t\t\tswap(u -= t * v, v);\n\t\t}\n\t\treturn ModInt(u);\n\t}\n\n\tModInt pow(int64_t n) const {\n\t\tModInt ret(1), mul(x);\n\t\twhile (n > 0) {\n\t\t\tif (n & 1) ret *= mul;\n\t\t\tmul *= mul;\n\t\t\tn >>= 1;\n\t\t}\n\t\treturn ret;\n\t}\n\n\tfriend ostream& operator<<(ostream& os, const ModInt& p) {\n\t\treturn os << p.x;\n\t}\n\n\tfriend istream& operator>>(istream& is, ModInt& a) {\n\t\tint64_t t;\n\t\tis >> t;\n\t\ta = ModInt< mod >(t);\n\t\treturn (is);\n\t}\n\n\tstatic int get_mod() { return mod; }\n};\n\n/*----------------------------Insert above here----------------------------*/\n\n//const int MOD = 998244353;\n//const int MOD = 1e9 + 7;\n//const int MOD = 1234567;\n\nvoid Main() {\n\tint N, K; cin >> N >> K;\n\tvector<vector<int64>> C(10);\n\trep(i, N) {\n\t\tint c, g; cin >> c >> g;\n\t\tg--;\n\t\tC[g].emplace_back(c);\n\t}\n\n\trep(i, 10) sort(rall(C[i]));\n\n\tvector<vector<int64>> sum(10);\n\trep(i, 10) {\n\t\tsum[i] = C[i];\n\t\tfor (int j = 1; j < sum[i].size(); ++j) {\n\t\t\tsum[i][j] += sum[i][j - 1];\n\t\t\tsum[i][j] += 2ll * j;\n\t\t}\n\t}\n\n\tauto dp = make_v(10, K + 1, 0ll);\n\trep(i, min(K, (int)sum[0].size() - 1)) dp[0][i + 1] = sum[0][i];\n\tfor (int i = 1; i < 10; ++i) {\n\t\tfor (int j = 0; j < K + 1; ++j) {\n\t\t\tfor (int k = 0; k <= j; ++k) {\n\t\t\t\tif (j == k) {\n\t\t\t\t\tdp[i][j] = max(dp[i][j], dp[i - 1][k]);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tif (j - k - 1 >= sum[i].size() || j - k - 1 < 0) {\n\t\t\t\t\tdp[i][j] = max(dp[i][j], dp[i - 1][j]);\n\t\t\t\t\tcontinue;\n\t\t\t\t}\n\t\t\t\tdp[i][j] = max(dp[i][j], dp[i - 1][k] + sum[i][j - k - 1]);\n\t\t\t}\n\t\t}\n\t}\n\n\tcout << dp[9][K] << endl;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3300, "score_of_the_acc": -0.1712, "final_rank": 11 }, { "submission_id": "aoj_0561_3577180", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define REP(i, n) for(int i = 0; i < n; i++)\n#define REPR(i, n) for(int i = n - 1; i >= 0; i--)\n#define FOR(i, m, n) for(int i = m; i <= n; i++)\n#define FORR(i, m, n) for(int i = m; i >= n; i--)\n#define SORT(v, n) sort(v, v+n);\n#define VSORT(v) sort(v.begin(), v.end());\n \nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\nusing P = pair<ll, ll>;\n\n/* next combination */\nll next_combination(ll sub) {\n ll x = sub & -sub, y = sub + x;\n return (((sub & ~y) / x) >> 1) | y;\n}\n\nint main(){\n ll n, k;\n cin >> n >> k;\n vector<P> p;\n ll c, g;\n REP(i, n){\n cin >> c >> g;\n g--;\n p.push_back(P{c, g});\n }\n VSORT(p);\n ll res = 0;\n ll bit = (1 << k) - 1;\n for (;bit < (1LL<<n); bit = next_combination(bit)){\n vll s(n), gg(10);\n for(ll i = 0; i < n; i++){\n if((bit >> i) & 1){\n s[i] = 1;\n gg[p[i].second]++;\n }\n }\n ll tmp = 0;\n REP(i, n){\n if(s[i]){\n tmp += (p[i].first + gg[p[i].second] - 1);\n }\n }\n res = max(res, tmp);\n }\n \n cout << res << endl;\n return 0;\n}", "accuracy": 0.1, "time_ms": 40, "memory_kb": 3156, "score_of_the_acc": -0.25, "final_rank": 20 }, { "submission_id": "aoj_0561_3390678", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define lint long long\n#define P pair<int, int>\n#define LLP pair<long long, long long>\n#define REP(i, x, n) for(int i = (x), i##_len = (int)(n) ; i < i##_len ; ++i)\n#define rep(i, n) for(int i = 0, i##_len = (int)(n) ; i < i##_len ; ++i)\n#define repr(i, n) for(int i = (int)(n) - 1 ; i >= 0 ; --i)\n#define SORT(x) sort((x).begin(), (x).end())\n#define SORT_INV(x) sort((x).rbegin(), (x).rend())\n\nconst int IINF = 1e9 + 100;\nconst long long LLINF = 2e18 + 129;\nconst long long MOD = 1e9 + 7;\nconst int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};\nconst int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};\nconst double EPS = 1e-8;\n\ntemplate<typename T>\nbool chmax(T &a, T b){\n if(a < b){\n a = b;\n return true;\n }else{\n return false;\n }\n}\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(false);\n\n int n, k;\n cin >> n >> k;\n\n vector< vector<int> > v(10);\n rep(i, n){\n int c, g;\n cin >> c >> g;\n --g;\n v[g].push_back(c);\n }\n rep(i, 10){\n SORT_INV(v[i]);\n v[i].insert(v[i].begin(), 0);\n REP(j, 1, v[i].size()){\n v[i][j] += v[i][j - 1];\n v[i][j] += (j * (j - 1)) - ((j - 1) * (j - 2));\n }\n while(v[i].size() < k){\n v[i].push_back(v[i].back());\n }\n }\n\n int dp[11][2001] = {0};\n rep(i, 10){\n rep(j, k + 1){\n rep(l, j + 1){\n chmax(dp[i + 1][j], dp[i][l] + v[i][j - l]);\n }\n }\n }\n\n cout << dp[10][k] << endl;\n\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3312, "score_of_the_acc": -0.0049, "final_rank": 8 }, { "submission_id": "aoj_0561_3319413", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n#define all(x) (x).begin(),(x).end()\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define chmin(x, y) (x) = min((x), (y))\n#define chmax(x, y) (x) = max((x), (y))\n#define endl \"\\n\"\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\n\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){os << \"[\"; for (const auto &v : vec) {os << v << \",\"; } os << \"]\"; return os; }\ntemplate <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p) {os << \"(\" << p.first << \", \" << p.second << \")\"; return os;}\n\nint f(int i) {\n return i * 2;\n}\n\nvoid solve() {\n int N, K;\n cin >> N >> K;\n vector<pii> B(N);\n for (int i = 0; i < N; i++) {\n ll s, k;\n cin >> s >> k;\n k--;\n B[i] = {k, s};\n }\n sort(all(B), [](pii a, pii b){\n if (a.first == b.first) return a.second > b.second;\n return a.first < b.first;\n });\n\n vector<int> offset(10, -1);\n for (int i = 0; i < N; i++) {\n if (offset[B[i].first] == -1) offset[B[i].first] = i;\n }\n\n vector<vector<int>> dp(K + 1, vector<int>(2, -1));\n\n dp[0][0] = 0;\n for(int i = 0; i < N; i++) {\n vector<vector<int>> ndp(K + 1, vector<int>(2, -1));\n for(int j = 0; j <= K; j++) {\n if (j + 1 <= K && dp[j][0] != -1) {\n chmax(ndp[j + 1][0], dp[j][0] + B[i].second + f(i - offset[B[i].first]));\n }\n // 切り替わるタイミングで0, そうでないとき1\n int nextf = 1 - ((i == N - 1) || ((i < N - 1) && B[i].first != B[i + 1].first));\n if (dp[j][0] != -1) chmax(ndp[j][nextf], dp[j][0]);\n if (dp[j][1] != -1) chmax(ndp[j][nextf], dp[j][1]);\n }\n dp = ndp;\n }\n\n cout << max(dp[K][0], dp[K][1]) << endl;\n}\n\nint main() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(false);\n cout.setf(ios::fixed);\n cout.precision(16);\n solve();\n return 0;\n}", "accuracy": 1, "time_ms": 130, "memory_kb": 3396, "score_of_the_acc": -1.0075, "final_rank": 17 }, { "submission_id": "aoj_0561_3318741", "code_snippet": "#include <bits/stdc++.h>\n\n#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)\n#define RFOR(i,a) for(int i=(a); i >= 0; --i)\n#define FOE(i,a) for(auto i : a)\n#define ALL(c) (c).begin(), (c).end()\n#define RALL(c) (c).rbegin(), (c).rend()\n#define DUMP(x) cerr << #x << \" = \" << (x) << endl;\n#define SUM(x) std::accumulate(ALL(x), 0LL)\n#define MIN(v) *std::min_element(v.begin(), v.end())\n#define MAX(v) *std::max_element(v.begin(), v.end())\n#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())\n#define BIT(n) (1LL<<(n))\n#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());\n\ntypedef long long LL;\ntemplate<typename T> using V = std::vector<T>;\ntemplate<typename T> using VV = std::vector<std::vector<T>>;\ntemplate<typename T> using VVV = std::vector<std::vector<std::vector<T>>>;\n\ntemplate<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }\ntemplate<class T> inline void print(T x) { std::cout << x << std::endl; }\ntemplate<class T> inline void print_vec(const std::vector<T> &v) { for (int i = 0; i < v.size(); ++i) { if (i != 0) {std::cout << \" \";} std::cout << v[i];} std::cout << \"\\n\"; }\ntemplate<class T> inline bool inside(T y, T x, T H, T W) {return 0 <= y and y < H and 0 <= x and x < W; }\ntemplate<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }\ntemplate<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }\n\nconst int INF = 1L << 30;\nconst double EPS = 1e-9;\nconst std::string YES = \"YES\", Yes = \"Yes\", NO = \"NO\", No = \"No\";\nconst std::vector<int> dy4 = { 0, 1, 0, -1 }, dx4 = { 1, 0, -1, 0 }; // 4近傍（右, 下, 左, 上）\nconst std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };\n\nusing namespace std;\n\nint main() {\n cin.tie(0);\n\tios::sync_with_stdio(false);\n\n\tint N, K;\n\tcin >> N >> K;\n\n\tvector<vector<int>> v(10);\n\tFOR(i, 0, N) {\n\t int C, G;\n\t cin >> C >> G;\n\t G--;\n\t v[G].emplace_back(C);\n\t}\n\n\tmap<int, vector<vector<int>>> memo;\n\tFOR(kind, 0, 10) {\n vector<vector<int>> dp(v[kind].size() + 1, vector<int>(N + 1, -INF));\n\t dp[0][0] = 0;\n FOR(i, 0, v[kind].size()) {\n FOR(j, 0, N) {\n int price = v[kind][i];\n if (dp[i][j] == -INF) {\n continue;\n }\n\n // not use\n dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);\n\n // use\n dp[i + 1][j + 1] = max(dp[i + 1][j + 1], dp[i][j] + price);\n }\n }\n memo[kind] = dp;\n }\n\n vector<vector<int>> dp2(11, vector<int>(N + 1, -INF));\n\tdp2[0][0] = 0;\n\n\tFOR(kind, 0, 10) {\n FOR(i, 0, dp2[0].size()) {\n if (dp2[kind][i] == -INF) {\n continue;\n }\n int num = v[kind].size();\n FOR(j, 0, num + 1) {\n int price = memo[kind][num][j] + max(0, j - 1) * j;\n // use\n dp2[kind + 1][i + j] = max(dp2[kind + 1][i + j], dp2[kind][i] + price);\n }\n }\n }\n\n int ans = 0;\n FOR(i, 0, K + 1) {\n ans = max(ans, dp2[10][i]);\n }\n print(ans);\n\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 32996, "score_of_the_acc": -0.9382, "final_rank": 12 }, { "submission_id": "aoj_0561_3309369", "code_snippet": "#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\nusing namespace std;\nint main() {\n\tint n, k;\n\tcin >> n>>k;\n\tvector<vector<int> > pr(10, vector<int>(n+1,0));\n\tvector<int> ko(10, 0);\n\tfor (int i = 0; i < n; i++) {\n\t\tint c, g; cin >> c >> g;\n\t\tg--;\n\t\tpr[g][ko[g]] = c;\n\t\tko[g]++;\n\t}\n\tfor (int i = 0; i < 10; i++) {\n\t\tsort(pr[i].begin(), pr[i].end());\n\t\treverse(pr[i].begin(), pr[i].end());\n\t}\n\tvector<vector<int> > sum(10,vector<int> (n+1,0));\n\tfor (int i = 0; i <10; i++) {\n\t\tint su = 0;\n\t\tfor (int j = 1; j <= ko[i]; j++) {\n\t\t\tsu += pr[i][j-1];\n\t\t\tsum[i][j] = su + j * (j - 1);\n\t\t}\n\t}\n\tvector<vector<int> > dp(10, vector<int>(n + 1, 0));\n\tdp[0] = sum[0];\n\tfor (int i = 1; i < 10; i++) {\n\t\tfor (int j = 0; j <= k; j++) {\n\t\t\tfor (int kk = j; kk <= k; kk++) {\n\t\t\t\tdp[i][kk] = max(dp[i][kk], dp[i - 1][j] + sum[i][kk - j]);\n\t\t\t}\n\t\t}\n\t}\n\tcout << dp[9][k] << endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3296, "score_of_the_acc": -0.0044, "final_rank": 6 }, { "submission_id": "aoj_0561_3165170", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> P;\n\nint MOD=1e9+7;\nll INF=1e18;\n\nint dx[]={1, -1, 0, 0};\nint dy[]={0, 0, 1, -1};\n\nint main(){\n int n, k; cin>>n>>k;\n vector<int> c(n+10), g(n+10);\n vector<vector<int>> books(20);\n for(int i=0; i<n; i++) {\n cin>>c[i]>>g[i];\n books[g[i]].emplace_back(c[i]);\n }\n\n for(int i=0; i<=10; i++){\n sort(books[i].begin(), books[i].end(), greater<int>());\n }\n \n vector<vector<int>> sum(20, vector<int>(2010, 0));\n for(int i=1; i<=10; i++){\n for(int j=0; j<books[i].size(); j++){\n sum[i][j+1] = sum[i][j] + books[i][j] + j*2;\n }\n }\n\n vector<vector<int>> dp(20, vector<int>(k+10, 0));\n for(int i=1; i<=10; i++){\n for(int j=0; j<=k; j++){\n for(int l=0; j+l<=k; l++){\n dp[i][j+l]=max(dp[i][j+l], dp[i-1][j]+sum[i][l]);\n }\n }\n }\n cout << dp[10][k] << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3300, "score_of_the_acc": -0.0045, "final_rank": 7 }, { "submission_id": "aoj_0561_3164283", "code_snippet": "#include <algorithm>\n#include <iostream>\n#include <vector>\nusing namespace std;\n#define int long long\nsigned main(){\n int N, K;\n cin >> N >> K;\n vector< vector<int> > B(10);\n for(int i = 0; i < N; ++i){\n int c, g;\n cin >> c >> g;\n B[g-1].push_back(c);\n }\n \n vector< vector<int> > DP(10, vector<int>(K+1, 0));\n for(int i = 0; i < 10; ++i){\n if(B[i].empty()) continue;\n sort(B[i].begin(), B[i].end(), greater<>());\n DP[i][1] = B[i][0];\n for(size_t j = 1; j < min(B[i].size(), (size_t)K); ++j){\n DP[i][j+1] = DP[i][j] + B[i][j] + 2*j;\n }\n }\n vector<int> dp(K+1,0);\n for(int i = 0; i < 10; ++i){\n vector<int> dp_ = dp;\n for(int j = 0; j <= K; ++j){\n for(int k = 0; k <= K; ++k){\n if(j+k > K) break;\n dp_[j+k] = max(dp_[j+k], dp[j] + DP[i][k]);\n }\n }\n dp = dp_;\n }\n cout << dp[K] << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 3280, "score_of_the_acc": -0.0039, "final_rank": 3 } ]
aoj_0562_cpp
JOI 国の買い物事情(Shopping in JOI Kingdom) JOI 国には N 個の町があり，それらの間は M 本の双方向に通行可能な道路で結ばれている． K 個の町にはショッピングモールがあり，国民は道路を通ってそれらの町のいずれかに行き買い物をする． 家の場所によっては，買い物に行くために長い距離を移動する必要があり，それは非常に不便である．国王はこの実情を把握するため，ショッピングモールのある町までの最短距離が家の場所によってどれだけ長くなりうるのかを調べることにした．家は道路の途中に建てられることもあるので(入力例1 の説明を参照)，この調査は非常に大変である．そこで国王は，優秀なプログラマーであるあなたに，調査を行うプログラムの作成を依頼した． 課題 道路の情報とショッピングモールのある町の情報が与えられるとき，ショッピングモールのある町からもっとも遠い道路上の点(端点も含む) までの距離を求めるプログラムを作成せよ．町の中を移動するのにかかる距離は無視してよい． 制限 2 ≤ N ≤ 3000     JOI 国の町の個数 1 ≤ M ≤ 100000 = 10 5 JOI 国の道路の本数 1 ≤ K ≤ N ショッピングモールがある町の個数 1 ≤ l i ≤ 1000 i 番目の道路の長さ 入力 標準入力から以下の入力を読み込め． 1 行目には整数 N , M , K が空白区切りで書かれている． N はJOI 国の町の個数を， M はJOI 国の道路の本数を，i>K はショッピングモールがある町の個数をそれぞれ表す．町には1, 2, ..., N の番号がつけられている． 続く M 行は道路の情報を表す． i + 1 行目(1 ≤ i ≤ M ) には整数 a i , b i , l i (1 ≤ a i ≤ N , 1 ≤ b i ≤ N , 1 ≤ l i ≤ 1000) が空白区切りで書かれている．これは， i 本目の道路が町 a i と町 b i を結んでおり，長さが l i であることを表す．道路の両端が同じ町であることはない．また，任意の2 つの町 p , q に対し， p と q を結ぶ道路は2 本以上存在しない．どの町からどの町へもいくつかの道路をたどって行くことができる． 続く K 行はショッピングモールの情報を表す． i + M +1 行目(1 ≤ i ≤ K ) には1 つの整数 s i (1 ≤ s i ≤ N )が書かれている．これは町 s i にショッピングモールがあることを表す． s 1 , ..., s K の中に同じ値が2 回以上現れることはない． 出力 標準出力に，ショッピングモールのある町までの最短距離の最大値の小数点以下を四捨五入した整数1 つを出力せよ． 採点基準 採点用データのうち，配点の40% 分については， K = 1 を満たす． 入出力の例 入力例1 3 3 1 1 2 1 2 3 1 3 1 1 1 出力例1 2 入力例1 は次のような町を表す．道路の長さはすべて1 である．ショッピングモールは町1 にしかない． ショッピングモールのある町までもっとも遠い点は，町2 と町3 を結ぶ道路上の，町2 から距離0.5 の位置にある点であり，ショッピングモールのある町までの距離は1.5 である．よって，それを四捨五入した値である2 を出力する． 入力例2 4 5 2 1 2 4 1 3 1 2 3 2 2 4 2 3 4 1 2 4 出力例2 3 問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0562_10851481", "code_snippet": "#include<iostream>\n#include<functional>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<cmath>\nusing namespace std;\npriority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>Q;\nint n, m, k, a[100000], b[100000], c[100000], r[10000], dist[10000];\nvector<pair<int, int>>x[10000];\nvoid dijkstra() {\n\tfor (int i = 1; i <= n; i++) dist[i] = 999999999;\n\tfor (int i = 0; i < k; i++) { dist[r[i]] = 0; Q.push(make_pair(0, r[i])); }\n\twhile (!Q.empty()) {\n\t\tint a1 = Q.top().first, a2 = Q.top().second; Q.pop();\n\t\tfor (int i = 0; i < x[a2].size(); i++) {\n\t\t\tif (dist[x[a2][i].first] > a1 + x[a2][i].second) {\n\t\t\t\tdist[x[a2][i].first] = a1 + x[a2][i].second;\n\t\t\t\tQ.push(make_pair(dist[x[a2][i].first], x[a2][i].first));\n\t\t\t}\n\t\t}\n\t}\n}\nint main() {\n\tcin >> n >> m >> k;\n\tfor (int i = 0; i < m; i++) {\n\t\tcin >> a[i] >> b[i] >> c[i]; \n\t\tx[a[i]].push_back(make_pair(b[i], c[i]));\n\t\tx[b[i]].push_back(make_pair(a[i], c[i]));\n\t}\n\tfor (int i = 0; i < k; i++)cin >> r[i];\n\tdijkstra();\n\tint maxn = 0;\n\tfor (int i = 0; i < m; i++) {\n\t\tint R1 = min(dist[a[i]], dist[b[i]]);\n\t\tint R2 = (c[i] + abs(dist[a[i]] - dist[b[i]]) + 1) / 2;\n\t\tmaxn = max(maxn, R1 + R2);\n\t}\n\tcout << maxn << endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 7824, "score_of_the_acc": -0.1487, "final_rank": 11 }, { "submission_id": "aoj_0562_9876070", "code_snippet": "#include <iostream>\n#include <vector>\n#include <queue>\n#include <algorithm>\n#include <cmath>\nusing namespace std;\n\n// 定数定義\nconst long long INF = 1e18; // 無限大を表す値\ntypedef pair<long long, int> pii; // (距離, 町の番号)のペア\n\n// 道路を表す構造体\nstruct Road {\n int u; // 町u\n int v; // 町v\n int l; // 道路の長さ\n};\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(0);\n \n int N, M, K;\n cin >> N >> M >> K;\n \n // 隣接リストの作成\n vector<vector<pair<int, int>>> adj(N, vector<pair<int, int>>());\n // 全ての道路を保存するためのベクター\n vector<Road> roads(M);\n \n // M本の道路の情報を入力\n for(int i = 0; i < M; ++i){\n int ai, bi, li;\n cin >> ai >> bi >> li;\n ai--; // 0-indexed に変換\n bi--; // 0-indexed に変換\n roads[i] = Road{ai, bi, li}; // 道路情報を保存\n adj[ai].emplace_back(bi, li); // 隣接リストに追加\n adj[bi].emplace_back(ai, li); // 双方向なので逆も追加\n }\n \n // ショッピングモールがある町のリスト\n vector<int> malls(K);\n for(int i = 0; i < K; ++i){\n cin >> malls[i];\n malls[i]--; // 0-indexed に変換\n }\n \n // 各町への最短距離を格納する配列\n vector<long long> dist(N, INF);\n \n // 優先度付きキュー（最小ヒープ）\n priority_queue<pii, vector<pii>, std::greater<pii>> pq;\n \n // ショッピングモールからの距離を0に設定し、キューに追加\n for(auto &s : malls){\n dist[s] = 0;\n pq.emplace(0, s);\n }\n \n // ダイクストラ法による最短距離の計算\n while(!pq.empty()){\n // 現在の最小距離と町の番号を取得\n pair<long long, int> current = pq.top();\n long long current_dist = current.first;\n int u = current.second;\n pq.pop();\n \n // 既により短い距離が確定している場合はスキップ\n if(current_dist > dist[u]) continue;\n \n // 隣接する町への距離を更新\n for(auto &edge : adj[u]){\n int v = edge.first;\n int w = edge.second;\n if(dist[v] > dist[u] + w){\n dist[v] = dist[u] + w;\n pq.emplace(dist[v], v);\n }\n }\n }\n \n // 各道路上の最短距離の最大値を求める\n double max_distance = 0.0;\n \n for(int i = 0; i < M; ++i){\n int u = roads[i].u;\n int v = roads[i].v;\n int l = roads[i].l;\n // 道路上の最遠点からの最短距離を計算\n double distance = (dist[u] + dist[v] + (long long)l) / 2.0;\n // 最大値を更新\n if(distance > max_distance){\n max_distance = distance;\n }\n }\n \n // 結果を四捨五入して整数にする\n int result = round(max_distance);\n cout << result << \"\\n\";\n \n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 7476, "score_of_the_acc": -0.1018, "final_rank": 9 }, { "submission_id": "aoj_0562_8500951", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\ntemplate<class T>\nbool chmax(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\ntemplate<class T>\nbool chmin(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p > q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n ll N,M,K;\n cin>>N>>M>>K;\n vector<vector<pair<ll,ll>>> G(N);\n rep(i,M){\n ll U,V,W;\n cin>>U>>V>>W;\n U--;V--;\n G[U].push_back({V,W});\n G[V].push_back({U,W});\n }\n priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>> Q;\n vll D(N,1e18);\n vb seen(N,false);\n rep(i,K){\n ll P;\n cin>>P;\n P--;\n D[P]=0;\n Q.push({0,P});\n }\n while(!Q.empty()){\n auto cn=Q.top();\n Q.pop();\n ll c=cn.first;\n ll n=cn.second;\n if(seen[n])continue;\n seen[n]=1;\n for(auto vw:G[n]){\n ll v=vw.first;\n ll w=vw.second;\n if(seen[v])continue;\n if(chmin(D[v],c+w)){\n Q.push({D[v],v});\n }\n }\n }\n ll an=0;\n rep(n,N){\n chmax(an,D[n]);\n for(auto vw:G[n]){\n ll v=vw.first;\n ll w=vw.second;\n ll dv=D[v];\n ll dn=D[n];\n if(dv<dn)swap(dv,dn);\n w-=(dv-dn);\n w=dv+(w+1)/2;\n chmax(an,w);\n }\n }\n cout<<an<<endl;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 9168, "score_of_the_acc": -0.2225, "final_rank": 14 }, { "submission_id": "aoj_0562_7989233", "code_snippet": "#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n\nmt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());\nll myRand(ll B) {\n return (ull)rng() % B;\n}\ninline double time() {\n return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n,m,k; cin >> n >> m >> k;\n vector<vector<pair<int,int>>> g(n);\n for (int i = 0; i < m; ++i) {\n int x,y,z; cin >> x >> y >> z;\n x--; y--;\n g[x].push_back({y, z});\n g[y].push_back({x, z});\n }\n vector<int> d(n, 2e9);\n using P = pair<int,int>;\n priority_queue<P,vector<P>,greater<P>> pq;\n for (int i = 0; i < k; ++i) {\n int x; cin >> x; x--;\n d[x] = 0; pq.push({0, x});\n }\n while (pq.size()) {\n auto p = pq.top(); pq.pop();\n int x = p.second;\n if (d[x] != p.first) continue;\n for (auto to : g[x]) {\n if (d[to.first] > d[x]+to.second) {\n d[to.first] = d[x]+to.second;\n pq.push({d[to.first], to.first});\n }\n }\n }\n int res = 0;\n for (int i = 0; i < n; ++i) {\n for (auto t : g[i]) {\n int j = t.first;\n int mx = max(d[i], d[j]);\n int l = t.second-(max(d[i],d[j]) - min(d[i],d[j]));\n res = max(res, mx+(l+1)/2);\n }\n }\n cout << res << endl;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 6376, "score_of_the_acc": -0.0285, "final_rank": 2 }, { "submission_id": "aoj_0562_7180565", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing i32 = int;\nusing ld = long double;\n\nint main() {\n i32 n, m, k; cin >> n >> m >> k;\n vector G(n + 1, vector(0, pair(0, 0)));\n vector es(m, tuple(0, 0, 0LL));\n for (i32 i = 0 ; i < m ; i++) {\n i32 a, b, l; cin >> a >> b >> l;\n G[a - 1].emplace_back(b - 1, l);\n G[b - 1].emplace_back(a - 1, l);\n es[i] = { a - 1, b - 1, l };\n }\n for (i32 _ = 0 ; _ < k ; _++) {\n i32 s; cin >> s;\n G[n].emplace_back(s - 1, 0);\n }\n const i32 sup = (1 << 30);\n vector ds(n + 1, sup);\n ds[n] = 0;\n priority_queue<pair<i32, i32>, vector<pair<i32, i32>>, greater<pair<i32, i32>>> que;\n que.emplace(0, n);\n while (que.size()) {\n auto [d, v] = que.top();\n que.pop();\n if (d > ds[v]) {\n continue;\n }\n for (auto [x, w] : G[v]) {\n if (ds[x] > d + w) {\n ds[x] = d + w;\n que.emplace(d + w, x);\n }\n }\n }\n i32 ans = *max_element(ds.begin(), ds.end());\n for (auto [a, b, w] : es) {\n if (ds[a] + w == ds[b] or ds[b] + w == ds[a]) {\n continue;\n }\n i32 val = ds[a] + (w + ds[b] - ds[a] + 1) / 2;\n ans = max(ans, val);\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 7720, "score_of_the_acc": -0.1417, "final_rank": 10 }, { "submission_id": "aoj_0562_7180512", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing i32 = int;\nusing ld = long double;\n\nint main() {\n i32 n, m, k; cin >> n >> m >> k;\n vector G(n + 1, vector(0, pair(0, 0)));\n vector es(m, tuple(0, 0, 0LL));\n for (i32 i = 0 ; i < m ; i++) {\n i32 a, b, l; cin >> a >> b >> l;\n G[a - 1].emplace_back(b - 1, l);\n G[b - 1].emplace_back(a - 1, l);\n es[i] = { a - 1, b - 1, l };\n }\n for (i32 _ = 0 ; _ < k ; _++) {\n i32 s; cin >> s;\n G[n].emplace_back(s - 1, 0);\n }\n const i32 sup = (1 << 30);\n vector ds(n + 1, sup);\n ds[n] = 0;\n priority_queue<pair<i32, i32>, vector<pair<i32, i32>>, greater<pair<i32, i32>>> que;\n que.emplace(0, n);\n while (que.size()) {\n auto [d, v] = que.top();\n que.pop();\n if (d > ds[v]) {\n continue;\n }\n for (auto [x, w] : G[v]) {\n if (ds[x] > d + w) {\n ds[x] = d + w;\n que.emplace(d + w, x);\n }\n }\n }\n i32 ans = *max_element(ds.begin(), ds.end());\n for (auto [a, b, w] : es) {\n if (ds[a] + w == ds[b] or ds[b] + w == ds[a]) {\n continue;\n }\n ld l = 0.0l, r = (ld)w;\n for (i32 _ = 0 ; _ < 80 ; _++) {\n ld m = (l + r) / 2.0l;\n if (ds[a] + m > ds[b] + ((ld)w - m)) {\n r = m;\n }\n else {\n l = m;\n }\n }\n ans = max(ans, (i32)round(ds[a] + l));\n }\n cout << ans << endl;\n}", "accuracy": 1, "time_ms": 80, "memory_kb": 7700, "score_of_the_acc": -0.1719, "final_rank": 12 }, { "submission_id": "aoj_0562_6781503", "code_snippet": "#line 1 \"solve/main.cpp\"\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <cstdint>\n#include <cstdlib>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <list>\n#include <map>\n#include <memory>\n#include <numeric>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <type_traits>\n#include <unordered_map>\n#include <utility>\n#include <vector>\n\n/* template start */\n\n#line 2 \"lib/utility/type_alias.hpp\"\n\n#line 4 \"lib/utility/type_alias.hpp\"\n\nusing u64 = std::uint64_t;\nusing u32 = std::uint32_t;\nusing u16 = std::uint16_t;\nusing u8 = std::uint8_t;\n\nusing i64 = std::int64_t;\nusing i32 = std::int32_t;\nusing i16 = std::int16_t;\nusing i8 = std::int8_t;\n\nusing usize = std::size_t;\nusing isize = std::ptrdiff_t;\n\nconstexpr i64 operator\"\" _i64(unsigned long long num) { return i64(num); }\n\nconstexpr u64 operator\"\" _u64(unsigned long long num) { return u64(num); }\n#line 33 \"solve/main.cpp\"\n\n#define rep(i, a, b) for (i64 i = (a); (i) < (b); (i)++)\n#define all(i) i.begin(), i.end()\n\n#ifdef LOCAL\n#define debug(...) \\\n std::cerr << \"LINE: \" << __LINE__ << \" [\" << #__VA_ARGS__ << \"]:\", \\\n debug_out(__VA_ARGS__)\n#else\n#define debug(...)\n#endif\n\nvoid debug_out() { std::cerr << std::endl; }\n\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head h, Tail... t) {\n std::cerr << \" \" << h;\n if (sizeof...(t) > 0) std::cerr << \" :\";\n debug_out(t...);\n}\n\ntemplate <typename T1, typename T2>\nstd::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {\n return os << pa.first << \" \" << pa.second;\n}\n\ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& os, std::vector<T> vec) {\n for (std::size_t i = 0; i < vec.size(); i++)\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \" \");\n return os;\n}\n\ntemplate <typename T1, typename T2>\ninline bool chmax(T1& a, T2 b) {\n return a < b && (a = b, true);\n}\n\ntemplate <typename T1, typename T2>\ninline bool chmin(T1& a, T2 b) {\n return a > b && (a = b, true);\n}\n\ntemplate <typename Num, typename Func = std::multiplies<Num>>\nconstexpr Num mypow(Num a, u64 b, Num id = 1, Func mul = Func()) {\n if (b == 0) return id;\n Num x = id;\n while (b > 0) {\n if (b & 1) x = mul(x, a);\n a = mul(a, a);\n b >>= 1;\n }\n return x;\n}\n\n/* template end */\n\nusing P = std::pair<i64,i64>;\n\nint main() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n\n i64 n,m,k;\n std::cin>>n>>m>>k;\n\n std::vector<std::vector<P>> graph(n);\n\n rep(i,0,m){\n i64 a,b,l;\n std::cin>>a>>b>>l;\n a--;b--;\n graph[a].emplace_back(b,l);\n graph[b].emplace_back(a,l);\n }\n\n constexpr i64 INF = 1e15;\n\n std::vector<i64> dist(n,INF);\n std::priority_queue<P,std::vector<P>,std::greater<P>> pq;\n\n rep(i,0,k){\n i64 a;\n std::cin>>a;\n a--;\n dist[a] = 0;\n pq.emplace(0,a);\n }\n\n while (!pq.empty()){\n auto [d,now] = pq.top();pq.pop();\n\n if(d > dist[now])continue;\n\n for(const auto& [next,cost]:graph[now]){\n if(dist[next] > dist[now] + cost){\n dist[next] = dist[now] + cost;\n pq.emplace(dist[next],next);\n }\n }\n }\n\n debug(dist);\n\n i64 ans = 0;\n rep(i,0,n){\n chmax(ans,dist[i]);\n for(const auto& [next,cost]: graph[i]){\n auto [a,b] = P(dist[i],dist[next]);\n if(a<b)std::swap(a,b);\n\n if(a >= b+cost)\n chmax(ans,b+cost);\n else{\n if((a+b+cost) % 2 == 0)\n chmax(ans,(a+b+cost)/2);\n else\n chmax(ans,(a+b+cost+1)/2);\n }\n }\n }\n\n std::cout<<ans<<\"\\n\";\n \n\n return 0;\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 8992, "score_of_the_acc": -0.2029, "final_rank": 13 }, { "submission_id": "aoj_0562_6291372", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\ntypedef long long ll;\n//typedef int ll;\ntypedef pair<ll, ll> P;\nconst long long INF = 1e17;\ntemplate <typename T>\nvoid input_arr(vector<T>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i];\n\t}\n}\ntemplate <typename T, typename Q>\nvoid input_arr(vector<pair<T, Q>>& A, ll N) {\n\tfor (ll i = 0; i < N; i++) {\n\t\tcin >> A[i].first >> A[i].second;\n\t}\n}\ntemplate <typename T>\nvoid input_arr(vector<vector<T>>& A, ll H, ll W) {\n\tfor (ll i = 0; i < H; i++) {\n\t\tfor (ll j = 0; j < W; j++) {\n\t\t\tcin >> A[i][j];\n\t\t}\n\t}\n}\ntemplate<typename T = ll>\nstruct Edge {\n ll from, to; T cost;\n Edge (ll from, ll to, T cost = 1) : from(from), to(to), cost(cost) {}\n};\ntemplate<typename T = ll>\nstruct Graph {\n vector<vector<Edge<T>>> G;\n Graph() = default;\n explicit Graph(ll N) : G(N) {}\n size_t size() const {\n return G.size();\n }\n void add_edge(ll from, ll to, T cost = 1, bool direct = false) {\n G[from].emplace_back(from, to, cost);\n if (!direct) G[to].emplace_back(to, from, cost);\n }\n void read(ll M, ll padding = -1, bool weight = false, bool direct = false) {\n for (ll i = 0; i < M; i++) {\n ll a, b; cin >> a >> b;\n a += padding;\n b += padding;\n T c = T(1);\n if (weight) cin >> c;\n add_edge(a, b, c, direct);\n }\n }\n vector<Edge<T>> &operator[](const int &k) {\n return G[k];\n }\n};\nvoid dijkstra(const Graph<long long>& G, int s, vector<long long>& dis) {\n int N = G.size();\n priority_queue<P, vector<P>, greater<P>> pq;\n dis[s] = 0;\n pq.emplace(dis[s], s);\n while (!pq.empty()) {\n P p = pq.top();\n pq.pop();\n int v = p.second;\n if (dis[v] < p.first) {\n continue;\n }\n for (auto& e : G.G[v]) {\n if (dis[e.to] > dis[v] + e.cost) {\n dis[e.to] = dis[v] + e.cost;\n pq.emplace(dis[e.to], e.to);\n }\n }\n }\n}\nvoid solve() {\n ll N, M, K; cin >> N >> M >> K;\n Graph<ll> G(N);\n vector<P>edge(M);\n vector<ll>wei(M);\n for (ll i = 0; i < M; i++) {\n ll u, v, c; cin >> u >> v >> c;\n u--; v--;\n G.add_edge(u, v, c, false);\n edge[i] = {u, v};\n wei[i] = c;\n } \n vector<ll>dist(N, INF);\n for (ll i = 0; i < K; i++) {\n ll s; cin >> s; s--;\n dijkstra(G, s, dist);\n } \n ll ans = 0;\n for (ll i = 0; i < N; i++) {\n ans = max(ans, dist[i]);\n }\n for (ll i = 0; i < M; i++) {\n if (abs(dist[edge[i].first] - dist[edge[i].second]) >= wei[i]) continue;\n ans = max(ans, (dist[edge[i].first] + dist[edge[i].second] + wei[i] + 1) / 2);\n }\n cout << ans << endl;\n}\nint main() {\n ll T=1; //cin >> T;\n while (T--) solve();\n}", "accuracy": 1, "time_ms": 140, "memory_kb": 14276, "score_of_the_acc": -0.6574, "final_rank": 18 }, { "submission_id": "aoj_0562_6093630", "code_snippet": "#include <bits/stdc++.h>\n#define all(v) v.begin(), v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)\n#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)\n#define codefor int test;scanf(\"%d\",&test);while(test--)\n#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)\n#define yes(ans) if(ans)printf(\"yes\\n\");else printf(\"no\\n\")\n#define Yes(ans) if(ans)printf(\"Yes\\n\");else printf(\"No\\n\")\n#define YES(ans) if(ans)printf(\"YES\\n\");else printf(\"NO\\n\")\n#define popcount(v) __builtin_popcount(v)\n#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))\n#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))\nusing namespace std;\nusing ll = long long;\ntemplate<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;\nconst int MOD=1000000007;\nconst int MOD2=998244353;\nconst int INF=1<<30;\nconst ll INF2=1LL<<60;\nvoid scan(int& a){scanf(\"%d\",&a);}\nvoid scan(long long& a){scanf(\"%lld\",&a);}\ntemplate<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}\ntemplate<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}\ntemplate<class T, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i);}\ntemplate<class T> void scan(T& a){cin>>a;}\ntemplate<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}\nvoid in(){}\ntemplate <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}\nvoid print(const int& a){printf(\"%d\",a);}\nvoid print(const long long& a){printf(\"%lld\",a);}\nvoid print(const double& a){printf(\"%.15lf\",a);}\ntemplate<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}\ntemplate<class T> void print(const T& a){cout<<a;}\ntemplate<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}\nvoid out(){putchar('\\n');}\ntemplate<class T> void out(const T& t){print(t);putchar('\\n');}\ntemplate <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}\ntemplate<class T> void dprint(const T& a){cerr<<a;}\ntemplate<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<\" \"<<*it;}}\nvoid debug(){cerr<<endl;}\ntemplate<class T> void debug(const T& t){dprint(t);cerr<<endl;}\ntemplate <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<\" \";debug(tail...);}\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\nll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}\nll updivide(ll a,ll b){return (a+b-1)/b;}\ntemplate<class T> void chmax(T &a,const T b){if(b>a)a=b;}\ntemplate<class T> void chmin(T &a,const T b){if(b<a)a=b;}\n\nint main(){\n INT(n,m,k);\n vector<vector<pair<int,int>>> g(n);\n int u,v,c;\n rep(i,m){\n in(u,v,c);\n g[--u].emplace_back(--v,c);\n g[v].emplace_back(u,c);\n }\n vector<int> dist(n,INF);\n rpriority_queue<pair<int,int>> pq;\n rep(i,k){\n in(v);\n dist[--v]=0;\n pq.push({0,v});\n }\n while(!pq.empty()){\n tie(c,v)=pq.top();\n pq.pop();\n for(auto p:g[v]){\n if(c+p.second>=dist[p.first])continue;\n dist[p.first]=c+p.second;\n pq.push({c+p.second,p.first});\n }\n }\n int ans=0;\n for(v=0;v<n;v++){\n chmax(ans,dist[v]);\n for(auto p:g[v]){\n if(dist[p.first]<dist[v])continue;\n chmax(ans,dist[p.first]+(int)updivide(p.second-(dist[p.first]-dist[v]),2));\n }\n }\n out(ans);\n}", "accuracy": 1, "time_ms": 10, "memory_kb": 6548, "score_of_the_acc": -0.04, "final_rank": 6 }, { "submission_id": "aoj_0562_5191511", "code_snippet": "#include<bits/stdc++.h>\n#define int long long\n#define for1(i, n) for(int i = 1; i <= (n);i++)\n#define mp make_pair\n#define puts(x) cout << (x) << \"\\n\"\nusing namespace std;\nint input() {\n\tint r; cin >> r; //scanf(\"%lld\", &r); \n\treturn r;\n}\nint n, m, k, cost[3340], a[123456], b[123456], l[123456];\nvector<pair<int, int>> graph[3340];\npriority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>pq;\nsigned main() {\n\tcin >> n >> m >> k;\n\tfor1(i, m) {\n\t\tcin >> a[i] >> b[i] >> l[i];\n\t\tgraph[a[i]].push_back(mp(b[i], l[i]));\n\t\tgraph[b[i]].push_back(mp(a[i], l[i]));\n\t}\n\tfor1(i, n) cost[i] = m * 1010;\n\twhile (k--) {\n\t\tint c1[3340];\n\t\tfor1(i, n) c1[i] = m * 1010;\n\t\tpq.push(mp(0, input()));\n\t\twhile (pq.size()) {\n\t\t\tint cost1 = pq.top().first, x1 = pq.top().second;\n\t\t\tpq.pop();\n\t\t\tif (cost1 > c1[x1])continue;\n\t\t\tc1[x1] = cost1;\n\t\t\tfor (pair<int, int>p1 : graph[x1]) {\n\t\t\t\tif (cost[p1.first] > cost1 + p1.second) {\n\t\t\t\t\tcost[p1.first] = cost1 + p1.second;\n\t\t\t\t\tpq.push(mp(cost[p1.first], p1.first));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tfor1(i, n) cost[i] = min(cost[i], c1[i]);\n\t}\n\tint ans = 0;\n\tfor1(i, m) {\n\t\tint p = cost[a[i]], q = cost[b[i]];\n\t\tif (p > q)swap(p, q);\n\t\tans = max(ans, (l[i] - q + p + 1) / 2 + q);\n\t}puts(ans);\n}", "accuracy": 1, "time_ms": 160, "memory_kb": 11080, "score_of_the_acc": -0.4602, "final_rank": 17 }, { "submission_id": "aoj_0562_4819391", "code_snippet": "#include <queue>\n#include <vector>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\nconst int inf = 1012345678;\nstruct edge {\n\tint to, cost;\n};\nstruct state {\n\tint pos, cost;\n\tbool operator<(const state& s) const {\n\t\treturn cost > s.cost;\n\t}\n};\nint main() {\n\tint N, M, K;\n\tcin >> N >> M >> K;\n\tvector<vector<edge> > G(N);\n\tfor (int i = 0; i < M; ++i) {\n\t\tint a, b, c;\n\t\tcin >> a >> b >> c; --a, --b;\n\t\tG[a].push_back(edge{ b, c });\n\t\tG[b].push_back(edge{ a, c });\n\t}\n\tvector<int> dist(N, inf);\n\tpriority_queue<state> que;\n\tfor (int i = 0; i < K; ++i) {\n\t\tint x;\n\t\tcin >> x; --x;\n\t\tdist[x] = 0;\n\t\tque.push(state{ x, 0 });\n\t}\n\tvector<bool> vis(N, false);\n\twhile (!que.empty()) {\n\t\tint u = que.top().pos; que.pop();\n\t\tif (vis[u]) continue;\n\t\tfor (edge e : G[u]) {\n\t\t\tif (dist[e.to] > dist[u] + e.cost) {\n\t\t\t\tdist[e.to] = dist[u] + e.cost;\n\t\t\t\tque.push(state{ e.to, dist[e.to] });\n\t\t\t}\n\t\t}\n\t}\n\tint ans = 0;\n\tfor (int i = 0; i < N; ++i) {\n\t\tfor (edge e : G[i]) {\n\t\t\tans = max(ans, dist[i] + dist[e.to] + e.cost);\n\t\t}\n\t}\n\tcout << (ans + 1) / 2 << endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 5964, "score_of_the_acc": -0.0326, "final_rank": 4 }, { "submission_id": "aoj_0562_4818891", "code_snippet": "#include<bits/stdc++.h>\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#define rep(i, x) for(ll i = 0; i < x; i++)\n#define rep2(i, x) for(ll i = 1; i <= x; i++)\n#define all(a) (a).begin(),(a).end()\nusing ll = long long;\nusing ld = long double;\nusing namespace std;\nconst ll INF = 1000000000000000000;\nconst ll mod = 1000000007;\nconst ld pi = 3.141592653589793238;\n\nstruct edge { ll to, cost; };\ntypedef pair<ll, ll>P; //firstは最短距離、secondは頂点番号\nll d[213456];//始点sから終点tまでのコストd[t]\nvector<edge> G[213456];//コスト\nvoid dijkstra(vector<ll> s) {\n\t//greater<P>を指定→firstが小さい順\n\tpriority_queue<P, vector<P>, greater<P> >que;\n\tfill(d, d + 213456, INF);//←TLE気を付ける\n\trep(i, s.size()) {\n\t\td[s[i]] = 0; que.push(P(0, s[i]));\n\t}\n\twhile (!que.empty()) {\n\t\tP p = que.top(); que.pop();\n\t\tint v = p.second;\n\t\tif (d[v] < p.first) { continue; }\n\t\tfor (int i = 0; i < G[v].size(); i++) {\n\t\t\tedge e = G[v][i];\n\t\t\tif (d[e.to] > d[v] + e.cost) {\n\t\t\t\td[e.to] = d[v] + e.cost;\n\t\t\t\tque.push(P(d[e.to], e.to));\n\t\t\t}\n\t\t}\n\t}\n}\n\nsigned main() {\n\tios::sync_with_stdio(false);\n\tstd::cin.tie(nullptr);\n\t\n\tll n, m, k; cin >> n >> m >> k;\n\tvector<vector<ll>> hen(m, vector<ll>(3));\n\trep(i, m) {\n\t\tll a, b, l; cin >> a >> b >> l;\n\t\tG[a].push_back({ b, l }); G[b].push_back({ a, l });\n\t\then[i][0] = a; hen[i][1] = b; hen[i][2] = l;\n\t}\n\n\tvector<ll> super(k);\n\trep(i, k) {\n\t\tcin >> super[i];\n\t}\n\tdijkstra(super);\n\n\tll ans = 0;\n\trep(i, m) {\n\t\tll mi = min(d[hen[i][0]], d[hen[i][1]]);\n\t\tll ma = max(d[hen[i][0]], d[hen[i][1]]);\n\t\t//cout << ma << ' ' << mi << endl;\n\t\then[i][2] -= (ma - mi);\n\t\tans = max(ans, ma + ((hen[i][2] + 1) / 2));\n\t}\n\tcout << ans << endl;\n\treturn 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 20952, "score_of_the_acc": -1.0079, "final_rank": 20 }, { "submission_id": "aoj_0562_4810389", "code_snippet": "#include <bits/stdc++.h>\n#pragma GCC optimize(\"Ofast\")\nconst double pi = 3.141592653589793238462643383279;\nusing namespace std;\n//typedef\n//------------------------------------------\ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\ntypedef long long LL;\ntypedef unsigned long long ULL;\ntypedef vector<LL> VLL;\ntypedef vector<VLL> VVLL;\n \n \n//container util\n//------------------------------------------\n#define ALL(a) (a).begin(),(a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define PB push_back\n#define MP make_pair\n#define SZ(a) int((a).size())\n#define SQ(a) ((a)*(a))\n#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)\n#define EXIST(s,e) ((s).find(e)!=(s).end())\n#define SORT(c) sort((c).begin(),(c).end())\n \n \n//repetition\n//------------------------------------------\n#define FOR(i,s,n) for(int i=s;i<(int)n;++i)\n#define REP(i,n) FOR(i,0,n)\n#define MOD 1000000007\n \n \n#define rep(i, a, b) for(int i = a; i < (b); ++i)\n#define trav(a, x) for(auto& a : x)\n#define all(x) x.begin(), x.end()\n#define sz(x) (int)(x).size()\n \ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\nconst double EPS = 1E-10;\n \n#define chmin(x,y) x=min(x,y)\n#define chmax(x,y) x=max(x,y)\n\n#define INF (1LL<<61)\n\n//ここから編集\nvector<vector<pair<int, int>>> g(3010);\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n \n int N, M, K; cin >> N >> M >> K;\n\n REP(i,M){\n int a, b, l;\n cin >> a >> b >> l;\n a--; b--;\n g[a].emplace_back(b, l);\n g[b].emplace_back(a, l);\n }\n vector<int> s(K);\n vector<int> dist(N, INT_MAX);\n map<int, int> mp;\n priority_queue<PII, vector<PII>, greater<PII>> pq;\n\n REP(i,K){\n cin >> s[i];\n s[i]--;\n dist[s[i]] = 0;\n pq.push({0, s[i]});\n }\n\n \n\n while(pq.size()){\n auto p = pq.top();\n pq.pop();\n\n int cost = p.first;\n int v = p.second;\n if(dist[v] < cost) continue;\n\n for(auto e: g[v]){\n int u = e.first;\n int cc = e.second;\n if(dist[u] > dist[v] + cc){\n dist[u] = dist[v] + cc;\n pq.push({dist[u], u});\n }\n }\n }\n\n int mx = 0;\n for(int i=0; i<N; i++){\n mx = max(mx, dist[i]);\n }\n\n vector<int> pos;\n for(int i=0; i<N; i++){\n if(mx == dist[i]) pos.push_back(i);\n }\n\n int ans = mx;\n for(int p=0; p<N; p++){\n int v = p;\n for(int i=0; i<g[p].size(); i++){\n \n int u = g[p][i].first;\n if(dist[v] < dist[u]) continue;\n if(dist[u] == dist[v]){\n ans = max(ans, min(dist[u] + (int)round( (double)g[p][i].second/2.0), dist[v] + (int)round( (double)g[p][i].second/2.0)));\n continue;\n }\n\n double t = 0;\n /* v -> u */\n while(t <= g[p][i].second){\n if(dist[v] > dist[u]){\n ans = max(ans, min(dist[u] + (int)round(t), dist[v] + (int)round( (double)g[p][i].second - t)));\n t += 0.5;\n }\n \n }\n }\n }\n cout << ans << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 1280, "memory_kb": 6020, "score_of_the_acc": -1.0048, "final_rank": 19 }, { "submission_id": "aoj_0562_4532434", "code_snippet": "#include <algorithm>\n#include <cmath>\n#include <cstdint>\n#include <cstdio>\n#include <iomanip>\n#include <iostream>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <vector>\nusing namespace std;\n#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)\n#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)\n#define All(v) (v).begin(), (v).end()\n#define pb push_back\n#define MP(a, b) make_pair((a), (b))\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\nconst int INF = 1 << 30;\nconst ll LINF = 1LL << 60;\nconst int MOD = 1e9 + 7;\n\nstruct edge {\n edge(int t, ll c) : to(t), cost(c) {}\n int to;\n ll cost;\n};\n\nvoid dijkstra(int s, vector<ll> &d, vector<vector<edge>> &G) {\n priority_queue<pll, vector<pll>, greater<pll>> que;\n fill(All(d), LINF);\n d[s] = 0;\n que.push(make_pair(0, s));\n\n while(!que.empty()) {\n pll p = que.top();\n que.pop();\n int v = p.second;\n if(d[v] < p.first)\n continue;\n for(auto e : G[v]) {\n if(d[e.to] > d[v] + e.cost) {\n d[e.to] = d[v] + e.cost;\n que.push(make_pair(d[e.to], e.to));\n }\n }\n }\n}\n\nint main() {\n int N, M, K;\n cin >> N >> M >> K;\n vector<vector<edge>> G(N + 1, vector<edge>());\n vector<pair<pii, int>> edges(M);\n rep(i, M) {\n ll a, b, c;\n cin >> a >> b >> c;\n a--, b--;\n G[a].push_back(edge(b, c));\n G[b].push_back(edge(a, c));\n edges[i] = MP(MP(a, b), c);\n }\n\n rep(i, K) {\n int k;\n cin >> k;\n k--;\n G[N].push_back(edge(k, 0));\n }\n vector<ll> dist(N + 1);\n dijkstra(N, dist, G);\n ll res = 0;\n rep(i, N) { res = max(res, dist[i]); }\n rep(i, M) {\n int a = edges[i].first.first;\n int b = edges[i].first.second;\n ll c = edges[i].second;\n res = max(res, (dist[a] + dist[b] + c + 1) / 2);\n }\n cout << res << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 9896, "score_of_the_acc": -0.2946, "final_rank": 15 }, { "submission_id": "aoj_0562_4487955", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(int i=0; i<(n); i++)\nusing ll = long long;\nusing P = pair<int,int>;\n#define int long long\nstruct Edge{\n int u,v,cost;\n};\nvector<P> graph[110000];\nint dist[110000];\nint dist2[110000];\nconst int INF = 1001001001001LL;\nsigned main()\n{\n int n,m,k;cin >> n >> m >> k;\n rep(i,m){\n int a,b,l;cin >> a >> b >> l;\n a--;b--;\n graph[a].push_back(P(b,l));\n graph[b].push_back(P(a,l));\n }\n priority_queue<P,vector<P>,greater<P>> q;\n rep(i,110000){\n dist[i] = INF;\n dist2[i] = INF;\n }\n rep(i,k){\n int s;cin >> s;\n s--;\n dist[s] = 0;\n dist2[s] = 0;\n q.emplace(0,s);\n }\n \n while(q.size()){\n auto p = q.top();q.pop();\n int v = p.second,d = p.first;\n if(dist2[v] < d)continue;\n for(auto next:graph[v]){\n int d2 = d+next.second;\n if(dist[next.first] > d2){\n swap(dist[next.first],d2);\n q.push(P(dist[next.first],next.first));\n }\n if(dist2[next.first] > d2 && dist[next.first] < d2){\n dist2[next.first] = d2;\n q.push(P(dist2[next.first],next.first));\n }\n\n \n }\n }\n\n int ans = 0;\n rep(i,n)rep(j,graph[i].size()){\n auto hoge = graph[i][j];\n int res = (dist[i] + dist[hoge.first]+1 + hoge.second)/2;\n ans = max(ans,res);\n\n }\n cout << ans << endl;\n\n\n\n\n return 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 10196, "score_of_the_acc": -0.3146, "final_rank": 16 }, { "submission_id": "aoj_0562_4405640", "code_snippet": "// #define _GLIBCXX_DEBUG // for STL debug (optional)\n#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <string>\n#include <cstring>\n#include <deque>\n#include <list>\n#include <queue>\n#include <stack>\n#include <vector>\n#include <utility>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <complex>\n#include <cmath>\n#include <limits>\n#include <cfloat>\n#include <climits>\n#include <ctime>\n#include <cassert>\n#include <numeric>\n#include <fstream>\n#include <functional>\n#include <bitset>\nusing namespace std;\nusing ll = long long int;\nusing int64 = long long int;\n \ntemplate<typename T> void chmax(T &a, T b) {a = max(a, b);}\ntemplate<typename T> void chmin(T &a, T b) {a = min(a, b);}\ntemplate<typename T> void chadd(T &a, T b) {a = a + b;}\n \nint dx[] = {0, 0, 1, -1};\nint dy[] = {1, -1, 0, 0};\nconst int INF = 1LL << 29;\nconst ll LONGINF = 1LL << 60;\nconst ll MOD = 1000000007LL;\n\nstruct Elem {\n int cur; ll cost;\n Elem() {}\n Elem(int cur_, ll cost_) : cur(cur_), cost(cost_) {}\n bool operator<(const Elem &e) const {\n return cost > e.cost;\n }\n};\n\nll dist[110010];\nint main() {\n int N, M, K; scanf(\"%d%d%d\", &N, &M, &K);\n\n int V = N;\n vector< vector< pair<int, int> > > G(V);\n for(int i=0; i<M; i++) {\n int u, v, c; scanf(\"%d%d%d\", &u, &v, &c);\n u--; v--;\n G[u].emplace_back(v, c);\n G[v].emplace_back(u, c);\n }\n\n fill(dist, dist + V, LONGINF);\n priority_queue<Elem> que;\n for(int i=0; i<K; i++) {\n int v; scanf(\"%d\", &v);\n v--;\n dist[v] = 0;\n que.emplace(v, 0);\n }\n\n while(que.size()) {\n Elem elem = que.top(); que.pop();\n int cur = elem.cur; ll cost = elem.cost;\n if(dist[cur] < cost) continue;\n for(auto e : G[cur]) {\n int to, d; tie(to, d) = e;\n if(dist[to] > cost + d) {\n dist[to] = cost + d;\n que.emplace(to, dist[to]);\n }\n }\n }\n\n ll ans = 0;\n for(int i=0; i<V; i++) {\n chmax(ans, dist[i]);\n for(auto e : G[i]) {\n int cur = i, to = e.first, d = e.second;\n ll x = (dist[to] - dist[cur] + d + 1) / 2;\n chmax(ans, dist[cur] + x);\n }\n }\n printf(\"%lld\\n\", ans);\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 6000, "score_of_the_acc": -0.0113, "final_rank": 1 }, { "submission_id": "aoj_0562_4405462", "code_snippet": "#include<bits/stdc++.h>\n#define enld '\\n'\n#define rep(i,n) for(int i=0; i<(n); i++)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"Ofast\")\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\nconstexpr ll mod = 1000000007;\nconstexpr ll mod2 = 998244353;\nconst double PI = 3.1415926535897932384626433832795028841971;\nconst int dx[6] = {1, 0, -1, 0,1,1};\nconst int dy[6] = {0, 1, 0, -1,1,-1};\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n// ---------------------------------------------------------------------------\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N,M,K;\n cin >> N >> M >> K;\n vector<int> l(M),r(M),c(M);\n vector<vector<P>> G(N);\n for(int i=0; i<M; i++){\n cin >> l[i] >> r[i] >> c[i];\n l[i]--;r[i]--;\n G[l[i]].emplace_back(r[i],c[i]);\n G[r[i]].emplace_back(l[i],c[i]);\n }\n priority_queue<P,vector<P>,greater<P>> que;\n vector<int> dist(N,inf);\n for(int i=0; i<K; i++){\n int a;\n cin >> a;\n a--;\n dist[a] = 0;\n que.emplace(0,a);\n }\n while(que.size()){\n int v = que.top().second;\n int cost = que.top().first;\n que.pop();\n if(cost > dist[v]) continue;\n for(auto nv: G[v]){\n if(nv.second + cost < dist[nv.first]){\n dist[nv.first] = nv.second + cost;\n que.emplace(dist[nv.first],nv.first); \n }\n }\n }\n // for(int i=0; i<N; i++){\n // cout << dist[i] << enld;\n // }\n int ans = 0;\n for(int i=0; i<N; i++){\n chmax(ans,dist[i]);\n for(auto nv: G[i]){\n int v = nv.first;\n int t = (dist[v]+dist[i]+nv.second+1)/2;\n chmax(ans,t);\n }\n }\n cout << ans << enld;\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 7152, "score_of_the_acc": -0.0881, "final_rank": 7 }, { "submission_id": "aoj_0562_4405158", "code_snippet": "#include<bits/stdc++.h>\n#define enld '\\n'\n#define rep(i,n) for(int i=0; i<(n); i++)\nusing namespace std;\nusing ll = long long;\nusing P = pair<int,int>;\n#pragma GCC target(\"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native\")\n#pragma GCC optimize(\"Ofast\")\nconstexpr ll INF = 1e18;\nconstexpr int inf = 1e9;\nconstexpr ll mod = 1000000007;\nconstexpr ll mod2 = 998244353;\nconst double PI = 3.1415926535897932384626433832795028841971;\nconst int dx[6] = {1, 0, -1, 0,1,1};\nconst int dy[6] = {0, 1, 0, -1,1,-1};\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n// ---------------------------------------------------------------------------\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int N,M,K;\n cin >> N >> M >> K;\n vector<int> l(M),r(M),c(M);\n vector<vector<P>> G(N);\n for(int i=0; i<M; i++){\n cin >> l[i] >> r[i] >> c[i];\n l[i]--;r[i]--;\n G[l[i]].emplace_back(r[i],c[i]);\n G[r[i]].emplace_back(l[i],c[i]);\n }\n priority_queue<P,vector<P>,greater<P>> que;\n vector<int> dist(N,inf);\n for(int i=0; i<K; i++){\n int a;\n cin >> a;\n a--;\n dist[a] = 0;\n que.emplace(0,a);\n }\n while(que.size()){\n int v = que.top().second;\n int cost = que.top().first;\n que.pop();\n if(cost > dist[v]) continue;\n for(auto nv: G[v]){\n if(nv.second + cost < dist[nv.first]){\n dist[nv.first] = nv.second + cost;\n que.emplace(dist[nv.first],nv.first); \n }\n }\n }\n // for(int i=0; i<N; i++){\n // cout << dist[i] << enld;\n // }\n int ans = 0;\n for(int i=0; i<N; i++){\n chmax(ans,dist[i]);\n for(auto nv: G[i]){\n int v = nv.first;\n int t = dist[i]+(dist[v]-dist[i]+nv.second+1)/2;\n chmax(ans,t);\n }\n }\n cout << ans << enld;\n return 0;\n}", "accuracy": 1, "time_ms": 20, "memory_kb": 7232, "score_of_the_acc": -0.0935, "final_rank": 8 }, { "submission_id": "aoj_0562_4404861", "code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\n\nstruct edge{\n int len;\n int to;\n edge(){}\n edge(int len,int to):len(len),to(to){}\n};\n\nint main() {\n using graph = vector<vector<edge>>;\n\n int n,m,k;\n cin>>n>>m>>k;\n\n graph G(n);\n for(int i = 0;i < m;++i) {\n int a,b,l;\n cin>>a>>b>>l;\n --a;--b;\n G[a].emplace_back(l,b);\n G[b].emplace_back(l,a);\n }\n\n priority_queue<pair<int,int>> pq;\n vector<int> mdist(n,300000000);\n\n for(int i = 0;i < k;++i) {\n int a;\n cin>>a;\n --a;\n pq.emplace(0,a);\n mdist[a]=0;\n }\n\n\n while(!pq.empty()) {\n auto t=pq.top();\n pq.pop();\n int tl=-t.first;\n int tv=t.second;\n\n for(auto px:G[tv]) {\n int ndist=tl+px.len;\n if(mdist[px.to]<ndist)continue;\n mdist[px.to]=ndist;\n pq.emplace(-ndist,px.to);\n }\n }\n\n int ld=0;\n for(int i = 0;i < n;++i) {\n//cerr<<mdist[i]<<endl;\n ld=max(ld,mdist[i]);\n }\n\n for(int i = 0;i < n;++i) {\n for(auto e:G[i]) {\n //if(abs(mdist[i]-mdist[e.to])==e.len)continue;\n\n int a=mdist[i];\n int b=mdist[e.to];\n int l=e.len;\n\n if(a<b)swap(a,b);\n int td=b+l-a;\n td=(td+1)/2;\n ld=max(ld,td+a);\n }\n }\n cout<<ld<<endl;\n return 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 5948, "score_of_the_acc": -0.0315, "final_rank": 3 }, { "submission_id": "aoj_0562_4404675", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <queue>\n#include <utility>\nusing namespace std;\ntypedef pair<int, int> pii;\nconst int inf = 1e9;\nconst double EPS = 1e-8;\n\nint main(){\n int n,m,k;\n cin >> n >> m >> k;\n vector<vector<pii>> adj(n);\n for(int i=0; i<m; i++){\n int a,b,c;\n cin >> a >> b >> c;\n a--; b--;\n adj[a].emplace_back(b, c);\n adj[b].emplace_back(a, c);\n }\n vector<int> s(k);\n for(int i=0; i<k; i++){\n cin >> s[i];\n s[i]--;\n }\n\n priority_queue<pii> wait;\n vector<int> mincost(n, inf);\n for(int i: s){\n mincost[i] = 0;\n wait.push(pii(0, i));\n }\n while(!wait.empty()){\n int cost = -wait.top().first;\n int pos = wait.top().second;\n wait.pop();\n if(cost > mincost[pos]) continue;\n for(auto next: adj[pos]){\n int npos = next.first;\n int ncost = next.second +cost;\n if(ncost < mincost[npos]){\n mincost[npos] = ncost;\n wait.push(pii(-ncost, npos));\n }\n }\n }\n int ans = 0;\n for(int i=0; i<n; i++){\n for(auto p: adj[i]){\n int j = p.first;\n int d = p.second;\n int diff = abs(mincost[i] -mincost[j]);\n if(diff == d){\n ans = max(ans, max(mincost[i], mincost[j]));\n }else{\n ans = max(ans, max(mincost[i], mincost[j]) +(d-diff+1)/2);\n }\n }\n }\n cout << ans << endl;\n return 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 5972, "score_of_the_acc": -0.0331, "final_rank": 5 } ]
aoj_0568_cpp
パスタ (Pasta) 問題 あなたはパスタが大好物であり，毎日，晩御飯にパスタを作って食べている．あなたはトマトソース，クリームソース，バジルソースの 3 種類のパスタを作ることができる． N 日間の晩御飯の予定を考えることにした．それぞれの日に 3 種類のパスタから 1 種類を選ぶ．ただし，同じパスタが続くと飽きてしまうので，3 日以上連続して同じパスタを選んではいけない．また，N 日のうちの K 日分のパスタはすでに決めてある． 入力として N の値と，K 日分のパスタの情報が与えられたとき，条件をみたす予定が何通りあるかを 10000 で割った余りを求めるプログラムを作成せよ． 入力 入力は K + 1 行からなる． 1 行目には 2 つの整数 N, K (3 ≦ N ≦ 100，1 ≦ K ≦ N) が空白を区切りとして書かれている． 1 + i 行目 (1 ≦ i ≦ K) には 2 つの整数 A i , B i (1 ≦ A i ≦ N，1 ≦ B i ≦ 3) が空白を区切りとして書かれている．これは，A i 日目のパスタはすでに決まっており，B i = 1 のときはトマトソースであり，B i = 2 のときはクリームソースであり，B i = 3 のときはバジルソースであることを表す．A i (1 ≦ i ≦ K) は全て異なる．与えられる入力データにおいて，条件をみたす予定は 1 通り以上あることが保証されている． 出力 条件をみたす予定が何通りあるかを 10000 で割った余りを 1 行で出力せよ． 入出力例 入力例 1 5 3 3 1 1 1 4 2 出力例 1 6 入出力例 1 において，あなたは 5 日間の予定を考える．1 日目と 3 日目はトマトソースであり，4 日目はクリームソースである．また，3 日以上連続して同じパスタを選んではいけない．これらの条件をみたす予定は 6 通りある． 1日目 2日目 3日目 4日目 5日目 予定 1 1 2 1 2 1 予定 2 1 2 1 2 2 予定 3 1 2 1 2 3 予定 4 1 3 1 2 1 予定 5 1 3 1 2 2 予定 6 1 3 1 2 3 この表では，1 はトマトソースを，2 はクリームソースを，3 はバジルソースを表す． 入力例 2 20 5 10 2 4 3 12 1 13 2 9 1 出力例 2 2640 入出力例 2 において，条件をみたす予定は全部で 4112640 通りある．それを 10000 で割った余りである 2640 を出力する． 問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0568_2091162", "code_snippet": "#include <stdio.h>\n#include <algorithm>\n#include <string.h>\n#define DAY_MAX\t123\n#define PASTA_MAX\t5\n#define ONAZI_MAX\t123\n\nint max;\n\n\nint set_pasta[DAY_MAX];\nint memo[DAY_MAX][PASTA_MAX][ONAZI_MAX];\n\nint dp(int day, int pasta, int onazi){\n\tint numbuf = 0;\n\tint ans = 0;\n\tif (memo[day][pasta][onazi] >= 0) return memo[day][pasta][onazi];\n\tif (onazi == 3) return 0;\n\tif (day == max - 1) return 1;\n\tif (set_pasta[day + 1] >= 1){\n\t\tif (set_pasta[day + 1] == pasta) return memo[day][pasta][onazi] = dp(day + 1, pasta, onazi + 1);\n\t\telse return memo[day][pasta][onazi] = dp(day + 1, set_pasta[day + 1], 1);\n\t}\n\telse{\n\t\tfor (int a = 0; a < 3; a++){\n\t\t\tif (a + 1 == pasta) ans += dp(day + 1, pasta, onazi + 1);\n\t\t\telse ans += dp(day + 1, a + 1, 1);\n\t\t\tans %= 10000;\n\t\t}\n\t\treturn ans;\n\t}\n}\n\nint main(){\n\tint num;\n\tint buf;\n\tint answer = 0;\n\tmemset(memo, 255, sizeof(memo));\n\tscanf(\"%d%d\", &max, &num);\n\tfor (int a = 0; a < num; a++){\n\t\tscanf(\"%d\", &buf);\n\t\tscanf(\"%d\", &set_pasta[buf - 1]);\n\t}\n\tif (set_pasta[0] >= 1) printf(\"%d\\n\", dp(0, set_pasta[0], 1));\n\telse printf(\"%d\\n\", (dp(0, 1, 1) + dp(0, 2, 1) + dp(0, 3, 1)) % 10000);\n\treturn 0;\n}", "accuracy": 1, "time_ms": 30, "memory_kb": 3000, "score_of_the_acc": -1, "final_rank": 1 }, { "submission_id": "aoj_0568_1889432", "code_snippet": "#include<bits/stdc++.h>\n#define rep(a,b) for(int a=0;a<b;a++)\n#define int long long int\n\nusing namespace std;\n\nconst int INF = 1000000009;\n\nint day,al;\nint almost[200];\nint ans=1;\nint used[200];\n\nint pasu(int p){\n if(p==3)return 1;\n else if(p==2)return 3;\n else if(p==1)return 2;\n}\n\nint pasu2(int p){\n if(p==3)return 2;\n else if(p==2)return 1;\n else if(p==1)return 3;\n}\n\nint kaburi1(int date){\n if(almost[date+1]!=0){\n return almost[date+1];\n }else return 0;\n}\n\nint kaburi2(int date){\n if(almost[date+2]!=0){\n return almost[date+2];\n }else return 0;\n}\n\nint pasuta(int d2, int d1, int dd1, int dd2,int date){\n if(date>day)return 1;\n else if(almost[date]!=0){\n return pasuta(d1,almost[date],kaburi1(date+1),kaburi2(date+1),date+1)%10000;\n }else if((d2==d1||d1==dd1)&&d1!=0){\n return (pasuta(d1,pasu(d1),kaburi1(date+1),kaburi2(date+1),date+1)+pasuta(d1,pasu2(d1),kaburi1(date+1),kaburi2(date+1),date+1))%10000;\n }else if(dd1==dd2&&dd1!=0){\n return (pasuta(d1,pasu(dd1),kaburi1(date+1),kaburi2(date+1),date+1)+pasuta(d1,pasu2(dd1),kaburi1(date+1),kaburi2(date+1),date+1))%10000;\n }else{\n return (pasuta(d1,1,kaburi1(date+1),kaburi2(date+1),date+1)+\n pasuta(d1,2,kaburi1(date+1),kaburi2(date+1),date+1)+\n pasuta(d1,3,kaburi1(date+1),kaburi2(date+1),date+1))%10000;\n }\n}\n\nsigned main(){\n fill(almost,almost+200,0);\n fill(used,used+200,0);\n cin >> day >> al;\n rep(a,al){\n int da,pa;\n cin >> da >> pa;\n almost[da]=pa;\n }\n ans = pasuta(0,0,almost[2],almost[3],1);\n cout << ans%10000 << endl;\nreturn 0;\n}", "accuracy": 0.2, "time_ms": 1190, "memory_kb": 1168, "score_of_the_acc": -0.4505, "final_rank": 2 }, { "submission_id": "aoj_0568_1889413", "code_snippet": "#include<bits/stdc++.h>\n#define rep(a,b) for(int a=0;a<b;a++)\n#define int long long int\n\nusing namespace std;\n\nconst int INF = 1000000009;\n\nint day,al;\nint almost[200];\nint ans=1;\nint used[200];\n\nint pasu(int p){\n if(p==3)return 1;\n else if(p==2)return 3;\n else if(p==1)return 2;\n}\n\nint pasu2(int p){\n if(p==3)return 2;\n else if(p==2)return 1;\n else if(p==1)return 3;\n}\n\nint kaburi1(int date){\n if(almost[date+1]!=0){\n return almost[date+1];\n }else return 0;\n}\n\nint kaburi2(int date){\n if(almost[date+2]!=0){\n return almost[date+2];\n }else return 0;\n}\n\nint pasuta(int d2, int d1, int dd1, int dd2,int date){\n if(date>day)return 1;\n else if(almost[date]!=0){\n return pasuta(d1,almost[date],kaburi1(date+1),kaburi2(date+1),date+1)%10000;\n }else if((d2==d1||d1==dd1)&&d1!=0){\n return (pasuta(d1,pasu(d1),kaburi1(date+1),kaburi2(date+1),date+1)+pasuta(d1,pasu2(d1),kaburi1(date+1),kaburi2(date+1),date+1))%10000;\n }else{\n return (pasuta(d1,1,kaburi1(date+1),kaburi2(date+1),date+1)+\n pasuta(d1,2,kaburi1(date+1),kaburi2(date+1),date+1)+\n pasuta(d1,3,kaburi1(date+1),kaburi2(date+1),date+1))%10000;\n }\n}\n\nsigned main(){\n fill(almost,almost+200,0);\n fill(used,used+200,0);\n cin >> day >> al;\n rep(a,al){\n int da,pa;\n cin >> da >> pa;\n almost[da]=pa;\n }\n ans = pasuta(0,0,almost[2],almost[3],1);\n cout << ans%10000 << endl;\nreturn 0;\n}", "accuracy": 0.2, "time_ms": 2620, "memory_kb": 1160, "score_of_the_acc": -0.9962, "final_rank": 4 }, { "submission_id": "aoj_0568_1889407", "code_snippet": "#include<bits/stdc++.h>\n#define rep(a,b) for(int a=0;a<b;a++)\n#define int long long int\n\nusing namespace std;\n\nconst int INF = 1000000009;\n\nint day,al;\nint almost[200];\nint ans=1;\nint used[200];\n\nint pasu(int p){\n if(p==3)return 1;\n else if(p==2)return 3;\n else if(p==1)return 2;\n}\n\nint pasu2(int p){\n if(p==3)return 2;\n else if(p==2)return 1;\n else if(p==1)return 3;\n}\n\nint kaburi1(int date){\n if(almost[date+1]!=0){\n return almost[date+1];\n }else return 0;\n}\n\nint kaburi2(int date){\n if(almost[date+2]!=0){\n return almost[date+2];\n }else return 0;\n}\n\nint pasuta(int d2, int d1, int dd1, int dd2,int date){\n if(date>day)return 1;\n //else if(used[date])return;\n else if(almost[date]!=0){\n //used[date]=1;\n return pasuta(d1,almost[date],kaburi1(date+1),kaburi2(date+1),date+1)%10000;\n }/*else if(d2==d1&&d1==dd1&&d1!=0){\n\n //used[date]=1;\n// cout << \"a\" << date;\n // if(d2==dd1){\n //ans=ans*2;\n return pasuta(dd1,dd2,kaburi1(date+3),kaburi2(date+3),date+3)+pasuta(dd1,dd2,kaburi1(date+3),kaburi2(date+3),date+3);\n //}else{\n // return pasuta(dd1,dd2,kaburi1(date+3),kaburi2(date+3),date+3);\n // }\n }*/else if((d2==d1||d1==dd1)&&d1!=0){\n //used[date]=1;\n\n // cout << \"b\" << date;\n //ans=ans*2;\n return (pasuta(d1,pasu(d1),kaburi1(date+1),kaburi2(date+1),date+1)+pasuta(d1,pasu2(d1),kaburi1(date+1),kaburi2(date+1),date+1))%10000;\n }else{\n // used[date]=1;\n // cout << \"c\" << date;\n //ans=ans*3;\n return (pasuta(d1,1,kaburi1(date+1),kaburi2(date+1),date+1)+\n pasuta(d1,2,kaburi1(date+1),kaburi2(date+1),date+1)+\n pasuta(d1,3,kaburi1(date+1),kaburi2(date+1),date+1))%10000;\n }\n}\n\nsigned main(){\n fill(almost,almost+200,0);\n fill(used,used+200,0);\n cin >> day >> al;\n rep(a,al){\n int da,pa;\n cin >> da >> pa;\n almost[da]=pa;\n }\n ans = pasuta(0,0,almost[2],almost[3],1);\n cout << ans << endl;\nreturn 0;\n}", "accuracy": 0.2, "time_ms": 2630, "memory_kb": 1164, "score_of_the_acc": -1.0022, "final_rank": 5 }, { "submission_id": "aoj_0568_1581770", "code_snippet": "#include <iostream>\n#include <sstream>\n#include <algorithm>\n#include <queue>\n#include <stack>\n#include <map>\n#include <vector>\n#include <cmath>\n#include <string>\n#include <cstring>\n\nusing namespace std;\n\n#define int long long\n#define LL long long\n#define ULL unsigned long long\n\nconst LL LL_INF = ~(ULL)0 >> 1;\n\nint day[105] = {0}, n, k, mem[101][4][4][4];\n\nint f(int d, int src, int presrc, int num) {\n if (d == n) {\n return (num + 1) % 10000;\n }\n\n if (day[d + 1] != 0) {\n return f(d + 1, day[d + 1], src, num);\n }\n\n int result = num;\n for (int i = 1; i <= 3; ++i) {\n if (((presrc == src) && (presrc == i)) ||\n ((day[d + 2] != 0) && (src == i) && (i == day[d + 2]))) continue;\n\n //int temp = (mem[d + 1][i][src][presrc] == LL_INF) ? f(d + 1, i, src, 0) : mem[d + 1][i][src][presrc];\n int temp = f(d + 1, i, src, 0);\n mem[d + 1][i][src][presrc] = temp;\n result = (result + temp) % 10000;\n }\n\n return result;\n}\n\nsigned main() {\n for (int i = 0; i < 101; ++i) {\n for (int j = 0; j < 4; ++j) {\n for (int k = 0; k < 4; ++k) {\n fill(mem[i][j][k], mem[i][j][k] + 4, LL_INF);\n }\n }\n }\n cin >> n >> k;\n\n for (int i = 0; i < k; ++i) {\n int a, b;\n cin >> a >> b;\n day[a] = b;\n }\n\n int result = 0;\n\n if (day[1] == 0) {\n for (int i = 1; i <= 3; ++i) {\n result = (result + f(1, i, 0, 0)) % 10000;\n }\n } else {\n result = (result + f(1, day[1], 0, 0)) % 10000;\n }\n\n cout << result << endl;\n\n return 0;\n}", "accuracy": 0.2, "time_ms": 1190, "memory_kb": 1208, "score_of_the_acc": -0.4722, "final_rank": 3 } ]
aoj_0560_cpp
惑星探査(Planetary Exploration) あなたを乗せた超時空移民船は長旅の末，ついに居住可能と思われる惑星を発見した．JOI 星と名付けられたその惑星は，その名の通り「ジャングル(Jungle)」，「海(Ocean)」，「氷(Ice)」の3 種類の地形が入り組んだ過酷な惑星である．簡単な調査により，居住予定地近辺の地図が作成された．居住予定地は南北 M km, 東西 N km の長方形の形をしており， 1 km 四方の正方形の区画に分けられている．区画は全部で MN 個あり，北から p 行目，西から q 列目の区画を( p , q ) で表す．北西の角の区画が(1, 1) であり，南東の角の区画が( M , N ) である．各区画の地形は，「ジャングル」，「海」，「氷」のいずれかであり，「ジャングル」はJ, 「海」はO, 「氷」はI の英字1 文字で表される. さて，詳細な移住計画を立てるにあたり， K 箇所の長方形領域内に「ジャングル」，「海」，「氷」がそれぞれ何区画含まれるかを調べることにした． 課題 居住予定地の情報と，調査対象となる領域の情報が与えられたとき，それぞれの領域について， 「ジャングル」，「海」，「氷」が何区画含まれているかを求めるプログラムを作成せよ． 制限 1 ≤ M ≤ 1000    居住予定地の南北の長さ(km) 1 ≤ N ≤ 1000    居住予定地の東西の長さ(km) 1 ≤ K ≤ 100000    調査対象となる領域の個数 入力 標準入力から以下の入力を読み込め． 1 行目には整数 M , N が空白を区切りとして書かれており，居住予定地が南北に M km ，東西に N km の広さであることを表す． 2 行目には整数 K が書かれており，調査対象となる領域の個数を表す． 続く M 行には居住予定地の情報が書かれている． i + 2 行目(1 ≤ i ≤ M ) には，居住予定地の北から i 行目に位置する N 区画の情報を表すJ，O，I からなる N 文字の文字列が書かれている． 続く K 行には調査対象となる領域が書かれている． j + M + 2 行目(1 ≤ j ≤ K ) には， j 番目の領域を表す正整数 a j , b j , c j , d j が空白を区切りとして書かれている．( a j , b j ) は調査領域の北西の角の区画を，( c j , d j ) は調査領域の南東の角の区画を表す．ただし， a j , b j , c j , d j は，1 ≤ a j ≤ c j ≤ M , 1 ≤ b j ≤ d j ≤ N を満たす． 出力 標準出力に調査の結果を表す K 行を出力せよ．出力の j 行目には， j 番目の調査領域に含まれる「ジャングル」(J) の区画数，「海」(O) の区画数，「氷」(I) の区画数を表す3 つの整数を，この順に空白を区切りとして書け． 採点基準 採点用データのうち，配点の30%分については， M ≤ 50 かつ K ≤ 100 を満たす．配点の50%分については， M ≤ 50 を満たす． 入出力の例 入力例 4 7 4 JIOJOIJ IOJOIJO JOIJOOI OOJJIJO 3 5 4 7 2 2 3 6 2 2 2 2 1 1 4 7 出力例 1 3 2 3 5 2 0 1 0 10 11 7 この入力例では， 2 番目の領域は上図のように「ジャングル」を3 区画，「海」を5 区画，「氷」を2 区画含む． 問題文と自動審判に使われるデータは、 情報オリンピック日本委員会 が作成し公開している問題文と採点用テストデータです。
[ { "submission_id": "aoj_0560_10867525", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include<utility>\n#include<set>\n#include<deque>\n#include <unordered_map>\n#include<string>\n#include<cmath>\n\nusing namespace std;\n\nconst int MOD = 100000;\nint main() {\n\tint M, N,K;\n\tcin >> M >> N>>K;\n\t\n\tvector<vector<char>>m(M, vector<char>(N));\n\tfor (int i = 0; i < M; i++) {\n\t\tfor (int j = 0; j < N; j++) {\n\t\t\tcin >> m[i][j];\n\t\t}\n\t}\n\n\tvector<vector<int>>J(M+1, vector<int>(N+1, 0));\n\tvector<vector<int>>O(M+1, vector<int>(N+1, 0));\n\tvector<vector<int>>I(M+1, vector<int>(N+1, 0));\n\n\tfor (int i = 1; i <= M; i++) {\n\t\tfor (int j = 1; j <= N; j++) {\n\t\t\tif (m[i-1][j-1] == 'J') {\n\t\t\t\tJ[i][j] = 1;\n\t\t\t}\n\t\t\tif (m[i-1][j-1] == 'O') {\n\t\t\t\tO[i][j] = 1;\n\t\t\t}\n\t\t\tif (m[i-1][j-1] == 'I') {\n\t\t\t\tI[i][j] = 1;\n\t\t\t}\n\t\t}\n\t}\n\n\tfor (int i = 1; i < M+1; i++) {\n\t\tfor (int j = 1; j < N+1; j++) {\n\t\t\t\n\t\t\t\tJ[i][j] += J[i - 1][j] + J[i][j - 1] - J[i - 1][j - 1];\n\t\t\t\n\t\t\t\tO[i][j] += O[i - 1][j] + O[i][j - 1] - O[i - 1][j - 1];\n\t\t\t\n\t\t\t\tI[i][j] += I[i - 1][j] + I[i][j - 1] - I[i - 1][j - 1];\n\t\t\t\n\t\t}\n\t}\n\n\tfor (int i = 0; i < K; i++) {\n\t\tint jc, oc, ic;\n\t\tjc = 0;\n\t\toc = 0;\n\t\tic = 0;\n\n\t\tint a, b, c, d;\n\t\tcin >> a >> b >> c >> d;\n\n\t\tjc = J[c][d] - J[c][b - 1] - J[a-1][d] + J[a - 1][b - 1];\n\t\toc= O[c][d] - O[c][b - 1] - O[a-1][d] + O[a - 1][b - 1];\n\t\tic=I[c][d] - I[c][b - 1] - I[a-1][d] + I[a - 1][b - 1];\n\t\tcout << jc << \" \" << oc << \" \" << ic << endl;\n\t}\n\n}", "accuracy": 1, "time_ms": 160, "memory_kb": 16144, "score_of_the_acc": -0.8264, "final_rank": 16 }, { "submission_id": "aoj_0560_10852785", "code_snippet": "#include<iostream>\n#include<string>\nusing namespace std;\nint J[1200][1200], O[1200][1200], I[1200][1200];\nint H, W, Q; string S;\nint main() {\n\tcin >> H >> W >> Q;\n\tfor (int i = 1; i <= H; i++) {\n\t\tcin >> S;\n\t\tfor (int j = 0; j < S.size(); j++) {\n\t\t\tif (S[j] == 'J')J[i][j + 1]++;\n\t\t\tif (S[j] == 'O')O[i][j + 1]++;\n\t\t\tif (S[j] == 'I')I[i][j + 1]++;\n\t\t}\n\t}\n\tfor (int i = 1; i <= H; i++) { for (int j = 1; j <= W; j++)J[i][j] += J[i - 1][j]; }\n\tfor (int i = 1; i <= H; i++) { for (int j = 1; j <= W; j++)J[i][j] += J[i][j - 1]; }\n\tfor (int i = 1; i <= H; i++) { for (int j = 1; j <= W; j++)O[i][j] += O[i - 1][j]; }\n\tfor (int i = 1; i <= H; i++) { for (int j = 1; j <= W; j++)O[i][j] += O[i][j - 1]; }\n\tfor (int i = 1; i <= H; i++) { for (int j = 1; j <= W; j++)I[i][j] += I[i - 1][j]; }\n\tfor (int i = 1; i <= H; i++) { for (int j = 1; j <= W; j++)I[i][j] += I[i][j - 1]; }\n\tfor (int i = 0; i < Q; i++) {\n\t\tint ax, ay, bx, by; cin >> ax >> ay >> bx >> by; ax--; ay--;\n\t\tint pos1 = J[ax][ay] + J[bx][by] - J[ax][by] - J[bx][ay];\n\t\tint pos2 = O[ax][ay] + O[bx][by] - O[ax][by] - O[bx][ay];\n\t\tint pos3 = I[ax][ay] + I[bx][by] - I[ax][by] - I[bx][ay];\n\t\tcout << pos1 << ' ' << pos2 << ' ' << pos3 << endl;\n\t}\n\treturn 0;\n}", "accuracy": 1, "time_ms": 140, "memory_kb": 19820, "score_of_the_acc": -0.7757, "final_rank": 15 }, { "submission_id": "aoj_0560_10495891", "code_snippet": "/**\n * テンプレート出展：http://qiita.com/sorachandu/items/041169d34b9f9b99bcf7\n */\n#include <bits/stdc++.h>\nusing namespace std;\nstruct Init { Init() { ios::sync_with_stdio(0); cin.tie(0); cout << setprecision(13); } }init;\n\nusing ll = long long;\nusing ull = unsigned long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\n\n#define rep(i, x, limit) for (int i = (int)x; i < (int)limit; i++)\n#define REP(i, x, limit) for (int i = (int)x; i <= (int)limit; i++)\n#define repl(i, x, limit) for (ll i = (ll)x; i < (ll)limit; i++)\n#define REPL(i, x, limit) for (ll i = (ll)x; i <= (ll)limit; i++)\n#define all(x) x.begin(), x.end()\n#define rall(x) x.rbegin(), x.rend()\n#define el '\\n'\n#define spa \" \"\n#define Yes cout << \"Yes\" << el\n#define No cout << \"No\" << el\n#define YES cout << \"YES\" << el\n#define NO cout << \"NO\" << el\n#define eps (1e-10)\n#define Equals(a,b) (fabs((a) - (b)) < eps )\n#define debug(x) cerr << #x << \" = \" << x << el\n\nconst double pi = 3.141592653589793238;\nconst int inf = 1073741823;\nconst ll infl = 1LL << 60;\nconst string ABC = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string abc = \"abcdefghijklmnopqrstuvwxyz\";\n\n//std::pairをstd::coutに渡すために\"<<\"処理を書き換えた物\ntemplate<typename T1, typename T2>\nstd::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){\n os << \"{\" << p.first << \",\" << p.second << \"}\";\n return os;\n}\n\ntemplate<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {\n bool compare = a < b;\n if(compare) a = b;\n return compare;\n}\ntemplate<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {\n bool compare = a > b;\n if(compare) a = b;\n return compare;\n}\n\nint dx[4] = {-1,0,1,0};\nint dy[4] = {0,1,0,-1};\n\ntemplate <class T>\nstruct CumulativeSum2D {\n vector<vector<T> > data;\n\n CumulativeSum2D(int W, int H) : data(W + 1, vector<T>(H + 1, 0)) {}\n\n void add(int x, int y, T z) {\n ++x, ++y;\n if (x >= data.size() || y >= data[0].size()) return;\n data[x][y] += z;\n }\n\n void build() {\n for (int i = 1; i < data.size(); i++) {\n for (int j = 1; j < data[i].size(); j++) {\n data[i][j] += data[i][j - 1] + data[i - 1][j] - data[i - 1][j - 1];\n }\n }\n }\n\n T query(int sx, int sy, int gx, int gy) const {\n return (data[gx][gy] - data[sx][gy] - data[gx][sy] + data[sx][sy]);\n }\n};\n\nint N, Q, x, y, a, b, c, d,H,W;\n\nint main(void){\n cin >> H >> W >> Q;\n CumulativeSum2D<ll> J(H,W);\n CumulativeSum2D<ll> O(H,W);\n CumulativeSum2D<ll> I(H,W);\n for(int i = 0; i < H; i++){\n string s;\n cin >> s;\n for(int j = 0; j < W; j++){\n if(s[j] == 'J'){\n J.add(i,j,1);\n }else if(s[j] == 'O'){\n O.add(i,j,1);\n }else{\n I.add(i,j,1);\n }\n }\n }\n J.build();\n O.build();\n I.build();\n for(int i = 0; i < Q; i++){\n cin >> a >> b >> c >> d;\n a--;b--;\n cout << J.query(a,b,c,d) << \" \" << O.query(a,b,c,d) << \" \" << I.query(a,b,c,d)<< el;\n }\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 26728, "score_of_the_acc": -0.2643, "final_rank": 7 }, { "submission_id": "aoj_0560_10367010", "code_snippet": "#define INF 4'000'000'000'000'000'037LL\n#include <bits/stdc++.h>\nusing namespace std;\nnamespace {\nusing ll = long long;\nusing ull = unsigned long long;\nusing pll = pair<ll, ll>;\n#define vc vector\ntemplate <class T>\nusing vvc = vc<vc<T>>;\nusing vl = vc<ll>;\nusing vpll = vc<pll>;\nusing vvl = vvc<ll>;\n#ifdef __SIZEOF_INT128__\nusing i128 = __int128_t;\n#endif\n#define cauto const auto\n#define overload4(_1, _2, _3, _4, name, ...) name\n#define rep1(i, n) for (ll i = 0, nnnnn = ll(n); i < nnnnn; i++)\n#define rep(...) overload4(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)\n#define repi1(i, n) for (int i = 0, nnnnn = int(n); i < nnnnn; i++)\n#define repi(...) overload4(__VA_ARGS__, repi3, repi2, repi1)(__VA_ARGS__)\ntemplate <class T = ll, class U, class V>\nconstexpr T ipow(U a, V b)\n{\n assert(b >= 0);\n if (b == 0)\n return 1;\n if (a == 0 || a == 1)\n return a;\n if (a < 0 && a == -1)\n return b & 1 ? -1 : 1;\n T res = 1, tmp = a;\n while (true)\n {\n if (b & 1)\n res *= tmp;\n b >>= 1;\n if (b == 0)\n break;\n tmp *= tmp;\n }\n return res;\n}\ntemplate <class T = ll, class A, class B, class M>\nT mul_limited(A a, B b, M m)\n{\n assert(a >= 0 && b >= 0 && m >= 0);\n if (b == 0)\n return 0;\n return T(a) > T(m) / T(b) ? T(m) : T(a) * T(b);\n}\ntemplate <class T = ll, class A, class B>\nT mul_limited(A a, B b) { return mul_limited<T>(a, b, INF); }\ntemplate <class T = ll, class A, class B, class M>\nT pow_limited(A a, B b, M m)\n{\n assert(a >= 0 && b >= 0 && m >= 0);\n if (a <= 1 || b == 0)\n return min(ipow<T>(a, b), T(m));\n T res = 1, tmp = a;\n while (true)\n {\n if (b & 1)\n {\n if (res > T(m) / tmp)\n return m;\n res *= tmp;\n }\n b >>= 1;\n if (b == 0)\n break;\n if (tmp > T(m) / tmp)\n return m;\n tmp *= tmp;\n }\n return res;\n}\ntemplate <class T = ll, class A, class B>\nT pow_limited(A a, B b) { return pow_limited<T>(a, b, INF); }\n#define ALL(a) (a).begin(), (a).end()\ntemplate <class T = ll, class V>\ninline T SZ(const V &x) { return x.size(); }\ntemplate <class F>\nauto gen_vec(const int &n, const F &f)\n{\n vc<decltype(f(0))> res(n);\n repi(i, n) res[i] = f(i);\n return res;\n}\ntemplate <class T, size_t d, size_t i = 0, class V>\nauto dvec(const V (&sz)[d], const T &init)\n{\n if constexpr (i < d)\n return vc(sz[i], dvec<T, d, i + 1>(sz, init));\n else\n return init;\n}\ntemplate <class T = ll>\nT ctol(const char &c, const string &s)\n{\n repi(i, SZ<int>(s)) if (s[i] == c) return i;\n return -1;\n}\ntemplate <class T = ll>\nvc<T> stov(const string &s, const char &first)\n{\n return gen_vec(SZ<int>(s), [&](int i) -> T\n { return s[i] - first; });\n}\ntemplate <class T = ll>\nvc<T> stov(const string &s, const string &t)\n{\n return gen_vec(SZ<int>(s), [&](int i) -> T\n { return ctol(s[i], t); });\n}\n#if __cplusplus < 202002L\n#else\n#endif\ntemplate <class V>\nvoid unique(V &v) { v.erase(std::unique(ALL(v)), v.end()); }\ntemplate <class V, class U>\nvoid rotate(V &v, U k)\n{ \n const U n = v.size();\n k = (k % n + n) % n;\n std::rotate(v.begin(), v.begin() + k, v.end());\n}\nconst vpll DRULgrid = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};\nconst vpll DRULplane = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}};\ntemplate <class T>\nstruct is_random_access_iterator\n{\n static constexpr bool value = is_same_v<\n typename iterator_traits<T>::iterator_category,\n random_access_iterator_tag\n >;\n};\ntemplate <class T>\nconstexpr bool is_random_access_iterator_v = is_random_access_iterator<T>::value;\n#if __cplusplus < 202002L\nnamespace internal\n{\n};\n#else\n#define DEFAULT_COMP ranges::less\n#endif\n#if __cplusplus < 202002L\n#else\ninline constexpr ll bit_width(ll x) { return std::bit_width((ull)x); }\ninline constexpr ll bit_floor(ll x) { return std::bit_floor((ull)x); }\ninline constexpr ll bit_ceil(ll x) { return std::bit_ceil((ull)x); }\ninline constexpr ll countr_zero(ll x) { assert(x != 0); return std::countr_zero((ull)x); }\ninline constexpr ll popcount(ll x) { return std::popcount((ull)x); }\ninline constexpr bool has_single_bit(ll x) { return std::has_single_bit((ull)x); }\n#endif\n#define dump(...)\nnamespace fastio {\nstatic constexpr uint32_t SIZ = 1 << 17;\nchar ibuf[SIZ];\nchar obuf[SIZ];\nchar out[100];\nuint32_t pil = 0, pir = 0, por = 0;\nstruct Pre {\n char num[10000][4];\n constexpr Pre() : num() {\n for (int i = 0; i < 10000; i++) {\n int n = i;\n for (int j = 3; j >= 0; j--) {\n num[i][j] = n % 10 | '0';\n n /= 10;\n }\n }\n }\n} constexpr pre;\ninline void load() {\n memcpy(ibuf, ibuf + pil, pir - pil);\n pir = pir - pil + fread(ibuf + pir - pil, 1, SIZ - pir + pil, stdin);\n pil = 0;\n if (pir < SIZ) ibuf[pir++] = '\\n';\n}\ninline void flush() {\n fwrite(obuf, 1, por, stdout);\n por = 0;\n}\nvoid rd1(string &x) {\n x.clear();\n char c;\n do {\n if (pil + 1 > pir) load();\n c = ibuf[pil++];\n } while (isspace(c));\n do {\n x += c;\n if (pil == pir) load();\n c = ibuf[pil++];\n } while (!isspace(c));\n}\ntemplate <typename T>\nvoid rd1_integer(T &x) {\n if (pil + 100 > pir) load();\n char c;\n do\n c = ibuf[pil++];\n while (c < '-');\n bool minus = 0;\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (c == '-') { minus = 1, c = ibuf[pil++]; }\n }\n x = 0;\n while ('0' <= c) { x = x * 10 + (c & 15), c = ibuf[pil++]; }\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (minus) x = -x;\n }\n}\nvoid rd1(ll &x) { rd1_integer(x); }\ntemplate <class T, class U>\nvoid rd1(pair<T, U> &p) {\n return rd1(p.first), rd1(p.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid rd1_tuple(T &t) {\n if constexpr (N < std::tuple_size<T>::value) {\n auto &x = std::get<N>(t);\n rd1(x);\n rd1_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid rd1(tuple<T...> &tpl) {\n rd1_tuple(tpl);\n}\ntemplate <size_t N = 0, typename T>\nvoid rd1(array<T, N> &x) {\n for (auto &d: x) rd1(d);\n}\ntemplate <class T>\nvoid rd1(vc<T> &x) {\n for (auto &d: x) rd1(d);\n}\nvoid read() {}\ntemplate <class H, class... T>\nvoid read(H &h, T &... t) {\n rd1(h), read(t...);\n}\nvoid wt1(const char c) {\n if (por == SIZ) flush();\n obuf[por++] = c;\n}\ntemplate <typename T>\nvoid wt1_integer(T x) {\n if (por > SIZ - 100) flush();\n if (x < 0) { obuf[por++] = '-', x = -x; }\n int outi;\n for (outi = 96; x >= 10000; outi -= 4) {\n memcpy(out + outi, pre.num[x % 10000], 4);\n x /= 10000;\n }\n if (x >= 1000) {\n memcpy(obuf + por, pre.num[x], 4);\n por += 4;\n } else if (x >= 100) {\n memcpy(obuf + por, pre.num[x] + 1, 3);\n por += 3;\n } else if (x >= 10) {\n int q = (x * 103) >> 10;\n obuf[por] = q | '0';\n obuf[por + 1] = (x - q * 10) | '0';\n por += 2;\n } else\n obuf[por++] = x | '0';\n memcpy(obuf + por, out + outi + 4, 96 - outi);\n por += 96 - outi;\n}\ntemplate <class T, enable_if_t<is_integral_v<T>, int> = 0>\nvoid wt1(T x) { wt1_integer(x); }\ntemplate <class T, class U>\nvoid wt1(const pair<T, U> &val) {\n wt1(val.first);\n wt1(' ');\n wt1(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt1_tuple(const T &t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt1(' '); }\n const auto x = std::get<N>(t);\n wt1(x);\n wt1_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt1(const tuple<T...> &tpl) {\n wt1_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt1(const array<T, S> &val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt1(' ');\n wt1(val[i]);\n }\n}\ntemplate <class T>\nvoid wt1(const vector<T> &val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt1(' ');\n wt1(val[i]);\n }\n}\nvoid print() { wt1('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt1(head);\n if (sizeof...(Tail)) wt1(' ');\n print(forward<Tail>(tail)...);\n}\n} // namespace fastio\nstruct Dummy {\n Dummy() { atexit(fastio::flush); }\n} dummy;\nnamespace internal\n{\ntemplate <class... Ts>\nvoid READnodump(Ts &...a) { fastio::read(a...); }\ntemplate <class T>\nvoid READVECnodump(int n, vc<T> &v)\n{\n v.resize(n);\n READnodump(v);\n}\ntemplate <class T, class... Ts>\nvoid READVECnodump(int n, vc<T> &v, vc<Ts> &...vs)\n{ READVECnodump(n, v), READVECnodump(n, vs...); }\ntemplate <class T>\nvoid READVEC2nodump(int n, int m, vvc<T> &v)\n{\n v.assign(n, vc<T>(m));\n READnodump(v);\n}\ntemplate <class T, class... Ts>\nvoid READVEC2nodump(int n, int m, vvc<T> &v, vvc<Ts> &...vs)\n{ READVEC2nodump(n, m, v), READVEC2nodump(n, m, vs...); }\ntemplate <class T>\nvoid READJAGnodump(int n, vvc<T> &v)\n{\n v.resize(n);\n repi(i, n)\n {\n int k;\n READnodump(k);\n READVECnodump(k, v[i]);\n }\n}\ntemplate <class T, class... Ts>\nvoid READJAGnodump(int n, vvc<T> &v, vvc<Ts> &...vs)\n{ READJAGnodump(n, v), READJAGnodump(n, vs...); }\n}; // namespace internal\n#define READ(...) internal::READnodump(__VA_ARGS__); dump(__VA_ARGS__)\n#define IN(T, ...) T __VA_ARGS__; READ(__VA_ARGS__)\n#define LL(...) IN(ll, __VA_ARGS__)\n#define READVEC(...) internal::READVECnodump(__VA_ARGS__); dump(__VA_ARGS__)\n#define VEC(T, n, ...) vc<T> __VA_ARGS__; READVEC(n, __VA_ARGS__)\n#define PRINT fastio::print\ntemplate <class T, class U, class P>\npair<T, U> operator+=(pair<T, U> &a, const P &b)\n{\n a.first += b.first;\n a.second += b.second;\n return a;\n}\ntemplate <class T, class U, class P>\npair<T, U> operator+(pair<T, U> &a, const P &b) { return a += b; }\ntemplate <class T, size_t n, class A>\narray<T, n> operator+=(array<T, n> &a, const A &b)\n{\n for (size_t i = 0; i < n; i++)\n a[i] += b[i];\n return a;\n}\ntemplate <class T, size_t n, class A>\narray<T, n> operator+(array<T, n> &a, const A &b) { return a += b; }\nnamespace internal\n{\ntemplate <size_t... I, class A, class B>\nauto tuple_add_impl(A &a, const B &b, const index_sequence<I...>)\n{\n ((get<I>(a) += get<I>(b)), ...);\n return a;\n}\n}; // namespace internal\ntemplate <class... Ts, class Tp>\ntuple<Ts...> operator+=(tuple<Ts...> &a, const Tp &b)\n{ return internal::tuple_add_impl(a, b, make_index_sequence<tuple_size_v<tuple<Ts...>>>{}); }\ntemplate <class... Ts, class Tp>\ntuple<Ts...> operator+(tuple<Ts...> &a, const Tp &b) { return a += b; }\nnamespace internal\n{\n};\nmt19937_64 mt;\ntemplate <class T>\nstruct GroupAddSub\n{\n using S = T;\n static constexpr S op(S a, S b) { return a + b; }\n static constexpr S e() { return 0; }\n static constexpr S inv(S a) { return -a; }\n};\ntemplate <class G = GroupAddSub<ll>>\nstruct CumulativeSum2D\n{\n using S = typename G::S;\nprivate:\n vvc<S> s;\npublic:\n CumulativeSum2D() {}\n CumulativeSum2D(const vvc<S> &a)\n {\n const int n = a.size();\n if (n == 0)\n return;\n const int m = a[0].size();\n s.assign(n + 1, vc<S>(m + 1, G::e()));\n repi(i, n) repi(j, m) s[i + 1][j + 1] = G::op(s[i + 1][j], a[i][j]);\n repi(j, m) repi(i, n) s[i + 1][j + 1] = G::op(s[i + 1][j + 1], s[i][j + 1]);\n }\n S sum(int ri, int rj)\n {\n if (s.empty())\n return G::e();\n const int n = SZ<int>(s) - 1;\n const int m = SZ<int>(s[0]) - 1;\n assert(0 <= ri && ri <= n);\n assert(0 <= rj && rj <= n);\n return s[ri][rj];\n }\n S sum(int li, int ri, int lj, int rj)\n {\n if (s.empty())\n return G::e();\n const int n = SZ<int>(s) - 1;\n const int m = SZ<int>(s[0]) - 1;\n assert(0 <= li && li <= ri && ri <= n);\n assert(0 <= lj && lj <= rj && rj <= m);\n return G::op(G::op(s[ri][rj], s[li][lj]), G::inv(G::op(s[ri][lj], s[li][rj])));\n }\n};\nvoid init() {}\nvoid main2()\n{\n LL(M, N, K);\n VEC(string, M, S);\n auto A = gen_vec(M, [&](ll i)\n { return stov(S.at(i), \"JOI\"); });\n array<vvl, 3> B;\n B.fill(vvl(M, vl(N, 0)));\n rep(i, M) rep(j, N) B.at(A.at(i).at(j)).at(i).at(j) = 1;\n array<CumulativeSum2D<>, 3> cums;\n rep(k, 3) cums.at(k) = CumulativeSum2D(B.at(k));\n rep(_, K)\n {\n LL(li, lj, ri, rj);\n li--, lj--;\n array<ll, 3> ans;\n rep(k, 3) ans.at(k) = cums.at(k).sum(li, ri, lj, rj);\n PRINT(ans);\n }\n}\nvoid test() {}\ntemplate <auto init, auto main2, auto test>\nstruct Main\n{\n Main()\n {\n cauto CERR = [](string val, string color)\n {\n string s = \"\\033[\" + color + \"m\" + val + \"\\033[m\";\n /* コードテストで確認する際にコメントアウトを外す\n cerr << val;\n //*/\n };\n CERR(\"\\n[FAST_IO]\\n\\n\", \"32\");\n cout << fixed << setprecision(20);\n test();\n init();\n CERR(\"\\n[SINGLE_TESTCASE]\\n\\n\", \"36\");\n main2();\n }\n};\nMain<init, main2, test> main_dummy;\n}\nint main() {}", "accuracy": 1, "time_ms": 40, "memory_kb": 59468, "score_of_the_acc": -1, "final_rank": 17 }, { "submission_id": "aoj_0560_10338023", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); ++i)\n\nint main(){\n int m,n;\n cin >> m >> n;\n int k;\n cin >> k;\n vector<vector<int>> x(m+1,vector<int>(n+1,0)),y(m+1,vector<int>(n+1,0)),z(m+1,vector<int>(n+1,0));\n rep(i,m){\n int s=0,t=0,u=0;\n string str;\n cin >> str;\n rep(j,n){\n if(str[j]=='J') s++;\n else if(str[j]=='O') t++;\n else u++;\n x[i+1][j+1]=s;\n y[i+1][j+1]=t;\n z[i+1][j+1]=u;//1-based\n }\n }\n vector<vector<int>> X(m+1,vector<int>(n+1,0)),Y(m+1,vector<int>(n+1,0)),Z(m+1,vector<int>(n+1,0));\n for(int j=1;j<n+1;j++){\n for(int i=1;i<m+1;i++){\n X[i][j]=x[i][j]+X[i-1][j];\n Y[i][j]=y[i][j]+Y[i-1][j];\n Z[i][j]=z[i][j]+Z[i-1][j];\n }\n }\n rep(i,k){\n int a,b,c,d;\n cin >> a >> b >> c >> d;\n cout << X[c][d]-X[a-1][d]-X[c][b-1]+X[a-1][b-1] << \" \";\n cout << Y[c][d]-Y[a-1][d]-Y[c][b-1]+Y[a-1][b-1] << \" \";\n cout << Z[c][d]-Z[a-1][d]-Z[c][b-1]+Z[a-1][b-1] << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 180, "memory_kb": 26792, "score_of_the_acc": -1.199, "final_rank": 19 }, { "submission_id": "aoj_0560_9876065", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(NULL);\n \n int M, N;\n cin >> M >> N;\n int K;\n cin >> K;\n \n // Initialize prefix sums with (M+1) x (N+1) to handle 1-based indexing and 0 row/column\n vector<vector<int>> sumJ(M+1, vector<int>(N+1, 0));\n vector<vector<int>> sumO(M+1, vector<int>(N+1, 0));\n vector<vector<int>> sumI(M+1, vector<int>(N+1, 0));\n \n // Read grid and compute prefix sums\n for(int i=1; i<=M; ++i){\n string row;\n cin >> row;\n for(int j=1; j<=N; ++j){\n char c = row[j-1];\n sumJ[i][j] = sumJ[i-1][j] + sumJ[i][j-1] - sumJ[i-1][j-1] + (c == 'J' ? 1 : 0);\n sumO[i][j] = sumO[i-1][j] + sumO[i][j-1] - sumO[i-1][j-1] + (c == 'O' ? 1 : 0);\n sumI[i][j] = sumI[i-1][j] + sumI[i][j-1] - sumI[i-1][j-1] + (c == 'I' ? 1 : 0);\n }\n }\n \n // Prepare to store output\n // To speed up output, we can use a buffer\n string output;\n output.reserve((K * 20)); // rough estimate\n \n for(int q=0; q<K; ++q){\n int aj, bj, cj, dj;\n cin >> aj >> bj >> cj >> dj;\n // Calculate counts using prefix sums\n int countJ = sumJ[cj][dj] - sumJ[aj-1][dj] - sumJ[cj][bj-1] + sumJ[aj-1][bj-1];\n int countO = sumO[cj][dj] - sumO[aj-1][dj] - sumO[cj][bj-1] + sumO[aj-1][bj-1];\n int countI = sumI[cj][dj] - sumI[aj-1][dj] - sumI[cj][bj-1] + sumI[aj-1][bj-1];\n // Append to output\n output += to_string(countJ) + \" \" + to_string(countO) + \" \" + to_string(countI) + \"\\n\";\n }\n \n // Print all at once\n cout << output;\n \n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 20020, "score_of_the_acc": -0.1135, "final_rank": 5 }, { "submission_id": "aoj_0560_9762226", "code_snippet": "#line 1 \"verify/AOJ-0560.test.cpp\"\n#define PROBLEM \"https://onlinejudge.u-aizu.ac.jp/challenges/sources/JOI/Final/0560\"\n\n#line 2 \"Library/Template.hpp\"\n\n/**\n * @file Template.hpp\n * @author log K (lX57)\n * @brief Template - テンプレート\n * @version 1.8\n * @date 2024-06-16\n */\n\n#line 2 \"Library/Common.hpp\"\n\n/**\n * @file Common.hpp\n */\n\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cstdint>\n#include <deque>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <utility>\n#include <vector>\nusing namespace std;\n#line 12 \"Library/Template.hpp\"\n#define ALL(x) (x).begin(), (x).end()\n#define RALL(x) (x).rbegin(), (x).rend()\n#define SORT(x) sort(ALL(x))\n#define RSORT(x) sort(RALL(x))\n#define REVERSE(x) reverse(ALL(x))\n#define SETPRE(digit) fixed << setprecision(digit)\n#define POPCOUNT(x) __builtin_popcount(x)\n#define SUM(x) reduce((x).begin(), (x).end())\n#define CEIL(nume, deno) ((nume) + (deno) - 1) / (deno)\n#define IOTA(x) iota((x).begin(), (x).end(), 0)\n#define LOWERBOUND_IDX(arr, val) distance((arr).begin(), lower_bound((arr).begin(), (arr).end(), val))\n#define UPPERBOUND_IDX(arr, val) distance((arr).begin(), upper_bound((arr).begin(), (arr).end(), val))\n\ninline string Yn(bool flag){return (flag) ? \"Yes\" : \"No\";}\ninline bool YnPrint(bool flag){cout << Yn(flag) << endl;return flag;}\ninline string YN(bool flag){return (flag) ? \"YES\" : \"NO\";}\ninline bool YNPrint(bool flag){cout << YN(flag) << endl;return flag;}\ntemplate<class T>\nbool chmin(T &src, const T &cmp){if(src > cmp){src = cmp; return true;}return false;}\ntemplate<class T>\nbool chmax(T &src, const T &cmp){if(src < cmp){src = cmp; return true;}return false;}\ntemplate<typename T>\ninline bool between(T min, T x, T max){return min <= x && x <= max;}\ntemplate<typename T>\ninline bool ingrid(T y, T x, T ymax, T xmax){return between(0, y, ymax - 1) && between(0, x, xmax - 1);}\ntemplate<typename T>\ninline T median(T a, T b, T c){return between(b, a, c) || between(c, a, b) ? a : (between(a, b, c) || between(c, b, a) ? b : c);}\ntemplate<typename T>\ninline T except(T src, T cond, T excp){return (src == cond ? excp : src);}\ntemplate<typename T>\ninline T min(vector<T> &v){return *min_element((v).begin(), (v).end());}\ntemplate<typename T>\ninline T max(vector<T> &v){return *max_element((v).begin(), (v).end());}\nvector<int> make_sequence(int Size){\n vector<int> ret(Size);\n IOTA(ret);\n return ret;\n}\ntemplate<typename T>\nvoid make_unique(vector<T> &v){\n sort(v.begin(), v.end());\n auto itr = unique(v.begin(), v.end());\n v.erase(itr, v.end());\n}\n\nusing ll = int64_t;\nusing ull = uint64_t;\nusing ld = long double;\n\nconst int INF_INT = numeric_limits<int>::max() >> 2;\nconst ll INF_LL = numeric_limits<ll>::max() >> 2;\n\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vl = vector<ll>;\nusing vvl = vector<vl>;\nusing pi = pair<int, int>;\nusing pl = pair<ll, ll>;\nusing vs = vector<string>;\ntemplate <typename T>\nusing pq = priority_queue<T>;\ntemplate <typename T>\nusing rpq = priority_queue<T, vector<T>, greater<T>>;\n\nconst int dx4[4] = {1, 0, -1, 0};\nconst int dy4[4] = {0, -1, 0, 1};\nconst int dx8[8] = {1, 1, 0, -1, -1, -1, 0, 1};\nconst int dy8[8] = {0, -1, -1, -1, 0, 1, 1, 1};\n\nvector<pair<int, int>> adjacent(int current_y, int current_x, int max_y, int max_x, bool dir_8 = false){\n vector<pair<int, int>> ret;\n for(int d = 0; d < 4 * (1 + dir_8); ++d){\n int next_y = current_y + (dir_8 ? dy8[d] : dy4[d]);\n int next_x = current_x + (dir_8 ? dx8[d] : dx4[d]);\n if(0 <= next_y and next_y < max_y and 0 <= next_x and next_x < max_x){\n ret.emplace_back(next_y, next_x);\n }\n }\n return ret;\n}\n\ntemplate <typename T1, typename T2>\nostream &operator<<(ostream &os, const pair<T1, T2> &p){\n os << p.first << \" \" << p.second;\n return os;\n}\n\ntemplate <typename T1, typename T2>\nistream &operator>>(istream &is, pair<T1, T2> &p){\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate <typename T>\nostream &operator<<(ostream &os, vector<T> &v){\n for (int i = 0; i < v.size(); ++i){\n os << v[i] << (i + 1 != v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate <typename T>\nostream &operator<<(ostream &os, vector<vector<T>> &v){\n for (int i = 0; i < v.size(); ++i){\n os << v[i] << (i + 1 != v.size() ? \"\\n\" : \"\");\n }\n return os;\n}\n\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &v){\n for (int i = 0; i < v.size(); ++i) is >> v[i];\n return is;\n}\n\ntemplate <typename T>\nostream &operator<<(ostream &os, set<T> &v){\n for (auto &u : v){\n os << u << \" \";\n }\n return os;\n}\n\ntemplate<typename T1, typename T2>\nvector<pair<T1, T2>> AssembleVectorPair(vector<T1> &v1, vector<T2> &v2){\n assert(v1.size() == v2.size());\n vector<pair<T1, T2>> v;\n for(int i = 0; i < v1.size(); ++i) v.push_back({v1[i], v2[i]});\n return v;\n}\n\ntemplate<typename T1, typename T2>\npair<vector<T1>, vector<T2>> DisassembleVectorPair(vector<pair<T1, T2>> &v){\n vector<T1> v1;\n vector<T2> v2;\n transform(v.begin(), v.end(), back_inserter(v1), [](auto p){return p.first;});\n transform(v.begin(), v.end(), back_inserter(v2), [](auto p){return p.second;});\n return {v1, v2};\n}\n\ntemplate<typename T1, typename T2, typename T3>\ntuple<vector<T1>, vector<T2>, vector<T3>> DisassembleVectorTuple(vector<tuple<T1, T2, T3>> &v){\n vector<T1> v1;\n vector<T2> v2;\n vector<T3> v3;\n transform(v.begin(), v.end(), back_inserter(v1), [](auto p){return get<0>(p);});\n transform(v.begin(), v.end(), back_inserter(v2), [](auto p){return get<1>(p);});\n transform(v.begin(), v.end(), back_inserter(v3), [](auto p){return get<2>(p);});\n return {v1, v2, v3};\n}\n\ntemplate<typename T1 = int, typename T2 = T1>\npair<vector<T1>, vector<T2>> InputVectorPair(int size){\n vector<pair<T1, T2>> v(size);\n for(auto &[p, q] : v) cin >> p >> q;\n return DisassembleVectorPair(v);\n}\n\ntemplate<typename T1 = int, typename T2 = T1, typename T3 = T1>\ntuple<vector<T1>, vector<T2>, vector<T3>> InputVectorTuple(int size){\n vector<tuple<T1, T2, T3>> v(size);\n for(auto &[p, q, r] : v) cin >> p >> q >> r;\n return DisassembleVectorTuple(v);\n}\n\n#ifdef LOGK\n#define VARIABLE(var) cerr << \"# \" << #var << \" = \" << var << endl;\n#else\n#define VARIABLE(...) 42\n#endif\n\n// ==============================================================\n// \n// Main Program Start\n// \n// ==============================================================\n#line 1 \"Library/DataStructure/CumulativeSum2D.hpp\"\n/**\n * @file CumulativeSum2D.hpp\n * @author log K (lX57)\n * @brief Cumulative Sum 2D - 二次元累積和\n * @version 3.0\n * @date 2024-10-21\n */\n\n#line 10 \"Library/DataStructure/CumulativeSum2D.hpp\"\n\ntemplate<typename T = int32_t>\nstruct CumulativeSum2D{\n private:\n int height_, width_;\n vector<vector<T>> data_;\n\n void Validate(const int y, const int x) const {\n assert(0 <= y && y < height_ - 1);\n assert(0 <= x && x < width_ - 1);\n }\n\n public:\n CumulativeSum2D(const int height, const int width, const T init_value = 0) : height_(height + 1), width_(width + 1){\n data_.resize(height_);\n for(int i = 0; i < height_; ++i){\n data_.at(i).resize(width_);\n }\n }\n\n void Build(){\n for(int i = 1; i < height_; ++i){\n for(int j = 0; j < width_; ++j){\n data_[i][j] += data_[i - 1][j];\n }\n }\n for(int i = 0; i < height_; ++i){\n for(int j = 1; j < width_; ++j){\n data_[i][j] += data_[i][j - 1];\n }\n }\n }\n\n /**\n * @brief 座標 `(y, x)` に値 `value` を代入する。\n * @attention 座標指定は 0-indexで行うこと\n * @param value 代入する値\n */\n void Set(const int y, const int x, const T value){\n Validate(y, x);\n data_[y][x] = value;\n }\n\n /**\n * @brief 座標 `(y, x)` に値 `value` を加算する。\n * @attention 座標指定は 0-indexで行うこと\n * @param value 加算する値\n */\n void Add(const int y, const int x, const T value){\n Add(y, x, y, x, value);\n }\n\n /**\n * @brief 長方形領域 `[y1, y2] × [x1, x2]` に値 `value` を加算する。\n * @attention 座標指定は 0-index, 閉区間で行うこと\n * @param y1 長方形領域左上の y 座標\n * @param x1 長方形領域左上の x 座標\n * @param y2 長方形領域右下の y 座標\n * @param x2 長方形領域右下の x 座標\n * @param value 加算する値\n */\n void Add(const int y1, const int x1, const int y2, const int x2, const T value){\n Validate(y1, x1);\n Validate(y2, x2);\n data_[y1][x1] += value;\n data_[y2 + 1][x1] -= value;\n data_[y1][x2 + 1] -= value;\n data_[y2 + 1][x2 + 1] += value;\n }\n\n /**\n * @brief 長方形領域 `[0, y] × [0, x]` の累積和を計算する。\n * @attention 座標指定は 0-index, 閉区間で行うこと\n * @param y 長方形領域右下の y 座標\n * @param x 長方形領域右下の x 座標\n * @return T \n */\n T Sum(const int y, const int x) const {\n Validate(y, x);\n return data_[y][x];\n }\n\n /**\n * @brief 長方形領域 `[y1, y2] × [x1, x2]` の累積和を計算する。\n * @attention 座標指定は 0-index, 閉区間で行うこと\n * @param y1 長方形領域左上の y 座標\n * @param x1 長方形領域左上の x 座標\n * @param y2 長方形領域右下の y 座標\n * @param x2 長方形領域右下の x 座標\n * @param value 加算する値\n * @return T \n */\n T Sum(const int y1, const int x1, const int y2, const int x2) const {\n Validate(y1, x1);\n Validate(y2, x2);\n T ret = Sum(y2, x2);\n if(y1 > 0) ret -= Sum(y1 - 1, x2);\n if(x1 > 0) ret -= Sum(y2, x1 - 1);\n if(y1 > 0 && x1 > 0) ret += Sum(y1 - 1, x1 - 1);\n return ret;\n }\n\n T Max() const {\n T ret = data_[0][0];\n for(int i = 0; i < height_; ++i){\n for(int j = 0; j < width_; ++j){\n ret = max(ret, data_[i][j]);\n }\n }\n return ret;\n }\n\n T Min() const {\n T ret = data_[0][0];\n for(int i = 0; i < height_; ++i){\n for(int j = 0; j < width_; ++j){\n ret = min(ret, data_[i][j]);\n }\n }\n return ret;\n }\n\n vector<T> &operator[](const int k){\n return data_.at(k);\n }\n};\n#line 5 \"verify/AOJ-0560.test.cpp\"\n\nint main(){\n int N, M; cin >> N >> M;\n int K; cin >> K;\n CumulativeSum2D<int> Jcum(N, M), Ocum(N, M), Icum(N, M);\n for(int i = 0; i < N; ++i){\n string S; cin >> S;\n for(int j = 0; j < M; ++j){\n switch(S[j]){\n case 'J': Jcum.Set(i, j, 1); break;\n case 'O': Ocum.Set(i, j, 1); break;\n case 'I': Icum.Set(i, j, 1); break;\n }\n }\n }\n Jcum.Build();\n Ocum.Build();\n Icum.Build();\n for(int i = 0; i < K; ++i){\n int a, b, c, d; cin >> a >> b >> c >> d, --a, --b, --c, --d;\n cout << Jcum.Sum(a, b, c, d) << ' ' << Ocum.Sum(a, b, c, d) << ' ' << Icum.Sum(a, b, c, d) << endl;\n }\n}", "accuracy": 1, "time_ms": 140, "memory_kb": 14968, "score_of_the_acc": -0.6667, "final_rank": 12 }, { "submission_id": "aoj_0560_9739601", "code_snippet": "#define PROBLEM \"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0560\" \n\n#ifndef DATA_STRUCTURE_PREFIX_SUM_2D_HPP\n#define DATA_STRUCTURE_PREFIX_SUM_2D_HPP 1\n\n#include <cassert>\n#include <vector>\n\nnamespace kk2 {\n\ntemplate <class T> struct PrefixSum2D {\n std::vector<std::vector<T>> acc;\n int h, w;\n\n constexpr PrefixSum2D() = default;\n\n constexpr PrefixSum2D(const std::vector<std::vector<T>> &a)\n : acc(a.size() + 1, std::vector<T>(a[0].size() + 1)),\n h((int)a.size()),\n w((int)a[0].size()) {\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n acc[i + 1][j + 1] = acc[i + 1][j] + acc[i][j + 1] - acc[i][j] + a[i][j];\n }\n }\n }\n\n constexpr T sum(int li, int lj, int ri, int rj) const {\n assert(0 <= li && li <= ri && ri <= h);\n assert(0 <= lj && lj <= rj && rj <= w);\n return acc[ri][rj] - acc[li][rj] - acc[ri][lj] + acc[li][lj];\n }\n\n constexpr T get(int i, int j) const {\n assert(0 <= i && i < h);\n assert(0 <= j && j < w);\n return acc[i + 1][j + 1] - acc[i][j + 1] - acc[i + 1][j] + acc[i][j];\n }\n\n constexpr T operator()(int li, int lj, int ri, int rj) const {\n assert(0 <= li && li <= ri && ri <= h);\n assert(0 <= lj && lj <= rj && rj <= w);\n return acc[ri][rj] - acc[li][rj] - acc[ri][lj] + acc[li][lj];\n }\n\n constexpr T operator()(int i, int j) const {\n assert(0 <= i && i < h);\n assert(0 <= j && j < w);\n return acc[i + 1][j + 1] - acc[i][j + 1] - acc[i + 1][j] + acc[i][j];\n }\n};\n\n} // namespace kk2\n\n#endif // DATA_STRUCTURE_PREFIX_SUM_2D_HPP\n\n// #include \"../../data_structure/prefix_sum_2d.hpp\"\n\n#ifndef TEMPLATE\n#define TEMPLATE 1\n\n#pragma GCC optimize(\"O3,unroll-loops\")\n\n// #include <bits/stdc++.h>\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <chrono>\n#include <cmath>\n#include <cstring>\n#include <deque>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <iterator>\n#include <limits>\n#include <map>\n#include <numeric>\n#include <optional>\n#include <queue>\n#include <random>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\n\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\n\nusing pi = std::pair<int, int>;\nusing pl = std::pair<i64, i64>;\nusing pil = std::pair<int, i64>;\nusing pli = std::pair<i64, int>;\n\ntemplate <class T> using vc = std::vector<T>;\ntemplate <class T> using vvc = std::vector<vc<T>>;\ntemplate <class T> using vvvc = std::vector<vvc<T>>;\ntemplate <class T> using vvvvc = std::vector<vvvc<T>>;\n\ntemplate <class T> using pq = std::priority_queue<T>;\ntemplate <class T> using pqi = std::priority_queue<T, std::vector<T>, std::greater<T>>;\n\ntemplate <class T> constexpr T infty = 0;\ntemplate <> constexpr int infty<int> = (1 << 30) - 123;\ntemplate <> constexpr i64 infty<i64> = (1ll << 62) - (1ll << 31);\ntemplate <> constexpr i128 infty<i128> = (i128(1) << 126) - (i128(1) << 63);\ntemplate <> constexpr u32 infty<u32> = infty<int>;\ntemplate <> constexpr u64 infty<u64> = infty<i64>;\ntemplate <> constexpr u128 infty<u128> = infty<i128>;\ntemplate <> constexpr double infty<double> = infty<i64>;\ntemplate <> constexpr long double infty<long double> = infty<i64>;\n\nconstexpr int mod = 998244353;\nconstexpr int modu = 1e9 + 7;\nconstexpr long double PI = 3.14159265358979323846;\n\nnamespace kk2 {\n\ntemplate <class T, class... Sizes> auto make_vector(int first, Sizes... sizes) {\n if constexpr (sizeof...(sizes) == 0) {\n return std::vector<T>(first);\n } else {\n return std::vector<decltype(make_vector(sizes...))>(first, make_vector(sizes...));\n }\n}\n\ntemplate <class T, class U> void fill_all(std::vector<T> &v, const U &x) {\n std::fill(std::begin(v), std::end(v), T(x));\n}\n\ntemplate <class T, class U> void fill_all(std::vector<std::vector<T>> &v, const U &x) {\n for (auto &u : v) fill_all(u, x);\n}\n\n} // namespace kk2\n\ntemplate <class T, class S> inline bool chmax(T &a, const S &b) {\n return (a < b ? a = b, 1 : 0);\n}\n\ntemplate <class T, class S> inline bool chmin(T &a, const S &b) {\n return (a > b ? a = b, 1 : 0);\n}\n\nvoid Yes(bool b = 1) {\n std::cout << (b ? \"Yes\\n\" : \"No\\n\");\n}\n\nvoid No(bool b = 1) {\n std::cout << (b ? \"No\\n\" : \"Yes\\n\");\n}\n\nvoid YES(bool b = 1) {\n std::cout << (b ? \"YES\\n\" : \"NO\\n\");\n}\n\nvoid NO(bool b = 1) {\n std::cout << (b ? \"NO\\n\" : \"YES\\n\");\n}\n\nvoid yes(bool b = 1) {\n std::cout << (b ? \"yes\\n\" : \"no\\n\");\n}\n\nvoid no(bool b = 1) {\n std::cout << (b ? \"no\\n\" : \"yes\\n\");\n}\n\n#define rep1(a) for (i64 _ = 0; _ < (i64)(a); ++_)\n#define rep2(i, a) for (i64 i = 0; i < (i64)(a); ++i)\n#define rep3(i, a, b) for (i64 i = (a); i < (i64)(b); ++i)\n#define repi2(i, a) for (i64 i = (a) - 1; i >= 0; --i)\n#define repi3(i, a, b) for (i64 i = (a) - 1; i >= (i64)(b); --i)\n#define overload3(a, b, c, d, ...) d\n#define rep(...) overload3(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__)\n#define repi(...) overload3(__VA_ARGS__, repi3, repi2, rep1)(__VA_ARGS__)\n\n#define fi first\n#define se second\n#define all(p) std::begin(p), std::end(p)\n\nstruct IoSetUp {\n IoSetUp() {\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n }\n} iosetup;\n\ntemplate <class OStream, class T, class U>\nOStream &operator<<(OStream &os, const std::pair<T, U> &p) {\n os << p.first << ' ' << p.second;\n return os;\n}\n\ntemplate <class IStream, class T, class U> IStream &operator>>(IStream &is, std::pair<T, U> &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &v) {\n for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? \"\" : \" \"); }\n return os;\n}\n\ntemplate <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &v) {\n for (auto &x : v) is >> x;\n return is;\n}\n\n#endif // TEMPLATE\n\n// #include \"../../template/template.hpp\"\n\nusing namespace std;\n\nint main() {\n int n, m, k;\n cin >> n >> m >> k;\n vvc<int> J_init, O_init, I_init;\n J_init = O_init = I_init = vvc<int>(n, vc<int>(m));\n rep (i, n) {\n string s;\n cin >> s;\n rep (j, m) {\n if (s[j] == 'J') J_init[i][j] = 1;\n if (s[j] == 'O') O_init[i][j] = 1;\n if (s[j] == 'I') I_init[i][j] = 1;\n }\n }\n\n kk2::PrefixSum2D<int> J_ps(J_init), O_ps(O_init), I_ps(I_init);\n rep (k) {\n int x1, y1, x2, y2;\n cin >> x1 >> y1 >> x2 >> y2;\n --x1, --y1;\n cout << J_ps(x1, y1, x2, y2) << \" \" << O_ps(x1, y1, x2, y2) << \" \" << I_ps(x1, y1, x2, y2) << \"\\n\";\n }\n\n return 0;\n}\n\n// converted!!", "accuracy": 1, "time_ms": 40, "memory_kb": 26432, "score_of_the_acc": -0.2576, "final_rank": 6 }, { "submission_id": "aoj_0560_9121078", "code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n//#include<atcoder/all>\n//using namespace atcoder;\n#define rep(i,n) for(int i=0;i<(int)n;i++)\n#define rep1(i,n) for(int i=1;i<=(int)n;i++)\nusing ll = long long;\nusing ull = unsigned long long;\nusing uint = unsigned int;\nusing P = pair<int, int>;\nusing Pl = pair<ll, ll>;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing vd = vector<double>;\nusing vs = vector<string>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vl = vector<long long>;\nusing vvl = vector<vl>;\nusing vvvl = vector<vvl>;\n#define inf 947483642//int max\n#define linf 900000000000000000\nconst double PI = 3.1415926535897932384626433832795028841971;\ntemplate<typename T>inline bool chmax(T& a, T b) { return ((a < b) ? (a = b, true) : (false)); }\ntemplate<typename T>inline bool chmin(T& a, T b) { return ((a > b) ? (a = b, true) : (false)); }\nlong long llceil(long long a, long long b) { if (a % b == 0) { return a / b; }return (a / b) + 1; }\n#define yes cout<<\"Yes\"<<endl;\n#define no cout<<\"No\"<<endl;\n#define yesno(ans) cout<<(ans?\"Yes\":\"No\")<<endl;\n#define sortu(a) sort(a.begin(),a.end());\n#define sortd(a) sort(a.begin(),a.end(),greater());\n\ntemplate<typename T>\nstruct Cumulativesum2D {\n vector<vector<T>>data;\n\n Cumulativesum2D(int H, int W) :data(H + 1, vector<T>(W + 1, 0)) {}\n void add(int y, int x, T z) {\n ++x, ++y;\n if (y >= data.size() || x >= data[0].size()) return;\n data[y][x] += z;\n \n }\n void show() {\n for (int i = 1; i < data.size(); i++) {\n for (int j = 1; j < data[i].size(); j++) {\n cout << data[i][j] << \" \";\n }\n cout << endl;\n }\n }\n\n void build() {\n for (int i = 1; i < data.size(); i++) {\n for (int j = 1; j < data[i].size(); j++) {\n data[i][j] += data[i][j - 1] + data[i - 1][j] - data[i - 1][j - 1];\n }\n }\n }\n\n T query(int sy, int sx, int gy, int gx)const {\n return (data[gy][gx] - data[gy][sx] - data[sy][gx] + data[sy][sx]);\n }\n\n};\n\nint main() {\n \n int h, w; cin >> h >> w;\n int k; cin >> k;\n Cumulativesum2D<int> Jan(h,w);\n Cumulativesum2D<int> Oce(h,w);\n Cumulativesum2D<int> Ice(h,w);\n vs s(h);\n rep(i, h)cin >> s[i];\n rep(i, h) {\n rep(j, w) {\n if (s[i][j] == 'J') {\n Jan.add(i, j,1);\n }else if (s[i][j] == 'O') {\n Oce.add(i, j,1);\n }else if (s[i][j] == 'I') {\n Ice.add(i, j,1);\n }\n }\n }\n\n\n Jan.build();\n Oce.build();\n Ice.build();\n\\\n rep(i, k) {\n int sy, sx, gy, gx;\n\n cin >> sy >> sx >> gy >> gx;\n sy--, sx--;\n printf(\"%d %d %d\\n\", Jan.query(sy, sx, gy, gx), Oce.query(sy, sx, gy, gx), Ice.query(sy, sx, gy, gx));\n }\n return 0;\n}", "accuracy": 1, "time_ms": 140, "memory_kb": 17076, "score_of_the_acc": -0.714, "final_rank": 14 }, { "submission_id": "aoj_0560_8946965", "code_snippet": "#line 1 \"/opt/library/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'001'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n#define inf infty<ll>\n\nusing pi = pair<ll, ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vector<ll>>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pq = priority_queue<T>;\ntemplate <class T>\nusing pqg = priority_queue<T, vector<T>, greater<T>>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n#define rep1(a) for (ll _ = 0; _ < (ll)(a); ++_)\n#define rep2(i, a) for (ll i = 0; i < (ll)(a); ++i)\n#define rep3(i, a, b) for (ll i = a; i < (ll)(b); ++i)\n#define rep4(i, a, b, c) for (ll i = a; i < (ll)(b); i += (c))\n#define rrep1(a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep2(i, a) for (ll i = (a)-1; i >= (ll)(0); --i)\n#define rrep3(i, a, b) for (ll i = (b)-1; i >= (ll)(a); --i)\n#define rrep4(i, a, b, c) for (ll i = (b)-1; i >= (ll)(a); i -= (c))\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)\n\n#define all(x) (x).begin(),(x).end()\n#define len(x) (ll)(x.size())\n#define elif else if\n#define bit(x, i) (((x)>>(i))&1)\n\n#define eb emplace_back\n#define mp make_pair\n#define mt make_tuple\n#define fi first\n#define se second\n\n#define stoi stoll\n#define abs llabs\n\n#define MIN(v) *min_element(all(v))\n#define MAX(v) *max_element(all(v))\n#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\nll popcnt(ll x) { return __builtin_popcountll(x); }\nll popcnt(u64 x) { return __builtin_popcountll(x); }\nll popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nll popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\nll topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nll lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nll lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate<typename T> T SUM(const vector<T> &A) {\n T s = 0; for (auto &&a: A) s += a;\n return s;\n}\n\ntemplate <typename T>\nT POP(queue<T> &que) {\n T a = que.front();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(deque<T> &que) {\n T a = que.front();\n que.pop_front();\n return a;\n}\ntemplate <typename T>\nT POP(pq<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(pqg<T> &que) {\n T a = que.top();\n que.pop();\n return a;\n}\ntemplate <typename T>\nT POP(vc<T> &que) {\n T a = que.back();\n que.pop_back();\n return a;\n}\n\ntemplate <typename F>\nll binary_search(F check, ll ok, ll ng, bool check_ok = true) {\n if (check_ok) assert(check(ok));\n while (abs(ok - ng) > 1) {\n auto x = (ng + ok) / 2;\n (check(x) ? ok : ng) = x;\n }\n return ok;\n}\ntemplate <typename F>\ndouble binary_search_real(F check, double ok, double ng, ll iter = 100) {\n rep(iter) {\n double x = (ok + ng) / 2;\n (check(x) ? ok : ng) = x;\n }\n return (ok + ng) / 2;\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n rep(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvc<T> cumsum(vc<U> &A, ll off = 1) {\n ll N = A.size();\n vc<T> B(N + 1);\n rep(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\n// stable sort\ntemplate <typename T>\nvi argsort(const vector<T> &A) {\n vi ids(len(A));\n iota(all(ids), 0);\n sort(all(ids),\n [&](ll i, ll j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vi &I) {\n vc<T> B(len(I));\n rep(i, len(I)) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<typename T> inline bool chmax(T &a, T b) {return ((a<b)?(a=b,true):(false));}\ntemplate<typename T> inline bool chmin(T &a, T b) {return ((a>b)?(a=b,true):(false));}\n\ninline void wt(const char c) { cout << c; }\ninline void wt(const string s) { cout << s; }\ninline void wt(const char *s) { cout << s; }\n\ntemplate <typename T>\nvoid wt_integer(T x) {\n if (x < 0) { cout << (i64)(x); }\n else { cout << (u64)(x); }\n}\ntemplate <typename T>\nvoid wt_real(T x) {\n cout << fixed << setprecision(15) << (long double)(x);\n}\n\ninline void wt(int x) { wt_integer(x); }\ninline void wt(ll x) { wt_integer(x); }\ninline void wt(i128 x) { wt_integer(x); }\ninline void wt(u32 x) { wt_integer(x); }\ninline void wt(u64 x) { wt_integer(x); }\ninline void wt(u128 x) { wt_integer(x); }\ninline void wt(double x) { wt_real(x); }\ninline void wt(long double x) { wt_real(x); }\ninline void wt(f128 x) { wt_real(x); }\n\ntemplate <class T, class U>\nvoid wt(const pair<T, U> val) {\n wt(val.first); wt(' '); wt(val.second);\n}\ntemplate <size_t N = 0, typename T>\nvoid wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) { wt(' '); }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T>\nvoid wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S>\nvoid wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T>\nvoid wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i) wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() { wt('\\n'); }\ntemplate <class Head, class... Tail>\nvoid print(Head &&head, Tail &&... tail) {\n wt(head);\n if (sizeof...(Tail)) wt(' ');\n print(forward<Tail>(tail)...);\n}\n\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid no(bool t = 1) { yes(!t); }\nvoid onez(bool t = 1) { print(t ? 1 : 0); }\n#define endl '\\n'\n#define dump(x) {cerr << #x \" = \" << x << '\\n';}\n#line 2 \"main.cpp\"\n\nint solve();\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n while (!solve()) {break;}\n return 0;\n}\n\nint solve() {\n ll M, N, K;\n cin >> M >> N >> K;\n vc<string> r(M);\n rep(i, M) cin >> r[i];\n string JOI=\"JOI\";\n vvv(ll, s, len(JOI), M, N, 0);\n rep(k, len(JOI)) {\n rep(i, M) rep(j, N) {\n if (JOI[k] == r[i][j]) s[k][i][j]++;\n }\n }\n rep(k, len(JOI)) {\n rep(i, 1, M) {\n rep(j, N) {\n s[k][i][j] += s[k][i-1][j];\n }\n }\n rep(i, M) {\n rep(j, 1, N) {\n s[k][i][j] += s[k][i][j-1];\n }\n }\n }\n rep(K) {\n ll a, b, c, d;\n cin >> a >> b >> c >> d;\n a--; b--; c--; d--;\n vi ans(3, 0);\n rep(k, len(JOI)) {\n ans[k] = s[k][c][d];\n if (a >= 1) ans[k] -= s[k][a-1][d];\n if (b >= 1) ans[k] -= s[k][c][b-1];\n if ((a >= 1) and (b >= 1)) ans[k] += s[k][a-1][b-1];\n }\n print(ans);\n }\n return 0;\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 35144, "score_of_the_acc": -0.5201, "final_rank": 11 }, { "submission_id": "aoj_0560_8130793", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\n\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n \n ll M,N,K;\n cin>>M>>N>>K;\n vvvll D(3,vvll(M+1,vll(N+1,0)));\n rep(i,M){\n string S;\n cin>>S;\n rep(j,N){\n if(S[j]=='J')D[0][i+1][j+1]++;\n else if(S[j]=='O')D[1][i+1][j+1]++;\n else if(S[j]=='I')D[2][i+1][j+1]++;\n }\n }\n rep(k,3){\n rep(m,M)rep(n,N+1)D[k][m+1][n]+=D[k][m][n];\n rep(m,M+1)rep(n,N)D[k][m][n+1]+=D[k][m][n];\n }\n rep(k,K){\n ll A,B,C,DD;\n cin>>A>>B>>C>>DD;\n A--;B--;\n rep(i,3){\n cout<<D[i][C][DD]+D[i][A][B]-D[i][C][B]-D[i][A][DD]<<\" \\n\"[i==2];\n }\n }\n\n}", "accuracy": 1, "time_ms": 50, "memory_kb": 34228, "score_of_the_acc": -0.4995, "final_rank": 10 }, { "submission_id": "aoj_0560_8019598", "code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define endl \"\\n\"\n#define all(v) v.begin(), v.end()\n#define rep(i, begin, end) for(auto i = (begin); i < (end); i++)\n#define rrep(i, end, begin) for(auto i = (end) - 1; i >= (begin); i--)\ntemplate<class T> inline bool chmin(T& a, T b){ if (a > b){ a = b; return true; } return false; }\ntemplate<class T> inline bool chmax(T& a, T b){ if (a < b){ a = b; return true; } return false; }\ntemplate<class T> inline T roundup(T a, T b){ return (a + b - 1) / b; }\nconstexpr int dy[] = {0, 1, 0, -1, 1, 1, -1, -1, 0};\nconstexpr int dx[] = {1, 0, -1, 0, 1, -1, 1, -1, 0};\nusing ll = long long;\nconstexpr ll INF = 1e9;\nstruct Edge{ int to; ll cost; Edge(int to, ll cost) : to(to), cost(cost) {} };\nusing Graph = vector<vector<int>>;\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n \n int n, m, k;\n cin >> n >> m >> k;\n vector info(n, vector(m, '#'));\n rep(i, 0, n) rep(j, 0, m) cin >> info[i][j];\n \n vector sum_j(vector(n, vector(m, 0)));\n vector sum_o(vector(n, vector(m, 0)));\n vector sum_i(vector(n, vector(m, 0)));\n rep(i, 0, n) rep(j, 0, m){\n sum_j[i][j] = info[i][j] == 'J';\n if(i > 0) sum_j[i][j] += sum_j[i-1][j];\n if(j > 0) sum_j[i][j] += sum_j[i][j-1];\n if(i > 0 && j > 0) sum_j[i][j] -= sum_j[i-1][j-1];\n }\n rep(i, 0, n) rep(j, 0, m){\n sum_o[i][j] = info[i][j] == 'O';\n if(i > 0) sum_o[i][j] += sum_o[i-1][j];\n if(j > 0) sum_o[i][j] += sum_o[i][j-1];\n if(i > 0 && j > 0) sum_o[i][j] -= sum_o[i-1][j-1];\n }\n rep(i, 0, n) rep(j, 0, m){\n sum_i[i][j] = info[i][j] == 'I';\n if(i > 0) sum_i[i][j] += sum_i[i-1][j];\n if(j > 0) sum_i[i][j] += sum_i[i][j-1];\n if(i > 0 && j > 0) sum_i[i][j] -= sum_i[i-1][j-1];\n }\n \n auto sum = [](int a, int b, int c, int d, const vector<vector<int>>& sum){\n return sum[c][d] - (b > 0 ? sum[c][b-1] : 0) - (a > 0 ? sum[a-1][d] : 0) + (a > 0 && b > 0 ? sum[a-1][b-1] : 0);\n };\n \n while(k--){\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n a--, b--, c--, d--;\n \n cout << sum(a, b, c, d, sum_j) << \" \"\n << sum(a, b, c, d, sum_o) << \" \"\n << sum(a, b, c, d, sum_i) << endl;\n }\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 15656, "score_of_the_acc": -0.0155, "final_rank": 1 }, { "submission_id": "aoj_0560_7561881", "code_snippet": "#include <iostream>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <algorithm>\n#include <utility>\n#include <tuple>\n#include <cstdint>\n#include <cstdio>\n#include <map>\n#include <queue>\n#include <set>\n#include <stack>\n#include <deque>\n#include <unordered_map>\n#include <unordered_set>\n#include <bitset>\n#include <cctype>\n#include <climits>\n#include <functional>\n#include <cassert>\n#include <numeric>\n#define rep(i, n) for(int i = 0; i < (n); i++)\n#define per(i, n) for(int i = (n) - 1; i >= 0; i--)\nusing ll = long long;\n#define vi vector<int>\n#define vvi vector<vi>\n#define vl vector<ll>\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define all(a) (a).begin(), (a).end()\n#define rall(a) (a).rbegin(), (a).rend()\nconstexpr int mod = 1000000007;\nusing namespace std;\ntemplate<class T, class U>\nbool chmax(T &a, const U &b){ return a < b ? (a = b, 1) : 0; }\ntemplate<class T, class U>\nbool chmin(T &a, const U &b){ return a > b ? (a = b, 1) : 0; }\ntemplate <class T>\nstruct CumulativeSum2D {\n CumulativeSum2D(const int h, const int w) : h(h), w(w), a(h+1, vector<T>(w+1)){}\n CumulativeSum2D(const vector<vector<T>> &v) : h(v.size()), w(v[0].size()), a(h+1, vector<T>(w+1)){\n for(int i = 0; i < h; i++)\n for(int j = 0; j < w; j++) a[i + 1][j + 1] = v[i][j];\n }\n void set(const int i, const int j, const T x){\n assert(0 <= i && i < h);\n assert(0 <= j && j < w);\n a[i + 1][j + 1] += x;\n }\n void build(){\n for(int i = 0; i < h; i++)\n for(int j = 0; j < w; j++)\n a[i + 1][j + 1] += a[i + 1][j] + a[i][j + 1] - a[i][j];\n }\n T query(const int ly, const int lx, const int ry, const int rx) const{\n assert(0 <= ly && ly <= ry && ry <= h);\n assert(0 <= lx && lx <= rx && rx <= w);\n return a[ry][rx] - a[ry][lx] - a[ly][rx] + a[ly][lx];\n }\n private:\n int h, w;\n vector<vector<T>> a;\n};\nconst string t = \"JOI\";\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int n,m,K;\n cin >> n >> m >> K;\n vector<CumulativeSum2D<int>> cnt(3, CumulativeSum2D<int>(n, m));\n rep(i, n){\n string s; cin >> s;\n rep(j, m){\n rep(k, 3) if(s[j] == t[k]){\n cnt[k].set(i, j, 1);\n break;\n }\n }\n }\n rep(i, 3) cnt[i].build();\n rep(_, K){\n int a,b,c,d;\n cin >> a >> b >> c >> d;\n a--; b--;\n rep(i, 3) cout << cnt[i].query(a, b, c, d) << \" \\n\"[i == 2];\n }\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 18660, "score_of_the_acc": -0.083, "final_rank": 4 }, { "submission_id": "aoj_0560_6856940", "code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <cmath>\n\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define REP(i, a, b) for (int i = a; i < b; i++)\n\n\nint main(){\n int M,N; cin >> M >> N;\n int K; cin >> K;\n vector<string> planet(M); rep(i,M) cin >> planet[i];\n\n vector<vector<int> > accumJ(M+1, vector<int>(N+1));\n vector<vector<int> > accumO(M+1, vector<int>(N+1));\n vector<vector<int> > accumI(M+1, vector<int>(N+1));\n\n rep(i,M)\n rep(j,N){\n accumJ[i+1][j+1] = accumJ[i][j+1] + accumJ[i+1][j] - accumJ[i][j];\n accumO[i+1][j+1] = accumO[i][j+1] + accumO[i+1][j] - accumO[i][j];\n accumI[i+1][j+1] = accumI[i][j+1] + accumI[i+1][j] - accumI[i][j];\n\n if(planet[i][j] == 'J') accumJ[i+1][j+1]++;\n else if(planet[i][j] == 'O') accumO[i+1][j+1]++;\n else accumI[i+1][j+1]++;\n }\n\n rep(i,K){\n int a,b,c,d; cin >> a >> b >> c >> d;\n a--; b--;\n cout << accumJ[c][d] - accumJ[a][d] - accumJ[c][b] + accumJ[a][b] << \" \";\n cout << accumO[c][d] - accumO[a][d] - accumO[c][b] + accumO[a][b] << \" \";\n cout << accumI[c][d] - accumI[a][d] - accumI[c][b] + accumI[a][b] << endl;\n }\n\n}", "accuracy": 1, "time_ms": 190, "memory_kb": 15492, "score_of_the_acc": -1.0118, "final_rank": 18 }, { "submission_id": "aoj_0560_6799357", "code_snippet": "#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n// #include <atcoder/modint>\n// #include <atcoder/fenwicktree>\n// #include <atcoder/segtree>\n// #include <atcoder/scc>\n\n#define int long long\n#define all(x) begin(x), end(x)\n\nusing namespace std;\n// using namespace atcoder;\n// using mint = modint998244353;\n// using mint = modint1000000007;\nusing ld = long double;\nusing pii = pair<int, int>;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing vp = vector<pii>;\nusing vvp = vector<vp>;\nusing vs = vector<string>;\nusing vvc = vector<vector<char>>;\n\nvoid debug(vector<int> a) {\n for (auto x : a) cout << x << ' ';\n cout << endl;\n}\n\nvoid debug(vector<vector<int>> a) {\n for (auto y : a) debug(y);\n}\n\ntemplate <typename T1, typename T2>\ninline bool chmax(T1 &a, T2 b) {return a < b and (a = b, true);}\n\ntemplate <typename T1, typename T2>\ninline bool chmin(T1 &a, T2 b) {return a > b and (a = b, true);}\n\nconst int supl = LONG_LONG_MAX - 100;\n\nvoid main_() {\n int h, w; cin >> h >> w;\n int q; cin >> q;\n vvi js(h, vi(w)), os(h, vi(w)), is(h, vi(w));\n \n for (int i = 0 ; i < h ; i++) for (int j = 0 ; j < w ; j++) {\n char c; cin >> c;\n if (c == 'J') js[i][j] = 1;\n if (c == 'O') os[i][j] = 1;\n if (c == 'I') is[i][j] = 1;\n }\n \n auto mkacum = [&](vvi& a) -> vvi {\n vvi res(h + 1, vi(w + 1));\n for (int i = 0 ; i < h ; i++) for (int j = 0 ; j < w ; j++) {\n res[i + 1][j + 1] = res[i][j + 1] + res[i + 1][j] - res[i][j] + a[i][j];\n }\n\n return res;\n };\n\n\n auto jacum = mkacum(js), iacum = mkacum(is), oacum = mkacum(os);\n\n // debug(jacum);\n\n auto query = [](vvi& s, int a, int b, int c, int d) -> int {\n return s[c][d] - s[a - 1][d] - s[c][b - 1] + s[a - 1][b - 1];\n };\n\n for (int _ = 0 ; _ < q ; _++) {\n int a, b, c, d; cin >> a >> b >> c >> d;\n cout << query(jacum, a, b, c, d) << ' ' << query(oacum, a, b, c, d) << ' ' << query(iacum, a, b, c, d) << endl;\n };\n}\n\nsigned main() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n\n main_();\n\n return 0;\n}", "accuracy": 1, "time_ms": 120, "memory_kb": 49788, "score_of_the_acc": -1.3158, "final_rank": 20 }, { "submission_id": "aoj_0560_6781392", "code_snippet": "#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <cstddef>\n#include <cstdint>\n#include <cstdlib>\n#include <cstring>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <memory>\n#include <numeric>\n#include <optional>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\n\n/* macro */\n\n#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)\n#define rrep(i, a, n) for (int i = ((int)(n - 1)); i >= (int)(a); i--)\n#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)\n#define RRep(i, a, n) for (i64 i = ((i64)(n - i64(1))); i >= (i64)(a); i--)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define Bit(n) (1LL << (n))\n\n/* macro end */\n\n/* template */\n\nnamespace ebi {\n\n#ifdef LOCAL\n#define debug(...) \\\n std::cerr << \"LINE: \" << __LINE__ << \" [\" << #__VA_ARGS__ << \"]:\", \\\n debug_out(__VA_ARGS__)\n#else\n#define debug(...)\n#endif\n\nvoid debug_out() { std::cerr << std::endl; }\n\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head h, Tail... t) {\n std::cerr << \" \" << h;\n if (sizeof...(t) > 0) std::cout << \" :\";\n debug_out(t...);\n}\n\ntemplate <typename T1, typename T2>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {\n return os << pa.first << \" \" << pa.second;\n}\n\ntemplate <typename T1, typename T2>\nstd::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {\n return os >> pa.first >> pa.second;\n}\n\ntemplate <typename T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {\n for (std::size_t i = 0; i < vec.size(); i++)\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \" \");\n return os;\n}\n\ntemplate <typename T>\nstd::istream &operator>>(std::istream &os, std::vector<T> &vec) {\n for (T &e : vec) std::cin >> e;\n return os;\n}\n\ntemplate <typename T>\nstd::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {\n if (opt) {\n os << opt.value();\n } else {\n os << \"invalid value\";\n }\n return os;\n}\n\nusing std::size_t;\nusing i32 = std::int32_t;\nusing u32 = std::uint32_t;\nusing i64 = std::int64_t;\nusing u64 = std::uint64_t;\n\ntemplate <class T, T init>\nauto make_vector(int n) {\n return std::vector<T>(n, init);\n}\n\ntemplate <class T, T init, typename Head, typename... Tail>\nauto make_vector(Head n, Tail... ts) {\n return std::vector(n, make_vector<T, init>(ts...));\n}\n\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n\ntemplate <class T>\nT pow(T x, i64 n) {\n T res = 1;\n while (n > 0) {\n if (n & 1) res = res * x;\n x = x * x;\n n >>= 1;\n }\n return res;\n}\n\ntemplate <class T>\nT mod_pow(T x, i64 n, i64 mod) {\n T res = 1;\n while (n > 0) {\n if (n & 1) res = (res * x) % mod;\n x = (x * x) % mod;\n n >>= 1;\n }\n return res;\n}\n\ntemplate <class T>\nT scan() {\n T val;\n std::cin >> val;\n return val;\n}\n\ntemplate <class T>\nstruct Edge {\n int to;\n T cost;\n Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {}\n};\n\ntemplate <class T>\nstruct Graph : std::vector<std::vector<Edge<T>>> {\n using std::vector<std::vector<Edge<T>>>::vector;\n void add_edge(int u, int v, T w, bool directed = false) {\n (*this)[u].emplace_back(v, w);\n if (directed) return;\n (*this)[v].emplace_back(u, w);\n }\n};\n\nstruct graph : std::vector<std::vector<int>> {\n using std::vector<std::vector<int>>::vector;\n void add_edge(int u, int v, bool directed = false) {\n (*this)[u].emplace_back(v);\n if (directed) return;\n (*this)[v].emplace_back(u);\n }\n};\n\nconstexpr i64 LNF = std::numeric_limits<i64>::max() / 4;\n\nconstexpr int INF = std::numeric_limits<int>::max() / 2;\n\nconst std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};\nconst std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};\n\n} // namespace ebi\n\ntemplate <class T>\nstruct CumulativeSum2D {\n std::vector<std::vector<T>> data;\n\n CumulativeSum2D(int W, int H) : data(W + 1, std::vector<T>(H + 1, 0)) {}\n\n void add(int x, int y, int z) {\n ++x, ++y;\n if (x >= data.size() || y >= data[0].size()) return;\n data[x][y] += z;\n }\n\n void build() {\n for (int i = 1; i < (int)data.size(); i++) {\n for (int j = 1; j < data[i].size(); j++) {\n data[i][j] +=\n data[i][j - 1] + data[i - 1][j] - data[i - 1][j - 1];\n }\n }\n }\n\n T query(int sx, int sy, int gx, int gy) {\n return (data[gx][gy] - data[sx][gy] - data[gx][sy] + data[sx][sy]);\n }\n};\n\nnamespace ebi {\n\nvoid main_() {\n int m, n, k;\n std::cin >> m >> n >> k;\n std::vector<std::string> s(m);\n std::cin >> s;\n CumulativeSum2D<int> sumj(m, n), sumo(m, n), sumi(m, n);\n rep(i,0,m) {\n rep(j,0,n) {\n if(s[i][j] == 'J') {\n sumj.add(i, j, 1);\n }\n else if(s[i][j] == 'O') {\n sumo.add(i, j, 1);\n }\n else {\n sumi.add(i, j, 1);\n }\n }\n }\n sumj.build();\n sumo.build();\n sumi.build();\n while(k--) {\n int a,b,c,d;\n std::cin >> a >> b >> c >> d;\n a--; b--;\n std::cout << sumj.query(a, b, c, d) << \" \" << sumo.query(a, b, c, d) << \" \" << sumi.query(a, b, c, d) << '\\n';\n }\n}\n\n} // namespace ebi\n\nint main() {\n std::cout << std::fixed << std::setprecision(15);\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n int t = 1;\n // std::cin >> t;\n while (t--) {\n ebi::main_();\n }\n return 0;\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 15844, "score_of_the_acc": -0.0197, "final_rank": 2 }, { "submission_id": "aoj_0560_6698298", "code_snippet": "// \n\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\n#define rep(i, n) for (int i=0; i<(int)(n); ++(i))\n#define rep3(i, m, n) for (int i=(m); (i)<(int)(n); ++(i))\n#define repr(i, n) for (int i=(int)(n)-1; (i)>=0; --(i))\n#define rep3r(i, m, n) for (int i=(int)(n)-1; (i)>=(int)(m); --(i))\n#define all(x) (x).begin(), (x).end()\n\nconst int INF = (int)(1e9);\nconst string tar = \"JOI\";\n\ntemplate<typename T>\nstruct BIT {\n\tint m, n;\n\tvector<vector<T>> d;\n\tBIT(int m=0, int n=0) : m(m), n(n), d(m+1, vector<T>(n+1)) {}\n\tvoid add(int i, int j, T x=1) {\n\t\tfor (i++; i<=m; i+=i&-i) {\n\t\t\tint tj = j;\n\t\t\tfor (tj++; tj<=n; tj+=tj&-tj) d[i][tj] += x;\n\t\t}\n\t}\n\tT sum(int i, int j) {\n\t\tT x = 0;\n\t\tfor (i++; i; i-=i&-i) {\n\t\t\tint tj = j;\n\t\t\tfor (tj++; tj; tj-=tj&-tj) x += d[i][tj];\n\t\t}\n\t\treturn x;\n\t}\n\tT sum(int u, int l, int d, int r) {\n\t\treturn sum(d-1, r-1) - sum(u-1, r-1) - sum(d-1, l-1) + sum(u-1, l-1);\n\t}\n};\n\nint main() {\n\tint m, n, k;\n\tcin >> m >> n >> k;\n\tvector<string> s(m);\n\trep(i, m) cin >> s[i];\n\tvector<int> a(k), b(k), c(k), d(k);\n\trep(i, k) {\n\t\tcin >> a[i] >> b[i] >> c[i] >> d[i];\n\t\ta[i]--; b[i]--;\n\t}\n\tvector<BIT<int>> scnt(3, BIT<int>(m, n));\n\trep(i, m) rep(j, n) rep(i2, 3) if (s[i][j] == tar[i2]) scnt[i2].add(i, j, 1);\n\trep(i, k) rep(j, 3) cout << scnt[j].sum(a[i], b[i], c[i], d[i]) << (j<2?' ':'\\n');\n\treturn 0;\n}", "accuracy": 1, "time_ms": 120, "memory_kb": 21992, "score_of_the_acc": -0.6912, "final_rank": 13 }, { "submission_id": "aoj_0560_6698214", "code_snippet": "// \n\n#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\n#define rep(i, n) for (int i=0; i<(int)(n); ++(i))\n#define rep3(i, m, n) for (int i=(m); (i)<(int)(n); ++(i))\n#define repr(i, n) for (int i=(int)(n)-1; (i)>=0; --(i))\n#define rep3r(i, m, n) for (int i=(int)(n)-1; (i)>=(int)(m); --(i))\n#define all(x) (x).begin(), (x).end()\n\nconst int INF = (int)(1e9);\nconst string tar = \"JOI\";\n\nint main() {\n\tint m, n, k;\n\tcin >> m >> n >> k;\n\tvector<string> s(m);\n\trep(i, m) cin >> s[i];\n\tvector<int> a(k), b(k), c(k), d(k);\n\trep(i, k) {\n\t\tcin >> a[i] >> b[i] >> c[i] >> d[i];\n\t\ta[i]--; b[i]--;\n\t}\n\tvector<vector<vector<int>>> ccnt(3, vector<vector<int>>(m+1, vector<int>(n+1)));\n\trep(i, m) rep(j, n) rep(i2, 3) {\n\t\tint val = s[i][j] == tar[i2] ? 1 : 0;\n\t\tccnt[i2][i+1][j+1] = ccnt[i2][i][j+1] + ccnt[i2][i+1][j] - ccnt[i2][i][j] + val;\n\t}\n\trep(i, k) rep(j, 3) cout << (ccnt[j][c[i]][d[i]]-ccnt[j][a[i]][d[i]]-ccnt[j][c[i]][b[i]]+ccnt[j][a[i]][b[i]]) << (j<2?' ':'\\n');\n\treturn 0;\n}", "accuracy": 1, "time_ms": 70, "memory_kb": 22084, "score_of_the_acc": -0.3599, "final_rank": 8 }, { "submission_id": "aoj_0560_6670572", "code_snippet": "// 二次元累積和\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing VI = vector<int>;\nusing VVI = vector<vector<int>>;\n\nint main() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n int m, n, k;\n cin >> m >> n;\n cin >> k;\n\n VVI j(m + 1, VI(n + 1, 0));\n VVI o(m + 1, VI(n + 1, 0));\n VVI i(m + 1, VI(n + 1, 0));\n\n for (int r = 1; r <= m; ++r) {\n string s;\n cin >> s;\n s = '0' + s;\n for (int c = 1; c <= n; ++c) {\n j[r][c] = j[r - 1][c] + j[r][c - 1] - j[r - 1][c - 1];\n o[r][c] = o[r - 1][c] + o[r][c - 1] - o[r - 1][c - 1];\n i[r][c] = i[r - 1][c] + i[r][c - 1] - i[r - 1][c - 1];\n if (s[c] == 'J')\n ++j[r][c];\n else if (s[c] == 'O')\n ++o[r][c];\n else\n ++i[r][c];\n }\n }\n\n while (k--) {\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n int j_cnt = j[c][d] - j[a - 1][d] - j[c][b - 1] + j[a - 1][b - 1];\n int o_cnt = o[c][d] - o[a - 1][d] - o[c][b - 1] + o[a - 1][b - 1];\n int i_cnt = i[c][d] - i[a - 1][d] - i[c][b - 1] + i[a - 1][b - 1];\n cout << j_cnt << \" \" << o_cnt << \" \" << i_cnt << endl;\n }\n return 0;\n}", "accuracy": 1, "time_ms": 100, "memory_kb": 15096, "score_of_the_acc": -0.4029, "final_rank": 9 }, { "submission_id": "aoj_0560_6444688", "code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nusing int64 = long long;\nconst int mod = 1e9 + 7;\n\nconst int64 infll = (1LL << 62) - 1;\nconst int inf = (1 << 30) - 1;\n\nstruct IoSetup {\n IoSetup() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(10);\n cerr << fixed << setprecision(10);\n }\n} iosetup;\n\ntemplate< typename T1, typename T2 >\nostream &operator<<(ostream &os, const pair< T1, T2 >& p) {\n os << p.first << \" \" << p.second;\n return os;\n}\n\ntemplate< typename T1, typename T2 >\nistream &operator>>(istream &is, pair< T1, T2 > &p) {\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate< typename T >\nostream &operator<<(ostream &os, const vector< T > &v) {\n for(int i = 0; i < (int) v.size(); i++) {\n os << v[i] << (i + 1 != v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate< typename T >\nistream &operator>>(istream &is, vector< T > &v) {\n for(T &in : v) is >> in;\n return is;\n}\n\ntemplate< typename T1, typename T2 >\ninline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }\n\ntemplate< typename T1, typename T2 >\ninline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }\n\ntemplate< typename T = int64 >\nvector< T > make_v(size_t a) {\n return vector< T >(a);\n}\n\ntemplate< typename T, typename... Ts >\nauto make_v(size_t a, Ts... ts) {\n return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {\n t = v;\n}\n\ntemplate< typename T, typename V >\ntypename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {\n for(auto &e : t) fill_v(e, v);\n}\n\ntemplate< typename F >\nstruct FixPoint : F {\n explicit FixPoint(F &&f) : F(forward< F >(f)) {}\n\n template< typename... Args >\n decltype(auto) operator()(Args &&... args) const {\n return F::operator()(*this, forward< Args >(args)...);\n }\n};\n \ntemplate< typename F >\ninline decltype(auto) MFP(F &&f) {\n return FixPoint< F >{forward< F >(f)};\n}\ntemplate< class T >\nstruct CumulativeSum2D {\n vector< vector< T > > data;\n\n CumulativeSum2D(int W, int H) : data(W + 1, vector< T >(H + 1, 0)) {}\n\n void add(int x, int y, T z) {\n ++x, ++y;\n if(x >= data.size() || y >= data[0].size()) return;\n data[x][y] += z;\n }\n\n void build() {\n for(int i = 1; i < data.size(); i++) {\n for(int j = 1; j < data[i].size(); j++) {\n data[i][j] += data[i][j - 1] + data[i - 1][j] - data[i - 1][j - 1];\n }\n }\n }\n\n T query(int sx, int sy, int gx, int gy) const {\n return (data[gx][gy] - data[sx][gy] - data[gx][sy] + data[sx][sy]);\n }\n};\n\nint main() {\n int N, M, Q;\n cin >> N >> M >> Q;\n vector< CumulativeSum2D< int > > sum(3, CumulativeSum2D< int >(N, M));\n const string P = \"JOI\";\n for(int i = 0; i < N; i++) {\n string s;\n cin >> s;\n for(int j = 0; j < M; j++) {\n for(int k = 0; k < 3; k++) {\n sum[k].add(i, j, s[j] == P[k]);\n }\n }\n }\n for(int k = 0; k < 3; k++) {\n sum[k].build();\n }\n while(Q--) {\n int a, b, c, d;\n cin >> a >> b >> c >> d;\n --a, --b;\n vector< int > v(3);\n for(int k = 0; k < 3; k++) {\n v[k] = sum[k].query(a, b, c, d);\n }\n cout << v << \"\\n\";\n }\n\n}", "accuracy": 1, "time_ms": 40, "memory_kb": 18492, "score_of_the_acc": -0.0792, "final_rank": 3 } ]